1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
24 /* This file is part of the C front end.
25 It contains routines to build C expressions given their operands,
26 including computing the types of the result, C-specific error checks,
27 and some optimization. */
31 #include "coretypes.h"
35 #include "langhooks.h"
45 #include "tree-iterator.h"
46 #include "tree-gimple.h"
47 #include "tree-flow.h"
49 /* Possible cases of implicit bad conversions. Used to select
50 diagnostic messages in convert_for_assignment. */
59 /* The level of nesting inside "__alignof__". */
62 /* The level of nesting inside "sizeof". */
65 /* The level of nesting inside "typeof". */
68 struct c_label_context_se *label_context_stack_se;
69 struct c_label_context_vm *label_context_stack_vm;
71 /* Nonzero if we've already printed a "missing braces around initializer"
72 message within this initializer. */
73 static int missing_braces_mentioned;
75 static int require_constant_value;
76 static int require_constant_elements;
78 static bool null_pointer_constant_p (tree);
79 static tree qualify_type (tree, tree);
80 static int tagged_types_tu_compatible_p (tree, tree);
81 static int comp_target_types (tree, tree);
82 static int function_types_compatible_p (tree, tree);
83 static int type_lists_compatible_p (tree, tree);
84 static tree decl_constant_value_for_broken_optimization (tree);
85 static tree lookup_field (tree, tree);
86 static tree convert_arguments (tree, tree, tree, tree);
87 static tree pointer_diff (tree, tree);
88 static tree convert_for_assignment (tree, tree, enum impl_conv, tree, tree,
90 static tree valid_compound_expr_initializer (tree, tree);
91 static void push_string (const char *);
92 static void push_member_name (tree);
93 static int spelling_length (void);
94 static char *print_spelling (char *);
95 static void warning_init (const char *);
96 static tree digest_init (tree, tree, bool, int);
97 static void output_init_element (tree, bool, tree, tree, int);
98 static void output_pending_init_elements (int);
99 static int set_designator (int);
100 static void push_range_stack (tree);
101 static void add_pending_init (tree, tree);
102 static void set_nonincremental_init (void);
103 static void set_nonincremental_init_from_string (tree);
104 static tree find_init_member (tree);
105 static void readonly_error (tree, enum lvalue_use);
106 static int lvalue_or_else (tree, enum lvalue_use);
107 static int lvalue_p (tree);
108 static void record_maybe_used_decl (tree);
109 static int comptypes_internal (tree, tree);
111 /* Return true if EXP is a null pointer constant, false otherwise. */
114 null_pointer_constant_p (tree expr)
116 /* This should really operate on c_expr structures, but they aren't
117 yet available everywhere required. */
118 tree type = TREE_TYPE (expr);
119 return (TREE_CODE (expr) == INTEGER_CST
120 && !TREE_CONSTANT_OVERFLOW (expr)
121 && integer_zerop (expr)
122 && (INTEGRAL_TYPE_P (type)
123 || (TREE_CODE (type) == POINTER_TYPE
124 && VOID_TYPE_P (TREE_TYPE (type))
125 && TYPE_QUALS (TREE_TYPE (type)) == TYPE_UNQUALIFIED)));
127 \f/* This is a cache to hold if two types are compatible or not. */
129 struct tagged_tu_seen_cache {
130 const struct tagged_tu_seen_cache * next;
133 /* The return value of tagged_types_tu_compatible_p if we had seen
134 these two types already. */
138 static const struct tagged_tu_seen_cache * tagged_tu_seen_base;
139 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *);
141 /* Do `exp = require_complete_type (exp);' to make sure exp
142 does not have an incomplete type. (That includes void types.) */
145 require_complete_type (tree value)
147 tree type = TREE_TYPE (value);
149 if (value == error_mark_node || type == error_mark_node)
150 return error_mark_node;
152 /* First, detect a valid value with a complete type. */
153 if (COMPLETE_TYPE_P (type))
156 c_incomplete_type_error (value, type);
157 return error_mark_node;
160 /* Print an error message for invalid use of an incomplete type.
161 VALUE is the expression that was used (or 0 if that isn't known)
162 and TYPE is the type that was invalid. */
165 c_incomplete_type_error (tree value, tree type)
167 const char *type_code_string;
169 /* Avoid duplicate error message. */
170 if (TREE_CODE (type) == ERROR_MARK)
173 if (value != 0 && (TREE_CODE (value) == VAR_DECL
174 || TREE_CODE (value) == PARM_DECL))
175 error ("%qD has an incomplete type", value);
179 /* We must print an error message. Be clever about what it says. */
181 switch (TREE_CODE (type))
184 type_code_string = "struct";
188 type_code_string = "union";
192 type_code_string = "enum";
196 error ("invalid use of void expression");
200 if (TYPE_DOMAIN (type))
202 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
204 error ("invalid use of flexible array member");
207 type = TREE_TYPE (type);
210 error ("invalid use of array with unspecified bounds");
217 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
218 error ("invalid use of undefined type %<%s %E%>",
219 type_code_string, TYPE_NAME (type));
221 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
222 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type));
226 /* Given a type, apply default promotions wrt unnamed function
227 arguments and return the new type. */
230 c_type_promotes_to (tree type)
232 if (TYPE_MAIN_VARIANT (type) == float_type_node)
233 return double_type_node;
235 if (c_promoting_integer_type_p (type))
237 /* Preserve unsignedness if not really getting any wider. */
238 if (TYPE_UNSIGNED (type)
239 && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
240 return unsigned_type_node;
241 return integer_type_node;
247 /* Return a variant of TYPE which has all the type qualifiers of LIKE
248 as well as those of TYPE. */
251 qualify_type (tree type, tree like)
253 return c_build_qualified_type (type,
254 TYPE_QUALS (type) | TYPE_QUALS (like));
257 /* Return true iff the given tree T is a variable length array. */
260 c_vla_type_p (tree t)
262 if (TREE_CODE (t) == ARRAY_TYPE
263 && C_TYPE_VARIABLE_SIZE (t))
268 /* Return the composite type of two compatible types.
270 We assume that comptypes has already been done and returned
271 nonzero; if that isn't so, this may crash. In particular, we
272 assume that qualifiers match. */
275 composite_type (tree t1, tree t2)
277 enum tree_code code1;
278 enum tree_code code2;
281 /* Save time if the two types are the same. */
283 if (t1 == t2) return t1;
285 /* If one type is nonsense, use the other. */
286 if (t1 == error_mark_node)
288 if (t2 == error_mark_node)
291 code1 = TREE_CODE (t1);
292 code2 = TREE_CODE (t2);
294 /* Merge the attributes. */
295 attributes = targetm.merge_type_attributes (t1, t2);
297 /* If one is an enumerated type and the other is the compatible
298 integer type, the composite type might be either of the two
299 (DR#013 question 3). For consistency, use the enumerated type as
300 the composite type. */
302 if (code1 == ENUMERAL_TYPE && code2 == INTEGER_TYPE)
304 if (code2 == ENUMERAL_TYPE && code1 == INTEGER_TYPE)
307 gcc_assert (code1 == code2);
312 /* For two pointers, do this recursively on the target type. */
314 tree pointed_to_1 = TREE_TYPE (t1);
315 tree pointed_to_2 = TREE_TYPE (t2);
316 tree target = composite_type (pointed_to_1, pointed_to_2);
317 t1 = build_pointer_type (target);
318 t1 = build_type_attribute_variant (t1, attributes);
319 return qualify_type (t1, t2);
324 tree elt = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
327 tree d1 = TYPE_DOMAIN (t1);
328 tree d2 = TYPE_DOMAIN (t2);
329 bool d1_variable, d2_variable;
330 bool d1_zero, d2_zero;
332 /* We should not have any type quals on arrays at all. */
333 gcc_assert (!TYPE_QUALS (t1) && !TYPE_QUALS (t2));
335 d1_zero = d1 == 0 || !TYPE_MAX_VALUE (d1);
336 d2_zero = d2 == 0 || !TYPE_MAX_VALUE (d2);
338 d1_variable = (!d1_zero
339 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
340 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
341 d2_variable = (!d2_zero
342 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
343 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
344 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
345 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
347 /* Save space: see if the result is identical to one of the args. */
348 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)
349 && (d2_variable || d2_zero || !d1_variable))
350 return build_type_attribute_variant (t1, attributes);
351 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)
352 && (d1_variable || d1_zero || !d2_variable))
353 return build_type_attribute_variant (t2, attributes);
355 if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
356 return build_type_attribute_variant (t1, attributes);
357 if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
358 return build_type_attribute_variant (t2, attributes);
360 /* Merge the element types, and have a size if either arg has
361 one. We may have qualifiers on the element types. To set
362 up TYPE_MAIN_VARIANT correctly, we need to form the
363 composite of the unqualified types and add the qualifiers
365 quals = TYPE_QUALS (strip_array_types (elt));
366 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
367 t1 = build_array_type (unqual_elt,
368 TYPE_DOMAIN ((TYPE_DOMAIN (t1)
374 t1 = c_build_qualified_type (t1, quals);
375 return build_type_attribute_variant (t1, attributes);
379 /* Function types: prefer the one that specified arg types.
380 If both do, merge the arg types. Also merge the return types. */
382 tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
383 tree p1 = TYPE_ARG_TYPES (t1);
384 tree p2 = TYPE_ARG_TYPES (t2);
389 /* Save space: see if the result is identical to one of the args. */
390 if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
391 return build_type_attribute_variant (t1, attributes);
392 if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
393 return build_type_attribute_variant (t2, attributes);
395 /* Simple way if one arg fails to specify argument types. */
396 if (TYPE_ARG_TYPES (t1) == 0)
398 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
399 t1 = build_type_attribute_variant (t1, attributes);
400 return qualify_type (t1, t2);
402 if (TYPE_ARG_TYPES (t2) == 0)
404 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
405 t1 = build_type_attribute_variant (t1, attributes);
406 return qualify_type (t1, t2);
409 /* If both args specify argument types, we must merge the two
410 lists, argument by argument. */
411 /* Tell global_bindings_p to return false so that variable_size
412 doesn't die on VLAs in parameter types. */
413 c_override_global_bindings_to_false = true;
415 len = list_length (p1);
418 for (i = 0; i < len; i++)
419 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
424 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
426 /* A null type means arg type is not specified.
427 Take whatever the other function type has. */
428 if (TREE_VALUE (p1) == 0)
430 TREE_VALUE (n) = TREE_VALUE (p2);
433 if (TREE_VALUE (p2) == 0)
435 TREE_VALUE (n) = TREE_VALUE (p1);
439 /* Given wait (union {union wait *u; int *i} *)
440 and wait (union wait *),
441 prefer union wait * as type of parm. */
442 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
443 && TREE_VALUE (p1) != TREE_VALUE (p2))
446 tree mv2 = TREE_VALUE (p2);
447 if (mv2 && mv2 != error_mark_node
448 && TREE_CODE (mv2) != ARRAY_TYPE)
449 mv2 = TYPE_MAIN_VARIANT (mv2);
450 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
451 memb; memb = TREE_CHAIN (memb))
453 tree mv3 = TREE_TYPE (memb);
454 if (mv3 && mv3 != error_mark_node
455 && TREE_CODE (mv3) != ARRAY_TYPE)
456 mv3 = TYPE_MAIN_VARIANT (mv3);
457 if (comptypes (mv3, mv2))
459 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
462 pedwarn ("function types not truly compatible in ISO C");
467 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
468 && TREE_VALUE (p2) != TREE_VALUE (p1))
471 tree mv1 = TREE_VALUE (p1);
472 if (mv1 && mv1 != error_mark_node
473 && TREE_CODE (mv1) != ARRAY_TYPE)
474 mv1 = TYPE_MAIN_VARIANT (mv1);
475 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
476 memb; memb = TREE_CHAIN (memb))
478 tree mv3 = TREE_TYPE (memb);
479 if (mv3 && mv3 != error_mark_node
480 && TREE_CODE (mv3) != ARRAY_TYPE)
481 mv3 = TYPE_MAIN_VARIANT (mv3);
482 if (comptypes (mv3, mv1))
484 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
487 pedwarn ("function types not truly compatible in ISO C");
492 TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
496 c_override_global_bindings_to_false = false;
497 t1 = build_function_type (valtype, newargs);
498 t1 = qualify_type (t1, t2);
499 /* ... falls through ... */
503 return build_type_attribute_variant (t1, attributes);
508 /* Return the type of a conditional expression between pointers to
509 possibly differently qualified versions of compatible types.
511 We assume that comp_target_types has already been done and returned
512 nonzero; if that isn't so, this may crash. */
515 common_pointer_type (tree t1, tree t2)
518 tree pointed_to_1, mv1;
519 tree pointed_to_2, mv2;
522 /* Save time if the two types are the same. */
524 if (t1 == t2) return t1;
526 /* If one type is nonsense, use the other. */
527 if (t1 == error_mark_node)
529 if (t2 == error_mark_node)
532 gcc_assert (TREE_CODE (t1) == POINTER_TYPE
533 && TREE_CODE (t2) == POINTER_TYPE);
535 /* Merge the attributes. */
536 attributes = targetm.merge_type_attributes (t1, t2);
538 /* Find the composite type of the target types, and combine the
539 qualifiers of the two types' targets. Do not lose qualifiers on
540 array element types by taking the TYPE_MAIN_VARIANT. */
541 mv1 = pointed_to_1 = TREE_TYPE (t1);
542 mv2 = pointed_to_2 = TREE_TYPE (t2);
543 if (TREE_CODE (mv1) != ARRAY_TYPE)
544 mv1 = TYPE_MAIN_VARIANT (pointed_to_1);
545 if (TREE_CODE (mv2) != ARRAY_TYPE)
546 mv2 = TYPE_MAIN_VARIANT (pointed_to_2);
547 target = composite_type (mv1, mv2);
548 t1 = build_pointer_type (c_build_qualified_type
550 TYPE_QUALS (pointed_to_1) |
551 TYPE_QUALS (pointed_to_2)));
552 return build_type_attribute_variant (t1, attributes);
555 /* Return the common type for two arithmetic types under the usual
556 arithmetic conversions. The default conversions have already been
557 applied, and enumerated types converted to their compatible integer
558 types. The resulting type is unqualified and has no attributes.
560 This is the type for the result of most arithmetic operations
561 if the operands have the given two types. */
564 c_common_type (tree t1, tree t2)
566 enum tree_code code1;
567 enum tree_code code2;
569 /* If one type is nonsense, use the other. */
570 if (t1 == error_mark_node)
572 if (t2 == error_mark_node)
575 if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
576 t1 = TYPE_MAIN_VARIANT (t1);
578 if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
579 t2 = TYPE_MAIN_VARIANT (t2);
581 if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
582 t1 = build_type_attribute_variant (t1, NULL_TREE);
584 if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
585 t2 = build_type_attribute_variant (t2, NULL_TREE);
587 /* Save time if the two types are the same. */
589 if (t1 == t2) return t1;
591 code1 = TREE_CODE (t1);
592 code2 = TREE_CODE (t2);
594 gcc_assert (code1 == VECTOR_TYPE || code1 == COMPLEX_TYPE
595 || code1 == REAL_TYPE || code1 == INTEGER_TYPE);
596 gcc_assert (code2 == VECTOR_TYPE || code2 == COMPLEX_TYPE
597 || code2 == REAL_TYPE || code2 == INTEGER_TYPE);
599 /* When one operand is a decimal float type, the other operand cannot be
600 a generic float type or a complex type. We also disallow vector types
602 if ((DECIMAL_FLOAT_TYPE_P (t1) || DECIMAL_FLOAT_TYPE_P (t2))
603 && !(DECIMAL_FLOAT_TYPE_P (t1) && DECIMAL_FLOAT_TYPE_P (t2)))
605 if (code1 == VECTOR_TYPE || code2 == VECTOR_TYPE)
607 error ("can%'t mix operands of decimal float and vector types");
608 return error_mark_node;
610 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
612 error ("can%'t mix operands of decimal float and complex types");
613 return error_mark_node;
615 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
617 error ("can%'t mix operands of decimal float and other float types");
618 return error_mark_node;
622 /* If one type is a vector type, return that type. (How the usual
623 arithmetic conversions apply to the vector types extension is not
624 precisely specified.) */
625 if (code1 == VECTOR_TYPE)
628 if (code2 == VECTOR_TYPE)
631 /* If one type is complex, form the common type of the non-complex
632 components, then make that complex. Use T1 or T2 if it is the
634 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
636 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
637 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
638 tree subtype = c_common_type (subtype1, subtype2);
640 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
642 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
645 return build_complex_type (subtype);
648 /* If only one is real, use it as the result. */
650 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
653 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
656 /* If both are real and either are decimal floating point types, use
657 the decimal floating point type with the greater precision. */
659 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
661 if (TYPE_MAIN_VARIANT (t1) == dfloat128_type_node
662 || TYPE_MAIN_VARIANT (t2) == dfloat128_type_node)
663 return dfloat128_type_node;
664 else if (TYPE_MAIN_VARIANT (t1) == dfloat64_type_node
665 || TYPE_MAIN_VARIANT (t2) == dfloat64_type_node)
666 return dfloat64_type_node;
667 else if (TYPE_MAIN_VARIANT (t1) == dfloat32_type_node
668 || TYPE_MAIN_VARIANT (t2) == dfloat32_type_node)
669 return dfloat32_type_node;
672 /* Both real or both integers; use the one with greater precision. */
674 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
676 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
679 /* Same precision. Prefer long longs to longs to ints when the
680 same precision, following the C99 rules on integer type rank
681 (which are equivalent to the C90 rules for C90 types). */
683 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
684 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
685 return long_long_unsigned_type_node;
687 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
688 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
690 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
691 return long_long_unsigned_type_node;
693 return long_long_integer_type_node;
696 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
697 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
698 return long_unsigned_type_node;
700 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
701 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
703 /* But preserve unsignedness from the other type,
704 since long cannot hold all the values of an unsigned int. */
705 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
706 return long_unsigned_type_node;
708 return long_integer_type_node;
711 /* Likewise, prefer long double to double even if same size. */
712 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
713 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
714 return long_double_type_node;
716 /* Otherwise prefer the unsigned one. */
718 if (TYPE_UNSIGNED (t1))
724 /* Wrapper around c_common_type that is used by c-common.c and other
725 front end optimizations that remove promotions. ENUMERAL_TYPEs
726 are allowed here and are converted to their compatible integer types.
727 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
728 preferably a non-Boolean type as the common type. */
730 common_type (tree t1, tree t2)
732 if (TREE_CODE (t1) == ENUMERAL_TYPE)
733 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
734 if (TREE_CODE (t2) == ENUMERAL_TYPE)
735 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
737 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
738 if (TREE_CODE (t1) == BOOLEAN_TYPE
739 && TREE_CODE (t2) == BOOLEAN_TYPE)
740 return boolean_type_node;
742 /* If either type is BOOLEAN_TYPE, then return the other. */
743 if (TREE_CODE (t1) == BOOLEAN_TYPE)
745 if (TREE_CODE (t2) == BOOLEAN_TYPE)
748 return c_common_type (t1, t2);
751 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
752 or various other operations. Return 2 if they are compatible
753 but a warning may be needed if you use them together. */
756 comptypes (tree type1, tree type2)
758 const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
761 val = comptypes_internal (type1, type2);
762 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
767 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
768 or various other operations. Return 2 if they are compatible
769 but a warning may be needed if you use them together. This
770 differs from comptypes, in that we don't free the seen types. */
773 comptypes_internal (tree type1, tree type2)
779 /* Suppress errors caused by previously reported errors. */
781 if (t1 == t2 || !t1 || !t2
782 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
785 /* If either type is the internal version of sizetype, return the
787 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
788 && TYPE_ORIG_SIZE_TYPE (t1))
789 t1 = TYPE_ORIG_SIZE_TYPE (t1);
791 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
792 && TYPE_ORIG_SIZE_TYPE (t2))
793 t2 = TYPE_ORIG_SIZE_TYPE (t2);
796 /* Enumerated types are compatible with integer types, but this is
797 not transitive: two enumerated types in the same translation unit
798 are compatible with each other only if they are the same type. */
800 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
801 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
802 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
803 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
808 /* Different classes of types can't be compatible. */
810 if (TREE_CODE (t1) != TREE_CODE (t2))
813 /* Qualifiers must match. C99 6.7.3p9 */
815 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
818 /* Allow for two different type nodes which have essentially the same
819 definition. Note that we already checked for equality of the type
820 qualifiers (just above). */
822 if (TREE_CODE (t1) != ARRAY_TYPE
823 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
826 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
827 if (!(attrval = targetm.comp_type_attributes (t1, t2)))
830 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
833 switch (TREE_CODE (t1))
836 /* Do not remove mode or aliasing information. */
837 if (TYPE_MODE (t1) != TYPE_MODE (t2)
838 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
840 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
841 ? 1 : comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2)));
845 val = function_types_compatible_p (t1, t2);
850 tree d1 = TYPE_DOMAIN (t1);
851 tree d2 = TYPE_DOMAIN (t2);
852 bool d1_variable, d2_variable;
853 bool d1_zero, d2_zero;
856 /* Target types must match incl. qualifiers. */
857 if (TREE_TYPE (t1) != TREE_TYPE (t2)
858 && 0 == (val = comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2))))
861 /* Sizes must match unless one is missing or variable. */
862 if (d1 == 0 || d2 == 0 || d1 == d2)
865 d1_zero = !TYPE_MAX_VALUE (d1);
866 d2_zero = !TYPE_MAX_VALUE (d2);
868 d1_variable = (!d1_zero
869 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
870 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
871 d2_variable = (!d2_zero
872 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
873 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
874 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
875 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
877 if (d1_variable || d2_variable)
879 if (d1_zero && d2_zero)
881 if (d1_zero || d2_zero
882 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
883 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
892 if (val != 1 && !same_translation_unit_p (t1, t2))
895 return tagged_types_tu_compatible_p (t1, t2);
896 val = tagged_types_tu_compatible_p (t1, t2);
901 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
902 && comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2));
908 return attrval == 2 && val == 1 ? 2 : val;
911 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
912 ignoring their qualifiers. */
915 comp_target_types (tree ttl, tree ttr)
920 /* Do not lose qualifiers on element types of array types that are
921 pointer targets by taking their TYPE_MAIN_VARIANT. */
922 mvl = TREE_TYPE (ttl);
923 mvr = TREE_TYPE (ttr);
924 if (TREE_CODE (mvl) != ARRAY_TYPE)
925 mvl = TYPE_MAIN_VARIANT (mvl);
926 if (TREE_CODE (mvr) != ARRAY_TYPE)
927 mvr = TYPE_MAIN_VARIANT (mvr);
928 val = comptypes (mvl, mvr);
930 if (val == 2 && pedantic)
931 pedwarn ("types are not quite compatible");
935 /* Subroutines of `comptypes'. */
937 /* Determine whether two trees derive from the same translation unit.
938 If the CONTEXT chain ends in a null, that tree's context is still
939 being parsed, so if two trees have context chains ending in null,
940 they're in the same translation unit. */
942 same_translation_unit_p (tree t1, tree t2)
944 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
945 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
947 case tcc_declaration:
948 t1 = DECL_CONTEXT (t1); break;
950 t1 = TYPE_CONTEXT (t1); break;
951 case tcc_exceptional:
952 t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
953 default: gcc_unreachable ();
956 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
957 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
959 case tcc_declaration:
960 t2 = DECL_CONTEXT (t2); break;
962 t2 = TYPE_CONTEXT (t2); break;
963 case tcc_exceptional:
964 t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
965 default: gcc_unreachable ();
971 /* Allocate the seen two types, assuming that they are compatible. */
973 static struct tagged_tu_seen_cache *
974 alloc_tagged_tu_seen_cache (tree t1, tree t2)
976 struct tagged_tu_seen_cache *tu = XNEW (struct tagged_tu_seen_cache);
977 tu->next = tagged_tu_seen_base;
981 tagged_tu_seen_base = tu;
983 /* The C standard says that two structures in different translation
984 units are compatible with each other only if the types of their
985 fields are compatible (among other things). We assume that they
986 are compatible until proven otherwise when building the cache.
987 An example where this can occur is:
992 If we are comparing this against a similar struct in another TU,
993 and did not assume they were compatible, we end up with an infinite
999 /* Free the seen types until we get to TU_TIL. */
1002 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *tu_til)
1004 const struct tagged_tu_seen_cache *tu = tagged_tu_seen_base;
1005 while (tu != tu_til)
1007 struct tagged_tu_seen_cache *tu1 = (struct tagged_tu_seen_cache*)tu;
1011 tagged_tu_seen_base = tu_til;
1014 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1015 compatible. If the two types are not the same (which has been
1016 checked earlier), this can only happen when multiple translation
1017 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1021 tagged_types_tu_compatible_p (tree t1, tree t2)
1024 bool needs_warning = false;
1026 /* We have to verify that the tags of the types are the same. This
1027 is harder than it looks because this may be a typedef, so we have
1028 to go look at the original type. It may even be a typedef of a
1030 In the case of compiler-created builtin structs the TYPE_DECL
1031 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1032 while (TYPE_NAME (t1)
1033 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
1034 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
1035 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
1037 while (TYPE_NAME (t2)
1038 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
1039 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
1040 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
1042 /* C90 didn't have the requirement that the two tags be the same. */
1043 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
1046 /* C90 didn't say what happened if one or both of the types were
1047 incomplete; we choose to follow C99 rules here, which is that they
1049 if (TYPE_SIZE (t1) == NULL
1050 || TYPE_SIZE (t2) == NULL)
1054 const struct tagged_tu_seen_cache * tts_i;
1055 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
1056 if (tts_i->t1 == t1 && tts_i->t2 == t2)
1060 switch (TREE_CODE (t1))
1064 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1065 /* Speed up the case where the type values are in the same order. */
1066 tree tv1 = TYPE_VALUES (t1);
1067 tree tv2 = TYPE_VALUES (t2);
1074 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
1076 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
1078 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
1085 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
1089 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
1095 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
1101 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
1103 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
1105 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
1116 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1117 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
1123 /* Speed up the common case where the fields are in the same order. */
1124 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2); s1 && s2;
1125 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1130 if (DECL_NAME (s1) == NULL
1131 || DECL_NAME (s1) != DECL_NAME (s2))
1133 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1140 needs_warning = true;
1142 if (TREE_CODE (s1) == FIELD_DECL
1143 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1144 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1152 tu->val = needs_warning ? 2 : 1;
1156 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
1160 if (DECL_NAME (s1) != NULL)
1161 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
1162 if (DECL_NAME (s1) == DECL_NAME (s2))
1165 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1172 needs_warning = true;
1174 if (TREE_CODE (s1) == FIELD_DECL
1175 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1176 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1188 tu->val = needs_warning ? 2 : 10;
1194 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1196 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
1198 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1201 if (TREE_CODE (s1) != TREE_CODE (s2)
1202 || DECL_NAME (s1) != DECL_NAME (s2))
1204 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1208 needs_warning = true;
1210 if (TREE_CODE (s1) == FIELD_DECL
1211 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1212 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1218 tu->val = needs_warning ? 2 : 1;
1227 /* Return 1 if two function types F1 and F2 are compatible.
1228 If either type specifies no argument types,
1229 the other must specify a fixed number of self-promoting arg types.
1230 Otherwise, if one type specifies only the number of arguments,
1231 the other must specify that number of self-promoting arg types.
1232 Otherwise, the argument types must match. */
1235 function_types_compatible_p (tree f1, tree f2)
1238 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1243 ret1 = TREE_TYPE (f1);
1244 ret2 = TREE_TYPE (f2);
1246 /* 'volatile' qualifiers on a function's return type used to mean
1247 the function is noreturn. */
1248 if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1249 pedwarn ("function return types not compatible due to %<volatile%>");
1250 if (TYPE_VOLATILE (ret1))
1251 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1252 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1253 if (TYPE_VOLATILE (ret2))
1254 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1255 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1256 val = comptypes_internal (ret1, ret2);
1260 args1 = TYPE_ARG_TYPES (f1);
1261 args2 = TYPE_ARG_TYPES (f2);
1263 /* An unspecified parmlist matches any specified parmlist
1264 whose argument types don't need default promotions. */
1268 if (!self_promoting_args_p (args2))
1270 /* If one of these types comes from a non-prototype fn definition,
1271 compare that with the other type's arglist.
1272 If they don't match, ask for a warning (but no error). */
1273 if (TYPE_ACTUAL_ARG_TYPES (f1)
1274 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
1280 if (!self_promoting_args_p (args1))
1282 if (TYPE_ACTUAL_ARG_TYPES (f2)
1283 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1288 /* Both types have argument lists: compare them and propagate results. */
1289 val1 = type_lists_compatible_p (args1, args2);
1290 return val1 != 1 ? val1 : val;
1293 /* Check two lists of types for compatibility,
1294 returning 0 for incompatible, 1 for compatible,
1295 or 2 for compatible with warning. */
1298 type_lists_compatible_p (tree args1, tree args2)
1300 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1306 tree a1, mv1, a2, mv2;
1307 if (args1 == 0 && args2 == 0)
1309 /* If one list is shorter than the other,
1310 they fail to match. */
1311 if (args1 == 0 || args2 == 0)
1313 mv1 = a1 = TREE_VALUE (args1);
1314 mv2 = a2 = TREE_VALUE (args2);
1315 if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1316 mv1 = TYPE_MAIN_VARIANT (mv1);
1317 if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1318 mv2 = TYPE_MAIN_VARIANT (mv2);
1319 /* A null pointer instead of a type
1320 means there is supposed to be an argument
1321 but nothing is specified about what type it has.
1322 So match anything that self-promotes. */
1325 if (c_type_promotes_to (a2) != a2)
1330 if (c_type_promotes_to (a1) != a1)
1333 /* If one of the lists has an error marker, ignore this arg. */
1334 else if (TREE_CODE (a1) == ERROR_MARK
1335 || TREE_CODE (a2) == ERROR_MARK)
1337 else if (!(newval = comptypes_internal (mv1, mv2)))
1339 /* Allow wait (union {union wait *u; int *i} *)
1340 and wait (union wait *) to be compatible. */
1341 if (TREE_CODE (a1) == UNION_TYPE
1342 && (TYPE_NAME (a1) == 0
1343 || TYPE_TRANSPARENT_UNION (a1))
1344 && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1345 && tree_int_cst_equal (TYPE_SIZE (a1),
1349 for (memb = TYPE_FIELDS (a1);
1350 memb; memb = TREE_CHAIN (memb))
1352 tree mv3 = TREE_TYPE (memb);
1353 if (mv3 && mv3 != error_mark_node
1354 && TREE_CODE (mv3) != ARRAY_TYPE)
1355 mv3 = TYPE_MAIN_VARIANT (mv3);
1356 if (comptypes_internal (mv3, mv2))
1362 else if (TREE_CODE (a2) == UNION_TYPE
1363 && (TYPE_NAME (a2) == 0
1364 || TYPE_TRANSPARENT_UNION (a2))
1365 && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1366 && tree_int_cst_equal (TYPE_SIZE (a2),
1370 for (memb = TYPE_FIELDS (a2);
1371 memb; memb = TREE_CHAIN (memb))
1373 tree mv3 = TREE_TYPE (memb);
1374 if (mv3 && mv3 != error_mark_node
1375 && TREE_CODE (mv3) != ARRAY_TYPE)
1376 mv3 = TYPE_MAIN_VARIANT (mv3);
1377 if (comptypes_internal (mv3, mv1))
1387 /* comptypes said ok, but record if it said to warn. */
1391 args1 = TREE_CHAIN (args1);
1392 args2 = TREE_CHAIN (args2);
1396 /* Compute the size to increment a pointer by. */
1399 c_size_in_bytes (tree type)
1401 enum tree_code code = TREE_CODE (type);
1403 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1404 return size_one_node;
1406 if (!COMPLETE_OR_VOID_TYPE_P (type))
1408 error ("arithmetic on pointer to an incomplete type");
1409 return size_one_node;
1412 /* Convert in case a char is more than one unit. */
1413 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1414 size_int (TYPE_PRECISION (char_type_node)
1418 /* Return either DECL or its known constant value (if it has one). */
1421 decl_constant_value (tree decl)
1423 if (/* Don't change a variable array bound or initial value to a constant
1424 in a place where a variable is invalid. Note that DECL_INITIAL
1425 isn't valid for a PARM_DECL. */
1426 current_function_decl != 0
1427 && TREE_CODE (decl) != PARM_DECL
1428 && !TREE_THIS_VOLATILE (decl)
1429 && TREE_READONLY (decl)
1430 && DECL_INITIAL (decl) != 0
1431 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1432 /* This is invalid if initial value is not constant.
1433 If it has either a function call, a memory reference,
1434 or a variable, then re-evaluating it could give different results. */
1435 && TREE_CONSTANT (DECL_INITIAL (decl))
1436 /* Check for cases where this is sub-optimal, even though valid. */
1437 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1438 return DECL_INITIAL (decl);
1442 /* Return either DECL or its known constant value (if it has one), but
1443 return DECL if pedantic or DECL has mode BLKmode. This is for
1444 bug-compatibility with the old behavior of decl_constant_value
1445 (before GCC 3.0); every use of this function is a bug and it should
1446 be removed before GCC 3.1. It is not appropriate to use pedantic
1447 in a way that affects optimization, and BLKmode is probably not the
1448 right test for avoiding misoptimizations either. */
1451 decl_constant_value_for_broken_optimization (tree decl)
1455 if (pedantic || DECL_MODE (decl) == BLKmode)
1458 ret = decl_constant_value (decl);
1459 /* Avoid unwanted tree sharing between the initializer and current
1460 function's body where the tree can be modified e.g. by the
1462 if (ret != decl && TREE_STATIC (decl))
1463 ret = unshare_expr (ret);
1467 /* Convert the array expression EXP to a pointer. */
1469 array_to_pointer_conversion (tree exp)
1471 tree orig_exp = exp;
1472 tree type = TREE_TYPE (exp);
1474 tree restype = TREE_TYPE (type);
1477 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1479 STRIP_TYPE_NOPS (exp);
1481 if (TREE_NO_WARNING (orig_exp))
1482 TREE_NO_WARNING (exp) = 1;
1484 ptrtype = build_pointer_type (restype);
1486 if (TREE_CODE (exp) == INDIRECT_REF)
1487 return convert (ptrtype, TREE_OPERAND (exp, 0));
1489 if (TREE_CODE (exp) == VAR_DECL)
1491 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1492 ADDR_EXPR because it's the best way of representing what
1493 happens in C when we take the address of an array and place
1494 it in a pointer to the element type. */
1495 adr = build1 (ADDR_EXPR, ptrtype, exp);
1496 if (!c_mark_addressable (exp))
1497 return error_mark_node;
1498 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1502 /* This way is better for a COMPONENT_REF since it can
1503 simplify the offset for a component. */
1504 adr = build_unary_op (ADDR_EXPR, exp, 1);
1505 return convert (ptrtype, adr);
1508 /* Convert the function expression EXP to a pointer. */
1510 function_to_pointer_conversion (tree exp)
1512 tree orig_exp = exp;
1514 gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1516 STRIP_TYPE_NOPS (exp);
1518 if (TREE_NO_WARNING (orig_exp))
1519 TREE_NO_WARNING (exp) = 1;
1521 return build_unary_op (ADDR_EXPR, exp, 0);
1524 /* Perform the default conversion of arrays and functions to pointers.
1525 Return the result of converting EXP. For any other expression, just
1526 return EXP after removing NOPs. */
1529 default_function_array_conversion (struct c_expr exp)
1531 tree orig_exp = exp.value;
1532 tree type = TREE_TYPE (exp.value);
1533 enum tree_code code = TREE_CODE (type);
1539 bool not_lvalue = false;
1540 bool lvalue_array_p;
1542 while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1543 || TREE_CODE (exp.value) == NOP_EXPR
1544 || TREE_CODE (exp.value) == CONVERT_EXPR)
1545 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1547 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1549 exp.value = TREE_OPERAND (exp.value, 0);
1552 if (TREE_NO_WARNING (orig_exp))
1553 TREE_NO_WARNING (exp.value) = 1;
1555 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1556 if (!flag_isoc99 && !lvalue_array_p)
1558 /* Before C99, non-lvalue arrays do not decay to pointers.
1559 Normally, using such an array would be invalid; but it can
1560 be used correctly inside sizeof or as a statement expression.
1561 Thus, do not give an error here; an error will result later. */
1565 exp.value = array_to_pointer_conversion (exp.value);
1569 exp.value = function_to_pointer_conversion (exp.value);
1572 STRIP_TYPE_NOPS (exp.value);
1573 if (TREE_NO_WARNING (orig_exp))
1574 TREE_NO_WARNING (exp.value) = 1;
1582 /* EXP is an expression of integer type. Apply the integer promotions
1583 to it and return the promoted value. */
1586 perform_integral_promotions (tree exp)
1588 tree type = TREE_TYPE (exp);
1589 enum tree_code code = TREE_CODE (type);
1591 gcc_assert (INTEGRAL_TYPE_P (type));
1593 /* Normally convert enums to int,
1594 but convert wide enums to something wider. */
1595 if (code == ENUMERAL_TYPE)
1597 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1598 TYPE_PRECISION (integer_type_node)),
1599 ((TYPE_PRECISION (type)
1600 >= TYPE_PRECISION (integer_type_node))
1601 && TYPE_UNSIGNED (type)));
1603 return convert (type, exp);
1606 /* ??? This should no longer be needed now bit-fields have their
1608 if (TREE_CODE (exp) == COMPONENT_REF
1609 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1610 /* If it's thinner than an int, promote it like a
1611 c_promoting_integer_type_p, otherwise leave it alone. */
1612 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1613 TYPE_PRECISION (integer_type_node)))
1614 return convert (integer_type_node, exp);
1616 if (c_promoting_integer_type_p (type))
1618 /* Preserve unsignedness if not really getting any wider. */
1619 if (TYPE_UNSIGNED (type)
1620 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1621 return convert (unsigned_type_node, exp);
1623 return convert (integer_type_node, exp);
1630 /* Perform default promotions for C data used in expressions.
1631 Enumeral types or short or char are converted to int.
1632 In addition, manifest constants symbols are replaced by their values. */
1635 default_conversion (tree exp)
1638 tree type = TREE_TYPE (exp);
1639 enum tree_code code = TREE_CODE (type);
1641 /* Functions and arrays have been converted during parsing. */
1642 gcc_assert (code != FUNCTION_TYPE);
1643 if (code == ARRAY_TYPE)
1646 /* Constants can be used directly unless they're not loadable. */
1647 if (TREE_CODE (exp) == CONST_DECL)
1648 exp = DECL_INITIAL (exp);
1650 /* Replace a nonvolatile const static variable with its value unless
1651 it is an array, in which case we must be sure that taking the
1652 address of the array produces consistent results. */
1653 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1655 exp = decl_constant_value_for_broken_optimization (exp);
1656 type = TREE_TYPE (exp);
1659 /* Strip no-op conversions. */
1661 STRIP_TYPE_NOPS (exp);
1663 if (TREE_NO_WARNING (orig_exp))
1664 TREE_NO_WARNING (exp) = 1;
1666 if (INTEGRAL_TYPE_P (type))
1667 return perform_integral_promotions (exp);
1669 if (code == VOID_TYPE)
1671 error ("void value not ignored as it ought to be");
1672 return error_mark_node;
1677 /* Look up COMPONENT in a structure or union DECL.
1679 If the component name is not found, returns NULL_TREE. Otherwise,
1680 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1681 stepping down the chain to the component, which is in the last
1682 TREE_VALUE of the list. Normally the list is of length one, but if
1683 the component is embedded within (nested) anonymous structures or
1684 unions, the list steps down the chain to the component. */
1687 lookup_field (tree decl, tree component)
1689 tree type = TREE_TYPE (decl);
1692 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1693 to the field elements. Use a binary search on this array to quickly
1694 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1695 will always be set for structures which have many elements. */
1697 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1700 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1702 field = TYPE_FIELDS (type);
1704 top = TYPE_LANG_SPECIFIC (type)->s->len;
1705 while (top - bot > 1)
1707 half = (top - bot + 1) >> 1;
1708 field = field_array[bot+half];
1710 if (DECL_NAME (field) == NULL_TREE)
1712 /* Step through all anon unions in linear fashion. */
1713 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1715 field = field_array[bot++];
1716 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1717 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1719 tree anon = lookup_field (field, component);
1722 return tree_cons (NULL_TREE, field, anon);
1726 /* Entire record is only anon unions. */
1730 /* Restart the binary search, with new lower bound. */
1734 if (DECL_NAME (field) == component)
1736 if (DECL_NAME (field) < component)
1742 if (DECL_NAME (field_array[bot]) == component)
1743 field = field_array[bot];
1744 else if (DECL_NAME (field) != component)
1749 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1751 if (DECL_NAME (field) == NULL_TREE
1752 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1753 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1755 tree anon = lookup_field (field, component);
1758 return tree_cons (NULL_TREE, field, anon);
1761 if (DECL_NAME (field) == component)
1765 if (field == NULL_TREE)
1769 return tree_cons (NULL_TREE, field, NULL_TREE);
1772 /* Make an expression to refer to the COMPONENT field of
1773 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1776 build_component_ref (tree datum, tree component)
1778 tree type = TREE_TYPE (datum);
1779 enum tree_code code = TREE_CODE (type);
1783 if (!objc_is_public (datum, component))
1784 return error_mark_node;
1786 /* See if there is a field or component with name COMPONENT. */
1788 if (code == RECORD_TYPE || code == UNION_TYPE)
1790 if (!COMPLETE_TYPE_P (type))
1792 c_incomplete_type_error (NULL_TREE, type);
1793 return error_mark_node;
1796 field = lookup_field (datum, component);
1800 error ("%qT has no member named %qE", type, component);
1801 return error_mark_node;
1804 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1805 This might be better solved in future the way the C++ front
1806 end does it - by giving the anonymous entities each a
1807 separate name and type, and then have build_component_ref
1808 recursively call itself. We can't do that here. */
1811 tree subdatum = TREE_VALUE (field);
1813 if (TREE_TYPE (subdatum) == error_mark_node)
1814 return error_mark_node;
1816 ref = build3 (COMPONENT_REF, TREE_TYPE (subdatum), datum, subdatum,
1818 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1819 TREE_READONLY (ref) = 1;
1820 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1821 TREE_THIS_VOLATILE (ref) = 1;
1823 if (TREE_DEPRECATED (subdatum))
1824 warn_deprecated_use (subdatum);
1828 field = TREE_CHAIN (field);
1834 else if (code != ERROR_MARK)
1835 error ("request for member %qE in something not a structure or union",
1838 return error_mark_node;
1841 /* Given an expression PTR for a pointer, return an expression
1842 for the value pointed to.
1843 ERRORSTRING is the name of the operator to appear in error messages. */
1846 build_indirect_ref (tree ptr, const char *errorstring)
1848 tree pointer = default_conversion (ptr);
1849 tree type = TREE_TYPE (pointer);
1851 if (TREE_CODE (type) == POINTER_TYPE)
1853 if (TREE_CODE (pointer) == ADDR_EXPR
1854 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1855 == TREE_TYPE (type)))
1856 return TREE_OPERAND (pointer, 0);
1859 tree t = TREE_TYPE (type);
1862 ref = build1 (INDIRECT_REF, t, pointer);
1864 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1866 error ("dereferencing pointer to incomplete type");
1867 return error_mark_node;
1869 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1870 warning (0, "dereferencing %<void *%> pointer");
1872 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1873 so that we get the proper error message if the result is used
1874 to assign to. Also, &* is supposed to be a no-op.
1875 And ANSI C seems to specify that the type of the result
1876 should be the const type. */
1877 /* A de-reference of a pointer to const is not a const. It is valid
1878 to change it via some other pointer. */
1879 TREE_READONLY (ref) = TYPE_READONLY (t);
1880 TREE_SIDE_EFFECTS (ref)
1881 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
1882 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1886 else if (TREE_CODE (pointer) != ERROR_MARK)
1887 error ("invalid type argument of %qs", errorstring);
1888 return error_mark_node;
1891 /* This handles expressions of the form "a[i]", which denotes
1894 This is logically equivalent in C to *(a+i), but we may do it differently.
1895 If A is a variable or a member, we generate a primitive ARRAY_REF.
1896 This avoids forcing the array out of registers, and can work on
1897 arrays that are not lvalues (for example, members of structures returned
1901 build_array_ref (tree array, tree index)
1903 bool swapped = false;
1904 if (TREE_TYPE (array) == error_mark_node
1905 || TREE_TYPE (index) == error_mark_node)
1906 return error_mark_node;
1908 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
1909 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
1912 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
1913 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
1915 error ("subscripted value is neither array nor pointer");
1916 return error_mark_node;
1924 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
1926 error ("array subscript is not an integer");
1927 return error_mark_node;
1930 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
1932 error ("subscripted value is pointer to function");
1933 return error_mark_node;
1936 /* ??? Existing practice has been to warn only when the char
1937 index is syntactically the index, not for char[array]. */
1939 warn_array_subscript_with_type_char (index);
1941 /* Apply default promotions *after* noticing character types. */
1942 index = default_conversion (index);
1944 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
1946 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
1950 /* An array that is indexed by a non-constant
1951 cannot be stored in a register; we must be able to do
1952 address arithmetic on its address.
1953 Likewise an array of elements of variable size. */
1954 if (TREE_CODE (index) != INTEGER_CST
1955 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1956 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1958 if (!c_mark_addressable (array))
1959 return error_mark_node;
1961 /* An array that is indexed by a constant value which is not within
1962 the array bounds cannot be stored in a register either; because we
1963 would get a crash in store_bit_field/extract_bit_field when trying
1964 to access a non-existent part of the register. */
1965 if (TREE_CODE (index) == INTEGER_CST
1966 && TYPE_DOMAIN (TREE_TYPE (array))
1967 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
1969 if (!c_mark_addressable (array))
1970 return error_mark_node;
1976 while (TREE_CODE (foo) == COMPONENT_REF)
1977 foo = TREE_OPERAND (foo, 0);
1978 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
1979 pedwarn ("ISO C forbids subscripting %<register%> array");
1980 else if (!flag_isoc99 && !lvalue_p (foo))
1981 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
1984 type = TREE_TYPE (TREE_TYPE (array));
1985 if (TREE_CODE (type) != ARRAY_TYPE)
1986 type = TYPE_MAIN_VARIANT (type);
1987 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
1988 /* Array ref is const/volatile if the array elements are
1989 or if the array is. */
1990 TREE_READONLY (rval)
1991 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
1992 | TREE_READONLY (array));
1993 TREE_SIDE_EFFECTS (rval)
1994 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1995 | TREE_SIDE_EFFECTS (array));
1996 TREE_THIS_VOLATILE (rval)
1997 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1998 /* This was added by rms on 16 Nov 91.
1999 It fixes vol struct foo *a; a->elts[1]
2000 in an inline function.
2001 Hope it doesn't break something else. */
2002 | TREE_THIS_VOLATILE (array));
2003 return require_complete_type (fold (rval));
2007 tree ar = default_conversion (array);
2009 if (ar == error_mark_node)
2012 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
2013 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
2015 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, index, 0),
2020 /* Build an external reference to identifier ID. FUN indicates
2021 whether this will be used for a function call. LOC is the source
2022 location of the identifier. */
2024 build_external_ref (tree id, int fun, location_t loc)
2027 tree decl = lookup_name (id);
2029 /* In Objective-C, an instance variable (ivar) may be preferred to
2030 whatever lookup_name() found. */
2031 decl = objc_lookup_ivar (decl, id);
2033 if (decl && decl != error_mark_node)
2036 /* Implicit function declaration. */
2037 ref = implicitly_declare (id);
2038 else if (decl == error_mark_node)
2039 /* Don't complain about something that's already been
2040 complained about. */
2041 return error_mark_node;
2044 undeclared_variable (id, loc);
2045 return error_mark_node;
2048 if (TREE_TYPE (ref) == error_mark_node)
2049 return error_mark_node;
2051 if (TREE_DEPRECATED (ref))
2052 warn_deprecated_use (ref);
2054 if (!skip_evaluation)
2055 assemble_external (ref);
2056 TREE_USED (ref) = 1;
2058 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2060 if (!in_sizeof && !in_typeof)
2061 C_DECL_USED (ref) = 1;
2062 else if (DECL_INITIAL (ref) == 0
2063 && DECL_EXTERNAL (ref)
2064 && !TREE_PUBLIC (ref))
2065 record_maybe_used_decl (ref);
2068 if (TREE_CODE (ref) == CONST_DECL)
2070 used_types_insert (TREE_TYPE (ref));
2071 ref = DECL_INITIAL (ref);
2072 TREE_CONSTANT (ref) = 1;
2073 TREE_INVARIANT (ref) = 1;
2075 else if (current_function_decl != 0
2076 && !DECL_FILE_SCOPE_P (current_function_decl)
2077 && (TREE_CODE (ref) == VAR_DECL
2078 || TREE_CODE (ref) == PARM_DECL
2079 || TREE_CODE (ref) == FUNCTION_DECL))
2081 tree context = decl_function_context (ref);
2083 if (context != 0 && context != current_function_decl)
2084 DECL_NONLOCAL (ref) = 1;
2090 /* Record details of decls possibly used inside sizeof or typeof. */
2091 struct maybe_used_decl
2095 /* The level seen at (in_sizeof + in_typeof). */
2097 /* The next one at this level or above, or NULL. */
2098 struct maybe_used_decl *next;
2101 static struct maybe_used_decl *maybe_used_decls;
2103 /* Record that DECL, an undefined static function reference seen
2104 inside sizeof or typeof, might be used if the operand of sizeof is
2105 a VLA type or the operand of typeof is a variably modified
2109 record_maybe_used_decl (tree decl)
2111 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2113 t->level = in_sizeof + in_typeof;
2114 t->next = maybe_used_decls;
2115 maybe_used_decls = t;
2118 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2119 USED is false, just discard them. If it is true, mark them used
2120 (if no longer inside sizeof or typeof) or move them to the next
2121 level up (if still inside sizeof or typeof). */
2124 pop_maybe_used (bool used)
2126 struct maybe_used_decl *p = maybe_used_decls;
2127 int cur_level = in_sizeof + in_typeof;
2128 while (p && p->level > cur_level)
2133 C_DECL_USED (p->decl) = 1;
2135 p->level = cur_level;
2139 if (!used || cur_level == 0)
2140 maybe_used_decls = p;
2143 /* Return the result of sizeof applied to EXPR. */
2146 c_expr_sizeof_expr (struct c_expr expr)
2149 if (expr.value == error_mark_node)
2151 ret.value = error_mark_node;
2152 ret.original_code = ERROR_MARK;
2153 pop_maybe_used (false);
2157 ret.value = c_sizeof (TREE_TYPE (expr.value));
2158 ret.original_code = ERROR_MARK;
2159 if (c_vla_type_p (TREE_TYPE (expr.value)))
2161 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2162 ret.value = build2 (COMPOUND_EXPR, TREE_TYPE (ret.value), expr.value, ret.value);
2164 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2169 /* Return the result of sizeof applied to T, a structure for the type
2170 name passed to sizeof (rather than the type itself). */
2173 c_expr_sizeof_type (struct c_type_name *t)
2177 type = groktypename (t);
2178 ret.value = c_sizeof (type);
2179 ret.original_code = ERROR_MARK;
2180 pop_maybe_used (type != error_mark_node
2181 ? C_TYPE_VARIABLE_SIZE (type) : false);
2185 /* Build a function call to function FUNCTION with parameters PARAMS.
2186 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2187 TREE_VALUE of each node is a parameter-expression.
2188 FUNCTION's data type may be a function type or a pointer-to-function. */
2191 build_function_call (tree function, tree params)
2193 tree fntype, fundecl = 0;
2194 tree coerced_params;
2195 tree name = NULL_TREE, result;
2198 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2199 STRIP_TYPE_NOPS (function);
2201 /* Convert anything with function type to a pointer-to-function. */
2202 if (TREE_CODE (function) == FUNCTION_DECL)
2204 /* Implement type-directed function overloading for builtins.
2205 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2206 handle all the type checking. The result is a complete expression
2207 that implements this function call. */
2208 tem = resolve_overloaded_builtin (function, params);
2212 name = DECL_NAME (function);
2215 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2216 function = function_to_pointer_conversion (function);
2218 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2219 expressions, like those used for ObjC messenger dispatches. */
2220 function = objc_rewrite_function_call (function, params);
2222 fntype = TREE_TYPE (function);
2224 if (TREE_CODE (fntype) == ERROR_MARK)
2225 return error_mark_node;
2227 if (!(TREE_CODE (fntype) == POINTER_TYPE
2228 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2230 error ("called object %qE is not a function", function);
2231 return error_mark_node;
2234 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2235 current_function_returns_abnormally = 1;
2237 /* fntype now gets the type of function pointed to. */
2238 fntype = TREE_TYPE (fntype);
2240 /* Check that the function is called through a compatible prototype.
2241 If it is not, replace the call by a trap, wrapped up in a compound
2242 expression if necessary. This has the nice side-effect to prevent
2243 the tree-inliner from generating invalid assignment trees which may
2244 blow up in the RTL expander later. */
2245 if ((TREE_CODE (function) == NOP_EXPR
2246 || TREE_CODE (function) == CONVERT_EXPR)
2247 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2248 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2249 && !comptypes (fntype, TREE_TYPE (tem)))
2251 tree return_type = TREE_TYPE (fntype);
2252 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2255 /* This situation leads to run-time undefined behavior. We can't,
2256 therefore, simply error unless we can prove that all possible
2257 executions of the program must execute the code. */
2258 warning (0, "function called through a non-compatible type");
2260 /* We can, however, treat "undefined" any way we please.
2261 Call abort to encourage the user to fix the program. */
2262 inform ("if this code is reached, the program will abort");
2264 if (VOID_TYPE_P (return_type))
2270 if (AGGREGATE_TYPE_P (return_type))
2271 rhs = build_compound_literal (return_type,
2272 build_constructor (return_type, 0));
2274 rhs = fold_convert (return_type, integer_zero_node);
2276 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2280 /* Convert the parameters to the types declared in the
2281 function prototype, or apply default promotions. */
2284 = convert_arguments (TYPE_ARG_TYPES (fntype), params, function, fundecl);
2286 if (coerced_params == error_mark_node)
2287 return error_mark_node;
2289 /* Check that the arguments to the function are valid. */
2291 check_function_arguments (TYPE_ATTRIBUTES (fntype), coerced_params,
2292 TYPE_ARG_TYPES (fntype));
2294 if (require_constant_value)
2296 result = fold_build3_initializer (CALL_EXPR, TREE_TYPE (fntype),
2297 function, coerced_params, NULL_TREE);
2299 if (TREE_CONSTANT (result)
2300 && (name == NULL_TREE
2301 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2302 pedwarn_init ("initializer element is not constant");
2305 result = fold_build3 (CALL_EXPR, TREE_TYPE (fntype),
2306 function, coerced_params, NULL_TREE);
2308 if (VOID_TYPE_P (TREE_TYPE (result)))
2310 return require_complete_type (result);
2313 /* Convert the argument expressions in the list VALUES
2314 to the types in the list TYPELIST. The result is a list of converted
2315 argument expressions, unless there are too few arguments in which
2316 case it is error_mark_node.
2318 If TYPELIST is exhausted, or when an element has NULL as its type,
2319 perform the default conversions.
2321 PARMLIST is the chain of parm decls for the function being called.
2322 It may be 0, if that info is not available.
2323 It is used only for generating error messages.
2325 FUNCTION is a tree for the called function. It is used only for
2326 error messages, where it is formatted with %qE.
2328 This is also where warnings about wrong number of args are generated.
2330 Both VALUES and the returned value are chains of TREE_LIST nodes
2331 with the elements of the list in the TREE_VALUE slots of those nodes. */
2334 convert_arguments (tree typelist, tree values, tree function, tree fundecl)
2336 tree typetail, valtail;
2341 /* Change pointer to function to the function itself for
2343 if (TREE_CODE (function) == ADDR_EXPR
2344 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2345 function = TREE_OPERAND (function, 0);
2347 /* Handle an ObjC selector specially for diagnostics. */
2348 selector = objc_message_selector ();
2350 /* Scan the given expressions and types, producing individual
2351 converted arguments and pushing them on RESULT in reverse order. */
2353 for (valtail = values, typetail = typelist, parmnum = 0;
2355 valtail = TREE_CHAIN (valtail), parmnum++)
2357 tree type = typetail ? TREE_VALUE (typetail) : 0;
2358 tree val = TREE_VALUE (valtail);
2359 tree rname = function;
2360 int argnum = parmnum + 1;
2361 const char *invalid_func_diag;
2363 if (type == void_type_node)
2365 error ("too many arguments to function %qE", function);
2369 if (selector && argnum > 2)
2375 STRIP_TYPE_NOPS (val);
2377 val = require_complete_type (val);
2381 /* Formal parm type is specified by a function prototype. */
2384 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2386 error ("type of formal parameter %d is incomplete", parmnum + 1);
2391 /* Optionally warn about conversions that
2392 differ from the default conversions. */
2393 if (warn_conversion || warn_traditional)
2395 unsigned int formal_prec = TYPE_PRECISION (type);
2397 if (INTEGRAL_TYPE_P (type)
2398 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2399 warning (0, "passing argument %d of %qE as integer "
2400 "rather than floating due to prototype",
2402 if (INTEGRAL_TYPE_P (type)
2403 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2404 warning (0, "passing argument %d of %qE as integer "
2405 "rather than complex due to prototype",
2407 else if (TREE_CODE (type) == COMPLEX_TYPE
2408 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2409 warning (0, "passing argument %d of %qE as complex "
2410 "rather than floating due to prototype",
2412 else if (TREE_CODE (type) == REAL_TYPE
2413 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2414 warning (0, "passing argument %d of %qE as floating "
2415 "rather than integer due to prototype",
2417 else if (TREE_CODE (type) == COMPLEX_TYPE
2418 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2419 warning (0, "passing argument %d of %qE as complex "
2420 "rather than integer due to prototype",
2422 else if (TREE_CODE (type) == REAL_TYPE
2423 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2424 warning (0, "passing argument %d of %qE as floating "
2425 "rather than complex due to prototype",
2427 /* ??? At some point, messages should be written about
2428 conversions between complex types, but that's too messy
2430 else if (TREE_CODE (type) == REAL_TYPE
2431 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2433 /* Warn if any argument is passed as `float',
2434 since without a prototype it would be `double'. */
2435 if (formal_prec == TYPE_PRECISION (float_type_node)
2436 && type != dfloat32_type_node)
2437 warning (0, "passing argument %d of %qE as %<float%> "
2438 "rather than %<double%> due to prototype",
2441 /* Warn if mismatch between argument and prototype
2442 for decimal float types. Warn of conversions with
2443 binary float types and of precision narrowing due to
2445 else if (type != TREE_TYPE (val)
2446 && (type == dfloat32_type_node
2447 || type == dfloat64_type_node
2448 || type == dfloat128_type_node
2449 || TREE_TYPE (val) == dfloat32_type_node
2450 || TREE_TYPE (val) == dfloat64_type_node
2451 || TREE_TYPE (val) == dfloat128_type_node)
2453 <= TYPE_PRECISION (TREE_TYPE (val))
2454 || (type == dfloat128_type_node
2456 != dfloat64_type_node
2458 != dfloat32_type_node)))
2459 || (type == dfloat64_type_node
2461 != dfloat32_type_node))))
2462 warning (0, "passing argument %d of %qE as %qT "
2463 "rather than %qT due to prototype",
2464 argnum, rname, type, TREE_TYPE (val));
2467 /* Detect integer changing in width or signedness.
2468 These warnings are only activated with
2469 -Wconversion, not with -Wtraditional. */
2470 else if (warn_conversion && INTEGRAL_TYPE_P (type)
2471 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2473 tree would_have_been = default_conversion (val);
2474 tree type1 = TREE_TYPE (would_have_been);
2476 if (TREE_CODE (type) == ENUMERAL_TYPE
2477 && (TYPE_MAIN_VARIANT (type)
2478 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2479 /* No warning if function asks for enum
2480 and the actual arg is that enum type. */
2482 else if (formal_prec != TYPE_PRECISION (type1))
2483 warning (OPT_Wconversion, "passing argument %d of %qE "
2484 "with different width due to prototype",
2486 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2488 /* Don't complain if the formal parameter type
2489 is an enum, because we can't tell now whether
2490 the value was an enum--even the same enum. */
2491 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2493 else if (TREE_CODE (val) == INTEGER_CST
2494 && int_fits_type_p (val, type))
2495 /* Change in signedness doesn't matter
2496 if a constant value is unaffected. */
2498 /* If the value is extended from a narrower
2499 unsigned type, it doesn't matter whether we
2500 pass it as signed or unsigned; the value
2501 certainly is the same either way. */
2502 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2503 && TYPE_UNSIGNED (TREE_TYPE (val)))
2505 else if (TYPE_UNSIGNED (type))
2506 warning (OPT_Wconversion, "passing argument %d of %qE "
2507 "as unsigned due to prototype",
2510 warning (OPT_Wconversion, "passing argument %d of %qE "
2511 "as signed due to prototype", argnum, rname);
2515 parmval = convert_for_assignment (type, val, ic_argpass,
2519 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2520 && INTEGRAL_TYPE_P (type)
2521 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2522 parmval = default_conversion (parmval);
2524 result = tree_cons (NULL_TREE, parmval, result);
2526 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2527 && (TYPE_PRECISION (TREE_TYPE (val))
2528 < TYPE_PRECISION (double_type_node))
2529 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2530 /* Convert `float' to `double'. */
2531 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
2532 else if ((invalid_func_diag =
2533 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2535 error (invalid_func_diag);
2536 return error_mark_node;
2539 /* Convert `short' and `char' to full-size `int'. */
2540 result = tree_cons (NULL_TREE, default_conversion (val), result);
2543 typetail = TREE_CHAIN (typetail);
2546 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2548 error ("too few arguments to function %qE", function);
2549 return error_mark_node;
2552 return nreverse (result);
2555 /* This is the entry point used by the parser to build unary operators
2556 in the input. CODE, a tree_code, specifies the unary operator, and
2557 ARG is the operand. For unary plus, the C parser currently uses
2558 CONVERT_EXPR for code. */
2561 parser_build_unary_op (enum tree_code code, struct c_expr arg)
2563 struct c_expr result;
2565 result.original_code = ERROR_MARK;
2566 result.value = build_unary_op (code, arg.value, 0);
2567 overflow_warning (result.value);
2571 /* This is the entry point used by the parser to build binary operators
2572 in the input. CODE, a tree_code, specifies the binary operator, and
2573 ARG1 and ARG2 are the operands. In addition to constructing the
2574 expression, we check for operands that were written with other binary
2575 operators in a way that is likely to confuse the user. */
2578 parser_build_binary_op (enum tree_code code, struct c_expr arg1,
2581 struct c_expr result;
2583 enum tree_code code1 = arg1.original_code;
2584 enum tree_code code2 = arg2.original_code;
2586 result.value = build_binary_op (code, arg1.value, arg2.value, 1);
2587 result.original_code = code;
2589 if (TREE_CODE (result.value) == ERROR_MARK)
2592 /* Check for cases such as x+y<<z which users are likely
2594 if (warn_parentheses)
2596 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
2598 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2599 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2600 warning (OPT_Wparentheses,
2601 "suggest parentheses around + or - inside shift");
2604 if (code == TRUTH_ORIF_EXPR)
2606 if (code1 == TRUTH_ANDIF_EXPR
2607 || code2 == TRUTH_ANDIF_EXPR)
2608 warning (OPT_Wparentheses,
2609 "suggest parentheses around && within ||");
2612 if (code == BIT_IOR_EXPR)
2614 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
2615 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2616 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
2617 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2618 warning (OPT_Wparentheses,
2619 "suggest parentheses around arithmetic in operand of |");
2620 /* Check cases like x|y==z */
2621 if (TREE_CODE_CLASS (code1) == tcc_comparison
2622 || TREE_CODE_CLASS (code2) == tcc_comparison)
2623 warning (OPT_Wparentheses,
2624 "suggest parentheses around comparison in operand of |");
2627 if (code == BIT_XOR_EXPR)
2629 if (code1 == BIT_AND_EXPR
2630 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2631 || code2 == BIT_AND_EXPR
2632 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2633 warning (OPT_Wparentheses,
2634 "suggest parentheses around arithmetic in operand of ^");
2635 /* Check cases like x^y==z */
2636 if (TREE_CODE_CLASS (code1) == tcc_comparison
2637 || TREE_CODE_CLASS (code2) == tcc_comparison)
2638 warning (OPT_Wparentheses,
2639 "suggest parentheses around comparison in operand of ^");
2642 if (code == BIT_AND_EXPR)
2644 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2645 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2646 warning (OPT_Wparentheses,
2647 "suggest parentheses around + or - in operand of &");
2648 /* Check cases like x&y==z */
2649 if (TREE_CODE_CLASS (code1) == tcc_comparison
2650 || TREE_CODE_CLASS (code2) == tcc_comparison)
2651 warning (OPT_Wparentheses,
2652 "suggest parentheses around comparison in operand of &");
2654 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
2655 if (TREE_CODE_CLASS (code) == tcc_comparison
2656 && (TREE_CODE_CLASS (code1) == tcc_comparison
2657 || TREE_CODE_CLASS (code2) == tcc_comparison))
2658 warning (OPT_Wparentheses, "comparisons like X<=Y<=Z do not "
2659 "have their mathematical meaning");
2663 /* Warn about comparisons against string literals, with the exception
2664 of testing for equality or inequality of a string literal with NULL. */
2665 if (code == EQ_EXPR || code == NE_EXPR)
2667 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2668 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2669 warning (OPT_Wstring_literal_comparison,
2670 "comparison with string literal");
2672 else if (TREE_CODE_CLASS (code) == tcc_comparison
2673 && (code1 == STRING_CST || code2 == STRING_CST))
2674 warning (OPT_Wstring_literal_comparison,
2675 "comparison with string literal");
2677 overflow_warning (result.value);
2682 /* Return a tree for the difference of pointers OP0 and OP1.
2683 The resulting tree has type int. */
2686 pointer_diff (tree op0, tree op1)
2688 tree restype = ptrdiff_type_node;
2690 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2691 tree con0, con1, lit0, lit1;
2692 tree orig_op1 = op1;
2694 if (pedantic || warn_pointer_arith)
2696 if (TREE_CODE (target_type) == VOID_TYPE)
2697 pedwarn ("pointer of type %<void *%> used in subtraction");
2698 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2699 pedwarn ("pointer to a function used in subtraction");
2702 /* If the conversion to ptrdiff_type does anything like widening or
2703 converting a partial to an integral mode, we get a convert_expression
2704 that is in the way to do any simplifications.
2705 (fold-const.c doesn't know that the extra bits won't be needed.
2706 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2707 different mode in place.)
2708 So first try to find a common term here 'by hand'; we want to cover
2709 at least the cases that occur in legal static initializers. */
2710 if ((TREE_CODE (op0) == NOP_EXPR || TREE_CODE (op0) == CONVERT_EXPR)
2711 && (TYPE_PRECISION (TREE_TYPE (op0))
2712 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2713 con0 = TREE_OPERAND (op0, 0);
2716 if ((TREE_CODE (op1) == NOP_EXPR || TREE_CODE (op1) == CONVERT_EXPR)
2717 && (TYPE_PRECISION (TREE_TYPE (op1))
2718 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2719 con1 = TREE_OPERAND (op1, 0);
2723 if (TREE_CODE (con0) == PLUS_EXPR)
2725 lit0 = TREE_OPERAND (con0, 1);
2726 con0 = TREE_OPERAND (con0, 0);
2729 lit0 = integer_zero_node;
2731 if (TREE_CODE (con1) == PLUS_EXPR)
2733 lit1 = TREE_OPERAND (con1, 1);
2734 con1 = TREE_OPERAND (con1, 0);
2737 lit1 = integer_zero_node;
2739 if (operand_equal_p (con0, con1, 0))
2746 /* First do the subtraction as integers;
2747 then drop through to build the divide operator.
2748 Do not do default conversions on the minus operator
2749 in case restype is a short type. */
2751 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2752 convert (restype, op1), 0);
2753 /* This generates an error if op1 is pointer to incomplete type. */
2754 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2755 error ("arithmetic on pointer to an incomplete type");
2757 /* This generates an error if op0 is pointer to incomplete type. */
2758 op1 = c_size_in_bytes (target_type);
2760 /* Divide by the size, in easiest possible way. */
2761 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2764 /* Construct and perhaps optimize a tree representation
2765 for a unary operation. CODE, a tree_code, specifies the operation
2766 and XARG is the operand.
2767 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2768 the default promotions (such as from short to int).
2769 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2770 allows non-lvalues; this is only used to handle conversion of non-lvalue
2771 arrays to pointers in C99. */
2774 build_unary_op (enum tree_code code, tree xarg, int flag)
2776 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2779 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2781 int noconvert = flag;
2782 const char *invalid_op_diag;
2784 if (typecode == ERROR_MARK)
2785 return error_mark_node;
2786 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2787 typecode = INTEGER_TYPE;
2789 if ((invalid_op_diag
2790 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2792 error (invalid_op_diag);
2793 return error_mark_node;
2799 /* This is used for unary plus, because a CONVERT_EXPR
2800 is enough to prevent anybody from looking inside for
2801 associativity, but won't generate any code. */
2802 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2803 || typecode == COMPLEX_TYPE
2804 || typecode == VECTOR_TYPE))
2806 error ("wrong type argument to unary plus");
2807 return error_mark_node;
2809 else if (!noconvert)
2810 arg = default_conversion (arg);
2811 arg = non_lvalue (arg);
2815 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2816 || typecode == COMPLEX_TYPE
2817 || typecode == VECTOR_TYPE))
2819 error ("wrong type argument to unary minus");
2820 return error_mark_node;
2822 else if (!noconvert)
2823 arg = default_conversion (arg);
2827 if (typecode == INTEGER_TYPE || typecode == VECTOR_TYPE)
2830 arg = default_conversion (arg);
2832 else if (typecode == COMPLEX_TYPE)
2836 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2838 arg = default_conversion (arg);
2842 error ("wrong type argument to bit-complement");
2843 return error_mark_node;
2848 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2850 error ("wrong type argument to abs");
2851 return error_mark_node;
2853 else if (!noconvert)
2854 arg = default_conversion (arg);
2858 /* Conjugating a real value is a no-op, but allow it anyway. */
2859 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2860 || typecode == COMPLEX_TYPE))
2862 error ("wrong type argument to conjugation");
2863 return error_mark_node;
2865 else if (!noconvert)
2866 arg = default_conversion (arg);
2869 case TRUTH_NOT_EXPR:
2870 if (typecode != INTEGER_TYPE
2871 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2872 && typecode != COMPLEX_TYPE)
2874 error ("wrong type argument to unary exclamation mark");
2875 return error_mark_node;
2877 arg = c_objc_common_truthvalue_conversion (arg);
2878 return invert_truthvalue (arg);
2881 if (TREE_CODE (arg) == COMPLEX_CST)
2882 return TREE_REALPART (arg);
2883 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2884 return fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2889 if (TREE_CODE (arg) == COMPLEX_CST)
2890 return TREE_IMAGPART (arg);
2891 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2892 return fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2894 return convert (TREE_TYPE (arg), integer_zero_node);
2896 case PREINCREMENT_EXPR:
2897 case POSTINCREMENT_EXPR:
2898 case PREDECREMENT_EXPR:
2899 case POSTDECREMENT_EXPR:
2901 /* Increment or decrement the real part of the value,
2902 and don't change the imaginary part. */
2903 if (typecode == COMPLEX_TYPE)
2908 pedwarn ("ISO C does not support %<++%> and %<--%>"
2909 " on complex types");
2911 arg = stabilize_reference (arg);
2912 real = build_unary_op (REALPART_EXPR, arg, 1);
2913 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2914 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
2915 build_unary_op (code, real, 1), imag);
2918 /* Report invalid types. */
2920 if (typecode != POINTER_TYPE
2921 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2923 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2924 error ("wrong type argument to increment");
2926 error ("wrong type argument to decrement");
2928 return error_mark_node;
2933 tree result_type = TREE_TYPE (arg);
2935 arg = get_unwidened (arg, 0);
2936 argtype = TREE_TYPE (arg);
2938 /* Compute the increment. */
2940 if (typecode == POINTER_TYPE)
2942 /* If pointer target is an undefined struct,
2943 we just cannot know how to do the arithmetic. */
2944 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2946 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2947 error ("increment of pointer to unknown structure");
2949 error ("decrement of pointer to unknown structure");
2951 else if ((pedantic || warn_pointer_arith)
2952 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2953 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2955 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2956 pedwarn ("wrong type argument to increment");
2958 pedwarn ("wrong type argument to decrement");
2961 inc = c_size_in_bytes (TREE_TYPE (result_type));
2964 inc = integer_one_node;
2966 inc = convert (argtype, inc);
2968 /* Complain about anything else that is not a true lvalue. */
2969 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
2970 || code == POSTINCREMENT_EXPR)
2973 return error_mark_node;
2975 /* Report a read-only lvalue. */
2976 if (TREE_READONLY (arg))
2978 readonly_error (arg,
2979 ((code == PREINCREMENT_EXPR
2980 || code == POSTINCREMENT_EXPR)
2981 ? lv_increment : lv_decrement));
2982 return error_mark_node;
2985 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2986 val = boolean_increment (code, arg);
2988 val = build2 (code, TREE_TYPE (arg), arg, inc);
2989 TREE_SIDE_EFFECTS (val) = 1;
2990 val = convert (result_type, val);
2991 if (TREE_CODE (val) != code)
2992 TREE_NO_WARNING (val) = 1;
2997 /* Note that this operation never does default_conversion. */
2999 /* Let &* cancel out to simplify resulting code. */
3000 if (TREE_CODE (arg) == INDIRECT_REF)
3002 /* Don't let this be an lvalue. */
3003 if (lvalue_p (TREE_OPERAND (arg, 0)))
3004 return non_lvalue (TREE_OPERAND (arg, 0));
3005 return TREE_OPERAND (arg, 0);
3008 /* For &x[y], return x+y */
3009 if (TREE_CODE (arg) == ARRAY_REF)
3011 tree op0 = TREE_OPERAND (arg, 0);
3012 if (!c_mark_addressable (op0))
3013 return error_mark_node;
3014 return build_binary_op (PLUS_EXPR,
3015 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3016 ? array_to_pointer_conversion (op0)
3018 TREE_OPERAND (arg, 1), 1);
3021 /* Anything not already handled and not a true memory reference
3022 or a non-lvalue array is an error. */
3023 else if (typecode != FUNCTION_TYPE && !flag
3024 && !lvalue_or_else (arg, lv_addressof))
3025 return error_mark_node;
3027 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3028 argtype = TREE_TYPE (arg);
3030 /* If the lvalue is const or volatile, merge that into the type
3031 to which the address will point. Note that you can't get a
3032 restricted pointer by taking the address of something, so we
3033 only have to deal with `const' and `volatile' here. */
3034 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3035 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3036 argtype = c_build_type_variant (argtype,
3037 TREE_READONLY (arg),
3038 TREE_THIS_VOLATILE (arg));
3040 if (!c_mark_addressable (arg))
3041 return error_mark_node;
3043 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3044 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3046 argtype = build_pointer_type (argtype);
3048 /* ??? Cope with user tricks that amount to offsetof. Delete this
3049 when we have proper support for integer constant expressions. */
3050 val = get_base_address (arg);
3051 if (val && TREE_CODE (val) == INDIRECT_REF
3052 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3054 tree op0 = fold_convert (argtype, fold_offsetof (arg)), op1;
3056 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3057 return fold_build2 (PLUS_EXPR, argtype, op0, op1);
3060 val = build1 (ADDR_EXPR, argtype, arg);
3069 argtype = TREE_TYPE (arg);
3070 return require_constant_value ? fold_build1_initializer (code, argtype, arg)
3071 : fold_build1 (code, argtype, arg);
3074 /* Return nonzero if REF is an lvalue valid for this language.
3075 Lvalues can be assigned, unless their type has TYPE_READONLY.
3076 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3081 enum tree_code code = TREE_CODE (ref);
3088 return lvalue_p (TREE_OPERAND (ref, 0));
3090 case COMPOUND_LITERAL_EXPR:
3100 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3101 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3104 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3111 /* Give an error for storing in something that is 'const'. */
3114 readonly_error (tree arg, enum lvalue_use use)
3116 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3118 /* Using this macro rather than (for example) arrays of messages
3119 ensures that all the format strings are checked at compile
3121 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3122 : (use == lv_increment ? (I) \
3123 : (use == lv_decrement ? (D) : (AS))))
3124 if (TREE_CODE (arg) == COMPONENT_REF)
3126 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3127 readonly_error (TREE_OPERAND (arg, 0), use);
3129 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3130 G_("increment of read-only member %qD"),
3131 G_("decrement of read-only member %qD"),
3132 G_("read-only member %qD used as %<asm%> output")),
3133 TREE_OPERAND (arg, 1));
3135 else if (TREE_CODE (arg) == VAR_DECL)
3136 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3137 G_("increment of read-only variable %qD"),
3138 G_("decrement of read-only variable %qD"),
3139 G_("read-only variable %qD used as %<asm%> output")),
3142 error (READONLY_MSG (G_("assignment of read-only location"),
3143 G_("increment of read-only location"),
3144 G_("decrement of read-only location"),
3145 G_("read-only location used as %<asm%> output")));
3149 /* Return nonzero if REF is an lvalue valid for this language;
3150 otherwise, print an error message and return zero. USE says
3151 how the lvalue is being used and so selects the error message. */
3154 lvalue_or_else (tree ref, enum lvalue_use use)
3156 int win = lvalue_p (ref);
3164 /* Mark EXP saying that we need to be able to take the
3165 address of it; it should not be allocated in a register.
3166 Returns true if successful. */
3169 c_mark_addressable (tree exp)
3174 switch (TREE_CODE (x))
3177 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3180 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3184 /* ... fall through ... */
3190 x = TREE_OPERAND (x, 0);
3193 case COMPOUND_LITERAL_EXPR:
3195 TREE_ADDRESSABLE (x) = 1;
3202 if (C_DECL_REGISTER (x)
3203 && DECL_NONLOCAL (x))
3205 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3208 ("global register variable %qD used in nested function", x);
3211 pedwarn ("register variable %qD used in nested function", x);
3213 else if (C_DECL_REGISTER (x))
3215 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3216 error ("address of global register variable %qD requested", x);
3218 error ("address of register variable %qD requested", x);
3224 TREE_ADDRESSABLE (x) = 1;
3231 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3234 build_conditional_expr (tree ifexp, tree op1, tree op2)
3238 enum tree_code code1;
3239 enum tree_code code2;
3240 tree result_type = NULL;
3241 tree orig_op1 = op1, orig_op2 = op2;
3243 /* Promote both alternatives. */
3245 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3246 op1 = default_conversion (op1);
3247 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3248 op2 = default_conversion (op2);
3250 if (TREE_CODE (ifexp) == ERROR_MARK
3251 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3252 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3253 return error_mark_node;
3255 type1 = TREE_TYPE (op1);
3256 code1 = TREE_CODE (type1);
3257 type2 = TREE_TYPE (op2);
3258 code2 = TREE_CODE (type2);
3260 /* C90 does not permit non-lvalue arrays in conditional expressions.
3261 In C99 they will be pointers by now. */
3262 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3264 error ("non-lvalue array in conditional expression");
3265 return error_mark_node;
3268 /* Quickly detect the usual case where op1 and op2 have the same type
3270 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3273 result_type = type1;
3275 result_type = TYPE_MAIN_VARIANT (type1);
3277 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3278 || code1 == COMPLEX_TYPE)
3279 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3280 || code2 == COMPLEX_TYPE))
3282 result_type = c_common_type (type1, type2);
3284 /* If -Wsign-compare, warn here if type1 and type2 have
3285 different signedness. We'll promote the signed to unsigned
3286 and later code won't know it used to be different.
3287 Do this check on the original types, so that explicit casts
3288 will be considered, but default promotions won't. */
3289 if (warn_sign_compare && !skip_evaluation)
3291 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3292 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3294 if (unsigned_op1 ^ unsigned_op2)
3296 /* Do not warn if the result type is signed, since the
3297 signed type will only be chosen if it can represent
3298 all the values of the unsigned type. */
3299 if (!TYPE_UNSIGNED (result_type))
3301 /* Do not warn if the signed quantity is an unsuffixed
3302 integer literal (or some static constant expression
3303 involving such literals) and it is non-negative. */
3304 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
3305 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
3308 warning (0, "signed and unsigned type in conditional expression");
3312 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3314 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3315 pedwarn ("ISO C forbids conditional expr with only one void side");
3316 result_type = void_type_node;
3318 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3320 if (comp_target_types (type1, type2))
3321 result_type = common_pointer_type (type1, type2);
3322 else if (null_pointer_constant_p (orig_op1))
3323 result_type = qualify_type (type2, type1);
3324 else if (null_pointer_constant_p (orig_op2))
3325 result_type = qualify_type (type1, type2);
3326 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3328 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3329 pedwarn ("ISO C forbids conditional expr between "
3330 "%<void *%> and function pointer");
3331 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3332 TREE_TYPE (type2)));
3334 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3336 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3337 pedwarn ("ISO C forbids conditional expr between "
3338 "%<void *%> and function pointer");
3339 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3340 TREE_TYPE (type1)));
3344 pedwarn ("pointer type mismatch in conditional expression");
3345 result_type = build_pointer_type (void_type_node);
3348 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3350 if (!null_pointer_constant_p (orig_op2))
3351 pedwarn ("pointer/integer type mismatch in conditional expression");
3354 op2 = null_pointer_node;
3356 result_type = type1;
3358 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3360 if (!null_pointer_constant_p (orig_op1))
3361 pedwarn ("pointer/integer type mismatch in conditional expression");
3364 op1 = null_pointer_node;
3366 result_type = type2;
3371 if (flag_cond_mismatch)
3372 result_type = void_type_node;
3375 error ("type mismatch in conditional expression");
3376 return error_mark_node;
3380 /* Merge const and volatile flags of the incoming types. */
3382 = build_type_variant (result_type,
3383 TREE_READONLY (op1) || TREE_READONLY (op2),
3384 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3386 if (result_type != TREE_TYPE (op1))
3387 op1 = convert_and_check (result_type, op1);
3388 if (result_type != TREE_TYPE (op2))
3389 op2 = convert_and_check (result_type, op2);
3391 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3394 /* Return a compound expression that performs two expressions and
3395 returns the value of the second of them. */
3398 build_compound_expr (tree expr1, tree expr2)
3400 if (!TREE_SIDE_EFFECTS (expr1))
3402 /* The left-hand operand of a comma expression is like an expression
3403 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3404 any side-effects, unless it was explicitly cast to (void). */
3405 if (warn_unused_value)
3407 if (VOID_TYPE_P (TREE_TYPE (expr1))
3408 && (TREE_CODE (expr1) == NOP_EXPR
3409 || TREE_CODE (expr1) == CONVERT_EXPR))
3411 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3412 && TREE_CODE (expr1) == COMPOUND_EXPR
3413 && (TREE_CODE (TREE_OPERAND (expr1, 1)) == CONVERT_EXPR
3414 || TREE_CODE (TREE_OPERAND (expr1, 1)) == NOP_EXPR))
3415 ; /* (void) a, (void) b, c */
3417 warning (0, "left-hand operand of comma expression has no effect");
3421 /* With -Wunused, we should also warn if the left-hand operand does have
3422 side-effects, but computes a value which is not used. For example, in
3423 `foo() + bar(), baz()' the result of the `+' operator is not used,
3424 so we should issue a warning. */
3425 else if (warn_unused_value)
3426 warn_if_unused_value (expr1, input_location);
3428 if (expr2 == error_mark_node)
3429 return error_mark_node;
3431 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3434 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3437 build_c_cast (tree type, tree expr)
3441 if (type == error_mark_node || expr == error_mark_node)
3442 return error_mark_node;
3444 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3445 only in <protocol> qualifications. But when constructing cast expressions,
3446 the protocols do matter and must be kept around. */
3447 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3448 return build1 (NOP_EXPR, type, expr);
3450 type = TYPE_MAIN_VARIANT (type);
3452 if (TREE_CODE (type) == ARRAY_TYPE)
3454 error ("cast specifies array type");
3455 return error_mark_node;
3458 if (TREE_CODE (type) == FUNCTION_TYPE)
3460 error ("cast specifies function type");
3461 return error_mark_node;
3464 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3468 if (TREE_CODE (type) == RECORD_TYPE
3469 || TREE_CODE (type) == UNION_TYPE)
3470 pedwarn ("ISO C forbids casting nonscalar to the same type");
3473 else if (TREE_CODE (type) == UNION_TYPE)
3477 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3478 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3479 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3487 pedwarn ("ISO C forbids casts to union type");
3488 t = digest_init (type,
3489 build_constructor_single (type, field, value),
3491 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3492 TREE_INVARIANT (t) = TREE_INVARIANT (value);
3495 error ("cast to union type from type not present in union");
3496 return error_mark_node;
3502 if (type == void_type_node)
3503 return build1 (CONVERT_EXPR, type, value);
3505 otype = TREE_TYPE (value);
3507 /* Optionally warn about potentially worrisome casts. */
3510 && TREE_CODE (type) == POINTER_TYPE
3511 && TREE_CODE (otype) == POINTER_TYPE)
3513 tree in_type = type;
3514 tree in_otype = otype;
3518 /* Check that the qualifiers on IN_TYPE are a superset of
3519 the qualifiers of IN_OTYPE. The outermost level of
3520 POINTER_TYPE nodes is uninteresting and we stop as soon
3521 as we hit a non-POINTER_TYPE node on either type. */
3524 in_otype = TREE_TYPE (in_otype);
3525 in_type = TREE_TYPE (in_type);
3527 /* GNU C allows cv-qualified function types. 'const'
3528 means the function is very pure, 'volatile' means it
3529 can't return. We need to warn when such qualifiers
3530 are added, not when they're taken away. */
3531 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3532 && TREE_CODE (in_type) == FUNCTION_TYPE)
3533 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3535 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3537 while (TREE_CODE (in_type) == POINTER_TYPE
3538 && TREE_CODE (in_otype) == POINTER_TYPE);
3541 warning (0, "cast adds new qualifiers to function type");
3544 /* There are qualifiers present in IN_OTYPE that are not
3545 present in IN_TYPE. */
3546 warning (0, "cast discards qualifiers from pointer target type");
3549 /* Warn about possible alignment problems. */
3550 if (STRICT_ALIGNMENT
3551 && TREE_CODE (type) == POINTER_TYPE
3552 && TREE_CODE (otype) == POINTER_TYPE
3553 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3554 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3555 /* Don't warn about opaque types, where the actual alignment
3556 restriction is unknown. */
3557 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3558 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3559 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3560 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3561 warning (OPT_Wcast_align,
3562 "cast increases required alignment of target type");
3564 if (TREE_CODE (type) == INTEGER_TYPE
3565 && TREE_CODE (otype) == POINTER_TYPE
3566 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3567 /* Unlike conversion of integers to pointers, where the
3568 warning is disabled for converting constants because
3569 of cases such as SIG_*, warn about converting constant
3570 pointers to integers. In some cases it may cause unwanted
3571 sign extension, and a warning is appropriate. */
3572 warning (OPT_Wpointer_to_int_cast,
3573 "cast from pointer to integer of different size");
3575 if (TREE_CODE (value) == CALL_EXPR
3576 && TREE_CODE (type) != TREE_CODE (otype))
3577 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3578 "to non-matching type %qT", otype, type);
3580 if (TREE_CODE (type) == POINTER_TYPE
3581 && TREE_CODE (otype) == INTEGER_TYPE
3582 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3583 /* Don't warn about converting any constant. */
3584 && !TREE_CONSTANT (value))
3585 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3586 "of different size");
3588 strict_aliasing_warning (otype, type, expr);
3590 /* If pedantic, warn for conversions between function and object
3591 pointer types, except for converting a null pointer constant
3592 to function pointer type. */
3594 && TREE_CODE (type) == POINTER_TYPE
3595 && TREE_CODE (otype) == POINTER_TYPE
3596 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3597 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3598 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3601 && TREE_CODE (type) == POINTER_TYPE
3602 && TREE_CODE (otype) == POINTER_TYPE
3603 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3604 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3605 && !null_pointer_constant_p (value))
3606 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3609 value = convert (type, value);
3611 /* Ignore any integer overflow caused by the cast. */
3612 if (TREE_CODE (value) == INTEGER_CST)
3614 if (CONSTANT_CLASS_P (ovalue)
3615 && (TREE_OVERFLOW (ovalue) || TREE_CONSTANT_OVERFLOW (ovalue)))
3617 /* Avoid clobbering a shared constant. */
3618 value = copy_node (value);
3619 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3620 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3622 else if (TREE_OVERFLOW (value) || TREE_CONSTANT_OVERFLOW (value))
3623 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3624 value = build_int_cst_wide (TREE_TYPE (value),
3625 TREE_INT_CST_LOW (value),
3626 TREE_INT_CST_HIGH (value));
3630 /* Don't let a cast be an lvalue. */
3632 value = non_lvalue (value);
3637 /* Interpret a cast of expression EXPR to type TYPE. */
3639 c_cast_expr (struct c_type_name *type_name, tree expr)
3642 int saved_wsp = warn_strict_prototypes;
3644 /* This avoids warnings about unprototyped casts on
3645 integers. E.g. "#define SIG_DFL (void(*)())0". */
3646 if (TREE_CODE (expr) == INTEGER_CST)
3647 warn_strict_prototypes = 0;
3648 type = groktypename (type_name);
3649 warn_strict_prototypes = saved_wsp;
3651 return build_c_cast (type, expr);
3654 /* Build an assignment expression of lvalue LHS from value RHS.
3655 MODIFYCODE is the code for a binary operator that we use
3656 to combine the old value of LHS with RHS to get the new value.
3657 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3660 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3664 tree lhstype = TREE_TYPE (lhs);
3665 tree olhstype = lhstype;
3667 /* Types that aren't fully specified cannot be used in assignments. */
3668 lhs = require_complete_type (lhs);
3670 /* Avoid duplicate error messages from operands that had errors. */
3671 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3672 return error_mark_node;
3674 if (!lvalue_or_else (lhs, lv_assign))
3675 return error_mark_node;
3677 STRIP_TYPE_NOPS (rhs);
3681 /* If a binary op has been requested, combine the old LHS value with the RHS
3682 producing the value we should actually store into the LHS. */
3684 if (modifycode != NOP_EXPR)
3686 lhs = stabilize_reference (lhs);
3687 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3690 /* Give an error for storing in something that is 'const'. */
3692 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3693 || ((TREE_CODE (lhstype) == RECORD_TYPE
3694 || TREE_CODE (lhstype) == UNION_TYPE)
3695 && C_TYPE_FIELDS_READONLY (lhstype)))
3697 readonly_error (lhs, lv_assign);
3698 return error_mark_node;
3701 /* If storing into a structure or union member,
3702 it has probably been given type `int'.
3703 Compute the type that would go with
3704 the actual amount of storage the member occupies. */
3706 if (TREE_CODE (lhs) == COMPONENT_REF
3707 && (TREE_CODE (lhstype) == INTEGER_TYPE
3708 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3709 || TREE_CODE (lhstype) == REAL_TYPE
3710 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3711 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3713 /* If storing in a field that is in actuality a short or narrower than one,
3714 we must store in the field in its actual type. */
3716 if (lhstype != TREE_TYPE (lhs))
3718 lhs = copy_node (lhs);
3719 TREE_TYPE (lhs) = lhstype;
3722 /* Convert new value to destination type. */
3724 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3725 NULL_TREE, NULL_TREE, 0);
3726 if (TREE_CODE (newrhs) == ERROR_MARK)
3727 return error_mark_node;
3729 /* Emit ObjC write barrier, if necessary. */
3730 if (c_dialect_objc () && flag_objc_gc)
3732 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3737 /* Scan operands. */
3739 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3740 TREE_SIDE_EFFECTS (result) = 1;
3742 /* If we got the LHS in a different type for storing in,
3743 convert the result back to the nominal type of LHS
3744 so that the value we return always has the same type
3745 as the LHS argument. */
3747 if (olhstype == TREE_TYPE (result))
3749 return convert_for_assignment (olhstype, result, ic_assign,
3750 NULL_TREE, NULL_TREE, 0);
3753 /* Convert value RHS to type TYPE as preparation for an assignment
3754 to an lvalue of type TYPE.
3755 The real work of conversion is done by `convert'.
3756 The purpose of this function is to generate error messages
3757 for assignments that are not allowed in C.
3758 ERRTYPE says whether it is argument passing, assignment,
3759 initialization or return.
3761 FUNCTION is a tree for the function being called.
3762 PARMNUM is the number of the argument, for printing in error messages. */
3765 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3766 tree fundecl, tree function, int parmnum)
3768 enum tree_code codel = TREE_CODE (type);
3770 enum tree_code coder;
3771 tree rname = NULL_TREE;
3772 bool objc_ok = false;
3774 if (errtype == ic_argpass || errtype == ic_argpass_nonproto)
3777 /* Change pointer to function to the function itself for
3779 if (TREE_CODE (function) == ADDR_EXPR
3780 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3781 function = TREE_OPERAND (function, 0);
3783 /* Handle an ObjC selector specially for diagnostics. */
3784 selector = objc_message_selector ();
3786 if (selector && parmnum > 2)
3793 /* This macro is used to emit diagnostics to ensure that all format
3794 strings are complete sentences, visible to gettext and checked at
3796 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3801 pedwarn (AR, parmnum, rname); \
3803 case ic_argpass_nonproto: \
3804 warning (0, AR, parmnum, rname); \
3816 gcc_unreachable (); \
3820 STRIP_TYPE_NOPS (rhs);
3822 if (optimize && TREE_CODE (rhs) == VAR_DECL
3823 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
3824 rhs = decl_constant_value_for_broken_optimization (rhs);
3826 rhstype = TREE_TYPE (rhs);
3827 coder = TREE_CODE (rhstype);
3829 if (coder == ERROR_MARK)
3830 return error_mark_node;
3832 if (c_dialect_objc ())
3855 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
3858 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
3860 overflow_warning (rhs);
3864 if (coder == VOID_TYPE)
3866 /* Except for passing an argument to an unprototyped function,
3867 this is a constraint violation. When passing an argument to
3868 an unprototyped function, it is compile-time undefined;
3869 making it a constraint in that case was rejected in
3871 error ("void value not ignored as it ought to be");
3872 return error_mark_node;
3874 /* A type converts to a reference to it.
3875 This code doesn't fully support references, it's just for the
3876 special case of va_start and va_copy. */
3877 if (codel == REFERENCE_TYPE
3878 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
3880 if (!lvalue_p (rhs))
3882 error ("cannot pass rvalue to reference parameter");
3883 return error_mark_node;
3885 if (!c_mark_addressable (rhs))
3886 return error_mark_node;
3887 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
3889 /* We already know that these two types are compatible, but they
3890 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3891 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3892 likely to be va_list, a typedef to __builtin_va_list, which
3893 is different enough that it will cause problems later. */
3894 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
3895 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
3897 rhs = build1 (NOP_EXPR, type, rhs);
3900 /* Some types can interconvert without explicit casts. */
3901 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
3902 && vector_types_convertible_p (type, TREE_TYPE (rhs)))
3903 return convert (type, rhs);
3904 /* Arithmetic types all interconvert, and enum is treated like int. */
3905 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
3906 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
3907 || codel == BOOLEAN_TYPE)
3908 && (coder == INTEGER_TYPE || coder == REAL_TYPE
3909 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
3910 || coder == BOOLEAN_TYPE))
3911 return convert_and_check (type, rhs);
3913 /* Conversion to a transparent union from its member types.
3914 This applies only to function arguments. */
3915 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
3916 && (errtype == ic_argpass || errtype == ic_argpass_nonproto))
3918 tree memb, marginal_memb = NULL_TREE;
3920 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
3922 tree memb_type = TREE_TYPE (memb);
3924 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
3925 TYPE_MAIN_VARIANT (rhstype)))
3928 if (TREE_CODE (memb_type) != POINTER_TYPE)
3931 if (coder == POINTER_TYPE)
3933 tree ttl = TREE_TYPE (memb_type);
3934 tree ttr = TREE_TYPE (rhstype);
3936 /* Any non-function converts to a [const][volatile] void *
3937 and vice versa; otherwise, targets must be the same.
3938 Meanwhile, the lhs target must have all the qualifiers of
3940 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3941 || comp_target_types (memb_type, rhstype))
3943 /* If this type won't generate any warnings, use it. */
3944 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
3945 || ((TREE_CODE (ttr) == FUNCTION_TYPE
3946 && TREE_CODE (ttl) == FUNCTION_TYPE)
3947 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3948 == TYPE_QUALS (ttr))
3949 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3950 == TYPE_QUALS (ttl))))
3953 /* Keep looking for a better type, but remember this one. */
3955 marginal_memb = memb;
3959 /* Can convert integer zero to any pointer type. */
3960 if (null_pointer_constant_p (rhs))
3962 rhs = null_pointer_node;
3967 if (memb || marginal_memb)
3971 /* We have only a marginally acceptable member type;
3972 it needs a warning. */
3973 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
3974 tree ttr = TREE_TYPE (rhstype);
3976 /* Const and volatile mean something different for function
3977 types, so the usual warnings are not appropriate. */
3978 if (TREE_CODE (ttr) == FUNCTION_TYPE
3979 && TREE_CODE (ttl) == FUNCTION_TYPE)
3981 /* Because const and volatile on functions are
3982 restrictions that say the function will not do
3983 certain things, it is okay to use a const or volatile
3984 function where an ordinary one is wanted, but not
3986 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
3987 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
3988 "makes qualified function "
3989 "pointer from unqualified"),
3990 G_("assignment makes qualified "
3991 "function pointer from "
3993 G_("initialization makes qualified "
3994 "function pointer from "
3996 G_("return makes qualified function "
3997 "pointer from unqualified"));
3999 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4000 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4001 "qualifiers from pointer target type"),
4002 G_("assignment discards qualifiers "
4003 "from pointer target type"),
4004 G_("initialization discards qualifiers "
4005 "from pointer target type"),
4006 G_("return discards qualifiers from "
4007 "pointer target type"));
4009 memb = marginal_memb;
4012 if (pedantic && (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl)))
4013 pedwarn ("ISO C prohibits argument conversion to union type");
4015 return build_constructor_single (type, memb, rhs);
4019 /* Conversions among pointers */
4020 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4021 && (coder == codel))
4023 tree ttl = TREE_TYPE (type);
4024 tree ttr = TREE_TYPE (rhstype);
4027 bool is_opaque_pointer;
4028 int target_cmp = 0; /* Cache comp_target_types () result. */
4030 if (TREE_CODE (mvl) != ARRAY_TYPE)
4031 mvl = TYPE_MAIN_VARIANT (mvl);
4032 if (TREE_CODE (mvr) != ARRAY_TYPE)
4033 mvr = TYPE_MAIN_VARIANT (mvr);
4034 /* Opaque pointers are treated like void pointers. */
4035 is_opaque_pointer = (targetm.vector_opaque_p (type)
4036 || targetm.vector_opaque_p (rhstype))
4037 && TREE_CODE (ttl) == VECTOR_TYPE
4038 && TREE_CODE (ttr) == VECTOR_TYPE;
4040 /* C++ does not allow the implicit conversion void* -> T*. However,
4041 for the purpose of reducing the number of false positives, we
4042 tolerate the special case of
4046 where NULL is typically defined in C to be '(void *) 0'. */
4047 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4048 warning (OPT_Wc___compat, "request for implicit conversion from "
4049 "%qT to %qT not permitted in C++", rhstype, type);
4051 /* Check if the right-hand side has a format attribute but the
4052 left-hand side doesn't. */
4053 if (warn_missing_format_attribute
4054 && check_missing_format_attribute (type, rhstype))
4059 case ic_argpass_nonproto:
4060 warning (OPT_Wmissing_format_attribute,
4061 "argument %d of %qE might be "
4062 "a candidate for a format attribute",
4066 warning (OPT_Wmissing_format_attribute,
4067 "assignment left-hand side might be "
4068 "a candidate for a format attribute");
4071 warning (OPT_Wmissing_format_attribute,
4072 "initialization left-hand side might be "
4073 "a candidate for a format attribute");
4076 warning (OPT_Wmissing_format_attribute,
4077 "return type might be "
4078 "a candidate for a format attribute");
4085 /* Any non-function converts to a [const][volatile] void *
4086 and vice versa; otherwise, targets must be the same.
4087 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4088 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4089 || (target_cmp = comp_target_types (type, rhstype))
4090 || is_opaque_pointer
4091 || (c_common_unsigned_type (mvl)
4092 == c_common_unsigned_type (mvr)))
4095 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4098 && !null_pointer_constant_p (rhs)
4099 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4100 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
4101 "%qE between function pointer "
4103 G_("ISO C forbids assignment between "
4104 "function pointer and %<void *%>"),
4105 G_("ISO C forbids initialization between "
4106 "function pointer and %<void *%>"),
4107 G_("ISO C forbids return between function "
4108 "pointer and %<void *%>"));
4109 /* Const and volatile mean something different for function types,
4110 so the usual warnings are not appropriate. */
4111 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4112 && TREE_CODE (ttl) != FUNCTION_TYPE)
4114 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4116 /* Types differing only by the presence of the 'volatile'
4117 qualifier are acceptable if the 'volatile' has been added
4118 in by the Objective-C EH machinery. */
4119 if (!objc_type_quals_match (ttl, ttr))
4120 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4121 "qualifiers from pointer target type"),
4122 G_("assignment discards qualifiers "
4123 "from pointer target type"),
4124 G_("initialization discards qualifiers "
4125 "from pointer target type"),
4126 G_("return discards qualifiers from "
4127 "pointer target type"));
4129 /* If this is not a case of ignoring a mismatch in signedness,
4131 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4134 /* If there is a mismatch, do warn. */
4135 else if (warn_pointer_sign)
4136 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
4137 "%d of %qE differ in signedness"),
4138 G_("pointer targets in assignment "
4139 "differ in signedness"),
4140 G_("pointer targets in initialization "
4141 "differ in signedness"),
4142 G_("pointer targets in return differ "
4145 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4146 && TREE_CODE (ttr) == FUNCTION_TYPE)
4148 /* Because const and volatile on functions are restrictions
4149 that say the function will not do certain things,
4150 it is okay to use a const or volatile function
4151 where an ordinary one is wanted, but not vice-versa. */
4152 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4153 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4154 "qualified function pointer "
4155 "from unqualified"),
4156 G_("assignment makes qualified function "
4157 "pointer from unqualified"),
4158 G_("initialization makes qualified "
4159 "function pointer from unqualified"),
4160 G_("return makes qualified function "
4161 "pointer from unqualified"));
4165 /* Avoid warning about the volatile ObjC EH puts on decls. */
4167 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
4168 "incompatible pointer type"),
4169 G_("assignment from incompatible pointer type"),
4170 G_("initialization from incompatible "
4172 G_("return from incompatible pointer type"));
4174 return convert (type, rhs);
4176 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4178 /* ??? This should not be an error when inlining calls to
4179 unprototyped functions. */
4180 error ("invalid use of non-lvalue array");
4181 return error_mark_node;
4183 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4185 /* An explicit constant 0 can convert to a pointer,
4186 or one that results from arithmetic, even including
4187 a cast to integer type. */
4188 if (!null_pointer_constant_p (rhs))
4189 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4190 "pointer from integer without a cast"),
4191 G_("assignment makes pointer from integer "
4193 G_("initialization makes pointer from "
4194 "integer without a cast"),
4195 G_("return makes pointer from integer "
4198 return convert (type, rhs);
4200 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4202 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
4203 "from pointer without a cast"),
4204 G_("assignment makes integer from pointer "
4206 G_("initialization makes integer from pointer "
4208 G_("return makes integer from pointer "
4210 return convert (type, rhs);
4212 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4213 return convert (type, rhs);
4218 case ic_argpass_nonproto:
4219 /* ??? This should not be an error when inlining calls to
4220 unprototyped functions. */
4221 error ("incompatible type for argument %d of %qE", parmnum, rname);
4224 error ("incompatible types in assignment");
4227 error ("incompatible types in initialization");
4230 error ("incompatible types in return");
4236 return error_mark_node;
4239 /* Convert VALUE for assignment into inlined parameter PARM. ARGNUM
4240 is used for error and waring reporting and indicates which argument
4241 is being processed. */
4244 c_convert_parm_for_inlining (tree parm, tree value, tree fn, int argnum)
4248 /* If FN was prototyped, the value has been converted already
4249 in convert_arguments. */
4250 if (!value || TYPE_ARG_TYPES (TREE_TYPE (fn)))
4253 type = TREE_TYPE (parm);
4254 ret = convert_for_assignment (type, value,
4255 ic_argpass_nonproto, fn,
4257 if (targetm.calls.promote_prototypes (TREE_TYPE (fn))
4258 && INTEGRAL_TYPE_P (type)
4259 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
4260 ret = default_conversion (ret);
4264 /* If VALUE is a compound expr all of whose expressions are constant, then
4265 return its value. Otherwise, return error_mark_node.
4267 This is for handling COMPOUND_EXPRs as initializer elements
4268 which is allowed with a warning when -pedantic is specified. */
4271 valid_compound_expr_initializer (tree value, tree endtype)
4273 if (TREE_CODE (value) == COMPOUND_EXPR)
4275 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4277 return error_mark_node;
4278 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4281 else if (!initializer_constant_valid_p (value, endtype))
4282 return error_mark_node;
4287 /* Perform appropriate conversions on the initial value of a variable,
4288 store it in the declaration DECL,
4289 and print any error messages that are appropriate.
4290 If the init is invalid, store an ERROR_MARK. */
4293 store_init_value (tree decl, tree init)
4297 /* If variable's type was invalidly declared, just ignore it. */
4299 type = TREE_TYPE (decl);
4300 if (TREE_CODE (type) == ERROR_MARK)
4303 /* Digest the specified initializer into an expression. */
4305 value = digest_init (type, init, true, TREE_STATIC (decl));
4307 /* Store the expression if valid; else report error. */
4309 if (!in_system_header
4310 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4311 warning (OPT_Wtraditional, "traditional C rejects automatic "
4312 "aggregate initialization");
4314 DECL_INITIAL (decl) = value;
4316 /* ANSI wants warnings about out-of-range constant initializers. */
4317 STRIP_TYPE_NOPS (value);
4318 constant_expression_warning (value);
4320 /* Check if we need to set array size from compound literal size. */
4321 if (TREE_CODE (type) == ARRAY_TYPE
4322 && TYPE_DOMAIN (type) == 0
4323 && value != error_mark_node)
4325 tree inside_init = init;
4327 STRIP_TYPE_NOPS (inside_init);
4328 inside_init = fold (inside_init);
4330 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4332 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4334 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
4336 /* For int foo[] = (int [3]){1}; we need to set array size
4337 now since later on array initializer will be just the
4338 brace enclosed list of the compound literal. */
4339 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
4340 TREE_TYPE (decl) = type;
4341 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
4343 layout_decl (cldecl, 0);
4349 /* Methods for storing and printing names for error messages. */
4351 /* Implement a spelling stack that allows components of a name to be pushed
4352 and popped. Each element on the stack is this structure. */
4359 unsigned HOST_WIDE_INT i;
4364 #define SPELLING_STRING 1
4365 #define SPELLING_MEMBER 2
4366 #define SPELLING_BOUNDS 3
4368 static struct spelling *spelling; /* Next stack element (unused). */
4369 static struct spelling *spelling_base; /* Spelling stack base. */
4370 static int spelling_size; /* Size of the spelling stack. */
4372 /* Macros to save and restore the spelling stack around push_... functions.
4373 Alternative to SAVE_SPELLING_STACK. */
4375 #define SPELLING_DEPTH() (spelling - spelling_base)
4376 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4378 /* Push an element on the spelling stack with type KIND and assign VALUE
4381 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4383 int depth = SPELLING_DEPTH (); \
4385 if (depth >= spelling_size) \
4387 spelling_size += 10; \
4388 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4390 RESTORE_SPELLING_DEPTH (depth); \
4393 spelling->kind = (KIND); \
4394 spelling->MEMBER = (VALUE); \
4398 /* Push STRING on the stack. Printed literally. */
4401 push_string (const char *string)
4403 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4406 /* Push a member name on the stack. Printed as '.' STRING. */
4409 push_member_name (tree decl)
4411 const char *const string
4412 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4413 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4416 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4419 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4421 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4424 /* Compute the maximum size in bytes of the printed spelling. */
4427 spelling_length (void)
4432 for (p = spelling_base; p < spelling; p++)
4434 if (p->kind == SPELLING_BOUNDS)
4437 size += strlen (p->u.s) + 1;
4443 /* Print the spelling to BUFFER and return it. */
4446 print_spelling (char *buffer)
4451 for (p = spelling_base; p < spelling; p++)
4452 if (p->kind == SPELLING_BOUNDS)
4454 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4460 if (p->kind == SPELLING_MEMBER)
4462 for (s = p->u.s; (*d = *s++); d++)
4469 /* Issue an error message for a bad initializer component.
4470 MSGID identifies the message.
4471 The component name is taken from the spelling stack. */
4474 error_init (const char *msgid)
4478 error ("%s", _(msgid));
4479 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4481 error ("(near initialization for %qs)", ofwhat);
4484 /* Issue a pedantic warning for a bad initializer component.
4485 MSGID identifies the message.
4486 The component name is taken from the spelling stack. */
4489 pedwarn_init (const char *msgid)
4493 pedwarn ("%s", _(msgid));
4494 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4496 pedwarn ("(near initialization for %qs)", ofwhat);
4499 /* Issue a warning for a bad initializer component.
4500 MSGID identifies the message.
4501 The component name is taken from the spelling stack. */
4504 warning_init (const char *msgid)
4508 warning (0, "%s", _(msgid));
4509 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4511 warning (0, "(near initialization for %qs)", ofwhat);
4514 /* If TYPE is an array type and EXPR is a parenthesized string
4515 constant, warn if pedantic that EXPR is being used to initialize an
4516 object of type TYPE. */
4519 maybe_warn_string_init (tree type, struct c_expr expr)
4522 && TREE_CODE (type) == ARRAY_TYPE
4523 && TREE_CODE (expr.value) == STRING_CST
4524 && expr.original_code != STRING_CST)
4525 pedwarn_init ("array initialized from parenthesized string constant");
4528 /* Digest the parser output INIT as an initializer for type TYPE.
4529 Return a C expression of type TYPE to represent the initial value.
4531 If INIT is a string constant, STRICT_STRING is true if it is
4532 unparenthesized or we should not warn here for it being parenthesized.
4533 For other types of INIT, STRICT_STRING is not used.
4535 REQUIRE_CONSTANT requests an error if non-constant initializers or
4536 elements are seen. */
4539 digest_init (tree type, tree init, bool strict_string, int require_constant)
4541 enum tree_code code = TREE_CODE (type);
4542 tree inside_init = init;
4544 if (type == error_mark_node
4546 || init == error_mark_node
4547 || TREE_TYPE (init) == error_mark_node)
4548 return error_mark_node;
4550 STRIP_TYPE_NOPS (inside_init);
4552 inside_init = fold (inside_init);
4554 /* Initialization of an array of chars from a string constant
4555 optionally enclosed in braces. */
4557 if (code == ARRAY_TYPE && inside_init
4558 && TREE_CODE (inside_init) == STRING_CST)
4560 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4561 /* Note that an array could be both an array of character type
4562 and an array of wchar_t if wchar_t is signed char or unsigned
4564 bool char_array = (typ1 == char_type_node
4565 || typ1 == signed_char_type_node
4566 || typ1 == unsigned_char_type_node);
4567 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4568 if (char_array || wchar_array)
4572 expr.value = inside_init;
4573 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4574 maybe_warn_string_init (type, expr);
4577 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4580 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4581 TYPE_MAIN_VARIANT (type)))
4584 if (!wchar_array && !char_string)
4586 error_init ("char-array initialized from wide string");
4587 return error_mark_node;
4589 if (char_string && !char_array)
4591 error_init ("wchar_t-array initialized from non-wide string");
4592 return error_mark_node;
4595 TREE_TYPE (inside_init) = type;
4596 if (TYPE_DOMAIN (type) != 0
4597 && TYPE_SIZE (type) != 0
4598 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4599 /* Subtract 1 (or sizeof (wchar_t))
4600 because it's ok to ignore the terminating null char
4601 that is counted in the length of the constant. */
4602 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4603 TREE_STRING_LENGTH (inside_init)
4604 - ((TYPE_PRECISION (typ1)
4605 != TYPE_PRECISION (char_type_node))
4606 ? (TYPE_PRECISION (wchar_type_node)
4609 pedwarn_init ("initializer-string for array of chars is too long");
4613 else if (INTEGRAL_TYPE_P (typ1))
4615 error_init ("array of inappropriate type initialized "
4616 "from string constant");
4617 return error_mark_node;
4621 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4622 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4623 below and handle as a constructor. */
4624 if (code == VECTOR_TYPE
4625 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4626 && vector_types_convertible_p (TREE_TYPE (inside_init), type)
4627 && TREE_CONSTANT (inside_init))
4629 if (TREE_CODE (inside_init) == VECTOR_CST
4630 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4631 TYPE_MAIN_VARIANT (type)))
4634 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4636 unsigned HOST_WIDE_INT ix;
4638 bool constant_p = true;
4640 /* Iterate through elements and check if all constructor
4641 elements are *_CSTs. */
4642 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4643 if (!CONSTANT_CLASS_P (value))
4650 return build_vector_from_ctor (type,
4651 CONSTRUCTOR_ELTS (inside_init));
4655 /* Any type can be initialized
4656 from an expression of the same type, optionally with braces. */
4658 if (inside_init && TREE_TYPE (inside_init) != 0
4659 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4660 TYPE_MAIN_VARIANT (type))
4661 || (code == ARRAY_TYPE
4662 && comptypes (TREE_TYPE (inside_init), type))
4663 || (code == VECTOR_TYPE
4664 && comptypes (TREE_TYPE (inside_init), type))
4665 || (code == POINTER_TYPE
4666 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4667 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4668 TREE_TYPE (type)))))
4670 if (code == POINTER_TYPE)
4672 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4674 if (TREE_CODE (inside_init) == STRING_CST
4675 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4676 inside_init = array_to_pointer_conversion (inside_init);
4679 error_init ("invalid use of non-lvalue array");
4680 return error_mark_node;
4685 if (code == VECTOR_TYPE)
4686 /* Although the types are compatible, we may require a
4688 inside_init = convert (type, inside_init);
4690 if (require_constant && !flag_isoc99
4691 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4693 /* As an extension, allow initializing objects with static storage
4694 duration with compound literals (which are then treated just as
4695 the brace enclosed list they contain). */
4696 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4697 inside_init = DECL_INITIAL (decl);
4700 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4701 && TREE_CODE (inside_init) != CONSTRUCTOR)
4703 error_init ("array initialized from non-constant array expression");
4704 return error_mark_node;
4707 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4708 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4710 /* Compound expressions can only occur here if -pedantic or
4711 -pedantic-errors is specified. In the later case, we always want
4712 an error. In the former case, we simply want a warning. */
4713 if (require_constant && pedantic
4714 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4717 = valid_compound_expr_initializer (inside_init,
4718 TREE_TYPE (inside_init));
4719 if (inside_init == error_mark_node)
4720 error_init ("initializer element is not constant");
4722 pedwarn_init ("initializer element is not constant");
4723 if (flag_pedantic_errors)
4724 inside_init = error_mark_node;
4726 else if (require_constant
4727 && !initializer_constant_valid_p (inside_init,
4728 TREE_TYPE (inside_init)))
4730 error_init ("initializer element is not constant");
4731 inside_init = error_mark_node;
4734 /* Added to enable additional -Wmissing-format-attribute warnings. */
4735 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4736 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4741 /* Handle scalar types, including conversions. */
4743 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4744 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE
4745 || code == VECTOR_TYPE)
4747 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4748 && (TREE_CODE (init) == STRING_CST
4749 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4750 init = array_to_pointer_conversion (init);
4752 = convert_for_assignment (type, init, ic_init,
4753 NULL_TREE, NULL_TREE, 0);
4755 /* Check to see if we have already given an error message. */
4756 if (inside_init == error_mark_node)
4758 else if (require_constant && !TREE_CONSTANT (inside_init))
4760 error_init ("initializer element is not constant");
4761 inside_init = error_mark_node;
4763 else if (require_constant
4764 && !initializer_constant_valid_p (inside_init,
4765 TREE_TYPE (inside_init)))
4767 error_init ("initializer element is not computable at load time");
4768 inside_init = error_mark_node;
4774 /* Come here only for records and arrays. */
4776 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4778 error_init ("variable-sized object may not be initialized");
4779 return error_mark_node;
4782 error_init ("invalid initializer");
4783 return error_mark_node;
4786 /* Handle initializers that use braces. */
4788 /* Type of object we are accumulating a constructor for.
4789 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4790 static tree constructor_type;
4792 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4794 static tree constructor_fields;
4796 /* For an ARRAY_TYPE, this is the specified index
4797 at which to store the next element we get. */
4798 static tree constructor_index;
4800 /* For an ARRAY_TYPE, this is the maximum index. */
4801 static tree constructor_max_index;
4803 /* For a RECORD_TYPE, this is the first field not yet written out. */
4804 static tree constructor_unfilled_fields;
4806 /* For an ARRAY_TYPE, this is the index of the first element
4807 not yet written out. */
4808 static tree constructor_unfilled_index;
4810 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4811 This is so we can generate gaps between fields, when appropriate. */
4812 static tree constructor_bit_index;
4814 /* If we are saving up the elements rather than allocating them,
4815 this is the list of elements so far (in reverse order,
4816 most recent first). */
4817 static VEC(constructor_elt,gc) *constructor_elements;
4819 /* 1 if constructor should be incrementally stored into a constructor chain,
4820 0 if all the elements should be kept in AVL tree. */
4821 static int constructor_incremental;
4823 /* 1 if so far this constructor's elements are all compile-time constants. */
4824 static int constructor_constant;
4826 /* 1 if so far this constructor's elements are all valid address constants. */
4827 static int constructor_simple;
4829 /* 1 if this constructor is erroneous so far. */
4830 static int constructor_erroneous;
4832 /* Structure for managing pending initializer elements, organized as an
4837 struct init_node *left, *right;
4838 struct init_node *parent;
4844 /* Tree of pending elements at this constructor level.
4845 These are elements encountered out of order
4846 which belong at places we haven't reached yet in actually
4848 Will never hold tree nodes across GC runs. */
4849 static struct init_node *constructor_pending_elts;
4851 /* The SPELLING_DEPTH of this constructor. */
4852 static int constructor_depth;
4854 /* DECL node for which an initializer is being read.
4855 0 means we are reading a constructor expression
4856 such as (struct foo) {...}. */
4857 static tree constructor_decl;
4859 /* Nonzero if this is an initializer for a top-level decl. */
4860 static int constructor_top_level;
4862 /* Nonzero if there were any member designators in this initializer. */
4863 static int constructor_designated;
4865 /* Nesting depth of designator list. */
4866 static int designator_depth;
4868 /* Nonzero if there were diagnosed errors in this designator list. */
4869 static int designator_erroneous;
4872 /* This stack has a level for each implicit or explicit level of
4873 structuring in the initializer, including the outermost one. It
4874 saves the values of most of the variables above. */
4876 struct constructor_range_stack;
4878 struct constructor_stack
4880 struct constructor_stack *next;
4885 tree unfilled_index;
4886 tree unfilled_fields;
4888 VEC(constructor_elt,gc) *elements;
4889 struct init_node *pending_elts;
4892 /* If value nonzero, this value should replace the entire
4893 constructor at this level. */
4894 struct c_expr replacement_value;
4895 struct constructor_range_stack *range_stack;
4905 static struct constructor_stack *constructor_stack;
4907 /* This stack represents designators from some range designator up to
4908 the last designator in the list. */
4910 struct constructor_range_stack
4912 struct constructor_range_stack *next, *prev;
4913 struct constructor_stack *stack;
4920 static struct constructor_range_stack *constructor_range_stack;
4922 /* This stack records separate initializers that are nested.
4923 Nested initializers can't happen in ANSI C, but GNU C allows them
4924 in cases like { ... (struct foo) { ... } ... }. */
4926 struct initializer_stack
4928 struct initializer_stack *next;
4930 struct constructor_stack *constructor_stack;
4931 struct constructor_range_stack *constructor_range_stack;
4932 VEC(constructor_elt,gc) *elements;
4933 struct spelling *spelling;
4934 struct spelling *spelling_base;
4937 char require_constant_value;
4938 char require_constant_elements;
4941 static struct initializer_stack *initializer_stack;
4943 /* Prepare to parse and output the initializer for variable DECL. */
4946 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
4949 struct initializer_stack *p = XNEW (struct initializer_stack);
4951 p->decl = constructor_decl;
4952 p->require_constant_value = require_constant_value;
4953 p->require_constant_elements = require_constant_elements;
4954 p->constructor_stack = constructor_stack;
4955 p->constructor_range_stack = constructor_range_stack;
4956 p->elements = constructor_elements;
4957 p->spelling = spelling;
4958 p->spelling_base = spelling_base;
4959 p->spelling_size = spelling_size;
4960 p->top_level = constructor_top_level;
4961 p->next = initializer_stack;
4962 initializer_stack = p;
4964 constructor_decl = decl;
4965 constructor_designated = 0;
4966 constructor_top_level = top_level;
4968 if (decl != 0 && decl != error_mark_node)
4970 require_constant_value = TREE_STATIC (decl);
4971 require_constant_elements
4972 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
4973 /* For a scalar, you can always use any value to initialize,
4974 even within braces. */
4975 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
4976 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
4977 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
4978 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
4979 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
4983 require_constant_value = 0;
4984 require_constant_elements = 0;
4985 locus = "(anonymous)";
4988 constructor_stack = 0;
4989 constructor_range_stack = 0;
4991 missing_braces_mentioned = 0;
4995 RESTORE_SPELLING_DEPTH (0);
4998 push_string (locus);
5004 struct initializer_stack *p = initializer_stack;
5006 /* Free the whole constructor stack of this initializer. */
5007 while (constructor_stack)
5009 struct constructor_stack *q = constructor_stack;
5010 constructor_stack = q->next;
5014 gcc_assert (!constructor_range_stack);
5016 /* Pop back to the data of the outer initializer (if any). */
5017 free (spelling_base);
5019 constructor_decl = p->decl;
5020 require_constant_value = p->require_constant_value;
5021 require_constant_elements = p->require_constant_elements;
5022 constructor_stack = p->constructor_stack;
5023 constructor_range_stack = p->constructor_range_stack;
5024 constructor_elements = p->elements;
5025 spelling = p->spelling;
5026 spelling_base = p->spelling_base;
5027 spelling_size = p->spelling_size;
5028 constructor_top_level = p->top_level;
5029 initializer_stack = p->next;
5033 /* Call here when we see the initializer is surrounded by braces.
5034 This is instead of a call to push_init_level;
5035 it is matched by a call to pop_init_level.
5037 TYPE is the type to initialize, for a constructor expression.
5038 For an initializer for a decl, TYPE is zero. */
5041 really_start_incremental_init (tree type)
5043 struct constructor_stack *p = XNEW (struct constructor_stack);
5046 type = TREE_TYPE (constructor_decl);
5048 if (targetm.vector_opaque_p (type))
5049 error ("opaque vector types cannot be initialized");
5051 p->type = constructor_type;
5052 p->fields = constructor_fields;
5053 p->index = constructor_index;
5054 p->max_index = constructor_max_index;
5055 p->unfilled_index = constructor_unfilled_index;
5056 p->unfilled_fields = constructor_unfilled_fields;
5057 p->bit_index = constructor_bit_index;
5058 p->elements = constructor_elements;
5059 p->constant = constructor_constant;
5060 p->simple = constructor_simple;
5061 p->erroneous = constructor_erroneous;
5062 p->pending_elts = constructor_pending_elts;
5063 p->depth = constructor_depth;
5064 p->replacement_value.value = 0;
5065 p->replacement_value.original_code = ERROR_MARK;
5069 p->incremental = constructor_incremental;
5070 p->designated = constructor_designated;
5072 constructor_stack = p;
5074 constructor_constant = 1;
5075 constructor_simple = 1;
5076 constructor_depth = SPELLING_DEPTH ();
5077 constructor_elements = 0;
5078 constructor_pending_elts = 0;
5079 constructor_type = type;
5080 constructor_incremental = 1;
5081 constructor_designated = 0;
5082 designator_depth = 0;
5083 designator_erroneous = 0;
5085 if (TREE_CODE (constructor_type) == RECORD_TYPE
5086 || TREE_CODE (constructor_type) == UNION_TYPE)
5088 constructor_fields = TYPE_FIELDS (constructor_type);
5089 /* Skip any nameless bit fields at the beginning. */
5090 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5091 && DECL_NAME (constructor_fields) == 0)
5092 constructor_fields = TREE_CHAIN (constructor_fields);
5094 constructor_unfilled_fields = constructor_fields;
5095 constructor_bit_index = bitsize_zero_node;
5097 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5099 if (TYPE_DOMAIN (constructor_type))
5101 constructor_max_index
5102 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5104 /* Detect non-empty initializations of zero-length arrays. */
5105 if (constructor_max_index == NULL_TREE
5106 && TYPE_SIZE (constructor_type))
5107 constructor_max_index = build_int_cst (NULL_TREE, -1);
5109 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5110 to initialize VLAs will cause a proper error; avoid tree
5111 checking errors as well by setting a safe value. */
5112 if (constructor_max_index
5113 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5114 constructor_max_index = build_int_cst (NULL_TREE, -1);
5117 = convert (bitsizetype,
5118 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5122 constructor_index = bitsize_zero_node;
5123 constructor_max_index = NULL_TREE;
5126 constructor_unfilled_index = constructor_index;
5128 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5130 /* Vectors are like simple fixed-size arrays. */
5131 constructor_max_index =
5132 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5133 constructor_index = bitsize_zero_node;
5134 constructor_unfilled_index = constructor_index;
5138 /* Handle the case of int x = {5}; */
5139 constructor_fields = constructor_type;
5140 constructor_unfilled_fields = constructor_type;
5144 /* Push down into a subobject, for initialization.
5145 If this is for an explicit set of braces, IMPLICIT is 0.
5146 If it is because the next element belongs at a lower level,
5147 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5150 push_init_level (int implicit)
5152 struct constructor_stack *p;
5153 tree value = NULL_TREE;
5155 /* If we've exhausted any levels that didn't have braces,
5156 pop them now. If implicit == 1, this will have been done in
5157 process_init_element; do not repeat it here because in the case
5158 of excess initializers for an empty aggregate this leads to an
5159 infinite cycle of popping a level and immediately recreating
5163 while (constructor_stack->implicit)
5165 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5166 || TREE_CODE (constructor_type) == UNION_TYPE)
5167 && constructor_fields == 0)
5168 process_init_element (pop_init_level (1));
5169 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5170 && constructor_max_index
5171 && tree_int_cst_lt (constructor_max_index,
5173 process_init_element (pop_init_level (1));
5179 /* Unless this is an explicit brace, we need to preserve previous
5183 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5184 || TREE_CODE (constructor_type) == UNION_TYPE)
5185 && constructor_fields)
5186 value = find_init_member (constructor_fields);
5187 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5188 value = find_init_member (constructor_index);
5191 p = XNEW (struct constructor_stack);
5192 p->type = constructor_type;
5193 p->fields = constructor_fields;
5194 p->index = constructor_index;
5195 p->max_index = constructor_max_index;
5196 p->unfilled_index = constructor_unfilled_index;
5197 p->unfilled_fields = constructor_unfilled_fields;
5198 p->bit_index = constructor_bit_index;
5199 p->elements = constructor_elements;
5200 p->constant = constructor_constant;
5201 p->simple = constructor_simple;
5202 p->erroneous = constructor_erroneous;
5203 p->pending_elts = constructor_pending_elts;
5204 p->depth = constructor_depth;
5205 p->replacement_value.value = 0;
5206 p->replacement_value.original_code = ERROR_MARK;
5207 p->implicit = implicit;
5209 p->incremental = constructor_incremental;
5210 p->designated = constructor_designated;
5211 p->next = constructor_stack;
5213 constructor_stack = p;
5215 constructor_constant = 1;
5216 constructor_simple = 1;
5217 constructor_depth = SPELLING_DEPTH ();
5218 constructor_elements = 0;
5219 constructor_incremental = 1;
5220 constructor_designated = 0;
5221 constructor_pending_elts = 0;
5224 p->range_stack = constructor_range_stack;
5225 constructor_range_stack = 0;
5226 designator_depth = 0;
5227 designator_erroneous = 0;
5230 /* Don't die if an entire brace-pair level is superfluous
5231 in the containing level. */
5232 if (constructor_type == 0)
5234 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5235 || TREE_CODE (constructor_type) == UNION_TYPE)
5237 /* Don't die if there are extra init elts at the end. */
5238 if (constructor_fields == 0)
5239 constructor_type = 0;
5242 constructor_type = TREE_TYPE (constructor_fields);
5243 push_member_name (constructor_fields);
5244 constructor_depth++;
5247 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5249 constructor_type = TREE_TYPE (constructor_type);
5250 push_array_bounds (tree_low_cst (constructor_index, 1));
5251 constructor_depth++;
5254 if (constructor_type == 0)
5256 error_init ("extra brace group at end of initializer");
5257 constructor_fields = 0;
5258 constructor_unfilled_fields = 0;
5262 if (value && TREE_CODE (value) == CONSTRUCTOR)
5264 constructor_constant = TREE_CONSTANT (value);
5265 constructor_simple = TREE_STATIC (value);
5266 constructor_elements = CONSTRUCTOR_ELTS (value);
5267 if (!VEC_empty (constructor_elt, constructor_elements)
5268 && (TREE_CODE (constructor_type) == RECORD_TYPE
5269 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5270 set_nonincremental_init ();
5273 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5275 missing_braces_mentioned = 1;
5276 warning_init ("missing braces around initializer");
5279 if (TREE_CODE (constructor_type) == RECORD_TYPE
5280 || TREE_CODE (constructor_type) == UNION_TYPE)
5282 constructor_fields = TYPE_FIELDS (constructor_type);
5283 /* Skip any nameless bit fields at the beginning. */
5284 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5285 && DECL_NAME (constructor_fields) == 0)
5286 constructor_fields = TREE_CHAIN (constructor_fields);
5288 constructor_unfilled_fields = constructor_fields;
5289 constructor_bit_index = bitsize_zero_node;
5291 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5293 /* Vectors are like simple fixed-size arrays. */
5294 constructor_max_index =
5295 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5296 constructor_index = convert (bitsizetype, integer_zero_node);
5297 constructor_unfilled_index = constructor_index;
5299 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5301 if (TYPE_DOMAIN (constructor_type))
5303 constructor_max_index
5304 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5306 /* Detect non-empty initializations of zero-length arrays. */
5307 if (constructor_max_index == NULL_TREE
5308 && TYPE_SIZE (constructor_type))
5309 constructor_max_index = build_int_cst (NULL_TREE, -1);
5311 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5312 to initialize VLAs will cause a proper error; avoid tree
5313 checking errors as well by setting a safe value. */
5314 if (constructor_max_index
5315 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5316 constructor_max_index = build_int_cst (NULL_TREE, -1);
5319 = convert (bitsizetype,
5320 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5323 constructor_index = bitsize_zero_node;
5325 constructor_unfilled_index = constructor_index;
5326 if (value && TREE_CODE (value) == STRING_CST)
5328 /* We need to split the char/wchar array into individual
5329 characters, so that we don't have to special case it
5331 set_nonincremental_init_from_string (value);
5336 if (constructor_type != error_mark_node)
5337 warning_init ("braces around scalar initializer");
5338 constructor_fields = constructor_type;
5339 constructor_unfilled_fields = constructor_type;
5343 /* At the end of an implicit or explicit brace level,
5344 finish up that level of constructor. If a single expression
5345 with redundant braces initialized that level, return the
5346 c_expr structure for that expression. Otherwise, the original_code
5347 element is set to ERROR_MARK.
5348 If we were outputting the elements as they are read, return 0 as the value
5349 from inner levels (process_init_element ignores that),
5350 but return error_mark_node as the value from the outermost level
5351 (that's what we want to put in DECL_INITIAL).
5352 Otherwise, return a CONSTRUCTOR expression as the value. */
5355 pop_init_level (int implicit)
5357 struct constructor_stack *p;
5360 ret.original_code = ERROR_MARK;
5364 /* When we come to an explicit close brace,
5365 pop any inner levels that didn't have explicit braces. */
5366 while (constructor_stack->implicit)
5367 process_init_element (pop_init_level (1));
5369 gcc_assert (!constructor_range_stack);
5372 /* Now output all pending elements. */
5373 constructor_incremental = 1;
5374 output_pending_init_elements (1);
5376 p = constructor_stack;
5378 /* Error for initializing a flexible array member, or a zero-length
5379 array member in an inappropriate context. */
5380 if (constructor_type && constructor_fields
5381 && TREE_CODE (constructor_type) == ARRAY_TYPE
5382 && TYPE_DOMAIN (constructor_type)
5383 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5385 /* Silently discard empty initializations. The parser will
5386 already have pedwarned for empty brackets. */
5387 if (integer_zerop (constructor_unfilled_index))
5388 constructor_type = NULL_TREE;
5391 gcc_assert (!TYPE_SIZE (constructor_type));
5393 if (constructor_depth > 2)
5394 error_init ("initialization of flexible array member in a nested context");
5396 pedwarn_init ("initialization of a flexible array member");
5398 /* We have already issued an error message for the existence
5399 of a flexible array member not at the end of the structure.
5400 Discard the initializer so that we do not die later. */
5401 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5402 constructor_type = NULL_TREE;
5406 /* Warn when some struct elements are implicitly initialized to zero. */
5407 if (warn_missing_field_initializers
5409 && TREE_CODE (constructor_type) == RECORD_TYPE
5410 && constructor_unfilled_fields)
5412 /* Do not warn for flexible array members or zero-length arrays. */
5413 while (constructor_unfilled_fields
5414 && (!DECL_SIZE (constructor_unfilled_fields)
5415 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5416 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5418 /* Do not warn if this level of the initializer uses member
5419 designators; it is likely to be deliberate. */
5420 if (constructor_unfilled_fields && !constructor_designated)
5422 push_member_name (constructor_unfilled_fields);
5423 warning_init ("missing initializer");
5424 RESTORE_SPELLING_DEPTH (constructor_depth);
5428 /* Pad out the end of the structure. */
5429 if (p->replacement_value.value)
5430 /* If this closes a superfluous brace pair,
5431 just pass out the element between them. */
5432 ret = p->replacement_value;
5433 else if (constructor_type == 0)
5435 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5436 && TREE_CODE (constructor_type) != UNION_TYPE
5437 && TREE_CODE (constructor_type) != ARRAY_TYPE
5438 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5440 /* A nonincremental scalar initializer--just return
5441 the element, after verifying there is just one. */
5442 if (VEC_empty (constructor_elt,constructor_elements))
5444 if (!constructor_erroneous)
5445 error_init ("empty scalar initializer");
5446 ret.value = error_mark_node;
5448 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5450 error_init ("extra elements in scalar initializer");
5451 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5454 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5458 if (constructor_erroneous)
5459 ret.value = error_mark_node;
5462 ret.value = build_constructor (constructor_type,
5463 constructor_elements);
5464 if (constructor_constant)
5465 TREE_CONSTANT (ret.value) = TREE_INVARIANT (ret.value) = 1;
5466 if (constructor_constant && constructor_simple)
5467 TREE_STATIC (ret.value) = 1;
5471 constructor_type = p->type;
5472 constructor_fields = p->fields;
5473 constructor_index = p->index;
5474 constructor_max_index = p->max_index;
5475 constructor_unfilled_index = p->unfilled_index;
5476 constructor_unfilled_fields = p->unfilled_fields;
5477 constructor_bit_index = p->bit_index;
5478 constructor_elements = p->elements;
5479 constructor_constant = p->constant;
5480 constructor_simple = p->simple;
5481 constructor_erroneous = p->erroneous;
5482 constructor_incremental = p->incremental;
5483 constructor_designated = p->designated;
5484 constructor_pending_elts = p->pending_elts;
5485 constructor_depth = p->depth;
5487 constructor_range_stack = p->range_stack;
5488 RESTORE_SPELLING_DEPTH (constructor_depth);
5490 constructor_stack = p->next;
5493 if (ret.value == 0 && constructor_stack == 0)
5494 ret.value = error_mark_node;
5498 /* Common handling for both array range and field name designators.
5499 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5502 set_designator (int array)
5505 enum tree_code subcode;
5507 /* Don't die if an entire brace-pair level is superfluous
5508 in the containing level. */
5509 if (constructor_type == 0)
5512 /* If there were errors in this designator list already, bail out
5514 if (designator_erroneous)
5517 if (!designator_depth)
5519 gcc_assert (!constructor_range_stack);
5521 /* Designator list starts at the level of closest explicit
5523 while (constructor_stack->implicit)
5524 process_init_element (pop_init_level (1));
5525 constructor_designated = 1;
5529 switch (TREE_CODE (constructor_type))
5533 subtype = TREE_TYPE (constructor_fields);
5534 if (subtype != error_mark_node)
5535 subtype = TYPE_MAIN_VARIANT (subtype);
5538 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5544 subcode = TREE_CODE (subtype);
5545 if (array && subcode != ARRAY_TYPE)
5547 error_init ("array index in non-array initializer");
5550 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5552 error_init ("field name not in record or union initializer");
5556 constructor_designated = 1;
5557 push_init_level (2);
5561 /* If there are range designators in designator list, push a new designator
5562 to constructor_range_stack. RANGE_END is end of such stack range or
5563 NULL_TREE if there is no range designator at this level. */
5566 push_range_stack (tree range_end)
5568 struct constructor_range_stack *p;
5570 p = GGC_NEW (struct constructor_range_stack);
5571 p->prev = constructor_range_stack;
5573 p->fields = constructor_fields;
5574 p->range_start = constructor_index;
5575 p->index = constructor_index;
5576 p->stack = constructor_stack;
5577 p->range_end = range_end;
5578 if (constructor_range_stack)
5579 constructor_range_stack->next = p;
5580 constructor_range_stack = p;
5583 /* Within an array initializer, specify the next index to be initialized.
5584 FIRST is that index. If LAST is nonzero, then initialize a range
5585 of indices, running from FIRST through LAST. */
5588 set_init_index (tree first, tree last)
5590 if (set_designator (1))
5593 designator_erroneous = 1;
5595 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5596 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5598 error_init ("array index in initializer not of integer type");
5602 if (TREE_CODE (first) != INTEGER_CST)
5603 error_init ("nonconstant array index in initializer");
5604 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5605 error_init ("nonconstant array index in initializer");
5606 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5607 error_init ("array index in non-array initializer");
5608 else if (tree_int_cst_sgn (first) == -1)
5609 error_init ("array index in initializer exceeds array bounds");
5610 else if (constructor_max_index
5611 && tree_int_cst_lt (constructor_max_index, first))
5612 error_init ("array index in initializer exceeds array bounds");
5615 constructor_index = convert (bitsizetype, first);
5619 if (tree_int_cst_equal (first, last))
5621 else if (tree_int_cst_lt (last, first))
5623 error_init ("empty index range in initializer");
5628 last = convert (bitsizetype, last);
5629 if (constructor_max_index != 0
5630 && tree_int_cst_lt (constructor_max_index, last))
5632 error_init ("array index range in initializer exceeds array bounds");
5639 designator_erroneous = 0;
5640 if (constructor_range_stack || last)
5641 push_range_stack (last);
5645 /* Within a struct initializer, specify the next field to be initialized. */
5648 set_init_label (tree fieldname)
5652 if (set_designator (0))
5655 designator_erroneous = 1;
5657 if (TREE_CODE (constructor_type) != RECORD_TYPE
5658 && TREE_CODE (constructor_type) != UNION_TYPE)
5660 error_init ("field name not in record or union initializer");
5664 for (tail = TYPE_FIELDS (constructor_type); tail;
5665 tail = TREE_CHAIN (tail))
5667 if (DECL_NAME (tail) == fieldname)
5672 error ("unknown field %qE specified in initializer", fieldname);
5675 constructor_fields = tail;
5677 designator_erroneous = 0;
5678 if (constructor_range_stack)
5679 push_range_stack (NULL_TREE);
5683 /* Add a new initializer to the tree of pending initializers. PURPOSE
5684 identifies the initializer, either array index or field in a structure.
5685 VALUE is the value of that index or field. */
5688 add_pending_init (tree purpose, tree value)
5690 struct init_node *p, **q, *r;
5692 q = &constructor_pending_elts;
5695 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5700 if (tree_int_cst_lt (purpose, p->purpose))
5702 else if (tree_int_cst_lt (p->purpose, purpose))
5706 if (TREE_SIDE_EFFECTS (p->value))
5707 warning_init ("initialized field with side-effects overwritten");
5717 bitpos = bit_position (purpose);
5721 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5723 else if (p->purpose != purpose)
5727 if (TREE_SIDE_EFFECTS (p->value))
5728 warning_init ("initialized field with side-effects overwritten");
5735 r = GGC_NEW (struct init_node);
5736 r->purpose = purpose;
5747 struct init_node *s;
5751 if (p->balance == 0)
5753 else if (p->balance < 0)
5760 p->left->parent = p;
5777 constructor_pending_elts = r;
5782 struct init_node *t = r->right;
5786 r->right->parent = r;
5791 p->left->parent = p;
5794 p->balance = t->balance < 0;
5795 r->balance = -(t->balance > 0);
5810 constructor_pending_elts = t;
5816 /* p->balance == +1; growth of left side balances the node. */
5821 else /* r == p->right */
5823 if (p->balance == 0)
5824 /* Growth propagation from right side. */
5826 else if (p->balance > 0)
5833 p->right->parent = p;
5850 constructor_pending_elts = r;
5852 else /* r->balance == -1 */
5855 struct init_node *t = r->left;
5859 r->left->parent = r;
5864 p->right->parent = p;
5867 r->balance = (t->balance < 0);
5868 p->balance = -(t->balance > 0);
5883 constructor_pending_elts = t;
5889 /* p->balance == -1; growth of right side balances the node. */
5900 /* Build AVL tree from a sorted chain. */
5903 set_nonincremental_init (void)
5905 unsigned HOST_WIDE_INT ix;
5908 if (TREE_CODE (constructor_type) != RECORD_TYPE
5909 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5912 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
5913 add_pending_init (index, value);
5914 constructor_elements = 0;
5915 if (TREE_CODE (constructor_type) == RECORD_TYPE)
5917 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
5918 /* Skip any nameless bit fields at the beginning. */
5919 while (constructor_unfilled_fields != 0
5920 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5921 && DECL_NAME (constructor_unfilled_fields) == 0)
5922 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5925 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5927 if (TYPE_DOMAIN (constructor_type))
5928 constructor_unfilled_index
5929 = convert (bitsizetype,
5930 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5932 constructor_unfilled_index = bitsize_zero_node;
5934 constructor_incremental = 0;
5937 /* Build AVL tree from a string constant. */
5940 set_nonincremental_init_from_string (tree str)
5942 tree value, purpose, type;
5943 HOST_WIDE_INT val[2];
5944 const char *p, *end;
5945 int byte, wchar_bytes, charwidth, bitpos;
5947 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
5949 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5950 == TYPE_PRECISION (char_type_node))
5954 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5955 == TYPE_PRECISION (wchar_type_node));
5956 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
5958 charwidth = TYPE_PRECISION (char_type_node);
5959 type = TREE_TYPE (constructor_type);
5960 p = TREE_STRING_POINTER (str);
5961 end = p + TREE_STRING_LENGTH (str);
5963 for (purpose = bitsize_zero_node;
5964 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
5965 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
5967 if (wchar_bytes == 1)
5969 val[1] = (unsigned char) *p++;
5976 for (byte = 0; byte < wchar_bytes; byte++)
5978 if (BYTES_BIG_ENDIAN)
5979 bitpos = (wchar_bytes - byte - 1) * charwidth;
5981 bitpos = byte * charwidth;
5982 val[bitpos < HOST_BITS_PER_WIDE_INT]
5983 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
5984 << (bitpos % HOST_BITS_PER_WIDE_INT);
5988 if (!TYPE_UNSIGNED (type))
5990 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
5991 if (bitpos < HOST_BITS_PER_WIDE_INT)
5993 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
5995 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
5999 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6004 else if (val[0] & (((HOST_WIDE_INT) 1)
6005 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6006 val[0] |= ((HOST_WIDE_INT) -1)
6007 << (bitpos - HOST_BITS_PER_WIDE_INT);
6010 value = build_int_cst_wide (type, val[1], val[0]);
6011 add_pending_init (purpose, value);
6014 constructor_incremental = 0;
6017 /* Return value of FIELD in pending initializer or zero if the field was
6018 not initialized yet. */
6021 find_init_member (tree field)
6023 struct init_node *p;
6025 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6027 if (constructor_incremental
6028 && tree_int_cst_lt (field, constructor_unfilled_index))
6029 set_nonincremental_init ();
6031 p = constructor_pending_elts;
6034 if (tree_int_cst_lt (field, p->purpose))
6036 else if (tree_int_cst_lt (p->purpose, field))
6042 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6044 tree bitpos = bit_position (field);
6046 if (constructor_incremental
6047 && (!constructor_unfilled_fields
6048 || tree_int_cst_lt (bitpos,
6049 bit_position (constructor_unfilled_fields))))
6050 set_nonincremental_init ();
6052 p = constructor_pending_elts;
6055 if (field == p->purpose)
6057 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6063 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6065 if (!VEC_empty (constructor_elt, constructor_elements)
6066 && (VEC_last (constructor_elt, constructor_elements)->index
6068 return VEC_last (constructor_elt, constructor_elements)->value;
6073 /* "Output" the next constructor element.
6074 At top level, really output it to assembler code now.
6075 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6076 TYPE is the data type that the containing data type wants here.
6077 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6078 If VALUE is a string constant, STRICT_STRING is true if it is
6079 unparenthesized or we should not warn here for it being parenthesized.
6080 For other types of VALUE, STRICT_STRING is not used.
6082 PENDING if non-nil means output pending elements that belong
6083 right after this element. (PENDING is normally 1;
6084 it is 0 while outputting pending elements, to avoid recursion.) */
6087 output_init_element (tree value, bool strict_string, tree type, tree field,
6090 constructor_elt *celt;
6092 if (type == error_mark_node || value == error_mark_node)
6094 constructor_erroneous = 1;
6097 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6098 && (TREE_CODE (value) == STRING_CST
6099 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6100 && !(TREE_CODE (value) == STRING_CST
6101 && TREE_CODE (type) == ARRAY_TYPE
6102 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6103 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6104 TYPE_MAIN_VARIANT (type)))
6105 value = array_to_pointer_conversion (value);
6107 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6108 && require_constant_value && !flag_isoc99 && pending)
6110 /* As an extension, allow initializing objects with static storage
6111 duration with compound literals (which are then treated just as
6112 the brace enclosed list they contain). */
6113 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6114 value = DECL_INITIAL (decl);
6117 if (value == error_mark_node)
6118 constructor_erroneous = 1;
6119 else if (!TREE_CONSTANT (value))
6120 constructor_constant = 0;
6121 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6122 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6123 || TREE_CODE (constructor_type) == UNION_TYPE)
6124 && DECL_C_BIT_FIELD (field)
6125 && TREE_CODE (value) != INTEGER_CST))
6126 constructor_simple = 0;
6128 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6130 if (require_constant_value)
6132 error_init ("initializer element is not constant");
6133 value = error_mark_node;
6135 else if (require_constant_elements)
6136 pedwarn ("initializer element is not computable at load time");
6139 /* If this field is empty (and not at the end of structure),
6140 don't do anything other than checking the initializer. */
6142 && (TREE_TYPE (field) == error_mark_node
6143 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6144 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6145 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6146 || TREE_CHAIN (field)))))
6149 value = digest_init (type, value, strict_string, require_constant_value);
6150 if (value == error_mark_node)
6152 constructor_erroneous = 1;
6156 /* If this element doesn't come next in sequence,
6157 put it on constructor_pending_elts. */
6158 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6159 && (!constructor_incremental
6160 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6162 if (constructor_incremental
6163 && tree_int_cst_lt (field, constructor_unfilled_index))
6164 set_nonincremental_init ();
6166 add_pending_init (field, value);
6169 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6170 && (!constructor_incremental
6171 || field != constructor_unfilled_fields))
6173 /* We do this for records but not for unions. In a union,
6174 no matter which field is specified, it can be initialized
6175 right away since it starts at the beginning of the union. */
6176 if (constructor_incremental)
6178 if (!constructor_unfilled_fields)
6179 set_nonincremental_init ();
6182 tree bitpos, unfillpos;
6184 bitpos = bit_position (field);
6185 unfillpos = bit_position (constructor_unfilled_fields);
6187 if (tree_int_cst_lt (bitpos, unfillpos))
6188 set_nonincremental_init ();
6192 add_pending_init (field, value);
6195 else if (TREE_CODE (constructor_type) == UNION_TYPE
6196 && !VEC_empty (constructor_elt, constructor_elements))
6198 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6199 constructor_elements)->value))
6200 warning_init ("initialized field with side-effects overwritten");
6202 /* We can have just one union field set. */
6203 constructor_elements = 0;
6206 /* Otherwise, output this element either to
6207 constructor_elements or to the assembler file. */
6209 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6210 celt->index = field;
6211 celt->value = value;
6213 /* Advance the variable that indicates sequential elements output. */
6214 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6215 constructor_unfilled_index
6216 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6218 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6220 constructor_unfilled_fields
6221 = TREE_CHAIN (constructor_unfilled_fields);
6223 /* Skip any nameless bit fields. */
6224 while (constructor_unfilled_fields != 0
6225 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6226 && DECL_NAME (constructor_unfilled_fields) == 0)
6227 constructor_unfilled_fields =
6228 TREE_CHAIN (constructor_unfilled_fields);
6230 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6231 constructor_unfilled_fields = 0;
6233 /* Now output any pending elements which have become next. */
6235 output_pending_init_elements (0);
6238 /* Output any pending elements which have become next.
6239 As we output elements, constructor_unfilled_{fields,index}
6240 advances, which may cause other elements to become next;
6241 if so, they too are output.
6243 If ALL is 0, we return when there are
6244 no more pending elements to output now.
6246 If ALL is 1, we output space as necessary so that
6247 we can output all the pending elements. */
6250 output_pending_init_elements (int all)
6252 struct init_node *elt = constructor_pending_elts;
6257 /* Look through the whole pending tree.
6258 If we find an element that should be output now,
6259 output it. Otherwise, set NEXT to the element
6260 that comes first among those still pending. */
6265 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6267 if (tree_int_cst_equal (elt->purpose,
6268 constructor_unfilled_index))
6269 output_init_element (elt->value, true,
6270 TREE_TYPE (constructor_type),
6271 constructor_unfilled_index, 0);
6272 else if (tree_int_cst_lt (constructor_unfilled_index,
6275 /* Advance to the next smaller node. */
6280 /* We have reached the smallest node bigger than the
6281 current unfilled index. Fill the space first. */
6282 next = elt->purpose;
6288 /* Advance to the next bigger node. */
6293 /* We have reached the biggest node in a subtree. Find
6294 the parent of it, which is the next bigger node. */
6295 while (elt->parent && elt->parent->right == elt)
6298 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6301 next = elt->purpose;
6307 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6308 || TREE_CODE (constructor_type) == UNION_TYPE)
6310 tree ctor_unfilled_bitpos, elt_bitpos;
6312 /* If the current record is complete we are done. */
6313 if (constructor_unfilled_fields == 0)
6316 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6317 elt_bitpos = bit_position (elt->purpose);
6318 /* We can't compare fields here because there might be empty
6319 fields in between. */
6320 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6322 constructor_unfilled_fields = elt->purpose;
6323 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6326 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6328 /* Advance to the next smaller node. */
6333 /* We have reached the smallest node bigger than the
6334 current unfilled field. Fill the space first. */
6335 next = elt->purpose;
6341 /* Advance to the next bigger node. */
6346 /* We have reached the biggest node in a subtree. Find
6347 the parent of it, which is the next bigger node. */
6348 while (elt->parent && elt->parent->right == elt)
6352 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6353 bit_position (elt->purpose))))
6355 next = elt->purpose;
6363 /* Ordinarily return, but not if we want to output all
6364 and there are elements left. */
6365 if (!(all && next != 0))
6368 /* If it's not incremental, just skip over the gap, so that after
6369 jumping to retry we will output the next successive element. */
6370 if (TREE_CODE (constructor_type) == RECORD_TYPE
6371 || TREE_CODE (constructor_type) == UNION_TYPE)
6372 constructor_unfilled_fields = next;
6373 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6374 constructor_unfilled_index = next;
6376 /* ELT now points to the node in the pending tree with the next
6377 initializer to output. */
6381 /* Add one non-braced element to the current constructor level.
6382 This adjusts the current position within the constructor's type.
6383 This may also start or terminate implicit levels
6384 to handle a partly-braced initializer.
6386 Once this has found the correct level for the new element,
6387 it calls output_init_element. */
6390 process_init_element (struct c_expr value)
6392 tree orig_value = value.value;
6393 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6394 bool strict_string = value.original_code == STRING_CST;
6396 designator_depth = 0;
6397 designator_erroneous = 0;
6399 /* Handle superfluous braces around string cst as in
6400 char x[] = {"foo"}; */
6403 && TREE_CODE (constructor_type) == ARRAY_TYPE
6404 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6405 && integer_zerop (constructor_unfilled_index))
6407 if (constructor_stack->replacement_value.value)
6408 error_init ("excess elements in char array initializer");
6409 constructor_stack->replacement_value = value;
6413 if (constructor_stack->replacement_value.value != 0)
6415 error_init ("excess elements in struct initializer");
6419 /* Ignore elements of a brace group if it is entirely superfluous
6420 and has already been diagnosed. */
6421 if (constructor_type == 0)
6424 /* If we've exhausted any levels that didn't have braces,
6426 while (constructor_stack->implicit)
6428 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6429 || TREE_CODE (constructor_type) == UNION_TYPE)
6430 && constructor_fields == 0)
6431 process_init_element (pop_init_level (1));
6432 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6433 && (constructor_max_index == 0
6434 || tree_int_cst_lt (constructor_max_index,
6435 constructor_index)))
6436 process_init_element (pop_init_level (1));
6441 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6442 if (constructor_range_stack)
6444 /* If value is a compound literal and we'll be just using its
6445 content, don't put it into a SAVE_EXPR. */
6446 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6447 || !require_constant_value
6449 value.value = save_expr (value.value);
6454 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6457 enum tree_code fieldcode;
6459 if (constructor_fields == 0)
6461 pedwarn_init ("excess elements in struct initializer");
6465 fieldtype = TREE_TYPE (constructor_fields);
6466 if (fieldtype != error_mark_node)
6467 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6468 fieldcode = TREE_CODE (fieldtype);
6470 /* Error for non-static initialization of a flexible array member. */
6471 if (fieldcode == ARRAY_TYPE
6472 && !require_constant_value
6473 && TYPE_SIZE (fieldtype) == NULL_TREE
6474 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6476 error_init ("non-static initialization of a flexible array member");
6480 /* Accept a string constant to initialize a subarray. */
6481 if (value.value != 0
6482 && fieldcode == ARRAY_TYPE
6483 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6485 value.value = orig_value;
6486 /* Otherwise, if we have come to a subaggregate,
6487 and we don't have an element of its type, push into it. */
6488 else if (value.value != 0
6489 && value.value != error_mark_node
6490 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6491 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6492 || fieldcode == UNION_TYPE))
6494 push_init_level (1);
6500 push_member_name (constructor_fields);
6501 output_init_element (value.value, strict_string,
6502 fieldtype, constructor_fields, 1);
6503 RESTORE_SPELLING_DEPTH (constructor_depth);
6506 /* Do the bookkeeping for an element that was
6507 directly output as a constructor. */
6509 /* For a record, keep track of end position of last field. */
6510 if (DECL_SIZE (constructor_fields))
6511 constructor_bit_index
6512 = size_binop (PLUS_EXPR,
6513 bit_position (constructor_fields),
6514 DECL_SIZE (constructor_fields));
6516 /* If the current field was the first one not yet written out,
6517 it isn't now, so update. */
6518 if (constructor_unfilled_fields == constructor_fields)
6520 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6521 /* Skip any nameless bit fields. */
6522 while (constructor_unfilled_fields != 0
6523 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6524 && DECL_NAME (constructor_unfilled_fields) == 0)
6525 constructor_unfilled_fields =
6526 TREE_CHAIN (constructor_unfilled_fields);
6530 constructor_fields = TREE_CHAIN (constructor_fields);
6531 /* Skip any nameless bit fields at the beginning. */
6532 while (constructor_fields != 0
6533 && DECL_C_BIT_FIELD (constructor_fields)
6534 && DECL_NAME (constructor_fields) == 0)
6535 constructor_fields = TREE_CHAIN (constructor_fields);
6537 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6540 enum tree_code fieldcode;
6542 if (constructor_fields == 0)
6544 pedwarn_init ("excess elements in union initializer");
6548 fieldtype = TREE_TYPE (constructor_fields);
6549 if (fieldtype != error_mark_node)
6550 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6551 fieldcode = TREE_CODE (fieldtype);
6553 /* Warn that traditional C rejects initialization of unions.
6554 We skip the warning if the value is zero. This is done
6555 under the assumption that the zero initializer in user
6556 code appears conditioned on e.g. __STDC__ to avoid
6557 "missing initializer" warnings and relies on default
6558 initialization to zero in the traditional C case.
6559 We also skip the warning if the initializer is designated,
6560 again on the assumption that this must be conditional on
6561 __STDC__ anyway (and we've already complained about the
6562 member-designator already). */
6563 if (!in_system_header && !constructor_designated
6564 && !(value.value && (integer_zerop (value.value)
6565 || real_zerop (value.value))))
6566 warning (OPT_Wtraditional, "traditional C rejects initialization "
6569 /* Accept a string constant to initialize a subarray. */
6570 if (value.value != 0
6571 && fieldcode == ARRAY_TYPE
6572 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6574 value.value = orig_value;
6575 /* Otherwise, if we have come to a subaggregate,
6576 and we don't have an element of its type, push into it. */
6577 else if (value.value != 0
6578 && value.value != error_mark_node
6579 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6580 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6581 || fieldcode == UNION_TYPE))
6583 push_init_level (1);
6589 push_member_name (constructor_fields);
6590 output_init_element (value.value, strict_string,
6591 fieldtype, constructor_fields, 1);
6592 RESTORE_SPELLING_DEPTH (constructor_depth);
6595 /* Do the bookkeeping for an element that was
6596 directly output as a constructor. */
6598 constructor_bit_index = DECL_SIZE (constructor_fields);
6599 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6602 constructor_fields = 0;
6604 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6606 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6607 enum tree_code eltcode = TREE_CODE (elttype);
6609 /* Accept a string constant to initialize a subarray. */
6610 if (value.value != 0
6611 && eltcode == ARRAY_TYPE
6612 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6614 value.value = orig_value;
6615 /* Otherwise, if we have come to a subaggregate,
6616 and we don't have an element of its type, push into it. */
6617 else if (value.value != 0
6618 && value.value != error_mark_node
6619 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6620 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6621 || eltcode == UNION_TYPE))
6623 push_init_level (1);
6627 if (constructor_max_index != 0
6628 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6629 || integer_all_onesp (constructor_max_index)))
6631 pedwarn_init ("excess elements in array initializer");
6635 /* Now output the actual element. */
6638 push_array_bounds (tree_low_cst (constructor_index, 1));
6639 output_init_element (value.value, strict_string,
6640 elttype, constructor_index, 1);
6641 RESTORE_SPELLING_DEPTH (constructor_depth);
6645 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6648 /* If we are doing the bookkeeping for an element that was
6649 directly output as a constructor, we must update
6650 constructor_unfilled_index. */
6651 constructor_unfilled_index = constructor_index;
6653 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6655 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6657 /* Do a basic check of initializer size. Note that vectors
6658 always have a fixed size derived from their type. */
6659 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6661 pedwarn_init ("excess elements in vector initializer");
6665 /* Now output the actual element. */
6667 output_init_element (value.value, strict_string,
6668 elttype, constructor_index, 1);
6671 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6674 /* If we are doing the bookkeeping for an element that was
6675 directly output as a constructor, we must update
6676 constructor_unfilled_index. */
6677 constructor_unfilled_index = constructor_index;
6680 /* Handle the sole element allowed in a braced initializer
6681 for a scalar variable. */
6682 else if (constructor_type != error_mark_node
6683 && constructor_fields == 0)
6685 pedwarn_init ("excess elements in scalar initializer");
6691 output_init_element (value.value, strict_string,
6692 constructor_type, NULL_TREE, 1);
6693 constructor_fields = 0;
6696 /* Handle range initializers either at this level or anywhere higher
6697 in the designator stack. */
6698 if (constructor_range_stack)
6700 struct constructor_range_stack *p, *range_stack;
6703 range_stack = constructor_range_stack;
6704 constructor_range_stack = 0;
6705 while (constructor_stack != range_stack->stack)
6707 gcc_assert (constructor_stack->implicit);
6708 process_init_element (pop_init_level (1));
6710 for (p = range_stack;
6711 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6714 gcc_assert (constructor_stack->implicit);
6715 process_init_element (pop_init_level (1));
6718 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6719 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6724 constructor_index = p->index;
6725 constructor_fields = p->fields;
6726 if (finish && p->range_end && p->index == p->range_start)
6734 push_init_level (2);
6735 p->stack = constructor_stack;
6736 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6737 p->index = p->range_start;
6741 constructor_range_stack = range_stack;
6748 constructor_range_stack = 0;
6751 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6752 (guaranteed to be 'volatile' or null) and ARGS (represented using
6753 an ASM_EXPR node). */
6755 build_asm_stmt (tree cv_qualifier, tree args)
6757 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6758 ASM_VOLATILE_P (args) = 1;
6759 return add_stmt (args);
6762 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6763 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6764 SIMPLE indicates whether there was anything at all after the
6765 string in the asm expression -- asm("blah") and asm("blah" : )
6766 are subtly different. We use a ASM_EXPR node to represent this. */
6768 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6774 const char *constraint;
6775 const char **oconstraints;
6776 bool allows_mem, allows_reg, is_inout;
6777 int ninputs, noutputs;
6779 ninputs = list_length (inputs);
6780 noutputs = list_length (outputs);
6781 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
6783 string = resolve_asm_operand_names (string, outputs, inputs);
6785 /* Remove output conversions that change the type but not the mode. */
6786 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6788 tree output = TREE_VALUE (tail);
6790 /* ??? Really, this should not be here. Users should be using a
6791 proper lvalue, dammit. But there's a long history of using casts
6792 in the output operands. In cases like longlong.h, this becomes a
6793 primitive form of typechecking -- if the cast can be removed, then
6794 the output operand had a type of the proper width; otherwise we'll
6795 get an error. Gross, but ... */
6796 STRIP_NOPS (output);
6798 if (!lvalue_or_else (output, lv_asm))
6799 output = error_mark_node;
6801 if (output != error_mark_node
6802 && (TREE_READONLY (output)
6803 || TYPE_READONLY (TREE_TYPE (output))
6804 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
6805 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
6806 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
6807 readonly_error (output, lv_asm);
6809 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6810 oconstraints[i] = constraint;
6812 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6813 &allows_mem, &allows_reg, &is_inout))
6815 /* If the operand is going to end up in memory,
6816 mark it addressable. */
6817 if (!allows_reg && !c_mark_addressable (output))
6818 output = error_mark_node;
6821 output = error_mark_node;
6823 TREE_VALUE (tail) = output;
6826 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
6830 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6831 input = TREE_VALUE (tail);
6833 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
6834 oconstraints, &allows_mem, &allows_reg))
6836 /* If the operand is going to end up in memory,
6837 mark it addressable. */
6838 if (!allows_reg && allows_mem)
6840 /* Strip the nops as we allow this case. FIXME, this really
6841 should be rejected or made deprecated. */
6843 if (!c_mark_addressable (input))
6844 input = error_mark_node;
6848 input = error_mark_node;
6850 TREE_VALUE (tail) = input;
6853 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
6855 /* asm statements without outputs, including simple ones, are treated
6857 ASM_INPUT_P (args) = simple;
6858 ASM_VOLATILE_P (args) = (noutputs == 0);
6863 /* Generate a goto statement to LABEL. */
6866 c_finish_goto_label (tree label)
6868 tree decl = lookup_label (label);
6872 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
6874 error ("jump into statement expression");
6878 if (C_DECL_UNJUMPABLE_VM (decl))
6880 error ("jump into scope of identifier with variably modified type");
6884 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
6886 /* No jump from outside this statement expression context, so
6887 record that there is a jump from within this context. */
6888 struct c_label_list *nlist;
6889 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6890 nlist->next = label_context_stack_se->labels_used;
6891 nlist->label = decl;
6892 label_context_stack_se->labels_used = nlist;
6895 if (!C_DECL_UNDEFINABLE_VM (decl))
6897 /* No jump from outside this context context of identifiers with
6898 variably modified type, so record that there is a jump from
6899 within this context. */
6900 struct c_label_list *nlist;
6901 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6902 nlist->next = label_context_stack_vm->labels_used;
6903 nlist->label = decl;
6904 label_context_stack_vm->labels_used = nlist;
6907 TREE_USED (decl) = 1;
6908 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
6911 /* Generate a computed goto statement to EXPR. */
6914 c_finish_goto_ptr (tree expr)
6917 pedwarn ("ISO C forbids %<goto *expr;%>");
6918 expr = convert (ptr_type_node, expr);
6919 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
6922 /* Generate a C `return' statement. RETVAL is the expression for what
6923 to return, or a null pointer for `return;' with no value. */
6926 c_finish_return (tree retval)
6928 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
6929 bool no_warning = false;
6931 if (TREE_THIS_VOLATILE (current_function_decl))
6932 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6936 current_function_returns_null = 1;
6937 if ((warn_return_type || flag_isoc99)
6938 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
6940 pedwarn_c99 ("%<return%> with no value, in "
6941 "function returning non-void");
6945 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
6947 current_function_returns_null = 1;
6948 if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
6949 pedwarn ("%<return%> with a value, in function returning void");
6953 tree t = convert_for_assignment (valtype, retval, ic_return,
6954 NULL_TREE, NULL_TREE, 0);
6955 tree res = DECL_RESULT (current_function_decl);
6958 current_function_returns_value = 1;
6959 if (t == error_mark_node)
6962 inner = t = convert (TREE_TYPE (res), t);
6964 /* Strip any conversions, additions, and subtractions, and see if
6965 we are returning the address of a local variable. Warn if so. */
6968 switch (TREE_CODE (inner))
6970 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6972 inner = TREE_OPERAND (inner, 0);
6976 /* If the second operand of the MINUS_EXPR has a pointer
6977 type (or is converted from it), this may be valid, so
6978 don't give a warning. */
6980 tree op1 = TREE_OPERAND (inner, 1);
6982 while (!POINTER_TYPE_P (TREE_TYPE (op1))
6983 && (TREE_CODE (op1) == NOP_EXPR
6984 || TREE_CODE (op1) == NON_LVALUE_EXPR
6985 || TREE_CODE (op1) == CONVERT_EXPR))
6986 op1 = TREE_OPERAND (op1, 0);
6988 if (POINTER_TYPE_P (TREE_TYPE (op1)))
6991 inner = TREE_OPERAND (inner, 0);
6996 inner = TREE_OPERAND (inner, 0);
6998 while (REFERENCE_CLASS_P (inner)
6999 && TREE_CODE (inner) != INDIRECT_REF)
7000 inner = TREE_OPERAND (inner, 0);
7003 && !DECL_EXTERNAL (inner)
7004 && !TREE_STATIC (inner)
7005 && DECL_CONTEXT (inner) == current_function_decl)
7006 warning (0, "function returns address of local variable");
7016 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7019 ret_stmt = build_stmt (RETURN_EXPR, retval);
7020 TREE_NO_WARNING (ret_stmt) |= no_warning;
7021 return add_stmt (ret_stmt);
7025 /* The SWITCH_EXPR being built. */
7028 /* The original type of the testing expression, i.e. before the
7029 default conversion is applied. */
7032 /* A splay-tree mapping the low element of a case range to the high
7033 element, or NULL_TREE if there is no high element. Used to
7034 determine whether or not a new case label duplicates an old case
7035 label. We need a tree, rather than simply a hash table, because
7036 of the GNU case range extension. */
7039 /* Number of nested statement expressions within this switch
7040 statement; if nonzero, case and default labels may not
7042 unsigned int blocked_stmt_expr;
7044 /* Scope of outermost declarations of identifiers with variably
7045 modified type within this switch statement; if nonzero, case and
7046 default labels may not appear. */
7047 unsigned int blocked_vm;
7049 /* The next node on the stack. */
7050 struct c_switch *next;
7053 /* A stack of the currently active switch statements. The innermost
7054 switch statement is on the top of the stack. There is no need to
7055 mark the stack for garbage collection because it is only active
7056 during the processing of the body of a function, and we never
7057 collect at that point. */
7059 struct c_switch *c_switch_stack;
7061 /* Start a C switch statement, testing expression EXP. Return the new
7065 c_start_case (tree exp)
7067 tree orig_type = error_mark_node;
7068 struct c_switch *cs;
7070 if (exp != error_mark_node)
7072 orig_type = TREE_TYPE (exp);
7074 if (!INTEGRAL_TYPE_P (orig_type))
7076 if (orig_type != error_mark_node)
7078 error ("switch quantity not an integer");
7079 orig_type = error_mark_node;
7081 exp = integer_zero_node;
7085 tree type = TYPE_MAIN_VARIANT (orig_type);
7087 if (!in_system_header
7088 && (type == long_integer_type_node
7089 || type == long_unsigned_type_node))
7090 warning (OPT_Wtraditional, "%<long%> switch expression not "
7091 "converted to %<int%> in ISO C");
7093 exp = default_conversion (exp);
7097 /* Add this new SWITCH_EXPR to the stack. */
7098 cs = XNEW (struct c_switch);
7099 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7100 cs->orig_type = orig_type;
7101 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7102 cs->blocked_stmt_expr = 0;
7104 cs->next = c_switch_stack;
7105 c_switch_stack = cs;
7107 return add_stmt (cs->switch_expr);
7110 /* Process a case label. */
7113 do_case (tree low_value, tree high_value)
7115 tree label = NULL_TREE;
7117 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7118 && !c_switch_stack->blocked_vm)
7120 label = c_add_case_label (c_switch_stack->cases,
7121 SWITCH_COND (c_switch_stack->switch_expr),
7122 c_switch_stack->orig_type,
7123 low_value, high_value);
7124 if (label == error_mark_node)
7127 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7130 error ("case label in statement expression not containing "
7131 "enclosing switch statement");
7133 error ("%<default%> label in statement expression not containing "
7134 "enclosing switch statement");
7136 else if (c_switch_stack && c_switch_stack->blocked_vm)
7139 error ("case label in scope of identifier with variably modified "
7140 "type not containing enclosing switch statement");
7142 error ("%<default%> label in scope of identifier with variably "
7143 "modified type not containing enclosing switch statement");
7146 error ("case label not within a switch statement");
7148 error ("%<default%> label not within a switch statement");
7153 /* Finish the switch statement. */
7156 c_finish_case (tree body)
7158 struct c_switch *cs = c_switch_stack;
7159 location_t switch_location;
7161 SWITCH_BODY (cs->switch_expr) = body;
7163 /* We must not be within a statement expression nested in the switch
7164 at this point; we might, however, be within the scope of an
7165 identifier with variably modified type nested in the switch. */
7166 gcc_assert (!cs->blocked_stmt_expr);
7168 /* Emit warnings as needed. */
7169 if (EXPR_HAS_LOCATION (cs->switch_expr))
7170 switch_location = EXPR_LOCATION (cs->switch_expr);
7172 switch_location = input_location;
7173 c_do_switch_warnings (cs->cases, switch_location,
7174 TREE_TYPE (cs->switch_expr),
7175 SWITCH_COND (cs->switch_expr));
7177 /* Pop the stack. */
7178 c_switch_stack = cs->next;
7179 splay_tree_delete (cs->cases);
7183 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7184 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7185 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7186 statement, and was not surrounded with parenthesis. */
7189 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7190 tree else_block, bool nested_if)
7194 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7195 if (warn_parentheses && nested_if && else_block == NULL)
7197 tree inner_if = then_block;
7199 /* We know from the grammar productions that there is an IF nested
7200 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7201 it might not be exactly THEN_BLOCK, but should be the last
7202 non-container statement within. */
7204 switch (TREE_CODE (inner_if))
7209 inner_if = BIND_EXPR_BODY (inner_if);
7211 case STATEMENT_LIST:
7212 inner_if = expr_last (then_block);
7214 case TRY_FINALLY_EXPR:
7215 case TRY_CATCH_EXPR:
7216 inner_if = TREE_OPERAND (inner_if, 0);
7223 if (COND_EXPR_ELSE (inner_if))
7224 warning (OPT_Wparentheses,
7225 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7229 empty_body_warning (then_block, else_block);
7231 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7232 SET_EXPR_LOCATION (stmt, if_locus);
7236 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7237 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7238 is false for DO loops. INCR is the FOR increment expression. BODY is
7239 the statement controlled by the loop. BLAB is the break label. CLAB is
7240 the continue label. Everything is allowed to be NULL. */
7243 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7244 tree blab, tree clab, bool cond_is_first)
7246 tree entry = NULL, exit = NULL, t;
7248 /* If the condition is zero don't generate a loop construct. */
7249 if (cond && integer_zerop (cond))
7253 t = build_and_jump (&blab);
7254 SET_EXPR_LOCATION (t, start_locus);
7260 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7262 /* If we have an exit condition, then we build an IF with gotos either
7263 out of the loop, or to the top of it. If there's no exit condition,
7264 then we just build a jump back to the top. */
7265 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7267 if (cond && !integer_nonzerop (cond))
7269 /* Canonicalize the loop condition to the end. This means
7270 generating a branch to the loop condition. Reuse the
7271 continue label, if possible. */
7276 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7277 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7280 t = build1 (GOTO_EXPR, void_type_node, clab);
7281 SET_EXPR_LOCATION (t, start_locus);
7285 t = build_and_jump (&blab);
7286 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7288 SET_EXPR_LOCATION (exit, start_locus);
7290 SET_EXPR_LOCATION (exit, input_location);
7299 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7307 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7311 c_finish_bc_stmt (tree *label_p, bool is_break)
7314 tree label = *label_p;
7316 /* In switch statements break is sometimes stylistically used after
7317 a return statement. This can lead to spurious warnings about
7318 control reaching the end of a non-void function when it is
7319 inlined. Note that we are calling block_may_fallthru with
7320 language specific tree nodes; this works because
7321 block_may_fallthru returns true when given something it does not
7323 skip = !block_may_fallthru (cur_stmt_list);
7328 *label_p = label = create_artificial_label ();
7330 else if (TREE_CODE (label) == LABEL_DECL)
7332 else switch (TREE_INT_CST_LOW (label))
7336 error ("break statement not within loop or switch");
7338 error ("continue statement not within a loop");
7342 gcc_assert (is_break);
7343 error ("break statement used with OpenMP for loop");
7353 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7356 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7359 emit_side_effect_warnings (tree expr)
7361 if (expr == error_mark_node)
7363 else if (!TREE_SIDE_EFFECTS (expr))
7365 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7366 warning (0, "%Hstatement with no effect",
7367 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7369 else if (warn_unused_value)
7370 warn_if_unused_value (expr, input_location);
7373 /* Process an expression as if it were a complete statement. Emit
7374 diagnostics, but do not call ADD_STMT. */
7377 c_process_expr_stmt (tree expr)
7382 if (warn_sequence_point)
7383 verify_sequence_points (expr);
7385 if (TREE_TYPE (expr) != error_mark_node
7386 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7387 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7388 error ("expression statement has incomplete type");
7390 /* If we're not processing a statement expression, warn about unused values.
7391 Warnings for statement expressions will be emitted later, once we figure
7392 out which is the result. */
7393 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7394 && (extra_warnings || warn_unused_value))
7395 emit_side_effect_warnings (expr);
7397 /* If the expression is not of a type to which we cannot assign a line
7398 number, wrap the thing in a no-op NOP_EXPR. */
7399 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7400 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7403 SET_EXPR_LOCATION (expr, input_location);
7408 /* Emit an expression as a statement. */
7411 c_finish_expr_stmt (tree expr)
7414 return add_stmt (c_process_expr_stmt (expr));
7419 /* Do the opposite and emit a statement as an expression. To begin,
7420 create a new binding level and return it. */
7423 c_begin_stmt_expr (void)
7426 struct c_label_context_se *nstack;
7427 struct c_label_list *glist;
7429 /* We must force a BLOCK for this level so that, if it is not expanded
7430 later, there is a way to turn off the entire subtree of blocks that
7431 are contained in it. */
7433 ret = c_begin_compound_stmt (true);
7436 c_switch_stack->blocked_stmt_expr++;
7437 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7439 for (glist = label_context_stack_se->labels_used;
7441 glist = glist->next)
7443 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7445 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7446 nstack->labels_def = NULL;
7447 nstack->labels_used = NULL;
7448 nstack->next = label_context_stack_se;
7449 label_context_stack_se = nstack;
7451 /* Mark the current statement list as belonging to a statement list. */
7452 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7458 c_finish_stmt_expr (tree body)
7460 tree last, type, tmp, val;
7462 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7464 body = c_end_compound_stmt (body, true);
7467 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7468 c_switch_stack->blocked_stmt_expr--;
7470 /* It is no longer possible to jump to labels defined within this
7471 statement expression. */
7472 for (dlist = label_context_stack_se->labels_def;
7474 dlist = dlist->next)
7476 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7478 /* It is again possible to define labels with a goto just outside
7479 this statement expression. */
7480 for (glist = label_context_stack_se->next->labels_used;
7482 glist = glist->next)
7484 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7487 if (glist_prev != NULL)
7488 glist_prev->next = label_context_stack_se->labels_used;
7490 label_context_stack_se->next->labels_used
7491 = label_context_stack_se->labels_used;
7492 label_context_stack_se = label_context_stack_se->next;
7494 /* Locate the last statement in BODY. See c_end_compound_stmt
7495 about always returning a BIND_EXPR. */
7496 last_p = &BIND_EXPR_BODY (body);
7497 last = BIND_EXPR_BODY (body);
7500 if (TREE_CODE (last) == STATEMENT_LIST)
7502 tree_stmt_iterator i;
7504 /* This can happen with degenerate cases like ({ }). No value. */
7505 if (!TREE_SIDE_EFFECTS (last))
7508 /* If we're supposed to generate side effects warnings, process
7509 all of the statements except the last. */
7510 if (extra_warnings || warn_unused_value)
7512 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7513 emit_side_effect_warnings (tsi_stmt (i));
7516 i = tsi_last (last);
7517 last_p = tsi_stmt_ptr (i);
7521 /* If the end of the list is exception related, then the list was split
7522 by a call to push_cleanup. Continue searching. */
7523 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7524 || TREE_CODE (last) == TRY_CATCH_EXPR)
7526 last_p = &TREE_OPERAND (last, 0);
7528 goto continue_searching;
7531 /* In the case that the BIND_EXPR is not necessary, return the
7532 expression out from inside it. */
7533 if (last == error_mark_node
7534 || (last == BIND_EXPR_BODY (body)
7535 && BIND_EXPR_VARS (body) == NULL))
7537 /* Do not warn if the return value of a statement expression is
7540 TREE_NO_WARNING (last) = 1;
7544 /* Extract the type of said expression. */
7545 type = TREE_TYPE (last);
7547 /* If we're not returning a value at all, then the BIND_EXPR that
7548 we already have is a fine expression to return. */
7549 if (!type || VOID_TYPE_P (type))
7552 /* Now that we've located the expression containing the value, it seems
7553 silly to make voidify_wrapper_expr repeat the process. Create a
7554 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7555 tmp = create_tmp_var_raw (type, NULL);
7557 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7558 tree_expr_nonnegative_p giving up immediately. */
7560 if (TREE_CODE (val) == NOP_EXPR
7561 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7562 val = TREE_OPERAND (val, 0);
7564 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7565 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7567 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7570 /* Begin the scope of an identifier of variably modified type, scope
7571 number SCOPE. Jumping from outside this scope to inside it is not
7575 c_begin_vm_scope (unsigned int scope)
7577 struct c_label_context_vm *nstack;
7578 struct c_label_list *glist;
7580 gcc_assert (scope > 0);
7582 /* At file_scope, we don't have to do any processing. */
7583 if (label_context_stack_vm == NULL)
7586 if (c_switch_stack && !c_switch_stack->blocked_vm)
7587 c_switch_stack->blocked_vm = scope;
7588 for (glist = label_context_stack_vm->labels_used;
7590 glist = glist->next)
7592 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7594 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7595 nstack->labels_def = NULL;
7596 nstack->labels_used = NULL;
7597 nstack->scope = scope;
7598 nstack->next = label_context_stack_vm;
7599 label_context_stack_vm = nstack;
7602 /* End a scope which may contain identifiers of variably modified
7603 type, scope number SCOPE. */
7606 c_end_vm_scope (unsigned int scope)
7608 if (label_context_stack_vm == NULL)
7610 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7611 c_switch_stack->blocked_vm = 0;
7612 /* We may have a number of nested scopes of identifiers with
7613 variably modified type, all at this depth. Pop each in turn. */
7614 while (label_context_stack_vm->scope == scope)
7616 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7618 /* It is no longer possible to jump to labels defined within this
7620 for (dlist = label_context_stack_vm->labels_def;
7622 dlist = dlist->next)
7624 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7626 /* It is again possible to define labels with a goto just outside
7628 for (glist = label_context_stack_vm->next->labels_used;
7630 glist = glist->next)
7632 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7635 if (glist_prev != NULL)
7636 glist_prev->next = label_context_stack_vm->labels_used;
7638 label_context_stack_vm->next->labels_used
7639 = label_context_stack_vm->labels_used;
7640 label_context_stack_vm = label_context_stack_vm->next;
7644 /* Begin and end compound statements. This is as simple as pushing
7645 and popping new statement lists from the tree. */
7648 c_begin_compound_stmt (bool do_scope)
7650 tree stmt = push_stmt_list ();
7657 c_end_compound_stmt (tree stmt, bool do_scope)
7663 if (c_dialect_objc ())
7664 objc_clear_super_receiver ();
7665 block = pop_scope ();
7668 stmt = pop_stmt_list (stmt);
7669 stmt = c_build_bind_expr (block, stmt);
7671 /* If this compound statement is nested immediately inside a statement
7672 expression, then force a BIND_EXPR to be created. Otherwise we'll
7673 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7674 STATEMENT_LISTs merge, and thus we can lose track of what statement
7677 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7678 && TREE_CODE (stmt) != BIND_EXPR)
7680 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7681 TREE_SIDE_EFFECTS (stmt) = 1;
7687 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7688 when the current scope is exited. EH_ONLY is true when this is not
7689 meant to apply to normal control flow transfer. */
7692 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7694 enum tree_code code;
7698 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7699 stmt = build_stmt (code, NULL, cleanup);
7701 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7702 list = push_stmt_list ();
7703 TREE_OPERAND (stmt, 0) = list;
7704 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7707 /* Build a binary-operation expression without default conversions.
7708 CODE is the kind of expression to build.
7709 This function differs from `build' in several ways:
7710 the data type of the result is computed and recorded in it,
7711 warnings are generated if arg data types are invalid,
7712 special handling for addition and subtraction of pointers is known,
7713 and some optimization is done (operations on narrow ints
7714 are done in the narrower type when that gives the same result).
7715 Constant folding is also done before the result is returned.
7717 Note that the operands will never have enumeral types, or function
7718 or array types, because either they will have the default conversions
7719 performed or they have both just been converted to some other type in which
7720 the arithmetic is to be done. */
7723 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
7727 enum tree_code code0, code1;
7729 const char *invalid_op_diag;
7731 /* Expression code to give to the expression when it is built.
7732 Normally this is CODE, which is what the caller asked for,
7733 but in some special cases we change it. */
7734 enum tree_code resultcode = code;
7736 /* Data type in which the computation is to be performed.
7737 In the simplest cases this is the common type of the arguments. */
7738 tree result_type = NULL;
7740 /* Nonzero means operands have already been type-converted
7741 in whatever way is necessary.
7742 Zero means they need to be converted to RESULT_TYPE. */
7745 /* Nonzero means create the expression with this type, rather than
7747 tree build_type = 0;
7749 /* Nonzero means after finally constructing the expression
7750 convert it to this type. */
7751 tree final_type = 0;
7753 /* Nonzero if this is an operation like MIN or MAX which can
7754 safely be computed in short if both args are promoted shorts.
7755 Also implies COMMON.
7756 -1 indicates a bitwise operation; this makes a difference
7757 in the exact conditions for when it is safe to do the operation
7758 in a narrower mode. */
7761 /* Nonzero if this is a comparison operation;
7762 if both args are promoted shorts, compare the original shorts.
7763 Also implies COMMON. */
7764 int short_compare = 0;
7766 /* Nonzero if this is a right-shift operation, which can be computed on the
7767 original short and then promoted if the operand is a promoted short. */
7768 int short_shift = 0;
7770 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7773 /* True means types are compatible as far as ObjC is concerned. */
7778 op0 = default_conversion (orig_op0);
7779 op1 = default_conversion (orig_op1);
7787 type0 = TREE_TYPE (op0);
7788 type1 = TREE_TYPE (op1);
7790 /* The expression codes of the data types of the arguments tell us
7791 whether the arguments are integers, floating, pointers, etc. */
7792 code0 = TREE_CODE (type0);
7793 code1 = TREE_CODE (type1);
7795 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7796 STRIP_TYPE_NOPS (op0);
7797 STRIP_TYPE_NOPS (op1);
7799 /* If an error was already reported for one of the arguments,
7800 avoid reporting another error. */
7802 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7803 return error_mark_node;
7805 if ((invalid_op_diag
7806 = targetm.invalid_binary_op (code, type0, type1)))
7808 error (invalid_op_diag);
7809 return error_mark_node;
7812 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
7817 /* Handle the pointer + int case. */
7818 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7819 return pointer_int_sum (PLUS_EXPR, op0, op1);
7820 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
7821 return pointer_int_sum (PLUS_EXPR, op1, op0);
7827 /* Subtraction of two similar pointers.
7828 We must subtract them as integers, then divide by object size. */
7829 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
7830 && comp_target_types (type0, type1))
7831 return pointer_diff (op0, op1);
7832 /* Handle pointer minus int. Just like pointer plus int. */
7833 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7834 return pointer_int_sum (MINUS_EXPR, op0, op1);
7843 case TRUNC_DIV_EXPR:
7845 case FLOOR_DIV_EXPR:
7846 case ROUND_DIV_EXPR:
7847 case EXACT_DIV_EXPR:
7848 /* Floating point division by zero is a legitimate way to obtain
7849 infinities and NaNs. */
7850 if (skip_evaluation == 0 && integer_zerop (op1))
7851 warning (OPT_Wdiv_by_zero, "division by zero");
7853 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7854 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7855 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7856 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
7858 enum tree_code tcode0 = code0, tcode1 = code1;
7860 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7861 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
7862 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
7863 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
7865 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
7866 resultcode = RDIV_EXPR;
7868 /* Although it would be tempting to shorten always here, that
7869 loses on some targets, since the modulo instruction is
7870 undefined if the quotient can't be represented in the
7871 computation mode. We shorten only if unsigned or if
7872 dividing by something we know != -1. */
7873 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7874 || (TREE_CODE (op1) == INTEGER_CST
7875 && !integer_all_onesp (op1)));
7883 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7885 else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
7889 case TRUNC_MOD_EXPR:
7890 case FLOOR_MOD_EXPR:
7891 if (skip_evaluation == 0 && integer_zerop (op1))
7892 warning (OPT_Wdiv_by_zero, "division by zero");
7894 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7896 /* Although it would be tempting to shorten always here, that loses
7897 on some targets, since the modulo instruction is undefined if the
7898 quotient can't be represented in the computation mode. We shorten
7899 only if unsigned or if dividing by something we know != -1. */
7900 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7901 || (TREE_CODE (op1) == INTEGER_CST
7902 && !integer_all_onesp (op1)));
7907 case TRUTH_ANDIF_EXPR:
7908 case TRUTH_ORIF_EXPR:
7909 case TRUTH_AND_EXPR:
7911 case TRUTH_XOR_EXPR:
7912 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
7913 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
7914 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
7915 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
7917 /* Result of these operations is always an int,
7918 but that does not mean the operands should be
7919 converted to ints! */
7920 result_type = integer_type_node;
7921 op0 = c_common_truthvalue_conversion (op0);
7922 op1 = c_common_truthvalue_conversion (op1);
7927 /* Shift operations: result has same type as first operand;
7928 always convert second operand to int.
7929 Also set SHORT_SHIFT if shifting rightward. */
7932 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7934 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7936 if (tree_int_cst_sgn (op1) < 0)
7937 warning (0, "right shift count is negative");
7940 if (!integer_zerop (op1))
7943 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7944 warning (0, "right shift count >= width of type");
7948 /* Use the type of the value to be shifted. */
7949 result_type = type0;
7950 /* Convert the shift-count to an integer, regardless of size
7951 of value being shifted. */
7952 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7953 op1 = convert (integer_type_node, op1);
7954 /* Avoid converting op1 to result_type later. */
7960 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7962 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7964 if (tree_int_cst_sgn (op1) < 0)
7965 warning (0, "left shift count is negative");
7967 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7968 warning (0, "left shift count >= width of type");
7971 /* Use the type of the value to be shifted. */
7972 result_type = type0;
7973 /* Convert the shift-count to an integer, regardless of size
7974 of value being shifted. */
7975 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7976 op1 = convert (integer_type_node, op1);
7977 /* Avoid converting op1 to result_type later. */
7984 if (code0 == REAL_TYPE || code1 == REAL_TYPE)
7985 warning (OPT_Wfloat_equal,
7986 "comparing floating point with == or != is unsafe");
7987 /* Result of comparison is always int,
7988 but don't convert the args to int! */
7989 build_type = integer_type_node;
7990 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7991 || code0 == COMPLEX_TYPE)
7992 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7993 || code1 == COMPLEX_TYPE))
7995 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
7997 tree tt0 = TREE_TYPE (type0);
7998 tree tt1 = TREE_TYPE (type1);
7999 /* Anything compares with void *. void * compares with anything.
8000 Otherwise, the targets must be compatible
8001 and both must be object or both incomplete. */
8002 if (comp_target_types (type0, type1))
8003 result_type = common_pointer_type (type0, type1);
8004 else if (VOID_TYPE_P (tt0))
8006 /* op0 != orig_op0 detects the case of something
8007 whose value is 0 but which isn't a valid null ptr const. */
8008 if (pedantic && !null_pointer_constant_p (orig_op0)
8009 && TREE_CODE (tt1) == FUNCTION_TYPE)
8010 pedwarn ("ISO C forbids comparison of %<void *%>"
8011 " with function pointer");
8013 else if (VOID_TYPE_P (tt1))
8015 if (pedantic && !null_pointer_constant_p (orig_op1)
8016 && TREE_CODE (tt0) == FUNCTION_TYPE)
8017 pedwarn ("ISO C forbids comparison of %<void *%>"
8018 " with function pointer");
8021 /* Avoid warning about the volatile ObjC EH puts on decls. */
8023 pedwarn ("comparison of distinct pointer types lacks a cast");
8025 if (result_type == NULL_TREE)
8026 result_type = ptr_type_node;
8028 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8030 if (TREE_CODE (op0) == ADDR_EXPR
8031 && DECL_P (TREE_OPERAND (op0, 0))
8032 && (TREE_CODE (TREE_OPERAND (op0, 0)) == PARM_DECL
8033 || TREE_CODE (TREE_OPERAND (op0, 0)) == LABEL_DECL
8034 || !DECL_WEAK (TREE_OPERAND (op0, 0))))
8035 warning (OPT_Walways_true, "the address of %qD will never be NULL",
8036 TREE_OPERAND (op0, 0));
8037 result_type = type0;
8039 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8041 if (TREE_CODE (op1) == ADDR_EXPR
8042 && DECL_P (TREE_OPERAND (op1, 0))
8043 && (TREE_CODE (TREE_OPERAND (op1, 0)) == PARM_DECL
8044 || TREE_CODE (TREE_OPERAND (op1, 0)) == LABEL_DECL
8045 || !DECL_WEAK (TREE_OPERAND (op1, 0))))
8046 warning (OPT_Walways_true, "the address of %qD will never be NULL",
8047 TREE_OPERAND (op1, 0));
8048 result_type = type1;
8050 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8052 result_type = type0;
8053 pedwarn ("comparison between pointer and integer");
8055 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8057 result_type = type1;
8058 pedwarn ("comparison between pointer and integer");
8066 build_type = integer_type_node;
8067 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
8068 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
8070 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8072 if (comp_target_types (type0, type1))
8074 result_type = common_pointer_type (type0, type1);
8075 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8076 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8077 pedwarn ("comparison of complete and incomplete pointers");
8079 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8080 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
8084 result_type = ptr_type_node;
8085 pedwarn ("comparison of distinct pointer types lacks a cast");
8088 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8090 result_type = type0;
8091 if (pedantic || extra_warnings)
8092 pedwarn ("ordered comparison of pointer with integer zero");
8094 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8096 result_type = type1;
8098 pedwarn ("ordered comparison of pointer with integer zero");
8100 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8102 result_type = type0;
8103 pedwarn ("comparison between pointer and integer");
8105 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8107 result_type = type1;
8108 pedwarn ("comparison between pointer and integer");
8116 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8117 return error_mark_node;
8119 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8120 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8121 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8122 TREE_TYPE (type1))))
8124 binary_op_error (code);
8125 return error_mark_node;
8128 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8129 || code0 == VECTOR_TYPE)
8131 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8132 || code1 == VECTOR_TYPE))
8134 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8136 if (shorten || common || short_compare)
8137 result_type = c_common_type (type0, type1);
8139 /* For certain operations (which identify themselves by shorten != 0)
8140 if both args were extended from the same smaller type,
8141 do the arithmetic in that type and then extend.
8143 shorten !=0 and !=1 indicates a bitwise operation.
8144 For them, this optimization is safe only if
8145 both args are zero-extended or both are sign-extended.
8146 Otherwise, we might change the result.
8147 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8148 but calculated in (unsigned short) it would be (unsigned short)-1. */
8150 if (shorten && none_complex)
8152 int unsigned0, unsigned1;
8157 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
8158 excessive narrowing when we call get_narrower below. For
8159 example, suppose that OP0 is of unsigned int extended
8160 from signed char and that RESULT_TYPE is long long int.
8161 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
8164 (long long int) (unsigned int) signed_char
8166 which get_narrower would narrow down to
8168 (unsigned int) signed char
8170 If we do not cast OP0 first, get_narrower would return
8171 signed_char, which is inconsistent with the case of the
8173 op0 = convert (result_type, op0);
8174 op1 = convert (result_type, op1);
8176 arg0 = get_narrower (op0, &unsigned0);
8177 arg1 = get_narrower (op1, &unsigned1);
8179 /* UNS is 1 if the operation to be done is an unsigned one. */
8180 uns = TYPE_UNSIGNED (result_type);
8182 final_type = result_type;
8184 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
8185 but it *requires* conversion to FINAL_TYPE. */
8187 if ((TYPE_PRECISION (TREE_TYPE (op0))
8188 == TYPE_PRECISION (TREE_TYPE (arg0)))
8189 && TREE_TYPE (op0) != final_type)
8190 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
8191 if ((TYPE_PRECISION (TREE_TYPE (op1))
8192 == TYPE_PRECISION (TREE_TYPE (arg1)))
8193 && TREE_TYPE (op1) != final_type)
8194 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
8196 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
8198 /* For bitwise operations, signedness of nominal type
8199 does not matter. Consider only how operands were extended. */
8203 /* Note that in all three cases below we refrain from optimizing
8204 an unsigned operation on sign-extended args.
8205 That would not be valid. */
8207 /* Both args variable: if both extended in same way
8208 from same width, do it in that width.
8209 Do it unsigned if args were zero-extended. */
8210 if ((TYPE_PRECISION (TREE_TYPE (arg0))
8211 < TYPE_PRECISION (result_type))
8212 && (TYPE_PRECISION (TREE_TYPE (arg1))
8213 == TYPE_PRECISION (TREE_TYPE (arg0)))
8214 && unsigned0 == unsigned1
8215 && (unsigned0 || !uns))
8217 = c_common_signed_or_unsigned_type
8218 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
8219 else if (TREE_CODE (arg0) == INTEGER_CST
8220 && (unsigned1 || !uns)
8221 && (TYPE_PRECISION (TREE_TYPE (arg1))
8222 < TYPE_PRECISION (result_type))
8224 = c_common_signed_or_unsigned_type (unsigned1,
8226 int_fits_type_p (arg0, type)))
8228 else if (TREE_CODE (arg1) == INTEGER_CST
8229 && (unsigned0 || !uns)
8230 && (TYPE_PRECISION (TREE_TYPE (arg0))
8231 < TYPE_PRECISION (result_type))
8233 = c_common_signed_or_unsigned_type (unsigned0,
8235 int_fits_type_p (arg1, type)))
8239 /* Shifts can be shortened if shifting right. */
8244 tree arg0 = get_narrower (op0, &unsigned_arg);
8246 final_type = result_type;
8248 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8249 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8251 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8252 /* We can shorten only if the shift count is less than the
8253 number of bits in the smaller type size. */
8254 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8255 /* We cannot drop an unsigned shift after sign-extension. */
8256 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8258 /* Do an unsigned shift if the operand was zero-extended. */
8260 = c_common_signed_or_unsigned_type (unsigned_arg,
8262 /* Convert value-to-be-shifted to that type. */
8263 if (TREE_TYPE (op0) != result_type)
8264 op0 = convert (result_type, op0);
8269 /* Comparison operations are shortened too but differently.
8270 They identify themselves by setting short_compare = 1. */
8274 /* Don't write &op0, etc., because that would prevent op0
8275 from being kept in a register.
8276 Instead, make copies of the our local variables and
8277 pass the copies by reference, then copy them back afterward. */
8278 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8279 enum tree_code xresultcode = resultcode;
8281 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8286 op0 = xop0, op1 = xop1;
8288 resultcode = xresultcode;
8290 if (warn_sign_compare && skip_evaluation == 0)
8292 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
8293 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
8294 int unsignedp0, unsignedp1;
8295 tree primop0 = get_narrower (op0, &unsignedp0);
8296 tree primop1 = get_narrower (op1, &unsignedp1);
8300 STRIP_TYPE_NOPS (xop0);
8301 STRIP_TYPE_NOPS (xop1);
8303 /* Give warnings for comparisons between signed and unsigned
8304 quantities that may fail.
8306 Do the checking based on the original operand trees, so that
8307 casts will be considered, but default promotions won't be.
8309 Do not warn if the comparison is being done in a signed type,
8310 since the signed type will only be chosen if it can represent
8311 all the values of the unsigned type. */
8312 if (!TYPE_UNSIGNED (result_type))
8314 /* Do not warn if both operands are the same signedness. */
8315 else if (op0_signed == op1_signed)
8322 sop = xop0, uop = xop1;
8324 sop = xop1, uop = xop0;
8326 /* Do not warn if the signed quantity is an
8327 unsuffixed integer literal (or some static
8328 constant expression involving such literals or a
8329 conditional expression involving such literals)
8330 and it is non-negative. */
8331 if (tree_expr_nonnegative_p (sop))
8333 /* Do not warn if the comparison is an equality operation,
8334 the unsigned quantity is an integral constant, and it
8335 would fit in the result if the result were signed. */
8336 else if (TREE_CODE (uop) == INTEGER_CST
8337 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
8339 (uop, c_common_signed_type (result_type)))
8341 /* Do not warn if the unsigned quantity is an enumeration
8342 constant and its maximum value would fit in the result
8343 if the result were signed. */
8344 else if (TREE_CODE (uop) == INTEGER_CST
8345 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
8347 (TYPE_MAX_VALUE (TREE_TYPE (uop)),
8348 c_common_signed_type (result_type)))
8351 warning (0, "comparison between signed and unsigned");
8354 /* Warn if two unsigned values are being compared in a size
8355 larger than their original size, and one (and only one) is the
8356 result of a `~' operator. This comparison will always fail.
8358 Also warn if one operand is a constant, and the constant
8359 does not have all bits set that are set in the ~ operand
8360 when it is extended. */
8362 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
8363 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
8365 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
8366 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
8369 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
8372 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
8375 HOST_WIDE_INT constant, mask;
8376 int unsignedp, bits;
8378 if (host_integerp (primop0, 0))
8381 unsignedp = unsignedp1;
8382 constant = tree_low_cst (primop0, 0);
8387 unsignedp = unsignedp0;
8388 constant = tree_low_cst (primop1, 0);
8391 bits = TYPE_PRECISION (TREE_TYPE (primop));
8392 if (bits < TYPE_PRECISION (result_type)
8393 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
8395 mask = (~(HOST_WIDE_INT) 0) << bits;
8396 if ((mask & constant) != mask)
8397 warning (0, "comparison of promoted ~unsigned with constant");
8400 else if (unsignedp0 && unsignedp1
8401 && (TYPE_PRECISION (TREE_TYPE (primop0))
8402 < TYPE_PRECISION (result_type))
8403 && (TYPE_PRECISION (TREE_TYPE (primop1))
8404 < TYPE_PRECISION (result_type)))
8405 warning (0, "comparison of promoted ~unsigned with unsigned");
8411 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8412 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8413 Then the expression will be built.
8414 It will be given type FINAL_TYPE if that is nonzero;
8415 otherwise, it will be given type RESULT_TYPE. */
8419 binary_op_error (code);
8420 return error_mark_node;
8425 if (TREE_TYPE (op0) != result_type)
8426 op0 = convert_and_check (result_type, op0);
8427 if (TREE_TYPE (op1) != result_type)
8428 op1 = convert_and_check (result_type, op1);
8430 /* This can happen if one operand has a vector type, and the other
8431 has a different type. */
8432 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8433 return error_mark_node;
8436 if (build_type == NULL_TREE)
8437 build_type = result_type;
8440 /* Treat expressions in initializers specially as they can't trap. */
8441 tree result = require_constant_value ? fold_build2_initializer (resultcode,
8444 : fold_build2 (resultcode, build_type,
8447 if (final_type != 0)
8448 result = convert (final_type, result);
8454 /* Convert EXPR to be a truth-value, validating its type for this
8458 c_objc_common_truthvalue_conversion (tree expr)
8460 switch (TREE_CODE (TREE_TYPE (expr)))
8463 error ("used array that cannot be converted to pointer where scalar is required");
8464 return error_mark_node;
8467 error ("used struct type value where scalar is required");
8468 return error_mark_node;
8471 error ("used union type value where scalar is required");
8472 return error_mark_node;
8481 /* ??? Should we also give an error for void and vectors rather than
8482 leaving those to give errors later? */
8483 return c_common_truthvalue_conversion (expr);
8487 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8491 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED,
8492 bool *ti ATTRIBUTE_UNUSED, bool *se)
8494 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8496 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8497 /* Executing a compound literal inside a function reinitializes
8499 if (!TREE_STATIC (decl))
8507 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8510 c_begin_omp_parallel (void)
8515 block = c_begin_compound_stmt (true);
8521 c_finish_omp_parallel (tree clauses, tree block)
8525 block = c_end_compound_stmt (block, true);
8527 stmt = make_node (OMP_PARALLEL);
8528 TREE_TYPE (stmt) = void_type_node;
8529 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8530 OMP_PARALLEL_BODY (stmt) = block;
8532 return add_stmt (stmt);
8535 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8536 Remove any elements from the list that are invalid. */
8539 c_finish_omp_clauses (tree clauses)
8541 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8542 tree c, t, *pc = &clauses;
8545 bitmap_obstack_initialize (NULL);
8546 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8547 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8548 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8550 for (pc = &clauses, c = clauses; c ; c = *pc)
8552 bool remove = false;
8553 bool need_complete = false;
8554 bool need_implicitly_determined = false;
8556 switch (OMP_CLAUSE_CODE (c))
8558 case OMP_CLAUSE_SHARED:
8560 need_implicitly_determined = true;
8561 goto check_dup_generic;
8563 case OMP_CLAUSE_PRIVATE:
8565 need_complete = true;
8566 need_implicitly_determined = true;
8567 goto check_dup_generic;
8569 case OMP_CLAUSE_REDUCTION:
8571 need_implicitly_determined = true;
8572 t = OMP_CLAUSE_DECL (c);
8573 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8574 || POINTER_TYPE_P (TREE_TYPE (t)))
8576 error ("%qE has invalid type for %<reduction%>", t);
8579 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8581 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8582 const char *r_name = NULL;
8599 case TRUTH_ANDIF_EXPR:
8602 case TRUTH_ORIF_EXPR:
8610 error ("%qE has invalid type for %<reduction(%s)%>",
8615 goto check_dup_generic;
8617 case OMP_CLAUSE_COPYPRIVATE:
8618 name = "copyprivate";
8619 goto check_dup_generic;
8621 case OMP_CLAUSE_COPYIN:
8623 t = OMP_CLAUSE_DECL (c);
8624 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8626 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8629 goto check_dup_generic;
8632 t = OMP_CLAUSE_DECL (c);
8633 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8635 error ("%qE is not a variable in clause %qs", t, name);
8638 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8639 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8640 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8642 error ("%qE appears more than once in data clauses", t);
8646 bitmap_set_bit (&generic_head, DECL_UID (t));
8649 case OMP_CLAUSE_FIRSTPRIVATE:
8650 name = "firstprivate";
8651 t = OMP_CLAUSE_DECL (c);
8652 need_complete = true;
8653 need_implicitly_determined = true;
8654 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8656 error ("%qE is not a variable in clause %<firstprivate%>", t);
8659 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8660 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8662 error ("%qE appears more than once in data clauses", t);
8666 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8669 case OMP_CLAUSE_LASTPRIVATE:
8670 name = "lastprivate";
8671 t = OMP_CLAUSE_DECL (c);
8672 need_complete = true;
8673 need_implicitly_determined = true;
8674 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8676 error ("%qE is not a variable in clause %<lastprivate%>", t);
8679 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8680 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8682 error ("%qE appears more than once in data clauses", t);
8686 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8690 case OMP_CLAUSE_NUM_THREADS:
8691 case OMP_CLAUSE_SCHEDULE:
8692 case OMP_CLAUSE_NOWAIT:
8693 case OMP_CLAUSE_ORDERED:
8694 case OMP_CLAUSE_DEFAULT:
8695 pc = &OMP_CLAUSE_CHAIN (c);
8704 t = OMP_CLAUSE_DECL (c);
8708 t = require_complete_type (t);
8709 if (t == error_mark_node)
8713 if (need_implicitly_determined)
8715 const char *share_name = NULL;
8717 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8718 share_name = "threadprivate";
8719 else switch (c_omp_predetermined_sharing (t))
8721 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8723 case OMP_CLAUSE_DEFAULT_SHARED:
8724 share_name = "shared";
8726 case OMP_CLAUSE_DEFAULT_PRIVATE:
8727 share_name = "private";
8734 error ("%qE is predetermined %qs for %qs",
8735 t, share_name, name);
8742 *pc = OMP_CLAUSE_CHAIN (c);
8744 pc = &OMP_CLAUSE_CHAIN (c);
8747 bitmap_obstack_release (NULL);