1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
24 /* This file is part of the C front end.
25 It contains routines to build C expressions given their operands,
26 including computing the types of the result, C-specific error checks,
27 and some optimization. */
31 #include "coretypes.h"
35 #include "langhooks.h"
45 #include "tree-iterator.h"
46 #include "tree-gimple.h"
47 #include "tree-flow.h"
49 /* Possible cases of implicit bad conversions. Used to select
50 diagnostic messages in convert_for_assignment. */
59 /* The level of nesting inside "__alignof__". */
62 /* The level of nesting inside "sizeof". */
65 /* The level of nesting inside "typeof". */
68 struct c_label_context_se *label_context_stack_se;
69 struct c_label_context_vm *label_context_stack_vm;
71 /* Nonzero if we've already printed a "missing braces around initializer"
72 message within this initializer. */
73 static int missing_braces_mentioned;
75 static int require_constant_value;
76 static int require_constant_elements;
78 static bool null_pointer_constant_p (tree);
79 static tree qualify_type (tree, tree);
80 static int tagged_types_tu_compatible_p (tree, tree);
81 static int comp_target_types (tree, tree);
82 static int function_types_compatible_p (tree, tree);
83 static int type_lists_compatible_p (tree, tree);
84 static tree decl_constant_value_for_broken_optimization (tree);
85 static tree lookup_field (tree, tree);
86 static tree convert_arguments (tree, tree, tree, tree);
87 static tree pointer_diff (tree, tree);
88 static tree convert_for_assignment (tree, tree, enum impl_conv, tree, tree,
90 static tree valid_compound_expr_initializer (tree, tree);
91 static void push_string (const char *);
92 static void push_member_name (tree);
93 static int spelling_length (void);
94 static char *print_spelling (char *);
95 static void warning_init (const char *);
96 static tree digest_init (tree, tree, bool, int);
97 static void output_init_element (tree, bool, tree, tree, int);
98 static void output_pending_init_elements (int);
99 static int set_designator (int);
100 static void push_range_stack (tree);
101 static void add_pending_init (tree, tree);
102 static void set_nonincremental_init (void);
103 static void set_nonincremental_init_from_string (tree);
104 static tree find_init_member (tree);
105 static void readonly_error (tree, enum lvalue_use);
106 static int lvalue_or_else (tree, enum lvalue_use);
107 static int lvalue_p (tree);
108 static void record_maybe_used_decl (tree);
109 static int comptypes_internal (tree, tree);
111 /* Return true if EXP is a null pointer constant, false otherwise. */
114 null_pointer_constant_p (tree expr)
116 /* This should really operate on c_expr structures, but they aren't
117 yet available everywhere required. */
118 tree type = TREE_TYPE (expr);
119 return (TREE_CODE (expr) == INTEGER_CST
120 && !TREE_CONSTANT_OVERFLOW (expr)
121 && integer_zerop (expr)
122 && (INTEGRAL_TYPE_P (type)
123 || (TREE_CODE (type) == POINTER_TYPE
124 && VOID_TYPE_P (TREE_TYPE (type))
125 && TYPE_QUALS (TREE_TYPE (type)) == TYPE_UNQUALIFIED)));
127 \f/* This is a cache to hold if two types are compatible or not. */
129 struct tagged_tu_seen_cache {
130 const struct tagged_tu_seen_cache * next;
133 /* The return value of tagged_types_tu_compatible_p if we had seen
134 these two types already. */
138 static const struct tagged_tu_seen_cache * tagged_tu_seen_base;
139 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *);
141 /* Do `exp = require_complete_type (exp);' to make sure exp
142 does not have an incomplete type. (That includes void types.) */
145 require_complete_type (tree value)
147 tree type = TREE_TYPE (value);
149 if (value == error_mark_node || type == error_mark_node)
150 return error_mark_node;
152 /* First, detect a valid value with a complete type. */
153 if (COMPLETE_TYPE_P (type))
156 c_incomplete_type_error (value, type);
157 return error_mark_node;
160 /* Print an error message for invalid use of an incomplete type.
161 VALUE is the expression that was used (or 0 if that isn't known)
162 and TYPE is the type that was invalid. */
165 c_incomplete_type_error (tree value, tree type)
167 const char *type_code_string;
169 /* Avoid duplicate error message. */
170 if (TREE_CODE (type) == ERROR_MARK)
173 if (value != 0 && (TREE_CODE (value) == VAR_DECL
174 || TREE_CODE (value) == PARM_DECL))
175 error ("%qD has an incomplete type", value);
179 /* We must print an error message. Be clever about what it says. */
181 switch (TREE_CODE (type))
184 type_code_string = "struct";
188 type_code_string = "union";
192 type_code_string = "enum";
196 error ("invalid use of void expression");
200 if (TYPE_DOMAIN (type))
202 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
204 error ("invalid use of flexible array member");
207 type = TREE_TYPE (type);
210 error ("invalid use of array with unspecified bounds");
217 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
218 error ("invalid use of undefined type %<%s %E%>",
219 type_code_string, TYPE_NAME (type));
221 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
222 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type));
226 /* Given a type, apply default promotions wrt unnamed function
227 arguments and return the new type. */
230 c_type_promotes_to (tree type)
232 if (TYPE_MAIN_VARIANT (type) == float_type_node)
233 return double_type_node;
235 if (c_promoting_integer_type_p (type))
237 /* Preserve unsignedness if not really getting any wider. */
238 if (TYPE_UNSIGNED (type)
239 && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
240 return unsigned_type_node;
241 return integer_type_node;
247 /* Return a variant of TYPE which has all the type qualifiers of LIKE
248 as well as those of TYPE. */
251 qualify_type (tree type, tree like)
253 return c_build_qualified_type (type,
254 TYPE_QUALS (type) | TYPE_QUALS (like));
257 /* Return true iff the given tree T is a variable length array. */
260 c_vla_type_p (tree t)
262 if (TREE_CODE (t) == ARRAY_TYPE
263 && C_TYPE_VARIABLE_SIZE (t))
268 /* Return the composite type of two compatible types.
270 We assume that comptypes has already been done and returned
271 nonzero; if that isn't so, this may crash. In particular, we
272 assume that qualifiers match. */
275 composite_type (tree t1, tree t2)
277 enum tree_code code1;
278 enum tree_code code2;
281 /* Save time if the two types are the same. */
283 if (t1 == t2) return t1;
285 /* If one type is nonsense, use the other. */
286 if (t1 == error_mark_node)
288 if (t2 == error_mark_node)
291 code1 = TREE_CODE (t1);
292 code2 = TREE_CODE (t2);
294 /* Merge the attributes. */
295 attributes = targetm.merge_type_attributes (t1, t2);
297 /* If one is an enumerated type and the other is the compatible
298 integer type, the composite type might be either of the two
299 (DR#013 question 3). For consistency, use the enumerated type as
300 the composite type. */
302 if (code1 == ENUMERAL_TYPE && code2 == INTEGER_TYPE)
304 if (code2 == ENUMERAL_TYPE && code1 == INTEGER_TYPE)
307 gcc_assert (code1 == code2);
312 /* For two pointers, do this recursively on the target type. */
314 tree pointed_to_1 = TREE_TYPE (t1);
315 tree pointed_to_2 = TREE_TYPE (t2);
316 tree target = composite_type (pointed_to_1, pointed_to_2);
317 t1 = build_pointer_type (target);
318 t1 = build_type_attribute_variant (t1, attributes);
319 return qualify_type (t1, t2);
324 tree elt = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
327 tree d1 = TYPE_DOMAIN (t1);
328 tree d2 = TYPE_DOMAIN (t2);
329 bool d1_variable, d2_variable;
330 bool d1_zero, d2_zero;
332 /* We should not have any type quals on arrays at all. */
333 gcc_assert (!TYPE_QUALS (t1) && !TYPE_QUALS (t2));
335 d1_zero = d1 == 0 || !TYPE_MAX_VALUE (d1);
336 d2_zero = d2 == 0 || !TYPE_MAX_VALUE (d2);
338 d1_variable = (!d1_zero
339 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
340 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
341 d2_variable = (!d2_zero
342 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
343 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
344 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
345 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
347 /* Save space: see if the result is identical to one of the args. */
348 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)
349 && (d2_variable || d2_zero || !d1_variable))
350 return build_type_attribute_variant (t1, attributes);
351 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)
352 && (d1_variable || d1_zero || !d2_variable))
353 return build_type_attribute_variant (t2, attributes);
355 if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
356 return build_type_attribute_variant (t1, attributes);
357 if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
358 return build_type_attribute_variant (t2, attributes);
360 /* Merge the element types, and have a size if either arg has
361 one. We may have qualifiers on the element types. To set
362 up TYPE_MAIN_VARIANT correctly, we need to form the
363 composite of the unqualified types and add the qualifiers
365 quals = TYPE_QUALS (strip_array_types (elt));
366 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
367 t1 = build_array_type (unqual_elt,
368 TYPE_DOMAIN ((TYPE_DOMAIN (t1)
374 t1 = c_build_qualified_type (t1, quals);
375 return build_type_attribute_variant (t1, attributes);
379 /* Function types: prefer the one that specified arg types.
380 If both do, merge the arg types. Also merge the return types. */
382 tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
383 tree p1 = TYPE_ARG_TYPES (t1);
384 tree p2 = TYPE_ARG_TYPES (t2);
389 /* Save space: see if the result is identical to one of the args. */
390 if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
391 return build_type_attribute_variant (t1, attributes);
392 if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
393 return build_type_attribute_variant (t2, attributes);
395 /* Simple way if one arg fails to specify argument types. */
396 if (TYPE_ARG_TYPES (t1) == 0)
398 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
399 t1 = build_type_attribute_variant (t1, attributes);
400 return qualify_type (t1, t2);
402 if (TYPE_ARG_TYPES (t2) == 0)
404 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
405 t1 = build_type_attribute_variant (t1, attributes);
406 return qualify_type (t1, t2);
409 /* If both args specify argument types, we must merge the two
410 lists, argument by argument. */
411 /* Tell global_bindings_p to return false so that variable_size
412 doesn't die on VLAs in parameter types. */
413 c_override_global_bindings_to_false = true;
415 len = list_length (p1);
418 for (i = 0; i < len; i++)
419 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
424 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
426 /* A null type means arg type is not specified.
427 Take whatever the other function type has. */
428 if (TREE_VALUE (p1) == 0)
430 TREE_VALUE (n) = TREE_VALUE (p2);
433 if (TREE_VALUE (p2) == 0)
435 TREE_VALUE (n) = TREE_VALUE (p1);
439 /* Given wait (union {union wait *u; int *i} *)
440 and wait (union wait *),
441 prefer union wait * as type of parm. */
442 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
443 && TREE_VALUE (p1) != TREE_VALUE (p2))
446 tree mv2 = TREE_VALUE (p2);
447 if (mv2 && mv2 != error_mark_node
448 && TREE_CODE (mv2) != ARRAY_TYPE)
449 mv2 = TYPE_MAIN_VARIANT (mv2);
450 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
451 memb; memb = TREE_CHAIN (memb))
453 tree mv3 = TREE_TYPE (memb);
454 if (mv3 && mv3 != error_mark_node
455 && TREE_CODE (mv3) != ARRAY_TYPE)
456 mv3 = TYPE_MAIN_VARIANT (mv3);
457 if (comptypes (mv3, mv2))
459 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
462 pedwarn ("function types not truly compatible in ISO C");
467 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
468 && TREE_VALUE (p2) != TREE_VALUE (p1))
471 tree mv1 = TREE_VALUE (p1);
472 if (mv1 && mv1 != error_mark_node
473 && TREE_CODE (mv1) != ARRAY_TYPE)
474 mv1 = TYPE_MAIN_VARIANT (mv1);
475 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
476 memb; memb = TREE_CHAIN (memb))
478 tree mv3 = TREE_TYPE (memb);
479 if (mv3 && mv3 != error_mark_node
480 && TREE_CODE (mv3) != ARRAY_TYPE)
481 mv3 = TYPE_MAIN_VARIANT (mv3);
482 if (comptypes (mv3, mv1))
484 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
487 pedwarn ("function types not truly compatible in ISO C");
492 TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
496 c_override_global_bindings_to_false = false;
497 t1 = build_function_type (valtype, newargs);
498 t1 = qualify_type (t1, t2);
499 /* ... falls through ... */
503 return build_type_attribute_variant (t1, attributes);
508 /* Return the type of a conditional expression between pointers to
509 possibly differently qualified versions of compatible types.
511 We assume that comp_target_types has already been done and returned
512 nonzero; if that isn't so, this may crash. */
515 common_pointer_type (tree t1, tree t2)
518 tree pointed_to_1, mv1;
519 tree pointed_to_2, mv2;
522 /* Save time if the two types are the same. */
524 if (t1 == t2) return t1;
526 /* If one type is nonsense, use the other. */
527 if (t1 == error_mark_node)
529 if (t2 == error_mark_node)
532 gcc_assert (TREE_CODE (t1) == POINTER_TYPE
533 && TREE_CODE (t2) == POINTER_TYPE);
535 /* Merge the attributes. */
536 attributes = targetm.merge_type_attributes (t1, t2);
538 /* Find the composite type of the target types, and combine the
539 qualifiers of the two types' targets. Do not lose qualifiers on
540 array element types by taking the TYPE_MAIN_VARIANT. */
541 mv1 = pointed_to_1 = TREE_TYPE (t1);
542 mv2 = pointed_to_2 = TREE_TYPE (t2);
543 if (TREE_CODE (mv1) != ARRAY_TYPE)
544 mv1 = TYPE_MAIN_VARIANT (pointed_to_1);
545 if (TREE_CODE (mv2) != ARRAY_TYPE)
546 mv2 = TYPE_MAIN_VARIANT (pointed_to_2);
547 target = composite_type (mv1, mv2);
548 t1 = build_pointer_type (c_build_qualified_type
550 TYPE_QUALS (pointed_to_1) |
551 TYPE_QUALS (pointed_to_2)));
552 return build_type_attribute_variant (t1, attributes);
555 /* Return the common type for two arithmetic types under the usual
556 arithmetic conversions. The default conversions have already been
557 applied, and enumerated types converted to their compatible integer
558 types. The resulting type is unqualified and has no attributes.
560 This is the type for the result of most arithmetic operations
561 if the operands have the given two types. */
564 c_common_type (tree t1, tree t2)
566 enum tree_code code1;
567 enum tree_code code2;
569 /* If one type is nonsense, use the other. */
570 if (t1 == error_mark_node)
572 if (t2 == error_mark_node)
575 if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
576 t1 = TYPE_MAIN_VARIANT (t1);
578 if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
579 t2 = TYPE_MAIN_VARIANT (t2);
581 if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
582 t1 = build_type_attribute_variant (t1, NULL_TREE);
584 if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
585 t2 = build_type_attribute_variant (t2, NULL_TREE);
587 /* Save time if the two types are the same. */
589 if (t1 == t2) return t1;
591 code1 = TREE_CODE (t1);
592 code2 = TREE_CODE (t2);
594 gcc_assert (code1 == VECTOR_TYPE || code1 == COMPLEX_TYPE
595 || code1 == REAL_TYPE || code1 == INTEGER_TYPE);
596 gcc_assert (code2 == VECTOR_TYPE || code2 == COMPLEX_TYPE
597 || code2 == REAL_TYPE || code2 == INTEGER_TYPE);
599 /* When one operand is a decimal float type, the other operand cannot be
600 a generic float type or a complex type. We also disallow vector types
602 if ((DECIMAL_FLOAT_TYPE_P (t1) || DECIMAL_FLOAT_TYPE_P (t2))
603 && !(DECIMAL_FLOAT_TYPE_P (t1) && DECIMAL_FLOAT_TYPE_P (t2)))
605 if (code1 == VECTOR_TYPE || code2 == VECTOR_TYPE)
607 error ("can%'t mix operands of decimal float and vector types");
608 return error_mark_node;
610 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
612 error ("can%'t mix operands of decimal float and complex types");
613 return error_mark_node;
615 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
617 error ("can%'t mix operands of decimal float and other float types");
618 return error_mark_node;
622 /* If one type is a vector type, return that type. (How the usual
623 arithmetic conversions apply to the vector types extension is not
624 precisely specified.) */
625 if (code1 == VECTOR_TYPE)
628 if (code2 == VECTOR_TYPE)
631 /* If one type is complex, form the common type of the non-complex
632 components, then make that complex. Use T1 or T2 if it is the
634 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
636 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
637 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
638 tree subtype = c_common_type (subtype1, subtype2);
640 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
642 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
645 return build_complex_type (subtype);
648 /* If only one is real, use it as the result. */
650 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
653 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
656 /* If both are real and either are decimal floating point types, use
657 the decimal floating point type with the greater precision. */
659 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
661 if (TYPE_MAIN_VARIANT (t1) == dfloat128_type_node
662 || TYPE_MAIN_VARIANT (t2) == dfloat128_type_node)
663 return dfloat128_type_node;
664 else if (TYPE_MAIN_VARIANT (t1) == dfloat64_type_node
665 || TYPE_MAIN_VARIANT (t2) == dfloat64_type_node)
666 return dfloat64_type_node;
667 else if (TYPE_MAIN_VARIANT (t1) == dfloat32_type_node
668 || TYPE_MAIN_VARIANT (t2) == dfloat32_type_node)
669 return dfloat32_type_node;
672 /* Both real or both integers; use the one with greater precision. */
674 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
676 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
679 /* Same precision. Prefer long longs to longs to ints when the
680 same precision, following the C99 rules on integer type rank
681 (which are equivalent to the C90 rules for C90 types). */
683 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
684 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
685 return long_long_unsigned_type_node;
687 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
688 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
690 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
691 return long_long_unsigned_type_node;
693 return long_long_integer_type_node;
696 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
697 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
698 return long_unsigned_type_node;
700 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
701 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
703 /* But preserve unsignedness from the other type,
704 since long cannot hold all the values of an unsigned int. */
705 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
706 return long_unsigned_type_node;
708 return long_integer_type_node;
711 /* Likewise, prefer long double to double even if same size. */
712 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
713 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
714 return long_double_type_node;
716 /* Otherwise prefer the unsigned one. */
718 if (TYPE_UNSIGNED (t1))
724 /* Wrapper around c_common_type that is used by c-common.c and other
725 front end optimizations that remove promotions. ENUMERAL_TYPEs
726 are allowed here and are converted to their compatible integer types.
727 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
728 preferably a non-Boolean type as the common type. */
730 common_type (tree t1, tree t2)
732 if (TREE_CODE (t1) == ENUMERAL_TYPE)
733 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
734 if (TREE_CODE (t2) == ENUMERAL_TYPE)
735 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
737 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
738 if (TREE_CODE (t1) == BOOLEAN_TYPE
739 && TREE_CODE (t2) == BOOLEAN_TYPE)
740 return boolean_type_node;
742 /* If either type is BOOLEAN_TYPE, then return the other. */
743 if (TREE_CODE (t1) == BOOLEAN_TYPE)
745 if (TREE_CODE (t2) == BOOLEAN_TYPE)
748 return c_common_type (t1, t2);
751 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
752 or various other operations. Return 2 if they are compatible
753 but a warning may be needed if you use them together. */
756 comptypes (tree type1, tree type2)
758 const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
761 val = comptypes_internal (type1, type2);
762 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
767 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
768 or various other operations. Return 2 if they are compatible
769 but a warning may be needed if you use them together. This
770 differs from comptypes, in that we don't free the seen types. */
773 comptypes_internal (tree type1, tree type2)
779 /* Suppress errors caused by previously reported errors. */
781 if (t1 == t2 || !t1 || !t2
782 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
785 /* If either type is the internal version of sizetype, return the
787 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
788 && TYPE_ORIG_SIZE_TYPE (t1))
789 t1 = TYPE_ORIG_SIZE_TYPE (t1);
791 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
792 && TYPE_ORIG_SIZE_TYPE (t2))
793 t2 = TYPE_ORIG_SIZE_TYPE (t2);
796 /* Enumerated types are compatible with integer types, but this is
797 not transitive: two enumerated types in the same translation unit
798 are compatible with each other only if they are the same type. */
800 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
801 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
802 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
803 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
808 /* Different classes of types can't be compatible. */
810 if (TREE_CODE (t1) != TREE_CODE (t2))
813 /* Qualifiers must match. C99 6.7.3p9 */
815 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
818 /* Allow for two different type nodes which have essentially the same
819 definition. Note that we already checked for equality of the type
820 qualifiers (just above). */
822 if (TREE_CODE (t1) != ARRAY_TYPE
823 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
826 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
827 if (!(attrval = targetm.comp_type_attributes (t1, t2)))
830 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
833 switch (TREE_CODE (t1))
836 /* Do not remove mode or aliasing information. */
837 if (TYPE_MODE (t1) != TYPE_MODE (t2)
838 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
840 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
841 ? 1 : comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2)));
845 val = function_types_compatible_p (t1, t2);
850 tree d1 = TYPE_DOMAIN (t1);
851 tree d2 = TYPE_DOMAIN (t2);
852 bool d1_variable, d2_variable;
853 bool d1_zero, d2_zero;
856 /* Target types must match incl. qualifiers. */
857 if (TREE_TYPE (t1) != TREE_TYPE (t2)
858 && 0 == (val = comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2))))
861 /* Sizes must match unless one is missing or variable. */
862 if (d1 == 0 || d2 == 0 || d1 == d2)
865 d1_zero = !TYPE_MAX_VALUE (d1);
866 d2_zero = !TYPE_MAX_VALUE (d2);
868 d1_variable = (!d1_zero
869 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
870 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
871 d2_variable = (!d2_zero
872 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
873 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
874 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
875 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
877 if (d1_variable || d2_variable)
879 if (d1_zero && d2_zero)
881 if (d1_zero || d2_zero
882 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
883 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
892 if (val != 1 && !same_translation_unit_p (t1, t2))
895 return tagged_types_tu_compatible_p (t1, t2);
896 val = tagged_types_tu_compatible_p (t1, t2);
901 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
902 && comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2));
908 return attrval == 2 && val == 1 ? 2 : val;
911 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
912 ignoring their qualifiers. */
915 comp_target_types (tree ttl, tree ttr)
920 /* Do not lose qualifiers on element types of array types that are
921 pointer targets by taking their TYPE_MAIN_VARIANT. */
922 mvl = TREE_TYPE (ttl);
923 mvr = TREE_TYPE (ttr);
924 if (TREE_CODE (mvl) != ARRAY_TYPE)
925 mvl = TYPE_MAIN_VARIANT (mvl);
926 if (TREE_CODE (mvr) != ARRAY_TYPE)
927 mvr = TYPE_MAIN_VARIANT (mvr);
928 val = comptypes (mvl, mvr);
930 if (val == 2 && pedantic)
931 pedwarn ("types are not quite compatible");
935 /* Subroutines of `comptypes'. */
937 /* Determine whether two trees derive from the same translation unit.
938 If the CONTEXT chain ends in a null, that tree's context is still
939 being parsed, so if two trees have context chains ending in null,
940 they're in the same translation unit. */
942 same_translation_unit_p (tree t1, tree t2)
944 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
945 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
947 case tcc_declaration:
948 t1 = DECL_CONTEXT (t1); break;
950 t1 = TYPE_CONTEXT (t1); break;
951 case tcc_exceptional:
952 t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
953 default: gcc_unreachable ();
956 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
957 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
959 case tcc_declaration:
960 t2 = DECL_CONTEXT (t2); break;
962 t2 = TYPE_CONTEXT (t2); break;
963 case tcc_exceptional:
964 t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
965 default: gcc_unreachable ();
971 /* Allocate the seen two types, assuming that they are compatible. */
973 static struct tagged_tu_seen_cache *
974 alloc_tagged_tu_seen_cache (tree t1, tree t2)
976 struct tagged_tu_seen_cache *tu = XNEW (struct tagged_tu_seen_cache);
977 tu->next = tagged_tu_seen_base;
981 tagged_tu_seen_base = tu;
983 /* The C standard says that two structures in different translation
984 units are compatible with each other only if the types of their
985 fields are compatible (among other things). We assume that they
986 are compatible until proven otherwise when building the cache.
987 An example where this can occur is:
992 If we are comparing this against a similar struct in another TU,
993 and did not assume they were compatible, we end up with an infinite
999 /* Free the seen types until we get to TU_TIL. */
1002 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *tu_til)
1004 const struct tagged_tu_seen_cache *tu = tagged_tu_seen_base;
1005 while (tu != tu_til)
1007 struct tagged_tu_seen_cache *tu1 = (struct tagged_tu_seen_cache*)tu;
1011 tagged_tu_seen_base = tu_til;
1014 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1015 compatible. If the two types are not the same (which has been
1016 checked earlier), this can only happen when multiple translation
1017 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1021 tagged_types_tu_compatible_p (tree t1, tree t2)
1024 bool needs_warning = false;
1026 /* We have to verify that the tags of the types are the same. This
1027 is harder than it looks because this may be a typedef, so we have
1028 to go look at the original type. It may even be a typedef of a
1030 In the case of compiler-created builtin structs the TYPE_DECL
1031 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1032 while (TYPE_NAME (t1)
1033 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
1034 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
1035 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
1037 while (TYPE_NAME (t2)
1038 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
1039 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
1040 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
1042 /* C90 didn't have the requirement that the two tags be the same. */
1043 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
1046 /* C90 didn't say what happened if one or both of the types were
1047 incomplete; we choose to follow C99 rules here, which is that they
1049 if (TYPE_SIZE (t1) == NULL
1050 || TYPE_SIZE (t2) == NULL)
1054 const struct tagged_tu_seen_cache * tts_i;
1055 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
1056 if (tts_i->t1 == t1 && tts_i->t2 == t2)
1060 switch (TREE_CODE (t1))
1064 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1065 /* Speed up the case where the type values are in the same order. */
1066 tree tv1 = TYPE_VALUES (t1);
1067 tree tv2 = TYPE_VALUES (t2);
1074 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
1076 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
1078 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
1085 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
1089 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
1095 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
1101 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
1103 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
1105 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
1116 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1117 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
1123 /* Speed up the common case where the fields are in the same order. */
1124 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2); s1 && s2;
1125 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1130 if (DECL_NAME (s1) == NULL
1131 || DECL_NAME (s1) != DECL_NAME (s2))
1133 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1140 needs_warning = true;
1142 if (TREE_CODE (s1) == FIELD_DECL
1143 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1144 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1152 tu->val = needs_warning ? 2 : 1;
1156 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
1160 if (DECL_NAME (s1) != NULL)
1161 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
1162 if (DECL_NAME (s1) == DECL_NAME (s2))
1165 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1172 needs_warning = true;
1174 if (TREE_CODE (s1) == FIELD_DECL
1175 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1176 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1188 tu->val = needs_warning ? 2 : 10;
1194 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1196 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
1198 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1201 if (TREE_CODE (s1) != TREE_CODE (s2)
1202 || DECL_NAME (s1) != DECL_NAME (s2))
1204 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1208 needs_warning = true;
1210 if (TREE_CODE (s1) == FIELD_DECL
1211 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1212 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1218 tu->val = needs_warning ? 2 : 1;
1227 /* Return 1 if two function types F1 and F2 are compatible.
1228 If either type specifies no argument types,
1229 the other must specify a fixed number of self-promoting arg types.
1230 Otherwise, if one type specifies only the number of arguments,
1231 the other must specify that number of self-promoting arg types.
1232 Otherwise, the argument types must match. */
1235 function_types_compatible_p (tree f1, tree f2)
1238 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1243 ret1 = TREE_TYPE (f1);
1244 ret2 = TREE_TYPE (f2);
1246 /* 'volatile' qualifiers on a function's return type used to mean
1247 the function is noreturn. */
1248 if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1249 pedwarn ("function return types not compatible due to %<volatile%>");
1250 if (TYPE_VOLATILE (ret1))
1251 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1252 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1253 if (TYPE_VOLATILE (ret2))
1254 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1255 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1256 val = comptypes_internal (ret1, ret2);
1260 args1 = TYPE_ARG_TYPES (f1);
1261 args2 = TYPE_ARG_TYPES (f2);
1263 /* An unspecified parmlist matches any specified parmlist
1264 whose argument types don't need default promotions. */
1268 if (!self_promoting_args_p (args2))
1270 /* If one of these types comes from a non-prototype fn definition,
1271 compare that with the other type's arglist.
1272 If they don't match, ask for a warning (but no error). */
1273 if (TYPE_ACTUAL_ARG_TYPES (f1)
1274 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
1280 if (!self_promoting_args_p (args1))
1282 if (TYPE_ACTUAL_ARG_TYPES (f2)
1283 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1288 /* Both types have argument lists: compare them and propagate results. */
1289 val1 = type_lists_compatible_p (args1, args2);
1290 return val1 != 1 ? val1 : val;
1293 /* Check two lists of types for compatibility,
1294 returning 0 for incompatible, 1 for compatible,
1295 or 2 for compatible with warning. */
1298 type_lists_compatible_p (tree args1, tree args2)
1300 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1306 tree a1, mv1, a2, mv2;
1307 if (args1 == 0 && args2 == 0)
1309 /* If one list is shorter than the other,
1310 they fail to match. */
1311 if (args1 == 0 || args2 == 0)
1313 mv1 = a1 = TREE_VALUE (args1);
1314 mv2 = a2 = TREE_VALUE (args2);
1315 if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1316 mv1 = TYPE_MAIN_VARIANT (mv1);
1317 if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1318 mv2 = TYPE_MAIN_VARIANT (mv2);
1319 /* A null pointer instead of a type
1320 means there is supposed to be an argument
1321 but nothing is specified about what type it has.
1322 So match anything that self-promotes. */
1325 if (c_type_promotes_to (a2) != a2)
1330 if (c_type_promotes_to (a1) != a1)
1333 /* If one of the lists has an error marker, ignore this arg. */
1334 else if (TREE_CODE (a1) == ERROR_MARK
1335 || TREE_CODE (a2) == ERROR_MARK)
1337 else if (!(newval = comptypes_internal (mv1, mv2)))
1339 /* Allow wait (union {union wait *u; int *i} *)
1340 and wait (union wait *) to be compatible. */
1341 if (TREE_CODE (a1) == UNION_TYPE
1342 && (TYPE_NAME (a1) == 0
1343 || TYPE_TRANSPARENT_UNION (a1))
1344 && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1345 && tree_int_cst_equal (TYPE_SIZE (a1),
1349 for (memb = TYPE_FIELDS (a1);
1350 memb; memb = TREE_CHAIN (memb))
1352 tree mv3 = TREE_TYPE (memb);
1353 if (mv3 && mv3 != error_mark_node
1354 && TREE_CODE (mv3) != ARRAY_TYPE)
1355 mv3 = TYPE_MAIN_VARIANT (mv3);
1356 if (comptypes_internal (mv3, mv2))
1362 else if (TREE_CODE (a2) == UNION_TYPE
1363 && (TYPE_NAME (a2) == 0
1364 || TYPE_TRANSPARENT_UNION (a2))
1365 && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1366 && tree_int_cst_equal (TYPE_SIZE (a2),
1370 for (memb = TYPE_FIELDS (a2);
1371 memb; memb = TREE_CHAIN (memb))
1373 tree mv3 = TREE_TYPE (memb);
1374 if (mv3 && mv3 != error_mark_node
1375 && TREE_CODE (mv3) != ARRAY_TYPE)
1376 mv3 = TYPE_MAIN_VARIANT (mv3);
1377 if (comptypes_internal (mv3, mv1))
1387 /* comptypes said ok, but record if it said to warn. */
1391 args1 = TREE_CHAIN (args1);
1392 args2 = TREE_CHAIN (args2);
1396 /* Compute the size to increment a pointer by. */
1399 c_size_in_bytes (tree type)
1401 enum tree_code code = TREE_CODE (type);
1403 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1404 return size_one_node;
1406 if (!COMPLETE_OR_VOID_TYPE_P (type))
1408 error ("arithmetic on pointer to an incomplete type");
1409 return size_one_node;
1412 /* Convert in case a char is more than one unit. */
1413 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1414 size_int (TYPE_PRECISION (char_type_node)
1418 /* Return either DECL or its known constant value (if it has one). */
1421 decl_constant_value (tree decl)
1423 if (/* Don't change a variable array bound or initial value to a constant
1424 in a place where a variable is invalid. Note that DECL_INITIAL
1425 isn't valid for a PARM_DECL. */
1426 current_function_decl != 0
1427 && TREE_CODE (decl) != PARM_DECL
1428 && !TREE_THIS_VOLATILE (decl)
1429 && TREE_READONLY (decl)
1430 && DECL_INITIAL (decl) != 0
1431 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1432 /* This is invalid if initial value is not constant.
1433 If it has either a function call, a memory reference,
1434 or a variable, then re-evaluating it could give different results. */
1435 && TREE_CONSTANT (DECL_INITIAL (decl))
1436 /* Check for cases where this is sub-optimal, even though valid. */
1437 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1438 return DECL_INITIAL (decl);
1442 /* Return either DECL or its known constant value (if it has one), but
1443 return DECL if pedantic or DECL has mode BLKmode. This is for
1444 bug-compatibility with the old behavior of decl_constant_value
1445 (before GCC 3.0); every use of this function is a bug and it should
1446 be removed before GCC 3.1. It is not appropriate to use pedantic
1447 in a way that affects optimization, and BLKmode is probably not the
1448 right test for avoiding misoptimizations either. */
1451 decl_constant_value_for_broken_optimization (tree decl)
1455 if (pedantic || DECL_MODE (decl) == BLKmode)
1458 ret = decl_constant_value (decl);
1459 /* Avoid unwanted tree sharing between the initializer and current
1460 function's body where the tree can be modified e.g. by the
1462 if (ret != decl && TREE_STATIC (decl))
1463 ret = unshare_expr (ret);
1467 /* Convert the array expression EXP to a pointer. */
1469 array_to_pointer_conversion (tree exp)
1471 tree orig_exp = exp;
1472 tree type = TREE_TYPE (exp);
1474 tree restype = TREE_TYPE (type);
1477 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1479 STRIP_TYPE_NOPS (exp);
1481 if (TREE_NO_WARNING (orig_exp))
1482 TREE_NO_WARNING (exp) = 1;
1484 ptrtype = build_pointer_type (restype);
1486 if (TREE_CODE (exp) == INDIRECT_REF)
1487 return convert (ptrtype, TREE_OPERAND (exp, 0));
1489 if (TREE_CODE (exp) == VAR_DECL)
1491 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1492 ADDR_EXPR because it's the best way of representing what
1493 happens in C when we take the address of an array and place
1494 it in a pointer to the element type. */
1495 adr = build1 (ADDR_EXPR, ptrtype, exp);
1496 if (!c_mark_addressable (exp))
1497 return error_mark_node;
1498 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1502 /* This way is better for a COMPONENT_REF since it can
1503 simplify the offset for a component. */
1504 adr = build_unary_op (ADDR_EXPR, exp, 1);
1505 return convert (ptrtype, adr);
1508 /* Convert the function expression EXP to a pointer. */
1510 function_to_pointer_conversion (tree exp)
1512 tree orig_exp = exp;
1514 gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1516 STRIP_TYPE_NOPS (exp);
1518 if (TREE_NO_WARNING (orig_exp))
1519 TREE_NO_WARNING (exp) = 1;
1521 return build_unary_op (ADDR_EXPR, exp, 0);
1524 /* Perform the default conversion of arrays and functions to pointers.
1525 Return the result of converting EXP. For any other expression, just
1526 return EXP after removing NOPs. */
1529 default_function_array_conversion (struct c_expr exp)
1531 tree orig_exp = exp.value;
1532 tree type = TREE_TYPE (exp.value);
1533 enum tree_code code = TREE_CODE (type);
1539 bool not_lvalue = false;
1540 bool lvalue_array_p;
1542 while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1543 || TREE_CODE (exp.value) == NOP_EXPR
1544 || TREE_CODE (exp.value) == CONVERT_EXPR)
1545 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1547 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1549 exp.value = TREE_OPERAND (exp.value, 0);
1552 if (TREE_NO_WARNING (orig_exp))
1553 TREE_NO_WARNING (exp.value) = 1;
1555 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1556 if (!flag_isoc99 && !lvalue_array_p)
1558 /* Before C99, non-lvalue arrays do not decay to pointers.
1559 Normally, using such an array would be invalid; but it can
1560 be used correctly inside sizeof or as a statement expression.
1561 Thus, do not give an error here; an error will result later. */
1565 exp.value = array_to_pointer_conversion (exp.value);
1569 exp.value = function_to_pointer_conversion (exp.value);
1572 STRIP_TYPE_NOPS (exp.value);
1573 if (TREE_NO_WARNING (orig_exp))
1574 TREE_NO_WARNING (exp.value) = 1;
1582 /* EXP is an expression of integer type. Apply the integer promotions
1583 to it and return the promoted value. */
1586 perform_integral_promotions (tree exp)
1588 tree type = TREE_TYPE (exp);
1589 enum tree_code code = TREE_CODE (type);
1591 gcc_assert (INTEGRAL_TYPE_P (type));
1593 /* Normally convert enums to int,
1594 but convert wide enums to something wider. */
1595 if (code == ENUMERAL_TYPE)
1597 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1598 TYPE_PRECISION (integer_type_node)),
1599 ((TYPE_PRECISION (type)
1600 >= TYPE_PRECISION (integer_type_node))
1601 && TYPE_UNSIGNED (type)));
1603 return convert (type, exp);
1606 /* ??? This should no longer be needed now bit-fields have their
1608 if (TREE_CODE (exp) == COMPONENT_REF
1609 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1610 /* If it's thinner than an int, promote it like a
1611 c_promoting_integer_type_p, otherwise leave it alone. */
1612 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1613 TYPE_PRECISION (integer_type_node)))
1614 return convert (integer_type_node, exp);
1616 if (c_promoting_integer_type_p (type))
1618 /* Preserve unsignedness if not really getting any wider. */
1619 if (TYPE_UNSIGNED (type)
1620 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1621 return convert (unsigned_type_node, exp);
1623 return convert (integer_type_node, exp);
1630 /* Perform default promotions for C data used in expressions.
1631 Enumeral types or short or char are converted to int.
1632 In addition, manifest constants symbols are replaced by their values. */
1635 default_conversion (tree exp)
1638 tree type = TREE_TYPE (exp);
1639 enum tree_code code = TREE_CODE (type);
1641 /* Functions and arrays have been converted during parsing. */
1642 gcc_assert (code != FUNCTION_TYPE);
1643 if (code == ARRAY_TYPE)
1646 /* Constants can be used directly unless they're not loadable. */
1647 if (TREE_CODE (exp) == CONST_DECL)
1648 exp = DECL_INITIAL (exp);
1650 /* Replace a nonvolatile const static variable with its value unless
1651 it is an array, in which case we must be sure that taking the
1652 address of the array produces consistent results. */
1653 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1655 exp = decl_constant_value_for_broken_optimization (exp);
1656 type = TREE_TYPE (exp);
1659 /* Strip no-op conversions. */
1661 STRIP_TYPE_NOPS (exp);
1663 if (TREE_NO_WARNING (orig_exp))
1664 TREE_NO_WARNING (exp) = 1;
1666 if (INTEGRAL_TYPE_P (type))
1667 return perform_integral_promotions (exp);
1669 if (code == VOID_TYPE)
1671 error ("void value not ignored as it ought to be");
1672 return error_mark_node;
1677 /* Look up COMPONENT in a structure or union DECL.
1679 If the component name is not found, returns NULL_TREE. Otherwise,
1680 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1681 stepping down the chain to the component, which is in the last
1682 TREE_VALUE of the list. Normally the list is of length one, but if
1683 the component is embedded within (nested) anonymous structures or
1684 unions, the list steps down the chain to the component. */
1687 lookup_field (tree decl, tree component)
1689 tree type = TREE_TYPE (decl);
1692 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1693 to the field elements. Use a binary search on this array to quickly
1694 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1695 will always be set for structures which have many elements. */
1697 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1700 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1702 field = TYPE_FIELDS (type);
1704 top = TYPE_LANG_SPECIFIC (type)->s->len;
1705 while (top - bot > 1)
1707 half = (top - bot + 1) >> 1;
1708 field = field_array[bot+half];
1710 if (DECL_NAME (field) == NULL_TREE)
1712 /* Step through all anon unions in linear fashion. */
1713 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1715 field = field_array[bot++];
1716 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1717 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1719 tree anon = lookup_field (field, component);
1722 return tree_cons (NULL_TREE, field, anon);
1726 /* Entire record is only anon unions. */
1730 /* Restart the binary search, with new lower bound. */
1734 if (DECL_NAME (field) == component)
1736 if (DECL_NAME (field) < component)
1742 if (DECL_NAME (field_array[bot]) == component)
1743 field = field_array[bot];
1744 else if (DECL_NAME (field) != component)
1749 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1751 if (DECL_NAME (field) == NULL_TREE
1752 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1753 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1755 tree anon = lookup_field (field, component);
1758 return tree_cons (NULL_TREE, field, anon);
1761 if (DECL_NAME (field) == component)
1765 if (field == NULL_TREE)
1769 return tree_cons (NULL_TREE, field, NULL_TREE);
1772 /* Make an expression to refer to the COMPONENT field of
1773 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1776 build_component_ref (tree datum, tree component)
1778 tree type = TREE_TYPE (datum);
1779 enum tree_code code = TREE_CODE (type);
1783 if (!objc_is_public (datum, component))
1784 return error_mark_node;
1786 /* See if there is a field or component with name COMPONENT. */
1788 if (code == RECORD_TYPE || code == UNION_TYPE)
1790 if (!COMPLETE_TYPE_P (type))
1792 c_incomplete_type_error (NULL_TREE, type);
1793 return error_mark_node;
1796 field = lookup_field (datum, component);
1800 error ("%qT has no member named %qE", type, component);
1801 return error_mark_node;
1804 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1805 This might be better solved in future the way the C++ front
1806 end does it - by giving the anonymous entities each a
1807 separate name and type, and then have build_component_ref
1808 recursively call itself. We can't do that here. */
1811 tree subdatum = TREE_VALUE (field);
1813 if (TREE_TYPE (subdatum) == error_mark_node)
1814 return error_mark_node;
1816 ref = build3 (COMPONENT_REF, TREE_TYPE (subdatum), datum, subdatum,
1818 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1819 TREE_READONLY (ref) = 1;
1820 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1821 TREE_THIS_VOLATILE (ref) = 1;
1823 if (TREE_DEPRECATED (subdatum))
1824 warn_deprecated_use (subdatum);
1828 field = TREE_CHAIN (field);
1834 else if (code != ERROR_MARK)
1835 error ("request for member %qE in something not a structure or union",
1838 return error_mark_node;
1841 /* Given an expression PTR for a pointer, return an expression
1842 for the value pointed to.
1843 ERRORSTRING is the name of the operator to appear in error messages. */
1846 build_indirect_ref (tree ptr, const char *errorstring)
1848 tree pointer = default_conversion (ptr);
1849 tree type = TREE_TYPE (pointer);
1851 if (TREE_CODE (type) == POINTER_TYPE)
1853 if (TREE_CODE (pointer) == ADDR_EXPR
1854 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1855 == TREE_TYPE (type)))
1856 return TREE_OPERAND (pointer, 0);
1859 tree t = TREE_TYPE (type);
1862 ref = build1 (INDIRECT_REF, t, pointer);
1864 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1866 error ("dereferencing pointer to incomplete type");
1867 return error_mark_node;
1869 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1870 warning (0, "dereferencing %<void *%> pointer");
1872 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1873 so that we get the proper error message if the result is used
1874 to assign to. Also, &* is supposed to be a no-op.
1875 And ANSI C seems to specify that the type of the result
1876 should be the const type. */
1877 /* A de-reference of a pointer to const is not a const. It is valid
1878 to change it via some other pointer. */
1879 TREE_READONLY (ref) = TYPE_READONLY (t);
1880 TREE_SIDE_EFFECTS (ref)
1881 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
1882 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1886 else if (TREE_CODE (pointer) != ERROR_MARK)
1887 error ("invalid type argument of %qs", errorstring);
1888 return error_mark_node;
1891 /* This handles expressions of the form "a[i]", which denotes
1894 This is logically equivalent in C to *(a+i), but we may do it differently.
1895 If A is a variable or a member, we generate a primitive ARRAY_REF.
1896 This avoids forcing the array out of registers, and can work on
1897 arrays that are not lvalues (for example, members of structures returned
1901 build_array_ref (tree array, tree index)
1903 bool swapped = false;
1904 if (TREE_TYPE (array) == error_mark_node
1905 || TREE_TYPE (index) == error_mark_node)
1906 return error_mark_node;
1908 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
1909 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
1912 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
1913 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
1915 error ("subscripted value is neither array nor pointer");
1916 return error_mark_node;
1924 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
1926 error ("array subscript is not an integer");
1927 return error_mark_node;
1930 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
1932 error ("subscripted value is pointer to function");
1933 return error_mark_node;
1936 /* ??? Existing practice has been to warn only when the char
1937 index is syntactically the index, not for char[array]. */
1939 warn_array_subscript_with_type_char (index);
1941 /* Apply default promotions *after* noticing character types. */
1942 index = default_conversion (index);
1944 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
1946 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
1950 /* An array that is indexed by a non-constant
1951 cannot be stored in a register; we must be able to do
1952 address arithmetic on its address.
1953 Likewise an array of elements of variable size. */
1954 if (TREE_CODE (index) != INTEGER_CST
1955 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1956 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1958 if (!c_mark_addressable (array))
1959 return error_mark_node;
1961 /* An array that is indexed by a constant value which is not within
1962 the array bounds cannot be stored in a register either; because we
1963 would get a crash in store_bit_field/extract_bit_field when trying
1964 to access a non-existent part of the register. */
1965 if (TREE_CODE (index) == INTEGER_CST
1966 && TYPE_DOMAIN (TREE_TYPE (array))
1967 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
1969 if (!c_mark_addressable (array))
1970 return error_mark_node;
1976 while (TREE_CODE (foo) == COMPONENT_REF)
1977 foo = TREE_OPERAND (foo, 0);
1978 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
1979 pedwarn ("ISO C forbids subscripting %<register%> array");
1980 else if (!flag_isoc99 && !lvalue_p (foo))
1981 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
1984 type = TREE_TYPE (TREE_TYPE (array));
1985 if (TREE_CODE (type) != ARRAY_TYPE)
1986 type = TYPE_MAIN_VARIANT (type);
1987 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
1988 /* Array ref is const/volatile if the array elements are
1989 or if the array is. */
1990 TREE_READONLY (rval)
1991 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
1992 | TREE_READONLY (array));
1993 TREE_SIDE_EFFECTS (rval)
1994 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1995 | TREE_SIDE_EFFECTS (array));
1996 TREE_THIS_VOLATILE (rval)
1997 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1998 /* This was added by rms on 16 Nov 91.
1999 It fixes vol struct foo *a; a->elts[1]
2000 in an inline function.
2001 Hope it doesn't break something else. */
2002 | TREE_THIS_VOLATILE (array));
2003 return require_complete_type (fold (rval));
2007 tree ar = default_conversion (array);
2009 if (ar == error_mark_node)
2012 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
2013 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
2015 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, index, 0),
2020 /* Build an external reference to identifier ID. FUN indicates
2021 whether this will be used for a function call. LOC is the source
2022 location of the identifier. */
2024 build_external_ref (tree id, int fun, location_t loc)
2027 tree decl = lookup_name (id);
2029 /* In Objective-C, an instance variable (ivar) may be preferred to
2030 whatever lookup_name() found. */
2031 decl = objc_lookup_ivar (decl, id);
2033 if (decl && decl != error_mark_node)
2036 /* Implicit function declaration. */
2037 ref = implicitly_declare (id);
2038 else if (decl == error_mark_node)
2039 /* Don't complain about something that's already been
2040 complained about. */
2041 return error_mark_node;
2044 undeclared_variable (id, loc);
2045 return error_mark_node;
2048 if (TREE_TYPE (ref) == error_mark_node)
2049 return error_mark_node;
2051 if (TREE_DEPRECATED (ref))
2052 warn_deprecated_use (ref);
2054 if (!skip_evaluation)
2055 assemble_external (ref);
2056 TREE_USED (ref) = 1;
2058 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2060 if (!in_sizeof && !in_typeof)
2061 C_DECL_USED (ref) = 1;
2062 else if (DECL_INITIAL (ref) == 0
2063 && DECL_EXTERNAL (ref)
2064 && !TREE_PUBLIC (ref))
2065 record_maybe_used_decl (ref);
2068 if (TREE_CODE (ref) == CONST_DECL)
2070 ref = DECL_INITIAL (ref);
2071 TREE_CONSTANT (ref) = 1;
2072 TREE_INVARIANT (ref) = 1;
2074 else if (current_function_decl != 0
2075 && !DECL_FILE_SCOPE_P (current_function_decl)
2076 && (TREE_CODE (ref) == VAR_DECL
2077 || TREE_CODE (ref) == PARM_DECL
2078 || TREE_CODE (ref) == FUNCTION_DECL))
2080 tree context = decl_function_context (ref);
2082 if (context != 0 && context != current_function_decl)
2083 DECL_NONLOCAL (ref) = 1;
2089 /* Record details of decls possibly used inside sizeof or typeof. */
2090 struct maybe_used_decl
2094 /* The level seen at (in_sizeof + in_typeof). */
2096 /* The next one at this level or above, or NULL. */
2097 struct maybe_used_decl *next;
2100 static struct maybe_used_decl *maybe_used_decls;
2102 /* Record that DECL, an undefined static function reference seen
2103 inside sizeof or typeof, might be used if the operand of sizeof is
2104 a VLA type or the operand of typeof is a variably modified
2108 record_maybe_used_decl (tree decl)
2110 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2112 t->level = in_sizeof + in_typeof;
2113 t->next = maybe_used_decls;
2114 maybe_used_decls = t;
2117 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2118 USED is false, just discard them. If it is true, mark them used
2119 (if no longer inside sizeof or typeof) or move them to the next
2120 level up (if still inside sizeof or typeof). */
2123 pop_maybe_used (bool used)
2125 struct maybe_used_decl *p = maybe_used_decls;
2126 int cur_level = in_sizeof + in_typeof;
2127 while (p && p->level > cur_level)
2132 C_DECL_USED (p->decl) = 1;
2134 p->level = cur_level;
2138 if (!used || cur_level == 0)
2139 maybe_used_decls = p;
2142 /* Return the result of sizeof applied to EXPR. */
2145 c_expr_sizeof_expr (struct c_expr expr)
2148 if (expr.value == error_mark_node)
2150 ret.value = error_mark_node;
2151 ret.original_code = ERROR_MARK;
2152 pop_maybe_used (false);
2156 ret.value = c_sizeof (TREE_TYPE (expr.value));
2157 ret.original_code = ERROR_MARK;
2158 if (c_vla_type_p (TREE_TYPE (expr.value)))
2160 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2161 ret.value = build2 (COMPOUND_EXPR, TREE_TYPE (ret.value), expr.value, ret.value);
2163 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2168 /* Return the result of sizeof applied to T, a structure for the type
2169 name passed to sizeof (rather than the type itself). */
2172 c_expr_sizeof_type (struct c_type_name *t)
2176 type = groktypename (t);
2177 ret.value = c_sizeof (type);
2178 ret.original_code = ERROR_MARK;
2179 pop_maybe_used (type != error_mark_node
2180 ? C_TYPE_VARIABLE_SIZE (type) : false);
2184 /* Build a function call to function FUNCTION with parameters PARAMS.
2185 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2186 TREE_VALUE of each node is a parameter-expression.
2187 FUNCTION's data type may be a function type or a pointer-to-function. */
2190 build_function_call (tree function, tree params)
2192 tree fntype, fundecl = 0;
2193 tree coerced_params;
2194 tree name = NULL_TREE, result;
2197 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2198 STRIP_TYPE_NOPS (function);
2200 /* Convert anything with function type to a pointer-to-function. */
2201 if (TREE_CODE (function) == FUNCTION_DECL)
2203 /* Implement type-directed function overloading for builtins.
2204 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2205 handle all the type checking. The result is a complete expression
2206 that implements this function call. */
2207 tem = resolve_overloaded_builtin (function, params);
2211 name = DECL_NAME (function);
2214 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2215 function = function_to_pointer_conversion (function);
2217 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2218 expressions, like those used for ObjC messenger dispatches. */
2219 function = objc_rewrite_function_call (function, params);
2221 fntype = TREE_TYPE (function);
2223 if (TREE_CODE (fntype) == ERROR_MARK)
2224 return error_mark_node;
2226 if (!(TREE_CODE (fntype) == POINTER_TYPE
2227 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2229 error ("called object %qE is not a function", function);
2230 return error_mark_node;
2233 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2234 current_function_returns_abnormally = 1;
2236 /* fntype now gets the type of function pointed to. */
2237 fntype = TREE_TYPE (fntype);
2239 /* Check that the function is called through a compatible prototype.
2240 If it is not, replace the call by a trap, wrapped up in a compound
2241 expression if necessary. This has the nice side-effect to prevent
2242 the tree-inliner from generating invalid assignment trees which may
2243 blow up in the RTL expander later. */
2244 if ((TREE_CODE (function) == NOP_EXPR
2245 || TREE_CODE (function) == CONVERT_EXPR)
2246 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2247 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2248 && !comptypes (fntype, TREE_TYPE (tem)))
2250 tree return_type = TREE_TYPE (fntype);
2251 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2254 /* This situation leads to run-time undefined behavior. We can't,
2255 therefore, simply error unless we can prove that all possible
2256 executions of the program must execute the code. */
2257 warning (0, "function called through a non-compatible type");
2259 /* We can, however, treat "undefined" any way we please.
2260 Call abort to encourage the user to fix the program. */
2261 inform ("if this code is reached, the program will abort");
2263 if (VOID_TYPE_P (return_type))
2269 if (AGGREGATE_TYPE_P (return_type))
2270 rhs = build_compound_literal (return_type,
2271 build_constructor (return_type, 0));
2273 rhs = fold_convert (return_type, integer_zero_node);
2275 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2279 /* Convert the parameters to the types declared in the
2280 function prototype, or apply default promotions. */
2283 = convert_arguments (TYPE_ARG_TYPES (fntype), params, function, fundecl);
2285 if (coerced_params == error_mark_node)
2286 return error_mark_node;
2288 /* Check that the arguments to the function are valid. */
2290 check_function_arguments (TYPE_ATTRIBUTES (fntype), coerced_params,
2291 TYPE_ARG_TYPES (fntype));
2293 if (require_constant_value)
2295 result = fold_build3_initializer (CALL_EXPR, TREE_TYPE (fntype),
2296 function, coerced_params, NULL_TREE);
2298 if (TREE_CONSTANT (result)
2299 && (name == NULL_TREE
2300 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2301 pedwarn_init ("initializer element is not constant");
2304 result = fold_build3 (CALL_EXPR, TREE_TYPE (fntype),
2305 function, coerced_params, NULL_TREE);
2307 if (VOID_TYPE_P (TREE_TYPE (result)))
2309 return require_complete_type (result);
2312 /* Convert the argument expressions in the list VALUES
2313 to the types in the list TYPELIST. The result is a list of converted
2314 argument expressions, unless there are too few arguments in which
2315 case it is error_mark_node.
2317 If TYPELIST is exhausted, or when an element has NULL as its type,
2318 perform the default conversions.
2320 PARMLIST is the chain of parm decls for the function being called.
2321 It may be 0, if that info is not available.
2322 It is used only for generating error messages.
2324 FUNCTION is a tree for the called function. It is used only for
2325 error messages, where it is formatted with %qE.
2327 This is also where warnings about wrong number of args are generated.
2329 Both VALUES and the returned value are chains of TREE_LIST nodes
2330 with the elements of the list in the TREE_VALUE slots of those nodes. */
2333 convert_arguments (tree typelist, tree values, tree function, tree fundecl)
2335 tree typetail, valtail;
2340 /* Change pointer to function to the function itself for
2342 if (TREE_CODE (function) == ADDR_EXPR
2343 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2344 function = TREE_OPERAND (function, 0);
2346 /* Handle an ObjC selector specially for diagnostics. */
2347 selector = objc_message_selector ();
2349 /* Scan the given expressions and types, producing individual
2350 converted arguments and pushing them on RESULT in reverse order. */
2352 for (valtail = values, typetail = typelist, parmnum = 0;
2354 valtail = TREE_CHAIN (valtail), parmnum++)
2356 tree type = typetail ? TREE_VALUE (typetail) : 0;
2357 tree val = TREE_VALUE (valtail);
2358 tree rname = function;
2359 int argnum = parmnum + 1;
2360 const char *invalid_func_diag;
2362 if (type == void_type_node)
2364 error ("too many arguments to function %qE", function);
2368 if (selector && argnum > 2)
2374 STRIP_TYPE_NOPS (val);
2376 val = require_complete_type (val);
2380 /* Formal parm type is specified by a function prototype. */
2383 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2385 error ("type of formal parameter %d is incomplete", parmnum + 1);
2390 /* Optionally warn about conversions that
2391 differ from the default conversions. */
2392 if (warn_conversion || warn_traditional)
2394 unsigned int formal_prec = TYPE_PRECISION (type);
2396 if (INTEGRAL_TYPE_P (type)
2397 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2398 warning (0, "passing argument %d of %qE as integer "
2399 "rather than floating due to prototype",
2401 if (INTEGRAL_TYPE_P (type)
2402 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2403 warning (0, "passing argument %d of %qE as integer "
2404 "rather than complex due to prototype",
2406 else if (TREE_CODE (type) == COMPLEX_TYPE
2407 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2408 warning (0, "passing argument %d of %qE as complex "
2409 "rather than floating due to prototype",
2411 else if (TREE_CODE (type) == REAL_TYPE
2412 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2413 warning (0, "passing argument %d of %qE as floating "
2414 "rather than integer due to prototype",
2416 else if (TREE_CODE (type) == COMPLEX_TYPE
2417 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2418 warning (0, "passing argument %d of %qE as complex "
2419 "rather than integer due to prototype",
2421 else if (TREE_CODE (type) == REAL_TYPE
2422 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2423 warning (0, "passing argument %d of %qE as floating "
2424 "rather than complex due to prototype",
2426 /* ??? At some point, messages should be written about
2427 conversions between complex types, but that's too messy
2429 else if (TREE_CODE (type) == REAL_TYPE
2430 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2432 /* Warn if any argument is passed as `float',
2433 since without a prototype it would be `double'. */
2434 if (formal_prec == TYPE_PRECISION (float_type_node)
2435 && type != dfloat32_type_node)
2436 warning (0, "passing argument %d of %qE as %<float%> "
2437 "rather than %<double%> due to prototype",
2440 /* Warn if mismatch between argument and prototype
2441 for decimal float types. Warn of conversions with
2442 binary float types and of precision narrowing due to
2444 else if (type != TREE_TYPE (val)
2445 && (type == dfloat32_type_node
2446 || type == dfloat64_type_node
2447 || type == dfloat128_type_node
2448 || TREE_TYPE (val) == dfloat32_type_node
2449 || TREE_TYPE (val) == dfloat64_type_node
2450 || TREE_TYPE (val) == dfloat128_type_node)
2452 <= TYPE_PRECISION (TREE_TYPE (val))
2453 || (type == dfloat128_type_node
2455 != dfloat64_type_node
2457 != dfloat32_type_node)))
2458 || (type == dfloat64_type_node
2460 != dfloat32_type_node))))
2461 warning (0, "passing argument %d of %qE as %qT "
2462 "rather than %qT due to prototype",
2463 argnum, rname, type, TREE_TYPE (val));
2466 /* Detect integer changing in width or signedness.
2467 These warnings are only activated with
2468 -Wconversion, not with -Wtraditional. */
2469 else if (warn_conversion && INTEGRAL_TYPE_P (type)
2470 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2472 tree would_have_been = default_conversion (val);
2473 tree type1 = TREE_TYPE (would_have_been);
2475 if (TREE_CODE (type) == ENUMERAL_TYPE
2476 && (TYPE_MAIN_VARIANT (type)
2477 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2478 /* No warning if function asks for enum
2479 and the actual arg is that enum type. */
2481 else if (formal_prec != TYPE_PRECISION (type1))
2482 warning (OPT_Wconversion, "passing argument %d of %qE "
2483 "with different width due to prototype",
2485 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2487 /* Don't complain if the formal parameter type
2488 is an enum, because we can't tell now whether
2489 the value was an enum--even the same enum. */
2490 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2492 else if (TREE_CODE (val) == INTEGER_CST
2493 && int_fits_type_p (val, type))
2494 /* Change in signedness doesn't matter
2495 if a constant value is unaffected. */
2497 /* If the value is extended from a narrower
2498 unsigned type, it doesn't matter whether we
2499 pass it as signed or unsigned; the value
2500 certainly is the same either way. */
2501 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2502 && TYPE_UNSIGNED (TREE_TYPE (val)))
2504 else if (TYPE_UNSIGNED (type))
2505 warning (OPT_Wconversion, "passing argument %d of %qE "
2506 "as unsigned due to prototype",
2509 warning (OPT_Wconversion, "passing argument %d of %qE "
2510 "as signed due to prototype", argnum, rname);
2514 parmval = convert_for_assignment (type, val, ic_argpass,
2518 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2519 && INTEGRAL_TYPE_P (type)
2520 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2521 parmval = default_conversion (parmval);
2523 result = tree_cons (NULL_TREE, parmval, result);
2525 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2526 && (TYPE_PRECISION (TREE_TYPE (val))
2527 < TYPE_PRECISION (double_type_node))
2528 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2529 /* Convert `float' to `double'. */
2530 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
2531 else if ((invalid_func_diag =
2532 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2534 error (invalid_func_diag);
2535 return error_mark_node;
2538 /* Convert `short' and `char' to full-size `int'. */
2539 result = tree_cons (NULL_TREE, default_conversion (val), result);
2542 typetail = TREE_CHAIN (typetail);
2545 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2547 error ("too few arguments to function %qE", function);
2548 return error_mark_node;
2551 return nreverse (result);
2554 /* This is the entry point used by the parser to build unary operators
2555 in the input. CODE, a tree_code, specifies the unary operator, and
2556 ARG is the operand. For unary plus, the C parser currently uses
2557 CONVERT_EXPR for code. */
2560 parser_build_unary_op (enum tree_code code, struct c_expr arg)
2562 struct c_expr result;
2564 result.original_code = ERROR_MARK;
2565 result.value = build_unary_op (code, arg.value, 0);
2566 overflow_warning (result.value);
2570 /* This is the entry point used by the parser to build binary operators
2571 in the input. CODE, a tree_code, specifies the binary operator, and
2572 ARG1 and ARG2 are the operands. In addition to constructing the
2573 expression, we check for operands that were written with other binary
2574 operators in a way that is likely to confuse the user. */
2577 parser_build_binary_op (enum tree_code code, struct c_expr arg1,
2580 struct c_expr result;
2582 enum tree_code code1 = arg1.original_code;
2583 enum tree_code code2 = arg2.original_code;
2585 result.value = build_binary_op (code, arg1.value, arg2.value, 1);
2586 result.original_code = code;
2588 if (TREE_CODE (result.value) == ERROR_MARK)
2591 /* Check for cases such as x+y<<z which users are likely
2593 if (warn_parentheses)
2595 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
2597 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2598 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2599 warning (OPT_Wparentheses,
2600 "suggest parentheses around + or - inside shift");
2603 if (code == TRUTH_ORIF_EXPR)
2605 if (code1 == TRUTH_ANDIF_EXPR
2606 || code2 == TRUTH_ANDIF_EXPR)
2607 warning (OPT_Wparentheses,
2608 "suggest parentheses around && within ||");
2611 if (code == BIT_IOR_EXPR)
2613 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
2614 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2615 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
2616 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2617 warning (OPT_Wparentheses,
2618 "suggest parentheses around arithmetic in operand of |");
2619 /* Check cases like x|y==z */
2620 if (TREE_CODE_CLASS (code1) == tcc_comparison
2621 || TREE_CODE_CLASS (code2) == tcc_comparison)
2622 warning (OPT_Wparentheses,
2623 "suggest parentheses around comparison in operand of |");
2626 if (code == BIT_XOR_EXPR)
2628 if (code1 == BIT_AND_EXPR
2629 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2630 || code2 == BIT_AND_EXPR
2631 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2632 warning (OPT_Wparentheses,
2633 "suggest parentheses around arithmetic in operand of ^");
2634 /* Check cases like x^y==z */
2635 if (TREE_CODE_CLASS (code1) == tcc_comparison
2636 || TREE_CODE_CLASS (code2) == tcc_comparison)
2637 warning (OPT_Wparentheses,
2638 "suggest parentheses around comparison in operand of ^");
2641 if (code == BIT_AND_EXPR)
2643 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2644 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2645 warning (OPT_Wparentheses,
2646 "suggest parentheses around + or - in operand of &");
2647 /* Check cases like x&y==z */
2648 if (TREE_CODE_CLASS (code1) == tcc_comparison
2649 || TREE_CODE_CLASS (code2) == tcc_comparison)
2650 warning (OPT_Wparentheses,
2651 "suggest parentheses around comparison in operand of &");
2653 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
2654 if (TREE_CODE_CLASS (code) == tcc_comparison
2655 && (TREE_CODE_CLASS (code1) == tcc_comparison
2656 || TREE_CODE_CLASS (code2) == tcc_comparison))
2657 warning (OPT_Wparentheses, "comparisons like X<=Y<=Z do not "
2658 "have their mathematical meaning");
2662 /* Warn about comparisons against string literals, with the exception
2663 of testing for equality or inequality of a string literal with NULL. */
2664 if (code == EQ_EXPR || code == NE_EXPR)
2666 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2667 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2668 warning (OPT_Wstring_literal_comparison,
2669 "comparison with string literal");
2671 else if (TREE_CODE_CLASS (code) == tcc_comparison
2672 && (code1 == STRING_CST || code2 == STRING_CST))
2673 warning (OPT_Wstring_literal_comparison,
2674 "comparison with string literal");
2676 overflow_warning (result.value);
2681 /* Return a tree for the difference of pointers OP0 and OP1.
2682 The resulting tree has type int. */
2685 pointer_diff (tree op0, tree op1)
2687 tree restype = ptrdiff_type_node;
2689 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2690 tree con0, con1, lit0, lit1;
2691 tree orig_op1 = op1;
2693 if (pedantic || warn_pointer_arith)
2695 if (TREE_CODE (target_type) == VOID_TYPE)
2696 pedwarn ("pointer of type %<void *%> used in subtraction");
2697 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2698 pedwarn ("pointer to a function used in subtraction");
2701 /* If the conversion to ptrdiff_type does anything like widening or
2702 converting a partial to an integral mode, we get a convert_expression
2703 that is in the way to do any simplifications.
2704 (fold-const.c doesn't know that the extra bits won't be needed.
2705 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2706 different mode in place.)
2707 So first try to find a common term here 'by hand'; we want to cover
2708 at least the cases that occur in legal static initializers. */
2709 if ((TREE_CODE (op0) == NOP_EXPR || TREE_CODE (op0) == CONVERT_EXPR)
2710 && (TYPE_PRECISION (TREE_TYPE (op0))
2711 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2712 con0 = TREE_OPERAND (op0, 0);
2715 if ((TREE_CODE (op1) == NOP_EXPR || TREE_CODE (op1) == CONVERT_EXPR)
2716 && (TYPE_PRECISION (TREE_TYPE (op1))
2717 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2718 con1 = TREE_OPERAND (op1, 0);
2722 if (TREE_CODE (con0) == PLUS_EXPR)
2724 lit0 = TREE_OPERAND (con0, 1);
2725 con0 = TREE_OPERAND (con0, 0);
2728 lit0 = integer_zero_node;
2730 if (TREE_CODE (con1) == PLUS_EXPR)
2732 lit1 = TREE_OPERAND (con1, 1);
2733 con1 = TREE_OPERAND (con1, 0);
2736 lit1 = integer_zero_node;
2738 if (operand_equal_p (con0, con1, 0))
2745 /* First do the subtraction as integers;
2746 then drop through to build the divide operator.
2747 Do not do default conversions on the minus operator
2748 in case restype is a short type. */
2750 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2751 convert (restype, op1), 0);
2752 /* This generates an error if op1 is pointer to incomplete type. */
2753 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2754 error ("arithmetic on pointer to an incomplete type");
2756 /* This generates an error if op0 is pointer to incomplete type. */
2757 op1 = c_size_in_bytes (target_type);
2759 /* Divide by the size, in easiest possible way. */
2760 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2763 /* Construct and perhaps optimize a tree representation
2764 for a unary operation. CODE, a tree_code, specifies the operation
2765 and XARG is the operand.
2766 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2767 the default promotions (such as from short to int).
2768 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2769 allows non-lvalues; this is only used to handle conversion of non-lvalue
2770 arrays to pointers in C99. */
2773 build_unary_op (enum tree_code code, tree xarg, int flag)
2775 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2778 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2780 int noconvert = flag;
2781 const char *invalid_op_diag;
2783 if (typecode == ERROR_MARK)
2784 return error_mark_node;
2785 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2786 typecode = INTEGER_TYPE;
2788 if ((invalid_op_diag
2789 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2791 error (invalid_op_diag);
2792 return error_mark_node;
2798 /* This is used for unary plus, because a CONVERT_EXPR
2799 is enough to prevent anybody from looking inside for
2800 associativity, but won't generate any code. */
2801 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2802 || typecode == COMPLEX_TYPE
2803 || typecode == VECTOR_TYPE))
2805 error ("wrong type argument to unary plus");
2806 return error_mark_node;
2808 else if (!noconvert)
2809 arg = default_conversion (arg);
2810 arg = non_lvalue (arg);
2814 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2815 || typecode == COMPLEX_TYPE
2816 || typecode == VECTOR_TYPE))
2818 error ("wrong type argument to unary minus");
2819 return error_mark_node;
2821 else if (!noconvert)
2822 arg = default_conversion (arg);
2826 if (typecode == INTEGER_TYPE || typecode == VECTOR_TYPE)
2829 arg = default_conversion (arg);
2831 else if (typecode == COMPLEX_TYPE)
2835 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2837 arg = default_conversion (arg);
2841 error ("wrong type argument to bit-complement");
2842 return error_mark_node;
2847 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2849 error ("wrong type argument to abs");
2850 return error_mark_node;
2852 else if (!noconvert)
2853 arg = default_conversion (arg);
2857 /* Conjugating a real value is a no-op, but allow it anyway. */
2858 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2859 || typecode == COMPLEX_TYPE))
2861 error ("wrong type argument to conjugation");
2862 return error_mark_node;
2864 else if (!noconvert)
2865 arg = default_conversion (arg);
2868 case TRUTH_NOT_EXPR:
2869 if (typecode != INTEGER_TYPE
2870 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2871 && typecode != COMPLEX_TYPE)
2873 error ("wrong type argument to unary exclamation mark");
2874 return error_mark_node;
2876 arg = c_objc_common_truthvalue_conversion (arg);
2877 return invert_truthvalue (arg);
2880 if (TREE_CODE (arg) == COMPLEX_CST)
2881 return TREE_REALPART (arg);
2882 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2883 return fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2888 if (TREE_CODE (arg) == COMPLEX_CST)
2889 return TREE_IMAGPART (arg);
2890 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2891 return fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2893 return convert (TREE_TYPE (arg), integer_zero_node);
2895 case PREINCREMENT_EXPR:
2896 case POSTINCREMENT_EXPR:
2897 case PREDECREMENT_EXPR:
2898 case POSTDECREMENT_EXPR:
2900 /* Increment or decrement the real part of the value,
2901 and don't change the imaginary part. */
2902 if (typecode == COMPLEX_TYPE)
2907 pedwarn ("ISO C does not support %<++%> and %<--%>"
2908 " on complex types");
2910 arg = stabilize_reference (arg);
2911 real = build_unary_op (REALPART_EXPR, arg, 1);
2912 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2913 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
2914 build_unary_op (code, real, 1), imag);
2917 /* Report invalid types. */
2919 if (typecode != POINTER_TYPE
2920 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2922 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2923 error ("wrong type argument to increment");
2925 error ("wrong type argument to decrement");
2927 return error_mark_node;
2932 tree result_type = TREE_TYPE (arg);
2934 arg = get_unwidened (arg, 0);
2935 argtype = TREE_TYPE (arg);
2937 /* Compute the increment. */
2939 if (typecode == POINTER_TYPE)
2941 /* If pointer target is an undefined struct,
2942 we just cannot know how to do the arithmetic. */
2943 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2945 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2946 error ("increment of pointer to unknown structure");
2948 error ("decrement of pointer to unknown structure");
2950 else if ((pedantic || warn_pointer_arith)
2951 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2952 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2954 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2955 pedwarn ("wrong type argument to increment");
2957 pedwarn ("wrong type argument to decrement");
2960 inc = c_size_in_bytes (TREE_TYPE (result_type));
2963 inc = integer_one_node;
2965 inc = convert (argtype, inc);
2967 /* Complain about anything else that is not a true lvalue. */
2968 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
2969 || code == POSTINCREMENT_EXPR)
2972 return error_mark_node;
2974 /* Report a read-only lvalue. */
2975 if (TREE_READONLY (arg))
2977 readonly_error (arg,
2978 ((code == PREINCREMENT_EXPR
2979 || code == POSTINCREMENT_EXPR)
2980 ? lv_increment : lv_decrement));
2981 return error_mark_node;
2984 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2985 val = boolean_increment (code, arg);
2987 val = build2 (code, TREE_TYPE (arg), arg, inc);
2988 TREE_SIDE_EFFECTS (val) = 1;
2989 val = convert (result_type, val);
2990 if (TREE_CODE (val) != code)
2991 TREE_NO_WARNING (val) = 1;
2996 /* Note that this operation never does default_conversion. */
2998 /* Let &* cancel out to simplify resulting code. */
2999 if (TREE_CODE (arg) == INDIRECT_REF)
3001 /* Don't let this be an lvalue. */
3002 if (lvalue_p (TREE_OPERAND (arg, 0)))
3003 return non_lvalue (TREE_OPERAND (arg, 0));
3004 return TREE_OPERAND (arg, 0);
3007 /* For &x[y], return x+y */
3008 if (TREE_CODE (arg) == ARRAY_REF)
3010 tree op0 = TREE_OPERAND (arg, 0);
3011 if (!c_mark_addressable (op0))
3012 return error_mark_node;
3013 return build_binary_op (PLUS_EXPR,
3014 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3015 ? array_to_pointer_conversion (op0)
3017 TREE_OPERAND (arg, 1), 1);
3020 /* Anything not already handled and not a true memory reference
3021 or a non-lvalue array is an error. */
3022 else if (typecode != FUNCTION_TYPE && !flag
3023 && !lvalue_or_else (arg, lv_addressof))
3024 return error_mark_node;
3026 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3027 argtype = TREE_TYPE (arg);
3029 /* If the lvalue is const or volatile, merge that into the type
3030 to which the address will point. Note that you can't get a
3031 restricted pointer by taking the address of something, so we
3032 only have to deal with `const' and `volatile' here. */
3033 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3034 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3035 argtype = c_build_type_variant (argtype,
3036 TREE_READONLY (arg),
3037 TREE_THIS_VOLATILE (arg));
3039 if (!c_mark_addressable (arg))
3040 return error_mark_node;
3042 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3043 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3045 argtype = build_pointer_type (argtype);
3047 /* ??? Cope with user tricks that amount to offsetof. Delete this
3048 when we have proper support for integer constant expressions. */
3049 val = get_base_address (arg);
3050 if (val && TREE_CODE (val) == INDIRECT_REF
3051 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3053 tree op0 = fold_convert (argtype, fold_offsetof (arg)), op1;
3055 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3056 return fold_build2 (PLUS_EXPR, argtype, op0, op1);
3059 val = build1 (ADDR_EXPR, argtype, arg);
3068 argtype = TREE_TYPE (arg);
3069 return require_constant_value ? fold_build1_initializer (code, argtype, arg)
3070 : fold_build1 (code, argtype, arg);
3073 /* Return nonzero if REF is an lvalue valid for this language.
3074 Lvalues can be assigned, unless their type has TYPE_READONLY.
3075 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3080 enum tree_code code = TREE_CODE (ref);
3087 return lvalue_p (TREE_OPERAND (ref, 0));
3089 case COMPOUND_LITERAL_EXPR:
3099 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3100 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3103 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3110 /* Give an error for storing in something that is 'const'. */
3113 readonly_error (tree arg, enum lvalue_use use)
3115 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3117 /* Using this macro rather than (for example) arrays of messages
3118 ensures that all the format strings are checked at compile
3120 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3121 : (use == lv_increment ? (I) \
3122 : (use == lv_decrement ? (D) : (AS))))
3123 if (TREE_CODE (arg) == COMPONENT_REF)
3125 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3126 readonly_error (TREE_OPERAND (arg, 0), use);
3128 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3129 G_("increment of read-only member %qD"),
3130 G_("decrement of read-only member %qD"),
3131 G_("read-only member %qD used as %<asm%> output")),
3132 TREE_OPERAND (arg, 1));
3134 else if (TREE_CODE (arg) == VAR_DECL)
3135 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3136 G_("increment of read-only variable %qD"),
3137 G_("decrement of read-only variable %qD"),
3138 G_("read-only variable %qD used as %<asm%> output")),
3141 error (READONLY_MSG (G_("assignment of read-only location"),
3142 G_("increment of read-only location"),
3143 G_("decrement of read-only location"),
3144 G_("read-only location used as %<asm%> output")));
3148 /* Return nonzero if REF is an lvalue valid for this language;
3149 otherwise, print an error message and return zero. USE says
3150 how the lvalue is being used and so selects the error message. */
3153 lvalue_or_else (tree ref, enum lvalue_use use)
3155 int win = lvalue_p (ref);
3163 /* Mark EXP saying that we need to be able to take the
3164 address of it; it should not be allocated in a register.
3165 Returns true if successful. */
3168 c_mark_addressable (tree exp)
3173 switch (TREE_CODE (x))
3176 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3179 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3183 /* ... fall through ... */
3189 x = TREE_OPERAND (x, 0);
3192 case COMPOUND_LITERAL_EXPR:
3194 TREE_ADDRESSABLE (x) = 1;
3201 if (C_DECL_REGISTER (x)
3202 && DECL_NONLOCAL (x))
3204 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3207 ("global register variable %qD used in nested function", x);
3210 pedwarn ("register variable %qD used in nested function", x);
3212 else if (C_DECL_REGISTER (x))
3214 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3215 error ("address of global register variable %qD requested", x);
3217 error ("address of register variable %qD requested", x);
3223 TREE_ADDRESSABLE (x) = 1;
3230 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3233 build_conditional_expr (tree ifexp, tree op1, tree op2)
3237 enum tree_code code1;
3238 enum tree_code code2;
3239 tree result_type = NULL;
3240 tree orig_op1 = op1, orig_op2 = op2;
3242 /* Promote both alternatives. */
3244 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3245 op1 = default_conversion (op1);
3246 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3247 op2 = default_conversion (op2);
3249 if (TREE_CODE (ifexp) == ERROR_MARK
3250 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3251 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3252 return error_mark_node;
3254 type1 = TREE_TYPE (op1);
3255 code1 = TREE_CODE (type1);
3256 type2 = TREE_TYPE (op2);
3257 code2 = TREE_CODE (type2);
3259 /* C90 does not permit non-lvalue arrays in conditional expressions.
3260 In C99 they will be pointers by now. */
3261 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3263 error ("non-lvalue array in conditional expression");
3264 return error_mark_node;
3267 /* Quickly detect the usual case where op1 and op2 have the same type
3269 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3272 result_type = type1;
3274 result_type = TYPE_MAIN_VARIANT (type1);
3276 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3277 || code1 == COMPLEX_TYPE)
3278 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3279 || code2 == COMPLEX_TYPE))
3281 result_type = c_common_type (type1, type2);
3283 /* If -Wsign-compare, warn here if type1 and type2 have
3284 different signedness. We'll promote the signed to unsigned
3285 and later code won't know it used to be different.
3286 Do this check on the original types, so that explicit casts
3287 will be considered, but default promotions won't. */
3288 if (warn_sign_compare && !skip_evaluation)
3290 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3291 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3293 if (unsigned_op1 ^ unsigned_op2)
3295 /* Do not warn if the result type is signed, since the
3296 signed type will only be chosen if it can represent
3297 all the values of the unsigned type. */
3298 if (!TYPE_UNSIGNED (result_type))
3300 /* Do not warn if the signed quantity is an unsuffixed
3301 integer literal (or some static constant expression
3302 involving such literals) and it is non-negative. */
3303 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
3304 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
3307 warning (0, "signed and unsigned type in conditional expression");
3311 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3313 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3314 pedwarn ("ISO C forbids conditional expr with only one void side");
3315 result_type = void_type_node;
3317 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3319 if (comp_target_types (type1, type2))
3320 result_type = common_pointer_type (type1, type2);
3321 else if (null_pointer_constant_p (orig_op1))
3322 result_type = qualify_type (type2, type1);
3323 else if (null_pointer_constant_p (orig_op2))
3324 result_type = qualify_type (type1, type2);
3325 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3327 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3328 pedwarn ("ISO C forbids conditional expr between "
3329 "%<void *%> and function pointer");
3330 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3331 TREE_TYPE (type2)));
3333 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3335 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3336 pedwarn ("ISO C forbids conditional expr between "
3337 "%<void *%> and function pointer");
3338 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3339 TREE_TYPE (type1)));
3343 pedwarn ("pointer type mismatch in conditional expression");
3344 result_type = build_pointer_type (void_type_node);
3347 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3349 if (!null_pointer_constant_p (orig_op2))
3350 pedwarn ("pointer/integer type mismatch in conditional expression");
3353 op2 = null_pointer_node;
3355 result_type = type1;
3357 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3359 if (!null_pointer_constant_p (orig_op1))
3360 pedwarn ("pointer/integer type mismatch in conditional expression");
3363 op1 = null_pointer_node;
3365 result_type = type2;
3370 if (flag_cond_mismatch)
3371 result_type = void_type_node;
3374 error ("type mismatch in conditional expression");
3375 return error_mark_node;
3379 /* Merge const and volatile flags of the incoming types. */
3381 = build_type_variant (result_type,
3382 TREE_READONLY (op1) || TREE_READONLY (op2),
3383 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3385 if (result_type != TREE_TYPE (op1))
3386 op1 = convert_and_check (result_type, op1);
3387 if (result_type != TREE_TYPE (op2))
3388 op2 = convert_and_check (result_type, op2);
3390 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3393 /* Return a compound expression that performs two expressions and
3394 returns the value of the second of them. */
3397 build_compound_expr (tree expr1, tree expr2)
3399 if (!TREE_SIDE_EFFECTS (expr1))
3401 /* The left-hand operand of a comma expression is like an expression
3402 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3403 any side-effects, unless it was explicitly cast to (void). */
3404 if (warn_unused_value)
3406 if (VOID_TYPE_P (TREE_TYPE (expr1))
3407 && (TREE_CODE (expr1) == NOP_EXPR
3408 || TREE_CODE (expr1) == CONVERT_EXPR))
3410 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3411 && TREE_CODE (expr1) == COMPOUND_EXPR
3412 && (TREE_CODE (TREE_OPERAND (expr1, 1)) == CONVERT_EXPR
3413 || TREE_CODE (TREE_OPERAND (expr1, 1)) == NOP_EXPR))
3414 ; /* (void) a, (void) b, c */
3416 warning (0, "left-hand operand of comma expression has no effect");
3420 /* With -Wunused, we should also warn if the left-hand operand does have
3421 side-effects, but computes a value which is not used. For example, in
3422 `foo() + bar(), baz()' the result of the `+' operator is not used,
3423 so we should issue a warning. */
3424 else if (warn_unused_value)
3425 warn_if_unused_value (expr1, input_location);
3427 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3430 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3433 build_c_cast (tree type, tree expr)
3437 if (type == error_mark_node || expr == error_mark_node)
3438 return error_mark_node;
3440 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3441 only in <protocol> qualifications. But when constructing cast expressions,
3442 the protocols do matter and must be kept around. */
3443 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3444 return build1 (NOP_EXPR, type, expr);
3446 type = TYPE_MAIN_VARIANT (type);
3448 if (TREE_CODE (type) == ARRAY_TYPE)
3450 error ("cast specifies array type");
3451 return error_mark_node;
3454 if (TREE_CODE (type) == FUNCTION_TYPE)
3456 error ("cast specifies function type");
3457 return error_mark_node;
3460 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3464 if (TREE_CODE (type) == RECORD_TYPE
3465 || TREE_CODE (type) == UNION_TYPE)
3466 pedwarn ("ISO C forbids casting nonscalar to the same type");
3469 else if (TREE_CODE (type) == UNION_TYPE)
3473 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3474 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3475 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3483 pedwarn ("ISO C forbids casts to union type");
3484 t = digest_init (type,
3485 build_constructor_single (type, field, value),
3487 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3488 TREE_INVARIANT (t) = TREE_INVARIANT (value);
3491 error ("cast to union type from type not present in union");
3492 return error_mark_node;
3498 if (type == void_type_node)
3499 return build1 (CONVERT_EXPR, type, value);
3501 otype = TREE_TYPE (value);
3503 /* Optionally warn about potentially worrisome casts. */
3506 && TREE_CODE (type) == POINTER_TYPE
3507 && TREE_CODE (otype) == POINTER_TYPE)
3509 tree in_type = type;
3510 tree in_otype = otype;
3514 /* Check that the qualifiers on IN_TYPE are a superset of
3515 the qualifiers of IN_OTYPE. The outermost level of
3516 POINTER_TYPE nodes is uninteresting and we stop as soon
3517 as we hit a non-POINTER_TYPE node on either type. */
3520 in_otype = TREE_TYPE (in_otype);
3521 in_type = TREE_TYPE (in_type);
3523 /* GNU C allows cv-qualified function types. 'const'
3524 means the function is very pure, 'volatile' means it
3525 can't return. We need to warn when such qualifiers
3526 are added, not when they're taken away. */
3527 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3528 && TREE_CODE (in_type) == FUNCTION_TYPE)
3529 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3531 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3533 while (TREE_CODE (in_type) == POINTER_TYPE
3534 && TREE_CODE (in_otype) == POINTER_TYPE);
3537 warning (0, "cast adds new qualifiers to function type");
3540 /* There are qualifiers present in IN_OTYPE that are not
3541 present in IN_TYPE. */
3542 warning (0, "cast discards qualifiers from pointer target type");
3545 /* Warn about possible alignment problems. */
3546 if (STRICT_ALIGNMENT
3547 && TREE_CODE (type) == POINTER_TYPE
3548 && TREE_CODE (otype) == POINTER_TYPE
3549 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3550 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3551 /* Don't warn about opaque types, where the actual alignment
3552 restriction is unknown. */
3553 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3554 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3555 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3556 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3557 warning (OPT_Wcast_align,
3558 "cast increases required alignment of target type");
3560 if (TREE_CODE (type) == INTEGER_TYPE
3561 && TREE_CODE (otype) == POINTER_TYPE
3562 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3563 /* Unlike conversion of integers to pointers, where the
3564 warning is disabled for converting constants because
3565 of cases such as SIG_*, warn about converting constant
3566 pointers to integers. In some cases it may cause unwanted
3567 sign extension, and a warning is appropriate. */
3568 warning (OPT_Wpointer_to_int_cast,
3569 "cast from pointer to integer of different size");
3571 if (TREE_CODE (value) == CALL_EXPR
3572 && TREE_CODE (type) != TREE_CODE (otype))
3573 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3574 "to non-matching type %qT", otype, type);
3576 if (TREE_CODE (type) == POINTER_TYPE
3577 && TREE_CODE (otype) == INTEGER_TYPE
3578 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3579 /* Don't warn about converting any constant. */
3580 && !TREE_CONSTANT (value))
3581 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3582 "of different size");
3584 strict_aliasing_warning (otype, type, expr);
3586 /* If pedantic, warn for conversions between function and object
3587 pointer types, except for converting a null pointer constant
3588 to function pointer type. */
3590 && TREE_CODE (type) == POINTER_TYPE
3591 && TREE_CODE (otype) == POINTER_TYPE
3592 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3593 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3594 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3597 && TREE_CODE (type) == POINTER_TYPE
3598 && TREE_CODE (otype) == POINTER_TYPE
3599 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3600 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3601 && !null_pointer_constant_p (value))
3602 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3605 value = convert (type, value);
3607 /* Ignore any integer overflow caused by the cast. */
3608 if (TREE_CODE (value) == INTEGER_CST)
3610 if (CONSTANT_CLASS_P (ovalue)
3611 && (TREE_OVERFLOW (ovalue) || TREE_CONSTANT_OVERFLOW (ovalue)))
3613 /* Avoid clobbering a shared constant. */
3614 value = copy_node (value);
3615 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3616 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3618 else if (TREE_OVERFLOW (value) || TREE_CONSTANT_OVERFLOW (value))
3619 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3620 value = build_int_cst_wide (TREE_TYPE (value),
3621 TREE_INT_CST_LOW (value),
3622 TREE_INT_CST_HIGH (value));
3626 /* Don't let a cast be an lvalue. */
3628 value = non_lvalue (value);
3633 /* Interpret a cast of expression EXPR to type TYPE. */
3635 c_cast_expr (struct c_type_name *type_name, tree expr)
3638 int saved_wsp = warn_strict_prototypes;
3640 /* This avoids warnings about unprototyped casts on
3641 integers. E.g. "#define SIG_DFL (void(*)())0". */
3642 if (TREE_CODE (expr) == INTEGER_CST)
3643 warn_strict_prototypes = 0;
3644 type = groktypename (type_name);
3645 warn_strict_prototypes = saved_wsp;
3647 return build_c_cast (type, expr);
3650 /* Build an assignment expression of lvalue LHS from value RHS.
3651 MODIFYCODE is the code for a binary operator that we use
3652 to combine the old value of LHS with RHS to get the new value.
3653 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3656 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3660 tree lhstype = TREE_TYPE (lhs);
3661 tree olhstype = lhstype;
3663 /* Types that aren't fully specified cannot be used in assignments. */
3664 lhs = require_complete_type (lhs);
3666 /* Avoid duplicate error messages from operands that had errors. */
3667 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3668 return error_mark_node;
3670 STRIP_TYPE_NOPS (rhs);
3674 /* If a binary op has been requested, combine the old LHS value with the RHS
3675 producing the value we should actually store into the LHS. */
3677 if (modifycode != NOP_EXPR)
3679 lhs = stabilize_reference (lhs);
3680 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3683 if (!lvalue_or_else (lhs, lv_assign))
3684 return error_mark_node;
3686 /* Give an error for storing in something that is 'const'. */
3688 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3689 || ((TREE_CODE (lhstype) == RECORD_TYPE
3690 || TREE_CODE (lhstype) == UNION_TYPE)
3691 && C_TYPE_FIELDS_READONLY (lhstype)))
3693 readonly_error (lhs, lv_assign);
3694 return error_mark_node;
3697 /* If storing into a structure or union member,
3698 it has probably been given type `int'.
3699 Compute the type that would go with
3700 the actual amount of storage the member occupies. */
3702 if (TREE_CODE (lhs) == COMPONENT_REF
3703 && (TREE_CODE (lhstype) == INTEGER_TYPE
3704 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3705 || TREE_CODE (lhstype) == REAL_TYPE
3706 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3707 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3709 /* If storing in a field that is in actuality a short or narrower than one,
3710 we must store in the field in its actual type. */
3712 if (lhstype != TREE_TYPE (lhs))
3714 lhs = copy_node (lhs);
3715 TREE_TYPE (lhs) = lhstype;
3718 /* Convert new value to destination type. */
3720 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3721 NULL_TREE, NULL_TREE, 0);
3722 if (TREE_CODE (newrhs) == ERROR_MARK)
3723 return error_mark_node;
3725 /* Emit ObjC write barrier, if necessary. */
3726 if (c_dialect_objc () && flag_objc_gc)
3728 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3733 /* Scan operands. */
3735 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3736 TREE_SIDE_EFFECTS (result) = 1;
3738 /* If we got the LHS in a different type for storing in,
3739 convert the result back to the nominal type of LHS
3740 so that the value we return always has the same type
3741 as the LHS argument. */
3743 if (olhstype == TREE_TYPE (result))
3745 return convert_for_assignment (olhstype, result, ic_assign,
3746 NULL_TREE, NULL_TREE, 0);
3749 /* Convert value RHS to type TYPE as preparation for an assignment
3750 to an lvalue of type TYPE.
3751 The real work of conversion is done by `convert'.
3752 The purpose of this function is to generate error messages
3753 for assignments that are not allowed in C.
3754 ERRTYPE says whether it is argument passing, assignment,
3755 initialization or return.
3757 FUNCTION is a tree for the function being called.
3758 PARMNUM is the number of the argument, for printing in error messages. */
3761 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3762 tree fundecl, tree function, int parmnum)
3764 enum tree_code codel = TREE_CODE (type);
3766 enum tree_code coder;
3767 tree rname = NULL_TREE;
3768 bool objc_ok = false;
3770 if (errtype == ic_argpass || errtype == ic_argpass_nonproto)
3773 /* Change pointer to function to the function itself for
3775 if (TREE_CODE (function) == ADDR_EXPR
3776 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3777 function = TREE_OPERAND (function, 0);
3779 /* Handle an ObjC selector specially for diagnostics. */
3780 selector = objc_message_selector ();
3782 if (selector && parmnum > 2)
3789 /* This macro is used to emit diagnostics to ensure that all format
3790 strings are complete sentences, visible to gettext and checked at
3792 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3797 pedwarn (AR, parmnum, rname); \
3799 case ic_argpass_nonproto: \
3800 warning (0, AR, parmnum, rname); \
3812 gcc_unreachable (); \
3816 STRIP_TYPE_NOPS (rhs);
3818 if (optimize && TREE_CODE (rhs) == VAR_DECL
3819 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
3820 rhs = decl_constant_value_for_broken_optimization (rhs);
3822 rhstype = TREE_TYPE (rhs);
3823 coder = TREE_CODE (rhstype);
3825 if (coder == ERROR_MARK)
3826 return error_mark_node;
3828 if (c_dialect_objc ())
3851 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
3854 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
3856 overflow_warning (rhs);
3860 if (coder == VOID_TYPE)
3862 /* Except for passing an argument to an unprototyped function,
3863 this is a constraint violation. When passing an argument to
3864 an unprototyped function, it is compile-time undefined;
3865 making it a constraint in that case was rejected in
3867 error ("void value not ignored as it ought to be");
3868 return error_mark_node;
3870 /* A type converts to a reference to it.
3871 This code doesn't fully support references, it's just for the
3872 special case of va_start and va_copy. */
3873 if (codel == REFERENCE_TYPE
3874 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
3876 if (!lvalue_p (rhs))
3878 error ("cannot pass rvalue to reference parameter");
3879 return error_mark_node;
3881 if (!c_mark_addressable (rhs))
3882 return error_mark_node;
3883 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
3885 /* We already know that these two types are compatible, but they
3886 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3887 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3888 likely to be va_list, a typedef to __builtin_va_list, which
3889 is different enough that it will cause problems later. */
3890 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
3891 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
3893 rhs = build1 (NOP_EXPR, type, rhs);
3896 /* Some types can interconvert without explicit casts. */
3897 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
3898 && vector_types_convertible_p (type, TREE_TYPE (rhs)))
3899 return convert (type, rhs);
3900 /* Arithmetic types all interconvert, and enum is treated like int. */
3901 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
3902 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
3903 || codel == BOOLEAN_TYPE)
3904 && (coder == INTEGER_TYPE || coder == REAL_TYPE
3905 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
3906 || coder == BOOLEAN_TYPE))
3907 return convert_and_check (type, rhs);
3909 /* Conversion to a transparent union from its member types.
3910 This applies only to function arguments. */
3911 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
3912 && (errtype == ic_argpass || errtype == ic_argpass_nonproto))
3914 tree memb, marginal_memb = NULL_TREE;
3916 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
3918 tree memb_type = TREE_TYPE (memb);
3920 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
3921 TYPE_MAIN_VARIANT (rhstype)))
3924 if (TREE_CODE (memb_type) != POINTER_TYPE)
3927 if (coder == POINTER_TYPE)
3929 tree ttl = TREE_TYPE (memb_type);
3930 tree ttr = TREE_TYPE (rhstype);
3932 /* Any non-function converts to a [const][volatile] void *
3933 and vice versa; otherwise, targets must be the same.
3934 Meanwhile, the lhs target must have all the qualifiers of
3936 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3937 || comp_target_types (memb_type, rhstype))
3939 /* If this type won't generate any warnings, use it. */
3940 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
3941 || ((TREE_CODE (ttr) == FUNCTION_TYPE
3942 && TREE_CODE (ttl) == FUNCTION_TYPE)
3943 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3944 == TYPE_QUALS (ttr))
3945 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3946 == TYPE_QUALS (ttl))))
3949 /* Keep looking for a better type, but remember this one. */
3951 marginal_memb = memb;
3955 /* Can convert integer zero to any pointer type. */
3956 if (null_pointer_constant_p (rhs))
3958 rhs = null_pointer_node;
3963 if (memb || marginal_memb)
3967 /* We have only a marginally acceptable member type;
3968 it needs a warning. */
3969 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
3970 tree ttr = TREE_TYPE (rhstype);
3972 /* Const and volatile mean something different for function
3973 types, so the usual warnings are not appropriate. */
3974 if (TREE_CODE (ttr) == FUNCTION_TYPE
3975 && TREE_CODE (ttl) == FUNCTION_TYPE)
3977 /* Because const and volatile on functions are
3978 restrictions that say the function will not do
3979 certain things, it is okay to use a const or volatile
3980 function where an ordinary one is wanted, but not
3982 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
3983 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
3984 "makes qualified function "
3985 "pointer from unqualified"),
3986 G_("assignment makes qualified "
3987 "function pointer from "
3989 G_("initialization makes qualified "
3990 "function pointer from "
3992 G_("return makes qualified function "
3993 "pointer from unqualified"));
3995 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
3996 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
3997 "qualifiers from pointer target type"),
3998 G_("assignment discards qualifiers "
3999 "from pointer target type"),
4000 G_("initialization discards qualifiers "
4001 "from pointer target type"),
4002 G_("return discards qualifiers from "
4003 "pointer target type"));
4005 memb = marginal_memb;
4008 if (pedantic && (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl)))
4009 pedwarn ("ISO C prohibits argument conversion to union type");
4011 return build_constructor_single (type, memb, rhs);
4015 /* Conversions among pointers */
4016 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4017 && (coder == codel))
4019 tree ttl = TREE_TYPE (type);
4020 tree ttr = TREE_TYPE (rhstype);
4023 bool is_opaque_pointer;
4024 int target_cmp = 0; /* Cache comp_target_types () result. */
4026 if (TREE_CODE (mvl) != ARRAY_TYPE)
4027 mvl = TYPE_MAIN_VARIANT (mvl);
4028 if (TREE_CODE (mvr) != ARRAY_TYPE)
4029 mvr = TYPE_MAIN_VARIANT (mvr);
4030 /* Opaque pointers are treated like void pointers. */
4031 is_opaque_pointer = (targetm.vector_opaque_p (type)
4032 || targetm.vector_opaque_p (rhstype))
4033 && TREE_CODE (ttl) == VECTOR_TYPE
4034 && TREE_CODE (ttr) == VECTOR_TYPE;
4036 /* C++ does not allow the implicit conversion void* -> T*. However,
4037 for the purpose of reducing the number of false positives, we
4038 tolerate the special case of
4042 where NULL is typically defined in C to be '(void *) 0'. */
4043 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4044 warning (OPT_Wc___compat, "request for implicit conversion from "
4045 "%qT to %qT not permitted in C++", rhstype, type);
4047 /* Check if the right-hand side has a format attribute but the
4048 left-hand side doesn't. */
4049 if (warn_missing_format_attribute
4050 && check_missing_format_attribute (type, rhstype))
4055 case ic_argpass_nonproto:
4056 warning (OPT_Wmissing_format_attribute,
4057 "argument %d of %qE might be "
4058 "a candidate for a format attribute",
4062 warning (OPT_Wmissing_format_attribute,
4063 "assignment left-hand side might be "
4064 "a candidate for a format attribute");
4067 warning (OPT_Wmissing_format_attribute,
4068 "initialization left-hand side might be "
4069 "a candidate for a format attribute");
4072 warning (OPT_Wmissing_format_attribute,
4073 "return type might be "
4074 "a candidate for a format attribute");
4081 /* Any non-function converts to a [const][volatile] void *
4082 and vice versa; otherwise, targets must be the same.
4083 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4084 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4085 || (target_cmp = comp_target_types (type, rhstype))
4086 || is_opaque_pointer
4087 || (c_common_unsigned_type (mvl)
4088 == c_common_unsigned_type (mvr)))
4091 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4094 && !null_pointer_constant_p (rhs)
4095 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4096 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
4097 "%qE between function pointer "
4099 G_("ISO C forbids assignment between "
4100 "function pointer and %<void *%>"),
4101 G_("ISO C forbids initialization between "
4102 "function pointer and %<void *%>"),
4103 G_("ISO C forbids return between function "
4104 "pointer and %<void *%>"));
4105 /* Const and volatile mean something different for function types,
4106 so the usual warnings are not appropriate. */
4107 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4108 && TREE_CODE (ttl) != FUNCTION_TYPE)
4110 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4112 /* Types differing only by the presence of the 'volatile'
4113 qualifier are acceptable if the 'volatile' has been added
4114 in by the Objective-C EH machinery. */
4115 if (!objc_type_quals_match (ttl, ttr))
4116 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4117 "qualifiers from pointer target type"),
4118 G_("assignment discards qualifiers "
4119 "from pointer target type"),
4120 G_("initialization discards qualifiers "
4121 "from pointer target type"),
4122 G_("return discards qualifiers from "
4123 "pointer target type"));
4125 /* If this is not a case of ignoring a mismatch in signedness,
4127 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4130 /* If there is a mismatch, do warn. */
4131 else if (warn_pointer_sign)
4132 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
4133 "%d of %qE differ in signedness"),
4134 G_("pointer targets in assignment "
4135 "differ in signedness"),
4136 G_("pointer targets in initialization "
4137 "differ in signedness"),
4138 G_("pointer targets in return differ "
4141 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4142 && TREE_CODE (ttr) == FUNCTION_TYPE)
4144 /* Because const and volatile on functions are restrictions
4145 that say the function will not do certain things,
4146 it is okay to use a const or volatile function
4147 where an ordinary one is wanted, but not vice-versa. */
4148 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4149 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4150 "qualified function pointer "
4151 "from unqualified"),
4152 G_("assignment makes qualified function "
4153 "pointer from unqualified"),
4154 G_("initialization makes qualified "
4155 "function pointer from unqualified"),
4156 G_("return makes qualified function "
4157 "pointer from unqualified"));
4161 /* Avoid warning about the volatile ObjC EH puts on decls. */
4163 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
4164 "incompatible pointer type"),
4165 G_("assignment from incompatible pointer type"),
4166 G_("initialization from incompatible "
4168 G_("return from incompatible pointer type"));
4170 return convert (type, rhs);
4172 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4174 /* ??? This should not be an error when inlining calls to
4175 unprototyped functions. */
4176 error ("invalid use of non-lvalue array");
4177 return error_mark_node;
4179 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4181 /* An explicit constant 0 can convert to a pointer,
4182 or one that results from arithmetic, even including
4183 a cast to integer type. */
4184 if (!null_pointer_constant_p (rhs))
4185 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4186 "pointer from integer without a cast"),
4187 G_("assignment makes pointer from integer "
4189 G_("initialization makes pointer from "
4190 "integer without a cast"),
4191 G_("return makes pointer from integer "
4194 return convert (type, rhs);
4196 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4198 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
4199 "from pointer without a cast"),
4200 G_("assignment makes integer from pointer "
4202 G_("initialization makes integer from pointer "
4204 G_("return makes integer from pointer "
4206 return convert (type, rhs);
4208 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4209 return convert (type, rhs);
4214 case ic_argpass_nonproto:
4215 /* ??? This should not be an error when inlining calls to
4216 unprototyped functions. */
4217 error ("incompatible type for argument %d of %qE", parmnum, rname);
4220 error ("incompatible types in assignment");
4223 error ("incompatible types in initialization");
4226 error ("incompatible types in return");
4232 return error_mark_node;
4235 /* Convert VALUE for assignment into inlined parameter PARM. ARGNUM
4236 is used for error and waring reporting and indicates which argument
4237 is being processed. */
4240 c_convert_parm_for_inlining (tree parm, tree value, tree fn, int argnum)
4244 /* If FN was prototyped, the value has been converted already
4245 in convert_arguments. */
4246 if (!value || TYPE_ARG_TYPES (TREE_TYPE (fn)))
4249 type = TREE_TYPE (parm);
4250 ret = convert_for_assignment (type, value,
4251 ic_argpass_nonproto, fn,
4253 if (targetm.calls.promote_prototypes (TREE_TYPE (fn))
4254 && INTEGRAL_TYPE_P (type)
4255 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
4256 ret = default_conversion (ret);
4260 /* If VALUE is a compound expr all of whose expressions are constant, then
4261 return its value. Otherwise, return error_mark_node.
4263 This is for handling COMPOUND_EXPRs as initializer elements
4264 which is allowed with a warning when -pedantic is specified. */
4267 valid_compound_expr_initializer (tree value, tree endtype)
4269 if (TREE_CODE (value) == COMPOUND_EXPR)
4271 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4273 return error_mark_node;
4274 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4277 else if (!initializer_constant_valid_p (value, endtype))
4278 return error_mark_node;
4283 /* Perform appropriate conversions on the initial value of a variable,
4284 store it in the declaration DECL,
4285 and print any error messages that are appropriate.
4286 If the init is invalid, store an ERROR_MARK. */
4289 store_init_value (tree decl, tree init)
4293 /* If variable's type was invalidly declared, just ignore it. */
4295 type = TREE_TYPE (decl);
4296 if (TREE_CODE (type) == ERROR_MARK)
4299 /* Digest the specified initializer into an expression. */
4301 value = digest_init (type, init, true, TREE_STATIC (decl));
4303 /* Store the expression if valid; else report error. */
4305 if (!in_system_header
4306 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4307 warning (OPT_Wtraditional, "traditional C rejects automatic "
4308 "aggregate initialization");
4310 DECL_INITIAL (decl) = value;
4312 /* ANSI wants warnings about out-of-range constant initializers. */
4313 STRIP_TYPE_NOPS (value);
4314 constant_expression_warning (value);
4316 /* Check if we need to set array size from compound literal size. */
4317 if (TREE_CODE (type) == ARRAY_TYPE
4318 && TYPE_DOMAIN (type) == 0
4319 && value != error_mark_node)
4321 tree inside_init = init;
4323 STRIP_TYPE_NOPS (inside_init);
4324 inside_init = fold (inside_init);
4326 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4328 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4330 if (TYPE_DOMAIN (TREE_TYPE (decl)))
4332 /* For int foo[] = (int [3]){1}; we need to set array size
4333 now since later on array initializer will be just the
4334 brace enclosed list of the compound literal. */
4335 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (decl));
4337 layout_decl (decl, 0);
4343 /* Methods for storing and printing names for error messages. */
4345 /* Implement a spelling stack that allows components of a name to be pushed
4346 and popped. Each element on the stack is this structure. */
4353 unsigned HOST_WIDE_INT i;
4358 #define SPELLING_STRING 1
4359 #define SPELLING_MEMBER 2
4360 #define SPELLING_BOUNDS 3
4362 static struct spelling *spelling; /* Next stack element (unused). */
4363 static struct spelling *spelling_base; /* Spelling stack base. */
4364 static int spelling_size; /* Size of the spelling stack. */
4366 /* Macros to save and restore the spelling stack around push_... functions.
4367 Alternative to SAVE_SPELLING_STACK. */
4369 #define SPELLING_DEPTH() (spelling - spelling_base)
4370 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4372 /* Push an element on the spelling stack with type KIND and assign VALUE
4375 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4377 int depth = SPELLING_DEPTH (); \
4379 if (depth >= spelling_size) \
4381 spelling_size += 10; \
4382 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4384 RESTORE_SPELLING_DEPTH (depth); \
4387 spelling->kind = (KIND); \
4388 spelling->MEMBER = (VALUE); \
4392 /* Push STRING on the stack. Printed literally. */
4395 push_string (const char *string)
4397 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4400 /* Push a member name on the stack. Printed as '.' STRING. */
4403 push_member_name (tree decl)
4405 const char *const string
4406 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4407 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4410 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4413 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4415 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4418 /* Compute the maximum size in bytes of the printed spelling. */
4421 spelling_length (void)
4426 for (p = spelling_base; p < spelling; p++)
4428 if (p->kind == SPELLING_BOUNDS)
4431 size += strlen (p->u.s) + 1;
4437 /* Print the spelling to BUFFER and return it. */
4440 print_spelling (char *buffer)
4445 for (p = spelling_base; p < spelling; p++)
4446 if (p->kind == SPELLING_BOUNDS)
4448 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4454 if (p->kind == SPELLING_MEMBER)
4456 for (s = p->u.s; (*d = *s++); d++)
4463 /* Issue an error message for a bad initializer component.
4464 MSGID identifies the message.
4465 The component name is taken from the spelling stack. */
4468 error_init (const char *msgid)
4472 error ("%s", _(msgid));
4473 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4475 error ("(near initialization for %qs)", ofwhat);
4478 /* Issue a pedantic warning for a bad initializer component.
4479 MSGID identifies the message.
4480 The component name is taken from the spelling stack. */
4483 pedwarn_init (const char *msgid)
4487 pedwarn ("%s", _(msgid));
4488 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4490 pedwarn ("(near initialization for %qs)", ofwhat);
4493 /* Issue a warning for a bad initializer component.
4494 MSGID identifies the message.
4495 The component name is taken from the spelling stack. */
4498 warning_init (const char *msgid)
4502 warning (0, "%s", _(msgid));
4503 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4505 warning (0, "(near initialization for %qs)", ofwhat);
4508 /* If TYPE is an array type and EXPR is a parenthesized string
4509 constant, warn if pedantic that EXPR is being used to initialize an
4510 object of type TYPE. */
4513 maybe_warn_string_init (tree type, struct c_expr expr)
4516 && TREE_CODE (type) == ARRAY_TYPE
4517 && TREE_CODE (expr.value) == STRING_CST
4518 && expr.original_code != STRING_CST)
4519 pedwarn_init ("array initialized from parenthesized string constant");
4522 /* Digest the parser output INIT as an initializer for type TYPE.
4523 Return a C expression of type TYPE to represent the initial value.
4525 If INIT is a string constant, STRICT_STRING is true if it is
4526 unparenthesized or we should not warn here for it being parenthesized.
4527 For other types of INIT, STRICT_STRING is not used.
4529 REQUIRE_CONSTANT requests an error if non-constant initializers or
4530 elements are seen. */
4533 digest_init (tree type, tree init, bool strict_string, int require_constant)
4535 enum tree_code code = TREE_CODE (type);
4536 tree inside_init = init;
4538 if (type == error_mark_node
4540 || init == error_mark_node
4541 || TREE_TYPE (init) == error_mark_node)
4542 return error_mark_node;
4544 STRIP_TYPE_NOPS (inside_init);
4546 inside_init = fold (inside_init);
4548 /* Initialization of an array of chars from a string constant
4549 optionally enclosed in braces. */
4551 if (code == ARRAY_TYPE && inside_init
4552 && TREE_CODE (inside_init) == STRING_CST)
4554 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4555 /* Note that an array could be both an array of character type
4556 and an array of wchar_t if wchar_t is signed char or unsigned
4558 bool char_array = (typ1 == char_type_node
4559 || typ1 == signed_char_type_node
4560 || typ1 == unsigned_char_type_node);
4561 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4562 if (char_array || wchar_array)
4566 expr.value = inside_init;
4567 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4568 maybe_warn_string_init (type, expr);
4571 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4574 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4575 TYPE_MAIN_VARIANT (type)))
4578 if (!wchar_array && !char_string)
4580 error_init ("char-array initialized from wide string");
4581 return error_mark_node;
4583 if (char_string && !char_array)
4585 error_init ("wchar_t-array initialized from non-wide string");
4586 return error_mark_node;
4589 TREE_TYPE (inside_init) = type;
4590 if (TYPE_DOMAIN (type) != 0
4591 && TYPE_SIZE (type) != 0
4592 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4593 /* Subtract 1 (or sizeof (wchar_t))
4594 because it's ok to ignore the terminating null char
4595 that is counted in the length of the constant. */
4596 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4597 TREE_STRING_LENGTH (inside_init)
4598 - ((TYPE_PRECISION (typ1)
4599 != TYPE_PRECISION (char_type_node))
4600 ? (TYPE_PRECISION (wchar_type_node)
4603 pedwarn_init ("initializer-string for array of chars is too long");
4607 else if (INTEGRAL_TYPE_P (typ1))
4609 error_init ("array of inappropriate type initialized "
4610 "from string constant");
4611 return error_mark_node;
4615 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4616 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4617 below and handle as a constructor. */
4618 if (code == VECTOR_TYPE
4619 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4620 && vector_types_convertible_p (TREE_TYPE (inside_init), type)
4621 && TREE_CONSTANT (inside_init))
4623 if (TREE_CODE (inside_init) == VECTOR_CST
4624 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4625 TYPE_MAIN_VARIANT (type)))
4628 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4630 unsigned HOST_WIDE_INT ix;
4632 bool constant_p = true;
4634 /* Iterate through elements and check if all constructor
4635 elements are *_CSTs. */
4636 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4637 if (!CONSTANT_CLASS_P (value))
4644 return build_vector_from_ctor (type,
4645 CONSTRUCTOR_ELTS (inside_init));
4649 /* Any type can be initialized
4650 from an expression of the same type, optionally with braces. */
4652 if (inside_init && TREE_TYPE (inside_init) != 0
4653 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4654 TYPE_MAIN_VARIANT (type))
4655 || (code == ARRAY_TYPE
4656 && comptypes (TREE_TYPE (inside_init), type))
4657 || (code == VECTOR_TYPE
4658 && comptypes (TREE_TYPE (inside_init), type))
4659 || (code == POINTER_TYPE
4660 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4661 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4662 TREE_TYPE (type)))))
4664 if (code == POINTER_TYPE)
4666 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4668 if (TREE_CODE (inside_init) == STRING_CST
4669 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4670 inside_init = array_to_pointer_conversion (inside_init);
4673 error_init ("invalid use of non-lvalue array");
4674 return error_mark_node;
4679 if (code == VECTOR_TYPE)
4680 /* Although the types are compatible, we may require a
4682 inside_init = convert (type, inside_init);
4684 if (require_constant && !flag_isoc99
4685 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4687 /* As an extension, allow initializing objects with static storage
4688 duration with compound literals (which are then treated just as
4689 the brace enclosed list they contain). */
4690 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4691 inside_init = DECL_INITIAL (decl);
4694 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4695 && TREE_CODE (inside_init) != CONSTRUCTOR)
4697 error_init ("array initialized from non-constant array expression");
4698 return error_mark_node;
4701 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4702 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4704 /* Compound expressions can only occur here if -pedantic or
4705 -pedantic-errors is specified. In the later case, we always want
4706 an error. In the former case, we simply want a warning. */
4707 if (require_constant && pedantic
4708 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4711 = valid_compound_expr_initializer (inside_init,
4712 TREE_TYPE (inside_init));
4713 if (inside_init == error_mark_node)
4714 error_init ("initializer element is not constant");
4716 pedwarn_init ("initializer element is not constant");
4717 if (flag_pedantic_errors)
4718 inside_init = error_mark_node;
4720 else if (require_constant
4721 && !initializer_constant_valid_p (inside_init,
4722 TREE_TYPE (inside_init)))
4724 error_init ("initializer element is not constant");
4725 inside_init = error_mark_node;
4728 /* Added to enable additional -Wmissing-format-attribute warnings. */
4729 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4730 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4735 /* Handle scalar types, including conversions. */
4737 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4738 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE
4739 || code == VECTOR_TYPE)
4741 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4742 && (TREE_CODE (init) == STRING_CST
4743 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4744 init = array_to_pointer_conversion (init);
4746 = convert_for_assignment (type, init, ic_init,
4747 NULL_TREE, NULL_TREE, 0);
4749 /* Check to see if we have already given an error message. */
4750 if (inside_init == error_mark_node)
4752 else if (require_constant && !TREE_CONSTANT (inside_init))
4754 error_init ("initializer element is not constant");
4755 inside_init = error_mark_node;
4757 else if (require_constant
4758 && !initializer_constant_valid_p (inside_init,
4759 TREE_TYPE (inside_init)))
4761 error_init ("initializer element is not computable at load time");
4762 inside_init = error_mark_node;
4768 /* Come here only for records and arrays. */
4770 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4772 error_init ("variable-sized object may not be initialized");
4773 return error_mark_node;
4776 error_init ("invalid initializer");
4777 return error_mark_node;
4780 /* Handle initializers that use braces. */
4782 /* Type of object we are accumulating a constructor for.
4783 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4784 static tree constructor_type;
4786 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4788 static tree constructor_fields;
4790 /* For an ARRAY_TYPE, this is the specified index
4791 at which to store the next element we get. */
4792 static tree constructor_index;
4794 /* For an ARRAY_TYPE, this is the maximum index. */
4795 static tree constructor_max_index;
4797 /* For a RECORD_TYPE, this is the first field not yet written out. */
4798 static tree constructor_unfilled_fields;
4800 /* For an ARRAY_TYPE, this is the index of the first element
4801 not yet written out. */
4802 static tree constructor_unfilled_index;
4804 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4805 This is so we can generate gaps between fields, when appropriate. */
4806 static tree constructor_bit_index;
4808 /* If we are saving up the elements rather than allocating them,
4809 this is the list of elements so far (in reverse order,
4810 most recent first). */
4811 static VEC(constructor_elt,gc) *constructor_elements;
4813 /* 1 if constructor should be incrementally stored into a constructor chain,
4814 0 if all the elements should be kept in AVL tree. */
4815 static int constructor_incremental;
4817 /* 1 if so far this constructor's elements are all compile-time constants. */
4818 static int constructor_constant;
4820 /* 1 if so far this constructor's elements are all valid address constants. */
4821 static int constructor_simple;
4823 /* 1 if this constructor is erroneous so far. */
4824 static int constructor_erroneous;
4826 /* Structure for managing pending initializer elements, organized as an
4831 struct init_node *left, *right;
4832 struct init_node *parent;
4838 /* Tree of pending elements at this constructor level.
4839 These are elements encountered out of order
4840 which belong at places we haven't reached yet in actually
4842 Will never hold tree nodes across GC runs. */
4843 static struct init_node *constructor_pending_elts;
4845 /* The SPELLING_DEPTH of this constructor. */
4846 static int constructor_depth;
4848 /* DECL node for which an initializer is being read.
4849 0 means we are reading a constructor expression
4850 such as (struct foo) {...}. */
4851 static tree constructor_decl;
4853 /* Nonzero if this is an initializer for a top-level decl. */
4854 static int constructor_top_level;
4856 /* Nonzero if there were any member designators in this initializer. */
4857 static int constructor_designated;
4859 /* Nesting depth of designator list. */
4860 static int designator_depth;
4862 /* Nonzero if there were diagnosed errors in this designator list. */
4863 static int designator_erroneous;
4866 /* This stack has a level for each implicit or explicit level of
4867 structuring in the initializer, including the outermost one. It
4868 saves the values of most of the variables above. */
4870 struct constructor_range_stack;
4872 struct constructor_stack
4874 struct constructor_stack *next;
4879 tree unfilled_index;
4880 tree unfilled_fields;
4882 VEC(constructor_elt,gc) *elements;
4883 struct init_node *pending_elts;
4886 /* If value nonzero, this value should replace the entire
4887 constructor at this level. */
4888 struct c_expr replacement_value;
4889 struct constructor_range_stack *range_stack;
4899 static struct constructor_stack *constructor_stack;
4901 /* This stack represents designators from some range designator up to
4902 the last designator in the list. */
4904 struct constructor_range_stack
4906 struct constructor_range_stack *next, *prev;
4907 struct constructor_stack *stack;
4914 static struct constructor_range_stack *constructor_range_stack;
4916 /* This stack records separate initializers that are nested.
4917 Nested initializers can't happen in ANSI C, but GNU C allows them
4918 in cases like { ... (struct foo) { ... } ... }. */
4920 struct initializer_stack
4922 struct initializer_stack *next;
4924 struct constructor_stack *constructor_stack;
4925 struct constructor_range_stack *constructor_range_stack;
4926 VEC(constructor_elt,gc) *elements;
4927 struct spelling *spelling;
4928 struct spelling *spelling_base;
4931 char require_constant_value;
4932 char require_constant_elements;
4935 static struct initializer_stack *initializer_stack;
4937 /* Prepare to parse and output the initializer for variable DECL. */
4940 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
4943 struct initializer_stack *p = XNEW (struct initializer_stack);
4945 p->decl = constructor_decl;
4946 p->require_constant_value = require_constant_value;
4947 p->require_constant_elements = require_constant_elements;
4948 p->constructor_stack = constructor_stack;
4949 p->constructor_range_stack = constructor_range_stack;
4950 p->elements = constructor_elements;
4951 p->spelling = spelling;
4952 p->spelling_base = spelling_base;
4953 p->spelling_size = spelling_size;
4954 p->top_level = constructor_top_level;
4955 p->next = initializer_stack;
4956 initializer_stack = p;
4958 constructor_decl = decl;
4959 constructor_designated = 0;
4960 constructor_top_level = top_level;
4962 if (decl != 0 && decl != error_mark_node)
4964 require_constant_value = TREE_STATIC (decl);
4965 require_constant_elements
4966 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
4967 /* For a scalar, you can always use any value to initialize,
4968 even within braces. */
4969 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
4970 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
4971 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
4972 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
4973 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
4977 require_constant_value = 0;
4978 require_constant_elements = 0;
4979 locus = "(anonymous)";
4982 constructor_stack = 0;
4983 constructor_range_stack = 0;
4985 missing_braces_mentioned = 0;
4989 RESTORE_SPELLING_DEPTH (0);
4992 push_string (locus);
4998 struct initializer_stack *p = initializer_stack;
5000 /* Free the whole constructor stack of this initializer. */
5001 while (constructor_stack)
5003 struct constructor_stack *q = constructor_stack;
5004 constructor_stack = q->next;
5008 gcc_assert (!constructor_range_stack);
5010 /* Pop back to the data of the outer initializer (if any). */
5011 free (spelling_base);
5013 constructor_decl = p->decl;
5014 require_constant_value = p->require_constant_value;
5015 require_constant_elements = p->require_constant_elements;
5016 constructor_stack = p->constructor_stack;
5017 constructor_range_stack = p->constructor_range_stack;
5018 constructor_elements = p->elements;
5019 spelling = p->spelling;
5020 spelling_base = p->spelling_base;
5021 spelling_size = p->spelling_size;
5022 constructor_top_level = p->top_level;
5023 initializer_stack = p->next;
5027 /* Call here when we see the initializer is surrounded by braces.
5028 This is instead of a call to push_init_level;
5029 it is matched by a call to pop_init_level.
5031 TYPE is the type to initialize, for a constructor expression.
5032 For an initializer for a decl, TYPE is zero. */
5035 really_start_incremental_init (tree type)
5037 struct constructor_stack *p = XNEW (struct constructor_stack);
5040 type = TREE_TYPE (constructor_decl);
5042 if (targetm.vector_opaque_p (type))
5043 error ("opaque vector types cannot be initialized");
5045 p->type = constructor_type;
5046 p->fields = constructor_fields;
5047 p->index = constructor_index;
5048 p->max_index = constructor_max_index;
5049 p->unfilled_index = constructor_unfilled_index;
5050 p->unfilled_fields = constructor_unfilled_fields;
5051 p->bit_index = constructor_bit_index;
5052 p->elements = constructor_elements;
5053 p->constant = constructor_constant;
5054 p->simple = constructor_simple;
5055 p->erroneous = constructor_erroneous;
5056 p->pending_elts = constructor_pending_elts;
5057 p->depth = constructor_depth;
5058 p->replacement_value.value = 0;
5059 p->replacement_value.original_code = ERROR_MARK;
5063 p->incremental = constructor_incremental;
5064 p->designated = constructor_designated;
5066 constructor_stack = p;
5068 constructor_constant = 1;
5069 constructor_simple = 1;
5070 constructor_depth = SPELLING_DEPTH ();
5071 constructor_elements = 0;
5072 constructor_pending_elts = 0;
5073 constructor_type = type;
5074 constructor_incremental = 1;
5075 constructor_designated = 0;
5076 designator_depth = 0;
5077 designator_erroneous = 0;
5079 if (TREE_CODE (constructor_type) == RECORD_TYPE
5080 || TREE_CODE (constructor_type) == UNION_TYPE)
5082 constructor_fields = TYPE_FIELDS (constructor_type);
5083 /* Skip any nameless bit fields at the beginning. */
5084 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5085 && DECL_NAME (constructor_fields) == 0)
5086 constructor_fields = TREE_CHAIN (constructor_fields);
5088 constructor_unfilled_fields = constructor_fields;
5089 constructor_bit_index = bitsize_zero_node;
5091 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5093 if (TYPE_DOMAIN (constructor_type))
5095 constructor_max_index
5096 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5098 /* Detect non-empty initializations of zero-length arrays. */
5099 if (constructor_max_index == NULL_TREE
5100 && TYPE_SIZE (constructor_type))
5101 constructor_max_index = build_int_cst (NULL_TREE, -1);
5103 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5104 to initialize VLAs will cause a proper error; avoid tree
5105 checking errors as well by setting a safe value. */
5106 if (constructor_max_index
5107 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5108 constructor_max_index = build_int_cst (NULL_TREE, -1);
5111 = convert (bitsizetype,
5112 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5116 constructor_index = bitsize_zero_node;
5117 constructor_max_index = NULL_TREE;
5120 constructor_unfilled_index = constructor_index;
5122 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5124 /* Vectors are like simple fixed-size arrays. */
5125 constructor_max_index =
5126 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5127 constructor_index = bitsize_zero_node;
5128 constructor_unfilled_index = constructor_index;
5132 /* Handle the case of int x = {5}; */
5133 constructor_fields = constructor_type;
5134 constructor_unfilled_fields = constructor_type;
5138 /* Push down into a subobject, for initialization.
5139 If this is for an explicit set of braces, IMPLICIT is 0.
5140 If it is because the next element belongs at a lower level,
5141 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5144 push_init_level (int implicit)
5146 struct constructor_stack *p;
5147 tree value = NULL_TREE;
5149 /* If we've exhausted any levels that didn't have braces,
5150 pop them now. If implicit == 1, this will have been done in
5151 process_init_element; do not repeat it here because in the case
5152 of excess initializers for an empty aggregate this leads to an
5153 infinite cycle of popping a level and immediately recreating
5157 while (constructor_stack->implicit)
5159 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5160 || TREE_CODE (constructor_type) == UNION_TYPE)
5161 && constructor_fields == 0)
5162 process_init_element (pop_init_level (1));
5163 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5164 && constructor_max_index
5165 && tree_int_cst_lt (constructor_max_index,
5167 process_init_element (pop_init_level (1));
5173 /* Unless this is an explicit brace, we need to preserve previous
5177 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5178 || TREE_CODE (constructor_type) == UNION_TYPE)
5179 && constructor_fields)
5180 value = find_init_member (constructor_fields);
5181 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5182 value = find_init_member (constructor_index);
5185 p = XNEW (struct constructor_stack);
5186 p->type = constructor_type;
5187 p->fields = constructor_fields;
5188 p->index = constructor_index;
5189 p->max_index = constructor_max_index;
5190 p->unfilled_index = constructor_unfilled_index;
5191 p->unfilled_fields = constructor_unfilled_fields;
5192 p->bit_index = constructor_bit_index;
5193 p->elements = constructor_elements;
5194 p->constant = constructor_constant;
5195 p->simple = constructor_simple;
5196 p->erroneous = constructor_erroneous;
5197 p->pending_elts = constructor_pending_elts;
5198 p->depth = constructor_depth;
5199 p->replacement_value.value = 0;
5200 p->replacement_value.original_code = ERROR_MARK;
5201 p->implicit = implicit;
5203 p->incremental = constructor_incremental;
5204 p->designated = constructor_designated;
5205 p->next = constructor_stack;
5207 constructor_stack = p;
5209 constructor_constant = 1;
5210 constructor_simple = 1;
5211 constructor_depth = SPELLING_DEPTH ();
5212 constructor_elements = 0;
5213 constructor_incremental = 1;
5214 constructor_designated = 0;
5215 constructor_pending_elts = 0;
5218 p->range_stack = constructor_range_stack;
5219 constructor_range_stack = 0;
5220 designator_depth = 0;
5221 designator_erroneous = 0;
5224 /* Don't die if an entire brace-pair level is superfluous
5225 in the containing level. */
5226 if (constructor_type == 0)
5228 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5229 || TREE_CODE (constructor_type) == UNION_TYPE)
5231 /* Don't die if there are extra init elts at the end. */
5232 if (constructor_fields == 0)
5233 constructor_type = 0;
5236 constructor_type = TREE_TYPE (constructor_fields);
5237 push_member_name (constructor_fields);
5238 constructor_depth++;
5241 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5243 constructor_type = TREE_TYPE (constructor_type);
5244 push_array_bounds (tree_low_cst (constructor_index, 1));
5245 constructor_depth++;
5248 if (constructor_type == 0)
5250 error_init ("extra brace group at end of initializer");
5251 constructor_fields = 0;
5252 constructor_unfilled_fields = 0;
5256 if (value && TREE_CODE (value) == CONSTRUCTOR)
5258 constructor_constant = TREE_CONSTANT (value);
5259 constructor_simple = TREE_STATIC (value);
5260 constructor_elements = CONSTRUCTOR_ELTS (value);
5261 if (!VEC_empty (constructor_elt, constructor_elements)
5262 && (TREE_CODE (constructor_type) == RECORD_TYPE
5263 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5264 set_nonincremental_init ();
5267 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5269 missing_braces_mentioned = 1;
5270 warning_init ("missing braces around initializer");
5273 if (TREE_CODE (constructor_type) == RECORD_TYPE
5274 || TREE_CODE (constructor_type) == UNION_TYPE)
5276 constructor_fields = TYPE_FIELDS (constructor_type);
5277 /* Skip any nameless bit fields at the beginning. */
5278 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5279 && DECL_NAME (constructor_fields) == 0)
5280 constructor_fields = TREE_CHAIN (constructor_fields);
5282 constructor_unfilled_fields = constructor_fields;
5283 constructor_bit_index = bitsize_zero_node;
5285 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5287 /* Vectors are like simple fixed-size arrays. */
5288 constructor_max_index =
5289 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5290 constructor_index = convert (bitsizetype, integer_zero_node);
5291 constructor_unfilled_index = constructor_index;
5293 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5295 if (TYPE_DOMAIN (constructor_type))
5297 constructor_max_index
5298 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5300 /* Detect non-empty initializations of zero-length arrays. */
5301 if (constructor_max_index == NULL_TREE
5302 && TYPE_SIZE (constructor_type))
5303 constructor_max_index = build_int_cst (NULL_TREE, -1);
5305 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5306 to initialize VLAs will cause a proper error; avoid tree
5307 checking errors as well by setting a safe value. */
5308 if (constructor_max_index
5309 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5310 constructor_max_index = build_int_cst (NULL_TREE, -1);
5313 = convert (bitsizetype,
5314 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5317 constructor_index = bitsize_zero_node;
5319 constructor_unfilled_index = constructor_index;
5320 if (value && TREE_CODE (value) == STRING_CST)
5322 /* We need to split the char/wchar array into individual
5323 characters, so that we don't have to special case it
5325 set_nonincremental_init_from_string (value);
5330 if (constructor_type != error_mark_node)
5331 warning_init ("braces around scalar initializer");
5332 constructor_fields = constructor_type;
5333 constructor_unfilled_fields = constructor_type;
5337 /* At the end of an implicit or explicit brace level,
5338 finish up that level of constructor. If a single expression
5339 with redundant braces initialized that level, return the
5340 c_expr structure for that expression. Otherwise, the original_code
5341 element is set to ERROR_MARK.
5342 If we were outputting the elements as they are read, return 0 as the value
5343 from inner levels (process_init_element ignores that),
5344 but return error_mark_node as the value from the outermost level
5345 (that's what we want to put in DECL_INITIAL).
5346 Otherwise, return a CONSTRUCTOR expression as the value. */
5349 pop_init_level (int implicit)
5351 struct constructor_stack *p;
5354 ret.original_code = ERROR_MARK;
5358 /* When we come to an explicit close brace,
5359 pop any inner levels that didn't have explicit braces. */
5360 while (constructor_stack->implicit)
5361 process_init_element (pop_init_level (1));
5363 gcc_assert (!constructor_range_stack);
5366 /* Now output all pending elements. */
5367 constructor_incremental = 1;
5368 output_pending_init_elements (1);
5370 p = constructor_stack;
5372 /* Error for initializing a flexible array member, or a zero-length
5373 array member in an inappropriate context. */
5374 if (constructor_type && constructor_fields
5375 && TREE_CODE (constructor_type) == ARRAY_TYPE
5376 && TYPE_DOMAIN (constructor_type)
5377 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5379 /* Silently discard empty initializations. The parser will
5380 already have pedwarned for empty brackets. */
5381 if (integer_zerop (constructor_unfilled_index))
5382 constructor_type = NULL_TREE;
5385 gcc_assert (!TYPE_SIZE (constructor_type));
5387 if (constructor_depth > 2)
5388 error_init ("initialization of flexible array member in a nested context");
5390 pedwarn_init ("initialization of a flexible array member");
5392 /* We have already issued an error message for the existence
5393 of a flexible array member not at the end of the structure.
5394 Discard the initializer so that we do not die later. */
5395 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5396 constructor_type = NULL_TREE;
5400 /* Warn when some struct elements are implicitly initialized to zero. */
5401 if (warn_missing_field_initializers
5403 && TREE_CODE (constructor_type) == RECORD_TYPE
5404 && constructor_unfilled_fields)
5406 /* Do not warn for flexible array members or zero-length arrays. */
5407 while (constructor_unfilled_fields
5408 && (!DECL_SIZE (constructor_unfilled_fields)
5409 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5410 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5412 /* Do not warn if this level of the initializer uses member
5413 designators; it is likely to be deliberate. */
5414 if (constructor_unfilled_fields && !constructor_designated)
5416 push_member_name (constructor_unfilled_fields);
5417 warning_init ("missing initializer");
5418 RESTORE_SPELLING_DEPTH (constructor_depth);
5422 /* Pad out the end of the structure. */
5423 if (p->replacement_value.value)
5424 /* If this closes a superfluous brace pair,
5425 just pass out the element between them. */
5426 ret = p->replacement_value;
5427 else if (constructor_type == 0)
5429 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5430 && TREE_CODE (constructor_type) != UNION_TYPE
5431 && TREE_CODE (constructor_type) != ARRAY_TYPE
5432 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5434 /* A nonincremental scalar initializer--just return
5435 the element, after verifying there is just one. */
5436 if (VEC_empty (constructor_elt,constructor_elements))
5438 if (!constructor_erroneous)
5439 error_init ("empty scalar initializer");
5440 ret.value = error_mark_node;
5442 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5444 error_init ("extra elements in scalar initializer");
5445 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5448 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5452 if (constructor_erroneous)
5453 ret.value = error_mark_node;
5456 ret.value = build_constructor (constructor_type,
5457 constructor_elements);
5458 if (constructor_constant)
5459 TREE_CONSTANT (ret.value) = TREE_INVARIANT (ret.value) = 1;
5460 if (constructor_constant && constructor_simple)
5461 TREE_STATIC (ret.value) = 1;
5465 constructor_type = p->type;
5466 constructor_fields = p->fields;
5467 constructor_index = p->index;
5468 constructor_max_index = p->max_index;
5469 constructor_unfilled_index = p->unfilled_index;
5470 constructor_unfilled_fields = p->unfilled_fields;
5471 constructor_bit_index = p->bit_index;
5472 constructor_elements = p->elements;
5473 constructor_constant = p->constant;
5474 constructor_simple = p->simple;
5475 constructor_erroneous = p->erroneous;
5476 constructor_incremental = p->incremental;
5477 constructor_designated = p->designated;
5478 constructor_pending_elts = p->pending_elts;
5479 constructor_depth = p->depth;
5481 constructor_range_stack = p->range_stack;
5482 RESTORE_SPELLING_DEPTH (constructor_depth);
5484 constructor_stack = p->next;
5487 if (ret.value == 0 && constructor_stack == 0)
5488 ret.value = error_mark_node;
5492 /* Common handling for both array range and field name designators.
5493 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5496 set_designator (int array)
5499 enum tree_code subcode;
5501 /* Don't die if an entire brace-pair level is superfluous
5502 in the containing level. */
5503 if (constructor_type == 0)
5506 /* If there were errors in this designator list already, bail out
5508 if (designator_erroneous)
5511 if (!designator_depth)
5513 gcc_assert (!constructor_range_stack);
5515 /* Designator list starts at the level of closest explicit
5517 while (constructor_stack->implicit)
5518 process_init_element (pop_init_level (1));
5519 constructor_designated = 1;
5523 switch (TREE_CODE (constructor_type))
5527 subtype = TREE_TYPE (constructor_fields);
5528 if (subtype != error_mark_node)
5529 subtype = TYPE_MAIN_VARIANT (subtype);
5532 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5538 subcode = TREE_CODE (subtype);
5539 if (array && subcode != ARRAY_TYPE)
5541 error_init ("array index in non-array initializer");
5544 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5546 error_init ("field name not in record or union initializer");
5550 constructor_designated = 1;
5551 push_init_level (2);
5555 /* If there are range designators in designator list, push a new designator
5556 to constructor_range_stack. RANGE_END is end of such stack range or
5557 NULL_TREE if there is no range designator at this level. */
5560 push_range_stack (tree range_end)
5562 struct constructor_range_stack *p;
5564 p = GGC_NEW (struct constructor_range_stack);
5565 p->prev = constructor_range_stack;
5567 p->fields = constructor_fields;
5568 p->range_start = constructor_index;
5569 p->index = constructor_index;
5570 p->stack = constructor_stack;
5571 p->range_end = range_end;
5572 if (constructor_range_stack)
5573 constructor_range_stack->next = p;
5574 constructor_range_stack = p;
5577 /* Within an array initializer, specify the next index to be initialized.
5578 FIRST is that index. If LAST is nonzero, then initialize a range
5579 of indices, running from FIRST through LAST. */
5582 set_init_index (tree first, tree last)
5584 if (set_designator (1))
5587 designator_erroneous = 1;
5589 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5590 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5592 error_init ("array index in initializer not of integer type");
5596 if (TREE_CODE (first) != INTEGER_CST)
5597 error_init ("nonconstant array index in initializer");
5598 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5599 error_init ("nonconstant array index in initializer");
5600 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5601 error_init ("array index in non-array initializer");
5602 else if (tree_int_cst_sgn (first) == -1)
5603 error_init ("array index in initializer exceeds array bounds");
5604 else if (constructor_max_index
5605 && tree_int_cst_lt (constructor_max_index, first))
5606 error_init ("array index in initializer exceeds array bounds");
5609 constructor_index = convert (bitsizetype, first);
5613 if (tree_int_cst_equal (first, last))
5615 else if (tree_int_cst_lt (last, first))
5617 error_init ("empty index range in initializer");
5622 last = convert (bitsizetype, last);
5623 if (constructor_max_index != 0
5624 && tree_int_cst_lt (constructor_max_index, last))
5626 error_init ("array index range in initializer exceeds array bounds");
5633 designator_erroneous = 0;
5634 if (constructor_range_stack || last)
5635 push_range_stack (last);
5639 /* Within a struct initializer, specify the next field to be initialized. */
5642 set_init_label (tree fieldname)
5646 if (set_designator (0))
5649 designator_erroneous = 1;
5651 if (TREE_CODE (constructor_type) != RECORD_TYPE
5652 && TREE_CODE (constructor_type) != UNION_TYPE)
5654 error_init ("field name not in record or union initializer");
5658 for (tail = TYPE_FIELDS (constructor_type); tail;
5659 tail = TREE_CHAIN (tail))
5661 if (DECL_NAME (tail) == fieldname)
5666 error ("unknown field %qE specified in initializer", fieldname);
5669 constructor_fields = tail;
5671 designator_erroneous = 0;
5672 if (constructor_range_stack)
5673 push_range_stack (NULL_TREE);
5677 /* Add a new initializer to the tree of pending initializers. PURPOSE
5678 identifies the initializer, either array index or field in a structure.
5679 VALUE is the value of that index or field. */
5682 add_pending_init (tree purpose, tree value)
5684 struct init_node *p, **q, *r;
5686 q = &constructor_pending_elts;
5689 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5694 if (tree_int_cst_lt (purpose, p->purpose))
5696 else if (tree_int_cst_lt (p->purpose, purpose))
5700 if (TREE_SIDE_EFFECTS (p->value))
5701 warning_init ("initialized field with side-effects overwritten");
5711 bitpos = bit_position (purpose);
5715 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5717 else if (p->purpose != purpose)
5721 if (TREE_SIDE_EFFECTS (p->value))
5722 warning_init ("initialized field with side-effects 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");
6196 /* We can have just one union field set. */
6197 constructor_elements = 0;
6200 /* Otherwise, output this element either to
6201 constructor_elements or to the assembler file. */
6203 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6204 celt->index = field;
6205 celt->value = value;
6207 /* Advance the variable that indicates sequential elements output. */
6208 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6209 constructor_unfilled_index
6210 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6212 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6214 constructor_unfilled_fields
6215 = TREE_CHAIN (constructor_unfilled_fields);
6217 /* Skip any nameless bit fields. */
6218 while (constructor_unfilled_fields != 0
6219 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6220 && DECL_NAME (constructor_unfilled_fields) == 0)
6221 constructor_unfilled_fields =
6222 TREE_CHAIN (constructor_unfilled_fields);
6224 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6225 constructor_unfilled_fields = 0;
6227 /* Now output any pending elements which have become next. */
6229 output_pending_init_elements (0);
6232 /* Output any pending elements which have become next.
6233 As we output elements, constructor_unfilled_{fields,index}
6234 advances, which may cause other elements to become next;
6235 if so, they too are output.
6237 If ALL is 0, we return when there are
6238 no more pending elements to output now.
6240 If ALL is 1, we output space as necessary so that
6241 we can output all the pending elements. */
6244 output_pending_init_elements (int all)
6246 struct init_node *elt = constructor_pending_elts;
6251 /* Look through the whole pending tree.
6252 If we find an element that should be output now,
6253 output it. Otherwise, set NEXT to the element
6254 that comes first among those still pending. */
6259 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6261 if (tree_int_cst_equal (elt->purpose,
6262 constructor_unfilled_index))
6263 output_init_element (elt->value, true,
6264 TREE_TYPE (constructor_type),
6265 constructor_unfilled_index, 0);
6266 else if (tree_int_cst_lt (constructor_unfilled_index,
6269 /* Advance to the next smaller node. */
6274 /* We have reached the smallest node bigger than the
6275 current unfilled index. Fill the space first. */
6276 next = elt->purpose;
6282 /* Advance to the next bigger node. */
6287 /* We have reached the biggest node in a subtree. Find
6288 the parent of it, which is the next bigger node. */
6289 while (elt->parent && elt->parent->right == elt)
6292 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6295 next = elt->purpose;
6301 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6302 || TREE_CODE (constructor_type) == UNION_TYPE)
6304 tree ctor_unfilled_bitpos, elt_bitpos;
6306 /* If the current record is complete we are done. */
6307 if (constructor_unfilled_fields == 0)
6310 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6311 elt_bitpos = bit_position (elt->purpose);
6312 /* We can't compare fields here because there might be empty
6313 fields in between. */
6314 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6316 constructor_unfilled_fields = elt->purpose;
6317 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6320 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6322 /* Advance to the next smaller node. */
6327 /* We have reached the smallest node bigger than the
6328 current unfilled field. Fill the space first. */
6329 next = elt->purpose;
6335 /* Advance to the next bigger node. */
6340 /* We have reached the biggest node in a subtree. Find
6341 the parent of it, which is the next bigger node. */
6342 while (elt->parent && elt->parent->right == elt)
6346 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6347 bit_position (elt->purpose))))
6349 next = elt->purpose;
6357 /* Ordinarily return, but not if we want to output all
6358 and there are elements left. */
6359 if (!(all && next != 0))
6362 /* If it's not incremental, just skip over the gap, so that after
6363 jumping to retry we will output the next successive element. */
6364 if (TREE_CODE (constructor_type) == RECORD_TYPE
6365 || TREE_CODE (constructor_type) == UNION_TYPE)
6366 constructor_unfilled_fields = next;
6367 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6368 constructor_unfilled_index = next;
6370 /* ELT now points to the node in the pending tree with the next
6371 initializer to output. */
6375 /* Add one non-braced element to the current constructor level.
6376 This adjusts the current position within the constructor's type.
6377 This may also start or terminate implicit levels
6378 to handle a partly-braced initializer.
6380 Once this has found the correct level for the new element,
6381 it calls output_init_element. */
6384 process_init_element (struct c_expr value)
6386 tree orig_value = value.value;
6387 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6388 bool strict_string = value.original_code == STRING_CST;
6390 designator_depth = 0;
6391 designator_erroneous = 0;
6393 /* Handle superfluous braces around string cst as in
6394 char x[] = {"foo"}; */
6397 && TREE_CODE (constructor_type) == ARRAY_TYPE
6398 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6399 && integer_zerop (constructor_unfilled_index))
6401 if (constructor_stack->replacement_value.value)
6402 error_init ("excess elements in char array initializer");
6403 constructor_stack->replacement_value = value;
6407 if (constructor_stack->replacement_value.value != 0)
6409 error_init ("excess elements in struct initializer");
6413 /* Ignore elements of a brace group if it is entirely superfluous
6414 and has already been diagnosed. */
6415 if (constructor_type == 0)
6418 /* If we've exhausted any levels that didn't have braces,
6420 while (constructor_stack->implicit)
6422 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6423 || TREE_CODE (constructor_type) == UNION_TYPE)
6424 && constructor_fields == 0)
6425 process_init_element (pop_init_level (1));
6426 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6427 && (constructor_max_index == 0
6428 || tree_int_cst_lt (constructor_max_index,
6429 constructor_index)))
6430 process_init_element (pop_init_level (1));
6435 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6436 if (constructor_range_stack)
6438 /* If value is a compound literal and we'll be just using its
6439 content, don't put it into a SAVE_EXPR. */
6440 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6441 || !require_constant_value
6443 value.value = save_expr (value.value);
6448 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6451 enum tree_code fieldcode;
6453 if (constructor_fields == 0)
6455 pedwarn_init ("excess elements in struct initializer");
6459 fieldtype = TREE_TYPE (constructor_fields);
6460 if (fieldtype != error_mark_node)
6461 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6462 fieldcode = TREE_CODE (fieldtype);
6464 /* Error for non-static initialization of a flexible array member. */
6465 if (fieldcode == ARRAY_TYPE
6466 && !require_constant_value
6467 && TYPE_SIZE (fieldtype) == NULL_TREE
6468 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6470 error_init ("non-static initialization of a flexible array member");
6474 /* Accept a string constant to initialize a subarray. */
6475 if (value.value != 0
6476 && fieldcode == ARRAY_TYPE
6477 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6479 value.value = orig_value;
6480 /* Otherwise, if we have come to a subaggregate,
6481 and we don't have an element of its type, push into it. */
6482 else if (value.value != 0
6483 && value.value != error_mark_node
6484 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6485 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6486 || fieldcode == UNION_TYPE))
6488 push_init_level (1);
6494 push_member_name (constructor_fields);
6495 output_init_element (value.value, strict_string,
6496 fieldtype, constructor_fields, 1);
6497 RESTORE_SPELLING_DEPTH (constructor_depth);
6500 /* Do the bookkeeping for an element that was
6501 directly output as a constructor. */
6503 /* For a record, keep track of end position of last field. */
6504 if (DECL_SIZE (constructor_fields))
6505 constructor_bit_index
6506 = size_binop (PLUS_EXPR,
6507 bit_position (constructor_fields),
6508 DECL_SIZE (constructor_fields));
6510 /* If the current field was the first one not yet written out,
6511 it isn't now, so update. */
6512 if (constructor_unfilled_fields == constructor_fields)
6514 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6515 /* Skip any nameless bit fields. */
6516 while (constructor_unfilled_fields != 0
6517 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6518 && DECL_NAME (constructor_unfilled_fields) == 0)
6519 constructor_unfilled_fields =
6520 TREE_CHAIN (constructor_unfilled_fields);
6524 constructor_fields = TREE_CHAIN (constructor_fields);
6525 /* Skip any nameless bit fields at the beginning. */
6526 while (constructor_fields != 0
6527 && DECL_C_BIT_FIELD (constructor_fields)
6528 && DECL_NAME (constructor_fields) == 0)
6529 constructor_fields = TREE_CHAIN (constructor_fields);
6531 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6534 enum tree_code fieldcode;
6536 if (constructor_fields == 0)
6538 pedwarn_init ("excess elements in union initializer");
6542 fieldtype = TREE_TYPE (constructor_fields);
6543 if (fieldtype != error_mark_node)
6544 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6545 fieldcode = TREE_CODE (fieldtype);
6547 /* Warn that traditional C rejects initialization of unions.
6548 We skip the warning if the value is zero. This is done
6549 under the assumption that the zero initializer in user
6550 code appears conditioned on e.g. __STDC__ to avoid
6551 "missing initializer" warnings and relies on default
6552 initialization to zero in the traditional C case.
6553 We also skip the warning if the initializer is designated,
6554 again on the assumption that this must be conditional on
6555 __STDC__ anyway (and we've already complained about the
6556 member-designator already). */
6557 if (!in_system_header && !constructor_designated
6558 && !(value.value && (integer_zerop (value.value)
6559 || real_zerop (value.value))))
6560 warning (OPT_Wtraditional, "traditional C rejects initialization "
6563 /* Accept a string constant to initialize a subarray. */
6564 if (value.value != 0
6565 && fieldcode == ARRAY_TYPE
6566 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6568 value.value = orig_value;
6569 /* Otherwise, if we have come to a subaggregate,
6570 and we don't have an element of its type, push into it. */
6571 else if (value.value != 0
6572 && value.value != error_mark_node
6573 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6574 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6575 || fieldcode == UNION_TYPE))
6577 push_init_level (1);
6583 push_member_name (constructor_fields);
6584 output_init_element (value.value, strict_string,
6585 fieldtype, constructor_fields, 1);
6586 RESTORE_SPELLING_DEPTH (constructor_depth);
6589 /* Do the bookkeeping for an element that was
6590 directly output as a constructor. */
6592 constructor_bit_index = DECL_SIZE (constructor_fields);
6593 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6596 constructor_fields = 0;
6598 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6600 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6601 enum tree_code eltcode = TREE_CODE (elttype);
6603 /* Accept a string constant to initialize a subarray. */
6604 if (value.value != 0
6605 && eltcode == ARRAY_TYPE
6606 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6608 value.value = orig_value;
6609 /* Otherwise, if we have come to a subaggregate,
6610 and we don't have an element of its type, push into it. */
6611 else if (value.value != 0
6612 && value.value != error_mark_node
6613 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6614 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6615 || eltcode == UNION_TYPE))
6617 push_init_level (1);
6621 if (constructor_max_index != 0
6622 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6623 || integer_all_onesp (constructor_max_index)))
6625 pedwarn_init ("excess elements in array initializer");
6629 /* Now output the actual element. */
6632 push_array_bounds (tree_low_cst (constructor_index, 1));
6633 output_init_element (value.value, strict_string,
6634 elttype, constructor_index, 1);
6635 RESTORE_SPELLING_DEPTH (constructor_depth);
6639 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6642 /* If we are doing the bookkeeping for an element that was
6643 directly output as a constructor, we must update
6644 constructor_unfilled_index. */
6645 constructor_unfilled_index = constructor_index;
6647 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6649 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6651 /* Do a basic check of initializer size. Note that vectors
6652 always have a fixed size derived from their type. */
6653 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6655 pedwarn_init ("excess elements in vector initializer");
6659 /* Now output the actual element. */
6661 output_init_element (value.value, strict_string,
6662 elttype, constructor_index, 1);
6665 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6668 /* If we are doing the bookkeeping for an element that was
6669 directly output as a constructor, we must update
6670 constructor_unfilled_index. */
6671 constructor_unfilled_index = constructor_index;
6674 /* Handle the sole element allowed in a braced initializer
6675 for a scalar variable. */
6676 else if (constructor_type != error_mark_node
6677 && constructor_fields == 0)
6679 pedwarn_init ("excess elements in scalar initializer");
6685 output_init_element (value.value, strict_string,
6686 constructor_type, NULL_TREE, 1);
6687 constructor_fields = 0;
6690 /* Handle range initializers either at this level or anywhere higher
6691 in the designator stack. */
6692 if (constructor_range_stack)
6694 struct constructor_range_stack *p, *range_stack;
6697 range_stack = constructor_range_stack;
6698 constructor_range_stack = 0;
6699 while (constructor_stack != range_stack->stack)
6701 gcc_assert (constructor_stack->implicit);
6702 process_init_element (pop_init_level (1));
6704 for (p = range_stack;
6705 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6708 gcc_assert (constructor_stack->implicit);
6709 process_init_element (pop_init_level (1));
6712 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6713 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6718 constructor_index = p->index;
6719 constructor_fields = p->fields;
6720 if (finish && p->range_end && p->index == p->range_start)
6728 push_init_level (2);
6729 p->stack = constructor_stack;
6730 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6731 p->index = p->range_start;
6735 constructor_range_stack = range_stack;
6742 constructor_range_stack = 0;
6745 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6746 (guaranteed to be 'volatile' or null) and ARGS (represented using
6747 an ASM_EXPR node). */
6749 build_asm_stmt (tree cv_qualifier, tree args)
6751 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6752 ASM_VOLATILE_P (args) = 1;
6753 return add_stmt (args);
6756 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6757 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6758 SIMPLE indicates whether there was anything at all after the
6759 string in the asm expression -- asm("blah") and asm("blah" : )
6760 are subtly different. We use a ASM_EXPR node to represent this. */
6762 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6768 const char *constraint;
6769 const char **oconstraints;
6770 bool allows_mem, allows_reg, is_inout;
6771 int ninputs, noutputs;
6773 ninputs = list_length (inputs);
6774 noutputs = list_length (outputs);
6775 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
6777 string = resolve_asm_operand_names (string, outputs, inputs);
6779 /* Remove output conversions that change the type but not the mode. */
6780 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6782 tree output = TREE_VALUE (tail);
6784 /* ??? Really, this should not be here. Users should be using a
6785 proper lvalue, dammit. But there's a long history of using casts
6786 in the output operands. In cases like longlong.h, this becomes a
6787 primitive form of typechecking -- if the cast can be removed, then
6788 the output operand had a type of the proper width; otherwise we'll
6789 get an error. Gross, but ... */
6790 STRIP_NOPS (output);
6792 if (!lvalue_or_else (output, lv_asm))
6793 output = error_mark_node;
6795 if (output != error_mark_node
6796 && (TREE_READONLY (output)
6797 || TYPE_READONLY (TREE_TYPE (output))
6798 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
6799 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
6800 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
6801 readonly_error (output, lv_asm);
6803 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6804 oconstraints[i] = constraint;
6806 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6807 &allows_mem, &allows_reg, &is_inout))
6809 /* If the operand is going to end up in memory,
6810 mark it addressable. */
6811 if (!allows_reg && !c_mark_addressable (output))
6812 output = error_mark_node;
6815 output = error_mark_node;
6817 TREE_VALUE (tail) = output;
6820 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
6824 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6825 input = TREE_VALUE (tail);
6827 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
6828 oconstraints, &allows_mem, &allows_reg))
6830 /* If the operand is going to end up in memory,
6831 mark it addressable. */
6832 if (!allows_reg && allows_mem)
6834 /* Strip the nops as we allow this case. FIXME, this really
6835 should be rejected or made deprecated. */
6837 if (!c_mark_addressable (input))
6838 input = error_mark_node;
6842 input = error_mark_node;
6844 TREE_VALUE (tail) = input;
6847 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
6849 /* asm statements without outputs, including simple ones, are treated
6851 ASM_INPUT_P (args) = simple;
6852 ASM_VOLATILE_P (args) = (noutputs == 0);
6857 /* Generate a goto statement to LABEL. */
6860 c_finish_goto_label (tree label)
6862 tree decl = lookup_label (label);
6866 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
6868 error ("jump into statement expression");
6872 if (C_DECL_UNJUMPABLE_VM (decl))
6874 error ("jump into scope of identifier with variably modified type");
6878 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
6880 /* No jump from outside this statement expression context, so
6881 record that there is a jump from within this context. */
6882 struct c_label_list *nlist;
6883 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6884 nlist->next = label_context_stack_se->labels_used;
6885 nlist->label = decl;
6886 label_context_stack_se->labels_used = nlist;
6889 if (!C_DECL_UNDEFINABLE_VM (decl))
6891 /* No jump from outside this context context of identifiers with
6892 variably modified type, so record that there is a jump from
6893 within this context. */
6894 struct c_label_list *nlist;
6895 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6896 nlist->next = label_context_stack_vm->labels_used;
6897 nlist->label = decl;
6898 label_context_stack_vm->labels_used = nlist;
6901 TREE_USED (decl) = 1;
6902 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
6905 /* Generate a computed goto statement to EXPR. */
6908 c_finish_goto_ptr (tree expr)
6911 pedwarn ("ISO C forbids %<goto *expr;%>");
6912 expr = convert (ptr_type_node, expr);
6913 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
6916 /* Generate a C `return' statement. RETVAL is the expression for what
6917 to return, or a null pointer for `return;' with no value. */
6920 c_finish_return (tree retval)
6922 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
6923 bool no_warning = false;
6925 if (TREE_THIS_VOLATILE (current_function_decl))
6926 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6930 current_function_returns_null = 1;
6931 if ((warn_return_type || flag_isoc99)
6932 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
6934 pedwarn_c99 ("%<return%> with no value, in "
6935 "function returning non-void");
6939 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
6941 current_function_returns_null = 1;
6942 if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
6943 pedwarn ("%<return%> with a value, in function returning void");
6947 tree t = convert_for_assignment (valtype, retval, ic_return,
6948 NULL_TREE, NULL_TREE, 0);
6949 tree res = DECL_RESULT (current_function_decl);
6952 current_function_returns_value = 1;
6953 if (t == error_mark_node)
6956 inner = t = convert (TREE_TYPE (res), t);
6958 /* Strip any conversions, additions, and subtractions, and see if
6959 we are returning the address of a local variable. Warn if so. */
6962 switch (TREE_CODE (inner))
6964 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6966 inner = TREE_OPERAND (inner, 0);
6970 /* If the second operand of the MINUS_EXPR has a pointer
6971 type (or is converted from it), this may be valid, so
6972 don't give a warning. */
6974 tree op1 = TREE_OPERAND (inner, 1);
6976 while (!POINTER_TYPE_P (TREE_TYPE (op1))
6977 && (TREE_CODE (op1) == NOP_EXPR
6978 || TREE_CODE (op1) == NON_LVALUE_EXPR
6979 || TREE_CODE (op1) == CONVERT_EXPR))
6980 op1 = TREE_OPERAND (op1, 0);
6982 if (POINTER_TYPE_P (TREE_TYPE (op1)))
6985 inner = TREE_OPERAND (inner, 0);
6990 inner = TREE_OPERAND (inner, 0);
6992 while (REFERENCE_CLASS_P (inner)
6993 && TREE_CODE (inner) != INDIRECT_REF)
6994 inner = TREE_OPERAND (inner, 0);
6997 && !DECL_EXTERNAL (inner)
6998 && !TREE_STATIC (inner)
6999 && DECL_CONTEXT (inner) == current_function_decl)
7000 warning (0, "function returns address of local variable");
7010 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7013 ret_stmt = build_stmt (RETURN_EXPR, retval);
7014 TREE_NO_WARNING (ret_stmt) |= no_warning;
7015 return add_stmt (ret_stmt);
7019 /* The SWITCH_EXPR being built. */
7022 /* The original type of the testing expression, i.e. before the
7023 default conversion is applied. */
7026 /* A splay-tree mapping the low element of a case range to the high
7027 element, or NULL_TREE if there is no high element. Used to
7028 determine whether or not a new case label duplicates an old case
7029 label. We need a tree, rather than simply a hash table, because
7030 of the GNU case range extension. */
7033 /* Number of nested statement expressions within this switch
7034 statement; if nonzero, case and default labels may not
7036 unsigned int blocked_stmt_expr;
7038 /* Scope of outermost declarations of identifiers with variably
7039 modified type within this switch statement; if nonzero, case and
7040 default labels may not appear. */
7041 unsigned int blocked_vm;
7043 /* The next node on the stack. */
7044 struct c_switch *next;
7047 /* A stack of the currently active switch statements. The innermost
7048 switch statement is on the top of the stack. There is no need to
7049 mark the stack for garbage collection because it is only active
7050 during the processing of the body of a function, and we never
7051 collect at that point. */
7053 struct c_switch *c_switch_stack;
7055 /* Start a C switch statement, testing expression EXP. Return the new
7059 c_start_case (tree exp)
7061 enum tree_code code;
7062 tree type, orig_type = error_mark_node;
7063 struct c_switch *cs;
7065 if (exp != error_mark_node)
7067 code = TREE_CODE (TREE_TYPE (exp));
7068 orig_type = TREE_TYPE (exp);
7070 if (!INTEGRAL_TYPE_P (orig_type)
7071 && code != ERROR_MARK)
7073 error ("switch quantity not an integer");
7074 exp = integer_zero_node;
7075 orig_type = error_mark_node;
7079 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7081 if (!in_system_header
7082 && (type == long_integer_type_node
7083 || type == long_unsigned_type_node))
7084 warning (OPT_Wtraditional, "%<long%> switch expression not "
7085 "converted to %<int%> in ISO C");
7087 exp = default_conversion (exp);
7088 type = TREE_TYPE (exp);
7092 /* Add this new SWITCH_EXPR to the stack. */
7093 cs = XNEW (struct c_switch);
7094 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7095 cs->orig_type = orig_type;
7096 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7097 cs->blocked_stmt_expr = 0;
7099 cs->next = c_switch_stack;
7100 c_switch_stack = cs;
7102 return add_stmt (cs->switch_expr);
7105 /* Process a case label. */
7108 do_case (tree low_value, tree high_value)
7110 tree label = NULL_TREE;
7112 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7113 && !c_switch_stack->blocked_vm)
7115 label = c_add_case_label (c_switch_stack->cases,
7116 SWITCH_COND (c_switch_stack->switch_expr),
7117 c_switch_stack->orig_type,
7118 low_value, high_value);
7119 if (label == error_mark_node)
7122 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7125 error ("case label in statement expression not containing "
7126 "enclosing switch statement");
7128 error ("%<default%> label in statement expression not containing "
7129 "enclosing switch statement");
7131 else if (c_switch_stack && c_switch_stack->blocked_vm)
7134 error ("case label in scope of identifier with variably modified "
7135 "type not containing enclosing switch statement");
7137 error ("%<default%> label in scope of identifier with variably "
7138 "modified type not containing enclosing switch statement");
7141 error ("case label not within a switch statement");
7143 error ("%<default%> label not within a switch statement");
7148 /* Finish the switch statement. */
7151 c_finish_case (tree body)
7153 struct c_switch *cs = c_switch_stack;
7154 location_t switch_location;
7156 SWITCH_BODY (cs->switch_expr) = body;
7158 /* We must not be within a statement expression nested in the switch
7159 at this point; we might, however, be within the scope of an
7160 identifier with variably modified type nested in the switch. */
7161 gcc_assert (!cs->blocked_stmt_expr);
7163 /* Emit warnings as needed. */
7164 if (EXPR_HAS_LOCATION (cs->switch_expr))
7165 switch_location = EXPR_LOCATION (cs->switch_expr);
7167 switch_location = input_location;
7168 c_do_switch_warnings (cs->cases, switch_location,
7169 TREE_TYPE (cs->switch_expr),
7170 SWITCH_COND (cs->switch_expr));
7172 /* Pop the stack. */
7173 c_switch_stack = cs->next;
7174 splay_tree_delete (cs->cases);
7178 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7179 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7180 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7181 statement, and was not surrounded with parenthesis. */
7184 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7185 tree else_block, bool nested_if)
7189 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7190 if (warn_parentheses && nested_if && else_block == NULL)
7192 tree inner_if = then_block;
7194 /* We know from the grammar productions that there is an IF nested
7195 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7196 it might not be exactly THEN_BLOCK, but should be the last
7197 non-container statement within. */
7199 switch (TREE_CODE (inner_if))
7204 inner_if = BIND_EXPR_BODY (inner_if);
7206 case STATEMENT_LIST:
7207 inner_if = expr_last (then_block);
7209 case TRY_FINALLY_EXPR:
7210 case TRY_CATCH_EXPR:
7211 inner_if = TREE_OPERAND (inner_if, 0);
7218 if (COND_EXPR_ELSE (inner_if))
7219 warning (OPT_Wparentheses,
7220 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7224 empty_body_warning (then_block, else_block);
7226 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7227 SET_EXPR_LOCATION (stmt, if_locus);
7231 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7232 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7233 is false for DO loops. INCR is the FOR increment expression. BODY is
7234 the statement controlled by the loop. BLAB is the break label. CLAB is
7235 the continue label. Everything is allowed to be NULL. */
7238 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7239 tree blab, tree clab, bool cond_is_first)
7241 tree entry = NULL, exit = NULL, t;
7243 /* If the condition is zero don't generate a loop construct. */
7244 if (cond && integer_zerop (cond))
7248 t = build_and_jump (&blab);
7249 SET_EXPR_LOCATION (t, start_locus);
7255 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7257 /* If we have an exit condition, then we build an IF with gotos either
7258 out of the loop, or to the top of it. If there's no exit condition,
7259 then we just build a jump back to the top. */
7260 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7262 if (cond && !integer_nonzerop (cond))
7264 /* Canonicalize the loop condition to the end. This means
7265 generating a branch to the loop condition. Reuse the
7266 continue label, if possible. */
7271 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7272 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7275 t = build1 (GOTO_EXPR, void_type_node, clab);
7276 SET_EXPR_LOCATION (t, start_locus);
7280 t = build_and_jump (&blab);
7281 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7283 SET_EXPR_LOCATION (exit, start_locus);
7285 SET_EXPR_LOCATION (exit, input_location);
7294 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7302 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7306 c_finish_bc_stmt (tree *label_p, bool is_break)
7309 tree label = *label_p;
7311 /* In switch statements break is sometimes stylistically used after
7312 a return statement. This can lead to spurious warnings about
7313 control reaching the end of a non-void function when it is
7314 inlined. Note that we are calling block_may_fallthru with
7315 language specific tree nodes; this works because
7316 block_may_fallthru returns true when given something it does not
7318 skip = !block_may_fallthru (cur_stmt_list);
7323 *label_p = label = create_artificial_label ();
7325 else if (TREE_CODE (label) == LABEL_DECL)
7327 else switch (TREE_INT_CST_LOW (label))
7331 error ("break statement not within loop or switch");
7333 error ("continue statement not within a loop");
7337 gcc_assert (is_break);
7338 error ("break statement used with OpenMP for loop");
7348 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7351 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7354 emit_side_effect_warnings (tree expr)
7356 if (expr == error_mark_node)
7358 else if (!TREE_SIDE_EFFECTS (expr))
7360 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7361 warning (0, "%Hstatement with no effect",
7362 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7364 else if (warn_unused_value)
7365 warn_if_unused_value (expr, input_location);
7368 /* Process an expression as if it were a complete statement. Emit
7369 diagnostics, but do not call ADD_STMT. */
7372 c_process_expr_stmt (tree expr)
7377 if (warn_sequence_point)
7378 verify_sequence_points (expr);
7380 if (TREE_TYPE (expr) != error_mark_node
7381 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7382 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7383 error ("expression statement has incomplete type");
7385 /* If we're not processing a statement expression, warn about unused values.
7386 Warnings for statement expressions will be emitted later, once we figure
7387 out which is the result. */
7388 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7389 && (extra_warnings || warn_unused_value))
7390 emit_side_effect_warnings (expr);
7392 /* If the expression is not of a type to which we cannot assign a line
7393 number, wrap the thing in a no-op NOP_EXPR. */
7394 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7395 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7398 SET_EXPR_LOCATION (expr, input_location);
7403 /* Emit an expression as a statement. */
7406 c_finish_expr_stmt (tree expr)
7409 return add_stmt (c_process_expr_stmt (expr));
7414 /* Do the opposite and emit a statement as an expression. To begin,
7415 create a new binding level and return it. */
7418 c_begin_stmt_expr (void)
7421 struct c_label_context_se *nstack;
7422 struct c_label_list *glist;
7424 /* We must force a BLOCK for this level so that, if it is not expanded
7425 later, there is a way to turn off the entire subtree of blocks that
7426 are contained in it. */
7428 ret = c_begin_compound_stmt (true);
7431 c_switch_stack->blocked_stmt_expr++;
7432 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7434 for (glist = label_context_stack_se->labels_used;
7436 glist = glist->next)
7438 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7440 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7441 nstack->labels_def = NULL;
7442 nstack->labels_used = NULL;
7443 nstack->next = label_context_stack_se;
7444 label_context_stack_se = nstack;
7446 /* Mark the current statement list as belonging to a statement list. */
7447 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7453 c_finish_stmt_expr (tree body)
7455 tree last, type, tmp, val;
7457 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7459 body = c_end_compound_stmt (body, true);
7462 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7463 c_switch_stack->blocked_stmt_expr--;
7465 /* It is no longer possible to jump to labels defined within this
7466 statement expression. */
7467 for (dlist = label_context_stack_se->labels_def;
7469 dlist = dlist->next)
7471 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7473 /* It is again possible to define labels with a goto just outside
7474 this statement expression. */
7475 for (glist = label_context_stack_se->next->labels_used;
7477 glist = glist->next)
7479 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7482 if (glist_prev != NULL)
7483 glist_prev->next = label_context_stack_se->labels_used;
7485 label_context_stack_se->next->labels_used
7486 = label_context_stack_se->labels_used;
7487 label_context_stack_se = label_context_stack_se->next;
7489 /* Locate the last statement in BODY. See c_end_compound_stmt
7490 about always returning a BIND_EXPR. */
7491 last_p = &BIND_EXPR_BODY (body);
7492 last = BIND_EXPR_BODY (body);
7495 if (TREE_CODE (last) == STATEMENT_LIST)
7497 tree_stmt_iterator i;
7499 /* This can happen with degenerate cases like ({ }). No value. */
7500 if (!TREE_SIDE_EFFECTS (last))
7503 /* If we're supposed to generate side effects warnings, process
7504 all of the statements except the last. */
7505 if (extra_warnings || warn_unused_value)
7507 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7508 emit_side_effect_warnings (tsi_stmt (i));
7511 i = tsi_last (last);
7512 last_p = tsi_stmt_ptr (i);
7516 /* If the end of the list is exception related, then the list was split
7517 by a call to push_cleanup. Continue searching. */
7518 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7519 || TREE_CODE (last) == TRY_CATCH_EXPR)
7521 last_p = &TREE_OPERAND (last, 0);
7523 goto continue_searching;
7526 /* In the case that the BIND_EXPR is not necessary, return the
7527 expression out from inside it. */
7528 if (last == error_mark_node
7529 || (last == BIND_EXPR_BODY (body)
7530 && BIND_EXPR_VARS (body) == NULL))
7532 /* Do not warn if the return value of a statement expression is
7535 TREE_NO_WARNING (last) = 1;
7539 /* Extract the type of said expression. */
7540 type = TREE_TYPE (last);
7542 /* If we're not returning a value at all, then the BIND_EXPR that
7543 we already have is a fine expression to return. */
7544 if (!type || VOID_TYPE_P (type))
7547 /* Now that we've located the expression containing the value, it seems
7548 silly to make voidify_wrapper_expr repeat the process. Create a
7549 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7550 tmp = create_tmp_var_raw (type, NULL);
7552 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7553 tree_expr_nonnegative_p giving up immediately. */
7555 if (TREE_CODE (val) == NOP_EXPR
7556 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7557 val = TREE_OPERAND (val, 0);
7559 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7560 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7562 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7565 /* Begin the scope of an identifier of variably modified type, scope
7566 number SCOPE. Jumping from outside this scope to inside it is not
7570 c_begin_vm_scope (unsigned int scope)
7572 struct c_label_context_vm *nstack;
7573 struct c_label_list *glist;
7575 gcc_assert (scope > 0);
7577 /* At file_scope, we don't have to do any processing. */
7578 if (label_context_stack_vm == NULL)
7581 if (c_switch_stack && !c_switch_stack->blocked_vm)
7582 c_switch_stack->blocked_vm = scope;
7583 for (glist = label_context_stack_vm->labels_used;
7585 glist = glist->next)
7587 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7589 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7590 nstack->labels_def = NULL;
7591 nstack->labels_used = NULL;
7592 nstack->scope = scope;
7593 nstack->next = label_context_stack_vm;
7594 label_context_stack_vm = nstack;
7597 /* End a scope which may contain identifiers of variably modified
7598 type, scope number SCOPE. */
7601 c_end_vm_scope (unsigned int scope)
7603 if (label_context_stack_vm == NULL)
7605 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7606 c_switch_stack->blocked_vm = 0;
7607 /* We may have a number of nested scopes of identifiers with
7608 variably modified type, all at this depth. Pop each in turn. */
7609 while (label_context_stack_vm->scope == scope)
7611 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7613 /* It is no longer possible to jump to labels defined within this
7615 for (dlist = label_context_stack_vm->labels_def;
7617 dlist = dlist->next)
7619 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7621 /* It is again possible to define labels with a goto just outside
7623 for (glist = label_context_stack_vm->next->labels_used;
7625 glist = glist->next)
7627 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7630 if (glist_prev != NULL)
7631 glist_prev->next = label_context_stack_vm->labels_used;
7633 label_context_stack_vm->next->labels_used
7634 = label_context_stack_vm->labels_used;
7635 label_context_stack_vm = label_context_stack_vm->next;
7639 /* Begin and end compound statements. This is as simple as pushing
7640 and popping new statement lists from the tree. */
7643 c_begin_compound_stmt (bool do_scope)
7645 tree stmt = push_stmt_list ();
7652 c_end_compound_stmt (tree stmt, bool do_scope)
7658 if (c_dialect_objc ())
7659 objc_clear_super_receiver ();
7660 block = pop_scope ();
7663 stmt = pop_stmt_list (stmt);
7664 stmt = c_build_bind_expr (block, stmt);
7666 /* If this compound statement is nested immediately inside a statement
7667 expression, then force a BIND_EXPR to be created. Otherwise we'll
7668 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7669 STATEMENT_LISTs merge, and thus we can lose track of what statement
7672 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7673 && TREE_CODE (stmt) != BIND_EXPR)
7675 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7676 TREE_SIDE_EFFECTS (stmt) = 1;
7682 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7683 when the current scope is exited. EH_ONLY is true when this is not
7684 meant to apply to normal control flow transfer. */
7687 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7689 enum tree_code code;
7693 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7694 stmt = build_stmt (code, NULL, cleanup);
7696 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7697 list = push_stmt_list ();
7698 TREE_OPERAND (stmt, 0) = list;
7699 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7702 /* Build a binary-operation expression without default conversions.
7703 CODE is the kind of expression to build.
7704 This function differs from `build' in several ways:
7705 the data type of the result is computed and recorded in it,
7706 warnings are generated if arg data types are invalid,
7707 special handling for addition and subtraction of pointers is known,
7708 and some optimization is done (operations on narrow ints
7709 are done in the narrower type when that gives the same result).
7710 Constant folding is also done before the result is returned.
7712 Note that the operands will never have enumeral types, or function
7713 or array types, because either they will have the default conversions
7714 performed or they have both just been converted to some other type in which
7715 the arithmetic is to be done. */
7718 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
7722 enum tree_code code0, code1;
7724 const char *invalid_op_diag;
7726 /* Expression code to give to the expression when it is built.
7727 Normally this is CODE, which is what the caller asked for,
7728 but in some special cases we change it. */
7729 enum tree_code resultcode = code;
7731 /* Data type in which the computation is to be performed.
7732 In the simplest cases this is the common type of the arguments. */
7733 tree result_type = NULL;
7735 /* Nonzero means operands have already been type-converted
7736 in whatever way is necessary.
7737 Zero means they need to be converted to RESULT_TYPE. */
7740 /* Nonzero means create the expression with this type, rather than
7742 tree build_type = 0;
7744 /* Nonzero means after finally constructing the expression
7745 convert it to this type. */
7746 tree final_type = 0;
7748 /* Nonzero if this is an operation like MIN or MAX which can
7749 safely be computed in short if both args are promoted shorts.
7750 Also implies COMMON.
7751 -1 indicates a bitwise operation; this makes a difference
7752 in the exact conditions for when it is safe to do the operation
7753 in a narrower mode. */
7756 /* Nonzero if this is a comparison operation;
7757 if both args are promoted shorts, compare the original shorts.
7758 Also implies COMMON. */
7759 int short_compare = 0;
7761 /* Nonzero if this is a right-shift operation, which can be computed on the
7762 original short and then promoted if the operand is a promoted short. */
7763 int short_shift = 0;
7765 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7768 /* True means types are compatible as far as ObjC is concerned. */
7773 op0 = default_conversion (orig_op0);
7774 op1 = default_conversion (orig_op1);
7782 type0 = TREE_TYPE (op0);
7783 type1 = TREE_TYPE (op1);
7785 /* The expression codes of the data types of the arguments tell us
7786 whether the arguments are integers, floating, pointers, etc. */
7787 code0 = TREE_CODE (type0);
7788 code1 = TREE_CODE (type1);
7790 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7791 STRIP_TYPE_NOPS (op0);
7792 STRIP_TYPE_NOPS (op1);
7794 /* If an error was already reported for one of the arguments,
7795 avoid reporting another error. */
7797 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7798 return error_mark_node;
7800 if ((invalid_op_diag
7801 = targetm.invalid_binary_op (code, type0, type1)))
7803 error (invalid_op_diag);
7804 return error_mark_node;
7807 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
7812 /* Handle the pointer + int case. */
7813 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7814 return pointer_int_sum (PLUS_EXPR, op0, op1);
7815 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
7816 return pointer_int_sum (PLUS_EXPR, op1, op0);
7822 /* Subtraction of two similar pointers.
7823 We must subtract them as integers, then divide by object size. */
7824 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
7825 && comp_target_types (type0, type1))
7826 return pointer_diff (op0, op1);
7827 /* Handle pointer minus int. Just like pointer plus int. */
7828 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7829 return pointer_int_sum (MINUS_EXPR, op0, op1);
7838 case TRUNC_DIV_EXPR:
7840 case FLOOR_DIV_EXPR:
7841 case ROUND_DIV_EXPR:
7842 case EXACT_DIV_EXPR:
7843 /* Floating point division by zero is a legitimate way to obtain
7844 infinities and NaNs. */
7845 if (skip_evaluation == 0 && integer_zerop (op1))
7846 warning (OPT_Wdiv_by_zero, "division by zero");
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 if (skip_evaluation == 0 && integer_zerop (op1))
7887 warning (OPT_Wdiv_by_zero, "division by zero");
7889 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7891 /* Although it would be tempting to shorten always here, that loses
7892 on some targets, since the modulo instruction is undefined if the
7893 quotient can't be represented in the computation mode. We shorten
7894 only if unsigned or if dividing by something we know != -1. */
7895 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7896 || (TREE_CODE (op1) == INTEGER_CST
7897 && !integer_all_onesp (op1)));
7902 case TRUTH_ANDIF_EXPR:
7903 case TRUTH_ORIF_EXPR:
7904 case TRUTH_AND_EXPR:
7906 case TRUTH_XOR_EXPR:
7907 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
7908 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
7909 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
7910 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
7912 /* Result of these operations is always an int,
7913 but that does not mean the operands should be
7914 converted to ints! */
7915 result_type = integer_type_node;
7916 op0 = c_common_truthvalue_conversion (op0);
7917 op1 = c_common_truthvalue_conversion (op1);
7922 /* Shift operations: result has same type as first operand;
7923 always convert second operand to int.
7924 Also set SHORT_SHIFT if shifting rightward. */
7927 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7929 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7931 if (tree_int_cst_sgn (op1) < 0)
7932 warning (0, "right shift count is negative");
7935 if (!integer_zerop (op1))
7938 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7939 warning (0, "right shift count >= width of type");
7943 /* Use the type of the value to be shifted. */
7944 result_type = type0;
7945 /* Convert the shift-count to an integer, regardless of size
7946 of value being shifted. */
7947 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7948 op1 = convert (integer_type_node, op1);
7949 /* Avoid converting op1 to result_type later. */
7955 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7957 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7959 if (tree_int_cst_sgn (op1) < 0)
7960 warning (0, "left shift count is negative");
7962 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7963 warning (0, "left shift count >= width of type");
7966 /* Use the type of the value to be shifted. */
7967 result_type = type0;
7968 /* Convert the shift-count to an integer, regardless of size
7969 of value being shifted. */
7970 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7971 op1 = convert (integer_type_node, op1);
7972 /* Avoid converting op1 to result_type later. */
7979 if (code0 == REAL_TYPE || code1 == REAL_TYPE)
7980 warning (OPT_Wfloat_equal,
7981 "comparing floating point with == or != is unsafe");
7982 /* Result of comparison is always int,
7983 but don't convert the args to int! */
7984 build_type = integer_type_node;
7985 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7986 || code0 == COMPLEX_TYPE)
7987 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7988 || code1 == COMPLEX_TYPE))
7990 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
7992 tree tt0 = TREE_TYPE (type0);
7993 tree tt1 = TREE_TYPE (type1);
7994 /* Anything compares with void *. void * compares with anything.
7995 Otherwise, the targets must be compatible
7996 and both must be object or both incomplete. */
7997 if (comp_target_types (type0, type1))
7998 result_type = common_pointer_type (type0, type1);
7999 else if (VOID_TYPE_P (tt0))
8001 /* op0 != orig_op0 detects the case of something
8002 whose value is 0 but which isn't a valid null ptr const. */
8003 if (pedantic && !null_pointer_constant_p (orig_op0)
8004 && TREE_CODE (tt1) == FUNCTION_TYPE)
8005 pedwarn ("ISO C forbids comparison of %<void *%>"
8006 " with function pointer");
8008 else if (VOID_TYPE_P (tt1))
8010 if (pedantic && !null_pointer_constant_p (orig_op1)
8011 && TREE_CODE (tt0) == FUNCTION_TYPE)
8012 pedwarn ("ISO C forbids comparison of %<void *%>"
8013 " with function pointer");
8016 /* Avoid warning about the volatile ObjC EH puts on decls. */
8018 pedwarn ("comparison of distinct pointer types lacks a cast");
8020 if (result_type == NULL_TREE)
8021 result_type = ptr_type_node;
8023 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8025 if (TREE_CODE (op0) == ADDR_EXPR
8026 && DECL_P (TREE_OPERAND (op0, 0))
8027 && (TREE_CODE (TREE_OPERAND (op0, 0)) == PARM_DECL
8028 || TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
8029 || !DECL_WEAK (TREE_OPERAND (op0, 0))))
8030 warning (OPT_Walways_true, "the address of %qD will never be NULL",
8031 TREE_OPERAND (op0, 0));
8032 result_type = type0;
8034 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8036 if (TREE_CODE (op1) == ADDR_EXPR
8037 && DECL_P (TREE_OPERAND (op1, 0))
8038 && (TREE_CODE (TREE_OPERAND (op1, 0)) == PARM_DECL
8039 || TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL
8040 || !DECL_WEAK (TREE_OPERAND (op1, 0))))
8041 warning (OPT_Walways_true, "the address of %qD will never be NULL",
8042 TREE_OPERAND (op1, 0));
8043 result_type = type1;
8045 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8047 result_type = type0;
8048 pedwarn ("comparison between pointer and integer");
8050 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8052 result_type = type1;
8053 pedwarn ("comparison between pointer and integer");
8061 build_type = integer_type_node;
8062 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
8063 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
8065 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8067 if (comp_target_types (type0, type1))
8069 result_type = common_pointer_type (type0, type1);
8070 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8071 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8072 pedwarn ("comparison of complete and incomplete pointers");
8074 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8075 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
8079 result_type = ptr_type_node;
8080 pedwarn ("comparison of distinct pointer types lacks a cast");
8083 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8085 result_type = type0;
8086 if (pedantic || extra_warnings)
8087 pedwarn ("ordered comparison of pointer with integer zero");
8089 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8091 result_type = type1;
8093 pedwarn ("ordered comparison of pointer with integer zero");
8095 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8097 result_type = type0;
8098 pedwarn ("comparison between pointer and integer");
8100 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8102 result_type = type1;
8103 pedwarn ("comparison between pointer and integer");
8111 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8112 return error_mark_node;
8114 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8115 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8116 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8117 TREE_TYPE (type1))))
8119 binary_op_error (code);
8120 return error_mark_node;
8123 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8124 || code0 == VECTOR_TYPE)
8126 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8127 || code1 == VECTOR_TYPE))
8129 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8131 if (shorten || common || short_compare)
8132 result_type = c_common_type (type0, type1);
8134 /* For certain operations (which identify themselves by shorten != 0)
8135 if both args were extended from the same smaller type,
8136 do the arithmetic in that type and then extend.
8138 shorten !=0 and !=1 indicates a bitwise operation.
8139 For them, this optimization is safe only if
8140 both args are zero-extended or both are sign-extended.
8141 Otherwise, we might change the result.
8142 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8143 but calculated in (unsigned short) it would be (unsigned short)-1. */
8145 if (shorten && none_complex)
8147 int unsigned0, unsigned1;
8152 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
8153 excessive narrowing when we call get_narrower below. For
8154 example, suppose that OP0 is of unsigned int extended
8155 from signed char and that RESULT_TYPE is long long int.
8156 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
8159 (long long int) (unsigned int) signed_char
8161 which get_narrower would narrow down to
8163 (unsigned int) signed char
8165 If we do not cast OP0 first, get_narrower would return
8166 signed_char, which is inconsistent with the case of the
8168 op0 = convert (result_type, op0);
8169 op1 = convert (result_type, op1);
8171 arg0 = get_narrower (op0, &unsigned0);
8172 arg1 = get_narrower (op1, &unsigned1);
8174 /* UNS is 1 if the operation to be done is an unsigned one. */
8175 uns = TYPE_UNSIGNED (result_type);
8177 final_type = result_type;
8179 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
8180 but it *requires* conversion to FINAL_TYPE. */
8182 if ((TYPE_PRECISION (TREE_TYPE (op0))
8183 == TYPE_PRECISION (TREE_TYPE (arg0)))
8184 && TREE_TYPE (op0) != final_type)
8185 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
8186 if ((TYPE_PRECISION (TREE_TYPE (op1))
8187 == TYPE_PRECISION (TREE_TYPE (arg1)))
8188 && TREE_TYPE (op1) != final_type)
8189 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
8191 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
8193 /* For bitwise operations, signedness of nominal type
8194 does not matter. Consider only how operands were extended. */
8198 /* Note that in all three cases below we refrain from optimizing
8199 an unsigned operation on sign-extended args.
8200 That would not be valid. */
8202 /* Both args variable: if both extended in same way
8203 from same width, do it in that width.
8204 Do it unsigned if args were zero-extended. */
8205 if ((TYPE_PRECISION (TREE_TYPE (arg0))
8206 < TYPE_PRECISION (result_type))
8207 && (TYPE_PRECISION (TREE_TYPE (arg1))
8208 == TYPE_PRECISION (TREE_TYPE (arg0)))
8209 && unsigned0 == unsigned1
8210 && (unsigned0 || !uns))
8212 = c_common_signed_or_unsigned_type
8213 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
8214 else if (TREE_CODE (arg0) == INTEGER_CST
8215 && (unsigned1 || !uns)
8216 && (TYPE_PRECISION (TREE_TYPE (arg1))
8217 < TYPE_PRECISION (result_type))
8219 = c_common_signed_or_unsigned_type (unsigned1,
8221 int_fits_type_p (arg0, type)))
8223 else if (TREE_CODE (arg1) == INTEGER_CST
8224 && (unsigned0 || !uns)
8225 && (TYPE_PRECISION (TREE_TYPE (arg0))
8226 < TYPE_PRECISION (result_type))
8228 = c_common_signed_or_unsigned_type (unsigned0,
8230 int_fits_type_p (arg1, type)))
8234 /* Shifts can be shortened if shifting right. */
8239 tree arg0 = get_narrower (op0, &unsigned_arg);
8241 final_type = result_type;
8243 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8244 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8246 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8247 /* We can shorten only if the shift count is less than the
8248 number of bits in the smaller type size. */
8249 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8250 /* We cannot drop an unsigned shift after sign-extension. */
8251 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8253 /* Do an unsigned shift if the operand was zero-extended. */
8255 = c_common_signed_or_unsigned_type (unsigned_arg,
8257 /* Convert value-to-be-shifted to that type. */
8258 if (TREE_TYPE (op0) != result_type)
8259 op0 = convert (result_type, op0);
8264 /* Comparison operations are shortened too but differently.
8265 They identify themselves by setting short_compare = 1. */
8269 /* Don't write &op0, etc., because that would prevent op0
8270 from being kept in a register.
8271 Instead, make copies of the our local variables and
8272 pass the copies by reference, then copy them back afterward. */
8273 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8274 enum tree_code xresultcode = resultcode;
8276 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8281 op0 = xop0, op1 = xop1;
8283 resultcode = xresultcode;
8285 if (warn_sign_compare && skip_evaluation == 0)
8287 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
8288 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
8289 int unsignedp0, unsignedp1;
8290 tree primop0 = get_narrower (op0, &unsignedp0);
8291 tree primop1 = get_narrower (op1, &unsignedp1);
8295 STRIP_TYPE_NOPS (xop0);
8296 STRIP_TYPE_NOPS (xop1);
8298 /* Give warnings for comparisons between signed and unsigned
8299 quantities that may fail.
8301 Do the checking based on the original operand trees, so that
8302 casts will be considered, but default promotions won't be.
8304 Do not warn if the comparison is being done in a signed type,
8305 since the signed type will only be chosen if it can represent
8306 all the values of the unsigned type. */
8307 if (!TYPE_UNSIGNED (result_type))
8309 /* Do not warn if both operands are the same signedness. */
8310 else if (op0_signed == op1_signed)
8317 sop = xop0, uop = xop1;
8319 sop = xop1, uop = xop0;
8321 /* Do not warn if the signed quantity is an
8322 unsuffixed integer literal (or some static
8323 constant expression involving such literals or a
8324 conditional expression involving such literals)
8325 and it is non-negative. */
8326 if (tree_expr_nonnegative_p (sop))
8328 /* Do not warn if the comparison is an equality operation,
8329 the unsigned quantity is an integral constant, and it
8330 would fit in the result if the result were signed. */
8331 else if (TREE_CODE (uop) == INTEGER_CST
8332 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
8334 (uop, c_common_signed_type (result_type)))
8336 /* Do not warn if the unsigned quantity is an enumeration
8337 constant and its maximum value would fit in the result
8338 if the result were signed. */
8339 else if (TREE_CODE (uop) == INTEGER_CST
8340 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
8342 (TYPE_MAX_VALUE (TREE_TYPE (uop)),
8343 c_common_signed_type (result_type)))
8346 warning (0, "comparison between signed and unsigned");
8349 /* Warn if two unsigned values are being compared in a size
8350 larger than their original size, and one (and only one) is the
8351 result of a `~' operator. This comparison will always fail.
8353 Also warn if one operand is a constant, and the constant
8354 does not have all bits set that are set in the ~ operand
8355 when it is extended. */
8357 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
8358 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
8360 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
8361 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
8364 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
8367 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
8370 HOST_WIDE_INT constant, mask;
8371 int unsignedp, bits;
8373 if (host_integerp (primop0, 0))
8376 unsignedp = unsignedp1;
8377 constant = tree_low_cst (primop0, 0);
8382 unsignedp = unsignedp0;
8383 constant = tree_low_cst (primop1, 0);
8386 bits = TYPE_PRECISION (TREE_TYPE (primop));
8387 if (bits < TYPE_PRECISION (result_type)
8388 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
8390 mask = (~(HOST_WIDE_INT) 0) << bits;
8391 if ((mask & constant) != mask)
8392 warning (0, "comparison of promoted ~unsigned with constant");
8395 else if (unsignedp0 && unsignedp1
8396 && (TYPE_PRECISION (TREE_TYPE (primop0))
8397 < TYPE_PRECISION (result_type))
8398 && (TYPE_PRECISION (TREE_TYPE (primop1))
8399 < TYPE_PRECISION (result_type)))
8400 warning (0, "comparison of promoted ~unsigned with unsigned");
8406 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8407 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8408 Then the expression will be built.
8409 It will be given type FINAL_TYPE if that is nonzero;
8410 otherwise, it will be given type RESULT_TYPE. */
8414 binary_op_error (code);
8415 return error_mark_node;
8420 if (TREE_TYPE (op0) != result_type)
8421 op0 = convert_and_check (result_type, op0);
8422 if (TREE_TYPE (op1) != result_type)
8423 op1 = convert_and_check (result_type, op1);
8425 /* This can happen if one operand has a vector type, and the other
8426 has a different type. */
8427 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8428 return error_mark_node;
8431 if (build_type == NULL_TREE)
8432 build_type = result_type;
8435 /* Treat expressions in initializers specially as they can't trap. */
8436 tree result = require_constant_value ? fold_build2_initializer (resultcode,
8439 : fold_build2 (resultcode, build_type,
8442 if (final_type != 0)
8443 result = convert (final_type, result);
8449 /* Convert EXPR to be a truth-value, validating its type for this
8453 c_objc_common_truthvalue_conversion (tree expr)
8455 switch (TREE_CODE (TREE_TYPE (expr)))
8458 error ("used array that cannot be converted to pointer where scalar is required");
8459 return error_mark_node;
8462 error ("used struct type value where scalar is required");
8463 return error_mark_node;
8466 error ("used union type value where scalar is required");
8467 return error_mark_node;
8476 /* ??? Should we also give an error for void and vectors rather than
8477 leaving those to give errors later? */
8478 return c_common_truthvalue_conversion (expr);
8482 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8486 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED,
8487 bool *ti ATTRIBUTE_UNUSED, bool *se)
8489 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8491 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8492 /* Executing a compound literal inside a function reinitializes
8494 if (!TREE_STATIC (decl))
8502 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8505 c_begin_omp_parallel (void)
8510 block = c_begin_compound_stmt (true);
8516 c_finish_omp_parallel (tree clauses, tree block)
8520 block = c_end_compound_stmt (block, true);
8522 stmt = make_node (OMP_PARALLEL);
8523 TREE_TYPE (stmt) = void_type_node;
8524 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8525 OMP_PARALLEL_BODY (stmt) = block;
8527 return add_stmt (stmt);
8530 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8531 Remove any elements from the list that are invalid. */
8534 c_finish_omp_clauses (tree clauses)
8536 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8537 tree c, t, *pc = &clauses;
8540 bitmap_obstack_initialize (NULL);
8541 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8542 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8543 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8545 for (pc = &clauses, c = clauses; c ; c = *pc)
8547 bool remove = false;
8548 bool need_complete = false;
8549 bool need_implicitly_determined = false;
8551 switch (OMP_CLAUSE_CODE (c))
8553 case OMP_CLAUSE_SHARED:
8555 need_implicitly_determined = true;
8556 goto check_dup_generic;
8558 case OMP_CLAUSE_PRIVATE:
8560 need_complete = true;
8561 need_implicitly_determined = true;
8562 goto check_dup_generic;
8564 case OMP_CLAUSE_REDUCTION:
8566 need_implicitly_determined = true;
8567 t = OMP_CLAUSE_DECL (c);
8568 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8569 || POINTER_TYPE_P (TREE_TYPE (t)))
8571 error ("%qE has invalid type for %<reduction%>", t);
8574 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8576 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8577 const char *r_name = NULL;
8594 case TRUTH_ANDIF_EXPR:
8597 case TRUTH_ORIF_EXPR:
8605 error ("%qE has invalid type for %<reduction(%s)%>",
8610 goto check_dup_generic;
8612 case OMP_CLAUSE_COPYPRIVATE:
8613 name = "copyprivate";
8614 goto check_dup_generic;
8616 case OMP_CLAUSE_COPYIN:
8618 t = OMP_CLAUSE_DECL (c);
8619 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8621 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8624 goto check_dup_generic;
8627 t = OMP_CLAUSE_DECL (c);
8628 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8630 error ("%qE is not a variable in clause %qs", t, name);
8633 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8634 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8635 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8637 error ("%qE appears more than once in data clauses", t);
8641 bitmap_set_bit (&generic_head, DECL_UID (t));
8644 case OMP_CLAUSE_FIRSTPRIVATE:
8645 name = "firstprivate";
8646 t = OMP_CLAUSE_DECL (c);
8647 need_complete = true;
8648 need_implicitly_determined = true;
8649 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8651 error ("%qE is not a variable in clause %<firstprivate%>", t);
8654 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8655 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8657 error ("%qE appears more than once in data clauses", t);
8661 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8664 case OMP_CLAUSE_LASTPRIVATE:
8665 name = "lastprivate";
8666 t = OMP_CLAUSE_DECL (c);
8667 need_complete = true;
8668 need_implicitly_determined = true;
8669 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8671 error ("%qE is not a variable in clause %<lastprivate%>", t);
8674 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8675 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8677 error ("%qE appears more than once in data clauses", t);
8681 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8685 case OMP_CLAUSE_NUM_THREADS:
8686 case OMP_CLAUSE_SCHEDULE:
8687 case OMP_CLAUSE_NOWAIT:
8688 case OMP_CLAUSE_ORDERED:
8689 case OMP_CLAUSE_DEFAULT:
8690 pc = &OMP_CLAUSE_CHAIN (c);
8699 t = OMP_CLAUSE_DECL (c);
8703 t = require_complete_type (t);
8704 if (t == error_mark_node)
8708 if (need_implicitly_determined)
8710 const char *share_name = NULL;
8712 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8713 share_name = "threadprivate";
8714 else switch (c_omp_predetermined_sharing (t))
8716 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8718 case OMP_CLAUSE_DEFAULT_SHARED:
8719 share_name = "shared";
8721 case OMP_CLAUSE_DEFAULT_PRIVATE:
8722 share_name = "private";
8729 error ("%qE is predetermined %qs for %qs",
8730 t, share_name, name);
8737 *pc = OMP_CLAUSE_CHAIN (c);
8739 pc = &OMP_CLAUSE_CHAIN (c);
8742 bitmap_obstack_release (NULL);