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 void push_array_bounds (int);
94 static int spelling_length (void);
95 static char *print_spelling (char *);
96 static void warning_init (const char *);
97 static tree digest_init (tree, tree, bool, int);
98 static void output_init_element (tree, bool, tree, tree, int);
99 static void output_pending_init_elements (int);
100 static int set_designator (int);
101 static void push_range_stack (tree);
102 static void add_pending_init (tree, tree);
103 static void set_nonincremental_init (void);
104 static void set_nonincremental_init_from_string (tree);
105 static tree find_init_member (tree);
106 static void readonly_error (tree, enum lvalue_use);
107 static int lvalue_or_else (tree, enum lvalue_use);
108 static int lvalue_p (tree);
109 static void record_maybe_used_decl (tree);
110 static int comptypes_internal (tree, tree);
112 /* Return true if EXP is a null pointer constant, false otherwise. */
115 null_pointer_constant_p (tree expr)
117 /* This should really operate on c_expr structures, but they aren't
118 yet available everywhere required. */
119 tree type = TREE_TYPE (expr);
120 return (TREE_CODE (expr) == INTEGER_CST
121 && !TREE_CONSTANT_OVERFLOW (expr)
122 && integer_zerop (expr)
123 && (INTEGRAL_TYPE_P (type)
124 || (TREE_CODE (type) == POINTER_TYPE
125 && VOID_TYPE_P (TREE_TYPE (type))
126 && TYPE_QUALS (TREE_TYPE (type)) == TYPE_UNQUALIFIED)));
128 \f/* This is a cache to hold if two types are compatible or not. */
130 struct tagged_tu_seen_cache {
131 const struct tagged_tu_seen_cache * next;
134 /* The return value of tagged_types_tu_compatible_p if we had seen
135 these two types already. */
139 static const struct tagged_tu_seen_cache * tagged_tu_seen_base;
140 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *);
142 /* Do `exp = require_complete_type (exp);' to make sure exp
143 does not have an incomplete type. (That includes void types.) */
146 require_complete_type (tree value)
148 tree type = TREE_TYPE (value);
150 if (value == error_mark_node || type == error_mark_node)
151 return error_mark_node;
153 /* First, detect a valid value with a complete type. */
154 if (COMPLETE_TYPE_P (type))
157 c_incomplete_type_error (value, type);
158 return error_mark_node;
161 /* Print an error message for invalid use of an incomplete type.
162 VALUE is the expression that was used (or 0 if that isn't known)
163 and TYPE is the type that was invalid. */
166 c_incomplete_type_error (tree value, tree type)
168 const char *type_code_string;
170 /* Avoid duplicate error message. */
171 if (TREE_CODE (type) == ERROR_MARK)
174 if (value != 0 && (TREE_CODE (value) == VAR_DECL
175 || TREE_CODE (value) == PARM_DECL))
176 error ("%qD has an incomplete type", value);
180 /* We must print an error message. Be clever about what it says. */
182 switch (TREE_CODE (type))
185 type_code_string = "struct";
189 type_code_string = "union";
193 type_code_string = "enum";
197 error ("invalid use of void expression");
201 if (TYPE_DOMAIN (type))
203 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
205 error ("invalid use of flexible array member");
208 type = TREE_TYPE (type);
211 error ("invalid use of array with unspecified bounds");
218 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
219 error ("invalid use of undefined type %<%s %E%>",
220 type_code_string, TYPE_NAME (type));
222 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
223 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type));
227 /* Given a type, apply default promotions wrt unnamed function
228 arguments and return the new type. */
231 c_type_promotes_to (tree type)
233 if (TYPE_MAIN_VARIANT (type) == float_type_node)
234 return double_type_node;
236 if (c_promoting_integer_type_p (type))
238 /* Preserve unsignedness if not really getting any wider. */
239 if (TYPE_UNSIGNED (type)
240 && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
241 return unsigned_type_node;
242 return integer_type_node;
248 /* Return a variant of TYPE which has all the type qualifiers of LIKE
249 as well as those of TYPE. */
252 qualify_type (tree type, tree like)
254 return c_build_qualified_type (type,
255 TYPE_QUALS (type) | TYPE_QUALS (like));
258 /* Return the composite type of two compatible types.
260 We assume that comptypes has already been done and returned
261 nonzero; if that isn't so, this may crash. In particular, we
262 assume that qualifiers match. */
265 composite_type (tree t1, tree t2)
267 enum tree_code code1;
268 enum tree_code code2;
271 /* Save time if the two types are the same. */
273 if (t1 == t2) return t1;
275 /* If one type is nonsense, use the other. */
276 if (t1 == error_mark_node)
278 if (t2 == error_mark_node)
281 code1 = TREE_CODE (t1);
282 code2 = TREE_CODE (t2);
284 /* Merge the attributes. */
285 attributes = targetm.merge_type_attributes (t1, t2);
287 /* If one is an enumerated type and the other is the compatible
288 integer type, the composite type might be either of the two
289 (DR#013 question 3). For consistency, use the enumerated type as
290 the composite type. */
292 if (code1 == ENUMERAL_TYPE && code2 == INTEGER_TYPE)
294 if (code2 == ENUMERAL_TYPE && code1 == INTEGER_TYPE)
297 gcc_assert (code1 == code2);
302 /* For two pointers, do this recursively on the target type. */
304 tree pointed_to_1 = TREE_TYPE (t1);
305 tree pointed_to_2 = TREE_TYPE (t2);
306 tree target = composite_type (pointed_to_1, pointed_to_2);
307 t1 = build_pointer_type (target);
308 t1 = build_type_attribute_variant (t1, attributes);
309 return qualify_type (t1, t2);
314 tree elt = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
317 tree d1 = TYPE_DOMAIN (t1);
318 tree d2 = TYPE_DOMAIN (t2);
319 bool d1_variable, d2_variable;
320 bool d1_zero, d2_zero;
322 /* We should not have any type quals on arrays at all. */
323 gcc_assert (!TYPE_QUALS (t1) && !TYPE_QUALS (t2));
325 d1_zero = d1 == 0 || !TYPE_MAX_VALUE (d1);
326 d2_zero = d2 == 0 || !TYPE_MAX_VALUE (d2);
328 d1_variable = (!d1_zero
329 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
330 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
331 d2_variable = (!d2_zero
332 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
333 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
335 /* Save space: see if the result is identical to one of the args. */
336 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)
337 && (d2_variable || d2_zero || !d1_variable))
338 return build_type_attribute_variant (t1, attributes);
339 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)
340 && (d1_variable || d1_zero || !d2_variable))
341 return build_type_attribute_variant (t2, attributes);
343 if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
344 return build_type_attribute_variant (t1, attributes);
345 if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
346 return build_type_attribute_variant (t2, attributes);
348 /* Merge the element types, and have a size if either arg has
349 one. We may have qualifiers on the element types. To set
350 up TYPE_MAIN_VARIANT correctly, we need to form the
351 composite of the unqualified types and add the qualifiers
353 quals = TYPE_QUALS (strip_array_types (elt));
354 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
355 t1 = build_array_type (unqual_elt,
356 TYPE_DOMAIN ((TYPE_DOMAIN (t1)
362 t1 = c_build_qualified_type (t1, quals);
363 return build_type_attribute_variant (t1, attributes);
367 /* Function types: prefer the one that specified arg types.
368 If both do, merge the arg types. Also merge the return types. */
370 tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
371 tree p1 = TYPE_ARG_TYPES (t1);
372 tree p2 = TYPE_ARG_TYPES (t2);
377 /* Save space: see if the result is identical to one of the args. */
378 if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
379 return build_type_attribute_variant (t1, attributes);
380 if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
381 return build_type_attribute_variant (t2, attributes);
383 /* Simple way if one arg fails to specify argument types. */
384 if (TYPE_ARG_TYPES (t1) == 0)
386 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
387 t1 = build_type_attribute_variant (t1, attributes);
388 return qualify_type (t1, t2);
390 if (TYPE_ARG_TYPES (t2) == 0)
392 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
393 t1 = build_type_attribute_variant (t1, attributes);
394 return qualify_type (t1, t2);
397 /* If both args specify argument types, we must merge the two
398 lists, argument by argument. */
399 /* Tell global_bindings_p to return false so that variable_size
400 doesn't die on VLAs in parameter types. */
401 c_override_global_bindings_to_false = true;
403 len = list_length (p1);
406 for (i = 0; i < len; i++)
407 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
412 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
414 /* A null type means arg type is not specified.
415 Take whatever the other function type has. */
416 if (TREE_VALUE (p1) == 0)
418 TREE_VALUE (n) = TREE_VALUE (p2);
421 if (TREE_VALUE (p2) == 0)
423 TREE_VALUE (n) = TREE_VALUE (p1);
427 /* Given wait (union {union wait *u; int *i} *)
428 and wait (union wait *),
429 prefer union wait * as type of parm. */
430 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
431 && TREE_VALUE (p1) != TREE_VALUE (p2))
434 tree mv2 = TREE_VALUE (p2);
435 if (mv2 && mv2 != error_mark_node
436 && TREE_CODE (mv2) != ARRAY_TYPE)
437 mv2 = TYPE_MAIN_VARIANT (mv2);
438 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
439 memb; memb = TREE_CHAIN (memb))
441 tree mv3 = TREE_TYPE (memb);
442 if (mv3 && mv3 != error_mark_node
443 && TREE_CODE (mv3) != ARRAY_TYPE)
444 mv3 = TYPE_MAIN_VARIANT (mv3);
445 if (comptypes (mv3, mv2))
447 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
450 pedwarn ("function types not truly compatible in ISO C");
455 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
456 && TREE_VALUE (p2) != TREE_VALUE (p1))
459 tree mv1 = TREE_VALUE (p1);
460 if (mv1 && mv1 != error_mark_node
461 && TREE_CODE (mv1) != ARRAY_TYPE)
462 mv1 = TYPE_MAIN_VARIANT (mv1);
463 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
464 memb; memb = TREE_CHAIN (memb))
466 tree mv3 = TREE_TYPE (memb);
467 if (mv3 && mv3 != error_mark_node
468 && TREE_CODE (mv3) != ARRAY_TYPE)
469 mv3 = TYPE_MAIN_VARIANT (mv3);
470 if (comptypes (mv3, mv1))
472 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
475 pedwarn ("function types not truly compatible in ISO C");
480 TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
484 c_override_global_bindings_to_false = false;
485 t1 = build_function_type (valtype, newargs);
486 t1 = qualify_type (t1, t2);
487 /* ... falls through ... */
491 return build_type_attribute_variant (t1, attributes);
496 /* Return the type of a conditional expression between pointers to
497 possibly differently qualified versions of compatible types.
499 We assume that comp_target_types has already been done and returned
500 nonzero; if that isn't so, this may crash. */
503 common_pointer_type (tree t1, tree t2)
506 tree pointed_to_1, mv1;
507 tree pointed_to_2, mv2;
510 /* Save time if the two types are the same. */
512 if (t1 == t2) return t1;
514 /* If one type is nonsense, use the other. */
515 if (t1 == error_mark_node)
517 if (t2 == error_mark_node)
520 gcc_assert (TREE_CODE (t1) == POINTER_TYPE
521 && TREE_CODE (t2) == POINTER_TYPE);
523 /* Merge the attributes. */
524 attributes = targetm.merge_type_attributes (t1, t2);
526 /* Find the composite type of the target types, and combine the
527 qualifiers of the two types' targets. Do not lose qualifiers on
528 array element types by taking the TYPE_MAIN_VARIANT. */
529 mv1 = pointed_to_1 = TREE_TYPE (t1);
530 mv2 = pointed_to_2 = TREE_TYPE (t2);
531 if (TREE_CODE (mv1) != ARRAY_TYPE)
532 mv1 = TYPE_MAIN_VARIANT (pointed_to_1);
533 if (TREE_CODE (mv2) != ARRAY_TYPE)
534 mv2 = TYPE_MAIN_VARIANT (pointed_to_2);
535 target = composite_type (mv1, mv2);
536 t1 = build_pointer_type (c_build_qualified_type
538 TYPE_QUALS (pointed_to_1) |
539 TYPE_QUALS (pointed_to_2)));
540 return build_type_attribute_variant (t1, attributes);
543 /* Return the common type for two arithmetic types under the usual
544 arithmetic conversions. The default conversions have already been
545 applied, and enumerated types converted to their compatible integer
546 types. The resulting type is unqualified and has no attributes.
548 This is the type for the result of most arithmetic operations
549 if the operands have the given two types. */
552 c_common_type (tree t1, tree t2)
554 enum tree_code code1;
555 enum tree_code code2;
557 /* If one type is nonsense, use the other. */
558 if (t1 == error_mark_node)
560 if (t2 == error_mark_node)
563 if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
564 t1 = TYPE_MAIN_VARIANT (t1);
566 if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
567 t2 = TYPE_MAIN_VARIANT (t2);
569 if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
570 t1 = build_type_attribute_variant (t1, NULL_TREE);
572 if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
573 t2 = build_type_attribute_variant (t2, NULL_TREE);
575 /* Save time if the two types are the same. */
577 if (t1 == t2) return t1;
579 code1 = TREE_CODE (t1);
580 code2 = TREE_CODE (t2);
582 gcc_assert (code1 == VECTOR_TYPE || code1 == COMPLEX_TYPE
583 || code1 == REAL_TYPE || code1 == INTEGER_TYPE);
584 gcc_assert (code2 == VECTOR_TYPE || code2 == COMPLEX_TYPE
585 || code2 == REAL_TYPE || code2 == INTEGER_TYPE);
587 /* If one type is a vector type, return that type. (How the usual
588 arithmetic conversions apply to the vector types extension is not
589 precisely specified.) */
590 if (code1 == VECTOR_TYPE)
593 if (code2 == VECTOR_TYPE)
596 /* If one type is complex, form the common type of the non-complex
597 components, then make that complex. Use T1 or T2 if it is the
599 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
601 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
602 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
603 tree subtype = c_common_type (subtype1, subtype2);
605 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
607 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
610 return build_complex_type (subtype);
613 /* If only one is real, use it as the result. */
615 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
618 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
621 /* If both are real and either are decimal floating point types, use
622 the decimal floating point type with the greater precision. */
624 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
626 if (TYPE_MAIN_VARIANT (t1) == dfloat128_type_node
627 || TYPE_MAIN_VARIANT (t2) == dfloat128_type_node)
628 return dfloat128_type_node;
629 else if (TYPE_MAIN_VARIANT (t1) == dfloat64_type_node
630 || TYPE_MAIN_VARIANT (t2) == dfloat64_type_node)
631 return dfloat64_type_node;
632 else if (TYPE_MAIN_VARIANT (t1) == dfloat32_type_node
633 || TYPE_MAIN_VARIANT (t2) == dfloat32_type_node)
634 return dfloat32_type_node;
637 /* Both real or both integers; use the one with greater precision. */
639 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
641 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
644 /* Same precision. Prefer long longs to longs to ints when the
645 same precision, following the C99 rules on integer type rank
646 (which are equivalent to the C90 rules for C90 types). */
648 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
649 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
650 return long_long_unsigned_type_node;
652 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
653 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
655 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
656 return long_long_unsigned_type_node;
658 return long_long_integer_type_node;
661 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
662 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
663 return long_unsigned_type_node;
665 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
666 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
668 /* But preserve unsignedness from the other type,
669 since long cannot hold all the values of an unsigned int. */
670 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
671 return long_unsigned_type_node;
673 return long_integer_type_node;
676 /* Likewise, prefer long double to double even if same size. */
677 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
678 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
679 return long_double_type_node;
681 /* Otherwise prefer the unsigned one. */
683 if (TYPE_UNSIGNED (t1))
689 /* Wrapper around c_common_type that is used by c-common.c and other
690 front end optimizations that remove promotions. ENUMERAL_TYPEs
691 are allowed here and are converted to their compatible integer types.
692 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
693 preferably a non-Boolean type as the common type. */
695 common_type (tree t1, tree t2)
697 if (TREE_CODE (t1) == ENUMERAL_TYPE)
698 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
699 if (TREE_CODE (t2) == ENUMERAL_TYPE)
700 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
702 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
703 if (TREE_CODE (t1) == BOOLEAN_TYPE
704 && TREE_CODE (t2) == BOOLEAN_TYPE)
705 return boolean_type_node;
707 /* If either type is BOOLEAN_TYPE, then return the other. */
708 if (TREE_CODE (t1) == BOOLEAN_TYPE)
710 if (TREE_CODE (t2) == BOOLEAN_TYPE)
713 return c_common_type (t1, t2);
716 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
717 or various other operations. Return 2 if they are compatible
718 but a warning may be needed if you use them together. */
721 comptypes (tree type1, tree type2)
723 const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
726 val = comptypes_internal (type1, type2);
727 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
731 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
732 or various other operations. Return 2 if they are compatible
733 but a warning may be needed if you use them together. This
734 differs from comptypes, in that we don't free the seen types. */
737 comptypes_internal (tree type1, tree type2)
743 /* Suppress errors caused by previously reported errors. */
745 if (t1 == t2 || !t1 || !t2
746 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
749 /* If either type is the internal version of sizetype, return the
751 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
752 && TYPE_ORIG_SIZE_TYPE (t1))
753 t1 = TYPE_ORIG_SIZE_TYPE (t1);
755 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
756 && TYPE_ORIG_SIZE_TYPE (t2))
757 t2 = TYPE_ORIG_SIZE_TYPE (t2);
760 /* Enumerated types are compatible with integer types, but this is
761 not transitive: two enumerated types in the same translation unit
762 are compatible with each other only if they are the same type. */
764 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
765 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
766 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
767 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
772 /* Different classes of types can't be compatible. */
774 if (TREE_CODE (t1) != TREE_CODE (t2))
777 /* Qualifiers must match. C99 6.7.3p9 */
779 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
782 /* Allow for two different type nodes which have essentially the same
783 definition. Note that we already checked for equality of the type
784 qualifiers (just above). */
786 if (TREE_CODE (t1) != ARRAY_TYPE
787 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
790 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
791 if (!(attrval = targetm.comp_type_attributes (t1, t2)))
794 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
797 switch (TREE_CODE (t1))
800 /* Do not remove mode or aliasing information. */
801 if (TYPE_MODE (t1) != TYPE_MODE (t2)
802 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
804 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
805 ? 1 : comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2)));
809 val = function_types_compatible_p (t1, t2);
814 tree d1 = TYPE_DOMAIN (t1);
815 tree d2 = TYPE_DOMAIN (t2);
816 bool d1_variable, d2_variable;
817 bool d1_zero, d2_zero;
820 /* Target types must match incl. qualifiers. */
821 if (TREE_TYPE (t1) != TREE_TYPE (t2)
822 && 0 == (val = comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2))))
825 /* Sizes must match unless one is missing or variable. */
826 if (d1 == 0 || d2 == 0 || d1 == d2)
829 d1_zero = !TYPE_MAX_VALUE (d1);
830 d2_zero = !TYPE_MAX_VALUE (d2);
832 d1_variable = (!d1_zero
833 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
834 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
835 d2_variable = (!d2_zero
836 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
837 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
839 if (d1_variable || d2_variable)
841 if (d1_zero && d2_zero)
843 if (d1_zero || d2_zero
844 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
845 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
854 if (val != 1 && !same_translation_unit_p (t1, t2))
857 return tagged_types_tu_compatible_p (t1, t2);
858 val = tagged_types_tu_compatible_p (t1, t2);
863 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
864 && comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2));
870 return attrval == 2 && val == 1 ? 2 : val;
873 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
874 ignoring their qualifiers. */
877 comp_target_types (tree ttl, tree ttr)
882 /* Do not lose qualifiers on element types of array types that are
883 pointer targets by taking their TYPE_MAIN_VARIANT. */
884 mvl = TREE_TYPE (ttl);
885 mvr = TREE_TYPE (ttr);
886 if (TREE_CODE (mvl) != ARRAY_TYPE)
887 mvl = TYPE_MAIN_VARIANT (mvl);
888 if (TREE_CODE (mvr) != ARRAY_TYPE)
889 mvr = TYPE_MAIN_VARIANT (mvr);
890 val = comptypes (mvl, mvr);
892 if (val == 2 && pedantic)
893 pedwarn ("types are not quite compatible");
897 /* Subroutines of `comptypes'. */
899 /* Determine whether two trees derive from the same translation unit.
900 If the CONTEXT chain ends in a null, that tree's context is still
901 being parsed, so if two trees have context chains ending in null,
902 they're in the same translation unit. */
904 same_translation_unit_p (tree t1, tree t2)
906 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
907 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
909 case tcc_declaration:
910 t1 = DECL_CONTEXT (t1); break;
912 t1 = TYPE_CONTEXT (t1); break;
913 case tcc_exceptional:
914 t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
915 default: gcc_unreachable ();
918 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
919 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
921 case tcc_declaration:
922 t2 = DECL_CONTEXT (t2); break;
924 t2 = TYPE_CONTEXT (t2); break;
925 case tcc_exceptional:
926 t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
927 default: gcc_unreachable ();
933 /* Allocate the seen two types, assuming that they are compatible. */
935 static struct tagged_tu_seen_cache *
936 alloc_tagged_tu_seen_cache (tree t1, tree t2)
938 struct tagged_tu_seen_cache *tu = XNEW (struct tagged_tu_seen_cache);
939 tu->next = tagged_tu_seen_base;
943 tagged_tu_seen_base = tu;
945 /* The C standard says that two structures in different translation
946 units are compatible with each other only if the types of their
947 fields are compatible (among other things). We assume that they
948 are compatible until proven otherwise when building the cache.
949 An example where this can occur is:
954 If we are comparing this against a similar struct in another TU,
955 and did not assume they were compatible, we end up with an infinite
961 /* Free the seen types until we get to TU_TIL. */
964 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *tu_til)
966 const struct tagged_tu_seen_cache *tu = tagged_tu_seen_base;
969 struct tagged_tu_seen_cache *tu1 = (struct tagged_tu_seen_cache*)tu;
973 tagged_tu_seen_base = tu_til;
976 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
977 compatible. If the two types are not the same (which has been
978 checked earlier), this can only happen when multiple translation
979 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
983 tagged_types_tu_compatible_p (tree t1, tree t2)
986 bool needs_warning = false;
988 /* We have to verify that the tags of the types are the same. This
989 is harder than it looks because this may be a typedef, so we have
990 to go look at the original type. It may even be a typedef of a
992 In the case of compiler-created builtin structs the TYPE_DECL
993 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
994 while (TYPE_NAME (t1)
995 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
996 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
997 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
999 while (TYPE_NAME (t2)
1000 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
1001 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
1002 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
1004 /* C90 didn't have the requirement that the two tags be the same. */
1005 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
1008 /* C90 didn't say what happened if one or both of the types were
1009 incomplete; we choose to follow C99 rules here, which is that they
1011 if (TYPE_SIZE (t1) == NULL
1012 || TYPE_SIZE (t2) == NULL)
1016 const struct tagged_tu_seen_cache * tts_i;
1017 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
1018 if (tts_i->t1 == t1 && tts_i->t2 == t2)
1022 switch (TREE_CODE (t1))
1026 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1027 /* Speed up the case where the type values are in the same order. */
1028 tree tv1 = TYPE_VALUES (t1);
1029 tree tv2 = TYPE_VALUES (t2);
1036 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
1038 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
1040 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
1047 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
1051 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
1057 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
1063 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
1065 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
1067 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
1078 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1079 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
1085 /* Speed up the common case where the fields are in the same order. */
1086 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2); s1 && s2;
1087 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1092 if (DECL_NAME (s1) == NULL
1093 || DECL_NAME (s1) != DECL_NAME (s2))
1095 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1102 needs_warning = true;
1104 if (TREE_CODE (s1) == FIELD_DECL
1105 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1106 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1114 tu->val = needs_warning ? 2 : 1;
1118 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
1122 if (DECL_NAME (s1) != NULL)
1123 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
1124 if (DECL_NAME (s1) == DECL_NAME (s2))
1127 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1134 needs_warning = true;
1136 if (TREE_CODE (s1) == FIELD_DECL
1137 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1138 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1150 tu->val = needs_warning ? 2 : 10;
1156 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1158 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
1160 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1163 if (TREE_CODE (s1) != TREE_CODE (s2)
1164 || DECL_NAME (s1) != DECL_NAME (s2))
1166 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1170 needs_warning = true;
1172 if (TREE_CODE (s1) == FIELD_DECL
1173 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1174 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1180 tu->val = needs_warning ? 2 : 1;
1189 /* Return 1 if two function types F1 and F2 are compatible.
1190 If either type specifies no argument types,
1191 the other must specify a fixed number of self-promoting arg types.
1192 Otherwise, if one type specifies only the number of arguments,
1193 the other must specify that number of self-promoting arg types.
1194 Otherwise, the argument types must match. */
1197 function_types_compatible_p (tree f1, tree f2)
1200 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1205 ret1 = TREE_TYPE (f1);
1206 ret2 = TREE_TYPE (f2);
1208 /* 'volatile' qualifiers on a function's return type used to mean
1209 the function is noreturn. */
1210 if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1211 pedwarn ("function return types not compatible due to %<volatile%>");
1212 if (TYPE_VOLATILE (ret1))
1213 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1214 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1215 if (TYPE_VOLATILE (ret2))
1216 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1217 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1218 val = comptypes_internal (ret1, ret2);
1222 args1 = TYPE_ARG_TYPES (f1);
1223 args2 = TYPE_ARG_TYPES (f2);
1225 /* An unspecified parmlist matches any specified parmlist
1226 whose argument types don't need default promotions. */
1230 if (!self_promoting_args_p (args2))
1232 /* If one of these types comes from a non-prototype fn definition,
1233 compare that with the other type's arglist.
1234 If they don't match, ask for a warning (but no error). */
1235 if (TYPE_ACTUAL_ARG_TYPES (f1)
1236 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
1242 if (!self_promoting_args_p (args1))
1244 if (TYPE_ACTUAL_ARG_TYPES (f2)
1245 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1250 /* Both types have argument lists: compare them and propagate results. */
1251 val1 = type_lists_compatible_p (args1, args2);
1252 return val1 != 1 ? val1 : val;
1255 /* Check two lists of types for compatibility,
1256 returning 0 for incompatible, 1 for compatible,
1257 or 2 for compatible with warning. */
1260 type_lists_compatible_p (tree args1, tree args2)
1262 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1268 tree a1, mv1, a2, mv2;
1269 if (args1 == 0 && args2 == 0)
1271 /* If one list is shorter than the other,
1272 they fail to match. */
1273 if (args1 == 0 || args2 == 0)
1275 mv1 = a1 = TREE_VALUE (args1);
1276 mv2 = a2 = TREE_VALUE (args2);
1277 if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1278 mv1 = TYPE_MAIN_VARIANT (mv1);
1279 if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1280 mv2 = TYPE_MAIN_VARIANT (mv2);
1281 /* A null pointer instead of a type
1282 means there is supposed to be an argument
1283 but nothing is specified about what type it has.
1284 So match anything that self-promotes. */
1287 if (c_type_promotes_to (a2) != a2)
1292 if (c_type_promotes_to (a1) != a1)
1295 /* If one of the lists has an error marker, ignore this arg. */
1296 else if (TREE_CODE (a1) == ERROR_MARK
1297 || TREE_CODE (a2) == ERROR_MARK)
1299 else if (!(newval = comptypes_internal (mv1, mv2)))
1301 /* Allow wait (union {union wait *u; int *i} *)
1302 and wait (union wait *) to be compatible. */
1303 if (TREE_CODE (a1) == UNION_TYPE
1304 && (TYPE_NAME (a1) == 0
1305 || TYPE_TRANSPARENT_UNION (a1))
1306 && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1307 && tree_int_cst_equal (TYPE_SIZE (a1),
1311 for (memb = TYPE_FIELDS (a1);
1312 memb; memb = TREE_CHAIN (memb))
1314 tree mv3 = TREE_TYPE (memb);
1315 if (mv3 && mv3 != error_mark_node
1316 && TREE_CODE (mv3) != ARRAY_TYPE)
1317 mv3 = TYPE_MAIN_VARIANT (mv3);
1318 if (comptypes_internal (mv3, mv2))
1324 else if (TREE_CODE (a2) == UNION_TYPE
1325 && (TYPE_NAME (a2) == 0
1326 || TYPE_TRANSPARENT_UNION (a2))
1327 && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1328 && tree_int_cst_equal (TYPE_SIZE (a2),
1332 for (memb = TYPE_FIELDS (a2);
1333 memb; memb = TREE_CHAIN (memb))
1335 tree mv3 = TREE_TYPE (memb);
1336 if (mv3 && mv3 != error_mark_node
1337 && TREE_CODE (mv3) != ARRAY_TYPE)
1338 mv3 = TYPE_MAIN_VARIANT (mv3);
1339 if (comptypes_internal (mv3, mv1))
1349 /* comptypes said ok, but record if it said to warn. */
1353 args1 = TREE_CHAIN (args1);
1354 args2 = TREE_CHAIN (args2);
1358 /* Compute the size to increment a pointer by. */
1361 c_size_in_bytes (tree type)
1363 enum tree_code code = TREE_CODE (type);
1365 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1366 return size_one_node;
1368 if (!COMPLETE_OR_VOID_TYPE_P (type))
1370 error ("arithmetic on pointer to an incomplete type");
1371 return size_one_node;
1374 /* Convert in case a char is more than one unit. */
1375 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1376 size_int (TYPE_PRECISION (char_type_node)
1380 /* Return either DECL or its known constant value (if it has one). */
1383 decl_constant_value (tree decl)
1385 if (/* Don't change a variable array bound or initial value to a constant
1386 in a place where a variable is invalid. Note that DECL_INITIAL
1387 isn't valid for a PARM_DECL. */
1388 current_function_decl != 0
1389 && TREE_CODE (decl) != PARM_DECL
1390 && !TREE_THIS_VOLATILE (decl)
1391 && TREE_READONLY (decl)
1392 && DECL_INITIAL (decl) != 0
1393 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1394 /* This is invalid if initial value is not constant.
1395 If it has either a function call, a memory reference,
1396 or a variable, then re-evaluating it could give different results. */
1397 && TREE_CONSTANT (DECL_INITIAL (decl))
1398 /* Check for cases where this is sub-optimal, even though valid. */
1399 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1400 return DECL_INITIAL (decl);
1404 /* Return either DECL or its known constant value (if it has one), but
1405 return DECL if pedantic or DECL has mode BLKmode. This is for
1406 bug-compatibility with the old behavior of decl_constant_value
1407 (before GCC 3.0); every use of this function is a bug and it should
1408 be removed before GCC 3.1. It is not appropriate to use pedantic
1409 in a way that affects optimization, and BLKmode is probably not the
1410 right test for avoiding misoptimizations either. */
1413 decl_constant_value_for_broken_optimization (tree decl)
1417 if (pedantic || DECL_MODE (decl) == BLKmode)
1420 ret = decl_constant_value (decl);
1421 /* Avoid unwanted tree sharing between the initializer and current
1422 function's body where the tree can be modified e.g. by the
1424 if (ret != decl && TREE_STATIC (decl))
1425 ret = unshare_expr (ret);
1429 /* Convert the array expression EXP to a pointer. */
1431 array_to_pointer_conversion (tree exp)
1433 tree orig_exp = exp;
1434 tree type = TREE_TYPE (exp);
1436 tree restype = TREE_TYPE (type);
1439 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1441 STRIP_TYPE_NOPS (exp);
1443 if (TREE_NO_WARNING (orig_exp))
1444 TREE_NO_WARNING (exp) = 1;
1446 ptrtype = build_pointer_type (restype);
1448 if (TREE_CODE (exp) == INDIRECT_REF)
1449 return convert (ptrtype, TREE_OPERAND (exp, 0));
1451 if (TREE_CODE (exp) == VAR_DECL)
1453 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1454 ADDR_EXPR because it's the best way of representing what
1455 happens in C when we take the address of an array and place
1456 it in a pointer to the element type. */
1457 adr = build1 (ADDR_EXPR, ptrtype, exp);
1458 if (!c_mark_addressable (exp))
1459 return error_mark_node;
1460 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1464 /* This way is better for a COMPONENT_REF since it can
1465 simplify the offset for a component. */
1466 adr = build_unary_op (ADDR_EXPR, exp, 1);
1467 return convert (ptrtype, adr);
1470 /* Convert the function expression EXP to a pointer. */
1472 function_to_pointer_conversion (tree exp)
1474 tree orig_exp = exp;
1476 gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1478 STRIP_TYPE_NOPS (exp);
1480 if (TREE_NO_WARNING (orig_exp))
1481 TREE_NO_WARNING (exp) = 1;
1483 return build_unary_op (ADDR_EXPR, exp, 0);
1486 /* Perform the default conversion of arrays and functions to pointers.
1487 Return the result of converting EXP. For any other expression, just
1488 return EXP after removing NOPs. */
1491 default_function_array_conversion (struct c_expr exp)
1493 tree orig_exp = exp.value;
1494 tree type = TREE_TYPE (exp.value);
1495 enum tree_code code = TREE_CODE (type);
1501 bool not_lvalue = false;
1502 bool lvalue_array_p;
1504 while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1505 || TREE_CODE (exp.value) == NOP_EXPR
1506 || TREE_CODE (exp.value) == CONVERT_EXPR)
1507 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1509 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1511 exp.value = TREE_OPERAND (exp.value, 0);
1514 if (TREE_NO_WARNING (orig_exp))
1515 TREE_NO_WARNING (exp.value) = 1;
1517 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1518 if (!flag_isoc99 && !lvalue_array_p)
1520 /* Before C99, non-lvalue arrays do not decay to pointers.
1521 Normally, using such an array would be invalid; but it can
1522 be used correctly inside sizeof or as a statement expression.
1523 Thus, do not give an error here; an error will result later. */
1527 exp.value = array_to_pointer_conversion (exp.value);
1531 exp.value = function_to_pointer_conversion (exp.value);
1534 STRIP_TYPE_NOPS (exp.value);
1535 if (TREE_NO_WARNING (orig_exp))
1536 TREE_NO_WARNING (exp.value) = 1;
1544 /* EXP is an expression of integer type. Apply the integer promotions
1545 to it and return the promoted value. */
1548 perform_integral_promotions (tree exp)
1550 tree type = TREE_TYPE (exp);
1551 enum tree_code code = TREE_CODE (type);
1553 gcc_assert (INTEGRAL_TYPE_P (type));
1555 /* Normally convert enums to int,
1556 but convert wide enums to something wider. */
1557 if (code == ENUMERAL_TYPE)
1559 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1560 TYPE_PRECISION (integer_type_node)),
1561 ((TYPE_PRECISION (type)
1562 >= TYPE_PRECISION (integer_type_node))
1563 && TYPE_UNSIGNED (type)));
1565 return convert (type, exp);
1568 /* ??? This should no longer be needed now bit-fields have their
1570 if (TREE_CODE (exp) == COMPONENT_REF
1571 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1572 /* If it's thinner than an int, promote it like a
1573 c_promoting_integer_type_p, otherwise leave it alone. */
1574 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1575 TYPE_PRECISION (integer_type_node)))
1576 return convert (integer_type_node, exp);
1578 if (c_promoting_integer_type_p (type))
1580 /* Preserve unsignedness if not really getting any wider. */
1581 if (TYPE_UNSIGNED (type)
1582 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1583 return convert (unsigned_type_node, exp);
1585 return convert (integer_type_node, exp);
1592 /* Perform default promotions for C data used in expressions.
1593 Enumeral types or short or char are converted to int.
1594 In addition, manifest constants symbols are replaced by their values. */
1597 default_conversion (tree exp)
1600 tree type = TREE_TYPE (exp);
1601 enum tree_code code = TREE_CODE (type);
1603 /* Functions and arrays have been converted during parsing. */
1604 gcc_assert (code != FUNCTION_TYPE);
1605 if (code == ARRAY_TYPE)
1608 /* Constants can be used directly unless they're not loadable. */
1609 if (TREE_CODE (exp) == CONST_DECL)
1610 exp = DECL_INITIAL (exp);
1612 /* Replace a nonvolatile const static variable with its value unless
1613 it is an array, in which case we must be sure that taking the
1614 address of the array produces consistent results. */
1615 else if (optimize && TREE_CODE (exp) == VAR_DECL && code != ARRAY_TYPE)
1617 exp = decl_constant_value_for_broken_optimization (exp);
1618 type = TREE_TYPE (exp);
1621 /* Strip no-op conversions. */
1623 STRIP_TYPE_NOPS (exp);
1625 if (TREE_NO_WARNING (orig_exp))
1626 TREE_NO_WARNING (exp) = 1;
1628 if (INTEGRAL_TYPE_P (type))
1629 return perform_integral_promotions (exp);
1631 if (code == VOID_TYPE)
1633 error ("void value not ignored as it ought to be");
1634 return error_mark_node;
1639 /* Look up COMPONENT in a structure or union DECL.
1641 If the component name is not found, returns NULL_TREE. Otherwise,
1642 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1643 stepping down the chain to the component, which is in the last
1644 TREE_VALUE of the list. Normally the list is of length one, but if
1645 the component is embedded within (nested) anonymous structures or
1646 unions, the list steps down the chain to the component. */
1649 lookup_field (tree decl, tree component)
1651 tree type = TREE_TYPE (decl);
1654 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1655 to the field elements. Use a binary search on this array to quickly
1656 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1657 will always be set for structures which have many elements. */
1659 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1662 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1664 field = TYPE_FIELDS (type);
1666 top = TYPE_LANG_SPECIFIC (type)->s->len;
1667 while (top - bot > 1)
1669 half = (top - bot + 1) >> 1;
1670 field = field_array[bot+half];
1672 if (DECL_NAME (field) == NULL_TREE)
1674 /* Step through all anon unions in linear fashion. */
1675 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1677 field = field_array[bot++];
1678 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1679 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1681 tree anon = lookup_field (field, component);
1684 return tree_cons (NULL_TREE, field, anon);
1688 /* Entire record is only anon unions. */
1692 /* Restart the binary search, with new lower bound. */
1696 if (DECL_NAME (field) == component)
1698 if (DECL_NAME (field) < component)
1704 if (DECL_NAME (field_array[bot]) == component)
1705 field = field_array[bot];
1706 else if (DECL_NAME (field) != component)
1711 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1713 if (DECL_NAME (field) == NULL_TREE
1714 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1715 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1717 tree anon = lookup_field (field, component);
1720 return tree_cons (NULL_TREE, field, anon);
1723 if (DECL_NAME (field) == component)
1727 if (field == NULL_TREE)
1731 return tree_cons (NULL_TREE, field, NULL_TREE);
1734 /* Make an expression to refer to the COMPONENT field of
1735 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1738 build_component_ref (tree datum, tree component)
1740 tree type = TREE_TYPE (datum);
1741 enum tree_code code = TREE_CODE (type);
1745 if (!objc_is_public (datum, component))
1746 return error_mark_node;
1748 /* See if there is a field or component with name COMPONENT. */
1750 if (code == RECORD_TYPE || code == UNION_TYPE)
1752 if (!COMPLETE_TYPE_P (type))
1754 c_incomplete_type_error (NULL_TREE, type);
1755 return error_mark_node;
1758 field = lookup_field (datum, component);
1762 error ("%qT has no member named %qE", type, component);
1763 return error_mark_node;
1766 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1767 This might be better solved in future the way the C++ front
1768 end does it - by giving the anonymous entities each a
1769 separate name and type, and then have build_component_ref
1770 recursively call itself. We can't do that here. */
1773 tree subdatum = TREE_VALUE (field);
1775 if (TREE_TYPE (subdatum) == error_mark_node)
1776 return error_mark_node;
1778 ref = build3 (COMPONENT_REF, TREE_TYPE (subdatum), datum, subdatum,
1780 if (TREE_READONLY (datum) || TREE_READONLY (subdatum))
1781 TREE_READONLY (ref) = 1;
1782 if (TREE_THIS_VOLATILE (datum) || TREE_THIS_VOLATILE (subdatum))
1783 TREE_THIS_VOLATILE (ref) = 1;
1785 if (TREE_DEPRECATED (subdatum))
1786 warn_deprecated_use (subdatum);
1790 field = TREE_CHAIN (field);
1796 else if (code != ERROR_MARK)
1797 error ("request for member %qE in something not a structure or union",
1800 return error_mark_node;
1803 /* Given an expression PTR for a pointer, return an expression
1804 for the value pointed to.
1805 ERRORSTRING is the name of the operator to appear in error messages. */
1808 build_indirect_ref (tree ptr, const char *errorstring)
1810 tree pointer = default_conversion (ptr);
1811 tree type = TREE_TYPE (pointer);
1813 if (TREE_CODE (type) == POINTER_TYPE)
1815 if (TREE_CODE (pointer) == ADDR_EXPR
1816 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
1817 == TREE_TYPE (type)))
1818 return TREE_OPERAND (pointer, 0);
1821 tree t = TREE_TYPE (type);
1824 ref = build1 (INDIRECT_REF, t, pointer);
1826 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
1828 error ("dereferencing pointer to incomplete type");
1829 return error_mark_node;
1831 if (VOID_TYPE_P (t) && skip_evaluation == 0)
1832 warning (0, "dereferencing %<void *%> pointer");
1834 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1835 so that we get the proper error message if the result is used
1836 to assign to. Also, &* is supposed to be a no-op.
1837 And ANSI C seems to specify that the type of the result
1838 should be the const type. */
1839 /* A de-reference of a pointer to const is not a const. It is valid
1840 to change it via some other pointer. */
1841 TREE_READONLY (ref) = TYPE_READONLY (t);
1842 TREE_SIDE_EFFECTS (ref)
1843 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
1844 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
1848 else if (TREE_CODE (pointer) != ERROR_MARK)
1849 error ("invalid type argument of %qs", errorstring);
1850 return error_mark_node;
1853 /* This handles expressions of the form "a[i]", which denotes
1856 This is logically equivalent in C to *(a+i), but we may do it differently.
1857 If A is a variable or a member, we generate a primitive ARRAY_REF.
1858 This avoids forcing the array out of registers, and can work on
1859 arrays that are not lvalues (for example, members of structures returned
1863 build_array_ref (tree array, tree index)
1865 bool swapped = false;
1866 if (TREE_TYPE (array) == error_mark_node
1867 || TREE_TYPE (index) == error_mark_node)
1868 return error_mark_node;
1870 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
1871 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
1874 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
1875 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
1877 error ("subscripted value is neither array nor pointer");
1878 return error_mark_node;
1886 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
1888 error ("array subscript is not an integer");
1889 return error_mark_node;
1892 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
1894 error ("subscripted value is pointer to function");
1895 return error_mark_node;
1898 /* ??? Existing practice has been to warn only when the char
1899 index is syntactically the index, not for char[array]. */
1901 warn_array_subscript_with_type_char (index);
1903 /* Apply default promotions *after* noticing character types. */
1904 index = default_conversion (index);
1906 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
1908 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
1912 /* An array that is indexed by a non-constant
1913 cannot be stored in a register; we must be able to do
1914 address arithmetic on its address.
1915 Likewise an array of elements of variable size. */
1916 if (TREE_CODE (index) != INTEGER_CST
1917 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
1918 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
1920 if (!c_mark_addressable (array))
1921 return error_mark_node;
1923 /* An array that is indexed by a constant value which is not within
1924 the array bounds cannot be stored in a register either; because we
1925 would get a crash in store_bit_field/extract_bit_field when trying
1926 to access a non-existent part of the register. */
1927 if (TREE_CODE (index) == INTEGER_CST
1928 && TYPE_DOMAIN (TREE_TYPE (array))
1929 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
1931 if (!c_mark_addressable (array))
1932 return error_mark_node;
1938 while (TREE_CODE (foo) == COMPONENT_REF)
1939 foo = TREE_OPERAND (foo, 0);
1940 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
1941 pedwarn ("ISO C forbids subscripting %<register%> array");
1942 else if (!flag_isoc99 && !lvalue_p (foo))
1943 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
1946 type = TREE_TYPE (TREE_TYPE (array));
1947 if (TREE_CODE (type) != ARRAY_TYPE)
1948 type = TYPE_MAIN_VARIANT (type);
1949 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
1950 /* Array ref is const/volatile if the array elements are
1951 or if the array is. */
1952 TREE_READONLY (rval)
1953 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
1954 | TREE_READONLY (array));
1955 TREE_SIDE_EFFECTS (rval)
1956 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1957 | TREE_SIDE_EFFECTS (array));
1958 TREE_THIS_VOLATILE (rval)
1959 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
1960 /* This was added by rms on 16 Nov 91.
1961 It fixes vol struct foo *a; a->elts[1]
1962 in an inline function.
1963 Hope it doesn't break something else. */
1964 | TREE_THIS_VOLATILE (array));
1965 return require_complete_type (fold (rval));
1969 tree ar = default_conversion (array);
1971 if (ar == error_mark_node)
1974 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
1975 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
1977 return build_indirect_ref (build_binary_op (PLUS_EXPR, ar, index, 0),
1982 /* Build an external reference to identifier ID. FUN indicates
1983 whether this will be used for a function call. LOC is the source
1984 location of the identifier. */
1986 build_external_ref (tree id, int fun, location_t loc)
1989 tree decl = lookup_name (id);
1991 /* In Objective-C, an instance variable (ivar) may be preferred to
1992 whatever lookup_name() found. */
1993 decl = objc_lookup_ivar (decl, id);
1995 if (decl && decl != error_mark_node)
1998 /* Implicit function declaration. */
1999 ref = implicitly_declare (id);
2000 else if (decl == error_mark_node)
2001 /* Don't complain about something that's already been
2002 complained about. */
2003 return error_mark_node;
2006 undeclared_variable (id, loc);
2007 return error_mark_node;
2010 if (TREE_TYPE (ref) == error_mark_node)
2011 return error_mark_node;
2013 if (TREE_DEPRECATED (ref))
2014 warn_deprecated_use (ref);
2016 if (!skip_evaluation)
2017 assemble_external (ref);
2018 TREE_USED (ref) = 1;
2020 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2022 if (!in_sizeof && !in_typeof)
2023 C_DECL_USED (ref) = 1;
2024 else if (DECL_INITIAL (ref) == 0
2025 && DECL_EXTERNAL (ref)
2026 && !TREE_PUBLIC (ref))
2027 record_maybe_used_decl (ref);
2030 if (TREE_CODE (ref) == CONST_DECL)
2032 ref = DECL_INITIAL (ref);
2033 TREE_CONSTANT (ref) = 1;
2034 TREE_INVARIANT (ref) = 1;
2036 else if (current_function_decl != 0
2037 && !DECL_FILE_SCOPE_P (current_function_decl)
2038 && (TREE_CODE (ref) == VAR_DECL
2039 || TREE_CODE (ref) == PARM_DECL
2040 || TREE_CODE (ref) == FUNCTION_DECL))
2042 tree context = decl_function_context (ref);
2044 if (context != 0 && context != current_function_decl)
2045 DECL_NONLOCAL (ref) = 1;
2051 /* Record details of decls possibly used inside sizeof or typeof. */
2052 struct maybe_used_decl
2056 /* The level seen at (in_sizeof + in_typeof). */
2058 /* The next one at this level or above, or NULL. */
2059 struct maybe_used_decl *next;
2062 static struct maybe_used_decl *maybe_used_decls;
2064 /* Record that DECL, an undefined static function reference seen
2065 inside sizeof or typeof, might be used if the operand of sizeof is
2066 a VLA type or the operand of typeof is a variably modified
2070 record_maybe_used_decl (tree decl)
2072 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2074 t->level = in_sizeof + in_typeof;
2075 t->next = maybe_used_decls;
2076 maybe_used_decls = t;
2079 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2080 USED is false, just discard them. If it is true, mark them used
2081 (if no longer inside sizeof or typeof) or move them to the next
2082 level up (if still inside sizeof or typeof). */
2085 pop_maybe_used (bool used)
2087 struct maybe_used_decl *p = maybe_used_decls;
2088 int cur_level = in_sizeof + in_typeof;
2089 while (p && p->level > cur_level)
2094 C_DECL_USED (p->decl) = 1;
2096 p->level = cur_level;
2100 if (!used || cur_level == 0)
2101 maybe_used_decls = p;
2104 /* Return the result of sizeof applied to EXPR. */
2107 c_expr_sizeof_expr (struct c_expr expr)
2110 if (expr.value == error_mark_node)
2112 ret.value = error_mark_node;
2113 ret.original_code = ERROR_MARK;
2114 pop_maybe_used (false);
2118 ret.value = c_sizeof (TREE_TYPE (expr.value));
2119 ret.original_code = ERROR_MARK;
2120 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr.value)));
2125 /* Return the result of sizeof applied to T, a structure for the type
2126 name passed to sizeof (rather than the type itself). */
2129 c_expr_sizeof_type (struct c_type_name *t)
2133 type = groktypename (t);
2134 ret.value = c_sizeof (type);
2135 ret.original_code = ERROR_MARK;
2136 pop_maybe_used (C_TYPE_VARIABLE_SIZE (type));
2140 /* Build a function call to function FUNCTION with parameters PARAMS.
2141 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2142 TREE_VALUE of each node is a parameter-expression.
2143 FUNCTION's data type may be a function type or a pointer-to-function. */
2146 build_function_call (tree function, tree params)
2148 tree fntype, fundecl = 0;
2149 tree coerced_params;
2150 tree name = NULL_TREE, result;
2153 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2154 STRIP_TYPE_NOPS (function);
2156 /* Convert anything with function type to a pointer-to-function. */
2157 if (TREE_CODE (function) == FUNCTION_DECL)
2159 /* Implement type-directed function overloading for builtins.
2160 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2161 handle all the type checking. The result is a complete expression
2162 that implements this function call. */
2163 tem = resolve_overloaded_builtin (function, params);
2167 name = DECL_NAME (function);
2170 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2171 function = function_to_pointer_conversion (function);
2173 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2174 expressions, like those used for ObjC messenger dispatches. */
2175 function = objc_rewrite_function_call (function, params);
2177 fntype = TREE_TYPE (function);
2179 if (TREE_CODE (fntype) == ERROR_MARK)
2180 return error_mark_node;
2182 if (!(TREE_CODE (fntype) == POINTER_TYPE
2183 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2185 error ("called object %qE is not a function", function);
2186 return error_mark_node;
2189 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2190 current_function_returns_abnormally = 1;
2192 /* fntype now gets the type of function pointed to. */
2193 fntype = TREE_TYPE (fntype);
2195 /* Check that the function is called through a compatible prototype.
2196 If it is not, replace the call by a trap, wrapped up in a compound
2197 expression if necessary. This has the nice side-effect to prevent
2198 the tree-inliner from generating invalid assignment trees which may
2199 blow up in the RTL expander later. */
2200 if ((TREE_CODE (function) == NOP_EXPR
2201 || TREE_CODE (function) == CONVERT_EXPR)
2202 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2203 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2204 && !comptypes (fntype, TREE_TYPE (tem)))
2206 tree return_type = TREE_TYPE (fntype);
2207 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2210 /* This situation leads to run-time undefined behavior. We can't,
2211 therefore, simply error unless we can prove that all possible
2212 executions of the program must execute the code. */
2213 warning (0, "function called through a non-compatible type");
2215 /* We can, however, treat "undefined" any way we please.
2216 Call abort to encourage the user to fix the program. */
2217 inform ("if this code is reached, the program will abort");
2219 if (VOID_TYPE_P (return_type))
2225 if (AGGREGATE_TYPE_P (return_type))
2226 rhs = build_compound_literal (return_type,
2227 build_constructor (return_type, 0));
2229 rhs = fold_convert (return_type, integer_zero_node);
2231 return build2 (COMPOUND_EXPR, return_type, trap, rhs);
2235 /* Convert the parameters to the types declared in the
2236 function prototype, or apply default promotions. */
2239 = convert_arguments (TYPE_ARG_TYPES (fntype), params, function, fundecl);
2241 if (coerced_params == error_mark_node)
2242 return error_mark_node;
2244 /* Check that the arguments to the function are valid. */
2246 check_function_arguments (TYPE_ATTRIBUTES (fntype), coerced_params,
2247 TYPE_ARG_TYPES (fntype));
2249 if (require_constant_value)
2251 result = fold_build3_initializer (CALL_EXPR, TREE_TYPE (fntype),
2252 function, coerced_params, NULL_TREE);
2254 if (TREE_CONSTANT (result)
2255 && (name == NULL_TREE
2256 || strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10) != 0))
2257 pedwarn_init ("initializer element is not constant");
2260 result = fold_build3 (CALL_EXPR, TREE_TYPE (fntype),
2261 function, coerced_params, NULL_TREE);
2263 if (VOID_TYPE_P (TREE_TYPE (result)))
2265 return require_complete_type (result);
2268 /* Convert the argument expressions in the list VALUES
2269 to the types in the list TYPELIST. The result is a list of converted
2270 argument expressions, unless there are too few arguments in which
2271 case it is error_mark_node.
2273 If TYPELIST is exhausted, or when an element has NULL as its type,
2274 perform the default conversions.
2276 PARMLIST is the chain of parm decls for the function being called.
2277 It may be 0, if that info is not available.
2278 It is used only for generating error messages.
2280 FUNCTION is a tree for the called function. It is used only for
2281 error messages, where it is formatted with %qE.
2283 This is also where warnings about wrong number of args are generated.
2285 Both VALUES and the returned value are chains of TREE_LIST nodes
2286 with the elements of the list in the TREE_VALUE slots of those nodes. */
2289 convert_arguments (tree typelist, tree values, tree function, tree fundecl)
2291 tree typetail, valtail;
2296 /* Change pointer to function to the function itself for
2298 if (TREE_CODE (function) == ADDR_EXPR
2299 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2300 function = TREE_OPERAND (function, 0);
2302 /* Handle an ObjC selector specially for diagnostics. */
2303 selector = objc_message_selector ();
2305 /* Scan the given expressions and types, producing individual
2306 converted arguments and pushing them on RESULT in reverse order. */
2308 for (valtail = values, typetail = typelist, parmnum = 0;
2310 valtail = TREE_CHAIN (valtail), parmnum++)
2312 tree type = typetail ? TREE_VALUE (typetail) : 0;
2313 tree val = TREE_VALUE (valtail);
2314 tree rname = function;
2315 int argnum = parmnum + 1;
2316 const char *invalid_func_diag;
2318 if (type == void_type_node)
2320 error ("too many arguments to function %qE", function);
2324 if (selector && argnum > 2)
2330 STRIP_TYPE_NOPS (val);
2332 val = require_complete_type (val);
2336 /* Formal parm type is specified by a function prototype. */
2339 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2341 error ("type of formal parameter %d is incomplete", parmnum + 1);
2346 /* Optionally warn about conversions that
2347 differ from the default conversions. */
2348 if (warn_conversion || warn_traditional)
2350 unsigned int formal_prec = TYPE_PRECISION (type);
2352 if (INTEGRAL_TYPE_P (type)
2353 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2354 warning (0, "passing argument %d of %qE as integer "
2355 "rather than floating due to prototype",
2357 if (INTEGRAL_TYPE_P (type)
2358 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2359 warning (0, "passing argument %d of %qE as integer "
2360 "rather than complex due to prototype",
2362 else if (TREE_CODE (type) == COMPLEX_TYPE
2363 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2364 warning (0, "passing argument %d of %qE as complex "
2365 "rather than floating due to prototype",
2367 else if (TREE_CODE (type) == REAL_TYPE
2368 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2369 warning (0, "passing argument %d of %qE as floating "
2370 "rather than integer due to prototype",
2372 else if (TREE_CODE (type) == COMPLEX_TYPE
2373 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2374 warning (0, "passing argument %d of %qE as complex "
2375 "rather than integer due to prototype",
2377 else if (TREE_CODE (type) == REAL_TYPE
2378 && TREE_CODE (TREE_TYPE (val)) == COMPLEX_TYPE)
2379 warning (0, "passing argument %d of %qE as floating "
2380 "rather than complex due to prototype",
2382 /* ??? At some point, messages should be written about
2383 conversions between complex types, but that's too messy
2385 else if (TREE_CODE (type) == REAL_TYPE
2386 && TREE_CODE (TREE_TYPE (val)) == REAL_TYPE)
2388 /* Warn if any argument is passed as `float',
2389 since without a prototype it would be `double'. */
2390 if (formal_prec == TYPE_PRECISION (float_type_node)
2391 && type != dfloat32_type_node)
2392 warning (0, "passing argument %d of %qE as %<float%> "
2393 "rather than %<double%> due to prototype",
2396 /* Warn if mismatch between argument and prototype
2397 for decimal float types. Warn of conversions with
2398 binary float types and of precision narrowing due to
2400 else if (type != TREE_TYPE (val)
2401 && (type == dfloat32_type_node
2402 || type == dfloat64_type_node
2403 || type == dfloat128_type_node
2404 || TREE_TYPE (val) == dfloat32_type_node
2405 || TREE_TYPE (val) == dfloat64_type_node
2406 || TREE_TYPE (val) == dfloat128_type_node)
2408 <= TYPE_PRECISION (TREE_TYPE (val))
2409 || (type == dfloat128_type_node
2411 != dfloat64_type_node
2413 != dfloat32_type_node)))
2414 || (type == dfloat64_type_node
2416 != dfloat32_type_node))))
2417 warning (0, "passing argument %d of %qE as %qT "
2418 "rather than %qT due to prototype",
2419 argnum, rname, type, TREE_TYPE (val));
2422 /* Detect integer changing in width or signedness.
2423 These warnings are only activated with
2424 -Wconversion, not with -Wtraditional. */
2425 else if (warn_conversion && INTEGRAL_TYPE_P (type)
2426 && INTEGRAL_TYPE_P (TREE_TYPE (val)))
2428 tree would_have_been = default_conversion (val);
2429 tree type1 = TREE_TYPE (would_have_been);
2431 if (TREE_CODE (type) == ENUMERAL_TYPE
2432 && (TYPE_MAIN_VARIANT (type)
2433 == TYPE_MAIN_VARIANT (TREE_TYPE (val))))
2434 /* No warning if function asks for enum
2435 and the actual arg is that enum type. */
2437 else if (formal_prec != TYPE_PRECISION (type1))
2438 warning (OPT_Wconversion, "passing argument %d of %qE "
2439 "with different width due to prototype",
2441 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2443 /* Don't complain if the formal parameter type
2444 is an enum, because we can't tell now whether
2445 the value was an enum--even the same enum. */
2446 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2448 else if (TREE_CODE (val) == INTEGER_CST
2449 && int_fits_type_p (val, type))
2450 /* Change in signedness doesn't matter
2451 if a constant value is unaffected. */
2453 /* If the value is extended from a narrower
2454 unsigned type, it doesn't matter whether we
2455 pass it as signed or unsigned; the value
2456 certainly is the same either way. */
2457 else if (TYPE_PRECISION (TREE_TYPE (val)) < TYPE_PRECISION (type)
2458 && TYPE_UNSIGNED (TREE_TYPE (val)))
2460 else if (TYPE_UNSIGNED (type))
2461 warning (OPT_Wconversion, "passing argument %d of %qE "
2462 "as unsigned due to prototype",
2465 warning (OPT_Wconversion, "passing argument %d of %qE "
2466 "as signed due to prototype", argnum, rname);
2470 parmval = convert_for_assignment (type, val, ic_argpass,
2474 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2475 && INTEGRAL_TYPE_P (type)
2476 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2477 parmval = default_conversion (parmval);
2479 result = tree_cons (NULL_TREE, parmval, result);
2481 else if (TREE_CODE (TREE_TYPE (val)) == REAL_TYPE
2482 && (TYPE_PRECISION (TREE_TYPE (val))
2483 < TYPE_PRECISION (double_type_node))
2484 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val))))
2485 /* Convert `float' to `double'. */
2486 result = tree_cons (NULL_TREE, convert (double_type_node, val), result);
2487 else if ((invalid_func_diag =
2488 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2490 error (invalid_func_diag);
2491 return error_mark_node;
2494 /* Convert `short' and `char' to full-size `int'. */
2495 result = tree_cons (NULL_TREE, default_conversion (val), result);
2498 typetail = TREE_CHAIN (typetail);
2501 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2503 error ("too few arguments to function %qE", function);
2504 return error_mark_node;
2507 return nreverse (result);
2510 /* This is the entry point used by the parser to build unary operators
2511 in the input. CODE, a tree_code, specifies the unary operator, and
2512 ARG is the operand. For unary plus, the C parser currently uses
2513 CONVERT_EXPR for code. */
2516 parser_build_unary_op (enum tree_code code, struct c_expr arg)
2518 struct c_expr result;
2520 result.original_code = ERROR_MARK;
2521 result.value = build_unary_op (code, arg.value, 0);
2522 overflow_warning (result.value);
2526 /* This is the entry point used by the parser to build binary operators
2527 in the input. CODE, a tree_code, specifies the binary operator, and
2528 ARG1 and ARG2 are the operands. In addition to constructing the
2529 expression, we check for operands that were written with other binary
2530 operators in a way that is likely to confuse the user. */
2533 parser_build_binary_op (enum tree_code code, struct c_expr arg1,
2536 struct c_expr result;
2538 enum tree_code code1 = arg1.original_code;
2539 enum tree_code code2 = arg2.original_code;
2541 result.value = build_binary_op (code, arg1.value, arg2.value, 1);
2542 result.original_code = code;
2544 if (TREE_CODE (result.value) == ERROR_MARK)
2547 /* Check for cases such as x+y<<z which users are likely
2549 if (warn_parentheses)
2551 if (code == LSHIFT_EXPR || code == RSHIFT_EXPR)
2553 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2554 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2555 warning (OPT_Wparentheses,
2556 "suggest parentheses around + or - inside shift");
2559 if (code == TRUTH_ORIF_EXPR)
2561 if (code1 == TRUTH_ANDIF_EXPR
2562 || code2 == TRUTH_ANDIF_EXPR)
2563 warning (OPT_Wparentheses,
2564 "suggest parentheses around && within ||");
2567 if (code == BIT_IOR_EXPR)
2569 if (code1 == BIT_AND_EXPR || code1 == BIT_XOR_EXPR
2570 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2571 || code2 == BIT_AND_EXPR || code2 == BIT_XOR_EXPR
2572 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2573 warning (OPT_Wparentheses,
2574 "suggest parentheses around arithmetic in operand of |");
2575 /* Check cases like x|y==z */
2576 if (TREE_CODE_CLASS (code1) == tcc_comparison
2577 || TREE_CODE_CLASS (code2) == tcc_comparison)
2578 warning (OPT_Wparentheses,
2579 "suggest parentheses around comparison in operand of |");
2582 if (code == BIT_XOR_EXPR)
2584 if (code1 == BIT_AND_EXPR
2585 || code1 == PLUS_EXPR || code1 == MINUS_EXPR
2586 || code2 == BIT_AND_EXPR
2587 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2588 warning (OPT_Wparentheses,
2589 "suggest parentheses around arithmetic in operand of ^");
2590 /* Check cases like x^y==z */
2591 if (TREE_CODE_CLASS (code1) == tcc_comparison
2592 || TREE_CODE_CLASS (code2) == tcc_comparison)
2593 warning (OPT_Wparentheses,
2594 "suggest parentheses around comparison in operand of ^");
2597 if (code == BIT_AND_EXPR)
2599 if (code1 == PLUS_EXPR || code1 == MINUS_EXPR
2600 || code2 == PLUS_EXPR || code2 == MINUS_EXPR)
2601 warning (OPT_Wparentheses,
2602 "suggest parentheses around + or - in operand of &");
2603 /* Check cases like x&y==z */
2604 if (TREE_CODE_CLASS (code1) == tcc_comparison
2605 || TREE_CODE_CLASS (code2) == tcc_comparison)
2606 warning (OPT_Wparentheses,
2607 "suggest parentheses around comparison in operand of &");
2609 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
2610 if (TREE_CODE_CLASS (code) == tcc_comparison
2611 && (TREE_CODE_CLASS (code1) == tcc_comparison
2612 || TREE_CODE_CLASS (code2) == tcc_comparison))
2613 warning (OPT_Wparentheses, "comparisons like X<=Y<=Z do not "
2614 "have their mathematical meaning");
2618 /* Warn about comparisons against string literals, with the exception
2619 of testing for equality or inequality of a string literal with NULL. */
2620 if (code == EQ_EXPR || code == NE_EXPR)
2622 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2623 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2624 warning (OPT_Wstring_literal_comparison,
2625 "comparison with string literal");
2627 else if (TREE_CODE_CLASS (code) == tcc_comparison
2628 && (code1 == STRING_CST || code2 == STRING_CST))
2629 warning (OPT_Wstring_literal_comparison,
2630 "comparison with string literal");
2632 unsigned_conversion_warning (result.value, arg1.value);
2633 unsigned_conversion_warning (result.value, arg2.value);
2634 overflow_warning (result.value);
2639 /* Return a tree for the difference of pointers OP0 and OP1.
2640 The resulting tree has type int. */
2643 pointer_diff (tree op0, tree op1)
2645 tree restype = ptrdiff_type_node;
2647 tree target_type = TREE_TYPE (TREE_TYPE (op0));
2648 tree con0, con1, lit0, lit1;
2649 tree orig_op1 = op1;
2651 if (pedantic || warn_pointer_arith)
2653 if (TREE_CODE (target_type) == VOID_TYPE)
2654 pedwarn ("pointer of type %<void *%> used in subtraction");
2655 if (TREE_CODE (target_type) == FUNCTION_TYPE)
2656 pedwarn ("pointer to a function used in subtraction");
2659 /* If the conversion to ptrdiff_type does anything like widening or
2660 converting a partial to an integral mode, we get a convert_expression
2661 that is in the way to do any simplifications.
2662 (fold-const.c doesn't know that the extra bits won't be needed.
2663 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2664 different mode in place.)
2665 So first try to find a common term here 'by hand'; we want to cover
2666 at least the cases that occur in legal static initializers. */
2667 if ((TREE_CODE (op0) == NOP_EXPR || TREE_CODE (op0) == CONVERT_EXPR)
2668 && (TYPE_PRECISION (TREE_TYPE (op0))
2669 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
2670 con0 = TREE_OPERAND (op0, 0);
2673 if ((TREE_CODE (op1) == NOP_EXPR || TREE_CODE (op1) == CONVERT_EXPR)
2674 && (TYPE_PRECISION (TREE_TYPE (op1))
2675 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
2676 con1 = TREE_OPERAND (op1, 0);
2680 if (TREE_CODE (con0) == PLUS_EXPR)
2682 lit0 = TREE_OPERAND (con0, 1);
2683 con0 = TREE_OPERAND (con0, 0);
2686 lit0 = integer_zero_node;
2688 if (TREE_CODE (con1) == PLUS_EXPR)
2690 lit1 = TREE_OPERAND (con1, 1);
2691 con1 = TREE_OPERAND (con1, 0);
2694 lit1 = integer_zero_node;
2696 if (operand_equal_p (con0, con1, 0))
2703 /* First do the subtraction as integers;
2704 then drop through to build the divide operator.
2705 Do not do default conversions on the minus operator
2706 in case restype is a short type. */
2708 op0 = build_binary_op (MINUS_EXPR, convert (restype, op0),
2709 convert (restype, op1), 0);
2710 /* This generates an error if op1 is pointer to incomplete type. */
2711 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
2712 error ("arithmetic on pointer to an incomplete type");
2714 /* This generates an error if op0 is pointer to incomplete type. */
2715 op1 = c_size_in_bytes (target_type);
2717 /* Divide by the size, in easiest possible way. */
2718 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
2721 /* Construct and perhaps optimize a tree representation
2722 for a unary operation. CODE, a tree_code, specifies the operation
2723 and XARG is the operand.
2724 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2725 the default promotions (such as from short to int).
2726 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2727 allows non-lvalues; this is only used to handle conversion of non-lvalue
2728 arrays to pointers in C99. */
2731 build_unary_op (enum tree_code code, tree xarg, int flag)
2733 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2736 enum tree_code typecode = TREE_CODE (TREE_TYPE (arg));
2738 int noconvert = flag;
2739 const char *invalid_op_diag;
2741 if (typecode == ERROR_MARK)
2742 return error_mark_node;
2743 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
2744 typecode = INTEGER_TYPE;
2746 if ((invalid_op_diag
2747 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
2749 error (invalid_op_diag);
2750 return error_mark_node;
2756 /* This is used for unary plus, because a CONVERT_EXPR
2757 is enough to prevent anybody from looking inside for
2758 associativity, but won't generate any code. */
2759 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2760 || typecode == COMPLEX_TYPE
2761 || typecode == VECTOR_TYPE))
2763 error ("wrong type argument to unary plus");
2764 return error_mark_node;
2766 else if (!noconvert)
2767 arg = default_conversion (arg);
2768 arg = non_lvalue (arg);
2772 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2773 || typecode == COMPLEX_TYPE
2774 || typecode == VECTOR_TYPE))
2776 error ("wrong type argument to unary minus");
2777 return error_mark_node;
2779 else if (!noconvert)
2780 arg = default_conversion (arg);
2784 if (typecode == INTEGER_TYPE || typecode == VECTOR_TYPE)
2787 arg = default_conversion (arg);
2789 else if (typecode == COMPLEX_TYPE)
2793 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2795 arg = default_conversion (arg);
2799 error ("wrong type argument to bit-complement");
2800 return error_mark_node;
2805 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
2807 error ("wrong type argument to abs");
2808 return error_mark_node;
2810 else if (!noconvert)
2811 arg = default_conversion (arg);
2815 /* Conjugating a real value is a no-op, but allow it anyway. */
2816 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
2817 || typecode == COMPLEX_TYPE))
2819 error ("wrong type argument to conjugation");
2820 return error_mark_node;
2822 else if (!noconvert)
2823 arg = default_conversion (arg);
2826 case TRUTH_NOT_EXPR:
2827 if (typecode != INTEGER_TYPE
2828 && typecode != REAL_TYPE && typecode != POINTER_TYPE
2829 && typecode != COMPLEX_TYPE)
2831 error ("wrong type argument to unary exclamation mark");
2832 return error_mark_node;
2834 arg = c_objc_common_truthvalue_conversion (arg);
2835 return invert_truthvalue (arg);
2838 if (TREE_CODE (arg) == COMPLEX_CST)
2839 return TREE_REALPART (arg);
2840 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2841 return fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2846 if (TREE_CODE (arg) == COMPLEX_CST)
2847 return TREE_IMAGPART (arg);
2848 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
2849 return fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
2851 return convert (TREE_TYPE (arg), integer_zero_node);
2853 case PREINCREMENT_EXPR:
2854 case POSTINCREMENT_EXPR:
2855 case PREDECREMENT_EXPR:
2856 case POSTDECREMENT_EXPR:
2858 /* Increment or decrement the real part of the value,
2859 and don't change the imaginary part. */
2860 if (typecode == COMPLEX_TYPE)
2865 pedwarn ("ISO C does not support %<++%> and %<--%>"
2866 " on complex types");
2868 arg = stabilize_reference (arg);
2869 real = build_unary_op (REALPART_EXPR, arg, 1);
2870 imag = build_unary_op (IMAGPART_EXPR, arg, 1);
2871 return build2 (COMPLEX_EXPR, TREE_TYPE (arg),
2872 build_unary_op (code, real, 1), imag);
2875 /* Report invalid types. */
2877 if (typecode != POINTER_TYPE
2878 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
2880 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2881 error ("wrong type argument to increment");
2883 error ("wrong type argument to decrement");
2885 return error_mark_node;
2890 tree result_type = TREE_TYPE (arg);
2892 arg = get_unwidened (arg, 0);
2893 argtype = TREE_TYPE (arg);
2895 /* Compute the increment. */
2897 if (typecode == POINTER_TYPE)
2899 /* If pointer target is an undefined struct,
2900 we just cannot know how to do the arithmetic. */
2901 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type)))
2903 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2904 error ("increment of pointer to unknown structure");
2906 error ("decrement of pointer to unknown structure");
2908 else if ((pedantic || warn_pointer_arith)
2909 && (TREE_CODE (TREE_TYPE (result_type)) == FUNCTION_TYPE
2910 || TREE_CODE (TREE_TYPE (result_type)) == VOID_TYPE))
2912 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
2913 pedwarn ("wrong type argument to increment");
2915 pedwarn ("wrong type argument to decrement");
2918 inc = c_size_in_bytes (TREE_TYPE (result_type));
2921 inc = integer_one_node;
2923 inc = convert (argtype, inc);
2925 /* Complain about anything else that is not a true lvalue. */
2926 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
2927 || code == POSTINCREMENT_EXPR)
2930 return error_mark_node;
2932 /* Report a read-only lvalue. */
2933 if (TREE_READONLY (arg))
2934 readonly_error (arg,
2935 ((code == PREINCREMENT_EXPR
2936 || code == POSTINCREMENT_EXPR)
2937 ? lv_increment : lv_decrement));
2939 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
2940 val = boolean_increment (code, arg);
2942 val = build2 (code, TREE_TYPE (arg), arg, inc);
2943 TREE_SIDE_EFFECTS (val) = 1;
2944 val = convert (result_type, val);
2945 if (TREE_CODE (val) != code)
2946 TREE_NO_WARNING (val) = 1;
2951 /* Note that this operation never does default_conversion. */
2953 /* Let &* cancel out to simplify resulting code. */
2954 if (TREE_CODE (arg) == INDIRECT_REF)
2956 /* Don't let this be an lvalue. */
2957 if (lvalue_p (TREE_OPERAND (arg, 0)))
2958 return non_lvalue (TREE_OPERAND (arg, 0));
2959 return TREE_OPERAND (arg, 0);
2962 /* For &x[y], return x+y */
2963 if (TREE_CODE (arg) == ARRAY_REF)
2965 tree op0 = TREE_OPERAND (arg, 0);
2966 if (!c_mark_addressable (op0))
2967 return error_mark_node;
2968 return build_binary_op (PLUS_EXPR,
2969 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
2970 ? array_to_pointer_conversion (op0)
2972 TREE_OPERAND (arg, 1), 1);
2975 /* Anything not already handled and not a true memory reference
2976 or a non-lvalue array is an error. */
2977 else if (typecode != FUNCTION_TYPE && !flag
2978 && !lvalue_or_else (arg, lv_addressof))
2979 return error_mark_node;
2981 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
2982 argtype = TREE_TYPE (arg);
2984 /* If the lvalue is const or volatile, merge that into the type
2985 to which the address will point. Note that you can't get a
2986 restricted pointer by taking the address of something, so we
2987 only have to deal with `const' and `volatile' here. */
2988 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
2989 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
2990 argtype = c_build_type_variant (argtype,
2991 TREE_READONLY (arg),
2992 TREE_THIS_VOLATILE (arg));
2994 if (!c_mark_addressable (arg))
2995 return error_mark_node;
2997 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
2998 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3000 argtype = build_pointer_type (argtype);
3002 /* ??? Cope with user tricks that amount to offsetof. Delete this
3003 when we have proper support for integer constant expressions. */
3004 val = get_base_address (arg);
3005 if (val && TREE_CODE (val) == INDIRECT_REF
3006 && integer_zerop (TREE_OPERAND (val, 0)))
3007 return fold_convert (argtype, fold_offsetof (arg));
3009 val = build1 (ADDR_EXPR, argtype, arg);
3018 argtype = TREE_TYPE (arg);
3019 return require_constant_value ? fold_build1_initializer (code, argtype, arg)
3020 : fold_build1 (code, argtype, arg);
3023 /* Return nonzero if REF is an lvalue valid for this language.
3024 Lvalues can be assigned, unless their type has TYPE_READONLY.
3025 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3030 enum tree_code code = TREE_CODE (ref);
3037 return lvalue_p (TREE_OPERAND (ref, 0));
3039 case COMPOUND_LITERAL_EXPR:
3049 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3050 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3053 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3060 /* Give an error for storing in something that is 'const'. */
3063 readonly_error (tree arg, enum lvalue_use use)
3065 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3067 /* Using this macro rather than (for example) arrays of messages
3068 ensures that all the format strings are checked at compile
3070 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3071 : (use == lv_increment ? (I) \
3072 : (use == lv_decrement ? (D) : (AS))))
3073 if (TREE_CODE (arg) == COMPONENT_REF)
3075 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3076 readonly_error (TREE_OPERAND (arg, 0), use);
3078 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3079 G_("increment of read-only member %qD"),
3080 G_("decrement of read-only member %qD"),
3081 G_("read-only member %qD used as %<asm%> output")),
3082 TREE_OPERAND (arg, 1));
3084 else if (TREE_CODE (arg) == VAR_DECL)
3085 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3086 G_("increment of read-only variable %qD"),
3087 G_("decrement of read-only variable %qD"),
3088 G_("read-only variable %qD used as %<asm%> output")),
3091 error (READONLY_MSG (G_("assignment of read-only location"),
3092 G_("increment of read-only location"),
3093 G_("decrement of read-only location"),
3094 G_("read-only location used as %<asm%> output")));
3098 /* Return nonzero if REF is an lvalue valid for this language;
3099 otherwise, print an error message and return zero. USE says
3100 how the lvalue is being used and so selects the error message. */
3103 lvalue_or_else (tree ref, enum lvalue_use use)
3105 int win = lvalue_p (ref);
3113 /* Mark EXP saying that we need to be able to take the
3114 address of it; it should not be allocated in a register.
3115 Returns true if successful. */
3118 c_mark_addressable (tree exp)
3123 switch (TREE_CODE (x))
3126 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3129 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3133 /* ... fall through ... */
3139 x = TREE_OPERAND (x, 0);
3142 case COMPOUND_LITERAL_EXPR:
3144 TREE_ADDRESSABLE (x) = 1;
3151 if (C_DECL_REGISTER (x)
3152 && DECL_NONLOCAL (x))
3154 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3157 ("global register variable %qD used in nested function", x);
3160 pedwarn ("register variable %qD used in nested function", x);
3162 else if (C_DECL_REGISTER (x))
3164 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3165 error ("address of global register variable %qD requested", x);
3167 error ("address of register variable %qD requested", x);
3173 TREE_ADDRESSABLE (x) = 1;
3180 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3183 build_conditional_expr (tree ifexp, tree op1, tree op2)
3187 enum tree_code code1;
3188 enum tree_code code2;
3189 tree result_type = NULL;
3190 tree orig_op1 = op1, orig_op2 = op2;
3192 /* Promote both alternatives. */
3194 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3195 op1 = default_conversion (op1);
3196 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3197 op2 = default_conversion (op2);
3199 if (TREE_CODE (ifexp) == ERROR_MARK
3200 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3201 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3202 return error_mark_node;
3204 type1 = TREE_TYPE (op1);
3205 code1 = TREE_CODE (type1);
3206 type2 = TREE_TYPE (op2);
3207 code2 = TREE_CODE (type2);
3209 /* C90 does not permit non-lvalue arrays in conditional expressions.
3210 In C99 they will be pointers by now. */
3211 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3213 error ("non-lvalue array in conditional expression");
3214 return error_mark_node;
3217 /* Quickly detect the usual case where op1 and op2 have the same type
3219 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3222 result_type = type1;
3224 result_type = TYPE_MAIN_VARIANT (type1);
3226 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3227 || code1 == COMPLEX_TYPE)
3228 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3229 || code2 == COMPLEX_TYPE))
3231 result_type = c_common_type (type1, type2);
3233 /* If -Wsign-compare, warn here if type1 and type2 have
3234 different signedness. We'll promote the signed to unsigned
3235 and later code won't know it used to be different.
3236 Do this check on the original types, so that explicit casts
3237 will be considered, but default promotions won't. */
3238 if (warn_sign_compare && !skip_evaluation)
3240 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3241 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3243 if (unsigned_op1 ^ unsigned_op2)
3245 /* Do not warn if the result type is signed, since the
3246 signed type will only be chosen if it can represent
3247 all the values of the unsigned type. */
3248 if (!TYPE_UNSIGNED (result_type))
3250 /* Do not warn if the signed quantity is an unsuffixed
3251 integer literal (or some static constant expression
3252 involving such literals) and it is non-negative. */
3253 else if ((unsigned_op2 && tree_expr_nonnegative_p (op1))
3254 || (unsigned_op1 && tree_expr_nonnegative_p (op2)))
3257 warning (0, "signed and unsigned type in conditional expression");
3261 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3263 if (pedantic && (code1 != VOID_TYPE || code2 != VOID_TYPE))
3264 pedwarn ("ISO C forbids conditional expr with only one void side");
3265 result_type = void_type_node;
3267 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3269 if (comp_target_types (type1, type2))
3270 result_type = common_pointer_type (type1, type2);
3271 else if (null_pointer_constant_p (orig_op1))
3272 result_type = qualify_type (type2, type1);
3273 else if (null_pointer_constant_p (orig_op2))
3274 result_type = qualify_type (type1, type2);
3275 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3277 if (pedantic && TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3278 pedwarn ("ISO C forbids conditional expr between "
3279 "%<void *%> and function pointer");
3280 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3281 TREE_TYPE (type2)));
3283 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3285 if (pedantic && TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3286 pedwarn ("ISO C forbids conditional expr between "
3287 "%<void *%> and function pointer");
3288 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3289 TREE_TYPE (type1)));
3293 pedwarn ("pointer type mismatch in conditional expression");
3294 result_type = build_pointer_type (void_type_node);
3297 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3299 if (!null_pointer_constant_p (orig_op2))
3300 pedwarn ("pointer/integer type mismatch in conditional expression");
3303 op2 = null_pointer_node;
3305 result_type = type1;
3307 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3309 if (!null_pointer_constant_p (orig_op1))
3310 pedwarn ("pointer/integer type mismatch in conditional expression");
3313 op1 = null_pointer_node;
3315 result_type = type2;
3320 if (flag_cond_mismatch)
3321 result_type = void_type_node;
3324 error ("type mismatch in conditional expression");
3325 return error_mark_node;
3329 /* Merge const and volatile flags of the incoming types. */
3331 = build_type_variant (result_type,
3332 TREE_READONLY (op1) || TREE_READONLY (op2),
3333 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3335 if (result_type != TREE_TYPE (op1))
3336 op1 = convert_and_check (result_type, op1);
3337 if (result_type != TREE_TYPE (op2))
3338 op2 = convert_and_check (result_type, op2);
3340 return fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3343 /* Return a compound expression that performs two expressions and
3344 returns the value of the second of them. */
3347 build_compound_expr (tree expr1, tree expr2)
3349 if (!TREE_SIDE_EFFECTS (expr1))
3351 /* The left-hand operand of a comma expression is like an expression
3352 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3353 any side-effects, unless it was explicitly cast to (void). */
3354 if (warn_unused_value)
3356 if (VOID_TYPE_P (TREE_TYPE (expr1))
3357 && (TREE_CODE (expr1) == NOP_EXPR
3358 || TREE_CODE (expr1) == CONVERT_EXPR))
3360 else if (VOID_TYPE_P (TREE_TYPE (expr1))
3361 && TREE_CODE (expr1) == COMPOUND_EXPR
3362 && (TREE_CODE (TREE_OPERAND (expr1, 1)) == CONVERT_EXPR
3363 || TREE_CODE (TREE_OPERAND (expr1, 1)) == NOP_EXPR))
3364 ; /* (void) a, (void) b, c */
3366 warning (0, "left-hand operand of comma expression has no effect");
3370 /* With -Wunused, we should also warn if the left-hand operand does have
3371 side-effects, but computes a value which is not used. For example, in
3372 `foo() + bar(), baz()' the result of the `+' operator is not used,
3373 so we should issue a warning. */
3374 else if (warn_unused_value)
3375 warn_if_unused_value (expr1, input_location);
3377 return build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
3380 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3383 build_c_cast (tree type, tree expr)
3387 if (type == error_mark_node || expr == error_mark_node)
3388 return error_mark_node;
3390 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3391 only in <protocol> qualifications. But when constructing cast expressions,
3392 the protocols do matter and must be kept around. */
3393 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
3394 return build1 (NOP_EXPR, type, expr);
3396 type = TYPE_MAIN_VARIANT (type);
3398 if (TREE_CODE (type) == ARRAY_TYPE)
3400 error ("cast specifies array type");
3401 return error_mark_node;
3404 if (TREE_CODE (type) == FUNCTION_TYPE)
3406 error ("cast specifies function type");
3407 return error_mark_node;
3410 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
3414 if (TREE_CODE (type) == RECORD_TYPE
3415 || TREE_CODE (type) == UNION_TYPE)
3416 pedwarn ("ISO C forbids casting nonscalar to the same type");
3419 else if (TREE_CODE (type) == UNION_TYPE)
3423 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
3424 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
3425 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
3433 pedwarn ("ISO C forbids casts to union type");
3434 t = digest_init (type,
3435 build_constructor_single (type, field, value),
3437 TREE_CONSTANT (t) = TREE_CONSTANT (value);
3438 TREE_INVARIANT (t) = TREE_INVARIANT (value);
3441 error ("cast to union type from type not present in union");
3442 return error_mark_node;
3448 if (type == void_type_node)
3449 return build1 (CONVERT_EXPR, type, value);
3451 otype = TREE_TYPE (value);
3453 /* Optionally warn about potentially worrisome casts. */
3456 && TREE_CODE (type) == POINTER_TYPE
3457 && TREE_CODE (otype) == POINTER_TYPE)
3459 tree in_type = type;
3460 tree in_otype = otype;
3464 /* Check that the qualifiers on IN_TYPE are a superset of
3465 the qualifiers of IN_OTYPE. The outermost level of
3466 POINTER_TYPE nodes is uninteresting and we stop as soon
3467 as we hit a non-POINTER_TYPE node on either type. */
3470 in_otype = TREE_TYPE (in_otype);
3471 in_type = TREE_TYPE (in_type);
3473 /* GNU C allows cv-qualified function types. 'const'
3474 means the function is very pure, 'volatile' means it
3475 can't return. We need to warn when such qualifiers
3476 are added, not when they're taken away. */
3477 if (TREE_CODE (in_otype) == FUNCTION_TYPE
3478 && TREE_CODE (in_type) == FUNCTION_TYPE)
3479 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
3481 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
3483 while (TREE_CODE (in_type) == POINTER_TYPE
3484 && TREE_CODE (in_otype) == POINTER_TYPE);
3487 warning (0, "cast adds new qualifiers to function type");
3490 /* There are qualifiers present in IN_OTYPE that are not
3491 present in IN_TYPE. */
3492 warning (0, "cast discards qualifiers from pointer target type");
3495 /* Warn about possible alignment problems. */
3496 if (STRICT_ALIGNMENT
3497 && TREE_CODE (type) == POINTER_TYPE
3498 && TREE_CODE (otype) == POINTER_TYPE
3499 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
3500 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3501 /* Don't warn about opaque types, where the actual alignment
3502 restriction is unknown. */
3503 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
3504 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
3505 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
3506 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
3507 warning (OPT_Wcast_align,
3508 "cast increases required alignment of target type");
3510 if (TREE_CODE (type) == INTEGER_TYPE
3511 && TREE_CODE (otype) == POINTER_TYPE
3512 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
3513 /* Unlike conversion of integers to pointers, where the
3514 warning is disabled for converting constants because
3515 of cases such as SIG_*, warn about converting constant
3516 pointers to integers. In some cases it may cause unwanted
3517 sign extension, and a warning is appropriate. */
3518 warning (OPT_Wpointer_to_int_cast,
3519 "cast from pointer to integer of different size");
3521 if (TREE_CODE (value) == CALL_EXPR
3522 && TREE_CODE (type) != TREE_CODE (otype))
3523 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
3524 "to non-matching type %qT", otype, type);
3526 if (TREE_CODE (type) == POINTER_TYPE
3527 && TREE_CODE (otype) == INTEGER_TYPE
3528 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
3529 /* Don't warn about converting any constant. */
3530 && !TREE_CONSTANT (value))
3531 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
3532 "of different size");
3534 strict_aliasing_warning (otype, type, expr);
3536 /* If pedantic, warn for conversions between function and object
3537 pointer types, except for converting a null pointer constant
3538 to function pointer type. */
3540 && TREE_CODE (type) == POINTER_TYPE
3541 && TREE_CODE (otype) == POINTER_TYPE
3542 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
3543 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
3544 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3547 && TREE_CODE (type) == POINTER_TYPE
3548 && TREE_CODE (otype) == POINTER_TYPE
3549 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
3550 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
3551 && !null_pointer_constant_p (value))
3552 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3555 value = convert (type, value);
3557 /* Ignore any integer overflow caused by the cast. */
3558 if (TREE_CODE (value) == INTEGER_CST)
3560 if (CONSTANT_CLASS_P (ovalue)
3561 && (TREE_OVERFLOW (ovalue) || TREE_CONSTANT_OVERFLOW (ovalue)))
3563 /* Avoid clobbering a shared constant. */
3564 value = copy_node (value);
3565 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
3566 TREE_CONSTANT_OVERFLOW (value) = TREE_CONSTANT_OVERFLOW (ovalue);
3568 else if (TREE_OVERFLOW (value) || TREE_CONSTANT_OVERFLOW (value))
3569 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3570 value = build_int_cst_wide (TREE_TYPE (value),
3571 TREE_INT_CST_LOW (value),
3572 TREE_INT_CST_HIGH (value));
3576 /* Don't let a cast be an lvalue. */
3578 value = non_lvalue (value);
3583 /* Interpret a cast of expression EXPR to type TYPE. */
3585 c_cast_expr (struct c_type_name *type_name, tree expr)
3588 int saved_wsp = warn_strict_prototypes;
3590 /* This avoids warnings about unprototyped casts on
3591 integers. E.g. "#define SIG_DFL (void(*)())0". */
3592 if (TREE_CODE (expr) == INTEGER_CST)
3593 warn_strict_prototypes = 0;
3594 type = groktypename (type_name);
3595 warn_strict_prototypes = saved_wsp;
3597 return build_c_cast (type, expr);
3601 /* Build an assignment expression of lvalue LHS from value RHS.
3602 MODIFYCODE is the code for a binary operator that we use
3603 to combine the old value of LHS with RHS to get the new value.
3604 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3607 build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
3611 tree lhstype = TREE_TYPE (lhs);
3612 tree olhstype = lhstype;
3614 /* Types that aren't fully specified cannot be used in assignments. */
3615 lhs = require_complete_type (lhs);
3617 /* Avoid duplicate error messages from operands that had errors. */
3618 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
3619 return error_mark_node;
3621 STRIP_TYPE_NOPS (rhs);
3625 /* If a binary op has been requested, combine the old LHS value with the RHS
3626 producing the value we should actually store into the LHS. */
3628 if (modifycode != NOP_EXPR)
3630 lhs = stabilize_reference (lhs);
3631 newrhs = build_binary_op (modifycode, lhs, rhs, 1);
3634 if (!lvalue_or_else (lhs, lv_assign))
3635 return error_mark_node;
3637 /* Give an error for storing in something that is 'const'. */
3639 if (TREE_READONLY (lhs) || TYPE_READONLY (lhstype)
3640 || ((TREE_CODE (lhstype) == RECORD_TYPE
3641 || TREE_CODE (lhstype) == UNION_TYPE)
3642 && C_TYPE_FIELDS_READONLY (lhstype)))
3643 readonly_error (lhs, lv_assign);
3645 /* If storing into a structure or union member,
3646 it has probably been given type `int'.
3647 Compute the type that would go with
3648 the actual amount of storage the member occupies. */
3650 if (TREE_CODE (lhs) == COMPONENT_REF
3651 && (TREE_CODE (lhstype) == INTEGER_TYPE
3652 || TREE_CODE (lhstype) == BOOLEAN_TYPE
3653 || TREE_CODE (lhstype) == REAL_TYPE
3654 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
3655 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
3657 /* If storing in a field that is in actuality a short or narrower than one,
3658 we must store in the field in its actual type. */
3660 if (lhstype != TREE_TYPE (lhs))
3662 lhs = copy_node (lhs);
3663 TREE_TYPE (lhs) = lhstype;
3666 /* Convert new value to destination type. */
3668 newrhs = convert_for_assignment (lhstype, newrhs, ic_assign,
3669 NULL_TREE, NULL_TREE, 0);
3670 if (TREE_CODE (newrhs) == ERROR_MARK)
3671 return error_mark_node;
3673 /* Emit ObjC write barrier, if necessary. */
3674 if (c_dialect_objc () && flag_objc_gc)
3676 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
3681 /* Scan operands. */
3683 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
3684 TREE_SIDE_EFFECTS (result) = 1;
3686 /* If we got the LHS in a different type for storing in,
3687 convert the result back to the nominal type of LHS
3688 so that the value we return always has the same type
3689 as the LHS argument. */
3691 if (olhstype == TREE_TYPE (result))
3693 return convert_for_assignment (olhstype, result, ic_assign,
3694 NULL_TREE, NULL_TREE, 0);
3697 /* Convert value RHS to type TYPE as preparation for an assignment
3698 to an lvalue of type TYPE.
3699 The real work of conversion is done by `convert'.
3700 The purpose of this function is to generate error messages
3701 for assignments that are not allowed in C.
3702 ERRTYPE says whether it is argument passing, assignment,
3703 initialization or return.
3705 FUNCTION is a tree for the function being called.
3706 PARMNUM is the number of the argument, for printing in error messages. */
3709 convert_for_assignment (tree type, tree rhs, enum impl_conv errtype,
3710 tree fundecl, tree function, int parmnum)
3712 enum tree_code codel = TREE_CODE (type);
3714 enum tree_code coder;
3715 tree rname = NULL_TREE;
3716 bool objc_ok = false;
3718 if (errtype == ic_argpass || errtype == ic_argpass_nonproto)
3721 /* Change pointer to function to the function itself for
3723 if (TREE_CODE (function) == ADDR_EXPR
3724 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
3725 function = TREE_OPERAND (function, 0);
3727 /* Handle an ObjC selector specially for diagnostics. */
3728 selector = objc_message_selector ();
3730 if (selector && parmnum > 2)
3737 /* This macro is used to emit diagnostics to ensure that all format
3738 strings are complete sentences, visible to gettext and checked at
3740 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3745 pedwarn (AR, parmnum, rname); \
3747 case ic_argpass_nonproto: \
3748 warning (0, AR, parmnum, rname); \
3760 gcc_unreachable (); \
3764 STRIP_TYPE_NOPS (rhs);
3766 if (optimize && TREE_CODE (rhs) == VAR_DECL
3767 && TREE_CODE (TREE_TYPE (rhs)) != ARRAY_TYPE)
3768 rhs = decl_constant_value_for_broken_optimization (rhs);
3770 rhstype = TREE_TYPE (rhs);
3771 coder = TREE_CODE (rhstype);
3773 if (coder == ERROR_MARK)
3774 return error_mark_node;
3776 if (c_dialect_objc ())
3799 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
3802 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
3804 overflow_warning (rhs);
3808 if (coder == VOID_TYPE)
3810 /* Except for passing an argument to an unprototyped function,
3811 this is a constraint violation. When passing an argument to
3812 an unprototyped function, it is compile-time undefined;
3813 making it a constraint in that case was rejected in
3815 error ("void value not ignored as it ought to be");
3816 return error_mark_node;
3818 /* A type converts to a reference to it.
3819 This code doesn't fully support references, it's just for the
3820 special case of va_start and va_copy. */
3821 if (codel == REFERENCE_TYPE
3822 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
3824 if (!lvalue_p (rhs))
3826 error ("cannot pass rvalue to reference parameter");
3827 return error_mark_node;
3829 if (!c_mark_addressable (rhs))
3830 return error_mark_node;
3831 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
3833 /* We already know that these two types are compatible, but they
3834 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3835 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3836 likely to be va_list, a typedef to __builtin_va_list, which
3837 is different enough that it will cause problems later. */
3838 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
3839 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
3841 rhs = build1 (NOP_EXPR, type, rhs);
3844 /* Some types can interconvert without explicit casts. */
3845 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
3846 && vector_types_convertible_p (type, TREE_TYPE (rhs)))
3847 return convert (type, rhs);
3848 /* Arithmetic types all interconvert, and enum is treated like int. */
3849 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
3850 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
3851 || codel == BOOLEAN_TYPE)
3852 && (coder == INTEGER_TYPE || coder == REAL_TYPE
3853 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
3854 || coder == BOOLEAN_TYPE))
3855 return convert_and_check (type, rhs);
3857 /* Conversion to a transparent union from its member types.
3858 This applies only to function arguments. */
3859 else if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
3860 && (errtype == ic_argpass || errtype == ic_argpass_nonproto))
3862 tree memb, marginal_memb = NULL_TREE;
3864 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
3866 tree memb_type = TREE_TYPE (memb);
3868 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
3869 TYPE_MAIN_VARIANT (rhstype)))
3872 if (TREE_CODE (memb_type) != POINTER_TYPE)
3875 if (coder == POINTER_TYPE)
3877 tree ttl = TREE_TYPE (memb_type);
3878 tree ttr = TREE_TYPE (rhstype);
3880 /* Any non-function converts to a [const][volatile] void *
3881 and vice versa; otherwise, targets must be the same.
3882 Meanwhile, the lhs target must have all the qualifiers of
3884 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
3885 || comp_target_types (memb_type, rhstype))
3887 /* If this type won't generate any warnings, use it. */
3888 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
3889 || ((TREE_CODE (ttr) == FUNCTION_TYPE
3890 && TREE_CODE (ttl) == FUNCTION_TYPE)
3891 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3892 == TYPE_QUALS (ttr))
3893 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
3894 == TYPE_QUALS (ttl))))
3897 /* Keep looking for a better type, but remember this one. */
3899 marginal_memb = memb;
3903 /* Can convert integer zero to any pointer type. */
3904 if (null_pointer_constant_p (rhs))
3906 rhs = null_pointer_node;
3911 if (memb || marginal_memb)
3915 /* We have only a marginally acceptable member type;
3916 it needs a warning. */
3917 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
3918 tree ttr = TREE_TYPE (rhstype);
3920 /* Const and volatile mean something different for function
3921 types, so the usual warnings are not appropriate. */
3922 if (TREE_CODE (ttr) == FUNCTION_TYPE
3923 && TREE_CODE (ttl) == FUNCTION_TYPE)
3925 /* Because const and volatile on functions are
3926 restrictions that say the function will not do
3927 certain things, it is okay to use a const or volatile
3928 function where an ordinary one is wanted, but not
3930 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
3931 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
3932 "makes qualified function "
3933 "pointer from unqualified"),
3934 G_("assignment makes qualified "
3935 "function pointer from "
3937 G_("initialization makes qualified "
3938 "function pointer from "
3940 G_("return makes qualified function "
3941 "pointer from unqualified"));
3943 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
3944 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
3945 "qualifiers from pointer target type"),
3946 G_("assignment discards qualifiers "
3947 "from pointer target type"),
3948 G_("initialization discards qualifiers "
3949 "from pointer target type"),
3950 G_("return discards qualifiers from "
3951 "pointer target type"));
3953 memb = marginal_memb;
3956 if (pedantic && (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl)))
3957 pedwarn ("ISO C prohibits argument conversion to union type");
3959 return build_constructor_single (type, memb, rhs);
3963 /* Conversions among pointers */
3964 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
3965 && (coder == codel))
3967 tree ttl = TREE_TYPE (type);
3968 tree ttr = TREE_TYPE (rhstype);
3971 bool is_opaque_pointer;
3972 int target_cmp = 0; /* Cache comp_target_types () result. */
3974 if (TREE_CODE (mvl) != ARRAY_TYPE)
3975 mvl = TYPE_MAIN_VARIANT (mvl);
3976 if (TREE_CODE (mvr) != ARRAY_TYPE)
3977 mvr = TYPE_MAIN_VARIANT (mvr);
3978 /* Opaque pointers are treated like void pointers. */
3979 is_opaque_pointer = (targetm.vector_opaque_p (type)
3980 || targetm.vector_opaque_p (rhstype))
3981 && TREE_CODE (ttl) == VECTOR_TYPE
3982 && TREE_CODE (ttr) == VECTOR_TYPE;
3984 /* C++ does not allow the implicit conversion void* -> T*. However,
3985 for the purpose of reducing the number of false positives, we
3986 tolerate the special case of
3990 where NULL is typically defined in C to be '(void *) 0'. */
3991 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
3992 warning (OPT_Wc___compat, "request for implicit conversion from "
3993 "%qT to %qT not permitted in C++", rhstype, type);
3995 /* Check if the right-hand side has a format attribute but the
3996 left-hand side doesn't. */
3997 if (warn_missing_format_attribute
3998 && check_missing_format_attribute (type, rhstype))
4003 case ic_argpass_nonproto:
4004 warning (OPT_Wmissing_format_attribute,
4005 "argument %d of %qE might be "
4006 "a candidate for a format attribute",
4010 warning (OPT_Wmissing_format_attribute,
4011 "assignment left-hand side might be "
4012 "a candidate for a format attribute");
4015 warning (OPT_Wmissing_format_attribute,
4016 "initialization left-hand side might be "
4017 "a candidate for a format attribute");
4020 warning (OPT_Wmissing_format_attribute,
4021 "return type might be "
4022 "a candidate for a format attribute");
4029 /* Any non-function converts to a [const][volatile] void *
4030 and vice versa; otherwise, targets must be the same.
4031 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4032 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4033 || (target_cmp = comp_target_types (type, rhstype))
4034 || is_opaque_pointer
4035 || (c_common_unsigned_type (mvl)
4036 == c_common_unsigned_type (mvr)))
4039 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4042 && !null_pointer_constant_p (rhs)
4043 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4044 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
4045 "%qE between function pointer "
4047 G_("ISO C forbids assignment between "
4048 "function pointer and %<void *%>"),
4049 G_("ISO C forbids initialization between "
4050 "function pointer and %<void *%>"),
4051 G_("ISO C forbids return between function "
4052 "pointer and %<void *%>"));
4053 /* Const and volatile mean something different for function types,
4054 so the usual warnings are not appropriate. */
4055 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4056 && TREE_CODE (ttl) != FUNCTION_TYPE)
4058 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4060 /* Types differing only by the presence of the 'volatile'
4061 qualifier are acceptable if the 'volatile' has been added
4062 in by the Objective-C EH machinery. */
4063 if (!objc_type_quals_match (ttl, ttr))
4064 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4065 "qualifiers from pointer target type"),
4066 G_("assignment discards qualifiers "
4067 "from pointer target type"),
4068 G_("initialization discards qualifiers "
4069 "from pointer target type"),
4070 G_("return discards qualifiers from "
4071 "pointer target type"));
4073 /* If this is not a case of ignoring a mismatch in signedness,
4075 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4078 /* If there is a mismatch, do warn. */
4079 else if (warn_pointer_sign)
4080 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
4081 "%d of %qE differ in signedness"),
4082 G_("pointer targets in assignment "
4083 "differ in signedness"),
4084 G_("pointer targets in initialization "
4085 "differ in signedness"),
4086 G_("pointer targets in return differ "
4089 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4090 && TREE_CODE (ttr) == FUNCTION_TYPE)
4092 /* Because const and volatile on functions are restrictions
4093 that say the function will not do certain things,
4094 it is okay to use a const or volatile function
4095 where an ordinary one is wanted, but not vice-versa. */
4096 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4097 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4098 "qualified function pointer "
4099 "from unqualified"),
4100 G_("assignment makes qualified function "
4101 "pointer from unqualified"),
4102 G_("initialization makes qualified "
4103 "function pointer from unqualified"),
4104 G_("return makes qualified function "
4105 "pointer from unqualified"));
4109 /* Avoid warning about the volatile ObjC EH puts on decls. */
4111 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
4112 "incompatible pointer type"),
4113 G_("assignment from incompatible pointer type"),
4114 G_("initialization from incompatible "
4116 G_("return from incompatible pointer type"));
4118 return convert (type, rhs);
4120 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4122 /* ??? This should not be an error when inlining calls to
4123 unprototyped functions. */
4124 error ("invalid use of non-lvalue array");
4125 return error_mark_node;
4127 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4129 /* An explicit constant 0 can convert to a pointer,
4130 or one that results from arithmetic, even including
4131 a cast to integer type. */
4132 if (!null_pointer_constant_p (rhs))
4133 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4134 "pointer from integer without a cast"),
4135 G_("assignment makes pointer from integer "
4137 G_("initialization makes pointer from "
4138 "integer without a cast"),
4139 G_("return makes pointer from integer "
4142 return convert (type, rhs);
4144 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4146 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
4147 "from pointer without a cast"),
4148 G_("assignment makes integer from pointer "
4150 G_("initialization makes integer from pointer "
4152 G_("return makes integer from pointer "
4154 return convert (type, rhs);
4156 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4157 return convert (type, rhs);
4162 case ic_argpass_nonproto:
4163 /* ??? This should not be an error when inlining calls to
4164 unprototyped functions. */
4165 error ("incompatible type for argument %d of %qE", parmnum, rname);
4168 error ("incompatible types in assignment");
4171 error ("incompatible types in initialization");
4174 error ("incompatible types in return");
4180 return error_mark_node;
4183 /* Convert VALUE for assignment into inlined parameter PARM. ARGNUM
4184 is used for error and waring reporting and indicates which argument
4185 is being processed. */
4188 c_convert_parm_for_inlining (tree parm, tree value, tree fn, int argnum)
4192 /* If FN was prototyped, the value has been converted already
4193 in convert_arguments. */
4194 if (!value || TYPE_ARG_TYPES (TREE_TYPE (fn)))
4197 type = TREE_TYPE (parm);
4198 ret = convert_for_assignment (type, value,
4199 ic_argpass_nonproto, fn,
4201 if (targetm.calls.promote_prototypes (TREE_TYPE (fn))
4202 && INTEGRAL_TYPE_P (type)
4203 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
4204 ret = default_conversion (ret);
4208 /* If VALUE is a compound expr all of whose expressions are constant, then
4209 return its value. Otherwise, return error_mark_node.
4211 This is for handling COMPOUND_EXPRs as initializer elements
4212 which is allowed with a warning when -pedantic is specified. */
4215 valid_compound_expr_initializer (tree value, tree endtype)
4217 if (TREE_CODE (value) == COMPOUND_EXPR)
4219 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
4221 return error_mark_node;
4222 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
4225 else if (!initializer_constant_valid_p (value, endtype))
4226 return error_mark_node;
4231 /* Perform appropriate conversions on the initial value of a variable,
4232 store it in the declaration DECL,
4233 and print any error messages that are appropriate.
4234 If the init is invalid, store an ERROR_MARK. */
4237 store_init_value (tree decl, tree init)
4241 /* If variable's type was invalidly declared, just ignore it. */
4243 type = TREE_TYPE (decl);
4244 if (TREE_CODE (type) == ERROR_MARK)
4247 /* Digest the specified initializer into an expression. */
4249 value = digest_init (type, init, true, TREE_STATIC (decl));
4251 /* Store the expression if valid; else report error. */
4253 if (!in_system_header
4254 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
4255 warning (OPT_Wtraditional, "traditional C rejects automatic "
4256 "aggregate initialization");
4258 DECL_INITIAL (decl) = value;
4260 /* ANSI wants warnings about out-of-range constant initializers. */
4261 STRIP_TYPE_NOPS (value);
4262 constant_expression_warning (value);
4264 /* Check if we need to set array size from compound literal size. */
4265 if (TREE_CODE (type) == ARRAY_TYPE
4266 && TYPE_DOMAIN (type) == 0
4267 && value != error_mark_node)
4269 tree inside_init = init;
4271 STRIP_TYPE_NOPS (inside_init);
4272 inside_init = fold (inside_init);
4274 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4276 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4278 if (TYPE_DOMAIN (TREE_TYPE (decl)))
4280 /* For int foo[] = (int [3]){1}; we need to set array size
4281 now since later on array initializer will be just the
4282 brace enclosed list of the compound literal. */
4283 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (decl));
4285 layout_decl (decl, 0);
4291 /* Methods for storing and printing names for error messages. */
4293 /* Implement a spelling stack that allows components of a name to be pushed
4294 and popped. Each element on the stack is this structure. */
4306 #define SPELLING_STRING 1
4307 #define SPELLING_MEMBER 2
4308 #define SPELLING_BOUNDS 3
4310 static struct spelling *spelling; /* Next stack element (unused). */
4311 static struct spelling *spelling_base; /* Spelling stack base. */
4312 static int spelling_size; /* Size of the spelling stack. */
4314 /* Macros to save and restore the spelling stack around push_... functions.
4315 Alternative to SAVE_SPELLING_STACK. */
4317 #define SPELLING_DEPTH() (spelling - spelling_base)
4318 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4320 /* Push an element on the spelling stack with type KIND and assign VALUE
4323 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4325 int depth = SPELLING_DEPTH (); \
4327 if (depth >= spelling_size) \
4329 spelling_size += 10; \
4330 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4332 RESTORE_SPELLING_DEPTH (depth); \
4335 spelling->kind = (KIND); \
4336 spelling->MEMBER = (VALUE); \
4340 /* Push STRING on the stack. Printed literally. */
4343 push_string (const char *string)
4345 PUSH_SPELLING (SPELLING_STRING, string, u.s);
4348 /* Push a member name on the stack. Printed as '.' STRING. */
4351 push_member_name (tree decl)
4353 const char *const string
4354 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
4355 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
4358 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4361 push_array_bounds (int bounds)
4363 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
4366 /* Compute the maximum size in bytes of the printed spelling. */
4369 spelling_length (void)
4374 for (p = spelling_base; p < spelling; p++)
4376 if (p->kind == SPELLING_BOUNDS)
4379 size += strlen (p->u.s) + 1;
4385 /* Print the spelling to BUFFER and return it. */
4388 print_spelling (char *buffer)
4393 for (p = spelling_base; p < spelling; p++)
4394 if (p->kind == SPELLING_BOUNDS)
4396 sprintf (d, "[%d]", p->u.i);
4402 if (p->kind == SPELLING_MEMBER)
4404 for (s = p->u.s; (*d = *s++); d++)
4411 /* Issue an error message for a bad initializer component.
4412 MSGID identifies the message.
4413 The component name is taken from the spelling stack. */
4416 error_init (const char *msgid)
4420 error ("%s", _(msgid));
4421 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4423 error ("(near initialization for %qs)", ofwhat);
4426 /* Issue a pedantic warning for a bad initializer component.
4427 MSGID identifies the message.
4428 The component name is taken from the spelling stack. */
4431 pedwarn_init (const char *msgid)
4435 pedwarn ("%s", _(msgid));
4436 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4438 pedwarn ("(near initialization for %qs)", ofwhat);
4441 /* Issue a warning for a bad initializer component.
4442 MSGID identifies the message.
4443 The component name is taken from the spelling stack. */
4446 warning_init (const char *msgid)
4450 warning (0, "%s", _(msgid));
4451 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
4453 warning (0, "(near initialization for %qs)", ofwhat);
4456 /* If TYPE is an array type and EXPR is a parenthesized string
4457 constant, warn if pedantic that EXPR is being used to initialize an
4458 object of type TYPE. */
4461 maybe_warn_string_init (tree type, struct c_expr expr)
4464 && TREE_CODE (type) == ARRAY_TYPE
4465 && TREE_CODE (expr.value) == STRING_CST
4466 && expr.original_code != STRING_CST)
4467 pedwarn_init ("array initialized from parenthesized string constant");
4470 /* Digest the parser output INIT as an initializer for type TYPE.
4471 Return a C expression of type TYPE to represent the initial value.
4473 If INIT is a string constant, STRICT_STRING is true if it is
4474 unparenthesized or we should not warn here for it being parenthesized.
4475 For other types of INIT, STRICT_STRING is not used.
4477 REQUIRE_CONSTANT requests an error if non-constant initializers or
4478 elements are seen. */
4481 digest_init (tree type, tree init, bool strict_string, int require_constant)
4483 enum tree_code code = TREE_CODE (type);
4484 tree inside_init = init;
4486 if (type == error_mark_node
4487 || init == error_mark_node
4488 || TREE_TYPE (init) == error_mark_node)
4489 return error_mark_node;
4491 STRIP_TYPE_NOPS (inside_init);
4493 inside_init = fold (inside_init);
4495 /* Initialization of an array of chars from a string constant
4496 optionally enclosed in braces. */
4498 if (code == ARRAY_TYPE && inside_init
4499 && TREE_CODE (inside_init) == STRING_CST)
4501 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
4502 /* Note that an array could be both an array of character type
4503 and an array of wchar_t if wchar_t is signed char or unsigned
4505 bool char_array = (typ1 == char_type_node
4506 || typ1 == signed_char_type_node
4507 || typ1 == unsigned_char_type_node);
4508 bool wchar_array = !!comptypes (typ1, wchar_type_node);
4509 if (char_array || wchar_array)
4513 expr.value = inside_init;
4514 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
4515 maybe_warn_string_init (type, expr);
4518 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)))
4521 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4522 TYPE_MAIN_VARIANT (type)))
4525 if (!wchar_array && !char_string)
4527 error_init ("char-array initialized from wide string");
4528 return error_mark_node;
4530 if (char_string && !char_array)
4532 error_init ("wchar_t-array initialized from non-wide string");
4533 return error_mark_node;
4536 TREE_TYPE (inside_init) = type;
4537 if (TYPE_DOMAIN (type) != 0
4538 && TYPE_SIZE (type) != 0
4539 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
4540 /* Subtract 1 (or sizeof (wchar_t))
4541 because it's ok to ignore the terminating null char
4542 that is counted in the length of the constant. */
4543 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
4544 TREE_STRING_LENGTH (inside_init)
4545 - ((TYPE_PRECISION (typ1)
4546 != TYPE_PRECISION (char_type_node))
4547 ? (TYPE_PRECISION (wchar_type_node)
4550 pedwarn_init ("initializer-string for array of chars is too long");
4554 else if (INTEGRAL_TYPE_P (typ1))
4556 error_init ("array of inappropriate type initialized "
4557 "from string constant");
4558 return error_mark_node;
4562 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4563 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4564 below and handle as a constructor. */
4565 if (code == VECTOR_TYPE
4566 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
4567 && vector_types_convertible_p (TREE_TYPE (inside_init), type)
4568 && TREE_CONSTANT (inside_init))
4570 if (TREE_CODE (inside_init) == VECTOR_CST
4571 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4572 TYPE_MAIN_VARIANT (type)))
4575 if (TREE_CODE (inside_init) == CONSTRUCTOR)
4577 unsigned HOST_WIDE_INT ix;
4579 bool constant_p = true;
4581 /* Iterate through elements and check if all constructor
4582 elements are *_CSTs. */
4583 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
4584 if (!CONSTANT_CLASS_P (value))
4591 return build_vector_from_ctor (type,
4592 CONSTRUCTOR_ELTS (inside_init));
4596 /* Any type can be initialized
4597 from an expression of the same type, optionally with braces. */
4599 if (inside_init && TREE_TYPE (inside_init) != 0
4600 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
4601 TYPE_MAIN_VARIANT (type))
4602 || (code == ARRAY_TYPE
4603 && comptypes (TREE_TYPE (inside_init), type))
4604 || (code == VECTOR_TYPE
4605 && comptypes (TREE_TYPE (inside_init), type))
4606 || (code == POINTER_TYPE
4607 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
4608 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
4609 TREE_TYPE (type)))))
4611 if (code == POINTER_TYPE)
4613 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
4615 if (TREE_CODE (inside_init) == STRING_CST
4616 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4617 inside_init = array_to_pointer_conversion (inside_init);
4620 error_init ("invalid use of non-lvalue array");
4621 return error_mark_node;
4626 if (code == VECTOR_TYPE)
4627 /* Although the types are compatible, we may require a
4629 inside_init = convert (type, inside_init);
4631 if (require_constant && !flag_isoc99
4632 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
4634 /* As an extension, allow initializing objects with static storage
4635 duration with compound literals (which are then treated just as
4636 the brace enclosed list they contain). */
4637 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
4638 inside_init = DECL_INITIAL (decl);
4641 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
4642 && TREE_CODE (inside_init) != CONSTRUCTOR)
4644 error_init ("array initialized from non-constant array expression");
4645 return error_mark_node;
4648 if (optimize && TREE_CODE (inside_init) == VAR_DECL)
4649 inside_init = decl_constant_value_for_broken_optimization (inside_init);
4651 /* Compound expressions can only occur here if -pedantic or
4652 -pedantic-errors is specified. In the later case, we always want
4653 an error. In the former case, we simply want a warning. */
4654 if (require_constant && pedantic
4655 && TREE_CODE (inside_init) == COMPOUND_EXPR)
4658 = valid_compound_expr_initializer (inside_init,
4659 TREE_TYPE (inside_init));
4660 if (inside_init == error_mark_node)
4661 error_init ("initializer element is not constant");
4663 pedwarn_init ("initializer element is not constant");
4664 if (flag_pedantic_errors)
4665 inside_init = error_mark_node;
4667 else if (require_constant
4668 && !initializer_constant_valid_p (inside_init,
4669 TREE_TYPE (inside_init)))
4671 error_init ("initializer element is not constant");
4672 inside_init = error_mark_node;
4675 /* Added to enable additional -Wmissing-format-attribute warnings. */
4676 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
4677 inside_init = convert_for_assignment (type, inside_init, ic_init, NULL_TREE,
4682 /* Handle scalar types, including conversions. */
4684 if (code == INTEGER_TYPE || code == REAL_TYPE || code == POINTER_TYPE
4685 || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE || code == COMPLEX_TYPE
4686 || code == VECTOR_TYPE)
4688 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
4689 && (TREE_CODE (init) == STRING_CST
4690 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
4691 init = array_to_pointer_conversion (init);
4693 = convert_for_assignment (type, init, ic_init,
4694 NULL_TREE, NULL_TREE, 0);
4696 /* Check to see if we have already given an error message. */
4697 if (inside_init == error_mark_node)
4699 else if (require_constant && !TREE_CONSTANT (inside_init))
4701 error_init ("initializer element is not constant");
4702 inside_init = error_mark_node;
4704 else if (require_constant
4705 && !initializer_constant_valid_p (inside_init,
4706 TREE_TYPE (inside_init)))
4708 error_init ("initializer element is not computable at load time");
4709 inside_init = error_mark_node;
4715 /* Come here only for records and arrays. */
4717 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
4719 error_init ("variable-sized object may not be initialized");
4720 return error_mark_node;
4723 error_init ("invalid initializer");
4724 return error_mark_node;
4727 /* Handle initializers that use braces. */
4729 /* Type of object we are accumulating a constructor for.
4730 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4731 static tree constructor_type;
4733 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4735 static tree constructor_fields;
4737 /* For an ARRAY_TYPE, this is the specified index
4738 at which to store the next element we get. */
4739 static tree constructor_index;
4741 /* For an ARRAY_TYPE, this is the maximum index. */
4742 static tree constructor_max_index;
4744 /* For a RECORD_TYPE, this is the first field not yet written out. */
4745 static tree constructor_unfilled_fields;
4747 /* For an ARRAY_TYPE, this is the index of the first element
4748 not yet written out. */
4749 static tree constructor_unfilled_index;
4751 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4752 This is so we can generate gaps between fields, when appropriate. */
4753 static tree constructor_bit_index;
4755 /* If we are saving up the elements rather than allocating them,
4756 this is the list of elements so far (in reverse order,
4757 most recent first). */
4758 static VEC(constructor_elt,gc) *constructor_elements;
4760 /* 1 if constructor should be incrementally stored into a constructor chain,
4761 0 if all the elements should be kept in AVL tree. */
4762 static int constructor_incremental;
4764 /* 1 if so far this constructor's elements are all compile-time constants. */
4765 static int constructor_constant;
4767 /* 1 if so far this constructor's elements are all valid address constants. */
4768 static int constructor_simple;
4770 /* 1 if this constructor is erroneous so far. */
4771 static int constructor_erroneous;
4773 /* Structure for managing pending initializer elements, organized as an
4778 struct init_node *left, *right;
4779 struct init_node *parent;
4785 /* Tree of pending elements at this constructor level.
4786 These are elements encountered out of order
4787 which belong at places we haven't reached yet in actually
4789 Will never hold tree nodes across GC runs. */
4790 static struct init_node *constructor_pending_elts;
4792 /* The SPELLING_DEPTH of this constructor. */
4793 static int constructor_depth;
4795 /* DECL node for which an initializer is being read.
4796 0 means we are reading a constructor expression
4797 such as (struct foo) {...}. */
4798 static tree constructor_decl;
4800 /* Nonzero if this is an initializer for a top-level decl. */
4801 static int constructor_top_level;
4803 /* Nonzero if there were any member designators in this initializer. */
4804 static int constructor_designated;
4806 /* Nesting depth of designator list. */
4807 static int designator_depth;
4809 /* Nonzero if there were diagnosed errors in this designator list. */
4810 static int designator_erroneous;
4813 /* This stack has a level for each implicit or explicit level of
4814 structuring in the initializer, including the outermost one. It
4815 saves the values of most of the variables above. */
4817 struct constructor_range_stack;
4819 struct constructor_stack
4821 struct constructor_stack *next;
4826 tree unfilled_index;
4827 tree unfilled_fields;
4829 VEC(constructor_elt,gc) *elements;
4830 struct init_node *pending_elts;
4833 /* If value nonzero, this value should replace the entire
4834 constructor at this level. */
4835 struct c_expr replacement_value;
4836 struct constructor_range_stack *range_stack;
4846 static struct constructor_stack *constructor_stack;
4848 /* This stack represents designators from some range designator up to
4849 the last designator in the list. */
4851 struct constructor_range_stack
4853 struct constructor_range_stack *next, *prev;
4854 struct constructor_stack *stack;
4861 static struct constructor_range_stack *constructor_range_stack;
4863 /* This stack records separate initializers that are nested.
4864 Nested initializers can't happen in ANSI C, but GNU C allows them
4865 in cases like { ... (struct foo) { ... } ... }. */
4867 struct initializer_stack
4869 struct initializer_stack *next;
4871 struct constructor_stack *constructor_stack;
4872 struct constructor_range_stack *constructor_range_stack;
4873 VEC(constructor_elt,gc) *elements;
4874 struct spelling *spelling;
4875 struct spelling *spelling_base;
4878 char require_constant_value;
4879 char require_constant_elements;
4882 static struct initializer_stack *initializer_stack;
4884 /* Prepare to parse and output the initializer for variable DECL. */
4887 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
4890 struct initializer_stack *p = XNEW (struct initializer_stack);
4892 p->decl = constructor_decl;
4893 p->require_constant_value = require_constant_value;
4894 p->require_constant_elements = require_constant_elements;
4895 p->constructor_stack = constructor_stack;
4896 p->constructor_range_stack = constructor_range_stack;
4897 p->elements = constructor_elements;
4898 p->spelling = spelling;
4899 p->spelling_base = spelling_base;
4900 p->spelling_size = spelling_size;
4901 p->top_level = constructor_top_level;
4902 p->next = initializer_stack;
4903 initializer_stack = p;
4905 constructor_decl = decl;
4906 constructor_designated = 0;
4907 constructor_top_level = top_level;
4909 if (decl != 0 && decl != error_mark_node)
4911 require_constant_value = TREE_STATIC (decl);
4912 require_constant_elements
4913 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
4914 /* For a scalar, you can always use any value to initialize,
4915 even within braces. */
4916 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
4917 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
4918 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
4919 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
4920 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
4924 require_constant_value = 0;
4925 require_constant_elements = 0;
4926 locus = "(anonymous)";
4929 constructor_stack = 0;
4930 constructor_range_stack = 0;
4932 missing_braces_mentioned = 0;
4936 RESTORE_SPELLING_DEPTH (0);
4939 push_string (locus);
4945 struct initializer_stack *p = initializer_stack;
4947 /* Free the whole constructor stack of this initializer. */
4948 while (constructor_stack)
4950 struct constructor_stack *q = constructor_stack;
4951 constructor_stack = q->next;
4955 gcc_assert (!constructor_range_stack);
4957 /* Pop back to the data of the outer initializer (if any). */
4958 free (spelling_base);
4960 constructor_decl = p->decl;
4961 require_constant_value = p->require_constant_value;
4962 require_constant_elements = p->require_constant_elements;
4963 constructor_stack = p->constructor_stack;
4964 constructor_range_stack = p->constructor_range_stack;
4965 constructor_elements = p->elements;
4966 spelling = p->spelling;
4967 spelling_base = p->spelling_base;
4968 spelling_size = p->spelling_size;
4969 constructor_top_level = p->top_level;
4970 initializer_stack = p->next;
4974 /* Call here when we see the initializer is surrounded by braces.
4975 This is instead of a call to push_init_level;
4976 it is matched by a call to pop_init_level.
4978 TYPE is the type to initialize, for a constructor expression.
4979 For an initializer for a decl, TYPE is zero. */
4982 really_start_incremental_init (tree type)
4984 struct constructor_stack *p = XNEW (struct constructor_stack);
4987 type = TREE_TYPE (constructor_decl);
4989 if (targetm.vector_opaque_p (type))
4990 error ("opaque vector types cannot be initialized");
4992 p->type = constructor_type;
4993 p->fields = constructor_fields;
4994 p->index = constructor_index;
4995 p->max_index = constructor_max_index;
4996 p->unfilled_index = constructor_unfilled_index;
4997 p->unfilled_fields = constructor_unfilled_fields;
4998 p->bit_index = constructor_bit_index;
4999 p->elements = constructor_elements;
5000 p->constant = constructor_constant;
5001 p->simple = constructor_simple;
5002 p->erroneous = constructor_erroneous;
5003 p->pending_elts = constructor_pending_elts;
5004 p->depth = constructor_depth;
5005 p->replacement_value.value = 0;
5006 p->replacement_value.original_code = ERROR_MARK;
5010 p->incremental = constructor_incremental;
5011 p->designated = constructor_designated;
5013 constructor_stack = p;
5015 constructor_constant = 1;
5016 constructor_simple = 1;
5017 constructor_depth = SPELLING_DEPTH ();
5018 constructor_elements = 0;
5019 constructor_pending_elts = 0;
5020 constructor_type = type;
5021 constructor_incremental = 1;
5022 constructor_designated = 0;
5023 designator_depth = 0;
5024 designator_erroneous = 0;
5026 if (TREE_CODE (constructor_type) == RECORD_TYPE
5027 || TREE_CODE (constructor_type) == UNION_TYPE)
5029 constructor_fields = TYPE_FIELDS (constructor_type);
5030 /* Skip any nameless bit fields at the beginning. */
5031 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5032 && DECL_NAME (constructor_fields) == 0)
5033 constructor_fields = TREE_CHAIN (constructor_fields);
5035 constructor_unfilled_fields = constructor_fields;
5036 constructor_bit_index = bitsize_zero_node;
5038 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5040 if (TYPE_DOMAIN (constructor_type))
5042 constructor_max_index
5043 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5045 /* Detect non-empty initializations of zero-length arrays. */
5046 if (constructor_max_index == NULL_TREE
5047 && TYPE_SIZE (constructor_type))
5048 constructor_max_index = build_int_cst (NULL_TREE, -1);
5050 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5051 to initialize VLAs will cause a proper error; avoid tree
5052 checking errors as well by setting a safe value. */
5053 if (constructor_max_index
5054 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5055 constructor_max_index = build_int_cst (NULL_TREE, -1);
5058 = convert (bitsizetype,
5059 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5063 constructor_index = bitsize_zero_node;
5064 constructor_max_index = NULL_TREE;
5067 constructor_unfilled_index = constructor_index;
5069 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5071 /* Vectors are like simple fixed-size arrays. */
5072 constructor_max_index =
5073 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5074 constructor_index = convert (bitsizetype, bitsize_zero_node);
5075 constructor_unfilled_index = constructor_index;
5079 /* Handle the case of int x = {5}; */
5080 constructor_fields = constructor_type;
5081 constructor_unfilled_fields = constructor_type;
5085 /* Push down into a subobject, for initialization.
5086 If this is for an explicit set of braces, IMPLICIT is 0.
5087 If it is because the next element belongs at a lower level,
5088 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5091 push_init_level (int implicit)
5093 struct constructor_stack *p;
5094 tree value = NULL_TREE;
5096 /* If we've exhausted any levels that didn't have braces,
5097 pop them now. If implicit == 1, this will have been done in
5098 process_init_element; do not repeat it here because in the case
5099 of excess initializers for an empty aggregate this leads to an
5100 infinite cycle of popping a level and immediately recreating
5104 while (constructor_stack->implicit)
5106 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5107 || TREE_CODE (constructor_type) == UNION_TYPE)
5108 && constructor_fields == 0)
5109 process_init_element (pop_init_level (1));
5110 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5111 && constructor_max_index
5112 && tree_int_cst_lt (constructor_max_index,
5114 process_init_element (pop_init_level (1));
5120 /* Unless this is an explicit brace, we need to preserve previous
5124 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5125 || TREE_CODE (constructor_type) == UNION_TYPE)
5126 && constructor_fields)
5127 value = find_init_member (constructor_fields);
5128 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5129 value = find_init_member (constructor_index);
5132 p = XNEW (struct constructor_stack);
5133 p->type = constructor_type;
5134 p->fields = constructor_fields;
5135 p->index = constructor_index;
5136 p->max_index = constructor_max_index;
5137 p->unfilled_index = constructor_unfilled_index;
5138 p->unfilled_fields = constructor_unfilled_fields;
5139 p->bit_index = constructor_bit_index;
5140 p->elements = constructor_elements;
5141 p->constant = constructor_constant;
5142 p->simple = constructor_simple;
5143 p->erroneous = constructor_erroneous;
5144 p->pending_elts = constructor_pending_elts;
5145 p->depth = constructor_depth;
5146 p->replacement_value.value = 0;
5147 p->replacement_value.original_code = ERROR_MARK;
5148 p->implicit = implicit;
5150 p->incremental = constructor_incremental;
5151 p->designated = constructor_designated;
5152 p->next = constructor_stack;
5154 constructor_stack = p;
5156 constructor_constant = 1;
5157 constructor_simple = 1;
5158 constructor_depth = SPELLING_DEPTH ();
5159 constructor_elements = 0;
5160 constructor_incremental = 1;
5161 constructor_designated = 0;
5162 constructor_pending_elts = 0;
5165 p->range_stack = constructor_range_stack;
5166 constructor_range_stack = 0;
5167 designator_depth = 0;
5168 designator_erroneous = 0;
5171 /* Don't die if an entire brace-pair level is superfluous
5172 in the containing level. */
5173 if (constructor_type == 0)
5175 else if (TREE_CODE (constructor_type) == RECORD_TYPE
5176 || TREE_CODE (constructor_type) == UNION_TYPE)
5178 /* Don't die if there are extra init elts at the end. */
5179 if (constructor_fields == 0)
5180 constructor_type = 0;
5183 constructor_type = TREE_TYPE (constructor_fields);
5184 push_member_name (constructor_fields);
5185 constructor_depth++;
5188 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5190 constructor_type = TREE_TYPE (constructor_type);
5191 push_array_bounds (tree_low_cst (constructor_index, 0));
5192 constructor_depth++;
5195 if (constructor_type == 0)
5197 error_init ("extra brace group at end of initializer");
5198 constructor_fields = 0;
5199 constructor_unfilled_fields = 0;
5203 if (value && TREE_CODE (value) == CONSTRUCTOR)
5205 constructor_constant = TREE_CONSTANT (value);
5206 constructor_simple = TREE_STATIC (value);
5207 constructor_elements = CONSTRUCTOR_ELTS (value);
5208 if (!VEC_empty (constructor_elt, constructor_elements)
5209 && (TREE_CODE (constructor_type) == RECORD_TYPE
5210 || TREE_CODE (constructor_type) == ARRAY_TYPE))
5211 set_nonincremental_init ();
5214 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
5216 missing_braces_mentioned = 1;
5217 warning_init ("missing braces around initializer");
5220 if (TREE_CODE (constructor_type) == RECORD_TYPE
5221 || TREE_CODE (constructor_type) == UNION_TYPE)
5223 constructor_fields = TYPE_FIELDS (constructor_type);
5224 /* Skip any nameless bit fields at the beginning. */
5225 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5226 && DECL_NAME (constructor_fields) == 0)
5227 constructor_fields = TREE_CHAIN (constructor_fields);
5229 constructor_unfilled_fields = constructor_fields;
5230 constructor_bit_index = bitsize_zero_node;
5232 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5234 /* Vectors are like simple fixed-size arrays. */
5235 constructor_max_index =
5236 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5237 constructor_index = convert (bitsizetype, integer_zero_node);
5238 constructor_unfilled_index = constructor_index;
5240 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5242 if (TYPE_DOMAIN (constructor_type))
5244 constructor_max_index
5245 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5247 /* Detect non-empty initializations of zero-length arrays. */
5248 if (constructor_max_index == NULL_TREE
5249 && TYPE_SIZE (constructor_type))
5250 constructor_max_index = build_int_cst (NULL_TREE, -1);
5252 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5253 to initialize VLAs will cause a proper error; avoid tree
5254 checking errors as well by setting a safe value. */
5255 if (constructor_max_index
5256 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5257 constructor_max_index = build_int_cst (NULL_TREE, -1);
5260 = convert (bitsizetype,
5261 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5264 constructor_index = bitsize_zero_node;
5266 constructor_unfilled_index = constructor_index;
5267 if (value && TREE_CODE (value) == STRING_CST)
5269 /* We need to split the char/wchar array into individual
5270 characters, so that we don't have to special case it
5272 set_nonincremental_init_from_string (value);
5277 if (constructor_type != error_mark_node)
5278 warning_init ("braces around scalar initializer");
5279 constructor_fields = constructor_type;
5280 constructor_unfilled_fields = constructor_type;
5284 /* At the end of an implicit or explicit brace level,
5285 finish up that level of constructor. If a single expression
5286 with redundant braces initialized that level, return the
5287 c_expr structure for that expression. Otherwise, the original_code
5288 element is set to ERROR_MARK.
5289 If we were outputting the elements as they are read, return 0 as the value
5290 from inner levels (process_init_element ignores that),
5291 but return error_mark_node as the value from the outermost level
5292 (that's what we want to put in DECL_INITIAL).
5293 Otherwise, return a CONSTRUCTOR expression as the value. */
5296 pop_init_level (int implicit)
5298 struct constructor_stack *p;
5301 ret.original_code = ERROR_MARK;
5305 /* When we come to an explicit close brace,
5306 pop any inner levels that didn't have explicit braces. */
5307 while (constructor_stack->implicit)
5308 process_init_element (pop_init_level (1));
5310 gcc_assert (!constructor_range_stack);
5313 /* Now output all pending elements. */
5314 constructor_incremental = 1;
5315 output_pending_init_elements (1);
5317 p = constructor_stack;
5319 /* Error for initializing a flexible array member, or a zero-length
5320 array member in an inappropriate context. */
5321 if (constructor_type && constructor_fields
5322 && TREE_CODE (constructor_type) == ARRAY_TYPE
5323 && TYPE_DOMAIN (constructor_type)
5324 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
5326 /* Silently discard empty initializations. The parser will
5327 already have pedwarned for empty brackets. */
5328 if (integer_zerop (constructor_unfilled_index))
5329 constructor_type = NULL_TREE;
5332 gcc_assert (!TYPE_SIZE (constructor_type));
5334 if (constructor_depth > 2)
5335 error_init ("initialization of flexible array member in a nested context");
5337 pedwarn_init ("initialization of a flexible array member");
5339 /* We have already issued an error message for the existence
5340 of a flexible array member not at the end of the structure.
5341 Discard the initializer so that we do not die later. */
5342 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
5343 constructor_type = NULL_TREE;
5347 /* Warn when some struct elements are implicitly initialized to zero. */
5348 if (warn_missing_field_initializers
5350 && TREE_CODE (constructor_type) == RECORD_TYPE
5351 && constructor_unfilled_fields)
5353 /* Do not warn for flexible array members or zero-length arrays. */
5354 while (constructor_unfilled_fields
5355 && (!DECL_SIZE (constructor_unfilled_fields)
5356 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
5357 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5359 /* Do not warn if this level of the initializer uses member
5360 designators; it is likely to be deliberate. */
5361 if (constructor_unfilled_fields && !constructor_designated)
5363 push_member_name (constructor_unfilled_fields);
5364 warning_init ("missing initializer");
5365 RESTORE_SPELLING_DEPTH (constructor_depth);
5369 /* Pad out the end of the structure. */
5370 if (p->replacement_value.value)
5371 /* If this closes a superfluous brace pair,
5372 just pass out the element between them. */
5373 ret = p->replacement_value;
5374 else if (constructor_type == 0)
5376 else if (TREE_CODE (constructor_type) != RECORD_TYPE
5377 && TREE_CODE (constructor_type) != UNION_TYPE
5378 && TREE_CODE (constructor_type) != ARRAY_TYPE
5379 && TREE_CODE (constructor_type) != VECTOR_TYPE)
5381 /* A nonincremental scalar initializer--just return
5382 the element, after verifying there is just one. */
5383 if (VEC_empty (constructor_elt,constructor_elements))
5385 if (!constructor_erroneous)
5386 error_init ("empty scalar initializer");
5387 ret.value = error_mark_node;
5389 else if (VEC_length (constructor_elt,constructor_elements) != 1)
5391 error_init ("extra elements in scalar initializer");
5392 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5395 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
5399 if (constructor_erroneous)
5400 ret.value = error_mark_node;
5403 ret.value = build_constructor (constructor_type,
5404 constructor_elements);
5405 if (constructor_constant)
5406 TREE_CONSTANT (ret.value) = TREE_INVARIANT (ret.value) = 1;
5407 if (constructor_constant && constructor_simple)
5408 TREE_STATIC (ret.value) = 1;
5412 constructor_type = p->type;
5413 constructor_fields = p->fields;
5414 constructor_index = p->index;
5415 constructor_max_index = p->max_index;
5416 constructor_unfilled_index = p->unfilled_index;
5417 constructor_unfilled_fields = p->unfilled_fields;
5418 constructor_bit_index = p->bit_index;
5419 constructor_elements = p->elements;
5420 constructor_constant = p->constant;
5421 constructor_simple = p->simple;
5422 constructor_erroneous = p->erroneous;
5423 constructor_incremental = p->incremental;
5424 constructor_designated = p->designated;
5425 constructor_pending_elts = p->pending_elts;
5426 constructor_depth = p->depth;
5428 constructor_range_stack = p->range_stack;
5429 RESTORE_SPELLING_DEPTH (constructor_depth);
5431 constructor_stack = p->next;
5436 if (constructor_stack == 0)
5438 ret.value = error_mark_node;
5446 /* Common handling for both array range and field name designators.
5447 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5450 set_designator (int array)
5453 enum tree_code subcode;
5455 /* Don't die if an entire brace-pair level is superfluous
5456 in the containing level. */
5457 if (constructor_type == 0)
5460 /* If there were errors in this designator list already, bail out
5462 if (designator_erroneous)
5465 if (!designator_depth)
5467 gcc_assert (!constructor_range_stack);
5469 /* Designator list starts at the level of closest explicit
5471 while (constructor_stack->implicit)
5472 process_init_element (pop_init_level (1));
5473 constructor_designated = 1;
5477 switch (TREE_CODE (constructor_type))
5481 subtype = TREE_TYPE (constructor_fields);
5482 if (subtype != error_mark_node)
5483 subtype = TYPE_MAIN_VARIANT (subtype);
5486 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
5492 subcode = TREE_CODE (subtype);
5493 if (array && subcode != ARRAY_TYPE)
5495 error_init ("array index in non-array initializer");
5498 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
5500 error_init ("field name not in record or union initializer");
5504 constructor_designated = 1;
5505 push_init_level (2);
5509 /* If there are range designators in designator list, push a new designator
5510 to constructor_range_stack. RANGE_END is end of such stack range or
5511 NULL_TREE if there is no range designator at this level. */
5514 push_range_stack (tree range_end)
5516 struct constructor_range_stack *p;
5518 p = GGC_NEW (struct constructor_range_stack);
5519 p->prev = constructor_range_stack;
5521 p->fields = constructor_fields;
5522 p->range_start = constructor_index;
5523 p->index = constructor_index;
5524 p->stack = constructor_stack;
5525 p->range_end = range_end;
5526 if (constructor_range_stack)
5527 constructor_range_stack->next = p;
5528 constructor_range_stack = p;
5531 /* Within an array initializer, specify the next index to be initialized.
5532 FIRST is that index. If LAST is nonzero, then initialize a range
5533 of indices, running from FIRST through LAST. */
5536 set_init_index (tree first, tree last)
5538 if (set_designator (1))
5541 designator_erroneous = 1;
5543 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
5544 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
5546 error_init ("array index in initializer not of integer type");
5550 if (TREE_CODE (first) != INTEGER_CST)
5551 error_init ("nonconstant array index in initializer");
5552 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
5553 error_init ("nonconstant array index in initializer");
5554 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
5555 error_init ("array index in non-array initializer");
5556 else if (tree_int_cst_sgn (first) == -1)
5557 error_init ("array index in initializer exceeds array bounds");
5558 else if (constructor_max_index
5559 && tree_int_cst_lt (constructor_max_index, first))
5560 error_init ("array index in initializer exceeds array bounds");
5563 constructor_index = convert (bitsizetype, first);
5567 if (tree_int_cst_equal (first, last))
5569 else if (tree_int_cst_lt (last, first))
5571 error_init ("empty index range in initializer");
5576 last = convert (bitsizetype, last);
5577 if (constructor_max_index != 0
5578 && tree_int_cst_lt (constructor_max_index, last))
5580 error_init ("array index range in initializer exceeds array bounds");
5587 designator_erroneous = 0;
5588 if (constructor_range_stack || last)
5589 push_range_stack (last);
5593 /* Within a struct initializer, specify the next field to be initialized. */
5596 set_init_label (tree fieldname)
5600 if (set_designator (0))
5603 designator_erroneous = 1;
5605 if (TREE_CODE (constructor_type) != RECORD_TYPE
5606 && TREE_CODE (constructor_type) != UNION_TYPE)
5608 error_init ("field name not in record or union initializer");
5612 for (tail = TYPE_FIELDS (constructor_type); tail;
5613 tail = TREE_CHAIN (tail))
5615 if (DECL_NAME (tail) == fieldname)
5620 error ("unknown field %qE specified in initializer", fieldname);
5623 constructor_fields = tail;
5625 designator_erroneous = 0;
5626 if (constructor_range_stack)
5627 push_range_stack (NULL_TREE);
5631 /* Add a new initializer to the tree of pending initializers. PURPOSE
5632 identifies the initializer, either array index or field in a structure.
5633 VALUE is the value of that index or field. */
5636 add_pending_init (tree purpose, tree value)
5638 struct init_node *p, **q, *r;
5640 q = &constructor_pending_elts;
5643 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5648 if (tree_int_cst_lt (purpose, p->purpose))
5650 else if (tree_int_cst_lt (p->purpose, purpose))
5654 if (TREE_SIDE_EFFECTS (p->value))
5655 warning_init ("initialized field with side-effects overwritten");
5665 bitpos = bit_position (purpose);
5669 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
5671 else if (p->purpose != purpose)
5675 if (TREE_SIDE_EFFECTS (p->value))
5676 warning_init ("initialized field with side-effects overwritten");
5683 r = GGC_NEW (struct init_node);
5684 r->purpose = purpose;
5695 struct init_node *s;
5699 if (p->balance == 0)
5701 else if (p->balance < 0)
5708 p->left->parent = p;
5725 constructor_pending_elts = r;
5730 struct init_node *t = r->right;
5734 r->right->parent = r;
5739 p->left->parent = p;
5742 p->balance = t->balance < 0;
5743 r->balance = -(t->balance > 0);
5758 constructor_pending_elts = t;
5764 /* p->balance == +1; growth of left side balances the node. */
5769 else /* r == p->right */
5771 if (p->balance == 0)
5772 /* Growth propagation from right side. */
5774 else if (p->balance > 0)
5781 p->right->parent = p;
5798 constructor_pending_elts = r;
5800 else /* r->balance == -1 */
5803 struct init_node *t = r->left;
5807 r->left->parent = r;
5812 p->right->parent = p;
5815 r->balance = (t->balance < 0);
5816 p->balance = -(t->balance > 0);
5831 constructor_pending_elts = t;
5837 /* p->balance == -1; growth of right side balances the node. */
5848 /* Build AVL tree from a sorted chain. */
5851 set_nonincremental_init (void)
5853 unsigned HOST_WIDE_INT ix;
5856 if (TREE_CODE (constructor_type) != RECORD_TYPE
5857 && TREE_CODE (constructor_type) != ARRAY_TYPE)
5860 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
5861 add_pending_init (index, value);
5862 constructor_elements = 0;
5863 if (TREE_CODE (constructor_type) == RECORD_TYPE)
5865 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
5866 /* Skip any nameless bit fields at the beginning. */
5867 while (constructor_unfilled_fields != 0
5868 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
5869 && DECL_NAME (constructor_unfilled_fields) == 0)
5870 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
5873 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5875 if (TYPE_DOMAIN (constructor_type))
5876 constructor_unfilled_index
5877 = convert (bitsizetype,
5878 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5880 constructor_unfilled_index = bitsize_zero_node;
5882 constructor_incremental = 0;
5885 /* Build AVL tree from a string constant. */
5888 set_nonincremental_init_from_string (tree str)
5890 tree value, purpose, type;
5891 HOST_WIDE_INT val[2];
5892 const char *p, *end;
5893 int byte, wchar_bytes, charwidth, bitpos;
5895 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
5897 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5898 == TYPE_PRECISION (char_type_node))
5902 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str)))
5903 == TYPE_PRECISION (wchar_type_node));
5904 wchar_bytes = TYPE_PRECISION (wchar_type_node) / BITS_PER_UNIT;
5906 charwidth = TYPE_PRECISION (char_type_node);
5907 type = TREE_TYPE (constructor_type);
5908 p = TREE_STRING_POINTER (str);
5909 end = p + TREE_STRING_LENGTH (str);
5911 for (purpose = bitsize_zero_node;
5912 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
5913 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
5915 if (wchar_bytes == 1)
5917 val[1] = (unsigned char) *p++;
5924 for (byte = 0; byte < wchar_bytes; byte++)
5926 if (BYTES_BIG_ENDIAN)
5927 bitpos = (wchar_bytes - byte - 1) * charwidth;
5929 bitpos = byte * charwidth;
5930 val[bitpos < HOST_BITS_PER_WIDE_INT]
5931 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
5932 << (bitpos % HOST_BITS_PER_WIDE_INT);
5936 if (!TYPE_UNSIGNED (type))
5938 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
5939 if (bitpos < HOST_BITS_PER_WIDE_INT)
5941 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
5943 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
5947 else if (bitpos == HOST_BITS_PER_WIDE_INT)
5952 else if (val[0] & (((HOST_WIDE_INT) 1)
5953 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
5954 val[0] |= ((HOST_WIDE_INT) -1)
5955 << (bitpos - HOST_BITS_PER_WIDE_INT);
5958 value = build_int_cst_wide (type, val[1], val[0]);
5959 add_pending_init (purpose, value);
5962 constructor_incremental = 0;
5965 /* Return value of FIELD in pending initializer or zero if the field was
5966 not initialized yet. */
5969 find_init_member (tree field)
5971 struct init_node *p;
5973 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5975 if (constructor_incremental
5976 && tree_int_cst_lt (field, constructor_unfilled_index))
5977 set_nonincremental_init ();
5979 p = constructor_pending_elts;
5982 if (tree_int_cst_lt (field, p->purpose))
5984 else if (tree_int_cst_lt (p->purpose, field))
5990 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
5992 tree bitpos = bit_position (field);
5994 if (constructor_incremental
5995 && (!constructor_unfilled_fields
5996 || tree_int_cst_lt (bitpos,
5997 bit_position (constructor_unfilled_fields))))
5998 set_nonincremental_init ();
6000 p = constructor_pending_elts;
6003 if (field == p->purpose)
6005 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6011 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6013 if (!VEC_empty (constructor_elt, constructor_elements)
6014 && (VEC_last (constructor_elt, constructor_elements)->index
6016 return VEC_last (constructor_elt, constructor_elements)->value;
6021 /* "Output" the next constructor element.
6022 At top level, really output it to assembler code now.
6023 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6024 TYPE is the data type that the containing data type wants here.
6025 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6026 If VALUE is a string constant, STRICT_STRING is true if it is
6027 unparenthesized or we should not warn here for it being parenthesized.
6028 For other types of VALUE, STRICT_STRING is not used.
6030 PENDING if non-nil means output pending elements that belong
6031 right after this element. (PENDING is normally 1;
6032 it is 0 while outputting pending elements, to avoid recursion.) */
6035 output_init_element (tree value, bool strict_string, tree type, tree field,
6038 constructor_elt *celt;
6040 if (type == error_mark_node || value == error_mark_node)
6042 constructor_erroneous = 1;
6045 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6046 && (TREE_CODE (value) == STRING_CST
6047 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6048 && !(TREE_CODE (value) == STRING_CST
6049 && TREE_CODE (type) == ARRAY_TYPE
6050 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6051 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6052 TYPE_MAIN_VARIANT (type)))
6053 value = array_to_pointer_conversion (value);
6055 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6056 && require_constant_value && !flag_isoc99 && pending)
6058 /* As an extension, allow initializing objects with static storage
6059 duration with compound literals (which are then treated just as
6060 the brace enclosed list they contain). */
6061 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6062 value = DECL_INITIAL (decl);
6065 if (value == error_mark_node)
6066 constructor_erroneous = 1;
6067 else if (!TREE_CONSTANT (value))
6068 constructor_constant = 0;
6069 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
6070 || ((TREE_CODE (constructor_type) == RECORD_TYPE
6071 || TREE_CODE (constructor_type) == UNION_TYPE)
6072 && DECL_C_BIT_FIELD (field)
6073 && TREE_CODE (value) != INTEGER_CST))
6074 constructor_simple = 0;
6076 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
6078 if (require_constant_value)
6080 error_init ("initializer element is not constant");
6081 value = error_mark_node;
6083 else if (require_constant_elements)
6084 pedwarn ("initializer element is not computable at load time");
6087 /* If this field is empty (and not at the end of structure),
6088 don't do anything other than checking the initializer. */
6090 && (TREE_TYPE (field) == error_mark_node
6091 || (COMPLETE_TYPE_P (TREE_TYPE (field))
6092 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
6093 && (TREE_CODE (constructor_type) == ARRAY_TYPE
6094 || TREE_CHAIN (field)))))
6097 value = digest_init (type, value, strict_string, require_constant_value);
6098 if (value == error_mark_node)
6100 constructor_erroneous = 1;
6104 /* If this element doesn't come next in sequence,
6105 put it on constructor_pending_elts. */
6106 if (TREE_CODE (constructor_type) == ARRAY_TYPE
6107 && (!constructor_incremental
6108 || !tree_int_cst_equal (field, constructor_unfilled_index)))
6110 if (constructor_incremental
6111 && tree_int_cst_lt (field, constructor_unfilled_index))
6112 set_nonincremental_init ();
6114 add_pending_init (field, value);
6117 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6118 && (!constructor_incremental
6119 || field != constructor_unfilled_fields))
6121 /* We do this for records but not for unions. In a union,
6122 no matter which field is specified, it can be initialized
6123 right away since it starts at the beginning of the union. */
6124 if (constructor_incremental)
6126 if (!constructor_unfilled_fields)
6127 set_nonincremental_init ();
6130 tree bitpos, unfillpos;
6132 bitpos = bit_position (field);
6133 unfillpos = bit_position (constructor_unfilled_fields);
6135 if (tree_int_cst_lt (bitpos, unfillpos))
6136 set_nonincremental_init ();
6140 add_pending_init (field, value);
6143 else if (TREE_CODE (constructor_type) == UNION_TYPE
6144 && !VEC_empty (constructor_elt, constructor_elements))
6146 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
6147 constructor_elements)->value))
6148 warning_init ("initialized field with side-effects overwritten");
6150 /* We can have just one union field set. */
6151 constructor_elements = 0;
6154 /* Otherwise, output this element either to
6155 constructor_elements or to the assembler file. */
6157 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
6158 celt->index = field;
6159 celt->value = value;
6161 /* Advance the variable that indicates sequential elements output. */
6162 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6163 constructor_unfilled_index
6164 = size_binop (PLUS_EXPR, constructor_unfilled_index,
6166 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6168 constructor_unfilled_fields
6169 = TREE_CHAIN (constructor_unfilled_fields);
6171 /* Skip any nameless bit fields. */
6172 while (constructor_unfilled_fields != 0
6173 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6174 && DECL_NAME (constructor_unfilled_fields) == 0)
6175 constructor_unfilled_fields =
6176 TREE_CHAIN (constructor_unfilled_fields);
6178 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6179 constructor_unfilled_fields = 0;
6181 /* Now output any pending elements which have become next. */
6183 output_pending_init_elements (0);
6186 /* Output any pending elements which have become next.
6187 As we output elements, constructor_unfilled_{fields,index}
6188 advances, which may cause other elements to become next;
6189 if so, they too are output.
6191 If ALL is 0, we return when there are
6192 no more pending elements to output now.
6194 If ALL is 1, we output space as necessary so that
6195 we can output all the pending elements. */
6198 output_pending_init_elements (int all)
6200 struct init_node *elt = constructor_pending_elts;
6205 /* Look through the whole pending tree.
6206 If we find an element that should be output now,
6207 output it. Otherwise, set NEXT to the element
6208 that comes first among those still pending. */
6213 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6215 if (tree_int_cst_equal (elt->purpose,
6216 constructor_unfilled_index))
6217 output_init_element (elt->value, true,
6218 TREE_TYPE (constructor_type),
6219 constructor_unfilled_index, 0);
6220 else if (tree_int_cst_lt (constructor_unfilled_index,
6223 /* Advance to the next smaller node. */
6228 /* We have reached the smallest node bigger than the
6229 current unfilled index. Fill the space first. */
6230 next = elt->purpose;
6236 /* Advance to the next bigger node. */
6241 /* We have reached the biggest node in a subtree. Find
6242 the parent of it, which is the next bigger node. */
6243 while (elt->parent && elt->parent->right == elt)
6246 if (elt && tree_int_cst_lt (constructor_unfilled_index,
6249 next = elt->purpose;
6255 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6256 || TREE_CODE (constructor_type) == UNION_TYPE)
6258 tree ctor_unfilled_bitpos, elt_bitpos;
6260 /* If the current record is complete we are done. */
6261 if (constructor_unfilled_fields == 0)
6264 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
6265 elt_bitpos = bit_position (elt->purpose);
6266 /* We can't compare fields here because there might be empty
6267 fields in between. */
6268 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
6270 constructor_unfilled_fields = elt->purpose;
6271 output_init_element (elt->value, true, TREE_TYPE (elt->purpose),
6274 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
6276 /* Advance to the next smaller node. */
6281 /* We have reached the smallest node bigger than the
6282 current unfilled field. Fill the space first. */
6283 next = elt->purpose;
6289 /* Advance to the next bigger node. */
6294 /* We have reached the biggest node in a subtree. Find
6295 the parent of it, which is the next bigger node. */
6296 while (elt->parent && elt->parent->right == elt)
6300 && (tree_int_cst_lt (ctor_unfilled_bitpos,
6301 bit_position (elt->purpose))))
6303 next = elt->purpose;
6311 /* Ordinarily return, but not if we want to output all
6312 and there are elements left. */
6313 if (!(all && next != 0))
6316 /* If it's not incremental, just skip over the gap, so that after
6317 jumping to retry we will output the next successive element. */
6318 if (TREE_CODE (constructor_type) == RECORD_TYPE
6319 || TREE_CODE (constructor_type) == UNION_TYPE)
6320 constructor_unfilled_fields = next;
6321 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6322 constructor_unfilled_index = next;
6324 /* ELT now points to the node in the pending tree with the next
6325 initializer to output. */
6329 /* Add one non-braced element to the current constructor level.
6330 This adjusts the current position within the constructor's type.
6331 This may also start or terminate implicit levels
6332 to handle a partly-braced initializer.
6334 Once this has found the correct level for the new element,
6335 it calls output_init_element. */
6338 process_init_element (struct c_expr value)
6340 tree orig_value = value.value;
6341 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
6342 bool strict_string = value.original_code == STRING_CST;
6344 designator_depth = 0;
6345 designator_erroneous = 0;
6347 /* Handle superfluous braces around string cst as in
6348 char x[] = {"foo"}; */
6351 && TREE_CODE (constructor_type) == ARRAY_TYPE
6352 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
6353 && integer_zerop (constructor_unfilled_index))
6355 if (constructor_stack->replacement_value.value)
6356 error_init ("excess elements in char array initializer");
6357 constructor_stack->replacement_value = value;
6361 if (constructor_stack->replacement_value.value != 0)
6363 error_init ("excess elements in struct initializer");
6367 /* Ignore elements of a brace group if it is entirely superfluous
6368 and has already been diagnosed. */
6369 if (constructor_type == 0)
6372 /* If we've exhausted any levels that didn't have braces,
6374 while (constructor_stack->implicit)
6376 if ((TREE_CODE (constructor_type) == RECORD_TYPE
6377 || TREE_CODE (constructor_type) == UNION_TYPE)
6378 && constructor_fields == 0)
6379 process_init_element (pop_init_level (1));
6380 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
6381 && (constructor_max_index == 0
6382 || tree_int_cst_lt (constructor_max_index,
6383 constructor_index)))
6384 process_init_element (pop_init_level (1));
6389 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6390 if (constructor_range_stack)
6392 /* If value is a compound literal and we'll be just using its
6393 content, don't put it into a SAVE_EXPR. */
6394 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
6395 || !require_constant_value
6397 value.value = save_expr (value.value);
6402 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6405 enum tree_code fieldcode;
6407 if (constructor_fields == 0)
6409 pedwarn_init ("excess elements in struct initializer");
6413 fieldtype = TREE_TYPE (constructor_fields);
6414 if (fieldtype != error_mark_node)
6415 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6416 fieldcode = TREE_CODE (fieldtype);
6418 /* Error for non-static initialization of a flexible array member. */
6419 if (fieldcode == ARRAY_TYPE
6420 && !require_constant_value
6421 && TYPE_SIZE (fieldtype) == NULL_TREE
6422 && TREE_CHAIN (constructor_fields) == NULL_TREE)
6424 error_init ("non-static initialization of a flexible array member");
6428 /* Accept a string constant to initialize a subarray. */
6429 if (value.value != 0
6430 && fieldcode == ARRAY_TYPE
6431 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6433 value.value = orig_value;
6434 /* Otherwise, if we have come to a subaggregate,
6435 and we don't have an element of its type, push into it. */
6436 else if (value.value != 0
6437 && value.value != error_mark_node
6438 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6439 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6440 || fieldcode == UNION_TYPE))
6442 push_init_level (1);
6448 push_member_name (constructor_fields);
6449 output_init_element (value.value, strict_string,
6450 fieldtype, constructor_fields, 1);
6451 RESTORE_SPELLING_DEPTH (constructor_depth);
6454 /* Do the bookkeeping for an element that was
6455 directly output as a constructor. */
6457 /* For a record, keep track of end position of last field. */
6458 if (DECL_SIZE (constructor_fields))
6459 constructor_bit_index
6460 = size_binop (PLUS_EXPR,
6461 bit_position (constructor_fields),
6462 DECL_SIZE (constructor_fields));
6464 /* If the current field was the first one not yet written out,
6465 it isn't now, so update. */
6466 if (constructor_unfilled_fields == constructor_fields)
6468 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6469 /* Skip any nameless bit fields. */
6470 while (constructor_unfilled_fields != 0
6471 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6472 && DECL_NAME (constructor_unfilled_fields) == 0)
6473 constructor_unfilled_fields =
6474 TREE_CHAIN (constructor_unfilled_fields);
6478 constructor_fields = TREE_CHAIN (constructor_fields);
6479 /* Skip any nameless bit fields at the beginning. */
6480 while (constructor_fields != 0
6481 && DECL_C_BIT_FIELD (constructor_fields)
6482 && DECL_NAME (constructor_fields) == 0)
6483 constructor_fields = TREE_CHAIN (constructor_fields);
6485 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6488 enum tree_code fieldcode;
6490 if (constructor_fields == 0)
6492 pedwarn_init ("excess elements in union initializer");
6496 fieldtype = TREE_TYPE (constructor_fields);
6497 if (fieldtype != error_mark_node)
6498 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
6499 fieldcode = TREE_CODE (fieldtype);
6501 /* Warn that traditional C rejects initialization of unions.
6502 We skip the warning if the value is zero. This is done
6503 under the assumption that the zero initializer in user
6504 code appears conditioned on e.g. __STDC__ to avoid
6505 "missing initializer" warnings and relies on default
6506 initialization to zero in the traditional C case.
6507 We also skip the warning if the initializer is designated,
6508 again on the assumption that this must be conditional on
6509 __STDC__ anyway (and we've already complained about the
6510 member-designator already). */
6511 if (!in_system_header && !constructor_designated
6512 && !(value.value && (integer_zerop (value.value)
6513 || real_zerop (value.value))))
6514 warning (OPT_Wtraditional, "traditional C rejects initialization "
6517 /* Accept a string constant to initialize a subarray. */
6518 if (value.value != 0
6519 && fieldcode == ARRAY_TYPE
6520 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
6522 value.value = orig_value;
6523 /* Otherwise, if we have come to a subaggregate,
6524 and we don't have an element of its type, push into it. */
6525 else if (value.value != 0
6526 && value.value != error_mark_node
6527 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
6528 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
6529 || fieldcode == UNION_TYPE))
6531 push_init_level (1);
6537 push_member_name (constructor_fields);
6538 output_init_element (value.value, strict_string,
6539 fieldtype, constructor_fields, 1);
6540 RESTORE_SPELLING_DEPTH (constructor_depth);
6543 /* Do the bookkeeping for an element that was
6544 directly output as a constructor. */
6546 constructor_bit_index = DECL_SIZE (constructor_fields);
6547 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
6550 constructor_fields = 0;
6552 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6554 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6555 enum tree_code eltcode = TREE_CODE (elttype);
6557 /* Accept a string constant to initialize a subarray. */
6558 if (value.value != 0
6559 && eltcode == ARRAY_TYPE
6560 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
6562 value.value = orig_value;
6563 /* Otherwise, if we have come to a subaggregate,
6564 and we don't have an element of its type, push into it. */
6565 else if (value.value != 0
6566 && value.value != error_mark_node
6567 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
6568 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
6569 || eltcode == UNION_TYPE))
6571 push_init_level (1);
6575 if (constructor_max_index != 0
6576 && (tree_int_cst_lt (constructor_max_index, constructor_index)
6577 || integer_all_onesp (constructor_max_index)))
6579 pedwarn_init ("excess elements in array initializer");
6583 /* Now output the actual element. */
6586 push_array_bounds (tree_low_cst (constructor_index, 0));
6587 output_init_element (value.value, strict_string,
6588 elttype, constructor_index, 1);
6589 RESTORE_SPELLING_DEPTH (constructor_depth);
6593 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6596 /* If we are doing the bookkeeping for an element that was
6597 directly output as a constructor, we must update
6598 constructor_unfilled_index. */
6599 constructor_unfilled_index = constructor_index;
6601 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6603 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6605 /* Do a basic check of initializer size. Note that vectors
6606 always have a fixed size derived from their type. */
6607 if (tree_int_cst_lt (constructor_max_index, constructor_index))
6609 pedwarn_init ("excess elements in vector initializer");
6613 /* Now output the actual element. */
6615 output_init_element (value.value, strict_string,
6616 elttype, constructor_index, 1);
6619 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
6622 /* If we are doing the bookkeeping for an element that was
6623 directly output as a constructor, we must update
6624 constructor_unfilled_index. */
6625 constructor_unfilled_index = constructor_index;
6628 /* Handle the sole element allowed in a braced initializer
6629 for a scalar variable. */
6630 else if (constructor_type != error_mark_node
6631 && constructor_fields == 0)
6633 pedwarn_init ("excess elements in scalar initializer");
6639 output_init_element (value.value, strict_string,
6640 constructor_type, NULL_TREE, 1);
6641 constructor_fields = 0;
6644 /* Handle range initializers either at this level or anywhere higher
6645 in the designator stack. */
6646 if (constructor_range_stack)
6648 struct constructor_range_stack *p, *range_stack;
6651 range_stack = constructor_range_stack;
6652 constructor_range_stack = 0;
6653 while (constructor_stack != range_stack->stack)
6655 gcc_assert (constructor_stack->implicit);
6656 process_init_element (pop_init_level (1));
6658 for (p = range_stack;
6659 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
6662 gcc_assert (constructor_stack->implicit);
6663 process_init_element (pop_init_level (1));
6666 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
6667 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
6672 constructor_index = p->index;
6673 constructor_fields = p->fields;
6674 if (finish && p->range_end && p->index == p->range_start)
6682 push_init_level (2);
6683 p->stack = constructor_stack;
6684 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
6685 p->index = p->range_start;
6689 constructor_range_stack = range_stack;
6696 constructor_range_stack = 0;
6699 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6700 (guaranteed to be 'volatile' or null) and ARGS (represented using
6701 an ASM_EXPR node). */
6703 build_asm_stmt (tree cv_qualifier, tree args)
6705 if (!ASM_VOLATILE_P (args) && cv_qualifier)
6706 ASM_VOLATILE_P (args) = 1;
6707 return add_stmt (args);
6710 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6711 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6712 SIMPLE indicates whether there was anything at all after the
6713 string in the asm expression -- asm("blah") and asm("blah" : )
6714 are subtly different. We use a ASM_EXPR node to represent this. */
6716 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
6722 const char *constraint;
6723 const char **oconstraints;
6724 bool allows_mem, allows_reg, is_inout;
6725 int ninputs, noutputs;
6727 ninputs = list_length (inputs);
6728 noutputs = list_length (outputs);
6729 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
6731 string = resolve_asm_operand_names (string, outputs, inputs);
6733 /* Remove output conversions that change the type but not the mode. */
6734 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
6736 tree output = TREE_VALUE (tail);
6738 /* ??? Really, this should not be here. Users should be using a
6739 proper lvalue, dammit. But there's a long history of using casts
6740 in the output operands. In cases like longlong.h, this becomes a
6741 primitive form of typechecking -- if the cast can be removed, then
6742 the output operand had a type of the proper width; otherwise we'll
6743 get an error. Gross, but ... */
6744 STRIP_NOPS (output);
6746 if (!lvalue_or_else (output, lv_asm))
6747 output = error_mark_node;
6749 if (output != error_mark_node
6750 && (TREE_READONLY (output)
6751 || TYPE_READONLY (TREE_TYPE (output))
6752 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
6753 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
6754 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
6755 readonly_error (output, lv_asm);
6757 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6758 oconstraints[i] = constraint;
6760 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
6761 &allows_mem, &allows_reg, &is_inout))
6763 /* If the operand is going to end up in memory,
6764 mark it addressable. */
6765 if (!allows_reg && !c_mark_addressable (output))
6766 output = error_mark_node;
6769 output = error_mark_node;
6771 TREE_VALUE (tail) = output;
6774 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
6778 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
6779 input = TREE_VALUE (tail);
6781 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
6782 oconstraints, &allows_mem, &allows_reg))
6784 /* If the operand is going to end up in memory,
6785 mark it addressable. */
6786 if (!allows_reg && allows_mem)
6788 /* Strip the nops as we allow this case. FIXME, this really
6789 should be rejected or made deprecated. */
6791 if (!c_mark_addressable (input))
6792 input = error_mark_node;
6796 input = error_mark_node;
6798 TREE_VALUE (tail) = input;
6801 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
6803 /* asm statements without outputs, including simple ones, are treated
6805 ASM_INPUT_P (args) = simple;
6806 ASM_VOLATILE_P (args) = (noutputs == 0);
6811 /* Generate a goto statement to LABEL. */
6814 c_finish_goto_label (tree label)
6816 tree decl = lookup_label (label);
6820 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
6822 error ("jump into statement expression");
6826 if (C_DECL_UNJUMPABLE_VM (decl))
6828 error ("jump into scope of identifier with variably modified type");
6832 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
6834 /* No jump from outside this statement expression context, so
6835 record that there is a jump from within this context. */
6836 struct c_label_list *nlist;
6837 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6838 nlist->next = label_context_stack_se->labels_used;
6839 nlist->label = decl;
6840 label_context_stack_se->labels_used = nlist;
6843 if (!C_DECL_UNDEFINABLE_VM (decl))
6845 /* No jump from outside this context context of identifiers with
6846 variably modified type, so record that there is a jump from
6847 within this context. */
6848 struct c_label_list *nlist;
6849 nlist = XOBNEW (&parser_obstack, struct c_label_list);
6850 nlist->next = label_context_stack_vm->labels_used;
6851 nlist->label = decl;
6852 label_context_stack_vm->labels_used = nlist;
6855 TREE_USED (decl) = 1;
6856 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
6859 /* Generate a computed goto statement to EXPR. */
6862 c_finish_goto_ptr (tree expr)
6865 pedwarn ("ISO C forbids %<goto *expr;%>");
6866 expr = convert (ptr_type_node, expr);
6867 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
6870 /* Generate a C `return' statement. RETVAL is the expression for what
6871 to return, or a null pointer for `return;' with no value. */
6874 c_finish_return (tree retval)
6876 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
6877 bool no_warning = false;
6879 if (TREE_THIS_VOLATILE (current_function_decl))
6880 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6884 current_function_returns_null = 1;
6885 if ((warn_return_type || flag_isoc99)
6886 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
6888 pedwarn_c99 ("%<return%> with no value, in "
6889 "function returning non-void");
6893 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
6895 current_function_returns_null = 1;
6896 if (pedantic || TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
6897 pedwarn ("%<return%> with a value, in function returning void");
6901 tree t = convert_for_assignment (valtype, retval, ic_return,
6902 NULL_TREE, NULL_TREE, 0);
6903 tree res = DECL_RESULT (current_function_decl);
6906 current_function_returns_value = 1;
6907 if (t == error_mark_node)
6910 inner = t = convert (TREE_TYPE (res), t);
6912 /* Strip any conversions, additions, and subtractions, and see if
6913 we are returning the address of a local variable. Warn if so. */
6916 switch (TREE_CODE (inner))
6918 case NOP_EXPR: case NON_LVALUE_EXPR: case CONVERT_EXPR:
6920 inner = TREE_OPERAND (inner, 0);
6924 /* If the second operand of the MINUS_EXPR has a pointer
6925 type (or is converted from it), this may be valid, so
6926 don't give a warning. */
6928 tree op1 = TREE_OPERAND (inner, 1);
6930 while (!POINTER_TYPE_P (TREE_TYPE (op1))
6931 && (TREE_CODE (op1) == NOP_EXPR
6932 || TREE_CODE (op1) == NON_LVALUE_EXPR
6933 || TREE_CODE (op1) == CONVERT_EXPR))
6934 op1 = TREE_OPERAND (op1, 0);
6936 if (POINTER_TYPE_P (TREE_TYPE (op1)))
6939 inner = TREE_OPERAND (inner, 0);
6944 inner = TREE_OPERAND (inner, 0);
6946 while (REFERENCE_CLASS_P (inner)
6947 && TREE_CODE (inner) != INDIRECT_REF)
6948 inner = TREE_OPERAND (inner, 0);
6951 && !DECL_EXTERNAL (inner)
6952 && !TREE_STATIC (inner)
6953 && DECL_CONTEXT (inner) == current_function_decl)
6954 warning (0, "function returns address of local variable");
6964 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
6967 ret_stmt = build_stmt (RETURN_EXPR, retval);
6968 TREE_NO_WARNING (ret_stmt) |= no_warning;
6969 return add_stmt (ret_stmt);
6973 /* The SWITCH_EXPR being built. */
6976 /* The original type of the testing expression, i.e. before the
6977 default conversion is applied. */
6980 /* A splay-tree mapping the low element of a case range to the high
6981 element, or NULL_TREE if there is no high element. Used to
6982 determine whether or not a new case label duplicates an old case
6983 label. We need a tree, rather than simply a hash table, because
6984 of the GNU case range extension. */
6987 /* Number of nested statement expressions within this switch
6988 statement; if nonzero, case and default labels may not
6990 unsigned int blocked_stmt_expr;
6992 /* Scope of outermost declarations of identifiers with variably
6993 modified type within this switch statement; if nonzero, case and
6994 default labels may not appear. */
6995 unsigned int blocked_vm;
6997 /* The next node on the stack. */
6998 struct c_switch *next;
7001 /* A stack of the currently active switch statements. The innermost
7002 switch statement is on the top of the stack. There is no need to
7003 mark the stack for garbage collection because it is only active
7004 during the processing of the body of a function, and we never
7005 collect at that point. */
7007 struct c_switch *c_switch_stack;
7009 /* Start a C switch statement, testing expression EXP. Return the new
7013 c_start_case (tree exp)
7015 enum tree_code code;
7016 tree type, orig_type = error_mark_node;
7017 struct c_switch *cs;
7019 if (exp != error_mark_node)
7021 code = TREE_CODE (TREE_TYPE (exp));
7022 orig_type = TREE_TYPE (exp);
7024 if (!INTEGRAL_TYPE_P (orig_type)
7025 && code != ERROR_MARK)
7027 error ("switch quantity not an integer");
7028 exp = integer_zero_node;
7029 orig_type = error_mark_node;
7033 type = TYPE_MAIN_VARIANT (TREE_TYPE (exp));
7035 if (!in_system_header
7036 && (type == long_integer_type_node
7037 || type == long_unsigned_type_node))
7038 warning (OPT_Wtraditional, "%<long%> switch expression not "
7039 "converted to %<int%> in ISO C");
7041 exp = default_conversion (exp);
7042 type = TREE_TYPE (exp);
7046 /* Add this new SWITCH_EXPR to the stack. */
7047 cs = XNEW (struct c_switch);
7048 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
7049 cs->orig_type = orig_type;
7050 cs->cases = splay_tree_new (case_compare, NULL, NULL);
7051 cs->blocked_stmt_expr = 0;
7053 cs->next = c_switch_stack;
7054 c_switch_stack = cs;
7056 return add_stmt (cs->switch_expr);
7059 /* Process a case label. */
7062 do_case (tree low_value, tree high_value)
7064 tree label = NULL_TREE;
7066 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
7067 && !c_switch_stack->blocked_vm)
7069 label = c_add_case_label (c_switch_stack->cases,
7070 SWITCH_COND (c_switch_stack->switch_expr),
7071 c_switch_stack->orig_type,
7072 low_value, high_value);
7073 if (label == error_mark_node)
7076 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
7079 error ("case label in statement expression not containing "
7080 "enclosing switch statement");
7082 error ("%<default%> label in statement expression not containing "
7083 "enclosing switch statement");
7085 else if (c_switch_stack && c_switch_stack->blocked_vm)
7088 error ("case label in scope of identifier with variably modified "
7089 "type not containing enclosing switch statement");
7091 error ("%<default%> label in scope of identifier with variably "
7092 "modified type not containing enclosing switch statement");
7095 error ("case label not within a switch statement");
7097 error ("%<default%> label not within a switch statement");
7102 /* Finish the switch statement. */
7105 c_finish_case (tree body)
7107 struct c_switch *cs = c_switch_stack;
7108 location_t switch_location;
7110 SWITCH_BODY (cs->switch_expr) = body;
7112 /* We must not be within a statement expression nested in the switch
7113 at this point; we might, however, be within the scope of an
7114 identifier with variably modified type nested in the switch. */
7115 gcc_assert (!cs->blocked_stmt_expr);
7117 /* Emit warnings as needed. */
7118 if (EXPR_HAS_LOCATION (cs->switch_expr))
7119 switch_location = EXPR_LOCATION (cs->switch_expr);
7121 switch_location = input_location;
7122 c_do_switch_warnings (cs->cases, switch_location,
7123 TREE_TYPE (cs->switch_expr),
7124 SWITCH_COND (cs->switch_expr));
7126 /* Pop the stack. */
7127 c_switch_stack = cs->next;
7128 splay_tree_delete (cs->cases);
7132 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7133 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7134 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7135 statement, and was not surrounded with parenthesis. */
7138 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
7139 tree else_block, bool nested_if)
7143 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7144 if (warn_parentheses && nested_if && else_block == NULL)
7146 tree inner_if = then_block;
7148 /* We know from the grammar productions that there is an IF nested
7149 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7150 it might not be exactly THEN_BLOCK, but should be the last
7151 non-container statement within. */
7153 switch (TREE_CODE (inner_if))
7158 inner_if = BIND_EXPR_BODY (inner_if);
7160 case STATEMENT_LIST:
7161 inner_if = expr_last (then_block);
7163 case TRY_FINALLY_EXPR:
7164 case TRY_CATCH_EXPR:
7165 inner_if = TREE_OPERAND (inner_if, 0);
7172 if (COND_EXPR_ELSE (inner_if))
7173 warning (OPT_Wparentheses,
7174 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7178 /* Diagnose ";" via the special empty statement node that we create. */
7181 tree *inner_then = &then_block, *inner_else = &else_block;
7183 if (TREE_CODE (*inner_then) == STATEMENT_LIST
7184 && STATEMENT_LIST_TAIL (*inner_then))
7185 inner_then = &STATEMENT_LIST_TAIL (*inner_then)->stmt;
7186 if (*inner_else && TREE_CODE (*inner_else) == STATEMENT_LIST
7187 && STATEMENT_LIST_TAIL (*inner_else))
7188 inner_else = &STATEMENT_LIST_TAIL (*inner_else)->stmt;
7190 if (TREE_CODE (*inner_then) == NOP_EXPR && !TREE_TYPE (*inner_then))
7193 warning (0, "%Hempty body in an if-statement",
7194 EXPR_LOCUS (*inner_then));
7196 *inner_then = alloc_stmt_list ();
7199 && TREE_CODE (*inner_else) == NOP_EXPR
7200 && !TREE_TYPE (*inner_else))
7202 warning (0, "%Hempty body in an else-statement",
7203 EXPR_LOCUS (*inner_else));
7205 *inner_else = alloc_stmt_list ();
7209 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
7210 SET_EXPR_LOCATION (stmt, if_locus);
7214 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7215 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7216 is false for DO loops. INCR is the FOR increment expression. BODY is
7217 the statement controlled by the loop. BLAB is the break label. CLAB is
7218 the continue label. Everything is allowed to be NULL. */
7221 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
7222 tree blab, tree clab, bool cond_is_first)
7224 tree entry = NULL, exit = NULL, t;
7226 /* If the condition is zero don't generate a loop construct. */
7227 if (cond && integer_zerop (cond))
7231 t = build_and_jump (&blab);
7232 SET_EXPR_LOCATION (t, start_locus);
7238 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7240 /* If we have an exit condition, then we build an IF with gotos either
7241 out of the loop, or to the top of it. If there's no exit condition,
7242 then we just build a jump back to the top. */
7243 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
7245 if (cond && !integer_nonzerop (cond))
7247 /* Canonicalize the loop condition to the end. This means
7248 generating a branch to the loop condition. Reuse the
7249 continue label, if possible. */
7254 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
7255 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
7258 t = build1 (GOTO_EXPR, void_type_node, clab);
7259 SET_EXPR_LOCATION (t, start_locus);
7263 t = build_and_jump (&blab);
7264 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
7266 SET_EXPR_LOCATION (exit, start_locus);
7268 SET_EXPR_LOCATION (exit, input_location);
7277 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
7285 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
7289 c_finish_bc_stmt (tree *label_p, bool is_break)
7292 tree label = *label_p;
7294 /* In switch statements break is sometimes stylistically used after
7295 a return statement. This can lead to spurious warnings about
7296 control reaching the end of a non-void function when it is
7297 inlined. Note that we are calling block_may_fallthru with
7298 language specific tree nodes; this works because
7299 block_may_fallthru returns true when given something it does not
7301 skip = !block_may_fallthru (cur_stmt_list);
7306 *label_p = label = create_artificial_label ();
7308 else if (TREE_CODE (label) != LABEL_DECL)
7311 error ("break statement not within loop or switch");
7313 error ("continue statement not within a loop");
7320 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
7323 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7326 emit_side_effect_warnings (tree expr)
7328 if (expr == error_mark_node)
7330 else if (!TREE_SIDE_EFFECTS (expr))
7332 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
7333 warning (0, "%Hstatement with no effect",
7334 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
7336 else if (warn_unused_value)
7337 warn_if_unused_value (expr, input_location);
7340 /* Process an expression as if it were a complete statement. Emit
7341 diagnostics, but do not call ADD_STMT. */
7344 c_process_expr_stmt (tree expr)
7349 if (warn_sequence_point)
7350 verify_sequence_points (expr);
7352 if (TREE_TYPE (expr) != error_mark_node
7353 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
7354 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
7355 error ("expression statement has incomplete type");
7357 /* If we're not processing a statement expression, warn about unused values.
7358 Warnings for statement expressions will be emitted later, once we figure
7359 out which is the result. */
7360 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7361 && (extra_warnings || warn_unused_value))
7362 emit_side_effect_warnings (expr);
7364 /* If the expression is not of a type to which we cannot assign a line
7365 number, wrap the thing in a no-op NOP_EXPR. */
7366 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
7367 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
7370 SET_EXPR_LOCATION (expr, input_location);
7375 /* Emit an expression as a statement. */
7378 c_finish_expr_stmt (tree expr)
7381 return add_stmt (c_process_expr_stmt (expr));
7386 /* Do the opposite and emit a statement as an expression. To begin,
7387 create a new binding level and return it. */
7390 c_begin_stmt_expr (void)
7393 struct c_label_context_se *nstack;
7394 struct c_label_list *glist;
7396 /* We must force a BLOCK for this level so that, if it is not expanded
7397 later, there is a way to turn off the entire subtree of blocks that
7398 are contained in it. */
7400 ret = c_begin_compound_stmt (true);
7403 c_switch_stack->blocked_stmt_expr++;
7404 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7406 for (glist = label_context_stack_se->labels_used;
7408 glist = glist->next)
7410 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
7412 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
7413 nstack->labels_def = NULL;
7414 nstack->labels_used = NULL;
7415 nstack->next = label_context_stack_se;
7416 label_context_stack_se = nstack;
7418 /* Mark the current statement list as belonging to a statement list. */
7419 STATEMENT_LIST_STMT_EXPR (ret) = 1;
7425 c_finish_stmt_expr (tree body)
7427 tree last, type, tmp, val;
7429 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7431 body = c_end_compound_stmt (body, true);
7434 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
7435 c_switch_stack->blocked_stmt_expr--;
7437 /* It is no longer possible to jump to labels defined within this
7438 statement expression. */
7439 for (dlist = label_context_stack_se->labels_def;
7441 dlist = dlist->next)
7443 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
7445 /* It is again possible to define labels with a goto just outside
7446 this statement expression. */
7447 for (glist = label_context_stack_se->next->labels_used;
7449 glist = glist->next)
7451 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
7454 if (glist_prev != NULL)
7455 glist_prev->next = label_context_stack_se->labels_used;
7457 label_context_stack_se->next->labels_used
7458 = label_context_stack_se->labels_used;
7459 label_context_stack_se = label_context_stack_se->next;
7461 /* Locate the last statement in BODY. See c_end_compound_stmt
7462 about always returning a BIND_EXPR. */
7463 last_p = &BIND_EXPR_BODY (body);
7464 last = BIND_EXPR_BODY (body);
7467 if (TREE_CODE (last) == STATEMENT_LIST)
7469 tree_stmt_iterator i;
7471 /* This can happen with degenerate cases like ({ }). No value. */
7472 if (!TREE_SIDE_EFFECTS (last))
7475 /* If we're supposed to generate side effects warnings, process
7476 all of the statements except the last. */
7477 if (extra_warnings || warn_unused_value)
7479 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
7480 emit_side_effect_warnings (tsi_stmt (i));
7483 i = tsi_last (last);
7484 last_p = tsi_stmt_ptr (i);
7488 /* If the end of the list is exception related, then the list was split
7489 by a call to push_cleanup. Continue searching. */
7490 if (TREE_CODE (last) == TRY_FINALLY_EXPR
7491 || TREE_CODE (last) == TRY_CATCH_EXPR)
7493 last_p = &TREE_OPERAND (last, 0);
7495 goto continue_searching;
7498 /* In the case that the BIND_EXPR is not necessary, return the
7499 expression out from inside it. */
7500 if (last == error_mark_node
7501 || (last == BIND_EXPR_BODY (body)
7502 && BIND_EXPR_VARS (body) == NULL))
7504 /* Do not warn if the return value of a statement expression is
7507 TREE_NO_WARNING (last) = 1;
7511 /* Extract the type of said expression. */
7512 type = TREE_TYPE (last);
7514 /* If we're not returning a value at all, then the BIND_EXPR that
7515 we already have is a fine expression to return. */
7516 if (!type || VOID_TYPE_P (type))
7519 /* Now that we've located the expression containing the value, it seems
7520 silly to make voidify_wrapper_expr repeat the process. Create a
7521 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7522 tmp = create_tmp_var_raw (type, NULL);
7524 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7525 tree_expr_nonnegative_p giving up immediately. */
7527 if (TREE_CODE (val) == NOP_EXPR
7528 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
7529 val = TREE_OPERAND (val, 0);
7531 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
7532 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
7534 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
7537 /* Begin the scope of an identifier of variably modified type, scope
7538 number SCOPE. Jumping from outside this scope to inside it is not
7542 c_begin_vm_scope (unsigned int scope)
7544 struct c_label_context_vm *nstack;
7545 struct c_label_list *glist;
7547 gcc_assert (scope > 0);
7548 if (c_switch_stack && !c_switch_stack->blocked_vm)
7549 c_switch_stack->blocked_vm = scope;
7550 for (glist = label_context_stack_vm->labels_used;
7552 glist = glist->next)
7554 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
7556 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
7557 nstack->labels_def = NULL;
7558 nstack->labels_used = NULL;
7559 nstack->scope = scope;
7560 nstack->next = label_context_stack_vm;
7561 label_context_stack_vm = nstack;
7564 /* End a scope which may contain identifiers of variably modified
7565 type, scope number SCOPE. */
7568 c_end_vm_scope (unsigned int scope)
7570 if (label_context_stack_vm == NULL)
7572 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
7573 c_switch_stack->blocked_vm = 0;
7574 /* We may have a number of nested scopes of identifiers with
7575 variably modified type, all at this depth. Pop each in turn. */
7576 while (label_context_stack_vm->scope == scope)
7578 struct c_label_list *dlist, *glist, *glist_prev = NULL;
7580 /* It is no longer possible to jump to labels defined within this
7582 for (dlist = label_context_stack_vm->labels_def;
7584 dlist = dlist->next)
7586 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
7588 /* It is again possible to define labels with a goto just outside
7590 for (glist = label_context_stack_vm->next->labels_used;
7592 glist = glist->next)
7594 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
7597 if (glist_prev != NULL)
7598 glist_prev->next = label_context_stack_vm->labels_used;
7600 label_context_stack_vm->next->labels_used
7601 = label_context_stack_vm->labels_used;
7602 label_context_stack_vm = label_context_stack_vm->next;
7606 /* Begin and end compound statements. This is as simple as pushing
7607 and popping new statement lists from the tree. */
7610 c_begin_compound_stmt (bool do_scope)
7612 tree stmt = push_stmt_list ();
7619 c_end_compound_stmt (tree stmt, bool do_scope)
7625 if (c_dialect_objc ())
7626 objc_clear_super_receiver ();
7627 block = pop_scope ();
7630 stmt = pop_stmt_list (stmt);
7631 stmt = c_build_bind_expr (block, stmt);
7633 /* If this compound statement is nested immediately inside a statement
7634 expression, then force a BIND_EXPR to be created. Otherwise we'll
7635 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7636 STATEMENT_LISTs merge, and thus we can lose track of what statement
7639 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
7640 && TREE_CODE (stmt) != BIND_EXPR)
7642 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
7643 TREE_SIDE_EFFECTS (stmt) = 1;
7649 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7650 when the current scope is exited. EH_ONLY is true when this is not
7651 meant to apply to normal control flow transfer. */
7654 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
7656 enum tree_code code;
7660 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
7661 stmt = build_stmt (code, NULL, cleanup);
7663 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
7664 list = push_stmt_list ();
7665 TREE_OPERAND (stmt, 0) = list;
7666 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
7669 /* Build a binary-operation expression without default conversions.
7670 CODE is the kind of expression to build.
7671 This function differs from `build' in several ways:
7672 the data type of the result is computed and recorded in it,
7673 warnings are generated if arg data types are invalid,
7674 special handling for addition and subtraction of pointers is known,
7675 and some optimization is done (operations on narrow ints
7676 are done in the narrower type when that gives the same result).
7677 Constant folding is also done before the result is returned.
7679 Note that the operands will never have enumeral types, or function
7680 or array types, because either they will have the default conversions
7681 performed or they have both just been converted to some other type in which
7682 the arithmetic is to be done. */
7685 build_binary_op (enum tree_code code, tree orig_op0, tree orig_op1,
7689 enum tree_code code0, code1;
7691 const char *invalid_op_diag;
7693 /* Expression code to give to the expression when it is built.
7694 Normally this is CODE, which is what the caller asked for,
7695 but in some special cases we change it. */
7696 enum tree_code resultcode = code;
7698 /* Data type in which the computation is to be performed.
7699 In the simplest cases this is the common type of the arguments. */
7700 tree result_type = NULL;
7702 /* Nonzero means operands have already been type-converted
7703 in whatever way is necessary.
7704 Zero means they need to be converted to RESULT_TYPE. */
7707 /* Nonzero means create the expression with this type, rather than
7709 tree build_type = 0;
7711 /* Nonzero means after finally constructing the expression
7712 convert it to this type. */
7713 tree final_type = 0;
7715 /* Nonzero if this is an operation like MIN or MAX which can
7716 safely be computed in short if both args are promoted shorts.
7717 Also implies COMMON.
7718 -1 indicates a bitwise operation; this makes a difference
7719 in the exact conditions for when it is safe to do the operation
7720 in a narrower mode. */
7723 /* Nonzero if this is a comparison operation;
7724 if both args are promoted shorts, compare the original shorts.
7725 Also implies COMMON. */
7726 int short_compare = 0;
7728 /* Nonzero if this is a right-shift operation, which can be computed on the
7729 original short and then promoted if the operand is a promoted short. */
7730 int short_shift = 0;
7732 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7735 /* True means types are compatible as far as ObjC is concerned. */
7740 op0 = default_conversion (orig_op0);
7741 op1 = default_conversion (orig_op1);
7749 type0 = TREE_TYPE (op0);
7750 type1 = TREE_TYPE (op1);
7752 /* The expression codes of the data types of the arguments tell us
7753 whether the arguments are integers, floating, pointers, etc. */
7754 code0 = TREE_CODE (type0);
7755 code1 = TREE_CODE (type1);
7757 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7758 STRIP_TYPE_NOPS (op0);
7759 STRIP_TYPE_NOPS (op1);
7761 /* If an error was already reported for one of the arguments,
7762 avoid reporting another error. */
7764 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
7765 return error_mark_node;
7767 if ((invalid_op_diag
7768 = targetm.invalid_binary_op (code, type0, type1)))
7770 error (invalid_op_diag);
7771 return error_mark_node;
7774 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
7779 /* Handle the pointer + int case. */
7780 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7781 return pointer_int_sum (PLUS_EXPR, op0, op1);
7782 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
7783 return pointer_int_sum (PLUS_EXPR, op1, op0);
7789 /* Subtraction of two similar pointers.
7790 We must subtract them as integers, then divide by object size. */
7791 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
7792 && comp_target_types (type0, type1))
7793 return pointer_diff (op0, op1);
7794 /* Handle pointer minus int. Just like pointer plus int. */
7795 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
7796 return pointer_int_sum (MINUS_EXPR, op0, op1);
7805 case TRUNC_DIV_EXPR:
7807 case FLOOR_DIV_EXPR:
7808 case ROUND_DIV_EXPR:
7809 case EXACT_DIV_EXPR:
7810 /* Floating point division by zero is a legitimate way to obtain
7811 infinities and NaNs. */
7812 if (skip_evaluation == 0 && integer_zerop (op1))
7813 warning (OPT_Wdiv_by_zero, "division by zero");
7815 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7816 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7817 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7818 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
7820 enum tree_code tcode0 = code0, tcode1 = code1;
7822 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
7823 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
7824 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
7825 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
7827 if (!(tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE))
7828 resultcode = RDIV_EXPR;
7830 /* Although it would be tempting to shorten always here, that
7831 loses on some targets, since the modulo instruction is
7832 undefined if the quotient can't be represented in the
7833 computation mode. We shorten only if unsigned or if
7834 dividing by something we know != -1. */
7835 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7836 || (TREE_CODE (op1) == INTEGER_CST
7837 && !integer_all_onesp (op1)));
7845 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7847 else if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE)
7851 case TRUNC_MOD_EXPR:
7852 case FLOOR_MOD_EXPR:
7853 if (skip_evaluation == 0 && integer_zerop (op1))
7854 warning (OPT_Wdiv_by_zero, "division by zero");
7856 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7858 /* Although it would be tempting to shorten always here, that loses
7859 on some targets, since the modulo instruction is undefined if the
7860 quotient can't be represented in the computation mode. We shorten
7861 only if unsigned or if dividing by something we know != -1. */
7862 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
7863 || (TREE_CODE (op1) == INTEGER_CST
7864 && !integer_all_onesp (op1)));
7869 case TRUTH_ANDIF_EXPR:
7870 case TRUTH_ORIF_EXPR:
7871 case TRUTH_AND_EXPR:
7873 case TRUTH_XOR_EXPR:
7874 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
7875 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE)
7876 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
7877 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE))
7879 /* Result of these operations is always an int,
7880 but that does not mean the operands should be
7881 converted to ints! */
7882 result_type = integer_type_node;
7883 op0 = c_common_truthvalue_conversion (op0);
7884 op1 = c_common_truthvalue_conversion (op1);
7889 /* Shift operations: result has same type as first operand;
7890 always convert second operand to int.
7891 Also set SHORT_SHIFT if shifting rightward. */
7894 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7896 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7898 if (tree_int_cst_sgn (op1) < 0)
7899 warning (0, "right shift count is negative");
7902 if (!integer_zerop (op1))
7905 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7906 warning (0, "right shift count >= width of type");
7910 /* Use the type of the value to be shifted. */
7911 result_type = type0;
7912 /* Convert the shift-count to an integer, regardless of size
7913 of value being shifted. */
7914 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7915 op1 = convert (integer_type_node, op1);
7916 /* Avoid converting op1 to result_type later. */
7922 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
7924 if (TREE_CODE (op1) == INTEGER_CST && skip_evaluation == 0)
7926 if (tree_int_cst_sgn (op1) < 0)
7927 warning (0, "left shift count is negative");
7929 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
7930 warning (0, "left shift count >= width of type");
7933 /* Use the type of the value to be shifted. */
7934 result_type = type0;
7935 /* Convert the shift-count to an integer, regardless of size
7936 of value being shifted. */
7937 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
7938 op1 = convert (integer_type_node, op1);
7939 /* Avoid converting op1 to result_type later. */
7946 if (code0 == REAL_TYPE || code1 == REAL_TYPE)
7947 warning (OPT_Wfloat_equal,
7948 "comparing floating point with == or != is unsafe");
7949 /* Result of comparison is always int,
7950 but don't convert the args to int! */
7951 build_type = integer_type_node;
7952 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
7953 || code0 == COMPLEX_TYPE)
7954 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
7955 || code1 == COMPLEX_TYPE))
7957 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
7959 tree tt0 = TREE_TYPE (type0);
7960 tree tt1 = TREE_TYPE (type1);
7961 /* Anything compares with void *. void * compares with anything.
7962 Otherwise, the targets must be compatible
7963 and both must be object or both incomplete. */
7964 if (comp_target_types (type0, type1))
7965 result_type = common_pointer_type (type0, type1);
7966 else if (VOID_TYPE_P (tt0))
7968 /* op0 != orig_op0 detects the case of something
7969 whose value is 0 but which isn't a valid null ptr const. */
7970 if (pedantic && !null_pointer_constant_p (orig_op0)
7971 && TREE_CODE (tt1) == FUNCTION_TYPE)
7972 pedwarn ("ISO C forbids comparison of %<void *%>"
7973 " with function pointer");
7975 else if (VOID_TYPE_P (tt1))
7977 if (pedantic && !null_pointer_constant_p (orig_op1)
7978 && TREE_CODE (tt0) == FUNCTION_TYPE)
7979 pedwarn ("ISO C forbids comparison of %<void *%>"
7980 " with function pointer");
7983 /* Avoid warning about the volatile ObjC EH puts on decls. */
7985 pedwarn ("comparison of distinct pointer types lacks a cast");
7987 if (result_type == NULL_TREE)
7988 result_type = ptr_type_node;
7990 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
7992 if (TREE_CODE (op0) == ADDR_EXPR
7993 && DECL_P (TREE_OPERAND (op0, 0))
7994 && !DECL_WEAK (TREE_OPERAND (op0, 0)))
7995 warning (OPT_Walways_true, "the address of %qD will never be NULL",
7996 TREE_OPERAND (op0, 0));
7997 result_type = type0;
7999 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8001 if (TREE_CODE (op1) == ADDR_EXPR
8002 && DECL_P (TREE_OPERAND (op1, 0))
8003 && !DECL_WEAK (TREE_OPERAND (op1, 0)))
8004 warning (OPT_Walways_true, "the address of %qD will never be NULL",
8005 TREE_OPERAND (op1, 0));
8006 result_type = type1;
8008 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8010 result_type = type0;
8011 pedwarn ("comparison between pointer and integer");
8013 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8015 result_type = type1;
8016 pedwarn ("comparison between pointer and integer");
8024 build_type = integer_type_node;
8025 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE)
8026 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE))
8028 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
8030 if (comp_target_types (type0, type1))
8032 result_type = common_pointer_type (type0, type1);
8033 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
8034 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
8035 pedwarn ("comparison of complete and incomplete pointers");
8037 && TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
8038 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
8042 result_type = ptr_type_node;
8043 pedwarn ("comparison of distinct pointer types lacks a cast");
8046 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
8048 result_type = type0;
8049 if (pedantic || extra_warnings)
8050 pedwarn ("ordered comparison of pointer with integer zero");
8052 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
8054 result_type = type1;
8056 pedwarn ("ordered comparison of pointer with integer zero");
8058 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8060 result_type = type0;
8061 pedwarn ("comparison between pointer and integer");
8063 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
8065 result_type = type1;
8066 pedwarn ("comparison between pointer and integer");
8074 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8075 return error_mark_node;
8077 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
8078 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
8079 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
8080 TREE_TYPE (type1))))
8082 binary_op_error (code);
8083 return error_mark_node;
8086 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8087 || code0 == VECTOR_TYPE)
8089 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8090 || code1 == VECTOR_TYPE))
8092 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
8094 if (shorten || common || short_compare)
8095 result_type = c_common_type (type0, type1);
8097 /* For certain operations (which identify themselves by shorten != 0)
8098 if both args were extended from the same smaller type,
8099 do the arithmetic in that type and then extend.
8101 shorten !=0 and !=1 indicates a bitwise operation.
8102 For them, this optimization is safe only if
8103 both args are zero-extended or both are sign-extended.
8104 Otherwise, we might change the result.
8105 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8106 but calculated in (unsigned short) it would be (unsigned short)-1. */
8108 if (shorten && none_complex)
8110 int unsigned0, unsigned1;
8111 tree arg0 = get_narrower (op0, &unsigned0);
8112 tree arg1 = get_narrower (op1, &unsigned1);
8113 /* UNS is 1 if the operation to be done is an unsigned one. */
8114 int uns = TYPE_UNSIGNED (result_type);
8117 final_type = result_type;
8119 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
8120 but it *requires* conversion to FINAL_TYPE. */
8122 if ((TYPE_PRECISION (TREE_TYPE (op0))
8123 == TYPE_PRECISION (TREE_TYPE (arg0)))
8124 && TREE_TYPE (op0) != final_type)
8125 unsigned0 = TYPE_UNSIGNED (TREE_TYPE (op0));
8126 if ((TYPE_PRECISION (TREE_TYPE (op1))
8127 == TYPE_PRECISION (TREE_TYPE (arg1)))
8128 && TREE_TYPE (op1) != final_type)
8129 unsigned1 = TYPE_UNSIGNED (TREE_TYPE (op1));
8131 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
8133 /* For bitwise operations, signedness of nominal type
8134 does not matter. Consider only how operands were extended. */
8138 /* Note that in all three cases below we refrain from optimizing
8139 an unsigned operation on sign-extended args.
8140 That would not be valid. */
8142 /* Both args variable: if both extended in same way
8143 from same width, do it in that width.
8144 Do it unsigned if args were zero-extended. */
8145 if ((TYPE_PRECISION (TREE_TYPE (arg0))
8146 < TYPE_PRECISION (result_type))
8147 && (TYPE_PRECISION (TREE_TYPE (arg1))
8148 == TYPE_PRECISION (TREE_TYPE (arg0)))
8149 && unsigned0 == unsigned1
8150 && (unsigned0 || !uns))
8152 = c_common_signed_or_unsigned_type
8153 (unsigned0, common_type (TREE_TYPE (arg0), TREE_TYPE (arg1)));
8154 else if (TREE_CODE (arg0) == INTEGER_CST
8155 && (unsigned1 || !uns)
8156 && (TYPE_PRECISION (TREE_TYPE (arg1))
8157 < TYPE_PRECISION (result_type))
8159 = c_common_signed_or_unsigned_type (unsigned1,
8161 int_fits_type_p (arg0, type)))
8163 else if (TREE_CODE (arg1) == INTEGER_CST
8164 && (unsigned0 || !uns)
8165 && (TYPE_PRECISION (TREE_TYPE (arg0))
8166 < TYPE_PRECISION (result_type))
8168 = c_common_signed_or_unsigned_type (unsigned0,
8170 int_fits_type_p (arg1, type)))
8174 /* Shifts can be shortened if shifting right. */
8179 tree arg0 = get_narrower (op0, &unsigned_arg);
8181 final_type = result_type;
8183 if (arg0 == op0 && final_type == TREE_TYPE (op0))
8184 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
8186 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
8187 /* We can shorten only if the shift count is less than the
8188 number of bits in the smaller type size. */
8189 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
8190 /* We cannot drop an unsigned shift after sign-extension. */
8191 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
8193 /* Do an unsigned shift if the operand was zero-extended. */
8195 = c_common_signed_or_unsigned_type (unsigned_arg,
8197 /* Convert value-to-be-shifted to that type. */
8198 if (TREE_TYPE (op0) != result_type)
8199 op0 = convert (result_type, op0);
8204 /* Comparison operations are shortened too but differently.
8205 They identify themselves by setting short_compare = 1. */
8209 /* Don't write &op0, etc., because that would prevent op0
8210 from being kept in a register.
8211 Instead, make copies of the our local variables and
8212 pass the copies by reference, then copy them back afterward. */
8213 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
8214 enum tree_code xresultcode = resultcode;
8216 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
8221 op0 = xop0, op1 = xop1;
8223 resultcode = xresultcode;
8225 if (warn_sign_compare && skip_evaluation == 0)
8227 int op0_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op0));
8228 int op1_signed = !TYPE_UNSIGNED (TREE_TYPE (orig_op1));
8229 int unsignedp0, unsignedp1;
8230 tree primop0 = get_narrower (op0, &unsignedp0);
8231 tree primop1 = get_narrower (op1, &unsignedp1);
8235 STRIP_TYPE_NOPS (xop0);
8236 STRIP_TYPE_NOPS (xop1);
8238 /* Give warnings for comparisons between signed and unsigned
8239 quantities that may fail.
8241 Do the checking based on the original operand trees, so that
8242 casts will be considered, but default promotions won't be.
8244 Do not warn if the comparison is being done in a signed type,
8245 since the signed type will only be chosen if it can represent
8246 all the values of the unsigned type. */
8247 if (!TYPE_UNSIGNED (result_type))
8249 /* Do not warn if both operands are the same signedness. */
8250 else if (op0_signed == op1_signed)
8257 sop = xop0, uop = xop1;
8259 sop = xop1, uop = xop0;
8261 /* Do not warn if the signed quantity is an
8262 unsuffixed integer literal (or some static
8263 constant expression involving such literals or a
8264 conditional expression involving such literals)
8265 and it is non-negative. */
8266 if (tree_expr_nonnegative_p (sop))
8268 /* Do not warn if the comparison is an equality operation,
8269 the unsigned quantity is an integral constant, and it
8270 would fit in the result if the result were signed. */
8271 else if (TREE_CODE (uop) == INTEGER_CST
8272 && (resultcode == EQ_EXPR || resultcode == NE_EXPR)
8274 (uop, c_common_signed_type (result_type)))
8276 /* Do not warn if the unsigned quantity is an enumeration
8277 constant and its maximum value would fit in the result
8278 if the result were signed. */
8279 else if (TREE_CODE (uop) == INTEGER_CST
8280 && TREE_CODE (TREE_TYPE (uop)) == ENUMERAL_TYPE
8282 (TYPE_MAX_VALUE (TREE_TYPE (uop)),
8283 c_common_signed_type (result_type)))
8286 warning (0, "comparison between signed and unsigned");
8289 /* Warn if two unsigned values are being compared in a size
8290 larger than their original size, and one (and only one) is the
8291 result of a `~' operator. This comparison will always fail.
8293 Also warn if one operand is a constant, and the constant
8294 does not have all bits set that are set in the ~ operand
8295 when it is extended. */
8297 if ((TREE_CODE (primop0) == BIT_NOT_EXPR)
8298 != (TREE_CODE (primop1) == BIT_NOT_EXPR))
8300 if (TREE_CODE (primop0) == BIT_NOT_EXPR)
8301 primop0 = get_narrower (TREE_OPERAND (primop0, 0),
8304 primop1 = get_narrower (TREE_OPERAND (primop1, 0),
8307 if (host_integerp (primop0, 0) || host_integerp (primop1, 0))
8310 HOST_WIDE_INT constant, mask;
8311 int unsignedp, bits;
8313 if (host_integerp (primop0, 0))
8316 unsignedp = unsignedp1;
8317 constant = tree_low_cst (primop0, 0);
8322 unsignedp = unsignedp0;
8323 constant = tree_low_cst (primop1, 0);
8326 bits = TYPE_PRECISION (TREE_TYPE (primop));
8327 if (bits < TYPE_PRECISION (result_type)
8328 && bits < HOST_BITS_PER_WIDE_INT && unsignedp)
8330 mask = (~(HOST_WIDE_INT) 0) << bits;
8331 if ((mask & constant) != mask)
8332 warning (0, "comparison of promoted ~unsigned with constant");
8335 else if (unsignedp0 && unsignedp1
8336 && (TYPE_PRECISION (TREE_TYPE (primop0))
8337 < TYPE_PRECISION (result_type))
8338 && (TYPE_PRECISION (TREE_TYPE (primop1))
8339 < TYPE_PRECISION (result_type)))
8340 warning (0, "comparison of promoted ~unsigned with unsigned");
8346 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8347 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8348 Then the expression will be built.
8349 It will be given type FINAL_TYPE if that is nonzero;
8350 otherwise, it will be given type RESULT_TYPE. */
8354 binary_op_error (code);
8355 return error_mark_node;
8360 if (TREE_TYPE (op0) != result_type)
8361 op0 = convert (result_type, op0);
8362 if (TREE_TYPE (op1) != result_type)
8363 op1 = convert (result_type, op1);
8365 /* This can happen if one operand has a vector type, and the other
8366 has a different type. */
8367 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
8368 return error_mark_node;
8371 if (build_type == NULL_TREE)
8372 build_type = result_type;
8375 /* Treat expressions in initializers specially as they can't trap. */
8376 tree result = require_constant_value ? fold_build2_initializer (resultcode,
8379 : fold_build2 (resultcode, build_type,
8382 if (final_type != 0)
8383 result = convert (final_type, result);
8389 /* Convert EXPR to be a truth-value, validating its type for this
8393 c_objc_common_truthvalue_conversion (tree expr)
8395 switch (TREE_CODE (TREE_TYPE (expr)))
8398 error ("used array that cannot be converted to pointer where scalar is required");
8399 return error_mark_node;
8402 error ("used struct type value where scalar is required");
8403 return error_mark_node;
8406 error ("used union type value where scalar is required");
8407 return error_mark_node;
8416 /* ??? Should we also give an error for void and vectors rather than
8417 leaving those to give errors later? */
8418 return c_common_truthvalue_conversion (expr);
8422 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8426 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED,
8427 bool *ti ATTRIBUTE_UNUSED, bool *se)
8429 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
8431 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
8432 /* Executing a compound literal inside a function reinitializes
8434 if (!TREE_STATIC (decl))