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 if (!skip_evaluation)
2094 assemble_external (ref);
2095 TREE_USED (ref) = 1;
2097 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2099 if (!in_sizeof && !in_typeof)
2100 C_DECL_USED (ref) = 1;
2101 else if (DECL_INITIAL (ref) == 0
2102 && DECL_EXTERNAL (ref)
2103 && !TREE_PUBLIC (ref))
2104 record_maybe_used_decl (ref);
2107 if (TREE_CODE (ref) == CONST_DECL)
2109 used_types_insert (TREE_TYPE (ref));
2110 ref = DECL_INITIAL (ref);
2111 TREE_CONSTANT (ref) = 1;
2112 TREE_INVARIANT (ref) = 1;
2114 else if (current_function_decl != 0
2115 && !DECL_FILE_SCOPE_P (current_function_decl)
2116 && (TREE_CODE (ref) == VAR_DECL
2117 || TREE_CODE (ref) == PARM_DECL
2118 || TREE_CODE (ref) == FUNCTION_DECL))
2120 tree context = decl_function_context (ref);
2122 if (context != 0 && context != current_function_decl)
2123 DECL_NONLOCAL (ref) = 1;
2125 /* C99 6.7.4p3: An inline definition of a function with external
2126 linkage ... shall not contain a reference to an identifier with
2127 internal linkage. */
2128 else if (current_function_decl != 0
2129 && DECL_DECLARED_INLINE_P (current_function_decl)
2130 && DECL_EXTERNAL (current_function_decl)
2131 && VAR_OR_FUNCTION_DECL_P (ref)
2132 && (TREE_CODE (ref) != VAR_DECL || TREE_STATIC (ref))
2133 && ! TREE_PUBLIC (ref))
2134 pedwarn ("%H%qD is static but used in inline function %qD "
2135 "which is not static", &loc, ref, current_function_decl);
2140 /* Record details of decls possibly used inside sizeof or typeof. */
2141 struct maybe_used_decl
2145 /* The level seen at (in_sizeof + in_typeof). */
2147 /* The next one at this level or above, or NULL. */
2148 struct maybe_used_decl *next;
2151 static struct maybe_used_decl *maybe_used_decls;
2153 /* Record that DECL, an undefined static function reference seen
2154 inside sizeof or typeof, might be used if the operand of sizeof is
2155 a VLA type or the operand of typeof is a variably modified
2159 record_maybe_used_decl (tree decl)
2161 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2163 t->level = in_sizeof + in_typeof;
2164 t->next = maybe_used_decls;
2165 maybe_used_decls = t;
2168 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2169 USED is false, just discard them. If it is true, mark them used
2170 (if no longer inside sizeof or typeof) or move them to the next
2171 level up (if still inside sizeof or typeof). */
2174 pop_maybe_used (bool used)
2176 struct maybe_used_decl *p = maybe_used_decls;
2177 int cur_level = in_sizeof + in_typeof;
2178 while (p && p->level > cur_level)
2183 C_DECL_USED (p->decl) = 1;
2185 p->level = cur_level;
2189 if (!used || cur_level == 0)
2190 maybe_used_decls = p;
2193 /* Return the result of sizeof applied to EXPR. */
2196 c_expr_sizeof_expr (struct c_expr expr)
2199 if (expr.value == error_mark_node)
2201 ret.value = error_mark_node;
2202 ret.original_code = ERROR_MARK;
2203 pop_maybe_used (false);
2207 ret.value = c_sizeof (TREE_TYPE (expr.value));
2208 ret.original_code = ERROR_MARK;
2209 if (c_vla_type_p (TREE_TYPE (expr.value)))
2211 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2212 ret.value = build2 (COMPOUND_EXPR, TREE_TYPE (ret.value), expr.value, ret.value);
2214 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2219 /* Return the result of sizeof applied to T, a structure for the type
2220 name passed to sizeof (rather than the type itself). */
2223 c_expr_sizeof_type (struct c_type_name *t)
2227 type = groktypename (t);
2228 ret.value = c_sizeof (type);
2229 ret.original_code = ERROR_MARK;
2230 pop_maybe_used (type != error_mark_node
2231 ? C_TYPE_VARIABLE_SIZE (type) : false);
2235 /* Build a function call to function FUNCTION with parameters PARAMS.
2236 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2237 TREE_VALUE of each node is a parameter-expression.
2238 FUNCTION's data type may be a function type or a pointer-to-function. */
2241 build_function_call (tree function, tree params)
2243 tree fntype, fundecl = 0;
2244 tree name = NULL_TREE, result;
2250 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2251 STRIP_TYPE_NOPS (function);
2253 /* Convert anything with function type to a pointer-to-function. */
2254 if (TREE_CODE (function) == FUNCTION_DECL)
2256 /* Implement type-directed function overloading for builtins.
2257 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2258 handle all the type checking. The result is a complete expression
2259 that implements this function call. */
2260 tem = resolve_overloaded_builtin (function, params);
2264 name = DECL_NAME (function);
2267 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2268 function = function_to_pointer_conversion (function);
2270 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2271 expressions, like those used for ObjC messenger dispatches. */
2272 function = objc_rewrite_function_call (function, params);
2274 fntype = TREE_TYPE (function);
2276 if (TREE_CODE (fntype) == ERROR_MARK)
2277 return error_mark_node;
2279 if (!(TREE_CODE (fntype) == POINTER_TYPE
2280 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2282 error ("called object %qE is not a function", function);
2283 return error_mark_node;
2286 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2287 current_function_returns_abnormally = 1;
2289 /* fntype now gets the type of function pointed to. */
2290 fntype = TREE_TYPE (fntype);
2292 /* Check that the function is called through a compatible prototype.
2293 If it is not, replace the call by a trap, wrapped up in a compound
2294 expression if necessary. This has the nice side-effect to prevent
2295 the tree-inliner from generating invalid assignment trees which may
2296 blow up in the RTL expander later. */
2297 if ((TREE_CODE (function) == NOP_EXPR
2298 || TREE_CODE (function) == CONVERT_EXPR)
2299 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2300 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2301 && !comptypes (fntype, TREE_TYPE (tem)))
2303 tree return_type = TREE_TYPE (fntype);
2304 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2307 /* This situation leads to run-time undefined behavior. We can't,
2308 therefore, simply error unless we can prove that all possible
2309 executions of the program must execute the code. */
2310 warning (0, "function called through a non-compatible type");
2312 /* We can, however, treat "undefined" any way we please.
2313 Call abort to encourage the user to fix the program. */
2314 inform ("if this code is reached, the program will abort");
2316 if (VOID_TYPE_P (return_type))
2322 if (AGGREGATE_TYPE_P (return_type))
2323 rhs = build_compound_literal (return_type,
2324 build_constructor (return_type, 0));
2326 rhs = fold_convert (return_type, integer_zero_node);
2328 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2332 /* Convert the parameters to the types declared in the
2333 function prototype, or apply default promotions. */
2335 nargs = list_length (params);
2336 argarray = (tree *) alloca (nargs * sizeof (tree));
2337 nargs = convert_arguments (nargs, argarray, TYPE_ARG_TYPES (fntype),
2338 params, function, fundecl);
2340 return error_mark_node;
2342 /* Check that the arguments to the function are valid. */
2344 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2345 TYPE_ARG_TYPES (fntype));
2347 if (require_constant_value)
2349 result = fold_build_call_array_initializer (TREE_TYPE (fntype),
2350 function, nargs, argarray);
2351 if (TREE_CONSTANT (result)
2352 && (name == NULL_TREE
2353 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2354 pedwarn_init ("initializer element is not constant");
2357 result = fold_build_call_array (TREE_TYPE (fntype),
2358 function, nargs, argarray);
2360 if (VOID_TYPE_P (TREE_TYPE (result)))
2362 return require_complete_type (result);
2365 /* Convert the argument expressions in the list VALUES
2366 to the types in the list TYPELIST. The resulting arguments are
2367 stored in the array ARGARRAY which has size NARGS.
2369 If TYPELIST is exhausted, or when an element has NULL as its type,
2370 perform the default conversions.
2372 PARMLIST is the chain of parm decls for the function being called.
2373 It may be 0, if that info is not available.
2374 It is used only for generating error messages.
2376 FUNCTION is a tree for the called function. It is used only for
2377 error messages, where it is formatted with %qE.
2379 This is also where warnings about wrong number of args are generated.
2381 VALUES is a chain of TREE_LIST nodes with the elements of the list
2382 in the TREE_VALUE slots of those nodes.
2384 Returns the actual number of arguments processed (which may be less
2385 than NARGS in some error situations), or -1 on failure. */
2388 convert_arguments (int nargs, tree *argarray,
2389 tree typelist, tree values, tree function, tree fundecl)
2391 tree typetail, valtail;
2395 /* Change pointer to function to the function itself for
2397 if (TREE_CODE (function) == ADDR_EXPR
2398 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2399 function = TREE_OPERAND (function, 0);
2401 /* Handle an ObjC selector specially for diagnostics. */
2402 selector = objc_message_selector ();
2404 /* Scan the given expressions and types, producing individual
2405 converted arguments and storing them in ARGARRAY. */
2407 for (valtail = values, typetail = typelist, parmnum = 0;
2409 valtail = TREE_CHAIN (valtail), parmnum++)
2411 tree type = typetail ? TREE_VALUE (typetail) : 0;
2412 tree val = TREE_VALUE (valtail);
2413 tree rname = function;
2414 int argnum = parmnum + 1;
2415 const char *invalid_func_diag;
2417 if (type == void_type_node)
2419 error ("too many arguments to function %qE", function);
2423 if (selector && argnum > 2)
2429 STRIP_TYPE_NOPS (val);
2431 val = require_complete_type (val);
2435 /* Formal parm type is specified by a function prototype. */
2438 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2440 error ("type of formal parameter %d is incomplete", parmnum + 1);
2445 /* Optionally warn about conversions that
2446 differ from the default conversions. */
2447 if (warn_traditional_conversion || warn_traditional)
2449 unsigned int formal_prec = TYPE_PRECISION (type);
2451 if (INTEGRAL_TYPE_P (type)
2452 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2453 warning (0, "passing argument %d of %qE as integer "
2454 "rather than floating due to prototype",
2456 if (INTEGRAL_TYPE_P (type)
2457 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2458 warning (0, "passing argument %d of %qE as integer "
2459 "rather than complex due to prototype",
2461 else if (TREE_CODE (type) == COMPLEX_TYPE
2462 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2463 warning (0, "passing argument %d of %qE as complex "
2464 "rather than floating due to prototype",
2466 else if (TREE_CODE (type) == REAL_TYPE
2467 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2468 warning (0, "passing argument %d of %qE as floating "
2469 "rather than integer due to prototype",
2471 else if (TREE_CODE (type) == COMPLEX_TYPE
2472 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2473 warning (0, "passing argument %d of %qE as complex "
2474 "rather than integer due to prototype",
2476 else if (TREE_CODE (type) == REAL_TYPE
2477 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2478 warning (0, "passing argument %d of %qE as floating "
2479 "rather than complex due to prototype",
2481 /* ??? At some point, messages should be written about
2482 conversions between complex types, but that's too messy
2484 else if (TREE_CODE (type) == REAL_TYPE
2485 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2487 /* Warn if any argument is passed as `float',
2488 since without a prototype it would be `double'. */
2489 if (formal_prec == TYPE_PRECISION (float_type_node)
2490 && type != dfloat32_type_node)
2491 warning (0, "passing argument %d of %qE as %<float%> "
2492 "rather than %<double%> due to prototype",
2495 /* Warn if mismatch between argument and prototype
2496 for decimal float types. Warn of conversions with
2497 binary float types and of precision narrowing due to
2499 else if (type != TREE_TYPE (val)
2500 && (type == dfloat32_type_node
2501 || type == dfloat64_type_node
2502 || type == dfloat128_type_node
2503 || TREE_TYPE (val) == dfloat32_type_node
2504 || TREE_TYPE (val) == dfloat64_type_node
2505 || TREE_TYPE (val) == dfloat128_type_node)
2507 <= TYPE_PRECISION (TREE_TYPE (val))
2508 || (type == dfloat128_type_node
2510 != dfloat64_type_node
2512 != dfloat32_type_node)))
2513 || (type == dfloat64_type_node
2515 != dfloat32_type_node))))
2516 warning (0, "passing argument %d of %qE as %qT "
2517 "rather than %qT due to prototype",
2518 argnum, rname, type, TREE_TYPE (val));
2521 /* Detect integer changing in width or signedness.
2522 These warnings are only activated with
2523 -Wtraditional-conversion, not with -Wtraditional. */
2524 else if (warn_traditional_conversion && INTEGRAL_TYPE_P (type)
2525 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2527 tree would_have_been = default_conversion (val);
2528 tree type1 = TREE_TYPE (would_have_been);
2530 if (TREE_CODE (type) == ENUMERAL_TYPE
2531 && (TYPE_MAIN_VARIANT (type)
2532 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2533 /* No warning if function asks for enum
2534 and the actual arg is that enum type. */
2536 else if (formal_prec != TYPE_PRECISION (type1))
2537 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2538 "with different width due to prototype",
2540 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2542 /* Don't complain if the formal parameter type
2543 is an enum, because we can't tell now whether
2544 the value was an enum--even the same enum. */
2545 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2547 else if (TREE_CODE (val) == INTEGER_CST
2548 && int_fits_type_p (val, type))
2549 /* Change in signedness doesn't matter
2550 if a constant value is unaffected. */
2552 /* If the value is extended from a narrower
2553 unsigned type, it doesn't matter whether we
2554 pass it as signed or unsigned; the value
2555 certainly is the same either way. */
2556 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2557 && TYPE_UNSIGNED (TREE_TYPE (val)))
2559 else if (TYPE_UNSIGNED (type))
2560 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2561 "as unsigned due to prototype",
2564 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2565 "as signed due to prototype", argnum, rname);
2569 parmval = convert_for_assignment (type, val, ic_argpass,
2573 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2574 && INTEGRAL_TYPE_P (type)
2575 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2576 parmval = default_conversion (parmval);
2578 argarray[parmnum] = parmval;
2580 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2581 && (TYPE_PRECISION (TREE_TYPE (val))
2582 < TYPE_PRECISION (double_type_node))
2583 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2584 /* Convert `float' to `double'. */
2585 argarray[parmnum] = convert (double_type_node, val);
2586 else if ((invalid_func_diag =
2587 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2589 error (invalid_func_diag);
2593 /* Convert `short' and `char' to full-size `int'. */
2594 argarray[parmnum] = default_conversion (val);
2597 typetail = TREE_CHAIN (typetail);
2600 gcc_assert (parmnum == nargs);
2602 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2604 error ("too few arguments to function %qE", function);
2611 /* This is the entry point used by the parser to build unary operators
2612 in the input. CODE, a tree_code, specifies the unary operator, and
2613 ARG is the operand. For unary plus, the C parser currently uses
2614 CONVERT_EXPR for code. */
2617 parser_build_unary_op (enum tree_code code, struct c_expr arg)
2619 struct c_expr result;
2621 result.original_code = ERROR_MARK;
2622 result.value = build_unary_op (code, arg.value, 0);
2624 if (TREE_OVERFLOW_P (result.value) && !TREE_OVERFLOW_P (arg.value))
2625 overflow_warning (result.value);
2630 /* This is the entry point used by the parser to build binary operators
2631 in the input. CODE, a tree_code, specifies the binary operator, and
2632 ARG1 and ARG2 are the operands. In addition to constructing the
2633 expression, we check for operands that were written with other binary
2634 operators in a way that is likely to confuse the user. */
2637 parser_build_binary_op (enum tree_code code, struct c_expr arg1,
2640 struct c_expr result;
2642 enum tree_code code1 = arg1.original_code;
2643 enum tree_code code2 = arg2.original_code;
2645 result.value = build_binary_op (code, arg1.value, arg2.value, 1);
2646 result.original_code = code;
2648 if (TREE_CODE (result.value) == ERROR_MARK)
2651 /* Check for cases such as x+y<<z which users are likely
2653 if (warn_parentheses)
2654 warn_about_parentheses (code, code1, code2);
2656 if (code1 != tcc_comparison)
2657 warn_logical_operator (code, arg1.value, arg2.value);
2659 /* Warn about comparisons against string literals, with the exception
2660 of testing for equality or inequality of a string literal with NULL. */
2661 if (code == EQ_EXPR || code == NE_EXPR)
2663 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2664 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2665 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2667 else if (TREE_CODE_CLASS (code) == tcc_comparison
2668 && (code1 == STRING_CST || code2 == STRING_CST))
2669 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2671 if (TREE_OVERFLOW_P (result.value)
2672 && !TREE_OVERFLOW_P (arg1.value)
2673 && !TREE_OVERFLOW_P (arg2.value))
2674 overflow_warning (result.value);
2679 /* Return a tree for the difference of pointers OP0 and OP1.
2680 The resulting tree has type int. */
2683 pointer_diff (tree op0, tree op1)
2685 tree restype = ptrdiff_type_node;
2687 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2688 tree con0, con1, lit0, lit1;
2689 tree orig_op1 = op1;
2691 if (pedantic || warn_pointer_arith)
2693 if (TREE_CODE (target_type) == VOID_TYPE)
2694 pedwarn ("pointer of type %<void *%> used in subtraction");
2695 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2696 pedwarn ("pointer to a function used in subtraction");
2699 /* If the conversion to ptrdiff_type does anything like widening or
2700 converting a partial to an integral mode, we get a convert_expression
2701 that is in the way to do any simplifications.
2702 (fold-const.c doesn't know that the extra bits won't be needed.
2703 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2704 different mode in place.)
2705 So first try to find a common term here 'by hand'; we want to cover
2706 at least the cases that occur in legal static initializers. */
2707 if ((TREE_CODE (op0) == NOP_EXPR || TREE_CODE (op0) == CONVERT_EXPR)
2708 && (TYPE_PRECISION (TREE_TYPE (op0))
2709 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2710 con0 = TREE_OPERAND (op0, 0);
2713 if ((TREE_CODE (op1) == NOP_EXPR || TREE_CODE (op1) == CONVERT_EXPR)
2714 && (TYPE_PRECISION (TREE_TYPE (op1))
2715 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2716 con1 = TREE_OPERAND (op1, 0);
2720 if (TREE_CODE (con0) == PLUS_EXPR)
2722 lit0 = TREE_OPERAND (con0, 1);
2723 con0 = TREE_OPERAND (con0, 0);
2726 lit0 = integer_zero_node;
2728 if (TREE_CODE (con1) == PLUS_EXPR)
2730 lit1 = TREE_OPERAND (con1, 1);
2731 con1 = TREE_OPERAND (con1, 0);
2734 lit1 = integer_zero_node;
2736 if (operand_equal_p (con0, con1, 0))
2743 /* First do the subtraction as integers;
2744 then drop through to build the divide operator.
2745 Do not do default conversions on the minus operator
2746 in case restype is a short type. */
2748 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2749 convert (restype, op1), 0);
2750 /* This generates an error if op1 is pointer to incomplete type. */
2751 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2752 error ("arithmetic on pointer to an incomplete type");
2754 /* This generates an error if op0 is pointer to incomplete type. */
2755 op1 = c_size_in_bytes (target_type);
2757 /* Divide by the size, in easiest possible way. */
2758 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2761 /* Construct and perhaps optimize a tree representation
2762 for a unary operation. CODE, a tree_code, specifies the operation
2763 and XARG is the operand.
2764 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2765 the default promotions (such as from short to int).
2766 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2767 allows non-lvalues; this is only used to handle conversion of non-lvalue
2768 arrays to pointers in C99. */
2771 build_unary_op (enum tree_code code, tree xarg, int flag)
2773 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2776 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2778 int noconvert = flag;
2779 const char *invalid_op_diag;
2781 if (typecode == ERROR_MARK)
2782 return error_mark_node;
2783 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2784 typecode = INTEGER_TYPE;
2786 if ((invalid_op_diag
2787 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2789 error (invalid_op_diag);
2790 return error_mark_node;
2796 /* This is used for unary plus, because a CONVERT_EXPR
2797 is enough to prevent anybody from looking inside for
2798 associativity, but won't generate any code. */
2799 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2800 || typecode == COMPLEX_TYPE
2801 || typecode == VECTOR_TYPE))
2803 error ("wrong type argument to unary plus");
2804 return error_mark_node;
2806 else if (!noconvert)
2807 arg = default_conversion (arg);
2808 arg = non_lvalue (arg);
2812 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2813 || typecode == COMPLEX_TYPE
2814 || typecode == VECTOR_TYPE))
2816 error ("wrong type argument to unary minus");
2817 return error_mark_node;
2819 else if (!noconvert)
2820 arg = default_conversion (arg);
2824 if (typecode == INTEGER_TYPE || typecode == VECTOR_TYPE)
2827 arg = default_conversion (arg);
2829 else if (typecode == COMPLEX_TYPE)
2833 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2835 arg = default_conversion (arg);
2839 error ("wrong type argument to bit-complement");
2840 return error_mark_node;
2845 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2847 error ("wrong type argument to abs");
2848 return error_mark_node;
2850 else if (!noconvert)
2851 arg = default_conversion (arg);
2855 /* Conjugating a real value is a no-op, but allow it anyway. */
2856 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2857 || typecode == COMPLEX_TYPE))
2859 error ("wrong type argument to conjugation");
2860 return error_mark_node;
2862 else if (!noconvert)
2863 arg = default_conversion (arg);
2866 case TRUTH_NOT_EXPR:
2867 if (typecode != INTEGER_TYPE
2868 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2869 && typecode != COMPLEX_TYPE)
2871 error ("wrong type argument to unary exclamation mark");
2872 return error_mark_node;
2874 arg = c_objc_common_truthvalue_conversion (arg);
2875 return invert_truthvalue (arg);
2878 if (TREE_CODE (arg) == COMPLEX_CST)
2879 return TREE_REALPART (arg);
2880 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2881 return fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2886 if (TREE_CODE (arg) == COMPLEX_CST)
2887 return TREE_IMAGPART (arg);
2888 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2889 return fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2891 return convert (TREE_TYPE (arg), integer_zero_node);
2893 case PREINCREMENT_EXPR:
2894 case POSTINCREMENT_EXPR:
2895 case PREDECREMENT_EXPR:
2896 case POSTDECREMENT_EXPR:
2898 /* Increment or decrement the real part of the value,
2899 and don't change the imaginary part. */
2900 if (typecode == COMPLEX_TYPE)
2905 pedwarn ("ISO C does not support %<++%> and %<--%>"
2906 " on complex types");
2908 arg = stabilize_reference (arg);
2909 real = build_unary_op (REALPART_EXPR, arg, 1);
2910 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2911 real = build_unary_op (code, real, 1);
2912 if (real == error_mark_node || imag == error_mark_node)
2913 return error_mark_node;
2914 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
2918 /* Report invalid types. */
2920 if (typecode != POINTER_TYPE
2921 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2923 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2924 error ("wrong type argument to increment");
2926 error ("wrong type argument to decrement");
2928 return error_mark_node;
2933 tree result_type = TREE_TYPE (arg);
2935 arg = get_unwidened (arg, 0);
2936 argtype = TREE_TYPE (arg);
2938 /* Compute the increment. */
2940 if (typecode == POINTER_TYPE)
2942 /* If pointer target is an undefined struct,
2943 we just cannot know how to do the arithmetic. */
2944 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2946 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2947 error ("increment of pointer to unknown structure");
2949 error ("decrement of pointer to unknown structure");
2951 else if ((pedantic || warn_pointer_arith)
2952 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2953 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2955 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2956 pedwarn ("wrong type argument to increment");
2958 pedwarn ("wrong type argument to decrement");
2961 inc = c_size_in_bytes (TREE_TYPE (result_type));
2962 inc = fold_convert (sizetype, inc);
2966 inc = integer_one_node;
2967 inc = convert (argtype, inc);
2970 /* Complain about anything else that is not a true lvalue. */
2971 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
2972 || code == POSTINCREMENT_EXPR)
2975 return error_mark_node;
2977 /* Report a read-only lvalue. */
2978 if (TREE_READONLY (arg))
2980 readonly_error (arg,
2981 ((code == PREINCREMENT_EXPR
2982 || code == POSTINCREMENT_EXPR)
2983 ? lv_increment : lv_decrement));
2984 return error_mark_node;
2987 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2988 val = boolean_increment (code, arg);
2990 val = build2 (code, TREE_TYPE (arg), arg, inc);
2991 TREE_SIDE_EFFECTS (val) = 1;
2992 val = convert (result_type, val);
2993 if (TREE_CODE (val) != code)
2994 TREE_NO_WARNING (val) = 1;
2999 /* Note that this operation never does default_conversion. */
3001 /* Let &* cancel out to simplify resulting code. */
3002 if (TREE_CODE (arg) == INDIRECT_REF)
3004 /* Don't let this be an lvalue. */
3005 if (lvalue_p (TREE_OPERAND (arg, 0)))
3006 return non_lvalue (TREE_OPERAND (arg, 0));
3007 return TREE_OPERAND (arg, 0);
3010 /* For &x[y], return x+y */
3011 if (TREE_CODE (arg) == ARRAY_REF)
3013 tree op0 = TREE_OPERAND (arg, 0);
3014 if (!c_mark_addressable (op0))
3015 return error_mark_node;
3016 return build_binary_op (PLUS_EXPR,
3017 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3018 ? array_to_pointer_conversion (op0)
3020 TREE_OPERAND (arg, 1), 1);
3023 /* Anything not already handled and not a true memory reference
3024 or a non-lvalue array is an error. */
3025 else if (typecode != FUNCTION_TYPE && !flag
3026 && !lvalue_or_else (arg, lv_addressof))
3027 return error_mark_node;
3029 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3030 argtype = TREE_TYPE (arg);
3032 /* If the lvalue is const or volatile, merge that into the type
3033 to which the address will point. Note that you can't get a
3034 restricted pointer by taking the address of something, so we
3035 only have to deal with `const' and `volatile' here. */
3036 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3037 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3038 argtype = c_build_type_variant (argtype,
3039 TREE_READONLY (arg),
3040 TREE_THIS_VOLATILE (arg));
3042 if (!c_mark_addressable (arg))
3043 return error_mark_node;
3045 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3046 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3048 argtype = build_pointer_type (argtype);
3050 /* ??? Cope with user tricks that amount to offsetof. Delete this
3051 when we have proper support for integer constant expressions. */
3052 val = get_base_address (arg);
3053 if (val && TREE_CODE (val) == INDIRECT_REF
3054 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3056 tree op0 = fold_convert (sizetype, fold_offsetof (arg, val)), op1;
3058 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3059 return fold_build2 (POINTER_PLUS_EXPR, argtype, op1, op0);
3062 val = build1 (ADDR_EXPR, argtype, arg);
3071 argtype = TREE_TYPE (arg);
3072 return require_constant_value ? fold_build1_initializer (code, argtype, arg)
3073 : fold_build1 (code, argtype, arg);
3076 /* Return nonzero if REF is an lvalue valid for this language.
3077 Lvalues can be assigned, unless their type has TYPE_READONLY.
3078 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3083 enum tree_code code = TREE_CODE (ref);
3090 return lvalue_p (TREE_OPERAND (ref, 0));
3092 case COMPOUND_LITERAL_EXPR:
3102 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3103 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3106 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3113 /* Give an error for storing in something that is 'const'. */
3116 readonly_error (tree arg, enum lvalue_use use)
3118 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3120 /* Using this macro rather than (for example) arrays of messages
3121 ensures that all the format strings are checked at compile
3123 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3124 : (use == lv_increment ? (I) \
3125 : (use == lv_decrement ? (D) : (AS))))
3126 if (TREE_CODE (arg) == COMPONENT_REF)
3128 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3129 readonly_error (TREE_OPERAND (arg, 0), use);
3131 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3132 G_("increment of read-only member %qD"),
3133 G_("decrement of read-only member %qD"),
3134 G_("read-only member %qD used as %<asm%> output")),
3135 TREE_OPERAND (arg, 1));
3137 else if (TREE_CODE (arg) == VAR_DECL)
3138 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3139 G_("increment of read-only variable %qD"),
3140 G_("decrement of read-only variable %qD"),
3141 G_("read-only variable %qD used as %<asm%> output")),
3144 error (READONLY_MSG (G_("assignment of read-only location"),
3145 G_("increment of read-only location"),
3146 G_("decrement of read-only location"),
3147 G_("read-only location used as %<asm%> output")));
3151 /* Return nonzero if REF is an lvalue valid for this language;
3152 otherwise, print an error message and return zero. USE says
3153 how the lvalue is being used and so selects the error message. */
3156 lvalue_or_else (tree ref, enum lvalue_use use)
3158 int win = lvalue_p (ref);
3166 /* Mark EXP saying that we need to be able to take the
3167 address of it; it should not be allocated in a register.
3168 Returns true if successful. */
3171 c_mark_addressable (tree exp)
3176 switch (TREE_CODE (x))
3179 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3182 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3186 /* ... fall through ... */
3192 x = TREE_OPERAND (x, 0);
3195 case COMPOUND_LITERAL_EXPR:
3197 TREE_ADDRESSABLE (x) = 1;
3204 if (C_DECL_REGISTER (x)
3205 && DECL_NONLOCAL (x))
3207 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3210 ("global register variable %qD used in nested function", x);
3213 pedwarn ("register variable %qD used in nested function", x);
3215 else if (C_DECL_REGISTER (x))
3217 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3218 error ("address of global register variable %qD requested", x);
3220 error ("address of register variable %qD requested", x);
3226 TREE_ADDRESSABLE (x) = 1;
3233 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3236 build_conditional_expr (tree ifexp, tree op1, tree op2)
3240 enum tree_code code1;
3241 enum tree_code code2;
3242 tree result_type = NULL;
3243 tree orig_op1 = op1, orig_op2 = op2;
3245 /* Promote both alternatives. */
3247 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3248 op1 = default_conversion (op1);
3249 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3250 op2 = default_conversion (op2);
3252 if (TREE_CODE (ifexp) == ERROR_MARK
3253 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3254 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3255 return error_mark_node;
3257 type1 = TREE_TYPE (op1);
3258 code1 = TREE_CODE (type1);
3259 type2 = TREE_TYPE (op2);
3260 code2 = TREE_CODE (type2);
3262 /* C90 does not permit non-lvalue arrays in conditional expressions.
3263 In C99 they will be pointers by now. */
3264 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3266 error ("non-lvalue array in conditional expression");
3267 return error_mark_node;
3270 /* Quickly detect the usual case where op1 and op2 have the same type
3272 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3275 result_type = type1;
3277 result_type = TYPE_MAIN_VARIANT (type1);
3279 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3280 || code1 == COMPLEX_TYPE)
3281 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3282 || code2 == COMPLEX_TYPE))
3284 result_type = c_common_type (type1, type2);
3286 /* If -Wsign-compare, warn here if type1 and type2 have
3287 different signedness. We'll promote the signed to unsigned
3288 and later code won't know it used to be different.
3289 Do this check on the original types, so that explicit casts
3290 will be considered, but default promotions won't. */
3291 if (warn_sign_compare && !skip_evaluation)
3293 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3294 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3296 if (unsigned_op1 ^ unsigned_op2)
3300 /* Do not warn if the result type is signed, since the
3301 signed type will only be chosen if it can represent
3302 all the values of the unsigned type. */
3303 if (!TYPE_UNSIGNED (result_type))
3305 /* Do not warn if the signed quantity is an unsuffixed
3306 integer literal (or some static constant expression
3307 involving such literals) and it is non-negative. */
3308 else if ((unsigned_op2
3309 && tree_expr_nonnegative_warnv_p (op1, &ovf))
3311 && tree_expr_nonnegative_warnv_p (op2, &ovf)))
3314 warning (0, "signed and unsigned type in conditional expression");
3318 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3320 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3321 pedwarn ("ISO C forbids conditional expr with only one void side");
3322 result_type = void_type_node;
3324 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3326 if (comp_target_types (type1, type2))
3327 result_type = common_pointer_type (type1, type2);
3328 else if (null_pointer_constant_p (orig_op1))
3329 result_type = qualify_type (type2, type1);
3330 else if (null_pointer_constant_p (orig_op2))
3331 result_type = qualify_type (type1, type2);
3332 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3334 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3335 pedwarn ("ISO C forbids conditional expr between "
3336 "%<void *%> and function pointer");
3337 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3338 TREE_TYPE (type2)));
3340 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3342 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3343 pedwarn ("ISO C forbids conditional expr between "
3344 "%<void *%> and function pointer");
3345 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3346 TREE_TYPE (type1)));
3350 pedwarn ("pointer type mismatch in conditional expression");
3351 result_type = build_pointer_type (void_type_node);
3354 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3356 if (!null_pointer_constant_p (orig_op2))
3357 pedwarn ("pointer/integer type mismatch in conditional expression");
3360 op2 = null_pointer_node;
3362 result_type = type1;
3364 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3366 if (!null_pointer_constant_p (orig_op1))
3367 pedwarn ("pointer/integer type mismatch in conditional expression");
3370 op1 = null_pointer_node;
3372 result_type = type2;
3377 if (flag_cond_mismatch)
3378 result_type = void_type_node;
3381 error ("type mismatch in conditional expression");
3382 return error_mark_node;
3386 /* Merge const and volatile flags of the incoming types. */
3388 = build_type_variant (result_type,
3389 TREE_READONLY (op1) || TREE_READONLY (op2),
3390 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3392 if (result_type != TREE_TYPE (op1))
3393 op1 = convert_and_check (result_type, op1);
3394 if (result_type != TREE_TYPE (op2))
3395 op2 = convert_and_check (result_type, op2);
3397 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3400 /* Return a compound expression that performs two expressions and
3401 returns the value of the second of them. */
3404 build_compound_expr (tree expr1, tree expr2)
3406 if (!TREE_SIDE_EFFECTS (expr1))
3408 /* The left-hand operand of a comma expression is like an expression
3409 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3410 any side-effects, unless it was explicitly cast to (void). */
3411 if (warn_unused_value)
3413 if (VOID_TYPE_P (TREE_TYPE (expr1))
3414 && (TREE_CODE (expr1) == NOP_EXPR
3415 || TREE_CODE (expr1) == CONVERT_EXPR))
3417 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3418 && TREE_CODE (expr1) == COMPOUND_EXPR
3419 && (TREE_CODE (TREE_OPERAND (expr1, 1)) == CONVERT_EXPR
3420 || TREE_CODE (TREE_OPERAND (expr1, 1)) == NOP_EXPR))
3421 ; /* (void) a, (void) b, c */
3423 warning (OPT_Wunused_value,
3424 "left-hand operand of comma expression has no effect");
3428 /* With -Wunused, we should also warn if the left-hand operand does have
3429 side-effects, but computes a value which is not used. For example, in
3430 `foo() + bar(), baz()' the result of the `+' operator is not used,
3431 so we should issue a warning. */
3432 else if (warn_unused_value)
3433 warn_if_unused_value (expr1, input_location);
3435 if (expr2 == error_mark_node)
3436 return error_mark_node;
3438 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3441 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3444 build_c_cast (tree type, tree expr)
3448 if (type == error_mark_node || expr == error_mark_node)
3449 return error_mark_node;
3451 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3452 only in <protocol> qualifications. But when constructing cast expressions,
3453 the protocols do matter and must be kept around. */
3454 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3455 return build1 (NOP_EXPR, type, expr);
3457 type = TYPE_MAIN_VARIANT (type);
3459 if (TREE_CODE (type) == ARRAY_TYPE)
3461 error ("cast specifies array type");
3462 return error_mark_node;
3465 if (TREE_CODE (type) == FUNCTION_TYPE)
3467 error ("cast specifies function type");
3468 return error_mark_node;
3471 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3475 if (TREE_CODE (type) == RECORD_TYPE
3476 || TREE_CODE (type) == UNION_TYPE)
3477 pedwarn ("ISO C forbids casting nonscalar to the same type");
3480 else if (TREE_CODE (type) == UNION_TYPE)
3484 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3485 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3486 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3494 pedwarn ("ISO C forbids casts to union type");
3495 t = digest_init (type,
3496 build_constructor_single (type, field, value),
3498 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3499 TREE_INVARIANT (t) = TREE_INVARIANT (value);
3502 error ("cast to union type from type not present in union");
3503 return error_mark_node;
3509 if (type == void_type_node)
3510 return build1 (CONVERT_EXPR, type, value);
3512 otype = TREE_TYPE (value);
3514 /* Optionally warn about potentially worrisome casts. */
3517 && TREE_CODE (type) == POINTER_TYPE
3518 && TREE_CODE (otype) == POINTER_TYPE)
3520 tree in_type = type;
3521 tree in_otype = otype;
3525 /* Check that the qualifiers on IN_TYPE are a superset of
3526 the qualifiers of IN_OTYPE. The outermost level of
3527 POINTER_TYPE nodes is uninteresting and we stop as soon
3528 as we hit a non-POINTER_TYPE node on either type. */
3531 in_otype = TREE_TYPE (in_otype);
3532 in_type = TREE_TYPE (in_type);
3534 /* GNU C allows cv-qualified function types. 'const'
3535 means the function is very pure, 'volatile' means it
3536 can't return. We need to warn when such qualifiers
3537 are added, not when they're taken away. */
3538 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3539 && TREE_CODE (in_type) == FUNCTION_TYPE)
3540 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3542 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3544 while (TREE_CODE (in_type) == POINTER_TYPE
3545 && TREE_CODE (in_otype) == POINTER_TYPE);
3548 warning (0, "cast adds new qualifiers to function type");
3551 /* There are qualifiers present in IN_OTYPE that are not
3552 present in IN_TYPE. */
3553 warning (0, "cast discards qualifiers from pointer target type");
3556 /* Warn about possible alignment problems. */
3557 if (STRICT_ALIGNMENT
3558 && TREE_CODE (type) == POINTER_TYPE
3559 && TREE_CODE (otype) == POINTER_TYPE
3560 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3561 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3562 /* Don't warn about opaque types, where the actual alignment
3563 restriction is unknown. */
3564 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3565 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3566 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3567 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3568 warning (OPT_Wcast_align,
3569 "cast increases required alignment of target type");
3571 if (TREE_CODE (type) == INTEGER_TYPE
3572 && TREE_CODE (otype) == POINTER_TYPE
3573 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3574 /* Unlike conversion of integers to pointers, where the
3575 warning is disabled for converting constants because
3576 of cases such as SIG_*, warn about converting constant
3577 pointers to integers. In some cases it may cause unwanted
3578 sign extension, and a warning is appropriate. */
3579 warning (OPT_Wpointer_to_int_cast,
3580 "cast from pointer to integer of different size");
3582 if (TREE_CODE (value) == CALL_EXPR
3583 && TREE_CODE (type) != TREE_CODE (otype))
3584 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3585 "to non-matching type %qT", otype, type);
3587 if (TREE_CODE (type) == POINTER_TYPE
3588 && TREE_CODE (otype) == INTEGER_TYPE
3589 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3590 /* Don't warn about converting any constant. */
3591 && !TREE_CONSTANT (value))
3592 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3593 "of different size");
3595 if (warn_strict_aliasing <= 2)
3596 strict_aliasing_warning (otype, type, expr);
3598 /* If pedantic, warn for conversions between function and object
3599 pointer types, except for converting a null pointer constant
3600 to function pointer type. */
3602 && TREE_CODE (type) == POINTER_TYPE
3603 && TREE_CODE (otype) == POINTER_TYPE
3604 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3605 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3606 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3609 && TREE_CODE (type) == POINTER_TYPE
3610 && TREE_CODE (otype) == POINTER_TYPE
3611 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3612 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3613 && !null_pointer_constant_p (value))
3614 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3617 value = convert (type, value);
3619 /* Ignore any integer overflow caused by the cast. */
3620 if (TREE_CODE (value) == INTEGER_CST)
3622 if (CONSTANT_CLASS_P (ovalue) && TREE_OVERFLOW (ovalue))
3624 if (!TREE_OVERFLOW (value))
3626 /* Avoid clobbering a shared constant. */
3627 value = copy_node (value);
3628 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3631 else if (TREE_OVERFLOW (value))
3632 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3633 value = build_int_cst_wide (TREE_TYPE (value),
3634 TREE_INT_CST_LOW (value),
3635 TREE_INT_CST_HIGH (value));
3639 /* Don't let a cast be an lvalue. */
3641 value = non_lvalue (value);
3646 /* Interpret a cast of expression EXPR to type TYPE. */
3648 c_cast_expr (struct c_type_name *type_name, tree expr)
3651 int saved_wsp = warn_strict_prototypes;
3653 /* This avoids warnings about unprototyped casts on
3654 integers. E.g. "#define SIG_DFL (void(*)())0". */
3655 if (TREE_CODE (expr) == INTEGER_CST)
3656 warn_strict_prototypes = 0;
3657 type = groktypename (type_name);
3658 warn_strict_prototypes = saved_wsp;
3660 return build_c_cast (type, expr);
3663 /* Build an assignment expression of lvalue LHS from value RHS.
3664 MODIFYCODE is the code for a binary operator that we use
3665 to combine the old value of LHS with RHS to get the new value.
3666 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3669 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3673 tree lhstype = TREE_TYPE (lhs);
3674 tree olhstype = lhstype;
3676 /* Types that aren't fully specified cannot be used in assignments. */
3677 lhs = require_complete_type (lhs);
3679 /* Avoid duplicate error messages from operands that had errors. */
3680 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3681 return error_mark_node;
3683 if (!lvalue_or_else (lhs, lv_assign))
3684 return error_mark_node;
3686 STRIP_TYPE_NOPS (rhs);
3690 /* If a binary op has been requested, combine the old LHS value with the RHS
3691 producing the value we should actually store into the LHS. */
3693 if (modifycode != NOP_EXPR)
3695 lhs = stabilize_reference (lhs);
3696 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3699 /* Give an error for storing in something that is 'const'. */
3701 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3702 || ((TREE_CODE (lhstype) == RECORD_TYPE
3703 || TREE_CODE (lhstype) == UNION_TYPE)
3704 && C_TYPE_FIELDS_READONLY (lhstype)))
3706 readonly_error (lhs, lv_assign);
3707 return error_mark_node;
3710 /* If storing into a structure or union member,
3711 it has probably been given type `int'.
3712 Compute the type that would go with
3713 the actual amount of storage the member occupies. */
3715 if (TREE_CODE (lhs) == COMPONENT_REF
3716 && (TREE_CODE (lhstype) == INTEGER_TYPE
3717 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3718 || TREE_CODE (lhstype) == REAL_TYPE
3719 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3720 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3722 /* If storing in a field that is in actuality a short or narrower than one,
3723 we must store in the field in its actual type. */
3725 if (lhstype != TREE_TYPE (lhs))
3727 lhs = copy_node (lhs);
3728 TREE_TYPE (lhs) = lhstype;
3731 /* Convert new value to destination type. */
3733 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3734 NULL_TREE, NULL_TREE, 0);
3735 if (TREE_CODE (newrhs) == ERROR_MARK)
3736 return error_mark_node;
3738 /* Emit ObjC write barrier, if necessary. */
3739 if (c_dialect_objc () && flag_objc_gc)
3741 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3746 /* Scan operands. */
3748 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3749 TREE_SIDE_EFFECTS (result) = 1;
3751 /* If we got the LHS in a different type for storing in,
3752 convert the result back to the nominal type of LHS
3753 so that the value we return always has the same type
3754 as the LHS argument. */
3756 if (olhstype == TREE_TYPE (result))
3758 return convert_for_assignment (olhstype, result, ic_assign,
3759 NULL_TREE, NULL_TREE, 0);
3762 /* Convert value RHS to type TYPE as preparation for an assignment
3763 to an lvalue of type TYPE.
3764 The real work of conversion is done by `convert'.
3765 The purpose of this function is to generate error messages
3766 for assignments that are not allowed in C.
3767 ERRTYPE says whether it is argument passing, assignment,
3768 initialization or return.
3770 FUNCTION is a tree for the function being called.
3771 PARMNUM is the number of the argument, for printing in error messages. */
3774 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3775 tree fundecl, tree function, int parmnum)
3777 enum tree_code codel = TREE_CODE (type);
3779 enum tree_code coder;
3780 tree rname = NULL_TREE;
3781 bool objc_ok = false;
3783 if (errtype == ic_argpass || errtype == ic_argpass_nonproto)
3786 /* Change pointer to function to the function itself for
3788 if (TREE_CODE (function) == ADDR_EXPR
3789 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3790 function = TREE_OPERAND (function, 0);
3792 /* Handle an ObjC selector specially for diagnostics. */
3793 selector = objc_message_selector ();
3795 if (selector && parmnum > 2)
3802 /* This macro is used to emit diagnostics to ensure that all format
3803 strings are complete sentences, visible to gettext and checked at
3805 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3810 pedwarn (AR, parmnum, rname); \
3812 case ic_argpass_nonproto: \
3813 warning (0, AR, parmnum, rname); \
3825 gcc_unreachable (); \
3829 STRIP_TYPE_NOPS (rhs);
3831 if (optimize && TREE_CODE (rhs) == VAR_DECL
3832 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
3833 rhs = decl_constant_value_for_broken_optimization (rhs);
3835 rhstype = TREE_TYPE (rhs);
3836 coder = TREE_CODE (rhstype);
3838 if (coder == ERROR_MARK)
3839 return error_mark_node;
3841 if (c_dialect_objc ())
3864 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
3867 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
3870 if (coder == VOID_TYPE)
3872 /* Except for passing an argument to an unprototyped function,
3873 this is a constraint violation. When passing an argument to
3874 an unprototyped function, it is compile-time undefined;
3875 making it a constraint in that case was rejected in
3877 error ("void value not ignored as it ought to be");
3878 return error_mark_node;
3880 /* A type converts to a reference to it.
3881 This code doesn't fully support references, it's just for the
3882 special case of va_start and va_copy. */
3883 if (codel == REFERENCE_TYPE
3884 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
3886 if (!lvalue_p (rhs))
3888 error ("cannot pass rvalue to reference parameter");
3889 return error_mark_node;
3891 if (!c_mark_addressable (rhs))
3892 return error_mark_node;
3893 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
3895 /* We already know that these two types are compatible, but they
3896 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3897 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3898 likely to be va_list, a typedef to __builtin_va_list, which
3899 is different enough that it will cause problems later. */
3900 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
3901 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
3903 rhs = build1 (NOP_EXPR, type, rhs);
3906 /* Some types can interconvert without explicit casts. */
3907 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
3908 && vector_types_convertible_p (type, TREE_TYPE (rhs), true))
3909 return convert (type, rhs);
3910 /* Arithmetic types all interconvert, and enum is treated like int. */
3911 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
3912 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
3913 || codel == BOOLEAN_TYPE)
3914 && (coder == INTEGER_TYPE || coder == REAL_TYPE
3915 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
3916 || coder == BOOLEAN_TYPE))
3917 return convert_and_check (type, rhs);
3919 /* Aggregates in different TUs might need conversion. */
3920 if ((codel == RECORD_TYPE || codel == UNION_TYPE)
3922 && comptypes (type, rhstype))
3923 return convert_and_check (type, rhs);
3925 /* Conversion to a transparent union from its member types.
3926 This applies only to function arguments. */
3927 if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
3928 && (errtype == ic_argpass || errtype == ic_argpass_nonproto))
3930 tree memb, marginal_memb = NULL_TREE;
3932 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
3934 tree memb_type = TREE_TYPE (memb);
3936 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
3937 TYPE_MAIN_VARIANT (rhstype)))
3940 if (TREE_CODE (memb_type) != POINTER_TYPE)
3943 if (coder == POINTER_TYPE)
3945 tree ttl = TREE_TYPE (memb_type);
3946 tree ttr = TREE_TYPE (rhstype);
3948 /* Any non-function converts to a [const][volatile] void *
3949 and vice versa; otherwise, targets must be the same.
3950 Meanwhile, the lhs target must have all the qualifiers of
3952 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3953 || comp_target_types (memb_type, rhstype))
3955 /* If this type won't generate any warnings, use it. */
3956 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
3957 || ((TREE_CODE (ttr) == FUNCTION_TYPE
3958 && TREE_CODE (ttl) == FUNCTION_TYPE)
3959 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3960 == TYPE_QUALS (ttr))
3961 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3962 == TYPE_QUALS (ttl))))
3965 /* Keep looking for a better type, but remember this one. */
3967 marginal_memb = memb;
3971 /* Can convert integer zero to any pointer type. */
3972 if (null_pointer_constant_p (rhs))
3974 rhs = null_pointer_node;
3979 if (memb || marginal_memb)
3983 /* We have only a marginally acceptable member type;
3984 it needs a warning. */
3985 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
3986 tree ttr = TREE_TYPE (rhstype);
3988 /* Const and volatile mean something different for function
3989 types, so the usual warnings are not appropriate. */
3990 if (TREE_CODE (ttr) == FUNCTION_TYPE
3991 && TREE_CODE (ttl) == FUNCTION_TYPE)
3993 /* Because const and volatile on functions are
3994 restrictions that say the function will not do
3995 certain things, it is okay to use a const or volatile
3996 function where an ordinary one is wanted, but not
3998 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
3999 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
4000 "makes qualified function "
4001 "pointer from unqualified"),
4002 G_("assignment makes qualified "
4003 "function pointer from "
4005 G_("initialization makes qualified "
4006 "function pointer from "
4008 G_("return makes qualified function "
4009 "pointer from unqualified"));
4011 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4012 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4013 "qualifiers from pointer target type"),
4014 G_("assignment discards qualifiers "
4015 "from pointer target type"),
4016 G_("initialization discards qualifiers "
4017 "from pointer target type"),
4018 G_("return discards qualifiers from "
4019 "pointer target type"));
4021 memb = marginal_memb;
4024 if (pedantic && (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl)))
4025 pedwarn ("ISO C prohibits argument conversion to union type");
4027 return build_constructor_single (type, memb, rhs);
4031 /* Conversions among pointers */
4032 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4033 && (coder == codel))
4035 tree ttl = TREE_TYPE (type);
4036 tree ttr = TREE_TYPE (rhstype);
4039 bool is_opaque_pointer;
4040 int target_cmp = 0; /* Cache comp_target_types () result. */
4042 if (TREE_CODE (mvl) != ARRAY_TYPE)
4043 mvl = TYPE_MAIN_VARIANT (mvl);
4044 if (TREE_CODE (mvr) != ARRAY_TYPE)
4045 mvr = TYPE_MAIN_VARIANT (mvr);
4046 /* Opaque pointers are treated like void pointers. */
4047 is_opaque_pointer = (targetm.vector_opaque_p (type)
4048 || targetm.vector_opaque_p (rhstype))
4049 && TREE_CODE (ttl) == VECTOR_TYPE
4050 && TREE_CODE (ttr) == VECTOR_TYPE;
4052 /* C++ does not allow the implicit conversion void* -> T*. However,
4053 for the purpose of reducing the number of false positives, we
4054 tolerate the special case of
4058 where NULL is typically defined in C to be '(void *) 0'. */
4059 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4060 warning (OPT_Wc___compat, "request for implicit conversion from "
4061 "%qT to %qT not permitted in C++", rhstype, type);
4063 /* Check if the right-hand side has a format attribute but the
4064 left-hand side doesn't. */
4065 if (warn_missing_format_attribute
4066 && check_missing_format_attribute (type, rhstype))
4071 case ic_argpass_nonproto:
4072 warning (OPT_Wmissing_format_attribute,
4073 "argument %d of %qE might be "
4074 "a candidate for a format attribute",
4078 warning (OPT_Wmissing_format_attribute,
4079 "assignment left-hand side might be "
4080 "a candidate for a format attribute");
4083 warning (OPT_Wmissing_format_attribute,
4084 "initialization left-hand side might be "
4085 "a candidate for a format attribute");
4088 warning (OPT_Wmissing_format_attribute,
4089 "return type might be "
4090 "a candidate for a format attribute");
4097 /* Any non-function converts to a [const][volatile] void *
4098 and vice versa; otherwise, targets must be the same.
4099 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4100 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4101 || (target_cmp = comp_target_types (type, rhstype))
4102 || is_opaque_pointer
4103 || (c_common_unsigned_type (mvl)
4104 == c_common_unsigned_type (mvr)))
4107 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4110 && !null_pointer_constant_p (rhs)
4111 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4112 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
4113 "%qE between function pointer "
4115 G_("ISO C forbids assignment between "
4116 "function pointer and %<void *%>"),
4117 G_("ISO C forbids initialization between "
4118 "function pointer and %<void *%>"),
4119 G_("ISO C forbids return between function "
4120 "pointer and %<void *%>"));
4121 /* Const and volatile mean something different for function types,
4122 so the usual warnings are not appropriate. */
4123 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4124 && TREE_CODE (ttl) != FUNCTION_TYPE)
4126 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4128 /* Types differing only by the presence of the 'volatile'
4129 qualifier are acceptable if the 'volatile' has been added
4130 in by the Objective-C EH machinery. */
4131 if (!objc_type_quals_match (ttl, ttr))
4132 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4133 "qualifiers from pointer target type"),
4134 G_("assignment discards qualifiers "
4135 "from pointer target type"),
4136 G_("initialization discards qualifiers "
4137 "from pointer target type"),
4138 G_("return discards qualifiers from "
4139 "pointer target type"));
4141 /* If this is not a case of ignoring a mismatch in signedness,
4143 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4146 /* If there is a mismatch, do warn. */
4147 else if (warn_pointer_sign)
4148 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
4149 "%d of %qE differ in signedness"),
4150 G_("pointer targets in assignment "
4151 "differ in signedness"),
4152 G_("pointer targets in initialization "
4153 "differ in signedness"),
4154 G_("pointer targets in return differ "
4157 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4158 && TREE_CODE (ttr) == FUNCTION_TYPE)
4160 /* Because const and volatile on functions are restrictions
4161 that say the function will not do certain things,
4162 it is okay to use a const or volatile function
4163 where an ordinary one is wanted, but not vice-versa. */
4164 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4165 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4166 "qualified function pointer "
4167 "from unqualified"),
4168 G_("assignment makes qualified function "
4169 "pointer from unqualified"),
4170 G_("initialization makes qualified "
4171 "function pointer from unqualified"),
4172 G_("return makes qualified function "
4173 "pointer from unqualified"));
4177 /* Avoid warning about the volatile ObjC EH puts on decls. */
4179 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
4180 "incompatible pointer type"),
4181 G_("assignment from incompatible pointer type"),
4182 G_("initialization from incompatible "
4184 G_("return from incompatible pointer type"));
4186 return convert (type, rhs);
4188 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4190 /* ??? This should not be an error when inlining calls to
4191 unprototyped functions. */
4192 error ("invalid use of non-lvalue array");
4193 return error_mark_node;
4195 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4197 /* An explicit constant 0 can convert to a pointer,
4198 or one that results from arithmetic, even including
4199 a cast to integer type. */
4200 if (!null_pointer_constant_p (rhs))
4201 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4202 "pointer from integer without a cast"),
4203 G_("assignment makes pointer from integer "
4205 G_("initialization makes pointer from "
4206 "integer without a cast"),
4207 G_("return makes pointer from integer "
4210 return convert (type, rhs);
4212 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4214 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
4215 "from pointer without a cast"),
4216 G_("assignment makes integer from pointer "
4218 G_("initialization makes integer from pointer "
4220 G_("return makes integer from pointer "
4222 return convert (type, rhs);
4224 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4225 return convert (type, rhs);
4230 case ic_argpass_nonproto:
4231 /* ??? This should not be an error when inlining calls to
4232 unprototyped functions. */
4233 error ("incompatible type for argument %d of %qE", parmnum, rname);
4236 error ("incompatible types in assignment");
4239 error ("incompatible types in initialization");
4242 error ("incompatible types in return");
4248 return error_mark_node;
4251 /* If VALUE is a compound expr all of whose expressions are constant, then
4252 return its value. Otherwise, return error_mark_node.
4254 This is for handling COMPOUND_EXPRs as initializer elements
4255 which is allowed with a warning when -pedantic is specified. */
4258 valid_compound_expr_initializer (tree value, tree endtype)
4260 if (TREE_CODE (value) == COMPOUND_EXPR)
4262 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4264 return error_mark_node;
4265 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4268 else if (!initializer_constant_valid_p (value, endtype))
4269 return error_mark_node;
4274 /* Perform appropriate conversions on the initial value of a variable,
4275 store it in the declaration DECL,
4276 and print any error messages that are appropriate.
4277 If the init is invalid, store an ERROR_MARK. */
4280 store_init_value (tree decl, tree init)
4284 /* If variable's type was invalidly declared, just ignore it. */
4286 type = TREE_TYPE (decl);
4287 if (TREE_CODE (type) == ERROR_MARK)
4290 /* Digest the specified initializer into an expression. */
4292 value = digest_init (type, init, true, TREE_STATIC (decl));
4294 /* Store the expression if valid; else report error. */
4296 if (!in_system_header
4297 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4298 warning (OPT_Wtraditional, "traditional C rejects automatic "
4299 "aggregate initialization");
4301 DECL_INITIAL (decl) = value;
4303 /* ANSI wants warnings about out-of-range constant initializers. */
4304 STRIP_TYPE_NOPS (value);
4305 if (TREE_STATIC (decl))
4306 constant_expression_warning (value);
4308 /* Check if we need to set array size from compound literal size. */
4309 if (TREE_CODE (type) == ARRAY_TYPE
4310 && TYPE_DOMAIN (type) == 0
4311 && value != error_mark_node)
4313 tree inside_init = init;
4315 STRIP_TYPE_NOPS (inside_init);
4316 inside_init = fold (inside_init);
4318 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4320 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4322 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
4324 /* For int foo[] = (int [3]){1}; we need to set array size
4325 now since later on array initializer will be just the
4326 brace enclosed list of the compound literal. */
4327 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
4328 TREE_TYPE (decl) = type;
4329 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
4331 layout_decl (cldecl, 0);
4337 /* Methods for storing and printing names for error messages. */
4339 /* Implement a spelling stack that allows components of a name to be pushed
4340 and popped. Each element on the stack is this structure. */
4347 unsigned HOST_WIDE_INT i;
4352 #define SPELLING_STRING 1
4353 #define SPELLING_MEMBER 2
4354 #define SPELLING_BOUNDS 3
4356 static struct spelling *spelling; /* Next stack element (unused). */
4357 static struct spelling *spelling_base; /* Spelling stack base. */
4358 static int spelling_size; /* Size of the spelling stack. */
4360 /* Macros to save and restore the spelling stack around push_... functions.
4361 Alternative to SAVE_SPELLING_STACK. */
4363 #define SPELLING_DEPTH() (spelling - spelling_base)
4364 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4366 /* Push an element on the spelling stack with type KIND and assign VALUE
4369 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4371 int depth = SPELLING_DEPTH (); \
4373 if (depth >= spelling_size) \
4375 spelling_size += 10; \
4376 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4378 RESTORE_SPELLING_DEPTH (depth); \
4381 spelling->kind = (KIND); \
4382 spelling->MEMBER = (VALUE); \
4386 /* Push STRING on the stack. Printed literally. */
4389 push_string (const char *string)
4391 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4394 /* Push a member name on the stack. Printed as '.' STRING. */
4397 push_member_name (tree decl)
4399 const char *const string
4400 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4401 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4404 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4407 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4409 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4412 /* Compute the maximum size in bytes of the printed spelling. */
4415 spelling_length (void)
4420 for (p = spelling_base; p < spelling; p++)
4422 if (p->kind == SPELLING_BOUNDS)
4425 size += strlen (p->u.s) + 1;
4431 /* Print the spelling to BUFFER and return it. */
4434 print_spelling (char *buffer)
4439 for (p = spelling_base; p < spelling; p++)
4440 if (p->kind == SPELLING_BOUNDS)
4442 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4448 if (p->kind == SPELLING_MEMBER)
4450 for (s = p->u.s; (*d = *s++); d++)
4457 /* Issue an error message for a bad initializer component.
4458 MSGID identifies the message.
4459 The component name is taken from the spelling stack. */
4462 error_init (const char *msgid)
4466 error ("%s", _(msgid));
4467 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4469 error ("(near initialization for %qs)", ofwhat);
4472 /* Issue a pedantic warning for a bad initializer component.
4473 MSGID identifies the message.
4474 The component name is taken from the spelling stack. */
4477 pedwarn_init (const char *msgid)
4481 pedwarn ("%s", _(msgid));
4482 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4484 pedwarn ("(near initialization for %qs)", ofwhat);
4487 /* Issue a warning for a bad initializer component.
4488 MSGID identifies the message.
4489 The component name is taken from the spelling stack. */
4492 warning_init (const char *msgid)
4496 warning (0, "%s", _(msgid));
4497 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4499 warning (0, "(near initialization for %qs)", ofwhat);
4502 /* If TYPE is an array type and EXPR is a parenthesized string
4503 constant, warn if pedantic that EXPR is being used to initialize an
4504 object of type TYPE. */
4507 maybe_warn_string_init (tree type, struct c_expr expr)
4510 && TREE_CODE (type) == ARRAY_TYPE
4511 && TREE_CODE (expr.value) == STRING_CST
4512 && expr.original_code != STRING_CST)
4513 pedwarn_init ("array initialized from parenthesized string constant");
4516 /* Digest the parser output INIT as an initializer for type TYPE.
4517 Return a C expression of type TYPE to represent the initial value.
4519 If INIT is a string constant, STRICT_STRING is true if it is
4520 unparenthesized or we should not warn here for it being parenthesized.
4521 For other types of INIT, STRICT_STRING is not used.
4523 REQUIRE_CONSTANT requests an error if non-constant initializers or
4524 elements are seen. */
4527 digest_init (tree type, tree init, bool strict_string, int require_constant)
4529 enum tree_code code = TREE_CODE (type);
4530 tree inside_init = init;
4532 if (type == error_mark_node
4534 || init == error_mark_node
4535 || TREE_TYPE (init) == error_mark_node)
4536 return error_mark_node;
4538 STRIP_TYPE_NOPS (inside_init);
4540 inside_init = fold (inside_init);
4542 /* Initialization of an array of chars from a string constant
4543 optionally enclosed in braces. */
4545 if (code == ARRAY_TYPE && inside_init
4546 && TREE_CODE (inside_init) == STRING_CST)
4548 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4549 /* Note that an array could be both an array of character type
4550 and an array of wchar_t if wchar_t is signed char or unsigned
4552 bool char_array = (typ1 == char_type_node
4553 || typ1 == signed_char_type_node
4554 || typ1 == unsigned_char_type_node);
4555 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4556 if (char_array || wchar_array)
4560 expr.value = inside_init;
4561 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4562 maybe_warn_string_init (type, expr);
4565 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4568 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4569 TYPE_MAIN_VARIANT (type)))
4572 if (!wchar_array && !char_string)
4574 error_init ("char-array initialized from wide string");
4575 return error_mark_node;
4577 if (char_string && !char_array)
4579 error_init ("wchar_t-array initialized from non-wide string");
4580 return error_mark_node;
4583 TREE_TYPE (inside_init) = type;
4584 if (TYPE_DOMAIN (type) != 0
4585 && TYPE_SIZE (type) != 0
4586 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4587 /* Subtract 1 (or sizeof (wchar_t))
4588 because it's ok to ignore the terminating null char
4589 that is counted in the length of the constant. */
4590 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4591 TREE_STRING_LENGTH (inside_init)
4592 - ((TYPE_PRECISION (typ1)
4593 != TYPE_PRECISION (char_type_node))
4594 ? (TYPE_PRECISION (wchar_type_node)
4597 pedwarn_init ("initializer-string for array of chars is too long");
4601 else if (INTEGRAL_TYPE_P (typ1))
4603 error_init ("array of inappropriate type initialized "
4604 "from string constant");
4605 return error_mark_node;
4609 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4610 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4611 below and handle as a constructor. */
4612 if (code == VECTOR_TYPE
4613 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4614 && vector_types_convertible_p (TREE_TYPE (inside_init), type, true)
4615 && TREE_CONSTANT (inside_init))
4617 if (TREE_CODE (inside_init) == VECTOR_CST
4618 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4619 TYPE_MAIN_VARIANT (type)))
4622 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4624 unsigned HOST_WIDE_INT ix;
4626 bool constant_p = true;
4628 /* Iterate through elements and check if all constructor
4629 elements are *_CSTs. */
4630 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4631 if (!CONSTANT_CLASS_P (value))
4638 return build_vector_from_ctor (type,
4639 CONSTRUCTOR_ELTS (inside_init));
4643 /* Any type can be initialized
4644 from an expression of the same type, optionally with braces. */
4646 if (inside_init && TREE_TYPE (inside_init) != 0
4647 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4648 TYPE_MAIN_VARIANT (type))
4649 || (code == ARRAY_TYPE
4650 && comptypes (TREE_TYPE (inside_init), type))
4651 || (code == VECTOR_TYPE
4652 && comptypes (TREE_TYPE (inside_init), type))
4653 || (code == POINTER_TYPE
4654 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4655 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4656 TREE_TYPE (type)))))
4658 if (code == POINTER_TYPE)
4660 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4662 if (TREE_CODE (inside_init) == STRING_CST
4663 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4664 inside_init = array_to_pointer_conversion (inside_init);
4667 error_init ("invalid use of non-lvalue array");
4668 return error_mark_node;
4673 if (code == VECTOR_TYPE)
4674 /* Although the types are compatible, we may require a
4676 inside_init = convert (type, inside_init);
4678 if (require_constant
4679 && (code == VECTOR_TYPE || !flag_isoc99)
4680 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4682 /* As an extension, allow initializing objects with static storage
4683 duration with compound literals (which are then treated just as
4684 the brace enclosed list they contain). Also allow this for
4685 vectors, as we can only assign them with compound literals. */
4686 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4687 inside_init = DECL_INITIAL (decl);
4690 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4691 && TREE_CODE (inside_init) != CONSTRUCTOR)
4693 error_init ("array initialized from non-constant array expression");
4694 return error_mark_node;
4697 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4698 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4700 /* Compound expressions can only occur here if -pedantic or
4701 -pedantic-errors is specified. In the later case, we always want
4702 an error. In the former case, we simply want a warning. */
4703 if (require_constant && pedantic
4704 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4707 = valid_compound_expr_initializer (inside_init,
4708 TREE_TYPE (inside_init));
4709 if (inside_init == error_mark_node)
4710 error_init ("initializer element is not constant");
4712 pedwarn_init ("initializer element is not constant");
4713 if (flag_pedantic_errors)
4714 inside_init = error_mark_node;
4716 else if (require_constant
4717 && !initializer_constant_valid_p (inside_init,
4718 TREE_TYPE (inside_init)))
4720 error_init ("initializer element is not constant");
4721 inside_init = error_mark_node;
4724 /* Added to enable additional -Wmissing-format-attribute warnings. */
4725 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4726 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4731 /* Handle scalar types, including conversions. */
4733 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4734 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE
4735 || code == VECTOR_TYPE)
4737 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4738 && (TREE_CODE (init) == STRING_CST
4739 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4740 init = array_to_pointer_conversion (init);
4742 = convert_for_assignment (type, init, ic_init,
4743 NULL_TREE, NULL_TREE, 0);
4745 /* Check to see if we have already given an error message. */
4746 if (inside_init == error_mark_node)
4748 else if (require_constant && !TREE_CONSTANT (inside_init))
4750 error_init ("initializer element is not constant");
4751 inside_init = error_mark_node;
4753 else if (require_constant
4754 && !initializer_constant_valid_p (inside_init,
4755 TREE_TYPE (inside_init)))
4757 error_init ("initializer element is not computable at load time");
4758 inside_init = error_mark_node;
4764 /* Come here only for records and arrays. */
4766 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4768 error_init ("variable-sized object may not be initialized");
4769 return error_mark_node;
4772 error_init ("invalid initializer");
4773 return error_mark_node;
4776 /* Handle initializers that use braces. */
4778 /* Type of object we are accumulating a constructor for.
4779 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4780 static tree constructor_type;
4782 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4784 static tree constructor_fields;
4786 /* For an ARRAY_TYPE, this is the specified index
4787 at which to store the next element we get. */
4788 static tree constructor_index;
4790 /* For an ARRAY_TYPE, this is the maximum index. */
4791 static tree constructor_max_index;
4793 /* For a RECORD_TYPE, this is the first field not yet written out. */
4794 static tree constructor_unfilled_fields;
4796 /* For an ARRAY_TYPE, this is the index of the first element
4797 not yet written out. */
4798 static tree constructor_unfilled_index;
4800 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4801 This is so we can generate gaps between fields, when appropriate. */
4802 static tree constructor_bit_index;
4804 /* If we are saving up the elements rather than allocating them,
4805 this is the list of elements so far (in reverse order,
4806 most recent first). */
4807 static VEC(constructor_elt,gc) *constructor_elements;
4809 /* 1 if constructor should be incrementally stored into a constructor chain,
4810 0 if all the elements should be kept in AVL tree. */
4811 static int constructor_incremental;
4813 /* 1 if so far this constructor's elements are all compile-time constants. */
4814 static int constructor_constant;
4816 /* 1 if so far this constructor's elements are all valid address constants. */
4817 static int constructor_simple;
4819 /* 1 if this constructor is erroneous so far. */
4820 static int constructor_erroneous;
4822 /* Structure for managing pending initializer elements, organized as an
4827 struct init_node *left, *right;
4828 struct init_node *parent;
4834 /* Tree of pending elements at this constructor level.
4835 These are elements encountered out of order
4836 which belong at places we haven't reached yet in actually
4838 Will never hold tree nodes across GC runs. */
4839 static struct init_node *constructor_pending_elts;
4841 /* The SPELLING_DEPTH of this constructor. */
4842 static int constructor_depth;
4844 /* DECL node for which an initializer is being read.
4845 0 means we are reading a constructor expression
4846 such as (struct foo) {...}. */
4847 static tree constructor_decl;
4849 /* Nonzero if this is an initializer for a top-level decl. */
4850 static int constructor_top_level;
4852 /* Nonzero if there were any member designators in this initializer. */
4853 static int constructor_designated;
4855 /* Nesting depth of designator list. */
4856 static int designator_depth;
4858 /* Nonzero if there were diagnosed errors in this designator list. */
4859 static int designator_erroneous;
4862 /* This stack has a level for each implicit or explicit level of
4863 structuring in the initializer, including the outermost one. It
4864 saves the values of most of the variables above. */
4866 struct constructor_range_stack;
4868 struct constructor_stack
4870 struct constructor_stack *next;
4875 tree unfilled_index;
4876 tree unfilled_fields;
4878 VEC(constructor_elt,gc) *elements;
4879 struct init_node *pending_elts;
4882 /* If value nonzero, this value should replace the entire
4883 constructor at this level. */
4884 struct c_expr replacement_value;
4885 struct constructor_range_stack *range_stack;
4895 static struct constructor_stack *constructor_stack;
4897 /* This stack represents designators from some range designator up to
4898 the last designator in the list. */
4900 struct constructor_range_stack
4902 struct constructor_range_stack *next, *prev;
4903 struct constructor_stack *stack;
4910 static struct constructor_range_stack *constructor_range_stack;
4912 /* This stack records separate initializers that are nested.
4913 Nested initializers can't happen in ANSI C, but GNU C allows them
4914 in cases like { ... (struct foo) { ... } ... }. */
4916 struct initializer_stack
4918 struct initializer_stack *next;
4920 struct constructor_stack *constructor_stack;
4921 struct constructor_range_stack *constructor_range_stack;
4922 VEC(constructor_elt,gc) *elements;
4923 struct spelling *spelling;
4924 struct spelling *spelling_base;
4927 char require_constant_value;
4928 char require_constant_elements;
4931 static struct initializer_stack *initializer_stack;
4933 /* Prepare to parse and output the initializer for variable DECL. */
4936 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
4939 struct initializer_stack *p = XNEW (struct initializer_stack);
4941 p->decl = constructor_decl;
4942 p->require_constant_value = require_constant_value;
4943 p->require_constant_elements = require_constant_elements;
4944 p->constructor_stack = constructor_stack;
4945 p->constructor_range_stack = constructor_range_stack;
4946 p->elements = constructor_elements;
4947 p->spelling = spelling;
4948 p->spelling_base = spelling_base;
4949 p->spelling_size = spelling_size;
4950 p->top_level = constructor_top_level;
4951 p->next = initializer_stack;
4952 initializer_stack = p;
4954 constructor_decl = decl;
4955 constructor_designated = 0;
4956 constructor_top_level = top_level;
4958 if (decl != 0 && decl != error_mark_node)
4960 require_constant_value = TREE_STATIC (decl);
4961 require_constant_elements
4962 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
4963 /* For a scalar, you can always use any value to initialize,
4964 even within braces. */
4965 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
4966 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
4967 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
4968 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
4969 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
4973 require_constant_value = 0;
4974 require_constant_elements = 0;
4975 locus = "(anonymous)";
4978 constructor_stack = 0;
4979 constructor_range_stack = 0;
4981 missing_braces_mentioned = 0;
4985 RESTORE_SPELLING_DEPTH (0);
4988 push_string (locus);
4994 struct initializer_stack *p = initializer_stack;
4996 /* Free the whole constructor stack of this initializer. */
4997 while (constructor_stack)
4999 struct constructor_stack *q = constructor_stack;
5000 constructor_stack = q->next;
5004 gcc_assert (!constructor_range_stack);
5006 /* Pop back to the data of the outer initializer (if any). */
5007 free (spelling_base);
5009 constructor_decl = p->decl;
5010 require_constant_value = p->require_constant_value;
5011 require_constant_elements = p->require_constant_elements;
5012 constructor_stack = p->constructor_stack;
5013 constructor_range_stack = p->constructor_range_stack;
5014 constructor_elements = p->elements;
5015 spelling = p->spelling;
5016 spelling_base = p->spelling_base;
5017 spelling_size = p->spelling_size;
5018 constructor_top_level = p->top_level;
5019 initializer_stack = p->next;
5023 /* Call here when we see the initializer is surrounded by braces.
5024 This is instead of a call to push_init_level;
5025 it is matched by a call to pop_init_level.
5027 TYPE is the type to initialize, for a constructor expression.
5028 For an initializer for a decl, TYPE is zero. */
5031 really_start_incremental_init (tree type)
5033 struct constructor_stack *p = XNEW (struct constructor_stack);
5036 type = TREE_TYPE (constructor_decl);
5038 if (targetm.vector_opaque_p (type))
5039 error ("opaque vector types cannot be initialized");
5041 p->type = constructor_type;
5042 p->fields = constructor_fields;
5043 p->index = constructor_index;
5044 p->max_index = constructor_max_index;
5045 p->unfilled_index = constructor_unfilled_index;
5046 p->unfilled_fields = constructor_unfilled_fields;
5047 p->bit_index = constructor_bit_index;
5048 p->elements = constructor_elements;
5049 p->constant = constructor_constant;
5050 p->simple = constructor_simple;
5051 p->erroneous = constructor_erroneous;
5052 p->pending_elts = constructor_pending_elts;
5053 p->depth = constructor_depth;
5054 p->replacement_value.value = 0;
5055 p->replacement_value.original_code = ERROR_MARK;
5059 p->incremental = constructor_incremental;
5060 p->designated = constructor_designated;
5062 constructor_stack = p;
5064 constructor_constant = 1;
5065 constructor_simple = 1;
5066 constructor_depth = SPELLING_DEPTH ();
5067 constructor_elements = 0;
5068 constructor_pending_elts = 0;
5069 constructor_type = type;
5070 constructor_incremental = 1;
5071 constructor_designated = 0;
5072 designator_depth = 0;
5073 designator_erroneous = 0;
5075 if (TREE_CODE (constructor_type) == RECORD_TYPE
5076 || TREE_CODE (constructor_type) == UNION_TYPE)
5078 constructor_fields = TYPE_FIELDS (constructor_type);
5079 /* Skip any nameless bit fields at the beginning. */
5080 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5081 && DECL_NAME (constructor_fields) == 0)
5082 constructor_fields = TREE_CHAIN (constructor_fields);
5084 constructor_unfilled_fields = constructor_fields;
5085 constructor_bit_index = bitsize_zero_node;
5087 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5089 if (TYPE_DOMAIN (constructor_type))
5091 constructor_max_index
5092 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5094 /* Detect non-empty initializations of zero-length arrays. */
5095 if (constructor_max_index == NULL_TREE
5096 && TYPE_SIZE (constructor_type))
5097 constructor_max_index = build_int_cst (NULL_TREE, -1);
5099 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5100 to initialize VLAs will cause a proper error; avoid tree
5101 checking errors as well by setting a safe value. */
5102 if (constructor_max_index
5103 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5104 constructor_max_index = build_int_cst (NULL_TREE, -1);
5107 = convert (bitsizetype,
5108 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5112 constructor_index = bitsize_zero_node;
5113 constructor_max_index = NULL_TREE;
5116 constructor_unfilled_index = constructor_index;
5118 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5120 /* Vectors are like simple fixed-size arrays. */
5121 constructor_max_index =
5122 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5123 constructor_index = bitsize_zero_node;
5124 constructor_unfilled_index = constructor_index;
5128 /* Handle the case of int x = {5}; */
5129 constructor_fields = constructor_type;
5130 constructor_unfilled_fields = constructor_type;
5134 /* Push down into a subobject, for initialization.
5135 If this is for an explicit set of braces, IMPLICIT is 0.
5136 If it is because the next element belongs at a lower level,
5137 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5140 push_init_level (int implicit)
5142 struct constructor_stack *p;
5143 tree value = NULL_TREE;
5145 /* If we've exhausted any levels that didn't have braces,
5146 pop them now. If implicit == 1, this will have been done in
5147 process_init_element; do not repeat it here because in the case
5148 of excess initializers for an empty aggregate this leads to an
5149 infinite cycle of popping a level and immediately recreating
5153 while (constructor_stack->implicit)
5155 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5156 || TREE_CODE (constructor_type) == UNION_TYPE)
5157 && constructor_fields == 0)
5158 process_init_element (pop_init_level (1));
5159 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5160 && constructor_max_index
5161 && tree_int_cst_lt (constructor_max_index,
5163 process_init_element (pop_init_level (1));
5169 /* Unless this is an explicit brace, we need to preserve previous
5173 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5174 || TREE_CODE (constructor_type) == UNION_TYPE)
5175 && constructor_fields)
5176 value = find_init_member (constructor_fields);
5177 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5178 value = find_init_member (constructor_index);
5181 p = XNEW (struct constructor_stack);
5182 p->type = constructor_type;
5183 p->fields = constructor_fields;
5184 p->index = constructor_index;
5185 p->max_index = constructor_max_index;
5186 p->unfilled_index = constructor_unfilled_index;
5187 p->unfilled_fields = constructor_unfilled_fields;
5188 p->bit_index = constructor_bit_index;
5189 p->elements = constructor_elements;
5190 p->constant = constructor_constant;
5191 p->simple = constructor_simple;
5192 p->erroneous = constructor_erroneous;
5193 p->pending_elts = constructor_pending_elts;
5194 p->depth = constructor_depth;
5195 p->replacement_value.value = 0;
5196 p->replacement_value.original_code = ERROR_MARK;
5197 p->implicit = implicit;
5199 p->incremental = constructor_incremental;
5200 p->designated = constructor_designated;
5201 p->next = constructor_stack;
5203 constructor_stack = p;
5205 constructor_constant = 1;
5206 constructor_simple = 1;
5207 constructor_depth = SPELLING_DEPTH ();
5208 constructor_elements = 0;
5209 constructor_incremental = 1;
5210 constructor_designated = 0;
5211 constructor_pending_elts = 0;
5214 p->range_stack = constructor_range_stack;
5215 constructor_range_stack = 0;
5216 designator_depth = 0;
5217 designator_erroneous = 0;
5220 /* Don't die if an entire brace-pair level is superfluous
5221 in the containing level. */
5222 if (constructor_type == 0)
5224 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5225 || TREE_CODE (constructor_type) == UNION_TYPE)
5227 /* Don't die if there are extra init elts at the end. */
5228 if (constructor_fields == 0)
5229 constructor_type = 0;
5232 constructor_type = TREE_TYPE (constructor_fields);
5233 push_member_name (constructor_fields);
5234 constructor_depth++;
5237 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5239 constructor_type = TREE_TYPE (constructor_type);
5240 push_array_bounds (tree_low_cst (constructor_index, 1));
5241 constructor_depth++;
5244 if (constructor_type == 0)
5246 error_init ("extra brace group at end of initializer");
5247 constructor_fields = 0;
5248 constructor_unfilled_fields = 0;
5252 if (value && TREE_CODE (value) == CONSTRUCTOR)
5254 constructor_constant = TREE_CONSTANT (value);
5255 constructor_simple = TREE_STATIC (value);
5256 constructor_elements = CONSTRUCTOR_ELTS (value);
5257 if (!VEC_empty (constructor_elt, constructor_elements)
5258 && (TREE_CODE (constructor_type) == RECORD_TYPE
5259 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5260 set_nonincremental_init ();
5263 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5265 missing_braces_mentioned = 1;
5266 warning_init ("missing braces around initializer");
5269 if (TREE_CODE (constructor_type) == RECORD_TYPE
5270 || TREE_CODE (constructor_type) == UNION_TYPE)
5272 constructor_fields = TYPE_FIELDS (constructor_type);
5273 /* Skip any nameless bit fields at the beginning. */
5274 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5275 && DECL_NAME (constructor_fields) == 0)
5276 constructor_fields = TREE_CHAIN (constructor_fields);
5278 constructor_unfilled_fields = constructor_fields;
5279 constructor_bit_index = bitsize_zero_node;
5281 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5283 /* Vectors are like simple fixed-size arrays. */
5284 constructor_max_index =
5285 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5286 constructor_index = convert (bitsizetype, integer_zero_node);
5287 constructor_unfilled_index = constructor_index;
5289 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5291 if (TYPE_DOMAIN (constructor_type))
5293 constructor_max_index
5294 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5296 /* Detect non-empty initializations of zero-length arrays. */
5297 if (constructor_max_index == NULL_TREE
5298 && TYPE_SIZE (constructor_type))
5299 constructor_max_index = build_int_cst (NULL_TREE, -1);
5301 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5302 to initialize VLAs will cause a proper error; avoid tree
5303 checking errors as well by setting a safe value. */
5304 if (constructor_max_index
5305 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5306 constructor_max_index = build_int_cst (NULL_TREE, -1);
5309 = convert (bitsizetype,
5310 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5313 constructor_index = bitsize_zero_node;
5315 constructor_unfilled_index = constructor_index;
5316 if (value && TREE_CODE (value) == STRING_CST)
5318 /* We need to split the char/wchar array into individual
5319 characters, so that we don't have to special case it
5321 set_nonincremental_init_from_string (value);
5326 if (constructor_type != error_mark_node)
5327 warning_init ("braces around scalar initializer");
5328 constructor_fields = constructor_type;
5329 constructor_unfilled_fields = constructor_type;
5333 /* At the end of an implicit or explicit brace level,
5334 finish up that level of constructor. If a single expression
5335 with redundant braces initialized that level, return the
5336 c_expr structure for that expression. Otherwise, the original_code
5337 element is set to ERROR_MARK.
5338 If we were outputting the elements as they are read, return 0 as the value
5339 from inner levels (process_init_element ignores that),
5340 but return error_mark_node as the value from the outermost level
5341 (that's what we want to put in DECL_INITIAL).
5342 Otherwise, return a CONSTRUCTOR expression as the value. */
5345 pop_init_level (int implicit)
5347 struct constructor_stack *p;
5350 ret.original_code = ERROR_MARK;
5354 /* When we come to an explicit close brace,
5355 pop any inner levels that didn't have explicit braces. */
5356 while (constructor_stack->implicit)
5357 process_init_element (pop_init_level (1));
5359 gcc_assert (!constructor_range_stack);
5362 /* Now output all pending elements. */
5363 constructor_incremental = 1;
5364 output_pending_init_elements (1);
5366 p = constructor_stack;
5368 /* Error for initializing a flexible array member, or a zero-length
5369 array member in an inappropriate context. */
5370 if (constructor_type && constructor_fields
5371 && TREE_CODE (constructor_type) == ARRAY_TYPE
5372 && TYPE_DOMAIN (constructor_type)
5373 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5375 /* Silently discard empty initializations. The parser will
5376 already have pedwarned for empty brackets. */
5377 if (integer_zerop (constructor_unfilled_index))
5378 constructor_type = NULL_TREE;
5381 gcc_assert (!TYPE_SIZE (constructor_type));
5383 if (constructor_depth > 2)
5384 error_init ("initialization of flexible array member in a nested context");
5386 pedwarn_init ("initialization of a flexible array member");
5388 /* We have already issued an error message for the existence
5389 of a flexible array member not at the end of the structure.
5390 Discard the initializer so that we do not die later. */
5391 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5392 constructor_type = NULL_TREE;
5396 /* Warn when some struct elements are implicitly initialized to zero. */
5397 if (warn_missing_field_initializers
5399 && TREE_CODE (constructor_type) == RECORD_TYPE
5400 && constructor_unfilled_fields)
5402 /* Do not warn for flexible array members or zero-length arrays. */
5403 while (constructor_unfilled_fields
5404 && (!DECL_SIZE (constructor_unfilled_fields)
5405 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5406 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5408 /* Do not warn if this level of the initializer uses member
5409 designators; it is likely to be deliberate. */
5410 if (constructor_unfilled_fields && !constructor_designated)
5412 push_member_name (constructor_unfilled_fields);
5413 warning_init ("missing initializer");
5414 RESTORE_SPELLING_DEPTH (constructor_depth);
5418 /* Pad out the end of the structure. */
5419 if (p->replacement_value.value)
5420 /* If this closes a superfluous brace pair,
5421 just pass out the element between them. */
5422 ret = p->replacement_value;
5423 else if (constructor_type == 0)
5425 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5426 && TREE_CODE (constructor_type) != UNION_TYPE
5427 && TREE_CODE (constructor_type) != ARRAY_TYPE
5428 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5430 /* A nonincremental scalar initializer--just return
5431 the element, after verifying there is just one. */
5432 if (VEC_empty (constructor_elt,constructor_elements))
5434 if (!constructor_erroneous)
5435 error_init ("empty scalar initializer");
5436 ret.value = error_mark_node;
5438 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5440 error_init ("extra elements in scalar initializer");
5441 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5444 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5448 if (constructor_erroneous)
5449 ret.value = error_mark_node;
5452 ret.value = build_constructor (constructor_type,
5453 constructor_elements);
5454 if (constructor_constant)
5455 TREE_CONSTANT (ret.value) = TREE_INVARIANT (ret.value) = 1;
5456 if (constructor_constant && constructor_simple)
5457 TREE_STATIC (ret.value) = 1;
5461 constructor_type = p->type;
5462 constructor_fields = p->fields;
5463 constructor_index = p->index;
5464 constructor_max_index = p->max_index;
5465 constructor_unfilled_index = p->unfilled_index;
5466 constructor_unfilled_fields = p->unfilled_fields;
5467 constructor_bit_index = p->bit_index;
5468 constructor_elements = p->elements;
5469 constructor_constant = p->constant;
5470 constructor_simple = p->simple;
5471 constructor_erroneous = p->erroneous;
5472 constructor_incremental = p->incremental;
5473 constructor_designated = p->designated;
5474 constructor_pending_elts = p->pending_elts;
5475 constructor_depth = p->depth;
5477 constructor_range_stack = p->range_stack;
5478 RESTORE_SPELLING_DEPTH (constructor_depth);
5480 constructor_stack = p->next;
5483 if (ret.value == 0 && constructor_stack == 0)
5484 ret.value = error_mark_node;
5488 /* Common handling for both array range and field name designators.
5489 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5492 set_designator (int array)
5495 enum tree_code subcode;
5497 /* Don't die if an entire brace-pair level is superfluous
5498 in the containing level. */
5499 if (constructor_type == 0)
5502 /* If there were errors in this designator list already, bail out
5504 if (designator_erroneous)
5507 if (!designator_depth)
5509 gcc_assert (!constructor_range_stack);
5511 /* Designator list starts at the level of closest explicit
5513 while (constructor_stack->implicit)
5514 process_init_element (pop_init_level (1));
5515 constructor_designated = 1;
5519 switch (TREE_CODE (constructor_type))
5523 subtype = TREE_TYPE (constructor_fields);
5524 if (subtype != error_mark_node)
5525 subtype = TYPE_MAIN_VARIANT (subtype);
5528 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5534 subcode = TREE_CODE (subtype);
5535 if (array && subcode != ARRAY_TYPE)
5537 error_init ("array index in non-array initializer");
5540 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5542 error_init ("field name not in record or union initializer");
5546 constructor_designated = 1;
5547 push_init_level (2);
5551 /* If there are range designators in designator list, push a new designator
5552 to constructor_range_stack. RANGE_END is end of such stack range or
5553 NULL_TREE if there is no range designator at this level. */
5556 push_range_stack (tree range_end)
5558 struct constructor_range_stack *p;
5560 p = GGC_NEW (struct constructor_range_stack);
5561 p->prev = constructor_range_stack;
5563 p->fields = constructor_fields;
5564 p->range_start = constructor_index;
5565 p->index = constructor_index;
5566 p->stack = constructor_stack;
5567 p->range_end = range_end;
5568 if (constructor_range_stack)
5569 constructor_range_stack->next = p;
5570 constructor_range_stack = p;
5573 /* Within an array initializer, specify the next index to be initialized.
5574 FIRST is that index. If LAST is nonzero, then initialize a range
5575 of indices, running from FIRST through LAST. */
5578 set_init_index (tree first, tree last)
5580 if (set_designator (1))
5583 designator_erroneous = 1;
5585 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5586 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5588 error_init ("array index in initializer not of integer type");
5592 if (TREE_CODE (first) != INTEGER_CST)
5593 error_init ("nonconstant array index in initializer");
5594 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5595 error_init ("nonconstant array index in initializer");
5596 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5597 error_init ("array index in non-array initializer");
5598 else if (tree_int_cst_sgn (first) == -1)
5599 error_init ("array index in initializer exceeds array bounds");
5600 else if (constructor_max_index
5601 && tree_int_cst_lt (constructor_max_index, first))
5602 error_init ("array index in initializer exceeds array bounds");
5605 constructor_index = convert (bitsizetype, first);
5609 if (tree_int_cst_equal (first, last))
5611 else if (tree_int_cst_lt (last, first))
5613 error_init ("empty index range in initializer");
5618 last = convert (bitsizetype, last);
5619 if (constructor_max_index != 0
5620 && tree_int_cst_lt (constructor_max_index, last))
5622 error_init ("array index range in initializer exceeds array bounds");
5629 designator_erroneous = 0;
5630 if (constructor_range_stack || last)
5631 push_range_stack (last);
5635 /* Within a struct initializer, specify the next field to be initialized. */
5638 set_init_label (tree fieldname)
5642 if (set_designator (0))
5645 designator_erroneous = 1;
5647 if (TREE_CODE (constructor_type) != RECORD_TYPE
5648 && TREE_CODE (constructor_type) != UNION_TYPE)
5650 error_init ("field name not in record or union initializer");
5654 for (tail = TYPE_FIELDS (constructor_type); tail;
5655 tail = TREE_CHAIN (tail))
5657 if (DECL_NAME (tail) == fieldname)
5662 error ("unknown field %qE specified in initializer", fieldname);
5665 constructor_fields = tail;
5667 designator_erroneous = 0;
5668 if (constructor_range_stack)
5669 push_range_stack (NULL_TREE);
5673 /* Add a new initializer to the tree of pending initializers. PURPOSE
5674 identifies the initializer, either array index or field in a structure.
5675 VALUE is the value of that index or field. */
5678 add_pending_init (tree purpose, tree value)
5680 struct init_node *p, **q, *r;
5682 q = &constructor_pending_elts;
5685 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5690 if (tree_int_cst_lt (purpose, p->purpose))
5692 else if (tree_int_cst_lt (p->purpose, purpose))
5696 if (TREE_SIDE_EFFECTS (p->value))
5697 warning_init ("initialized field with side-effects overwritten");
5698 else if (warn_override_init)
5699 warning_init ("initialized field overwritten");
5709 bitpos = bit_position (purpose);
5713 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5715 else if (p->purpose != purpose)
5719 if (TREE_SIDE_EFFECTS (p->value))
5720 warning_init ("initialized field with side-effects overwritten");
5721 else if (warn_override_init)
5722 warning_init ("initialized field overwritten");
5729 r = GGC_NEW (struct init_node);
5730 r->purpose = purpose;
5741 struct init_node *s;
5745 if (p->balance == 0)
5747 else if (p->balance < 0)
5754 p->left->parent = p;
5771 constructor_pending_elts = r;
5776 struct init_node *t = r->right;
5780 r->right->parent = r;
5785 p->left->parent = p;
5788 p->balance = t->balance < 0;
5789 r->balance = -(t->balance > 0);
5804 constructor_pending_elts = t;
5810 /* p->balance == +1; growth of left side balances the node. */
5815 else /* r == p->right */
5817 if (p->balance == 0)
5818 /* Growth propagation from right side. */
5820 else if (p->balance > 0)
5827 p->right->parent = p;
5844 constructor_pending_elts = r;
5846 else /* r->balance == -1 */
5849 struct init_node *t = r->left;
5853 r->left->parent = r;
5858 p->right->parent = p;
5861 r->balance = (t->balance < 0);
5862 p->balance = -(t->balance > 0);
5877 constructor_pending_elts = t;
5883 /* p->balance == -1; growth of right side balances the node. */
5894 /* Build AVL tree from a sorted chain. */
5897 set_nonincremental_init (void)
5899 unsigned HOST_WIDE_INT ix;
5902 if (TREE_CODE (constructor_type) != RECORD_TYPE
5903 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5906 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
5907 add_pending_init (index, value);
5908 constructor_elements = 0;
5909 if (TREE_CODE (constructor_type) == RECORD_TYPE)
5911 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
5912 /* Skip any nameless bit fields at the beginning. */
5913 while (constructor_unfilled_fields != 0
5914 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5915 && DECL_NAME (constructor_unfilled_fields) == 0)
5916 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5919 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5921 if (TYPE_DOMAIN (constructor_type))
5922 constructor_unfilled_index
5923 = convert (bitsizetype,
5924 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5926 constructor_unfilled_index = bitsize_zero_node;
5928 constructor_incremental = 0;
5931 /* Build AVL tree from a string constant. */
5934 set_nonincremental_init_from_string (tree str)
5936 tree value, purpose, type;
5937 HOST_WIDE_INT val[2];
5938 const char *p, *end;
5939 int byte, wchar_bytes, charwidth, bitpos;
5941 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
5943 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5944 == TYPE_PRECISION (char_type_node))
5948 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5949 == TYPE_PRECISION (wchar_type_node));
5950 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
5952 charwidth = TYPE_PRECISION (char_type_node);
5953 type = TREE_TYPE (constructor_type);
5954 p = TREE_STRING_POINTER (str);
5955 end = p + TREE_STRING_LENGTH (str);
5957 for (purpose = bitsize_zero_node;
5958 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
5959 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
5961 if (wchar_bytes == 1)
5963 val[1] = (unsigned char) *p++;
5970 for (byte = 0; byte < wchar_bytes; byte++)
5972 if (BYTES_BIG_ENDIAN)
5973 bitpos = (wchar_bytes - byte - 1) * charwidth;
5975 bitpos = byte * charwidth;
5976 val[bitpos < HOST_BITS_PER_WIDE_INT]
5977 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
5978 << (bitpos % HOST_BITS_PER_WIDE_INT);
5982 if (!TYPE_UNSIGNED (type))
5984 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
5985 if (bitpos < HOST_BITS_PER_WIDE_INT)
5987 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
5989 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
5993 else if (bitpos == HOST_BITS_PER_WIDE_INT)
5998 else if (val[0] & (((HOST_WIDE_INT) 1)
5999 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6000 val[0] |= ((HOST_WIDE_INT) -1)
6001 << (bitpos - HOST_BITS_PER_WIDE_INT);
6004 value = build_int_cst_wide (type, val[1], val[0]);
6005 add_pending_init (purpose, value);
6008 constructor_incremental = 0;
6011 /* Return value of FIELD in pending initializer or zero if the field was
6012 not initialized yet. */
6015 find_init_member (tree field)
6017 struct init_node *p;
6019 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6021 if (constructor_incremental
6022 && tree_int_cst_lt (field, constructor_unfilled_index))
6023 set_nonincremental_init ();
6025 p = constructor_pending_elts;
6028 if (tree_int_cst_lt (field, p->purpose))
6030 else if (tree_int_cst_lt (p->purpose, field))
6036 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6038 tree bitpos = bit_position (field);
6040 if (constructor_incremental
6041 && (!constructor_unfilled_fields
6042 || tree_int_cst_lt (bitpos,
6043 bit_position (constructor_unfilled_fields))))
6044 set_nonincremental_init ();
6046 p = constructor_pending_elts;
6049 if (field == p->purpose)
6051 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6057 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6059 if (!VEC_empty (constructor_elt, constructor_elements)
6060 && (VEC_last (constructor_elt, constructor_elements)->index
6062 return VEC_last (constructor_elt, constructor_elements)->value;
6067 /* "Output" the next constructor element.
6068 At top level, really output it to assembler code now.
6069 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6070 TYPE is the data type that the containing data type wants here.
6071 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6072 If VALUE is a string constant, STRICT_STRING is true if it is
6073 unparenthesized or we should not warn here for it being parenthesized.
6074 For other types of VALUE, STRICT_STRING is not used.
6076 PENDING if non-nil means output pending elements that belong
6077 right after this element. (PENDING is normally 1;
6078 it is 0 while outputting pending elements, to avoid recursion.) */
6081 output_init_element (tree value, bool strict_string, tree type, tree field,
6084 constructor_elt *celt;
6086 if (type == error_mark_node || value == error_mark_node)
6088 constructor_erroneous = 1;
6091 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6092 && (TREE_CODE (value) == STRING_CST
6093 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6094 && !(TREE_CODE (value) == STRING_CST
6095 && TREE_CODE (type) == ARRAY_TYPE
6096 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6097 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6098 TYPE_MAIN_VARIANT (type)))
6099 value = array_to_pointer_conversion (value);
6101 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6102 && require_constant_value && !flag_isoc99 && pending)
6104 /* As an extension, allow initializing objects with static storage
6105 duration with compound literals (which are then treated just as
6106 the brace enclosed list they contain). */
6107 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6108 value = DECL_INITIAL (decl);
6111 if (value == error_mark_node)
6112 constructor_erroneous = 1;
6113 else if (!TREE_CONSTANT (value))
6114 constructor_constant = 0;
6115 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6116 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6117 || TREE_CODE (constructor_type) == UNION_TYPE)
6118 && DECL_C_BIT_FIELD (field)
6119 && TREE_CODE (value) != INTEGER_CST))
6120 constructor_simple = 0;
6122 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6124 if (require_constant_value)
6126 error_init ("initializer element is not constant");
6127 value = error_mark_node;
6129 else if (require_constant_elements)
6130 pedwarn ("initializer element is not computable at load time");
6133 /* If this field is empty (and not at the end of structure),
6134 don't do anything other than checking the initializer. */
6136 && (TREE_TYPE (field) == error_mark_node
6137 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6138 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6139 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6140 || TREE_CHAIN (field)))))
6143 value = digest_init (type, value, strict_string, require_constant_value);
6144 if (value == error_mark_node)
6146 constructor_erroneous = 1;
6150 /* If this element doesn't come next in sequence,
6151 put it on constructor_pending_elts. */
6152 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6153 && (!constructor_incremental
6154 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6156 if (constructor_incremental
6157 && tree_int_cst_lt (field, constructor_unfilled_index))
6158 set_nonincremental_init ();
6160 add_pending_init (field, value);
6163 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6164 && (!constructor_incremental
6165 || field != constructor_unfilled_fields))
6167 /* We do this for records but not for unions. In a union,
6168 no matter which field is specified, it can be initialized
6169 right away since it starts at the beginning of the union. */
6170 if (constructor_incremental)
6172 if (!constructor_unfilled_fields)
6173 set_nonincremental_init ();
6176 tree bitpos, unfillpos;
6178 bitpos = bit_position (field);
6179 unfillpos = bit_position (constructor_unfilled_fields);
6181 if (tree_int_cst_lt (bitpos, unfillpos))
6182 set_nonincremental_init ();
6186 add_pending_init (field, value);
6189 else if (TREE_CODE (constructor_type) == UNION_TYPE
6190 && !VEC_empty (constructor_elt, constructor_elements))
6192 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6193 constructor_elements)->value))
6194 warning_init ("initialized field with side-effects overwritten");
6195 else if (warn_override_init)
6196 warning_init ("initialized field overwritten");
6198 /* We can have just one union field set. */
6199 constructor_elements = 0;
6202 /* Otherwise, output this element either to
6203 constructor_elements or to the assembler file. */
6205 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6206 celt->index = field;
6207 celt->value = value;
6209 /* Advance the variable that indicates sequential elements output. */
6210 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6211 constructor_unfilled_index
6212 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6214 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6216 constructor_unfilled_fields
6217 = TREE_CHAIN (constructor_unfilled_fields);
6219 /* Skip any nameless bit fields. */
6220 while (constructor_unfilled_fields != 0
6221 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6222 && DECL_NAME (constructor_unfilled_fields) == 0)
6223 constructor_unfilled_fields =
6224 TREE_CHAIN (constructor_unfilled_fields);
6226 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6227 constructor_unfilled_fields = 0;
6229 /* Now output any pending elements which have become next. */
6231 output_pending_init_elements (0);
6234 /* Output any pending elements which have become next.
6235 As we output elements, constructor_unfilled_{fields,index}
6236 advances, which may cause other elements to become next;
6237 if so, they too are output.
6239 If ALL is 0, we return when there are
6240 no more pending elements to output now.
6242 If ALL is 1, we output space as necessary so that
6243 we can output all the pending elements. */
6246 output_pending_init_elements (int all)
6248 struct init_node *elt = constructor_pending_elts;
6253 /* Look through the whole pending tree.
6254 If we find an element that should be output now,
6255 output it. Otherwise, set NEXT to the element
6256 that comes first among those still pending. */
6261 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6263 if (tree_int_cst_equal (elt->purpose,
6264 constructor_unfilled_index))
6265 output_init_element (elt->value, true,
6266 TREE_TYPE (constructor_type),
6267 constructor_unfilled_index, 0);
6268 else if (tree_int_cst_lt (constructor_unfilled_index,
6271 /* Advance to the next smaller node. */
6276 /* We have reached the smallest node bigger than the
6277 current unfilled index. Fill the space first. */
6278 next = elt->purpose;
6284 /* Advance to the next bigger node. */
6289 /* We have reached the biggest node in a subtree. Find
6290 the parent of it, which is the next bigger node. */
6291 while (elt->parent && elt->parent->right == elt)
6294 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6297 next = elt->purpose;
6303 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6304 || TREE_CODE (constructor_type) == UNION_TYPE)
6306 tree ctor_unfilled_bitpos, elt_bitpos;
6308 /* If the current record is complete we are done. */
6309 if (constructor_unfilled_fields == 0)
6312 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6313 elt_bitpos = bit_position (elt->purpose);
6314 /* We can't compare fields here because there might be empty
6315 fields in between. */
6316 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6318 constructor_unfilled_fields = elt->purpose;
6319 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6322 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6324 /* Advance to the next smaller node. */
6329 /* We have reached the smallest node bigger than the
6330 current unfilled field. Fill the space first. */
6331 next = elt->purpose;
6337 /* Advance to the next bigger node. */
6342 /* We have reached the biggest node in a subtree. Find
6343 the parent of it, which is the next bigger node. */
6344 while (elt->parent && elt->parent->right == elt)
6348 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6349 bit_position (elt->purpose))))
6351 next = elt->purpose;
6359 /* Ordinarily return, but not if we want to output all
6360 and there are elements left. */
6361 if (!(all && next != 0))
6364 /* If it's not incremental, just skip over the gap, so that after
6365 jumping to retry we will output the next successive element. */
6366 if (TREE_CODE (constructor_type) == RECORD_TYPE
6367 || TREE_CODE (constructor_type) == UNION_TYPE)
6368 constructor_unfilled_fields = next;
6369 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6370 constructor_unfilled_index = next;
6372 /* ELT now points to the node in the pending tree with the next
6373 initializer to output. */
6377 /* Add one non-braced element to the current constructor level.
6378 This adjusts the current position within the constructor's type.
6379 This may also start or terminate implicit levels
6380 to handle a partly-braced initializer.
6382 Once this has found the correct level for the new element,
6383 it calls output_init_element. */
6386 process_init_element (struct c_expr value)
6388 tree orig_value = value.value;
6389 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6390 bool strict_string = value.original_code == STRING_CST;
6392 designator_depth = 0;
6393 designator_erroneous = 0;
6395 /* Handle superfluous braces around string cst as in
6396 char x[] = {"foo"}; */
6399 && TREE_CODE (constructor_type) == ARRAY_TYPE
6400 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6401 && integer_zerop (constructor_unfilled_index))
6403 if (constructor_stack->replacement_value.value)
6404 error_init ("excess elements in char array initializer");
6405 constructor_stack->replacement_value = value;
6409 if (constructor_stack->replacement_value.value != 0)
6411 error_init ("excess elements in struct initializer");
6415 /* Ignore elements of a brace group if it is entirely superfluous
6416 and has already been diagnosed. */
6417 if (constructor_type == 0)
6420 /* If we've exhausted any levels that didn't have braces,
6422 while (constructor_stack->implicit)
6424 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6425 || TREE_CODE (constructor_type) == UNION_TYPE)
6426 && constructor_fields == 0)
6427 process_init_element (pop_init_level (1));
6428 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6429 && (constructor_max_index == 0
6430 || tree_int_cst_lt (constructor_max_index,
6431 constructor_index)))
6432 process_init_element (pop_init_level (1));
6437 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6438 if (constructor_range_stack)
6440 /* If value is a compound literal and we'll be just using its
6441 content, don't put it into a SAVE_EXPR. */
6442 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6443 || !require_constant_value
6445 value.value = save_expr (value.value);
6450 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6453 enum tree_code fieldcode;
6455 if (constructor_fields == 0)
6457 pedwarn_init ("excess elements in struct initializer");
6461 fieldtype = TREE_TYPE (constructor_fields);
6462 if (fieldtype != error_mark_node)
6463 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6464 fieldcode = TREE_CODE (fieldtype);
6466 /* Error for non-static initialization of a flexible array member. */
6467 if (fieldcode == ARRAY_TYPE
6468 && !require_constant_value
6469 && TYPE_SIZE (fieldtype) == NULL_TREE
6470 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6472 error_init ("non-static initialization of a flexible array member");
6476 /* Accept a string constant to initialize a subarray. */
6477 if (value.value != 0
6478 && fieldcode == ARRAY_TYPE
6479 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6481 value.value = orig_value;
6482 /* Otherwise, if we have come to a subaggregate,
6483 and we don't have an element of its type, push into it. */
6484 else if (value.value != 0
6485 && value.value != error_mark_node
6486 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6487 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6488 || fieldcode == UNION_TYPE))
6490 push_init_level (1);
6496 push_member_name (constructor_fields);
6497 output_init_element (value.value, strict_string,
6498 fieldtype, constructor_fields, 1);
6499 RESTORE_SPELLING_DEPTH (constructor_depth);
6502 /* Do the bookkeeping for an element that was
6503 directly output as a constructor. */
6505 /* For a record, keep track of end position of last field. */
6506 if (DECL_SIZE (constructor_fields))
6507 constructor_bit_index
6508 = size_binop (PLUS_EXPR,
6509 bit_position (constructor_fields),
6510 DECL_SIZE (constructor_fields));
6512 /* If the current field was the first one not yet written out,
6513 it isn't now, so update. */
6514 if (constructor_unfilled_fields == constructor_fields)
6516 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6517 /* Skip any nameless bit fields. */
6518 while (constructor_unfilled_fields != 0
6519 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6520 && DECL_NAME (constructor_unfilled_fields) == 0)
6521 constructor_unfilled_fields =
6522 TREE_CHAIN (constructor_unfilled_fields);
6526 constructor_fields = TREE_CHAIN (constructor_fields);
6527 /* Skip any nameless bit fields at the beginning. */
6528 while (constructor_fields != 0
6529 && DECL_C_BIT_FIELD (constructor_fields)
6530 && DECL_NAME (constructor_fields) == 0)
6531 constructor_fields = TREE_CHAIN (constructor_fields);
6533 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6536 enum tree_code fieldcode;
6538 if (constructor_fields == 0)
6540 pedwarn_init ("excess elements in union initializer");
6544 fieldtype = TREE_TYPE (constructor_fields);
6545 if (fieldtype != error_mark_node)
6546 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6547 fieldcode = TREE_CODE (fieldtype);
6549 /* Warn that traditional C rejects initialization of unions.
6550 We skip the warning if the value is zero. This is done
6551 under the assumption that the zero initializer in user
6552 code appears conditioned on e.g. __STDC__ to avoid
6553 "missing initializer" warnings and relies on default
6554 initialization to zero in the traditional C case.
6555 We also skip the warning if the initializer is designated,
6556 again on the assumption that this must be conditional on
6557 __STDC__ anyway (and we've already complained about the
6558 member-designator already). */
6559 if (!in_system_header && !constructor_designated
6560 && !(value.value && (integer_zerop (value.value)
6561 || real_zerop (value.value))))
6562 warning (OPT_Wtraditional, "traditional C rejects initialization "
6565 /* Accept a string constant to initialize a subarray. */
6566 if (value.value != 0
6567 && fieldcode == ARRAY_TYPE
6568 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6570 value.value = orig_value;
6571 /* Otherwise, if we have come to a subaggregate,
6572 and we don't have an element of its type, push into it. */
6573 else if (value.value != 0
6574 && value.value != error_mark_node
6575 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6576 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6577 || fieldcode == UNION_TYPE))
6579 push_init_level (1);
6585 push_member_name (constructor_fields);
6586 output_init_element (value.value, strict_string,
6587 fieldtype, constructor_fields, 1);
6588 RESTORE_SPELLING_DEPTH (constructor_depth);
6591 /* Do the bookkeeping for an element that was
6592 directly output as a constructor. */
6594 constructor_bit_index = DECL_SIZE (constructor_fields);
6595 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6598 constructor_fields = 0;
6600 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6602 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6603 enum tree_code eltcode = TREE_CODE (elttype);
6605 /* Accept a string constant to initialize a subarray. */
6606 if (value.value != 0
6607 && eltcode == ARRAY_TYPE
6608 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6610 value.value = orig_value;
6611 /* Otherwise, if we have come to a subaggregate,
6612 and we don't have an element of its type, push into it. */
6613 else if (value.value != 0
6614 && value.value != error_mark_node
6615 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6616 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6617 || eltcode == UNION_TYPE))
6619 push_init_level (1);
6623 if (constructor_max_index != 0
6624 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6625 || integer_all_onesp (constructor_max_index)))
6627 pedwarn_init ("excess elements in array initializer");
6631 /* Now output the actual element. */
6634 push_array_bounds (tree_low_cst (constructor_index, 1));
6635 output_init_element (value.value, strict_string,
6636 elttype, constructor_index, 1);
6637 RESTORE_SPELLING_DEPTH (constructor_depth);
6641 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6644 /* If we are doing the bookkeeping for an element that was
6645 directly output as a constructor, we must update
6646 constructor_unfilled_index. */
6647 constructor_unfilled_index = constructor_index;
6649 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6651 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6653 /* Do a basic check of initializer size. Note that vectors
6654 always have a fixed size derived from their type. */
6655 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6657 pedwarn_init ("excess elements in vector initializer");
6661 /* Now output the actual element. */
6663 output_init_element (value.value, strict_string,
6664 elttype, constructor_index, 1);
6667 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6670 /* If we are doing the bookkeeping for an element that was
6671 directly output as a constructor, we must update
6672 constructor_unfilled_index. */
6673 constructor_unfilled_index = constructor_index;
6676 /* Handle the sole element allowed in a braced initializer
6677 for a scalar variable. */
6678 else if (constructor_type != error_mark_node
6679 && constructor_fields == 0)
6681 pedwarn_init ("excess elements in scalar initializer");
6687 output_init_element (value.value, strict_string,
6688 constructor_type, NULL_TREE, 1);
6689 constructor_fields = 0;
6692 /* Handle range initializers either at this level or anywhere higher
6693 in the designator stack. */
6694 if (constructor_range_stack)
6696 struct constructor_range_stack *p, *range_stack;
6699 range_stack = constructor_range_stack;
6700 constructor_range_stack = 0;
6701 while (constructor_stack != range_stack->stack)
6703 gcc_assert (constructor_stack->implicit);
6704 process_init_element (pop_init_level (1));
6706 for (p = range_stack;
6707 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6710 gcc_assert (constructor_stack->implicit);
6711 process_init_element (pop_init_level (1));
6714 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6715 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6720 constructor_index = p->index;
6721 constructor_fields = p->fields;
6722 if (finish && p->range_end && p->index == p->range_start)
6730 push_init_level (2);
6731 p->stack = constructor_stack;
6732 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6733 p->index = p->range_start;
6737 constructor_range_stack = range_stack;
6744 constructor_range_stack = 0;
6747 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6748 (guaranteed to be 'volatile' or null) and ARGS (represented using
6749 an ASM_EXPR node). */
6751 build_asm_stmt (tree cv_qualifier, tree args)
6753 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6754 ASM_VOLATILE_P (args) = 1;
6755 return add_stmt (args);
6758 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6759 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6760 SIMPLE indicates whether there was anything at all after the
6761 string in the asm expression -- asm("blah") and asm("blah" : )
6762 are subtly different. We use a ASM_EXPR node to represent this. */
6764 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6770 const char *constraint;
6771 const char **oconstraints;
6772 bool allows_mem, allows_reg, is_inout;
6773 int ninputs, noutputs;
6775 ninputs = list_length (inputs);
6776 noutputs = list_length (outputs);
6777 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
6779 string = resolve_asm_operand_names (string, outputs, inputs);
6781 /* Remove output conversions that change the type but not the mode. */
6782 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6784 tree output = TREE_VALUE (tail);
6786 /* ??? Really, this should not be here. Users should be using a
6787 proper lvalue, dammit. But there's a long history of using casts
6788 in the output operands. In cases like longlong.h, this becomes a
6789 primitive form of typechecking -- if the cast can be removed, then
6790 the output operand had a type of the proper width; otherwise we'll
6791 get an error. Gross, but ... */
6792 STRIP_NOPS (output);
6794 if (!lvalue_or_else (output, lv_asm))
6795 output = error_mark_node;
6797 if (output != error_mark_node
6798 && (TREE_READONLY (output)
6799 || TYPE_READONLY (TREE_TYPE (output))
6800 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
6801 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
6802 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
6803 readonly_error (output, lv_asm);
6805 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6806 oconstraints[i] = constraint;
6808 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6809 &allows_mem, &allows_reg, &is_inout))
6811 /* If the operand is going to end up in memory,
6812 mark it addressable. */
6813 if (!allows_reg && !c_mark_addressable (output))
6814 output = error_mark_node;
6817 output = error_mark_node;
6819 TREE_VALUE (tail) = output;
6822 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
6826 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6827 input = TREE_VALUE (tail);
6829 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
6830 oconstraints, &allows_mem, &allows_reg))
6832 /* If the operand is going to end up in memory,
6833 mark it addressable. */
6834 if (!allows_reg && allows_mem)
6836 /* Strip the nops as we allow this case. FIXME, this really
6837 should be rejected or made deprecated. */
6839 if (!c_mark_addressable (input))
6840 input = error_mark_node;
6844 input = error_mark_node;
6846 TREE_VALUE (tail) = input;
6849 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
6851 /* asm statements without outputs, including simple ones, are treated
6853 ASM_INPUT_P (args) = simple;
6854 ASM_VOLATILE_P (args) = (noutputs == 0);
6859 /* Generate a goto statement to LABEL. */
6862 c_finish_goto_label (tree label)
6864 tree decl = lookup_label (label);
6868 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
6870 error ("jump into statement expression");
6874 if (C_DECL_UNJUMPABLE_VM (decl))
6876 error ("jump into scope of identifier with variably modified type");
6880 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
6882 /* No jump from outside this statement expression context, so
6883 record that there is a jump from within this context. */
6884 struct c_label_list *nlist;
6885 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6886 nlist->next = label_context_stack_se->labels_used;
6887 nlist->label = decl;
6888 label_context_stack_se->labels_used = nlist;
6891 if (!C_DECL_UNDEFINABLE_VM (decl))
6893 /* No jump from outside this context context of identifiers with
6894 variably modified type, so record that there is a jump from
6895 within this context. */
6896 struct c_label_list *nlist;
6897 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6898 nlist->next = label_context_stack_vm->labels_used;
6899 nlist->label = decl;
6900 label_context_stack_vm->labels_used = nlist;
6903 TREE_USED (decl) = 1;
6904 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
6907 /* Generate a computed goto statement to EXPR. */
6910 c_finish_goto_ptr (tree expr)
6913 pedwarn ("ISO C forbids %<goto *expr;%>");
6914 expr = convert (ptr_type_node, expr);
6915 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
6918 /* Generate a C `return' statement. RETVAL is the expression for what
6919 to return, or a null pointer for `return;' with no value. */
6922 c_finish_return (tree retval)
6924 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
6925 bool no_warning = false;
6927 if (TREE_THIS_VOLATILE (current_function_decl))
6928 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6932 current_function_returns_null = 1;
6933 if ((warn_return_type || flag_isoc99)
6934 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
6936 pedwarn_c99 ("%<return%> with no value, in "
6937 "function returning non-void");
6941 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
6943 current_function_returns_null = 1;
6944 if (TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
6945 pedwarn ("%<return%> with a value, in function returning void");
6947 pedwarn ("ISO C forbids %<return%> with expression, in function returning void");
6951 tree t = convert_for_assignment (valtype, retval, ic_return,
6952 NULL_TREE, NULL_TREE, 0);
6953 tree res = DECL_RESULT (current_function_decl);
6956 current_function_returns_value = 1;
6957 if (t == error_mark_node)
6960 inner = t = convert (TREE_TYPE (res), t);
6962 /* Strip any conversions, additions, and subtractions, and see if
6963 we are returning the address of a local variable. Warn if so. */
6966 switch (TREE_CODE (inner))
6968 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6970 inner = TREE_OPERAND (inner, 0);
6974 /* If the second operand of the MINUS_EXPR has a pointer
6975 type (or is converted from it), this may be valid, so
6976 don't give a warning. */
6978 tree op1 = TREE_OPERAND (inner, 1);
6980 while (!POINTER_TYPE_P (TREE_TYPE (op1))
6981 && (TREE_CODE (op1) == NOP_EXPR
6982 || TREE_CODE (op1) == NON_LVALUE_EXPR
6983 || TREE_CODE (op1) == CONVERT_EXPR))
6984 op1 = TREE_OPERAND (op1, 0);
6986 if (POINTER_TYPE_P (TREE_TYPE (op1)))
6989 inner = TREE_OPERAND (inner, 0);
6994 inner = TREE_OPERAND (inner, 0);
6996 while (REFERENCE_CLASS_P (inner)
6997 && TREE_CODE (inner) != INDIRECT_REF)
6998 inner = TREE_OPERAND (inner, 0);
7001 && !DECL_EXTERNAL (inner)
7002 && !TREE_STATIC (inner)
7003 && DECL_CONTEXT (inner) == current_function_decl)
7004 warning (0, "function returns address of local variable");
7014 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7017 ret_stmt = build_stmt (RETURN_EXPR, retval);
7018 TREE_NO_WARNING (ret_stmt) |= no_warning;
7019 return add_stmt (ret_stmt);
7023 /* The SWITCH_EXPR being built. */
7026 /* The original type of the testing expression, i.e. before the
7027 default conversion is applied. */
7030 /* A splay-tree mapping the low element of a case range to the high
7031 element, or NULL_TREE if there is no high element. Used to
7032 determine whether or not a new case label duplicates an old case
7033 label. We need a tree, rather than simply a hash table, because
7034 of the GNU case range extension. */
7037 /* Number of nested statement expressions within this switch
7038 statement; if nonzero, case and default labels may not
7040 unsigned int blocked_stmt_expr;
7042 /* Scope of outermost declarations of identifiers with variably
7043 modified type within this switch statement; if nonzero, case and
7044 default labels may not appear. */
7045 unsigned int blocked_vm;
7047 /* The next node on the stack. */
7048 struct c_switch *next;
7051 /* A stack of the currently active switch statements. The innermost
7052 switch statement is on the top of the stack. There is no need to
7053 mark the stack for garbage collection because it is only active
7054 during the processing of the body of a function, and we never
7055 collect at that point. */
7057 struct c_switch *c_switch_stack;
7059 /* Start a C switch statement, testing expression EXP. Return the new
7063 c_start_case (tree exp)
7065 tree orig_type = error_mark_node;
7066 struct c_switch *cs;
7068 if (exp != error_mark_node)
7070 orig_type = TREE_TYPE (exp);
7072 if (!INTEGRAL_TYPE_P (orig_type))
7074 if (orig_type != error_mark_node)
7076 error ("switch quantity not an integer");
7077 orig_type = error_mark_node;
7079 exp = integer_zero_node;
7083 tree type = TYPE_MAIN_VARIANT (orig_type);
7085 if (!in_system_header
7086 && (type == long_integer_type_node
7087 || type == long_unsigned_type_node))
7088 warning (OPT_Wtraditional, "%<long%> switch expression not "
7089 "converted to %<int%> in ISO C");
7091 exp = default_conversion (exp);
7095 /* Add this new SWITCH_EXPR to the stack. */
7096 cs = XNEW (struct c_switch);
7097 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7098 cs->orig_type = orig_type;
7099 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7100 cs->blocked_stmt_expr = 0;
7102 cs->next = c_switch_stack;
7103 c_switch_stack = cs;
7105 return add_stmt (cs->switch_expr);
7108 /* Process a case label. */
7111 do_case (tree low_value, tree high_value)
7113 tree label = NULL_TREE;
7115 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7116 && !c_switch_stack->blocked_vm)
7118 label = c_add_case_label (c_switch_stack->cases,
7119 SWITCH_COND (c_switch_stack->switch_expr),
7120 c_switch_stack->orig_type,
7121 low_value, high_value);
7122 if (label == error_mark_node)
7125 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7128 error ("case label in statement expression not containing "
7129 "enclosing switch statement");
7131 error ("%<default%> label in statement expression not containing "
7132 "enclosing switch statement");
7134 else if (c_switch_stack && c_switch_stack->blocked_vm)
7137 error ("case label in scope of identifier with variably modified "
7138 "type not containing enclosing switch statement");
7140 error ("%<default%> label in scope of identifier with variably "
7141 "modified type not containing enclosing switch statement");
7144 error ("case label not within a switch statement");
7146 error ("%<default%> label not within a switch statement");
7151 /* Finish the switch statement. */
7154 c_finish_case (tree body)
7156 struct c_switch *cs = c_switch_stack;
7157 location_t switch_location;
7159 SWITCH_BODY (cs->switch_expr) = body;
7161 /* We must not be within a statement expression nested in the switch
7162 at this point; we might, however, be within the scope of an
7163 identifier with variably modified type nested in the switch. */
7164 gcc_assert (!cs->blocked_stmt_expr);
7166 /* Emit warnings as needed. */
7167 if (EXPR_HAS_LOCATION (cs->switch_expr))
7168 switch_location = EXPR_LOCATION (cs->switch_expr);
7170 switch_location = input_location;
7171 c_do_switch_warnings (cs->cases, switch_location,
7172 TREE_TYPE (cs->switch_expr),
7173 SWITCH_COND (cs->switch_expr));
7175 /* Pop the stack. */
7176 c_switch_stack = cs->next;
7177 splay_tree_delete (cs->cases);
7181 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7182 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7183 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7184 statement, and was not surrounded with parenthesis. */
7187 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7188 tree else_block, bool nested_if)
7192 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7193 if (warn_parentheses && nested_if && else_block == NULL)
7195 tree inner_if = then_block;
7197 /* We know from the grammar productions that there is an IF nested
7198 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7199 it might not be exactly THEN_BLOCK, but should be the last
7200 non-container statement within. */
7202 switch (TREE_CODE (inner_if))
7207 inner_if = BIND_EXPR_BODY (inner_if);
7209 case STATEMENT_LIST:
7210 inner_if = expr_last (then_block);
7212 case TRY_FINALLY_EXPR:
7213 case TRY_CATCH_EXPR:
7214 inner_if = TREE_OPERAND (inner_if, 0);
7221 if (COND_EXPR_ELSE (inner_if))
7222 warning (OPT_Wparentheses,
7223 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7227 empty_if_body_warning (then_block, else_block);
7229 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7230 SET_EXPR_LOCATION (stmt, if_locus);
7234 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7235 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7236 is false for DO loops. INCR is the FOR increment expression. BODY is
7237 the statement controlled by the loop. BLAB is the break label. CLAB is
7238 the continue label. Everything is allowed to be NULL. */
7241 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7242 tree blab, tree clab, bool cond_is_first)
7244 tree entry = NULL, exit = NULL, t;
7246 /* If the condition is zero don't generate a loop construct. */
7247 if (cond && integer_zerop (cond))
7251 t = build_and_jump (&blab);
7252 SET_EXPR_LOCATION (t, start_locus);
7258 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7260 /* If we have an exit condition, then we build an IF with gotos either
7261 out of the loop, or to the top of it. If there's no exit condition,
7262 then we just build a jump back to the top. */
7263 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7265 if (cond && !integer_nonzerop (cond))
7267 /* Canonicalize the loop condition to the end. This means
7268 generating a branch to the loop condition. Reuse the
7269 continue label, if possible. */
7274 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7275 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7278 t = build1 (GOTO_EXPR, void_type_node, clab);
7279 SET_EXPR_LOCATION (t, start_locus);
7283 t = build_and_jump (&blab);
7284 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7286 SET_EXPR_LOCATION (exit, start_locus);
7288 SET_EXPR_LOCATION (exit, input_location);
7297 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7305 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7309 c_finish_bc_stmt (tree *label_p, bool is_break)
7312 tree label = *label_p;
7314 /* In switch statements break is sometimes stylistically used after
7315 a return statement. This can lead to spurious warnings about
7316 control reaching the end of a non-void function when it is
7317 inlined. Note that we are calling block_may_fallthru with
7318 language specific tree nodes; this works because
7319 block_may_fallthru returns true when given something it does not
7321 skip = !block_may_fallthru (cur_stmt_list);
7326 *label_p = label = create_artificial_label ();
7328 else if (TREE_CODE (label) == LABEL_DECL)
7330 else switch (TREE_INT_CST_LOW (label))
7334 error ("break statement not within loop or switch");
7336 error ("continue statement not within a loop");
7340 gcc_assert (is_break);
7341 error ("break statement used with OpenMP for loop");
7351 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7354 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7357 emit_side_effect_warnings (tree expr)
7359 if (expr == error_mark_node)
7361 else if (!TREE_SIDE_EFFECTS (expr))
7363 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7364 warning (OPT_Wunused_value, "%Hstatement with no effect",
7365 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7368 warn_if_unused_value (expr, input_location);
7371 /* Process an expression as if it were a complete statement. Emit
7372 diagnostics, but do not call ADD_STMT. */
7375 c_process_expr_stmt (tree expr)
7380 if (warn_sequence_point)
7381 verify_sequence_points (expr);
7383 if (TREE_TYPE (expr) != error_mark_node
7384 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7385 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7386 error ("expression statement has incomplete type");
7388 /* If we're not processing a statement expression, warn about unused values.
7389 Warnings for statement expressions will be emitted later, once we figure
7390 out which is the result. */
7391 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7392 && warn_unused_value)
7393 emit_side_effect_warnings (expr);
7395 /* If the expression is not of a type to which we cannot assign a line
7396 number, wrap the thing in a no-op NOP_EXPR. */
7397 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7398 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7400 if (CAN_HAVE_LOCATION_P (expr))
7401 SET_EXPR_LOCATION (expr, input_location);
7406 /* Emit an expression as a statement. */
7409 c_finish_expr_stmt (tree expr)
7412 return add_stmt (c_process_expr_stmt (expr));
7417 /* Do the opposite and emit a statement as an expression. To begin,
7418 create a new binding level and return it. */
7421 c_begin_stmt_expr (void)
7424 struct c_label_context_se *nstack;
7425 struct c_label_list *glist;
7427 /* We must force a BLOCK for this level so that, if it is not expanded
7428 later, there is a way to turn off the entire subtree of blocks that
7429 are contained in it. */
7431 ret = c_begin_compound_stmt (true);
7434 c_switch_stack->blocked_stmt_expr++;
7435 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7437 for (glist = label_context_stack_se->labels_used;
7439 glist = glist->next)
7441 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7443 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7444 nstack->labels_def = NULL;
7445 nstack->labels_used = NULL;
7446 nstack->next = label_context_stack_se;
7447 label_context_stack_se = nstack;
7449 /* Mark the current statement list as belonging to a statement list. */
7450 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7456 c_finish_stmt_expr (tree body)
7458 tree last, type, tmp, val;
7460 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7462 body = c_end_compound_stmt (body, true);
7465 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7466 c_switch_stack->blocked_stmt_expr--;
7468 /* It is no longer possible to jump to labels defined within this
7469 statement expression. */
7470 for (dlist = label_context_stack_se->labels_def;
7472 dlist = dlist->next)
7474 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7476 /* It is again possible to define labels with a goto just outside
7477 this statement expression. */
7478 for (glist = label_context_stack_se->next->labels_used;
7480 glist = glist->next)
7482 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7485 if (glist_prev != NULL)
7486 glist_prev->next = label_context_stack_se->labels_used;
7488 label_context_stack_se->next->labels_used
7489 = label_context_stack_se->labels_used;
7490 label_context_stack_se = label_context_stack_se->next;
7492 /* Locate the last statement in BODY. See c_end_compound_stmt
7493 about always returning a BIND_EXPR. */
7494 last_p = &BIND_EXPR_BODY (body);
7495 last = BIND_EXPR_BODY (body);
7498 if (TREE_CODE (last) == STATEMENT_LIST)
7500 tree_stmt_iterator i;
7502 /* This can happen with degenerate cases like ({ }). No value. */
7503 if (!TREE_SIDE_EFFECTS (last))
7506 /* If we're supposed to generate side effects warnings, process
7507 all of the statements except the last. */
7508 if (warn_unused_value)
7510 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7511 emit_side_effect_warnings (tsi_stmt (i));
7514 i = tsi_last (last);
7515 last_p = tsi_stmt_ptr (i);
7519 /* If the end of the list is exception related, then the list was split
7520 by a call to push_cleanup. Continue searching. */
7521 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7522 || TREE_CODE (last) == TRY_CATCH_EXPR)
7524 last_p = &TREE_OPERAND (last, 0);
7526 goto continue_searching;
7529 /* In the case that the BIND_EXPR is not necessary, return the
7530 expression out from inside it. */
7531 if (last == error_mark_node
7532 || (last == BIND_EXPR_BODY (body)
7533 && BIND_EXPR_VARS (body) == NULL))
7535 /* Do not warn if the return value of a statement expression is
7537 if (CAN_HAVE_LOCATION_P (last))
7538 TREE_NO_WARNING (last) = 1;
7542 /* Extract the type of said expression. */
7543 type = TREE_TYPE (last);
7545 /* If we're not returning a value at all, then the BIND_EXPR that
7546 we already have is a fine expression to return. */
7547 if (!type || VOID_TYPE_P (type))
7550 /* Now that we've located the expression containing the value, it seems
7551 silly to make voidify_wrapper_expr repeat the process. Create a
7552 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7553 tmp = create_tmp_var_raw (type, NULL);
7555 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7556 tree_expr_nonnegative_p giving up immediately. */
7558 if (TREE_CODE (val) == NOP_EXPR
7559 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7560 val = TREE_OPERAND (val, 0);
7562 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7563 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7565 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7568 /* Begin the scope of an identifier of variably modified type, scope
7569 number SCOPE. Jumping from outside this scope to inside it is not
7573 c_begin_vm_scope (unsigned int scope)
7575 struct c_label_context_vm *nstack;
7576 struct c_label_list *glist;
7578 gcc_assert (scope > 0);
7580 /* At file_scope, we don't have to do any processing. */
7581 if (label_context_stack_vm == NULL)
7584 if (c_switch_stack && !c_switch_stack->blocked_vm)
7585 c_switch_stack->blocked_vm = scope;
7586 for (glist = label_context_stack_vm->labels_used;
7588 glist = glist->next)
7590 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7592 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7593 nstack->labels_def = NULL;
7594 nstack->labels_used = NULL;
7595 nstack->scope = scope;
7596 nstack->next = label_context_stack_vm;
7597 label_context_stack_vm = nstack;
7600 /* End a scope which may contain identifiers of variably modified
7601 type, scope number SCOPE. */
7604 c_end_vm_scope (unsigned int scope)
7606 if (label_context_stack_vm == NULL)
7608 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7609 c_switch_stack->blocked_vm = 0;
7610 /* We may have a number of nested scopes of identifiers with
7611 variably modified type, all at this depth. Pop each in turn. */
7612 while (label_context_stack_vm->scope == scope)
7614 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7616 /* It is no longer possible to jump to labels defined within this
7618 for (dlist = label_context_stack_vm->labels_def;
7620 dlist = dlist->next)
7622 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7624 /* It is again possible to define labels with a goto just outside
7626 for (glist = label_context_stack_vm->next->labels_used;
7628 glist = glist->next)
7630 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7633 if (glist_prev != NULL)
7634 glist_prev->next = label_context_stack_vm->labels_used;
7636 label_context_stack_vm->next->labels_used
7637 = label_context_stack_vm->labels_used;
7638 label_context_stack_vm = label_context_stack_vm->next;
7642 /* Begin and end compound statements. This is as simple as pushing
7643 and popping new statement lists from the tree. */
7646 c_begin_compound_stmt (bool do_scope)
7648 tree stmt = push_stmt_list ();
7655 c_end_compound_stmt (tree stmt, bool do_scope)
7661 if (c_dialect_objc ())
7662 objc_clear_super_receiver ();
7663 block = pop_scope ();
7666 stmt = pop_stmt_list (stmt);
7667 stmt = c_build_bind_expr (block, stmt);
7669 /* If this compound statement is nested immediately inside a statement
7670 expression, then force a BIND_EXPR to be created. Otherwise we'll
7671 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7672 STATEMENT_LISTs merge, and thus we can lose track of what statement
7675 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7676 && TREE_CODE (stmt) != BIND_EXPR)
7678 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7679 TREE_SIDE_EFFECTS (stmt) = 1;
7685 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7686 when the current scope is exited. EH_ONLY is true when this is not
7687 meant to apply to normal control flow transfer. */
7690 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7692 enum tree_code code;
7696 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7697 stmt = build_stmt (code, NULL, cleanup);
7699 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7700 list = push_stmt_list ();
7701 TREE_OPERAND (stmt, 0) = list;
7702 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7705 /* Build a binary-operation expression without default conversions.
7706 CODE is the kind of expression to build.
7707 This function differs from `build' in several ways:
7708 the data type of the result is computed and recorded in it,
7709 warnings are generated if arg data types are invalid,
7710 special handling for addition and subtraction of pointers is known,
7711 and some optimization is done (operations on narrow ints
7712 are done in the narrower type when that gives the same result).
7713 Constant folding is also done before the result is returned.
7715 Note that the operands will never have enumeral types, or function
7716 or array types, because either they will have the default conversions
7717 performed or they have both just been converted to some other type in which
7718 the arithmetic is to be done. */
7721 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
7725 enum tree_code code0, code1;
7727 const char *invalid_op_diag;
7729 /* Expression code to give to the expression when it is built.
7730 Normally this is CODE, which is what the caller asked for,
7731 but in some special cases we change it. */
7732 enum tree_code resultcode = code;
7734 /* Data type in which the computation is to be performed.
7735 In the simplest cases this is the common type of the arguments. */
7736 tree result_type = NULL;
7738 /* Nonzero means operands have already been type-converted
7739 in whatever way is necessary.
7740 Zero means they need to be converted to RESULT_TYPE. */
7743 /* Nonzero means create the expression with this type, rather than
7745 tree build_type = 0;
7747 /* Nonzero means after finally constructing the expression
7748 convert it to this type. */
7749 tree final_type = 0;
7751 /* Nonzero if this is an operation like MIN or MAX which can
7752 safely be computed in short if both args are promoted shorts.
7753 Also implies COMMON.
7754 -1 indicates a bitwise operation; this makes a difference
7755 in the exact conditions for when it is safe to do the operation
7756 in a narrower mode. */
7759 /* Nonzero if this is a comparison operation;
7760 if both args are promoted shorts, compare the original shorts.
7761 Also implies COMMON. */
7762 int short_compare = 0;
7764 /* Nonzero if this is a right-shift operation, which can be computed on the
7765 original short and then promoted if the operand is a promoted short. */
7766 int short_shift = 0;
7768 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7771 /* True means types are compatible as far as ObjC is concerned. */
7776 op0 = default_conversion (orig_op0);
7777 op1 = default_conversion (orig_op1);
7785 type0 = TREE_TYPE (op0);
7786 type1 = TREE_TYPE (op1);
7788 /* The expression codes of the data types of the arguments tell us
7789 whether the arguments are integers, floating, pointers, etc. */
7790 code0 = TREE_CODE (type0);
7791 code1 = TREE_CODE (type1);
7793 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7794 STRIP_TYPE_NOPS (op0);
7795 STRIP_TYPE_NOPS (op1);
7797 /* If an error was already reported for one of the arguments,
7798 avoid reporting another error. */
7800 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7801 return error_mark_node;
7803 if ((invalid_op_diag
7804 = targetm.invalid_binary_op (code, type0, type1)))
7806 error (invalid_op_diag);
7807 return error_mark_node;
7810 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
7815 /* Handle the pointer + int case. */
7816 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7817 return pointer_int_sum (PLUS_EXPR, op0, op1);
7818 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
7819 return pointer_int_sum (PLUS_EXPR, op1, op0);
7825 /* Subtraction of two similar pointers.
7826 We must subtract them as integers, then divide by object size. */
7827 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
7828 && comp_target_types (type0, type1))
7829 return pointer_diff (op0, op1);
7830 /* Handle pointer minus int. Just like pointer plus int. */
7831 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7832 return pointer_int_sum (MINUS_EXPR, op0, op1);
7841 case TRUNC_DIV_EXPR:
7843 case FLOOR_DIV_EXPR:
7844 case ROUND_DIV_EXPR:
7845 case EXACT_DIV_EXPR:
7846 warn_for_div_by_zero (op1);
7848 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7849 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7850 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7851 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
7853 enum tree_code tcode0 = code0, tcode1 = code1;
7855 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7856 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
7857 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
7858 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
7860 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
7861 resultcode = RDIV_EXPR;
7863 /* Although it would be tempting to shorten always here, that
7864 loses on some targets, since the modulo instruction is
7865 undefined if the quotient can't be represented in the
7866 computation mode. We shorten only if unsigned or if
7867 dividing by something we know != -1. */
7868 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7869 || (TREE_CODE (op1) == INTEGER_CST
7870 && !integer_all_onesp (op1)));
7878 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7880 else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
7884 case TRUNC_MOD_EXPR:
7885 case FLOOR_MOD_EXPR:
7886 warn_for_div_by_zero (op1);
7888 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7890 /* Although it would be tempting to shorten always here, that loses
7891 on some targets, since the modulo instruction is undefined if the
7892 quotient can't be represented in the computation mode. We shorten
7893 only if unsigned or if dividing by something we know != -1. */
7894 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7895 || (TREE_CODE (op1) == INTEGER_CST
7896 && !integer_all_onesp (op1)));
7901 case TRUTH_ANDIF_EXPR:
7902 case TRUTH_ORIF_EXPR:
7903 case TRUTH_AND_EXPR:
7905 case TRUTH_XOR_EXPR:
7906 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
7907 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
7908 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
7909 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
7911 /* Result of these operations is always an int,
7912 but that does not mean the operands should be
7913 converted to ints! */
7914 result_type = integer_type_node;
7915 op0 = c_common_truthvalue_conversion (op0);
7916 op1 = c_common_truthvalue_conversion (op1);
7921 /* Shift operations: result has same type as first operand;
7922 always convert second operand to int.
7923 Also set SHORT_SHIFT if shifting rightward. */
7926 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7928 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7930 if (tree_int_cst_sgn (op1) < 0)
7931 warning (0, "right shift count is negative");
7934 if (!integer_zerop (op1))
7937 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7938 warning (0, "right shift count >= width of type");
7942 /* Use the type of the value to be shifted. */
7943 result_type = type0;
7944 /* Convert the shift-count to an integer, regardless of size
7945 of value being shifted. */
7946 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7947 op1 = convert (integer_type_node, op1);
7948 /* Avoid converting op1 to result_type later. */
7954 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7956 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7958 if (tree_int_cst_sgn (op1) < 0)
7959 warning (0, "left shift count is negative");
7961 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7962 warning (0, "left shift count >= width of type");
7965 /* Use the type of the value to be shifted. */
7966 result_type = type0;
7967 /* Convert the shift-count to an integer, regardless of size
7968 of value being shifted. */
7969 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7970 op1 = convert (integer_type_node, op1);
7971 /* Avoid converting op1 to result_type later. */
7978 if (code0 == REAL_TYPE || code1 == REAL_TYPE)
7979 warning (OPT_Wfloat_equal,
7980 "comparing floating point with == or != is unsafe");
7981 /* Result of comparison is always int,
7982 but don't convert the args to int! */
7983 build_type = integer_type_node;
7984 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7985 || code0 == COMPLEX_TYPE)
7986 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7987 || code1 == COMPLEX_TYPE))
7989 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
7991 tree tt0 = TREE_TYPE (type0);
7992 tree tt1 = TREE_TYPE (type1);
7993 /* Anything compares with void *. void * compares with anything.
7994 Otherwise, the targets must be compatible
7995 and both must be object or both incomplete. */
7996 if (comp_target_types (type0, type1))
7997 result_type = common_pointer_type (type0, type1);
7998 else if (VOID_TYPE_P (tt0))
8000 /* op0 != orig_op0 detects the case of something
8001 whose value is 0 but which isn't a valid null ptr const. */
8002 if (pedantic && !null_pointer_constant_p (orig_op0)
8003 && TREE_CODE (tt1) == FUNCTION_TYPE)
8004 pedwarn ("ISO C forbids comparison of %<void *%>"
8005 " with function pointer");
8007 else if (VOID_TYPE_P (tt1))
8009 if (pedantic && !null_pointer_constant_p (orig_op1)
8010 && TREE_CODE (tt0) == FUNCTION_TYPE)
8011 pedwarn ("ISO C forbids comparison of %<void *%>"
8012 " with function pointer");
8015 /* Avoid warning about the volatile ObjC EH puts on decls. */
8017 pedwarn ("comparison of distinct pointer types lacks a cast");
8019 if (result_type == NULL_TREE)
8020 result_type = ptr_type_node;
8022 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8024 if (TREE_CODE (op0) == ADDR_EXPR
8025 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
8026 warning (OPT_Waddress, "the address of %qD will never be NULL",
8027 TREE_OPERAND (op0, 0));
8028 result_type = type0;
8030 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8032 if (TREE_CODE (op1) == ADDR_EXPR
8033 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
8034 warning (OPT_Waddress, "the address of %qD will never be NULL",
8035 TREE_OPERAND (op1, 0));
8036 result_type = type1;
8038 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8040 result_type = type0;
8041 pedwarn ("comparison between pointer and integer");
8043 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8045 result_type = type1;
8046 pedwarn ("comparison between pointer and integer");
8054 build_type = integer_type_node;
8055 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
8056 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
8058 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8060 if (comp_target_types (type0, type1))
8062 result_type = common_pointer_type (type0, type1);
8063 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8064 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8065 pedwarn ("comparison of complete and incomplete pointers");
8067 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8068 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
8072 result_type = ptr_type_node;
8073 pedwarn ("comparison of distinct pointer types lacks a cast");
8076 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8078 result_type = type0;
8079 if (pedantic || extra_warnings)
8080 pedwarn ("ordered comparison of pointer with integer zero");
8082 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8084 result_type = type1;
8086 pedwarn ("ordered comparison of pointer with integer zero");
8088 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8090 result_type = type0;
8091 pedwarn ("comparison between pointer and integer");
8093 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8095 result_type = type1;
8096 pedwarn ("comparison between pointer and integer");
8104 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8105 return error_mark_node;
8107 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8108 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8109 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8110 TREE_TYPE (type1))))
8112 binary_op_error (code, type0, type1);
8113 return error_mark_node;
8116 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8117 || code0 == VECTOR_TYPE)
8119 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8120 || code1 == VECTOR_TYPE))
8122 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8124 if (shorten || common || short_compare)
8126 result_type = c_common_type (type0, type1);
8127 if (result_type == error_mark_node)
8128 return error_mark_node;
8131 /* For certain operations (which identify themselves by shorten != 0)
8132 if both args were extended from the same smaller type,
8133 do the arithmetic in that type and then extend.
8135 shorten !=0 and !=1 indicates a bitwise operation.
8136 For them, this optimization is safe only if
8137 both args are zero-extended or both are sign-extended.
8138 Otherwise, we might change the result.
8139 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8140 but calculated in (unsigned short) it would be (unsigned short)-1. */
8142 if (shorten && none_complex)
8144 int unsigned0, unsigned1;
8149 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
8150 excessive narrowing when we call get_narrower below. For
8151 example, suppose that OP0 is of unsigned int extended
8152 from signed char and that RESULT_TYPE is long long int.
8153 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
8156 (long long int) (unsigned int) signed_char
8158 which get_narrower would narrow down to
8160 (unsigned int) signed char
8162 If we do not cast OP0 first, get_narrower would return
8163 signed_char, which is inconsistent with the case of the
8165 op0 = convert (result_type, op0);
8166 op1 = convert (result_type, op1);
8168 arg0 = get_narrower (op0, &unsigned0);
8169 arg1 = get_narrower (op1, &unsigned1);
8171 /* UNS is 1 if the operation to be done is an unsigned one. */
8172 uns = TYPE_UNSIGNED (result_type);
8174 final_type = result_type;
8176 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
8177 but it *requires* conversion to FINAL_TYPE. */
8179 if ((TYPE_PRECISION (TREE_TYPE (op0))
8180 == TYPE_PRECISION (TREE_TYPE (arg0)))
8181 && TREE_TYPE (op0) != final_type)
8182 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
8183 if ((TYPE_PRECISION (TREE_TYPE (op1))
8184 == TYPE_PRECISION (TREE_TYPE (arg1)))
8185 && TREE_TYPE (op1) != final_type)
8186 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
8188 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
8190 /* For bitwise operations, signedness of nominal type
8191 does not matter. Consider only how operands were extended. */
8195 /* Note that in all three cases below we refrain from optimizing
8196 an unsigned operation on sign-extended args.
8197 That would not be valid. */
8199 /* Both args variable: if both extended in same way
8200 from same width, do it in that width.
8201 Do it unsigned if args were zero-extended. */
8202 if ((TYPE_PRECISION (TREE_TYPE (arg0))
8203 < TYPE_PRECISION (result_type))
8204 && (TYPE_PRECISION (TREE_TYPE (arg1))
8205 == TYPE_PRECISION (TREE_TYPE (arg0)))
8206 && unsigned0 == unsigned1
8207 && (unsigned0 || !uns))
8209 = c_common_signed_or_unsigned_type
8210 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
8211 else if (TREE_CODE (arg0) == INTEGER_CST
8212 && (unsigned1 || !uns)
8213 && (TYPE_PRECISION (TREE_TYPE (arg1))
8214 < TYPE_PRECISION (result_type))
8216 = c_common_signed_or_unsigned_type (unsigned1,
8218 int_fits_type_p (arg0, type)))
8220 else if (TREE_CODE (arg1) == INTEGER_CST
8221 && (unsigned0 || !uns)
8222 && (TYPE_PRECISION (TREE_TYPE (arg0))
8223 < TYPE_PRECISION (result_type))
8225 = c_common_signed_or_unsigned_type (unsigned0,
8227 int_fits_type_p (arg1, type)))
8231 /* Shifts can be shortened if shifting right. */
8236 tree arg0 = get_narrower (op0, &unsigned_arg);
8238 final_type = result_type;
8240 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8241 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8243 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8244 /* We can shorten only if the shift count is less than the
8245 number of bits in the smaller type size. */
8246 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8247 /* We cannot drop an unsigned shift after sign-extension. */
8248 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8250 /* Do an unsigned shift if the operand was zero-extended. */
8252 = c_common_signed_or_unsigned_type (unsigned_arg,
8254 /* Convert value-to-be-shifted to that type. */
8255 if (TREE_TYPE (op0) != result_type)
8256 op0 = convert (result_type, op0);
8261 /* Comparison operations are shortened too but differently.
8262 They identify themselves by setting short_compare = 1. */
8266 /* Don't write &op0, etc., because that would prevent op0
8267 from being kept in a register.
8268 Instead, make copies of the our local variables and
8269 pass the copies by reference, then copy them back afterward. */
8270 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8271 enum tree_code xresultcode = resultcode;
8273 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8278 op0 = xop0, op1 = xop1;
8280 resultcode = xresultcode;
8282 if (warn_sign_compare && skip_evaluation == 0)
8284 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
8285 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
8286 int unsignedp0, unsignedp1;
8287 tree primop0 = get_narrower (op0, &unsignedp0);
8288 tree primop1 = get_narrower (op1, &unsignedp1);
8292 STRIP_TYPE_NOPS (xop0);
8293 STRIP_TYPE_NOPS (xop1);
8295 /* Give warnings for comparisons between signed and unsigned
8296 quantities that may fail.
8298 Do the checking based on the original operand trees, so that
8299 casts will be considered, but default promotions won't be.
8301 Do not warn if the comparison is being done in a signed type,
8302 since the signed type will only be chosen if it can represent
8303 all the values of the unsigned type. */
8304 if (!TYPE_UNSIGNED (result_type))
8306 /* Do not warn if both operands are the same signedness. */
8307 else if (op0_signed == op1_signed)
8315 sop = xop0, uop = xop1;
8317 sop = xop1, uop = xop0;
8319 /* Do not warn if the signed quantity is an
8320 unsuffixed integer literal (or some static
8321 constant expression involving such literals or a
8322 conditional expression involving such literals)
8323 and it is non-negative. */
8324 if (tree_expr_nonnegative_warnv_p (sop, &ovf))
8326 /* Do not warn if the comparison is an equality operation,
8327 the unsigned quantity is an integral constant, and it
8328 would fit in the result if the result were signed. */
8329 else if (TREE_CODE (uop) == INTEGER_CST
8330 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
8332 (uop, c_common_signed_type (result_type)))
8334 /* Do not warn if the unsigned quantity is an enumeration
8335 constant and its maximum value would fit in the result
8336 if the result were signed. */
8337 else if (TREE_CODE (uop) == INTEGER_CST
8338 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
8340 (TYPE_MAX_VALUE (TREE_TYPE (uop)),
8341 c_common_signed_type (result_type)))
8344 warning (0, "comparison between signed and unsigned");
8347 /* Warn if two unsigned values are being compared in a size
8348 larger than their original size, and one (and only one) is the
8349 result of a `~' operator. This comparison will always fail.
8351 Also warn if one operand is a constant, and the constant
8352 does not have all bits set that are set in the ~ operand
8353 when it is extended. */
8355 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
8356 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
8358 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
8359 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
8362 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
8365 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
8368 HOST_WIDE_INT constant, mask;
8369 int unsignedp, bits;
8371 if (host_integerp (primop0, 0))
8374 unsignedp = unsignedp1;
8375 constant = tree_low_cst (primop0, 0);
8380 unsignedp = unsignedp0;
8381 constant = tree_low_cst (primop1, 0);
8384 bits = TYPE_PRECISION (TREE_TYPE (primop));
8385 if (bits < TYPE_PRECISION (result_type)
8386 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
8388 mask = (~(HOST_WIDE_INT) 0) << bits;
8389 if ((mask & constant) != mask)
8390 warning (0, "comparison of promoted ~unsigned with constant");
8393 else if (unsignedp0 && unsignedp1
8394 && (TYPE_PRECISION (TREE_TYPE (primop0))
8395 < TYPE_PRECISION (result_type))
8396 && (TYPE_PRECISION (TREE_TYPE (primop1))
8397 < TYPE_PRECISION (result_type)))
8398 warning (0, "comparison of promoted ~unsigned with unsigned");
8404 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8405 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8406 Then the expression will be built.
8407 It will be given type FINAL_TYPE if that is nonzero;
8408 otherwise, it will be given type RESULT_TYPE. */
8412 binary_op_error (code, TREE_TYPE (op0), TREE_TYPE (op1));
8413 return error_mark_node;
8418 if (TREE_TYPE (op0) != result_type)
8419 op0 = convert_and_check (result_type, op0);
8420 if (TREE_TYPE (op1) != result_type)
8421 op1 = convert_and_check (result_type, op1);
8423 /* This can happen if one operand has a vector type, and the other
8424 has a different type. */
8425 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8426 return error_mark_node;
8429 if (build_type == NULL_TREE)
8430 build_type = result_type;
8433 /* Treat expressions in initializers specially as they can't trap. */
8434 tree result = require_constant_value ? fold_build2_initializer (resultcode,
8437 : fold_build2 (resultcode, build_type,
8440 if (final_type != 0)
8441 result = convert (final_type, result);
8447 /* Convert EXPR to be a truth-value, validating its type for this
8451 c_objc_common_truthvalue_conversion (tree expr)
8453 switch (TREE_CODE (TREE_TYPE (expr)))
8456 error ("used array that cannot be converted to pointer where scalar is required");
8457 return error_mark_node;
8460 error ("used struct type value where scalar is required");
8461 return error_mark_node;
8464 error ("used union type value where scalar is required");
8465 return error_mark_node;
8474 /* ??? Should we also give an error for void and vectors rather than
8475 leaving those to give errors later? */
8476 return c_common_truthvalue_conversion (expr);
8480 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8484 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED,
8485 bool *ti ATTRIBUTE_UNUSED, bool *se)
8487 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8489 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8490 /* Executing a compound literal inside a function reinitializes
8492 if (!TREE_STATIC (decl))
8500 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8503 c_begin_omp_parallel (void)
8508 block = c_begin_compound_stmt (true);
8514 c_finish_omp_parallel (tree clauses, tree block)
8518 block = c_end_compound_stmt (block, true);
8520 stmt = make_node (OMP_PARALLEL);
8521 TREE_TYPE (stmt) = void_type_node;
8522 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8523 OMP_PARALLEL_BODY (stmt) = block;
8525 return add_stmt (stmt);
8528 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8529 Remove any elements from the list that are invalid. */
8532 c_finish_omp_clauses (tree clauses)
8534 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8535 tree c, t, *pc = &clauses;
8538 bitmap_obstack_initialize (NULL);
8539 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8540 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8541 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8543 for (pc = &clauses, c = clauses; c ; c = *pc)
8545 bool remove = false;
8546 bool need_complete = false;
8547 bool need_implicitly_determined = false;
8549 switch (OMP_CLAUSE_CODE (c))
8551 case OMP_CLAUSE_SHARED:
8553 need_implicitly_determined = true;
8554 goto check_dup_generic;
8556 case OMP_CLAUSE_PRIVATE:
8558 need_complete = true;
8559 need_implicitly_determined = true;
8560 goto check_dup_generic;
8562 case OMP_CLAUSE_REDUCTION:
8564 need_implicitly_determined = true;
8565 t = OMP_CLAUSE_DECL (c);
8566 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8567 || POINTER_TYPE_P (TREE_TYPE (t)))
8569 error ("%qE has invalid type for %<reduction%>", t);
8572 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8574 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8575 const char *r_name = NULL;
8592 case TRUTH_ANDIF_EXPR:
8595 case TRUTH_ORIF_EXPR:
8603 error ("%qE has invalid type for %<reduction(%s)%>",
8608 goto check_dup_generic;
8610 case OMP_CLAUSE_COPYPRIVATE:
8611 name = "copyprivate";
8612 goto check_dup_generic;
8614 case OMP_CLAUSE_COPYIN:
8616 t = OMP_CLAUSE_DECL (c);
8617 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8619 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8622 goto check_dup_generic;
8625 t = OMP_CLAUSE_DECL (c);
8626 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8628 error ("%qE is not a variable in clause %qs", t, name);
8631 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8632 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8633 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8635 error ("%qE appears more than once in data clauses", t);
8639 bitmap_set_bit (&generic_head, DECL_UID (t));
8642 case OMP_CLAUSE_FIRSTPRIVATE:
8643 name = "firstprivate";
8644 t = OMP_CLAUSE_DECL (c);
8645 need_complete = true;
8646 need_implicitly_determined = true;
8647 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8649 error ("%qE is not a variable in clause %<firstprivate%>", t);
8652 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8653 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8655 error ("%qE appears more than once in data clauses", t);
8659 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8662 case OMP_CLAUSE_LASTPRIVATE:
8663 name = "lastprivate";
8664 t = OMP_CLAUSE_DECL (c);
8665 need_complete = true;
8666 need_implicitly_determined = true;
8667 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8669 error ("%qE is not a variable in clause %<lastprivate%>", t);
8672 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8673 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8675 error ("%qE appears more than once in data clauses", t);
8679 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8683 case OMP_CLAUSE_NUM_THREADS:
8684 case OMP_CLAUSE_SCHEDULE:
8685 case OMP_CLAUSE_NOWAIT:
8686 case OMP_CLAUSE_ORDERED:
8687 case OMP_CLAUSE_DEFAULT:
8688 pc = &OMP_CLAUSE_CHAIN (c);
8697 t = OMP_CLAUSE_DECL (c);
8701 t = require_complete_type (t);
8702 if (t == error_mark_node)
8706 if (need_implicitly_determined)
8708 const char *share_name = NULL;
8710 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8711 share_name = "threadprivate";
8712 else switch (c_omp_predetermined_sharing (t))
8714 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8716 case OMP_CLAUSE_DEFAULT_SHARED:
8717 share_name = "shared";
8719 case OMP_CLAUSE_DEFAULT_PRIVATE:
8720 share_name = "private";
8727 error ("%qE is predetermined %qs for %qs",
8728 t, share_name, name);
8735 *pc = OMP_CLAUSE_CHAIN (c);
8737 pc = &OMP_CLAUSE_CHAIN (c);
8740 bitmap_obstack_release (NULL);