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 /* If one type is a vector type, return that type. (How the usual
600 arithmetic conversions apply to the vector types extension is not
601 precisely specified.) */
602 if (code1 == VECTOR_TYPE)
605 if (code2 == VECTOR_TYPE)
608 /* If one type is complex, form the common type of the non-complex
609 components, then make that complex. Use T1 or T2 if it is the
611 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
613 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
614 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
615 tree subtype = c_common_type (subtype1, subtype2);
617 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
619 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
622 return build_complex_type (subtype);
625 /* If only one is real, use it as the result. */
627 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
630 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
633 /* If both are real and either are decimal floating point types, use
634 the decimal floating point type with the greater precision. */
636 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
638 if (TYPE_MAIN_VARIANT (t1) == dfloat128_type_node
639 || TYPE_MAIN_VARIANT (t2) == dfloat128_type_node)
640 return dfloat128_type_node;
641 else if (TYPE_MAIN_VARIANT (t1) == dfloat64_type_node
642 || TYPE_MAIN_VARIANT (t2) == dfloat64_type_node)
643 return dfloat64_type_node;
644 else if (TYPE_MAIN_VARIANT (t1) == dfloat32_type_node
645 || TYPE_MAIN_VARIANT (t2) == dfloat32_type_node)
646 return dfloat32_type_node;
649 /* Both real or both integers; use the one with greater precision. */
651 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
653 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
656 /* Same precision. Prefer long longs to longs to ints when the
657 same precision, following the C99 rules on integer type rank
658 (which are equivalent to the C90 rules for C90 types). */
660 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
661 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
662 return long_long_unsigned_type_node;
664 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
665 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
667 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
668 return long_long_unsigned_type_node;
670 return long_long_integer_type_node;
673 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
674 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
675 return long_unsigned_type_node;
677 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
678 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
680 /* But preserve unsignedness from the other type,
681 since long cannot hold all the values of an unsigned int. */
682 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
683 return long_unsigned_type_node;
685 return long_integer_type_node;
688 /* Likewise, prefer long double to double even if same size. */
689 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
690 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
691 return long_double_type_node;
693 /* Otherwise prefer the unsigned one. */
695 if (TYPE_UNSIGNED (t1))
701 /* Wrapper around c_common_type that is used by c-common.c and other
702 front end optimizations that remove promotions. ENUMERAL_TYPEs
703 are allowed here and are converted to their compatible integer types.
704 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
705 preferably a non-Boolean type as the common type. */
707 common_type (tree t1, tree t2)
709 if (TREE_CODE (t1) == ENUMERAL_TYPE)
710 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
711 if (TREE_CODE (t2) == ENUMERAL_TYPE)
712 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
714 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
715 if (TREE_CODE (t1) == BOOLEAN_TYPE
716 && TREE_CODE (t2) == BOOLEAN_TYPE)
717 return boolean_type_node;
719 /* If either type is BOOLEAN_TYPE, then return the other. */
720 if (TREE_CODE (t1) == BOOLEAN_TYPE)
722 if (TREE_CODE (t2) == BOOLEAN_TYPE)
725 return c_common_type (t1, t2);
728 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
729 or various other operations. Return 2 if they are compatible
730 but a warning may be needed if you use them together. */
733 comptypes (tree type1, tree type2)
735 const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
738 val = comptypes_internal (type1, type2);
739 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
744 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
745 or various other operations. Return 2 if they are compatible
746 but a warning may be needed if you use them together. This
747 differs from comptypes, in that we don't free the seen types. */
750 comptypes_internal (tree type1, tree type2)
756 /* Suppress errors caused by previously reported errors. */
758 if (t1 == t2 || !t1 || !t2
759 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
762 /* If either type is the internal version of sizetype, return the
764 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
765 && TYPE_ORIG_SIZE_TYPE (t1))
766 t1 = TYPE_ORIG_SIZE_TYPE (t1);
768 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
769 && TYPE_ORIG_SIZE_TYPE (t2))
770 t2 = TYPE_ORIG_SIZE_TYPE (t2);
773 /* Enumerated types are compatible with integer types, but this is
774 not transitive: two enumerated types in the same translation unit
775 are compatible with each other only if they are the same type. */
777 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
778 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
779 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
780 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
785 /* Different classes of types can't be compatible. */
787 if (TREE_CODE (t1) != TREE_CODE (t2))
790 /* Qualifiers must match. C99 6.7.3p9 */
792 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
795 /* Allow for two different type nodes which have essentially the same
796 definition. Note that we already checked for equality of the type
797 qualifiers (just above). */
799 if (TREE_CODE (t1) != ARRAY_TYPE
800 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
803 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
804 if (!(attrval = targetm.comp_type_attributes (t1, t2)))
807 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
810 switch (TREE_CODE (t1))
813 /* Do not remove mode or aliasing information. */
814 if (TYPE_MODE (t1) != TYPE_MODE (t2)
815 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
817 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
818 ? 1 : comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2)));
822 val = function_types_compatible_p (t1, t2);
827 tree d1 = TYPE_DOMAIN (t1);
828 tree d2 = TYPE_DOMAIN (t2);
829 bool d1_variable, d2_variable;
830 bool d1_zero, d2_zero;
833 /* Target types must match incl. qualifiers. */
834 if (TREE_TYPE (t1) != TREE_TYPE (t2)
835 && 0 == (val = comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2))))
838 /* Sizes must match unless one is missing or variable. */
839 if (d1 == 0 || d2 == 0 || d1 == d2)
842 d1_zero = !TYPE_MAX_VALUE (d1);
843 d2_zero = !TYPE_MAX_VALUE (d2);
845 d1_variable = (!d1_zero
846 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
847 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
848 d2_variable = (!d2_zero
849 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
850 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
851 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
852 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
854 if (d1_variable || d2_variable)
856 if (d1_zero && d2_zero)
858 if (d1_zero || d2_zero
859 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
860 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
869 if (val != 1 && !same_translation_unit_p (t1, t2))
872 return tagged_types_tu_compatible_p (t1, t2);
873 val = tagged_types_tu_compatible_p (t1, t2);
878 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
879 && comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2));
885 return attrval == 2 && val == 1 ? 2 : val;
888 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
889 ignoring their qualifiers. */
892 comp_target_types (tree ttl, tree ttr)
897 /* Do not lose qualifiers on element types of array types that are
898 pointer targets by taking their TYPE_MAIN_VARIANT. */
899 mvl = TREE_TYPE (ttl);
900 mvr = TREE_TYPE (ttr);
901 if (TREE_CODE (mvl) != ARRAY_TYPE)
902 mvl = TYPE_MAIN_VARIANT (mvl);
903 if (TREE_CODE (mvr) != ARRAY_TYPE)
904 mvr = TYPE_MAIN_VARIANT (mvr);
905 val = comptypes (mvl, mvr);
907 if (val == 2 && pedantic)
908 pedwarn ("types are not quite compatible");
912 /* Subroutines of `comptypes'. */
914 /* Determine whether two trees derive from the same translation unit.
915 If the CONTEXT chain ends in a null, that tree's context is still
916 being parsed, so if two trees have context chains ending in null,
917 they're in the same translation unit. */
919 same_translation_unit_p (tree t1, tree t2)
921 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
922 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
924 case tcc_declaration:
925 t1 = DECL_CONTEXT (t1); break;
927 t1 = TYPE_CONTEXT (t1); break;
928 case tcc_exceptional:
929 t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
930 default: gcc_unreachable ();
933 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
934 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
936 case tcc_declaration:
937 t2 = DECL_CONTEXT (t2); break;
939 t2 = TYPE_CONTEXT (t2); break;
940 case tcc_exceptional:
941 t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
942 default: gcc_unreachable ();
948 /* Allocate the seen two types, assuming that they are compatible. */
950 static struct tagged_tu_seen_cache *
951 alloc_tagged_tu_seen_cache (tree t1, tree t2)
953 struct tagged_tu_seen_cache *tu = XNEW (struct tagged_tu_seen_cache);
954 tu->next = tagged_tu_seen_base;
958 tagged_tu_seen_base = tu;
960 /* The C standard says that two structures in different translation
961 units are compatible with each other only if the types of their
962 fields are compatible (among other things). We assume that they
963 are compatible until proven otherwise when building the cache.
964 An example where this can occur is:
969 If we are comparing this against a similar struct in another TU,
970 and did not assume they were compatible, we end up with an infinite
976 /* Free the seen types until we get to TU_TIL. */
979 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *tu_til)
981 const struct tagged_tu_seen_cache *tu = tagged_tu_seen_base;
984 struct tagged_tu_seen_cache *tu1 = (struct tagged_tu_seen_cache*)tu;
988 tagged_tu_seen_base = tu_til;
991 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
992 compatible. If the two types are not the same (which has been
993 checked earlier), this can only happen when multiple translation
994 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
998 tagged_types_tu_compatible_p (tree t1, tree t2)
1001 bool needs_warning = false;
1003 /* We have to verify that the tags of the types are the same. This
1004 is harder than it looks because this may be a typedef, so we have
1005 to go look at the original type. It may even be a typedef of a
1007 In the case of compiler-created builtin structs the TYPE_DECL
1008 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1009 while (TYPE_NAME (t1)
1010 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
1011 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
1012 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
1014 while (TYPE_NAME (t2)
1015 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
1016 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
1017 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
1019 /* C90 didn't have the requirement that the two tags be the same. */
1020 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
1023 /* C90 didn't say what happened if one or both of the types were
1024 incomplete; we choose to follow C99 rules here, which is that they
1026 if (TYPE_SIZE (t1) == NULL
1027 || TYPE_SIZE (t2) == NULL)
1031 const struct tagged_tu_seen_cache * tts_i;
1032 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
1033 if (tts_i->t1 == t1 && tts_i->t2 == t2)
1037 switch (TREE_CODE (t1))
1041 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1042 /* Speed up the case where the type values are in the same order. */
1043 tree tv1 = TYPE_VALUES (t1);
1044 tree tv2 = TYPE_VALUES (t2);
1051 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
1053 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
1055 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
1062 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
1066 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
1072 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
1078 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
1080 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
1082 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
1093 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1094 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
1100 /* Speed up the common case where the fields are in the same order. */
1101 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2); s1 && s2;
1102 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1107 if (DECL_NAME (s1) == NULL
1108 || DECL_NAME (s1) != DECL_NAME (s2))
1110 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1117 needs_warning = true;
1119 if (TREE_CODE (s1) == FIELD_DECL
1120 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1121 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1129 tu->val = needs_warning ? 2 : 1;
1133 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
1137 if (DECL_NAME (s1) != NULL)
1138 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
1139 if (DECL_NAME (s1) == DECL_NAME (s2))
1142 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1149 needs_warning = true;
1151 if (TREE_CODE (s1) == FIELD_DECL
1152 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1153 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1165 tu->val = needs_warning ? 2 : 10;
1171 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1173 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
1175 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1178 if (TREE_CODE (s1) != TREE_CODE (s2)
1179 || DECL_NAME (s1) != DECL_NAME (s2))
1181 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1185 needs_warning = true;
1187 if (TREE_CODE (s1) == FIELD_DECL
1188 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1189 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1195 tu->val = needs_warning ? 2 : 1;
1204 /* Return 1 if two function types F1 and F2 are compatible.
1205 If either type specifies no argument types,
1206 the other must specify a fixed number of self-promoting arg types.
1207 Otherwise, if one type specifies only the number of arguments,
1208 the other must specify that number of self-promoting arg types.
1209 Otherwise, the argument types must match. */
1212 function_types_compatible_p (tree f1, tree f2)
1215 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1220 ret1 = TREE_TYPE (f1);
1221 ret2 = TREE_TYPE (f2);
1223 /* 'volatile' qualifiers on a function's return type used to mean
1224 the function is noreturn. */
1225 if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1226 pedwarn ("function return types not compatible due to %<volatile%>");
1227 if (TYPE_VOLATILE (ret1))
1228 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1229 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1230 if (TYPE_VOLATILE (ret2))
1231 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1232 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1233 val = comptypes_internal (ret1, ret2);
1237 args1 = TYPE_ARG_TYPES (f1);
1238 args2 = TYPE_ARG_TYPES (f2);
1240 /* An unspecified parmlist matches any specified parmlist
1241 whose argument types don't need default promotions. */
1245 if (!self_promoting_args_p (args2))
1247 /* If one of these types comes from a non-prototype fn definition,
1248 compare that with the other type's arglist.
1249 If they don't match, ask for a warning (but no error). */
1250 if (TYPE_ACTUAL_ARG_TYPES (f1)
1251 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
1257 if (!self_promoting_args_p (args1))
1259 if (TYPE_ACTUAL_ARG_TYPES (f2)
1260 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1265 /* Both types have argument lists: compare them and propagate results. */
1266 val1 = type_lists_compatible_p (args1, args2);
1267 return val1 != 1 ? val1 : val;
1270 /* Check two lists of types for compatibility,
1271 returning 0 for incompatible, 1 for compatible,
1272 or 2 for compatible with warning. */
1275 type_lists_compatible_p (tree args1, tree args2)
1277 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1283 tree a1, mv1, a2, mv2;
1284 if (args1 == 0 && args2 == 0)
1286 /* If one list is shorter than the other,
1287 they fail to match. */
1288 if (args1 == 0 || args2 == 0)
1290 mv1 = a1 = TREE_VALUE (args1);
1291 mv2 = a2 = TREE_VALUE (args2);
1292 if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1293 mv1 = TYPE_MAIN_VARIANT (mv1);
1294 if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1295 mv2 = TYPE_MAIN_VARIANT (mv2);
1296 /* A null pointer instead of a type
1297 means there is supposed to be an argument
1298 but nothing is specified about what type it has.
1299 So match anything that self-promotes. */
1302 if (c_type_promotes_to (a2) != a2)
1307 if (c_type_promotes_to (a1) != a1)
1310 /* If one of the lists has an error marker, ignore this arg. */
1311 else if (TREE_CODE (a1) == ERROR_MARK
1312 || TREE_CODE (a2) == ERROR_MARK)
1314 else if (!(newval = comptypes_internal (mv1, mv2)))
1316 /* Allow wait (union {union wait *u; int *i} *)
1317 and wait (union wait *) to be compatible. */
1318 if (TREE_CODE (a1) == UNION_TYPE
1319 && (TYPE_NAME (a1) == 0
1320 || TYPE_TRANSPARENT_UNION (a1))
1321 && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1322 && tree_int_cst_equal (TYPE_SIZE (a1),
1326 for (memb = TYPE_FIELDS (a1);
1327 memb; memb = TREE_CHAIN (memb))
1329 tree mv3 = TREE_TYPE (memb);
1330 if (mv3 && mv3 != error_mark_node
1331 && TREE_CODE (mv3) != ARRAY_TYPE)
1332 mv3 = TYPE_MAIN_VARIANT (mv3);
1333 if (comptypes_internal (mv3, mv2))
1339 else if (TREE_CODE (a2) == UNION_TYPE
1340 && (TYPE_NAME (a2) == 0
1341 || TYPE_TRANSPARENT_UNION (a2))
1342 && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1343 && tree_int_cst_equal (TYPE_SIZE (a2),
1347 for (memb = TYPE_FIELDS (a2);
1348 memb; memb = TREE_CHAIN (memb))
1350 tree mv3 = TREE_TYPE (memb);
1351 if (mv3 && mv3 != error_mark_node
1352 && TREE_CODE (mv3) != ARRAY_TYPE)
1353 mv3 = TYPE_MAIN_VARIANT (mv3);
1354 if (comptypes_internal (mv3, mv1))
1364 /* comptypes said ok, but record if it said to warn. */
1368 args1 = TREE_CHAIN (args1);
1369 args2 = TREE_CHAIN (args2);
1373 /* Compute the size to increment a pointer by. */
1376 c_size_in_bytes (tree type)
1378 enum tree_code code = TREE_CODE (type);
1380 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1381 return size_one_node;
1383 if (!COMPLETE_OR_VOID_TYPE_P (type))
1385 error ("arithmetic on pointer to an incomplete type");
1386 return size_one_node;
1389 /* Convert in case a char is more than one unit. */
1390 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1391 size_int (TYPE_PRECISION (char_type_node)
1395 /* Return either DECL or its known constant value (if it has one). */
1398 decl_constant_value (tree decl)
1400 if (/* Don't change a variable array bound or initial value to a constant
1401 in a place where a variable is invalid. Note that DECL_INITIAL
1402 isn't valid for a PARM_DECL. */
1403 current_function_decl != 0
1404 && TREE_CODE (decl) != PARM_DECL
1405 && !TREE_THIS_VOLATILE (decl)
1406 && TREE_READONLY (decl)
1407 && DECL_INITIAL (decl) != 0
1408 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1409 /* This is invalid if initial value is not constant.
1410 If it has either a function call, a memory reference,
1411 or a variable, then re-evaluating it could give different results. */
1412 && TREE_CONSTANT (DECL_INITIAL (decl))
1413 /* Check for cases where this is sub-optimal, even though valid. */
1414 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1415 return DECL_INITIAL (decl);
1419 /* Return either DECL or its known constant value (if it has one), but
1420 return DECL if pedantic or DECL has mode BLKmode. This is for
1421 bug-compatibility with the old behavior of decl_constant_value
1422 (before GCC 3.0); every use of this function is a bug and it should
1423 be removed before GCC 3.1. It is not appropriate to use pedantic
1424 in a way that affects optimization, and BLKmode is probably not the
1425 right test for avoiding misoptimizations either. */
1428 decl_constant_value_for_broken_optimization (tree decl)
1432 if (pedantic || DECL_MODE (decl) == BLKmode)
1435 ret = decl_constant_value (decl);
1436 /* Avoid unwanted tree sharing between the initializer and current
1437 function's body where the tree can be modified e.g. by the
1439 if (ret != decl && TREE_STATIC (decl))
1440 ret = unshare_expr (ret);
1444 /* Convert the array expression EXP to a pointer. */
1446 array_to_pointer_conversion (tree exp)
1448 tree orig_exp = exp;
1449 tree type = TREE_TYPE (exp);
1451 tree restype = TREE_TYPE (type);
1454 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1456 STRIP_TYPE_NOPS (exp);
1458 if (TREE_NO_WARNING (orig_exp))
1459 TREE_NO_WARNING (exp) = 1;
1461 ptrtype = build_pointer_type (restype);
1463 if (TREE_CODE (exp) == INDIRECT_REF)
1464 return convert (ptrtype, TREE_OPERAND (exp, 0));
1466 if (TREE_CODE (exp) == VAR_DECL)
1468 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1469 ADDR_EXPR because it's the best way of representing what
1470 happens in C when we take the address of an array and place
1471 it in a pointer to the element type. */
1472 adr = build1 (ADDR_EXPR, ptrtype, exp);
1473 if (!c_mark_addressable (exp))
1474 return error_mark_node;
1475 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1479 /* This way is better for a COMPONENT_REF since it can
1480 simplify the offset for a component. */
1481 adr = build_unary_op (ADDR_EXPR, exp, 1);
1482 return convert (ptrtype, adr);
1485 /* Convert the function expression EXP to a pointer. */
1487 function_to_pointer_conversion (tree exp)
1489 tree orig_exp = exp;
1491 gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1493 STRIP_TYPE_NOPS (exp);
1495 if (TREE_NO_WARNING (orig_exp))
1496 TREE_NO_WARNING (exp) = 1;
1498 return build_unary_op (ADDR_EXPR, exp, 0);
1501 /* Perform the default conversion of arrays and functions to pointers.
1502 Return the result of converting EXP. For any other expression, just
1503 return EXP after removing NOPs. */
1506 default_function_array_conversion (struct c_expr exp)
1508 tree orig_exp = exp.value;
1509 tree type = TREE_TYPE (exp.value);
1510 enum tree_code code = TREE_CODE (type);
1516 bool not_lvalue = false;
1517 bool lvalue_array_p;
1519 while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1520 || TREE_CODE (exp.value) == NOP_EXPR
1521 || TREE_CODE (exp.value) == CONVERT_EXPR)
1522 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1524 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1526 exp.value = TREE_OPERAND (exp.value, 0);
1529 if (TREE_NO_WARNING (orig_exp))
1530 TREE_NO_WARNING (exp.value) = 1;
1532 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1533 if (!flag_isoc99 && !lvalue_array_p)
1535 /* Before C99, non-lvalue arrays do not decay to pointers.
1536 Normally, using such an array would be invalid; but it can
1537 be used correctly inside sizeof or as a statement expression.
1538 Thus, do not give an error here; an error will result later. */
1542 exp.value = array_to_pointer_conversion (exp.value);
1546 exp.value = function_to_pointer_conversion (exp.value);
1549 STRIP_TYPE_NOPS (exp.value);
1550 if (TREE_NO_WARNING (orig_exp))
1551 TREE_NO_WARNING (exp.value) = 1;
1559 /* EXP is an expression of integer type. Apply the integer promotions
1560 to it and return the promoted value. */
1563 perform_integral_promotions (tree exp)
1565 tree type = TREE_TYPE (exp);
1566 enum tree_code code = TREE_CODE (type);
1568 gcc_assert (INTEGRAL_TYPE_P (type));
1570 /* Normally convert enums to int,
1571 but convert wide enums to something wider. */
1572 if (code == ENUMERAL_TYPE)
1574 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1575 TYPE_PRECISION (integer_type_node)),
1576 ((TYPE_PRECISION (type)
1577 >= TYPE_PRECISION (integer_type_node))
1578 && TYPE_UNSIGNED (type)));
1580 return convert (type, exp);
1583 /* ??? This should no longer be needed now bit-fields have their
1585 if (TREE_CODE (exp) == COMPONENT_REF
1586 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1587 /* If it's thinner than an int, promote it like a
1588 c_promoting_integer_type_p, otherwise leave it alone. */
1589 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1590 TYPE_PRECISION (integer_type_node)))
1591 return convert (integer_type_node, exp);
1593 if (c_promoting_integer_type_p (type))
1595 /* Preserve unsignedness if not really getting any wider. */
1596 if (TYPE_UNSIGNED (type)
1597 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1598 return convert (unsigned_type_node, exp);
1600 return convert (integer_type_node, exp);
1607 /* Perform default promotions for C data used in expressions.
1608 Enumeral types or short or char are converted to int.
1609 In addition, manifest constants symbols are replaced by their values. */
1612 default_conversion (tree exp)
1615 tree type = TREE_TYPE (exp);
1616 enum tree_code code = TREE_CODE (type);
1618 /* Functions and arrays have been converted during parsing. */
1619 gcc_assert (code != FUNCTION_TYPE);
1620 if (code == ARRAY_TYPE)
1623 /* Constants can be used directly unless they're not loadable. */
1624 if (TREE_CODE (exp) == CONST_DECL)
1625 exp = DECL_INITIAL (exp);
1627 /* Replace a nonvolatile const static variable with its value unless
1628 it is an array, in which case we must be sure that taking the
1629 address of the array produces consistent results. */
1630 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1632 exp = decl_constant_value_for_broken_optimization (exp);
1633 type = TREE_TYPE (exp);
1636 /* Strip no-op conversions. */
1638 STRIP_TYPE_NOPS (exp);
1640 if (TREE_NO_WARNING (orig_exp))
1641 TREE_NO_WARNING (exp) = 1;
1643 if (INTEGRAL_TYPE_P (type))
1644 return perform_integral_promotions (exp);
1646 if (code == VOID_TYPE)
1648 error ("void value not ignored as it ought to be");
1649 return error_mark_node;
1654 /* Look up COMPONENT in a structure or union DECL.
1656 If the component name is not found, returns NULL_TREE. Otherwise,
1657 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1658 stepping down the chain to the component, which is in the last
1659 TREE_VALUE of the list. Normally the list is of length one, but if
1660 the component is embedded within (nested) anonymous structures or
1661 unions, the list steps down the chain to the component. */
1664 lookup_field (tree decl, tree component)
1666 tree type = TREE_TYPE (decl);
1669 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1670 to the field elements. Use a binary search on this array to quickly
1671 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1672 will always be set for structures which have many elements. */
1674 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1677 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1679 field = TYPE_FIELDS (type);
1681 top = TYPE_LANG_SPECIFIC (type)->s->len;
1682 while (top - bot > 1)
1684 half = (top - bot + 1) >> 1;
1685 field = field_array[bot+half];
1687 if (DECL_NAME (field) == NULL_TREE)
1689 /* Step through all anon unions in linear fashion. */
1690 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1692 field = field_array[bot++];
1693 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1694 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1696 tree anon = lookup_field (field, component);
1699 return tree_cons (NULL_TREE, field, anon);
1703 /* Entire record is only anon unions. */
1707 /* Restart the binary search, with new lower bound. */
1711 if (DECL_NAME (field) == component)
1713 if (DECL_NAME (field) < component)
1719 if (DECL_NAME (field_array[bot]) == component)
1720 field = field_array[bot];
1721 else if (DECL_NAME (field) != component)
1726 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1728 if (DECL_NAME (field) == NULL_TREE
1729 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1730 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1732 tree anon = lookup_field (field, component);
1735 return tree_cons (NULL_TREE, field, anon);
1738 if (DECL_NAME (field) == component)
1742 if (field == NULL_TREE)
1746 return tree_cons (NULL_TREE, field, NULL_TREE);
1749 /* Make an expression to refer to the COMPONENT field of
1750 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1753 build_component_ref (tree datum, tree component)
1755 tree type = TREE_TYPE (datum);
1756 enum tree_code code = TREE_CODE (type);
1760 if (!objc_is_public (datum, component))
1761 return error_mark_node;
1763 /* See if there is a field or component with name COMPONENT. */
1765 if (code == RECORD_TYPE || code == UNION_TYPE)
1767 if (!COMPLETE_TYPE_P (type))
1769 c_incomplete_type_error (NULL_TREE, type);
1770 return error_mark_node;
1773 field = lookup_field (datum, component);
1777 error ("%qT has no member named %qE", type, component);
1778 return error_mark_node;
1781 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1782 This might be better solved in future the way the C++ front
1783 end does it - by giving the anonymous entities each a
1784 separate name and type, and then have build_component_ref
1785 recursively call itself. We can't do that here. */
1788 tree subdatum = TREE_VALUE (field);
1790 if (TREE_TYPE (subdatum) == error_mark_node)
1791 return error_mark_node;
1793 ref = build3 (COMPONENT_REF, TREE_TYPE (subdatum), datum, subdatum,
1795 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1796 TREE_READONLY (ref) = 1;
1797 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1798 TREE_THIS_VOLATILE (ref) = 1;
1800 if (TREE_DEPRECATED (subdatum))
1801 warn_deprecated_use (subdatum);
1805 field = TREE_CHAIN (field);
1811 else if (code != ERROR_MARK)
1812 error ("request for member %qE in something not a structure or union",
1815 return error_mark_node;
1818 /* Given an expression PTR for a pointer, return an expression
1819 for the value pointed to.
1820 ERRORSTRING is the name of the operator to appear in error messages. */
1823 build_indirect_ref (tree ptr, const char *errorstring)
1825 tree pointer = default_conversion (ptr);
1826 tree type = TREE_TYPE (pointer);
1828 if (TREE_CODE (type) == POINTER_TYPE)
1830 if (TREE_CODE (pointer) == ADDR_EXPR
1831 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1832 == TREE_TYPE (type)))
1833 return TREE_OPERAND (pointer, 0);
1836 tree t = TREE_TYPE (type);
1839 ref = build1 (INDIRECT_REF, t, pointer);
1841 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1843 error ("dereferencing pointer to incomplete type");
1844 return error_mark_node;
1846 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1847 warning (0, "dereferencing %<void *%> pointer");
1849 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1850 so that we get the proper error message if the result is used
1851 to assign to. Also, &* is supposed to be a no-op.
1852 And ANSI C seems to specify that the type of the result
1853 should be the const type. */
1854 /* A de-reference of a pointer to const is not a const. It is valid
1855 to change it via some other pointer. */
1856 TREE_READONLY (ref) = TYPE_READONLY (t);
1857 TREE_SIDE_EFFECTS (ref)
1858 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
1859 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1863 else if (TREE_CODE (pointer) != ERROR_MARK)
1864 error ("invalid type argument of %qs", errorstring);
1865 return error_mark_node;
1868 /* This handles expressions of the form "a[i]", which denotes
1871 This is logically equivalent in C to *(a+i), but we may do it differently.
1872 If A is a variable or a member, we generate a primitive ARRAY_REF.
1873 This avoids forcing the array out of registers, and can work on
1874 arrays that are not lvalues (for example, members of structures returned
1878 build_array_ref (tree array, tree index)
1880 bool swapped = false;
1881 if (TREE_TYPE (array) == error_mark_node
1882 || TREE_TYPE (index) == error_mark_node)
1883 return error_mark_node;
1885 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
1886 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
1889 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
1890 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
1892 error ("subscripted value is neither array nor pointer");
1893 return error_mark_node;
1901 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
1903 error ("array subscript is not an integer");
1904 return error_mark_node;
1907 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
1909 error ("subscripted value is pointer to function");
1910 return error_mark_node;
1913 /* ??? Existing practice has been to warn only when the char
1914 index is syntactically the index, not for char[array]. */
1916 warn_array_subscript_with_type_char (index);
1918 /* Apply default promotions *after* noticing character types. */
1919 index = default_conversion (index);
1921 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
1923 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
1927 /* An array that is indexed by a non-constant
1928 cannot be stored in a register; we must be able to do
1929 address arithmetic on its address.
1930 Likewise an array of elements of variable size. */
1931 if (TREE_CODE (index) != INTEGER_CST
1932 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1933 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1935 if (!c_mark_addressable (array))
1936 return error_mark_node;
1938 /* An array that is indexed by a constant value which is not within
1939 the array bounds cannot be stored in a register either; because we
1940 would get a crash in store_bit_field/extract_bit_field when trying
1941 to access a non-existent part of the register. */
1942 if (TREE_CODE (index) == INTEGER_CST
1943 && TYPE_DOMAIN (TREE_TYPE (array))
1944 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
1946 if (!c_mark_addressable (array))
1947 return error_mark_node;
1953 while (TREE_CODE (foo) == COMPONENT_REF)
1954 foo = TREE_OPERAND (foo, 0);
1955 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
1956 pedwarn ("ISO C forbids subscripting %<register%> array");
1957 else if (!flag_isoc99 && !lvalue_p (foo))
1958 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
1961 type = TREE_TYPE (TREE_TYPE (array));
1962 if (TREE_CODE (type) != ARRAY_TYPE)
1963 type = TYPE_MAIN_VARIANT (type);
1964 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
1965 /* Array ref is const/volatile if the array elements are
1966 or if the array is. */
1967 TREE_READONLY (rval)
1968 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
1969 | TREE_READONLY (array));
1970 TREE_SIDE_EFFECTS (rval)
1971 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1972 | TREE_SIDE_EFFECTS (array));
1973 TREE_THIS_VOLATILE (rval)
1974 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1975 /* This was added by rms on 16 Nov 91.
1976 It fixes vol struct foo *a; a->elts[1]
1977 in an inline function.
1978 Hope it doesn't break something else. */
1979 | TREE_THIS_VOLATILE (array));
1980 return require_complete_type (fold (rval));
1984 tree ar = default_conversion (array);
1986 if (ar == error_mark_node)
1989 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
1990 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
1992 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, index, 0),
1997 /* Build an external reference to identifier ID. FUN indicates
1998 whether this will be used for a function call. LOC is the source
1999 location of the identifier. */
2001 build_external_ref (tree id, int fun, location_t loc)
2004 tree decl = lookup_name (id);
2006 /* In Objective-C, an instance variable (ivar) may be preferred to
2007 whatever lookup_name() found. */
2008 decl = objc_lookup_ivar (decl, id);
2010 if (decl && decl != error_mark_node)
2013 /* Implicit function declaration. */
2014 ref = implicitly_declare (id);
2015 else if (decl == error_mark_node)
2016 /* Don't complain about something that's already been
2017 complained about. */
2018 return error_mark_node;
2021 undeclared_variable (id, loc);
2022 return error_mark_node;
2025 if (TREE_TYPE (ref) == error_mark_node)
2026 return error_mark_node;
2028 if (TREE_DEPRECATED (ref))
2029 warn_deprecated_use (ref);
2031 if (!skip_evaluation)
2032 assemble_external (ref);
2033 TREE_USED (ref) = 1;
2035 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2037 if (!in_sizeof && !in_typeof)
2038 C_DECL_USED (ref) = 1;
2039 else if (DECL_INITIAL (ref) == 0
2040 && DECL_EXTERNAL (ref)
2041 && !TREE_PUBLIC (ref))
2042 record_maybe_used_decl (ref);
2045 if (TREE_CODE (ref) == CONST_DECL)
2047 ref = DECL_INITIAL (ref);
2048 TREE_CONSTANT (ref) = 1;
2049 TREE_INVARIANT (ref) = 1;
2051 else if (current_function_decl != 0
2052 && !DECL_FILE_SCOPE_P (current_function_decl)
2053 && (TREE_CODE (ref) == VAR_DECL
2054 || TREE_CODE (ref) == PARM_DECL
2055 || TREE_CODE (ref) == FUNCTION_DECL))
2057 tree context = decl_function_context (ref);
2059 if (context != 0 && context != current_function_decl)
2060 DECL_NONLOCAL (ref) = 1;
2066 /* Record details of decls possibly used inside sizeof or typeof. */
2067 struct maybe_used_decl
2071 /* The level seen at (in_sizeof + in_typeof). */
2073 /* The next one at this level or above, or NULL. */
2074 struct maybe_used_decl *next;
2077 static struct maybe_used_decl *maybe_used_decls;
2079 /* Record that DECL, an undefined static function reference seen
2080 inside sizeof or typeof, might be used if the operand of sizeof is
2081 a VLA type or the operand of typeof is a variably modified
2085 record_maybe_used_decl (tree decl)
2087 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2089 t->level = in_sizeof + in_typeof;
2090 t->next = maybe_used_decls;
2091 maybe_used_decls = t;
2094 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2095 USED is false, just discard them. If it is true, mark them used
2096 (if no longer inside sizeof or typeof) or move them to the next
2097 level up (if still inside sizeof or typeof). */
2100 pop_maybe_used (bool used)
2102 struct maybe_used_decl *p = maybe_used_decls;
2103 int cur_level = in_sizeof + in_typeof;
2104 while (p && p->level > cur_level)
2109 C_DECL_USED (p->decl) = 1;
2111 p->level = cur_level;
2115 if (!used || cur_level == 0)
2116 maybe_used_decls = p;
2119 /* Return the result of sizeof applied to EXPR. */
2122 c_expr_sizeof_expr (struct c_expr expr)
2125 if (expr.value == error_mark_node)
2127 ret.value = error_mark_node;
2128 ret.original_code = ERROR_MARK;
2129 pop_maybe_used (false);
2133 ret.value = c_sizeof (TREE_TYPE (expr.value));
2134 ret.original_code = ERROR_MARK;
2135 if (c_vla_type_p (TREE_TYPE (expr.value)))
2137 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2138 ret.value = build2 (COMPOUND_EXPR, TREE_TYPE (ret.value), expr.value, ret.value);
2140 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2145 /* Return the result of sizeof applied to T, a structure for the type
2146 name passed to sizeof (rather than the type itself). */
2149 c_expr_sizeof_type (struct c_type_name *t)
2153 type = groktypename (t);
2154 ret.value = c_sizeof (type);
2155 ret.original_code = ERROR_MARK;
2156 pop_maybe_used (C_TYPE_VARIABLE_SIZE (type));
2160 /* Build a function call to function FUNCTION with parameters PARAMS.
2161 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2162 TREE_VALUE of each node is a parameter-expression.
2163 FUNCTION's data type may be a function type or a pointer-to-function. */
2166 build_function_call (tree function, tree params)
2168 tree fntype, fundecl = 0;
2169 tree coerced_params;
2170 tree name = NULL_TREE, result;
2173 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2174 STRIP_TYPE_NOPS (function);
2176 /* Convert anything with function type to a pointer-to-function. */
2177 if (TREE_CODE (function) == FUNCTION_DECL)
2179 /* Implement type-directed function overloading for builtins.
2180 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2181 handle all the type checking. The result is a complete expression
2182 that implements this function call. */
2183 tem = resolve_overloaded_builtin (function, params);
2187 name = DECL_NAME (function);
2190 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2191 function = function_to_pointer_conversion (function);
2193 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2194 expressions, like those used for ObjC messenger dispatches. */
2195 function = objc_rewrite_function_call (function, params);
2197 fntype = TREE_TYPE (function);
2199 if (TREE_CODE (fntype) == ERROR_MARK)
2200 return error_mark_node;
2202 if (!(TREE_CODE (fntype) == POINTER_TYPE
2203 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2205 error ("called object %qE is not a function", function);
2206 return error_mark_node;
2209 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2210 current_function_returns_abnormally = 1;
2212 /* fntype now gets the type of function pointed to. */
2213 fntype = TREE_TYPE (fntype);
2215 /* Check that the function is called through a compatible prototype.
2216 If it is not, replace the call by a trap, wrapped up in a compound
2217 expression if necessary. This has the nice side-effect to prevent
2218 the tree-inliner from generating invalid assignment trees which may
2219 blow up in the RTL expander later. */
2220 if ((TREE_CODE (function) == NOP_EXPR
2221 || TREE_CODE (function) == CONVERT_EXPR)
2222 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2223 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2224 && !comptypes (fntype, TREE_TYPE (tem)))
2226 tree return_type = TREE_TYPE (fntype);
2227 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2230 /* This situation leads to run-time undefined behavior. We can't,
2231 therefore, simply error unless we can prove that all possible
2232 executions of the program must execute the code. */
2233 warning (0, "function called through a non-compatible type");
2235 /* We can, however, treat "undefined" any way we please.
2236 Call abort to encourage the user to fix the program. */
2237 inform ("if this code is reached, the program will abort");
2239 if (VOID_TYPE_P (return_type))
2245 if (AGGREGATE_TYPE_P (return_type))
2246 rhs = build_compound_literal (return_type,
2247 build_constructor (return_type, 0));
2249 rhs = fold_convert (return_type, integer_zero_node);
2251 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2255 /* Convert the parameters to the types declared in the
2256 function prototype, or apply default promotions. */
2259 = convert_arguments (TYPE_ARG_TYPES (fntype), params, function, fundecl);
2261 if (coerced_params == error_mark_node)
2262 return error_mark_node;
2264 /* Check that the arguments to the function are valid. */
2266 check_function_arguments (TYPE_ATTRIBUTES (fntype), coerced_params,
2267 TYPE_ARG_TYPES (fntype));
2269 if (require_constant_value)
2271 result = fold_build3_initializer (CALL_EXPR, TREE_TYPE (fntype),
2272 function, coerced_params, NULL_TREE);
2274 if (TREE_CONSTANT (result)
2275 && (name == NULL_TREE
2276 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2277 pedwarn_init ("initializer element is not constant");
2280 result = fold_build3 (CALL_EXPR, TREE_TYPE (fntype),
2281 function, coerced_params, NULL_TREE);
2283 if (VOID_TYPE_P (TREE_TYPE (result)))
2285 return require_complete_type (result);
2288 /* Convert the argument expressions in the list VALUES
2289 to the types in the list TYPELIST. The result is a list of converted
2290 argument expressions, unless there are too few arguments in which
2291 case it is error_mark_node.
2293 If TYPELIST is exhausted, or when an element has NULL as its type,
2294 perform the default conversions.
2296 PARMLIST is the chain of parm decls for the function being called.
2297 It may be 0, if that info is not available.
2298 It is used only for generating error messages.
2300 FUNCTION is a tree for the called function. It is used only for
2301 error messages, where it is formatted with %qE.
2303 This is also where warnings about wrong number of args are generated.
2305 Both VALUES and the returned value are chains of TREE_LIST nodes
2306 with the elements of the list in the TREE_VALUE slots of those nodes. */
2309 convert_arguments (tree typelist, tree values, tree function, tree fundecl)
2311 tree typetail, valtail;
2316 /* Change pointer to function to the function itself for
2318 if (TREE_CODE (function) == ADDR_EXPR
2319 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2320 function = TREE_OPERAND (function, 0);
2322 /* Handle an ObjC selector specially for diagnostics. */
2323 selector = objc_message_selector ();
2325 /* Scan the given expressions and types, producing individual
2326 converted arguments and pushing them on RESULT in reverse order. */
2328 for (valtail = values, typetail = typelist, parmnum = 0;
2330 valtail = TREE_CHAIN (valtail), parmnum++)
2332 tree type = typetail ? TREE_VALUE (typetail) : 0;
2333 tree val = TREE_VALUE (valtail);
2334 tree rname = function;
2335 int argnum = parmnum + 1;
2336 const char *invalid_func_diag;
2338 if (type == void_type_node)
2340 error ("too many arguments to function %qE", function);
2344 if (selector && argnum > 2)
2350 STRIP_TYPE_NOPS (val);
2352 val = require_complete_type (val);
2356 /* Formal parm type is specified by a function prototype. */
2359 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2361 error ("type of formal parameter %d is incomplete", parmnum + 1);
2366 /* Optionally warn about conversions that
2367 differ from the default conversions. */
2368 if (warn_conversion || warn_traditional)
2370 unsigned int formal_prec = TYPE_PRECISION (type);
2372 if (INTEGRAL_TYPE_P (type)
2373 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2374 warning (0, "passing argument %d of %qE as integer "
2375 "rather than floating due to prototype",
2377 if (INTEGRAL_TYPE_P (type)
2378 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2379 warning (0, "passing argument %d of %qE as integer "
2380 "rather than complex due to prototype",
2382 else if (TREE_CODE (type) == COMPLEX_TYPE
2383 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2384 warning (0, "passing argument %d of %qE as complex "
2385 "rather than floating due to prototype",
2387 else if (TREE_CODE (type) == REAL_TYPE
2388 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2389 warning (0, "passing argument %d of %qE as floating "
2390 "rather than integer due to prototype",
2392 else if (TREE_CODE (type) == COMPLEX_TYPE
2393 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2394 warning (0, "passing argument %d of %qE as complex "
2395 "rather than integer due to prototype",
2397 else if (TREE_CODE (type) == REAL_TYPE
2398 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2399 warning (0, "passing argument %d of %qE as floating "
2400 "rather than complex due to prototype",
2402 /* ??? At some point, messages should be written about
2403 conversions between complex types, but that's too messy
2405 else if (TREE_CODE (type) == REAL_TYPE
2406 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2408 /* Warn if any argument is passed as `float',
2409 since without a prototype it would be `double'. */
2410 if (formal_prec == TYPE_PRECISION (float_type_node)
2411 && type != dfloat32_type_node)
2412 warning (0, "passing argument %d of %qE as %<float%> "
2413 "rather than %<double%> due to prototype",
2416 /* Warn if mismatch between argument and prototype
2417 for decimal float types. Warn of conversions with
2418 binary float types and of precision narrowing due to
2420 else if (type != TREE_TYPE (val)
2421 && (type == dfloat32_type_node
2422 || type == dfloat64_type_node
2423 || type == dfloat128_type_node
2424 || TREE_TYPE (val) == dfloat32_type_node
2425 || TREE_TYPE (val) == dfloat64_type_node
2426 || TREE_TYPE (val) == dfloat128_type_node)
2428 <= TYPE_PRECISION (TREE_TYPE (val))
2429 || (type == dfloat128_type_node
2431 != dfloat64_type_node
2433 != dfloat32_type_node)))
2434 || (type == dfloat64_type_node
2436 != dfloat32_type_node))))
2437 warning (0, "passing argument %d of %qE as %qT "
2438 "rather than %qT due to prototype",
2439 argnum, rname, type, TREE_TYPE (val));
2442 /* Detect integer changing in width or signedness.
2443 These warnings are only activated with
2444 -Wconversion, not with -Wtraditional. */
2445 else if (warn_conversion && INTEGRAL_TYPE_P (type)
2446 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2448 tree would_have_been = default_conversion (val);
2449 tree type1 = TREE_TYPE (would_have_been);
2451 if (TREE_CODE (type) == ENUMERAL_TYPE
2452 && (TYPE_MAIN_VARIANT (type)
2453 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2454 /* No warning if function asks for enum
2455 and the actual arg is that enum type. */
2457 else if (formal_prec != TYPE_PRECISION (type1))
2458 warning (OPT_Wconversion, "passing argument %d of %qE "
2459 "with different width due to prototype",
2461 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2463 /* Don't complain if the formal parameter type
2464 is an enum, because we can't tell now whether
2465 the value was an enum--even the same enum. */
2466 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2468 else if (TREE_CODE (val) == INTEGER_CST
2469 && int_fits_type_p (val, type))
2470 /* Change in signedness doesn't matter
2471 if a constant value is unaffected. */
2473 /* If the value is extended from a narrower
2474 unsigned type, it doesn't matter whether we
2475 pass it as signed or unsigned; the value
2476 certainly is the same either way. */
2477 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2478 && TYPE_UNSIGNED (TREE_TYPE (val)))
2480 else if (TYPE_UNSIGNED (type))
2481 warning (OPT_Wconversion, "passing argument %d of %qE "
2482 "as unsigned due to prototype",
2485 warning (OPT_Wconversion, "passing argument %d of %qE "
2486 "as signed due to prototype", argnum, rname);
2490 parmval = convert_for_assignment (type, val, ic_argpass,
2494 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2495 && INTEGRAL_TYPE_P (type)
2496 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2497 parmval = default_conversion (parmval);
2499 result = tree_cons (NULL_TREE, parmval, result);
2501 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2502 && (TYPE_PRECISION (TREE_TYPE (val))
2503 < TYPE_PRECISION (double_type_node))
2504 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2505 /* Convert `float' to `double'. */
2506 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
2507 else if ((invalid_func_diag =
2508 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2510 error (invalid_func_diag);
2511 return error_mark_node;
2514 /* Convert `short' and `char' to full-size `int'. */
2515 result = tree_cons (NULL_TREE, default_conversion (val), result);
2518 typetail = TREE_CHAIN (typetail);
2521 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2523 error ("too few arguments to function %qE", function);
2524 return error_mark_node;
2527 return nreverse (result);
2530 /* This is the entry point used by the parser to build unary operators
2531 in the input. CODE, a tree_code, specifies the unary operator, and
2532 ARG is the operand. For unary plus, the C parser currently uses
2533 CONVERT_EXPR for code. */
2536 parser_build_unary_op (enum tree_code code, struct c_expr arg)
2538 struct c_expr result;
2540 result.original_code = ERROR_MARK;
2541 result.value = build_unary_op (code, arg.value, 0);
2542 overflow_warning (result.value);
2546 /* This is the entry point used by the parser to build binary operators
2547 in the input. CODE, a tree_code, specifies the binary operator, and
2548 ARG1 and ARG2 are the operands. In addition to constructing the
2549 expression, we check for operands that were written with other binary
2550 operators in a way that is likely to confuse the user. */
2553 parser_build_binary_op (enum tree_code code, struct c_expr arg1,
2556 struct c_expr result;
2558 enum tree_code code1 = arg1.original_code;
2559 enum tree_code code2 = arg2.original_code;
2561 result.value = build_binary_op (code, arg1.value, arg2.value, 1);
2562 result.original_code = code;
2564 if (TREE_CODE (result.value) == ERROR_MARK)
2567 /* Check for cases such as x+y<<z which users are likely
2569 if (warn_parentheses)
2571 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
2573 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2574 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2575 warning (OPT_Wparentheses,
2576 "suggest parentheses around + or - inside shift");
2579 if (code == TRUTH_ORIF_EXPR)
2581 if (code1 == TRUTH_ANDIF_EXPR
2582 || code2 == TRUTH_ANDIF_EXPR)
2583 warning (OPT_Wparentheses,
2584 "suggest parentheses around && within ||");
2587 if (code == BIT_IOR_EXPR)
2589 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
2590 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2591 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
2592 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2593 warning (OPT_Wparentheses,
2594 "suggest parentheses around arithmetic in operand of |");
2595 /* Check cases like x|y==z */
2596 if (TREE_CODE_CLASS (code1) == tcc_comparison
2597 || TREE_CODE_CLASS (code2) == tcc_comparison)
2598 warning (OPT_Wparentheses,
2599 "suggest parentheses around comparison in operand of |");
2602 if (code == BIT_XOR_EXPR)
2604 if (code1 == BIT_AND_EXPR
2605 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2606 || code2 == BIT_AND_EXPR
2607 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2608 warning (OPT_Wparentheses,
2609 "suggest parentheses around arithmetic in operand of ^");
2610 /* Check cases like x^y==z */
2611 if (TREE_CODE_CLASS (code1) == tcc_comparison
2612 || TREE_CODE_CLASS (code2) == tcc_comparison)
2613 warning (OPT_Wparentheses,
2614 "suggest parentheses around comparison in operand of ^");
2617 if (code == BIT_AND_EXPR)
2619 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2620 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2621 warning (OPT_Wparentheses,
2622 "suggest parentheses around + or - in operand of &");
2623 /* Check cases like x&y==z */
2624 if (TREE_CODE_CLASS (code1) == tcc_comparison
2625 || TREE_CODE_CLASS (code2) == tcc_comparison)
2626 warning (OPT_Wparentheses,
2627 "suggest parentheses around comparison in operand of &");
2629 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
2630 if (TREE_CODE_CLASS (code) == tcc_comparison
2631 && (TREE_CODE_CLASS (code1) == tcc_comparison
2632 || TREE_CODE_CLASS (code2) == tcc_comparison))
2633 warning (OPT_Wparentheses, "comparisons like X<=Y<=Z do not "
2634 "have their mathematical meaning");
2638 /* Warn about comparisons against string literals, with the exception
2639 of testing for equality or inequality of a string literal with NULL. */
2640 if (code == EQ_EXPR || code == NE_EXPR)
2642 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2643 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2644 warning (OPT_Wstring_literal_comparison,
2645 "comparison with string literal");
2647 else if (TREE_CODE_CLASS (code) == tcc_comparison
2648 && (code1 == STRING_CST || code2 == STRING_CST))
2649 warning (OPT_Wstring_literal_comparison,
2650 "comparison with string literal");
2652 overflow_warning (result.value);
2657 /* Return a tree for the difference of pointers OP0 and OP1.
2658 The resulting tree has type int. */
2661 pointer_diff (tree op0, tree op1)
2663 tree restype = ptrdiff_type_node;
2665 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2666 tree con0, con1, lit0, lit1;
2667 tree orig_op1 = op1;
2669 if (pedantic || warn_pointer_arith)
2671 if (TREE_CODE (target_type) == VOID_TYPE)
2672 pedwarn ("pointer of type %<void *%> used in subtraction");
2673 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2674 pedwarn ("pointer to a function used in subtraction");
2677 /* If the conversion to ptrdiff_type does anything like widening or
2678 converting a partial to an integral mode, we get a convert_expression
2679 that is in the way to do any simplifications.
2680 (fold-const.c doesn't know that the extra bits won't be needed.
2681 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2682 different mode in place.)
2683 So first try to find a common term here 'by hand'; we want to cover
2684 at least the cases that occur in legal static initializers. */
2685 if ((TREE_CODE (op0) == NOP_EXPR || TREE_CODE (op0) == CONVERT_EXPR)
2686 && (TYPE_PRECISION (TREE_TYPE (op0))
2687 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2688 con0 = TREE_OPERAND (op0, 0);
2691 if ((TREE_CODE (op1) == NOP_EXPR || TREE_CODE (op1) == CONVERT_EXPR)
2692 && (TYPE_PRECISION (TREE_TYPE (op1))
2693 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2694 con1 = TREE_OPERAND (op1, 0);
2698 if (TREE_CODE (con0) == PLUS_EXPR)
2700 lit0 = TREE_OPERAND (con0, 1);
2701 con0 = TREE_OPERAND (con0, 0);
2704 lit0 = integer_zero_node;
2706 if (TREE_CODE (con1) == PLUS_EXPR)
2708 lit1 = TREE_OPERAND (con1, 1);
2709 con1 = TREE_OPERAND (con1, 0);
2712 lit1 = integer_zero_node;
2714 if (operand_equal_p (con0, con1, 0))
2721 /* First do the subtraction as integers;
2722 then drop through to build the divide operator.
2723 Do not do default conversions on the minus operator
2724 in case restype is a short type. */
2726 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2727 convert (restype, op1), 0);
2728 /* This generates an error if op1 is pointer to incomplete type. */
2729 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2730 error ("arithmetic on pointer to an incomplete type");
2732 /* This generates an error if op0 is pointer to incomplete type. */
2733 op1 = c_size_in_bytes (target_type);
2735 /* Divide by the size, in easiest possible way. */
2736 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2739 /* Construct and perhaps optimize a tree representation
2740 for a unary operation. CODE, a tree_code, specifies the operation
2741 and XARG is the operand.
2742 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2743 the default promotions (such as from short to int).
2744 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2745 allows non-lvalues; this is only used to handle conversion of non-lvalue
2746 arrays to pointers in C99. */
2749 build_unary_op (enum tree_code code, tree xarg, int flag)
2751 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2754 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2756 int noconvert = flag;
2757 const char *invalid_op_diag;
2759 if (typecode == ERROR_MARK)
2760 return error_mark_node;
2761 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2762 typecode = INTEGER_TYPE;
2764 if ((invalid_op_diag
2765 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2767 error (invalid_op_diag);
2768 return error_mark_node;
2774 /* This is used for unary plus, because a CONVERT_EXPR
2775 is enough to prevent anybody from looking inside for
2776 associativity, but won't generate any code. */
2777 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2778 || typecode == COMPLEX_TYPE
2779 || typecode == VECTOR_TYPE))
2781 error ("wrong type argument to unary plus");
2782 return error_mark_node;
2784 else if (!noconvert)
2785 arg = default_conversion (arg);
2786 arg = non_lvalue (arg);
2790 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2791 || typecode == COMPLEX_TYPE
2792 || typecode == VECTOR_TYPE))
2794 error ("wrong type argument to unary minus");
2795 return error_mark_node;
2797 else if (!noconvert)
2798 arg = default_conversion (arg);
2802 if (typecode == INTEGER_TYPE || typecode == VECTOR_TYPE)
2805 arg = default_conversion (arg);
2807 else if (typecode == COMPLEX_TYPE)
2811 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2813 arg = default_conversion (arg);
2817 error ("wrong type argument to bit-complement");
2818 return error_mark_node;
2823 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2825 error ("wrong type argument to abs");
2826 return error_mark_node;
2828 else if (!noconvert)
2829 arg = default_conversion (arg);
2833 /* Conjugating a real value is a no-op, but allow it anyway. */
2834 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2835 || typecode == COMPLEX_TYPE))
2837 error ("wrong type argument to conjugation");
2838 return error_mark_node;
2840 else if (!noconvert)
2841 arg = default_conversion (arg);
2844 case TRUTH_NOT_EXPR:
2845 if (typecode != INTEGER_TYPE
2846 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2847 && typecode != COMPLEX_TYPE)
2849 error ("wrong type argument to unary exclamation mark");
2850 return error_mark_node;
2852 arg = c_objc_common_truthvalue_conversion (arg);
2853 return invert_truthvalue (arg);
2856 if (TREE_CODE (arg) == COMPLEX_CST)
2857 return TREE_REALPART (arg);
2858 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2859 return fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2864 if (TREE_CODE (arg) == COMPLEX_CST)
2865 return TREE_IMAGPART (arg);
2866 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2867 return fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2869 return convert (TREE_TYPE (arg), integer_zero_node);
2871 case PREINCREMENT_EXPR:
2872 case POSTINCREMENT_EXPR:
2873 case PREDECREMENT_EXPR:
2874 case POSTDECREMENT_EXPR:
2876 /* Increment or decrement the real part of the value,
2877 and don't change the imaginary part. */
2878 if (typecode == COMPLEX_TYPE)
2883 pedwarn ("ISO C does not support %<++%> and %<--%>"
2884 " on complex types");
2886 arg = stabilize_reference (arg);
2887 real = build_unary_op (REALPART_EXPR, arg, 1);
2888 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2889 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
2890 build_unary_op (code, real, 1), imag);
2893 /* Report invalid types. */
2895 if (typecode != POINTER_TYPE
2896 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2898 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2899 error ("wrong type argument to increment");
2901 error ("wrong type argument to decrement");
2903 return error_mark_node;
2908 tree result_type = TREE_TYPE (arg);
2910 arg = get_unwidened (arg, 0);
2911 argtype = TREE_TYPE (arg);
2913 /* Compute the increment. */
2915 if (typecode == POINTER_TYPE)
2917 /* If pointer target is an undefined struct,
2918 we just cannot know how to do the arithmetic. */
2919 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2921 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2922 error ("increment of pointer to unknown structure");
2924 error ("decrement of pointer to unknown structure");
2926 else if ((pedantic || warn_pointer_arith)
2927 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2928 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2930 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2931 pedwarn ("wrong type argument to increment");
2933 pedwarn ("wrong type argument to decrement");
2936 inc = c_size_in_bytes (TREE_TYPE (result_type));
2939 inc = integer_one_node;
2941 inc = convert (argtype, inc);
2943 /* Complain about anything else that is not a true lvalue. */
2944 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
2945 || code == POSTINCREMENT_EXPR)
2948 return error_mark_node;
2950 /* Report a read-only lvalue. */
2951 if (TREE_READONLY (arg))
2953 readonly_error (arg,
2954 ((code == PREINCREMENT_EXPR
2955 || code == POSTINCREMENT_EXPR)
2956 ? lv_increment : lv_decrement));
2957 return error_mark_node;
2960 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2961 val = boolean_increment (code, arg);
2963 val = build2 (code, TREE_TYPE (arg), arg, inc);
2964 TREE_SIDE_EFFECTS (val) = 1;
2965 val = convert (result_type, val);
2966 if (TREE_CODE (val) != code)
2967 TREE_NO_WARNING (val) = 1;
2972 /* Note that this operation never does default_conversion. */
2974 /* Let &* cancel out to simplify resulting code. */
2975 if (TREE_CODE (arg) == INDIRECT_REF)
2977 /* Don't let this be an lvalue. */
2978 if (lvalue_p (TREE_OPERAND (arg, 0)))
2979 return non_lvalue (TREE_OPERAND (arg, 0));
2980 return TREE_OPERAND (arg, 0);
2983 /* For &x[y], return x+y */
2984 if (TREE_CODE (arg) == ARRAY_REF)
2986 tree op0 = TREE_OPERAND (arg, 0);
2987 if (!c_mark_addressable (op0))
2988 return error_mark_node;
2989 return build_binary_op (PLUS_EXPR,
2990 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
2991 ? array_to_pointer_conversion (op0)
2993 TREE_OPERAND (arg, 1), 1);
2996 /* Anything not already handled and not a true memory reference
2997 or a non-lvalue array is an error. */
2998 else if (typecode != FUNCTION_TYPE && !flag
2999 && !lvalue_or_else (arg, lv_addressof))
3000 return error_mark_node;
3002 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3003 argtype = TREE_TYPE (arg);
3005 /* If the lvalue is const or volatile, merge that into the type
3006 to which the address will point. Note that you can't get a
3007 restricted pointer by taking the address of something, so we
3008 only have to deal with `const' and `volatile' here. */
3009 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3010 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3011 argtype = c_build_type_variant (argtype,
3012 TREE_READONLY (arg),
3013 TREE_THIS_VOLATILE (arg));
3015 if (!c_mark_addressable (arg))
3016 return error_mark_node;
3018 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3019 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3021 argtype = build_pointer_type (argtype);
3023 /* ??? Cope with user tricks that amount to offsetof. Delete this
3024 when we have proper support for integer constant expressions. */
3025 val = get_base_address (arg);
3026 if (val && TREE_CODE (val) == INDIRECT_REF
3027 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3029 tree op0 = fold_convert (argtype, fold_offsetof (arg)), op1;
3031 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3032 return fold_build2 (PLUS_EXPR, argtype, op0, op1);
3035 val = build1 (ADDR_EXPR, argtype, arg);
3044 argtype = TREE_TYPE (arg);
3045 return require_constant_value ? fold_build1_initializer (code, argtype, arg)
3046 : fold_build1 (code, argtype, arg);
3049 /* Return nonzero if REF is an lvalue valid for this language.
3050 Lvalues can be assigned, unless their type has TYPE_READONLY.
3051 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3056 enum tree_code code = TREE_CODE (ref);
3063 return lvalue_p (TREE_OPERAND (ref, 0));
3065 case COMPOUND_LITERAL_EXPR:
3075 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3076 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3079 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3086 /* Give an error for storing in something that is 'const'. */
3089 readonly_error (tree arg, enum lvalue_use use)
3091 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3093 /* Using this macro rather than (for example) arrays of messages
3094 ensures that all the format strings are checked at compile
3096 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3097 : (use == lv_increment ? (I) \
3098 : (use == lv_decrement ? (D) : (AS))))
3099 if (TREE_CODE (arg) == COMPONENT_REF)
3101 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3102 readonly_error (TREE_OPERAND (arg, 0), use);
3104 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3105 G_("increment of read-only member %qD"),
3106 G_("decrement of read-only member %qD"),
3107 G_("read-only member %qD used as %<asm%> output")),
3108 TREE_OPERAND (arg, 1));
3110 else if (TREE_CODE (arg) == VAR_DECL)
3111 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3112 G_("increment of read-only variable %qD"),
3113 G_("decrement of read-only variable %qD"),
3114 G_("read-only variable %qD used as %<asm%> output")),
3117 error (READONLY_MSG (G_("assignment of read-only location"),
3118 G_("increment of read-only location"),
3119 G_("decrement of read-only location"),
3120 G_("read-only location used as %<asm%> output")));
3124 /* Return nonzero if REF is an lvalue valid for this language;
3125 otherwise, print an error message and return zero. USE says
3126 how the lvalue is being used and so selects the error message. */
3129 lvalue_or_else (tree ref, enum lvalue_use use)
3131 int win = lvalue_p (ref);
3139 /* Mark EXP saying that we need to be able to take the
3140 address of it; it should not be allocated in a register.
3141 Returns true if successful. */
3144 c_mark_addressable (tree exp)
3149 switch (TREE_CODE (x))
3152 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3155 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3159 /* ... fall through ... */
3165 x = TREE_OPERAND (x, 0);
3168 case COMPOUND_LITERAL_EXPR:
3170 TREE_ADDRESSABLE (x) = 1;
3177 if (C_DECL_REGISTER (x)
3178 && DECL_NONLOCAL (x))
3180 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3183 ("global register variable %qD used in nested function", x);
3186 pedwarn ("register variable %qD used in nested function", x);
3188 else if (C_DECL_REGISTER (x))
3190 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3191 error ("address of global register variable %qD requested", x);
3193 error ("address of register variable %qD requested", x);
3199 TREE_ADDRESSABLE (x) = 1;
3206 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3209 build_conditional_expr (tree ifexp, tree op1, tree op2)
3213 enum tree_code code1;
3214 enum tree_code code2;
3215 tree result_type = NULL;
3216 tree orig_op1 = op1, orig_op2 = op2;
3218 /* Promote both alternatives. */
3220 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3221 op1 = default_conversion (op1);
3222 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3223 op2 = default_conversion (op2);
3225 if (TREE_CODE (ifexp) == ERROR_MARK
3226 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3227 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3228 return error_mark_node;
3230 type1 = TREE_TYPE (op1);
3231 code1 = TREE_CODE (type1);
3232 type2 = TREE_TYPE (op2);
3233 code2 = TREE_CODE (type2);
3235 /* C90 does not permit non-lvalue arrays in conditional expressions.
3236 In C99 they will be pointers by now. */
3237 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3239 error ("non-lvalue array in conditional expression");
3240 return error_mark_node;
3243 /* Quickly detect the usual case where op1 and op2 have the same type
3245 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3248 result_type = type1;
3250 result_type = TYPE_MAIN_VARIANT (type1);
3252 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3253 || code1 == COMPLEX_TYPE)
3254 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3255 || code2 == COMPLEX_TYPE))
3257 result_type = c_common_type (type1, type2);
3259 /* If -Wsign-compare, warn here if type1 and type2 have
3260 different signedness. We'll promote the signed to unsigned
3261 and later code won't know it used to be different.
3262 Do this check on the original types, so that explicit casts
3263 will be considered, but default promotions won't. */
3264 if (warn_sign_compare && !skip_evaluation)
3266 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3267 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3269 if (unsigned_op1 ^ unsigned_op2)
3271 /* Do not warn if the result type is signed, since the
3272 signed type will only be chosen if it can represent
3273 all the values of the unsigned type. */
3274 if (!TYPE_UNSIGNED (result_type))
3276 /* Do not warn if the signed quantity is an unsuffixed
3277 integer literal (or some static constant expression
3278 involving such literals) and it is non-negative. */
3279 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
3280 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
3283 warning (0, "signed and unsigned type in conditional expression");
3287 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3289 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3290 pedwarn ("ISO C forbids conditional expr with only one void side");
3291 result_type = void_type_node;
3293 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3295 if (comp_target_types (type1, type2))
3296 result_type = common_pointer_type (type1, type2);
3297 else if (null_pointer_constant_p (orig_op1))
3298 result_type = qualify_type (type2, type1);
3299 else if (null_pointer_constant_p (orig_op2))
3300 result_type = qualify_type (type1, type2);
3301 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3303 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3304 pedwarn ("ISO C forbids conditional expr between "
3305 "%<void *%> and function pointer");
3306 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3307 TREE_TYPE (type2)));
3309 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3311 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3312 pedwarn ("ISO C forbids conditional expr between "
3313 "%<void *%> and function pointer");
3314 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3315 TREE_TYPE (type1)));
3319 pedwarn ("pointer type mismatch in conditional expression");
3320 result_type = build_pointer_type (void_type_node);
3323 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3325 if (!null_pointer_constant_p (orig_op2))
3326 pedwarn ("pointer/integer type mismatch in conditional expression");
3329 op2 = null_pointer_node;
3331 result_type = type1;
3333 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3335 if (!null_pointer_constant_p (orig_op1))
3336 pedwarn ("pointer/integer type mismatch in conditional expression");
3339 op1 = null_pointer_node;
3341 result_type = type2;
3346 if (flag_cond_mismatch)
3347 result_type = void_type_node;
3350 error ("type mismatch in conditional expression");
3351 return error_mark_node;
3355 /* Merge const and volatile flags of the incoming types. */
3357 = build_type_variant (result_type,
3358 TREE_READONLY (op1) || TREE_READONLY (op2),
3359 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3361 if (result_type != TREE_TYPE (op1))
3362 op1 = convert_and_check (result_type, op1);
3363 if (result_type != TREE_TYPE (op2))
3364 op2 = convert_and_check (result_type, op2);
3366 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3369 /* Return a compound expression that performs two expressions and
3370 returns the value of the second of them. */
3373 build_compound_expr (tree expr1, tree expr2)
3375 if (!TREE_SIDE_EFFECTS (expr1))
3377 /* The left-hand operand of a comma expression is like an expression
3378 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3379 any side-effects, unless it was explicitly cast to (void). */
3380 if (warn_unused_value)
3382 if (VOID_TYPE_P (TREE_TYPE (expr1))
3383 && (TREE_CODE (expr1) == NOP_EXPR
3384 || TREE_CODE (expr1) == CONVERT_EXPR))
3386 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3387 && TREE_CODE (expr1) == COMPOUND_EXPR
3388 && (TREE_CODE (TREE_OPERAND (expr1, 1)) == CONVERT_EXPR
3389 || TREE_CODE (TREE_OPERAND (expr1, 1)) == NOP_EXPR))
3390 ; /* (void) a, (void) b, c */
3392 warning (0, "left-hand operand of comma expression has no effect");
3396 /* With -Wunused, we should also warn if the left-hand operand does have
3397 side-effects, but computes a value which is not used. For example, in
3398 `foo() + bar(), baz()' the result of the `+' operator is not used,
3399 so we should issue a warning. */
3400 else if (warn_unused_value)
3401 warn_if_unused_value (expr1, input_location);
3403 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3406 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3409 build_c_cast (tree type, tree expr)
3413 if (type == error_mark_node || expr == error_mark_node)
3414 return error_mark_node;
3416 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3417 only in <protocol> qualifications. But when constructing cast expressions,
3418 the protocols do matter and must be kept around. */
3419 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3420 return build1 (NOP_EXPR, type, expr);
3422 type = TYPE_MAIN_VARIANT (type);
3424 if (TREE_CODE (type) == ARRAY_TYPE)
3426 error ("cast specifies array type");
3427 return error_mark_node;
3430 if (TREE_CODE (type) == FUNCTION_TYPE)
3432 error ("cast specifies function type");
3433 return error_mark_node;
3436 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3440 if (TREE_CODE (type) == RECORD_TYPE
3441 || TREE_CODE (type) == UNION_TYPE)
3442 pedwarn ("ISO C forbids casting nonscalar to the same type");
3445 else if (TREE_CODE (type) == UNION_TYPE)
3449 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3450 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3451 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3459 pedwarn ("ISO C forbids casts to union type");
3460 t = digest_init (type,
3461 build_constructor_single (type, field, value),
3463 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3464 TREE_INVARIANT (t) = TREE_INVARIANT (value);
3467 error ("cast to union type from type not present in union");
3468 return error_mark_node;
3474 if (type == void_type_node)
3475 return build1 (CONVERT_EXPR, type, value);
3477 otype = TREE_TYPE (value);
3479 /* Optionally warn about potentially worrisome casts. */
3482 && TREE_CODE (type) == POINTER_TYPE
3483 && TREE_CODE (otype) == POINTER_TYPE)
3485 tree in_type = type;
3486 tree in_otype = otype;
3490 /* Check that the qualifiers on IN_TYPE are a superset of
3491 the qualifiers of IN_OTYPE. The outermost level of
3492 POINTER_TYPE nodes is uninteresting and we stop as soon
3493 as we hit a non-POINTER_TYPE node on either type. */
3496 in_otype = TREE_TYPE (in_otype);
3497 in_type = TREE_TYPE (in_type);
3499 /* GNU C allows cv-qualified function types. 'const'
3500 means the function is very pure, 'volatile' means it
3501 can't return. We need to warn when such qualifiers
3502 are added, not when they're taken away. */
3503 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3504 && TREE_CODE (in_type) == FUNCTION_TYPE)
3505 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3507 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3509 while (TREE_CODE (in_type) == POINTER_TYPE
3510 && TREE_CODE (in_otype) == POINTER_TYPE);
3513 warning (0, "cast adds new qualifiers to function type");
3516 /* There are qualifiers present in IN_OTYPE that are not
3517 present in IN_TYPE. */
3518 warning (0, "cast discards qualifiers from pointer target type");
3521 /* Warn about possible alignment problems. */
3522 if (STRICT_ALIGNMENT
3523 && TREE_CODE (type) == POINTER_TYPE
3524 && TREE_CODE (otype) == POINTER_TYPE
3525 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3526 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3527 /* Don't warn about opaque types, where the actual alignment
3528 restriction is unknown. */
3529 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3530 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3531 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3532 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3533 warning (OPT_Wcast_align,
3534 "cast increases required alignment of target type");
3536 if (TREE_CODE (type) == INTEGER_TYPE
3537 && TREE_CODE (otype) == POINTER_TYPE
3538 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3539 /* Unlike conversion of integers to pointers, where the
3540 warning is disabled for converting constants because
3541 of cases such as SIG_*, warn about converting constant
3542 pointers to integers. In some cases it may cause unwanted
3543 sign extension, and a warning is appropriate. */
3544 warning (OPT_Wpointer_to_int_cast,
3545 "cast from pointer to integer of different size");
3547 if (TREE_CODE (value) == CALL_EXPR
3548 && TREE_CODE (type) != TREE_CODE (otype))
3549 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3550 "to non-matching type %qT", otype, type);
3552 if (TREE_CODE (type) == POINTER_TYPE
3553 && TREE_CODE (otype) == INTEGER_TYPE
3554 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3555 /* Don't warn about converting any constant. */
3556 && !TREE_CONSTANT (value))
3557 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3558 "of different size");
3560 strict_aliasing_warning (otype, type, expr);
3562 /* If pedantic, warn for conversions between function and object
3563 pointer types, except for converting a null pointer constant
3564 to function pointer type. */
3566 && TREE_CODE (type) == POINTER_TYPE
3567 && TREE_CODE (otype) == POINTER_TYPE
3568 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3569 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3570 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3573 && TREE_CODE (type) == POINTER_TYPE
3574 && TREE_CODE (otype) == POINTER_TYPE
3575 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3576 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3577 && !null_pointer_constant_p (value))
3578 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3581 value = convert (type, value);
3583 /* Ignore any integer overflow caused by the cast. */
3584 if (TREE_CODE (value) == INTEGER_CST)
3586 if (CONSTANT_CLASS_P (ovalue)
3587 && (TREE_OVERFLOW (ovalue) || TREE_CONSTANT_OVERFLOW (ovalue)))
3589 /* Avoid clobbering a shared constant. */
3590 value = copy_node (value);
3591 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3592 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3594 else if (TREE_OVERFLOW (value) || TREE_CONSTANT_OVERFLOW (value))
3595 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3596 value = build_int_cst_wide (TREE_TYPE (value),
3597 TREE_INT_CST_LOW (value),
3598 TREE_INT_CST_HIGH (value));
3602 /* Don't let a cast be an lvalue. */
3604 value = non_lvalue (value);
3609 /* Interpret a cast of expression EXPR to type TYPE. */
3611 c_cast_expr (struct c_type_name *type_name, tree expr)
3614 int saved_wsp = warn_strict_prototypes;
3616 /* This avoids warnings about unprototyped casts on
3617 integers. E.g. "#define SIG_DFL (void(*)())0". */
3618 if (TREE_CODE (expr) == INTEGER_CST)
3619 warn_strict_prototypes = 0;
3620 type = groktypename (type_name);
3621 warn_strict_prototypes = saved_wsp;
3623 return build_c_cast (type, expr);
3626 /* Build an assignment expression of lvalue LHS from value RHS.
3627 MODIFYCODE is the code for a binary operator that we use
3628 to combine the old value of LHS with RHS to get the new value.
3629 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3632 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3636 tree lhstype = TREE_TYPE (lhs);
3637 tree olhstype = lhstype;
3639 /* Types that aren't fully specified cannot be used in assignments. */
3640 lhs = require_complete_type (lhs);
3642 /* Avoid duplicate error messages from operands that had errors. */
3643 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3644 return error_mark_node;
3646 STRIP_TYPE_NOPS (rhs);
3650 /* If a binary op has been requested, combine the old LHS value with the RHS
3651 producing the value we should actually store into the LHS. */
3653 if (modifycode != NOP_EXPR)
3655 lhs = stabilize_reference (lhs);
3656 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3659 if (!lvalue_or_else (lhs, lv_assign))
3660 return error_mark_node;
3662 /* Give an error for storing in something that is 'const'. */
3664 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3665 || ((TREE_CODE (lhstype) == RECORD_TYPE
3666 || TREE_CODE (lhstype) == UNION_TYPE)
3667 && C_TYPE_FIELDS_READONLY (lhstype)))
3669 readonly_error (lhs, lv_assign);
3670 return error_mark_node;
3673 /* If storing into a structure or union member,
3674 it has probably been given type `int'.
3675 Compute the type that would go with
3676 the actual amount of storage the member occupies. */
3678 if (TREE_CODE (lhs) == COMPONENT_REF
3679 && (TREE_CODE (lhstype) == INTEGER_TYPE
3680 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3681 || TREE_CODE (lhstype) == REAL_TYPE
3682 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3683 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3685 /* If storing in a field that is in actuality a short or narrower than one,
3686 we must store in the field in its actual type. */
3688 if (lhstype != TREE_TYPE (lhs))
3690 lhs = copy_node (lhs);
3691 TREE_TYPE (lhs) = lhstype;
3694 /* Convert new value to destination type. */
3696 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3697 NULL_TREE, NULL_TREE, 0);
3698 if (TREE_CODE (newrhs) == ERROR_MARK)
3699 return error_mark_node;
3701 /* Emit ObjC write barrier, if necessary. */
3702 if (c_dialect_objc () && flag_objc_gc)
3704 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3709 /* Scan operands. */
3711 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3712 TREE_SIDE_EFFECTS (result) = 1;
3714 /* If we got the LHS in a different type for storing in,
3715 convert the result back to the nominal type of LHS
3716 so that the value we return always has the same type
3717 as the LHS argument. */
3719 if (olhstype == TREE_TYPE (result))
3721 return convert_for_assignment (olhstype, result, ic_assign,
3722 NULL_TREE, NULL_TREE, 0);
3725 /* Convert value RHS to type TYPE as preparation for an assignment
3726 to an lvalue of type TYPE.
3727 The real work of conversion is done by `convert'.
3728 The purpose of this function is to generate error messages
3729 for assignments that are not allowed in C.
3730 ERRTYPE says whether it is argument passing, assignment,
3731 initialization or return.
3733 FUNCTION is a tree for the function being called.
3734 PARMNUM is the number of the argument, for printing in error messages. */
3737 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3738 tree fundecl, tree function, int parmnum)
3740 enum tree_code codel = TREE_CODE (type);
3742 enum tree_code coder;
3743 tree rname = NULL_TREE;
3744 bool objc_ok = false;
3746 if (errtype == ic_argpass || errtype == ic_argpass_nonproto)
3749 /* Change pointer to function to the function itself for
3751 if (TREE_CODE (function) == ADDR_EXPR
3752 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3753 function = TREE_OPERAND (function, 0);
3755 /* Handle an ObjC selector specially for diagnostics. */
3756 selector = objc_message_selector ();
3758 if (selector && parmnum > 2)
3765 /* This macro is used to emit diagnostics to ensure that all format
3766 strings are complete sentences, visible to gettext and checked at
3768 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3773 pedwarn (AR, parmnum, rname); \
3775 case ic_argpass_nonproto: \
3776 warning (0, AR, parmnum, rname); \
3788 gcc_unreachable (); \
3792 STRIP_TYPE_NOPS (rhs);
3794 if (optimize && TREE_CODE (rhs) == VAR_DECL
3795 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
3796 rhs = decl_constant_value_for_broken_optimization (rhs);
3798 rhstype = TREE_TYPE (rhs);
3799 coder = TREE_CODE (rhstype);
3801 if (coder == ERROR_MARK)
3802 return error_mark_node;
3804 if (c_dialect_objc ())
3827 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
3830 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
3832 overflow_warning (rhs);
3836 if (coder == VOID_TYPE)
3838 /* Except for passing an argument to an unprototyped function,
3839 this is a constraint violation. When passing an argument to
3840 an unprototyped function, it is compile-time undefined;
3841 making it a constraint in that case was rejected in
3843 error ("void value not ignored as it ought to be");
3844 return error_mark_node;
3846 /* A type converts to a reference to it.
3847 This code doesn't fully support references, it's just for the
3848 special case of va_start and va_copy. */
3849 if (codel == REFERENCE_TYPE
3850 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
3852 if (!lvalue_p (rhs))
3854 error ("cannot pass rvalue to reference parameter");
3855 return error_mark_node;
3857 if (!c_mark_addressable (rhs))
3858 return error_mark_node;
3859 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
3861 /* We already know that these two types are compatible, but they
3862 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3863 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3864 likely to be va_list, a typedef to __builtin_va_list, which
3865 is different enough that it will cause problems later. */
3866 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
3867 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
3869 rhs = build1 (NOP_EXPR, type, rhs);
3872 /* Some types can interconvert without explicit casts. */
3873 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
3874 && vector_types_convertible_p (type, TREE_TYPE (rhs)))
3875 return convert (type, rhs);
3876 /* Arithmetic types all interconvert, and enum is treated like int. */
3877 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
3878 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
3879 || codel == BOOLEAN_TYPE)
3880 && (coder == INTEGER_TYPE || coder == REAL_TYPE
3881 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
3882 || coder == BOOLEAN_TYPE))
3883 return convert_and_check (type, rhs);
3885 /* Conversion to a transparent union from its member types.
3886 This applies only to function arguments. */
3887 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
3888 && (errtype == ic_argpass || errtype == ic_argpass_nonproto))
3890 tree memb, marginal_memb = NULL_TREE;
3892 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
3894 tree memb_type = TREE_TYPE (memb);
3896 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
3897 TYPE_MAIN_VARIANT (rhstype)))
3900 if (TREE_CODE (memb_type) != POINTER_TYPE)
3903 if (coder == POINTER_TYPE)
3905 tree ttl = TREE_TYPE (memb_type);
3906 tree ttr = TREE_TYPE (rhstype);
3908 /* Any non-function converts to a [const][volatile] void *
3909 and vice versa; otherwise, targets must be the same.
3910 Meanwhile, the lhs target must have all the qualifiers of
3912 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3913 || comp_target_types (memb_type, rhstype))
3915 /* If this type won't generate any warnings, use it. */
3916 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
3917 || ((TREE_CODE (ttr) == FUNCTION_TYPE
3918 && TREE_CODE (ttl) == FUNCTION_TYPE)
3919 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3920 == TYPE_QUALS (ttr))
3921 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3922 == TYPE_QUALS (ttl))))
3925 /* Keep looking for a better type, but remember this one. */
3927 marginal_memb = memb;
3931 /* Can convert integer zero to any pointer type. */
3932 if (null_pointer_constant_p (rhs))
3934 rhs = null_pointer_node;
3939 if (memb || marginal_memb)
3943 /* We have only a marginally acceptable member type;
3944 it needs a warning. */
3945 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
3946 tree ttr = TREE_TYPE (rhstype);
3948 /* Const and volatile mean something different for function
3949 types, so the usual warnings are not appropriate. */
3950 if (TREE_CODE (ttr) == FUNCTION_TYPE
3951 && TREE_CODE (ttl) == FUNCTION_TYPE)
3953 /* Because const and volatile on functions are
3954 restrictions that say the function will not do
3955 certain things, it is okay to use a const or volatile
3956 function where an ordinary one is wanted, but not
3958 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
3959 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
3960 "makes qualified function "
3961 "pointer from unqualified"),
3962 G_("assignment makes qualified "
3963 "function pointer from "
3965 G_("initialization makes qualified "
3966 "function pointer from "
3968 G_("return makes qualified function "
3969 "pointer from unqualified"));
3971 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
3972 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
3973 "qualifiers from pointer target type"),
3974 G_("assignment discards qualifiers "
3975 "from pointer target type"),
3976 G_("initialization discards qualifiers "
3977 "from pointer target type"),
3978 G_("return discards qualifiers from "
3979 "pointer target type"));
3981 memb = marginal_memb;
3984 if (pedantic && (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl)))
3985 pedwarn ("ISO C prohibits argument conversion to union type");
3987 return build_constructor_single (type, memb, rhs);
3991 /* Conversions among pointers */
3992 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
3993 && (coder == codel))
3995 tree ttl = TREE_TYPE (type);
3996 tree ttr = TREE_TYPE (rhstype);
3999 bool is_opaque_pointer;
4000 int target_cmp = 0; /* Cache comp_target_types () result. */
4002 if (TREE_CODE (mvl) != ARRAY_TYPE)
4003 mvl = TYPE_MAIN_VARIANT (mvl);
4004 if (TREE_CODE (mvr) != ARRAY_TYPE)
4005 mvr = TYPE_MAIN_VARIANT (mvr);
4006 /* Opaque pointers are treated like void pointers. */
4007 is_opaque_pointer = (targetm.vector_opaque_p (type)
4008 || targetm.vector_opaque_p (rhstype))
4009 && TREE_CODE (ttl) == VECTOR_TYPE
4010 && TREE_CODE (ttr) == VECTOR_TYPE;
4012 /* C++ does not allow the implicit conversion void* -> T*. However,
4013 for the purpose of reducing the number of false positives, we
4014 tolerate the special case of
4018 where NULL is typically defined in C to be '(void *) 0'. */
4019 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4020 warning (OPT_Wc___compat, "request for implicit conversion from "
4021 "%qT to %qT not permitted in C++", rhstype, type);
4023 /* Check if the right-hand side has a format attribute but the
4024 left-hand side doesn't. */
4025 if (warn_missing_format_attribute
4026 && check_missing_format_attribute (type, rhstype))
4031 case ic_argpass_nonproto:
4032 warning (OPT_Wmissing_format_attribute,
4033 "argument %d of %qE might be "
4034 "a candidate for a format attribute",
4038 warning (OPT_Wmissing_format_attribute,
4039 "assignment left-hand side might be "
4040 "a candidate for a format attribute");
4043 warning (OPT_Wmissing_format_attribute,
4044 "initialization left-hand side might be "
4045 "a candidate for a format attribute");
4048 warning (OPT_Wmissing_format_attribute,
4049 "return type might be "
4050 "a candidate for a format attribute");
4057 /* Any non-function converts to a [const][volatile] void *
4058 and vice versa; otherwise, targets must be the same.
4059 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4060 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4061 || (target_cmp = comp_target_types (type, rhstype))
4062 || is_opaque_pointer
4063 || (c_common_unsigned_type (mvl)
4064 == c_common_unsigned_type (mvr)))
4067 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4070 && !null_pointer_constant_p (rhs)
4071 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4072 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
4073 "%qE between function pointer "
4075 G_("ISO C forbids assignment between "
4076 "function pointer and %<void *%>"),
4077 G_("ISO C forbids initialization between "
4078 "function pointer and %<void *%>"),
4079 G_("ISO C forbids return between function "
4080 "pointer and %<void *%>"));
4081 /* Const and volatile mean something different for function types,
4082 so the usual warnings are not appropriate. */
4083 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4084 && TREE_CODE (ttl) != FUNCTION_TYPE)
4086 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4088 /* Types differing only by the presence of the 'volatile'
4089 qualifier are acceptable if the 'volatile' has been added
4090 in by the Objective-C EH machinery. */
4091 if (!objc_type_quals_match (ttl, ttr))
4092 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4093 "qualifiers from pointer target type"),
4094 G_("assignment discards qualifiers "
4095 "from pointer target type"),
4096 G_("initialization discards qualifiers "
4097 "from pointer target type"),
4098 G_("return discards qualifiers from "
4099 "pointer target type"));
4101 /* If this is not a case of ignoring a mismatch in signedness,
4103 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4106 /* If there is a mismatch, do warn. */
4107 else if (warn_pointer_sign)
4108 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
4109 "%d of %qE differ in signedness"),
4110 G_("pointer targets in assignment "
4111 "differ in signedness"),
4112 G_("pointer targets in initialization "
4113 "differ in signedness"),
4114 G_("pointer targets in return differ "
4117 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4118 && TREE_CODE (ttr) == FUNCTION_TYPE)
4120 /* Because const and volatile on functions are restrictions
4121 that say the function will not do certain things,
4122 it is okay to use a const or volatile function
4123 where an ordinary one is wanted, but not vice-versa. */
4124 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4125 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4126 "qualified function pointer "
4127 "from unqualified"),
4128 G_("assignment makes qualified function "
4129 "pointer from unqualified"),
4130 G_("initialization makes qualified "
4131 "function pointer from unqualified"),
4132 G_("return makes qualified function "
4133 "pointer from unqualified"));
4137 /* Avoid warning about the volatile ObjC EH puts on decls. */
4139 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
4140 "incompatible pointer type"),
4141 G_("assignment from incompatible pointer type"),
4142 G_("initialization from incompatible "
4144 G_("return from incompatible pointer type"));
4146 return convert (type, rhs);
4148 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4150 /* ??? This should not be an error when inlining calls to
4151 unprototyped functions. */
4152 error ("invalid use of non-lvalue array");
4153 return error_mark_node;
4155 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4157 /* An explicit constant 0 can convert to a pointer,
4158 or one that results from arithmetic, even including
4159 a cast to integer type. */
4160 if (!null_pointer_constant_p (rhs))
4161 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4162 "pointer from integer without a cast"),
4163 G_("assignment makes pointer from integer "
4165 G_("initialization makes pointer from "
4166 "integer without a cast"),
4167 G_("return makes pointer from integer "
4170 return convert (type, rhs);
4172 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4174 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
4175 "from pointer without a cast"),
4176 G_("assignment makes integer from pointer "
4178 G_("initialization makes integer from pointer "
4180 G_("return makes integer from pointer "
4182 return convert (type, rhs);
4184 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4185 return convert (type, rhs);
4190 case ic_argpass_nonproto:
4191 /* ??? This should not be an error when inlining calls to
4192 unprototyped functions. */
4193 error ("incompatible type for argument %d of %qE", parmnum, rname);
4196 error ("incompatible types in assignment");
4199 error ("incompatible types in initialization");
4202 error ("incompatible types in return");
4208 return error_mark_node;
4211 /* Convert VALUE for assignment into inlined parameter PARM. ARGNUM
4212 is used for error and waring reporting and indicates which argument
4213 is being processed. */
4216 c_convert_parm_for_inlining (tree parm, tree value, tree fn, int argnum)
4220 /* If FN was prototyped, the value has been converted already
4221 in convert_arguments. */
4222 if (!value || TYPE_ARG_TYPES (TREE_TYPE (fn)))
4225 type = TREE_TYPE (parm);
4226 ret = convert_for_assignment (type, value,
4227 ic_argpass_nonproto, fn,
4229 if (targetm.calls.promote_prototypes (TREE_TYPE (fn))
4230 && INTEGRAL_TYPE_P (type)
4231 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
4232 ret = default_conversion (ret);
4236 /* If VALUE is a compound expr all of whose expressions are constant, then
4237 return its value. Otherwise, return error_mark_node.
4239 This is for handling COMPOUND_EXPRs as initializer elements
4240 which is allowed with a warning when -pedantic is specified. */
4243 valid_compound_expr_initializer (tree value, tree endtype)
4245 if (TREE_CODE (value) == COMPOUND_EXPR)
4247 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4249 return error_mark_node;
4250 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4253 else if (!initializer_constant_valid_p (value, endtype))
4254 return error_mark_node;
4259 /* Perform appropriate conversions on the initial value of a variable,
4260 store it in the declaration DECL,
4261 and print any error messages that are appropriate.
4262 If the init is invalid, store an ERROR_MARK. */
4265 store_init_value (tree decl, tree init)
4269 /* If variable's type was invalidly declared, just ignore it. */
4271 type = TREE_TYPE (decl);
4272 if (TREE_CODE (type) == ERROR_MARK)
4275 /* Digest the specified initializer into an expression. */
4277 value = digest_init (type, init, true, TREE_STATIC (decl));
4279 /* Store the expression if valid; else report error. */
4281 if (!in_system_header
4282 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4283 warning (OPT_Wtraditional, "traditional C rejects automatic "
4284 "aggregate initialization");
4286 DECL_INITIAL (decl) = value;
4288 /* ANSI wants warnings about out-of-range constant initializers. */
4289 STRIP_TYPE_NOPS (value);
4290 constant_expression_warning (value);
4292 /* Check if we need to set array size from compound literal size. */
4293 if (TREE_CODE (type) == ARRAY_TYPE
4294 && TYPE_DOMAIN (type) == 0
4295 && value != error_mark_node)
4297 tree inside_init = init;
4299 STRIP_TYPE_NOPS (inside_init);
4300 inside_init = fold (inside_init);
4302 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4304 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4306 if (TYPE_DOMAIN (TREE_TYPE (decl)))
4308 /* For int foo[] = (int [3]){1}; we need to set array size
4309 now since later on array initializer will be just the
4310 brace enclosed list of the compound literal. */
4311 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (decl));
4313 layout_decl (decl, 0);
4319 /* Methods for storing and printing names for error messages. */
4321 /* Implement a spelling stack that allows components of a name to be pushed
4322 and popped. Each element on the stack is this structure. */
4329 unsigned HOST_WIDE_INT i;
4334 #define SPELLING_STRING 1
4335 #define SPELLING_MEMBER 2
4336 #define SPELLING_BOUNDS 3
4338 static struct spelling *spelling; /* Next stack element (unused). */
4339 static struct spelling *spelling_base; /* Spelling stack base. */
4340 static int spelling_size; /* Size of the spelling stack. */
4342 /* Macros to save and restore the spelling stack around push_... functions.
4343 Alternative to SAVE_SPELLING_STACK. */
4345 #define SPELLING_DEPTH() (spelling - spelling_base)
4346 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4348 /* Push an element on the spelling stack with type KIND and assign VALUE
4351 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4353 int depth = SPELLING_DEPTH (); \
4355 if (depth >= spelling_size) \
4357 spelling_size += 10; \
4358 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4360 RESTORE_SPELLING_DEPTH (depth); \
4363 spelling->kind = (KIND); \
4364 spelling->MEMBER = (VALUE); \
4368 /* Push STRING on the stack. Printed literally. */
4371 push_string (const char *string)
4373 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4376 /* Push a member name on the stack. Printed as '.' STRING. */
4379 push_member_name (tree decl)
4381 const char *const string
4382 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4383 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4386 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4389 push_array_bounds (unsigned HOST_WIDE_INT bounds)
4391 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4394 /* Compute the maximum size in bytes of the printed spelling. */
4397 spelling_length (void)
4402 for (p = spelling_base; p < spelling; p++)
4404 if (p->kind == SPELLING_BOUNDS)
4407 size += strlen (p->u.s) + 1;
4413 /* Print the spelling to BUFFER and return it. */
4416 print_spelling (char *buffer)
4421 for (p = spelling_base; p < spelling; p++)
4422 if (p->kind == SPELLING_BOUNDS)
4424 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
4430 if (p->kind == SPELLING_MEMBER)
4432 for (s = p->u.s; (*d = *s++); d++)
4439 /* Issue an error message for a bad initializer component.
4440 MSGID identifies the message.
4441 The component name is taken from the spelling stack. */
4444 error_init (const char *msgid)
4448 error ("%s", _(msgid));
4449 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4451 error ("(near initialization for %qs)", ofwhat);
4454 /* Issue a pedantic warning for a bad initializer component.
4455 MSGID identifies the message.
4456 The component name is taken from the spelling stack. */
4459 pedwarn_init (const char *msgid)
4463 pedwarn ("%s", _(msgid));
4464 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4466 pedwarn ("(near initialization for %qs)", ofwhat);
4469 /* Issue a warning for a bad initializer component.
4470 MSGID identifies the message.
4471 The component name is taken from the spelling stack. */
4474 warning_init (const char *msgid)
4478 warning (0, "%s", _(msgid));
4479 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4481 warning (0, "(near initialization for %qs)", ofwhat);
4484 /* If TYPE is an array type and EXPR is a parenthesized string
4485 constant, warn if pedantic that EXPR is being used to initialize an
4486 object of type TYPE. */
4489 maybe_warn_string_init (tree type, struct c_expr expr)
4492 && TREE_CODE (type) == ARRAY_TYPE
4493 && TREE_CODE (expr.value) == STRING_CST
4494 && expr.original_code != STRING_CST)
4495 pedwarn_init ("array initialized from parenthesized string constant");
4498 /* Digest the parser output INIT as an initializer for type TYPE.
4499 Return a C expression of type TYPE to represent the initial value.
4501 If INIT is a string constant, STRICT_STRING is true if it is
4502 unparenthesized or we should not warn here for it being parenthesized.
4503 For other types of INIT, STRICT_STRING is not used.
4505 REQUIRE_CONSTANT requests an error if non-constant initializers or
4506 elements are seen. */
4509 digest_init (tree type, tree init, bool strict_string, int require_constant)
4511 enum tree_code code = TREE_CODE (type);
4512 tree inside_init = init;
4514 if (type == error_mark_node
4516 || init == error_mark_node
4517 || TREE_TYPE (init) == error_mark_node)
4518 return error_mark_node;
4520 STRIP_TYPE_NOPS (inside_init);
4522 inside_init = fold (inside_init);
4524 /* Initialization of an array of chars from a string constant
4525 optionally enclosed in braces. */
4527 if (code == ARRAY_TYPE && inside_init
4528 && TREE_CODE (inside_init) == STRING_CST)
4530 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4531 /* Note that an array could be both an array of character type
4532 and an array of wchar_t if wchar_t is signed char or unsigned
4534 bool char_array = (typ1 == char_type_node
4535 || typ1 == signed_char_type_node
4536 || typ1 == unsigned_char_type_node);
4537 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4538 if (char_array || wchar_array)
4542 expr.value = inside_init;
4543 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4544 maybe_warn_string_init (type, expr);
4547 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4550 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4551 TYPE_MAIN_VARIANT (type)))
4554 if (!wchar_array && !char_string)
4556 error_init ("char-array initialized from wide string");
4557 return error_mark_node;
4559 if (char_string && !char_array)
4561 error_init ("wchar_t-array initialized from non-wide string");
4562 return error_mark_node;
4565 TREE_TYPE (inside_init) = type;
4566 if (TYPE_DOMAIN (type) != 0
4567 && TYPE_SIZE (type) != 0
4568 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4569 /* Subtract 1 (or sizeof (wchar_t))
4570 because it's ok to ignore the terminating null char
4571 that is counted in the length of the constant. */
4572 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4573 TREE_STRING_LENGTH (inside_init)
4574 - ((TYPE_PRECISION (typ1)
4575 != TYPE_PRECISION (char_type_node))
4576 ? (TYPE_PRECISION (wchar_type_node)
4579 pedwarn_init ("initializer-string for array of chars is too long");
4583 else if (INTEGRAL_TYPE_P (typ1))
4585 error_init ("array of inappropriate type initialized "
4586 "from string constant");
4587 return error_mark_node;
4591 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4592 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4593 below and handle as a constructor. */
4594 if (code == VECTOR_TYPE
4595 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4596 && vector_types_convertible_p (TREE_TYPE (inside_init), type)
4597 && TREE_CONSTANT (inside_init))
4599 if (TREE_CODE (inside_init) == VECTOR_CST
4600 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4601 TYPE_MAIN_VARIANT (type)))
4604 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4606 unsigned HOST_WIDE_INT ix;
4608 bool constant_p = true;
4610 /* Iterate through elements and check if all constructor
4611 elements are *_CSTs. */
4612 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4613 if (!CONSTANT_CLASS_P (value))
4620 return build_vector_from_ctor (type,
4621 CONSTRUCTOR_ELTS (inside_init));
4625 /* Any type can be initialized
4626 from an expression of the same type, optionally with braces. */
4628 if (inside_init && TREE_TYPE (inside_init) != 0
4629 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4630 TYPE_MAIN_VARIANT (type))
4631 || (code == ARRAY_TYPE
4632 && comptypes (TREE_TYPE (inside_init), type))
4633 || (code == VECTOR_TYPE
4634 && comptypes (TREE_TYPE (inside_init), type))
4635 || (code == POINTER_TYPE
4636 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4637 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4638 TREE_TYPE (type)))))
4640 if (code == POINTER_TYPE)
4642 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4644 if (TREE_CODE (inside_init) == STRING_CST
4645 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4646 inside_init = array_to_pointer_conversion (inside_init);
4649 error_init ("invalid use of non-lvalue array");
4650 return error_mark_node;
4655 if (code == VECTOR_TYPE)
4656 /* Although the types are compatible, we may require a
4658 inside_init = convert (type, inside_init);
4660 if (require_constant && !flag_isoc99
4661 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4663 /* As an extension, allow initializing objects with static storage
4664 duration with compound literals (which are then treated just as
4665 the brace enclosed list they contain). */
4666 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4667 inside_init = DECL_INITIAL (decl);
4670 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4671 && TREE_CODE (inside_init) != CONSTRUCTOR)
4673 error_init ("array initialized from non-constant array expression");
4674 return error_mark_node;
4677 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4678 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4680 /* Compound expressions can only occur here if -pedantic or
4681 -pedantic-errors is specified. In the later case, we always want
4682 an error. In the former case, we simply want a warning. */
4683 if (require_constant && pedantic
4684 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4687 = valid_compound_expr_initializer (inside_init,
4688 TREE_TYPE (inside_init));
4689 if (inside_init == error_mark_node)
4690 error_init ("initializer element is not constant");
4692 pedwarn_init ("initializer element is not constant");
4693 if (flag_pedantic_errors)
4694 inside_init = error_mark_node;
4696 else if (require_constant
4697 && !initializer_constant_valid_p (inside_init,
4698 TREE_TYPE (inside_init)))
4700 error_init ("initializer element is not constant");
4701 inside_init = error_mark_node;
4704 /* Added to enable additional -Wmissing-format-attribute warnings. */
4705 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4706 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4711 /* Handle scalar types, including conversions. */
4713 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4714 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE
4715 || code == VECTOR_TYPE)
4717 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4718 && (TREE_CODE (init) == STRING_CST
4719 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4720 init = array_to_pointer_conversion (init);
4722 = convert_for_assignment (type, init, ic_init,
4723 NULL_TREE, NULL_TREE, 0);
4725 /* Check to see if we have already given an error message. */
4726 if (inside_init == error_mark_node)
4728 else if (require_constant && !TREE_CONSTANT (inside_init))
4730 error_init ("initializer element is not constant");
4731 inside_init = error_mark_node;
4733 else if (require_constant
4734 && !initializer_constant_valid_p (inside_init,
4735 TREE_TYPE (inside_init)))
4737 error_init ("initializer element is not computable at load time");
4738 inside_init = error_mark_node;
4744 /* Come here only for records and arrays. */
4746 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4748 error_init ("variable-sized object may not be initialized");
4749 return error_mark_node;
4752 error_init ("invalid initializer");
4753 return error_mark_node;
4756 /* Handle initializers that use braces. */
4758 /* Type of object we are accumulating a constructor for.
4759 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4760 static tree constructor_type;
4762 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4764 static tree constructor_fields;
4766 /* For an ARRAY_TYPE, this is the specified index
4767 at which to store the next element we get. */
4768 static tree constructor_index;
4770 /* For an ARRAY_TYPE, this is the maximum index. */
4771 static tree constructor_max_index;
4773 /* For a RECORD_TYPE, this is the first field not yet written out. */
4774 static tree constructor_unfilled_fields;
4776 /* For an ARRAY_TYPE, this is the index of the first element
4777 not yet written out. */
4778 static tree constructor_unfilled_index;
4780 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4781 This is so we can generate gaps between fields, when appropriate. */
4782 static tree constructor_bit_index;
4784 /* If we are saving up the elements rather than allocating them,
4785 this is the list of elements so far (in reverse order,
4786 most recent first). */
4787 static VEC(constructor_elt,gc) *constructor_elements;
4789 /* 1 if constructor should be incrementally stored into a constructor chain,
4790 0 if all the elements should be kept in AVL tree. */
4791 static int constructor_incremental;
4793 /* 1 if so far this constructor's elements are all compile-time constants. */
4794 static int constructor_constant;
4796 /* 1 if so far this constructor's elements are all valid address constants. */
4797 static int constructor_simple;
4799 /* 1 if this constructor is erroneous so far. */
4800 static int constructor_erroneous;
4802 /* Structure for managing pending initializer elements, organized as an
4807 struct init_node *left, *right;
4808 struct init_node *parent;
4814 /* Tree of pending elements at this constructor level.
4815 These are elements encountered out of order
4816 which belong at places we haven't reached yet in actually
4818 Will never hold tree nodes across GC runs. */
4819 static struct init_node *constructor_pending_elts;
4821 /* The SPELLING_DEPTH of this constructor. */
4822 static int constructor_depth;
4824 /* DECL node for which an initializer is being read.
4825 0 means we are reading a constructor expression
4826 such as (struct foo) {...}. */
4827 static tree constructor_decl;
4829 /* Nonzero if this is an initializer for a top-level decl. */
4830 static int constructor_top_level;
4832 /* Nonzero if there were any member designators in this initializer. */
4833 static int constructor_designated;
4835 /* Nesting depth of designator list. */
4836 static int designator_depth;
4838 /* Nonzero if there were diagnosed errors in this designator list. */
4839 static int designator_erroneous;
4842 /* This stack has a level for each implicit or explicit level of
4843 structuring in the initializer, including the outermost one. It
4844 saves the values of most of the variables above. */
4846 struct constructor_range_stack;
4848 struct constructor_stack
4850 struct constructor_stack *next;
4855 tree unfilled_index;
4856 tree unfilled_fields;
4858 VEC(constructor_elt,gc) *elements;
4859 struct init_node *pending_elts;
4862 /* If value nonzero, this value should replace the entire
4863 constructor at this level. */
4864 struct c_expr replacement_value;
4865 struct constructor_range_stack *range_stack;
4875 static struct constructor_stack *constructor_stack;
4877 /* This stack represents designators from some range designator up to
4878 the last designator in the list. */
4880 struct constructor_range_stack
4882 struct constructor_range_stack *next, *prev;
4883 struct constructor_stack *stack;
4890 static struct constructor_range_stack *constructor_range_stack;
4892 /* This stack records separate initializers that are nested.
4893 Nested initializers can't happen in ANSI C, but GNU C allows them
4894 in cases like { ... (struct foo) { ... } ... }. */
4896 struct initializer_stack
4898 struct initializer_stack *next;
4900 struct constructor_stack *constructor_stack;
4901 struct constructor_range_stack *constructor_range_stack;
4902 VEC(constructor_elt,gc) *elements;
4903 struct spelling *spelling;
4904 struct spelling *spelling_base;
4907 char require_constant_value;
4908 char require_constant_elements;
4911 static struct initializer_stack *initializer_stack;
4913 /* Prepare to parse and output the initializer for variable DECL. */
4916 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
4919 struct initializer_stack *p = XNEW (struct initializer_stack);
4921 p->decl = constructor_decl;
4922 p->require_constant_value = require_constant_value;
4923 p->require_constant_elements = require_constant_elements;
4924 p->constructor_stack = constructor_stack;
4925 p->constructor_range_stack = constructor_range_stack;
4926 p->elements = constructor_elements;
4927 p->spelling = spelling;
4928 p->spelling_base = spelling_base;
4929 p->spelling_size = spelling_size;
4930 p->top_level = constructor_top_level;
4931 p->next = initializer_stack;
4932 initializer_stack = p;
4934 constructor_decl = decl;
4935 constructor_designated = 0;
4936 constructor_top_level = top_level;
4938 if (decl != 0 && decl != error_mark_node)
4940 require_constant_value = TREE_STATIC (decl);
4941 require_constant_elements
4942 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
4943 /* For a scalar, you can always use any value to initialize,
4944 even within braces. */
4945 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
4946 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
4947 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
4948 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
4949 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
4953 require_constant_value = 0;
4954 require_constant_elements = 0;
4955 locus = "(anonymous)";
4958 constructor_stack = 0;
4959 constructor_range_stack = 0;
4961 missing_braces_mentioned = 0;
4965 RESTORE_SPELLING_DEPTH (0);
4968 push_string (locus);
4974 struct initializer_stack *p = initializer_stack;
4976 /* Free the whole constructor stack of this initializer. */
4977 while (constructor_stack)
4979 struct constructor_stack *q = constructor_stack;
4980 constructor_stack = q->next;
4984 gcc_assert (!constructor_range_stack);
4986 /* Pop back to the data of the outer initializer (if any). */
4987 free (spelling_base);
4989 constructor_decl = p->decl;
4990 require_constant_value = p->require_constant_value;
4991 require_constant_elements = p->require_constant_elements;
4992 constructor_stack = p->constructor_stack;
4993 constructor_range_stack = p->constructor_range_stack;
4994 constructor_elements = p->elements;
4995 spelling = p->spelling;
4996 spelling_base = p->spelling_base;
4997 spelling_size = p->spelling_size;
4998 constructor_top_level = p->top_level;
4999 initializer_stack = p->next;
5003 /* Call here when we see the initializer is surrounded by braces.
5004 This is instead of a call to push_init_level;
5005 it is matched by a call to pop_init_level.
5007 TYPE is the type to initialize, for a constructor expression.
5008 For an initializer for a decl, TYPE is zero. */
5011 really_start_incremental_init (tree type)
5013 struct constructor_stack *p = XNEW (struct constructor_stack);
5016 type = TREE_TYPE (constructor_decl);
5018 if (targetm.vector_opaque_p (type))
5019 error ("opaque vector types cannot be initialized");
5021 p->type = constructor_type;
5022 p->fields = constructor_fields;
5023 p->index = constructor_index;
5024 p->max_index = constructor_max_index;
5025 p->unfilled_index = constructor_unfilled_index;
5026 p->unfilled_fields = constructor_unfilled_fields;
5027 p->bit_index = constructor_bit_index;
5028 p->elements = constructor_elements;
5029 p->constant = constructor_constant;
5030 p->simple = constructor_simple;
5031 p->erroneous = constructor_erroneous;
5032 p->pending_elts = constructor_pending_elts;
5033 p->depth = constructor_depth;
5034 p->replacement_value.value = 0;
5035 p->replacement_value.original_code = ERROR_MARK;
5039 p->incremental = constructor_incremental;
5040 p->designated = constructor_designated;
5042 constructor_stack = p;
5044 constructor_constant = 1;
5045 constructor_simple = 1;
5046 constructor_depth = SPELLING_DEPTH ();
5047 constructor_elements = 0;
5048 constructor_pending_elts = 0;
5049 constructor_type = type;
5050 constructor_incremental = 1;
5051 constructor_designated = 0;
5052 designator_depth = 0;
5053 designator_erroneous = 0;
5055 if (TREE_CODE (constructor_type) == RECORD_TYPE
5056 || TREE_CODE (constructor_type) == UNION_TYPE)
5058 constructor_fields = TYPE_FIELDS (constructor_type);
5059 /* Skip any nameless bit fields at the beginning. */
5060 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5061 && DECL_NAME (constructor_fields) == 0)
5062 constructor_fields = TREE_CHAIN (constructor_fields);
5064 constructor_unfilled_fields = constructor_fields;
5065 constructor_bit_index = bitsize_zero_node;
5067 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5069 if (TYPE_DOMAIN (constructor_type))
5071 constructor_max_index
5072 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5074 /* Detect non-empty initializations of zero-length arrays. */
5075 if (constructor_max_index == NULL_TREE
5076 && TYPE_SIZE (constructor_type))
5077 constructor_max_index = build_int_cst (NULL_TREE, -1);
5079 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5080 to initialize VLAs will cause a proper error; avoid tree
5081 checking errors as well by setting a safe value. */
5082 if (constructor_max_index
5083 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5084 constructor_max_index = build_int_cst (NULL_TREE, -1);
5087 = convert (bitsizetype,
5088 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5092 constructor_index = bitsize_zero_node;
5093 constructor_max_index = NULL_TREE;
5096 constructor_unfilled_index = constructor_index;
5098 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5100 /* Vectors are like simple fixed-size arrays. */
5101 constructor_max_index =
5102 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5103 constructor_index = bitsize_zero_node;
5104 constructor_unfilled_index = constructor_index;
5108 /* Handle the case of int x = {5}; */
5109 constructor_fields = constructor_type;
5110 constructor_unfilled_fields = constructor_type;
5114 /* Push down into a subobject, for initialization.
5115 If this is for an explicit set of braces, IMPLICIT is 0.
5116 If it is because the next element belongs at a lower level,
5117 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5120 push_init_level (int implicit)
5122 struct constructor_stack *p;
5123 tree value = NULL_TREE;
5125 /* If we've exhausted any levels that didn't have braces,
5126 pop them now. If implicit == 1, this will have been done in
5127 process_init_element; do not repeat it here because in the case
5128 of excess initializers for an empty aggregate this leads to an
5129 infinite cycle of popping a level and immediately recreating
5133 while (constructor_stack->implicit)
5135 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5136 || TREE_CODE (constructor_type) == UNION_TYPE)
5137 && constructor_fields == 0)
5138 process_init_element (pop_init_level (1));
5139 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5140 && constructor_max_index
5141 && tree_int_cst_lt (constructor_max_index,
5143 process_init_element (pop_init_level (1));
5149 /* Unless this is an explicit brace, we need to preserve previous
5153 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5154 || TREE_CODE (constructor_type) == UNION_TYPE)
5155 && constructor_fields)
5156 value = find_init_member (constructor_fields);
5157 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5158 value = find_init_member (constructor_index);
5161 p = XNEW (struct constructor_stack);
5162 p->type = constructor_type;
5163 p->fields = constructor_fields;
5164 p->index = constructor_index;
5165 p->max_index = constructor_max_index;
5166 p->unfilled_index = constructor_unfilled_index;
5167 p->unfilled_fields = constructor_unfilled_fields;
5168 p->bit_index = constructor_bit_index;
5169 p->elements = constructor_elements;
5170 p->constant = constructor_constant;
5171 p->simple = constructor_simple;
5172 p->erroneous = constructor_erroneous;
5173 p->pending_elts = constructor_pending_elts;
5174 p->depth = constructor_depth;
5175 p->replacement_value.value = 0;
5176 p->replacement_value.original_code = ERROR_MARK;
5177 p->implicit = implicit;
5179 p->incremental = constructor_incremental;
5180 p->designated = constructor_designated;
5181 p->next = constructor_stack;
5183 constructor_stack = p;
5185 constructor_constant = 1;
5186 constructor_simple = 1;
5187 constructor_depth = SPELLING_DEPTH ();
5188 constructor_elements = 0;
5189 constructor_incremental = 1;
5190 constructor_designated = 0;
5191 constructor_pending_elts = 0;
5194 p->range_stack = constructor_range_stack;
5195 constructor_range_stack = 0;
5196 designator_depth = 0;
5197 designator_erroneous = 0;
5200 /* Don't die if an entire brace-pair level is superfluous
5201 in the containing level. */
5202 if (constructor_type == 0)
5204 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5205 || TREE_CODE (constructor_type) == UNION_TYPE)
5207 /* Don't die if there are extra init elts at the end. */
5208 if (constructor_fields == 0)
5209 constructor_type = 0;
5212 constructor_type = TREE_TYPE (constructor_fields);
5213 push_member_name (constructor_fields);
5214 constructor_depth++;
5217 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5219 constructor_type = TREE_TYPE (constructor_type);
5220 push_array_bounds (tree_low_cst (constructor_index, 1));
5221 constructor_depth++;
5224 if (constructor_type == 0)
5226 error_init ("extra brace group at end of initializer");
5227 constructor_fields = 0;
5228 constructor_unfilled_fields = 0;
5232 if (value && TREE_CODE (value) == CONSTRUCTOR)
5234 constructor_constant = TREE_CONSTANT (value);
5235 constructor_simple = TREE_STATIC (value);
5236 constructor_elements = CONSTRUCTOR_ELTS (value);
5237 if (!VEC_empty (constructor_elt, constructor_elements)
5238 && (TREE_CODE (constructor_type) == RECORD_TYPE
5239 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5240 set_nonincremental_init ();
5243 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5245 missing_braces_mentioned = 1;
5246 warning_init ("missing braces around initializer");
5249 if (TREE_CODE (constructor_type) == RECORD_TYPE
5250 || TREE_CODE (constructor_type) == UNION_TYPE)
5252 constructor_fields = TYPE_FIELDS (constructor_type);
5253 /* Skip any nameless bit fields at the beginning. */
5254 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5255 && DECL_NAME (constructor_fields) == 0)
5256 constructor_fields = TREE_CHAIN (constructor_fields);
5258 constructor_unfilled_fields = constructor_fields;
5259 constructor_bit_index = bitsize_zero_node;
5261 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5263 /* Vectors are like simple fixed-size arrays. */
5264 constructor_max_index =
5265 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5266 constructor_index = convert (bitsizetype, integer_zero_node);
5267 constructor_unfilled_index = constructor_index;
5269 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5271 if (TYPE_DOMAIN (constructor_type))
5273 constructor_max_index
5274 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5276 /* Detect non-empty initializations of zero-length arrays. */
5277 if (constructor_max_index == NULL_TREE
5278 && TYPE_SIZE (constructor_type))
5279 constructor_max_index = build_int_cst (NULL_TREE, -1);
5281 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5282 to initialize VLAs will cause a proper error; avoid tree
5283 checking errors as well by setting a safe value. */
5284 if (constructor_max_index
5285 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5286 constructor_max_index = build_int_cst (NULL_TREE, -1);
5289 = convert (bitsizetype,
5290 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5293 constructor_index = bitsize_zero_node;
5295 constructor_unfilled_index = constructor_index;
5296 if (value && TREE_CODE (value) == STRING_CST)
5298 /* We need to split the char/wchar array into individual
5299 characters, so that we don't have to special case it
5301 set_nonincremental_init_from_string (value);
5306 if (constructor_type != error_mark_node)
5307 warning_init ("braces around scalar initializer");
5308 constructor_fields = constructor_type;
5309 constructor_unfilled_fields = constructor_type;
5313 /* At the end of an implicit or explicit brace level,
5314 finish up that level of constructor. If a single expression
5315 with redundant braces initialized that level, return the
5316 c_expr structure for that expression. Otherwise, the original_code
5317 element is set to ERROR_MARK.
5318 If we were outputting the elements as they are read, return 0 as the value
5319 from inner levels (process_init_element ignores that),
5320 but return error_mark_node as the value from the outermost level
5321 (that's what we want to put in DECL_INITIAL).
5322 Otherwise, return a CONSTRUCTOR expression as the value. */
5325 pop_init_level (int implicit)
5327 struct constructor_stack *p;
5330 ret.original_code = ERROR_MARK;
5334 /* When we come to an explicit close brace,
5335 pop any inner levels that didn't have explicit braces. */
5336 while (constructor_stack->implicit)
5337 process_init_element (pop_init_level (1));
5339 gcc_assert (!constructor_range_stack);
5342 /* Now output all pending elements. */
5343 constructor_incremental = 1;
5344 output_pending_init_elements (1);
5346 p = constructor_stack;
5348 /* Error for initializing a flexible array member, or a zero-length
5349 array member in an inappropriate context. */
5350 if (constructor_type && constructor_fields
5351 && TREE_CODE (constructor_type) == ARRAY_TYPE
5352 && TYPE_DOMAIN (constructor_type)
5353 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5355 /* Silently discard empty initializations. The parser will
5356 already have pedwarned for empty brackets. */
5357 if (integer_zerop (constructor_unfilled_index))
5358 constructor_type = NULL_TREE;
5361 gcc_assert (!TYPE_SIZE (constructor_type));
5363 if (constructor_depth > 2)
5364 error_init ("initialization of flexible array member in a nested context");
5366 pedwarn_init ("initialization of a flexible array member");
5368 /* We have already issued an error message for the existence
5369 of a flexible array member not at the end of the structure.
5370 Discard the initializer so that we do not die later. */
5371 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5372 constructor_type = NULL_TREE;
5376 /* Warn when some struct elements are implicitly initialized to zero. */
5377 if (warn_missing_field_initializers
5379 && TREE_CODE (constructor_type) == RECORD_TYPE
5380 && constructor_unfilled_fields)
5382 /* Do not warn for flexible array members or zero-length arrays. */
5383 while (constructor_unfilled_fields
5384 && (!DECL_SIZE (constructor_unfilled_fields)
5385 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5386 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5388 /* Do not warn if this level of the initializer uses member
5389 designators; it is likely to be deliberate. */
5390 if (constructor_unfilled_fields && !constructor_designated)
5392 push_member_name (constructor_unfilled_fields);
5393 warning_init ("missing initializer");
5394 RESTORE_SPELLING_DEPTH (constructor_depth);
5398 /* Pad out the end of the structure. */
5399 if (p->replacement_value.value)
5400 /* If this closes a superfluous brace pair,
5401 just pass out the element between them. */
5402 ret = p->replacement_value;
5403 else if (constructor_type == 0)
5405 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5406 && TREE_CODE (constructor_type) != UNION_TYPE
5407 && TREE_CODE (constructor_type) != ARRAY_TYPE
5408 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5410 /* A nonincremental scalar initializer--just return
5411 the element, after verifying there is just one. */
5412 if (VEC_empty (constructor_elt,constructor_elements))
5414 if (!constructor_erroneous)
5415 error_init ("empty scalar initializer");
5416 ret.value = error_mark_node;
5418 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5420 error_init ("extra elements in scalar initializer");
5421 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5424 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5428 if (constructor_erroneous)
5429 ret.value = error_mark_node;
5432 ret.value = build_constructor (constructor_type,
5433 constructor_elements);
5434 if (constructor_constant)
5435 TREE_CONSTANT (ret.value) = TREE_INVARIANT (ret.value) = 1;
5436 if (constructor_constant && constructor_simple)
5437 TREE_STATIC (ret.value) = 1;
5441 constructor_type = p->type;
5442 constructor_fields = p->fields;
5443 constructor_index = p->index;
5444 constructor_max_index = p->max_index;
5445 constructor_unfilled_index = p->unfilled_index;
5446 constructor_unfilled_fields = p->unfilled_fields;
5447 constructor_bit_index = p->bit_index;
5448 constructor_elements = p->elements;
5449 constructor_constant = p->constant;
5450 constructor_simple = p->simple;
5451 constructor_erroneous = p->erroneous;
5452 constructor_incremental = p->incremental;
5453 constructor_designated = p->designated;
5454 constructor_pending_elts = p->pending_elts;
5455 constructor_depth = p->depth;
5457 constructor_range_stack = p->range_stack;
5458 RESTORE_SPELLING_DEPTH (constructor_depth);
5460 constructor_stack = p->next;
5463 if (ret.value == 0 && constructor_stack == 0)
5464 ret.value = error_mark_node;
5468 /* Common handling for both array range and field name designators.
5469 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5472 set_designator (int array)
5475 enum tree_code subcode;
5477 /* Don't die if an entire brace-pair level is superfluous
5478 in the containing level. */
5479 if (constructor_type == 0)
5482 /* If there were errors in this designator list already, bail out
5484 if (designator_erroneous)
5487 if (!designator_depth)
5489 gcc_assert (!constructor_range_stack);
5491 /* Designator list starts at the level of closest explicit
5493 while (constructor_stack->implicit)
5494 process_init_element (pop_init_level (1));
5495 constructor_designated = 1;
5499 switch (TREE_CODE (constructor_type))
5503 subtype = TREE_TYPE (constructor_fields);
5504 if (subtype != error_mark_node)
5505 subtype = TYPE_MAIN_VARIANT (subtype);
5508 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5514 subcode = TREE_CODE (subtype);
5515 if (array && subcode != ARRAY_TYPE)
5517 error_init ("array index in non-array initializer");
5520 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5522 error_init ("field name not in record or union initializer");
5526 constructor_designated = 1;
5527 push_init_level (2);
5531 /* If there are range designators in designator list, push a new designator
5532 to constructor_range_stack. RANGE_END is end of such stack range or
5533 NULL_TREE if there is no range designator at this level. */
5536 push_range_stack (tree range_end)
5538 struct constructor_range_stack *p;
5540 p = GGC_NEW (struct constructor_range_stack);
5541 p->prev = constructor_range_stack;
5543 p->fields = constructor_fields;
5544 p->range_start = constructor_index;
5545 p->index = constructor_index;
5546 p->stack = constructor_stack;
5547 p->range_end = range_end;
5548 if (constructor_range_stack)
5549 constructor_range_stack->next = p;
5550 constructor_range_stack = p;
5553 /* Within an array initializer, specify the next index to be initialized.
5554 FIRST is that index. If LAST is nonzero, then initialize a range
5555 of indices, running from FIRST through LAST. */
5558 set_init_index (tree first, tree last)
5560 if (set_designator (1))
5563 designator_erroneous = 1;
5565 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5566 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5568 error_init ("array index in initializer not of integer type");
5572 if (TREE_CODE (first) != INTEGER_CST)
5573 error_init ("nonconstant array index in initializer");
5574 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5575 error_init ("nonconstant array index in initializer");
5576 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5577 error_init ("array index in non-array initializer");
5578 else if (tree_int_cst_sgn (first) == -1)
5579 error_init ("array index in initializer exceeds array bounds");
5580 else if (constructor_max_index
5581 && tree_int_cst_lt (constructor_max_index, first))
5582 error_init ("array index in initializer exceeds array bounds");
5585 constructor_index = convert (bitsizetype, first);
5589 if (tree_int_cst_equal (first, last))
5591 else if (tree_int_cst_lt (last, first))
5593 error_init ("empty index range in initializer");
5598 last = convert (bitsizetype, last);
5599 if (constructor_max_index != 0
5600 && tree_int_cst_lt (constructor_max_index, last))
5602 error_init ("array index range in initializer exceeds array bounds");
5609 designator_erroneous = 0;
5610 if (constructor_range_stack || last)
5611 push_range_stack (last);
5615 /* Within a struct initializer, specify the next field to be initialized. */
5618 set_init_label (tree fieldname)
5622 if (set_designator (0))
5625 designator_erroneous = 1;
5627 if (TREE_CODE (constructor_type) != RECORD_TYPE
5628 && TREE_CODE (constructor_type) != UNION_TYPE)
5630 error_init ("field name not in record or union initializer");
5634 for (tail = TYPE_FIELDS (constructor_type); tail;
5635 tail = TREE_CHAIN (tail))
5637 if (DECL_NAME (tail) == fieldname)
5642 error ("unknown field %qE specified in initializer", fieldname);
5645 constructor_fields = tail;
5647 designator_erroneous = 0;
5648 if (constructor_range_stack)
5649 push_range_stack (NULL_TREE);
5653 /* Add a new initializer to the tree of pending initializers. PURPOSE
5654 identifies the initializer, either array index or field in a structure.
5655 VALUE is the value of that index or field. */
5658 add_pending_init (tree purpose, tree value)
5660 struct init_node *p, **q, *r;
5662 q = &constructor_pending_elts;
5665 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5670 if (tree_int_cst_lt (purpose, p->purpose))
5672 else if (tree_int_cst_lt (p->purpose, purpose))
5676 if (TREE_SIDE_EFFECTS (p->value))
5677 warning_init ("initialized field with side-effects overwritten");
5687 bitpos = bit_position (purpose);
5691 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5693 else if (p->purpose != purpose)
5697 if (TREE_SIDE_EFFECTS (p->value))
5698 warning_init ("initialized field with side-effects overwritten");
5705 r = GGC_NEW (struct init_node);
5706 r->purpose = purpose;
5717 struct init_node *s;
5721 if (p->balance == 0)
5723 else if (p->balance < 0)
5730 p->left->parent = p;
5747 constructor_pending_elts = r;
5752 struct init_node *t = r->right;
5756 r->right->parent = r;
5761 p->left->parent = p;
5764 p->balance = t->balance < 0;
5765 r->balance = -(t->balance > 0);
5780 constructor_pending_elts = t;
5786 /* p->balance == +1; growth of left side balances the node. */
5791 else /* r == p->right */
5793 if (p->balance == 0)
5794 /* Growth propagation from right side. */
5796 else if (p->balance > 0)
5803 p->right->parent = p;
5820 constructor_pending_elts = r;
5822 else /* r->balance == -1 */
5825 struct init_node *t = r->left;
5829 r->left->parent = r;
5834 p->right->parent = p;
5837 r->balance = (t->balance < 0);
5838 p->balance = -(t->balance > 0);
5853 constructor_pending_elts = t;
5859 /* p->balance == -1; growth of right side balances the node. */
5870 /* Build AVL tree from a sorted chain. */
5873 set_nonincremental_init (void)
5875 unsigned HOST_WIDE_INT ix;
5878 if (TREE_CODE (constructor_type) != RECORD_TYPE
5879 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5882 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
5883 add_pending_init (index, value);
5884 constructor_elements = 0;
5885 if (TREE_CODE (constructor_type) == RECORD_TYPE)
5887 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
5888 /* Skip any nameless bit fields at the beginning. */
5889 while (constructor_unfilled_fields != 0
5890 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5891 && DECL_NAME (constructor_unfilled_fields) == 0)
5892 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5895 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5897 if (TYPE_DOMAIN (constructor_type))
5898 constructor_unfilled_index
5899 = convert (bitsizetype,
5900 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5902 constructor_unfilled_index = bitsize_zero_node;
5904 constructor_incremental = 0;
5907 /* Build AVL tree from a string constant. */
5910 set_nonincremental_init_from_string (tree str)
5912 tree value, purpose, type;
5913 HOST_WIDE_INT val[2];
5914 const char *p, *end;
5915 int byte, wchar_bytes, charwidth, bitpos;
5917 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
5919 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5920 == TYPE_PRECISION (char_type_node))
5924 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5925 == TYPE_PRECISION (wchar_type_node));
5926 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
5928 charwidth = TYPE_PRECISION (char_type_node);
5929 type = TREE_TYPE (constructor_type);
5930 p = TREE_STRING_POINTER (str);
5931 end = p + TREE_STRING_LENGTH (str);
5933 for (purpose = bitsize_zero_node;
5934 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
5935 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
5937 if (wchar_bytes == 1)
5939 val[1] = (unsigned char) *p++;
5946 for (byte = 0; byte < wchar_bytes; byte++)
5948 if (BYTES_BIG_ENDIAN)
5949 bitpos = (wchar_bytes - byte - 1) * charwidth;
5951 bitpos = byte * charwidth;
5952 val[bitpos < HOST_BITS_PER_WIDE_INT]
5953 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
5954 << (bitpos % HOST_BITS_PER_WIDE_INT);
5958 if (!TYPE_UNSIGNED (type))
5960 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
5961 if (bitpos < HOST_BITS_PER_WIDE_INT)
5963 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
5965 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
5969 else if (bitpos == HOST_BITS_PER_WIDE_INT)
5974 else if (val[0] & (((HOST_WIDE_INT) 1)
5975 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
5976 val[0] |= ((HOST_WIDE_INT) -1)
5977 << (bitpos - HOST_BITS_PER_WIDE_INT);
5980 value = build_int_cst_wide (type, val[1], val[0]);
5981 add_pending_init (purpose, value);
5984 constructor_incremental = 0;
5987 /* Return value of FIELD in pending initializer or zero if the field was
5988 not initialized yet. */
5991 find_init_member (tree field)
5993 struct init_node *p;
5995 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5997 if (constructor_incremental
5998 && tree_int_cst_lt (field, constructor_unfilled_index))
5999 set_nonincremental_init ();
6001 p = constructor_pending_elts;
6004 if (tree_int_cst_lt (field, p->purpose))
6006 else if (tree_int_cst_lt (p->purpose, field))
6012 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6014 tree bitpos = bit_position (field);
6016 if (constructor_incremental
6017 && (!constructor_unfilled_fields
6018 || tree_int_cst_lt (bitpos,
6019 bit_position (constructor_unfilled_fields))))
6020 set_nonincremental_init ();
6022 p = constructor_pending_elts;
6025 if (field == p->purpose)
6027 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6033 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6035 if (!VEC_empty (constructor_elt, constructor_elements)
6036 && (VEC_last (constructor_elt, constructor_elements)->index
6038 return VEC_last (constructor_elt, constructor_elements)->value;
6043 /* "Output" the next constructor element.
6044 At top level, really output it to assembler code now.
6045 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6046 TYPE is the data type that the containing data type wants here.
6047 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6048 If VALUE is a string constant, STRICT_STRING is true if it is
6049 unparenthesized or we should not warn here for it being parenthesized.
6050 For other types of VALUE, STRICT_STRING is not used.
6052 PENDING if non-nil means output pending elements that belong
6053 right after this element. (PENDING is normally 1;
6054 it is 0 while outputting pending elements, to avoid recursion.) */
6057 output_init_element (tree value, bool strict_string, tree type, tree field,
6060 constructor_elt *celt;
6062 if (type == error_mark_node || value == error_mark_node)
6064 constructor_erroneous = 1;
6067 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6068 && (TREE_CODE (value) == STRING_CST
6069 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6070 && !(TREE_CODE (value) == STRING_CST
6071 && TREE_CODE (type) == ARRAY_TYPE
6072 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6073 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6074 TYPE_MAIN_VARIANT (type)))
6075 value = array_to_pointer_conversion (value);
6077 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6078 && require_constant_value && !flag_isoc99 && pending)
6080 /* As an extension, allow initializing objects with static storage
6081 duration with compound literals (which are then treated just as
6082 the brace enclosed list they contain). */
6083 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6084 value = DECL_INITIAL (decl);
6087 if (value == error_mark_node)
6088 constructor_erroneous = 1;
6089 else if (!TREE_CONSTANT (value))
6090 constructor_constant = 0;
6091 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6092 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6093 || TREE_CODE (constructor_type) == UNION_TYPE)
6094 && DECL_C_BIT_FIELD (field)
6095 && TREE_CODE (value) != INTEGER_CST))
6096 constructor_simple = 0;
6098 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6100 if (require_constant_value)
6102 error_init ("initializer element is not constant");
6103 value = error_mark_node;
6105 else if (require_constant_elements)
6106 pedwarn ("initializer element is not computable at load time");
6109 /* If this field is empty (and not at the end of structure),
6110 don't do anything other than checking the initializer. */
6112 && (TREE_TYPE (field) == error_mark_node
6113 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6114 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6115 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6116 || TREE_CHAIN (field)))))
6119 value = digest_init (type, value, strict_string, require_constant_value);
6120 if (value == error_mark_node)
6122 constructor_erroneous = 1;
6126 /* If this element doesn't come next in sequence,
6127 put it on constructor_pending_elts. */
6128 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6129 && (!constructor_incremental
6130 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6132 if (constructor_incremental
6133 && tree_int_cst_lt (field, constructor_unfilled_index))
6134 set_nonincremental_init ();
6136 add_pending_init (field, value);
6139 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6140 && (!constructor_incremental
6141 || field != constructor_unfilled_fields))
6143 /* We do this for records but not for unions. In a union,
6144 no matter which field is specified, it can be initialized
6145 right away since it starts at the beginning of the union. */
6146 if (constructor_incremental)
6148 if (!constructor_unfilled_fields)
6149 set_nonincremental_init ();
6152 tree bitpos, unfillpos;
6154 bitpos = bit_position (field);
6155 unfillpos = bit_position (constructor_unfilled_fields);
6157 if (tree_int_cst_lt (bitpos, unfillpos))
6158 set_nonincremental_init ();
6162 add_pending_init (field, value);
6165 else if (TREE_CODE (constructor_type) == UNION_TYPE
6166 && !VEC_empty (constructor_elt, constructor_elements))
6168 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6169 constructor_elements)->value))
6170 warning_init ("initialized field with side-effects overwritten");
6172 /* We can have just one union field set. */
6173 constructor_elements = 0;
6176 /* Otherwise, output this element either to
6177 constructor_elements or to the assembler file. */
6179 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6180 celt->index = field;
6181 celt->value = value;
6183 /* Advance the variable that indicates sequential elements output. */
6184 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6185 constructor_unfilled_index
6186 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6188 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6190 constructor_unfilled_fields
6191 = TREE_CHAIN (constructor_unfilled_fields);
6193 /* Skip any nameless bit fields. */
6194 while (constructor_unfilled_fields != 0
6195 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6196 && DECL_NAME (constructor_unfilled_fields) == 0)
6197 constructor_unfilled_fields =
6198 TREE_CHAIN (constructor_unfilled_fields);
6200 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6201 constructor_unfilled_fields = 0;
6203 /* Now output any pending elements which have become next. */
6205 output_pending_init_elements (0);
6208 /* Output any pending elements which have become next.
6209 As we output elements, constructor_unfilled_{fields,index}
6210 advances, which may cause other elements to become next;
6211 if so, they too are output.
6213 If ALL is 0, we return when there are
6214 no more pending elements to output now.
6216 If ALL is 1, we output space as necessary so that
6217 we can output all the pending elements. */
6220 output_pending_init_elements (int all)
6222 struct init_node *elt = constructor_pending_elts;
6227 /* Look through the whole pending tree.
6228 If we find an element that should be output now,
6229 output it. Otherwise, set NEXT to the element
6230 that comes first among those still pending. */
6235 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6237 if (tree_int_cst_equal (elt->purpose,
6238 constructor_unfilled_index))
6239 output_init_element (elt->value, true,
6240 TREE_TYPE (constructor_type),
6241 constructor_unfilled_index, 0);
6242 else if (tree_int_cst_lt (constructor_unfilled_index,
6245 /* Advance to the next smaller node. */
6250 /* We have reached the smallest node bigger than the
6251 current unfilled index. Fill the space first. */
6252 next = elt->purpose;
6258 /* Advance to the next bigger node. */
6263 /* We have reached the biggest node in a subtree. Find
6264 the parent of it, which is the next bigger node. */
6265 while (elt->parent && elt->parent->right == elt)
6268 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6271 next = elt->purpose;
6277 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6278 || TREE_CODE (constructor_type) == UNION_TYPE)
6280 tree ctor_unfilled_bitpos, elt_bitpos;
6282 /* If the current record is complete we are done. */
6283 if (constructor_unfilled_fields == 0)
6286 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6287 elt_bitpos = bit_position (elt->purpose);
6288 /* We can't compare fields here because there might be empty
6289 fields in between. */
6290 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6292 constructor_unfilled_fields = elt->purpose;
6293 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6296 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6298 /* Advance to the next smaller node. */
6303 /* We have reached the smallest node bigger than the
6304 current unfilled field. Fill the space first. */
6305 next = elt->purpose;
6311 /* Advance to the next bigger node. */
6316 /* We have reached the biggest node in a subtree. Find
6317 the parent of it, which is the next bigger node. */
6318 while (elt->parent && elt->parent->right == elt)
6322 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6323 bit_position (elt->purpose))))
6325 next = elt->purpose;
6333 /* Ordinarily return, but not if we want to output all
6334 and there are elements left. */
6335 if (!(all && next != 0))
6338 /* If it's not incremental, just skip over the gap, so that after
6339 jumping to retry we will output the next successive element. */
6340 if (TREE_CODE (constructor_type) == RECORD_TYPE
6341 || TREE_CODE (constructor_type) == UNION_TYPE)
6342 constructor_unfilled_fields = next;
6343 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6344 constructor_unfilled_index = next;
6346 /* ELT now points to the node in the pending tree with the next
6347 initializer to output. */
6351 /* Add one non-braced element to the current constructor level.
6352 This adjusts the current position within the constructor's type.
6353 This may also start or terminate implicit levels
6354 to handle a partly-braced initializer.
6356 Once this has found the correct level for the new element,
6357 it calls output_init_element. */
6360 process_init_element (struct c_expr value)
6362 tree orig_value = value.value;
6363 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6364 bool strict_string = value.original_code == STRING_CST;
6366 designator_depth = 0;
6367 designator_erroneous = 0;
6369 /* Handle superfluous braces around string cst as in
6370 char x[] = {"foo"}; */
6373 && TREE_CODE (constructor_type) == ARRAY_TYPE
6374 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6375 && integer_zerop (constructor_unfilled_index))
6377 if (constructor_stack->replacement_value.value)
6378 error_init ("excess elements in char array initializer");
6379 constructor_stack->replacement_value = value;
6383 if (constructor_stack->replacement_value.value != 0)
6385 error_init ("excess elements in struct initializer");
6389 /* Ignore elements of a brace group if it is entirely superfluous
6390 and has already been diagnosed. */
6391 if (constructor_type == 0)
6394 /* If we've exhausted any levels that didn't have braces,
6396 while (constructor_stack->implicit)
6398 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6399 || TREE_CODE (constructor_type) == UNION_TYPE)
6400 && constructor_fields == 0)
6401 process_init_element (pop_init_level (1));
6402 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6403 && (constructor_max_index == 0
6404 || tree_int_cst_lt (constructor_max_index,
6405 constructor_index)))
6406 process_init_element (pop_init_level (1));
6411 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6412 if (constructor_range_stack)
6414 /* If value is a compound literal and we'll be just using its
6415 content, don't put it into a SAVE_EXPR. */
6416 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6417 || !require_constant_value
6419 value.value = save_expr (value.value);
6424 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6427 enum tree_code fieldcode;
6429 if (constructor_fields == 0)
6431 pedwarn_init ("excess elements in struct initializer");
6435 fieldtype = TREE_TYPE (constructor_fields);
6436 if (fieldtype != error_mark_node)
6437 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6438 fieldcode = TREE_CODE (fieldtype);
6440 /* Error for non-static initialization of a flexible array member. */
6441 if (fieldcode == ARRAY_TYPE
6442 && !require_constant_value
6443 && TYPE_SIZE (fieldtype) == NULL_TREE
6444 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6446 error_init ("non-static initialization of a flexible array member");
6450 /* Accept a string constant to initialize a subarray. */
6451 if (value.value != 0
6452 && fieldcode == ARRAY_TYPE
6453 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6455 value.value = orig_value;
6456 /* Otherwise, if we have come to a subaggregate,
6457 and we don't have an element of its type, push into it. */
6458 else if (value.value != 0
6459 && value.value != error_mark_node
6460 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6461 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6462 || fieldcode == UNION_TYPE))
6464 push_init_level (1);
6470 push_member_name (constructor_fields);
6471 output_init_element (value.value, strict_string,
6472 fieldtype, constructor_fields, 1);
6473 RESTORE_SPELLING_DEPTH (constructor_depth);
6476 /* Do the bookkeeping for an element that was
6477 directly output as a constructor. */
6479 /* For a record, keep track of end position of last field. */
6480 if (DECL_SIZE (constructor_fields))
6481 constructor_bit_index
6482 = size_binop (PLUS_EXPR,
6483 bit_position (constructor_fields),
6484 DECL_SIZE (constructor_fields));
6486 /* If the current field was the first one not yet written out,
6487 it isn't now, so update. */
6488 if (constructor_unfilled_fields == constructor_fields)
6490 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6491 /* Skip any nameless bit fields. */
6492 while (constructor_unfilled_fields != 0
6493 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6494 && DECL_NAME (constructor_unfilled_fields) == 0)
6495 constructor_unfilled_fields =
6496 TREE_CHAIN (constructor_unfilled_fields);
6500 constructor_fields = TREE_CHAIN (constructor_fields);
6501 /* Skip any nameless bit fields at the beginning. */
6502 while (constructor_fields != 0
6503 && DECL_C_BIT_FIELD (constructor_fields)
6504 && DECL_NAME (constructor_fields) == 0)
6505 constructor_fields = TREE_CHAIN (constructor_fields);
6507 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6510 enum tree_code fieldcode;
6512 if (constructor_fields == 0)
6514 pedwarn_init ("excess elements in union initializer");
6518 fieldtype = TREE_TYPE (constructor_fields);
6519 if (fieldtype != error_mark_node)
6520 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6521 fieldcode = TREE_CODE (fieldtype);
6523 /* Warn that traditional C rejects initialization of unions.
6524 We skip the warning if the value is zero. This is done
6525 under the assumption that the zero initializer in user
6526 code appears conditioned on e.g. __STDC__ to avoid
6527 "missing initializer" warnings and relies on default
6528 initialization to zero in the traditional C case.
6529 We also skip the warning if the initializer is designated,
6530 again on the assumption that this must be conditional on
6531 __STDC__ anyway (and we've already complained about the
6532 member-designator already). */
6533 if (!in_system_header && !constructor_designated
6534 && !(value.value && (integer_zerop (value.value)
6535 || real_zerop (value.value))))
6536 warning (OPT_Wtraditional, "traditional C rejects initialization "
6539 /* Accept a string constant to initialize a subarray. */
6540 if (value.value != 0
6541 && fieldcode == ARRAY_TYPE
6542 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6544 value.value = orig_value;
6545 /* Otherwise, if we have come to a subaggregate,
6546 and we don't have an element of its type, push into it. */
6547 else if (value.value != 0
6548 && value.value != error_mark_node
6549 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6550 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6551 || fieldcode == UNION_TYPE))
6553 push_init_level (1);
6559 push_member_name (constructor_fields);
6560 output_init_element (value.value, strict_string,
6561 fieldtype, constructor_fields, 1);
6562 RESTORE_SPELLING_DEPTH (constructor_depth);
6565 /* Do the bookkeeping for an element that was
6566 directly output as a constructor. */
6568 constructor_bit_index = DECL_SIZE (constructor_fields);
6569 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6572 constructor_fields = 0;
6574 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6576 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6577 enum tree_code eltcode = TREE_CODE (elttype);
6579 /* Accept a string constant to initialize a subarray. */
6580 if (value.value != 0
6581 && eltcode == ARRAY_TYPE
6582 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6584 value.value = orig_value;
6585 /* Otherwise, if we have come to a subaggregate,
6586 and we don't have an element of its type, push into it. */
6587 else if (value.value != 0
6588 && value.value != error_mark_node
6589 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6590 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6591 || eltcode == UNION_TYPE))
6593 push_init_level (1);
6597 if (constructor_max_index != 0
6598 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6599 || integer_all_onesp (constructor_max_index)))
6601 pedwarn_init ("excess elements in array initializer");
6605 /* Now output the actual element. */
6608 push_array_bounds (tree_low_cst (constructor_index, 1));
6609 output_init_element (value.value, strict_string,
6610 elttype, constructor_index, 1);
6611 RESTORE_SPELLING_DEPTH (constructor_depth);
6615 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6618 /* If we are doing the bookkeeping for an element that was
6619 directly output as a constructor, we must update
6620 constructor_unfilled_index. */
6621 constructor_unfilled_index = constructor_index;
6623 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6625 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6627 /* Do a basic check of initializer size. Note that vectors
6628 always have a fixed size derived from their type. */
6629 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6631 pedwarn_init ("excess elements in vector initializer");
6635 /* Now output the actual element. */
6637 output_init_element (value.value, strict_string,
6638 elttype, constructor_index, 1);
6641 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6644 /* If we are doing the bookkeeping for an element that was
6645 directly output as a constructor, we must update
6646 constructor_unfilled_index. */
6647 constructor_unfilled_index = constructor_index;
6650 /* Handle the sole element allowed in a braced initializer
6651 for a scalar variable. */
6652 else if (constructor_type != error_mark_node
6653 && constructor_fields == 0)
6655 pedwarn_init ("excess elements in scalar initializer");
6661 output_init_element (value.value, strict_string,
6662 constructor_type, NULL_TREE, 1);
6663 constructor_fields = 0;
6666 /* Handle range initializers either at this level or anywhere higher
6667 in the designator stack. */
6668 if (constructor_range_stack)
6670 struct constructor_range_stack *p, *range_stack;
6673 range_stack = constructor_range_stack;
6674 constructor_range_stack = 0;
6675 while (constructor_stack != range_stack->stack)
6677 gcc_assert (constructor_stack->implicit);
6678 process_init_element (pop_init_level (1));
6680 for (p = range_stack;
6681 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6684 gcc_assert (constructor_stack->implicit);
6685 process_init_element (pop_init_level (1));
6688 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6689 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6694 constructor_index = p->index;
6695 constructor_fields = p->fields;
6696 if (finish && p->range_end && p->index == p->range_start)
6704 push_init_level (2);
6705 p->stack = constructor_stack;
6706 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6707 p->index = p->range_start;
6711 constructor_range_stack = range_stack;
6718 constructor_range_stack = 0;
6721 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6722 (guaranteed to be 'volatile' or null) and ARGS (represented using
6723 an ASM_EXPR node). */
6725 build_asm_stmt (tree cv_qualifier, tree args)
6727 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6728 ASM_VOLATILE_P (args) = 1;
6729 return add_stmt (args);
6732 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6733 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6734 SIMPLE indicates whether there was anything at all after the
6735 string in the asm expression -- asm("blah") and asm("blah" : )
6736 are subtly different. We use a ASM_EXPR node to represent this. */
6738 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6744 const char *constraint;
6745 const char **oconstraints;
6746 bool allows_mem, allows_reg, is_inout;
6747 int ninputs, noutputs;
6749 ninputs = list_length (inputs);
6750 noutputs = list_length (outputs);
6751 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
6753 string = resolve_asm_operand_names (string, outputs, inputs);
6755 /* Remove output conversions that change the type but not the mode. */
6756 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6758 tree output = TREE_VALUE (tail);
6760 /* ??? Really, this should not be here. Users should be using a
6761 proper lvalue, dammit. But there's a long history of using casts
6762 in the output operands. In cases like longlong.h, this becomes a
6763 primitive form of typechecking -- if the cast can be removed, then
6764 the output operand had a type of the proper width; otherwise we'll
6765 get an error. Gross, but ... */
6766 STRIP_NOPS (output);
6768 if (!lvalue_or_else (output, lv_asm))
6769 output = error_mark_node;
6771 if (output != error_mark_node
6772 && (TREE_READONLY (output)
6773 || TYPE_READONLY (TREE_TYPE (output))
6774 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
6775 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
6776 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
6777 readonly_error (output, lv_asm);
6779 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6780 oconstraints[i] = constraint;
6782 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6783 &allows_mem, &allows_reg, &is_inout))
6785 /* If the operand is going to end up in memory,
6786 mark it addressable. */
6787 if (!allows_reg && !c_mark_addressable (output))
6788 output = error_mark_node;
6791 output = error_mark_node;
6793 TREE_VALUE (tail) = output;
6796 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
6800 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6801 input = TREE_VALUE (tail);
6803 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
6804 oconstraints, &allows_mem, &allows_reg))
6806 /* If the operand is going to end up in memory,
6807 mark it addressable. */
6808 if (!allows_reg && allows_mem)
6810 /* Strip the nops as we allow this case. FIXME, this really
6811 should be rejected or made deprecated. */
6813 if (!c_mark_addressable (input))
6814 input = error_mark_node;
6818 input = error_mark_node;
6820 TREE_VALUE (tail) = input;
6823 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
6825 /* asm statements without outputs, including simple ones, are treated
6827 ASM_INPUT_P (args) = simple;
6828 ASM_VOLATILE_P (args) = (noutputs == 0);
6833 /* Generate a goto statement to LABEL. */
6836 c_finish_goto_label (tree label)
6838 tree decl = lookup_label (label);
6842 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
6844 error ("jump into statement expression");
6848 if (C_DECL_UNJUMPABLE_VM (decl))
6850 error ("jump into scope of identifier with variably modified type");
6854 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
6856 /* No jump from outside this statement expression context, so
6857 record that there is a jump from within this context. */
6858 struct c_label_list *nlist;
6859 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6860 nlist->next = label_context_stack_se->labels_used;
6861 nlist->label = decl;
6862 label_context_stack_se->labels_used = nlist;
6865 if (!C_DECL_UNDEFINABLE_VM (decl))
6867 /* No jump from outside this context context of identifiers with
6868 variably modified type, so record that there is a jump from
6869 within this context. */
6870 struct c_label_list *nlist;
6871 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6872 nlist->next = label_context_stack_vm->labels_used;
6873 nlist->label = decl;
6874 label_context_stack_vm->labels_used = nlist;
6877 TREE_USED (decl) = 1;
6878 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
6881 /* Generate a computed goto statement to EXPR. */
6884 c_finish_goto_ptr (tree expr)
6887 pedwarn ("ISO C forbids %<goto *expr;%>");
6888 expr = convert (ptr_type_node, expr);
6889 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
6892 /* Generate a C `return' statement. RETVAL is the expression for what
6893 to return, or a null pointer for `return;' with no value. */
6896 c_finish_return (tree retval)
6898 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
6899 bool no_warning = false;
6901 if (TREE_THIS_VOLATILE (current_function_decl))
6902 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6906 current_function_returns_null = 1;
6907 if ((warn_return_type || flag_isoc99)
6908 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
6910 pedwarn_c99 ("%<return%> with no value, in "
6911 "function returning non-void");
6915 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
6917 current_function_returns_null = 1;
6918 if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
6919 pedwarn ("%<return%> with a value, in function returning void");
6923 tree t = convert_for_assignment (valtype, retval, ic_return,
6924 NULL_TREE, NULL_TREE, 0);
6925 tree res = DECL_RESULT (current_function_decl);
6928 current_function_returns_value = 1;
6929 if (t == error_mark_node)
6932 inner = t = convert (TREE_TYPE (res), t);
6934 /* Strip any conversions, additions, and subtractions, and see if
6935 we are returning the address of a local variable. Warn if so. */
6938 switch (TREE_CODE (inner))
6940 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6942 inner = TREE_OPERAND (inner, 0);
6946 /* If the second operand of the MINUS_EXPR has a pointer
6947 type (or is converted from it), this may be valid, so
6948 don't give a warning. */
6950 tree op1 = TREE_OPERAND (inner, 1);
6952 while (!POINTER_TYPE_P (TREE_TYPE (op1))
6953 && (TREE_CODE (op1) == NOP_EXPR
6954 || TREE_CODE (op1) == NON_LVALUE_EXPR
6955 || TREE_CODE (op1) == CONVERT_EXPR))
6956 op1 = TREE_OPERAND (op1, 0);
6958 if (POINTER_TYPE_P (TREE_TYPE (op1)))
6961 inner = TREE_OPERAND (inner, 0);
6966 inner = TREE_OPERAND (inner, 0);
6968 while (REFERENCE_CLASS_P (inner)
6969 && TREE_CODE (inner) != INDIRECT_REF)
6970 inner = TREE_OPERAND (inner, 0);
6973 && !DECL_EXTERNAL (inner)
6974 && !TREE_STATIC (inner)
6975 && DECL_CONTEXT (inner) == current_function_decl)
6976 warning (0, "function returns address of local variable");
6986 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
6989 ret_stmt = build_stmt (RETURN_EXPR, retval);
6990 TREE_NO_WARNING (ret_stmt) |= no_warning;
6991 return add_stmt (ret_stmt);
6995 /* The SWITCH_EXPR being built. */
6998 /* The original type of the testing expression, i.e. before the
6999 default conversion is applied. */
7002 /* A splay-tree mapping the low element of a case range to the high
7003 element, or NULL_TREE if there is no high element. Used to
7004 determine whether or not a new case label duplicates an old case
7005 label. We need a tree, rather than simply a hash table, because
7006 of the GNU case range extension. */
7009 /* Number of nested statement expressions within this switch
7010 statement; if nonzero, case and default labels may not
7012 unsigned int blocked_stmt_expr;
7014 /* Scope of outermost declarations of identifiers with variably
7015 modified type within this switch statement; if nonzero, case and
7016 default labels may not appear. */
7017 unsigned int blocked_vm;
7019 /* The next node on the stack. */
7020 struct c_switch *next;
7023 /* A stack of the currently active switch statements. The innermost
7024 switch statement is on the top of the stack. There is no need to
7025 mark the stack for garbage collection because it is only active
7026 during the processing of the body of a function, and we never
7027 collect at that point. */
7029 struct c_switch *c_switch_stack;
7031 /* Start a C switch statement, testing expression EXP. Return the new
7035 c_start_case (tree exp)
7037 enum tree_code code;
7038 tree type, orig_type = error_mark_node;
7039 struct c_switch *cs;
7041 if (exp != error_mark_node)
7043 code = TREE_CODE (TREE_TYPE (exp));
7044 orig_type = TREE_TYPE (exp);
7046 if (!INTEGRAL_TYPE_P (orig_type)
7047 && code != ERROR_MARK)
7049 error ("switch quantity not an integer");
7050 exp = integer_zero_node;
7051 orig_type = error_mark_node;
7055 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7057 if (!in_system_header
7058 && (type == long_integer_type_node
7059 || type == long_unsigned_type_node))
7060 warning (OPT_Wtraditional, "%<long%> switch expression not "
7061 "converted to %<int%> in ISO C");
7063 exp = default_conversion (exp);
7064 type = TREE_TYPE (exp);
7068 /* Add this new SWITCH_EXPR to the stack. */
7069 cs = XNEW (struct c_switch);
7070 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7071 cs->orig_type = orig_type;
7072 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7073 cs->blocked_stmt_expr = 0;
7075 cs->next = c_switch_stack;
7076 c_switch_stack = cs;
7078 return add_stmt (cs->switch_expr);
7081 /* Process a case label. */
7084 do_case (tree low_value, tree high_value)
7086 tree label = NULL_TREE;
7088 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7089 && !c_switch_stack->blocked_vm)
7091 label = c_add_case_label (c_switch_stack->cases,
7092 SWITCH_COND (c_switch_stack->switch_expr),
7093 c_switch_stack->orig_type,
7094 low_value, high_value);
7095 if (label == error_mark_node)
7098 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7101 error ("case label in statement expression not containing "
7102 "enclosing switch statement");
7104 error ("%<default%> label in statement expression not containing "
7105 "enclosing switch statement");
7107 else if (c_switch_stack && c_switch_stack->blocked_vm)
7110 error ("case label in scope of identifier with variably modified "
7111 "type not containing enclosing switch statement");
7113 error ("%<default%> label in scope of identifier with variably "
7114 "modified type not containing enclosing switch statement");
7117 error ("case label not within a switch statement");
7119 error ("%<default%> label not within a switch statement");
7124 /* Finish the switch statement. */
7127 c_finish_case (tree body)
7129 struct c_switch *cs = c_switch_stack;
7130 location_t switch_location;
7132 SWITCH_BODY (cs->switch_expr) = body;
7134 /* We must not be within a statement expression nested in the switch
7135 at this point; we might, however, be within the scope of an
7136 identifier with variably modified type nested in the switch. */
7137 gcc_assert (!cs->blocked_stmt_expr);
7139 /* Emit warnings as needed. */
7140 if (EXPR_HAS_LOCATION (cs->switch_expr))
7141 switch_location = EXPR_LOCATION (cs->switch_expr);
7143 switch_location = input_location;
7144 c_do_switch_warnings (cs->cases, switch_location,
7145 TREE_TYPE (cs->switch_expr),
7146 SWITCH_COND (cs->switch_expr));
7148 /* Pop the stack. */
7149 c_switch_stack = cs->next;
7150 splay_tree_delete (cs->cases);
7154 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7155 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7156 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7157 statement, and was not surrounded with parenthesis. */
7160 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7161 tree else_block, bool nested_if)
7165 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7166 if (warn_parentheses && nested_if && else_block == NULL)
7168 tree inner_if = then_block;
7170 /* We know from the grammar productions that there is an IF nested
7171 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7172 it might not be exactly THEN_BLOCK, but should be the last
7173 non-container statement within. */
7175 switch (TREE_CODE (inner_if))
7180 inner_if = BIND_EXPR_BODY (inner_if);
7182 case STATEMENT_LIST:
7183 inner_if = expr_last (then_block);
7185 case TRY_FINALLY_EXPR:
7186 case TRY_CATCH_EXPR:
7187 inner_if = TREE_OPERAND (inner_if, 0);
7194 if (COND_EXPR_ELSE (inner_if))
7195 warning (OPT_Wparentheses,
7196 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7200 empty_body_warning (then_block, else_block);
7202 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7203 SET_EXPR_LOCATION (stmt, if_locus);
7207 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7208 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7209 is false for DO loops. INCR is the FOR increment expression. BODY is
7210 the statement controlled by the loop. BLAB is the break label. CLAB is
7211 the continue label. Everything is allowed to be NULL. */
7214 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7215 tree blab, tree clab, bool cond_is_first)
7217 tree entry = NULL, exit = NULL, t;
7219 /* If the condition is zero don't generate a loop construct. */
7220 if (cond && integer_zerop (cond))
7224 t = build_and_jump (&blab);
7225 SET_EXPR_LOCATION (t, start_locus);
7231 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7233 /* If we have an exit condition, then we build an IF with gotos either
7234 out of the loop, or to the top of it. If there's no exit condition,
7235 then we just build a jump back to the top. */
7236 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7238 if (cond && !integer_nonzerop (cond))
7240 /* Canonicalize the loop condition to the end. This means
7241 generating a branch to the loop condition. Reuse the
7242 continue label, if possible. */
7247 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7248 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7251 t = build1 (GOTO_EXPR, void_type_node, clab);
7252 SET_EXPR_LOCATION (t, start_locus);
7256 t = build_and_jump (&blab);
7257 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7259 SET_EXPR_LOCATION (exit, start_locus);
7261 SET_EXPR_LOCATION (exit, input_location);
7270 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7278 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7282 c_finish_bc_stmt (tree *label_p, bool is_break)
7285 tree label = *label_p;
7287 /* In switch statements break is sometimes stylistically used after
7288 a return statement. This can lead to spurious warnings about
7289 control reaching the end of a non-void function when it is
7290 inlined. Note that we are calling block_may_fallthru with
7291 language specific tree nodes; this works because
7292 block_may_fallthru returns true when given something it does not
7294 skip = !block_may_fallthru (cur_stmt_list);
7299 *label_p = label = create_artificial_label ();
7301 else if (TREE_CODE (label) == LABEL_DECL)
7303 else switch (TREE_INT_CST_LOW (label))
7307 error ("break statement not within loop or switch");
7309 error ("continue statement not within a loop");
7313 gcc_assert (is_break);
7314 error ("break statement used with OpenMP for loop");
7324 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7327 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7330 emit_side_effect_warnings (tree expr)
7332 if (expr == error_mark_node)
7334 else if (!TREE_SIDE_EFFECTS (expr))
7336 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7337 warning (0, "%Hstatement with no effect",
7338 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7340 else if (warn_unused_value)
7341 warn_if_unused_value (expr, input_location);
7344 /* Process an expression as if it were a complete statement. Emit
7345 diagnostics, but do not call ADD_STMT. */
7348 c_process_expr_stmt (tree expr)
7353 if (warn_sequence_point)
7354 verify_sequence_points (expr);
7356 if (TREE_TYPE (expr) != error_mark_node
7357 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7358 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7359 error ("expression statement has incomplete type");
7361 /* If we're not processing a statement expression, warn about unused values.
7362 Warnings for statement expressions will be emitted later, once we figure
7363 out which is the result. */
7364 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7365 && (extra_warnings || warn_unused_value))
7366 emit_side_effect_warnings (expr);
7368 /* If the expression is not of a type to which we cannot assign a line
7369 number, wrap the thing in a no-op NOP_EXPR. */
7370 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7371 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7374 SET_EXPR_LOCATION (expr, input_location);
7379 /* Emit an expression as a statement. */
7382 c_finish_expr_stmt (tree expr)
7385 return add_stmt (c_process_expr_stmt (expr));
7390 /* Do the opposite and emit a statement as an expression. To begin,
7391 create a new binding level and return it. */
7394 c_begin_stmt_expr (void)
7397 struct c_label_context_se *nstack;
7398 struct c_label_list *glist;
7400 /* We must force a BLOCK for this level so that, if it is not expanded
7401 later, there is a way to turn off the entire subtree of blocks that
7402 are contained in it. */
7404 ret = c_begin_compound_stmt (true);
7407 c_switch_stack->blocked_stmt_expr++;
7408 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7410 for (glist = label_context_stack_se->labels_used;
7412 glist = glist->next)
7414 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7416 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7417 nstack->labels_def = NULL;
7418 nstack->labels_used = NULL;
7419 nstack->next = label_context_stack_se;
7420 label_context_stack_se = nstack;
7422 /* Mark the current statement list as belonging to a statement list. */
7423 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7429 c_finish_stmt_expr (tree body)
7431 tree last, type, tmp, val;
7433 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7435 body = c_end_compound_stmt (body, true);
7438 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7439 c_switch_stack->blocked_stmt_expr--;
7441 /* It is no longer possible to jump to labels defined within this
7442 statement expression. */
7443 for (dlist = label_context_stack_se->labels_def;
7445 dlist = dlist->next)
7447 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7449 /* It is again possible to define labels with a goto just outside
7450 this statement expression. */
7451 for (glist = label_context_stack_se->next->labels_used;
7453 glist = glist->next)
7455 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7458 if (glist_prev != NULL)
7459 glist_prev->next = label_context_stack_se->labels_used;
7461 label_context_stack_se->next->labels_used
7462 = label_context_stack_se->labels_used;
7463 label_context_stack_se = label_context_stack_se->next;
7465 /* Locate the last statement in BODY. See c_end_compound_stmt
7466 about always returning a BIND_EXPR. */
7467 last_p = &BIND_EXPR_BODY (body);
7468 last = BIND_EXPR_BODY (body);
7471 if (TREE_CODE (last) == STATEMENT_LIST)
7473 tree_stmt_iterator i;
7475 /* This can happen with degenerate cases like ({ }). No value. */
7476 if (!TREE_SIDE_EFFECTS (last))
7479 /* If we're supposed to generate side effects warnings, process
7480 all of the statements except the last. */
7481 if (extra_warnings || warn_unused_value)
7483 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7484 emit_side_effect_warnings (tsi_stmt (i));
7487 i = tsi_last (last);
7488 last_p = tsi_stmt_ptr (i);
7492 /* If the end of the list is exception related, then the list was split
7493 by a call to push_cleanup. Continue searching. */
7494 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7495 || TREE_CODE (last) == TRY_CATCH_EXPR)
7497 last_p = &TREE_OPERAND (last, 0);
7499 goto continue_searching;
7502 /* In the case that the BIND_EXPR is not necessary, return the
7503 expression out from inside it. */
7504 if (last == error_mark_node
7505 || (last == BIND_EXPR_BODY (body)
7506 && BIND_EXPR_VARS (body) == NULL))
7508 /* Do not warn if the return value of a statement expression is
7511 TREE_NO_WARNING (last) = 1;
7515 /* Extract the type of said expression. */
7516 type = TREE_TYPE (last);
7518 /* If we're not returning a value at all, then the BIND_EXPR that
7519 we already have is a fine expression to return. */
7520 if (!type || VOID_TYPE_P (type))
7523 /* Now that we've located the expression containing the value, it seems
7524 silly to make voidify_wrapper_expr repeat the process. Create a
7525 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7526 tmp = create_tmp_var_raw (type, NULL);
7528 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7529 tree_expr_nonnegative_p giving up immediately. */
7531 if (TREE_CODE (val) == NOP_EXPR
7532 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7533 val = TREE_OPERAND (val, 0);
7535 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7536 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7538 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7541 /* Begin the scope of an identifier of variably modified type, scope
7542 number SCOPE. Jumping from outside this scope to inside it is not
7546 c_begin_vm_scope (unsigned int scope)
7548 struct c_label_context_vm *nstack;
7549 struct c_label_list *glist;
7551 gcc_assert (scope > 0);
7552 if (c_switch_stack && !c_switch_stack->blocked_vm)
7553 c_switch_stack->blocked_vm = scope;
7554 for (glist = label_context_stack_vm->labels_used;
7556 glist = glist->next)
7558 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7560 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7561 nstack->labels_def = NULL;
7562 nstack->labels_used = NULL;
7563 nstack->scope = scope;
7564 nstack->next = label_context_stack_vm;
7565 label_context_stack_vm = nstack;
7568 /* End a scope which may contain identifiers of variably modified
7569 type, scope number SCOPE. */
7572 c_end_vm_scope (unsigned int scope)
7574 if (label_context_stack_vm == NULL)
7576 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7577 c_switch_stack->blocked_vm = 0;
7578 /* We may have a number of nested scopes of identifiers with
7579 variably modified type, all at this depth. Pop each in turn. */
7580 while (label_context_stack_vm->scope == scope)
7582 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7584 /* It is no longer possible to jump to labels defined within this
7586 for (dlist = label_context_stack_vm->labels_def;
7588 dlist = dlist->next)
7590 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7592 /* It is again possible to define labels with a goto just outside
7594 for (glist = label_context_stack_vm->next->labels_used;
7596 glist = glist->next)
7598 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7601 if (glist_prev != NULL)
7602 glist_prev->next = label_context_stack_vm->labels_used;
7604 label_context_stack_vm->next->labels_used
7605 = label_context_stack_vm->labels_used;
7606 label_context_stack_vm = label_context_stack_vm->next;
7610 /* Begin and end compound statements. This is as simple as pushing
7611 and popping new statement lists from the tree. */
7614 c_begin_compound_stmt (bool do_scope)
7616 tree stmt = push_stmt_list ();
7623 c_end_compound_stmt (tree stmt, bool do_scope)
7629 if (c_dialect_objc ())
7630 objc_clear_super_receiver ();
7631 block = pop_scope ();
7634 stmt = pop_stmt_list (stmt);
7635 stmt = c_build_bind_expr (block, stmt);
7637 /* If this compound statement is nested immediately inside a statement
7638 expression, then force a BIND_EXPR to be created. Otherwise we'll
7639 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7640 STATEMENT_LISTs merge, and thus we can lose track of what statement
7643 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7644 && TREE_CODE (stmt) != BIND_EXPR)
7646 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7647 TREE_SIDE_EFFECTS (stmt) = 1;
7653 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7654 when the current scope is exited. EH_ONLY is true when this is not
7655 meant to apply to normal control flow transfer. */
7658 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7660 enum tree_code code;
7664 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7665 stmt = build_stmt (code, NULL, cleanup);
7667 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7668 list = push_stmt_list ();
7669 TREE_OPERAND (stmt, 0) = list;
7670 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7673 /* Build a binary-operation expression without default conversions.
7674 CODE is the kind of expression to build.
7675 This function differs from `build' in several ways:
7676 the data type of the result is computed and recorded in it,
7677 warnings are generated if arg data types are invalid,
7678 special handling for addition and subtraction of pointers is known,
7679 and some optimization is done (operations on narrow ints
7680 are done in the narrower type when that gives the same result).
7681 Constant folding is also done before the result is returned.
7683 Note that the operands will never have enumeral types, or function
7684 or array types, because either they will have the default conversions
7685 performed or they have both just been converted to some other type in which
7686 the arithmetic is to be done. */
7689 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
7693 enum tree_code code0, code1;
7695 const char *invalid_op_diag;
7697 /* Expression code to give to the expression when it is built.
7698 Normally this is CODE, which is what the caller asked for,
7699 but in some special cases we change it. */
7700 enum tree_code resultcode = code;
7702 /* Data type in which the computation is to be performed.
7703 In the simplest cases this is the common type of the arguments. */
7704 tree result_type = NULL;
7706 /* Nonzero means operands have already been type-converted
7707 in whatever way is necessary.
7708 Zero means they need to be converted to RESULT_TYPE. */
7711 /* Nonzero means create the expression with this type, rather than
7713 tree build_type = 0;
7715 /* Nonzero means after finally constructing the expression
7716 convert it to this type. */
7717 tree final_type = 0;
7719 /* Nonzero if this is an operation like MIN or MAX which can
7720 safely be computed in short if both args are promoted shorts.
7721 Also implies COMMON.
7722 -1 indicates a bitwise operation; this makes a difference
7723 in the exact conditions for when it is safe to do the operation
7724 in a narrower mode. */
7727 /* Nonzero if this is a comparison operation;
7728 if both args are promoted shorts, compare the original shorts.
7729 Also implies COMMON. */
7730 int short_compare = 0;
7732 /* Nonzero if this is a right-shift operation, which can be computed on the
7733 original short and then promoted if the operand is a promoted short. */
7734 int short_shift = 0;
7736 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7739 /* True means types are compatible as far as ObjC is concerned. */
7744 op0 = default_conversion (orig_op0);
7745 op1 = default_conversion (orig_op1);
7753 type0 = TREE_TYPE (op0);
7754 type1 = TREE_TYPE (op1);
7756 /* The expression codes of the data types of the arguments tell us
7757 whether the arguments are integers, floating, pointers, etc. */
7758 code0 = TREE_CODE (type0);
7759 code1 = TREE_CODE (type1);
7761 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7762 STRIP_TYPE_NOPS (op0);
7763 STRIP_TYPE_NOPS (op1);
7765 /* If an error was already reported for one of the arguments,
7766 avoid reporting another error. */
7768 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7769 return error_mark_node;
7771 if ((invalid_op_diag
7772 = targetm.invalid_binary_op (code, type0, type1)))
7774 error (invalid_op_diag);
7775 return error_mark_node;
7778 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
7783 /* Handle the pointer + int case. */
7784 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7785 return pointer_int_sum (PLUS_EXPR, op0, op1);
7786 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
7787 return pointer_int_sum (PLUS_EXPR, op1, op0);
7793 /* Subtraction of two similar pointers.
7794 We must subtract them as integers, then divide by object size. */
7795 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
7796 && comp_target_types (type0, type1))
7797 return pointer_diff (op0, op1);
7798 /* Handle pointer minus int. Just like pointer plus int. */
7799 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7800 return pointer_int_sum (MINUS_EXPR, op0, op1);
7809 case TRUNC_DIV_EXPR:
7811 case FLOOR_DIV_EXPR:
7812 case ROUND_DIV_EXPR:
7813 case EXACT_DIV_EXPR:
7814 /* Floating point division by zero is a legitimate way to obtain
7815 infinities and NaNs. */
7816 if (skip_evaluation == 0 && integer_zerop (op1))
7817 warning (OPT_Wdiv_by_zero, "division by zero");
7819 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7820 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7821 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7822 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
7824 enum tree_code tcode0 = code0, tcode1 = code1;
7826 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7827 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
7828 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
7829 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
7831 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
7832 resultcode = RDIV_EXPR;
7834 /* Although it would be tempting to shorten always here, that
7835 loses on some targets, since the modulo instruction is
7836 undefined if the quotient can't be represented in the
7837 computation mode. We shorten only if unsigned or if
7838 dividing by something we know != -1. */
7839 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7840 || (TREE_CODE (op1) == INTEGER_CST
7841 && !integer_all_onesp (op1)));
7849 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7851 else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
7855 case TRUNC_MOD_EXPR:
7856 case FLOOR_MOD_EXPR:
7857 if (skip_evaluation == 0 && integer_zerop (op1))
7858 warning (OPT_Wdiv_by_zero, "division by zero");
7860 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7862 /* Although it would be tempting to shorten always here, that loses
7863 on some targets, since the modulo instruction is undefined if the
7864 quotient can't be represented in the computation mode. We shorten
7865 only if unsigned or if dividing by something we know != -1. */
7866 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7867 || (TREE_CODE (op1) == INTEGER_CST
7868 && !integer_all_onesp (op1)));
7873 case TRUTH_ANDIF_EXPR:
7874 case TRUTH_ORIF_EXPR:
7875 case TRUTH_AND_EXPR:
7877 case TRUTH_XOR_EXPR:
7878 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
7879 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
7880 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
7881 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
7883 /* Result of these operations is always an int,
7884 but that does not mean the operands should be
7885 converted to ints! */
7886 result_type = integer_type_node;
7887 op0 = c_common_truthvalue_conversion (op0);
7888 op1 = c_common_truthvalue_conversion (op1);
7893 /* Shift operations: result has same type as first operand;
7894 always convert second operand to int.
7895 Also set SHORT_SHIFT if shifting rightward. */
7898 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7900 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7902 if (tree_int_cst_sgn (op1) < 0)
7903 warning (0, "right shift count is negative");
7906 if (!integer_zerop (op1))
7909 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7910 warning (0, "right shift count >= width of type");
7914 /* Use the type of the value to be shifted. */
7915 result_type = type0;
7916 /* Convert the shift-count to an integer, regardless of size
7917 of value being shifted. */
7918 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7919 op1 = convert (integer_type_node, op1);
7920 /* Avoid converting op1 to result_type later. */
7926 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7928 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7930 if (tree_int_cst_sgn (op1) < 0)
7931 warning (0, "left shift count is negative");
7933 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7934 warning (0, "left shift count >= width of type");
7937 /* Use the type of the value to be shifted. */
7938 result_type = type0;
7939 /* Convert the shift-count to an integer, regardless of size
7940 of value being shifted. */
7941 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7942 op1 = convert (integer_type_node, op1);
7943 /* Avoid converting op1 to result_type later. */
7950 if (code0 == REAL_TYPE || code1 == REAL_TYPE)
7951 warning (OPT_Wfloat_equal,
7952 "comparing floating point with == or != is unsafe");
7953 /* Result of comparison is always int,
7954 but don't convert the args to int! */
7955 build_type = integer_type_node;
7956 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7957 || code0 == COMPLEX_TYPE)
7958 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7959 || code1 == COMPLEX_TYPE))
7961 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
7963 tree tt0 = TREE_TYPE (type0);
7964 tree tt1 = TREE_TYPE (type1);
7965 /* Anything compares with void *. void * compares with anything.
7966 Otherwise, the targets must be compatible
7967 and both must be object or both incomplete. */
7968 if (comp_target_types (type0, type1))
7969 result_type = common_pointer_type (type0, type1);
7970 else if (VOID_TYPE_P (tt0))
7972 /* op0 != orig_op0 detects the case of something
7973 whose value is 0 but which isn't a valid null ptr const. */
7974 if (pedantic && !null_pointer_constant_p (orig_op0)
7975 && TREE_CODE (tt1) == FUNCTION_TYPE)
7976 pedwarn ("ISO C forbids comparison of %<void *%>"
7977 " with function pointer");
7979 else if (VOID_TYPE_P (tt1))
7981 if (pedantic && !null_pointer_constant_p (orig_op1)
7982 && TREE_CODE (tt0) == FUNCTION_TYPE)
7983 pedwarn ("ISO C forbids comparison of %<void *%>"
7984 " with function pointer");
7987 /* Avoid warning about the volatile ObjC EH puts on decls. */
7989 pedwarn ("comparison of distinct pointer types lacks a cast");
7991 if (result_type == NULL_TREE)
7992 result_type = ptr_type_node;
7994 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
7996 if (TREE_CODE (op0) == ADDR_EXPR
7997 && DECL_P (TREE_OPERAND (op0, 0))
7998 && !DECL_WEAK (TREE_OPERAND (op0, 0)))
7999 warning (OPT_Walways_true, "the address of %qD will never be NULL",
8000 TREE_OPERAND (op0, 0));
8001 result_type = type0;
8003 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8005 if (TREE_CODE (op1) == ADDR_EXPR
8006 && DECL_P (TREE_OPERAND (op1, 0))
8007 && !DECL_WEAK (TREE_OPERAND (op1, 0)))
8008 warning (OPT_Walways_true, "the address of %qD will never be NULL",
8009 TREE_OPERAND (op1, 0));
8010 result_type = type1;
8012 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8014 result_type = type0;
8015 pedwarn ("comparison between pointer and integer");
8017 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8019 result_type = type1;
8020 pedwarn ("comparison between pointer and integer");
8028 build_type = integer_type_node;
8029 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
8030 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
8032 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8034 if (comp_target_types (type0, type1))
8036 result_type = common_pointer_type (type0, type1);
8037 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8038 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8039 pedwarn ("comparison of complete and incomplete pointers");
8041 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8042 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
8046 result_type = ptr_type_node;
8047 pedwarn ("comparison of distinct pointer types lacks a cast");
8050 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8052 result_type = type0;
8053 if (pedantic || extra_warnings)
8054 pedwarn ("ordered comparison of pointer with integer zero");
8056 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8058 result_type = type1;
8060 pedwarn ("ordered comparison of pointer with integer zero");
8062 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8064 result_type = type0;
8065 pedwarn ("comparison between pointer and integer");
8067 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8069 result_type = type1;
8070 pedwarn ("comparison between pointer and integer");
8078 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8079 return error_mark_node;
8081 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8082 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8083 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8084 TREE_TYPE (type1))))
8086 binary_op_error (code);
8087 return error_mark_node;
8090 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8091 || code0 == VECTOR_TYPE)
8093 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8094 || code1 == VECTOR_TYPE))
8096 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8098 if (shorten || common || short_compare)
8099 result_type = c_common_type (type0, type1);
8101 /* For certain operations (which identify themselves by shorten != 0)
8102 if both args were extended from the same smaller type,
8103 do the arithmetic in that type and then extend.
8105 shorten !=0 and !=1 indicates a bitwise operation.
8106 For them, this optimization is safe only if
8107 both args are zero-extended or both are sign-extended.
8108 Otherwise, we might change the result.
8109 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8110 but calculated in (unsigned short) it would be (unsigned short)-1. */
8112 if (shorten && none_complex)
8114 int unsigned0, unsigned1;
8119 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
8120 excessive narrowing when we call get_narrower below. For
8121 example, suppose that OP0 is of unsigned int extended
8122 from signed char and that RESULT_TYPE is long long int.
8123 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
8126 (long long int) (unsigned int) signed_char
8128 which get_narrower would narrow down to
8130 (unsigned int) signed char
8132 If we do not cast OP0 first, get_narrower would return
8133 signed_char, which is inconsistent with the case of the
8135 op0 = convert (result_type, op0);
8136 op1 = convert (result_type, op1);
8138 arg0 = get_narrower (op0, &unsigned0);
8139 arg1 = get_narrower (op1, &unsigned1);
8141 /* UNS is 1 if the operation to be done is an unsigned one. */
8142 uns = TYPE_UNSIGNED (result_type);
8144 final_type = result_type;
8146 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
8147 but it *requires* conversion to FINAL_TYPE. */
8149 if ((TYPE_PRECISION (TREE_TYPE (op0))
8150 == TYPE_PRECISION (TREE_TYPE (arg0)))
8151 && TREE_TYPE (op0) != final_type)
8152 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
8153 if ((TYPE_PRECISION (TREE_TYPE (op1))
8154 == TYPE_PRECISION (TREE_TYPE (arg1)))
8155 && TREE_TYPE (op1) != final_type)
8156 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
8158 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
8160 /* For bitwise operations, signedness of nominal type
8161 does not matter. Consider only how operands were extended. */
8165 /* Note that in all three cases below we refrain from optimizing
8166 an unsigned operation on sign-extended args.
8167 That would not be valid. */
8169 /* Both args variable: if both extended in same way
8170 from same width, do it in that width.
8171 Do it unsigned if args were zero-extended. */
8172 if ((TYPE_PRECISION (TREE_TYPE (arg0))
8173 < TYPE_PRECISION (result_type))
8174 && (TYPE_PRECISION (TREE_TYPE (arg1))
8175 == TYPE_PRECISION (TREE_TYPE (arg0)))
8176 && unsigned0 == unsigned1
8177 && (unsigned0 || !uns))
8179 = c_common_signed_or_unsigned_type
8180 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
8181 else if (TREE_CODE (arg0) == INTEGER_CST
8182 && (unsigned1 || !uns)
8183 && (TYPE_PRECISION (TREE_TYPE (arg1))
8184 < TYPE_PRECISION (result_type))
8186 = c_common_signed_or_unsigned_type (unsigned1,
8188 int_fits_type_p (arg0, type)))
8190 else if (TREE_CODE (arg1) == INTEGER_CST
8191 && (unsigned0 || !uns)
8192 && (TYPE_PRECISION (TREE_TYPE (arg0))
8193 < TYPE_PRECISION (result_type))
8195 = c_common_signed_or_unsigned_type (unsigned0,
8197 int_fits_type_p (arg1, type)))
8201 /* Shifts can be shortened if shifting right. */
8206 tree arg0 = get_narrower (op0, &unsigned_arg);
8208 final_type = result_type;
8210 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8211 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8213 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8214 /* We can shorten only if the shift count is less than the
8215 number of bits in the smaller type size. */
8216 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8217 /* We cannot drop an unsigned shift after sign-extension. */
8218 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8220 /* Do an unsigned shift if the operand was zero-extended. */
8222 = c_common_signed_or_unsigned_type (unsigned_arg,
8224 /* Convert value-to-be-shifted to that type. */
8225 if (TREE_TYPE (op0) != result_type)
8226 op0 = convert (result_type, op0);
8231 /* Comparison operations are shortened too but differently.
8232 They identify themselves by setting short_compare = 1. */
8236 /* Don't write &op0, etc., because that would prevent op0
8237 from being kept in a register.
8238 Instead, make copies of the our local variables and
8239 pass the copies by reference, then copy them back afterward. */
8240 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8241 enum tree_code xresultcode = resultcode;
8243 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8248 op0 = xop0, op1 = xop1;
8250 resultcode = xresultcode;
8252 if (warn_sign_compare && skip_evaluation == 0)
8254 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
8255 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
8256 int unsignedp0, unsignedp1;
8257 tree primop0 = get_narrower (op0, &unsignedp0);
8258 tree primop1 = get_narrower (op1, &unsignedp1);
8262 STRIP_TYPE_NOPS (xop0);
8263 STRIP_TYPE_NOPS (xop1);
8265 /* Give warnings for comparisons between signed and unsigned
8266 quantities that may fail.
8268 Do the checking based on the original operand trees, so that
8269 casts will be considered, but default promotions won't be.
8271 Do not warn if the comparison is being done in a signed type,
8272 since the signed type will only be chosen if it can represent
8273 all the values of the unsigned type. */
8274 if (!TYPE_UNSIGNED (result_type))
8276 /* Do not warn if both operands are the same signedness. */
8277 else if (op0_signed == op1_signed)
8284 sop = xop0, uop = xop1;
8286 sop = xop1, uop = xop0;
8288 /* Do not warn if the signed quantity is an
8289 unsuffixed integer literal (or some static
8290 constant expression involving such literals or a
8291 conditional expression involving such literals)
8292 and it is non-negative. */
8293 if (tree_expr_nonnegative_p (sop))
8295 /* Do not warn if the comparison is an equality operation,
8296 the unsigned quantity is an integral constant, and it
8297 would fit in the result if the result were signed. */
8298 else if (TREE_CODE (uop) == INTEGER_CST
8299 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
8301 (uop, c_common_signed_type (result_type)))
8303 /* Do not warn if the unsigned quantity is an enumeration
8304 constant and its maximum value would fit in the result
8305 if the result were signed. */
8306 else if (TREE_CODE (uop) == INTEGER_CST
8307 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
8309 (TYPE_MAX_VALUE (TREE_TYPE (uop)),
8310 c_common_signed_type (result_type)))
8313 warning (0, "comparison between signed and unsigned");
8316 /* Warn if two unsigned values are being compared in a size
8317 larger than their original size, and one (and only one) is the
8318 result of a `~' operator. This comparison will always fail.
8320 Also warn if one operand is a constant, and the constant
8321 does not have all bits set that are set in the ~ operand
8322 when it is extended. */
8324 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
8325 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
8327 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
8328 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
8331 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
8334 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
8337 HOST_WIDE_INT constant, mask;
8338 int unsignedp, bits;
8340 if (host_integerp (primop0, 0))
8343 unsignedp = unsignedp1;
8344 constant = tree_low_cst (primop0, 0);
8349 unsignedp = unsignedp0;
8350 constant = tree_low_cst (primop1, 0);
8353 bits = TYPE_PRECISION (TREE_TYPE (primop));
8354 if (bits < TYPE_PRECISION (result_type)
8355 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
8357 mask = (~(HOST_WIDE_INT) 0) << bits;
8358 if ((mask & constant) != mask)
8359 warning (0, "comparison of promoted ~unsigned with constant");
8362 else if (unsignedp0 && unsignedp1
8363 && (TYPE_PRECISION (TREE_TYPE (primop0))
8364 < TYPE_PRECISION (result_type))
8365 && (TYPE_PRECISION (TREE_TYPE (primop1))
8366 < TYPE_PRECISION (result_type)))
8367 warning (0, "comparison of promoted ~unsigned with unsigned");
8373 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8374 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8375 Then the expression will be built.
8376 It will be given type FINAL_TYPE if that is nonzero;
8377 otherwise, it will be given type RESULT_TYPE. */
8381 binary_op_error (code);
8382 return error_mark_node;
8387 if (TREE_TYPE (op0) != result_type)
8388 op0 = convert_and_check (result_type, op0);
8389 if (TREE_TYPE (op1) != result_type)
8390 op1 = convert_and_check (result_type, op1);
8392 /* This can happen if one operand has a vector type, and the other
8393 has a different type. */
8394 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8395 return error_mark_node;
8398 if (build_type == NULL_TREE)
8399 build_type = result_type;
8402 /* Treat expressions in initializers specially as they can't trap. */
8403 tree result = require_constant_value ? fold_build2_initializer (resultcode,
8406 : fold_build2 (resultcode, build_type,
8409 if (final_type != 0)
8410 result = convert (final_type, result);
8416 /* Convert EXPR to be a truth-value, validating its type for this
8420 c_objc_common_truthvalue_conversion (tree expr)
8422 switch (TREE_CODE (TREE_TYPE (expr)))
8425 error ("used array that cannot be converted to pointer where scalar is required");
8426 return error_mark_node;
8429 error ("used struct type value where scalar is required");
8430 return error_mark_node;
8433 error ("used union type value where scalar is required");
8434 return error_mark_node;
8443 /* ??? Should we also give an error for void and vectors rather than
8444 leaving those to give errors later? */
8445 return c_common_truthvalue_conversion (expr);
8449 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8453 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED,
8454 bool *ti ATTRIBUTE_UNUSED, bool *se)
8456 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8458 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8459 /* Executing a compound literal inside a function reinitializes
8461 if (!TREE_STATIC (decl))
8469 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8472 c_begin_omp_parallel (void)
8477 block = c_begin_compound_stmt (true);
8483 c_finish_omp_parallel (tree clauses, tree block)
8487 block = c_end_compound_stmt (block, true);
8489 stmt = make_node (OMP_PARALLEL);
8490 TREE_TYPE (stmt) = void_type_node;
8491 OMP_PARALLEL_CLAUSES (stmt) = clauses;
8492 OMP_PARALLEL_BODY (stmt) = block;
8494 return add_stmt (stmt);
8497 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8498 Remove any elements from the list that are invalid. */
8501 c_finish_omp_clauses (tree clauses)
8503 bitmap_head generic_head, firstprivate_head, lastprivate_head;
8504 tree c, t, *pc = &clauses;
8507 bitmap_obstack_initialize (NULL);
8508 bitmap_initialize (&generic_head, &bitmap_default_obstack);
8509 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
8510 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
8512 for (pc = &clauses, c = clauses; c ; c = *pc)
8514 bool remove = false;
8515 bool need_complete = false;
8516 bool need_implicitly_determined = false;
8518 switch (OMP_CLAUSE_CODE (c))
8520 case OMP_CLAUSE_SHARED:
8522 need_implicitly_determined = true;
8523 goto check_dup_generic;
8525 case OMP_CLAUSE_PRIVATE:
8527 need_complete = true;
8528 need_implicitly_determined = true;
8529 goto check_dup_generic;
8531 case OMP_CLAUSE_REDUCTION:
8533 need_implicitly_determined = true;
8534 t = OMP_CLAUSE_DECL (c);
8535 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
8536 || POINTER_TYPE_P (TREE_TYPE (t)))
8538 error ("%qE has invalid type for %<reduction%>", t);
8541 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
8543 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
8544 const char *r_name = NULL;
8561 case TRUTH_ANDIF_EXPR:
8564 case TRUTH_ORIF_EXPR:
8572 error ("%qE has invalid type for %<reduction(%s)%>",
8577 goto check_dup_generic;
8579 case OMP_CLAUSE_COPYPRIVATE:
8580 name = "copyprivate";
8581 goto check_dup_generic;
8583 case OMP_CLAUSE_COPYIN:
8585 t = OMP_CLAUSE_DECL (c);
8586 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
8588 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
8591 goto check_dup_generic;
8594 t = OMP_CLAUSE_DECL (c);
8595 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8597 error ("%qE is not a variable in clause %qs", t, name);
8600 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8601 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
8602 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8604 error ("%qE appears more than once in data clauses", t);
8608 bitmap_set_bit (&generic_head, DECL_UID (t));
8611 case OMP_CLAUSE_FIRSTPRIVATE:
8612 name = "firstprivate";
8613 t = OMP_CLAUSE_DECL (c);
8614 need_complete = true;
8615 need_implicitly_determined = true;
8616 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8618 error ("%qE is not a variable in clause %<firstprivate%>", t);
8621 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8622 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
8624 error ("%qE appears more than once in data clauses", t);
8628 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
8631 case OMP_CLAUSE_LASTPRIVATE:
8632 name = "lastprivate";
8633 t = OMP_CLAUSE_DECL (c);
8634 need_complete = true;
8635 need_implicitly_determined = true;
8636 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
8638 error ("%qE is not a variable in clause %<lastprivate%>", t);
8641 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
8642 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
8644 error ("%qE appears more than once in data clauses", t);
8648 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
8652 case OMP_CLAUSE_NUM_THREADS:
8653 case OMP_CLAUSE_SCHEDULE:
8654 case OMP_CLAUSE_NOWAIT:
8655 case OMP_CLAUSE_ORDERED:
8656 case OMP_CLAUSE_DEFAULT:
8657 pc = &OMP_CLAUSE_CHAIN (c);
8666 t = OMP_CLAUSE_DECL (c);
8670 t = require_complete_type (t);
8671 if (t == error_mark_node)
8675 if (need_implicitly_determined)
8677 const char *share_name = NULL;
8679 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
8680 share_name = "threadprivate";
8681 else switch (c_omp_predetermined_sharing (t))
8683 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
8685 case OMP_CLAUSE_DEFAULT_SHARED:
8686 share_name = "shared";
8688 case OMP_CLAUSE_DEFAULT_PRIVATE:
8689 share_name = "private";
8696 error ("%qE is predetermined %qs for %qs",
8697 t, share_name, name);
8704 *pc = OMP_CLAUSE_CHAIN (c);
8706 pc = &OMP_CLAUSE_CHAIN (c);
8709 bitmap_obstack_release (NULL);