1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 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 int convert_arguments (int, tree *, 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_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 /* Recursive call does not count as usage. */
2094 if (ref != current_function_decl)
2096 if (!skip_evaluation)
2097 assemble_external (ref);
2098 TREE_USED (ref) = 1;
2101 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2103 if (!in_sizeof && !in_typeof)
2104 C_DECL_USED (ref) = 1;
2105 else if (DECL_INITIAL (ref) == 0
2106 && DECL_EXTERNAL (ref)
2107 && !TREE_PUBLIC (ref))
2108 record_maybe_used_decl (ref);
2111 if (TREE_CODE (ref) == CONST_DECL)
2113 used_types_insert (TREE_TYPE (ref));
2114 ref = DECL_INITIAL (ref);
2115 TREE_CONSTANT (ref) = 1;
2116 TREE_INVARIANT (ref) = 1;
2118 else if (current_function_decl != 0
2119 && !DECL_FILE_SCOPE_P (current_function_decl)
2120 && (TREE_CODE (ref) == VAR_DECL
2121 || TREE_CODE (ref) == PARM_DECL
2122 || TREE_CODE (ref) == FUNCTION_DECL))
2124 tree context = decl_function_context (ref);
2126 if (context != 0 && context != current_function_decl)
2127 DECL_NONLOCAL (ref) = 1;
2129 /* C99 6.7.4p3: An inline definition of a function with external
2130 linkage ... shall not contain a reference to an identifier with
2131 internal linkage. */
2132 else if (current_function_decl != 0
2133 && DECL_DECLARED_INLINE_P (current_function_decl)
2134 && DECL_EXTERNAL (current_function_decl)
2135 && VAR_OR_FUNCTION_DECL_P (ref)
2136 && (TREE_CODE (ref) != VAR_DECL || TREE_STATIC (ref))
2137 && ! TREE_PUBLIC (ref))
2138 pedwarn ("%H%qD is static but used in inline function %qD "
2139 "which is not static", &loc, ref, current_function_decl);
2144 /* Record details of decls possibly used inside sizeof or typeof. */
2145 struct maybe_used_decl
2149 /* The level seen at (in_sizeof + in_typeof). */
2151 /* The next one at this level or above, or NULL. */
2152 struct maybe_used_decl *next;
2155 static struct maybe_used_decl *maybe_used_decls;
2157 /* Record that DECL, an undefined static function reference seen
2158 inside sizeof or typeof, might be used if the operand of sizeof is
2159 a VLA type or the operand of typeof is a variably modified
2163 record_maybe_used_decl (tree decl)
2165 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2167 t->level = in_sizeof + in_typeof;
2168 t->next = maybe_used_decls;
2169 maybe_used_decls = t;
2172 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2173 USED is false, just discard them. If it is true, mark them used
2174 (if no longer inside sizeof or typeof) or move them to the next
2175 level up (if still inside sizeof or typeof). */
2178 pop_maybe_used (bool used)
2180 struct maybe_used_decl *p = maybe_used_decls;
2181 int cur_level = in_sizeof + in_typeof;
2182 while (p && p->level > cur_level)
2187 C_DECL_USED (p->decl) = 1;
2189 p->level = cur_level;
2193 if (!used || cur_level == 0)
2194 maybe_used_decls = p;
2197 /* Return the result of sizeof applied to EXPR. */
2200 c_expr_sizeof_expr (struct c_expr expr)
2203 if (expr.value == error_mark_node)
2205 ret.value = error_mark_node;
2206 ret.original_code = ERROR_MARK;
2207 pop_maybe_used (false);
2211 ret.value = c_sizeof (TREE_TYPE (expr.value));
2212 ret.original_code = ERROR_MARK;
2213 if (c_vla_type_p (TREE_TYPE (expr.value)))
2215 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2216 ret.value = build2 (COMPOUND_EXPR, TREE_TYPE (ret.value), expr.value, ret.value);
2218 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2223 /* Return the result of sizeof applied to T, a structure for the type
2224 name passed to sizeof (rather than the type itself). */
2227 c_expr_sizeof_type (struct c_type_name *t)
2231 type = groktypename (t);
2232 ret.value = c_sizeof (type);
2233 ret.original_code = ERROR_MARK;
2234 pop_maybe_used (type != error_mark_node
2235 ? C_TYPE_VARIABLE_SIZE (type) : false);
2239 /* Build a function call to function FUNCTION with parameters PARAMS.
2240 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2241 TREE_VALUE of each node is a parameter-expression.
2242 FUNCTION's data type may be a function type or a pointer-to-function. */
2245 build_function_call (tree function, tree params)
2247 tree fntype, fundecl = 0;
2248 tree name = NULL_TREE, result;
2254 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2255 STRIP_TYPE_NOPS (function);
2257 /* Convert anything with function type to a pointer-to-function. */
2258 if (TREE_CODE (function) == FUNCTION_DECL)
2260 /* Implement type-directed function overloading for builtins.
2261 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2262 handle all the type checking. The result is a complete expression
2263 that implements this function call. */
2264 tem = resolve_overloaded_builtin (function, params);
2268 name = DECL_NAME (function);
2271 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2272 function = function_to_pointer_conversion (function);
2274 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2275 expressions, like those used for ObjC messenger dispatches. */
2276 function = objc_rewrite_function_call (function, params);
2278 fntype = TREE_TYPE (function);
2280 if (TREE_CODE (fntype) == ERROR_MARK)
2281 return error_mark_node;
2283 if (!(TREE_CODE (fntype) == POINTER_TYPE
2284 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2286 error ("called object %qE is not a function", function);
2287 return error_mark_node;
2290 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2291 current_function_returns_abnormally = 1;
2293 /* fntype now gets the type of function pointed to. */
2294 fntype = TREE_TYPE (fntype);
2296 /* Check that the function is called through a compatible prototype.
2297 If it is not, replace the call by a trap, wrapped up in a compound
2298 expression if necessary. This has the nice side-effect to prevent
2299 the tree-inliner from generating invalid assignment trees which may
2300 blow up in the RTL expander later. */
2301 if ((TREE_CODE (function) == NOP_EXPR
2302 || TREE_CODE (function) == CONVERT_EXPR)
2303 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2304 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2305 && !comptypes (fntype, TREE_TYPE (tem)))
2307 tree return_type = TREE_TYPE (fntype);
2308 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2311 /* This situation leads to run-time undefined behavior. We can't,
2312 therefore, simply error unless we can prove that all possible
2313 executions of the program must execute the code. */
2314 warning (0, "function called through a non-compatible type");
2316 /* We can, however, treat "undefined" any way we please.
2317 Call abort to encourage the user to fix the program. */
2318 inform ("if this code is reached, the program will abort");
2320 if (VOID_TYPE_P (return_type))
2326 if (AGGREGATE_TYPE_P (return_type))
2327 rhs = build_compound_literal (return_type,
2328 build_constructor (return_type, 0));
2330 rhs = fold_convert (return_type, integer_zero_node);
2332 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2336 /* Convert the parameters to the types declared in the
2337 function prototype, or apply default promotions. */
2339 nargs = list_length (params);
2340 argarray = (tree *) alloca (nargs * sizeof (tree));
2341 nargs = convert_arguments (nargs, argarray, TYPE_ARG_TYPES (fntype),
2342 params, function, fundecl);
2344 return error_mark_node;
2346 /* Check that the arguments to the function are valid. */
2348 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2349 TYPE_ARG_TYPES (fntype));
2351 if (require_constant_value)
2353 result = fold_build_call_array_initializer (TREE_TYPE (fntype),
2354 function, nargs, argarray);
2355 if (TREE_CONSTANT (result)
2356 && (name == NULL_TREE
2357 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2358 pedwarn_init ("initializer element is not constant");
2361 result = fold_build_call_array (TREE_TYPE (fntype),
2362 function, nargs, argarray);
2364 if (VOID_TYPE_P (TREE_TYPE (result)))
2366 return require_complete_type (result);
2369 /* Convert the argument expressions in the list VALUES
2370 to the types in the list TYPELIST. The resulting arguments are
2371 stored in the array ARGARRAY which has size NARGS.
2373 If TYPELIST is exhausted, or when an element has NULL as its type,
2374 perform the default conversions.
2376 PARMLIST is the chain of parm decls for the function being called.
2377 It may be 0, if that info is not available.
2378 It is used only for generating error messages.
2380 FUNCTION is a tree for the called function. It is used only for
2381 error messages, where it is formatted with %qE.
2383 This is also where warnings about wrong number of args are generated.
2385 VALUES is a chain of TREE_LIST nodes with the elements of the list
2386 in the TREE_VALUE slots of those nodes.
2388 Returns the actual number of arguments processed (which may be less
2389 than NARGS in some error situations), or -1 on failure. */
2392 convert_arguments (int nargs, tree *argarray,
2393 tree typelist, tree values, tree function, tree fundecl)
2395 tree typetail, valtail;
2399 /* Change pointer to function to the function itself for
2401 if (TREE_CODE (function) == ADDR_EXPR
2402 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2403 function = TREE_OPERAND (function, 0);
2405 /* Handle an ObjC selector specially for diagnostics. */
2406 selector = objc_message_selector ();
2408 /* Scan the given expressions and types, producing individual
2409 converted arguments and storing them in ARGARRAY. */
2411 for (valtail = values, typetail = typelist, parmnum = 0;
2413 valtail = TREE_CHAIN (valtail), parmnum++)
2415 tree type = typetail ? TREE_VALUE (typetail) : 0;
2416 tree val = TREE_VALUE (valtail);
2417 tree rname = function;
2418 int argnum = parmnum + 1;
2419 const char *invalid_func_diag;
2421 if (type == void_type_node)
2423 error ("too many arguments to function %qE", function);
2427 if (selector && argnum > 2)
2433 STRIP_TYPE_NOPS (val);
2435 val = require_complete_type (val);
2439 /* Formal parm type is specified by a function prototype. */
2442 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2444 error ("type of formal parameter %d is incomplete", parmnum + 1);
2449 /* Optionally warn about conversions that
2450 differ from the default conversions. */
2451 if (warn_traditional_conversion || warn_traditional)
2453 unsigned int formal_prec = TYPE_PRECISION (type);
2455 if (INTEGRAL_TYPE_P (type)
2456 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2457 warning (0, "passing argument %d of %qE as integer "
2458 "rather than floating due to prototype",
2460 if (INTEGRAL_TYPE_P (type)
2461 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2462 warning (0, "passing argument %d of %qE as integer "
2463 "rather than complex due to prototype",
2465 else if (TREE_CODE (type) == COMPLEX_TYPE
2466 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2467 warning (0, "passing argument %d of %qE as complex "
2468 "rather than floating due to prototype",
2470 else if (TREE_CODE (type) == REAL_TYPE
2471 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2472 warning (0, "passing argument %d of %qE as floating "
2473 "rather than integer due to prototype",
2475 else if (TREE_CODE (type) == COMPLEX_TYPE
2476 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2477 warning (0, "passing argument %d of %qE as complex "
2478 "rather than integer due to prototype",
2480 else if (TREE_CODE (type) == REAL_TYPE
2481 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2482 warning (0, "passing argument %d of %qE as floating "
2483 "rather than complex due to prototype",
2485 /* ??? At some point, messages should be written about
2486 conversions between complex types, but that's too messy
2488 else if (TREE_CODE (type) == REAL_TYPE
2489 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2491 /* Warn if any argument is passed as `float',
2492 since without a prototype it would be `double'. */
2493 if (formal_prec == TYPE_PRECISION (float_type_node)
2494 && type != dfloat32_type_node)
2495 warning (0, "passing argument %d of %qE as %<float%> "
2496 "rather than %<double%> due to prototype",
2499 /* Warn if mismatch between argument and prototype
2500 for decimal float types. Warn of conversions with
2501 binary float types and of precision narrowing due to
2503 else if (type != TREE_TYPE (val)
2504 && (type == dfloat32_type_node
2505 || type == dfloat64_type_node
2506 || type == dfloat128_type_node
2507 || TREE_TYPE (val) == dfloat32_type_node
2508 || TREE_TYPE (val) == dfloat64_type_node
2509 || TREE_TYPE (val) == dfloat128_type_node)
2511 <= TYPE_PRECISION (TREE_TYPE (val))
2512 || (type == dfloat128_type_node
2514 != dfloat64_type_node
2516 != dfloat32_type_node)))
2517 || (type == dfloat64_type_node
2519 != dfloat32_type_node))))
2520 warning (0, "passing argument %d of %qE as %qT "
2521 "rather than %qT due to prototype",
2522 argnum, rname, type, TREE_TYPE (val));
2525 /* Detect integer changing in width or signedness.
2526 These warnings are only activated with
2527 -Wtraditional-conversion, not with -Wtraditional. */
2528 else if (warn_traditional_conversion && INTEGRAL_TYPE_P (type)
2529 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2531 tree would_have_been = default_conversion (val);
2532 tree type1 = TREE_TYPE (would_have_been);
2534 if (TREE_CODE (type) == ENUMERAL_TYPE
2535 && (TYPE_MAIN_VARIANT (type)
2536 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2537 /* No warning if function asks for enum
2538 and the actual arg is that enum type. */
2540 else if (formal_prec != TYPE_PRECISION (type1))
2541 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2542 "with different width due to prototype",
2544 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2546 /* Don't complain if the formal parameter type
2547 is an enum, because we can't tell now whether
2548 the value was an enum--even the same enum. */
2549 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2551 else if (TREE_CODE (val) == INTEGER_CST
2552 && int_fits_type_p (val, type))
2553 /* Change in signedness doesn't matter
2554 if a constant value is unaffected. */
2556 /* If the value is extended from a narrower
2557 unsigned type, it doesn't matter whether we
2558 pass it as signed or unsigned; the value
2559 certainly is the same either way. */
2560 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2561 && TYPE_UNSIGNED (TREE_TYPE (val)))
2563 else if (TYPE_UNSIGNED (type))
2564 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2565 "as unsigned due to prototype",
2568 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2569 "as signed due to prototype", argnum, rname);
2573 parmval = convert_for_assignment (type, val, ic_argpass,
2577 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2578 && INTEGRAL_TYPE_P (type)
2579 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2580 parmval = default_conversion (parmval);
2582 argarray[parmnum] = parmval;
2584 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2585 && (TYPE_PRECISION (TREE_TYPE (val))
2586 < TYPE_PRECISION (double_type_node))
2587 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2588 /* Convert `float' to `double'. */
2589 argarray[parmnum] = convert (double_type_node, val);
2590 else if ((invalid_func_diag =
2591 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2593 error (invalid_func_diag);
2597 /* Convert `short' and `char' to full-size `int'. */
2598 argarray[parmnum] = default_conversion (val);
2601 typetail = TREE_CHAIN (typetail);
2604 gcc_assert (parmnum == nargs);
2606 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2608 error ("too few arguments to function %qE", function);
2615 /* This is the entry point used by the parser to build unary operators
2616 in the input. CODE, a tree_code, specifies the unary operator, and
2617 ARG is the operand. For unary plus, the C parser currently uses
2618 CONVERT_EXPR for code. */
2621 parser_build_unary_op (enum tree_code code, struct c_expr arg)
2623 struct c_expr result;
2625 result.original_code = ERROR_MARK;
2626 result.value = build_unary_op (code, arg.value, 0);
2628 if (TREE_OVERFLOW_P (result.value) && !TREE_OVERFLOW_P (arg.value))
2629 overflow_warning (result.value);
2634 /* This is the entry point used by the parser to build binary operators
2635 in the input. CODE, a tree_code, specifies the binary operator, and
2636 ARG1 and ARG2 are the operands. In addition to constructing the
2637 expression, we check for operands that were written with other binary
2638 operators in a way that is likely to confuse the user. */
2641 parser_build_binary_op (enum tree_code code, struct c_expr arg1,
2644 struct c_expr result;
2646 enum tree_code code1 = arg1.original_code;
2647 enum tree_code code2 = arg2.original_code;
2649 result.value = build_binary_op (code, arg1.value, arg2.value, 1);
2650 result.original_code = code;
2652 if (TREE_CODE (result.value) == ERROR_MARK)
2655 /* Check for cases such as x+y<<z which users are likely
2657 if (warn_parentheses)
2658 warn_about_parentheses (code, code1, code2);
2660 if (code1 != tcc_comparison)
2661 warn_logical_operator (code, arg1.value, arg2.value);
2663 /* Warn about comparisons against string literals, with the exception
2664 of testing for equality or inequality of a string literal with NULL. */
2665 if (code == EQ_EXPR || code == NE_EXPR)
2667 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2668 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2669 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2671 else if (TREE_CODE_CLASS (code) == tcc_comparison
2672 && (code1 == STRING_CST || code2 == STRING_CST))
2673 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2675 if (TREE_OVERFLOW_P (result.value)
2676 && !TREE_OVERFLOW_P (arg1.value)
2677 && !TREE_OVERFLOW_P (arg2.value))
2678 overflow_warning (result.value);
2683 /* Return a tree for the difference of pointers OP0 and OP1.
2684 The resulting tree has type int. */
2687 pointer_diff (tree op0, tree op1)
2689 tree restype = ptrdiff_type_node;
2691 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2692 tree con0, con1, lit0, lit1;
2693 tree orig_op1 = op1;
2695 if (pedantic || warn_pointer_arith)
2697 if (TREE_CODE (target_type) == VOID_TYPE)
2698 pedwarn ("pointer of type %<void *%> used in subtraction");
2699 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2700 pedwarn ("pointer to a function used in subtraction");
2703 /* If the conversion to ptrdiff_type does anything like widening or
2704 converting a partial to an integral mode, we get a convert_expression
2705 that is in the way to do any simplifications.
2706 (fold-const.c doesn't know that the extra bits won't be needed.
2707 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2708 different mode in place.)
2709 So first try to find a common term here 'by hand'; we want to cover
2710 at least the cases that occur in legal static initializers. */
2711 if ((TREE_CODE (op0) == NOP_EXPR || TREE_CODE (op0) == CONVERT_EXPR)
2712 && (TYPE_PRECISION (TREE_TYPE (op0))
2713 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2714 con0 = TREE_OPERAND (op0, 0);
2717 if ((TREE_CODE (op1) == NOP_EXPR || TREE_CODE (op1) == CONVERT_EXPR)
2718 && (TYPE_PRECISION (TREE_TYPE (op1))
2719 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2720 con1 = TREE_OPERAND (op1, 0);
2724 if (TREE_CODE (con0) == PLUS_EXPR)
2726 lit0 = TREE_OPERAND (con0, 1);
2727 con0 = TREE_OPERAND (con0, 0);
2730 lit0 = integer_zero_node;
2732 if (TREE_CODE (con1) == PLUS_EXPR)
2734 lit1 = TREE_OPERAND (con1, 1);
2735 con1 = TREE_OPERAND (con1, 0);
2738 lit1 = integer_zero_node;
2740 if (operand_equal_p (con0, con1, 0))
2747 /* First do the subtraction as integers;
2748 then drop through to build the divide operator.
2749 Do not do default conversions on the minus operator
2750 in case restype is a short type. */
2752 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2753 convert (restype, op1), 0);
2754 /* This generates an error if op1 is pointer to incomplete type. */
2755 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2756 error ("arithmetic on pointer to an incomplete type");
2758 /* This generates an error if op0 is pointer to incomplete type. */
2759 op1 = c_size_in_bytes (target_type);
2761 /* Divide by the size, in easiest possible way. */
2762 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2765 /* Construct and perhaps optimize a tree representation
2766 for a unary operation. CODE, a tree_code, specifies the operation
2767 and XARG is the operand.
2768 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2769 the default promotions (such as from short to int).
2770 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2771 allows non-lvalues; this is only used to handle conversion of non-lvalue
2772 arrays to pointers in C99. */
2775 build_unary_op (enum tree_code code, tree xarg, int flag)
2777 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2780 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2782 int noconvert = flag;
2783 const char *invalid_op_diag;
2785 if (typecode == ERROR_MARK)
2786 return error_mark_node;
2787 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2788 typecode = INTEGER_TYPE;
2790 if ((invalid_op_diag
2791 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2793 error (invalid_op_diag);
2794 return error_mark_node;
2800 /* This is used for unary plus, because a CONVERT_EXPR
2801 is enough to prevent anybody from looking inside for
2802 associativity, but won't generate any code. */
2803 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2804 || typecode == COMPLEX_TYPE
2805 || typecode == VECTOR_TYPE))
2807 error ("wrong type argument to unary plus");
2808 return error_mark_node;
2810 else if (!noconvert)
2811 arg = default_conversion (arg);
2812 arg = non_lvalue (arg);
2816 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2817 || typecode == COMPLEX_TYPE
2818 || typecode == VECTOR_TYPE))
2820 error ("wrong type argument to unary minus");
2821 return error_mark_node;
2823 else if (!noconvert)
2824 arg = default_conversion (arg);
2828 if (typecode == INTEGER_TYPE || typecode == VECTOR_TYPE)
2831 arg = default_conversion (arg);
2833 else if (typecode == COMPLEX_TYPE)
2837 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2839 arg = default_conversion (arg);
2843 error ("wrong type argument to bit-complement");
2844 return error_mark_node;
2849 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2851 error ("wrong type argument to abs");
2852 return error_mark_node;
2854 else if (!noconvert)
2855 arg = default_conversion (arg);
2859 /* Conjugating a real value is a no-op, but allow it anyway. */
2860 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2861 || typecode == COMPLEX_TYPE))
2863 error ("wrong type argument to conjugation");
2864 return error_mark_node;
2866 else if (!noconvert)
2867 arg = default_conversion (arg);
2870 case TRUTH_NOT_EXPR:
2871 if (typecode != INTEGER_TYPE
2872 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2873 && typecode != COMPLEX_TYPE)
2875 error ("wrong type argument to unary exclamation mark");
2876 return error_mark_node;
2878 arg = c_objc_common_truthvalue_conversion (arg);
2879 return invert_truthvalue (arg);
2882 if (TREE_CODE (arg) == COMPLEX_CST)
2883 return TREE_REALPART (arg);
2884 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2885 return fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2890 if (TREE_CODE (arg) == COMPLEX_CST)
2891 return TREE_IMAGPART (arg);
2892 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2893 return fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2895 return convert (TREE_TYPE (arg), integer_zero_node);
2897 case PREINCREMENT_EXPR:
2898 case POSTINCREMENT_EXPR:
2899 case PREDECREMENT_EXPR:
2900 case POSTDECREMENT_EXPR:
2902 /* Increment or decrement the real part of the value,
2903 and don't change the imaginary part. */
2904 if (typecode == COMPLEX_TYPE)
2909 pedwarn ("ISO C does not support %<++%> and %<--%>"
2910 " on complex types");
2912 arg = stabilize_reference (arg);
2913 real = build_unary_op (REALPART_EXPR, arg, 1);
2914 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2915 real = build_unary_op (code, real, 1);
2916 if (real == error_mark_node || imag == error_mark_node)
2917 return error_mark_node;
2918 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
2922 /* Report invalid types. */
2924 if (typecode != POINTER_TYPE
2925 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2927 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2928 error ("wrong type argument to increment");
2930 error ("wrong type argument to decrement");
2932 return error_mark_node;
2937 tree result_type = TREE_TYPE (arg);
2939 arg = get_unwidened (arg, 0);
2940 argtype = TREE_TYPE (arg);
2942 /* Compute the increment. */
2944 if (typecode == POINTER_TYPE)
2946 /* If pointer target is an undefined struct,
2947 we just cannot know how to do the arithmetic. */
2948 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2950 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2951 error ("increment of pointer to unknown structure");
2953 error ("decrement of pointer to unknown structure");
2955 else if ((pedantic || warn_pointer_arith)
2956 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2957 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2959 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2960 pedwarn ("wrong type argument to increment");
2962 pedwarn ("wrong type argument to decrement");
2965 inc = c_size_in_bytes (TREE_TYPE (result_type));
2966 inc = fold_convert (sizetype, inc);
2970 inc = integer_one_node;
2971 inc = convert (argtype, inc);
2974 /* Complain about anything else that is not a true lvalue. */
2975 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
2976 || code == POSTINCREMENT_EXPR)
2979 return error_mark_node;
2981 /* Report a read-only lvalue. */
2982 if (TREE_READONLY (arg))
2984 readonly_error (arg,
2985 ((code == PREINCREMENT_EXPR
2986 || code == POSTINCREMENT_EXPR)
2987 ? lv_increment : lv_decrement));
2988 return error_mark_node;
2991 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2992 val = boolean_increment (code, arg);
2994 val = build2 (code, TREE_TYPE (arg), arg, inc);
2995 TREE_SIDE_EFFECTS (val) = 1;
2996 val = convert (result_type, val);
2997 if (TREE_CODE (val) != code)
2998 TREE_NO_WARNING (val) = 1;
3003 /* Note that this operation never does default_conversion. */
3005 /* Let &* cancel out to simplify resulting code. */
3006 if (TREE_CODE (arg) == INDIRECT_REF)
3008 /* Don't let this be an lvalue. */
3009 if (lvalue_p (TREE_OPERAND (arg, 0)))
3010 return non_lvalue (TREE_OPERAND (arg, 0));
3011 return TREE_OPERAND (arg, 0);
3014 /* For &x[y], return x+y */
3015 if (TREE_CODE (arg) == ARRAY_REF)
3017 tree op0 = TREE_OPERAND (arg, 0);
3018 if (!c_mark_addressable (op0))
3019 return error_mark_node;
3020 return build_binary_op (PLUS_EXPR,
3021 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3022 ? array_to_pointer_conversion (op0)
3024 TREE_OPERAND (arg, 1), 1);
3027 /* Anything not already handled and not a true memory reference
3028 or a non-lvalue array is an error. */
3029 else if (typecode != FUNCTION_TYPE && !flag
3030 && !lvalue_or_else (arg, lv_addressof))
3031 return error_mark_node;
3033 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3034 argtype = TREE_TYPE (arg);
3036 /* If the lvalue is const or volatile, merge that into the type
3037 to which the address will point. Note that you can't get a
3038 restricted pointer by taking the address of something, so we
3039 only have to deal with `const' and `volatile' here. */
3040 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3041 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3042 argtype = c_build_type_variant (argtype,
3043 TREE_READONLY (arg),
3044 TREE_THIS_VOLATILE (arg));
3046 if (!c_mark_addressable (arg))
3047 return error_mark_node;
3049 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3050 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3052 argtype = build_pointer_type (argtype);
3054 /* ??? Cope with user tricks that amount to offsetof. Delete this
3055 when we have proper support for integer constant expressions. */
3056 val = get_base_address (arg);
3057 if (val && TREE_CODE (val) == INDIRECT_REF
3058 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3060 tree op0 = fold_convert (sizetype, fold_offsetof (arg, val)), op1;
3062 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3063 return fold_build2 (POINTER_PLUS_EXPR, argtype, op1, op0);
3066 val = build1 (ADDR_EXPR, argtype, arg);
3075 argtype = TREE_TYPE (arg);
3076 return require_constant_value ? fold_build1_initializer (code, argtype, arg)
3077 : fold_build1 (code, argtype, arg);
3080 /* Return nonzero if REF is an lvalue valid for this language.
3081 Lvalues can be assigned, unless their type has TYPE_READONLY.
3082 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3087 enum tree_code code = TREE_CODE (ref);
3094 return lvalue_p (TREE_OPERAND (ref, 0));
3096 case COMPOUND_LITERAL_EXPR:
3106 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3107 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3110 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3117 /* Give an error for storing in something that is 'const'. */
3120 readonly_error (tree arg, enum lvalue_use use)
3122 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3124 /* Using this macro rather than (for example) arrays of messages
3125 ensures that all the format strings are checked at compile
3127 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3128 : (use == lv_increment ? (I) \
3129 : (use == lv_decrement ? (D) : (AS))))
3130 if (TREE_CODE (arg) == COMPONENT_REF)
3132 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3133 readonly_error (TREE_OPERAND (arg, 0), use);
3135 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3136 G_("increment of read-only member %qD"),
3137 G_("decrement of read-only member %qD"),
3138 G_("read-only member %qD used as %<asm%> output")),
3139 TREE_OPERAND (arg, 1));
3141 else if (TREE_CODE (arg) == VAR_DECL)
3142 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3143 G_("increment of read-only variable %qD"),
3144 G_("decrement of read-only variable %qD"),
3145 G_("read-only variable %qD used as %<asm%> output")),
3148 error (READONLY_MSG (G_("assignment of read-only location"),
3149 G_("increment of read-only location"),
3150 G_("decrement of read-only location"),
3151 G_("read-only location used as %<asm%> output")));
3155 /* Return nonzero if REF is an lvalue valid for this language;
3156 otherwise, print an error message and return zero. USE says
3157 how the lvalue is being used and so selects the error message. */
3160 lvalue_or_else (tree ref, enum lvalue_use use)
3162 int win = lvalue_p (ref);
3170 /* Mark EXP saying that we need to be able to take the
3171 address of it; it should not be allocated in a register.
3172 Returns true if successful. */
3175 c_mark_addressable (tree exp)
3180 switch (TREE_CODE (x))
3183 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3186 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3190 /* ... fall through ... */
3196 x = TREE_OPERAND (x, 0);
3199 case COMPOUND_LITERAL_EXPR:
3201 TREE_ADDRESSABLE (x) = 1;
3208 if (C_DECL_REGISTER (x)
3209 && DECL_NONLOCAL (x))
3211 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3214 ("global register variable %qD used in nested function", x);
3217 pedwarn ("register variable %qD used in nested function", x);
3219 else if (C_DECL_REGISTER (x))
3221 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3222 error ("address of global register variable %qD requested", x);
3224 error ("address of register variable %qD requested", x);
3230 TREE_ADDRESSABLE (x) = 1;
3237 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3240 build_conditional_expr (tree ifexp, tree op1, tree op2)
3244 enum tree_code code1;
3245 enum tree_code code2;
3246 tree result_type = NULL;
3247 tree orig_op1 = op1, orig_op2 = op2;
3249 /* Promote both alternatives. */
3251 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3252 op1 = default_conversion (op1);
3253 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3254 op2 = default_conversion (op2);
3256 if (TREE_CODE (ifexp) == ERROR_MARK
3257 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3258 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3259 return error_mark_node;
3261 type1 = TREE_TYPE (op1);
3262 code1 = TREE_CODE (type1);
3263 type2 = TREE_TYPE (op2);
3264 code2 = TREE_CODE (type2);
3266 /* C90 does not permit non-lvalue arrays in conditional expressions.
3267 In C99 they will be pointers by now. */
3268 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3270 error ("non-lvalue array in conditional expression");
3271 return error_mark_node;
3274 /* Quickly detect the usual case where op1 and op2 have the same type
3276 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3279 result_type = type1;
3281 result_type = TYPE_MAIN_VARIANT (type1);
3283 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3284 || code1 == COMPLEX_TYPE)
3285 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3286 || code2 == COMPLEX_TYPE))
3288 result_type = c_common_type (type1, type2);
3290 /* If -Wsign-compare, warn here if type1 and type2 have
3291 different signedness. We'll promote the signed to unsigned
3292 and later code won't know it used to be different.
3293 Do this check on the original types, so that explicit casts
3294 will be considered, but default promotions won't. */
3295 if (warn_sign_compare && !skip_evaluation)
3297 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3298 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3300 if (unsigned_op1 ^ unsigned_op2)
3304 /* Do not warn if the result type is signed, since the
3305 signed type will only be chosen if it can represent
3306 all the values of the unsigned type. */
3307 if (!TYPE_UNSIGNED (result_type))
3309 /* Do not warn if the signed quantity is an unsuffixed
3310 integer literal (or some static constant expression
3311 involving such literals) and it is non-negative. */
3312 else if ((unsigned_op2
3313 && tree_expr_nonnegative_warnv_p (op1, &ovf))
3315 && tree_expr_nonnegative_warnv_p (op2, &ovf)))
3318 warning (0, "signed and unsigned type in conditional expression");
3322 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3324 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3325 pedwarn ("ISO C forbids conditional expr with only one void side");
3326 result_type = void_type_node;
3328 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3330 if (comp_target_types (type1, type2))
3331 result_type = common_pointer_type (type1, type2);
3332 else if (null_pointer_constant_p (orig_op1))
3333 result_type = qualify_type (type2, type1);
3334 else if (null_pointer_constant_p (orig_op2))
3335 result_type = qualify_type (type1, type2);
3336 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3338 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3339 pedwarn ("ISO C forbids conditional expr between "
3340 "%<void *%> and function pointer");
3341 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3342 TREE_TYPE (type2)));
3344 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3346 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3347 pedwarn ("ISO C forbids conditional expr between "
3348 "%<void *%> and function pointer");
3349 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3350 TREE_TYPE (type1)));
3354 pedwarn ("pointer type mismatch in conditional expression");
3355 result_type = build_pointer_type (void_type_node);
3358 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3360 if (!null_pointer_constant_p (orig_op2))
3361 pedwarn ("pointer/integer type mismatch in conditional expression");
3364 op2 = null_pointer_node;
3366 result_type = type1;
3368 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3370 if (!null_pointer_constant_p (orig_op1))
3371 pedwarn ("pointer/integer type mismatch in conditional expression");
3374 op1 = null_pointer_node;
3376 result_type = type2;
3381 if (flag_cond_mismatch)
3382 result_type = void_type_node;
3385 error ("type mismatch in conditional expression");
3386 return error_mark_node;
3390 /* Merge const and volatile flags of the incoming types. */
3392 = build_type_variant (result_type,
3393 TREE_READONLY (op1) || TREE_READONLY (op2),
3394 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3396 if (result_type != TREE_TYPE (op1))
3397 op1 = convert_and_check (result_type, op1);
3398 if (result_type != TREE_TYPE (op2))
3399 op2 = convert_and_check (result_type, op2);
3401 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3404 /* Return a compound expression that performs two expressions and
3405 returns the value of the second of them. */
3408 build_compound_expr (tree expr1, tree expr2)
3410 if (!TREE_SIDE_EFFECTS (expr1))
3412 /* The left-hand operand of a comma expression is like an expression
3413 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3414 any side-effects, unless it was explicitly cast to (void). */
3415 if (warn_unused_value)
3417 if (VOID_TYPE_P (TREE_TYPE (expr1))
3418 && (TREE_CODE (expr1) == NOP_EXPR
3419 || TREE_CODE (expr1) == CONVERT_EXPR))
3421 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3422 && TREE_CODE (expr1) == COMPOUND_EXPR
3423 && (TREE_CODE (TREE_OPERAND (expr1, 1)) == CONVERT_EXPR
3424 || TREE_CODE (TREE_OPERAND (expr1, 1)) == NOP_EXPR))
3425 ; /* (void) a, (void) b, c */
3427 warning (OPT_Wunused_value,
3428 "left-hand operand of comma expression has no effect");
3432 /* With -Wunused, we should also warn if the left-hand operand does have
3433 side-effects, but computes a value which is not used. For example, in
3434 `foo() + bar(), baz()' the result of the `+' operator is not used,
3435 so we should issue a warning. */
3436 else if (warn_unused_value)
3437 warn_if_unused_value (expr1, input_location);
3439 if (expr2 == error_mark_node)
3440 return error_mark_node;
3442 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3445 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3448 build_c_cast (tree type, tree expr)
3452 if (type == error_mark_node || expr == error_mark_node)
3453 return error_mark_node;
3455 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3456 only in <protocol> qualifications. But when constructing cast expressions,
3457 the protocols do matter and must be kept around. */
3458 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3459 return build1 (NOP_EXPR, type, expr);
3461 type = TYPE_MAIN_VARIANT (type);
3463 if (TREE_CODE (type) == ARRAY_TYPE)
3465 error ("cast specifies array type");
3466 return error_mark_node;
3469 if (TREE_CODE (type) == FUNCTION_TYPE)
3471 error ("cast specifies function type");
3472 return error_mark_node;
3475 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3479 if (TREE_CODE (type) == RECORD_TYPE
3480 || TREE_CODE (type) == UNION_TYPE)
3481 pedwarn ("ISO C forbids casting nonscalar to the same type");
3484 else if (TREE_CODE (type) == UNION_TYPE)
3488 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3489 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3490 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3498 pedwarn ("ISO C forbids casts to union type");
3499 t = digest_init (type,
3500 build_constructor_single (type, field, value),
3502 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3503 TREE_INVARIANT (t) = TREE_INVARIANT (value);
3506 error ("cast to union type from type not present in union");
3507 return error_mark_node;
3513 if (type == void_type_node)
3514 return build1 (CONVERT_EXPR, type, value);
3516 otype = TREE_TYPE (value);
3518 /* Optionally warn about potentially worrisome casts. */
3521 && TREE_CODE (type) == POINTER_TYPE
3522 && TREE_CODE (otype) == POINTER_TYPE)
3524 tree in_type = type;
3525 tree in_otype = otype;
3529 /* Check that the qualifiers on IN_TYPE are a superset of
3530 the qualifiers of IN_OTYPE. The outermost level of
3531 POINTER_TYPE nodes is uninteresting and we stop as soon
3532 as we hit a non-POINTER_TYPE node on either type. */
3535 in_otype = TREE_TYPE (in_otype);
3536 in_type = TREE_TYPE (in_type);
3538 /* GNU C allows cv-qualified function types. 'const'
3539 means the function is very pure, 'volatile' means it
3540 can't return. We need to warn when such qualifiers
3541 are added, not when they're taken away. */
3542 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3543 && TREE_CODE (in_type) == FUNCTION_TYPE)
3544 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3546 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3548 while (TREE_CODE (in_type) == POINTER_TYPE
3549 && TREE_CODE (in_otype) == POINTER_TYPE);
3552 warning (0, "cast adds new qualifiers to function type");
3555 /* There are qualifiers present in IN_OTYPE that are not
3556 present in IN_TYPE. */
3557 warning (0, "cast discards qualifiers from pointer target type");
3560 /* Warn about possible alignment problems. */
3561 if (STRICT_ALIGNMENT
3562 && TREE_CODE (type) == POINTER_TYPE
3563 && TREE_CODE (otype) == POINTER_TYPE
3564 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3565 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3566 /* Don't warn about opaque types, where the actual alignment
3567 restriction is unknown. */
3568 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3569 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3570 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3571 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3572 warning (OPT_Wcast_align,
3573 "cast increases required alignment of target type");
3575 if (TREE_CODE (type) == INTEGER_TYPE
3576 && TREE_CODE (otype) == POINTER_TYPE
3577 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3578 /* Unlike conversion of integers to pointers, where the
3579 warning is disabled for converting constants because
3580 of cases such as SIG_*, warn about converting constant
3581 pointers to integers. In some cases it may cause unwanted
3582 sign extension, and a warning is appropriate. */
3583 warning (OPT_Wpointer_to_int_cast,
3584 "cast from pointer to integer of different size");
3586 if (TREE_CODE (value) == CALL_EXPR
3587 && TREE_CODE (type) != TREE_CODE (otype))
3588 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3589 "to non-matching type %qT", otype, type);
3591 if (TREE_CODE (type) == POINTER_TYPE
3592 && TREE_CODE (otype) == INTEGER_TYPE
3593 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3594 /* Don't warn about converting any constant. */
3595 && !TREE_CONSTANT (value))
3596 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3597 "of different size");
3599 if (warn_strict_aliasing <= 2)
3600 strict_aliasing_warning (otype, type, expr);
3602 /* If pedantic, warn for conversions between function and object
3603 pointer types, except for converting a null pointer constant
3604 to function pointer type. */
3606 && TREE_CODE (type) == POINTER_TYPE
3607 && TREE_CODE (otype) == POINTER_TYPE
3608 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3609 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3610 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3613 && TREE_CODE (type) == POINTER_TYPE
3614 && TREE_CODE (otype) == POINTER_TYPE
3615 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3616 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3617 && !null_pointer_constant_p (value))
3618 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3621 value = convert (type, value);
3623 /* Ignore any integer overflow caused by the cast. */
3624 if (TREE_CODE (value) == INTEGER_CST)
3626 if (CONSTANT_CLASS_P (ovalue) && TREE_OVERFLOW (ovalue))
3628 if (!TREE_OVERFLOW (value))
3630 /* Avoid clobbering a shared constant. */
3631 value = copy_node (value);
3632 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3635 else if (TREE_OVERFLOW (value))
3636 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3637 value = build_int_cst_wide (TREE_TYPE (value),
3638 TREE_INT_CST_LOW (value),
3639 TREE_INT_CST_HIGH (value));
3643 /* Don't let a cast be an lvalue. */
3645 value = non_lvalue (value);
3650 /* Interpret a cast of expression EXPR to type TYPE. */
3652 c_cast_expr (struct c_type_name *type_name, tree expr)
3655 int saved_wsp = warn_strict_prototypes;
3657 /* This avoids warnings about unprototyped casts on
3658 integers. E.g. "#define SIG_DFL (void(*)())0". */
3659 if (TREE_CODE (expr) == INTEGER_CST)
3660 warn_strict_prototypes = 0;
3661 type = groktypename (type_name);
3662 warn_strict_prototypes = saved_wsp;
3664 return build_c_cast (type, expr);
3667 /* Build an assignment expression of lvalue LHS from value RHS.
3668 MODIFYCODE is the code for a binary operator that we use
3669 to combine the old value of LHS with RHS to get the new value.
3670 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3673 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3677 tree lhstype = TREE_TYPE (lhs);
3678 tree olhstype = lhstype;
3680 /* Types that aren't fully specified cannot be used in assignments. */
3681 lhs = require_complete_type (lhs);
3683 /* Avoid duplicate error messages from operands that had errors. */
3684 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3685 return error_mark_node;
3687 if (!lvalue_or_else (lhs, lv_assign))
3688 return error_mark_node;
3690 STRIP_TYPE_NOPS (rhs);
3694 /* If a binary op has been requested, combine the old LHS value with the RHS
3695 producing the value we should actually store into the LHS. */
3697 if (modifycode != NOP_EXPR)
3699 lhs = stabilize_reference (lhs);
3700 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3703 /* Give an error for storing in something that is 'const'. */
3705 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3706 || ((TREE_CODE (lhstype) == RECORD_TYPE
3707 || TREE_CODE (lhstype) == UNION_TYPE)
3708 && C_TYPE_FIELDS_READONLY (lhstype)))
3710 readonly_error (lhs, lv_assign);
3711 return error_mark_node;
3714 /* If storing into a structure or union member,
3715 it has probably been given type `int'.
3716 Compute the type that would go with
3717 the actual amount of storage the member occupies. */
3719 if (TREE_CODE (lhs) == COMPONENT_REF
3720 && (TREE_CODE (lhstype) == INTEGER_TYPE
3721 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3722 || TREE_CODE (lhstype) == REAL_TYPE
3723 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3724 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3726 /* If storing in a field that is in actuality a short or narrower than one,
3727 we must store in the field in its actual type. */
3729 if (lhstype != TREE_TYPE (lhs))
3731 lhs = copy_node (lhs);
3732 TREE_TYPE (lhs) = lhstype;
3735 /* Convert new value to destination type. */
3737 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3738 NULL_TREE, NULL_TREE, 0);
3739 if (TREE_CODE (newrhs) == ERROR_MARK)
3740 return error_mark_node;
3742 /* Emit ObjC write barrier, if necessary. */
3743 if (c_dialect_objc () && flag_objc_gc)
3745 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3750 /* Scan operands. */
3752 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3753 TREE_SIDE_EFFECTS (result) = 1;
3755 /* If we got the LHS in a different type for storing in,
3756 convert the result back to the nominal type of LHS
3757 so that the value we return always has the same type
3758 as the LHS argument. */
3760 if (olhstype == TREE_TYPE (result))
3762 return convert_for_assignment (olhstype, result, ic_assign,
3763 NULL_TREE, NULL_TREE, 0);
3766 /* Convert value RHS to type TYPE as preparation for an assignment
3767 to an lvalue of type TYPE.
3768 The real work of conversion is done by `convert'.
3769 The purpose of this function is to generate error messages
3770 for assignments that are not allowed in C.
3771 ERRTYPE says whether it is argument passing, assignment,
3772 initialization or return.
3774 FUNCTION is a tree for the function being called.
3775 PARMNUM is the number of the argument, for printing in error messages. */
3778 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3779 tree fundecl, tree function, int parmnum)
3781 enum tree_code codel = TREE_CODE (type);
3783 enum tree_code coder;
3784 tree rname = NULL_TREE;
3785 bool objc_ok = false;
3787 if (errtype == ic_argpass || errtype == ic_argpass_nonproto)
3790 /* Change pointer to function to the function itself for
3792 if (TREE_CODE (function) == ADDR_EXPR
3793 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3794 function = TREE_OPERAND (function, 0);
3796 /* Handle an ObjC selector specially for diagnostics. */
3797 selector = objc_message_selector ();
3799 if (selector && parmnum > 2)
3806 /* This macro is used to emit diagnostics to ensure that all format
3807 strings are complete sentences, visible to gettext and checked at
3809 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3814 pedwarn (AR, parmnum, rname); \
3816 case ic_argpass_nonproto: \
3817 warning (0, AR, parmnum, rname); \
3829 gcc_unreachable (); \
3833 STRIP_TYPE_NOPS (rhs);
3835 if (optimize && TREE_CODE (rhs) == VAR_DECL
3836 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
3837 rhs = decl_constant_value_for_broken_optimization (rhs);
3839 rhstype = TREE_TYPE (rhs);
3840 coder = TREE_CODE (rhstype);
3842 if (coder == ERROR_MARK)
3843 return error_mark_node;
3845 if (c_dialect_objc ())
3868 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
3871 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
3874 if (coder == VOID_TYPE)
3876 /* Except for passing an argument to an unprototyped function,
3877 this is a constraint violation. When passing an argument to
3878 an unprototyped function, it is compile-time undefined;
3879 making it a constraint in that case was rejected in
3881 error ("void value not ignored as it ought to be");
3882 return error_mark_node;
3884 /* A type converts to a reference to it.
3885 This code doesn't fully support references, it's just for the
3886 special case of va_start and va_copy. */
3887 if (codel == REFERENCE_TYPE
3888 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
3890 if (!lvalue_p (rhs))
3892 error ("cannot pass rvalue to reference parameter");
3893 return error_mark_node;
3895 if (!c_mark_addressable (rhs))
3896 return error_mark_node;
3897 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
3899 /* We already know that these two types are compatible, but they
3900 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3901 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3902 likely to be va_list, a typedef to __builtin_va_list, which
3903 is different enough that it will cause problems later. */
3904 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
3905 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
3907 rhs = build1 (NOP_EXPR, type, rhs);
3910 /* Some types can interconvert without explicit casts. */
3911 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
3912 && vector_types_convertible_p (type, TREE_TYPE (rhs), true))
3913 return convert (type, rhs);
3914 /* Arithmetic types all interconvert, and enum is treated like int. */
3915 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
3916 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
3917 || codel == BOOLEAN_TYPE)
3918 && (coder == INTEGER_TYPE || coder == REAL_TYPE
3919 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
3920 || coder == BOOLEAN_TYPE))
3921 return convert_and_check (type, rhs);
3923 /* Aggregates in different TUs might need conversion. */
3924 if ((codel == RECORD_TYPE || codel == UNION_TYPE)
3926 && comptypes (type, rhstype))
3927 return convert_and_check (type, rhs);
3929 /* Conversion to a transparent union from its member types.
3930 This applies only to function arguments. */
3931 if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
3932 && (errtype == ic_argpass || errtype == ic_argpass_nonproto))
3934 tree memb, marginal_memb = NULL_TREE;
3936 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
3938 tree memb_type = TREE_TYPE (memb);
3940 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
3941 TYPE_MAIN_VARIANT (rhstype)))
3944 if (TREE_CODE (memb_type) != POINTER_TYPE)
3947 if (coder == POINTER_TYPE)
3949 tree ttl = TREE_TYPE (memb_type);
3950 tree ttr = TREE_TYPE (rhstype);
3952 /* Any non-function converts to a [const][volatile] void *
3953 and vice versa; otherwise, targets must be the same.
3954 Meanwhile, the lhs target must have all the qualifiers of
3956 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3957 || comp_target_types (memb_type, rhstype))
3959 /* If this type won't generate any warnings, use it. */
3960 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
3961 || ((TREE_CODE (ttr) == FUNCTION_TYPE
3962 && TREE_CODE (ttl) == FUNCTION_TYPE)
3963 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3964 == TYPE_QUALS (ttr))
3965 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3966 == TYPE_QUALS (ttl))))
3969 /* Keep looking for a better type, but remember this one. */
3971 marginal_memb = memb;
3975 /* Can convert integer zero to any pointer type. */
3976 if (null_pointer_constant_p (rhs))
3978 rhs = null_pointer_node;
3983 if (memb || marginal_memb)
3987 /* We have only a marginally acceptable member type;
3988 it needs a warning. */
3989 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
3990 tree ttr = TREE_TYPE (rhstype);
3992 /* Const and volatile mean something different for function
3993 types, so the usual warnings are not appropriate. */
3994 if (TREE_CODE (ttr) == FUNCTION_TYPE
3995 && TREE_CODE (ttl) == FUNCTION_TYPE)
3997 /* Because const and volatile on functions are
3998 restrictions that say the function will not do
3999 certain things, it is okay to use a const or volatile
4000 function where an ordinary one is wanted, but not
4002 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4003 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
4004 "makes qualified function "
4005 "pointer from unqualified"),
4006 G_("assignment makes qualified "
4007 "function pointer from "
4009 G_("initialization makes qualified "
4010 "function pointer from "
4012 G_("return makes qualified function "
4013 "pointer from unqualified"));
4015 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4016 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4017 "qualifiers from pointer target type"),
4018 G_("assignment discards qualifiers "
4019 "from pointer target type"),
4020 G_("initialization discards qualifiers "
4021 "from pointer target type"),
4022 G_("return discards qualifiers from "
4023 "pointer target type"));
4025 memb = marginal_memb;
4028 if (pedantic && (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl)))
4029 pedwarn ("ISO C prohibits argument conversion to union type");
4031 return build_constructor_single (type, memb, rhs);
4035 /* Conversions among pointers */
4036 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4037 && (coder == codel))
4039 tree ttl = TREE_TYPE (type);
4040 tree ttr = TREE_TYPE (rhstype);
4043 bool is_opaque_pointer;
4044 int target_cmp = 0; /* Cache comp_target_types () result. */
4046 if (TREE_CODE (mvl) != ARRAY_TYPE)
4047 mvl = TYPE_MAIN_VARIANT (mvl);
4048 if (TREE_CODE (mvr) != ARRAY_TYPE)
4049 mvr = TYPE_MAIN_VARIANT (mvr);
4050 /* Opaque pointers are treated like void pointers. */
4051 is_opaque_pointer = (targetm.vector_opaque_p (type)
4052 || targetm.vector_opaque_p (rhstype))
4053 && TREE_CODE (ttl) == VECTOR_TYPE
4054 && TREE_CODE (ttr) == VECTOR_TYPE;
4056 /* C++ does not allow the implicit conversion void* -> T*. However,
4057 for the purpose of reducing the number of false positives, we
4058 tolerate the special case of
4062 where NULL is typically defined in C to be '(void *) 0'. */
4063 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4064 warning (OPT_Wc___compat, "request for implicit conversion from "
4065 "%qT to %qT not permitted in C++", rhstype, type);
4067 /* Check if the right-hand side has a format attribute but the
4068 left-hand side doesn't. */
4069 if (warn_missing_format_attribute
4070 && check_missing_format_attribute (type, rhstype))
4075 case ic_argpass_nonproto:
4076 warning (OPT_Wmissing_format_attribute,
4077 "argument %d of %qE might be "
4078 "a candidate for a format attribute",
4082 warning (OPT_Wmissing_format_attribute,
4083 "assignment left-hand side might be "
4084 "a candidate for a format attribute");
4087 warning (OPT_Wmissing_format_attribute,
4088 "initialization left-hand side might be "
4089 "a candidate for a format attribute");
4092 warning (OPT_Wmissing_format_attribute,
4093 "return type might be "
4094 "a candidate for a format attribute");
4101 /* Any non-function converts to a [const][volatile] void *
4102 and vice versa; otherwise, targets must be the same.
4103 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4104 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4105 || (target_cmp = comp_target_types (type, rhstype))
4106 || is_opaque_pointer
4107 || (c_common_unsigned_type (mvl)
4108 == c_common_unsigned_type (mvr)))
4111 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4114 && !null_pointer_constant_p (rhs)
4115 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4116 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
4117 "%qE between function pointer "
4119 G_("ISO C forbids assignment between "
4120 "function pointer and %<void *%>"),
4121 G_("ISO C forbids initialization between "
4122 "function pointer and %<void *%>"),
4123 G_("ISO C forbids return between function "
4124 "pointer and %<void *%>"));
4125 /* Const and volatile mean something different for function types,
4126 so the usual warnings are not appropriate. */
4127 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4128 && TREE_CODE (ttl) != FUNCTION_TYPE)
4130 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4132 /* Types differing only by the presence of the 'volatile'
4133 qualifier are acceptable if the 'volatile' has been added
4134 in by the Objective-C EH machinery. */
4135 if (!objc_type_quals_match (ttl, ttr))
4136 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4137 "qualifiers from pointer target type"),
4138 G_("assignment discards qualifiers "
4139 "from pointer target type"),
4140 G_("initialization discards qualifiers "
4141 "from pointer target type"),
4142 G_("return discards qualifiers from "
4143 "pointer target type"));
4145 /* If this is not a case of ignoring a mismatch in signedness,
4147 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4150 /* If there is a mismatch, do warn. */
4151 else if (warn_pointer_sign)
4152 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
4153 "%d of %qE differ in signedness"),
4154 G_("pointer targets in assignment "
4155 "differ in signedness"),
4156 G_("pointer targets in initialization "
4157 "differ in signedness"),
4158 G_("pointer targets in return differ "
4161 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4162 && TREE_CODE (ttr) == FUNCTION_TYPE)
4164 /* Because const and volatile on functions are restrictions
4165 that say the function will not do certain things,
4166 it is okay to use a const or volatile function
4167 where an ordinary one is wanted, but not vice-versa. */
4168 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4169 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4170 "qualified function pointer "
4171 "from unqualified"),
4172 G_("assignment makes qualified function "
4173 "pointer from unqualified"),
4174 G_("initialization makes qualified "
4175 "function pointer from unqualified"),
4176 G_("return makes qualified function "
4177 "pointer from unqualified"));
4181 /* Avoid warning about the volatile ObjC EH puts on decls. */
4183 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
4184 "incompatible pointer type"),
4185 G_("assignment from incompatible pointer type"),
4186 G_("initialization from incompatible "
4188 G_("return from incompatible pointer type"));
4190 return convert (type, rhs);
4192 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4194 /* ??? This should not be an error when inlining calls to
4195 unprototyped functions. */
4196 error ("invalid use of non-lvalue array");
4197 return error_mark_node;
4199 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4201 /* An explicit constant 0 can convert to a pointer,
4202 or one that results from arithmetic, even including
4203 a cast to integer type. */
4204 if (!null_pointer_constant_p (rhs))
4205 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4206 "pointer from integer without a cast"),
4207 G_("assignment makes pointer from integer "
4209 G_("initialization makes pointer from "
4210 "integer without a cast"),
4211 G_("return makes pointer from integer "
4214 return convert (type, rhs);
4216 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4218 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
4219 "from pointer without a cast"),
4220 G_("assignment makes integer from pointer "
4222 G_("initialization makes integer from pointer "
4224 G_("return makes integer from pointer "
4226 return convert (type, rhs);
4228 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4229 return convert (type, rhs);
4234 case ic_argpass_nonproto:
4235 /* ??? This should not be an error when inlining calls to
4236 unprototyped functions. */
4237 error ("incompatible type for argument %d of %qE", parmnum, rname);
4240 error ("incompatible types in assignment");
4243 error ("incompatible types in initialization");
4246 error ("incompatible types in return");
4252 return error_mark_node;
4255 /* If VALUE is a compound expr all of whose expressions are constant, then
4256 return its value. Otherwise, return error_mark_node.
4258 This is for handling COMPOUND_EXPRs as initializer elements
4259 which is allowed with a warning when -pedantic is specified. */
4262 valid_compound_expr_initializer (tree value, tree endtype)
4264 if (TREE_CODE (value) == COMPOUND_EXPR)
4266 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4268 return error_mark_node;
4269 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4272 else if (!initializer_constant_valid_p (value, endtype))
4273 return error_mark_node;
4278 /* Perform appropriate conversions on the initial value of a variable,
4279 store it in the declaration DECL,
4280 and print any error messages that are appropriate.
4281 If the init is invalid, store an ERROR_MARK. */
4284 store_init_value (tree decl, tree init)
4288 /* If variable's type was invalidly declared, just ignore it. */
4290 type = TREE_TYPE (decl);
4291 if (TREE_CODE (type) == ERROR_MARK)
4294 /* Digest the specified initializer into an expression. */
4296 value = digest_init (type, init, true, TREE_STATIC (decl));
4298 /* Store the expression if valid; else report error. */
4300 if (!in_system_header
4301 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4302 warning (OPT_Wtraditional, "traditional C rejects automatic "
4303 "aggregate initialization");
4305 DECL_INITIAL (decl) = value;
4307 /* ANSI wants warnings about out-of-range constant initializers. */
4308 STRIP_TYPE_NOPS (value);
4309 if (TREE_STATIC (decl))
4310 constant_expression_warning (value);
4312 /* Check if we need to set array size from compound literal size. */
4313 if (TREE_CODE (type) == ARRAY_TYPE
4314 && TYPE_DOMAIN (type) == 0
4315 && value != error_mark_node)
4317 tree inside_init = init;
4319 STRIP_TYPE_NOPS (inside_init);
4320 inside_init = fold (inside_init);
4322 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4324 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4326 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
4328 /* For int foo[] = (int [3]){1}; we need to set array size
4329 now since later on array initializer will be just the
4330 brace enclosed list of the compound literal. */
4331 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
4332 TREE_TYPE (decl) = type;
4333 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
4335 layout_decl (cldecl, 0);
4341 /* Methods for storing and printing names for error messages. */
4343 /* Implement a spelling stack that allows components of a name to be pushed
4344 and popped. Each element on the stack is this structure. */
4351 unsigned HOST_WIDE_INT i;
4356 #define SPELLING_STRING 1
4357 #define SPELLING_MEMBER 2
4358 #define SPELLING_BOUNDS 3
4360 static struct spelling *spelling; /* Next stack element (unused). */
4361 static struct spelling *spelling_base; /* Spelling stack base. */
4362 static int spelling_size; /* Size of the spelling stack. */
4364 /* Macros to save and restore the spelling stack around push_... functions.
4365 Alternative to SAVE_SPELLING_STACK. */
4367 #define SPELLING_DEPTH() (spelling - spelling_base)
4368 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4370 /* Push an element on the spelling stack with type KIND and assign VALUE
4373 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4375 int depth = SPELLING_DEPTH (); \
4377 if (depth >= spelling_size) \
4379 spelling_size += 10; \
4380 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4382 RESTORE_SPELLING_DEPTH (depth); \
4385 spelling->kind = (KIND); \
4386 spelling->MEMBER = (VALUE); \
4390 /* Push STRING on the stack. Printed literally. */
4393 push_string (const char *string)
4395 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4398 /* Push a member name on the stack. Printed as '.' STRING. */
4401 push_member_name (tree decl)
4403 const char *const string
4404 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4405 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4408 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4411 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4413 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4416 /* Compute the maximum size in bytes of the printed spelling. */
4419 spelling_length (void)
4424 for (p = spelling_base; p < spelling; p++)
4426 if (p->kind == SPELLING_BOUNDS)
4429 size += strlen (p->u.s) + 1;
4435 /* Print the spelling to BUFFER and return it. */
4438 print_spelling (char *buffer)
4443 for (p = spelling_base; p < spelling; p++)
4444 if (p->kind == SPELLING_BOUNDS)
4446 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4452 if (p->kind == SPELLING_MEMBER)
4454 for (s = p->u.s; (*d = *s++); d++)
4461 /* Issue an error message for a bad initializer component.
4462 MSGID identifies the message.
4463 The component name is taken from the spelling stack. */
4466 error_init (const char *msgid)
4470 error ("%s", _(msgid));
4471 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4473 error ("(near initialization for %qs)", ofwhat);
4476 /* Issue a pedantic warning for a bad initializer component.
4477 MSGID identifies the message.
4478 The component name is taken from the spelling stack. */
4481 pedwarn_init (const char *msgid)
4485 pedwarn ("%s", _(msgid));
4486 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4488 pedwarn ("(near initialization for %qs)", ofwhat);
4491 /* Issue a warning for a bad initializer component.
4492 MSGID identifies the message.
4493 The component name is taken from the spelling stack. */
4496 warning_init (const char *msgid)
4500 warning (0, "%s", _(msgid));
4501 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4503 warning (0, "(near initialization for %qs)", ofwhat);
4506 /* If TYPE is an array type and EXPR is a parenthesized string
4507 constant, warn if pedantic that EXPR is being used to initialize an
4508 object of type TYPE. */
4511 maybe_warn_string_init (tree type, struct c_expr expr)
4514 && TREE_CODE (type) == ARRAY_TYPE
4515 && TREE_CODE (expr.value) == STRING_CST
4516 && expr.original_code != STRING_CST)
4517 pedwarn_init ("array initialized from parenthesized string constant");
4520 /* Digest the parser output INIT as an initializer for type TYPE.
4521 Return a C expression of type TYPE to represent the initial value.
4523 If INIT is a string constant, STRICT_STRING is true if it is
4524 unparenthesized or we should not warn here for it being parenthesized.
4525 For other types of INIT, STRICT_STRING is not used.
4527 REQUIRE_CONSTANT requests an error if non-constant initializers or
4528 elements are seen. */
4531 digest_init (tree type, tree init, bool strict_string, int require_constant)
4533 enum tree_code code = TREE_CODE (type);
4534 tree inside_init = init;
4536 if (type == error_mark_node
4538 || init == error_mark_node
4539 || TREE_TYPE (init) == error_mark_node)
4540 return error_mark_node;
4542 STRIP_TYPE_NOPS (inside_init);
4544 inside_init = fold (inside_init);
4546 /* Initialization of an array of chars from a string constant
4547 optionally enclosed in braces. */
4549 if (code == ARRAY_TYPE && inside_init
4550 && TREE_CODE (inside_init) == STRING_CST)
4552 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4553 /* Note that an array could be both an array of character type
4554 and an array of wchar_t if wchar_t is signed char or unsigned
4556 bool char_array = (typ1 == char_type_node
4557 || typ1 == signed_char_type_node
4558 || typ1 == unsigned_char_type_node);
4559 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4560 if (char_array || wchar_array)
4564 expr.value = inside_init;
4565 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4566 maybe_warn_string_init (type, expr);
4569 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4572 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4573 TYPE_MAIN_VARIANT (type)))
4576 if (!wchar_array && !char_string)
4578 error_init ("char-array initialized from wide string");
4579 return error_mark_node;
4581 if (char_string && !char_array)
4583 error_init ("wchar_t-array initialized from non-wide string");
4584 return error_mark_node;
4587 TREE_TYPE (inside_init) = type;
4588 if (TYPE_DOMAIN (type) != 0
4589 && TYPE_SIZE (type) != 0
4590 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4591 /* Subtract 1 (or sizeof (wchar_t))
4592 because it's ok to ignore the terminating null char
4593 that is counted in the length of the constant. */
4594 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4595 TREE_STRING_LENGTH (inside_init)
4596 - ((TYPE_PRECISION (typ1)
4597 != TYPE_PRECISION (char_type_node))
4598 ? (TYPE_PRECISION (wchar_type_node)
4601 pedwarn_init ("initializer-string for array of chars is too long");
4605 else if (INTEGRAL_TYPE_P (typ1))
4607 error_init ("array of inappropriate type initialized "
4608 "from string constant");
4609 return error_mark_node;
4613 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4614 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4615 below and handle as a constructor. */
4616 if (code == VECTOR_TYPE
4617 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4618 && vector_types_convertible_p (TREE_TYPE (inside_init), type, true)
4619 && TREE_CONSTANT (inside_init))
4621 if (TREE_CODE (inside_init) == VECTOR_CST
4622 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4623 TYPE_MAIN_VARIANT (type)))
4626 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4628 unsigned HOST_WIDE_INT ix;
4630 bool constant_p = true;
4632 /* Iterate through elements and check if all constructor
4633 elements are *_CSTs. */
4634 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4635 if (!CONSTANT_CLASS_P (value))
4642 return build_vector_from_ctor (type,
4643 CONSTRUCTOR_ELTS (inside_init));
4647 /* Any type can be initialized
4648 from an expression of the same type, optionally with braces. */
4650 if (inside_init && TREE_TYPE (inside_init) != 0
4651 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4652 TYPE_MAIN_VARIANT (type))
4653 || (code == ARRAY_TYPE
4654 && comptypes (TREE_TYPE (inside_init), type))
4655 || (code == VECTOR_TYPE
4656 && comptypes (TREE_TYPE (inside_init), type))
4657 || (code == POINTER_TYPE
4658 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4659 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4660 TREE_TYPE (type)))))
4662 if (code == POINTER_TYPE)
4664 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4666 if (TREE_CODE (inside_init) == STRING_CST
4667 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4668 inside_init = array_to_pointer_conversion (inside_init);
4671 error_init ("invalid use of non-lvalue array");
4672 return error_mark_node;
4677 if (code == VECTOR_TYPE)
4678 /* Although the types are compatible, we may require a
4680 inside_init = convert (type, inside_init);
4682 if (require_constant
4683 && (code == VECTOR_TYPE || !flag_isoc99)
4684 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4686 /* As an extension, allow initializing objects with static storage
4687 duration with compound literals (which are then treated just as
4688 the brace enclosed list they contain). Also allow this for
4689 vectors, as we can only assign them with compound literals. */
4690 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4691 inside_init = DECL_INITIAL (decl);
4694 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4695 && TREE_CODE (inside_init) != CONSTRUCTOR)
4697 error_init ("array initialized from non-constant array expression");
4698 return error_mark_node;
4701 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4702 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4704 /* Compound expressions can only occur here if -pedantic or
4705 -pedantic-errors is specified. In the later case, we always want
4706 an error. In the former case, we simply want a warning. */
4707 if (require_constant && pedantic
4708 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4711 = valid_compound_expr_initializer (inside_init,
4712 TREE_TYPE (inside_init));
4713 if (inside_init == error_mark_node)
4714 error_init ("initializer element is not constant");
4716 pedwarn_init ("initializer element is not constant");
4717 if (flag_pedantic_errors)
4718 inside_init = error_mark_node;
4720 else if (require_constant
4721 && !initializer_constant_valid_p (inside_init,
4722 TREE_TYPE (inside_init)))
4724 error_init ("initializer element is not constant");
4725 inside_init = error_mark_node;
4728 /* Added to enable additional -Wmissing-format-attribute warnings. */
4729 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4730 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4735 /* Handle scalar types, including conversions. */
4737 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4738 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE
4739 || code == VECTOR_TYPE)
4741 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4742 && (TREE_CODE (init) == STRING_CST
4743 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4744 init = array_to_pointer_conversion (init);
4746 = convert_for_assignment (type, init, ic_init,
4747 NULL_TREE, NULL_TREE, 0);
4749 /* Check to see if we have already given an error message. */
4750 if (inside_init == error_mark_node)
4752 else if (require_constant && !TREE_CONSTANT (inside_init))
4754 error_init ("initializer element is not constant");
4755 inside_init = error_mark_node;
4757 else if (require_constant
4758 && !initializer_constant_valid_p (inside_init,
4759 TREE_TYPE (inside_init)))
4761 error_init ("initializer element is not computable at load time");
4762 inside_init = error_mark_node;
4768 /* Come here only for records and arrays. */
4770 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4772 error_init ("variable-sized object may not be initialized");
4773 return error_mark_node;
4776 error_init ("invalid initializer");
4777 return error_mark_node;
4780 /* Handle initializers that use braces. */
4782 /* Type of object we are accumulating a constructor for.
4783 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4784 static tree constructor_type;
4786 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4788 static tree constructor_fields;
4790 /* For an ARRAY_TYPE, this is the specified index
4791 at which to store the next element we get. */
4792 static tree constructor_index;
4794 /* For an ARRAY_TYPE, this is the maximum index. */
4795 static tree constructor_max_index;
4797 /* For a RECORD_TYPE, this is the first field not yet written out. */
4798 static tree constructor_unfilled_fields;
4800 /* For an ARRAY_TYPE, this is the index of the first element
4801 not yet written out. */
4802 static tree constructor_unfilled_index;
4804 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4805 This is so we can generate gaps between fields, when appropriate. */
4806 static tree constructor_bit_index;
4808 /* If we are saving up the elements rather than allocating them,
4809 this is the list of elements so far (in reverse order,
4810 most recent first). */
4811 static VEC(constructor_elt,gc) *constructor_elements;
4813 /* 1 if constructor should be incrementally stored into a constructor chain,
4814 0 if all the elements should be kept in AVL tree. */
4815 static int constructor_incremental;
4817 /* 1 if so far this constructor's elements are all compile-time constants. */
4818 static int constructor_constant;
4820 /* 1 if so far this constructor's elements are all valid address constants. */
4821 static int constructor_simple;
4823 /* 1 if this constructor is erroneous so far. */
4824 static int constructor_erroneous;
4826 /* Structure for managing pending initializer elements, organized as an
4831 struct init_node *left, *right;
4832 struct init_node *parent;
4838 /* Tree of pending elements at this constructor level.
4839 These are elements encountered out of order
4840 which belong at places we haven't reached yet in actually
4842 Will never hold tree nodes across GC runs. */
4843 static struct init_node *constructor_pending_elts;
4845 /* The SPELLING_DEPTH of this constructor. */
4846 static int constructor_depth;
4848 /* DECL node for which an initializer is being read.
4849 0 means we are reading a constructor expression
4850 such as (struct foo) {...}. */
4851 static tree constructor_decl;
4853 /* Nonzero if this is an initializer for a top-level decl. */
4854 static int constructor_top_level;
4856 /* Nonzero if there were any member designators in this initializer. */
4857 static int constructor_designated;
4859 /* Nesting depth of designator list. */
4860 static int designator_depth;
4862 /* Nonzero if there were diagnosed errors in this designator list. */
4863 static int designator_erroneous;
4866 /* This stack has a level for each implicit or explicit level of
4867 structuring in the initializer, including the outermost one. It
4868 saves the values of most of the variables above. */
4870 struct constructor_range_stack;
4872 struct constructor_stack
4874 struct constructor_stack *next;
4879 tree unfilled_index;
4880 tree unfilled_fields;
4882 VEC(constructor_elt,gc) *elements;
4883 struct init_node *pending_elts;
4886 /* If value nonzero, this value should replace the entire
4887 constructor at this level. */
4888 struct c_expr replacement_value;
4889 struct constructor_range_stack *range_stack;
4899 static struct constructor_stack *constructor_stack;
4901 /* This stack represents designators from some range designator up to
4902 the last designator in the list. */
4904 struct constructor_range_stack
4906 struct constructor_range_stack *next, *prev;
4907 struct constructor_stack *stack;
4914 static struct constructor_range_stack *constructor_range_stack;
4916 /* This stack records separate initializers that are nested.
4917 Nested initializers can't happen in ANSI C, but GNU C allows them
4918 in cases like { ... (struct foo) { ... } ... }. */
4920 struct initializer_stack
4922 struct initializer_stack *next;
4924 struct constructor_stack *constructor_stack;
4925 struct constructor_range_stack *constructor_range_stack;
4926 VEC(constructor_elt,gc) *elements;
4927 struct spelling *spelling;
4928 struct spelling *spelling_base;
4931 char require_constant_value;
4932 char require_constant_elements;
4935 static struct initializer_stack *initializer_stack;
4937 /* Prepare to parse and output the initializer for variable DECL. */
4940 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
4943 struct initializer_stack *p = XNEW (struct initializer_stack);
4945 p->decl = constructor_decl;
4946 p->require_constant_value = require_constant_value;
4947 p->require_constant_elements = require_constant_elements;
4948 p->constructor_stack = constructor_stack;
4949 p->constructor_range_stack = constructor_range_stack;
4950 p->elements = constructor_elements;
4951 p->spelling = spelling;
4952 p->spelling_base = spelling_base;
4953 p->spelling_size = spelling_size;
4954 p->top_level = constructor_top_level;
4955 p->next = initializer_stack;
4956 initializer_stack = p;
4958 constructor_decl = decl;
4959 constructor_designated = 0;
4960 constructor_top_level = top_level;
4962 if (decl != 0 && decl != error_mark_node)
4964 require_constant_value = TREE_STATIC (decl);
4965 require_constant_elements
4966 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
4967 /* For a scalar, you can always use any value to initialize,
4968 even within braces. */
4969 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
4970 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
4971 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
4972 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
4973 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
4977 require_constant_value = 0;
4978 require_constant_elements = 0;
4979 locus = "(anonymous)";
4982 constructor_stack = 0;
4983 constructor_range_stack = 0;
4985 missing_braces_mentioned = 0;
4989 RESTORE_SPELLING_DEPTH (0);
4992 push_string (locus);
4998 struct initializer_stack *p = initializer_stack;
5000 /* Free the whole constructor stack of this initializer. */
5001 while (constructor_stack)
5003 struct constructor_stack *q = constructor_stack;
5004 constructor_stack = q->next;
5008 gcc_assert (!constructor_range_stack);
5010 /* Pop back to the data of the outer initializer (if any). */
5011 free (spelling_base);
5013 constructor_decl = p->decl;
5014 require_constant_value = p->require_constant_value;
5015 require_constant_elements = p->require_constant_elements;
5016 constructor_stack = p->constructor_stack;
5017 constructor_range_stack = p->constructor_range_stack;
5018 constructor_elements = p->elements;
5019 spelling = p->spelling;
5020 spelling_base = p->spelling_base;
5021 spelling_size = p->spelling_size;
5022 constructor_top_level = p->top_level;
5023 initializer_stack = p->next;
5027 /* Call here when we see the initializer is surrounded by braces.
5028 This is instead of a call to push_init_level;
5029 it is matched by a call to pop_init_level.
5031 TYPE is the type to initialize, for a constructor expression.
5032 For an initializer for a decl, TYPE is zero. */
5035 really_start_incremental_init (tree type)
5037 struct constructor_stack *p = XNEW (struct constructor_stack);
5040 type = TREE_TYPE (constructor_decl);
5042 if (targetm.vector_opaque_p (type))
5043 error ("opaque vector types cannot be initialized");
5045 p->type = constructor_type;
5046 p->fields = constructor_fields;
5047 p->index = constructor_index;
5048 p->max_index = constructor_max_index;
5049 p->unfilled_index = constructor_unfilled_index;
5050 p->unfilled_fields = constructor_unfilled_fields;
5051 p->bit_index = constructor_bit_index;
5052 p->elements = constructor_elements;
5053 p->constant = constructor_constant;
5054 p->simple = constructor_simple;
5055 p->erroneous = constructor_erroneous;
5056 p->pending_elts = constructor_pending_elts;
5057 p->depth = constructor_depth;
5058 p->replacement_value.value = 0;
5059 p->replacement_value.original_code = ERROR_MARK;
5063 p->incremental = constructor_incremental;
5064 p->designated = constructor_designated;
5066 constructor_stack = p;
5068 constructor_constant = 1;
5069 constructor_simple = 1;
5070 constructor_depth = SPELLING_DEPTH ();
5071 constructor_elements = 0;
5072 constructor_pending_elts = 0;
5073 constructor_type = type;
5074 constructor_incremental = 1;
5075 constructor_designated = 0;
5076 designator_depth = 0;
5077 designator_erroneous = 0;
5079 if (TREE_CODE (constructor_type) == RECORD_TYPE
5080 || TREE_CODE (constructor_type) == UNION_TYPE)
5082 constructor_fields = TYPE_FIELDS (constructor_type);
5083 /* Skip any nameless bit fields at the beginning. */
5084 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5085 && DECL_NAME (constructor_fields) == 0)
5086 constructor_fields = TREE_CHAIN (constructor_fields);
5088 constructor_unfilled_fields = constructor_fields;
5089 constructor_bit_index = bitsize_zero_node;
5091 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5093 if (TYPE_DOMAIN (constructor_type))
5095 constructor_max_index
5096 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5098 /* Detect non-empty initializations of zero-length arrays. */
5099 if (constructor_max_index == NULL_TREE
5100 && TYPE_SIZE (constructor_type))
5101 constructor_max_index = build_int_cst (NULL_TREE, -1);
5103 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5104 to initialize VLAs will cause a proper error; avoid tree
5105 checking errors as well by setting a safe value. */
5106 if (constructor_max_index
5107 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5108 constructor_max_index = build_int_cst (NULL_TREE, -1);
5111 = convert (bitsizetype,
5112 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5116 constructor_index = bitsize_zero_node;
5117 constructor_max_index = NULL_TREE;
5120 constructor_unfilled_index = constructor_index;
5122 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5124 /* Vectors are like simple fixed-size arrays. */
5125 constructor_max_index =
5126 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5127 constructor_index = bitsize_zero_node;
5128 constructor_unfilled_index = constructor_index;
5132 /* Handle the case of int x = {5}; */
5133 constructor_fields = constructor_type;
5134 constructor_unfilled_fields = constructor_type;
5138 /* Push down into a subobject, for initialization.
5139 If this is for an explicit set of braces, IMPLICIT is 0.
5140 If it is because the next element belongs at a lower level,
5141 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5144 push_init_level (int implicit)
5146 struct constructor_stack *p;
5147 tree value = NULL_TREE;
5149 /* If we've exhausted any levels that didn't have braces,
5150 pop them now. If implicit == 1, this will have been done in
5151 process_init_element; do not repeat it here because in the case
5152 of excess initializers for an empty aggregate this leads to an
5153 infinite cycle of popping a level and immediately recreating
5157 while (constructor_stack->implicit)
5159 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5160 || TREE_CODE (constructor_type) == UNION_TYPE)
5161 && constructor_fields == 0)
5162 process_init_element (pop_init_level (1));
5163 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5164 && constructor_max_index
5165 && tree_int_cst_lt (constructor_max_index,
5167 process_init_element (pop_init_level (1));
5173 /* Unless this is an explicit brace, we need to preserve previous
5177 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5178 || TREE_CODE (constructor_type) == UNION_TYPE)
5179 && constructor_fields)
5180 value = find_init_member (constructor_fields);
5181 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5182 value = find_init_member (constructor_index);
5185 p = XNEW (struct constructor_stack);
5186 p->type = constructor_type;
5187 p->fields = constructor_fields;
5188 p->index = constructor_index;
5189 p->max_index = constructor_max_index;
5190 p->unfilled_index = constructor_unfilled_index;
5191 p->unfilled_fields = constructor_unfilled_fields;
5192 p->bit_index = constructor_bit_index;
5193 p->elements = constructor_elements;
5194 p->constant = constructor_constant;
5195 p->simple = constructor_simple;
5196 p->erroneous = constructor_erroneous;
5197 p->pending_elts = constructor_pending_elts;
5198 p->depth = constructor_depth;
5199 p->replacement_value.value = 0;
5200 p->replacement_value.original_code = ERROR_MARK;
5201 p->implicit = implicit;
5203 p->incremental = constructor_incremental;
5204 p->designated = constructor_designated;
5205 p->next = constructor_stack;
5207 constructor_stack = p;
5209 constructor_constant = 1;
5210 constructor_simple = 1;
5211 constructor_depth = SPELLING_DEPTH ();
5212 constructor_elements = 0;
5213 constructor_incremental = 1;
5214 constructor_designated = 0;
5215 constructor_pending_elts = 0;
5218 p->range_stack = constructor_range_stack;
5219 constructor_range_stack = 0;
5220 designator_depth = 0;
5221 designator_erroneous = 0;
5224 /* Don't die if an entire brace-pair level is superfluous
5225 in the containing level. */
5226 if (constructor_type == 0)
5228 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5229 || TREE_CODE (constructor_type) == UNION_TYPE)
5231 /* Don't die if there are extra init elts at the end. */
5232 if (constructor_fields == 0)
5233 constructor_type = 0;
5236 constructor_type = TREE_TYPE (constructor_fields);
5237 push_member_name (constructor_fields);
5238 constructor_depth++;
5241 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5243 constructor_type = TREE_TYPE (constructor_type);
5244 push_array_bounds (tree_low_cst (constructor_index, 1));
5245 constructor_depth++;
5248 if (constructor_type == 0)
5250 error_init ("extra brace group at end of initializer");
5251 constructor_fields = 0;
5252 constructor_unfilled_fields = 0;
5256 if (value && TREE_CODE (value) == CONSTRUCTOR)
5258 constructor_constant = TREE_CONSTANT (value);
5259 constructor_simple = TREE_STATIC (value);
5260 constructor_elements = CONSTRUCTOR_ELTS (value);
5261 if (!VEC_empty (constructor_elt, constructor_elements)
5262 && (TREE_CODE (constructor_type) == RECORD_TYPE
5263 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5264 set_nonincremental_init ();
5267 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5269 missing_braces_mentioned = 1;
5270 warning_init ("missing braces around initializer");
5273 if (TREE_CODE (constructor_type) == RECORD_TYPE
5274 || TREE_CODE (constructor_type) == UNION_TYPE)
5276 constructor_fields = TYPE_FIELDS (constructor_type);
5277 /* Skip any nameless bit fields at the beginning. */
5278 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5279 && DECL_NAME (constructor_fields) == 0)
5280 constructor_fields = TREE_CHAIN (constructor_fields);
5282 constructor_unfilled_fields = constructor_fields;
5283 constructor_bit_index = bitsize_zero_node;
5285 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5287 /* Vectors are like simple fixed-size arrays. */
5288 constructor_max_index =
5289 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5290 constructor_index = convert (bitsizetype, integer_zero_node);
5291 constructor_unfilled_index = constructor_index;
5293 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5295 if (TYPE_DOMAIN (constructor_type))
5297 constructor_max_index
5298 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5300 /* Detect non-empty initializations of zero-length arrays. */
5301 if (constructor_max_index == NULL_TREE
5302 && TYPE_SIZE (constructor_type))
5303 constructor_max_index = build_int_cst (NULL_TREE, -1);
5305 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5306 to initialize VLAs will cause a proper error; avoid tree
5307 checking errors as well by setting a safe value. */
5308 if (constructor_max_index
5309 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5310 constructor_max_index = build_int_cst (NULL_TREE, -1);
5313 = convert (bitsizetype,
5314 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5317 constructor_index = bitsize_zero_node;
5319 constructor_unfilled_index = constructor_index;
5320 if (value && TREE_CODE (value) == STRING_CST)
5322 /* We need to split the char/wchar array into individual
5323 characters, so that we don't have to special case it
5325 set_nonincremental_init_from_string (value);
5330 if (constructor_type != error_mark_node)
5331 warning_init ("braces around scalar initializer");
5332 constructor_fields = constructor_type;
5333 constructor_unfilled_fields = constructor_type;
5337 /* At the end of an implicit or explicit brace level,
5338 finish up that level of constructor. If a single expression
5339 with redundant braces initialized that level, return the
5340 c_expr structure for that expression. Otherwise, the original_code
5341 element is set to ERROR_MARK.
5342 If we were outputting the elements as they are read, return 0 as the value
5343 from inner levels (process_init_element ignores that),
5344 but return error_mark_node as the value from the outermost level
5345 (that's what we want to put in DECL_INITIAL).
5346 Otherwise, return a CONSTRUCTOR expression as the value. */
5349 pop_init_level (int implicit)
5351 struct constructor_stack *p;
5354 ret.original_code = ERROR_MARK;
5358 /* When we come to an explicit close brace,
5359 pop any inner levels that didn't have explicit braces. */
5360 while (constructor_stack->implicit)
5361 process_init_element (pop_init_level (1));
5363 gcc_assert (!constructor_range_stack);
5366 /* Now output all pending elements. */
5367 constructor_incremental = 1;
5368 output_pending_init_elements (1);
5370 p = constructor_stack;
5372 /* Error for initializing a flexible array member, or a zero-length
5373 array member in an inappropriate context. */
5374 if (constructor_type && constructor_fields
5375 && TREE_CODE (constructor_type) == ARRAY_TYPE
5376 && TYPE_DOMAIN (constructor_type)
5377 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5379 /* Silently discard empty initializations. The parser will
5380 already have pedwarned for empty brackets. */
5381 if (integer_zerop (constructor_unfilled_index))
5382 constructor_type = NULL_TREE;
5385 gcc_assert (!TYPE_SIZE (constructor_type));
5387 if (constructor_depth > 2)
5388 error_init ("initialization of flexible array member in a nested context");
5390 pedwarn_init ("initialization of a flexible array member");
5392 /* We have already issued an error message for the existence
5393 of a flexible array member not at the end of the structure.
5394 Discard the initializer so that we do not die later. */
5395 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5396 constructor_type = NULL_TREE;
5400 /* Warn when some struct elements are implicitly initialized to zero. */
5401 if (warn_missing_field_initializers
5403 && TREE_CODE (constructor_type) == RECORD_TYPE
5404 && constructor_unfilled_fields)
5406 /* Do not warn for flexible array members or zero-length arrays. */
5407 while (constructor_unfilled_fields
5408 && (!DECL_SIZE (constructor_unfilled_fields)
5409 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5410 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5412 /* Do not warn if this level of the initializer uses member
5413 designators; it is likely to be deliberate. */
5414 if (constructor_unfilled_fields && !constructor_designated)
5416 push_member_name (constructor_unfilled_fields);
5417 warning_init ("missing initializer");
5418 RESTORE_SPELLING_DEPTH (constructor_depth);
5422 /* Pad out the end of the structure. */
5423 if (p->replacement_value.value)
5424 /* If this closes a superfluous brace pair,
5425 just pass out the element between them. */
5426 ret = p->replacement_value;
5427 else if (constructor_type == 0)
5429 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5430 && TREE_CODE (constructor_type) != UNION_TYPE
5431 && TREE_CODE (constructor_type) != ARRAY_TYPE
5432 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5434 /* A nonincremental scalar initializer--just return
5435 the element, after verifying there is just one. */
5436 if (VEC_empty (constructor_elt,constructor_elements))
5438 if (!constructor_erroneous)
5439 error_init ("empty scalar initializer");
5440 ret.value = error_mark_node;
5442 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5444 error_init ("extra elements in scalar initializer");
5445 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5448 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5452 if (constructor_erroneous)
5453 ret.value = error_mark_node;
5456 ret.value = build_constructor (constructor_type,
5457 constructor_elements);
5458 if (constructor_constant)
5459 TREE_CONSTANT (ret.value) = TREE_INVARIANT (ret.value) = 1;
5460 if (constructor_constant && constructor_simple)
5461 TREE_STATIC (ret.value) = 1;
5465 constructor_type = p->type;
5466 constructor_fields = p->fields;
5467 constructor_index = p->index;
5468 constructor_max_index = p->max_index;
5469 constructor_unfilled_index = p->unfilled_index;
5470 constructor_unfilled_fields = p->unfilled_fields;
5471 constructor_bit_index = p->bit_index;
5472 constructor_elements = p->elements;
5473 constructor_constant = p->constant;
5474 constructor_simple = p->simple;
5475 constructor_erroneous = p->erroneous;
5476 constructor_incremental = p->incremental;
5477 constructor_designated = p->designated;
5478 constructor_pending_elts = p->pending_elts;
5479 constructor_depth = p->depth;
5481 constructor_range_stack = p->range_stack;
5482 RESTORE_SPELLING_DEPTH (constructor_depth);
5484 constructor_stack = p->next;
5487 if (ret.value == 0 && constructor_stack == 0)
5488 ret.value = error_mark_node;
5492 /* Common handling for both array range and field name designators.
5493 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5496 set_designator (int array)
5499 enum tree_code subcode;
5501 /* Don't die if an entire brace-pair level is superfluous
5502 in the containing level. */
5503 if (constructor_type == 0)
5506 /* If there were errors in this designator list already, bail out
5508 if (designator_erroneous)
5511 if (!designator_depth)
5513 gcc_assert (!constructor_range_stack);
5515 /* Designator list starts at the level of closest explicit
5517 while (constructor_stack->implicit)
5518 process_init_element (pop_init_level (1));
5519 constructor_designated = 1;
5523 switch (TREE_CODE (constructor_type))
5527 subtype = TREE_TYPE (constructor_fields);
5528 if (subtype != error_mark_node)
5529 subtype = TYPE_MAIN_VARIANT (subtype);
5532 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5538 subcode = TREE_CODE (subtype);
5539 if (array && subcode != ARRAY_TYPE)
5541 error_init ("array index in non-array initializer");
5544 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5546 error_init ("field name not in record or union initializer");
5550 constructor_designated = 1;
5551 push_init_level (2);
5555 /* If there are range designators in designator list, push a new designator
5556 to constructor_range_stack. RANGE_END is end of such stack range or
5557 NULL_TREE if there is no range designator at this level. */
5560 push_range_stack (tree range_end)
5562 struct constructor_range_stack *p;
5564 p = GGC_NEW (struct constructor_range_stack);
5565 p->prev = constructor_range_stack;
5567 p->fields = constructor_fields;
5568 p->range_start = constructor_index;
5569 p->index = constructor_index;
5570 p->stack = constructor_stack;
5571 p->range_end = range_end;
5572 if (constructor_range_stack)
5573 constructor_range_stack->next = p;
5574 constructor_range_stack = p;
5577 /* Within an array initializer, specify the next index to be initialized.
5578 FIRST is that index. If LAST is nonzero, then initialize a range
5579 of indices, running from FIRST through LAST. */
5582 set_init_index (tree first, tree last)
5584 if (set_designator (1))
5587 designator_erroneous = 1;
5589 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5590 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5592 error_init ("array index in initializer not of integer type");
5596 if (TREE_CODE (first) != INTEGER_CST)
5597 error_init ("nonconstant array index in initializer");
5598 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5599 error_init ("nonconstant array index in initializer");
5600 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5601 error_init ("array index in non-array initializer");
5602 else if (tree_int_cst_sgn (first) == -1)
5603 error_init ("array index in initializer exceeds array bounds");
5604 else if (constructor_max_index
5605 && tree_int_cst_lt (constructor_max_index, first))
5606 error_init ("array index in initializer exceeds array bounds");
5609 constructor_index = convert (bitsizetype, first);
5613 if (tree_int_cst_equal (first, last))
5615 else if (tree_int_cst_lt (last, first))
5617 error_init ("empty index range in initializer");
5622 last = convert (bitsizetype, last);
5623 if (constructor_max_index != 0
5624 && tree_int_cst_lt (constructor_max_index, last))
5626 error_init ("array index range in initializer exceeds array bounds");
5633 designator_erroneous = 0;
5634 if (constructor_range_stack || last)
5635 push_range_stack (last);
5639 /* Within a struct initializer, specify the next field to be initialized. */
5642 set_init_label (tree fieldname)
5646 if (set_designator (0))
5649 designator_erroneous = 1;
5651 if (TREE_CODE (constructor_type) != RECORD_TYPE
5652 && TREE_CODE (constructor_type) != UNION_TYPE)
5654 error_init ("field name not in record or union initializer");
5658 for (tail = TYPE_FIELDS (constructor_type); tail;
5659 tail = TREE_CHAIN (tail))
5661 if (DECL_NAME (tail) == fieldname)
5666 error ("unknown field %qE specified in initializer", fieldname);
5669 constructor_fields = tail;
5671 designator_erroneous = 0;
5672 if (constructor_range_stack)
5673 push_range_stack (NULL_TREE);
5677 /* Add a new initializer to the tree of pending initializers. PURPOSE
5678 identifies the initializer, either array index or field in a structure.
5679 VALUE is the value of that index or field. */
5682 add_pending_init (tree purpose, tree value)
5684 struct init_node *p, **q, *r;
5686 q = &constructor_pending_elts;
5689 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5694 if (tree_int_cst_lt (purpose, p->purpose))
5696 else if (tree_int_cst_lt (p->purpose, purpose))
5700 if (TREE_SIDE_EFFECTS (p->value))
5701 warning_init ("initialized field with side-effects overwritten");
5702 else if (warn_override_init)
5703 warning_init ("initialized field overwritten");
5713 bitpos = bit_position (purpose);
5717 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5719 else if (p->purpose != purpose)
5723 if (TREE_SIDE_EFFECTS (p->value))
5724 warning_init ("initialized field with side-effects overwritten");
5725 else if (warn_override_init)
5726 warning_init ("initialized field overwritten");
5733 r = GGC_NEW (struct init_node);
5734 r->purpose = purpose;
5745 struct init_node *s;
5749 if (p->balance == 0)
5751 else if (p->balance < 0)
5758 p->left->parent = p;
5775 constructor_pending_elts = r;
5780 struct init_node *t = r->right;
5784 r->right->parent = r;
5789 p->left->parent = p;
5792 p->balance = t->balance < 0;
5793 r->balance = -(t->balance > 0);
5808 constructor_pending_elts = t;
5814 /* p->balance == +1; growth of left side balances the node. */
5819 else /* r == p->right */
5821 if (p->balance == 0)
5822 /* Growth propagation from right side. */
5824 else if (p->balance > 0)
5831 p->right->parent = p;
5848 constructor_pending_elts = r;
5850 else /* r->balance == -1 */
5853 struct init_node *t = r->left;
5857 r->left->parent = r;
5862 p->right->parent = p;
5865 r->balance = (t->balance < 0);
5866 p->balance = -(t->balance > 0);
5881 constructor_pending_elts = t;
5887 /* p->balance == -1; growth of right side balances the node. */
5898 /* Build AVL tree from a sorted chain. */
5901 set_nonincremental_init (void)
5903 unsigned HOST_WIDE_INT ix;
5906 if (TREE_CODE (constructor_type) != RECORD_TYPE
5907 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5910 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
5911 add_pending_init (index, value);
5912 constructor_elements = 0;
5913 if (TREE_CODE (constructor_type) == RECORD_TYPE)
5915 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
5916 /* Skip any nameless bit fields at the beginning. */
5917 while (constructor_unfilled_fields != 0
5918 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5919 && DECL_NAME (constructor_unfilled_fields) == 0)
5920 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5923 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5925 if (TYPE_DOMAIN (constructor_type))
5926 constructor_unfilled_index
5927 = convert (bitsizetype,
5928 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5930 constructor_unfilled_index = bitsize_zero_node;
5932 constructor_incremental = 0;
5935 /* Build AVL tree from a string constant. */
5938 set_nonincremental_init_from_string (tree str)
5940 tree value, purpose, type;
5941 HOST_WIDE_INT val[2];
5942 const char *p, *end;
5943 int byte, wchar_bytes, charwidth, bitpos;
5945 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
5947 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5948 == TYPE_PRECISION (char_type_node))
5952 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5953 == TYPE_PRECISION (wchar_type_node));
5954 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
5956 charwidth = TYPE_PRECISION (char_type_node);
5957 type = TREE_TYPE (constructor_type);
5958 p = TREE_STRING_POINTER (str);
5959 end = p + TREE_STRING_LENGTH (str);
5961 for (purpose = bitsize_zero_node;
5962 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
5963 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
5965 if (wchar_bytes == 1)
5967 val[1] = (unsigned char) *p++;
5974 for (byte = 0; byte < wchar_bytes; byte++)
5976 if (BYTES_BIG_ENDIAN)
5977 bitpos = (wchar_bytes - byte - 1) * charwidth;
5979 bitpos = byte * charwidth;
5980 val[bitpos < HOST_BITS_PER_WIDE_INT]
5981 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
5982 << (bitpos % HOST_BITS_PER_WIDE_INT);
5986 if (!TYPE_UNSIGNED (type))
5988 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
5989 if (bitpos < HOST_BITS_PER_WIDE_INT)
5991 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
5993 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
5997 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6002 else if (val[0] & (((HOST_WIDE_INT) 1)
6003 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6004 val[0] |= ((HOST_WIDE_INT) -1)
6005 << (bitpos - HOST_BITS_PER_WIDE_INT);
6008 value = build_int_cst_wide (type, val[1], val[0]);
6009 add_pending_init (purpose, value);
6012 constructor_incremental = 0;
6015 /* Return value of FIELD in pending initializer or zero if the field was
6016 not initialized yet. */
6019 find_init_member (tree field)
6021 struct init_node *p;
6023 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6025 if (constructor_incremental
6026 && tree_int_cst_lt (field, constructor_unfilled_index))
6027 set_nonincremental_init ();
6029 p = constructor_pending_elts;
6032 if (tree_int_cst_lt (field, p->purpose))
6034 else if (tree_int_cst_lt (p->purpose, field))
6040 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6042 tree bitpos = bit_position (field);
6044 if (constructor_incremental
6045 && (!constructor_unfilled_fields
6046 || tree_int_cst_lt (bitpos,
6047 bit_position (constructor_unfilled_fields))))
6048 set_nonincremental_init ();
6050 p = constructor_pending_elts;
6053 if (field == p->purpose)
6055 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6061 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6063 if (!VEC_empty (constructor_elt, constructor_elements)
6064 && (VEC_last (constructor_elt, constructor_elements)->index
6066 return VEC_last (constructor_elt, constructor_elements)->value;
6071 /* "Output" the next constructor element.
6072 At top level, really output it to assembler code now.
6073 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6074 TYPE is the data type that the containing data type wants here.
6075 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6076 If VALUE is a string constant, STRICT_STRING is true if it is
6077 unparenthesized or we should not warn here for it being parenthesized.
6078 For other types of VALUE, STRICT_STRING is not used.
6080 PENDING if non-nil means output pending elements that belong
6081 right after this element. (PENDING is normally 1;
6082 it is 0 while outputting pending elements, to avoid recursion.) */
6085 output_init_element (tree value, bool strict_string, tree type, tree field,
6088 constructor_elt *celt;
6090 if (type == error_mark_node || value == error_mark_node)
6092 constructor_erroneous = 1;
6095 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6096 && (TREE_CODE (value) == STRING_CST
6097 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6098 && !(TREE_CODE (value) == STRING_CST
6099 && TREE_CODE (type) == ARRAY_TYPE
6100 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6101 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6102 TYPE_MAIN_VARIANT (type)))
6103 value = array_to_pointer_conversion (value);
6105 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6106 && require_constant_value && !flag_isoc99 && pending)
6108 /* As an extension, allow initializing objects with static storage
6109 duration with compound literals (which are then treated just as
6110 the brace enclosed list they contain). */
6111 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6112 value = DECL_INITIAL (decl);
6115 if (value == error_mark_node)
6116 constructor_erroneous = 1;
6117 else if (!TREE_CONSTANT (value))
6118 constructor_constant = 0;
6119 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6120 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6121 || TREE_CODE (constructor_type) == UNION_TYPE)
6122 && DECL_C_BIT_FIELD (field)
6123 && TREE_CODE (value) != INTEGER_CST))
6124 constructor_simple = 0;
6126 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6128 if (require_constant_value)
6130 error_init ("initializer element is not constant");
6131 value = error_mark_node;
6133 else if (require_constant_elements)
6134 pedwarn ("initializer element is not computable at load time");
6137 /* If this field is empty (and not at the end of structure),
6138 don't do anything other than checking the initializer. */
6140 && (TREE_TYPE (field) == error_mark_node
6141 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6142 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6143 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6144 || TREE_CHAIN (field)))))
6147 value = digest_init (type, value, strict_string, require_constant_value);
6148 if (value == error_mark_node)
6150 constructor_erroneous = 1;
6154 /* If this element doesn't come next in sequence,
6155 put it on constructor_pending_elts. */
6156 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6157 && (!constructor_incremental
6158 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6160 if (constructor_incremental
6161 && tree_int_cst_lt (field, constructor_unfilled_index))
6162 set_nonincremental_init ();
6164 add_pending_init (field, value);
6167 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6168 && (!constructor_incremental
6169 || field != constructor_unfilled_fields))
6171 /* We do this for records but not for unions. In a union,
6172 no matter which field is specified, it can be initialized
6173 right away since it starts at the beginning of the union. */
6174 if (constructor_incremental)
6176 if (!constructor_unfilled_fields)
6177 set_nonincremental_init ();
6180 tree bitpos, unfillpos;
6182 bitpos = bit_position (field);
6183 unfillpos = bit_position (constructor_unfilled_fields);
6185 if (tree_int_cst_lt (bitpos, unfillpos))
6186 set_nonincremental_init ();
6190 add_pending_init (field, value);
6193 else if (TREE_CODE (constructor_type) == UNION_TYPE
6194 && !VEC_empty (constructor_elt, constructor_elements))
6196 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6197 constructor_elements)->value))
6198 warning_init ("initialized field with side-effects overwritten");
6199 else if (warn_override_init)
6200 warning_init ("initialized field overwritten");
6202 /* We can have just one union field set. */
6203 constructor_elements = 0;
6206 /* Otherwise, output this element either to
6207 constructor_elements or to the assembler file. */
6209 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6210 celt->index = field;
6211 celt->value = value;
6213 /* Advance the variable that indicates sequential elements output. */
6214 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6215 constructor_unfilled_index
6216 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6218 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6220 constructor_unfilled_fields
6221 = TREE_CHAIN (constructor_unfilled_fields);
6223 /* Skip any nameless bit fields. */
6224 while (constructor_unfilled_fields != 0
6225 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6226 && DECL_NAME (constructor_unfilled_fields) == 0)
6227 constructor_unfilled_fields =
6228 TREE_CHAIN (constructor_unfilled_fields);
6230 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6231 constructor_unfilled_fields = 0;
6233 /* Now output any pending elements which have become next. */
6235 output_pending_init_elements (0);
6238 /* Output any pending elements which have become next.
6239 As we output elements, constructor_unfilled_{fields,index}
6240 advances, which may cause other elements to become next;
6241 if so, they too are output.
6243 If ALL is 0, we return when there are
6244 no more pending elements to output now.
6246 If ALL is 1, we output space as necessary so that
6247 we can output all the pending elements. */
6250 output_pending_init_elements (int all)
6252 struct init_node *elt = constructor_pending_elts;
6257 /* Look through the whole pending tree.
6258 If we find an element that should be output now,
6259 output it. Otherwise, set NEXT to the element
6260 that comes first among those still pending. */
6265 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6267 if (tree_int_cst_equal (elt->purpose,
6268 constructor_unfilled_index))
6269 output_init_element (elt->value, true,
6270 TREE_TYPE (constructor_type),
6271 constructor_unfilled_index, 0);
6272 else if (tree_int_cst_lt (constructor_unfilled_index,
6275 /* Advance to the next smaller node. */
6280 /* We have reached the smallest node bigger than the
6281 current unfilled index. Fill the space first. */
6282 next = elt->purpose;
6288 /* Advance to the next bigger node. */
6293 /* We have reached the biggest node in a subtree. Find
6294 the parent of it, which is the next bigger node. */
6295 while (elt->parent && elt->parent->right == elt)
6298 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6301 next = elt->purpose;
6307 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6308 || TREE_CODE (constructor_type) == UNION_TYPE)
6310 tree ctor_unfilled_bitpos, elt_bitpos;
6312 /* If the current record is complete we are done. */
6313 if (constructor_unfilled_fields == 0)
6316 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6317 elt_bitpos = bit_position (elt->purpose);
6318 /* We can't compare fields here because there might be empty
6319 fields in between. */
6320 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6322 constructor_unfilled_fields = elt->purpose;
6323 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6326 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6328 /* Advance to the next smaller node. */
6333 /* We have reached the smallest node bigger than the
6334 current unfilled field. Fill the space first. */
6335 next = elt->purpose;
6341 /* Advance to the next bigger node. */
6346 /* We have reached the biggest node in a subtree. Find
6347 the parent of it, which is the next bigger node. */
6348 while (elt->parent && elt->parent->right == elt)
6352 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6353 bit_position (elt->purpose))))
6355 next = elt->purpose;
6363 /* Ordinarily return, but not if we want to output all
6364 and there are elements left. */
6365 if (!(all && next != 0))
6368 /* If it's not incremental, just skip over the gap, so that after
6369 jumping to retry we will output the next successive element. */
6370 if (TREE_CODE (constructor_type) == RECORD_TYPE
6371 || TREE_CODE (constructor_type) == UNION_TYPE)
6372 constructor_unfilled_fields = next;
6373 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6374 constructor_unfilled_index = next;
6376 /* ELT now points to the node in the pending tree with the next
6377 initializer to output. */
6381 /* Add one non-braced element to the current constructor level.
6382 This adjusts the current position within the constructor's type.
6383 This may also start or terminate implicit levels
6384 to handle a partly-braced initializer.
6386 Once this has found the correct level for the new element,
6387 it calls output_init_element. */
6390 process_init_element (struct c_expr value)
6392 tree orig_value = value.value;
6393 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6394 bool strict_string = value.original_code == STRING_CST;
6396 designator_depth = 0;
6397 designator_erroneous = 0;
6399 /* Handle superfluous braces around string cst as in
6400 char x[] = {"foo"}; */
6403 && TREE_CODE (constructor_type) == ARRAY_TYPE
6404 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6405 && integer_zerop (constructor_unfilled_index))
6407 if (constructor_stack->replacement_value.value)
6408 error_init ("excess elements in char array initializer");
6409 constructor_stack->replacement_value = value;
6413 if (constructor_stack->replacement_value.value != 0)
6415 error_init ("excess elements in struct initializer");
6419 /* Ignore elements of a brace group if it is entirely superfluous
6420 and has already been diagnosed. */
6421 if (constructor_type == 0)
6424 /* If we've exhausted any levels that didn't have braces,
6426 while (constructor_stack->implicit)
6428 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6429 || TREE_CODE (constructor_type) == UNION_TYPE)
6430 && constructor_fields == 0)
6431 process_init_element (pop_init_level (1));
6432 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6433 && (constructor_max_index == 0
6434 || tree_int_cst_lt (constructor_max_index,
6435 constructor_index)))
6436 process_init_element (pop_init_level (1));
6441 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6442 if (constructor_range_stack)
6444 /* If value is a compound literal and we'll be just using its
6445 content, don't put it into a SAVE_EXPR. */
6446 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6447 || !require_constant_value
6449 value.value = save_expr (value.value);
6454 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6457 enum tree_code fieldcode;
6459 if (constructor_fields == 0)
6461 pedwarn_init ("excess elements in struct initializer");
6465 fieldtype = TREE_TYPE (constructor_fields);
6466 if (fieldtype != error_mark_node)
6467 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6468 fieldcode = TREE_CODE (fieldtype);
6470 /* Error for non-static initialization of a flexible array member. */
6471 if (fieldcode == ARRAY_TYPE
6472 && !require_constant_value
6473 && TYPE_SIZE (fieldtype) == NULL_TREE
6474 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6476 error_init ("non-static initialization of a flexible array member");
6480 /* Accept a string constant to initialize a subarray. */
6481 if (value.value != 0
6482 && fieldcode == ARRAY_TYPE
6483 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6485 value.value = orig_value;
6486 /* Otherwise, if we have come to a subaggregate,
6487 and we don't have an element of its type, push into it. */
6488 else if (value.value != 0
6489 && value.value != error_mark_node
6490 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6491 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6492 || fieldcode == UNION_TYPE))
6494 push_init_level (1);
6500 push_member_name (constructor_fields);
6501 output_init_element (value.value, strict_string,
6502 fieldtype, constructor_fields, 1);
6503 RESTORE_SPELLING_DEPTH (constructor_depth);
6506 /* Do the bookkeeping for an element that was
6507 directly output as a constructor. */
6509 /* For a record, keep track of end position of last field. */
6510 if (DECL_SIZE (constructor_fields))
6511 constructor_bit_index
6512 = size_binop (PLUS_EXPR,
6513 bit_position (constructor_fields),
6514 DECL_SIZE (constructor_fields));
6516 /* If the current field was the first one not yet written out,
6517 it isn't now, so update. */
6518 if (constructor_unfilled_fields == constructor_fields)
6520 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6521 /* Skip any nameless bit fields. */
6522 while (constructor_unfilled_fields != 0
6523 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6524 && DECL_NAME (constructor_unfilled_fields) == 0)
6525 constructor_unfilled_fields =
6526 TREE_CHAIN (constructor_unfilled_fields);
6530 constructor_fields = TREE_CHAIN (constructor_fields);
6531 /* Skip any nameless bit fields at the beginning. */
6532 while (constructor_fields != 0
6533 && DECL_C_BIT_FIELD (constructor_fields)
6534 && DECL_NAME (constructor_fields) == 0)
6535 constructor_fields = TREE_CHAIN (constructor_fields);
6537 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6540 enum tree_code fieldcode;
6542 if (constructor_fields == 0)
6544 pedwarn_init ("excess elements in union initializer");
6548 fieldtype = TREE_TYPE (constructor_fields);
6549 if (fieldtype != error_mark_node)
6550 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6551 fieldcode = TREE_CODE (fieldtype);
6553 /* Warn that traditional C rejects initialization of unions.
6554 We skip the warning if the value is zero. This is done
6555 under the assumption that the zero initializer in user
6556 code appears conditioned on e.g. __STDC__ to avoid
6557 "missing initializer" warnings and relies on default
6558 initialization to zero in the traditional C case.
6559 We also skip the warning if the initializer is designated,
6560 again on the assumption that this must be conditional on
6561 __STDC__ anyway (and we've already complained about the
6562 member-designator already). */
6563 if (!in_system_header && !constructor_designated
6564 && !(value.value && (integer_zerop (value.value)
6565 || real_zerop (value.value))))
6566 warning (OPT_Wtraditional, "traditional C rejects initialization "
6569 /* Accept a string constant to initialize a subarray. */
6570 if (value.value != 0
6571 && fieldcode == ARRAY_TYPE
6572 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6574 value.value = orig_value;
6575 /* Otherwise, if we have come to a subaggregate,
6576 and we don't have an element of its type, push into it. */
6577 else if (value.value != 0
6578 && value.value != error_mark_node
6579 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6580 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6581 || fieldcode == UNION_TYPE))
6583 push_init_level (1);
6589 push_member_name (constructor_fields);
6590 output_init_element (value.value, strict_string,
6591 fieldtype, constructor_fields, 1);
6592 RESTORE_SPELLING_DEPTH (constructor_depth);
6595 /* Do the bookkeeping for an element that was
6596 directly output as a constructor. */
6598 constructor_bit_index = DECL_SIZE (constructor_fields);
6599 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6602 constructor_fields = 0;
6604 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6606 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6607 enum tree_code eltcode = TREE_CODE (elttype);
6609 /* Accept a string constant to initialize a subarray. */
6610 if (value.value != 0
6611 && eltcode == ARRAY_TYPE
6612 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6614 value.value = orig_value;
6615 /* Otherwise, if we have come to a subaggregate,
6616 and we don't have an element of its type, push into it. */
6617 else if (value.value != 0
6618 && value.value != error_mark_node
6619 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6620 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6621 || eltcode == UNION_TYPE))
6623 push_init_level (1);
6627 if (constructor_max_index != 0
6628 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6629 || integer_all_onesp (constructor_max_index)))
6631 pedwarn_init ("excess elements in array initializer");
6635 /* Now output the actual element. */
6638 push_array_bounds (tree_low_cst (constructor_index, 1));
6639 output_init_element (value.value, strict_string,
6640 elttype, constructor_index, 1);
6641 RESTORE_SPELLING_DEPTH (constructor_depth);
6645 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6648 /* If we are doing the bookkeeping for an element that was
6649 directly output as a constructor, we must update
6650 constructor_unfilled_index. */
6651 constructor_unfilled_index = constructor_index;
6653 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6655 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6657 /* Do a basic check of initializer size. Note that vectors
6658 always have a fixed size derived from their type. */
6659 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6661 pedwarn_init ("excess elements in vector initializer");
6665 /* Now output the actual element. */
6667 output_init_element (value.value, strict_string,
6668 elttype, constructor_index, 1);
6671 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6674 /* If we are doing the bookkeeping for an element that was
6675 directly output as a constructor, we must update
6676 constructor_unfilled_index. */
6677 constructor_unfilled_index = constructor_index;
6680 /* Handle the sole element allowed in a braced initializer
6681 for a scalar variable. */
6682 else if (constructor_type != error_mark_node
6683 && constructor_fields == 0)
6685 pedwarn_init ("excess elements in scalar initializer");
6691 output_init_element (value.value, strict_string,
6692 constructor_type, NULL_TREE, 1);
6693 constructor_fields = 0;
6696 /* Handle range initializers either at this level or anywhere higher
6697 in the designator stack. */
6698 if (constructor_range_stack)
6700 struct constructor_range_stack *p, *range_stack;
6703 range_stack = constructor_range_stack;
6704 constructor_range_stack = 0;
6705 while (constructor_stack != range_stack->stack)
6707 gcc_assert (constructor_stack->implicit);
6708 process_init_element (pop_init_level (1));
6710 for (p = range_stack;
6711 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6714 gcc_assert (constructor_stack->implicit);
6715 process_init_element (pop_init_level (1));
6718 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6719 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6724 constructor_index = p->index;
6725 constructor_fields = p->fields;
6726 if (finish && p->range_end && p->index == p->range_start)
6734 push_init_level (2);
6735 p->stack = constructor_stack;
6736 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6737 p->index = p->range_start;
6741 constructor_range_stack = range_stack;
6748 constructor_range_stack = 0;
6751 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6752 (guaranteed to be 'volatile' or null) and ARGS (represented using
6753 an ASM_EXPR node). */
6755 build_asm_stmt (tree cv_qualifier, tree args)
6757 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6758 ASM_VOLATILE_P (args) = 1;
6759 return add_stmt (args);
6762 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6763 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6764 SIMPLE indicates whether there was anything at all after the
6765 string in the asm expression -- asm("blah") and asm("blah" : )
6766 are subtly different. We use a ASM_EXPR node to represent this. */
6768 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6774 const char *constraint;
6775 const char **oconstraints;
6776 bool allows_mem, allows_reg, is_inout;
6777 int ninputs, noutputs;
6779 ninputs = list_length (inputs);
6780 noutputs = list_length (outputs);
6781 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
6783 string = resolve_asm_operand_names (string, outputs, inputs);
6785 /* Remove output conversions that change the type but not the mode. */
6786 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6788 tree output = TREE_VALUE (tail);
6790 /* ??? Really, this should not be here. Users should be using a
6791 proper lvalue, dammit. But there's a long history of using casts
6792 in the output operands. In cases like longlong.h, this becomes a
6793 primitive form of typechecking -- if the cast can be removed, then
6794 the output operand had a type of the proper width; otherwise we'll
6795 get an error. Gross, but ... */
6796 STRIP_NOPS (output);
6798 if (!lvalue_or_else (output, lv_asm))
6799 output = error_mark_node;
6801 if (output != error_mark_node
6802 && (TREE_READONLY (output)
6803 || TYPE_READONLY (TREE_TYPE (output))
6804 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
6805 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
6806 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
6807 readonly_error (output, lv_asm);
6809 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6810 oconstraints[i] = constraint;
6812 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6813 &allows_mem, &allows_reg, &is_inout))
6815 /* If the operand is going to end up in memory,
6816 mark it addressable. */
6817 if (!allows_reg && !c_mark_addressable (output))
6818 output = error_mark_node;
6821 output = error_mark_node;
6823 TREE_VALUE (tail) = output;
6826 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
6830 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6831 input = TREE_VALUE (tail);
6833 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
6834 oconstraints, &allows_mem, &allows_reg))
6836 /* If the operand is going to end up in memory,
6837 mark it addressable. */
6838 if (!allows_reg && allows_mem)
6840 /* Strip the nops as we allow this case. FIXME, this really
6841 should be rejected or made deprecated. */
6843 if (!c_mark_addressable (input))
6844 input = error_mark_node;
6848 input = error_mark_node;
6850 TREE_VALUE (tail) = input;
6853 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
6855 /* asm statements without outputs, including simple ones, are treated
6857 ASM_INPUT_P (args) = simple;
6858 ASM_VOLATILE_P (args) = (noutputs == 0);
6863 /* Generate a goto statement to LABEL. */
6866 c_finish_goto_label (tree label)
6868 tree decl = lookup_label (label);
6872 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
6874 error ("jump into statement expression");
6878 if (C_DECL_UNJUMPABLE_VM (decl))
6880 error ("jump into scope of identifier with variably modified type");
6884 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
6886 /* No jump from outside this statement expression context, so
6887 record that there is a jump from within this context. */
6888 struct c_label_list *nlist;
6889 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6890 nlist->next = label_context_stack_se->labels_used;
6891 nlist->label = decl;
6892 label_context_stack_se->labels_used = nlist;
6895 if (!C_DECL_UNDEFINABLE_VM (decl))
6897 /* No jump from outside this context context of identifiers with
6898 variably modified type, so record that there is a jump from
6899 within this context. */
6900 struct c_label_list *nlist;
6901 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6902 nlist->next = label_context_stack_vm->labels_used;
6903 nlist->label = decl;
6904 label_context_stack_vm->labels_used = nlist;
6907 TREE_USED (decl) = 1;
6908 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
6911 /* Generate a computed goto statement to EXPR. */
6914 c_finish_goto_ptr (tree expr)
6917 pedwarn ("ISO C forbids %<goto *expr;%>");
6918 expr = convert (ptr_type_node, expr);
6919 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
6922 /* Generate a C `return' statement. RETVAL is the expression for what
6923 to return, or a null pointer for `return;' with no value. */
6926 c_finish_return (tree retval)
6928 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
6929 bool no_warning = false;
6931 if (TREE_THIS_VOLATILE (current_function_decl))
6932 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6936 current_function_returns_null = 1;
6937 if ((warn_return_type || flag_isoc99)
6938 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
6940 pedwarn_c99 ("%<return%> with no value, in "
6941 "function returning non-void");
6945 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
6947 current_function_returns_null = 1;
6948 if (TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
6949 pedwarn ("%<return%> with a value, in function returning void");
6951 pedwarn ("ISO C forbids %<return%> with expression, in function returning void");
6955 tree t = convert_for_assignment (valtype, retval, ic_return,
6956 NULL_TREE, NULL_TREE, 0);
6957 tree res = DECL_RESULT (current_function_decl);
6960 current_function_returns_value = 1;
6961 if (t == error_mark_node)
6964 inner = t = convert (TREE_TYPE (res), t);
6966 /* Strip any conversions, additions, and subtractions, and see if
6967 we are returning the address of a local variable. Warn if so. */
6970 switch (TREE_CODE (inner))
6972 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6974 inner = TREE_OPERAND (inner, 0);
6978 /* If the second operand of the MINUS_EXPR has a pointer
6979 type (or is converted from it), this may be valid, so
6980 don't give a warning. */
6982 tree op1 = TREE_OPERAND (inner, 1);
6984 while (!POINTER_TYPE_P (TREE_TYPE (op1))
6985 && (TREE_CODE (op1) == NOP_EXPR
6986 || TREE_CODE (op1) == NON_LVALUE_EXPR
6987 || TREE_CODE (op1) == CONVERT_EXPR))
6988 op1 = TREE_OPERAND (op1, 0);
6990 if (POINTER_TYPE_P (TREE_TYPE (op1)))
6993 inner = TREE_OPERAND (inner, 0);
6998 inner = TREE_OPERAND (inner, 0);
7000 while (REFERENCE_CLASS_P (inner)
7001 && TREE_CODE (inner) != INDIRECT_REF)
7002 inner = TREE_OPERAND (inner, 0);
7005 && !DECL_EXTERNAL (inner)
7006 && !TREE_STATIC (inner)
7007 && DECL_CONTEXT (inner) == current_function_decl)
7008 warning (0, "function returns address of local variable");
7018 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7021 ret_stmt = build_stmt (RETURN_EXPR, retval);
7022 TREE_NO_WARNING (ret_stmt) |= no_warning;
7023 return add_stmt (ret_stmt);
7027 /* The SWITCH_EXPR being built. */
7030 /* The original type of the testing expression, i.e. before the
7031 default conversion is applied. */
7034 /* A splay-tree mapping the low element of a case range to the high
7035 element, or NULL_TREE if there is no high element. Used to
7036 determine whether or not a new case label duplicates an old case
7037 label. We need a tree, rather than simply a hash table, because
7038 of the GNU case range extension. */
7041 /* Number of nested statement expressions within this switch
7042 statement; if nonzero, case and default labels may not
7044 unsigned int blocked_stmt_expr;
7046 /* Scope of outermost declarations of identifiers with variably
7047 modified type within this switch statement; if nonzero, case and
7048 default labels may not appear. */
7049 unsigned int blocked_vm;
7051 /* The next node on the stack. */
7052 struct c_switch *next;
7055 /* A stack of the currently active switch statements. The innermost
7056 switch statement is on the top of the stack. There is no need to
7057 mark the stack for garbage collection because it is only active
7058 during the processing of the body of a function, and we never
7059 collect at that point. */
7061 struct c_switch *c_switch_stack;
7063 /* Start a C switch statement, testing expression EXP. Return the new
7067 c_start_case (tree exp)
7069 tree orig_type = error_mark_node;
7070 struct c_switch *cs;
7072 if (exp != error_mark_node)
7074 orig_type = TREE_TYPE (exp);
7076 if (!INTEGRAL_TYPE_P (orig_type))
7078 if (orig_type != error_mark_node)
7080 error ("switch quantity not an integer");
7081 orig_type = error_mark_node;
7083 exp = integer_zero_node;
7087 tree type = TYPE_MAIN_VARIANT (orig_type);
7089 if (!in_system_header
7090 && (type == long_integer_type_node
7091 || type == long_unsigned_type_node))
7092 warning (OPT_Wtraditional, "%<long%> switch expression not "
7093 "converted to %<int%> in ISO C");
7095 exp = default_conversion (exp);
7099 /* Add this new SWITCH_EXPR to the stack. */
7100 cs = XNEW (struct c_switch);
7101 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7102 cs->orig_type = orig_type;
7103 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7104 cs->blocked_stmt_expr = 0;
7106 cs->next = c_switch_stack;
7107 c_switch_stack = cs;
7109 return add_stmt (cs->switch_expr);
7112 /* Process a case label. */
7115 do_case (tree low_value, tree high_value)
7117 tree label = NULL_TREE;
7119 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7120 && !c_switch_stack->blocked_vm)
7122 label = c_add_case_label (c_switch_stack->cases,
7123 SWITCH_COND (c_switch_stack->switch_expr),
7124 c_switch_stack->orig_type,
7125 low_value, high_value);
7126 if (label == error_mark_node)
7129 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7132 error ("case label in statement expression not containing "
7133 "enclosing switch statement");
7135 error ("%<default%> label in statement expression not containing "
7136 "enclosing switch statement");
7138 else if (c_switch_stack && c_switch_stack->blocked_vm)
7141 error ("case label in scope of identifier with variably modified "
7142 "type not containing enclosing switch statement");
7144 error ("%<default%> label in scope of identifier with variably "
7145 "modified type not containing enclosing switch statement");
7148 error ("case label not within a switch statement");
7150 error ("%<default%> label not within a switch statement");
7155 /* Finish the switch statement. */
7158 c_finish_case (tree body)
7160 struct c_switch *cs = c_switch_stack;
7161 location_t switch_location;
7163 SWITCH_BODY (cs->switch_expr) = body;
7165 /* We must not be within a statement expression nested in the switch
7166 at this point; we might, however, be within the scope of an
7167 identifier with variably modified type nested in the switch. */
7168 gcc_assert (!cs->blocked_stmt_expr);
7170 /* Emit warnings as needed. */
7171 if (EXPR_HAS_LOCATION (cs->switch_expr))
7172 switch_location = EXPR_LOCATION (cs->switch_expr);
7174 switch_location = input_location;
7175 c_do_switch_warnings (cs->cases, switch_location,
7176 TREE_TYPE (cs->switch_expr),
7177 SWITCH_COND (cs->switch_expr));
7179 /* Pop the stack. */
7180 c_switch_stack = cs->next;
7181 splay_tree_delete (cs->cases);
7185 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7186 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7187 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7188 statement, and was not surrounded with parenthesis. */
7191 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7192 tree else_block, bool nested_if)
7196 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7197 if (warn_parentheses && nested_if && else_block == NULL)
7199 tree inner_if = then_block;
7201 /* We know from the grammar productions that there is an IF nested
7202 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7203 it might not be exactly THEN_BLOCK, but should be the last
7204 non-container statement within. */
7206 switch (TREE_CODE (inner_if))
7211 inner_if = BIND_EXPR_BODY (inner_if);
7213 case STATEMENT_LIST:
7214 inner_if = expr_last (then_block);
7216 case TRY_FINALLY_EXPR:
7217 case TRY_CATCH_EXPR:
7218 inner_if = TREE_OPERAND (inner_if, 0);
7225 if (COND_EXPR_ELSE (inner_if))
7226 warning (OPT_Wparentheses,
7227 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7231 empty_if_body_warning (then_block, else_block);
7233 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7234 SET_EXPR_LOCATION (stmt, if_locus);
7238 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7239 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7240 is false for DO loops. INCR is the FOR increment expression. BODY is
7241 the statement controlled by the loop. BLAB is the break label. CLAB is
7242 the continue label. Everything is allowed to be NULL. */
7245 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7246 tree blab, tree clab, bool cond_is_first)
7248 tree entry = NULL, exit = NULL, t;
7250 /* If the condition is zero don't generate a loop construct. */
7251 if (cond && integer_zerop (cond))
7255 t = build_and_jump (&blab);
7256 SET_EXPR_LOCATION (t, start_locus);
7262 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7264 /* If we have an exit condition, then we build an IF with gotos either
7265 out of the loop, or to the top of it. If there's no exit condition,
7266 then we just build a jump back to the top. */
7267 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7269 if (cond && !integer_nonzerop (cond))
7271 /* Canonicalize the loop condition to the end. This means
7272 generating a branch to the loop condition. Reuse the
7273 continue label, if possible. */
7278 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7279 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7282 t = build1 (GOTO_EXPR, void_type_node, clab);
7283 SET_EXPR_LOCATION (t, start_locus);
7287 t = build_and_jump (&blab);
7288 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7290 SET_EXPR_LOCATION (exit, start_locus);
7292 SET_EXPR_LOCATION (exit, input_location);
7301 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7309 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7313 c_finish_bc_stmt (tree *label_p, bool is_break)
7316 tree label = *label_p;
7318 /* In switch statements break is sometimes stylistically used after
7319 a return statement. This can lead to spurious warnings about
7320 control reaching the end of a non-void function when it is
7321 inlined. Note that we are calling block_may_fallthru with
7322 language specific tree nodes; this works because
7323 block_may_fallthru returns true when given something it does not
7325 skip = !block_may_fallthru (cur_stmt_list);
7330 *label_p = label = create_artificial_label ();
7332 else if (TREE_CODE (label) == LABEL_DECL)
7334 else switch (TREE_INT_CST_LOW (label))
7338 error ("break statement not within loop or switch");
7340 error ("continue statement not within a loop");
7344 gcc_assert (is_break);
7345 error ("break statement used with OpenMP for loop");
7355 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7358 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7361 emit_side_effect_warnings (tree expr)
7363 if (expr == error_mark_node)
7365 else if (!TREE_SIDE_EFFECTS (expr))
7367 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7368 warning (OPT_Wunused_value, "%Hstatement with no effect",
7369 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7372 warn_if_unused_value (expr, input_location);
7375 /* Process an expression as if it were a complete statement. Emit
7376 diagnostics, but do not call ADD_STMT. */
7379 c_process_expr_stmt (tree expr)
7384 if (warn_sequence_point)
7385 verify_sequence_points (expr);
7387 if (TREE_TYPE (expr) != error_mark_node
7388 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7389 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7390 error ("expression statement has incomplete type");
7392 /* If we're not processing a statement expression, warn about unused values.
7393 Warnings for statement expressions will be emitted later, once we figure
7394 out which is the result. */
7395 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7396 && warn_unused_value)
7397 emit_side_effect_warnings (expr);
7399 /* If the expression is not of a type to which we cannot assign a line
7400 number, wrap the thing in a no-op NOP_EXPR. */
7401 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7402 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7404 if (CAN_HAVE_LOCATION_P (expr))
7405 SET_EXPR_LOCATION (expr, input_location);
7410 /* Emit an expression as a statement. */
7413 c_finish_expr_stmt (tree expr)
7416 return add_stmt (c_process_expr_stmt (expr));
7421 /* Do the opposite and emit a statement as an expression. To begin,
7422 create a new binding level and return it. */
7425 c_begin_stmt_expr (void)
7428 struct c_label_context_se *nstack;
7429 struct c_label_list *glist;
7431 /* We must force a BLOCK for this level so that, if it is not expanded
7432 later, there is a way to turn off the entire subtree of blocks that
7433 are contained in it. */
7435 ret = c_begin_compound_stmt (true);
7438 c_switch_stack->blocked_stmt_expr++;
7439 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7441 for (glist = label_context_stack_se->labels_used;
7443 glist = glist->next)
7445 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7447 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7448 nstack->labels_def = NULL;
7449 nstack->labels_used = NULL;
7450 nstack->next = label_context_stack_se;
7451 label_context_stack_se = nstack;
7453 /* Mark the current statement list as belonging to a statement list. */
7454 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7460 c_finish_stmt_expr (tree body)
7462 tree last, type, tmp, val;
7464 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7466 body = c_end_compound_stmt (body, true);
7469 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7470 c_switch_stack->blocked_stmt_expr--;
7472 /* It is no longer possible to jump to labels defined within this
7473 statement expression. */
7474 for (dlist = label_context_stack_se->labels_def;
7476 dlist = dlist->next)
7478 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7480 /* It is again possible to define labels with a goto just outside
7481 this statement expression. */
7482 for (glist = label_context_stack_se->next->labels_used;
7484 glist = glist->next)
7486 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7489 if (glist_prev != NULL)
7490 glist_prev->next = label_context_stack_se->labels_used;
7492 label_context_stack_se->next->labels_used
7493 = label_context_stack_se->labels_used;
7494 label_context_stack_se = label_context_stack_se->next;
7496 /* Locate the last statement in BODY. See c_end_compound_stmt
7497 about always returning a BIND_EXPR. */
7498 last_p = &BIND_EXPR_BODY (body);
7499 last = BIND_EXPR_BODY (body);
7502 if (TREE_CODE (last) == STATEMENT_LIST)
7504 tree_stmt_iterator i;
7506 /* This can happen with degenerate cases like ({ }). No value. */
7507 if (!TREE_SIDE_EFFECTS (last))
7510 /* If we're supposed to generate side effects warnings, process
7511 all of the statements except the last. */
7512 if (warn_unused_value)
7514 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7515 emit_side_effect_warnings (tsi_stmt (i));
7518 i = tsi_last (last);
7519 last_p = tsi_stmt_ptr (i);
7523 /* If the end of the list is exception related, then the list was split
7524 by a call to push_cleanup. Continue searching. */
7525 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7526 || TREE_CODE (last) == TRY_CATCH_EXPR)
7528 last_p = &TREE_OPERAND (last, 0);
7530 goto continue_searching;
7533 /* In the case that the BIND_EXPR is not necessary, return the
7534 expression out from inside it. */
7535 if (last == error_mark_node
7536 || (last == BIND_EXPR_BODY (body)
7537 && BIND_EXPR_VARS (body) == NULL))
7539 /* Do not warn if the return value of a statement expression is
7541 if (CAN_HAVE_LOCATION_P (last))
7542 TREE_NO_WARNING (last) = 1;
7546 /* Extract the type of said expression. */
7547 type = TREE_TYPE (last);
7549 /* If we're not returning a value at all, then the BIND_EXPR that
7550 we already have is a fine expression to return. */
7551 if (!type || VOID_TYPE_P (type))
7554 /* Now that we've located the expression containing the value, it seems
7555 silly to make voidify_wrapper_expr repeat the process. Create a
7556 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7557 tmp = create_tmp_var_raw (type, NULL);
7559 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7560 tree_expr_nonnegative_p giving up immediately. */
7562 if (TREE_CODE (val) == NOP_EXPR
7563 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7564 val = TREE_OPERAND (val, 0);
7566 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7567 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7569 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7572 /* Begin the scope of an identifier of variably modified type, scope
7573 number SCOPE. Jumping from outside this scope to inside it is not
7577 c_begin_vm_scope (unsigned int scope)
7579 struct c_label_context_vm *nstack;
7580 struct c_label_list *glist;
7582 gcc_assert (scope > 0);
7584 /* At file_scope, we don't have to do any processing. */
7585 if (label_context_stack_vm == NULL)
7588 if (c_switch_stack && !c_switch_stack->blocked_vm)
7589 c_switch_stack->blocked_vm = scope;
7590 for (glist = label_context_stack_vm->labels_used;
7592 glist = glist->next)
7594 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7596 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7597 nstack->labels_def = NULL;
7598 nstack->labels_used = NULL;
7599 nstack->scope = scope;
7600 nstack->next = label_context_stack_vm;
7601 label_context_stack_vm = nstack;
7604 /* End a scope which may contain identifiers of variably modified
7605 type, scope number SCOPE. */
7608 c_end_vm_scope (unsigned int scope)
7610 if (label_context_stack_vm == NULL)
7612 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7613 c_switch_stack->blocked_vm = 0;
7614 /* We may have a number of nested scopes of identifiers with
7615 variably modified type, all at this depth. Pop each in turn. */
7616 while (label_context_stack_vm->scope == scope)
7618 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7620 /* It is no longer possible to jump to labels defined within this
7622 for (dlist = label_context_stack_vm->labels_def;
7624 dlist = dlist->next)
7626 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7628 /* It is again possible to define labels with a goto just outside
7630 for (glist = label_context_stack_vm->next->labels_used;
7632 glist = glist->next)
7634 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7637 if (glist_prev != NULL)
7638 glist_prev->next = label_context_stack_vm->labels_used;
7640 label_context_stack_vm->next->labels_used
7641 = label_context_stack_vm->labels_used;
7642 label_context_stack_vm = label_context_stack_vm->next;
7646 /* Begin and end compound statements. This is as simple as pushing
7647 and popping new statement lists from the tree. */
7650 c_begin_compound_stmt (bool do_scope)
7652 tree stmt = push_stmt_list ();
7659 c_end_compound_stmt (tree stmt, bool do_scope)
7665 if (c_dialect_objc ())
7666 objc_clear_super_receiver ();
7667 block = pop_scope ();
7670 stmt = pop_stmt_list (stmt);
7671 stmt = c_build_bind_expr (block, stmt);
7673 /* If this compound statement is nested immediately inside a statement
7674 expression, then force a BIND_EXPR to be created. Otherwise we'll
7675 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7676 STATEMENT_LISTs merge, and thus we can lose track of what statement
7679 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7680 && TREE_CODE (stmt) != BIND_EXPR)
7682 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7683 TREE_SIDE_EFFECTS (stmt) = 1;
7689 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7690 when the current scope is exited. EH_ONLY is true when this is not
7691 meant to apply to normal control flow transfer. */
7694 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7696 enum tree_code code;
7700 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7701 stmt = build_stmt (code, NULL, cleanup);
7703 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7704 list = push_stmt_list ();
7705 TREE_OPERAND (stmt, 0) = list;
7706 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7709 /* Build a binary-operation expression without default conversions.
7710 CODE is the kind of expression to build.
7711 This function differs from `build' in several ways:
7712 the data type of the result is computed and recorded in it,
7713 warnings are generated if arg data types are invalid,
7714 special handling for addition and subtraction of pointers is known,
7715 and some optimization is done (operations on narrow ints
7716 are done in the narrower type when that gives the same result).
7717 Constant folding is also done before the result is returned.
7719 Note that the operands will never have enumeral types, or function
7720 or array types, because either they will have the default conversions
7721 performed or they have both just been converted to some other type in which
7722 the arithmetic is to be done. */
7725 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
7729 enum tree_code code0, code1;
7731 const char *invalid_op_diag;
7733 /* Expression code to give to the expression when it is built.
7734 Normally this is CODE, which is what the caller asked for,
7735 but in some special cases we change it. */
7736 enum tree_code resultcode = code;
7738 /* Data type in which the computation is to be performed.
7739 In the simplest cases this is the common type of the arguments. */
7740 tree result_type = NULL;
7742 /* Nonzero means operands have already been type-converted
7743 in whatever way is necessary.
7744 Zero means they need to be converted to RESULT_TYPE. */
7747 /* Nonzero means create the expression with this type, rather than
7749 tree build_type = 0;
7751 /* Nonzero means after finally constructing the expression
7752 convert it to this type. */
7753 tree final_type = 0;
7755 /* Nonzero if this is an operation like MIN or MAX which can
7756 safely be computed in short if both args are promoted shorts.
7757 Also implies COMMON.
7758 -1 indicates a bitwise operation; this makes a difference
7759 in the exact conditions for when it is safe to do the operation
7760 in a narrower mode. */
7763 /* Nonzero if this is a comparison operation;
7764 if both args are promoted shorts, compare the original shorts.
7765 Also implies COMMON. */
7766 int short_compare = 0;
7768 /* Nonzero if this is a right-shift operation, which can be computed on the
7769 original short and then promoted if the operand is a promoted short. */
7770 int short_shift = 0;
7772 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7775 /* True means types are compatible as far as ObjC is concerned. */
7780 op0 = default_conversion (orig_op0);
7781 op1 = default_conversion (orig_op1);
7789 type0 = TREE_TYPE (op0);
7790 type1 = TREE_TYPE (op1);
7792 /* The expression codes of the data types of the arguments tell us
7793 whether the arguments are integers, floating, pointers, etc. */
7794 code0 = TREE_CODE (type0);
7795 code1 = TREE_CODE (type1);
7797 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7798 STRIP_TYPE_NOPS (op0);
7799 STRIP_TYPE_NOPS (op1);
7801 /* If an error was already reported for one of the arguments,
7802 avoid reporting another error. */
7804 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7805 return error_mark_node;
7807 if ((invalid_op_diag
7808 = targetm.invalid_binary_op (code, type0, type1)))
7810 error (invalid_op_diag);
7811 return error_mark_node;
7814 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
7819 /* Handle the pointer + int case. */
7820 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7821 return pointer_int_sum (PLUS_EXPR, op0, op1);
7822 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
7823 return pointer_int_sum (PLUS_EXPR, op1, op0);
7829 /* Subtraction of two similar pointers.
7830 We must subtract them as integers, then divide by object size. */
7831 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
7832 && comp_target_types (type0, type1))
7833 return pointer_diff (op0, op1);
7834 /* Handle pointer minus int. Just like pointer plus int. */
7835 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7836 return pointer_int_sum (MINUS_EXPR, op0, op1);
7845 case TRUNC_DIV_EXPR:
7847 case FLOOR_DIV_EXPR:
7848 case ROUND_DIV_EXPR:
7849 case EXACT_DIV_EXPR:
7850 warn_for_div_by_zero (op1);
7852 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7853 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7854 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7855 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
7857 enum tree_code tcode0 = code0, tcode1 = code1;
7859 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7860 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
7861 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
7862 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
7864 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
7865 resultcode = RDIV_EXPR;
7867 /* Although it would be tempting to shorten always here, that
7868 loses on some targets, since the modulo instruction is
7869 undefined if the quotient can't be represented in the
7870 computation mode. We shorten only if unsigned or if
7871 dividing by something we know != -1. */
7872 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7873 || (TREE_CODE (op1) == INTEGER_CST
7874 && !integer_all_onesp (op1)));
7882 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7884 else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
7888 case TRUNC_MOD_EXPR:
7889 case FLOOR_MOD_EXPR:
7890 warn_for_div_by_zero (op1);
7892 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7894 /* Although it would be tempting to shorten always here, that loses
7895 on some targets, since the modulo instruction is undefined if the
7896 quotient can't be represented in the computation mode. We shorten
7897 only if unsigned or if dividing by something we know != -1. */
7898 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7899 || (TREE_CODE (op1) == INTEGER_CST
7900 && !integer_all_onesp (op1)));
7905 case TRUTH_ANDIF_EXPR:
7906 case TRUTH_ORIF_EXPR:
7907 case TRUTH_AND_EXPR:
7909 case TRUTH_XOR_EXPR:
7910 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
7911 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
7912 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
7913 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
7915 /* Result of these operations is always an int,
7916 but that does not mean the operands should be
7917 converted to ints! */
7918 result_type = integer_type_node;
7919 op0 = c_common_truthvalue_conversion (op0);
7920 op1 = c_common_truthvalue_conversion (op1);
7925 /* Shift operations: result has same type as first operand;
7926 always convert second operand to int.
7927 Also set SHORT_SHIFT if shifting rightward. */
7930 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7932 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7934 if (tree_int_cst_sgn (op1) < 0)
7935 warning (0, "right shift count is negative");
7938 if (!integer_zerop (op1))
7941 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7942 warning (0, "right shift count >= width of type");
7946 /* Use the type of the value to be shifted. */
7947 result_type = type0;
7948 /* Convert the shift-count to an integer, regardless of size
7949 of value being shifted. */
7950 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7951 op1 = convert (integer_type_node, op1);
7952 /* Avoid converting op1 to result_type later. */
7958 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7960 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7962 if (tree_int_cst_sgn (op1) < 0)
7963 warning (0, "left shift count is negative");
7965 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7966 warning (0, "left shift count >= width of type");
7969 /* Use the type of the value to be shifted. */
7970 result_type = type0;
7971 /* Convert the shift-count to an integer, regardless of size
7972 of value being shifted. */
7973 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7974 op1 = convert (integer_type_node, op1);
7975 /* Avoid converting op1 to result_type later. */
7982 if (code0 == REAL_TYPE || code1 == REAL_TYPE)
7983 warning (OPT_Wfloat_equal,
7984 "comparing floating point with == or != is unsafe");
7985 /* Result of comparison is always int,
7986 but don't convert the args to int! */
7987 build_type = integer_type_node;
7988 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7989 || code0 == COMPLEX_TYPE)
7990 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7991 || code1 == COMPLEX_TYPE))
7993 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
7995 tree tt0 = TREE_TYPE (type0);
7996 tree tt1 = TREE_TYPE (type1);
7997 /* Anything compares with void *. void * compares with anything.
7998 Otherwise, the targets must be compatible
7999 and both must be object or both incomplete. */
8000 if (comp_target_types (type0, type1))
8001 result_type = common_pointer_type (type0, type1);
8002 else if (VOID_TYPE_P (tt0))
8004 /* op0 != orig_op0 detects the case of something
8005 whose value is 0 but which isn't a valid null ptr const. */
8006 if (pedantic && !null_pointer_constant_p (orig_op0)
8007 && TREE_CODE (tt1) == FUNCTION_TYPE)
8008 pedwarn ("ISO C forbids comparison of %<void *%>"
8009 " with function pointer");
8011 else if (VOID_TYPE_P (tt1))
8013 if (pedantic && !null_pointer_constant_p (orig_op1)
8014 && TREE_CODE (tt0) == FUNCTION_TYPE)
8015 pedwarn ("ISO C forbids comparison of %<void *%>"
8016 " with function pointer");
8019 /* Avoid warning about the volatile ObjC EH puts on decls. */
8021 pedwarn ("comparison of distinct pointer types lacks a cast");
8023 if (result_type == NULL_TREE)
8024 result_type = ptr_type_node;
8026 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8028 if (TREE_CODE (op0) == ADDR_EXPR
8029 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
8030 warning (OPT_Waddress, "the address of %qD will never be NULL",
8031 TREE_OPERAND (op0, 0));
8032 result_type = type0;
8034 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8036 if (TREE_CODE (op1) == ADDR_EXPR
8037 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
8038 warning (OPT_Waddress, "the address of %qD will never be NULL",
8039 TREE_OPERAND (op1, 0));
8040 result_type = type1;
8042 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8044 result_type = type0;
8045 pedwarn ("comparison between pointer and integer");
8047 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8049 result_type = type1;
8050 pedwarn ("comparison between pointer and integer");
8058 build_type = integer_type_node;
8059 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
8060 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
8062 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8064 if (comp_target_types (type0, type1))
8066 result_type = common_pointer_type (type0, type1);
8067 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8068 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8069 pedwarn ("comparison of complete and incomplete pointers");
8071 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8072 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
8076 result_type = ptr_type_node;
8077 pedwarn ("comparison of distinct pointer types lacks a cast");
8080 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8082 result_type = type0;
8083 if (pedantic || extra_warnings)
8084 pedwarn ("ordered comparison of pointer with integer zero");
8086 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8088 result_type = type1;
8090 pedwarn ("ordered comparison of pointer with integer zero");
8092 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8094 result_type = type0;
8095 pedwarn ("comparison between pointer and integer");
8097 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8099 result_type = type1;
8100 pedwarn ("comparison between pointer and integer");
8108 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8109 return error_mark_node;
8111 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8112 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8113 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8114 TREE_TYPE (type1))))
8116 binary_op_error (code, type0, type1);
8117 return error_mark_node;
8120 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8121 || code0 == VECTOR_TYPE)
8123 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8124 || code1 == VECTOR_TYPE))
8126 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8128 if (shorten || common || short_compare)
8130 result_type = c_common_type (type0, type1);
8131 if (result_type == error_mark_node)
8132 return error_mark_node;
8135 /* For certain operations (which identify themselves by shorten != 0)
8136 if both args were extended from the same smaller type,
8137 do the arithmetic in that type and then extend.
8139 shorten !=0 and !=1 indicates a bitwise operation.
8140 For them, this optimization is safe only if
8141 both args are zero-extended or both are sign-extended.
8142 Otherwise, we might change the result.
8143 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8144 but calculated in (unsigned short) it would be (unsigned short)-1. */
8146 if (shorten && none_complex)
8148 int unsigned0, unsigned1;
8153 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
8154 excessive narrowing when we call get_narrower below. For
8155 example, suppose that OP0 is of unsigned int extended
8156 from signed char and that RESULT_TYPE is long long int.
8157 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
8160 (long long int) (unsigned int) signed_char
8162 which get_narrower would narrow down to
8164 (unsigned int) signed char
8166 If we do not cast OP0 first, get_narrower would return
8167 signed_char, which is inconsistent with the case of the
8169 op0 = convert (result_type, op0);
8170 op1 = convert (result_type, op1);
8172 arg0 = get_narrower (op0, &unsigned0);
8173 arg1 = get_narrower (op1, &unsigned1);
8175 /* UNS is 1 if the operation to be done is an unsigned one. */
8176 uns = TYPE_UNSIGNED (result_type);
8178 final_type = result_type;
8180 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
8181 but it *requires* conversion to FINAL_TYPE. */
8183 if ((TYPE_PRECISION (TREE_TYPE (op0))
8184 == TYPE_PRECISION (TREE_TYPE (arg0)))
8185 && TREE_TYPE (op0) != final_type)
8186 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
8187 if ((TYPE_PRECISION (TREE_TYPE (op1))
8188 == TYPE_PRECISION (TREE_TYPE (arg1)))
8189 && TREE_TYPE (op1) != final_type)
8190 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
8192 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
8194 /* For bitwise operations, signedness of nominal type
8195 does not matter. Consider only how operands were extended. */
8199 /* Note that in all three cases below we refrain from optimizing
8200 an unsigned operation on sign-extended args.
8201 That would not be valid. */
8203 /* Both args variable: if both extended in same way
8204 from same width, do it in that width.
8205 Do it unsigned if args were zero-extended. */
8206 if ((TYPE_PRECISION (TREE_TYPE (arg0))
8207 < TYPE_PRECISION (result_type))
8208 && (TYPE_PRECISION (TREE_TYPE (arg1))
8209 == TYPE_PRECISION (TREE_TYPE (arg0)))
8210 && unsigned0 == unsigned1
8211 && (unsigned0 || !uns))
8213 = c_common_signed_or_unsigned_type
8214 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
8215 else if (TREE_CODE (arg0) == INTEGER_CST
8216 && (unsigned1 || !uns)
8217 && (TYPE_PRECISION (TREE_TYPE (arg1))
8218 < TYPE_PRECISION (result_type))
8220 = c_common_signed_or_unsigned_type (unsigned1,
8222 int_fits_type_p (arg0, type)))
8224 else if (TREE_CODE (arg1) == INTEGER_CST
8225 && (unsigned0 || !uns)
8226 && (TYPE_PRECISION (TREE_TYPE (arg0))
8227 < TYPE_PRECISION (result_type))
8229 = c_common_signed_or_unsigned_type (unsigned0,
8231 int_fits_type_p (arg1, type)))
8235 /* Shifts can be shortened if shifting right. */
8240 tree arg0 = get_narrower (op0, &unsigned_arg);
8242 final_type = result_type;
8244 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8245 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8247 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8248 /* We can shorten only if the shift count is less than the
8249 number of bits in the smaller type size. */
8250 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8251 /* We cannot drop an unsigned shift after sign-extension. */
8252 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8254 /* Do an unsigned shift if the operand was zero-extended. */
8256 = c_common_signed_or_unsigned_type (unsigned_arg,
8258 /* Convert value-to-be-shifted to that type. */
8259 if (TREE_TYPE (op0) != result_type)
8260 op0 = convert (result_type, op0);
8265 /* Comparison operations are shortened too but differently.
8266 They identify themselves by setting short_compare = 1. */
8270 /* Don't write &op0, etc., because that would prevent op0
8271 from being kept in a register.
8272 Instead, make copies of the our local variables and
8273 pass the copies by reference, then copy them back afterward. */
8274 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8275 enum tree_code xresultcode = resultcode;
8277 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8282 op0 = xop0, op1 = xop1;
8284 resultcode = xresultcode;
8286 if (warn_sign_compare && skip_evaluation == 0)
8288 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
8289 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
8290 int unsignedp0, unsignedp1;
8291 tree primop0 = get_narrower (op0, &unsignedp0);
8292 tree primop1 = get_narrower (op1, &unsignedp1);
8296 STRIP_TYPE_NOPS (xop0);
8297 STRIP_TYPE_NOPS (xop1);
8299 /* Give warnings for comparisons between signed and unsigned
8300 quantities that may fail.
8302 Do the checking based on the original operand trees, so that
8303 casts will be considered, but default promotions won't be.
8305 Do not warn if the comparison is being done in a signed type,
8306 since the signed type will only be chosen if it can represent
8307 all the values of the unsigned type. */
8308 if (!TYPE_UNSIGNED (result_type))
8310 /* Do not warn if both operands are the same signedness. */
8311 else if (op0_signed == op1_signed)
8319 sop = xop0, uop = xop1;
8321 sop = xop1, uop = xop0;
8323 /* Do not warn if the signed quantity is an
8324 unsuffixed integer literal (or some static
8325 constant expression involving such literals or a
8326 conditional expression involving such literals)
8327 and it is non-negative. */
8328 if (tree_expr_nonnegative_warnv_p (sop, &ovf))
8330 /* Do not warn if the comparison is an equality operation,
8331 the unsigned quantity is an integral constant, and it
8332 would fit in the result if the result were signed. */
8333 else if (TREE_CODE (uop) == INTEGER_CST
8334 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
8336 (uop, c_common_signed_type (result_type)))
8338 /* Do not warn if the unsigned quantity is an enumeration
8339 constant and its maximum value would fit in the result
8340 if the result were signed. */
8341 else if (TREE_CODE (uop) == INTEGER_CST
8342 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
8344 (TYPE_MAX_VALUE (TREE_TYPE (uop)),
8345 c_common_signed_type (result_type)))
8348 warning (0, "comparison between signed and unsigned");
8351 /* Warn if two unsigned values are being compared in a size
8352 larger than their original size, and one (and only one) is the
8353 result of a `~' operator. This comparison will always fail.
8355 Also warn if one operand is a constant, and the constant
8356 does not have all bits set that are set in the ~ operand
8357 when it is extended. */
8359 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
8360 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
8362 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
8363 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
8366 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
8369 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
8372 HOST_WIDE_INT constant, mask;
8373 int unsignedp, bits;
8375 if (host_integerp (primop0, 0))
8378 unsignedp = unsignedp1;
8379 constant = tree_low_cst (primop0, 0);
8384 unsignedp = unsignedp0;
8385 constant = tree_low_cst (primop1, 0);
8388 bits = TYPE_PRECISION (TREE_TYPE (primop));
8389 if (bits < TYPE_PRECISION (result_type)
8390 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
8392 mask = (~(HOST_WIDE_INT) 0) << bits;
8393 if ((mask & constant) != mask)
8394 warning (0, "comparison of promoted ~unsigned with constant");
8397 else if (unsignedp0 && unsignedp1
8398 && (TYPE_PRECISION (TREE_TYPE (primop0))
8399 < TYPE_PRECISION (result_type))
8400 && (TYPE_PRECISION (TREE_TYPE (primop1))
8401 < TYPE_PRECISION (result_type)))
8402 warning (0, "comparison of promoted ~unsigned with unsigned");
8408 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8409 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8410 Then the expression will be built.
8411 It will be given type FINAL_TYPE if that is nonzero;
8412 otherwise, it will be given type RESULT_TYPE. */
8416 binary_op_error (code, TREE_TYPE (op0), TREE_TYPE (op1));
8417 return error_mark_node;
8422 if (TREE_TYPE (op0) != result_type)
8423 op0 = convert_and_check (result_type, op0);
8424 if (TREE_TYPE (op1) != result_type)
8425 op1 = convert_and_check (result_type, op1);
8427 /* This can happen if one operand has a vector type, and the other
8428 has a different type. */
8429 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8430 return error_mark_node;
8433 if (build_type == NULL_TREE)
8434 build_type = result_type;
8437 /* Treat expressions in initializers specially as they can't trap. */
8438 tree result = require_constant_value ? fold_build2_initializer (resultcode,
8441 : fold_build2 (resultcode, build_type,
8444 if (final_type != 0)
8445 result = convert (final_type, result);
8451 /* Convert EXPR to be a truth-value, validating its type for this
8455 c_objc_common_truthvalue_conversion (tree expr)
8457 switch (TREE_CODE (TREE_TYPE (expr)))
8460 error ("used array that cannot be converted to pointer where scalar is required");
8461 return error_mark_node;
8464 error ("used struct type value where scalar is required");
8465 return error_mark_node;
8468 error ("used union type value where scalar is required");
8469 return error_mark_node;
8478 /* ??? Should we also give an error for void and vectors rather than
8479 leaving those to give errors later? */
8480 return c_common_truthvalue_conversion (expr);
8484 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8488 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED,
8489 bool *ti ATTRIBUTE_UNUSED, bool *se)
8491 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8493 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8494 /* Executing a compound literal inside a function reinitializes
8496 if (!TREE_STATIC (decl))
8504 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8507 c_begin_omp_parallel (void)
8512 block = c_begin_compound_stmt (true);
8518 c_finish_omp_parallel (tree clauses, tree block)
8522 block = c_end_compound_stmt (block, true);
8524 stmt = make_node (OMP_PARALLEL);
8525 TREE_TYPE (stmt) = void_type_node;
8526 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8527 OMP_PARALLEL_BODY (stmt) = block;
8529 return add_stmt (stmt);
8532 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8533 Remove any elements from the list that are invalid. */
8536 c_finish_omp_clauses (tree clauses)
8538 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8539 tree c, t, *pc = &clauses;
8542 bitmap_obstack_initialize (NULL);
8543 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8544 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8545 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8547 for (pc = &clauses, c = clauses; c ; c = *pc)
8549 bool remove = false;
8550 bool need_complete = false;
8551 bool need_implicitly_determined = false;
8553 switch (OMP_CLAUSE_CODE (c))
8555 case OMP_CLAUSE_SHARED:
8557 need_implicitly_determined = true;
8558 goto check_dup_generic;
8560 case OMP_CLAUSE_PRIVATE:
8562 need_complete = true;
8563 need_implicitly_determined = true;
8564 goto check_dup_generic;
8566 case OMP_CLAUSE_REDUCTION:
8568 need_implicitly_determined = true;
8569 t = OMP_CLAUSE_DECL (c);
8570 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8571 || POINTER_TYPE_P (TREE_TYPE (t)))
8573 error ("%qE has invalid type for %<reduction%>", t);
8576 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8578 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8579 const char *r_name = NULL;
8596 case TRUTH_ANDIF_EXPR:
8599 case TRUTH_ORIF_EXPR:
8607 error ("%qE has invalid type for %<reduction(%s)%>",
8612 goto check_dup_generic;
8614 case OMP_CLAUSE_COPYPRIVATE:
8615 name = "copyprivate";
8616 goto check_dup_generic;
8618 case OMP_CLAUSE_COPYIN:
8620 t = OMP_CLAUSE_DECL (c);
8621 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8623 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8626 goto check_dup_generic;
8629 t = OMP_CLAUSE_DECL (c);
8630 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8632 error ("%qE is not a variable in clause %qs", t, name);
8635 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8636 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8637 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8639 error ("%qE appears more than once in data clauses", t);
8643 bitmap_set_bit (&generic_head, DECL_UID (t));
8646 case OMP_CLAUSE_FIRSTPRIVATE:
8647 name = "firstprivate";
8648 t = OMP_CLAUSE_DECL (c);
8649 need_complete = true;
8650 need_implicitly_determined = true;
8651 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8653 error ("%qE is not a variable in clause %<firstprivate%>", t);
8656 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8657 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8659 error ("%qE appears more than once in data clauses", t);
8663 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8666 case OMP_CLAUSE_LASTPRIVATE:
8667 name = "lastprivate";
8668 t = OMP_CLAUSE_DECL (c);
8669 need_complete = true;
8670 need_implicitly_determined = true;
8671 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8673 error ("%qE is not a variable in clause %<lastprivate%>", t);
8676 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8677 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8679 error ("%qE appears more than once in data clauses", t);
8683 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8687 case OMP_CLAUSE_NUM_THREADS:
8688 case OMP_CLAUSE_SCHEDULE:
8689 case OMP_CLAUSE_NOWAIT:
8690 case OMP_CLAUSE_ORDERED:
8691 case OMP_CLAUSE_DEFAULT:
8692 pc = &OMP_CLAUSE_CHAIN (c);
8701 t = OMP_CLAUSE_DECL (c);
8705 t = require_complete_type (t);
8706 if (t == error_mark_node)
8710 if (need_implicitly_determined)
8712 const char *share_name = NULL;
8714 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8715 share_name = "threadprivate";
8716 else switch (c_omp_predetermined_sharing (t))
8718 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8720 case OMP_CLAUSE_DEFAULT_SHARED:
8721 share_name = "shared";
8723 case OMP_CLAUSE_DEFAULT_PRIVATE:
8724 share_name = "private";
8731 error ("%qE is predetermined %qs for %qs",
8732 t, share_name, name);
8739 *pc = OMP_CLAUSE_CHAIN (c);
8741 pc = &OMP_CLAUSE_CHAIN (c);
8744 bitmap_obstack_release (NULL);