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);
1815 if (TREE_TYPE (subdatum) == error_mark_node)
1816 return error_mark_node;
1818 quals = TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum)));
1819 quals |= TYPE_QUALS (TREE_TYPE (datum));
1820 subtype = c_build_qualified_type (TREE_TYPE (subdatum), quals);
1822 ref = build3 (COMPONENT_REF, subtype, datum, subdatum,
1824 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1825 TREE_READONLY (ref) = 1;
1826 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1827 TREE_THIS_VOLATILE (ref) = 1;
1829 if (TREE_DEPRECATED (subdatum))
1830 warn_deprecated_use (subdatum);
1834 field = TREE_CHAIN (field);
1840 else if (code != ERROR_MARK)
1841 error ("request for member %qE in something not a structure or union",
1844 return error_mark_node;
1847 /* Given an expression PTR for a pointer, return an expression
1848 for the value pointed to.
1849 ERRORSTRING is the name of the operator to appear in error messages. */
1852 build_indirect_ref (tree ptr, const char *errorstring)
1854 tree pointer = default_conversion (ptr);
1855 tree type = TREE_TYPE (pointer);
1857 if (TREE_CODE (type) == POINTER_TYPE)
1859 if (TREE_CODE (pointer) == ADDR_EXPR
1860 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1861 == TREE_TYPE (type)))
1862 return TREE_OPERAND (pointer, 0);
1865 tree t = TREE_TYPE (type);
1868 ref = build1 (INDIRECT_REF, t, pointer);
1870 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1872 error ("dereferencing pointer to incomplete type");
1873 return error_mark_node;
1875 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1876 warning (0, "dereferencing %<void *%> pointer");
1878 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1879 so that we get the proper error message if the result is used
1880 to assign to. Also, &* is supposed to be a no-op.
1881 And ANSI C seems to specify that the type of the result
1882 should be the const type. */
1883 /* A de-reference of a pointer to const is not a const. It is valid
1884 to change it via some other pointer. */
1885 TREE_READONLY (ref) = TYPE_READONLY (t);
1886 TREE_SIDE_EFFECTS (ref)
1887 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
1888 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1892 else if (TREE_CODE (pointer) != ERROR_MARK)
1893 error ("invalid type argument of %qs", errorstring);
1894 return error_mark_node;
1897 /* This handles expressions of the form "a[i]", which denotes
1900 This is logically equivalent in C to *(a+i), but we may do it differently.
1901 If A is a variable or a member, we generate a primitive ARRAY_REF.
1902 This avoids forcing the array out of registers, and can work on
1903 arrays that are not lvalues (for example, members of structures returned
1907 build_array_ref (tree array, tree index)
1909 bool swapped = false;
1910 if (TREE_TYPE (array) == error_mark_node
1911 || TREE_TYPE (index) == error_mark_node)
1912 return error_mark_node;
1914 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
1915 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
1918 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
1919 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
1921 error ("subscripted value is neither array nor pointer");
1922 return error_mark_node;
1930 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
1932 error ("array subscript is not an integer");
1933 return error_mark_node;
1936 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
1938 error ("subscripted value is pointer to function");
1939 return error_mark_node;
1942 /* ??? Existing practice has been to warn only when the char
1943 index is syntactically the index, not for char[array]. */
1945 warn_array_subscript_with_type_char (index);
1947 /* Apply default promotions *after* noticing character types. */
1948 index = default_conversion (index);
1950 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
1952 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
1956 /* An array that is indexed by a non-constant
1957 cannot be stored in a register; we must be able to do
1958 address arithmetic on its address.
1959 Likewise an array of elements of variable size. */
1960 if (TREE_CODE (index) != INTEGER_CST
1961 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1962 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1964 if (!c_mark_addressable (array))
1965 return error_mark_node;
1967 /* An array that is indexed by a constant value which is not within
1968 the array bounds cannot be stored in a register either; because we
1969 would get a crash in store_bit_field/extract_bit_field when trying
1970 to access a non-existent part of the register. */
1971 if (TREE_CODE (index) == INTEGER_CST
1972 && TYPE_DOMAIN (TREE_TYPE (array))
1973 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
1975 if (!c_mark_addressable (array))
1976 return error_mark_node;
1982 while (TREE_CODE (foo) == COMPONENT_REF)
1983 foo = TREE_OPERAND (foo, 0);
1984 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
1985 pedwarn ("ISO C forbids subscripting %<register%> array");
1986 else if (!flag_isoc99 && !lvalue_p (foo))
1987 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
1990 type = TREE_TYPE (TREE_TYPE (array));
1991 if (TREE_CODE (type) != ARRAY_TYPE)
1992 type = TYPE_MAIN_VARIANT (type);
1993 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
1994 /* Array ref is const/volatile if the array elements are
1995 or if the array is. */
1996 TREE_READONLY (rval)
1997 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
1998 | TREE_READONLY (array));
1999 TREE_SIDE_EFFECTS (rval)
2000 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2001 | TREE_SIDE_EFFECTS (array));
2002 TREE_THIS_VOLATILE (rval)
2003 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2004 /* This was added by rms on 16 Nov 91.
2005 It fixes vol struct foo *a; a->elts[1]
2006 in an inline function.
2007 Hope it doesn't break something else. */
2008 | TREE_THIS_VOLATILE (array));
2009 return require_complete_type (fold (rval));
2013 tree ar = default_conversion (array);
2015 if (ar == error_mark_node)
2018 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
2019 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
2021 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, index, 0),
2026 /* Build an external reference to identifier ID. FUN indicates
2027 whether this will be used for a function call. LOC is the source
2028 location of the identifier. */
2030 build_external_ref (tree id, int fun, location_t loc)
2033 tree decl = lookup_name (id);
2035 /* In Objective-C, an instance variable (ivar) may be preferred to
2036 whatever lookup_name() found. */
2037 decl = objc_lookup_ivar (decl, id);
2039 if (decl && decl != error_mark_node)
2042 /* Implicit function declaration. */
2043 ref = implicitly_declare (id);
2044 else if (decl == error_mark_node)
2045 /* Don't complain about something that's already been
2046 complained about. */
2047 return error_mark_node;
2050 undeclared_variable (id, loc);
2051 return error_mark_node;
2054 if (TREE_TYPE (ref) == error_mark_node)
2055 return error_mark_node;
2057 if (TREE_DEPRECATED (ref))
2058 warn_deprecated_use (ref);
2060 if (!skip_evaluation)
2061 assemble_external (ref);
2062 TREE_USED (ref) = 1;
2064 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2066 if (!in_sizeof && !in_typeof)
2067 C_DECL_USED (ref) = 1;
2068 else if (DECL_INITIAL (ref) == 0
2069 && DECL_EXTERNAL (ref)
2070 && !TREE_PUBLIC (ref))
2071 record_maybe_used_decl (ref);
2074 if (TREE_CODE (ref) == CONST_DECL)
2076 used_types_insert (TREE_TYPE (ref));
2077 ref = DECL_INITIAL (ref);
2078 TREE_CONSTANT (ref) = 1;
2079 TREE_INVARIANT (ref) = 1;
2081 else if (current_function_decl != 0
2082 && !DECL_FILE_SCOPE_P (current_function_decl)
2083 && (TREE_CODE (ref) == VAR_DECL
2084 || TREE_CODE (ref) == PARM_DECL
2085 || TREE_CODE (ref) == FUNCTION_DECL))
2087 tree context = decl_function_context (ref);
2089 if (context != 0 && context != current_function_decl)
2090 DECL_NONLOCAL (ref) = 1;
2096 /* Record details of decls possibly used inside sizeof or typeof. */
2097 struct maybe_used_decl
2101 /* The level seen at (in_sizeof + in_typeof). */
2103 /* The next one at this level or above, or NULL. */
2104 struct maybe_used_decl *next;
2107 static struct maybe_used_decl *maybe_used_decls;
2109 /* Record that DECL, an undefined static function reference seen
2110 inside sizeof or typeof, might be used if the operand of sizeof is
2111 a VLA type or the operand of typeof is a variably modified
2115 record_maybe_used_decl (tree decl)
2117 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2119 t->level = in_sizeof + in_typeof;
2120 t->next = maybe_used_decls;
2121 maybe_used_decls = t;
2124 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2125 USED is false, just discard them. If it is true, mark them used
2126 (if no longer inside sizeof or typeof) or move them to the next
2127 level up (if still inside sizeof or typeof). */
2130 pop_maybe_used (bool used)
2132 struct maybe_used_decl *p = maybe_used_decls;
2133 int cur_level = in_sizeof + in_typeof;
2134 while (p && p->level > cur_level)
2139 C_DECL_USED (p->decl) = 1;
2141 p->level = cur_level;
2145 if (!used || cur_level == 0)
2146 maybe_used_decls = p;
2149 /* Return the result of sizeof applied to EXPR. */
2152 c_expr_sizeof_expr (struct c_expr expr)
2155 if (expr.value == error_mark_node)
2157 ret.value = error_mark_node;
2158 ret.original_code = ERROR_MARK;
2159 pop_maybe_used (false);
2163 ret.value = c_sizeof (TREE_TYPE (expr.value));
2164 ret.original_code = ERROR_MARK;
2165 if (c_vla_type_p (TREE_TYPE (expr.value)))
2167 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2168 ret.value = build2 (COMPOUND_EXPR, TREE_TYPE (ret.value), expr.value, ret.value);
2170 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2175 /* Return the result of sizeof applied to T, a structure for the type
2176 name passed to sizeof (rather than the type itself). */
2179 c_expr_sizeof_type (struct c_type_name *t)
2183 type = groktypename (t);
2184 ret.value = c_sizeof (type);
2185 ret.original_code = ERROR_MARK;
2186 pop_maybe_used (type != error_mark_node
2187 ? C_TYPE_VARIABLE_SIZE (type) : false);
2191 /* Build a function call to function FUNCTION with parameters PARAMS.
2192 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2193 TREE_VALUE of each node is a parameter-expression.
2194 FUNCTION's data type may be a function type or a pointer-to-function. */
2197 build_function_call (tree function, tree params)
2199 tree fntype, fundecl = 0;
2200 tree coerced_params;
2201 tree name = NULL_TREE, result;
2204 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2205 STRIP_TYPE_NOPS (function);
2207 /* Convert anything with function type to a pointer-to-function. */
2208 if (TREE_CODE (function) == FUNCTION_DECL)
2210 /* Implement type-directed function overloading for builtins.
2211 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2212 handle all the type checking. The result is a complete expression
2213 that implements this function call. */
2214 tem = resolve_overloaded_builtin (function, params);
2218 name = DECL_NAME (function);
2221 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2222 function = function_to_pointer_conversion (function);
2224 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2225 expressions, like those used for ObjC messenger dispatches. */
2226 function = objc_rewrite_function_call (function, params);
2228 fntype = TREE_TYPE (function);
2230 if (TREE_CODE (fntype) == ERROR_MARK)
2231 return error_mark_node;
2233 if (!(TREE_CODE (fntype) == POINTER_TYPE
2234 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2236 error ("called object %qE is not a function", function);
2237 return error_mark_node;
2240 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2241 current_function_returns_abnormally = 1;
2243 /* fntype now gets the type of function pointed to. */
2244 fntype = TREE_TYPE (fntype);
2246 /* Check that the function is called through a compatible prototype.
2247 If it is not, replace the call by a trap, wrapped up in a compound
2248 expression if necessary. This has the nice side-effect to prevent
2249 the tree-inliner from generating invalid assignment trees which may
2250 blow up in the RTL expander later. */
2251 if ((TREE_CODE (function) == NOP_EXPR
2252 || TREE_CODE (function) == CONVERT_EXPR)
2253 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2254 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2255 && !comptypes (fntype, TREE_TYPE (tem)))
2257 tree return_type = TREE_TYPE (fntype);
2258 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2261 /* This situation leads to run-time undefined behavior. We can't,
2262 therefore, simply error unless we can prove that all possible
2263 executions of the program must execute the code. */
2264 warning (0, "function called through a non-compatible type");
2266 /* We can, however, treat "undefined" any way we please.
2267 Call abort to encourage the user to fix the program. */
2268 inform ("if this code is reached, the program will abort");
2270 if (VOID_TYPE_P (return_type))
2276 if (AGGREGATE_TYPE_P (return_type))
2277 rhs = build_compound_literal (return_type,
2278 build_constructor (return_type, 0));
2280 rhs = fold_convert (return_type, integer_zero_node);
2282 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2286 /* Convert the parameters to the types declared in the
2287 function prototype, or apply default promotions. */
2290 = convert_arguments (TYPE_ARG_TYPES (fntype), params, function, fundecl);
2292 if (coerced_params == error_mark_node)
2293 return error_mark_node;
2295 /* Check that the arguments to the function are valid. */
2297 check_function_arguments (TYPE_ATTRIBUTES (fntype), coerced_params,
2298 TYPE_ARG_TYPES (fntype));
2300 if (require_constant_value)
2302 result = fold_build3_initializer (CALL_EXPR, TREE_TYPE (fntype),
2303 function, coerced_params, NULL_TREE);
2305 if (TREE_CONSTANT (result)
2306 && (name == NULL_TREE
2307 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2308 pedwarn_init ("initializer element is not constant");
2311 result = fold_build3 (CALL_EXPR, TREE_TYPE (fntype),
2312 function, coerced_params, NULL_TREE);
2314 if (VOID_TYPE_P (TREE_TYPE (result)))
2316 return require_complete_type (result);
2319 /* Convert the argument expressions in the list VALUES
2320 to the types in the list TYPELIST. The result is a list of converted
2321 argument expressions, unless there are too few arguments in which
2322 case it is error_mark_node.
2324 If TYPELIST is exhausted, or when an element has NULL as its type,
2325 perform the default conversions.
2327 PARMLIST is the chain of parm decls for the function being called.
2328 It may be 0, if that info is not available.
2329 It is used only for generating error messages.
2331 FUNCTION is a tree for the called function. It is used only for
2332 error messages, where it is formatted with %qE.
2334 This is also where warnings about wrong number of args are generated.
2336 Both VALUES and the returned value are chains of TREE_LIST nodes
2337 with the elements of the list in the TREE_VALUE slots of those nodes. */
2340 convert_arguments (tree typelist, tree values, tree function, tree fundecl)
2342 tree typetail, valtail;
2347 /* Change pointer to function to the function itself for
2349 if (TREE_CODE (function) == ADDR_EXPR
2350 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2351 function = TREE_OPERAND (function, 0);
2353 /* Handle an ObjC selector specially for diagnostics. */
2354 selector = objc_message_selector ();
2356 /* Scan the given expressions and types, producing individual
2357 converted arguments and pushing them on RESULT in reverse order. */
2359 for (valtail = values, typetail = typelist, parmnum = 0;
2361 valtail = TREE_CHAIN (valtail), parmnum++)
2363 tree type = typetail ? TREE_VALUE (typetail) : 0;
2364 tree val = TREE_VALUE (valtail);
2365 tree rname = function;
2366 int argnum = parmnum + 1;
2367 const char *invalid_func_diag;
2369 if (type == void_type_node)
2371 error ("too many arguments to function %qE", function);
2375 if (selector && argnum > 2)
2381 STRIP_TYPE_NOPS (val);
2383 val = require_complete_type (val);
2387 /* Formal parm type is specified by a function prototype. */
2390 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2392 error ("type of formal parameter %d is incomplete", parmnum + 1);
2397 /* Optionally warn about conversions that
2398 differ from the default conversions. */
2399 if (warn_conversion || warn_traditional)
2401 unsigned int formal_prec = TYPE_PRECISION (type);
2403 if (INTEGRAL_TYPE_P (type)
2404 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2405 warning (0, "passing argument %d of %qE as integer "
2406 "rather than floating due to prototype",
2408 if (INTEGRAL_TYPE_P (type)
2409 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2410 warning (0, "passing argument %d of %qE as integer "
2411 "rather than complex due to prototype",
2413 else if (TREE_CODE (type) == COMPLEX_TYPE
2414 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2415 warning (0, "passing argument %d of %qE as complex "
2416 "rather than floating due to prototype",
2418 else if (TREE_CODE (type) == REAL_TYPE
2419 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2420 warning (0, "passing argument %d of %qE as floating "
2421 "rather than integer due to prototype",
2423 else if (TREE_CODE (type) == COMPLEX_TYPE
2424 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2425 warning (0, "passing argument %d of %qE as complex "
2426 "rather than integer due to prototype",
2428 else if (TREE_CODE (type) == REAL_TYPE
2429 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2430 warning (0, "passing argument %d of %qE as floating "
2431 "rather than complex due to prototype",
2433 /* ??? At some point, messages should be written about
2434 conversions between complex types, but that's too messy
2436 else if (TREE_CODE (type) == REAL_TYPE
2437 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2439 /* Warn if any argument is passed as `float',
2440 since without a prototype it would be `double'. */
2441 if (formal_prec == TYPE_PRECISION (float_type_node)
2442 && type != dfloat32_type_node)
2443 warning (0, "passing argument %d of %qE as %<float%> "
2444 "rather than %<double%> due to prototype",
2447 /* Warn if mismatch between argument and prototype
2448 for decimal float types. Warn of conversions with
2449 binary float types and of precision narrowing due to
2451 else if (type != TREE_TYPE (val)
2452 && (type == dfloat32_type_node
2453 || type == dfloat64_type_node
2454 || type == dfloat128_type_node
2455 || TREE_TYPE (val) == dfloat32_type_node
2456 || TREE_TYPE (val) == dfloat64_type_node
2457 || TREE_TYPE (val) == dfloat128_type_node)
2459 <= TYPE_PRECISION (TREE_TYPE (val))
2460 || (type == dfloat128_type_node
2462 != dfloat64_type_node
2464 != dfloat32_type_node)))
2465 || (type == dfloat64_type_node
2467 != dfloat32_type_node))))
2468 warning (0, "passing argument %d of %qE as %qT "
2469 "rather than %qT due to prototype",
2470 argnum, rname, type, TREE_TYPE (val));
2473 /* Detect integer changing in width or signedness.
2474 These warnings are only activated with
2475 -Wconversion, not with -Wtraditional. */
2476 else if (warn_conversion && INTEGRAL_TYPE_P (type)
2477 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2479 tree would_have_been = default_conversion (val);
2480 tree type1 = TREE_TYPE (would_have_been);
2482 if (TREE_CODE (type) == ENUMERAL_TYPE
2483 && (TYPE_MAIN_VARIANT (type)
2484 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2485 /* No warning if function asks for enum
2486 and the actual arg is that enum type. */
2488 else if (formal_prec != TYPE_PRECISION (type1))
2489 warning (OPT_Wconversion, "passing argument %d of %qE "
2490 "with different width due to prototype",
2492 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2494 /* Don't complain if the formal parameter type
2495 is an enum, because we can't tell now whether
2496 the value was an enum--even the same enum. */
2497 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2499 else if (TREE_CODE (val) == INTEGER_CST
2500 && int_fits_type_p (val, type))
2501 /* Change in signedness doesn't matter
2502 if a constant value is unaffected. */
2504 /* If the value is extended from a narrower
2505 unsigned type, it doesn't matter whether we
2506 pass it as signed or unsigned; the value
2507 certainly is the same either way. */
2508 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2509 && TYPE_UNSIGNED (TREE_TYPE (val)))
2511 else if (TYPE_UNSIGNED (type))
2512 warning (OPT_Wconversion, "passing argument %d of %qE "
2513 "as unsigned due to prototype",
2516 warning (OPT_Wconversion, "passing argument %d of %qE "
2517 "as signed due to prototype", argnum, rname);
2521 parmval = convert_for_assignment (type, val, ic_argpass,
2525 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2526 && INTEGRAL_TYPE_P (type)
2527 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2528 parmval = default_conversion (parmval);
2530 result = tree_cons (NULL_TREE, parmval, result);
2532 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2533 && (TYPE_PRECISION (TREE_TYPE (val))
2534 < TYPE_PRECISION (double_type_node))
2535 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2536 /* Convert `float' to `double'. */
2537 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
2538 else if ((invalid_func_diag =
2539 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2541 error (invalid_func_diag);
2542 return error_mark_node;
2545 /* Convert `short' and `char' to full-size `int'. */
2546 result = tree_cons (NULL_TREE, default_conversion (val), result);
2549 typetail = TREE_CHAIN (typetail);
2552 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2554 error ("too few arguments to function %qE", function);
2555 return error_mark_node;
2558 return nreverse (result);
2561 /* This is the entry point used by the parser to build unary operators
2562 in the input. CODE, a tree_code, specifies the unary operator, and
2563 ARG is the operand. For unary plus, the C parser currently uses
2564 CONVERT_EXPR for code. */
2567 parser_build_unary_op (enum tree_code code, struct c_expr arg)
2569 struct c_expr result;
2571 result.original_code = ERROR_MARK;
2572 result.value = build_unary_op (code, arg.value, 0);
2573 overflow_warning (result.value);
2577 /* This is the entry point used by the parser to build binary operators
2578 in the input. CODE, a tree_code, specifies the binary operator, and
2579 ARG1 and ARG2 are the operands. In addition to constructing the
2580 expression, we check for operands that were written with other binary
2581 operators in a way that is likely to confuse the user. */
2584 parser_build_binary_op (enum tree_code code, struct c_expr arg1,
2587 struct c_expr result;
2589 enum tree_code code1 = arg1.original_code;
2590 enum tree_code code2 = arg2.original_code;
2592 result.value = build_binary_op (code, arg1.value, arg2.value, 1);
2593 result.original_code = code;
2595 if (TREE_CODE (result.value) == ERROR_MARK)
2598 /* Check for cases such as x+y<<z which users are likely
2600 if (warn_parentheses)
2602 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
2604 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2605 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2606 warning (OPT_Wparentheses,
2607 "suggest parentheses around + or - inside shift");
2610 if (code == TRUTH_ORIF_EXPR)
2612 if (code1 == TRUTH_ANDIF_EXPR
2613 || code2 == TRUTH_ANDIF_EXPR)
2614 warning (OPT_Wparentheses,
2615 "suggest parentheses around && within ||");
2618 if (code == BIT_IOR_EXPR)
2620 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
2621 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2622 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
2623 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2624 warning (OPT_Wparentheses,
2625 "suggest parentheses around arithmetic in operand of |");
2626 /* Check cases like x|y==z */
2627 if (TREE_CODE_CLASS (code1) == tcc_comparison
2628 || TREE_CODE_CLASS (code2) == tcc_comparison)
2629 warning (OPT_Wparentheses,
2630 "suggest parentheses around comparison in operand of |");
2633 if (code == BIT_XOR_EXPR)
2635 if (code1 == BIT_AND_EXPR
2636 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2637 || code2 == BIT_AND_EXPR
2638 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2639 warning (OPT_Wparentheses,
2640 "suggest parentheses around arithmetic in operand of ^");
2641 /* Check cases like x^y==z */
2642 if (TREE_CODE_CLASS (code1) == tcc_comparison
2643 || TREE_CODE_CLASS (code2) == tcc_comparison)
2644 warning (OPT_Wparentheses,
2645 "suggest parentheses around comparison in operand of ^");
2648 if (code == BIT_AND_EXPR)
2650 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2651 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2652 warning (OPT_Wparentheses,
2653 "suggest parentheses around + or - in operand of &");
2654 /* Check cases like x&y==z */
2655 if (TREE_CODE_CLASS (code1) == tcc_comparison
2656 || TREE_CODE_CLASS (code2) == tcc_comparison)
2657 warning (OPT_Wparentheses,
2658 "suggest parentheses around comparison in operand of &");
2660 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
2661 if (TREE_CODE_CLASS (code) == tcc_comparison
2662 && (TREE_CODE_CLASS (code1) == tcc_comparison
2663 || TREE_CODE_CLASS (code2) == tcc_comparison))
2664 warning (OPT_Wparentheses, "comparisons like X<=Y<=Z do not "
2665 "have their mathematical meaning");
2669 /* Warn about comparisons against string literals, with the exception
2670 of testing for equality or inequality of a string literal with NULL. */
2671 if (code == EQ_EXPR || code == NE_EXPR)
2673 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2674 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2675 warning (OPT_Wstring_literal_comparison,
2676 "comparison with string literal");
2678 else if (TREE_CODE_CLASS (code) == tcc_comparison
2679 && (code1 == STRING_CST || code2 == STRING_CST))
2680 warning (OPT_Wstring_literal_comparison,
2681 "comparison with string literal");
2683 overflow_warning (result.value);
2688 /* Return a tree for the difference of pointers OP0 and OP1.
2689 The resulting tree has type int. */
2692 pointer_diff (tree op0, tree op1)
2694 tree restype = ptrdiff_type_node;
2696 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2697 tree con0, con1, lit0, lit1;
2698 tree orig_op1 = op1;
2700 if (pedantic || warn_pointer_arith)
2702 if (TREE_CODE (target_type) == VOID_TYPE)
2703 pedwarn ("pointer of type %<void *%> used in subtraction");
2704 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2705 pedwarn ("pointer to a function used in subtraction");
2708 /* If the conversion to ptrdiff_type does anything like widening or
2709 converting a partial to an integral mode, we get a convert_expression
2710 that is in the way to do any simplifications.
2711 (fold-const.c doesn't know that the extra bits won't be needed.
2712 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2713 different mode in place.)
2714 So first try to find a common term here 'by hand'; we want to cover
2715 at least the cases that occur in legal static initializers. */
2716 if ((TREE_CODE (op0) == NOP_EXPR || TREE_CODE (op0) == CONVERT_EXPR)
2717 && (TYPE_PRECISION (TREE_TYPE (op0))
2718 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2719 con0 = TREE_OPERAND (op0, 0);
2722 if ((TREE_CODE (op1) == NOP_EXPR || TREE_CODE (op1) == CONVERT_EXPR)
2723 && (TYPE_PRECISION (TREE_TYPE (op1))
2724 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2725 con1 = TREE_OPERAND (op1, 0);
2729 if (TREE_CODE (con0) == PLUS_EXPR)
2731 lit0 = TREE_OPERAND (con0, 1);
2732 con0 = TREE_OPERAND (con0, 0);
2735 lit0 = integer_zero_node;
2737 if (TREE_CODE (con1) == PLUS_EXPR)
2739 lit1 = TREE_OPERAND (con1, 1);
2740 con1 = TREE_OPERAND (con1, 0);
2743 lit1 = integer_zero_node;
2745 if (operand_equal_p (con0, con1, 0))
2752 /* First do the subtraction as integers;
2753 then drop through to build the divide operator.
2754 Do not do default conversions on the minus operator
2755 in case restype is a short type. */
2757 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2758 convert (restype, op1), 0);
2759 /* This generates an error if op1 is pointer to incomplete type. */
2760 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2761 error ("arithmetic on pointer to an incomplete type");
2763 /* This generates an error if op0 is pointer to incomplete type. */
2764 op1 = c_size_in_bytes (target_type);
2766 /* Divide by the size, in easiest possible way. */
2767 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2770 /* Construct and perhaps optimize a tree representation
2771 for a unary operation. CODE, a tree_code, specifies the operation
2772 and XARG is the operand.
2773 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2774 the default promotions (such as from short to int).
2775 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2776 allows non-lvalues; this is only used to handle conversion of non-lvalue
2777 arrays to pointers in C99. */
2780 build_unary_op (enum tree_code code, tree xarg, int flag)
2782 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2785 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2787 int noconvert = flag;
2788 const char *invalid_op_diag;
2790 if (typecode == ERROR_MARK)
2791 return error_mark_node;
2792 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2793 typecode = INTEGER_TYPE;
2795 if ((invalid_op_diag
2796 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2798 error (invalid_op_diag);
2799 return error_mark_node;
2805 /* This is used for unary plus, because a CONVERT_EXPR
2806 is enough to prevent anybody from looking inside for
2807 associativity, but won't generate any code. */
2808 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2809 || typecode == COMPLEX_TYPE
2810 || typecode == VECTOR_TYPE))
2812 error ("wrong type argument to unary plus");
2813 return error_mark_node;
2815 else if (!noconvert)
2816 arg = default_conversion (arg);
2817 arg = non_lvalue (arg);
2821 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2822 || typecode == COMPLEX_TYPE
2823 || typecode == VECTOR_TYPE))
2825 error ("wrong type argument to unary minus");
2826 return error_mark_node;
2828 else if (!noconvert)
2829 arg = default_conversion (arg);
2833 if (typecode == INTEGER_TYPE || typecode == VECTOR_TYPE)
2836 arg = default_conversion (arg);
2838 else if (typecode == COMPLEX_TYPE)
2842 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2844 arg = default_conversion (arg);
2848 error ("wrong type argument to bit-complement");
2849 return error_mark_node;
2854 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2856 error ("wrong type argument to abs");
2857 return error_mark_node;
2859 else if (!noconvert)
2860 arg = default_conversion (arg);
2864 /* Conjugating a real value is a no-op, but allow it anyway. */
2865 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2866 || typecode == COMPLEX_TYPE))
2868 error ("wrong type argument to conjugation");
2869 return error_mark_node;
2871 else if (!noconvert)
2872 arg = default_conversion (arg);
2875 case TRUTH_NOT_EXPR:
2876 if (typecode != INTEGER_TYPE
2877 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2878 && typecode != COMPLEX_TYPE)
2880 error ("wrong type argument to unary exclamation mark");
2881 return error_mark_node;
2883 arg = c_objc_common_truthvalue_conversion (arg);
2884 return invert_truthvalue (arg);
2887 if (TREE_CODE (arg) == COMPLEX_CST)
2888 return TREE_REALPART (arg);
2889 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2890 return fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2895 if (TREE_CODE (arg) == COMPLEX_CST)
2896 return TREE_IMAGPART (arg);
2897 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2898 return fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2900 return convert (TREE_TYPE (arg), integer_zero_node);
2902 case PREINCREMENT_EXPR:
2903 case POSTINCREMENT_EXPR:
2904 case PREDECREMENT_EXPR:
2905 case POSTDECREMENT_EXPR:
2907 /* Increment or decrement the real part of the value,
2908 and don't change the imaginary part. */
2909 if (typecode == COMPLEX_TYPE)
2914 pedwarn ("ISO C does not support %<++%> and %<--%>"
2915 " on complex types");
2917 arg = stabilize_reference (arg);
2918 real = build_unary_op (REALPART_EXPR, arg, 1);
2919 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2920 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
2921 build_unary_op (code, real, 1), imag);
2924 /* Report invalid types. */
2926 if (typecode != POINTER_TYPE
2927 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2929 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2930 error ("wrong type argument to increment");
2932 error ("wrong type argument to decrement");
2934 return error_mark_node;
2939 tree result_type = TREE_TYPE (arg);
2941 arg = get_unwidened (arg, 0);
2942 argtype = TREE_TYPE (arg);
2944 /* Compute the increment. */
2946 if (typecode == POINTER_TYPE)
2948 /* If pointer target is an undefined struct,
2949 we just cannot know how to do the arithmetic. */
2950 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2952 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2953 error ("increment of pointer to unknown structure");
2955 error ("decrement of pointer to unknown structure");
2957 else if ((pedantic || warn_pointer_arith)
2958 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2959 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2961 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2962 pedwarn ("wrong type argument to increment");
2964 pedwarn ("wrong type argument to decrement");
2967 inc = c_size_in_bytes (TREE_TYPE (result_type));
2970 inc = integer_one_node;
2972 inc = convert (argtype, inc);
2974 /* Complain about anything else that is not a true lvalue. */
2975 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
2976 || code == POSTINCREMENT_EXPR)
2979 return error_mark_node;
2981 /* Report a read-only lvalue. */
2982 if (TREE_READONLY (arg))
2984 readonly_error (arg,
2985 ((code == PREINCREMENT_EXPR
2986 || code == POSTINCREMENT_EXPR)
2987 ? lv_increment : lv_decrement));
2988 return error_mark_node;
2991 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2992 val = boolean_increment (code, arg);
2994 val = build2 (code, TREE_TYPE (arg), arg, inc);
2995 TREE_SIDE_EFFECTS (val) = 1;
2996 val = convert (result_type, val);
2997 if (TREE_CODE (val) != code)
2998 TREE_NO_WARNING (val) = 1;
3003 /* Note that this operation never does default_conversion. */
3005 /* Let &* cancel out to simplify resulting code. */
3006 if (TREE_CODE (arg) == INDIRECT_REF)
3008 /* Don't let this be an lvalue. */
3009 if (lvalue_p (TREE_OPERAND (arg, 0)))
3010 return non_lvalue (TREE_OPERAND (arg, 0));
3011 return TREE_OPERAND (arg, 0);
3014 /* For &x[y], return x+y */
3015 if (TREE_CODE (arg) == ARRAY_REF)
3017 tree op0 = TREE_OPERAND (arg, 0);
3018 if (!c_mark_addressable (op0))
3019 return error_mark_node;
3020 return build_binary_op (PLUS_EXPR,
3021 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3022 ? array_to_pointer_conversion (op0)
3024 TREE_OPERAND (arg, 1), 1);
3027 /* Anything not already handled and not a true memory reference
3028 or a non-lvalue array is an error. */
3029 else if (typecode != FUNCTION_TYPE && !flag
3030 && !lvalue_or_else (arg, lv_addressof))
3031 return error_mark_node;
3033 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3034 argtype = TREE_TYPE (arg);
3036 /* If the lvalue is const or volatile, merge that into the type
3037 to which the address will point. Note that you can't get a
3038 restricted pointer by taking the address of something, so we
3039 only have to deal with `const' and `volatile' here. */
3040 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3041 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3042 argtype = c_build_type_variant (argtype,
3043 TREE_READONLY (arg),
3044 TREE_THIS_VOLATILE (arg));
3046 if (!c_mark_addressable (arg))
3047 return error_mark_node;
3049 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3050 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3052 argtype = build_pointer_type (argtype);
3054 /* ??? Cope with user tricks that amount to offsetof. Delete this
3055 when we have proper support for integer constant expressions. */
3056 val = get_base_address (arg);
3057 if (val && TREE_CODE (val) == INDIRECT_REF
3058 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3060 tree op0 = fold_convert (argtype, fold_offsetof (arg)), op1;
3062 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3063 return fold_build2 (PLUS_EXPR, argtype, op0, op1);
3066 val = build1 (ADDR_EXPR, argtype, arg);
3075 argtype = TREE_TYPE (arg);
3076 return require_constant_value ? fold_build1_initializer (code, argtype, arg)
3077 : fold_build1 (code, argtype, arg);
3080 /* Return nonzero if REF is an lvalue valid for this language.
3081 Lvalues can be assigned, unless their type has TYPE_READONLY.
3082 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3087 enum tree_code code = TREE_CODE (ref);
3094 return lvalue_p (TREE_OPERAND (ref, 0));
3096 case COMPOUND_LITERAL_EXPR:
3106 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3107 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3110 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3117 /* Give an error for storing in something that is 'const'. */
3120 readonly_error (tree arg, enum lvalue_use use)
3122 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3124 /* Using this macro rather than (for example) arrays of messages
3125 ensures that all the format strings are checked at compile
3127 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3128 : (use == lv_increment ? (I) \
3129 : (use == lv_decrement ? (D) : (AS))))
3130 if (TREE_CODE (arg) == COMPONENT_REF)
3132 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3133 readonly_error (TREE_OPERAND (arg, 0), use);
3135 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3136 G_("increment of read-only member %qD"),
3137 G_("decrement of read-only member %qD"),
3138 G_("read-only member %qD used as %<asm%> output")),
3139 TREE_OPERAND (arg, 1));
3141 else if (TREE_CODE (arg) == VAR_DECL)
3142 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3143 G_("increment of read-only variable %qD"),
3144 G_("decrement of read-only variable %qD"),
3145 G_("read-only variable %qD used as %<asm%> output")),
3148 error (READONLY_MSG (G_("assignment of read-only location"),
3149 G_("increment of read-only location"),
3150 G_("decrement of read-only location"),
3151 G_("read-only location used as %<asm%> output")));
3155 /* Return nonzero if REF is an lvalue valid for this language;
3156 otherwise, print an error message and return zero. USE says
3157 how the lvalue is being used and so selects the error message. */
3160 lvalue_or_else (tree ref, enum lvalue_use use)
3162 int win = lvalue_p (ref);
3170 /* Mark EXP saying that we need to be able to take the
3171 address of it; it should not be allocated in a register.
3172 Returns true if successful. */
3175 c_mark_addressable (tree exp)
3180 switch (TREE_CODE (x))
3183 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3186 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3190 /* ... fall through ... */
3196 x = TREE_OPERAND (x, 0);
3199 case COMPOUND_LITERAL_EXPR:
3201 TREE_ADDRESSABLE (x) = 1;
3208 if (C_DECL_REGISTER (x)
3209 && DECL_NONLOCAL (x))
3211 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3214 ("global register variable %qD used in nested function", x);
3217 pedwarn ("register variable %qD used in nested function", x);
3219 else if (C_DECL_REGISTER (x))
3221 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3222 error ("address of global register variable %qD requested", x);
3224 error ("address of register variable %qD requested", x);
3230 TREE_ADDRESSABLE (x) = 1;
3237 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3240 build_conditional_expr (tree ifexp, tree op1, tree op2)
3244 enum tree_code code1;
3245 enum tree_code code2;
3246 tree result_type = NULL;
3247 tree orig_op1 = op1, orig_op2 = op2;
3249 /* Promote both alternatives. */
3251 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3252 op1 = default_conversion (op1);
3253 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3254 op2 = default_conversion (op2);
3256 if (TREE_CODE (ifexp) == ERROR_MARK
3257 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3258 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3259 return error_mark_node;
3261 type1 = TREE_TYPE (op1);
3262 code1 = TREE_CODE (type1);
3263 type2 = TREE_TYPE (op2);
3264 code2 = TREE_CODE (type2);
3266 /* C90 does not permit non-lvalue arrays in conditional expressions.
3267 In C99 they will be pointers by now. */
3268 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3270 error ("non-lvalue array in conditional expression");
3271 return error_mark_node;
3274 /* Quickly detect the usual case where op1 and op2 have the same type
3276 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3279 result_type = type1;
3281 result_type = TYPE_MAIN_VARIANT (type1);
3283 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3284 || code1 == COMPLEX_TYPE)
3285 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3286 || code2 == COMPLEX_TYPE))
3288 result_type = c_common_type (type1, type2);
3290 /* If -Wsign-compare, warn here if type1 and type2 have
3291 different signedness. We'll promote the signed to unsigned
3292 and later code won't know it used to be different.
3293 Do this check on the original types, so that explicit casts
3294 will be considered, but default promotions won't. */
3295 if (warn_sign_compare && !skip_evaluation)
3297 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3298 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3300 if (unsigned_op1 ^ unsigned_op2)
3302 /* Do not warn if the result type is signed, since the
3303 signed type will only be chosen if it can represent
3304 all the values of the unsigned type. */
3305 if (!TYPE_UNSIGNED (result_type))
3307 /* Do not warn if the signed quantity is an unsuffixed
3308 integer literal (or some static constant expression
3309 involving such literals) and it is non-negative. */
3310 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
3311 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
3314 warning (0, "signed and unsigned type in conditional expression");
3318 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3320 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3321 pedwarn ("ISO C forbids conditional expr with only one void side");
3322 result_type = void_type_node;
3324 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3326 if (comp_target_types (type1, type2))
3327 result_type = common_pointer_type (type1, type2);
3328 else if (null_pointer_constant_p (orig_op1))
3329 result_type = qualify_type (type2, type1);
3330 else if (null_pointer_constant_p (orig_op2))
3331 result_type = qualify_type (type1, type2);
3332 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3334 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3335 pedwarn ("ISO C forbids conditional expr between "
3336 "%<void *%> and function pointer");
3337 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3338 TREE_TYPE (type2)));
3340 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3342 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3343 pedwarn ("ISO C forbids conditional expr between "
3344 "%<void *%> and function pointer");
3345 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3346 TREE_TYPE (type1)));
3350 pedwarn ("pointer type mismatch in conditional expression");
3351 result_type = build_pointer_type (void_type_node);
3354 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3356 if (!null_pointer_constant_p (orig_op2))
3357 pedwarn ("pointer/integer type mismatch in conditional expression");
3360 op2 = null_pointer_node;
3362 result_type = type1;
3364 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3366 if (!null_pointer_constant_p (orig_op1))
3367 pedwarn ("pointer/integer type mismatch in conditional expression");
3370 op1 = null_pointer_node;
3372 result_type = type2;
3377 if (flag_cond_mismatch)
3378 result_type = void_type_node;
3381 error ("type mismatch in conditional expression");
3382 return error_mark_node;
3386 /* Merge const and volatile flags of the incoming types. */
3388 = build_type_variant (result_type,
3389 TREE_READONLY (op1) || TREE_READONLY (op2),
3390 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3392 if (result_type != TREE_TYPE (op1))
3393 op1 = convert_and_check (result_type, op1);
3394 if (result_type != TREE_TYPE (op2))
3395 op2 = convert_and_check (result_type, op2);
3397 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3400 /* Return a compound expression that performs two expressions and
3401 returns the value of the second of them. */
3404 build_compound_expr (tree expr1, tree expr2)
3406 if (!TREE_SIDE_EFFECTS (expr1))
3408 /* The left-hand operand of a comma expression is like an expression
3409 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3410 any side-effects, unless it was explicitly cast to (void). */
3411 if (warn_unused_value)
3413 if (VOID_TYPE_P (TREE_TYPE (expr1))
3414 && (TREE_CODE (expr1) == NOP_EXPR
3415 || TREE_CODE (expr1) == CONVERT_EXPR))
3417 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3418 && TREE_CODE (expr1) == COMPOUND_EXPR
3419 && (TREE_CODE (TREE_OPERAND (expr1, 1)) == CONVERT_EXPR
3420 || TREE_CODE (TREE_OPERAND (expr1, 1)) == NOP_EXPR))
3421 ; /* (void) a, (void) b, c */
3423 warning (0, "left-hand operand of comma expression has no effect");
3427 /* With -Wunused, we should also warn if the left-hand operand does have
3428 side-effects, but computes a value which is not used. For example, in
3429 `foo() + bar(), baz()' the result of the `+' operator is not used,
3430 so we should issue a warning. */
3431 else if (warn_unused_value)
3432 warn_if_unused_value (expr1, input_location);
3434 if (expr2 == error_mark_node)
3435 return error_mark_node;
3437 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3440 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3443 build_c_cast (tree type, tree expr)
3447 if (type == error_mark_node || expr == error_mark_node)
3448 return error_mark_node;
3450 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3451 only in <protocol> qualifications. But when constructing cast expressions,
3452 the protocols do matter and must be kept around. */
3453 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3454 return build1 (NOP_EXPR, type, expr);
3456 type = TYPE_MAIN_VARIANT (type);
3458 if (TREE_CODE (type) == ARRAY_TYPE)
3460 error ("cast specifies array type");
3461 return error_mark_node;
3464 if (TREE_CODE (type) == FUNCTION_TYPE)
3466 error ("cast specifies function type");
3467 return error_mark_node;
3470 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3474 if (TREE_CODE (type) == RECORD_TYPE
3475 || TREE_CODE (type) == UNION_TYPE)
3476 pedwarn ("ISO C forbids casting nonscalar to the same type");
3479 else if (TREE_CODE (type) == UNION_TYPE)
3483 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3484 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3485 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3493 pedwarn ("ISO C forbids casts to union type");
3494 t = digest_init (type,
3495 build_constructor_single (type, field, value),
3497 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3498 TREE_INVARIANT (t) = TREE_INVARIANT (value);
3501 error ("cast to union type from type not present in union");
3502 return error_mark_node;
3508 if (type == void_type_node)
3509 return build1 (CONVERT_EXPR, type, value);
3511 otype = TREE_TYPE (value);
3513 /* Optionally warn about potentially worrisome casts. */
3516 && TREE_CODE (type) == POINTER_TYPE
3517 && TREE_CODE (otype) == POINTER_TYPE)
3519 tree in_type = type;
3520 tree in_otype = otype;
3524 /* Check that the qualifiers on IN_TYPE are a superset of
3525 the qualifiers of IN_OTYPE. The outermost level of
3526 POINTER_TYPE nodes is uninteresting and we stop as soon
3527 as we hit a non-POINTER_TYPE node on either type. */
3530 in_otype = TREE_TYPE (in_otype);
3531 in_type = TREE_TYPE (in_type);
3533 /* GNU C allows cv-qualified function types. 'const'
3534 means the function is very pure, 'volatile' means it
3535 can't return. We need to warn when such qualifiers
3536 are added, not when they're taken away. */
3537 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3538 && TREE_CODE (in_type) == FUNCTION_TYPE)
3539 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3541 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3543 while (TREE_CODE (in_type) == POINTER_TYPE
3544 && TREE_CODE (in_otype) == POINTER_TYPE);
3547 warning (0, "cast adds new qualifiers to function type");
3550 /* There are qualifiers present in IN_OTYPE that are not
3551 present in IN_TYPE. */
3552 warning (0, "cast discards qualifiers from pointer target type");
3555 /* Warn about possible alignment problems. */
3556 if (STRICT_ALIGNMENT
3557 && TREE_CODE (type) == POINTER_TYPE
3558 && TREE_CODE (otype) == POINTER_TYPE
3559 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3560 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3561 /* Don't warn about opaque types, where the actual alignment
3562 restriction is unknown. */
3563 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3564 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3565 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3566 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3567 warning (OPT_Wcast_align,
3568 "cast increases required alignment of target type");
3570 if (TREE_CODE (type) == INTEGER_TYPE
3571 && TREE_CODE (otype) == POINTER_TYPE
3572 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3573 /* Unlike conversion of integers to pointers, where the
3574 warning is disabled for converting constants because
3575 of cases such as SIG_*, warn about converting constant
3576 pointers to integers. In some cases it may cause unwanted
3577 sign extension, and a warning is appropriate. */
3578 warning (OPT_Wpointer_to_int_cast,
3579 "cast from pointer to integer of different size");
3581 if (TREE_CODE (value) == CALL_EXPR
3582 && TREE_CODE (type) != TREE_CODE (otype))
3583 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3584 "to non-matching type %qT", otype, type);
3586 if (TREE_CODE (type) == POINTER_TYPE
3587 && TREE_CODE (otype) == INTEGER_TYPE
3588 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3589 /* Don't warn about converting any constant. */
3590 && !TREE_CONSTANT (value))
3591 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3592 "of different size");
3594 strict_aliasing_warning (otype, type, expr);
3596 /* If pedantic, warn for conversions between function and object
3597 pointer types, except for converting a null pointer constant
3598 to function pointer type. */
3600 && TREE_CODE (type) == POINTER_TYPE
3601 && TREE_CODE (otype) == POINTER_TYPE
3602 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3603 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3604 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3607 && TREE_CODE (type) == POINTER_TYPE
3608 && TREE_CODE (otype) == POINTER_TYPE
3609 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3610 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3611 && !null_pointer_constant_p (value))
3612 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3615 value = convert (type, value);
3617 /* Ignore any integer overflow caused by the cast. */
3618 if (TREE_CODE (value) == INTEGER_CST)
3620 if (CONSTANT_CLASS_P (ovalue)
3621 && (TREE_OVERFLOW (ovalue) || TREE_CONSTANT_OVERFLOW (ovalue)))
3623 /* Avoid clobbering a shared constant. */
3624 value = copy_node (value);
3625 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3626 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3628 else if (TREE_OVERFLOW (value) || TREE_CONSTANT_OVERFLOW (value))
3629 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3630 value = build_int_cst_wide (TREE_TYPE (value),
3631 TREE_INT_CST_LOW (value),
3632 TREE_INT_CST_HIGH (value));
3636 /* Don't let a cast be an lvalue. */
3638 value = non_lvalue (value);
3643 /* Interpret a cast of expression EXPR to type TYPE. */
3645 c_cast_expr (struct c_type_name *type_name, tree expr)
3648 int saved_wsp = warn_strict_prototypes;
3650 /* This avoids warnings about unprototyped casts on
3651 integers. E.g. "#define SIG_DFL (void(*)())0". */
3652 if (TREE_CODE (expr) == INTEGER_CST)
3653 warn_strict_prototypes = 0;
3654 type = groktypename (type_name);
3655 warn_strict_prototypes = saved_wsp;
3657 return build_c_cast (type, expr);
3660 /* Build an assignment expression of lvalue LHS from value RHS.
3661 MODIFYCODE is the code for a binary operator that we use
3662 to combine the old value of LHS with RHS to get the new value.
3663 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3666 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3670 tree lhstype = TREE_TYPE (lhs);
3671 tree olhstype = lhstype;
3673 /* Types that aren't fully specified cannot be used in assignments. */
3674 lhs = require_complete_type (lhs);
3676 /* Avoid duplicate error messages from operands that had errors. */
3677 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3678 return error_mark_node;
3680 if (!lvalue_or_else (lhs, lv_assign))
3681 return error_mark_node;
3683 STRIP_TYPE_NOPS (rhs);
3687 /* If a binary op has been requested, combine the old LHS value with the RHS
3688 producing the value we should actually store into the LHS. */
3690 if (modifycode != NOP_EXPR)
3692 lhs = stabilize_reference (lhs);
3693 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3696 /* Give an error for storing in something that is 'const'. */
3698 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3699 || ((TREE_CODE (lhstype) == RECORD_TYPE
3700 || TREE_CODE (lhstype) == UNION_TYPE)
3701 && C_TYPE_FIELDS_READONLY (lhstype)))
3703 readonly_error (lhs, lv_assign);
3704 return error_mark_node;
3707 /* If storing into a structure or union member,
3708 it has probably been given type `int'.
3709 Compute the type that would go with
3710 the actual amount of storage the member occupies. */
3712 if (TREE_CODE (lhs) == COMPONENT_REF
3713 && (TREE_CODE (lhstype) == INTEGER_TYPE
3714 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3715 || TREE_CODE (lhstype) == REAL_TYPE
3716 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3717 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3719 /* If storing in a field that is in actuality a short or narrower than one,
3720 we must store in the field in its actual type. */
3722 if (lhstype != TREE_TYPE (lhs))
3724 lhs = copy_node (lhs);
3725 TREE_TYPE (lhs) = lhstype;
3728 /* Convert new value to destination type. */
3730 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3731 NULL_TREE, NULL_TREE, 0);
3732 if (TREE_CODE (newrhs) == ERROR_MARK)
3733 return error_mark_node;
3735 /* Emit ObjC write barrier, if necessary. */
3736 if (c_dialect_objc () && flag_objc_gc)
3738 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3743 /* Scan operands. */
3745 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3746 TREE_SIDE_EFFECTS (result) = 1;
3748 /* If we got the LHS in a different type for storing in,
3749 convert the result back to the nominal type of LHS
3750 so that the value we return always has the same type
3751 as the LHS argument. */
3753 if (olhstype == TREE_TYPE (result))
3755 return convert_for_assignment (olhstype, result, ic_assign,
3756 NULL_TREE, NULL_TREE, 0);
3759 /* Convert value RHS to type TYPE as preparation for an assignment
3760 to an lvalue of type TYPE.
3761 The real work of conversion is done by `convert'.
3762 The purpose of this function is to generate error messages
3763 for assignments that are not allowed in C.
3764 ERRTYPE says whether it is argument passing, assignment,
3765 initialization or return.
3767 FUNCTION is a tree for the function being called.
3768 PARMNUM is the number of the argument, for printing in error messages. */
3771 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3772 tree fundecl, tree function, int parmnum)
3774 enum tree_code codel = TREE_CODE (type);
3776 enum tree_code coder;
3777 tree rname = NULL_TREE;
3778 bool objc_ok = false;
3780 if (errtype == ic_argpass || errtype == ic_argpass_nonproto)
3783 /* Change pointer to function to the function itself for
3785 if (TREE_CODE (function) == ADDR_EXPR
3786 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3787 function = TREE_OPERAND (function, 0);
3789 /* Handle an ObjC selector specially for diagnostics. */
3790 selector = objc_message_selector ();
3792 if (selector && parmnum > 2)
3799 /* This macro is used to emit diagnostics to ensure that all format
3800 strings are complete sentences, visible to gettext and checked at
3802 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3807 pedwarn (AR, parmnum, rname); \
3809 case ic_argpass_nonproto: \
3810 warning (0, AR, parmnum, rname); \
3822 gcc_unreachable (); \
3826 STRIP_TYPE_NOPS (rhs);
3828 if (optimize && TREE_CODE (rhs) == VAR_DECL
3829 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
3830 rhs = decl_constant_value_for_broken_optimization (rhs);
3832 rhstype = TREE_TYPE (rhs);
3833 coder = TREE_CODE (rhstype);
3835 if (coder == ERROR_MARK)
3836 return error_mark_node;
3838 if (c_dialect_objc ())
3861 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
3864 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
3866 overflow_warning (rhs);
3870 if (coder == VOID_TYPE)
3872 /* Except for passing an argument to an unprototyped function,
3873 this is a constraint violation. When passing an argument to
3874 an unprototyped function, it is compile-time undefined;
3875 making it a constraint in that case was rejected in
3877 error ("void value not ignored as it ought to be");
3878 return error_mark_node;
3880 /* A type converts to a reference to it.
3881 This code doesn't fully support references, it's just for the
3882 special case of va_start and va_copy. */
3883 if (codel == REFERENCE_TYPE
3884 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
3886 if (!lvalue_p (rhs))
3888 error ("cannot pass rvalue to reference parameter");
3889 return error_mark_node;
3891 if (!c_mark_addressable (rhs))
3892 return error_mark_node;
3893 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
3895 /* We already know that these two types are compatible, but they
3896 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3897 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3898 likely to be va_list, a typedef to __builtin_va_list, which
3899 is different enough that it will cause problems later. */
3900 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
3901 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
3903 rhs = build1 (NOP_EXPR, type, rhs);
3906 /* Some types can interconvert without explicit casts. */
3907 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
3908 && vector_types_convertible_p (type, TREE_TYPE (rhs)))
3909 return convert (type, rhs);
3910 /* Arithmetic types all interconvert, and enum is treated like int. */
3911 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
3912 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
3913 || codel == BOOLEAN_TYPE)
3914 && (coder == INTEGER_TYPE || coder == REAL_TYPE
3915 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
3916 || coder == BOOLEAN_TYPE))
3917 return convert_and_check (type, rhs);
3919 /* Conversion to a transparent union from its member types.
3920 This applies only to function arguments. */
3921 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
3922 && (errtype == ic_argpass || errtype == ic_argpass_nonproto))
3924 tree memb, marginal_memb = NULL_TREE;
3926 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
3928 tree memb_type = TREE_TYPE (memb);
3930 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
3931 TYPE_MAIN_VARIANT (rhstype)))
3934 if (TREE_CODE (memb_type) != POINTER_TYPE)
3937 if (coder == POINTER_TYPE)
3939 tree ttl = TREE_TYPE (memb_type);
3940 tree ttr = TREE_TYPE (rhstype);
3942 /* Any non-function converts to a [const][volatile] void *
3943 and vice versa; otherwise, targets must be the same.
3944 Meanwhile, the lhs target must have all the qualifiers of
3946 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3947 || comp_target_types (memb_type, rhstype))
3949 /* If this type won't generate any warnings, use it. */
3950 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
3951 || ((TREE_CODE (ttr) == FUNCTION_TYPE
3952 && TREE_CODE (ttl) == FUNCTION_TYPE)
3953 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3954 == TYPE_QUALS (ttr))
3955 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3956 == TYPE_QUALS (ttl))))
3959 /* Keep looking for a better type, but remember this one. */
3961 marginal_memb = memb;
3965 /* Can convert integer zero to any pointer type. */
3966 if (null_pointer_constant_p (rhs))
3968 rhs = null_pointer_node;
3973 if (memb || marginal_memb)
3977 /* We have only a marginally acceptable member type;
3978 it needs a warning. */
3979 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
3980 tree ttr = TREE_TYPE (rhstype);
3982 /* Const and volatile mean something different for function
3983 types, so the usual warnings are not appropriate. */
3984 if (TREE_CODE (ttr) == FUNCTION_TYPE
3985 && TREE_CODE (ttl) == FUNCTION_TYPE)
3987 /* Because const and volatile on functions are
3988 restrictions that say the function will not do
3989 certain things, it is okay to use a const or volatile
3990 function where an ordinary one is wanted, but not
3992 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
3993 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
3994 "makes qualified function "
3995 "pointer from unqualified"),
3996 G_("assignment makes qualified "
3997 "function pointer from "
3999 G_("initialization makes qualified "
4000 "function pointer from "
4002 G_("return makes qualified function "
4003 "pointer from unqualified"));
4005 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4006 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4007 "qualifiers from pointer target type"),
4008 G_("assignment discards qualifiers "
4009 "from pointer target type"),
4010 G_("initialization discards qualifiers "
4011 "from pointer target type"),
4012 G_("return discards qualifiers from "
4013 "pointer target type"));
4015 memb = marginal_memb;
4018 if (pedantic && (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl)))
4019 pedwarn ("ISO C prohibits argument conversion to union type");
4021 return build_constructor_single (type, memb, rhs);
4025 /* Conversions among pointers */
4026 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4027 && (coder == codel))
4029 tree ttl = TREE_TYPE (type);
4030 tree ttr = TREE_TYPE (rhstype);
4033 bool is_opaque_pointer;
4034 int target_cmp = 0; /* Cache comp_target_types () result. */
4036 if (TREE_CODE (mvl) != ARRAY_TYPE)
4037 mvl = TYPE_MAIN_VARIANT (mvl);
4038 if (TREE_CODE (mvr) != ARRAY_TYPE)
4039 mvr = TYPE_MAIN_VARIANT (mvr);
4040 /* Opaque pointers are treated like void pointers. */
4041 is_opaque_pointer = (targetm.vector_opaque_p (type)
4042 || targetm.vector_opaque_p (rhstype))
4043 && TREE_CODE (ttl) == VECTOR_TYPE
4044 && TREE_CODE (ttr) == VECTOR_TYPE;
4046 /* C++ does not allow the implicit conversion void* -> T*. However,
4047 for the purpose of reducing the number of false positives, we
4048 tolerate the special case of
4052 where NULL is typically defined in C to be '(void *) 0'. */
4053 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4054 warning (OPT_Wc___compat, "request for implicit conversion from "
4055 "%qT to %qT not permitted in C++", rhstype, type);
4057 /* Check if the right-hand side has a format attribute but the
4058 left-hand side doesn't. */
4059 if (warn_missing_format_attribute
4060 && check_missing_format_attribute (type, rhstype))
4065 case ic_argpass_nonproto:
4066 warning (OPT_Wmissing_format_attribute,
4067 "argument %d of %qE might be "
4068 "a candidate for a format attribute",
4072 warning (OPT_Wmissing_format_attribute,
4073 "assignment left-hand side might be "
4074 "a candidate for a format attribute");
4077 warning (OPT_Wmissing_format_attribute,
4078 "initialization left-hand side might be "
4079 "a candidate for a format attribute");
4082 warning (OPT_Wmissing_format_attribute,
4083 "return type might be "
4084 "a candidate for a format attribute");
4091 /* Any non-function converts to a [const][volatile] void *
4092 and vice versa; otherwise, targets must be the same.
4093 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4094 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4095 || (target_cmp = comp_target_types (type, rhstype))
4096 || is_opaque_pointer
4097 || (c_common_unsigned_type (mvl)
4098 == c_common_unsigned_type (mvr)))
4101 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4104 && !null_pointer_constant_p (rhs)
4105 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4106 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
4107 "%qE between function pointer "
4109 G_("ISO C forbids assignment between "
4110 "function pointer and %<void *%>"),
4111 G_("ISO C forbids initialization between "
4112 "function pointer and %<void *%>"),
4113 G_("ISO C forbids return between function "
4114 "pointer and %<void *%>"));
4115 /* Const and volatile mean something different for function types,
4116 so the usual warnings are not appropriate. */
4117 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4118 && TREE_CODE (ttl) != FUNCTION_TYPE)
4120 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4122 /* Types differing only by the presence of the 'volatile'
4123 qualifier are acceptable if the 'volatile' has been added
4124 in by the Objective-C EH machinery. */
4125 if (!objc_type_quals_match (ttl, ttr))
4126 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4127 "qualifiers from pointer target type"),
4128 G_("assignment discards qualifiers "
4129 "from pointer target type"),
4130 G_("initialization discards qualifiers "
4131 "from pointer target type"),
4132 G_("return discards qualifiers from "
4133 "pointer target type"));
4135 /* If this is not a case of ignoring a mismatch in signedness,
4137 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4140 /* If there is a mismatch, do warn. */
4141 else if (warn_pointer_sign)
4142 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
4143 "%d of %qE differ in signedness"),
4144 G_("pointer targets in assignment "
4145 "differ in signedness"),
4146 G_("pointer targets in initialization "
4147 "differ in signedness"),
4148 G_("pointer targets in return differ "
4151 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4152 && TREE_CODE (ttr) == FUNCTION_TYPE)
4154 /* Because const and volatile on functions are restrictions
4155 that say the function will not do certain things,
4156 it is okay to use a const or volatile function
4157 where an ordinary one is wanted, but not vice-versa. */
4158 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4159 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4160 "qualified function pointer "
4161 "from unqualified"),
4162 G_("assignment makes qualified function "
4163 "pointer from unqualified"),
4164 G_("initialization makes qualified "
4165 "function pointer from unqualified"),
4166 G_("return makes qualified function "
4167 "pointer from unqualified"));
4171 /* Avoid warning about the volatile ObjC EH puts on decls. */
4173 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
4174 "incompatible pointer type"),
4175 G_("assignment from incompatible pointer type"),
4176 G_("initialization from incompatible "
4178 G_("return from incompatible pointer type"));
4180 return convert (type, rhs);
4182 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4184 /* ??? This should not be an error when inlining calls to
4185 unprototyped functions. */
4186 error ("invalid use of non-lvalue array");
4187 return error_mark_node;
4189 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4191 /* An explicit constant 0 can convert to a pointer,
4192 or one that results from arithmetic, even including
4193 a cast to integer type. */
4194 if (!null_pointer_constant_p (rhs))
4195 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4196 "pointer from integer without a cast"),
4197 G_("assignment makes pointer from integer "
4199 G_("initialization makes pointer from "
4200 "integer without a cast"),
4201 G_("return makes pointer from integer "
4204 return convert (type, rhs);
4206 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4208 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
4209 "from pointer without a cast"),
4210 G_("assignment makes integer from pointer "
4212 G_("initialization makes integer from pointer "
4214 G_("return makes integer from pointer "
4216 return convert (type, rhs);
4218 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4219 return convert (type, rhs);
4224 case ic_argpass_nonproto:
4225 /* ??? This should not be an error when inlining calls to
4226 unprototyped functions. */
4227 error ("incompatible type for argument %d of %qE", parmnum, rname);
4230 error ("incompatible types in assignment");
4233 error ("incompatible types in initialization");
4236 error ("incompatible types in return");
4242 return error_mark_node;
4245 /* Convert VALUE for assignment into inlined parameter PARM. ARGNUM
4246 is used for error and waring reporting and indicates which argument
4247 is being processed. */
4250 c_convert_parm_for_inlining (tree parm, tree value, tree fn, int argnum)
4254 /* If FN was prototyped, the value has been converted already
4255 in convert_arguments. */
4256 if (!value || TYPE_ARG_TYPES (TREE_TYPE (fn)))
4259 type = TREE_TYPE (parm);
4260 ret = convert_for_assignment (type, value,
4261 ic_argpass_nonproto, fn,
4263 if (targetm.calls.promote_prototypes (TREE_TYPE (fn))
4264 && INTEGRAL_TYPE_P (type)
4265 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
4266 ret = default_conversion (ret);
4270 /* If VALUE is a compound expr all of whose expressions are constant, then
4271 return its value. Otherwise, return error_mark_node.
4273 This is for handling COMPOUND_EXPRs as initializer elements
4274 which is allowed with a warning when -pedantic is specified. */
4277 valid_compound_expr_initializer (tree value, tree endtype)
4279 if (TREE_CODE (value) == COMPOUND_EXPR)
4281 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4283 return error_mark_node;
4284 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4287 else if (!initializer_constant_valid_p (value, endtype))
4288 return error_mark_node;
4293 /* Perform appropriate conversions on the initial value of a variable,
4294 store it in the declaration DECL,
4295 and print any error messages that are appropriate.
4296 If the init is invalid, store an ERROR_MARK. */
4299 store_init_value (tree decl, tree init)
4303 /* If variable's type was invalidly declared, just ignore it. */
4305 type = TREE_TYPE (decl);
4306 if (TREE_CODE (type) == ERROR_MARK)
4309 /* Digest the specified initializer into an expression. */
4311 value = digest_init (type, init, true, TREE_STATIC (decl));
4313 /* Store the expression if valid; else report error. */
4315 if (!in_system_header
4316 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4317 warning (OPT_Wtraditional, "traditional C rejects automatic "
4318 "aggregate initialization");
4320 DECL_INITIAL (decl) = value;
4322 /* ANSI wants warnings about out-of-range constant initializers. */
4323 STRIP_TYPE_NOPS (value);
4324 constant_expression_warning (value);
4326 /* Check if we need to set array size from compound literal size. */
4327 if (TREE_CODE (type) == ARRAY_TYPE
4328 && TYPE_DOMAIN (type) == 0
4329 && value != error_mark_node)
4331 tree inside_init = init;
4333 STRIP_TYPE_NOPS (inside_init);
4334 inside_init = fold (inside_init);
4336 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4338 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4340 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
4342 /* For int foo[] = (int [3]){1}; we need to set array size
4343 now since later on array initializer will be just the
4344 brace enclosed list of the compound literal. */
4345 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
4346 TREE_TYPE (decl) = type;
4347 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
4349 layout_decl (cldecl, 0);
4355 /* Methods for storing and printing names for error messages. */
4357 /* Implement a spelling stack that allows components of a name to be pushed
4358 and popped. Each element on the stack is this structure. */
4365 unsigned HOST_WIDE_INT i;
4370 #define SPELLING_STRING 1
4371 #define SPELLING_MEMBER 2
4372 #define SPELLING_BOUNDS 3
4374 static struct spelling *spelling; /* Next stack element (unused). */
4375 static struct spelling *spelling_base; /* Spelling stack base. */
4376 static int spelling_size; /* Size of the spelling stack. */
4378 /* Macros to save and restore the spelling stack around push_... functions.
4379 Alternative to SAVE_SPELLING_STACK. */
4381 #define SPELLING_DEPTH() (spelling - spelling_base)
4382 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4384 /* Push an element on the spelling stack with type KIND and assign VALUE
4387 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4389 int depth = SPELLING_DEPTH (); \
4391 if (depth >= spelling_size) \
4393 spelling_size += 10; \
4394 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4396 RESTORE_SPELLING_DEPTH (depth); \
4399 spelling->kind = (KIND); \
4400 spelling->MEMBER = (VALUE); \
4404 /* Push STRING on the stack. Printed literally. */
4407 push_string (const char *string)
4409 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4412 /* Push a member name on the stack. Printed as '.' STRING. */
4415 push_member_name (tree decl)
4417 const char *const string
4418 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4419 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4422 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4425 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4427 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4430 /* Compute the maximum size in bytes of the printed spelling. */
4433 spelling_length (void)
4438 for (p = spelling_base; p < spelling; p++)
4440 if (p->kind == SPELLING_BOUNDS)
4443 size += strlen (p->u.s) + 1;
4449 /* Print the spelling to BUFFER and return it. */
4452 print_spelling (char *buffer)
4457 for (p = spelling_base; p < spelling; p++)
4458 if (p->kind == SPELLING_BOUNDS)
4460 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4466 if (p->kind == SPELLING_MEMBER)
4468 for (s = p->u.s; (*d = *s++); d++)
4475 /* Issue an error message for a bad initializer component.
4476 MSGID identifies the message.
4477 The component name is taken from the spelling stack. */
4480 error_init (const char *msgid)
4484 error ("%s", _(msgid));
4485 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4487 error ("(near initialization for %qs)", ofwhat);
4490 /* Issue a pedantic warning for a bad initializer component.
4491 MSGID identifies the message.
4492 The component name is taken from the spelling stack. */
4495 pedwarn_init (const char *msgid)
4499 pedwarn ("%s", _(msgid));
4500 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4502 pedwarn ("(near initialization for %qs)", ofwhat);
4505 /* Issue a warning for a bad initializer component.
4506 MSGID identifies the message.
4507 The component name is taken from the spelling stack. */
4510 warning_init (const char *msgid)
4514 warning (0, "%s", _(msgid));
4515 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4517 warning (0, "(near initialization for %qs)", ofwhat);
4520 /* If TYPE is an array type and EXPR is a parenthesized string
4521 constant, warn if pedantic that EXPR is being used to initialize an
4522 object of type TYPE. */
4525 maybe_warn_string_init (tree type, struct c_expr expr)
4528 && TREE_CODE (type) == ARRAY_TYPE
4529 && TREE_CODE (expr.value) == STRING_CST
4530 && expr.original_code != STRING_CST)
4531 pedwarn_init ("array initialized from parenthesized string constant");
4534 /* Digest the parser output INIT as an initializer for type TYPE.
4535 Return a C expression of type TYPE to represent the initial value.
4537 If INIT is a string constant, STRICT_STRING is true if it is
4538 unparenthesized or we should not warn here for it being parenthesized.
4539 For other types of INIT, STRICT_STRING is not used.
4541 REQUIRE_CONSTANT requests an error if non-constant initializers or
4542 elements are seen. */
4545 digest_init (tree type, tree init, bool strict_string, int require_constant)
4547 enum tree_code code = TREE_CODE (type);
4548 tree inside_init = init;
4550 if (type == error_mark_node
4552 || init == error_mark_node
4553 || TREE_TYPE (init) == error_mark_node)
4554 return error_mark_node;
4556 STRIP_TYPE_NOPS (inside_init);
4558 inside_init = fold (inside_init);
4560 /* Initialization of an array of chars from a string constant
4561 optionally enclosed in braces. */
4563 if (code == ARRAY_TYPE && inside_init
4564 && TREE_CODE (inside_init) == STRING_CST)
4566 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4567 /* Note that an array could be both an array of character type
4568 and an array of wchar_t if wchar_t is signed char or unsigned
4570 bool char_array = (typ1 == char_type_node
4571 || typ1 == signed_char_type_node
4572 || typ1 == unsigned_char_type_node);
4573 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4574 if (char_array || wchar_array)
4578 expr.value = inside_init;
4579 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4580 maybe_warn_string_init (type, expr);
4583 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4586 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4587 TYPE_MAIN_VARIANT (type)))
4590 if (!wchar_array && !char_string)
4592 error_init ("char-array initialized from wide string");
4593 return error_mark_node;
4595 if (char_string && !char_array)
4597 error_init ("wchar_t-array initialized from non-wide string");
4598 return error_mark_node;
4601 TREE_TYPE (inside_init) = type;
4602 if (TYPE_DOMAIN (type) != 0
4603 && TYPE_SIZE (type) != 0
4604 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4605 /* Subtract 1 (or sizeof (wchar_t))
4606 because it's ok to ignore the terminating null char
4607 that is counted in the length of the constant. */
4608 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4609 TREE_STRING_LENGTH (inside_init)
4610 - ((TYPE_PRECISION (typ1)
4611 != TYPE_PRECISION (char_type_node))
4612 ? (TYPE_PRECISION (wchar_type_node)
4615 pedwarn_init ("initializer-string for array of chars is too long");
4619 else if (INTEGRAL_TYPE_P (typ1))
4621 error_init ("array of inappropriate type initialized "
4622 "from string constant");
4623 return error_mark_node;
4627 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4628 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4629 below and handle as a constructor. */
4630 if (code == VECTOR_TYPE
4631 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4632 && vector_types_convertible_p (TREE_TYPE (inside_init), type)
4633 && TREE_CONSTANT (inside_init))
4635 if (TREE_CODE (inside_init) == VECTOR_CST
4636 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4637 TYPE_MAIN_VARIANT (type)))
4640 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4642 unsigned HOST_WIDE_INT ix;
4644 bool constant_p = true;
4646 /* Iterate through elements and check if all constructor
4647 elements are *_CSTs. */
4648 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4649 if (!CONSTANT_CLASS_P (value))
4656 return build_vector_from_ctor (type,
4657 CONSTRUCTOR_ELTS (inside_init));
4661 /* Any type can be initialized
4662 from an expression of the same type, optionally with braces. */
4664 if (inside_init && TREE_TYPE (inside_init) != 0
4665 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4666 TYPE_MAIN_VARIANT (type))
4667 || (code == ARRAY_TYPE
4668 && comptypes (TREE_TYPE (inside_init), type))
4669 || (code == VECTOR_TYPE
4670 && comptypes (TREE_TYPE (inside_init), type))
4671 || (code == POINTER_TYPE
4672 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4673 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4674 TREE_TYPE (type)))))
4676 if (code == POINTER_TYPE)
4678 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4680 if (TREE_CODE (inside_init) == STRING_CST
4681 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4682 inside_init = array_to_pointer_conversion (inside_init);
4685 error_init ("invalid use of non-lvalue array");
4686 return error_mark_node;
4691 if (code == VECTOR_TYPE)
4692 /* Although the types are compatible, we may require a
4694 inside_init = convert (type, inside_init);
4696 if (require_constant && !flag_isoc99
4697 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4699 /* As an extension, allow initializing objects with static storage
4700 duration with compound literals (which are then treated just as
4701 the brace enclosed list they contain). */
4702 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4703 inside_init = DECL_INITIAL (decl);
4706 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4707 && TREE_CODE (inside_init) != CONSTRUCTOR)
4709 error_init ("array initialized from non-constant array expression");
4710 return error_mark_node;
4713 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4714 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4716 /* Compound expressions can only occur here if -pedantic or
4717 -pedantic-errors is specified. In the later case, we always want
4718 an error. In the former case, we simply want a warning. */
4719 if (require_constant && pedantic
4720 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4723 = valid_compound_expr_initializer (inside_init,
4724 TREE_TYPE (inside_init));
4725 if (inside_init == error_mark_node)
4726 error_init ("initializer element is not constant");
4728 pedwarn_init ("initializer element is not constant");
4729 if (flag_pedantic_errors)
4730 inside_init = error_mark_node;
4732 else if (require_constant
4733 && !initializer_constant_valid_p (inside_init,
4734 TREE_TYPE (inside_init)))
4736 error_init ("initializer element is not constant");
4737 inside_init = error_mark_node;
4740 /* Added to enable additional -Wmissing-format-attribute warnings. */
4741 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4742 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4747 /* Handle scalar types, including conversions. */
4749 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4750 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE
4751 || code == VECTOR_TYPE)
4753 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4754 && (TREE_CODE (init) == STRING_CST
4755 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4756 init = array_to_pointer_conversion (init);
4758 = convert_for_assignment (type, init, ic_init,
4759 NULL_TREE, NULL_TREE, 0);
4761 /* Check to see if we have already given an error message. */
4762 if (inside_init == error_mark_node)
4764 else if (require_constant && !TREE_CONSTANT (inside_init))
4766 error_init ("initializer element is not constant");
4767 inside_init = error_mark_node;
4769 else if (require_constant
4770 && !initializer_constant_valid_p (inside_init,
4771 TREE_TYPE (inside_init)))
4773 error_init ("initializer element is not computable at load time");
4774 inside_init = error_mark_node;
4780 /* Come here only for records and arrays. */
4782 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4784 error_init ("variable-sized object may not be initialized");
4785 return error_mark_node;
4788 error_init ("invalid initializer");
4789 return error_mark_node;
4792 /* Handle initializers that use braces. */
4794 /* Type of object we are accumulating a constructor for.
4795 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4796 static tree constructor_type;
4798 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4800 static tree constructor_fields;
4802 /* For an ARRAY_TYPE, this is the specified index
4803 at which to store the next element we get. */
4804 static tree constructor_index;
4806 /* For an ARRAY_TYPE, this is the maximum index. */
4807 static tree constructor_max_index;
4809 /* For a RECORD_TYPE, this is the first field not yet written out. */
4810 static tree constructor_unfilled_fields;
4812 /* For an ARRAY_TYPE, this is the index of the first element
4813 not yet written out. */
4814 static tree constructor_unfilled_index;
4816 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4817 This is so we can generate gaps between fields, when appropriate. */
4818 static tree constructor_bit_index;
4820 /* If we are saving up the elements rather than allocating them,
4821 this is the list of elements so far (in reverse order,
4822 most recent first). */
4823 static VEC(constructor_elt,gc) *constructor_elements;
4825 /* 1 if constructor should be incrementally stored into a constructor chain,
4826 0 if all the elements should be kept in AVL tree. */
4827 static int constructor_incremental;
4829 /* 1 if so far this constructor's elements are all compile-time constants. */
4830 static int constructor_constant;
4832 /* 1 if so far this constructor's elements are all valid address constants. */
4833 static int constructor_simple;
4835 /* 1 if this constructor is erroneous so far. */
4836 static int constructor_erroneous;
4838 /* Structure for managing pending initializer elements, organized as an
4843 struct init_node *left, *right;
4844 struct init_node *parent;
4850 /* Tree of pending elements at this constructor level.
4851 These are elements encountered out of order
4852 which belong at places we haven't reached yet in actually
4854 Will never hold tree nodes across GC runs. */
4855 static struct init_node *constructor_pending_elts;
4857 /* The SPELLING_DEPTH of this constructor. */
4858 static int constructor_depth;
4860 /* DECL node for which an initializer is being read.
4861 0 means we are reading a constructor expression
4862 such as (struct foo) {...}. */
4863 static tree constructor_decl;
4865 /* Nonzero if this is an initializer for a top-level decl. */
4866 static int constructor_top_level;
4868 /* Nonzero if there were any member designators in this initializer. */
4869 static int constructor_designated;
4871 /* Nesting depth of designator list. */
4872 static int designator_depth;
4874 /* Nonzero if there were diagnosed errors in this designator list. */
4875 static int designator_erroneous;
4878 /* This stack has a level for each implicit or explicit level of
4879 structuring in the initializer, including the outermost one. It
4880 saves the values of most of the variables above. */
4882 struct constructor_range_stack;
4884 struct constructor_stack
4886 struct constructor_stack *next;
4891 tree unfilled_index;
4892 tree unfilled_fields;
4894 VEC(constructor_elt,gc) *elements;
4895 struct init_node *pending_elts;
4898 /* If value nonzero, this value should replace the entire
4899 constructor at this level. */
4900 struct c_expr replacement_value;
4901 struct constructor_range_stack *range_stack;
4911 static struct constructor_stack *constructor_stack;
4913 /* This stack represents designators from some range designator up to
4914 the last designator in the list. */
4916 struct constructor_range_stack
4918 struct constructor_range_stack *next, *prev;
4919 struct constructor_stack *stack;
4926 static struct constructor_range_stack *constructor_range_stack;
4928 /* This stack records separate initializers that are nested.
4929 Nested initializers can't happen in ANSI C, but GNU C allows them
4930 in cases like { ... (struct foo) { ... } ... }. */
4932 struct initializer_stack
4934 struct initializer_stack *next;
4936 struct constructor_stack *constructor_stack;
4937 struct constructor_range_stack *constructor_range_stack;
4938 VEC(constructor_elt,gc) *elements;
4939 struct spelling *spelling;
4940 struct spelling *spelling_base;
4943 char require_constant_value;
4944 char require_constant_elements;
4947 static struct initializer_stack *initializer_stack;
4949 /* Prepare to parse and output the initializer for variable DECL. */
4952 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
4955 struct initializer_stack *p = XNEW (struct initializer_stack);
4957 p->decl = constructor_decl;
4958 p->require_constant_value = require_constant_value;
4959 p->require_constant_elements = require_constant_elements;
4960 p->constructor_stack = constructor_stack;
4961 p->constructor_range_stack = constructor_range_stack;
4962 p->elements = constructor_elements;
4963 p->spelling = spelling;
4964 p->spelling_base = spelling_base;
4965 p->spelling_size = spelling_size;
4966 p->top_level = constructor_top_level;
4967 p->next = initializer_stack;
4968 initializer_stack = p;
4970 constructor_decl = decl;
4971 constructor_designated = 0;
4972 constructor_top_level = top_level;
4974 if (decl != 0 && decl != error_mark_node)
4976 require_constant_value = TREE_STATIC (decl);
4977 require_constant_elements
4978 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
4979 /* For a scalar, you can always use any value to initialize,
4980 even within braces. */
4981 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
4982 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
4983 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
4984 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
4985 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
4989 require_constant_value = 0;
4990 require_constant_elements = 0;
4991 locus = "(anonymous)";
4994 constructor_stack = 0;
4995 constructor_range_stack = 0;
4997 missing_braces_mentioned = 0;
5001 RESTORE_SPELLING_DEPTH (0);
5004 push_string (locus);
5010 struct initializer_stack *p = initializer_stack;
5012 /* Free the whole constructor stack of this initializer. */
5013 while (constructor_stack)
5015 struct constructor_stack *q = constructor_stack;
5016 constructor_stack = q->next;
5020 gcc_assert (!constructor_range_stack);
5022 /* Pop back to the data of the outer initializer (if any). */
5023 free (spelling_base);
5025 constructor_decl = p->decl;
5026 require_constant_value = p->require_constant_value;
5027 require_constant_elements = p->require_constant_elements;
5028 constructor_stack = p->constructor_stack;
5029 constructor_range_stack = p->constructor_range_stack;
5030 constructor_elements = p->elements;
5031 spelling = p->spelling;
5032 spelling_base = p->spelling_base;
5033 spelling_size = p->spelling_size;
5034 constructor_top_level = p->top_level;
5035 initializer_stack = p->next;
5039 /* Call here when we see the initializer is surrounded by braces.
5040 This is instead of a call to push_init_level;
5041 it is matched by a call to pop_init_level.
5043 TYPE is the type to initialize, for a constructor expression.
5044 For an initializer for a decl, TYPE is zero. */
5047 really_start_incremental_init (tree type)
5049 struct constructor_stack *p = XNEW (struct constructor_stack);
5052 type = TREE_TYPE (constructor_decl);
5054 if (targetm.vector_opaque_p (type))
5055 error ("opaque vector types cannot be initialized");
5057 p->type = constructor_type;
5058 p->fields = constructor_fields;
5059 p->index = constructor_index;
5060 p->max_index = constructor_max_index;
5061 p->unfilled_index = constructor_unfilled_index;
5062 p->unfilled_fields = constructor_unfilled_fields;
5063 p->bit_index = constructor_bit_index;
5064 p->elements = constructor_elements;
5065 p->constant = constructor_constant;
5066 p->simple = constructor_simple;
5067 p->erroneous = constructor_erroneous;
5068 p->pending_elts = constructor_pending_elts;
5069 p->depth = constructor_depth;
5070 p->replacement_value.value = 0;
5071 p->replacement_value.original_code = ERROR_MARK;
5075 p->incremental = constructor_incremental;
5076 p->designated = constructor_designated;
5078 constructor_stack = p;
5080 constructor_constant = 1;
5081 constructor_simple = 1;
5082 constructor_depth = SPELLING_DEPTH ();
5083 constructor_elements = 0;
5084 constructor_pending_elts = 0;
5085 constructor_type = type;
5086 constructor_incremental = 1;
5087 constructor_designated = 0;
5088 designator_depth = 0;
5089 designator_erroneous = 0;
5091 if (TREE_CODE (constructor_type) == RECORD_TYPE
5092 || TREE_CODE (constructor_type) == UNION_TYPE)
5094 constructor_fields = TYPE_FIELDS (constructor_type);
5095 /* Skip any nameless bit fields at the beginning. */
5096 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5097 && DECL_NAME (constructor_fields) == 0)
5098 constructor_fields = TREE_CHAIN (constructor_fields);
5100 constructor_unfilled_fields = constructor_fields;
5101 constructor_bit_index = bitsize_zero_node;
5103 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5105 if (TYPE_DOMAIN (constructor_type))
5107 constructor_max_index
5108 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5110 /* Detect non-empty initializations of zero-length arrays. */
5111 if (constructor_max_index == NULL_TREE
5112 && TYPE_SIZE (constructor_type))
5113 constructor_max_index = build_int_cst (NULL_TREE, -1);
5115 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5116 to initialize VLAs will cause a proper error; avoid tree
5117 checking errors as well by setting a safe value. */
5118 if (constructor_max_index
5119 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5120 constructor_max_index = build_int_cst (NULL_TREE, -1);
5123 = convert (bitsizetype,
5124 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5128 constructor_index = bitsize_zero_node;
5129 constructor_max_index = NULL_TREE;
5132 constructor_unfilled_index = constructor_index;
5134 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5136 /* Vectors are like simple fixed-size arrays. */
5137 constructor_max_index =
5138 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5139 constructor_index = bitsize_zero_node;
5140 constructor_unfilled_index = constructor_index;
5144 /* Handle the case of int x = {5}; */
5145 constructor_fields = constructor_type;
5146 constructor_unfilled_fields = constructor_type;
5150 /* Push down into a subobject, for initialization.
5151 If this is for an explicit set of braces, IMPLICIT is 0.
5152 If it is because the next element belongs at a lower level,
5153 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5156 push_init_level (int implicit)
5158 struct constructor_stack *p;
5159 tree value = NULL_TREE;
5161 /* If we've exhausted any levels that didn't have braces,
5162 pop them now. If implicit == 1, this will have been done in
5163 process_init_element; do not repeat it here because in the case
5164 of excess initializers for an empty aggregate this leads to an
5165 infinite cycle of popping a level and immediately recreating
5169 while (constructor_stack->implicit)
5171 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5172 || TREE_CODE (constructor_type) == UNION_TYPE)
5173 && constructor_fields == 0)
5174 process_init_element (pop_init_level (1));
5175 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5176 && constructor_max_index
5177 && tree_int_cst_lt (constructor_max_index,
5179 process_init_element (pop_init_level (1));
5185 /* Unless this is an explicit brace, we need to preserve previous
5189 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5190 || TREE_CODE (constructor_type) == UNION_TYPE)
5191 && constructor_fields)
5192 value = find_init_member (constructor_fields);
5193 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5194 value = find_init_member (constructor_index);
5197 p = XNEW (struct constructor_stack);
5198 p->type = constructor_type;
5199 p->fields = constructor_fields;
5200 p->index = constructor_index;
5201 p->max_index = constructor_max_index;
5202 p->unfilled_index = constructor_unfilled_index;
5203 p->unfilled_fields = constructor_unfilled_fields;
5204 p->bit_index = constructor_bit_index;
5205 p->elements = constructor_elements;
5206 p->constant = constructor_constant;
5207 p->simple = constructor_simple;
5208 p->erroneous = constructor_erroneous;
5209 p->pending_elts = constructor_pending_elts;
5210 p->depth = constructor_depth;
5211 p->replacement_value.value = 0;
5212 p->replacement_value.original_code = ERROR_MARK;
5213 p->implicit = implicit;
5215 p->incremental = constructor_incremental;
5216 p->designated = constructor_designated;
5217 p->next = constructor_stack;
5219 constructor_stack = p;
5221 constructor_constant = 1;
5222 constructor_simple = 1;
5223 constructor_depth = SPELLING_DEPTH ();
5224 constructor_elements = 0;
5225 constructor_incremental = 1;
5226 constructor_designated = 0;
5227 constructor_pending_elts = 0;
5230 p->range_stack = constructor_range_stack;
5231 constructor_range_stack = 0;
5232 designator_depth = 0;
5233 designator_erroneous = 0;
5236 /* Don't die if an entire brace-pair level is superfluous
5237 in the containing level. */
5238 if (constructor_type == 0)
5240 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5241 || TREE_CODE (constructor_type) == UNION_TYPE)
5243 /* Don't die if there are extra init elts at the end. */
5244 if (constructor_fields == 0)
5245 constructor_type = 0;
5248 constructor_type = TREE_TYPE (constructor_fields);
5249 push_member_name (constructor_fields);
5250 constructor_depth++;
5253 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5255 constructor_type = TREE_TYPE (constructor_type);
5256 push_array_bounds (tree_low_cst (constructor_index, 1));
5257 constructor_depth++;
5260 if (constructor_type == 0)
5262 error_init ("extra brace group at end of initializer");
5263 constructor_fields = 0;
5264 constructor_unfilled_fields = 0;
5268 if (value && TREE_CODE (value) == CONSTRUCTOR)
5270 constructor_constant = TREE_CONSTANT (value);
5271 constructor_simple = TREE_STATIC (value);
5272 constructor_elements = CONSTRUCTOR_ELTS (value);
5273 if (!VEC_empty (constructor_elt, constructor_elements)
5274 && (TREE_CODE (constructor_type) == RECORD_TYPE
5275 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5276 set_nonincremental_init ();
5279 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5281 missing_braces_mentioned = 1;
5282 warning_init ("missing braces around initializer");
5285 if (TREE_CODE (constructor_type) == RECORD_TYPE
5286 || TREE_CODE (constructor_type) == UNION_TYPE)
5288 constructor_fields = TYPE_FIELDS (constructor_type);
5289 /* Skip any nameless bit fields at the beginning. */
5290 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5291 && DECL_NAME (constructor_fields) == 0)
5292 constructor_fields = TREE_CHAIN (constructor_fields);
5294 constructor_unfilled_fields = constructor_fields;
5295 constructor_bit_index = bitsize_zero_node;
5297 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5299 /* Vectors are like simple fixed-size arrays. */
5300 constructor_max_index =
5301 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5302 constructor_index = convert (bitsizetype, integer_zero_node);
5303 constructor_unfilled_index = constructor_index;
5305 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5307 if (TYPE_DOMAIN (constructor_type))
5309 constructor_max_index
5310 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5312 /* Detect non-empty initializations of zero-length arrays. */
5313 if (constructor_max_index == NULL_TREE
5314 && TYPE_SIZE (constructor_type))
5315 constructor_max_index = build_int_cst (NULL_TREE, -1);
5317 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5318 to initialize VLAs will cause a proper error; avoid tree
5319 checking errors as well by setting a safe value. */
5320 if (constructor_max_index
5321 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5322 constructor_max_index = build_int_cst (NULL_TREE, -1);
5325 = convert (bitsizetype,
5326 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5329 constructor_index = bitsize_zero_node;
5331 constructor_unfilled_index = constructor_index;
5332 if (value && TREE_CODE (value) == STRING_CST)
5334 /* We need to split the char/wchar array into individual
5335 characters, so that we don't have to special case it
5337 set_nonincremental_init_from_string (value);
5342 if (constructor_type != error_mark_node)
5343 warning_init ("braces around scalar initializer");
5344 constructor_fields = constructor_type;
5345 constructor_unfilled_fields = constructor_type;
5349 /* At the end of an implicit or explicit brace level,
5350 finish up that level of constructor. If a single expression
5351 with redundant braces initialized that level, return the
5352 c_expr structure for that expression. Otherwise, the original_code
5353 element is set to ERROR_MARK.
5354 If we were outputting the elements as they are read, return 0 as the value
5355 from inner levels (process_init_element ignores that),
5356 but return error_mark_node as the value from the outermost level
5357 (that's what we want to put in DECL_INITIAL).
5358 Otherwise, return a CONSTRUCTOR expression as the value. */
5361 pop_init_level (int implicit)
5363 struct constructor_stack *p;
5366 ret.original_code = ERROR_MARK;
5370 /* When we come to an explicit close brace,
5371 pop any inner levels that didn't have explicit braces. */
5372 while (constructor_stack->implicit)
5373 process_init_element (pop_init_level (1));
5375 gcc_assert (!constructor_range_stack);
5378 /* Now output all pending elements. */
5379 constructor_incremental = 1;
5380 output_pending_init_elements (1);
5382 p = constructor_stack;
5384 /* Error for initializing a flexible array member, or a zero-length
5385 array member in an inappropriate context. */
5386 if (constructor_type && constructor_fields
5387 && TREE_CODE (constructor_type) == ARRAY_TYPE
5388 && TYPE_DOMAIN (constructor_type)
5389 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5391 /* Silently discard empty initializations. The parser will
5392 already have pedwarned for empty brackets. */
5393 if (integer_zerop (constructor_unfilled_index))
5394 constructor_type = NULL_TREE;
5397 gcc_assert (!TYPE_SIZE (constructor_type));
5399 if (constructor_depth > 2)
5400 error_init ("initialization of flexible array member in a nested context");
5402 pedwarn_init ("initialization of a flexible array member");
5404 /* We have already issued an error message for the existence
5405 of a flexible array member not at the end of the structure.
5406 Discard the initializer so that we do not die later. */
5407 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5408 constructor_type = NULL_TREE;
5412 /* Warn when some struct elements are implicitly initialized to zero. */
5413 if (warn_missing_field_initializers
5415 && TREE_CODE (constructor_type) == RECORD_TYPE
5416 && constructor_unfilled_fields)
5418 /* Do not warn for flexible array members or zero-length arrays. */
5419 while (constructor_unfilled_fields
5420 && (!DECL_SIZE (constructor_unfilled_fields)
5421 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5422 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5424 /* Do not warn if this level of the initializer uses member
5425 designators; it is likely to be deliberate. */
5426 if (constructor_unfilled_fields && !constructor_designated)
5428 push_member_name (constructor_unfilled_fields);
5429 warning_init ("missing initializer");
5430 RESTORE_SPELLING_DEPTH (constructor_depth);
5434 /* Pad out the end of the structure. */
5435 if (p->replacement_value.value)
5436 /* If this closes a superfluous brace pair,
5437 just pass out the element between them. */
5438 ret = p->replacement_value;
5439 else if (constructor_type == 0)
5441 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5442 && TREE_CODE (constructor_type) != UNION_TYPE
5443 && TREE_CODE (constructor_type) != ARRAY_TYPE
5444 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5446 /* A nonincremental scalar initializer--just return
5447 the element, after verifying there is just one. */
5448 if (VEC_empty (constructor_elt,constructor_elements))
5450 if (!constructor_erroneous)
5451 error_init ("empty scalar initializer");
5452 ret.value = error_mark_node;
5454 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5456 error_init ("extra elements in scalar initializer");
5457 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5460 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5464 if (constructor_erroneous)
5465 ret.value = error_mark_node;
5468 ret.value = build_constructor (constructor_type,
5469 constructor_elements);
5470 if (constructor_constant)
5471 TREE_CONSTANT (ret.value) = TREE_INVARIANT (ret.value) = 1;
5472 if (constructor_constant && constructor_simple)
5473 TREE_STATIC (ret.value) = 1;
5477 constructor_type = p->type;
5478 constructor_fields = p->fields;
5479 constructor_index = p->index;
5480 constructor_max_index = p->max_index;
5481 constructor_unfilled_index = p->unfilled_index;
5482 constructor_unfilled_fields = p->unfilled_fields;
5483 constructor_bit_index = p->bit_index;
5484 constructor_elements = p->elements;
5485 constructor_constant = p->constant;
5486 constructor_simple = p->simple;
5487 constructor_erroneous = p->erroneous;
5488 constructor_incremental = p->incremental;
5489 constructor_designated = p->designated;
5490 constructor_pending_elts = p->pending_elts;
5491 constructor_depth = p->depth;
5493 constructor_range_stack = p->range_stack;
5494 RESTORE_SPELLING_DEPTH (constructor_depth);
5496 constructor_stack = p->next;
5499 if (ret.value == 0 && constructor_stack == 0)
5500 ret.value = error_mark_node;
5504 /* Common handling for both array range and field name designators.
5505 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5508 set_designator (int array)
5511 enum tree_code subcode;
5513 /* Don't die if an entire brace-pair level is superfluous
5514 in the containing level. */
5515 if (constructor_type == 0)
5518 /* If there were errors in this designator list already, bail out
5520 if (designator_erroneous)
5523 if (!designator_depth)
5525 gcc_assert (!constructor_range_stack);
5527 /* Designator list starts at the level of closest explicit
5529 while (constructor_stack->implicit)
5530 process_init_element (pop_init_level (1));
5531 constructor_designated = 1;
5535 switch (TREE_CODE (constructor_type))
5539 subtype = TREE_TYPE (constructor_fields);
5540 if (subtype != error_mark_node)
5541 subtype = TYPE_MAIN_VARIANT (subtype);
5544 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5550 subcode = TREE_CODE (subtype);
5551 if (array && subcode != ARRAY_TYPE)
5553 error_init ("array index in non-array initializer");
5556 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5558 error_init ("field name not in record or union initializer");
5562 constructor_designated = 1;
5563 push_init_level (2);
5567 /* If there are range designators in designator list, push a new designator
5568 to constructor_range_stack. RANGE_END is end of such stack range or
5569 NULL_TREE if there is no range designator at this level. */
5572 push_range_stack (tree range_end)
5574 struct constructor_range_stack *p;
5576 p = GGC_NEW (struct constructor_range_stack);
5577 p->prev = constructor_range_stack;
5579 p->fields = constructor_fields;
5580 p->range_start = constructor_index;
5581 p->index = constructor_index;
5582 p->stack = constructor_stack;
5583 p->range_end = range_end;
5584 if (constructor_range_stack)
5585 constructor_range_stack->next = p;
5586 constructor_range_stack = p;
5589 /* Within an array initializer, specify the next index to be initialized.
5590 FIRST is that index. If LAST is nonzero, then initialize a range
5591 of indices, running from FIRST through LAST. */
5594 set_init_index (tree first, tree last)
5596 if (set_designator (1))
5599 designator_erroneous = 1;
5601 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5602 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5604 error_init ("array index in initializer not of integer type");
5608 if (TREE_CODE (first) != INTEGER_CST)
5609 error_init ("nonconstant array index in initializer");
5610 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5611 error_init ("nonconstant array index in initializer");
5612 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5613 error_init ("array index in non-array initializer");
5614 else if (tree_int_cst_sgn (first) == -1)
5615 error_init ("array index in initializer exceeds array bounds");
5616 else if (constructor_max_index
5617 && tree_int_cst_lt (constructor_max_index, first))
5618 error_init ("array index in initializer exceeds array bounds");
5621 constructor_index = convert (bitsizetype, first);
5625 if (tree_int_cst_equal (first, last))
5627 else if (tree_int_cst_lt (last, first))
5629 error_init ("empty index range in initializer");
5634 last = convert (bitsizetype, last);
5635 if (constructor_max_index != 0
5636 && tree_int_cst_lt (constructor_max_index, last))
5638 error_init ("array index range in initializer exceeds array bounds");
5645 designator_erroneous = 0;
5646 if (constructor_range_stack || last)
5647 push_range_stack (last);
5651 /* Within a struct initializer, specify the next field to be initialized. */
5654 set_init_label (tree fieldname)
5658 if (set_designator (0))
5661 designator_erroneous = 1;
5663 if (TREE_CODE (constructor_type) != RECORD_TYPE
5664 && TREE_CODE (constructor_type) != UNION_TYPE)
5666 error_init ("field name not in record or union initializer");
5670 for (tail = TYPE_FIELDS (constructor_type); tail;
5671 tail = TREE_CHAIN (tail))
5673 if (DECL_NAME (tail) == fieldname)
5678 error ("unknown field %qE specified in initializer", fieldname);
5681 constructor_fields = tail;
5683 designator_erroneous = 0;
5684 if (constructor_range_stack)
5685 push_range_stack (NULL_TREE);
5689 /* Add a new initializer to the tree of pending initializers. PURPOSE
5690 identifies the initializer, either array index or field in a structure.
5691 VALUE is the value of that index or field. */
5694 add_pending_init (tree purpose, tree value)
5696 struct init_node *p, **q, *r;
5698 q = &constructor_pending_elts;
5701 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5706 if (tree_int_cst_lt (purpose, p->purpose))
5708 else if (tree_int_cst_lt (p->purpose, purpose))
5712 if (TREE_SIDE_EFFECTS (p->value))
5713 warning_init ("initialized field with side-effects overwritten");
5723 bitpos = bit_position (purpose);
5727 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5729 else if (p->purpose != purpose)
5733 if (TREE_SIDE_EFFECTS (p->value))
5734 warning_init ("initialized field with side-effects overwritten");
5741 r = GGC_NEW (struct init_node);
5742 r->purpose = purpose;
5753 struct init_node *s;
5757 if (p->balance == 0)
5759 else if (p->balance < 0)
5766 p->left->parent = p;
5783 constructor_pending_elts = r;
5788 struct init_node *t = r->right;
5792 r->right->parent = r;
5797 p->left->parent = p;
5800 p->balance = t->balance < 0;
5801 r->balance = -(t->balance > 0);
5816 constructor_pending_elts = t;
5822 /* p->balance == +1; growth of left side balances the node. */
5827 else /* r == p->right */
5829 if (p->balance == 0)
5830 /* Growth propagation from right side. */
5832 else if (p->balance > 0)
5839 p->right->parent = p;
5856 constructor_pending_elts = r;
5858 else /* r->balance == -1 */
5861 struct init_node *t = r->left;
5865 r->left->parent = r;
5870 p->right->parent = p;
5873 r->balance = (t->balance < 0);
5874 p->balance = -(t->balance > 0);
5889 constructor_pending_elts = t;
5895 /* p->balance == -1; growth of right side balances the node. */
5906 /* Build AVL tree from a sorted chain. */
5909 set_nonincremental_init (void)
5911 unsigned HOST_WIDE_INT ix;
5914 if (TREE_CODE (constructor_type) != RECORD_TYPE
5915 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5918 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
5919 add_pending_init (index, value);
5920 constructor_elements = 0;
5921 if (TREE_CODE (constructor_type) == RECORD_TYPE)
5923 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
5924 /* Skip any nameless bit fields at the beginning. */
5925 while (constructor_unfilled_fields != 0
5926 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5927 && DECL_NAME (constructor_unfilled_fields) == 0)
5928 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5931 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5933 if (TYPE_DOMAIN (constructor_type))
5934 constructor_unfilled_index
5935 = convert (bitsizetype,
5936 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5938 constructor_unfilled_index = bitsize_zero_node;
5940 constructor_incremental = 0;
5943 /* Build AVL tree from a string constant. */
5946 set_nonincremental_init_from_string (tree str)
5948 tree value, purpose, type;
5949 HOST_WIDE_INT val[2];
5950 const char *p, *end;
5951 int byte, wchar_bytes, charwidth, bitpos;
5953 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
5955 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5956 == TYPE_PRECISION (char_type_node))
5960 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5961 == TYPE_PRECISION (wchar_type_node));
5962 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
5964 charwidth = TYPE_PRECISION (char_type_node);
5965 type = TREE_TYPE (constructor_type);
5966 p = TREE_STRING_POINTER (str);
5967 end = p + TREE_STRING_LENGTH (str);
5969 for (purpose = bitsize_zero_node;
5970 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
5971 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
5973 if (wchar_bytes == 1)
5975 val[1] = (unsigned char) *p++;
5982 for (byte = 0; byte < wchar_bytes; byte++)
5984 if (BYTES_BIG_ENDIAN)
5985 bitpos = (wchar_bytes - byte - 1) * charwidth;
5987 bitpos = byte * charwidth;
5988 val[bitpos < HOST_BITS_PER_WIDE_INT]
5989 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
5990 << (bitpos % HOST_BITS_PER_WIDE_INT);
5994 if (!TYPE_UNSIGNED (type))
5996 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
5997 if (bitpos < HOST_BITS_PER_WIDE_INT)
5999 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6001 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6005 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6010 else if (val[0] & (((HOST_WIDE_INT) 1)
6011 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6012 val[0] |= ((HOST_WIDE_INT) -1)
6013 << (bitpos - HOST_BITS_PER_WIDE_INT);
6016 value = build_int_cst_wide (type, val[1], val[0]);
6017 add_pending_init (purpose, value);
6020 constructor_incremental = 0;
6023 /* Return value of FIELD in pending initializer or zero if the field was
6024 not initialized yet. */
6027 find_init_member (tree field)
6029 struct init_node *p;
6031 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6033 if (constructor_incremental
6034 && tree_int_cst_lt (field, constructor_unfilled_index))
6035 set_nonincremental_init ();
6037 p = constructor_pending_elts;
6040 if (tree_int_cst_lt (field, p->purpose))
6042 else if (tree_int_cst_lt (p->purpose, field))
6048 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6050 tree bitpos = bit_position (field);
6052 if (constructor_incremental
6053 && (!constructor_unfilled_fields
6054 || tree_int_cst_lt (bitpos,
6055 bit_position (constructor_unfilled_fields))))
6056 set_nonincremental_init ();
6058 p = constructor_pending_elts;
6061 if (field == p->purpose)
6063 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6069 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6071 if (!VEC_empty (constructor_elt, constructor_elements)
6072 && (VEC_last (constructor_elt, constructor_elements)->index
6074 return VEC_last (constructor_elt, constructor_elements)->value;
6079 /* "Output" the next constructor element.
6080 At top level, really output it to assembler code now.
6081 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6082 TYPE is the data type that the containing data type wants here.
6083 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6084 If VALUE is a string constant, STRICT_STRING is true if it is
6085 unparenthesized or we should not warn here for it being parenthesized.
6086 For other types of VALUE, STRICT_STRING is not used.
6088 PENDING if non-nil means output pending elements that belong
6089 right after this element. (PENDING is normally 1;
6090 it is 0 while outputting pending elements, to avoid recursion.) */
6093 output_init_element (tree value, bool strict_string, tree type, tree field,
6096 constructor_elt *celt;
6098 if (type == error_mark_node || value == error_mark_node)
6100 constructor_erroneous = 1;
6103 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6104 && (TREE_CODE (value) == STRING_CST
6105 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6106 && !(TREE_CODE (value) == STRING_CST
6107 && TREE_CODE (type) == ARRAY_TYPE
6108 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6109 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6110 TYPE_MAIN_VARIANT (type)))
6111 value = array_to_pointer_conversion (value);
6113 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6114 && require_constant_value && !flag_isoc99 && pending)
6116 /* As an extension, allow initializing objects with static storage
6117 duration with compound literals (which are then treated just as
6118 the brace enclosed list they contain). */
6119 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6120 value = DECL_INITIAL (decl);
6123 if (value == error_mark_node)
6124 constructor_erroneous = 1;
6125 else if (!TREE_CONSTANT (value))
6126 constructor_constant = 0;
6127 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6128 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6129 || TREE_CODE (constructor_type) == UNION_TYPE)
6130 && DECL_C_BIT_FIELD (field)
6131 && TREE_CODE (value) != INTEGER_CST))
6132 constructor_simple = 0;
6134 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6136 if (require_constant_value)
6138 error_init ("initializer element is not constant");
6139 value = error_mark_node;
6141 else if (require_constant_elements)
6142 pedwarn ("initializer element is not computable at load time");
6145 /* If this field is empty (and not at the end of structure),
6146 don't do anything other than checking the initializer. */
6148 && (TREE_TYPE (field) == error_mark_node
6149 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6150 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6151 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6152 || TREE_CHAIN (field)))))
6155 value = digest_init (type, value, strict_string, require_constant_value);
6156 if (value == error_mark_node)
6158 constructor_erroneous = 1;
6162 /* If this element doesn't come next in sequence,
6163 put it on constructor_pending_elts. */
6164 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6165 && (!constructor_incremental
6166 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6168 if (constructor_incremental
6169 && tree_int_cst_lt (field, constructor_unfilled_index))
6170 set_nonincremental_init ();
6172 add_pending_init (field, value);
6175 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6176 && (!constructor_incremental
6177 || field != constructor_unfilled_fields))
6179 /* We do this for records but not for unions. In a union,
6180 no matter which field is specified, it can be initialized
6181 right away since it starts at the beginning of the union. */
6182 if (constructor_incremental)
6184 if (!constructor_unfilled_fields)
6185 set_nonincremental_init ();
6188 tree bitpos, unfillpos;
6190 bitpos = bit_position (field);
6191 unfillpos = bit_position (constructor_unfilled_fields);
6193 if (tree_int_cst_lt (bitpos, unfillpos))
6194 set_nonincremental_init ();
6198 add_pending_init (field, value);
6201 else if (TREE_CODE (constructor_type) == UNION_TYPE
6202 && !VEC_empty (constructor_elt, constructor_elements))
6204 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6205 constructor_elements)->value))
6206 warning_init ("initialized field with side-effects overwritten");
6208 /* We can have just one union field set. */
6209 constructor_elements = 0;
6212 /* Otherwise, output this element either to
6213 constructor_elements or to the assembler file. */
6215 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6216 celt->index = field;
6217 celt->value = value;
6219 /* Advance the variable that indicates sequential elements output. */
6220 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6221 constructor_unfilled_index
6222 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6224 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6226 constructor_unfilled_fields
6227 = TREE_CHAIN (constructor_unfilled_fields);
6229 /* Skip any nameless bit fields. */
6230 while (constructor_unfilled_fields != 0
6231 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6232 && DECL_NAME (constructor_unfilled_fields) == 0)
6233 constructor_unfilled_fields =
6234 TREE_CHAIN (constructor_unfilled_fields);
6236 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6237 constructor_unfilled_fields = 0;
6239 /* Now output any pending elements which have become next. */
6241 output_pending_init_elements (0);
6244 /* Output any pending elements which have become next.
6245 As we output elements, constructor_unfilled_{fields,index}
6246 advances, which may cause other elements to become next;
6247 if so, they too are output.
6249 If ALL is 0, we return when there are
6250 no more pending elements to output now.
6252 If ALL is 1, we output space as necessary so that
6253 we can output all the pending elements. */
6256 output_pending_init_elements (int all)
6258 struct init_node *elt = constructor_pending_elts;
6263 /* Look through the whole pending tree.
6264 If we find an element that should be output now,
6265 output it. Otherwise, set NEXT to the element
6266 that comes first among those still pending. */
6271 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6273 if (tree_int_cst_equal (elt->purpose,
6274 constructor_unfilled_index))
6275 output_init_element (elt->value, true,
6276 TREE_TYPE (constructor_type),
6277 constructor_unfilled_index, 0);
6278 else if (tree_int_cst_lt (constructor_unfilled_index,
6281 /* Advance to the next smaller node. */
6286 /* We have reached the smallest node bigger than the
6287 current unfilled index. Fill the space first. */
6288 next = elt->purpose;
6294 /* Advance to the next bigger node. */
6299 /* We have reached the biggest node in a subtree. Find
6300 the parent of it, which is the next bigger node. */
6301 while (elt->parent && elt->parent->right == elt)
6304 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6307 next = elt->purpose;
6313 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6314 || TREE_CODE (constructor_type) == UNION_TYPE)
6316 tree ctor_unfilled_bitpos, elt_bitpos;
6318 /* If the current record is complete we are done. */
6319 if (constructor_unfilled_fields == 0)
6322 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6323 elt_bitpos = bit_position (elt->purpose);
6324 /* We can't compare fields here because there might be empty
6325 fields in between. */
6326 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6328 constructor_unfilled_fields = elt->purpose;
6329 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6332 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6334 /* Advance to the next smaller node. */
6339 /* We have reached the smallest node bigger than the
6340 current unfilled field. Fill the space first. */
6341 next = elt->purpose;
6347 /* Advance to the next bigger node. */
6352 /* We have reached the biggest node in a subtree. Find
6353 the parent of it, which is the next bigger node. */
6354 while (elt->parent && elt->parent->right == elt)
6358 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6359 bit_position (elt->purpose))))
6361 next = elt->purpose;
6369 /* Ordinarily return, but not if we want to output all
6370 and there are elements left. */
6371 if (!(all && next != 0))
6374 /* If it's not incremental, just skip over the gap, so that after
6375 jumping to retry we will output the next successive element. */
6376 if (TREE_CODE (constructor_type) == RECORD_TYPE
6377 || TREE_CODE (constructor_type) == UNION_TYPE)
6378 constructor_unfilled_fields = next;
6379 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6380 constructor_unfilled_index = next;
6382 /* ELT now points to the node in the pending tree with the next
6383 initializer to output. */
6387 /* Add one non-braced element to the current constructor level.
6388 This adjusts the current position within the constructor's type.
6389 This may also start or terminate implicit levels
6390 to handle a partly-braced initializer.
6392 Once this has found the correct level for the new element,
6393 it calls output_init_element. */
6396 process_init_element (struct c_expr value)
6398 tree orig_value = value.value;
6399 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6400 bool strict_string = value.original_code == STRING_CST;
6402 designator_depth = 0;
6403 designator_erroneous = 0;
6405 /* Handle superfluous braces around string cst as in
6406 char x[] = {"foo"}; */
6409 && TREE_CODE (constructor_type) == ARRAY_TYPE
6410 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6411 && integer_zerop (constructor_unfilled_index))
6413 if (constructor_stack->replacement_value.value)
6414 error_init ("excess elements in char array initializer");
6415 constructor_stack->replacement_value = value;
6419 if (constructor_stack->replacement_value.value != 0)
6421 error_init ("excess elements in struct initializer");
6425 /* Ignore elements of a brace group if it is entirely superfluous
6426 and has already been diagnosed. */
6427 if (constructor_type == 0)
6430 /* If we've exhausted any levels that didn't have braces,
6432 while (constructor_stack->implicit)
6434 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6435 || TREE_CODE (constructor_type) == UNION_TYPE)
6436 && constructor_fields == 0)
6437 process_init_element (pop_init_level (1));
6438 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6439 && (constructor_max_index == 0
6440 || tree_int_cst_lt (constructor_max_index,
6441 constructor_index)))
6442 process_init_element (pop_init_level (1));
6447 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6448 if (constructor_range_stack)
6450 /* If value is a compound literal and we'll be just using its
6451 content, don't put it into a SAVE_EXPR. */
6452 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6453 || !require_constant_value
6455 value.value = save_expr (value.value);
6460 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6463 enum tree_code fieldcode;
6465 if (constructor_fields == 0)
6467 pedwarn_init ("excess elements in struct initializer");
6471 fieldtype = TREE_TYPE (constructor_fields);
6472 if (fieldtype != error_mark_node)
6473 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6474 fieldcode = TREE_CODE (fieldtype);
6476 /* Error for non-static initialization of a flexible array member. */
6477 if (fieldcode == ARRAY_TYPE
6478 && !require_constant_value
6479 && TYPE_SIZE (fieldtype) == NULL_TREE
6480 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6482 error_init ("non-static initialization of a flexible array member");
6486 /* Accept a string constant to initialize a subarray. */
6487 if (value.value != 0
6488 && fieldcode == ARRAY_TYPE
6489 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6491 value.value = orig_value;
6492 /* Otherwise, if we have come to a subaggregate,
6493 and we don't have an element of its type, push into it. */
6494 else if (value.value != 0
6495 && value.value != error_mark_node
6496 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6497 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6498 || fieldcode == UNION_TYPE))
6500 push_init_level (1);
6506 push_member_name (constructor_fields);
6507 output_init_element (value.value, strict_string,
6508 fieldtype, constructor_fields, 1);
6509 RESTORE_SPELLING_DEPTH (constructor_depth);
6512 /* Do the bookkeeping for an element that was
6513 directly output as a constructor. */
6515 /* For a record, keep track of end position of last field. */
6516 if (DECL_SIZE (constructor_fields))
6517 constructor_bit_index
6518 = size_binop (PLUS_EXPR,
6519 bit_position (constructor_fields),
6520 DECL_SIZE (constructor_fields));
6522 /* If the current field was the first one not yet written out,
6523 it isn't now, so update. */
6524 if (constructor_unfilled_fields == constructor_fields)
6526 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6527 /* Skip any nameless bit fields. */
6528 while (constructor_unfilled_fields != 0
6529 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6530 && DECL_NAME (constructor_unfilled_fields) == 0)
6531 constructor_unfilled_fields =
6532 TREE_CHAIN (constructor_unfilled_fields);
6536 constructor_fields = TREE_CHAIN (constructor_fields);
6537 /* Skip any nameless bit fields at the beginning. */
6538 while (constructor_fields != 0
6539 && DECL_C_BIT_FIELD (constructor_fields)
6540 && DECL_NAME (constructor_fields) == 0)
6541 constructor_fields = TREE_CHAIN (constructor_fields);
6543 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6546 enum tree_code fieldcode;
6548 if (constructor_fields == 0)
6550 pedwarn_init ("excess elements in union initializer");
6554 fieldtype = TREE_TYPE (constructor_fields);
6555 if (fieldtype != error_mark_node)
6556 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6557 fieldcode = TREE_CODE (fieldtype);
6559 /* Warn that traditional C rejects initialization of unions.
6560 We skip the warning if the value is zero. This is done
6561 under the assumption that the zero initializer in user
6562 code appears conditioned on e.g. __STDC__ to avoid
6563 "missing initializer" warnings and relies on default
6564 initialization to zero in the traditional C case.
6565 We also skip the warning if the initializer is designated,
6566 again on the assumption that this must be conditional on
6567 __STDC__ anyway (and we've already complained about the
6568 member-designator already). */
6569 if (!in_system_header && !constructor_designated
6570 && !(value.value && (integer_zerop (value.value)
6571 || real_zerop (value.value))))
6572 warning (OPT_Wtraditional, "traditional C rejects initialization "
6575 /* Accept a string constant to initialize a subarray. */
6576 if (value.value != 0
6577 && fieldcode == ARRAY_TYPE
6578 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6580 value.value = orig_value;
6581 /* Otherwise, if we have come to a subaggregate,
6582 and we don't have an element of its type, push into it. */
6583 else if (value.value != 0
6584 && value.value != error_mark_node
6585 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6586 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6587 || fieldcode == UNION_TYPE))
6589 push_init_level (1);
6595 push_member_name (constructor_fields);
6596 output_init_element (value.value, strict_string,
6597 fieldtype, constructor_fields, 1);
6598 RESTORE_SPELLING_DEPTH (constructor_depth);
6601 /* Do the bookkeeping for an element that was
6602 directly output as a constructor. */
6604 constructor_bit_index = DECL_SIZE (constructor_fields);
6605 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6608 constructor_fields = 0;
6610 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6612 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6613 enum tree_code eltcode = TREE_CODE (elttype);
6615 /* Accept a string constant to initialize a subarray. */
6616 if (value.value != 0
6617 && eltcode == ARRAY_TYPE
6618 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6620 value.value = orig_value;
6621 /* Otherwise, if we have come to a subaggregate,
6622 and we don't have an element of its type, push into it. */
6623 else if (value.value != 0
6624 && value.value != error_mark_node
6625 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6626 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6627 || eltcode == UNION_TYPE))
6629 push_init_level (1);
6633 if (constructor_max_index != 0
6634 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6635 || integer_all_onesp (constructor_max_index)))
6637 pedwarn_init ("excess elements in array initializer");
6641 /* Now output the actual element. */
6644 push_array_bounds (tree_low_cst (constructor_index, 1));
6645 output_init_element (value.value, strict_string,
6646 elttype, constructor_index, 1);
6647 RESTORE_SPELLING_DEPTH (constructor_depth);
6651 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6654 /* If we are doing the bookkeeping for an element that was
6655 directly output as a constructor, we must update
6656 constructor_unfilled_index. */
6657 constructor_unfilled_index = constructor_index;
6659 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6661 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6663 /* Do a basic check of initializer size. Note that vectors
6664 always have a fixed size derived from their type. */
6665 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6667 pedwarn_init ("excess elements in vector initializer");
6671 /* Now output the actual element. */
6673 output_init_element (value.value, strict_string,
6674 elttype, constructor_index, 1);
6677 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6680 /* If we are doing the bookkeeping for an element that was
6681 directly output as a constructor, we must update
6682 constructor_unfilled_index. */
6683 constructor_unfilled_index = constructor_index;
6686 /* Handle the sole element allowed in a braced initializer
6687 for a scalar variable. */
6688 else if (constructor_type != error_mark_node
6689 && constructor_fields == 0)
6691 pedwarn_init ("excess elements in scalar initializer");
6697 output_init_element (value.value, strict_string,
6698 constructor_type, NULL_TREE, 1);
6699 constructor_fields = 0;
6702 /* Handle range initializers either at this level or anywhere higher
6703 in the designator stack. */
6704 if (constructor_range_stack)
6706 struct constructor_range_stack *p, *range_stack;
6709 range_stack = constructor_range_stack;
6710 constructor_range_stack = 0;
6711 while (constructor_stack != range_stack->stack)
6713 gcc_assert (constructor_stack->implicit);
6714 process_init_element (pop_init_level (1));
6716 for (p = range_stack;
6717 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6720 gcc_assert (constructor_stack->implicit);
6721 process_init_element (pop_init_level (1));
6724 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6725 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6730 constructor_index = p->index;
6731 constructor_fields = p->fields;
6732 if (finish && p->range_end && p->index == p->range_start)
6740 push_init_level (2);
6741 p->stack = constructor_stack;
6742 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6743 p->index = p->range_start;
6747 constructor_range_stack = range_stack;
6754 constructor_range_stack = 0;
6757 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6758 (guaranteed to be 'volatile' or null) and ARGS (represented using
6759 an ASM_EXPR node). */
6761 build_asm_stmt (tree cv_qualifier, tree args)
6763 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6764 ASM_VOLATILE_P (args) = 1;
6765 return add_stmt (args);
6768 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6769 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6770 SIMPLE indicates whether there was anything at all after the
6771 string in the asm expression -- asm("blah") and asm("blah" : )
6772 are subtly different. We use a ASM_EXPR node to represent this. */
6774 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6780 const char *constraint;
6781 const char **oconstraints;
6782 bool allows_mem, allows_reg, is_inout;
6783 int ninputs, noutputs;
6785 ninputs = list_length (inputs);
6786 noutputs = list_length (outputs);
6787 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
6789 string = resolve_asm_operand_names (string, outputs, inputs);
6791 /* Remove output conversions that change the type but not the mode. */
6792 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6794 tree output = TREE_VALUE (tail);
6796 /* ??? Really, this should not be here. Users should be using a
6797 proper lvalue, dammit. But there's a long history of using casts
6798 in the output operands. In cases like longlong.h, this becomes a
6799 primitive form of typechecking -- if the cast can be removed, then
6800 the output operand had a type of the proper width; otherwise we'll
6801 get an error. Gross, but ... */
6802 STRIP_NOPS (output);
6804 if (!lvalue_or_else (output, lv_asm))
6805 output = error_mark_node;
6807 if (output != error_mark_node
6808 && (TREE_READONLY (output)
6809 || TYPE_READONLY (TREE_TYPE (output))
6810 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
6811 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
6812 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
6813 readonly_error (output, lv_asm);
6815 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6816 oconstraints[i] = constraint;
6818 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6819 &allows_mem, &allows_reg, &is_inout))
6821 /* If the operand is going to end up in memory,
6822 mark it addressable. */
6823 if (!allows_reg && !c_mark_addressable (output))
6824 output = error_mark_node;
6827 output = error_mark_node;
6829 TREE_VALUE (tail) = output;
6832 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
6836 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6837 input = TREE_VALUE (tail);
6839 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
6840 oconstraints, &allows_mem, &allows_reg))
6842 /* If the operand is going to end up in memory,
6843 mark it addressable. */
6844 if (!allows_reg && allows_mem)
6846 /* Strip the nops as we allow this case. FIXME, this really
6847 should be rejected or made deprecated. */
6849 if (!c_mark_addressable (input))
6850 input = error_mark_node;
6854 input = error_mark_node;
6856 TREE_VALUE (tail) = input;
6859 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
6861 /* asm statements without outputs, including simple ones, are treated
6863 ASM_INPUT_P (args) = simple;
6864 ASM_VOLATILE_P (args) = (noutputs == 0);
6869 /* Generate a goto statement to LABEL. */
6872 c_finish_goto_label (tree label)
6874 tree decl = lookup_label (label);
6878 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
6880 error ("jump into statement expression");
6884 if (C_DECL_UNJUMPABLE_VM (decl))
6886 error ("jump into scope of identifier with variably modified type");
6890 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
6892 /* No jump from outside this statement expression context, so
6893 record that there is a jump from within this context. */
6894 struct c_label_list *nlist;
6895 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6896 nlist->next = label_context_stack_se->labels_used;
6897 nlist->label = decl;
6898 label_context_stack_se->labels_used = nlist;
6901 if (!C_DECL_UNDEFINABLE_VM (decl))
6903 /* No jump from outside this context context of identifiers with
6904 variably modified type, so record that there is a jump from
6905 within this context. */
6906 struct c_label_list *nlist;
6907 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6908 nlist->next = label_context_stack_vm->labels_used;
6909 nlist->label = decl;
6910 label_context_stack_vm->labels_used = nlist;
6913 TREE_USED (decl) = 1;
6914 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
6917 /* Generate a computed goto statement to EXPR. */
6920 c_finish_goto_ptr (tree expr)
6923 pedwarn ("ISO C forbids %<goto *expr;%>");
6924 expr = convert (ptr_type_node, expr);
6925 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
6928 /* Generate a C `return' statement. RETVAL is the expression for what
6929 to return, or a null pointer for `return;' with no value. */
6932 c_finish_return (tree retval)
6934 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
6935 bool no_warning = false;
6937 if (TREE_THIS_VOLATILE (current_function_decl))
6938 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6942 current_function_returns_null = 1;
6943 if ((warn_return_type || flag_isoc99)
6944 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
6946 pedwarn_c99 ("%<return%> with no value, in "
6947 "function returning non-void");
6951 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
6953 current_function_returns_null = 1;
6954 if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
6955 pedwarn ("%<return%> with a value, in function returning void");
6959 tree t = convert_for_assignment (valtype, retval, ic_return,
6960 NULL_TREE, NULL_TREE, 0);
6961 tree res = DECL_RESULT (current_function_decl);
6964 current_function_returns_value = 1;
6965 if (t == error_mark_node)
6968 inner = t = convert (TREE_TYPE (res), t);
6970 /* Strip any conversions, additions, and subtractions, and see if
6971 we are returning the address of a local variable. Warn if so. */
6974 switch (TREE_CODE (inner))
6976 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6978 inner = TREE_OPERAND (inner, 0);
6982 /* If the second operand of the MINUS_EXPR has a pointer
6983 type (or is converted from it), this may be valid, so
6984 don't give a warning. */
6986 tree op1 = TREE_OPERAND (inner, 1);
6988 while (!POINTER_TYPE_P (TREE_TYPE (op1))
6989 && (TREE_CODE (op1) == NOP_EXPR
6990 || TREE_CODE (op1) == NON_LVALUE_EXPR
6991 || TREE_CODE (op1) == CONVERT_EXPR))
6992 op1 = TREE_OPERAND (op1, 0);
6994 if (POINTER_TYPE_P (TREE_TYPE (op1)))
6997 inner = TREE_OPERAND (inner, 0);
7002 inner = TREE_OPERAND (inner, 0);
7004 while (REFERENCE_CLASS_P (inner)
7005 && TREE_CODE (inner) != INDIRECT_REF)
7006 inner = TREE_OPERAND (inner, 0);
7009 && !DECL_EXTERNAL (inner)
7010 && !TREE_STATIC (inner)
7011 && DECL_CONTEXT (inner) == current_function_decl)
7012 warning (0, "function returns address of local variable");
7022 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7025 ret_stmt = build_stmt (RETURN_EXPR, retval);
7026 TREE_NO_WARNING (ret_stmt) |= no_warning;
7027 return add_stmt (ret_stmt);
7031 /* The SWITCH_EXPR being built. */
7034 /* The original type of the testing expression, i.e. before the
7035 default conversion is applied. */
7038 /* A splay-tree mapping the low element of a case range to the high
7039 element, or NULL_TREE if there is no high element. Used to
7040 determine whether or not a new case label duplicates an old case
7041 label. We need a tree, rather than simply a hash table, because
7042 of the GNU case range extension. */
7045 /* Number of nested statement expressions within this switch
7046 statement; if nonzero, case and default labels may not
7048 unsigned int blocked_stmt_expr;
7050 /* Scope of outermost declarations of identifiers with variably
7051 modified type within this switch statement; if nonzero, case and
7052 default labels may not appear. */
7053 unsigned int blocked_vm;
7055 /* The next node on the stack. */
7056 struct c_switch *next;
7059 /* A stack of the currently active switch statements. The innermost
7060 switch statement is on the top of the stack. There is no need to
7061 mark the stack for garbage collection because it is only active
7062 during the processing of the body of a function, and we never
7063 collect at that point. */
7065 struct c_switch *c_switch_stack;
7067 /* Start a C switch statement, testing expression EXP. Return the new
7071 c_start_case (tree exp)
7073 tree orig_type = error_mark_node;
7074 struct c_switch *cs;
7076 if (exp != error_mark_node)
7078 orig_type = TREE_TYPE (exp);
7080 if (!INTEGRAL_TYPE_P (orig_type))
7082 if (orig_type != error_mark_node)
7084 error ("switch quantity not an integer");
7085 orig_type = error_mark_node;
7087 exp = integer_zero_node;
7091 tree type = TYPE_MAIN_VARIANT (orig_type);
7093 if (!in_system_header
7094 && (type == long_integer_type_node
7095 || type == long_unsigned_type_node))
7096 warning (OPT_Wtraditional, "%<long%> switch expression not "
7097 "converted to %<int%> in ISO C");
7099 exp = default_conversion (exp);
7103 /* Add this new SWITCH_EXPR to the stack. */
7104 cs = XNEW (struct c_switch);
7105 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7106 cs->orig_type = orig_type;
7107 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7108 cs->blocked_stmt_expr = 0;
7110 cs->next = c_switch_stack;
7111 c_switch_stack = cs;
7113 return add_stmt (cs->switch_expr);
7116 /* Process a case label. */
7119 do_case (tree low_value, tree high_value)
7121 tree label = NULL_TREE;
7123 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7124 && !c_switch_stack->blocked_vm)
7126 label = c_add_case_label (c_switch_stack->cases,
7127 SWITCH_COND (c_switch_stack->switch_expr),
7128 c_switch_stack->orig_type,
7129 low_value, high_value);
7130 if (label == error_mark_node)
7133 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7136 error ("case label in statement expression not containing "
7137 "enclosing switch statement");
7139 error ("%<default%> label in statement expression not containing "
7140 "enclosing switch statement");
7142 else if (c_switch_stack && c_switch_stack->blocked_vm)
7145 error ("case label in scope of identifier with variably modified "
7146 "type not containing enclosing switch statement");
7148 error ("%<default%> label in scope of identifier with variably "
7149 "modified type not containing enclosing switch statement");
7152 error ("case label not within a switch statement");
7154 error ("%<default%> label not within a switch statement");
7159 /* Finish the switch statement. */
7162 c_finish_case (tree body)
7164 struct c_switch *cs = c_switch_stack;
7165 location_t switch_location;
7167 SWITCH_BODY (cs->switch_expr) = body;
7169 /* We must not be within a statement expression nested in the switch
7170 at this point; we might, however, be within the scope of an
7171 identifier with variably modified type nested in the switch. */
7172 gcc_assert (!cs->blocked_stmt_expr);
7174 /* Emit warnings as needed. */
7175 if (EXPR_HAS_LOCATION (cs->switch_expr))
7176 switch_location = EXPR_LOCATION (cs->switch_expr);
7178 switch_location = input_location;
7179 c_do_switch_warnings (cs->cases, switch_location,
7180 TREE_TYPE (cs->switch_expr),
7181 SWITCH_COND (cs->switch_expr));
7183 /* Pop the stack. */
7184 c_switch_stack = cs->next;
7185 splay_tree_delete (cs->cases);
7189 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7190 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7191 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7192 statement, and was not surrounded with parenthesis. */
7195 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7196 tree else_block, bool nested_if)
7200 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7201 if (warn_parentheses && nested_if && else_block == NULL)
7203 tree inner_if = then_block;
7205 /* We know from the grammar productions that there is an IF nested
7206 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7207 it might not be exactly THEN_BLOCK, but should be the last
7208 non-container statement within. */
7210 switch (TREE_CODE (inner_if))
7215 inner_if = BIND_EXPR_BODY (inner_if);
7217 case STATEMENT_LIST:
7218 inner_if = expr_last (then_block);
7220 case TRY_FINALLY_EXPR:
7221 case TRY_CATCH_EXPR:
7222 inner_if = TREE_OPERAND (inner_if, 0);
7229 if (COND_EXPR_ELSE (inner_if))
7230 warning (OPT_Wparentheses,
7231 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7235 empty_body_warning (then_block, else_block);
7237 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7238 SET_EXPR_LOCATION (stmt, if_locus);
7242 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7243 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7244 is false for DO loops. INCR is the FOR increment expression. BODY is
7245 the statement controlled by the loop. BLAB is the break label. CLAB is
7246 the continue label. Everything is allowed to be NULL. */
7249 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7250 tree blab, tree clab, bool cond_is_first)
7252 tree entry = NULL, exit = NULL, t;
7254 /* If the condition is zero don't generate a loop construct. */
7255 if (cond && integer_zerop (cond))
7259 t = build_and_jump (&blab);
7260 SET_EXPR_LOCATION (t, start_locus);
7266 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7268 /* If we have an exit condition, then we build an IF with gotos either
7269 out of the loop, or to the top of it. If there's no exit condition,
7270 then we just build a jump back to the top. */
7271 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7273 if (cond && !integer_nonzerop (cond))
7275 /* Canonicalize the loop condition to the end. This means
7276 generating a branch to the loop condition. Reuse the
7277 continue label, if possible. */
7282 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7283 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7286 t = build1 (GOTO_EXPR, void_type_node, clab);
7287 SET_EXPR_LOCATION (t, start_locus);
7291 t = build_and_jump (&blab);
7292 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7294 SET_EXPR_LOCATION (exit, start_locus);
7296 SET_EXPR_LOCATION (exit, input_location);
7305 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7313 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7317 c_finish_bc_stmt (tree *label_p, bool is_break)
7320 tree label = *label_p;
7322 /* In switch statements break is sometimes stylistically used after
7323 a return statement. This can lead to spurious warnings about
7324 control reaching the end of a non-void function when it is
7325 inlined. Note that we are calling block_may_fallthru with
7326 language specific tree nodes; this works because
7327 block_may_fallthru returns true when given something it does not
7329 skip = !block_may_fallthru (cur_stmt_list);
7334 *label_p = label = create_artificial_label ();
7336 else if (TREE_CODE (label) == LABEL_DECL)
7338 else switch (TREE_INT_CST_LOW (label))
7342 error ("break statement not within loop or switch");
7344 error ("continue statement not within a loop");
7348 gcc_assert (is_break);
7349 error ("break statement used with OpenMP for loop");
7359 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7362 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7365 emit_side_effect_warnings (tree expr)
7367 if (expr == error_mark_node)
7369 else if (!TREE_SIDE_EFFECTS (expr))
7371 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7372 warning (0, "%Hstatement with no effect",
7373 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7375 else if (warn_unused_value)
7376 warn_if_unused_value (expr, input_location);
7379 /* Process an expression as if it were a complete statement. Emit
7380 diagnostics, but do not call ADD_STMT. */
7383 c_process_expr_stmt (tree expr)
7388 if (warn_sequence_point)
7389 verify_sequence_points (expr);
7391 if (TREE_TYPE (expr) != error_mark_node
7392 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7393 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7394 error ("expression statement has incomplete type");
7396 /* If we're not processing a statement expression, warn about unused values.
7397 Warnings for statement expressions will be emitted later, once we figure
7398 out which is the result. */
7399 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7400 && (extra_warnings || warn_unused_value))
7401 emit_side_effect_warnings (expr);
7403 /* If the expression is not of a type to which we cannot assign a line
7404 number, wrap the thing in a no-op NOP_EXPR. */
7405 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7406 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7409 SET_EXPR_LOCATION (expr, input_location);
7414 /* Emit an expression as a statement. */
7417 c_finish_expr_stmt (tree expr)
7420 return add_stmt (c_process_expr_stmt (expr));
7425 /* Do the opposite and emit a statement as an expression. To begin,
7426 create a new binding level and return it. */
7429 c_begin_stmt_expr (void)
7432 struct c_label_context_se *nstack;
7433 struct c_label_list *glist;
7435 /* We must force a BLOCK for this level so that, if it is not expanded
7436 later, there is a way to turn off the entire subtree of blocks that
7437 are contained in it. */
7439 ret = c_begin_compound_stmt (true);
7442 c_switch_stack->blocked_stmt_expr++;
7443 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7445 for (glist = label_context_stack_se->labels_used;
7447 glist = glist->next)
7449 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7451 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7452 nstack->labels_def = NULL;
7453 nstack->labels_used = NULL;
7454 nstack->next = label_context_stack_se;
7455 label_context_stack_se = nstack;
7457 /* Mark the current statement list as belonging to a statement list. */
7458 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7464 c_finish_stmt_expr (tree body)
7466 tree last, type, tmp, val;
7468 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7470 body = c_end_compound_stmt (body, true);
7473 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7474 c_switch_stack->blocked_stmt_expr--;
7476 /* It is no longer possible to jump to labels defined within this
7477 statement expression. */
7478 for (dlist = label_context_stack_se->labels_def;
7480 dlist = dlist->next)
7482 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7484 /* It is again possible to define labels with a goto just outside
7485 this statement expression. */
7486 for (glist = label_context_stack_se->next->labels_used;
7488 glist = glist->next)
7490 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7493 if (glist_prev != NULL)
7494 glist_prev->next = label_context_stack_se->labels_used;
7496 label_context_stack_se->next->labels_used
7497 = label_context_stack_se->labels_used;
7498 label_context_stack_se = label_context_stack_se->next;
7500 /* Locate the last statement in BODY. See c_end_compound_stmt
7501 about always returning a BIND_EXPR. */
7502 last_p = &BIND_EXPR_BODY (body);
7503 last = BIND_EXPR_BODY (body);
7506 if (TREE_CODE (last) == STATEMENT_LIST)
7508 tree_stmt_iterator i;
7510 /* This can happen with degenerate cases like ({ }). No value. */
7511 if (!TREE_SIDE_EFFECTS (last))
7514 /* If we're supposed to generate side effects warnings, process
7515 all of the statements except the last. */
7516 if (extra_warnings || warn_unused_value)
7518 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7519 emit_side_effect_warnings (tsi_stmt (i));
7522 i = tsi_last (last);
7523 last_p = tsi_stmt_ptr (i);
7527 /* If the end of the list is exception related, then the list was split
7528 by a call to push_cleanup. Continue searching. */
7529 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7530 || TREE_CODE (last) == TRY_CATCH_EXPR)
7532 last_p = &TREE_OPERAND (last, 0);
7534 goto continue_searching;
7537 /* In the case that the BIND_EXPR is not necessary, return the
7538 expression out from inside it. */
7539 if (last == error_mark_node
7540 || (last == BIND_EXPR_BODY (body)
7541 && BIND_EXPR_VARS (body) == NULL))
7543 /* Do not warn if the return value of a statement expression is
7546 TREE_NO_WARNING (last) = 1;
7550 /* Extract the type of said expression. */
7551 type = TREE_TYPE (last);
7553 /* If we're not returning a value at all, then the BIND_EXPR that
7554 we already have is a fine expression to return. */
7555 if (!type || VOID_TYPE_P (type))
7558 /* Now that we've located the expression containing the value, it seems
7559 silly to make voidify_wrapper_expr repeat the process. Create a
7560 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7561 tmp = create_tmp_var_raw (type, NULL);
7563 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7564 tree_expr_nonnegative_p giving up immediately. */
7566 if (TREE_CODE (val) == NOP_EXPR
7567 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7568 val = TREE_OPERAND (val, 0);
7570 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7571 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7573 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7576 /* Begin the scope of an identifier of variably modified type, scope
7577 number SCOPE. Jumping from outside this scope to inside it is not
7581 c_begin_vm_scope (unsigned int scope)
7583 struct c_label_context_vm *nstack;
7584 struct c_label_list *glist;
7586 gcc_assert (scope > 0);
7588 /* At file_scope, we don't have to do any processing. */
7589 if (label_context_stack_vm == NULL)
7592 if (c_switch_stack && !c_switch_stack->blocked_vm)
7593 c_switch_stack->blocked_vm = scope;
7594 for (glist = label_context_stack_vm->labels_used;
7596 glist = glist->next)
7598 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7600 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7601 nstack->labels_def = NULL;
7602 nstack->labels_used = NULL;
7603 nstack->scope = scope;
7604 nstack->next = label_context_stack_vm;
7605 label_context_stack_vm = nstack;
7608 /* End a scope which may contain identifiers of variably modified
7609 type, scope number SCOPE. */
7612 c_end_vm_scope (unsigned int scope)
7614 if (label_context_stack_vm == NULL)
7616 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7617 c_switch_stack->blocked_vm = 0;
7618 /* We may have a number of nested scopes of identifiers with
7619 variably modified type, all at this depth. Pop each in turn. */
7620 while (label_context_stack_vm->scope == scope)
7622 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7624 /* It is no longer possible to jump to labels defined within this
7626 for (dlist = label_context_stack_vm->labels_def;
7628 dlist = dlist->next)
7630 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7632 /* It is again possible to define labels with a goto just outside
7634 for (glist = label_context_stack_vm->next->labels_used;
7636 glist = glist->next)
7638 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7641 if (glist_prev != NULL)
7642 glist_prev->next = label_context_stack_vm->labels_used;
7644 label_context_stack_vm->next->labels_used
7645 = label_context_stack_vm->labels_used;
7646 label_context_stack_vm = label_context_stack_vm->next;
7650 /* Begin and end compound statements. This is as simple as pushing
7651 and popping new statement lists from the tree. */
7654 c_begin_compound_stmt (bool do_scope)
7656 tree stmt = push_stmt_list ();
7663 c_end_compound_stmt (tree stmt, bool do_scope)
7669 if (c_dialect_objc ())
7670 objc_clear_super_receiver ();
7671 block = pop_scope ();
7674 stmt = pop_stmt_list (stmt);
7675 stmt = c_build_bind_expr (block, stmt);
7677 /* If this compound statement is nested immediately inside a statement
7678 expression, then force a BIND_EXPR to be created. Otherwise we'll
7679 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7680 STATEMENT_LISTs merge, and thus we can lose track of what statement
7683 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7684 && TREE_CODE (stmt) != BIND_EXPR)
7686 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7687 TREE_SIDE_EFFECTS (stmt) = 1;
7693 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7694 when the current scope is exited. EH_ONLY is true when this is not
7695 meant to apply to normal control flow transfer. */
7698 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7700 enum tree_code code;
7704 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7705 stmt = build_stmt (code, NULL, cleanup);
7707 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7708 list = push_stmt_list ();
7709 TREE_OPERAND (stmt, 0) = list;
7710 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7713 /* Build a binary-operation expression without default conversions.
7714 CODE is the kind of expression to build.
7715 This function differs from `build' in several ways:
7716 the data type of the result is computed and recorded in it,
7717 warnings are generated if arg data types are invalid,
7718 special handling for addition and subtraction of pointers is known,
7719 and some optimization is done (operations on narrow ints
7720 are done in the narrower type when that gives the same result).
7721 Constant folding is also done before the result is returned.
7723 Note that the operands will never have enumeral types, or function
7724 or array types, because either they will have the default conversions
7725 performed or they have both just been converted to some other type in which
7726 the arithmetic is to be done. */
7729 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
7733 enum tree_code code0, code1;
7735 const char *invalid_op_diag;
7737 /* Expression code to give to the expression when it is built.
7738 Normally this is CODE, which is what the caller asked for,
7739 but in some special cases we change it. */
7740 enum tree_code resultcode = code;
7742 /* Data type in which the computation is to be performed.
7743 In the simplest cases this is the common type of the arguments. */
7744 tree result_type = NULL;
7746 /* Nonzero means operands have already been type-converted
7747 in whatever way is necessary.
7748 Zero means they need to be converted to RESULT_TYPE. */
7751 /* Nonzero means create the expression with this type, rather than
7753 tree build_type = 0;
7755 /* Nonzero means after finally constructing the expression
7756 convert it to this type. */
7757 tree final_type = 0;
7759 /* Nonzero if this is an operation like MIN or MAX which can
7760 safely be computed in short if both args are promoted shorts.
7761 Also implies COMMON.
7762 -1 indicates a bitwise operation; this makes a difference
7763 in the exact conditions for when it is safe to do the operation
7764 in a narrower mode. */
7767 /* Nonzero if this is a comparison operation;
7768 if both args are promoted shorts, compare the original shorts.
7769 Also implies COMMON. */
7770 int short_compare = 0;
7772 /* Nonzero if this is a right-shift operation, which can be computed on the
7773 original short and then promoted if the operand is a promoted short. */
7774 int short_shift = 0;
7776 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7779 /* True means types are compatible as far as ObjC is concerned. */
7784 op0 = default_conversion (orig_op0);
7785 op1 = default_conversion (orig_op1);
7793 type0 = TREE_TYPE (op0);
7794 type1 = TREE_TYPE (op1);
7796 /* The expression codes of the data types of the arguments tell us
7797 whether the arguments are integers, floating, pointers, etc. */
7798 code0 = TREE_CODE (type0);
7799 code1 = TREE_CODE (type1);
7801 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7802 STRIP_TYPE_NOPS (op0);
7803 STRIP_TYPE_NOPS (op1);
7805 /* If an error was already reported for one of the arguments,
7806 avoid reporting another error. */
7808 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7809 return error_mark_node;
7811 if ((invalid_op_diag
7812 = targetm.invalid_binary_op (code, type0, type1)))
7814 error (invalid_op_diag);
7815 return error_mark_node;
7818 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
7823 /* Handle the pointer + int case. */
7824 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7825 return pointer_int_sum (PLUS_EXPR, op0, op1);
7826 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
7827 return pointer_int_sum (PLUS_EXPR, op1, op0);
7833 /* Subtraction of two similar pointers.
7834 We must subtract them as integers, then divide by object size. */
7835 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
7836 && comp_target_types (type0, type1))
7837 return pointer_diff (op0, op1);
7838 /* Handle pointer minus int. Just like pointer plus int. */
7839 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7840 return pointer_int_sum (MINUS_EXPR, op0, op1);
7849 case TRUNC_DIV_EXPR:
7851 case FLOOR_DIV_EXPR:
7852 case ROUND_DIV_EXPR:
7853 case EXACT_DIV_EXPR:
7854 /* Floating point division by zero is a legitimate way to obtain
7855 infinities and NaNs. */
7856 if (skip_evaluation == 0 && integer_zerop (op1))
7857 warning (OPT_Wdiv_by_zero, "division by zero");
7859 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7860 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7861 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7862 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
7864 enum tree_code tcode0 = code0, tcode1 = code1;
7866 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7867 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
7868 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
7869 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
7871 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
7872 resultcode = RDIV_EXPR;
7874 /* Although it would be tempting to shorten always here, that
7875 loses on some targets, since the modulo instruction is
7876 undefined if the quotient can't be represented in the
7877 computation mode. We shorten only if unsigned or if
7878 dividing by something we know != -1. */
7879 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7880 || (TREE_CODE (op1) == INTEGER_CST
7881 && !integer_all_onesp (op1)));
7889 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7891 else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
7895 case TRUNC_MOD_EXPR:
7896 case FLOOR_MOD_EXPR:
7897 if (skip_evaluation == 0 && integer_zerop (op1))
7898 warning (OPT_Wdiv_by_zero, "division by zero");
7900 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7902 /* Although it would be tempting to shorten always here, that loses
7903 on some targets, since the modulo instruction is undefined if the
7904 quotient can't be represented in the computation mode. We shorten
7905 only if unsigned or if dividing by something we know != -1. */
7906 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7907 || (TREE_CODE (op1) == INTEGER_CST
7908 && !integer_all_onesp (op1)));
7913 case TRUTH_ANDIF_EXPR:
7914 case TRUTH_ORIF_EXPR:
7915 case TRUTH_AND_EXPR:
7917 case TRUTH_XOR_EXPR:
7918 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
7919 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
7920 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
7921 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
7923 /* Result of these operations is always an int,
7924 but that does not mean the operands should be
7925 converted to ints! */
7926 result_type = integer_type_node;
7927 op0 = c_common_truthvalue_conversion (op0);
7928 op1 = c_common_truthvalue_conversion (op1);
7933 /* Shift operations: result has same type as first operand;
7934 always convert second operand to int.
7935 Also set SHORT_SHIFT if shifting rightward. */
7938 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7940 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7942 if (tree_int_cst_sgn (op1) < 0)
7943 warning (0, "right shift count is negative");
7946 if (!integer_zerop (op1))
7949 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7950 warning (0, "right shift count >= width of type");
7954 /* Use the type of the value to be shifted. */
7955 result_type = type0;
7956 /* Convert the shift-count to an integer, regardless of size
7957 of value being shifted. */
7958 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7959 op1 = convert (integer_type_node, op1);
7960 /* Avoid converting op1 to result_type later. */
7966 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7968 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7970 if (tree_int_cst_sgn (op1) < 0)
7971 warning (0, "left shift count is negative");
7973 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7974 warning (0, "left shift count >= width of type");
7977 /* Use the type of the value to be shifted. */
7978 result_type = type0;
7979 /* Convert the shift-count to an integer, regardless of size
7980 of value being shifted. */
7981 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7982 op1 = convert (integer_type_node, op1);
7983 /* Avoid converting op1 to result_type later. */
7990 if (code0 == REAL_TYPE || code1 == REAL_TYPE)
7991 warning (OPT_Wfloat_equal,
7992 "comparing floating point with == or != is unsafe");
7993 /* Result of comparison is always int,
7994 but don't convert the args to int! */
7995 build_type = integer_type_node;
7996 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7997 || code0 == COMPLEX_TYPE)
7998 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7999 || code1 == COMPLEX_TYPE))
8001 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8003 tree tt0 = TREE_TYPE (type0);
8004 tree tt1 = TREE_TYPE (type1);
8005 /* Anything compares with void *. void * compares with anything.
8006 Otherwise, the targets must be compatible
8007 and both must be object or both incomplete. */
8008 if (comp_target_types (type0, type1))
8009 result_type = common_pointer_type (type0, type1);
8010 else if (VOID_TYPE_P (tt0))
8012 /* op0 != orig_op0 detects the case of something
8013 whose value is 0 but which isn't a valid null ptr const. */
8014 if (pedantic && !null_pointer_constant_p (orig_op0)
8015 && TREE_CODE (tt1) == FUNCTION_TYPE)
8016 pedwarn ("ISO C forbids comparison of %<void *%>"
8017 " with function pointer");
8019 else if (VOID_TYPE_P (tt1))
8021 if (pedantic && !null_pointer_constant_p (orig_op1)
8022 && TREE_CODE (tt0) == FUNCTION_TYPE)
8023 pedwarn ("ISO C forbids comparison of %<void *%>"
8024 " with function pointer");
8027 /* Avoid warning about the volatile ObjC EH puts on decls. */
8029 pedwarn ("comparison of distinct pointer types lacks a cast");
8031 if (result_type == NULL_TREE)
8032 result_type = ptr_type_node;
8034 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8036 if (TREE_CODE (op0) == ADDR_EXPR
8037 && DECL_P (TREE_OPERAND (op0, 0))
8038 && (TREE_CODE (TREE_OPERAND (op0, 0)) == PARM_DECL
8039 || TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
8040 || !DECL_WEAK (TREE_OPERAND (op0, 0))))
8041 warning (OPT_Walways_true, "the address of %qD will never be NULL",
8042 TREE_OPERAND (op0, 0));
8043 result_type = type0;
8045 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8047 if (TREE_CODE (op1) == ADDR_EXPR
8048 && DECL_P (TREE_OPERAND (op1, 0))
8049 && (TREE_CODE (TREE_OPERAND (op1, 0)) == PARM_DECL
8050 || TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL
8051 || !DECL_WEAK (TREE_OPERAND (op1, 0))))
8052 warning (OPT_Walways_true, "the address of %qD will never be NULL",
8053 TREE_OPERAND (op1, 0));
8054 result_type = type1;
8056 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8058 result_type = type0;
8059 pedwarn ("comparison between pointer and integer");
8061 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8063 result_type = type1;
8064 pedwarn ("comparison between pointer and integer");
8072 build_type = integer_type_node;
8073 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
8074 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
8076 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8078 if (comp_target_types (type0, type1))
8080 result_type = common_pointer_type (type0, type1);
8081 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8082 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8083 pedwarn ("comparison of complete and incomplete pointers");
8085 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8086 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
8090 result_type = ptr_type_node;
8091 pedwarn ("comparison of distinct pointer types lacks a cast");
8094 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8096 result_type = type0;
8097 if (pedantic || extra_warnings)
8098 pedwarn ("ordered comparison of pointer with integer zero");
8100 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8102 result_type = type1;
8104 pedwarn ("ordered comparison of pointer with integer zero");
8106 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8108 result_type = type0;
8109 pedwarn ("comparison between pointer and integer");
8111 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8113 result_type = type1;
8114 pedwarn ("comparison between pointer and integer");
8122 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8123 return error_mark_node;
8125 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8126 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8127 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8128 TREE_TYPE (type1))))
8130 binary_op_error (code);
8131 return error_mark_node;
8134 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8135 || code0 == VECTOR_TYPE)
8137 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8138 || code1 == VECTOR_TYPE))
8140 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8142 if (shorten || common || short_compare)
8143 result_type = c_common_type (type0, type1);
8145 /* For certain operations (which identify themselves by shorten != 0)
8146 if both args were extended from the same smaller type,
8147 do the arithmetic in that type and then extend.
8149 shorten !=0 and !=1 indicates a bitwise operation.
8150 For them, this optimization is safe only if
8151 both args are zero-extended or both are sign-extended.
8152 Otherwise, we might change the result.
8153 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8154 but calculated in (unsigned short) it would be (unsigned short)-1. */
8156 if (shorten && none_complex)
8158 int unsigned0, unsigned1;
8163 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
8164 excessive narrowing when we call get_narrower below. For
8165 example, suppose that OP0 is of unsigned int extended
8166 from signed char and that RESULT_TYPE is long long int.
8167 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
8170 (long long int) (unsigned int) signed_char
8172 which get_narrower would narrow down to
8174 (unsigned int) signed char
8176 If we do not cast OP0 first, get_narrower would return
8177 signed_char, which is inconsistent with the case of the
8179 op0 = convert (result_type, op0);
8180 op1 = convert (result_type, op1);
8182 arg0 = get_narrower (op0, &unsigned0);
8183 arg1 = get_narrower (op1, &unsigned1);
8185 /* UNS is 1 if the operation to be done is an unsigned one. */
8186 uns = TYPE_UNSIGNED (result_type);
8188 final_type = result_type;
8190 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
8191 but it *requires* conversion to FINAL_TYPE. */
8193 if ((TYPE_PRECISION (TREE_TYPE (op0))
8194 == TYPE_PRECISION (TREE_TYPE (arg0)))
8195 && TREE_TYPE (op0) != final_type)
8196 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
8197 if ((TYPE_PRECISION (TREE_TYPE (op1))
8198 == TYPE_PRECISION (TREE_TYPE (arg1)))
8199 && TREE_TYPE (op1) != final_type)
8200 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
8202 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
8204 /* For bitwise operations, signedness of nominal type
8205 does not matter. Consider only how operands were extended. */
8209 /* Note that in all three cases below we refrain from optimizing
8210 an unsigned operation on sign-extended args.
8211 That would not be valid. */
8213 /* Both args variable: if both extended in same way
8214 from same width, do it in that width.
8215 Do it unsigned if args were zero-extended. */
8216 if ((TYPE_PRECISION (TREE_TYPE (arg0))
8217 < TYPE_PRECISION (result_type))
8218 && (TYPE_PRECISION (TREE_TYPE (arg1))
8219 == TYPE_PRECISION (TREE_TYPE (arg0)))
8220 && unsigned0 == unsigned1
8221 && (unsigned0 || !uns))
8223 = c_common_signed_or_unsigned_type
8224 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
8225 else if (TREE_CODE (arg0) == INTEGER_CST
8226 && (unsigned1 || !uns)
8227 && (TYPE_PRECISION (TREE_TYPE (arg1))
8228 < TYPE_PRECISION (result_type))
8230 = c_common_signed_or_unsigned_type (unsigned1,
8232 int_fits_type_p (arg0, type)))
8234 else if (TREE_CODE (arg1) == INTEGER_CST
8235 && (unsigned0 || !uns)
8236 && (TYPE_PRECISION (TREE_TYPE (arg0))
8237 < TYPE_PRECISION (result_type))
8239 = c_common_signed_or_unsigned_type (unsigned0,
8241 int_fits_type_p (arg1, type)))
8245 /* Shifts can be shortened if shifting right. */
8250 tree arg0 = get_narrower (op0, &unsigned_arg);
8252 final_type = result_type;
8254 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8255 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8257 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8258 /* We can shorten only if the shift count is less than the
8259 number of bits in the smaller type size. */
8260 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8261 /* We cannot drop an unsigned shift after sign-extension. */
8262 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8264 /* Do an unsigned shift if the operand was zero-extended. */
8266 = c_common_signed_or_unsigned_type (unsigned_arg,
8268 /* Convert value-to-be-shifted to that type. */
8269 if (TREE_TYPE (op0) != result_type)
8270 op0 = convert (result_type, op0);
8275 /* Comparison operations are shortened too but differently.
8276 They identify themselves by setting short_compare = 1. */
8280 /* Don't write &op0, etc., because that would prevent op0
8281 from being kept in a register.
8282 Instead, make copies of the our local variables and
8283 pass the copies by reference, then copy them back afterward. */
8284 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8285 enum tree_code xresultcode = resultcode;
8287 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8292 op0 = xop0, op1 = xop1;
8294 resultcode = xresultcode;
8296 if (warn_sign_compare && skip_evaluation == 0)
8298 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
8299 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
8300 int unsignedp0, unsignedp1;
8301 tree primop0 = get_narrower (op0, &unsignedp0);
8302 tree primop1 = get_narrower (op1, &unsignedp1);
8306 STRIP_TYPE_NOPS (xop0);
8307 STRIP_TYPE_NOPS (xop1);
8309 /* Give warnings for comparisons between signed and unsigned
8310 quantities that may fail.
8312 Do the checking based on the original operand trees, so that
8313 casts will be considered, but default promotions won't be.
8315 Do not warn if the comparison is being done in a signed type,
8316 since the signed type will only be chosen if it can represent
8317 all the values of the unsigned type. */
8318 if (!TYPE_UNSIGNED (result_type))
8320 /* Do not warn if both operands are the same signedness. */
8321 else if (op0_signed == op1_signed)
8328 sop = xop0, uop = xop1;
8330 sop = xop1, uop = xop0;
8332 /* Do not warn if the signed quantity is an
8333 unsuffixed integer literal (or some static
8334 constant expression involving such literals or a
8335 conditional expression involving such literals)
8336 and it is non-negative. */
8337 if (tree_expr_nonnegative_p (sop))
8339 /* Do not warn if the comparison is an equality operation,
8340 the unsigned quantity is an integral constant, and it
8341 would fit in the result if the result were signed. */
8342 else if (TREE_CODE (uop) == INTEGER_CST
8343 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
8345 (uop, c_common_signed_type (result_type)))
8347 /* Do not warn if the unsigned quantity is an enumeration
8348 constant and its maximum value would fit in the result
8349 if the result were signed. */
8350 else if (TREE_CODE (uop) == INTEGER_CST
8351 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
8353 (TYPE_MAX_VALUE (TREE_TYPE (uop)),
8354 c_common_signed_type (result_type)))
8357 warning (0, "comparison between signed and unsigned");
8360 /* Warn if two unsigned values are being compared in a size
8361 larger than their original size, and one (and only one) is the
8362 result of a `~' operator. This comparison will always fail.
8364 Also warn if one operand is a constant, and the constant
8365 does not have all bits set that are set in the ~ operand
8366 when it is extended. */
8368 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
8369 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
8371 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
8372 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
8375 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
8378 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
8381 HOST_WIDE_INT constant, mask;
8382 int unsignedp, bits;
8384 if (host_integerp (primop0, 0))
8387 unsignedp = unsignedp1;
8388 constant = tree_low_cst (primop0, 0);
8393 unsignedp = unsignedp0;
8394 constant = tree_low_cst (primop1, 0);
8397 bits = TYPE_PRECISION (TREE_TYPE (primop));
8398 if (bits < TYPE_PRECISION (result_type)
8399 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
8401 mask = (~(HOST_WIDE_INT) 0) << bits;
8402 if ((mask & constant) != mask)
8403 warning (0, "comparison of promoted ~unsigned with constant");
8406 else if (unsignedp0 && unsignedp1
8407 && (TYPE_PRECISION (TREE_TYPE (primop0))
8408 < TYPE_PRECISION (result_type))
8409 && (TYPE_PRECISION (TREE_TYPE (primop1))
8410 < TYPE_PRECISION (result_type)))
8411 warning (0, "comparison of promoted ~unsigned with unsigned");
8417 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8418 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8419 Then the expression will be built.
8420 It will be given type FINAL_TYPE if that is nonzero;
8421 otherwise, it will be given type RESULT_TYPE. */
8425 binary_op_error (code);
8426 return error_mark_node;
8431 if (TREE_TYPE (op0) != result_type)
8432 op0 = convert_and_check (result_type, op0);
8433 if (TREE_TYPE (op1) != result_type)
8434 op1 = convert_and_check (result_type, op1);
8436 /* This can happen if one operand has a vector type, and the other
8437 has a different type. */
8438 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8439 return error_mark_node;
8442 if (build_type == NULL_TREE)
8443 build_type = result_type;
8446 /* Treat expressions in initializers specially as they can't trap. */
8447 tree result = require_constant_value ? fold_build2_initializer (resultcode,
8450 : fold_build2 (resultcode, build_type,
8453 if (final_type != 0)
8454 result = convert (final_type, result);
8460 /* Convert EXPR to be a truth-value, validating its type for this
8464 c_objc_common_truthvalue_conversion (tree expr)
8466 switch (TREE_CODE (TREE_TYPE (expr)))
8469 error ("used array that cannot be converted to pointer where scalar is required");
8470 return error_mark_node;
8473 error ("used struct type value where scalar is required");
8474 return error_mark_node;
8477 error ("used union type value where scalar is required");
8478 return error_mark_node;
8487 /* ??? Should we also give an error for void and vectors rather than
8488 leaving those to give errors later? */
8489 return c_common_truthvalue_conversion (expr);
8493 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8497 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED,
8498 bool *ti ATTRIBUTE_UNUSED, bool *se)
8500 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8502 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8503 /* Executing a compound literal inside a function reinitializes
8505 if (!TREE_STATIC (decl))
8513 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8516 c_begin_omp_parallel (void)
8521 block = c_begin_compound_stmt (true);
8527 c_finish_omp_parallel (tree clauses, tree block)
8531 block = c_end_compound_stmt (block, true);
8533 stmt = make_node (OMP_PARALLEL);
8534 TREE_TYPE (stmt) = void_type_node;
8535 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8536 OMP_PARALLEL_BODY (stmt) = block;
8538 return add_stmt (stmt);
8541 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8542 Remove any elements from the list that are invalid. */
8545 c_finish_omp_clauses (tree clauses)
8547 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8548 tree c, t, *pc = &clauses;
8551 bitmap_obstack_initialize (NULL);
8552 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8553 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8554 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8556 for (pc = &clauses, c = clauses; c ; c = *pc)
8558 bool remove = false;
8559 bool need_complete = false;
8560 bool need_implicitly_determined = false;
8562 switch (OMP_CLAUSE_CODE (c))
8564 case OMP_CLAUSE_SHARED:
8566 need_implicitly_determined = true;
8567 goto check_dup_generic;
8569 case OMP_CLAUSE_PRIVATE:
8571 need_complete = true;
8572 need_implicitly_determined = true;
8573 goto check_dup_generic;
8575 case OMP_CLAUSE_REDUCTION:
8577 need_implicitly_determined = true;
8578 t = OMP_CLAUSE_DECL (c);
8579 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8580 || POINTER_TYPE_P (TREE_TYPE (t)))
8582 error ("%qE has invalid type for %<reduction%>", t);
8585 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8587 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8588 const char *r_name = NULL;
8605 case TRUTH_ANDIF_EXPR:
8608 case TRUTH_ORIF_EXPR:
8616 error ("%qE has invalid type for %<reduction(%s)%>",
8621 goto check_dup_generic;
8623 case OMP_CLAUSE_COPYPRIVATE:
8624 name = "copyprivate";
8625 goto check_dup_generic;
8627 case OMP_CLAUSE_COPYIN:
8629 t = OMP_CLAUSE_DECL (c);
8630 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8632 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8635 goto check_dup_generic;
8638 t = OMP_CLAUSE_DECL (c);
8639 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8641 error ("%qE is not a variable in clause %qs", t, name);
8644 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8645 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8646 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8648 error ("%qE appears more than once in data clauses", t);
8652 bitmap_set_bit (&generic_head, DECL_UID (t));
8655 case OMP_CLAUSE_FIRSTPRIVATE:
8656 name = "firstprivate";
8657 t = OMP_CLAUSE_DECL (c);
8658 need_complete = true;
8659 need_implicitly_determined = true;
8660 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8662 error ("%qE is not a variable in clause %<firstprivate%>", t);
8665 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8666 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8668 error ("%qE appears more than once in data clauses", t);
8672 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8675 case OMP_CLAUSE_LASTPRIVATE:
8676 name = "lastprivate";
8677 t = OMP_CLAUSE_DECL (c);
8678 need_complete = true;
8679 need_implicitly_determined = true;
8680 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8682 error ("%qE is not a variable in clause %<lastprivate%>", t);
8685 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8686 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8688 error ("%qE appears more than once in data clauses", t);
8692 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8696 case OMP_CLAUSE_NUM_THREADS:
8697 case OMP_CLAUSE_SCHEDULE:
8698 case OMP_CLAUSE_NOWAIT:
8699 case OMP_CLAUSE_ORDERED:
8700 case OMP_CLAUSE_DEFAULT:
8701 pc = &OMP_CLAUSE_CHAIN (c);
8710 t = OMP_CLAUSE_DECL (c);
8714 t = require_complete_type (t);
8715 if (t == error_mark_node)
8719 if (need_implicitly_determined)
8721 const char *share_name = NULL;
8723 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8724 share_name = "threadprivate";
8725 else switch (c_omp_predetermined_sharing (t))
8727 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8729 case OMP_CLAUSE_DEFAULT_SHARED:
8730 share_name = "shared";
8732 case OMP_CLAUSE_DEFAULT_PRIVATE:
8733 share_name = "private";
8740 error ("%qE is predetermined %qs for %qs",
8741 t, share_name, name);
8748 *pc = OMP_CLAUSE_CHAIN (c);
8750 pc = &OMP_CLAUSE_CHAIN (c);
8753 bitmap_obstack_release (NULL);