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, 2007, 2008, 2009
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 3, 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 COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* This file is part of the C front end.
24 It contains routines to build C expressions given their operands,
25 including computing the types of the result, C-specific error checks,
26 and some optimization. */
30 #include "coretypes.h"
34 #include "langhooks.h"
44 #include "tree-iterator.h"
46 #include "tree-flow.h"
48 /* Possible cases of implicit bad conversions. Used to select
49 diagnostic messages in convert_for_assignment. */
57 /* Whether we are building a boolean conversion inside
58 convert_for_assignment, or some other late binary operation. If
59 build_binary_op is called (from code shared with C++) in this case,
60 then the operands have already been folded and the result will not
61 be folded again, so C_MAYBE_CONST_EXPR should not be generated. */
62 bool in_late_binary_op;
64 /* The level of nesting inside "__alignof__". */
67 /* The level of nesting inside "sizeof". */
70 /* The level of nesting inside "typeof". */
73 struct c_label_context_se *label_context_stack_se;
74 struct c_label_context_vm *label_context_stack_vm;
76 /* Nonzero if we've already printed a "missing braces around initializer"
77 message within this initializer. */
78 static int missing_braces_mentioned;
80 static int require_constant_value;
81 static int require_constant_elements;
83 static bool null_pointer_constant_p (const_tree);
84 static tree qualify_type (tree, tree);
85 static int tagged_types_tu_compatible_p (const_tree, const_tree);
86 static int comp_target_types (tree, tree);
87 static int function_types_compatible_p (const_tree, const_tree);
88 static int type_lists_compatible_p (const_tree, const_tree);
89 static tree lookup_field (tree, tree);
90 static int convert_arguments (tree, VEC(tree,gc) *, VEC(tree,gc) *, tree,
92 static tree pointer_diff (tree, tree);
93 static tree convert_for_assignment (tree, tree, tree, enum impl_conv, bool,
95 static tree valid_compound_expr_initializer (tree, tree);
96 static void push_string (const char *);
97 static void push_member_name (tree);
98 static int spelling_length (void);
99 static char *print_spelling (char *);
100 static void warning_init (int, const char *);
101 static tree digest_init (tree, tree, tree, bool, bool, int);
102 static void output_init_element (tree, tree, bool, tree, tree, int, bool);
103 static void output_pending_init_elements (int);
104 static int set_designator (int);
105 static void push_range_stack (tree);
106 static void add_pending_init (tree, tree, tree, bool);
107 static void set_nonincremental_init (void);
108 static void set_nonincremental_init_from_string (tree);
109 static tree find_init_member (tree);
110 static void readonly_error (tree, enum lvalue_use);
111 static void readonly_warning (tree, enum lvalue_use);
112 static int lvalue_or_else (const_tree, enum lvalue_use);
113 static void record_maybe_used_decl (tree);
114 static int comptypes_internal (const_tree, const_tree);
116 /* Return true if EXP is a null pointer constant, false otherwise. */
119 null_pointer_constant_p (const_tree expr)
121 /* This should really operate on c_expr structures, but they aren't
122 yet available everywhere required. */
123 tree type = TREE_TYPE (expr);
124 return (TREE_CODE (expr) == INTEGER_CST
125 && !TREE_OVERFLOW (expr)
126 && integer_zerop (expr)
127 && (INTEGRAL_TYPE_P (type)
128 || (TREE_CODE (type) == POINTER_TYPE
129 && VOID_TYPE_P (TREE_TYPE (type))
130 && TYPE_QUALS (TREE_TYPE (type)) == TYPE_UNQUALIFIED)));
133 /* EXPR may appear in an unevaluated part of an integer constant
134 expression, but not in an evaluated part. Wrap it in a
135 C_MAYBE_CONST_EXPR, or mark it with TREE_OVERFLOW if it is just an
136 INTEGER_CST and we cannot create a C_MAYBE_CONST_EXPR. */
139 note_integer_operands (tree expr)
142 if (TREE_CODE (expr) == INTEGER_CST && in_late_binary_op)
144 ret = copy_node (expr);
145 TREE_OVERFLOW (ret) = 1;
149 ret = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (expr), NULL_TREE, expr);
150 C_MAYBE_CONST_EXPR_INT_OPERANDS (ret) = 1;
155 /* Having checked whether EXPR may appear in an unevaluated part of an
156 integer constant expression and found that it may, remove any
157 C_MAYBE_CONST_EXPR noting this fact and return the resulting
161 remove_c_maybe_const_expr (tree expr)
163 if (TREE_CODE (expr) == C_MAYBE_CONST_EXPR)
164 return C_MAYBE_CONST_EXPR_EXPR (expr);
169 \f/* This is a cache to hold if two types are compatible or not. */
171 struct tagged_tu_seen_cache {
172 const struct tagged_tu_seen_cache * next;
175 /* The return value of tagged_types_tu_compatible_p if we had seen
176 these two types already. */
180 static const struct tagged_tu_seen_cache * tagged_tu_seen_base;
181 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *);
183 /* Do `exp = require_complete_type (exp);' to make sure exp
184 does not have an incomplete type. (That includes void types.) */
187 require_complete_type (tree value)
189 tree type = TREE_TYPE (value);
191 if (value == error_mark_node || type == error_mark_node)
192 return error_mark_node;
194 /* First, detect a valid value with a complete type. */
195 if (COMPLETE_TYPE_P (type))
198 c_incomplete_type_error (value, type);
199 return error_mark_node;
202 /* Print an error message for invalid use of an incomplete type.
203 VALUE is the expression that was used (or 0 if that isn't known)
204 and TYPE is the type that was invalid. */
207 c_incomplete_type_error (const_tree value, const_tree type)
209 const char *type_code_string;
211 /* Avoid duplicate error message. */
212 if (TREE_CODE (type) == ERROR_MARK)
215 if (value != 0 && (TREE_CODE (value) == VAR_DECL
216 || TREE_CODE (value) == PARM_DECL))
217 error ("%qD has an incomplete type", value);
221 /* We must print an error message. Be clever about what it says. */
223 switch (TREE_CODE (type))
226 type_code_string = "struct";
230 type_code_string = "union";
234 type_code_string = "enum";
238 error ("invalid use of void expression");
242 if (TYPE_DOMAIN (type))
244 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL)
246 error ("invalid use of flexible array member");
249 type = TREE_TYPE (type);
252 error ("invalid use of array with unspecified bounds");
259 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
260 error ("invalid use of undefined type %<%s %E%>",
261 type_code_string, TYPE_NAME (type));
263 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
264 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type));
268 /* Given a type, apply default promotions wrt unnamed function
269 arguments and return the new type. */
272 c_type_promotes_to (tree type)
274 if (TYPE_MAIN_VARIANT (type) == float_type_node)
275 return double_type_node;
277 if (c_promoting_integer_type_p (type))
279 /* Preserve unsignedness if not really getting any wider. */
280 if (TYPE_UNSIGNED (type)
281 && (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node)))
282 return unsigned_type_node;
283 return integer_type_node;
289 /* Return a variant of TYPE which has all the type qualifiers of LIKE
290 as well as those of TYPE. */
293 qualify_type (tree type, tree like)
295 return c_build_qualified_type (type,
296 TYPE_QUALS (type) | TYPE_QUALS (like));
299 /* Return true iff the given tree T is a variable length array. */
302 c_vla_type_p (const_tree t)
304 if (TREE_CODE (t) == ARRAY_TYPE
305 && C_TYPE_VARIABLE_SIZE (t))
310 /* Return the composite type of two compatible types.
312 We assume that comptypes has already been done and returned
313 nonzero; if that isn't so, this may crash. In particular, we
314 assume that qualifiers match. */
317 composite_type (tree t1, tree t2)
319 enum tree_code code1;
320 enum tree_code code2;
323 /* Save time if the two types are the same. */
325 if (t1 == t2) return t1;
327 /* If one type is nonsense, use the other. */
328 if (t1 == error_mark_node)
330 if (t2 == error_mark_node)
333 code1 = TREE_CODE (t1);
334 code2 = TREE_CODE (t2);
336 /* Merge the attributes. */
337 attributes = targetm.merge_type_attributes (t1, t2);
339 /* If one is an enumerated type and the other is the compatible
340 integer type, the composite type might be either of the two
341 (DR#013 question 3). For consistency, use the enumerated type as
342 the composite type. */
344 if (code1 == ENUMERAL_TYPE && code2 == INTEGER_TYPE)
346 if (code2 == ENUMERAL_TYPE && code1 == INTEGER_TYPE)
349 gcc_assert (code1 == code2);
354 /* For two pointers, do this recursively on the target type. */
356 tree pointed_to_1 = TREE_TYPE (t1);
357 tree pointed_to_2 = TREE_TYPE (t2);
358 tree target = composite_type (pointed_to_1, pointed_to_2);
359 t1 = build_pointer_type (target);
360 t1 = build_type_attribute_variant (t1, attributes);
361 return qualify_type (t1, t2);
366 tree elt = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
369 tree d1 = TYPE_DOMAIN (t1);
370 tree d2 = TYPE_DOMAIN (t2);
371 bool d1_variable, d2_variable;
372 bool d1_zero, d2_zero;
373 bool t1_complete, t2_complete;
375 /* We should not have any type quals on arrays at all. */
376 gcc_assert (!TYPE_QUALS (t1) && !TYPE_QUALS (t2));
378 t1_complete = COMPLETE_TYPE_P (t1);
379 t2_complete = COMPLETE_TYPE_P (t2);
381 d1_zero = d1 == 0 || !TYPE_MAX_VALUE (d1);
382 d2_zero = d2 == 0 || !TYPE_MAX_VALUE (d2);
384 d1_variable = (!d1_zero
385 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
386 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
387 d2_variable = (!d2_zero
388 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
389 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
390 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
391 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
393 /* Save space: see if the result is identical to one of the args. */
394 if (elt == TREE_TYPE (t1) && TYPE_DOMAIN (t1)
395 && (d2_variable || d2_zero || !d1_variable))
396 return build_type_attribute_variant (t1, attributes);
397 if (elt == TREE_TYPE (t2) && TYPE_DOMAIN (t2)
398 && (d1_variable || d1_zero || !d2_variable))
399 return build_type_attribute_variant (t2, attributes);
401 if (elt == TREE_TYPE (t1) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
402 return build_type_attribute_variant (t1, attributes);
403 if (elt == TREE_TYPE (t2) && !TYPE_DOMAIN (t2) && !TYPE_DOMAIN (t1))
404 return build_type_attribute_variant (t2, attributes);
406 /* Merge the element types, and have a size if either arg has
407 one. We may have qualifiers on the element types. To set
408 up TYPE_MAIN_VARIANT correctly, we need to form the
409 composite of the unqualified types and add the qualifiers
411 quals = TYPE_QUALS (strip_array_types (elt));
412 unqual_elt = c_build_qualified_type (elt, TYPE_UNQUALIFIED);
413 t1 = build_array_type (unqual_elt,
414 TYPE_DOMAIN ((TYPE_DOMAIN (t1)
420 /* Ensure a composite type involving a zero-length array type
421 is a zero-length type not an incomplete type. */
422 if (d1_zero && d2_zero
423 && (t1_complete || t2_complete)
424 && !COMPLETE_TYPE_P (t1))
426 TYPE_SIZE (t1) = bitsize_zero_node;
427 TYPE_SIZE_UNIT (t1) = size_zero_node;
429 t1 = c_build_qualified_type (t1, quals);
430 return build_type_attribute_variant (t1, attributes);
436 if (attributes != NULL)
438 /* Try harder not to create a new aggregate type. */
439 if (attribute_list_equal (TYPE_ATTRIBUTES (t1), attributes))
441 if (attribute_list_equal (TYPE_ATTRIBUTES (t2), attributes))
444 return build_type_attribute_variant (t1, attributes);
447 /* Function types: prefer the one that specified arg types.
448 If both do, merge the arg types. Also merge the return types. */
450 tree valtype = composite_type (TREE_TYPE (t1), TREE_TYPE (t2));
451 tree p1 = TYPE_ARG_TYPES (t1);
452 tree p2 = TYPE_ARG_TYPES (t2);
457 /* Save space: see if the result is identical to one of the args. */
458 if (valtype == TREE_TYPE (t1) && !TYPE_ARG_TYPES (t2))
459 return build_type_attribute_variant (t1, attributes);
460 if (valtype == TREE_TYPE (t2) && !TYPE_ARG_TYPES (t1))
461 return build_type_attribute_variant (t2, attributes);
463 /* Simple way if one arg fails to specify argument types. */
464 if (TYPE_ARG_TYPES (t1) == 0)
466 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t2));
467 t1 = build_type_attribute_variant (t1, attributes);
468 return qualify_type (t1, t2);
470 if (TYPE_ARG_TYPES (t2) == 0)
472 t1 = build_function_type (valtype, TYPE_ARG_TYPES (t1));
473 t1 = build_type_attribute_variant (t1, attributes);
474 return qualify_type (t1, t2);
477 /* If both args specify argument types, we must merge the two
478 lists, argument by argument. */
479 /* Tell global_bindings_p to return false so that variable_size
480 doesn't die on VLAs in parameter types. */
481 c_override_global_bindings_to_false = true;
483 len = list_length (p1);
486 for (i = 0; i < len; i++)
487 newargs = tree_cons (NULL_TREE, NULL_TREE, newargs);
492 p1 = TREE_CHAIN (p1), p2 = TREE_CHAIN (p2), n = TREE_CHAIN (n))
494 /* A null type means arg type is not specified.
495 Take whatever the other function type has. */
496 if (TREE_VALUE (p1) == 0)
498 TREE_VALUE (n) = TREE_VALUE (p2);
501 if (TREE_VALUE (p2) == 0)
503 TREE_VALUE (n) = TREE_VALUE (p1);
507 /* Given wait (union {union wait *u; int *i} *)
508 and wait (union wait *),
509 prefer union wait * as type of parm. */
510 if (TREE_CODE (TREE_VALUE (p1)) == UNION_TYPE
511 && TREE_VALUE (p1) != TREE_VALUE (p2))
514 tree mv2 = TREE_VALUE (p2);
515 if (mv2 && mv2 != error_mark_node
516 && TREE_CODE (mv2) != ARRAY_TYPE)
517 mv2 = TYPE_MAIN_VARIANT (mv2);
518 for (memb = TYPE_FIELDS (TREE_VALUE (p1));
519 memb; memb = TREE_CHAIN (memb))
521 tree mv3 = TREE_TYPE (memb);
522 if (mv3 && mv3 != error_mark_node
523 && TREE_CODE (mv3) != ARRAY_TYPE)
524 mv3 = TYPE_MAIN_VARIANT (mv3);
525 if (comptypes (mv3, mv2))
527 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
529 pedwarn (input_location, OPT_pedantic,
530 "function types not truly compatible in ISO C");
535 if (TREE_CODE (TREE_VALUE (p2)) == UNION_TYPE
536 && TREE_VALUE (p2) != TREE_VALUE (p1))
539 tree mv1 = TREE_VALUE (p1);
540 if (mv1 && mv1 != error_mark_node
541 && TREE_CODE (mv1) != ARRAY_TYPE)
542 mv1 = TYPE_MAIN_VARIANT (mv1);
543 for (memb = TYPE_FIELDS (TREE_VALUE (p2));
544 memb; memb = TREE_CHAIN (memb))
546 tree mv3 = TREE_TYPE (memb);
547 if (mv3 && mv3 != error_mark_node
548 && TREE_CODE (mv3) != ARRAY_TYPE)
549 mv3 = TYPE_MAIN_VARIANT (mv3);
550 if (comptypes (mv3, mv1))
552 TREE_VALUE (n) = composite_type (TREE_TYPE (memb),
554 pedwarn (input_location, OPT_pedantic,
555 "function types not truly compatible in ISO C");
560 TREE_VALUE (n) = composite_type (TREE_VALUE (p1), TREE_VALUE (p2));
564 c_override_global_bindings_to_false = false;
565 t1 = build_function_type (valtype, newargs);
566 t1 = qualify_type (t1, t2);
567 /* ... falls through ... */
571 return build_type_attribute_variant (t1, attributes);
576 /* Return the type of a conditional expression between pointers to
577 possibly differently qualified versions of compatible types.
579 We assume that comp_target_types has already been done and returned
580 nonzero; if that isn't so, this may crash. */
583 common_pointer_type (tree t1, tree t2)
586 tree pointed_to_1, mv1;
587 tree pointed_to_2, mv2;
589 unsigned target_quals;
591 /* Save time if the two types are the same. */
593 if (t1 == t2) return t1;
595 /* If one type is nonsense, use the other. */
596 if (t1 == error_mark_node)
598 if (t2 == error_mark_node)
601 gcc_assert (TREE_CODE (t1) == POINTER_TYPE
602 && TREE_CODE (t2) == POINTER_TYPE);
604 /* Merge the attributes. */
605 attributes = targetm.merge_type_attributes (t1, t2);
607 /* Find the composite type of the target types, and combine the
608 qualifiers of the two types' targets. Do not lose qualifiers on
609 array element types by taking the TYPE_MAIN_VARIANT. */
610 mv1 = pointed_to_1 = TREE_TYPE (t1);
611 mv2 = pointed_to_2 = TREE_TYPE (t2);
612 if (TREE_CODE (mv1) != ARRAY_TYPE)
613 mv1 = TYPE_MAIN_VARIANT (pointed_to_1);
614 if (TREE_CODE (mv2) != ARRAY_TYPE)
615 mv2 = TYPE_MAIN_VARIANT (pointed_to_2);
616 target = composite_type (mv1, mv2);
618 /* For function types do not merge const qualifiers, but drop them
619 if used inconsistently. The middle-end uses these to mark const
620 and noreturn functions. */
621 if (TREE_CODE (pointed_to_1) == FUNCTION_TYPE)
622 target_quals = TYPE_QUALS (pointed_to_1) & TYPE_QUALS (pointed_to_2);
624 target_quals = TYPE_QUALS (pointed_to_1) | TYPE_QUALS (pointed_to_2);
625 t1 = build_pointer_type (c_build_qualified_type (target, target_quals));
626 return build_type_attribute_variant (t1, attributes);
629 /* Return the common type for two arithmetic types under the usual
630 arithmetic conversions. The default conversions have already been
631 applied, and enumerated types converted to their compatible integer
632 types. The resulting type is unqualified and has no attributes.
634 This is the type for the result of most arithmetic operations
635 if the operands have the given two types. */
638 c_common_type (tree t1, tree t2)
640 enum tree_code code1;
641 enum tree_code code2;
643 /* If one type is nonsense, use the other. */
644 if (t1 == error_mark_node)
646 if (t2 == error_mark_node)
649 if (TYPE_QUALS (t1) != TYPE_UNQUALIFIED)
650 t1 = TYPE_MAIN_VARIANT (t1);
652 if (TYPE_QUALS (t2) != TYPE_UNQUALIFIED)
653 t2 = TYPE_MAIN_VARIANT (t2);
655 if (TYPE_ATTRIBUTES (t1) != NULL_TREE)
656 t1 = build_type_attribute_variant (t1, NULL_TREE);
658 if (TYPE_ATTRIBUTES (t2) != NULL_TREE)
659 t2 = build_type_attribute_variant (t2, NULL_TREE);
661 /* Save time if the two types are the same. */
663 if (t1 == t2) return t1;
665 code1 = TREE_CODE (t1);
666 code2 = TREE_CODE (t2);
668 gcc_assert (code1 == VECTOR_TYPE || code1 == COMPLEX_TYPE
669 || code1 == FIXED_POINT_TYPE || code1 == REAL_TYPE
670 || code1 == INTEGER_TYPE);
671 gcc_assert (code2 == VECTOR_TYPE || code2 == COMPLEX_TYPE
672 || code2 == FIXED_POINT_TYPE || code2 == REAL_TYPE
673 || code2 == INTEGER_TYPE);
675 /* When one operand is a decimal float type, the other operand cannot be
676 a generic float type or a complex type. We also disallow vector types
678 if ((DECIMAL_FLOAT_TYPE_P (t1) || DECIMAL_FLOAT_TYPE_P (t2))
679 && !(DECIMAL_FLOAT_TYPE_P (t1) && DECIMAL_FLOAT_TYPE_P (t2)))
681 if (code1 == VECTOR_TYPE || code2 == VECTOR_TYPE)
683 error ("can%'t mix operands of decimal float and vector types");
684 return error_mark_node;
686 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
688 error ("can%'t mix operands of decimal float and complex types");
689 return error_mark_node;
691 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
693 error ("can%'t mix operands of decimal float and other float types");
694 return error_mark_node;
698 /* If one type is a vector type, return that type. (How the usual
699 arithmetic conversions apply to the vector types extension is not
700 precisely specified.) */
701 if (code1 == VECTOR_TYPE)
704 if (code2 == VECTOR_TYPE)
707 /* If one type is complex, form the common type of the non-complex
708 components, then make that complex. Use T1 or T2 if it is the
710 if (code1 == COMPLEX_TYPE || code2 == COMPLEX_TYPE)
712 tree subtype1 = code1 == COMPLEX_TYPE ? TREE_TYPE (t1) : t1;
713 tree subtype2 = code2 == COMPLEX_TYPE ? TREE_TYPE (t2) : t2;
714 tree subtype = c_common_type (subtype1, subtype2);
716 if (code1 == COMPLEX_TYPE && TREE_TYPE (t1) == subtype)
718 else if (code2 == COMPLEX_TYPE && TREE_TYPE (t2) == subtype)
721 return build_complex_type (subtype);
724 /* If only one is real, use it as the result. */
726 if (code1 == REAL_TYPE && code2 != REAL_TYPE)
729 if (code2 == REAL_TYPE && code1 != REAL_TYPE)
732 /* If both are real and either are decimal floating point types, use
733 the decimal floating point type with the greater precision. */
735 if (code1 == REAL_TYPE && code2 == REAL_TYPE)
737 if (TYPE_MAIN_VARIANT (t1) == dfloat128_type_node
738 || TYPE_MAIN_VARIANT (t2) == dfloat128_type_node)
739 return dfloat128_type_node;
740 else if (TYPE_MAIN_VARIANT (t1) == dfloat64_type_node
741 || TYPE_MAIN_VARIANT (t2) == dfloat64_type_node)
742 return dfloat64_type_node;
743 else if (TYPE_MAIN_VARIANT (t1) == dfloat32_type_node
744 || TYPE_MAIN_VARIANT (t2) == dfloat32_type_node)
745 return dfloat32_type_node;
748 /* Deal with fixed-point types. */
749 if (code1 == FIXED_POINT_TYPE || code2 == FIXED_POINT_TYPE)
751 unsigned int unsignedp = 0, satp = 0;
752 enum machine_mode m1, m2;
753 unsigned int fbit1, ibit1, fbit2, ibit2, max_fbit, max_ibit;
758 /* If one input type is saturating, the result type is saturating. */
759 if (TYPE_SATURATING (t1) || TYPE_SATURATING (t2))
762 /* If both fixed-point types are unsigned, the result type is unsigned.
763 When mixing fixed-point and integer types, follow the sign of the
765 Otherwise, the result type is signed. */
766 if ((TYPE_UNSIGNED (t1) && TYPE_UNSIGNED (t2)
767 && code1 == FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE)
768 || (code1 == FIXED_POINT_TYPE && code2 != FIXED_POINT_TYPE
769 && TYPE_UNSIGNED (t1))
770 || (code1 != FIXED_POINT_TYPE && code2 == FIXED_POINT_TYPE
771 && TYPE_UNSIGNED (t2)))
774 /* The result type is signed. */
777 /* If the input type is unsigned, we need to convert to the
779 if (code1 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t1))
781 enum mode_class mclass = (enum mode_class) 0;
782 if (GET_MODE_CLASS (m1) == MODE_UFRACT)
784 else if (GET_MODE_CLASS (m1) == MODE_UACCUM)
788 m1 = mode_for_size (GET_MODE_PRECISION (m1), mclass, 0);
790 if (code2 == FIXED_POINT_TYPE && TYPE_UNSIGNED (t2))
792 enum mode_class mclass = (enum mode_class) 0;
793 if (GET_MODE_CLASS (m2) == MODE_UFRACT)
795 else if (GET_MODE_CLASS (m2) == MODE_UACCUM)
799 m2 = mode_for_size (GET_MODE_PRECISION (m2), mclass, 0);
803 if (code1 == FIXED_POINT_TYPE)
805 fbit1 = GET_MODE_FBIT (m1);
806 ibit1 = GET_MODE_IBIT (m1);
811 /* Signed integers need to subtract one sign bit. */
812 ibit1 = TYPE_PRECISION (t1) - (!TYPE_UNSIGNED (t1));
815 if (code2 == FIXED_POINT_TYPE)
817 fbit2 = GET_MODE_FBIT (m2);
818 ibit2 = GET_MODE_IBIT (m2);
823 /* Signed integers need to subtract one sign bit. */
824 ibit2 = TYPE_PRECISION (t2) - (!TYPE_UNSIGNED (t2));
827 max_ibit = ibit1 >= ibit2 ? ibit1 : ibit2;
828 max_fbit = fbit1 >= fbit2 ? fbit1 : fbit2;
829 return c_common_fixed_point_type_for_size (max_ibit, max_fbit, unsignedp,
833 /* Both real or both integers; use the one with greater precision. */
835 if (TYPE_PRECISION (t1) > TYPE_PRECISION (t2))
837 else if (TYPE_PRECISION (t2) > TYPE_PRECISION (t1))
840 /* Same precision. Prefer long longs to longs to ints when the
841 same precision, following the C99 rules on integer type rank
842 (which are equivalent to the C90 rules for C90 types). */
844 if (TYPE_MAIN_VARIANT (t1) == long_long_unsigned_type_node
845 || TYPE_MAIN_VARIANT (t2) == long_long_unsigned_type_node)
846 return long_long_unsigned_type_node;
848 if (TYPE_MAIN_VARIANT (t1) == long_long_integer_type_node
849 || TYPE_MAIN_VARIANT (t2) == long_long_integer_type_node)
851 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
852 return long_long_unsigned_type_node;
854 return long_long_integer_type_node;
857 if (TYPE_MAIN_VARIANT (t1) == long_unsigned_type_node
858 || TYPE_MAIN_VARIANT (t2) == long_unsigned_type_node)
859 return long_unsigned_type_node;
861 if (TYPE_MAIN_VARIANT (t1) == long_integer_type_node
862 || TYPE_MAIN_VARIANT (t2) == long_integer_type_node)
864 /* But preserve unsignedness from the other type,
865 since long cannot hold all the values of an unsigned int. */
866 if (TYPE_UNSIGNED (t1) || TYPE_UNSIGNED (t2))
867 return long_unsigned_type_node;
869 return long_integer_type_node;
872 /* Likewise, prefer long double to double even if same size. */
873 if (TYPE_MAIN_VARIANT (t1) == long_double_type_node
874 || TYPE_MAIN_VARIANT (t2) == long_double_type_node)
875 return long_double_type_node;
877 /* Otherwise prefer the unsigned one. */
879 if (TYPE_UNSIGNED (t1))
885 /* Wrapper around c_common_type that is used by c-common.c and other
886 front end optimizations that remove promotions. ENUMERAL_TYPEs
887 are allowed here and are converted to their compatible integer types.
888 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
889 preferably a non-Boolean type as the common type. */
891 common_type (tree t1, tree t2)
893 if (TREE_CODE (t1) == ENUMERAL_TYPE)
894 t1 = c_common_type_for_size (TYPE_PRECISION (t1), 1);
895 if (TREE_CODE (t2) == ENUMERAL_TYPE)
896 t2 = c_common_type_for_size (TYPE_PRECISION (t2), 1);
898 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
899 if (TREE_CODE (t1) == BOOLEAN_TYPE
900 && TREE_CODE (t2) == BOOLEAN_TYPE)
901 return boolean_type_node;
903 /* If either type is BOOLEAN_TYPE, then return the other. */
904 if (TREE_CODE (t1) == BOOLEAN_TYPE)
906 if (TREE_CODE (t2) == BOOLEAN_TYPE)
909 return c_common_type (t1, t2);
912 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
913 or various other operations. Return 2 if they are compatible
914 but a warning may be needed if you use them together. */
917 comptypes (tree type1, tree type2)
919 const struct tagged_tu_seen_cache * tagged_tu_seen_base1 = tagged_tu_seen_base;
922 val = comptypes_internal (type1, type2);
923 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1);
928 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
929 or various other operations. Return 2 if they are compatible
930 but a warning may be needed if you use them together. This
931 differs from comptypes, in that we don't free the seen types. */
934 comptypes_internal (const_tree type1, const_tree type2)
936 const_tree t1 = type1;
937 const_tree t2 = type2;
940 /* Suppress errors caused by previously reported errors. */
942 if (t1 == t2 || !t1 || !t2
943 || TREE_CODE (t1) == ERROR_MARK || TREE_CODE (t2) == ERROR_MARK)
946 /* If either type is the internal version of sizetype, return the
948 if (TREE_CODE (t1) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t1)
949 && TYPE_ORIG_SIZE_TYPE (t1))
950 t1 = TYPE_ORIG_SIZE_TYPE (t1);
952 if (TREE_CODE (t2) == INTEGER_TYPE && TYPE_IS_SIZETYPE (t2)
953 && TYPE_ORIG_SIZE_TYPE (t2))
954 t2 = TYPE_ORIG_SIZE_TYPE (t2);
957 /* Enumerated types are compatible with integer types, but this is
958 not transitive: two enumerated types in the same translation unit
959 are compatible with each other only if they are the same type. */
961 if (TREE_CODE (t1) == ENUMERAL_TYPE && TREE_CODE (t2) != ENUMERAL_TYPE)
962 t1 = c_common_type_for_size (TYPE_PRECISION (t1), TYPE_UNSIGNED (t1));
963 else if (TREE_CODE (t2) == ENUMERAL_TYPE && TREE_CODE (t1) != ENUMERAL_TYPE)
964 t2 = c_common_type_for_size (TYPE_PRECISION (t2), TYPE_UNSIGNED (t2));
969 /* Different classes of types can't be compatible. */
971 if (TREE_CODE (t1) != TREE_CODE (t2))
974 /* Qualifiers must match. C99 6.7.3p9 */
976 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
979 /* Allow for two different type nodes which have essentially the same
980 definition. Note that we already checked for equality of the type
981 qualifiers (just above). */
983 if (TREE_CODE (t1) != ARRAY_TYPE
984 && TYPE_MAIN_VARIANT (t1) == TYPE_MAIN_VARIANT (t2))
987 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
988 if (!(attrval = targetm.comp_type_attributes (t1, t2)))
991 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
994 switch (TREE_CODE (t1))
997 /* Do not remove mode or aliasing information. */
998 if (TYPE_MODE (t1) != TYPE_MODE (t2)
999 || TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
1001 val = (TREE_TYPE (t1) == TREE_TYPE (t2)
1002 ? 1 : comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2)));
1006 val = function_types_compatible_p (t1, t2);
1011 tree d1 = TYPE_DOMAIN (t1);
1012 tree d2 = TYPE_DOMAIN (t2);
1013 bool d1_variable, d2_variable;
1014 bool d1_zero, d2_zero;
1017 /* Target types must match incl. qualifiers. */
1018 if (TREE_TYPE (t1) != TREE_TYPE (t2)
1019 && 0 == (val = comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2))))
1022 /* Sizes must match unless one is missing or variable. */
1023 if (d1 == 0 || d2 == 0 || d1 == d2)
1026 d1_zero = !TYPE_MAX_VALUE (d1);
1027 d2_zero = !TYPE_MAX_VALUE (d2);
1029 d1_variable = (!d1_zero
1030 && (TREE_CODE (TYPE_MIN_VALUE (d1)) != INTEGER_CST
1031 || TREE_CODE (TYPE_MAX_VALUE (d1)) != INTEGER_CST));
1032 d2_variable = (!d2_zero
1033 && (TREE_CODE (TYPE_MIN_VALUE (d2)) != INTEGER_CST
1034 || TREE_CODE (TYPE_MAX_VALUE (d2)) != INTEGER_CST));
1035 d1_variable = d1_variable || (d1_zero && c_vla_type_p (t1));
1036 d2_variable = d2_variable || (d2_zero && c_vla_type_p (t2));
1038 if (d1_variable || d2_variable)
1040 if (d1_zero && d2_zero)
1042 if (d1_zero || d2_zero
1043 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1), TYPE_MIN_VALUE (d2))
1044 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1), TYPE_MAX_VALUE (d2)))
1053 if (val != 1 && !same_translation_unit_p (t1, t2))
1055 tree a1 = TYPE_ATTRIBUTES (t1);
1056 tree a2 = TYPE_ATTRIBUTES (t2);
1058 if (! attribute_list_contained (a1, a2)
1059 && ! attribute_list_contained (a2, a1))
1063 return tagged_types_tu_compatible_p (t1, t2);
1064 val = tagged_types_tu_compatible_p (t1, t2);
1069 val = TYPE_VECTOR_SUBPARTS (t1) == TYPE_VECTOR_SUBPARTS (t2)
1070 && comptypes_internal (TREE_TYPE (t1), TREE_TYPE (t2));
1076 return attrval == 2 && val == 1 ? 2 : val;
1079 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
1080 ignoring their qualifiers. */
1083 comp_target_types (tree ttl, tree ttr)
1088 /* Do not lose qualifiers on element types of array types that are
1089 pointer targets by taking their TYPE_MAIN_VARIANT. */
1090 mvl = TREE_TYPE (ttl);
1091 mvr = TREE_TYPE (ttr);
1092 if (TREE_CODE (mvl) != ARRAY_TYPE)
1093 mvl = TYPE_MAIN_VARIANT (mvl);
1094 if (TREE_CODE (mvr) != ARRAY_TYPE)
1095 mvr = TYPE_MAIN_VARIANT (mvr);
1096 val = comptypes (mvl, mvr);
1099 pedwarn (input_location, OPT_pedantic, "types are not quite compatible");
1103 /* Subroutines of `comptypes'. */
1105 /* Determine whether two trees derive from the same translation unit.
1106 If the CONTEXT chain ends in a null, that tree's context is still
1107 being parsed, so if two trees have context chains ending in null,
1108 they're in the same translation unit. */
1110 same_translation_unit_p (const_tree t1, const_tree t2)
1112 while (t1 && TREE_CODE (t1) != TRANSLATION_UNIT_DECL)
1113 switch (TREE_CODE_CLASS (TREE_CODE (t1)))
1115 case tcc_declaration:
1116 t1 = DECL_CONTEXT (t1); break;
1118 t1 = TYPE_CONTEXT (t1); break;
1119 case tcc_exceptional:
1120 t1 = BLOCK_SUPERCONTEXT (t1); break; /* assume block */
1121 default: gcc_unreachable ();
1124 while (t2 && TREE_CODE (t2) != TRANSLATION_UNIT_DECL)
1125 switch (TREE_CODE_CLASS (TREE_CODE (t2)))
1127 case tcc_declaration:
1128 t2 = DECL_CONTEXT (t2); break;
1130 t2 = TYPE_CONTEXT (t2); break;
1131 case tcc_exceptional:
1132 t2 = BLOCK_SUPERCONTEXT (t2); break; /* assume block */
1133 default: gcc_unreachable ();
1139 /* Allocate the seen two types, assuming that they are compatible. */
1141 static struct tagged_tu_seen_cache *
1142 alloc_tagged_tu_seen_cache (const_tree t1, const_tree t2)
1144 struct tagged_tu_seen_cache *tu = XNEW (struct tagged_tu_seen_cache);
1145 tu->next = tagged_tu_seen_base;
1149 tagged_tu_seen_base = tu;
1151 /* The C standard says that two structures in different translation
1152 units are compatible with each other only if the types of their
1153 fields are compatible (among other things). We assume that they
1154 are compatible until proven otherwise when building the cache.
1155 An example where this can occur is:
1160 If we are comparing this against a similar struct in another TU,
1161 and did not assume they were compatible, we end up with an infinite
1167 /* Free the seen types until we get to TU_TIL. */
1170 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache *tu_til)
1172 const struct tagged_tu_seen_cache *tu = tagged_tu_seen_base;
1173 while (tu != tu_til)
1175 const struct tagged_tu_seen_cache *const tu1
1176 = (const struct tagged_tu_seen_cache *) tu;
1178 free (CONST_CAST (struct tagged_tu_seen_cache *, tu1));
1180 tagged_tu_seen_base = tu_til;
1183 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1184 compatible. If the two types are not the same (which has been
1185 checked earlier), this can only happen when multiple translation
1186 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1190 tagged_types_tu_compatible_p (const_tree t1, const_tree t2)
1193 bool needs_warning = false;
1195 /* We have to verify that the tags of the types are the same. This
1196 is harder than it looks because this may be a typedef, so we have
1197 to go look at the original type. It may even be a typedef of a
1199 In the case of compiler-created builtin structs the TYPE_DECL
1200 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1201 while (TYPE_NAME (t1)
1202 && TREE_CODE (TYPE_NAME (t1)) == TYPE_DECL
1203 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1)))
1204 t1 = DECL_ORIGINAL_TYPE (TYPE_NAME (t1));
1206 while (TYPE_NAME (t2)
1207 && TREE_CODE (TYPE_NAME (t2)) == TYPE_DECL
1208 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2)))
1209 t2 = DECL_ORIGINAL_TYPE (TYPE_NAME (t2));
1211 /* C90 didn't have the requirement that the two tags be the same. */
1212 if (flag_isoc99 && TYPE_NAME (t1) != TYPE_NAME (t2))
1215 /* C90 didn't say what happened if one or both of the types were
1216 incomplete; we choose to follow C99 rules here, which is that they
1218 if (TYPE_SIZE (t1) == NULL
1219 || TYPE_SIZE (t2) == NULL)
1223 const struct tagged_tu_seen_cache * tts_i;
1224 for (tts_i = tagged_tu_seen_base; tts_i != NULL; tts_i = tts_i->next)
1225 if (tts_i->t1 == t1 && tts_i->t2 == t2)
1229 switch (TREE_CODE (t1))
1233 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1234 /* Speed up the case where the type values are in the same order. */
1235 tree tv1 = TYPE_VALUES (t1);
1236 tree tv2 = TYPE_VALUES (t2);
1243 for (;tv1 && tv2; tv1 = TREE_CHAIN (tv1), tv2 = TREE_CHAIN (tv2))
1245 if (TREE_PURPOSE (tv1) != TREE_PURPOSE (tv2))
1247 if (simple_cst_equal (TREE_VALUE (tv1), TREE_VALUE (tv2)) != 1)
1254 if (tv1 == NULL_TREE && tv2 == NULL_TREE)
1258 if (tv1 == NULL_TREE || tv2 == NULL_TREE)
1264 if (list_length (TYPE_VALUES (t1)) != list_length (TYPE_VALUES (t2)))
1270 for (s1 = TYPE_VALUES (t1); s1; s1 = TREE_CHAIN (s1))
1272 s2 = purpose_member (TREE_PURPOSE (s1), TYPE_VALUES (t2));
1274 || simple_cst_equal (TREE_VALUE (s1), TREE_VALUE (s2)) != 1)
1285 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1286 if (list_length (TYPE_FIELDS (t1)) != list_length (TYPE_FIELDS (t2)))
1292 /* Speed up the common case where the fields are in the same order. */
1293 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2); s1 && s2;
1294 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1298 if (DECL_NAME (s1) != DECL_NAME (s2))
1300 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1302 if (result != 1 && !DECL_NAME (s1))
1310 needs_warning = true;
1312 if (TREE_CODE (s1) == FIELD_DECL
1313 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1314 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1322 tu->val = needs_warning ? 2 : 1;
1326 for (s1 = TYPE_FIELDS (t1); s1; s1 = TREE_CHAIN (s1))
1330 for (s2 = TYPE_FIELDS (t2); s2; s2 = TREE_CHAIN (s2))
1331 if (DECL_NAME (s1) == DECL_NAME (s2))
1335 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1337 if (result != 1 && !DECL_NAME (s1))
1345 needs_warning = true;
1347 if (TREE_CODE (s1) == FIELD_DECL
1348 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1349 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1361 tu->val = needs_warning ? 2 : 10;
1367 struct tagged_tu_seen_cache *tu = alloc_tagged_tu_seen_cache (t1, t2);
1369 for (s1 = TYPE_FIELDS (t1), s2 = TYPE_FIELDS (t2);
1371 s1 = TREE_CHAIN (s1), s2 = TREE_CHAIN (s2))
1374 if (TREE_CODE (s1) != TREE_CODE (s2)
1375 || DECL_NAME (s1) != DECL_NAME (s2))
1377 result = comptypes_internal (TREE_TYPE (s1), TREE_TYPE (s2));
1381 needs_warning = true;
1383 if (TREE_CODE (s1) == FIELD_DECL
1384 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1),
1385 DECL_FIELD_BIT_OFFSET (s2)) != 1)
1391 tu->val = needs_warning ? 2 : 1;
1400 /* Return 1 if two function types F1 and F2 are compatible.
1401 If either type specifies no argument types,
1402 the other must specify a fixed number of self-promoting arg types.
1403 Otherwise, if one type specifies only the number of arguments,
1404 the other must specify that number of self-promoting arg types.
1405 Otherwise, the argument types must match. */
1408 function_types_compatible_p (const_tree f1, const_tree f2)
1411 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1416 ret1 = TREE_TYPE (f1);
1417 ret2 = TREE_TYPE (f2);
1419 /* 'volatile' qualifiers on a function's return type used to mean
1420 the function is noreturn. */
1421 if (TYPE_VOLATILE (ret1) != TYPE_VOLATILE (ret2))
1422 pedwarn (input_location, 0, "function return types not compatible due to %<volatile%>");
1423 if (TYPE_VOLATILE (ret1))
1424 ret1 = build_qualified_type (TYPE_MAIN_VARIANT (ret1),
1425 TYPE_QUALS (ret1) & ~TYPE_QUAL_VOLATILE);
1426 if (TYPE_VOLATILE (ret2))
1427 ret2 = build_qualified_type (TYPE_MAIN_VARIANT (ret2),
1428 TYPE_QUALS (ret2) & ~TYPE_QUAL_VOLATILE);
1429 val = comptypes_internal (ret1, ret2);
1433 args1 = TYPE_ARG_TYPES (f1);
1434 args2 = TYPE_ARG_TYPES (f2);
1436 /* An unspecified parmlist matches any specified parmlist
1437 whose argument types don't need default promotions. */
1441 if (!self_promoting_args_p (args2))
1443 /* If one of these types comes from a non-prototype fn definition,
1444 compare that with the other type's arglist.
1445 If they don't match, ask for a warning (but no error). */
1446 if (TYPE_ACTUAL_ARG_TYPES (f1)
1447 && 1 != type_lists_compatible_p (args2, TYPE_ACTUAL_ARG_TYPES (f1)))
1453 if (!self_promoting_args_p (args1))
1455 if (TYPE_ACTUAL_ARG_TYPES (f2)
1456 && 1 != type_lists_compatible_p (args1, TYPE_ACTUAL_ARG_TYPES (f2)))
1461 /* Both types have argument lists: compare them and propagate results. */
1462 val1 = type_lists_compatible_p (args1, args2);
1463 return val1 != 1 ? val1 : val;
1466 /* Check two lists of types for compatibility,
1467 returning 0 for incompatible, 1 for compatible,
1468 or 2 for compatible with warning. */
1471 type_lists_compatible_p (const_tree args1, const_tree args2)
1473 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1479 tree a1, mv1, a2, mv2;
1480 if (args1 == 0 && args2 == 0)
1482 /* If one list is shorter than the other,
1483 they fail to match. */
1484 if (args1 == 0 || args2 == 0)
1486 mv1 = a1 = TREE_VALUE (args1);
1487 mv2 = a2 = TREE_VALUE (args2);
1488 if (mv1 && mv1 != error_mark_node && TREE_CODE (mv1) != ARRAY_TYPE)
1489 mv1 = TYPE_MAIN_VARIANT (mv1);
1490 if (mv2 && mv2 != error_mark_node && TREE_CODE (mv2) != ARRAY_TYPE)
1491 mv2 = TYPE_MAIN_VARIANT (mv2);
1492 /* A null pointer instead of a type
1493 means there is supposed to be an argument
1494 but nothing is specified about what type it has.
1495 So match anything that self-promotes. */
1498 if (c_type_promotes_to (a2) != a2)
1503 if (c_type_promotes_to (a1) != a1)
1506 /* If one of the lists has an error marker, ignore this arg. */
1507 else if (TREE_CODE (a1) == ERROR_MARK
1508 || TREE_CODE (a2) == ERROR_MARK)
1510 else if (!(newval = comptypes_internal (mv1, mv2)))
1512 /* Allow wait (union {union wait *u; int *i} *)
1513 and wait (union wait *) to be compatible. */
1514 if (TREE_CODE (a1) == UNION_TYPE
1515 && (TYPE_NAME (a1) == 0
1516 || TYPE_TRANSPARENT_UNION (a1))
1517 && TREE_CODE (TYPE_SIZE (a1)) == INTEGER_CST
1518 && tree_int_cst_equal (TYPE_SIZE (a1),
1522 for (memb = TYPE_FIELDS (a1);
1523 memb; memb = TREE_CHAIN (memb))
1525 tree mv3 = TREE_TYPE (memb);
1526 if (mv3 && mv3 != error_mark_node
1527 && TREE_CODE (mv3) != ARRAY_TYPE)
1528 mv3 = TYPE_MAIN_VARIANT (mv3);
1529 if (comptypes_internal (mv3, mv2))
1535 else if (TREE_CODE (a2) == UNION_TYPE
1536 && (TYPE_NAME (a2) == 0
1537 || TYPE_TRANSPARENT_UNION (a2))
1538 && TREE_CODE (TYPE_SIZE (a2)) == INTEGER_CST
1539 && tree_int_cst_equal (TYPE_SIZE (a2),
1543 for (memb = TYPE_FIELDS (a2);
1544 memb; memb = TREE_CHAIN (memb))
1546 tree mv3 = TREE_TYPE (memb);
1547 if (mv3 && mv3 != error_mark_node
1548 && TREE_CODE (mv3) != ARRAY_TYPE)
1549 mv3 = TYPE_MAIN_VARIANT (mv3);
1550 if (comptypes_internal (mv3, mv1))
1560 /* comptypes said ok, but record if it said to warn. */
1564 args1 = TREE_CHAIN (args1);
1565 args2 = TREE_CHAIN (args2);
1569 /* Compute the size to increment a pointer by. */
1572 c_size_in_bytes (const_tree type)
1574 enum tree_code code = TREE_CODE (type);
1576 if (code == FUNCTION_TYPE || code == VOID_TYPE || code == ERROR_MARK)
1577 return size_one_node;
1579 if (!COMPLETE_OR_VOID_TYPE_P (type))
1581 error ("arithmetic on pointer to an incomplete type");
1582 return size_one_node;
1585 /* Convert in case a char is more than one unit. */
1586 return size_binop (CEIL_DIV_EXPR, TYPE_SIZE_UNIT (type),
1587 size_int (TYPE_PRECISION (char_type_node)
1591 /* Return either DECL or its known constant value (if it has one). */
1594 decl_constant_value (tree decl)
1596 if (/* Don't change a variable array bound or initial value to a constant
1597 in a place where a variable is invalid. Note that DECL_INITIAL
1598 isn't valid for a PARM_DECL. */
1599 current_function_decl != 0
1600 && TREE_CODE (decl) != PARM_DECL
1601 && !TREE_THIS_VOLATILE (decl)
1602 && TREE_READONLY (decl)
1603 && DECL_INITIAL (decl) != 0
1604 && TREE_CODE (DECL_INITIAL (decl)) != ERROR_MARK
1605 /* This is invalid if initial value is not constant.
1606 If it has either a function call, a memory reference,
1607 or a variable, then re-evaluating it could give different results. */
1608 && TREE_CONSTANT (DECL_INITIAL (decl))
1609 /* Check for cases where this is sub-optimal, even though valid. */
1610 && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1611 return DECL_INITIAL (decl);
1615 /* Convert the array expression EXP to a pointer. */
1617 array_to_pointer_conversion (tree exp)
1619 tree orig_exp = exp;
1620 tree type = TREE_TYPE (exp);
1622 tree restype = TREE_TYPE (type);
1625 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1627 STRIP_TYPE_NOPS (exp);
1629 if (TREE_NO_WARNING (orig_exp))
1630 TREE_NO_WARNING (exp) = 1;
1632 ptrtype = build_pointer_type (restype);
1634 if (TREE_CODE (exp) == INDIRECT_REF)
1635 return convert (ptrtype, TREE_OPERAND (exp, 0));
1637 if (TREE_CODE (exp) == VAR_DECL)
1639 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1640 ADDR_EXPR because it's the best way of representing what
1641 happens in C when we take the address of an array and place
1642 it in a pointer to the element type. */
1643 adr = build1 (ADDR_EXPR, ptrtype, exp);
1644 if (!c_mark_addressable (exp))
1645 return error_mark_node;
1646 TREE_SIDE_EFFECTS (adr) = 0; /* Default would be, same as EXP. */
1650 /* This way is better for a COMPONENT_REF since it can
1651 simplify the offset for a component. */
1652 adr = build_unary_op (EXPR_LOCATION (exp), ADDR_EXPR, exp, 1);
1653 return convert (ptrtype, adr);
1656 /* Convert the function expression EXP to a pointer. */
1658 function_to_pointer_conversion (tree exp)
1660 tree orig_exp = exp;
1662 gcc_assert (TREE_CODE (TREE_TYPE (exp)) == FUNCTION_TYPE);
1664 STRIP_TYPE_NOPS (exp);
1666 if (TREE_NO_WARNING (orig_exp))
1667 TREE_NO_WARNING (exp) = 1;
1669 return build_unary_op (EXPR_LOCATION (exp), ADDR_EXPR, exp, 0);
1672 /* Perform the default conversion of arrays and functions to pointers.
1673 Return the result of converting EXP. For any other expression, just
1677 default_function_array_conversion (struct c_expr exp)
1679 tree orig_exp = exp.value;
1680 tree type = TREE_TYPE (exp.value);
1681 enum tree_code code = TREE_CODE (type);
1687 bool not_lvalue = false;
1688 bool lvalue_array_p;
1690 while ((TREE_CODE (exp.value) == NON_LVALUE_EXPR
1691 || CONVERT_EXPR_P (exp.value))
1692 && TREE_TYPE (TREE_OPERAND (exp.value, 0)) == type)
1694 if (TREE_CODE (exp.value) == NON_LVALUE_EXPR)
1696 exp.value = TREE_OPERAND (exp.value, 0);
1699 if (TREE_NO_WARNING (orig_exp))
1700 TREE_NO_WARNING (exp.value) = 1;
1702 lvalue_array_p = !not_lvalue && lvalue_p (exp.value);
1703 if (!flag_isoc99 && !lvalue_array_p)
1705 /* Before C99, non-lvalue arrays do not decay to pointers.
1706 Normally, using such an array would be invalid; but it can
1707 be used correctly inside sizeof or as a statement expression.
1708 Thus, do not give an error here; an error will result later. */
1712 exp.value = array_to_pointer_conversion (exp.value);
1716 exp.value = function_to_pointer_conversion (exp.value);
1726 /* EXP is an expression of integer type. Apply the integer promotions
1727 to it and return the promoted value. */
1730 perform_integral_promotions (tree exp)
1732 tree type = TREE_TYPE (exp);
1733 enum tree_code code = TREE_CODE (type);
1735 gcc_assert (INTEGRAL_TYPE_P (type));
1737 /* Normally convert enums to int,
1738 but convert wide enums to something wider. */
1739 if (code == ENUMERAL_TYPE)
1741 type = c_common_type_for_size (MAX (TYPE_PRECISION (type),
1742 TYPE_PRECISION (integer_type_node)),
1743 ((TYPE_PRECISION (type)
1744 >= TYPE_PRECISION (integer_type_node))
1745 && TYPE_UNSIGNED (type)));
1747 return convert (type, exp);
1750 /* ??? This should no longer be needed now bit-fields have their
1752 if (TREE_CODE (exp) == COMPONENT_REF
1753 && DECL_C_BIT_FIELD (TREE_OPERAND (exp, 1))
1754 /* If it's thinner than an int, promote it like a
1755 c_promoting_integer_type_p, otherwise leave it alone. */
1756 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp, 1)),
1757 TYPE_PRECISION (integer_type_node)))
1758 return convert (integer_type_node, exp);
1760 if (c_promoting_integer_type_p (type))
1762 /* Preserve unsignedness if not really getting any wider. */
1763 if (TYPE_UNSIGNED (type)
1764 && TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
1765 return convert (unsigned_type_node, exp);
1767 return convert (integer_type_node, exp);
1774 /* Perform default promotions for C data used in expressions.
1775 Enumeral types or short or char are converted to int.
1776 In addition, manifest constants symbols are replaced by their values. */
1779 default_conversion (tree exp)
1782 tree type = TREE_TYPE (exp);
1783 enum tree_code code = TREE_CODE (type);
1785 /* Functions and arrays have been converted during parsing. */
1786 gcc_assert (code != FUNCTION_TYPE);
1787 if (code == ARRAY_TYPE)
1790 /* Constants can be used directly unless they're not loadable. */
1791 if (TREE_CODE (exp) == CONST_DECL)
1792 exp = DECL_INITIAL (exp);
1794 /* Strip no-op conversions. */
1796 STRIP_TYPE_NOPS (exp);
1798 if (TREE_NO_WARNING (orig_exp))
1799 TREE_NO_WARNING (exp) = 1;
1801 if (code == VOID_TYPE)
1803 error ("void value not ignored as it ought to be");
1804 return error_mark_node;
1807 exp = require_complete_type (exp);
1808 if (exp == error_mark_node)
1809 return error_mark_node;
1811 if (INTEGRAL_TYPE_P (type))
1812 return perform_integral_promotions (exp);
1817 /* Look up COMPONENT in a structure or union DECL.
1819 If the component name is not found, returns NULL_TREE. Otherwise,
1820 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1821 stepping down the chain to the component, which is in the last
1822 TREE_VALUE of the list. Normally the list is of length one, but if
1823 the component is embedded within (nested) anonymous structures or
1824 unions, the list steps down the chain to the component. */
1827 lookup_field (tree decl, tree component)
1829 tree type = TREE_TYPE (decl);
1832 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1833 to the field elements. Use a binary search on this array to quickly
1834 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1835 will always be set for structures which have many elements. */
1837 if (TYPE_LANG_SPECIFIC (type) && TYPE_LANG_SPECIFIC (type)->s)
1840 tree *field_array = &TYPE_LANG_SPECIFIC (type)->s->elts[0];
1842 field = TYPE_FIELDS (type);
1844 top = TYPE_LANG_SPECIFIC (type)->s->len;
1845 while (top - bot > 1)
1847 half = (top - bot + 1) >> 1;
1848 field = field_array[bot+half];
1850 if (DECL_NAME (field) == NULL_TREE)
1852 /* Step through all anon unions in linear fashion. */
1853 while (DECL_NAME (field_array[bot]) == NULL_TREE)
1855 field = field_array[bot++];
1856 if (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1857 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
1859 tree anon = lookup_field (field, component);
1862 return tree_cons (NULL_TREE, field, anon);
1866 /* Entire record is only anon unions. */
1870 /* Restart the binary search, with new lower bound. */
1874 if (DECL_NAME (field) == component)
1876 if (DECL_NAME (field) < component)
1882 if (DECL_NAME (field_array[bot]) == component)
1883 field = field_array[bot];
1884 else if (DECL_NAME (field) != component)
1889 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1891 if (DECL_NAME (field) == NULL_TREE
1892 && (TREE_CODE (TREE_TYPE (field)) == RECORD_TYPE
1893 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE))
1895 tree anon = lookup_field (field, component);
1898 return tree_cons (NULL_TREE, field, anon);
1901 if (DECL_NAME (field) == component)
1905 if (field == NULL_TREE)
1909 return tree_cons (NULL_TREE, field, NULL_TREE);
1912 /* Make an expression to refer to the COMPONENT field of
1913 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1916 build_component_ref (tree datum, tree component)
1918 tree type = TREE_TYPE (datum);
1919 enum tree_code code = TREE_CODE (type);
1922 bool datum_lvalue = lvalue_p (datum);
1924 if (!objc_is_public (datum, component))
1925 return error_mark_node;
1927 /* See if there is a field or component with name COMPONENT. */
1929 if (code == RECORD_TYPE || code == UNION_TYPE)
1931 if (!COMPLETE_TYPE_P (type))
1933 c_incomplete_type_error (NULL_TREE, type);
1934 return error_mark_node;
1937 field = lookup_field (datum, component);
1941 error ("%qT has no member named %qE", type, component);
1942 return error_mark_node;
1945 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1946 This might be better solved in future the way the C++ front
1947 end does it - by giving the anonymous entities each a
1948 separate name and type, and then have build_component_ref
1949 recursively call itself. We can't do that here. */
1952 tree subdatum = TREE_VALUE (field);
1955 bool use_datum_quals;
1957 if (TREE_TYPE (subdatum) == error_mark_node)
1958 return error_mark_node;
1960 /* If this is an rvalue, it does not have qualifiers in C
1961 standard terms and we must avoid propagating such
1962 qualifiers down to a non-lvalue array that is then
1963 converted to a pointer. */
1964 use_datum_quals = (datum_lvalue
1965 || TREE_CODE (TREE_TYPE (subdatum)) != ARRAY_TYPE);
1967 quals = TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum)));
1968 if (use_datum_quals)
1969 quals |= TYPE_QUALS (TREE_TYPE (datum));
1970 subtype = c_build_qualified_type (TREE_TYPE (subdatum), quals);
1972 ref = build3 (COMPONENT_REF, subtype, datum, subdatum,
1974 if (TREE_READONLY (subdatum)
1975 || (use_datum_quals && TREE_READONLY (datum)))
1976 TREE_READONLY (ref) = 1;
1977 if (TREE_THIS_VOLATILE (subdatum)
1978 || (use_datum_quals && TREE_THIS_VOLATILE (datum)))
1979 TREE_THIS_VOLATILE (ref) = 1;
1981 if (TREE_DEPRECATED (subdatum))
1982 warn_deprecated_use (subdatum);
1986 field = TREE_CHAIN (field);
1992 else if (code != ERROR_MARK)
1993 error ("request for member %qE in something not a structure or union",
1996 return error_mark_node;
1999 /* Given an expression PTR for a pointer, return an expression
2000 for the value pointed to.
2001 ERRORSTRING is the name of the operator to appear in error messages.
2003 LOC is the location to use for the generated tree. */
2006 build_indirect_ref (location_t loc, tree ptr, const char *errorstring)
2008 tree pointer = default_conversion (ptr);
2009 tree type = TREE_TYPE (pointer);
2012 if (TREE_CODE (type) == POINTER_TYPE)
2014 if (CONVERT_EXPR_P (pointer)
2015 || TREE_CODE (pointer) == VIEW_CONVERT_EXPR)
2017 /* If a warning is issued, mark it to avoid duplicates from
2018 the backend. This only needs to be done at
2019 warn_strict_aliasing > 2. */
2020 if (warn_strict_aliasing > 2)
2021 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer, 0)),
2022 type, TREE_OPERAND (pointer, 0)))
2023 TREE_NO_WARNING (pointer) = 1;
2026 if (TREE_CODE (pointer) == ADDR_EXPR
2027 && (TREE_TYPE (TREE_OPERAND (pointer, 0))
2028 == TREE_TYPE (type)))
2030 ref = TREE_OPERAND (pointer, 0);
2031 protected_set_expr_location (ref, loc);
2036 tree t = TREE_TYPE (type);
2038 ref = build1 (INDIRECT_REF, t, pointer);
2040 if (!COMPLETE_OR_VOID_TYPE_P (t) && TREE_CODE (t) != ARRAY_TYPE)
2042 error_at (loc, "dereferencing pointer to incomplete type");
2043 return error_mark_node;
2045 if (VOID_TYPE_P (t) && skip_evaluation == 0)
2046 warning_at (loc, 0, "dereferencing %<void *%> pointer");
2048 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2049 so that we get the proper error message if the result is used
2050 to assign to. Also, &* is supposed to be a no-op.
2051 And ANSI C seems to specify that the type of the result
2052 should be the const type. */
2053 /* A de-reference of a pointer to const is not a const. It is valid
2054 to change it via some other pointer. */
2055 TREE_READONLY (ref) = TYPE_READONLY (t);
2056 TREE_SIDE_EFFECTS (ref)
2057 = TYPE_VOLATILE (t) || TREE_SIDE_EFFECTS (pointer);
2058 TREE_THIS_VOLATILE (ref) = TYPE_VOLATILE (t);
2059 protected_set_expr_location (ref, loc);
2063 else if (TREE_CODE (pointer) != ERROR_MARK)
2065 "invalid type argument of %qs (have %qT)", errorstring, type);
2066 return error_mark_node;
2069 /* This handles expressions of the form "a[i]", which denotes
2072 This is logically equivalent in C to *(a+i), but we may do it differently.
2073 If A is a variable or a member, we generate a primitive ARRAY_REF.
2074 This avoids forcing the array out of registers, and can work on
2075 arrays that are not lvalues (for example, members of structures returned
2078 LOC is the location to use for the returned expression. */
2081 build_array_ref (tree array, tree index, location_t loc)
2084 bool swapped = false;
2085 if (TREE_TYPE (array) == error_mark_node
2086 || TREE_TYPE (index) == error_mark_node)
2087 return error_mark_node;
2089 if (TREE_CODE (TREE_TYPE (array)) != ARRAY_TYPE
2090 && TREE_CODE (TREE_TYPE (array)) != POINTER_TYPE)
2093 if (TREE_CODE (TREE_TYPE (index)) != ARRAY_TYPE
2094 && TREE_CODE (TREE_TYPE (index)) != POINTER_TYPE)
2096 error_at (loc, "subscripted value is neither array nor pointer");
2097 return error_mark_node;
2105 if (!INTEGRAL_TYPE_P (TREE_TYPE (index)))
2107 error_at (loc, "array subscript is not an integer");
2108 return error_mark_node;
2111 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array))) == FUNCTION_TYPE)
2113 error_at (loc, "subscripted value is pointer to function");
2114 return error_mark_node;
2117 /* ??? Existing practice has been to warn only when the char
2118 index is syntactically the index, not for char[array]. */
2120 warn_array_subscript_with_type_char (index);
2122 /* Apply default promotions *after* noticing character types. */
2123 index = default_conversion (index);
2125 gcc_assert (TREE_CODE (TREE_TYPE (index)) == INTEGER_TYPE);
2127 if (TREE_CODE (TREE_TYPE (array)) == ARRAY_TYPE)
2131 /* An array that is indexed by a non-constant
2132 cannot be stored in a register; we must be able to do
2133 address arithmetic on its address.
2134 Likewise an array of elements of variable size. */
2135 if (TREE_CODE (index) != INTEGER_CST
2136 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array)))
2137 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array)))) != INTEGER_CST))
2139 if (!c_mark_addressable (array))
2140 return error_mark_node;
2142 /* An array that is indexed by a constant value which is not within
2143 the array bounds cannot be stored in a register either; because we
2144 would get a crash in store_bit_field/extract_bit_field when trying
2145 to access a non-existent part of the register. */
2146 if (TREE_CODE (index) == INTEGER_CST
2147 && TYPE_DOMAIN (TREE_TYPE (array))
2148 && !int_fits_type_p (index, TYPE_DOMAIN (TREE_TYPE (array))))
2150 if (!c_mark_addressable (array))
2151 return error_mark_node;
2157 while (TREE_CODE (foo) == COMPONENT_REF)
2158 foo = TREE_OPERAND (foo, 0);
2159 if (TREE_CODE (foo) == VAR_DECL && C_DECL_REGISTER (foo))
2160 pedwarn (loc, OPT_pedantic,
2161 "ISO C forbids subscripting %<register%> array");
2162 else if (!flag_isoc99 && !lvalue_p (foo))
2163 pedwarn (loc, OPT_pedantic,
2164 "ISO C90 forbids subscripting non-lvalue array");
2167 type = TREE_TYPE (TREE_TYPE (array));
2168 rval = build4 (ARRAY_REF, type, array, index, NULL_TREE, NULL_TREE);
2169 /* Array ref is const/volatile if the array elements are
2170 or if the array is. */
2171 TREE_READONLY (rval)
2172 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array)))
2173 | TREE_READONLY (array));
2174 TREE_SIDE_EFFECTS (rval)
2175 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2176 | TREE_SIDE_EFFECTS (array));
2177 TREE_THIS_VOLATILE (rval)
2178 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array)))
2179 /* This was added by rms on 16 Nov 91.
2180 It fixes vol struct foo *a; a->elts[1]
2181 in an inline function.
2182 Hope it doesn't break something else. */
2183 | TREE_THIS_VOLATILE (array));
2184 ret = require_complete_type (rval);
2185 protected_set_expr_location (ret, loc);
2190 tree ar = default_conversion (array);
2192 if (ar == error_mark_node)
2195 gcc_assert (TREE_CODE (TREE_TYPE (ar)) == POINTER_TYPE);
2196 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar))) != FUNCTION_TYPE);
2198 return build_indirect_ref
2199 (loc, build_binary_op (loc, PLUS_EXPR, ar, index, 0),
2204 /* Build an external reference to identifier ID. FUN indicates
2205 whether this will be used for a function call. LOC is the source
2206 location of the identifier. This sets *TYPE to the type of the
2207 identifier, which is not the same as the type of the returned value
2208 for CONST_DECLs defined as enum constants. If the type of the
2209 identifier is not available, *TYPE is set to NULL. */
2211 build_external_ref (tree id, int fun, location_t loc, tree *type)
2214 tree decl = lookup_name (id);
2216 /* In Objective-C, an instance variable (ivar) may be preferred to
2217 whatever lookup_name() found. */
2218 decl = objc_lookup_ivar (decl, id);
2221 if (decl && decl != error_mark_node)
2224 *type = TREE_TYPE (ref);
2227 /* Implicit function declaration. */
2228 ref = implicitly_declare (id);
2229 else if (decl == error_mark_node)
2230 /* Don't complain about something that's already been
2231 complained about. */
2232 return error_mark_node;
2235 undeclared_variable (id, loc);
2236 return error_mark_node;
2239 if (TREE_TYPE (ref) == error_mark_node)
2240 return error_mark_node;
2242 if (TREE_DEPRECATED (ref))
2243 warn_deprecated_use (ref);
2245 /* Recursive call does not count as usage. */
2246 if (ref != current_function_decl)
2248 TREE_USED (ref) = 1;
2251 if (TREE_CODE (ref) == FUNCTION_DECL && !in_alignof)
2253 if (!in_sizeof && !in_typeof)
2254 C_DECL_USED (ref) = 1;
2255 else if (DECL_INITIAL (ref) == 0
2256 && DECL_EXTERNAL (ref)
2257 && !TREE_PUBLIC (ref))
2258 record_maybe_used_decl (ref);
2261 if (TREE_CODE (ref) == CONST_DECL)
2263 used_types_insert (TREE_TYPE (ref));
2264 ref = DECL_INITIAL (ref);
2265 TREE_CONSTANT (ref) = 1;
2267 else if (current_function_decl != 0
2268 && !DECL_FILE_SCOPE_P (current_function_decl)
2269 && (TREE_CODE (ref) == VAR_DECL
2270 || TREE_CODE (ref) == PARM_DECL
2271 || TREE_CODE (ref) == FUNCTION_DECL))
2273 tree context = decl_function_context (ref);
2275 if (context != 0 && context != current_function_decl)
2276 DECL_NONLOCAL (ref) = 1;
2278 /* C99 6.7.4p3: An inline definition of a function with external
2279 linkage ... shall not contain a reference to an identifier with
2280 internal linkage. */
2281 else if (current_function_decl != 0
2282 && DECL_DECLARED_INLINE_P (current_function_decl)
2283 && DECL_EXTERNAL (current_function_decl)
2284 && VAR_OR_FUNCTION_DECL_P (ref)
2285 && (TREE_CODE (ref) != VAR_DECL || TREE_STATIC (ref))
2286 && ! TREE_PUBLIC (ref)
2287 && DECL_CONTEXT (ref) != current_function_decl)
2288 record_inline_static (loc, current_function_decl, ref,
2294 /* Record details of decls possibly used inside sizeof or typeof. */
2295 struct maybe_used_decl
2299 /* The level seen at (in_sizeof + in_typeof). */
2301 /* The next one at this level or above, or NULL. */
2302 struct maybe_used_decl *next;
2305 static struct maybe_used_decl *maybe_used_decls;
2307 /* Record that DECL, an undefined static function reference seen
2308 inside sizeof or typeof, might be used if the operand of sizeof is
2309 a VLA type or the operand of typeof is a variably modified
2313 record_maybe_used_decl (tree decl)
2315 struct maybe_used_decl *t = XOBNEW (&parser_obstack, struct maybe_used_decl);
2317 t->level = in_sizeof + in_typeof;
2318 t->next = maybe_used_decls;
2319 maybe_used_decls = t;
2322 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2323 USED is false, just discard them. If it is true, mark them used
2324 (if no longer inside sizeof or typeof) or move them to the next
2325 level up (if still inside sizeof or typeof). */
2328 pop_maybe_used (bool used)
2330 struct maybe_used_decl *p = maybe_used_decls;
2331 int cur_level = in_sizeof + in_typeof;
2332 while (p && p->level > cur_level)
2337 C_DECL_USED (p->decl) = 1;
2339 p->level = cur_level;
2343 if (!used || cur_level == 0)
2344 maybe_used_decls = p;
2347 /* Return the result of sizeof applied to EXPR. */
2350 c_expr_sizeof_expr (struct c_expr expr)
2353 if (expr.value == error_mark_node)
2355 ret.value = error_mark_node;
2356 ret.original_code = ERROR_MARK;
2357 ret.original_type = NULL;
2358 pop_maybe_used (false);
2362 bool expr_const_operands = true;
2363 tree folded_expr = c_fully_fold (expr.value, require_constant_value,
2364 &expr_const_operands);
2365 ret.value = c_sizeof (TREE_TYPE (folded_expr));
2366 ret.original_code = ERROR_MARK;
2367 ret.original_type = NULL;
2368 if (c_vla_type_p (TREE_TYPE (folded_expr)))
2370 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2371 ret.value = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (ret.value),
2372 folded_expr, ret.value);
2373 C_MAYBE_CONST_EXPR_NON_CONST (ret.value) = !expr_const_operands;
2375 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (folded_expr)));
2380 /* Return the result of sizeof applied to T, a structure for the type
2381 name passed to sizeof (rather than the type itself). */
2384 c_expr_sizeof_type (struct c_type_name *t)
2388 tree type_expr = NULL_TREE;
2389 bool type_expr_const = true;
2390 type = groktypename (t, &type_expr, &type_expr_const);
2391 ret.value = c_sizeof (type);
2392 ret.original_code = ERROR_MARK;
2393 ret.original_type = NULL;
2394 if ((type_expr || TREE_CODE (ret.value) == INTEGER_CST)
2395 && c_vla_type_p (type))
2397 /* If the type is a [*] array, it is a VLA but is represented as
2398 having a size of zero. In such a case we must ensure that
2399 the result of sizeof does not get folded to a constant by
2400 c_fully_fold, because if the size is evaluated the result is
2401 not constant and so constraints on zero or negative size
2402 arrays must not be applied when this sizeof call is inside
2403 another array declarator. */
2405 type_expr = integer_zero_node;
2406 ret.value = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (ret.value),
2407 type_expr, ret.value);
2408 C_MAYBE_CONST_EXPR_NON_CONST (ret.value) = !type_expr_const;
2410 pop_maybe_used (type != error_mark_node
2411 ? C_TYPE_VARIABLE_SIZE (type) : false);
2415 /* Build a function call to function FUNCTION with parameters PARAMS.
2416 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2417 TREE_VALUE of each node is a parameter-expression.
2418 FUNCTION's data type may be a function type or a pointer-to-function. */
2421 build_function_call (tree function, tree params)
2426 vec = VEC_alloc (tree, gc, list_length (params));
2427 for (; params; params = TREE_CHAIN (params))
2428 VEC_quick_push (tree, vec, TREE_VALUE (params));
2429 ret = build_function_call_vec (function, vec, NULL);
2430 VEC_free (tree, gc, vec);
2434 /* Build a function call to function FUNCTION with parameters PARAMS.
2435 ORIGTYPES, if not NULL, is a vector of types; each element is
2436 either NULL or the original type of the corresponding element in
2437 PARAMS. The original type may differ from TREE_TYPE of the
2438 parameter for enums. FUNCTION's data type may be a function type
2439 or pointer-to-function. This function changes the elements of
2443 build_function_call_vec (tree function, VEC(tree,gc) *params,
2444 VEC(tree,gc) *origtypes)
2446 tree fntype, fundecl = 0;
2447 tree name = NULL_TREE, result;
2453 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2454 STRIP_TYPE_NOPS (function);
2456 /* Convert anything with function type to a pointer-to-function. */
2457 if (TREE_CODE (function) == FUNCTION_DECL)
2459 /* Implement type-directed function overloading for builtins.
2460 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2461 handle all the type checking. The result is a complete expression
2462 that implements this function call. */
2463 tem = resolve_overloaded_builtin (function, params);
2467 name = DECL_NAME (function);
2470 if (TREE_CODE (TREE_TYPE (function)) == FUNCTION_TYPE)
2471 function = function_to_pointer_conversion (function);
2473 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2474 expressions, like those used for ObjC messenger dispatches. */
2475 if (!VEC_empty (tree, params))
2476 function = objc_rewrite_function_call (function,
2477 VEC_index (tree, params, 0));
2479 function = c_fully_fold (function, false, NULL);
2481 fntype = TREE_TYPE (function);
2483 if (TREE_CODE (fntype) == ERROR_MARK)
2484 return error_mark_node;
2486 if (!(TREE_CODE (fntype) == POINTER_TYPE
2487 && TREE_CODE (TREE_TYPE (fntype)) == FUNCTION_TYPE))
2489 error ("called object %qE is not a function", function);
2490 return error_mark_node;
2493 if (fundecl && TREE_THIS_VOLATILE (fundecl))
2494 current_function_returns_abnormally = 1;
2496 /* fntype now gets the type of function pointed to. */
2497 fntype = TREE_TYPE (fntype);
2499 /* Convert the parameters to the types declared in the
2500 function prototype, or apply default promotions. */
2502 nargs = convert_arguments (TYPE_ARG_TYPES (fntype), params, origtypes,
2505 return error_mark_node;
2507 /* Check that the function is called through a compatible prototype.
2508 If it is not, replace the call by a trap, wrapped up in a compound
2509 expression if necessary. This has the nice side-effect to prevent
2510 the tree-inliner from generating invalid assignment trees which may
2511 blow up in the RTL expander later. */
2512 if (CONVERT_EXPR_P (function)
2513 && TREE_CODE (tem = TREE_OPERAND (function, 0)) == ADDR_EXPR
2514 && TREE_CODE (tem = TREE_OPERAND (tem, 0)) == FUNCTION_DECL
2515 && !comptypes (fntype, TREE_TYPE (tem)))
2517 tree return_type = TREE_TYPE (fntype);
2518 tree trap = build_function_call (built_in_decls[BUILT_IN_TRAP],
2522 /* This situation leads to run-time undefined behavior. We can't,
2523 therefore, simply error unless we can prove that all possible
2524 executions of the program must execute the code. */
2525 if (warning (0, "function called through a non-compatible type"))
2526 /* We can, however, treat "undefined" any way we please.
2527 Call abort to encourage the user to fix the program. */
2528 inform (input_location, "if this code is reached, the program will abort");
2529 /* Before the abort, allow the function arguments to exit or
2531 for (i = 0; i < nargs; i++)
2532 trap = build2 (COMPOUND_EXPR, void_type_node,
2533 VEC_index (tree, params, i), trap);
2535 if (VOID_TYPE_P (return_type))
2537 if (TYPE_QUALS (return_type) != TYPE_UNQUALIFIED)
2538 pedwarn (input_location, 0,
2539 "function with qualified void return type called");
2546 if (AGGREGATE_TYPE_P (return_type))
2547 rhs = build_compound_literal (return_type,
2548 build_constructor (return_type, 0),
2551 rhs = fold_convert (return_type, integer_zero_node);
2553 return require_complete_type (build2 (COMPOUND_EXPR, return_type,
2558 argarray = VEC_address (tree, params);
2560 /* Check that arguments to builtin functions match the expectations. */
2562 && DECL_BUILT_IN (fundecl)
2563 && DECL_BUILT_IN_CLASS (fundecl) == BUILT_IN_NORMAL
2564 && !check_builtin_function_arguments (fundecl, nargs, argarray))
2565 return error_mark_node;
2567 /* Check that the arguments to the function are valid. */
2568 check_function_arguments (TYPE_ATTRIBUTES (fntype), nargs, argarray,
2569 TYPE_ARG_TYPES (fntype));
2571 if (name != NULL_TREE
2572 && !strncmp (IDENTIFIER_POINTER (name), "__builtin_", 10))
2574 if (require_constant_value)
2575 result = fold_build_call_array_initializer (TREE_TYPE (fntype),
2576 function, nargs, argarray);
2578 result = fold_build_call_array (TREE_TYPE (fntype),
2579 function, nargs, argarray);
2580 if (TREE_CODE (result) == NOP_EXPR
2581 && TREE_CODE (TREE_OPERAND (result, 0)) == INTEGER_CST)
2582 STRIP_TYPE_NOPS (result);
2585 result = build_call_array (TREE_TYPE (fntype),
2586 function, nargs, argarray);
2588 if (VOID_TYPE_P (TREE_TYPE (result)))
2590 if (TYPE_QUALS (TREE_TYPE (result)) != TYPE_UNQUALIFIED)
2591 pedwarn (input_location, 0,
2592 "function with qualified void return type called");
2595 return require_complete_type (result);
2598 /* Convert the argument expressions in the vector VALUES
2599 to the types in the list TYPELIST.
2601 If TYPELIST is exhausted, or when an element has NULL as its type,
2602 perform the default conversions.
2604 ORIGTYPES is the original types of the expressions in VALUES. This
2605 holds the type of enum values which have been converted to integral
2606 types. It may be NULL.
2608 FUNCTION is a tree for the called function. It is used only for
2609 error messages, where it is formatted with %qE.
2611 This is also where warnings about wrong number of args are generated.
2613 Returns the actual number of arguments processed (which may be less
2614 than the length of VALUES in some error situations), or -1 on
2618 convert_arguments (tree typelist, VEC(tree,gc) *values,
2619 VEC(tree,gc) *origtypes, tree function, tree fundecl)
2622 unsigned int parmnum;
2623 const bool type_generic = fundecl
2624 && lookup_attribute ("type generic", TYPE_ATTRIBUTES(TREE_TYPE (fundecl)));
2625 bool type_generic_remove_excess_precision = false;
2628 /* Change pointer to function to the function itself for
2630 if (TREE_CODE (function) == ADDR_EXPR
2631 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
2632 function = TREE_OPERAND (function, 0);
2634 /* Handle an ObjC selector specially for diagnostics. */
2635 selector = objc_message_selector ();
2637 /* For type-generic built-in functions, determine whether excess
2638 precision should be removed (classification) or not
2641 && DECL_BUILT_IN (fundecl)
2642 && DECL_BUILT_IN_CLASS (fundecl) == BUILT_IN_NORMAL)
2644 switch (DECL_FUNCTION_CODE (fundecl))
2646 case BUILT_IN_ISFINITE:
2647 case BUILT_IN_ISINF:
2648 case BUILT_IN_ISINF_SIGN:
2649 case BUILT_IN_ISNAN:
2650 case BUILT_IN_ISNORMAL:
2651 case BUILT_IN_FPCLASSIFY:
2652 type_generic_remove_excess_precision = true;
2656 type_generic_remove_excess_precision = false;
2661 /* Scan the given expressions and types, producing individual
2662 converted arguments. */
2664 for (typetail = typelist, parmnum = 0;
2665 VEC_iterate (tree, values, parmnum, val);
2668 tree type = typetail ? TREE_VALUE (typetail) : 0;
2669 tree valtype = TREE_TYPE (val);
2670 tree rname = function;
2671 int argnum = parmnum + 1;
2672 const char *invalid_func_diag;
2673 bool excess_precision = false;
2677 if (type == void_type_node)
2679 error ("too many arguments to function %qE", function);
2683 if (selector && argnum > 2)
2689 npc = null_pointer_constant_p (val);
2691 /* If there is excess precision and a prototype, convert once to
2692 the required type rather than converting via the semantic
2693 type. Likewise without a prototype a float value represented
2694 as long double should be converted once to double. But for
2695 type-generic classification functions excess precision must
2697 if (TREE_CODE (val) == EXCESS_PRECISION_EXPR
2698 && (type || !type_generic || !type_generic_remove_excess_precision))
2700 val = TREE_OPERAND (val, 0);
2701 excess_precision = true;
2703 val = c_fully_fold (val, false, NULL);
2704 STRIP_TYPE_NOPS (val);
2706 val = require_complete_type (val);
2710 /* Formal parm type is specified by a function prototype. */
2712 if (type == error_mark_node || !COMPLETE_TYPE_P (type))
2714 error ("type of formal parameter %d is incomplete", parmnum + 1);
2721 /* Optionally warn about conversions that
2722 differ from the default conversions. */
2723 if (warn_traditional_conversion || warn_traditional)
2725 unsigned int formal_prec = TYPE_PRECISION (type);
2727 if (INTEGRAL_TYPE_P (type)
2728 && TREE_CODE (valtype) == REAL_TYPE)
2729 warning (0, "passing argument %d of %qE as integer "
2730 "rather than floating due to prototype",
2732 if (INTEGRAL_TYPE_P (type)
2733 && TREE_CODE (valtype) == COMPLEX_TYPE)
2734 warning (0, "passing argument %d of %qE as integer "
2735 "rather than complex due to prototype",
2737 else if (TREE_CODE (type) == COMPLEX_TYPE
2738 && TREE_CODE (valtype) == REAL_TYPE)
2739 warning (0, "passing argument %d of %qE as complex "
2740 "rather than floating due to prototype",
2742 else if (TREE_CODE (type) == REAL_TYPE
2743 && INTEGRAL_TYPE_P (valtype))
2744 warning (0, "passing argument %d of %qE as floating "
2745 "rather than integer due to prototype",
2747 else if (TREE_CODE (type) == COMPLEX_TYPE
2748 && INTEGRAL_TYPE_P (valtype))
2749 warning (0, "passing argument %d of %qE as complex "
2750 "rather than integer due to prototype",
2752 else if (TREE_CODE (type) == REAL_TYPE
2753 && TREE_CODE (valtype) == COMPLEX_TYPE)
2754 warning (0, "passing argument %d of %qE as floating "
2755 "rather than complex due to prototype",
2757 /* ??? At some point, messages should be written about
2758 conversions between complex types, but that's too messy
2760 else if (TREE_CODE (type) == REAL_TYPE
2761 && TREE_CODE (valtype) == REAL_TYPE)
2763 /* Warn if any argument is passed as `float',
2764 since without a prototype it would be `double'. */
2765 if (formal_prec == TYPE_PRECISION (float_type_node)
2766 && type != dfloat32_type_node)
2767 warning (0, "passing argument %d of %qE as %<float%> "
2768 "rather than %<double%> due to prototype",
2771 /* Warn if mismatch between argument and prototype
2772 for decimal float types. Warn of conversions with
2773 binary float types and of precision narrowing due to
2775 else if (type != valtype
2776 && (type == dfloat32_type_node
2777 || type == dfloat64_type_node
2778 || type == dfloat128_type_node
2779 || valtype == dfloat32_type_node
2780 || valtype == dfloat64_type_node
2781 || valtype == dfloat128_type_node)
2783 <= TYPE_PRECISION (valtype)
2784 || (type == dfloat128_type_node
2786 != dfloat64_type_node
2788 != dfloat32_type_node)))
2789 || (type == dfloat64_type_node
2791 != dfloat32_type_node))))
2792 warning (0, "passing argument %d of %qE as %qT "
2793 "rather than %qT due to prototype",
2794 argnum, rname, type, valtype);
2797 /* Detect integer changing in width or signedness.
2798 These warnings are only activated with
2799 -Wtraditional-conversion, not with -Wtraditional. */
2800 else if (warn_traditional_conversion && INTEGRAL_TYPE_P (type)
2801 && INTEGRAL_TYPE_P (valtype))
2803 tree would_have_been = default_conversion (val);
2804 tree type1 = TREE_TYPE (would_have_been);
2806 if (TREE_CODE (type) == ENUMERAL_TYPE
2807 && (TYPE_MAIN_VARIANT (type)
2808 == TYPE_MAIN_VARIANT (valtype)))
2809 /* No warning if function asks for enum
2810 and the actual arg is that enum type. */
2812 else if (formal_prec != TYPE_PRECISION (type1))
2813 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2814 "with different width due to prototype",
2816 else if (TYPE_UNSIGNED (type) == TYPE_UNSIGNED (type1))
2818 /* Don't complain if the formal parameter type
2819 is an enum, because we can't tell now whether
2820 the value was an enum--even the same enum. */
2821 else if (TREE_CODE (type) == ENUMERAL_TYPE)
2823 else if (TREE_CODE (val) == INTEGER_CST
2824 && int_fits_type_p (val, type))
2825 /* Change in signedness doesn't matter
2826 if a constant value is unaffected. */
2828 /* If the value is extended from a narrower
2829 unsigned type, it doesn't matter whether we
2830 pass it as signed or unsigned; the value
2831 certainly is the same either way. */
2832 else if (TYPE_PRECISION (valtype) < TYPE_PRECISION (type)
2833 && TYPE_UNSIGNED (valtype))
2835 else if (TYPE_UNSIGNED (type))
2836 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2837 "as unsigned due to prototype",
2840 warning (OPT_Wtraditional_conversion, "passing argument %d of %qE "
2841 "as signed due to prototype", argnum, rname);
2845 /* Possibly restore an EXCESS_PRECISION_EXPR for the
2846 sake of better warnings from convert_and_check. */
2847 if (excess_precision)
2848 val = build1 (EXCESS_PRECISION_EXPR, valtype, val);
2849 origtype = (origtypes == NULL
2851 : VEC_index (tree, origtypes, parmnum));
2852 parmval = convert_for_assignment (type, val, origtype,
2857 if (targetm.calls.promote_prototypes (fundecl ? TREE_TYPE (fundecl) : 0)
2858 && INTEGRAL_TYPE_P (type)
2859 && (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)))
2860 parmval = default_conversion (parmval);
2863 else if (TREE_CODE (valtype) == REAL_TYPE
2864 && (TYPE_PRECISION (valtype)
2865 < TYPE_PRECISION (double_type_node))
2866 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (valtype)))
2871 /* Convert `float' to `double'. */
2872 parmval = convert (double_type_node, val);
2874 else if (excess_precision && !type_generic)
2875 /* A "double" argument with excess precision being passed
2876 without a prototype or in variable arguments. */
2877 parmval = convert (valtype, val);
2878 else if ((invalid_func_diag =
2879 targetm.calls.invalid_arg_for_unprototyped_fn (typelist, fundecl, val)))
2881 error (invalid_func_diag);
2885 /* Convert `short' and `char' to full-size `int'. */
2886 parmval = default_conversion (val);
2888 VEC_replace (tree, values, parmnum, parmval);
2891 typetail = TREE_CHAIN (typetail);
2894 gcc_assert (parmnum == VEC_length (tree, values));
2896 if (typetail != 0 && TREE_VALUE (typetail) != void_type_node)
2898 error ("too few arguments to function %qE", function);
2905 /* This is the entry point used by the parser to build unary operators
2906 in the input. CODE, a tree_code, specifies the unary operator, and
2907 ARG is the operand. For unary plus, the C parser currently uses
2908 CONVERT_EXPR for code.
2910 LOC is the location to use for the tree generated.
2914 parser_build_unary_op (enum tree_code code, struct c_expr arg, location_t loc)
2916 struct c_expr result;
2918 result.value = build_unary_op (loc, code, arg.value, 0);
2919 result.original_code = code;
2920 result.original_type = NULL;
2922 if (TREE_OVERFLOW_P (result.value) && !TREE_OVERFLOW_P (arg.value))
2923 overflow_warning (result.value);
2928 /* This is the entry point used by the parser to build binary operators
2929 in the input. CODE, a tree_code, specifies the binary operator, and
2930 ARG1 and ARG2 are the operands. In addition to constructing the
2931 expression, we check for operands that were written with other binary
2932 operators in a way that is likely to confuse the user.
2934 LOCATION is the location of the binary operator. */
2937 parser_build_binary_op (location_t location, enum tree_code code,
2938 struct c_expr arg1, struct c_expr arg2)
2940 struct c_expr result;
2942 enum tree_code code1 = arg1.original_code;
2943 enum tree_code code2 = arg2.original_code;
2944 tree type1 = (arg1.original_type
2945 ? arg1.original_type
2946 : TREE_TYPE (arg1.value));
2947 tree type2 = (arg2.original_type
2948 ? arg2.original_type
2949 : TREE_TYPE (arg2.value));
2951 result.value = build_binary_op (location, code,
2952 arg1.value, arg2.value, 1);
2953 result.original_code = code;
2954 result.original_type = NULL;
2956 if (TREE_CODE (result.value) == ERROR_MARK)
2959 if (location != UNKNOWN_LOCATION)
2960 protected_set_expr_location (result.value, location);
2962 /* Check for cases such as x+y<<z which users are likely
2964 if (warn_parentheses)
2965 warn_about_parentheses (code, code1, arg1.value, code2, arg2.value);
2967 if (warn_logical_op)
2968 warn_logical_operator (input_location, code,
2969 code1, arg1.value, code2, arg2.value);
2971 /* Warn about comparisons against string literals, with the exception
2972 of testing for equality or inequality of a string literal with NULL. */
2973 if (code == EQ_EXPR || code == NE_EXPR)
2975 if ((code1 == STRING_CST && !integer_zerop (arg2.value))
2976 || (code2 == STRING_CST && !integer_zerop (arg1.value)))
2977 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2979 else if (TREE_CODE_CLASS (code) == tcc_comparison
2980 && (code1 == STRING_CST || code2 == STRING_CST))
2981 warning (OPT_Waddress, "comparison with string literal results in unspecified behavior");
2983 if (TREE_OVERFLOW_P (result.value)
2984 && !TREE_OVERFLOW_P (arg1.value)
2985 && !TREE_OVERFLOW_P (arg2.value))
2986 overflow_warning (result.value);
2988 /* Warn about comparisons of different enum types. */
2989 if (warn_enum_compare
2990 && TREE_CODE_CLASS (code) == tcc_comparison
2991 && TREE_CODE (type1) == ENUMERAL_TYPE
2992 && TREE_CODE (type2) == ENUMERAL_TYPE
2993 && TYPE_MAIN_VARIANT (type1) != TYPE_MAIN_VARIANT (type2))
2994 warning_at (location, OPT_Wenum_compare,
2995 "comparison between %qT and %qT",
3001 /* Return a tree for the difference of pointers OP0 and OP1.
3002 The resulting tree has type int. */
3005 pointer_diff (tree op0, tree op1)
3007 tree restype = ptrdiff_type_node;
3009 tree target_type = TREE_TYPE (TREE_TYPE (op0));
3010 tree con0, con1, lit0, lit1;
3011 tree orig_op1 = op1;
3013 if (TREE_CODE (target_type) == VOID_TYPE)
3014 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3015 "pointer of type %<void *%> used in subtraction");
3016 if (TREE_CODE (target_type) == FUNCTION_TYPE)
3017 pedwarn (input_location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3018 "pointer to a function used in subtraction");
3020 /* If the conversion to ptrdiff_type does anything like widening or
3021 converting a partial to an integral mode, we get a convert_expression
3022 that is in the way to do any simplifications.
3023 (fold-const.c doesn't know that the extra bits won't be needed.
3024 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
3025 different mode in place.)
3026 So first try to find a common term here 'by hand'; we want to cover
3027 at least the cases that occur in legal static initializers. */
3028 if (CONVERT_EXPR_P (op0)
3029 && (TYPE_PRECISION (TREE_TYPE (op0))
3030 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0, 0)))))
3031 con0 = TREE_OPERAND (op0, 0);
3034 if (CONVERT_EXPR_P (op1)
3035 && (TYPE_PRECISION (TREE_TYPE (op1))
3036 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1, 0)))))
3037 con1 = TREE_OPERAND (op1, 0);
3041 if (TREE_CODE (con0) == PLUS_EXPR)
3043 lit0 = TREE_OPERAND (con0, 1);
3044 con0 = TREE_OPERAND (con0, 0);
3047 lit0 = integer_zero_node;
3049 if (TREE_CODE (con1) == PLUS_EXPR)
3051 lit1 = TREE_OPERAND (con1, 1);
3052 con1 = TREE_OPERAND (con1, 0);
3055 lit1 = integer_zero_node;
3057 if (operand_equal_p (con0, con1, 0))
3064 /* First do the subtraction as integers;
3065 then drop through to build the divide operator.
3066 Do not do default conversions on the minus operator
3067 in case restype is a short type. */
3069 op0 = build_binary_op (input_location,
3070 MINUS_EXPR, convert (restype, op0),
3071 convert (restype, op1), 0);
3072 /* This generates an error if op1 is pointer to incomplete type. */
3073 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1))))
3074 error ("arithmetic on pointer to an incomplete type");
3076 /* This generates an error if op0 is pointer to incomplete type. */
3077 op1 = c_size_in_bytes (target_type);
3079 /* Divide by the size, in easiest possible way. */
3080 return fold_build2 (EXACT_DIV_EXPR, restype, op0, convert (restype, op1));
3083 /* Construct and perhaps optimize a tree representation
3084 for a unary operation. CODE, a tree_code, specifies the operation
3085 and XARG is the operand.
3086 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
3087 the default promotions (such as from short to int).
3088 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
3089 allows non-lvalues; this is only used to handle conversion of non-lvalue
3090 arrays to pointers in C99.
3092 LOCATION is the location of the operator. */
3095 build_unary_op (location_t location,
3096 enum tree_code code, tree xarg, int flag)
3098 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
3101 enum tree_code typecode;
3103 tree ret = error_mark_node;
3104 tree eptype = NULL_TREE;
3105 int noconvert = flag;
3106 const char *invalid_op_diag;
3109 int_operands = EXPR_INT_CONST_OPERANDS (xarg);
3111 arg = remove_c_maybe_const_expr (arg);
3113 if (code != ADDR_EXPR)
3114 arg = require_complete_type (arg);
3116 typecode = TREE_CODE (TREE_TYPE (arg));
3117 if (typecode == ERROR_MARK)
3118 return error_mark_node;
3119 if (typecode == ENUMERAL_TYPE || typecode == BOOLEAN_TYPE)
3120 typecode = INTEGER_TYPE;
3122 if ((invalid_op_diag
3123 = targetm.invalid_unary_op (code, TREE_TYPE (xarg))))
3125 error_at (location, invalid_op_diag);
3126 return error_mark_node;
3129 if (TREE_CODE (arg) == EXCESS_PRECISION_EXPR)
3131 eptype = TREE_TYPE (arg);
3132 arg = TREE_OPERAND (arg, 0);
3138 /* This is used for unary plus, because a CONVERT_EXPR
3139 is enough to prevent anybody from looking inside for
3140 associativity, but won't generate any code. */
3141 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
3142 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
3143 || typecode == VECTOR_TYPE))
3145 error_at (location, "wrong type argument to unary plus");
3146 return error_mark_node;
3148 else if (!noconvert)
3149 arg = default_conversion (arg);
3150 arg = non_lvalue (arg);
3154 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
3155 || typecode == FIXED_POINT_TYPE || typecode == COMPLEX_TYPE
3156 || typecode == VECTOR_TYPE))
3158 error_at (location, "wrong type argument to unary minus");
3159 return error_mark_node;
3161 else if (!noconvert)
3162 arg = default_conversion (arg);
3166 /* ~ works on integer types and non float vectors. */
3167 if (typecode == INTEGER_TYPE
3168 || (typecode == VECTOR_TYPE
3169 && !VECTOR_FLOAT_TYPE_P (TREE_TYPE (arg))))
3172 arg = default_conversion (arg);
3174 else if (typecode == COMPLEX_TYPE)
3177 pedwarn (location, OPT_pedantic,
3178 "ISO C does not support %<~%> for complex conjugation");
3180 arg = default_conversion (arg);
3184 error_at (location, "wrong type argument to bit-complement");
3185 return error_mark_node;
3190 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE))
3192 error_at (location, "wrong type argument to abs");
3193 return error_mark_node;
3195 else if (!noconvert)
3196 arg = default_conversion (arg);
3200 /* Conjugating a real value is a no-op, but allow it anyway. */
3201 if (!(typecode == INTEGER_TYPE || typecode == REAL_TYPE
3202 || typecode == COMPLEX_TYPE))
3204 error_at (location, "wrong type argument to conjugation");
3205 return error_mark_node;
3207 else if (!noconvert)
3208 arg = default_conversion (arg);
3211 case TRUTH_NOT_EXPR:
3212 if (typecode != INTEGER_TYPE && typecode != FIXED_POINT_TYPE
3213 && typecode != REAL_TYPE && typecode != POINTER_TYPE
3214 && typecode != COMPLEX_TYPE)
3217 "wrong type argument to unary exclamation mark");
3218 return error_mark_node;
3220 arg = c_objc_common_truthvalue_conversion (location, arg);
3221 ret = invert_truthvalue (arg);
3222 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
3223 if (EXPR_P (ret) && EXPR_HAS_LOCATION (ret))
3224 location = EXPR_LOCATION (ret);
3225 goto return_build_unary_op;
3228 if (TREE_CODE (arg) == COMPLEX_CST)
3229 ret = TREE_REALPART (arg);
3230 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3231 ret = fold_build1 (REALPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3234 if (eptype && TREE_CODE (eptype) == COMPLEX_TYPE)
3235 eptype = TREE_TYPE (eptype);
3236 goto return_build_unary_op;
3239 if (TREE_CODE (arg) == COMPLEX_CST)
3240 ret = TREE_IMAGPART (arg);
3241 else if (TREE_CODE (TREE_TYPE (arg)) == COMPLEX_TYPE)
3242 ret = fold_build1 (IMAGPART_EXPR, TREE_TYPE (TREE_TYPE (arg)), arg);
3244 ret = omit_one_operand (TREE_TYPE (arg), integer_zero_node, arg);
3245 if (eptype && TREE_CODE (eptype) == COMPLEX_TYPE)
3246 eptype = TREE_TYPE (eptype);
3247 goto return_build_unary_op;
3249 case PREINCREMENT_EXPR:
3250 case POSTINCREMENT_EXPR:
3251 case PREDECREMENT_EXPR:
3252 case POSTDECREMENT_EXPR:
3254 if (TREE_CODE (arg) == C_MAYBE_CONST_EXPR)
3256 tree inner = build_unary_op (location, code,
3257 C_MAYBE_CONST_EXPR_EXPR (arg), flag);
3258 if (inner == error_mark_node)
3259 return error_mark_node;
3260 ret = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (inner),
3261 C_MAYBE_CONST_EXPR_PRE (arg), inner);
3262 gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (arg));
3263 C_MAYBE_CONST_EXPR_NON_CONST (ret) = 1;
3264 goto return_build_unary_op;
3267 /* Complain about anything that is not a true lvalue. */
3268 if (!lvalue_or_else (arg, ((code == PREINCREMENT_EXPR
3269 || code == POSTINCREMENT_EXPR)
3272 return error_mark_node;
3274 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
3275 arg = c_fully_fold (arg, false, NULL);
3277 /* Increment or decrement the real part of the value,
3278 and don't change the imaginary part. */
3279 if (typecode == COMPLEX_TYPE)
3283 pedwarn (location, OPT_pedantic,
3284 "ISO C does not support %<++%> and %<--%> on complex types");
3286 arg = stabilize_reference (arg);
3287 real = build_unary_op (EXPR_LOCATION (arg), REALPART_EXPR, arg, 1);
3288 imag = build_unary_op (EXPR_LOCATION (arg), IMAGPART_EXPR, arg, 1);
3289 real = build_unary_op (EXPR_LOCATION (arg), code, real, 1);
3290 if (real == error_mark_node || imag == error_mark_node)
3291 return error_mark_node;
3292 ret = build2 (COMPLEX_EXPR, TREE_TYPE (arg),
3294 goto return_build_unary_op;
3297 /* Report invalid types. */
3299 if (typecode != POINTER_TYPE && typecode != FIXED_POINT_TYPE
3300 && typecode != INTEGER_TYPE && typecode != REAL_TYPE)
3302 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3303 error_at (location, "wrong type argument to increment");
3305 error_at (location, "wrong type argument to decrement");
3307 return error_mark_node;
3313 argtype = TREE_TYPE (arg);
3315 /* Compute the increment. */
3317 if (typecode == POINTER_TYPE)
3319 /* If pointer target is an undefined struct,
3320 we just cannot know how to do the arithmetic. */
3321 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (argtype)))
3323 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3325 "increment of pointer to unknown structure");
3328 "decrement of pointer to unknown structure");
3330 else if (TREE_CODE (TREE_TYPE (argtype)) == FUNCTION_TYPE
3331 || TREE_CODE (TREE_TYPE (argtype)) == VOID_TYPE)
3333 if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)
3334 pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3335 "wrong type argument to increment");
3337 pedwarn (location, pedantic ? OPT_pedantic : OPT_Wpointer_arith,
3338 "wrong type argument to decrement");
3341 inc = c_size_in_bytes (TREE_TYPE (argtype));
3342 inc = fold_convert (sizetype, inc);
3344 else if (FRACT_MODE_P (TYPE_MODE (argtype)))
3346 /* For signed fract types, we invert ++ to -- or
3347 -- to ++, and change inc from 1 to -1, because
3348 it is not possible to represent 1 in signed fract constants.
3349 For unsigned fract types, the result always overflows and
3350 we get an undefined (original) or the maximum value. */
3351 if (code == PREINCREMENT_EXPR)
3352 code = PREDECREMENT_EXPR;
3353 else if (code == PREDECREMENT_EXPR)
3354 code = PREINCREMENT_EXPR;
3355 else if (code == POSTINCREMENT_EXPR)
3356 code = POSTDECREMENT_EXPR;
3357 else /* code == POSTDECREMENT_EXPR */
3358 code = POSTINCREMENT_EXPR;
3360 inc = integer_minus_one_node;
3361 inc = convert (argtype, inc);
3365 inc = integer_one_node;
3366 inc = convert (argtype, inc);
3369 /* Report a read-only lvalue. */
3370 if (TYPE_READONLY (argtype))
3372 readonly_error (arg,
3373 ((code == PREINCREMENT_EXPR
3374 || code == POSTINCREMENT_EXPR)
3375 ? lv_increment : lv_decrement));
3376 return error_mark_node;
3378 else if (TREE_READONLY (arg))
3379 readonly_warning (arg,
3380 ((code == PREINCREMENT_EXPR
3381 || code == POSTINCREMENT_EXPR)
3382 ? lv_increment : lv_decrement));
3384 if (TREE_CODE (TREE_TYPE (arg)) == BOOLEAN_TYPE)
3385 val = boolean_increment (code, arg);
3387 val = build2 (code, TREE_TYPE (arg), arg, inc);
3388 TREE_SIDE_EFFECTS (val) = 1;
3389 if (TREE_CODE (val) != code)
3390 TREE_NO_WARNING (val) = 1;
3392 goto return_build_unary_op;
3396 /* Note that this operation never does default_conversion. */
3398 /* The operand of unary '&' must be an lvalue (which excludes
3399 expressions of type void), or, in C99, the result of a [] or
3400 unary '*' operator. */
3401 if (VOID_TYPE_P (TREE_TYPE (arg))
3402 && TYPE_QUALS (TREE_TYPE (arg)) == TYPE_UNQUALIFIED
3403 && (TREE_CODE (arg) != INDIRECT_REF
3405 pedwarn (location, 0, "taking address of expression of type %<void%>");
3407 /* Let &* cancel out to simplify resulting code. */
3408 if (TREE_CODE (arg) == INDIRECT_REF)
3410 /* Don't let this be an lvalue. */
3411 if (lvalue_p (TREE_OPERAND (arg, 0)))
3412 return non_lvalue (TREE_OPERAND (arg, 0));
3413 ret = TREE_OPERAND (arg, 0);
3414 goto return_build_unary_op;
3417 /* For &x[y], return x+y */
3418 if (TREE_CODE (arg) == ARRAY_REF)
3420 tree op0 = TREE_OPERAND (arg, 0);
3421 if (!c_mark_addressable (op0))
3422 return error_mark_node;
3423 return build_binary_op (location, PLUS_EXPR,
3424 (TREE_CODE (TREE_TYPE (op0)) == ARRAY_TYPE
3425 ? array_to_pointer_conversion (op0)
3427 TREE_OPERAND (arg, 1), 1);
3430 /* Anything not already handled and not a true memory reference
3431 or a non-lvalue array is an error. */
3432 else if (typecode != FUNCTION_TYPE && !flag
3433 && !lvalue_or_else (arg, lv_addressof))
3434 return error_mark_node;
3436 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
3438 if (TREE_CODE (arg) == C_MAYBE_CONST_EXPR)
3440 tree inner = build_unary_op (location, code,
3441 C_MAYBE_CONST_EXPR_EXPR (arg), flag);
3442 ret = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (inner),
3443 C_MAYBE_CONST_EXPR_PRE (arg), inner);
3444 gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (arg));
3445 C_MAYBE_CONST_EXPR_NON_CONST (ret)
3446 = C_MAYBE_CONST_EXPR_NON_CONST (arg);
3447 goto return_build_unary_op;
3450 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3451 argtype = TREE_TYPE (arg);
3453 /* If the lvalue is const or volatile, merge that into the type
3454 to which the address will point. Note that you can't get a
3455 restricted pointer by taking the address of something, so we
3456 only have to deal with `const' and `volatile' here. */
3457 if ((DECL_P (arg) || REFERENCE_CLASS_P (arg))
3458 && (TREE_READONLY (arg) || TREE_THIS_VOLATILE (arg)))
3459 argtype = c_build_type_variant (argtype,
3460 TREE_READONLY (arg),
3461 TREE_THIS_VOLATILE (arg));
3463 if (!c_mark_addressable (arg))
3464 return error_mark_node;
3466 gcc_assert (TREE_CODE (arg) != COMPONENT_REF
3467 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg, 1)));
3469 argtype = build_pointer_type (argtype);
3471 /* ??? Cope with user tricks that amount to offsetof. Delete this
3472 when we have proper support for integer constant expressions. */
3473 val = get_base_address (arg);
3474 if (val && TREE_CODE (val) == INDIRECT_REF
3475 && TREE_CONSTANT (TREE_OPERAND (val, 0)))
3477 tree op0 = fold_convert (sizetype, fold_offsetof (arg, val)), op1;
3479 op1 = fold_convert (argtype, TREE_OPERAND (val, 0));
3480 ret = fold_build2 (POINTER_PLUS_EXPR, argtype, op1, op0);
3481 goto return_build_unary_op;
3484 val = build1 (ADDR_EXPR, argtype, arg);
3487 goto return_build_unary_op;
3494 argtype = TREE_TYPE (arg);
3495 if (TREE_CODE (arg) == INTEGER_CST)
3496 ret = (require_constant_value
3497 ? fold_build1_initializer (code, argtype, arg)
3498 : fold_build1 (code, argtype, arg));
3500 ret = build1 (code, argtype, arg);
3501 return_build_unary_op:
3502 gcc_assert (ret != error_mark_node);
3503 if (TREE_CODE (ret) == INTEGER_CST && !TREE_OVERFLOW (ret)
3504 && !(TREE_CODE (xarg) == INTEGER_CST && !TREE_OVERFLOW (xarg)))
3505 ret = build1 (NOP_EXPR, TREE_TYPE (ret), ret);
3506 else if (TREE_CODE (ret) != INTEGER_CST && int_operands)
3507 ret = note_integer_operands (ret);
3509 ret = build1 (EXCESS_PRECISION_EXPR, eptype, ret);
3510 protected_set_expr_location (ret, location);
3514 /* Return nonzero if REF is an lvalue valid for this language.
3515 Lvalues can be assigned, unless their type has TYPE_READONLY.
3516 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3519 lvalue_p (const_tree ref)
3521 const enum tree_code code = TREE_CODE (ref);
3528 return lvalue_p (TREE_OPERAND (ref, 0));
3530 case C_MAYBE_CONST_EXPR:
3531 return lvalue_p (TREE_OPERAND (ref, 1));
3533 case COMPOUND_LITERAL_EXPR:
3543 return (TREE_CODE (TREE_TYPE (ref)) != FUNCTION_TYPE
3544 && TREE_CODE (TREE_TYPE (ref)) != METHOD_TYPE);
3547 return TREE_CODE (TREE_TYPE (ref)) == ARRAY_TYPE;
3554 /* Give an error for storing in something that is 'const'. */
3557 readonly_error (tree arg, enum lvalue_use use)
3559 gcc_assert (use == lv_assign || use == lv_increment || use == lv_decrement
3561 /* Using this macro rather than (for example) arrays of messages
3562 ensures that all the format strings are checked at compile
3564 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3565 : (use == lv_increment ? (I) \
3566 : (use == lv_decrement ? (D) : (AS))))
3567 if (TREE_CODE (arg) == COMPONENT_REF)
3569 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0))))
3570 readonly_error (TREE_OPERAND (arg, 0), use);
3572 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3573 G_("increment of read-only member %qD"),
3574 G_("decrement of read-only member %qD"),
3575 G_("read-only member %qD used as %<asm%> output")),
3576 TREE_OPERAND (arg, 1));
3578 else if (TREE_CODE (arg) == VAR_DECL)
3579 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3580 G_("increment of read-only variable %qD"),
3581 G_("decrement of read-only variable %qD"),
3582 G_("read-only variable %qD used as %<asm%> output")),
3585 error (READONLY_MSG (G_("assignment of read-only location %qE"),
3586 G_("increment of read-only location %qE"),
3587 G_("decrement of read-only location %qE"),
3588 G_("read-only location %qE used as %<asm%> output")),
3592 /* Give a warning for storing in something that is read-only in GCC
3593 terms but not const in ISO C terms. */
3596 readonly_warning (tree arg, enum lvalue_use use)
3601 warning (0, "assignment of read-only location %qE", arg);
3604 warning (0, "increment of read-only location %qE", arg);
3607 warning (0, "decrement of read-only location %qE", arg);
3616 /* Return nonzero if REF is an lvalue valid for this language;
3617 otherwise, print an error message and return zero. USE says
3618 how the lvalue is being used and so selects the error message. */
3621 lvalue_or_else (const_tree ref, enum lvalue_use use)
3623 int win = lvalue_p (ref);
3631 /* Mark EXP saying that we need to be able to take the
3632 address of it; it should not be allocated in a register.
3633 Returns true if successful. */
3636 c_mark_addressable (tree exp)
3641 switch (TREE_CODE (x))
3644 if (DECL_C_BIT_FIELD (TREE_OPERAND (x, 1)))
3647 ("cannot take address of bit-field %qD", TREE_OPERAND (x, 1));
3651 /* ... fall through ... */
3657 x = TREE_OPERAND (x, 0);
3660 case COMPOUND_LITERAL_EXPR:
3662 TREE_ADDRESSABLE (x) = 1;
3669 if (C_DECL_REGISTER (x)
3670 && DECL_NONLOCAL (x))
3672 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3675 ("global register variable %qD used in nested function", x);
3678 pedwarn (input_location, 0, "register variable %qD used in nested function", x);
3680 else if (C_DECL_REGISTER (x))
3682 if (TREE_PUBLIC (x) || TREE_STATIC (x) || DECL_EXTERNAL (x))
3683 error ("address of global register variable %qD requested", x);
3685 error ("address of register variable %qD requested", x);
3691 TREE_ADDRESSABLE (x) = 1;
3698 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
3699 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
3700 if folded to an integer constant then the unselected half may
3701 contain arbitrary operations not normally permitted in constant
3705 build_conditional_expr (tree ifexp, bool ifexp_bcp, tree op1, tree op2)
3709 enum tree_code code1;
3710 enum tree_code code2;
3711 tree result_type = NULL;
3712 tree ep_result_type = NULL;
3713 tree orig_op1 = op1, orig_op2 = op2;
3714 bool int_const, op1_int_operands, op2_int_operands, int_operands;
3715 bool ifexp_int_operands;
3719 op1_int_operands = EXPR_INT_CONST_OPERANDS (orig_op1);
3720 if (op1_int_operands)
3721 op1 = remove_c_maybe_const_expr (op1);
3722 op2_int_operands = EXPR_INT_CONST_OPERANDS (orig_op2);
3723 if (op2_int_operands)
3724 op2 = remove_c_maybe_const_expr (op2);
3725 ifexp_int_operands = EXPR_INT_CONST_OPERANDS (ifexp);
3726 if (ifexp_int_operands)
3727 ifexp = remove_c_maybe_const_expr (ifexp);
3729 /* Promote both alternatives. */
3731 if (TREE_CODE (TREE_TYPE (op1)) != VOID_TYPE)
3732 op1 = default_conversion (op1);
3733 if (TREE_CODE (TREE_TYPE (op2)) != VOID_TYPE)
3734 op2 = default_conversion (op2);
3736 if (TREE_CODE (ifexp) == ERROR_MARK
3737 || TREE_CODE (TREE_TYPE (op1)) == ERROR_MARK
3738 || TREE_CODE (TREE_TYPE (op2)) == ERROR_MARK)
3739 return error_mark_node;
3741 type1 = TREE_TYPE (op1);
3742 code1 = TREE_CODE (type1);
3743 type2 = TREE_TYPE (op2);
3744 code2 = TREE_CODE (type2);
3746 /* C90 does not permit non-lvalue arrays in conditional expressions.
3747 In C99 they will be pointers by now. */
3748 if (code1 == ARRAY_TYPE || code2 == ARRAY_TYPE)
3750 error ("non-lvalue array in conditional expression");
3751 return error_mark_node;
3754 objc_ok = objc_compare_types (type1, type2, -3, NULL_TREE);
3756 if ((TREE_CODE (op1) == EXCESS_PRECISION_EXPR
3757 || TREE_CODE (op2) == EXCESS_PRECISION_EXPR)
3758 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
3759 || code1 == COMPLEX_TYPE)
3760 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3761 || code2 == COMPLEX_TYPE))
3763 ep_result_type = c_common_type (type1, type2);
3764 if (TREE_CODE (op1) == EXCESS_PRECISION_EXPR)
3766 op1 = TREE_OPERAND (op1, 0);
3767 type1 = TREE_TYPE (op1);
3768 gcc_assert (TREE_CODE (type1) == code1);
3770 if (TREE_CODE (op2) == EXCESS_PRECISION_EXPR)
3772 op2 = TREE_OPERAND (op2, 0);
3773 type2 = TREE_TYPE (op2);
3774 gcc_assert (TREE_CODE (type2) == code2);
3778 /* Quickly detect the usual case where op1 and op2 have the same type
3780 if (TYPE_MAIN_VARIANT (type1) == TYPE_MAIN_VARIANT (type2))
3783 result_type = type1;
3785 result_type = TYPE_MAIN_VARIANT (type1);
3787 else if ((code1 == INTEGER_TYPE || code1 == REAL_TYPE
3788 || code1 == COMPLEX_TYPE)
3789 && (code2 == INTEGER_TYPE || code2 == REAL_TYPE
3790 || code2 == COMPLEX_TYPE))
3792 result_type = c_common_type (type1, type2);
3794 /* If -Wsign-compare, warn here if type1 and type2 have
3795 different signedness. We'll promote the signed to unsigned
3796 and later code won't know it used to be different.
3797 Do this check on the original types, so that explicit casts
3798 will be considered, but default promotions won't. */
3799 if (!skip_evaluation)
3801 int unsigned_op1 = TYPE_UNSIGNED (TREE_TYPE (orig_op1));
3802 int unsigned_op2 = TYPE_UNSIGNED (TREE_TYPE (orig_op2));
3804 if (unsigned_op1 ^ unsigned_op2)
3808 /* Do not warn if the result type is signed, since the
3809 signed type will only be chosen if it can represent
3810 all the values of the unsigned type. */
3811 if (!TYPE_UNSIGNED (result_type))
3815 bool op1_maybe_const = true;
3816 bool op2_maybe_const = true;
3818 /* Do not warn if the signed quantity is an
3819 unsuffixed integer literal (or some static
3820 constant expression involving such literals) and
3821 it is non-negative. This warning requires the
3822 operands to be folded for best results, so do
3823 that folding in this case even without
3824 warn_sign_compare to avoid warning options
3825 possibly affecting code generation. */
3826 op1 = c_fully_fold (op1, require_constant_value,
3828 op2 = c_fully_fold (op2, require_constant_value,
3831 if (warn_sign_compare)
3834 && tree_expr_nonnegative_warnv_p (op1, &ovf))
3836 && tree_expr_nonnegative_warnv_p (op2, &ovf)))
3839 warning (OPT_Wsign_compare, "signed and unsigned type in conditional expression");
3841 if (!op1_maybe_const || TREE_CODE (op1) != INTEGER_CST)
3843 op1 = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (op1),
3845 C_MAYBE_CONST_EXPR_NON_CONST (op1) = !op1_maybe_const;
3847 if (!op2_maybe_const || TREE_CODE (op2) != INTEGER_CST)
3849 op2 = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (op2),
3851 C_MAYBE_CONST_EXPR_NON_CONST (op2) = !op2_maybe_const;
3857 else if (code1 == VOID_TYPE || code2 == VOID_TYPE)
3859 if (code1 != VOID_TYPE || code2 != VOID_TYPE)
3860 pedwarn (input_location, OPT_pedantic,
3861 "ISO C forbids conditional expr with only one void side");
3862 result_type = void_type_node;
3864 else if (code1 == POINTER_TYPE && code2 == POINTER_TYPE)
3866 if (comp_target_types (type1, type2))
3867 result_type = common_pointer_type (type1, type2);
3868 else if (null_pointer_constant_p (orig_op1))
3869 result_type = qualify_type (type2, type1);
3870 else if (null_pointer_constant_p (orig_op2))
3871 result_type = qualify_type (type1, type2);
3872 else if (VOID_TYPE_P (TREE_TYPE (type1)))
3874 if (TREE_CODE (TREE_TYPE (type2)) == FUNCTION_TYPE)
3875 pedwarn (input_location, OPT_pedantic,
3876 "ISO C forbids conditional expr between "
3877 "%<void *%> and function pointer");
3878 result_type = build_pointer_type (qualify_type (TREE_TYPE (type1),
3879 TREE_TYPE (type2)));
3881 else if (VOID_TYPE_P (TREE_TYPE (type2)))
3883 if (TREE_CODE (TREE_TYPE (type1)) == FUNCTION_TYPE)
3884 pedwarn (input_location, OPT_pedantic,
3885 "ISO C forbids conditional expr between "
3886 "%<void *%> and function pointer");
3887 result_type = build_pointer_type (qualify_type (TREE_TYPE (type2),
3888 TREE_TYPE (type1)));
3893 pedwarn (input_location, 0,
3894 "pointer type mismatch in conditional expression");
3895 result_type = build_pointer_type (void_type_node);
3898 else if (code1 == POINTER_TYPE && code2 == INTEGER_TYPE)
3900 if (!null_pointer_constant_p (orig_op2))
3901 pedwarn (input_location, 0,
3902 "pointer/integer type mismatch in conditional expression");
3905 op2 = null_pointer_node;
3907 result_type = type1;
3909 else if (code2 == POINTER_TYPE && code1 == INTEGER_TYPE)
3911 if (!null_pointer_constant_p (orig_op1))
3912 pedwarn (input_location, 0,
3913 "pointer/integer type mismatch in conditional expression");
3916 op1 = null_pointer_node;
3918 result_type = type2;
3923 if (flag_cond_mismatch)
3924 result_type = void_type_node;
3927 error ("type mismatch in conditional expression");
3928 return error_mark_node;
3932 /* Merge const and volatile flags of the incoming types. */
3934 = build_type_variant (result_type,
3935 TREE_READONLY (op1) || TREE_READONLY (op2),
3936 TREE_THIS_VOLATILE (op1) || TREE_THIS_VOLATILE (op2));
3938 if (result_type != TREE_TYPE (op1))
3939 op1 = convert_and_check (result_type, op1);
3940 if (result_type != TREE_TYPE (op2))
3941 op2 = convert_and_check (result_type, op2);
3943 if (ifexp_bcp && ifexp == truthvalue_true_node)
3945 op2_int_operands = true;
3946 op1 = c_fully_fold (op1, require_constant_value, NULL);
3948 if (ifexp_bcp && ifexp == truthvalue_false_node)
3950 op1_int_operands = true;
3951 op2 = c_fully_fold (op2, require_constant_value, NULL);
3953 int_const = int_operands = (ifexp_int_operands
3955 && op2_int_operands);
3958 int_const = ((ifexp == truthvalue_true_node
3959 && TREE_CODE (orig_op1) == INTEGER_CST
3960 && !TREE_OVERFLOW (orig_op1))
3961 || (ifexp == truthvalue_false_node
3962 && TREE_CODE (orig_op2) == INTEGER_CST
3963 && !TREE_OVERFLOW (orig_op2)));
3965 if (int_const || (ifexp_bcp && TREE_CODE (ifexp) == INTEGER_CST))
3966 ret = fold_build3 (COND_EXPR, result_type, ifexp, op1, op2);
3969 ret = build3 (COND_EXPR, result_type, ifexp, op1, op2);
3971 ret = note_integer_operands (ret);
3974 ret = build1 (EXCESS_PRECISION_EXPR, ep_result_type, ret);
3979 /* Return a compound expression that performs two expressions and
3980 returns the value of the second of them. */
3983 build_compound_expr (tree expr1, tree expr2)
3985 bool expr1_int_operands, expr2_int_operands;
3986 tree eptype = NULL_TREE;
3989 expr1_int_operands = EXPR_INT_CONST_OPERANDS (expr1);
3990 if (expr1_int_operands)
3991 expr1 = remove_c_maybe_const_expr (expr1);
3992 expr2_int_operands = EXPR_INT_CONST_OPERANDS (expr2);
3993 if (expr2_int_operands)
3994 expr2 = remove_c_maybe_const_expr (expr2);
3996 if (TREE_CODE (expr1) == EXCESS_PRECISION_EXPR)
3997 expr1 = TREE_OPERAND (expr1, 0);
3998 if (TREE_CODE (expr2) == EXCESS_PRECISION_EXPR)
4000 eptype = TREE_TYPE (expr2);
4001 expr2 = TREE_OPERAND (expr2, 0);
4004 if (!TREE_SIDE_EFFECTS (expr1))
4006 /* The left-hand operand of a comma expression is like an expression
4007 statement: with -Wunused, we should warn if it doesn't have
4008 any side-effects, unless it was explicitly cast to (void). */
4009 if (warn_unused_value)
4011 if (VOID_TYPE_P (TREE_TYPE (expr1))
4012 && CONVERT_EXPR_P (expr1))
4014 else if (VOID_TYPE_P (TREE_TYPE (expr1))
4015 && TREE_CODE (expr1) == COMPOUND_EXPR
4016 && CONVERT_EXPR_P (TREE_OPERAND (expr1, 1)))
4017 ; /* (void) a, (void) b, c */
4019 warning (OPT_Wunused_value,
4020 "left-hand operand of comma expression has no effect");
4024 /* With -Wunused, we should also warn if the left-hand operand does have
4025 side-effects, but computes a value which is not used. For example, in
4026 `foo() + bar(), baz()' the result of the `+' operator is not used,
4027 so we should issue a warning. */
4028 else if (warn_unused_value)
4029 warn_if_unused_value (expr1, input_location);
4031 if (expr2 == error_mark_node)
4032 return error_mark_node;
4034 ret = build2 (COMPOUND_EXPR, TREE_TYPE (expr2), expr1, expr2);
4037 && expr1_int_operands
4038 && expr2_int_operands)
4039 ret = note_integer_operands (ret);
4042 ret = build1 (EXCESS_PRECISION_EXPR, eptype, ret);
4047 /* Build an expression representing a cast to type TYPE of expression EXPR. */
4050 build_c_cast (tree type, tree expr)
4054 if (TREE_CODE (expr) == EXCESS_PRECISION_EXPR)
4055 expr = TREE_OPERAND (expr, 0);
4059 if (type == error_mark_node || expr == error_mark_node)
4060 return error_mark_node;
4062 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
4063 only in <protocol> qualifications. But when constructing cast expressions,
4064 the protocols do matter and must be kept around. */
4065 if (objc_is_object_ptr (type) && objc_is_object_ptr (TREE_TYPE (expr)))
4066 return build1 (NOP_EXPR, type, expr);
4068 type = TYPE_MAIN_VARIANT (type);
4070 if (TREE_CODE (type) == ARRAY_TYPE)
4072 error ("cast specifies array type");
4073 return error_mark_node;
4076 if (TREE_CODE (type) == FUNCTION_TYPE)
4078 error ("cast specifies function type");
4079 return error_mark_node;
4082 if (!VOID_TYPE_P (type))
4084 value = require_complete_type (value);
4085 if (value == error_mark_node)
4086 return error_mark_node;
4089 if (type == TYPE_MAIN_VARIANT (TREE_TYPE (value)))
4091 if (TREE_CODE (type) == RECORD_TYPE
4092 || TREE_CODE (type) == UNION_TYPE)
4093 pedwarn (input_location, OPT_pedantic,
4094 "ISO C forbids casting nonscalar to the same type");
4096 else if (TREE_CODE (type) == UNION_TYPE)
4100 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
4101 if (TREE_TYPE (field) != error_mark_node
4102 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field)),
4103 TYPE_MAIN_VARIANT (TREE_TYPE (value))))
4110 pedwarn (input_location, OPT_pedantic,
4111 "ISO C forbids casts to union type");
4112 t = digest_init (type,
4113 build_constructor_single (type, field, value),
4114 NULL_TREE, false, true, 0);
4115 TREE_CONSTANT (t) = TREE_CONSTANT (value);
4118 error ("cast to union type from type not present in union");
4119 return error_mark_node;
4125 if (type == void_type_node)
4126 return build1 (CONVERT_EXPR, type, value);
4128 otype = TREE_TYPE (value);
4130 /* Optionally warn about potentially worrisome casts. */
4133 && TREE_CODE (type) == POINTER_TYPE
4134 && TREE_CODE (otype) == POINTER_TYPE)
4136 tree in_type = type;
4137 tree in_otype = otype;
4141 /* Check that the qualifiers on IN_TYPE are a superset of
4142 the qualifiers of IN_OTYPE. The outermost level of
4143 POINTER_TYPE nodes is uninteresting and we stop as soon
4144 as we hit a non-POINTER_TYPE node on either type. */
4147 in_otype = TREE_TYPE (in_otype);
4148 in_type = TREE_TYPE (in_type);
4150 /* GNU C allows cv-qualified function types. 'const'
4151 means the function is very pure, 'volatile' means it
4152 can't return. We need to warn when such qualifiers
4153 are added, not when they're taken away. */
4154 if (TREE_CODE (in_otype) == FUNCTION_TYPE
4155 && TREE_CODE (in_type) == FUNCTION_TYPE)
4156 added |= (TYPE_QUALS (in_type) & ~TYPE_QUALS (in_otype));
4158 discarded |= (TYPE_QUALS (in_otype) & ~TYPE_QUALS (in_type));
4160 while (TREE_CODE (in_type) == POINTER_TYPE
4161 && TREE_CODE (in_otype) == POINTER_TYPE);
4164 warning (OPT_Wcast_qual, "cast adds new qualifiers to function type");
4167 /* There are qualifiers present in IN_OTYPE that are not
4168 present in IN_TYPE. */
4169 warning (OPT_Wcast_qual, "cast discards qualifiers from pointer target type");
4172 /* Warn about possible alignment problems. */
4173 if (STRICT_ALIGNMENT
4174 && TREE_CODE (type) == POINTER_TYPE
4175 && TREE_CODE (otype) == POINTER_TYPE
4176 && TREE_CODE (TREE_TYPE (otype)) != VOID_TYPE
4177 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
4178 /* Don't warn about opaque types, where the actual alignment
4179 restriction is unknown. */
4180 && !((TREE_CODE (TREE_TYPE (otype)) == UNION_TYPE
4181 || TREE_CODE (TREE_TYPE (otype)) == RECORD_TYPE)
4182 && TYPE_MODE (TREE_TYPE (otype)) == VOIDmode)
4183 && TYPE_ALIGN (TREE_TYPE (type)) > TYPE_ALIGN (TREE_TYPE (otype)))
4184 warning (OPT_Wcast_align,
4185 "cast increases required alignment of target type");
4187 if (TREE_CODE (type) == INTEGER_TYPE
4188 && TREE_CODE (otype) == POINTER_TYPE
4189 && TYPE_PRECISION (type) != TYPE_PRECISION (otype))
4190 /* Unlike conversion of integers to pointers, where the
4191 warning is disabled for converting constants because
4192 of cases such as SIG_*, warn about converting constant
4193 pointers to integers. In some cases it may cause unwanted
4194 sign extension, and a warning is appropriate. */
4195 warning (OPT_Wpointer_to_int_cast,
4196 "cast from pointer to integer of different size");
4198 if (TREE_CODE (value) == CALL_EXPR
4199 && TREE_CODE (type) != TREE_CODE (otype))
4200 warning (OPT_Wbad_function_cast, "cast from function call of type %qT "
4201 "to non-matching type %qT", otype, type);
4203 if (TREE_CODE (type) == POINTER_TYPE
4204 && TREE_CODE (otype) == INTEGER_TYPE
4205 && TYPE_PRECISION (type) != TYPE_PRECISION (otype)
4206 /* Don't warn about converting any constant. */
4207 && !TREE_CONSTANT (value))
4208 warning (OPT_Wint_to_pointer_cast, "cast to pointer from integer "
4209 "of different size");
4211 if (warn_strict_aliasing <= 2)
4212 strict_aliasing_warning (otype, type, expr);
4214 /* If pedantic, warn for conversions between function and object
4215 pointer types, except for converting a null pointer constant
4216 to function pointer type. */
4218 && TREE_CODE (type) == POINTER_TYPE
4219 && TREE_CODE (otype) == POINTER_TYPE
4220 && TREE_CODE (TREE_TYPE (otype)) == FUNCTION_TYPE
4221 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
4222 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
4223 "conversion of function pointer to object pointer type");
4226 && TREE_CODE (type) == POINTER_TYPE
4227 && TREE_CODE (otype) == POINTER_TYPE
4228 && TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE
4229 && TREE_CODE (TREE_TYPE (otype)) != FUNCTION_TYPE
4230 && !null_pointer_constant_p (value))
4231 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
4232 "conversion of object pointer to function pointer type");
4235 value = convert (type, value);
4237 /* Ignore any integer overflow caused by the cast. */
4238 if (TREE_CODE (value) == INTEGER_CST && !FLOAT_TYPE_P (otype))
4240 if (CONSTANT_CLASS_P (ovalue) && TREE_OVERFLOW (ovalue))
4242 if (!TREE_OVERFLOW (value))
4244 /* Avoid clobbering a shared constant. */
4245 value = copy_node (value);
4246 TREE_OVERFLOW (value) = TREE_OVERFLOW (ovalue);
4249 else if (TREE_OVERFLOW (value))
4250 /* Reset VALUE's overflow flags, ensuring constant sharing. */
4251 value = build_int_cst_wide (TREE_TYPE (value),
4252 TREE_INT_CST_LOW (value),
4253 TREE_INT_CST_HIGH (value));
4257 /* Don't let a cast be an lvalue. */
4259 value = non_lvalue (value);
4261 /* Don't allow the results of casting to floating-point or complex
4262 types be confused with actual constants, or casts involving
4263 integer and pointer types other than direct integer-to-integer
4264 and integer-to-pointer be confused with integer constant
4265 expressions and null pointer constants. */
4266 if (TREE_CODE (value) == REAL_CST
4267 || TREE_CODE (value) == COMPLEX_CST
4268 || (TREE_CODE (value) == INTEGER_CST
4269 && !((TREE_CODE (expr) == INTEGER_CST
4270 && INTEGRAL_TYPE_P (TREE_TYPE (expr)))
4271 || TREE_CODE (expr) == REAL_CST
4272 || TREE_CODE (expr) == COMPLEX_CST)))
4273 value = build1 (NOP_EXPR, type, value);
4278 /* Interpret a cast of expression EXPR to type TYPE. */
4280 c_cast_expr (struct c_type_name *type_name, tree expr)
4283 tree type_expr = NULL_TREE;
4284 bool type_expr_const = true;
4286 int saved_wsp = warn_strict_prototypes;
4288 /* This avoids warnings about unprototyped casts on
4289 integers. E.g. "#define SIG_DFL (void(*)())0". */
4290 if (TREE_CODE (expr) == INTEGER_CST)
4291 warn_strict_prototypes = 0;
4292 type = groktypename (type_name, &type_expr, &type_expr_const);
4293 warn_strict_prototypes = saved_wsp;
4295 ret = build_c_cast (type, expr);
4298 ret = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (ret), type_expr, ret);
4299 C_MAYBE_CONST_EXPR_NON_CONST (ret) = !type_expr_const;
4304 /* Build an assignment expression of lvalue LHS from value RHS.
4305 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
4306 may differ from TREE_TYPE (LHS) for an enum bitfield.
4307 MODIFYCODE is the code for a binary operator that we use
4308 to combine the old value of LHS with RHS to get the new value.
4309 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
4310 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
4311 which may differ from TREE_TYPE (RHS) for an enum value.
4313 LOCATION is the location of the MODIFYCODE operator. */
4316 build_modify_expr (location_t location, tree lhs, tree lhs_origtype,
4317 enum tree_code modifycode, tree rhs, tree rhs_origtype)
4321 tree rhs_semantic_type = NULL_TREE;
4322 tree lhstype = TREE_TYPE (lhs);
4323 tree olhstype = lhstype;
4326 /* Types that aren't fully specified cannot be used in assignments. */
4327 lhs = require_complete_type (lhs);
4329 /* Avoid duplicate error messages from operands that had errors. */
4330 if (TREE_CODE (lhs) == ERROR_MARK || TREE_CODE (rhs) == ERROR_MARK)
4331 return error_mark_node;
4333 if (!lvalue_or_else (lhs, lv_assign))
4334 return error_mark_node;
4336 if (TREE_CODE (rhs) == EXCESS_PRECISION_EXPR)
4338 rhs_semantic_type = TREE_TYPE (rhs);
4339 rhs = TREE_OPERAND (rhs, 0);
4344 if (TREE_CODE (lhs) == C_MAYBE_CONST_EXPR)
4346 tree inner = build_modify_expr (location, C_MAYBE_CONST_EXPR_EXPR (lhs),
4347 lhs_origtype, modifycode, rhs,
4349 if (inner == error_mark_node)
4350 return error_mark_node;
4351 result = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (inner),
4352 C_MAYBE_CONST_EXPR_PRE (lhs), inner);
4353 gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (lhs));
4354 C_MAYBE_CONST_EXPR_NON_CONST (result) = 1;
4355 protected_set_expr_location (result, location);
4359 /* If a binary op has been requested, combine the old LHS value with the RHS
4360 producing the value we should actually store into the LHS. */
4362 if (modifycode != NOP_EXPR)
4364 lhs = c_fully_fold (lhs, false, NULL);
4365 lhs = stabilize_reference (lhs);
4366 newrhs = build_binary_op (location,
4367 modifycode, lhs, rhs, 1);
4369 /* The original type of the right hand side is no longer
4371 rhs_origtype = NULL_TREE;
4374 /* Give an error for storing in something that is 'const'. */
4376 if (TYPE_READONLY (lhstype)
4377 || ((TREE_CODE (lhstype) == RECORD_TYPE
4378 || TREE_CODE (lhstype) == UNION_TYPE)
4379 && C_TYPE_FIELDS_READONLY (lhstype)))
4381 readonly_error (lhs, lv_assign);
4382 return error_mark_node;
4384 else if (TREE_READONLY (lhs))
4385 readonly_warning (lhs, lv_assign);
4387 /* If storing into a structure or union member,
4388 it has probably been given type `int'.
4389 Compute the type that would go with
4390 the actual amount of storage the member occupies. */
4392 if (TREE_CODE (lhs) == COMPONENT_REF
4393 && (TREE_CODE (lhstype) == INTEGER_TYPE
4394 || TREE_CODE (lhstype) == BOOLEAN_TYPE
4395 || TREE_CODE (lhstype) == REAL_TYPE
4396 || TREE_CODE (lhstype) == ENUMERAL_TYPE))
4397 lhstype = TREE_TYPE (get_unwidened (lhs, 0));
4399 /* If storing in a field that is in actuality a short or narrower than one,
4400 we must store in the field in its actual type. */
4402 if (lhstype != TREE_TYPE (lhs))
4404 lhs = copy_node (lhs);
4405 TREE_TYPE (lhs) = lhstype;
4408 /* Issue -Wc++-compat warnings about an assignment to an enum type
4409 when LHS does not have its original type. This happens for,
4410 e.g., an enum bitfield in a struct. */
4412 && lhs_origtype != NULL_TREE
4413 && lhs_origtype != lhstype
4414 && TREE_CODE (lhs_origtype) == ENUMERAL_TYPE)
4416 tree checktype = (rhs_origtype != NULL_TREE
4419 if (checktype != error_mark_node
4420 && TYPE_MAIN_VARIANT (checktype) != TYPE_MAIN_VARIANT (lhs_origtype))
4421 warning_at (location, OPT_Wc___compat,
4422 "enum conversion in assignment is invalid in C++");
4425 /* Convert new value to destination type. Fold it first, then
4426 restore any excess precision information, for the sake of
4427 conversion warnings. */
4429 npc = null_pointer_constant_p (newrhs);
4430 newrhs = c_fully_fold (newrhs, false, NULL);
4431 if (rhs_semantic_type)
4432 newrhs = build1 (EXCESS_PRECISION_EXPR, rhs_semantic_type, newrhs);
4433 newrhs = convert_for_assignment (lhstype, newrhs, rhs_origtype, ic_assign,
4434 npc, NULL_TREE, NULL_TREE, 0);
4435 if (TREE_CODE (newrhs) == ERROR_MARK)
4436 return error_mark_node;
4438 /* Emit ObjC write barrier, if necessary. */
4439 if (c_dialect_objc () && flag_objc_gc)
4441 result = objc_generate_write_barrier (lhs, modifycode, newrhs);
4444 protected_set_expr_location (result, location);
4449 /* Scan operands. */
4451 result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
4452 TREE_SIDE_EFFECTS (result) = 1;
4453 protected_set_expr_location (result, location);
4455 /* If we got the LHS in a different type for storing in,
4456 convert the result back to the nominal type of LHS
4457 so that the value we return always has the same type
4458 as the LHS argument. */
4460 if (olhstype == TREE_TYPE (result))
4463 result = convert_for_assignment (olhstype, result, rhs_origtype, ic_assign,
4464 false, NULL_TREE, NULL_TREE, 0);
4465 protected_set_expr_location (result, location);
4469 /* Convert value RHS to type TYPE as preparation for an assignment to
4470 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
4471 original type of RHS; this differs from TREE_TYPE (RHS) for enum
4472 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
4473 constant before any folding.
4474 The real work of conversion is done by `convert'.
4475 The purpose of this function is to generate error messages
4476 for assignments that are not allowed in C.
4477 ERRTYPE says whether it is argument passing, assignment,
4478 initialization or return.
4480 FUNCTION is a tree for the function being called.
4481 PARMNUM is the number of the argument, for printing in error messages. */
4484 convert_for_assignment (tree type, tree rhs, tree origtype,
4485 enum impl_conv errtype, bool null_pointer_constant,
4486 tree fundecl, tree function, int parmnum)
4488 enum tree_code codel = TREE_CODE (type);
4489 tree orig_rhs = rhs;
4491 enum tree_code coder;
4492 tree rname = NULL_TREE;
4493 bool objc_ok = false;
4495 if (errtype == ic_argpass)
4498 /* Change pointer to function to the function itself for
4500 if (TREE_CODE (function) == ADDR_EXPR
4501 && TREE_CODE (TREE_OPERAND (function, 0)) == FUNCTION_DECL)
4502 function = TREE_OPERAND (function, 0);
4504 /* Handle an ObjC selector specially for diagnostics. */
4505 selector = objc_message_selector ();
4507 if (selector && parmnum > 2)
4514 /* This macro is used to emit diagnostics to ensure that all format
4515 strings are complete sentences, visible to gettext and checked at
4517 #define WARN_FOR_ASSIGNMENT(LOCATION, OPT, AR, AS, IN, RE) \
4522 if (pedwarn (LOCATION, OPT, AR, parmnum, rname)) \
4523 inform ((fundecl && !DECL_IS_BUILTIN (fundecl)) \
4524 ? DECL_SOURCE_LOCATION (fundecl) : LOCATION, \
4525 "expected %qT but argument is of type %qT", \
4529 pedwarn (LOCATION, OPT, AS); \
4532 pedwarn (LOCATION, OPT, IN); \
4535 pedwarn (LOCATION, OPT, RE); \
4538 gcc_unreachable (); \
4542 if (TREE_CODE (rhs) == EXCESS_PRECISION_EXPR)
4543 rhs = TREE_OPERAND (rhs, 0);
4545 rhstype = TREE_TYPE (rhs);
4546 coder = TREE_CODE (rhstype);
4548 if (coder == ERROR_MARK)
4549 return error_mark_node;
4551 if (c_dialect_objc ())
4574 objc_ok = objc_compare_types (type, rhstype, parmno, rname);
4577 if (warn_cxx_compat)
4579 tree checktype = origtype != NULL_TREE ? origtype : rhstype;
4580 if (checktype != error_mark_node
4581 && TREE_CODE (type) == ENUMERAL_TYPE
4582 && TYPE_MAIN_VARIANT (checktype) != TYPE_MAIN_VARIANT (type))
4584 /* FIXME: Until the gcc source code is converted, we only
4585 warn about assignment and parameter passing. We will add
4586 the other cases when bootstrap succeeds with them. */
4587 if (errtype == ic_argpass || errtype == ic_assign)
4589 WARN_FOR_ASSIGNMENT (input_location, OPT_Wc___compat,
4590 G_("enum conversion when passing argument "
4591 "%d of %qE is invalid in C++"),
4592 G_("enum conversion in assignment is "
4594 G_("enum conversion in initialization is "
4596 G_("enum conversion in return is "
4602 if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (rhstype))
4605 if (coder == VOID_TYPE)
4607 /* Except for passing an argument to an unprototyped function,
4608 this is a constraint violation. When passing an argument to
4609 an unprototyped function, it is compile-time undefined;
4610 making it a constraint in that case was rejected in
4612 error ("void value not ignored as it ought to be");
4613 return error_mark_node;
4615 rhs = require_complete_type (rhs);
4616 if (rhs == error_mark_node)
4617 return error_mark_node;
4618 /* A type converts to a reference to it.
4619 This code doesn't fully support references, it's just for the
4620 special case of va_start and va_copy. */
4621 if (codel == REFERENCE_TYPE
4622 && comptypes (TREE_TYPE (type), TREE_TYPE (rhs)) == 1)
4624 if (!lvalue_p (rhs))
4626 error ("cannot pass rvalue to reference parameter");
4627 return error_mark_node;
4629 if (!c_mark_addressable (rhs))
4630 return error_mark_node;
4631 rhs = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (rhs)), rhs);
4633 /* We already know that these two types are compatible, but they
4634 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4635 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4636 likely to be va_list, a typedef to __builtin_va_list, which
4637 is different enough that it will cause problems later. */
4638 if (TREE_TYPE (TREE_TYPE (rhs)) != TREE_TYPE (type))
4639 rhs = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (type)), rhs);
4641 rhs = build1 (NOP_EXPR, type, rhs);
4644 /* Some types can interconvert without explicit casts. */
4645 else if (codel == VECTOR_TYPE && coder == VECTOR_TYPE
4646 && vector_types_convertible_p (type, TREE_TYPE (rhs), true))
4647 return convert (type, rhs);
4648 /* Arithmetic types all interconvert, and enum is treated like int. */
4649 else if ((codel == INTEGER_TYPE || codel == REAL_TYPE
4650 || codel == FIXED_POINT_TYPE
4651 || codel == ENUMERAL_TYPE || codel == COMPLEX_TYPE
4652 || codel == BOOLEAN_TYPE)
4653 && (coder == INTEGER_TYPE || coder == REAL_TYPE
4654 || coder == FIXED_POINT_TYPE
4655 || coder == ENUMERAL_TYPE || coder == COMPLEX_TYPE
4656 || coder == BOOLEAN_TYPE))
4659 bool save = in_late_binary_op;
4660 if (codel == BOOLEAN_TYPE)
4661 in_late_binary_op = true;
4662 ret = convert_and_check (type, orig_rhs);
4663 if (codel == BOOLEAN_TYPE)
4664 in_late_binary_op = save;
4668 /* Aggregates in different TUs might need conversion. */
4669 if ((codel == RECORD_TYPE || codel == UNION_TYPE)
4671 && comptypes (type, rhstype))
4672 return convert_and_check (type, rhs);
4674 /* Conversion to a transparent union from its member types.
4675 This applies only to function arguments. */
4676 if (codel == UNION_TYPE && TYPE_TRANSPARENT_UNION (type)
4677 && errtype == ic_argpass)
4679 tree memb, marginal_memb = NULL_TREE;
4681 for (memb = TYPE_FIELDS (type); memb ; memb = TREE_CHAIN (memb))
4683 tree memb_type = TREE_TYPE (memb);
4685 if (comptypes (TYPE_MAIN_VARIANT (memb_type),
4686 TYPE_MAIN_VARIANT (rhstype)))
4689 if (TREE_CODE (memb_type) != POINTER_TYPE)
4692 if (coder == POINTER_TYPE)
4694 tree ttl = TREE_TYPE (memb_type);
4695 tree ttr = TREE_TYPE (rhstype);
4697 /* Any non-function converts to a [const][volatile] void *
4698 and vice versa; otherwise, targets must be the same.
4699 Meanwhile, the lhs target must have all the qualifiers of
4701 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4702 || comp_target_types (memb_type, rhstype))
4704 /* If this type won't generate any warnings, use it. */
4705 if (TYPE_QUALS (ttl) == TYPE_QUALS (ttr)
4706 || ((TREE_CODE (ttr) == FUNCTION_TYPE
4707 && TREE_CODE (ttl) == FUNCTION_TYPE)
4708 ? ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4709 == TYPE_QUALS (ttr))
4710 : ((TYPE_QUALS (ttl) | TYPE_QUALS (ttr))
4711 == TYPE_QUALS (ttl))))
4714 /* Keep looking for a better type, but remember this one. */
4716 marginal_memb = memb;
4720 /* Can convert integer zero to any pointer type. */
4721 if (null_pointer_constant)
4723 rhs = null_pointer_node;
4728 if (memb || marginal_memb)
4732 /* We have only a marginally acceptable member type;
4733 it needs a warning. */
4734 tree ttl = TREE_TYPE (TREE_TYPE (marginal_memb));
4735 tree ttr = TREE_TYPE (rhstype);
4737 /* Const and volatile mean something different for function
4738 types, so the usual warnings are not appropriate. */
4739 if (TREE_CODE (ttr) == FUNCTION_TYPE
4740 && TREE_CODE (ttl) == FUNCTION_TYPE)
4742 /* Because const and volatile on functions are
4743 restrictions that say the function will not do
4744 certain things, it is okay to use a const or volatile
4745 function where an ordinary one is wanted, but not
4747 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4748 WARN_FOR_ASSIGNMENT (input_location, 0,
4749 G_("passing argument %d of %qE "
4750 "makes qualified function "
4751 "pointer from unqualified"),
4752 G_("assignment makes qualified "
4753 "function pointer from "
4755 G_("initialization makes qualified "
4756 "function pointer from "
4758 G_("return makes qualified function "
4759 "pointer from unqualified"));
4761 else if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4762 WARN_FOR_ASSIGNMENT (input_location, 0,
4763 G_("passing argument %d of %qE discards "
4764 "qualifiers from pointer target type"),
4765 G_("assignment discards qualifiers "
4766 "from pointer target type"),
4767 G_("initialization discards qualifiers "
4768 "from pointer target type"),
4769 G_("return discards qualifiers from "
4770 "pointer target type"));
4772 memb = marginal_memb;
4775 if (!fundecl || !DECL_IN_SYSTEM_HEADER (fundecl))
4776 pedwarn (input_location, OPT_pedantic,
4777 "ISO C prohibits argument conversion to union type");
4779 rhs = fold_convert (TREE_TYPE (memb), rhs);
4780 return build_constructor_single (type, memb, rhs);
4784 /* Conversions among pointers */
4785 else if ((codel == POINTER_TYPE || codel == REFERENCE_TYPE)
4786 && (coder == codel))
4788 tree ttl = TREE_TYPE (type);
4789 tree ttr = TREE_TYPE (rhstype);
4792 bool is_opaque_pointer;
4793 int target_cmp = 0; /* Cache comp_target_types () result. */
4795 if (TREE_CODE (mvl) != ARRAY_TYPE)
4796 mvl = TYPE_MAIN_VARIANT (mvl);
4797 if (TREE_CODE (mvr) != ARRAY_TYPE)
4798 mvr = TYPE_MAIN_VARIANT (mvr);
4799 /* Opaque pointers are treated like void pointers. */
4800 is_opaque_pointer = vector_targets_convertible_p (ttl, ttr);
4802 /* C++ does not allow the implicit conversion void* -> T*. However,
4803 for the purpose of reducing the number of false positives, we
4804 tolerate the special case of
4808 where NULL is typically defined in C to be '(void *) 0'. */
4809 if (VOID_TYPE_P (ttr) && rhs != null_pointer_node && !VOID_TYPE_P (ttl))
4810 warning (OPT_Wc___compat, "request for implicit conversion from "
4811 "%qT to %qT not permitted in C++", rhstype, type);
4813 /* Check if the right-hand side has a format attribute but the
4814 left-hand side doesn't. */
4815 if (warn_missing_format_attribute
4816 && check_missing_format_attribute (type, rhstype))
4821 warning (OPT_Wmissing_format_attribute,
4822 "argument %d of %qE might be "
4823 "a candidate for a format attribute",
4827 warning (OPT_Wmissing_format_attribute,
4828 "assignment left-hand side might be "
4829 "a candidate for a format attribute");
4832 warning (OPT_Wmissing_format_attribute,
4833 "initialization left-hand side might be "
4834 "a candidate for a format attribute");
4837 warning (OPT_Wmissing_format_attribute,
4838 "return type might be "
4839 "a candidate for a format attribute");
4846 /* Any non-function converts to a [const][volatile] void *
4847 and vice versa; otherwise, targets must be the same.
4848 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4849 if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4850 || (target_cmp = comp_target_types (type, rhstype))
4851 || is_opaque_pointer
4852 || (c_common_unsigned_type (mvl)
4853 == c_common_unsigned_type (mvr)))
4856 && ((VOID_TYPE_P (ttl) && TREE_CODE (ttr) == FUNCTION_TYPE)
4859 && !null_pointer_constant
4860 && TREE_CODE (ttl) == FUNCTION_TYPE)))
4861 WARN_FOR_ASSIGNMENT (input_location, OPT_pedantic,
4862 G_("ISO C forbids passing argument %d of "
4863 "%qE between function pointer "
4865 G_("ISO C forbids assignment between "
4866 "function pointer and %<void *%>"),
4867 G_("ISO C forbids initialization between "
4868 "function pointer and %<void *%>"),
4869 G_("ISO C forbids return between function "
4870 "pointer and %<void *%>"));
4871 /* Const and volatile mean something different for function types,
4872 so the usual warnings are not appropriate. */
4873 else if (TREE_CODE (ttr) != FUNCTION_TYPE
4874 && TREE_CODE (ttl) != FUNCTION_TYPE)
4876 if (TYPE_QUALS (ttr) & ~TYPE_QUALS (ttl))
4878 /* Types differing only by the presence of the 'volatile'
4879 qualifier are acceptable if the 'volatile' has been added
4880 in by the Objective-C EH machinery. */
4881 if (!objc_type_quals_match (ttl, ttr))
4882 WARN_FOR_ASSIGNMENT (input_location, 0,
4883 G_("passing argument %d of %qE discards "
4884 "qualifiers from pointer target type"),
4885 G_("assignment discards qualifiers "
4886 "from pointer target type"),
4887 G_("initialization discards qualifiers "
4888 "from pointer target type"),
4889 G_("return discards qualifiers from "
4890 "pointer target type"));
4892 /* If this is not a case of ignoring a mismatch in signedness,
4894 else if (VOID_TYPE_P (ttl) || VOID_TYPE_P (ttr)
4897 /* If there is a mismatch, do warn. */
4898 else if (warn_pointer_sign)
4899 WARN_FOR_ASSIGNMENT (input_location, OPT_Wpointer_sign,
4900 G_("pointer targets in passing argument "
4901 "%d of %qE differ in signedness"),
4902 G_("pointer targets in assignment "
4903 "differ in signedness"),
4904 G_("pointer targets in initialization "
4905 "differ in signedness"),
4906 G_("pointer targets in return differ "
4909 else if (TREE_CODE (ttl) == FUNCTION_TYPE
4910 && TREE_CODE (ttr) == FUNCTION_TYPE)
4912 /* Because const and volatile on functions are restrictions
4913 that say the function will not do certain things,
4914 it is okay to use a const or volatile function
4915 where an ordinary one is wanted, but not vice-versa. */
4916 if (TYPE_QUALS (ttl) & ~TYPE_QUALS (ttr))
4917 WARN_FOR_ASSIGNMENT (input_location, 0,
4918 G_("passing argument %d of %qE makes "
4919 "qualified function pointer "
4920 "from unqualified"),
4921 G_("assignment makes qualified function "
4922 "pointer from unqualified"),
4923 G_("initialization makes qualified "
4924 "function pointer from unqualified"),
4925 G_("return makes qualified function "
4926 "pointer from unqualified"));
4930 /* Avoid warning about the volatile ObjC EH puts on decls. */
4932 WARN_FOR_ASSIGNMENT (input_location, 0,
4933 G_("passing argument %d of %qE from "
4934 "incompatible pointer type"),
4935 G_("assignment from incompatible pointer type"),
4936 G_("initialization from incompatible "
4938 G_("return from incompatible pointer type"));
4940 return convert (type, rhs);
4942 else if (codel == POINTER_TYPE && coder == ARRAY_TYPE)
4944 /* ??? This should not be an error when inlining calls to
4945 unprototyped functions. */
4946 error ("invalid use of non-lvalue array");
4947 return error_mark_node;
4949 else if (codel == POINTER_TYPE && coder == INTEGER_TYPE)
4951 /* An explicit constant 0 can convert to a pointer,
4952 or one that results from arithmetic, even including
4953 a cast to integer type. */
4954 if (!null_pointer_constant)
4955 WARN_FOR_ASSIGNMENT (input_location, 0,
4956 G_("passing argument %d of %qE makes "
4957 "pointer from integer without a cast"),
4958 G_("assignment makes pointer from integer "
4960 G_("initialization makes pointer from "
4961 "integer without a cast"),
4962 G_("return makes pointer from integer "
4965 return convert (type, rhs);
4967 else if (codel == INTEGER_TYPE && coder == POINTER_TYPE)
4969 WARN_FOR_ASSIGNMENT (input_location, 0,
4970 G_("passing argument %d of %qE makes integer "
4971 "from pointer without a cast"),
4972 G_("assignment makes integer from pointer "
4974 G_("initialization makes integer from pointer "
4976 G_("return makes integer from pointer "
4978 return convert (type, rhs);
4980 else if (codel == BOOLEAN_TYPE && coder == POINTER_TYPE)
4983 bool save = in_late_binary_op;
4984 in_late_binary_op = true;
4985 ret = convert (type, rhs);
4986 in_late_binary_op = save;
4993 error ("incompatible type for argument %d of %qE", parmnum, rname);
4994 inform ((fundecl && !DECL_IS_BUILTIN (fundecl))
4995 ? DECL_SOURCE_LOCATION (fundecl) : input_location,
4996 "expected %qT but argument is of type %qT", type, rhstype);
4999 error ("incompatible types when assigning to type %qT from type %qT",
5003 error ("incompatible types when initializing type %qT using type %qT",
5007 error ("incompatible types when returning type %qT but %qT was expected",
5014 return error_mark_node;
5017 /* If VALUE is a compound expr all of whose expressions are constant, then
5018 return its value. Otherwise, return error_mark_node.
5020 This is for handling COMPOUND_EXPRs as initializer elements
5021 which is allowed with a warning when -pedantic is specified. */
5024 valid_compound_expr_initializer (tree value, tree endtype)
5026 if (TREE_CODE (value) == COMPOUND_EXPR)
5028 if (valid_compound_expr_initializer (TREE_OPERAND (value, 0), endtype)
5030 return error_mark_node;
5031 return valid_compound_expr_initializer (TREE_OPERAND (value, 1),
5034 else if (!initializer_constant_valid_p (value, endtype))
5035 return error_mark_node;
5040 /* Perform appropriate conversions on the initial value of a variable,
5041 store it in the declaration DECL,
5042 and print any error messages that are appropriate.
5043 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
5044 If the init is invalid, store an ERROR_MARK. */
5047 store_init_value (tree decl, tree init, tree origtype)
5052 /* If variable's type was invalidly declared, just ignore it. */
5054 type = TREE_TYPE (decl);
5055 if (TREE_CODE (type) == ERROR_MARK)
5058 /* Digest the specified initializer into an expression. */
5061 npc = null_pointer_constant_p (init);
5062 value = digest_init (type, init, origtype, npc, true, TREE_STATIC (decl));
5064 /* Store the expression if valid; else report error. */
5066 if (!in_system_header
5067 && AGGREGATE_TYPE_P (TREE_TYPE (decl)) && !TREE_STATIC (decl))
5068 warning (OPT_Wtraditional, "traditional C rejects automatic "
5069 "aggregate initialization");
5071 DECL_INITIAL (decl) = value;
5073 /* ANSI wants warnings about out-of-range constant initializers. */
5074 STRIP_TYPE_NOPS (value);
5075 if (TREE_STATIC (decl))
5076 constant_expression_warning (value);
5078 /* Check if we need to set array size from compound literal size. */
5079 if (TREE_CODE (type) == ARRAY_TYPE
5080 && TYPE_DOMAIN (type) == 0
5081 && value != error_mark_node)
5083 tree inside_init = init;
5085 STRIP_TYPE_NOPS (inside_init);
5086 inside_init = fold (inside_init);
5088 if (TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
5090 tree cldecl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
5092 if (TYPE_DOMAIN (TREE_TYPE (cldecl)))
5094 /* For int foo[] = (int [3]){1}; we need to set array size
5095 now since later on array initializer will be just the
5096 brace enclosed list of the compound literal. */
5097 type = build_distinct_type_copy (TYPE_MAIN_VARIANT (type));
5098 TREE_TYPE (decl) = type;
5099 TYPE_DOMAIN (type) = TYPE_DOMAIN (TREE_TYPE (cldecl));
5101 layout_decl (cldecl, 0);
5107 /* Methods for storing and printing names for error messages. */
5109 /* Implement a spelling stack that allows components of a name to be pushed
5110 and popped. Each element on the stack is this structure. */
5117 unsigned HOST_WIDE_INT i;
5122 #define SPELLING_STRING 1
5123 #define SPELLING_MEMBER 2
5124 #define SPELLING_BOUNDS 3
5126 static struct spelling *spelling; /* Next stack element (unused). */
5127 static struct spelling *spelling_base; /* Spelling stack base. */
5128 static int spelling_size; /* Size of the spelling stack. */
5130 /* Macros to save and restore the spelling stack around push_... functions.
5131 Alternative to SAVE_SPELLING_STACK. */
5133 #define SPELLING_DEPTH() (spelling - spelling_base)
5134 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
5136 /* Push an element on the spelling stack with type KIND and assign VALUE
5139 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
5141 int depth = SPELLING_DEPTH (); \
5143 if (depth >= spelling_size) \
5145 spelling_size += 10; \
5146 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
5148 RESTORE_SPELLING_DEPTH (depth); \
5151 spelling->kind = (KIND); \
5152 spelling->MEMBER = (VALUE); \
5156 /* Push STRING on the stack. Printed literally. */
5159 push_string (const char *string)
5161 PUSH_SPELLING (SPELLING_STRING, string, u.s);
5164 /* Push a member name on the stack. Printed as '.' STRING. */
5167 push_member_name (tree decl)
5169 const char *const string
5170 = DECL_NAME (decl) ? IDENTIFIER_POINTER (DECL_NAME (decl)) : "<anonymous>";
5171 PUSH_SPELLING (SPELLING_MEMBER, string, u.s);
5174 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
5177 push_array_bounds (unsigned HOST_WIDE_INT bounds)
5179 PUSH_SPELLING (SPELLING_BOUNDS, bounds, u.i);
5182 /* Compute the maximum size in bytes of the printed spelling. */
5185 spelling_length (void)
5190 for (p = spelling_base; p < spelling; p++)
5192 if (p->kind == SPELLING_BOUNDS)
5195 size += strlen (p->u.s) + 1;
5201 /* Print the spelling to BUFFER and return it. */
5204 print_spelling (char *buffer)
5209 for (p = spelling_base; p < spelling; p++)
5210 if (p->kind == SPELLING_BOUNDS)
5212 sprintf (d, "[" HOST_WIDE_INT_PRINT_UNSIGNED "]", p->u.i);
5218 if (p->kind == SPELLING_MEMBER)
5220 for (s = p->u.s; (*d = *s++); d++)
5227 /* Issue an error message for a bad initializer component.
5228 MSGID identifies the message.
5229 The component name is taken from the spelling stack. */
5232 error_init (const char *msgid)
5236 error ("%s", _(msgid));
5237 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
5239 error ("(near initialization for %qs)", ofwhat);
5242 /* Issue a pedantic warning for a bad initializer component. OPT is
5243 the option OPT_* (from options.h) controlling this warning or 0 if
5244 it is unconditionally given. MSGID identifies the message. The
5245 component name is taken from the spelling stack. */
5248 pedwarn_init (location_t location, int opt, const char *msgid)
5252 pedwarn (location, opt, "%s", _(msgid));
5253 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
5255 pedwarn (location, opt, "(near initialization for %qs)", ofwhat);
5258 /* Issue a warning for a bad initializer component.
5260 OPT is the OPT_W* value corresponding to the warning option that
5261 controls this warning. MSGID identifies the message. The
5262 component name is taken from the spelling stack. */
5265 warning_init (int opt, const char *msgid)
5269 warning (opt, "%s", _(msgid));
5270 ofwhat = print_spelling ((char *) alloca (spelling_length () + 1));
5272 warning (opt, "(near initialization for %qs)", ofwhat);
5275 /* If TYPE is an array type and EXPR is a parenthesized string
5276 constant, warn if pedantic that EXPR is being used to initialize an
5277 object of type TYPE. */
5280 maybe_warn_string_init (tree type, struct c_expr expr)
5283 && TREE_CODE (type) == ARRAY_TYPE
5284 && TREE_CODE (expr.value) == STRING_CST
5285 && expr.original_code != STRING_CST)
5286 pedwarn_init (input_location, OPT_pedantic,
5287 "array initialized from parenthesized string constant");
5290 /* Digest the parser output INIT as an initializer for type TYPE.
5291 Return a C expression of type TYPE to represent the initial value.
5293 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
5295 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
5297 If INIT is a string constant, STRICT_STRING is true if it is
5298 unparenthesized or we should not warn here for it being parenthesized.
5299 For other types of INIT, STRICT_STRING is not used.
5301 REQUIRE_CONSTANT requests an error if non-constant initializers or
5302 elements are seen. */
5305 digest_init (tree type, tree init, tree origtype, bool null_pointer_constant,
5306 bool strict_string, int require_constant)
5308 enum tree_code code = TREE_CODE (type);
5309 tree inside_init = init;
5310 tree semantic_type = NULL_TREE;
5311 bool maybe_const = true;
5313 if (type == error_mark_node
5315 || init == error_mark_node
5316 || TREE_TYPE (init) == error_mark_node)
5317 return error_mark_node;
5319 STRIP_TYPE_NOPS (inside_init);
5321 if (TREE_CODE (inside_init) == EXCESS_PRECISION_EXPR)
5323 semantic_type = TREE_TYPE (inside_init);
5324 inside_init = TREE_OPERAND (inside_init, 0);
5326 inside_init = c_fully_fold (inside_init, require_constant, &maybe_const);
5327 inside_init = decl_constant_value_for_optimization (inside_init);
5329 /* Initialization of an array of chars from a string constant
5330 optionally enclosed in braces. */
5332 if (code == ARRAY_TYPE && inside_init
5333 && TREE_CODE (inside_init) == STRING_CST)
5335 tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type));
5336 /* Note that an array could be both an array of character type
5337 and an array of wchar_t if wchar_t is signed char or unsigned
5339 bool char_array = (typ1 == char_type_node
5340 || typ1 == signed_char_type_node
5341 || typ1 == unsigned_char_type_node);
5342 bool wchar_array = !!comptypes (typ1, wchar_type_node);
5343 bool char16_array = !!comptypes (typ1, char16_type_node);
5344 bool char32_array = !!comptypes (typ1, char32_type_node);
5346 if (char_array || wchar_array || char16_array || char32_array)
5349 tree typ2 = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init)));
5350 expr.value = inside_init;
5351 expr.original_code = (strict_string ? STRING_CST : ERROR_MARK);
5352 expr.original_type = NULL;
5353 maybe_warn_string_init (type, expr);
5355 if (TYPE_DOMAIN (type) && !TYPE_MAX_VALUE (TYPE_DOMAIN (type)))
5356 pedwarn_init (input_location, OPT_pedantic,
5357 "initialization of a flexible array member");
5359 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
5360 TYPE_MAIN_VARIANT (type)))
5365 if (typ2 != char_type_node)
5367 error_init ("char-array initialized from wide string");
5368 return error_mark_node;
5373 if (typ2 == char_type_node)
5375 error_init ("wide character array initialized from non-wide "
5377 return error_mark_node;
5379 else if (!comptypes(typ1, typ2))
5381 error_init ("wide character array initialized from "
5382 "incompatible wide string");
5383 return error_mark_node;
5387 TREE_TYPE (inside_init) = type;
5388 if (TYPE_DOMAIN (type) != 0
5389 && TYPE_SIZE (type) != 0
5390 && TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST
5391 /* Subtract the size of a single (possibly wide) character
5392 because it's ok to ignore the terminating null char
5393 that is counted in the length of the constant. */
5394 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type),
5395 TREE_STRING_LENGTH (inside_init)
5396 - (TYPE_PRECISION (typ1)
5398 pedwarn_init (input_location, 0,
5399 "initializer-string for array of chars is too long");
5403 else if (INTEGRAL_TYPE_P (typ1))
5405 error_init ("array of inappropriate type initialized "
5406 "from string constant");
5407 return error_mark_node;
5411 /* Build a VECTOR_CST from a *constant* vector constructor. If the
5412 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
5413 below and handle as a constructor. */
5414 if (code == VECTOR_TYPE
5415 && TREE_CODE (TREE_TYPE (inside_init)) == VECTOR_TYPE
5416 && vector_types_convertible_p (TREE_TYPE (inside_init), type, true)
5417 && TREE_CONSTANT (inside_init))
5419 if (TREE_CODE (inside_init) == VECTOR_CST
5420 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
5421 TYPE_MAIN_VARIANT (type)))
5424 if (TREE_CODE (inside_init) == CONSTRUCTOR)
5426 unsigned HOST_WIDE_INT ix;
5428 bool constant_p = true;
5430 /* Iterate through elements and check if all constructor
5431 elements are *_CSTs. */
5432 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init), ix, value)
5433 if (!CONSTANT_CLASS_P (value))
5440 return build_vector_from_ctor (type,
5441 CONSTRUCTOR_ELTS (inside_init));
5445 if (warn_sequence_point)
5446 verify_sequence_points (inside_init);
5448 /* Any type can be initialized
5449 from an expression of the same type, optionally with braces. */
5451 if (inside_init && TREE_TYPE (inside_init) != 0
5452 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init)),
5453 TYPE_MAIN_VARIANT (type))
5454 || (code == ARRAY_TYPE
5455 && comptypes (TREE_TYPE (inside_init), type))
5456 || (code == VECTOR_TYPE
5457 && comptypes (TREE_TYPE (inside_init), type))
5458 || (code == POINTER_TYPE
5459 && TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE
5460 && comptypes (TREE_TYPE (TREE_TYPE (inside_init)),
5461 TREE_TYPE (type)))))
5463 if (code == POINTER_TYPE)
5465 if (TREE_CODE (TREE_TYPE (inside_init)) == ARRAY_TYPE)
5467 if (TREE_CODE (inside_init) == STRING_CST
5468 || TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
5469 inside_init = array_to_pointer_conversion (inside_init);
5472 error_init ("invalid use of non-lvalue array");
5473 return error_mark_node;
5478 if (code == VECTOR_TYPE)
5479 /* Although the types are compatible, we may require a
5481 inside_init = convert (type, inside_init);
5483 if (require_constant
5484 && (code == VECTOR_TYPE || !flag_isoc99)
5485 && TREE_CODE (inside_init) == COMPOUND_LITERAL_EXPR)
5487 /* As an extension, allow initializing objects with static storage
5488 duration with compound literals (which are then treated just as
5489 the brace enclosed list they contain). Also allow this for
5490 vectors, as we can only assign them with compound literals. */
5491 tree decl = COMPOUND_LITERAL_EXPR_DECL (inside_init);
5492 inside_init = DECL_INITIAL (decl);
5495 if (code == ARRAY_TYPE && TREE_CODE (inside_init) != STRING_CST
5496 && TREE_CODE (inside_init) != CONSTRUCTOR)
5498 error_init ("array initialized from non-constant array expression");
5499 return error_mark_node;
5502 /* Compound expressions can only occur here if -pedantic or
5503 -pedantic-errors is specified. In the later case, we always want
5504 an error. In the former case, we simply want a warning. */
5505 if (require_constant && pedantic
5506 && TREE_CODE (inside_init) == COMPOUND_EXPR)
5509 = valid_compound_expr_initializer (inside_init,
5510 TREE_TYPE (inside_init));
5511 if (inside_init == error_mark_node)
5512 error_init ("initializer element is not constant");
5514 pedwarn_init (input_location, OPT_pedantic,
5515 "initializer element is not constant");
5516 if (flag_pedantic_errors)
5517 inside_init = error_mark_node;
5519 else if (require_constant
5520 && !initializer_constant_valid_p (inside_init,
5521 TREE_TYPE (inside_init)))
5523 error_init ("initializer element is not constant");
5524 inside_init = error_mark_node;
5526 else if (require_constant && !maybe_const)
5527 pedwarn_init (input_location, 0,
5528 "initializer element is not a constant expression");
5530 /* Added to enable additional -Wmissing-format-attribute warnings. */
5531 if (TREE_CODE (TREE_TYPE (inside_init)) == POINTER_TYPE)
5532 inside_init = convert_for_assignment (type, inside_init, origtype,
5533 ic_init, null_pointer_constant,
5534 NULL_TREE, NULL_TREE, 0);
5538 /* Handle scalar types, including conversions. */
5540 if (code == INTEGER_TYPE || code == REAL_TYPE || code == FIXED_POINT_TYPE
5541 || code == POINTER_TYPE || code == ENUMERAL_TYPE || code == BOOLEAN_TYPE
5542 || code == COMPLEX_TYPE || code == VECTOR_TYPE)
5544 if (TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE
5545 && (TREE_CODE (init) == STRING_CST
5546 || TREE_CODE (init) == COMPOUND_LITERAL_EXPR))
5547 inside_init = init = array_to_pointer_conversion (init);
5549 inside_init = build1 (EXCESS_PRECISION_EXPR, semantic_type,
5552 = convert_for_assignment (type, inside_init, origtype, ic_init,
5553 null_pointer_constant,
5554 NULL_TREE, NULL_TREE, 0);
5556 /* Check to see if we have already given an error message. */
5557 if (inside_init == error_mark_node)
5559 else if (require_constant && !TREE_CONSTANT (inside_init))
5561 error_init ("initializer element is not constant");
5562 inside_init = error_mark_node;
5564 else if (require_constant
5565 && !initializer_constant_valid_p (inside_init,
5566 TREE_TYPE (inside_init)))
5568 error_init ("initializer element is not computable at load time");
5569 inside_init = error_mark_node;
5571 else if (require_constant && !maybe_const)
5572 pedwarn_init (input_location, 0,
5573 "initializer element is not a constant expression");
5578 /* Come here only for records and arrays. */
5580 if (COMPLETE_TYPE_P (type) && TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
5582 error_init ("variable-sized object may not be initialized");
5583 return error_mark_node;
5586 error_init ("invalid initializer");
5587 return error_mark_node;
5590 /* Handle initializers that use braces. */
5592 /* Type of object we are accumulating a constructor for.
5593 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
5594 static tree constructor_type;
5596 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
5598 static tree constructor_fields;
5600 /* For an ARRAY_TYPE, this is the specified index
5601 at which to store the next element we get. */
5602 static tree constructor_index;
5604 /* For an ARRAY_TYPE, this is the maximum index. */
5605 static tree constructor_max_index;
5607 /* For a RECORD_TYPE, this is the first field not yet written out. */
5608 static tree constructor_unfilled_fields;
5610 /* For an ARRAY_TYPE, this is the index of the first element
5611 not yet written out. */
5612 static tree constructor_unfilled_index;
5614 /* In a RECORD_TYPE, the byte index of the next consecutive field.
5615 This is so we can generate gaps between fields, when appropriate. */
5616 static tree constructor_bit_index;
5618 /* If we are saving up the elements rather than allocating them,
5619 this is the list of elements so far (in reverse order,
5620 most recent first). */
5621 static VEC(constructor_elt,gc) *constructor_elements;
5623 /* 1 if constructor should be incrementally stored into a constructor chain,
5624 0 if all the elements should be kept in AVL tree. */
5625 static int constructor_incremental;
5627 /* 1 if so far this constructor's elements are all compile-time constants. */
5628 static int constructor_constant;
5630 /* 1 if so far this constructor's elements are all valid address constants. */
5631 static int constructor_simple;
5633 /* 1 if this constructor has an element that cannot be part of a
5634 constant expression. */
5635 static int constructor_nonconst;
5637 /* 1 if this constructor is erroneous so far. */
5638 static int constructor_erroneous;
5640 /* Structure for managing pending initializer elements, organized as an
5645 struct init_node *left, *right;
5646 struct init_node *parent;
5653 /* Tree of pending elements at this constructor level.
5654 These are elements encountered out of order
5655 which belong at places we haven't reached yet in actually
5657 Will never hold tree nodes across GC runs. */
5658 static struct init_node *constructor_pending_elts;
5660 /* The SPELLING_DEPTH of this constructor. */
5661 static int constructor_depth;
5663 /* DECL node for which an initializer is being read.
5664 0 means we are reading a constructor expression
5665 such as (struct foo) {...}. */
5666 static tree constructor_decl;
5668 /* Nonzero if this is an initializer for a top-level decl. */
5669 static int constructor_top_level;
5671 /* Nonzero if there were any member designators in this initializer. */
5672 static int constructor_designated;
5674 /* Nesting depth of designator list. */
5675 static int designator_depth;
5677 /* Nonzero if there were diagnosed errors in this designator list. */
5678 static int designator_erroneous;
5681 /* This stack has a level for each implicit or explicit level of
5682 structuring in the initializer, including the outermost one. It
5683 saves the values of most of the variables above. */
5685 struct constructor_range_stack;
5687 struct constructor_stack
5689 struct constructor_stack *next;
5694 tree unfilled_index;
5695 tree unfilled_fields;
5697 VEC(constructor_elt,gc) *elements;
5698 struct init_node *pending_elts;
5701 /* If value nonzero, this value should replace the entire
5702 constructor at this level. */
5703 struct c_expr replacement_value;
5704 struct constructor_range_stack *range_stack;
5715 static struct constructor_stack *constructor_stack;
5717 /* This stack represents designators from some range designator up to
5718 the last designator in the list. */
5720 struct constructor_range_stack
5722 struct constructor_range_stack *next, *prev;
5723 struct constructor_stack *stack;
5730 static struct constructor_range_stack *constructor_range_stack;
5732 /* This stack records separate initializers that are nested.
5733 Nested initializers can't happen in ANSI C, but GNU C allows them
5734 in cases like { ... (struct foo) { ... } ... }. */
5736 struct initializer_stack
5738 struct initializer_stack *next;
5740 struct constructor_stack *constructor_stack;
5741 struct constructor_range_stack *constructor_range_stack;
5742 VEC(constructor_elt,gc) *elements;
5743 struct spelling *spelling;
5744 struct spelling *spelling_base;
5747 char require_constant_value;
5748 char require_constant_elements;
5751 static struct initializer_stack *initializer_stack;
5753 /* Prepare to parse and output the initializer for variable DECL. */
5756 start_init (tree decl, tree asmspec_tree ATTRIBUTE_UNUSED, int top_level)
5759 struct initializer_stack *p = XNEW (struct initializer_stack);
5761 p->decl = constructor_decl;
5762 p->require_constant_value = require_constant_value;
5763 p->require_constant_elements = require_constant_elements;
5764 p->constructor_stack = constructor_stack;
5765 p->constructor_range_stack = constructor_range_stack;
5766 p->elements = constructor_elements;
5767 p->spelling = spelling;
5768 p->spelling_base = spelling_base;
5769 p->spelling_size = spelling_size;
5770 p->top_level = constructor_top_level;
5771 p->next = initializer_stack;
5772 initializer_stack = p;
5774 constructor_decl = decl;
5775 constructor_designated = 0;
5776 constructor_top_level = top_level;
5778 if (decl != 0 && decl != error_mark_node)
5780 require_constant_value = TREE_STATIC (decl);
5781 require_constant_elements
5782 = ((TREE_STATIC (decl) || (pedantic && !flag_isoc99))
5783 /* For a scalar, you can always use any value to initialize,
5784 even within braces. */
5785 && (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE
5786 || TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5787 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE
5788 || TREE_CODE (TREE_TYPE (decl)) == QUAL_UNION_TYPE));
5789 locus = IDENTIFIER_POINTER (DECL_NAME (decl));
5793 require_constant_value = 0;
5794 require_constant_elements = 0;
5795 locus = "(anonymous)";
5798 constructor_stack = 0;
5799 constructor_range_stack = 0;
5801 missing_braces_mentioned = 0;
5805 RESTORE_SPELLING_DEPTH (0);
5808 push_string (locus);
5814 struct initializer_stack *p = initializer_stack;
5816 /* Free the whole constructor stack of this initializer. */
5817 while (constructor_stack)
5819 struct constructor_stack *q = constructor_stack;
5820 constructor_stack = q->next;
5824 gcc_assert (!constructor_range_stack);
5826 /* Pop back to the data of the outer initializer (if any). */
5827 free (spelling_base);
5829 constructor_decl = p->decl;
5830 require_constant_value = p->require_constant_value;
5831 require_constant_elements = p->require_constant_elements;
5832 constructor_stack = p->constructor_stack;
5833 constructor_range_stack = p->constructor_range_stack;
5834 constructor_elements = p->elements;
5835 spelling = p->spelling;
5836 spelling_base = p->spelling_base;
5837 spelling_size = p->spelling_size;
5838 constructor_top_level = p->top_level;
5839 initializer_stack = p->next;
5843 /* Call here when we see the initializer is surrounded by braces.
5844 This is instead of a call to push_init_level;
5845 it is matched by a call to pop_init_level.
5847 TYPE is the type to initialize, for a constructor expression.
5848 For an initializer for a decl, TYPE is zero. */
5851 really_start_incremental_init (tree type)
5853 struct constructor_stack *p = XNEW (struct constructor_stack);
5856 type = TREE_TYPE (constructor_decl);
5858 if (TREE_CODE (type) == VECTOR_TYPE
5859 && TYPE_VECTOR_OPAQUE (type))
5860 error ("opaque vector types cannot be initialized");
5862 p->type = constructor_type;
5863 p->fields = constructor_fields;
5864 p->index = constructor_index;
5865 p->max_index = constructor_max_index;
5866 p->unfilled_index = constructor_unfilled_index;
5867 p->unfilled_fields = constructor_unfilled_fields;
5868 p->bit_index = constructor_bit_index;
5869 p->elements = constructor_elements;
5870 p->constant = constructor_constant;
5871 p->simple = constructor_simple;
5872 p->nonconst = constructor_nonconst;
5873 p->erroneous = constructor_erroneous;
5874 p->pending_elts = constructor_pending_elts;
5875 p->depth = constructor_depth;
5876 p->replacement_value.value = 0;
5877 p->replacement_value.original_code = ERROR_MARK;
5878 p->replacement_value.original_type = NULL;
5882 p->incremental = constructor_incremental;
5883 p->designated = constructor_designated;
5885 constructor_stack = p;
5887 constructor_constant = 1;
5888 constructor_simple = 1;
5889 constructor_nonconst = 0;
5890 constructor_depth = SPELLING_DEPTH ();
5891 constructor_elements = 0;
5892 constructor_pending_elts = 0;
5893 constructor_type = type;
5894 constructor_incremental = 1;
5895 constructor_designated = 0;
5896 designator_depth = 0;
5897 designator_erroneous = 0;
5899 if (TREE_CODE (constructor_type) == RECORD_TYPE
5900 || TREE_CODE (constructor_type) == UNION_TYPE)
5902 constructor_fields = TYPE_FIELDS (constructor_type);
5903 /* Skip any nameless bit fields at the beginning. */
5904 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
5905 && DECL_NAME (constructor_fields) == 0)
5906 constructor_fields = TREE_CHAIN (constructor_fields);
5908 constructor_unfilled_fields = constructor_fields;
5909 constructor_bit_index = bitsize_zero_node;
5911 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
5913 if (TYPE_DOMAIN (constructor_type))
5915 constructor_max_index
5916 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
5918 /* Detect non-empty initializations of zero-length arrays. */
5919 if (constructor_max_index == NULL_TREE
5920 && TYPE_SIZE (constructor_type))
5921 constructor_max_index = build_int_cst (NULL_TREE, -1);
5923 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5924 to initialize VLAs will cause a proper error; avoid tree
5925 checking errors as well by setting a safe value. */
5926 if (constructor_max_index
5927 && TREE_CODE (constructor_max_index) != INTEGER_CST)
5928 constructor_max_index = build_int_cst (NULL_TREE, -1);
5931 = convert (bitsizetype,
5932 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
5936 constructor_index = bitsize_zero_node;
5937 constructor_max_index = NULL_TREE;
5940 constructor_unfilled_index = constructor_index;
5942 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
5944 /* Vectors are like simple fixed-size arrays. */
5945 constructor_max_index =
5946 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
5947 constructor_index = bitsize_zero_node;
5948 constructor_unfilled_index = constructor_index;
5952 /* Handle the case of int x = {5}; */
5953 constructor_fields = constructor_type;
5954 constructor_unfilled_fields = constructor_type;
5958 /* Push down into a subobject, for initialization.
5959 If this is for an explicit set of braces, IMPLICIT is 0.
5960 If it is because the next element belongs at a lower level,
5961 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5964 push_init_level (int implicit)
5966 struct constructor_stack *p;
5967 tree value = NULL_TREE;
5969 /* If we've exhausted any levels that didn't have braces,
5970 pop them now. If implicit == 1, this will have been done in
5971 process_init_element; do not repeat it here because in the case
5972 of excess initializers for an empty aggregate this leads to an
5973 infinite cycle of popping a level and immediately recreating
5977 while (constructor_stack->implicit)
5979 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5980 || TREE_CODE (constructor_type) == UNION_TYPE)
5981 && constructor_fields == 0)
5982 process_init_element (pop_init_level (1), true);
5983 else if (TREE_CODE (constructor_type) == ARRAY_TYPE
5984 && constructor_max_index
5985 && tree_int_cst_lt (constructor_max_index,
5987 process_init_element (pop_init_level (1), true);
5993 /* Unless this is an explicit brace, we need to preserve previous
5997 if ((TREE_CODE (constructor_type) == RECORD_TYPE
5998 || TREE_CODE (constructor_type) == UNION_TYPE)
5999 && constructor_fields)
6000 value = find_init_member (constructor_fields);
6001 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6002 value = find_init_member (constructor_index);
6005 p = XNEW (struct constructor_stack);
6006 p->type = constructor_type;
6007 p->fields = constructor_fields;
6008 p->index = constructor_index;
6009 p->max_index = constructor_max_index;
6010 p->unfilled_index = constructor_unfilled_index;
6011 p->unfilled_fields = constructor_unfilled_fields;
6012 p->bit_index = constructor_bit_index;
6013 p->elements = constructor_elements;
6014 p->constant = constructor_constant;
6015 p->simple = constructor_simple;
6016 p->nonconst = constructor_nonconst;
6017 p->erroneous = constructor_erroneous;
6018 p->pending_elts = constructor_pending_elts;
6019 p->depth = constructor_depth;
6020 p->replacement_value.value = 0;
6021 p->replacement_value.original_code = ERROR_MARK;
6022 p->replacement_value.original_type = NULL;
6023 p->implicit = implicit;
6025 p->incremental = constructor_incremental;
6026 p->designated = constructor_designated;
6027 p->next = constructor_stack;
6029 constructor_stack = p;
6031 constructor_constant = 1;
6032 constructor_simple = 1;
6033 constructor_nonconst = 0;
6034 constructor_depth = SPELLING_DEPTH ();
6035 constructor_elements = 0;
6036 constructor_incremental = 1;
6037 constructor_designated = 0;
6038 constructor_pending_elts = 0;
6041 p->range_stack = constructor_range_stack;
6042 constructor_range_stack = 0;
6043 designator_depth = 0;
6044 designator_erroneous = 0;
6047 /* Don't die if an entire brace-pair level is superfluous
6048 in the containing level. */
6049 if (constructor_type == 0)
6051 else if (TREE_CODE (constructor_type) == RECORD_TYPE
6052 || TREE_CODE (constructor_type) == UNION_TYPE)
6054 /* Don't die if there are extra init elts at the end. */
6055 if (constructor_fields == 0)
6056 constructor_type = 0;
6059 constructor_type = TREE_TYPE (constructor_fields);
6060 push_member_name (constructor_fields);
6061 constructor_depth++;
6064 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6066 constructor_type = TREE_TYPE (constructor_type);
6067 push_array_bounds (tree_low_cst (constructor_index, 1));
6068 constructor_depth++;
6071 if (constructor_type == 0)
6073 error_init ("extra brace group at end of initializer");
6074 constructor_fields = 0;
6075 constructor_unfilled_fields = 0;
6079 if (value && TREE_CODE (value) == CONSTRUCTOR)
6081 constructor_constant = TREE_CONSTANT (value);
6082 constructor_simple = TREE_STATIC (value);
6083 constructor_nonconst = CONSTRUCTOR_NON_CONST (value);
6084 constructor_elements = CONSTRUCTOR_ELTS (value);
6085 if (!VEC_empty (constructor_elt, constructor_elements)
6086 && (TREE_CODE (constructor_type) == RECORD_TYPE
6087 || TREE_CODE (constructor_type) == ARRAY_TYPE))
6088 set_nonincremental_init ();
6091 if (implicit == 1 && warn_missing_braces && !missing_braces_mentioned)
6093 missing_braces_mentioned = 1;
6094 warning_init (OPT_Wmissing_braces, "missing braces around initializer");
6097 if (TREE_CODE (constructor_type) == RECORD_TYPE
6098 || TREE_CODE (constructor_type) == UNION_TYPE)
6100 constructor_fields = TYPE_FIELDS (constructor_type);
6101 /* Skip any nameless bit fields at the beginning. */
6102 while (constructor_fields != 0 && DECL_C_BIT_FIELD (constructor_fields)
6103 && DECL_NAME (constructor_fields) == 0)
6104 constructor_fields = TREE_CHAIN (constructor_fields);
6106 constructor_unfilled_fields = constructor_fields;
6107 constructor_bit_index = bitsize_zero_node;
6109 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
6111 /* Vectors are like simple fixed-size arrays. */
6112 constructor_max_index =
6113 build_int_cst (NULL_TREE, TYPE_VECTOR_SUBPARTS (constructor_type) - 1);
6114 constructor_index = convert (bitsizetype, integer_zero_node);
6115 constructor_unfilled_index = constructor_index;
6117 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6119 if (TYPE_DOMAIN (constructor_type))
6121 constructor_max_index
6122 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type));
6124 /* Detect non-empty initializations of zero-length arrays. */
6125 if (constructor_max_index == NULL_TREE
6126 && TYPE_SIZE (constructor_type))
6127 constructor_max_index = build_int_cst (NULL_TREE, -1);
6129 /* constructor_max_index needs to be an INTEGER_CST. Attempts
6130 to initialize VLAs will cause a proper error; avoid tree
6131 checking errors as well by setting a safe value. */
6132 if (constructor_max_index
6133 && TREE_CODE (constructor_max_index) != INTEGER_CST)
6134 constructor_max_index = build_int_cst (NULL_TREE, -1);
6137 = convert (bitsizetype,
6138 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6141 constructor_index = bitsize_zero_node;
6143 constructor_unfilled_index = constructor_index;
6144 if (value && TREE_CODE (value) == STRING_CST)
6146 /* We need to split the char/wchar array into individual
6147 characters, so that we don't have to special case it
6149 set_nonincremental_init_from_string (value);
6154 if (constructor_type != error_mark_node)
6155 warning_init (0, "braces around scalar initializer");
6156 constructor_fields = constructor_type;
6157 constructor_unfilled_fields = constructor_type;
6161 /* At the end of an implicit or explicit brace level,
6162 finish up that level of constructor. If a single expression
6163 with redundant braces initialized that level, return the
6164 c_expr structure for that expression. Otherwise, the original_code
6165 element is set to ERROR_MARK.
6166 If we were outputting the elements as they are read, return 0 as the value
6167 from inner levels (process_init_element ignores that),
6168 but return error_mark_node as the value from the outermost level
6169 (that's what we want to put in DECL_INITIAL).
6170 Otherwise, return a CONSTRUCTOR expression as the value. */
6173 pop_init_level (int implicit)
6175 struct constructor_stack *p;
6178 ret.original_code = ERROR_MARK;
6179 ret.original_type = NULL;
6183 /* When we come to an explicit close brace,
6184 pop any inner levels that didn't have explicit braces. */
6185 while (constructor_stack->implicit)
6186 process_init_element (pop_init_level (1), true);
6188 gcc_assert (!constructor_range_stack);
6191 /* Now output all pending elements. */
6192 constructor_incremental = 1;
6193 output_pending_init_elements (1);
6195 p = constructor_stack;
6197 /* Error for initializing a flexible array member, or a zero-length
6198 array member in an inappropriate context. */
6199 if (constructor_type && constructor_fields
6200 && TREE_CODE (constructor_type) == ARRAY_TYPE
6201 && TYPE_DOMAIN (constructor_type)
6202 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type)))
6204 /* Silently discard empty initializations. The parser will
6205 already have pedwarned for empty brackets. */
6206 if (integer_zerop (constructor_unfilled_index))
6207 constructor_type = NULL_TREE;
6210 gcc_assert (!TYPE_SIZE (constructor_type));
6212 if (constructor_depth > 2)
6213 error_init ("initialization of flexible array member in a nested context");
6215 pedwarn_init (input_location, OPT_pedantic,
6216 "initialization of a flexible array member");
6218 /* We have already issued an error message for the existence
6219 of a flexible array member not at the end of the structure.
6220 Discard the initializer so that we do not die later. */
6221 if (TREE_CHAIN (constructor_fields) != NULL_TREE)
6222 constructor_type = NULL_TREE;
6226 /* Warn when some struct elements are implicitly initialized to zero. */
6227 if (warn_missing_field_initializers
6229 && TREE_CODE (constructor_type) == RECORD_TYPE
6230 && constructor_unfilled_fields)
6232 /* Do not warn for flexible array members or zero-length arrays. */
6233 while (constructor_unfilled_fields
6234 && (!DECL_SIZE (constructor_unfilled_fields)
6235 || integer_zerop (DECL_SIZE (constructor_unfilled_fields))))
6236 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6238 /* Do not warn if this level of the initializer uses member
6239 designators; it is likely to be deliberate. */
6240 if (constructor_unfilled_fields && !constructor_designated)
6242 push_member_name (constructor_unfilled_fields);
6243 warning_init (OPT_Wmissing_field_initializers,
6244 "missing initializer");
6245 RESTORE_SPELLING_DEPTH (constructor_depth);
6249 /* Pad out the end of the structure. */
6250 if (p->replacement_value.value)
6251 /* If this closes a superfluous brace pair,
6252 just pass out the element between them. */
6253 ret = p->replacement_value;
6254 else if (constructor_type == 0)
6256 else if (TREE_CODE (constructor_type) != RECORD_TYPE
6257 && TREE_CODE (constructor_type) != UNION_TYPE
6258 && TREE_CODE (constructor_type) != ARRAY_TYPE
6259 && TREE_CODE (constructor_type) != VECTOR_TYPE)
6261 /* A nonincremental scalar initializer--just return
6262 the element, after verifying there is just one. */
6263 if (VEC_empty (constructor_elt,constructor_elements))
6265 if (!constructor_erroneous)
6266 error_init ("empty scalar initializer");
6267 ret.value = error_mark_node;
6269 else if (VEC_length (constructor_elt,constructor_elements) != 1)
6271 error_init ("extra elements in scalar initializer");
6272 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
6275 ret.value = VEC_index (constructor_elt,constructor_elements,0)->value;
6279 if (constructor_erroneous)
6280 ret.value = error_mark_node;
6283 ret.value = build_constructor (constructor_type,
6284 constructor_elements);
6285 if (constructor_constant)
6286 TREE_CONSTANT (ret.value) = 1;
6287 if (constructor_constant && constructor_simple)
6288 TREE_STATIC (ret.value) = 1;
6289 if (constructor_nonconst)
6290 CONSTRUCTOR_NON_CONST (ret.value) = 1;
6294 if (ret.value && TREE_CODE (ret.value) != CONSTRUCTOR)
6296 if (constructor_nonconst)
6297 ret.original_code = C_MAYBE_CONST_EXPR;
6298 else if (ret.original_code == C_MAYBE_CONST_EXPR)
6299 ret.original_code = ERROR_MARK;
6302 constructor_type = p->type;
6303 constructor_fields = p->fields;
6304 constructor_index = p->index;
6305 constructor_max_index = p->max_index;
6306 constructor_unfilled_index = p->unfilled_index;
6307 constructor_unfilled_fields = p->unfilled_fields;
6308 constructor_bit_index = p->bit_index;
6309 constructor_elements = p->elements;
6310 constructor_constant = p->constant;
6311 constructor_simple = p->simple;
6312 constructor_nonconst = p->nonconst;
6313 constructor_erroneous = p->erroneous;
6314 constructor_incremental = p->incremental;
6315 constructor_designated = p->designated;
6316 constructor_pending_elts = p->pending_elts;
6317 constructor_depth = p->depth;
6319 constructor_range_stack = p->range_stack;
6320 RESTORE_SPELLING_DEPTH (constructor_depth);
6322 constructor_stack = p->next;
6325 if (ret.value == 0 && constructor_stack == 0)
6326 ret.value = error_mark_node;
6330 /* Common handling for both array range and field name designators.
6331 ARRAY argument is nonzero for array ranges. Returns zero for success. */
6334 set_designator (int array)
6337 enum tree_code subcode;
6339 /* Don't die if an entire brace-pair level is superfluous
6340 in the containing level. */
6341 if (constructor_type == 0)
6344 /* If there were errors in this designator list already, bail out
6346 if (designator_erroneous)
6349 if (!designator_depth)
6351 gcc_assert (!constructor_range_stack);
6353 /* Designator list starts at the level of closest explicit
6355 while (constructor_stack->implicit)
6356 process_init_element (pop_init_level (1), true);
6357 constructor_designated = 1;
6361 switch (TREE_CODE (constructor_type))
6365 subtype = TREE_TYPE (constructor_fields);
6366 if (subtype != error_mark_node)
6367 subtype = TYPE_MAIN_VARIANT (subtype);
6370 subtype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
6376 subcode = TREE_CODE (subtype);
6377 if (array && subcode != ARRAY_TYPE)
6379 error_init ("array index in non-array initializer");
6382 else if (!array && subcode != RECORD_TYPE && subcode != UNION_TYPE)
6384 error_init ("field name not in record or union initializer");
6388 constructor_designated = 1;
6389 push_init_level (2);
6393 /* If there are range designators in designator list, push a new designator
6394 to constructor_range_stack. RANGE_END is end of such stack range or
6395 NULL_TREE if there is no range designator at this level. */
6398 push_range_stack (tree range_end)
6400 struct constructor_range_stack *p;
6402 p = GGC_NEW (struct constructor_range_stack);
6403 p->prev = constructor_range_stack;
6405 p->fields = constructor_fields;
6406 p->range_start = constructor_index;
6407 p->index = constructor_index;
6408 p->stack = constructor_stack;
6409 p->range_end = range_end;
6410 if (constructor_range_stack)
6411 constructor_range_stack->next = p;
6412 constructor_range_stack = p;
6415 /* Within an array initializer, specify the next index to be initialized.
6416 FIRST is that index. If LAST is nonzero, then initialize a range
6417 of indices, running from FIRST through LAST. */
6420 set_init_index (tree first, tree last)
6422 if (set_designator (1))
6425 designator_erroneous = 1;
6427 if (!INTEGRAL_TYPE_P (TREE_TYPE (first))
6428 || (last && !INTEGRAL_TYPE_P (TREE_TYPE (last))))
6430 error_init ("array index in initializer not of integer type");
6434 if (TREE_CODE (first) != INTEGER_CST)
6436 first = c_fully_fold (first, false, NULL);
6437 if (TREE_CODE (first) == INTEGER_CST)
6438 pedwarn_init (input_location, OPT_pedantic,
6439 "array index in initializer is not "
6440 "an integer constant expression");
6443 if (last && TREE_CODE (last) != INTEGER_CST)
6445 last = c_fully_fold (last, false, NULL);
6446 if (TREE_CODE (last) == INTEGER_CST)
6447 pedwarn_init (input_location, OPT_pedantic,
6448 "array index in initializer is not "
6449 "an integer constant expression");
6452 if (TREE_CODE (first) != INTEGER_CST)
6453 error_init ("nonconstant array index in initializer");
6454 else if (last != 0 && TREE_CODE (last) != INTEGER_CST)
6455 error_init ("nonconstant array index in initializer");
6456 else if (TREE_CODE (constructor_type) != ARRAY_TYPE)
6457 error_init ("array index in non-array initializer");
6458 else if (tree_int_cst_sgn (first) == -1)
6459 error_init ("array index in initializer exceeds array bounds");
6460 else if (constructor_max_index
6461 && tree_int_cst_lt (constructor_max_index, first))
6462 error_init ("array index in initializer exceeds array bounds");
6465 constant_expression_warning (first);
6467 constant_expression_warning (last);
6468 constructor_index = convert (bitsizetype, first);
6472 if (tree_int_cst_equal (first, last))
6474 else if (tree_int_cst_lt (last, first))
6476 error_init ("empty index range in initializer");
6481 last = convert (bitsizetype, last);
6482 if (constructor_max_index != 0
6483 && tree_int_cst_lt (constructor_max_index, last))
6485 error_init ("array index range in initializer exceeds array bounds");
6492 designator_erroneous = 0;
6493 if (constructor_range_stack || last)
6494 push_range_stack (last);
6498 /* Within a struct initializer, specify the next field to be initialized. */
6501 set_init_label (tree fieldname)
6505 if (set_designator (0))
6508 designator_erroneous = 1;
6510 if (TREE_CODE (constructor_type) != RECORD_TYPE
6511 && TREE_CODE (constructor_type) != UNION_TYPE)
6513 error_init ("field name not in record or union initializer");
6517 for (tail = TYPE_FIELDS (constructor_type); tail;
6518 tail = TREE_CHAIN (tail))
6520 if (DECL_NAME (tail) == fieldname)
6525 error ("unknown field %qE specified in initializer", fieldname);
6528 constructor_fields = tail;
6530 designator_erroneous = 0;
6531 if (constructor_range_stack)
6532 push_range_stack (NULL_TREE);
6536 /* Add a new initializer to the tree of pending initializers. PURPOSE
6537 identifies the initializer, either array index or field in a structure.
6538 VALUE is the value of that index or field. If ORIGTYPE is not
6539 NULL_TREE, it is the original type of VALUE.
6541 IMPLICIT is true if value comes from pop_init_level (1),
6542 the new initializer has been merged with the existing one
6543 and thus no warnings should be emitted about overriding an
6544 existing initializer. */
6547 add_pending_init (tree purpose, tree value, tree origtype, bool implicit)
6549 struct init_node *p, **q, *r;
6551 q = &constructor_pending_elts;
6554 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6559 if (tree_int_cst_lt (purpose, p->purpose))
6561 else if (tree_int_cst_lt (p->purpose, purpose))
6567 if (TREE_SIDE_EFFECTS (p->value))
6568 warning_init (0, "initialized field with side-effects overwritten");
6569 else if (warn_override_init)
6570 warning_init (OPT_Woverride_init, "initialized field overwritten");
6573 p->origtype = origtype;
6582 bitpos = bit_position (purpose);
6586 if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6588 else if (p->purpose != purpose)
6594 if (TREE_SIDE_EFFECTS (p->value))
6595 warning_init (0, "initialized field with side-effects overwritten");
6596 else if (warn_override_init)
6597 warning_init (OPT_Woverride_init, "initialized field overwritten");
6600 p->origtype = origtype;
6606 r = GGC_NEW (struct init_node);
6607 r->purpose = purpose;
6609 r->origtype = origtype;
6619 struct init_node *s;
6623 if (p->balance == 0)
6625 else if (p->balance < 0)
6632 p->left->parent = p;
6649 constructor_pending_elts = r;
6654 struct init_node *t = r->right;
6658 r->right->parent = r;
6663 p->left->parent = p;
6666 p->balance = t->balance < 0;
6667 r->balance = -(t->balance > 0);
6682 constructor_pending_elts = t;
6688 /* p->balance == +1; growth of left side balances the node. */
6693 else /* r == p->right */
6695 if (p->balance == 0)
6696 /* Growth propagation from right side. */
6698 else if (p->balance > 0)
6705 p->right->parent = p;
6722 constructor_pending_elts = r;
6724 else /* r->balance == -1 */
6727 struct init_node *t = r->left;
6731 r->left->parent = r;
6736 p->right->parent = p;
6739 r->balance = (t->balance < 0);
6740 p->balance = -(t->balance > 0);
6755 constructor_pending_elts = t;
6761 /* p->balance == -1; growth of right side balances the node. */
6772 /* Build AVL tree from a sorted chain. */
6775 set_nonincremental_init (void)
6777 unsigned HOST_WIDE_INT ix;
6780 if (TREE_CODE (constructor_type) != RECORD_TYPE
6781 && TREE_CODE (constructor_type) != ARRAY_TYPE)
6784 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements, ix, index, value)
6785 add_pending_init (index, value, NULL_TREE, false);
6786 constructor_elements = 0;
6787 if (TREE_CODE (constructor_type) == RECORD_TYPE)
6789 constructor_unfilled_fields = TYPE_FIELDS (constructor_type);
6790 /* Skip any nameless bit fields at the beginning. */
6791 while (constructor_unfilled_fields != 0
6792 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
6793 && DECL_NAME (constructor_unfilled_fields) == 0)
6794 constructor_unfilled_fields = TREE_CHAIN (constructor_unfilled_fields);
6797 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6799 if (TYPE_DOMAIN (constructor_type))
6800 constructor_unfilled_index
6801 = convert (bitsizetype,
6802 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type)));
6804 constructor_unfilled_index = bitsize_zero_node;
6806 constructor_incremental = 0;
6809 /* Build AVL tree from a string constant. */
6812 set_nonincremental_init_from_string (tree str)
6814 tree value, purpose, type;
6815 HOST_WIDE_INT val[2];
6816 const char *p, *end;
6817 int byte, wchar_bytes, charwidth, bitpos;
6819 gcc_assert (TREE_CODE (constructor_type) == ARRAY_TYPE);
6821 wchar_bytes = TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str))) / BITS_PER_UNIT;
6822 charwidth = TYPE_PRECISION (char_type_node);
6823 type = TREE_TYPE (constructor_type);
6824 p = TREE_STRING_POINTER (str);
6825 end = p + TREE_STRING_LENGTH (str);
6827 for (purpose = bitsize_zero_node;
6828 p < end && !tree_int_cst_lt (constructor_max_index, purpose);
6829 purpose = size_binop (PLUS_EXPR, purpose, bitsize_one_node))
6831 if (wchar_bytes == 1)
6833 val[1] = (unsigned char) *p++;
6840 for (byte = 0; byte < wchar_bytes; byte++)
6842 if (BYTES_BIG_ENDIAN)
6843 bitpos = (wchar_bytes - byte - 1) * charwidth;
6845 bitpos = byte * charwidth;
6846 val[bitpos < HOST_BITS_PER_WIDE_INT]
6847 |= ((unsigned HOST_WIDE_INT) ((unsigned char) *p++))
6848 << (bitpos % HOST_BITS_PER_WIDE_INT);
6852 if (!TYPE_UNSIGNED (type))
6854 bitpos = ((wchar_bytes - 1) * charwidth) + HOST_BITS_PER_CHAR;
6855 if (bitpos < HOST_BITS_PER_WIDE_INT)
6857 if (val[1] & (((HOST_WIDE_INT) 1) << (bitpos - 1)))
6859 val[1] |= ((HOST_WIDE_INT) -1) << bitpos;
6863 else if (bitpos == HOST_BITS_PER_WIDE_INT)
6868 else if (val[0] & (((HOST_WIDE_INT) 1)
6869 << (bitpos - 1 - HOST_BITS_PER_WIDE_INT)))
6870 val[0] |= ((HOST_WIDE_INT) -1)
6871 << (bitpos - HOST_BITS_PER_WIDE_INT);
6874 value = build_int_cst_wide (type, val[1], val[0]);
6875 add_pending_init (purpose, value, NULL_TREE, false);
6878 constructor_incremental = 0;
6881 /* Return value of FIELD in pending initializer or zero if the field was
6882 not initialized yet. */
6885 find_init_member (tree field)
6887 struct init_node *p;
6889 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
6891 if (constructor_incremental
6892 && tree_int_cst_lt (field, constructor_unfilled_index))
6893 set_nonincremental_init ();
6895 p = constructor_pending_elts;
6898 if (tree_int_cst_lt (field, p->purpose))
6900 else if (tree_int_cst_lt (p->purpose, field))
6906 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
6908 tree bitpos = bit_position (field);
6910 if (constructor_incremental
6911 && (!constructor_unfilled_fields
6912 || tree_int_cst_lt (bitpos,
6913 bit_position (constructor_unfilled_fields))))
6914 set_nonincremental_init ();
6916 p = constructor_pending_elts;
6919 if (field == p->purpose)
6921 else if (tree_int_cst_lt (bitpos, bit_position (p->purpose)))
6927 else if (TREE_CODE (constructor_type) == UNION_TYPE)
6929 if (!VEC_empty (constructor_elt, constructor_elements)
6930 && (VEC_last (constructor_elt, constructor_elements)->index
6932 return VEC_last (constructor_elt, constructor_elements)->value;
6937 /* "Output" the next constructor element.
6938 At top level, really output it to assembler code now.
6939 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6940 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
6941 TYPE is the data type that the containing data type wants here.
6942 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6943 If VALUE is a string constant, STRICT_STRING is true if it is
6944 unparenthesized or we should not warn here for it being parenthesized.
6945 For other types of VALUE, STRICT_STRING is not used.
6947 PENDING if non-nil means output pending elements that belong
6948 right after this element. (PENDING is normally 1;
6949 it is 0 while outputting pending elements, to avoid recursion.)
6951 IMPLICIT is true if value comes from pop_init_level (1),
6952 the new initializer has been merged with the existing one
6953 and thus no warnings should be emitted about overriding an
6954 existing initializer. */
6957 output_init_element (tree value, tree origtype, bool strict_string, tree type,
6958 tree field, int pending, bool implicit)
6960 tree semantic_type = NULL_TREE;
6961 constructor_elt *celt;
6962 bool maybe_const = true;
6965 if (type == error_mark_node || value == error_mark_node)
6967 constructor_erroneous = 1;
6970 if (TREE_CODE (TREE_TYPE (value)) == ARRAY_TYPE
6971 && (TREE_CODE (value) == STRING_CST
6972 || TREE_CODE (value) == COMPOUND_LITERAL_EXPR)
6973 && !(TREE_CODE (value) == STRING_CST
6974 && TREE_CODE (type) == ARRAY_TYPE
6975 && INTEGRAL_TYPE_P (TREE_TYPE (type)))
6976 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value)),
6977 TYPE_MAIN_VARIANT (type)))
6978 value = array_to_pointer_conversion (value);
6980 if (TREE_CODE (value) == COMPOUND_LITERAL_EXPR
6981 && require_constant_value && !flag_isoc99 && pending)
6983 /* As an extension, allow initializing objects with static storage
6984 duration with compound literals (which are then treated just as
6985 the brace enclosed list they contain). */
6986 tree decl = COMPOUND_LITERAL_EXPR_DECL (value);
6987 value = DECL_INITIAL (decl);
6990 npc = null_pointer_constant_p (value);
6991 if (TREE_CODE (value) == EXCESS_PRECISION_EXPR)
6993 semantic_type = TREE_TYPE (value);
6994 value = TREE_OPERAND (value, 0);
6996 value = c_fully_fold (value, require_constant_value, &maybe_const);
6998 if (value == error_mark_node)
6999 constructor_erroneous = 1;
7000 else if (!TREE_CONSTANT (value))
7001 constructor_constant = 0;
7002 else if (!initializer_constant_valid_p (value, TREE_TYPE (value))
7003 || ((TREE_CODE (constructor_type) == RECORD_TYPE
7004 || TREE_CODE (constructor_type) == UNION_TYPE)
7005 && DECL_C_BIT_FIELD (field)
7006 && TREE_CODE (value) != INTEGER_CST))
7007 constructor_simple = 0;
7009 constructor_nonconst = 1;
7011 if (!initializer_constant_valid_p (value, TREE_TYPE (value)))
7013 if (require_constant_value)
7015 error_init ("initializer element is not constant");
7016 value = error_mark_node;
7018 else if (require_constant_elements)
7019 pedwarn (input_location, 0,
7020 "initializer element is not computable at load time");
7022 else if (!maybe_const
7023 && (require_constant_value || require_constant_elements))
7024 pedwarn_init (input_location, 0,
7025 "initializer element is not a constant expression");
7027 /* If this field is empty (and not at the end of structure),
7028 don't do anything other than checking the initializer. */
7030 && (TREE_TYPE (field) == error_mark_node
7031 || (COMPLETE_TYPE_P (TREE_TYPE (field))
7032 && integer_zerop (TYPE_SIZE (TREE_TYPE (field)))
7033 && (TREE_CODE (constructor_type) == ARRAY_TYPE
7034 || TREE_CHAIN (field)))))
7038 value = build1 (EXCESS_PRECISION_EXPR, semantic_type, value);
7039 value = digest_init (type, value, origtype, npc, strict_string,
7040 require_constant_value);
7041 if (value == error_mark_node)
7043 constructor_erroneous = 1;
7046 if (require_constant_value || require_constant_elements)
7047 constant_expression_warning (value);
7049 /* If this element doesn't come next in sequence,
7050 put it on constructor_pending_elts. */
7051 if (TREE_CODE (constructor_type) == ARRAY_TYPE
7052 && (!constructor_incremental
7053 || !tree_int_cst_equal (field, constructor_unfilled_index)))
7055 if (constructor_incremental
7056 && tree_int_cst_lt (field, constructor_unfilled_index))
7057 set_nonincremental_init ();
7059 add_pending_init (field, value, origtype, implicit);
7062 else if (TREE_CODE (constructor_type) == RECORD_TYPE
7063 && (!constructor_incremental
7064 || field != constructor_unfilled_fields))
7066 /* We do this for records but not for unions. In a union,
7067 no matter which field is specified, it can be initialized
7068 right away since it starts at the beginning of the union. */
7069 if (constructor_incremental)
7071 if (!constructor_unfilled_fields)
7072 set_nonincremental_init ();
7075 tree bitpos, unfillpos;
7077 bitpos = bit_position (field);
7078 unfillpos = bit_position (constructor_unfilled_fields);
7080 if (tree_int_cst_lt (bitpos, unfillpos))
7081 set_nonincremental_init ();
7085 add_pending_init (field, value, origtype, implicit);
7088 else if (TREE_CODE (constructor_type) == UNION_TYPE
7089 && !VEC_empty (constructor_elt, constructor_elements))
7093 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt,
7094 constructor_elements)->value))
7096 "initialized field with side-effects overwritten");
7097 else if (warn_override_init)
7098 warning_init (OPT_Woverride_init, "initialized field overwritten");
7101 /* We can have just one union field set. */
7102 constructor_elements = 0;
7105 /* Otherwise, output this element either to
7106 constructor_elements or to the assembler file. */
7108 celt = VEC_safe_push (constructor_elt, gc, constructor_elements, NULL);
7109 celt->index = field;
7110 celt->value = value;
7112 /* Advance the variable that indicates sequential elements output. */
7113 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7114 constructor_unfilled_index
7115 = size_binop (PLUS_EXPR, constructor_unfilled_index,
7117 else if (TREE_CODE (constructor_type) == RECORD_TYPE)
7119 constructor_unfilled_fields
7120 = TREE_CHAIN (constructor_unfilled_fields);
7122 /* Skip any nameless bit fields. */
7123 while (constructor_unfilled_fields != 0
7124 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
7125 && DECL_NAME (constructor_unfilled_fields) == 0)
7126 constructor_unfilled_fields =
7127 TREE_CHAIN (constructor_unfilled_fields);
7129 else if (TREE_CODE (constructor_type) == UNION_TYPE)
7130 constructor_unfilled_fields = 0;
7132 /* Now output any pending elements which have become next. */
7134 output_pending_init_elements (0);
7137 /* Output any pending elements which have become next.
7138 As we output elements, constructor_unfilled_{fields,index}
7139 advances, which may cause other elements to become next;
7140 if so, they too are output.
7142 If ALL is 0, we return when there are
7143 no more pending elements to output now.
7145 If ALL is 1, we output space as necessary so that
7146 we can output all the pending elements. */
7149 output_pending_init_elements (int all)
7151 struct init_node *elt = constructor_pending_elts;
7156 /* Look through the whole pending tree.
7157 If we find an element that should be output now,
7158 output it. Otherwise, set NEXT to the element
7159 that comes first among those still pending. */
7164 if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7166 if (tree_int_cst_equal (elt->purpose,
7167 constructor_unfilled_index))
7168 output_init_element (elt->value, elt->origtype, true,
7169 TREE_TYPE (constructor_type),
7170 constructor_unfilled_index, 0, false);
7171 else if (tree_int_cst_lt (constructor_unfilled_index,
7174 /* Advance to the next smaller node. */
7179 /* We have reached the smallest node bigger than the
7180 current unfilled index. Fill the space first. */
7181 next = elt->purpose;
7187 /* Advance to the next bigger node. */
7192 /* We have reached the biggest node in a subtree. Find
7193 the parent of it, which is the next bigger node. */
7194 while (elt->parent && elt->parent->right == elt)
7197 if (elt && tree_int_cst_lt (constructor_unfilled_index,
7200 next = elt->purpose;
7206 else if (TREE_CODE (constructor_type) == RECORD_TYPE
7207 || TREE_CODE (constructor_type) == UNION_TYPE)
7209 tree ctor_unfilled_bitpos, elt_bitpos;
7211 /* If the current record is complete we are done. */
7212 if (constructor_unfilled_fields == 0)
7215 ctor_unfilled_bitpos = bit_position (constructor_unfilled_fields);
7216 elt_bitpos = bit_position (elt->purpose);
7217 /* We can't compare fields here because there might be empty
7218 fields in between. */
7219 if (tree_int_cst_equal (elt_bitpos, ctor_unfilled_bitpos))
7221 constructor_unfilled_fields = elt->purpose;
7222 output_init_element (elt->value, elt->origtype, true,
7223 TREE_TYPE (elt->purpose),
7224 elt->purpose, 0, false);
7226 else if (tree_int_cst_lt (ctor_unfilled_bitpos, elt_bitpos))
7228 /* Advance to the next smaller node. */
7233 /* We have reached the smallest node bigger than the
7234 current unfilled field. Fill the space first. */
7235 next = elt->purpose;
7241 /* Advance to the next bigger node. */
7246 /* We have reached the biggest node in a subtree. Find
7247 the parent of it, which is the next bigger node. */
7248 while (elt->parent && elt->parent->right == elt)
7252 && (tree_int_cst_lt (ctor_unfilled_bitpos,
7253 bit_position (elt->purpose))))
7255 next = elt->purpose;
7263 /* Ordinarily return, but not if we want to output all
7264 and there are elements left. */
7265 if (!(all && next != 0))
7268 /* If it's not incremental, just skip over the gap, so that after
7269 jumping to retry we will output the next successive element. */
7270 if (TREE_CODE (constructor_type) == RECORD_TYPE
7271 || TREE_CODE (constructor_type) == UNION_TYPE)
7272 constructor_unfilled_fields = next;
7273 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7274 constructor_unfilled_index = next;
7276 /* ELT now points to the node in the pending tree with the next
7277 initializer to output. */
7281 /* Add one non-braced element to the current constructor level.
7282 This adjusts the current position within the constructor's type.
7283 This may also start or terminate implicit levels
7284 to handle a partly-braced initializer.
7286 Once this has found the correct level for the new element,
7287 it calls output_init_element.
7289 IMPLICIT is true if value comes from pop_init_level (1),
7290 the new initializer has been merged with the existing one
7291 and thus no warnings should be emitted about overriding an
7292 existing initializer. */
7295 process_init_element (struct c_expr value, bool implicit)
7297 tree orig_value = value.value;
7298 int string_flag = orig_value != 0 && TREE_CODE (orig_value) == STRING_CST;
7299 bool strict_string = value.original_code == STRING_CST;
7301 designator_depth = 0;
7302 designator_erroneous = 0;
7304 /* Handle superfluous braces around string cst as in
7305 char x[] = {"foo"}; */
7308 && TREE_CODE (constructor_type) == ARRAY_TYPE
7309 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type))
7310 && integer_zerop (constructor_unfilled_index))
7312 if (constructor_stack->replacement_value.value)
7313 error_init ("excess elements in char array initializer");
7314 constructor_stack->replacement_value = value;
7318 if (constructor_stack->replacement_value.value != 0)
7320 error_init ("excess elements in struct initializer");
7324 /* Ignore elements of a brace group if it is entirely superfluous
7325 and has already been diagnosed. */
7326 if (constructor_type == 0)
7329 /* If we've exhausted any levels that didn't have braces,
7331 while (constructor_stack->implicit)
7333 if ((TREE_CODE (constructor_type) == RECORD_TYPE
7334 || TREE_CODE (constructor_type) == UNION_TYPE)
7335 && constructor_fields == 0)
7336 process_init_element (pop_init_level (1), true);
7337 else if ((TREE_CODE (constructor_type) == ARRAY_TYPE
7338 || TREE_CODE (constructor_type) == VECTOR_TYPE)
7339 && (constructor_max_index == 0
7340 || tree_int_cst_lt (constructor_max_index,
7341 constructor_index)))
7342 process_init_element (pop_init_level (1), true);
7347 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
7348 if (constructor_range_stack)
7350 /* If value is a compound literal and we'll be just using its
7351 content, don't put it into a SAVE_EXPR. */
7352 if (TREE_CODE (value.value) != COMPOUND_LITERAL_EXPR
7353 || !require_constant_value
7356 tree semantic_type = NULL_TREE;
7357 if (TREE_CODE (value.value) == EXCESS_PRECISION_EXPR)
7359 semantic_type = TREE_TYPE (value.value);
7360 value.value = TREE_OPERAND (value.value, 0);
7362 value.value = c_save_expr (value.value);
7364 value.value = build1 (EXCESS_PRECISION_EXPR, semantic_type,
7371 if (TREE_CODE (constructor_type) == RECORD_TYPE)
7374 enum tree_code fieldcode;
7376 if (constructor_fields == 0)
7378 pedwarn_init (input_location, 0,
7379 "excess elements in struct initializer");
7383 fieldtype = TREE_TYPE (constructor_fields);
7384 if (fieldtype != error_mark_node)
7385 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
7386 fieldcode = TREE_CODE (fieldtype);
7388 /* Error for non-static initialization of a flexible array member. */
7389 if (fieldcode == ARRAY_TYPE
7390 && !require_constant_value
7391 && TYPE_SIZE (fieldtype) == NULL_TREE
7392 && TREE_CHAIN (constructor_fields) == NULL_TREE)
7394 error_init ("non-static initialization of a flexible array member");
7398 /* Accept a string constant to initialize a subarray. */
7399 if (value.value != 0
7400 && fieldcode == ARRAY_TYPE
7401 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
7403 value.value = orig_value;
7404 /* Otherwise, if we have come to a subaggregate,
7405 and we don't have an element of its type, push into it. */
7406 else if (value.value != 0
7407 && value.value != error_mark_node
7408 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
7409 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
7410 || fieldcode == UNION_TYPE || fieldcode == VECTOR_TYPE))
7412 push_init_level (1);
7418 push_member_name (constructor_fields);
7419 output_init_element (value.value, value.original_type,
7420 strict_string, fieldtype,
7421 constructor_fields, 1, implicit);
7422 RESTORE_SPELLING_DEPTH (constructor_depth);
7425 /* Do the bookkeeping for an element that was
7426 directly output as a constructor. */
7428 /* For a record, keep track of end position of last field. */
7429 if (DECL_SIZE (constructor_fields))
7430 constructor_bit_index
7431 = size_binop (PLUS_EXPR,
7432 bit_position (constructor_fields),
7433 DECL_SIZE (constructor_fields));
7435 /* If the current field was the first one not yet written out,
7436 it isn't now, so update. */
7437 if (constructor_unfilled_fields == constructor_fields)
7439 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
7440 /* Skip any nameless bit fields. */
7441 while (constructor_unfilled_fields != 0
7442 && DECL_C_BIT_FIELD (constructor_unfilled_fields)
7443 && DECL_NAME (constructor_unfilled_fields) == 0)
7444 constructor_unfilled_fields =
7445 TREE_CHAIN (constructor_unfilled_fields);
7449 constructor_fields = TREE_CHAIN (constructor_fields);
7450 /* Skip any nameless bit fields at the beginning. */
7451 while (constructor_fields != 0
7452 && DECL_C_BIT_FIELD (constructor_fields)
7453 && DECL_NAME (constructor_fields) == 0)
7454 constructor_fields = TREE_CHAIN (constructor_fields);
7456 else if (TREE_CODE (constructor_type) == UNION_TYPE)
7459 enum tree_code fieldcode;
7461 if (constructor_fields == 0)
7463 pedwarn_init (input_location, 0,
7464 "excess elements in union initializer");
7468 fieldtype = TREE_TYPE (constructor_fields);
7469 if (fieldtype != error_mark_node)
7470 fieldtype = TYPE_MAIN_VARIANT (fieldtype);
7471 fieldcode = TREE_CODE (fieldtype);
7473 /* Warn that traditional C rejects initialization of unions.
7474 We skip the warning if the value is zero. This is done
7475 under the assumption that the zero initializer in user
7476 code appears conditioned on e.g. __STDC__ to avoid
7477 "missing initializer" warnings and relies on default
7478 initialization to zero in the traditional C case.
7479 We also skip the warning if the initializer is designated,
7480 again on the assumption that this must be conditional on
7481 __STDC__ anyway (and we've already complained about the
7482 member-designator already). */
7483 if (!in_system_header && !constructor_designated
7484 && !(value.value && (integer_zerop (value.value)
7485 || real_zerop (value.value))))
7486 warning (OPT_Wtraditional, "traditional C rejects initialization "
7489 /* Accept a string constant to initialize a subarray. */
7490 if (value.value != 0
7491 && fieldcode == ARRAY_TYPE
7492 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype))
7494 value.value = orig_value;
7495 /* Otherwise, if we have come to a subaggregate,
7496 and we don't have an element of its type, push into it. */
7497 else if (value.value != 0
7498 && value.value != error_mark_node
7499 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != fieldtype
7500 && (fieldcode == RECORD_TYPE || fieldcode == ARRAY_TYPE
7501 || fieldcode == UNION_TYPE || fieldcode == VECTOR_TYPE))
7503 push_init_level (1);
7509 push_member_name (constructor_fields);
7510 output_init_element (value.value, value.original_type,
7511 strict_string, fieldtype,
7512 constructor_fields, 1, implicit);
7513 RESTORE_SPELLING_DEPTH (constructor_depth);
7516 /* Do the bookkeeping for an element that was
7517 directly output as a constructor. */
7519 constructor_bit_index = DECL_SIZE (constructor_fields);
7520 constructor_unfilled_fields = TREE_CHAIN (constructor_fields);
7523 constructor_fields = 0;
7525 else if (TREE_CODE (constructor_type) == ARRAY_TYPE)
7527 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
7528 enum tree_code eltcode = TREE_CODE (elttype);
7530 /* Accept a string constant to initialize a subarray. */
7531 if (value.value != 0
7532 && eltcode == ARRAY_TYPE
7533 && INTEGRAL_TYPE_P (TREE_TYPE (elttype))
7535 value.value = orig_value;
7536 /* Otherwise, if we have come to a subaggregate,
7537 and we don't have an element of its type, push into it. */
7538 else if (value.value != 0
7539 && value.value != error_mark_node
7540 && TYPE_MAIN_VARIANT (TREE_TYPE (value.value)) != elttype
7541 && (eltcode == RECORD_TYPE || eltcode == ARRAY_TYPE
7542 || eltcode == UNION_TYPE || eltcode == VECTOR_TYPE))
7544 push_init_level (1);
7548 if (constructor_max_index != 0
7549 && (tree_int_cst_lt (constructor_max_index, constructor_index)
7550 || integer_all_onesp (constructor_max_index)))
7552 pedwarn_init (input_location, 0,
7553 "excess elements in array initializer");
7557 /* Now output the actual element. */
7560 push_array_bounds (tree_low_cst (constructor_index, 1));
7561 output_init_element (value.value, value.original_type,
7562 strict_string, elttype,
7563 constructor_index, 1, implicit);
7564 RESTORE_SPELLING_DEPTH (constructor_depth);
7568 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
7571 /* If we are doing the bookkeeping for an element that was
7572 directly output as a constructor, we must update
7573 constructor_unfilled_index. */
7574 constructor_unfilled_index = constructor_index;
7576 else if (TREE_CODE (constructor_type) == VECTOR_TYPE)
7578 tree elttype = TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type));
7580 /* Do a basic check of initializer size. Note that vectors
7581 always have a fixed size derived from their type. */
7582 if (tree_int_cst_lt (constructor_max_index, constructor_index))
7584 pedwarn_init (input_location, 0,
7585 "excess elements in vector initializer");
7589 /* Now output the actual element. */
7592 if (TREE_CODE (value.value) == VECTOR_CST)
7593 elttype = TYPE_MAIN_VARIANT (constructor_type);
7594 output_init_element (value.value, value.original_type,
7595 strict_string, elttype,
7596 constructor_index, 1, implicit);
7600 = size_binop (PLUS_EXPR, constructor_index, bitsize_one_node);
7603 /* If we are doing the bookkeeping for an element that was
7604 directly output as a constructor, we must update
7605 constructor_unfilled_index. */
7606 constructor_unfilled_index = constructor_index;
7609 /* Handle the sole element allowed in a braced initializer
7610 for a scalar variable. */
7611 else if (constructor_type != error_mark_node
7612 && constructor_fields == 0)
7614 pedwarn_init (input_location, 0,
7615 "excess elements in scalar initializer");
7621 output_init_element (value.value, value.original_type,
7622 strict_string, constructor_type,
7623 NULL_TREE, 1, implicit);
7624 constructor_fields = 0;
7627 /* Handle range initializers either at this level or anywhere higher
7628 in the designator stack. */
7629 if (constructor_range_stack)
7631 struct constructor_range_stack *p, *range_stack;
7634 range_stack = constructor_range_stack;
7635 constructor_range_stack = 0;
7636 while (constructor_stack != range_stack->stack)
7638 gcc_assert (constructor_stack->implicit);
7639 process_init_element (pop_init_level (1), true);
7641 for (p = range_stack;
7642 !p->range_end || tree_int_cst_equal (p->index, p->range_end);
7645 gcc_assert (constructor_stack->implicit);
7646 process_init_element (pop_init_level (1), true);
7649 p->index = size_binop (PLUS_EXPR, p->index, bitsize_one_node);
7650 if (tree_int_cst_equal (p->index, p->range_end) && !p->prev)
7655 constructor_index = p->index;
7656 constructor_fields = p->fields;
7657 if (finish && p->range_end && p->index == p->range_start)
7665 push_init_level (2);
7666 p->stack = constructor_stack;
7667 if (p->range_end && tree_int_cst_equal (p->index, p->range_end))
7668 p->index = p->range_start;
7672 constructor_range_stack = range_stack;
7679 constructor_range_stack = 0;
7682 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
7683 (guaranteed to be 'volatile' or null) and ARGS (represented using
7684 an ASM_EXPR node). */
7686 build_asm_stmt (tree cv_qualifier, tree args)
7688 if (!ASM_VOLATILE_P (args) && cv_qualifier)
7689 ASM_VOLATILE_P (args) = 1;
7690 return add_stmt (args);
7693 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
7694 some INPUTS, and some CLOBBERS. The latter three may be NULL.
7695 SIMPLE indicates whether there was anything at all after the
7696 string in the asm expression -- asm("blah") and asm("blah" : )
7697 are subtly different. We use a ASM_EXPR node to represent this. */
7699 build_asm_expr (tree string, tree outputs, tree inputs, tree clobbers,
7705 const char *constraint;
7706 const char **oconstraints;
7707 bool allows_mem, allows_reg, is_inout;
7708 int ninputs, noutputs;
7710 ninputs = list_length (inputs);
7711 noutputs = list_length (outputs);
7712 oconstraints = (const char **) alloca (noutputs * sizeof (const char *));
7714 string = resolve_asm_operand_names (string, outputs, inputs);
7716 /* Remove output conversions that change the type but not the mode. */
7717 for (i = 0, tail = outputs; tail; ++i, tail = TREE_CHAIN (tail))
7719 tree output = TREE_VALUE (tail);
7721 /* ??? Really, this should not be here. Users should be using a
7722 proper lvalue, dammit. But there's a long history of using casts
7723 in the output operands. In cases like longlong.h, this becomes a
7724 primitive form of typechecking -- if the cast can be removed, then
7725 the output operand had a type of the proper width; otherwise we'll
7726 get an error. Gross, but ... */
7727 STRIP_NOPS (output);
7729 if (!lvalue_or_else (output, lv_asm))
7730 output = error_mark_node;
7732 if (output != error_mark_node
7733 && (TREE_READONLY (output)
7734 || TYPE_READONLY (TREE_TYPE (output))
7735 || ((TREE_CODE (TREE_TYPE (output)) == RECORD_TYPE
7736 || TREE_CODE (TREE_TYPE (output)) == UNION_TYPE)
7737 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output)))))
7738 readonly_error (output, lv_asm);
7740 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
7741 oconstraints[i] = constraint;
7743 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
7744 &allows_mem, &allows_reg, &is_inout))
7746 /* If the operand is going to end up in memory,
7747 mark it addressable. */
7748 if (!allows_reg && !c_mark_addressable (output))
7749 output = error_mark_node;
7752 output = error_mark_node;
7754 TREE_VALUE (tail) = output;
7757 for (i = 0, tail = inputs; tail; ++i, tail = TREE_CHAIN (tail))
7761 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail)));
7762 input = TREE_VALUE (tail);
7764 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
7765 oconstraints, &allows_mem, &allows_reg))
7767 /* If the operand is going to end up in memory,
7768 mark it addressable. */
7769 if (!allows_reg && allows_mem)
7771 /* Strip the nops as we allow this case. FIXME, this really
7772 should be rejected or made deprecated. */
7774 if (!c_mark_addressable (input))
7775 input = error_mark_node;
7779 input = error_mark_node;
7781 TREE_VALUE (tail) = input;
7784 args = build_stmt (ASM_EXPR, string, outputs, inputs, clobbers);
7786 /* asm statements without outputs, including simple ones, are treated
7788 ASM_INPUT_P (args) = simple;
7789 ASM_VOLATILE_P (args) = (noutputs == 0);
7794 /* Generate a goto statement to LABEL. */
7797 c_finish_goto_label (tree label)
7799 tree decl = lookup_label (label);
7803 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl))
7805 error ("jump into statement expression");
7809 if (C_DECL_UNJUMPABLE_VM (decl))
7811 error ("jump into scope of identifier with variably modified type");
7815 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl))
7817 /* No jump from outside this statement expression context, so
7818 record that there is a jump from within this context. */
7819 struct c_label_list *nlist;
7820 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7821 nlist->next = label_context_stack_se->labels_used;
7822 nlist->label = decl;
7823 label_context_stack_se->labels_used = nlist;
7826 if (!C_DECL_UNDEFINABLE_VM (decl))
7828 /* No jump from outside this context context of identifiers with
7829 variably modified type, so record that there is a jump from
7830 within this context. */
7831 struct c_label_list *nlist;
7832 nlist = XOBNEW (&parser_obstack, struct c_label_list);
7833 nlist->next = label_context_stack_vm->labels_used;
7834 nlist->label = decl;
7835 label_context_stack_vm->labels_used = nlist;
7838 TREE_USED (decl) = 1;
7839 return add_stmt (build1 (GOTO_EXPR, void_type_node, decl));
7842 /* Generate a computed goto statement to EXPR. */
7845 c_finish_goto_ptr (tree expr)
7847 pedwarn (input_location, OPT_pedantic, "ISO C forbids %<goto *expr;%>");
7848 expr = c_fully_fold (expr, false, NULL);
7849 expr = convert (ptr_type_node, expr);
7850 return add_stmt (build1 (GOTO_EXPR, void_type_node, expr));
7853 /* Generate a C `return' statement. RETVAL is the expression for what
7854 to return, or a null pointer for `return;' with no value. If
7855 ORIGTYPE is not NULL_TREE, it is the original type of RETVAL. */
7858 c_finish_return (tree retval, tree origtype)
7860 tree valtype = TREE_TYPE (TREE_TYPE (current_function_decl)), ret_stmt;
7861 bool no_warning = false;
7864 if (TREE_THIS_VOLATILE (current_function_decl))
7865 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7869 tree semantic_type = NULL_TREE;
7870 npc = null_pointer_constant_p (retval);
7871 if (TREE_CODE (retval) == EXCESS_PRECISION_EXPR)
7873 semantic_type = TREE_TYPE (retval);
7874 retval = TREE_OPERAND (retval, 0);
7876 retval = c_fully_fold (retval, false, NULL);
7878 retval = build1 (EXCESS_PRECISION_EXPR, semantic_type, retval);
7883 current_function_returns_null = 1;
7884 if ((warn_return_type || flag_isoc99)
7885 && valtype != 0 && TREE_CODE (valtype) != VOID_TYPE)
7887 pedwarn_c99 (input_location, flag_isoc99 ? 0 : OPT_Wreturn_type,
7888 "%<return%> with no value, in "
7889 "function returning non-void");
7893 else if (valtype == 0 || TREE_CODE (valtype) == VOID_TYPE)
7895 current_function_returns_null = 1;
7896 if (TREE_CODE (TREE_TYPE (retval)) != VOID_TYPE)
7897 pedwarn (input_location, 0,
7898 "%<return%> with a value, in function returning void");
7900 pedwarn (input_location, OPT_pedantic, "ISO C forbids "
7901 "%<return%> with expression, in function returning void");
7905 tree t = convert_for_assignment (valtype, retval, origtype, ic_return,
7906 npc, NULL_TREE, NULL_TREE, 0);
7907 tree res = DECL_RESULT (current_function_decl);
7910 current_function_returns_value = 1;
7911 if (t == error_mark_node)
7914 inner = t = convert (TREE_TYPE (res), t);
7916 /* Strip any conversions, additions, and subtractions, and see if
7917 we are returning the address of a local variable. Warn if so. */
7920 switch (TREE_CODE (inner))
7923 case NON_LVALUE_EXPR:
7925 case POINTER_PLUS_EXPR:
7926 inner = TREE_OPERAND (inner, 0);
7930 /* If the second operand of the MINUS_EXPR has a pointer
7931 type (or is converted from it), this may be valid, so
7932 don't give a warning. */
7934 tree op1 = TREE_OPERAND (inner, 1);
7936 while (!POINTER_TYPE_P (TREE_TYPE (op1))
7937 && (CONVERT_EXPR_P (op1)
7938 || TREE_CODE (op1) == NON_LVALUE_EXPR))
7939 op1 = TREE_OPERAND (op1, 0);
7941 if (POINTER_TYPE_P (TREE_TYPE (op1)))
7944 inner = TREE_OPERAND (inner, 0);
7949 inner = TREE_OPERAND (inner, 0);
7951 while (REFERENCE_CLASS_P (inner)
7952 && TREE_CODE (inner) != INDIRECT_REF)
7953 inner = TREE_OPERAND (inner, 0);
7956 && !DECL_EXTERNAL (inner)
7957 && !TREE_STATIC (inner)
7958 && DECL_CONTEXT (inner) == current_function_decl)
7959 warning (0, "function returns address of local variable");
7969 retval = build2 (MODIFY_EXPR, TREE_TYPE (res), res, t);
7971 if (warn_sequence_point)
7972 verify_sequence_points (retval);
7975 ret_stmt = build_stmt (RETURN_EXPR, retval);
7976 TREE_NO_WARNING (ret_stmt) |= no_warning;
7977 return add_stmt (ret_stmt);
7981 /* The SWITCH_EXPR being built. */
7984 /* The original type of the testing expression, i.e. before the
7985 default conversion is applied. */
7988 /* A splay-tree mapping the low element of a case range to the high
7989 element, or NULL_TREE if there is no high element. Used to
7990 determine whether or not a new case label duplicates an old case
7991 label. We need a tree, rather than simply a hash table, because
7992 of the GNU case range extension. */
7995 /* Number of nested statement expressions within this switch
7996 statement; if nonzero, case and default labels may not
7998 unsigned int blocked_stmt_expr;
8000 /* Scope of outermost declarations of identifiers with variably
8001 modified type within this switch statement; if nonzero, case and
8002 default labels may not appear. */
8003 unsigned int blocked_vm;
8005 /* The next node on the stack. */
8006 struct c_switch *next;
8009 /* A stack of the currently active switch statements. The innermost
8010 switch statement is on the top of the stack. There is no need to
8011 mark the stack for garbage collection because it is only active
8012 during the processing of the body of a function, and we never
8013 collect at that point. */
8015 struct c_switch *c_switch_stack;
8017 /* Start a C switch statement, testing expression EXP. Return the new
8021 c_start_case (tree exp)
8023 tree orig_type = error_mark_node;
8024 struct c_switch *cs;
8026 if (exp != error_mark_node)
8028 orig_type = TREE_TYPE (exp);
8030 if (!INTEGRAL_TYPE_P (orig_type))
8032 if (orig_type != error_mark_node)
8034 error ("switch quantity not an integer");
8035 orig_type = error_mark_node;
8037 exp = integer_zero_node;
8041 tree type = TYPE_MAIN_VARIANT (orig_type);
8043 if (!in_system_header
8044 && (type == long_integer_type_node
8045 || type == long_unsigned_type_node))
8046 warning (OPT_Wtraditional, "%<long%> switch expression not "
8047 "converted to %<int%> in ISO C");
8049 exp = c_fully_fold (exp, false, NULL);
8050 exp = default_conversion (exp);
8052 if (warn_sequence_point)
8053 verify_sequence_points (exp);
8057 /* Add this new SWITCH_EXPR to the stack. */
8058 cs = XNEW (struct c_switch);
8059 cs->switch_expr = build3 (SWITCH_EXPR, orig_type, exp, NULL_TREE, NULL_TREE);
8060 cs->orig_type = orig_type;
8061 cs->cases = splay_tree_new (case_compare, NULL, NULL);
8062 cs->blocked_stmt_expr = 0;
8064 cs->next = c_switch_stack;
8065 c_switch_stack = cs;
8067 return add_stmt (cs->switch_expr);
8070 /* Process a case label. */
8073 do_case (tree low_value, tree high_value)
8075 tree label = NULL_TREE;
8077 if (low_value && TREE_CODE (low_value) != INTEGER_CST)
8079 low_value = c_fully_fold (low_value, false, NULL);
8080 if (TREE_CODE (low_value) == INTEGER_CST)
8081 pedwarn (input_location, OPT_pedantic,
8082 "case label is not an integer constant expression");
8085 if (high_value && TREE_CODE (high_value) != INTEGER_CST)
8087 high_value = c_fully_fold (high_value, false, NULL);
8088 if (TREE_CODE (high_value) == INTEGER_CST)
8089 pedwarn (input_location, OPT_pedantic,
8090 "case label is not an integer constant expression");
8093 if (c_switch_stack && !c_switch_stack->blocked_stmt_expr
8094 && !c_switch_stack->blocked_vm)
8096 label = c_add_case_label (c_switch_stack->cases,
8097 SWITCH_COND (c_switch_stack->switch_expr),
8098 c_switch_stack->orig_type,
8099 low_value, high_value);
8100 if (label == error_mark_node)
8103 else if (c_switch_stack && c_switch_stack->blocked_stmt_expr)
8106 error ("case label in statement expression not containing "
8107 "enclosing switch statement");
8109 error ("%<default%> label in statement expression not containing "
8110 "enclosing switch statement");
8112 else if (c_switch_stack && c_switch_stack->blocked_vm)
8115 error ("case label in scope of identifier with variably modified "
8116 "type not containing enclosing switch statement");
8118 error ("%<default%> label in scope of identifier with variably "
8119 "modified type not containing enclosing switch statement");
8122 error ("case label not within a switch statement");
8124 error ("%<default%> label not within a switch statement");
8129 /* Finish the switch statement. */
8132 c_finish_case (tree body)
8134 struct c_switch *cs = c_switch_stack;
8135 location_t switch_location;
8137 SWITCH_BODY (cs->switch_expr) = body;
8139 /* We must not be within a statement expression nested in the switch
8140 at this point; we might, however, be within the scope of an
8141 identifier with variably modified type nested in the switch. */
8142 gcc_assert (!cs->blocked_stmt_expr);
8144 /* Emit warnings as needed. */
8145 if (EXPR_HAS_LOCATION (cs->switch_expr))
8146 switch_location = EXPR_LOCATION (cs->switch_expr);
8148 switch_location = input_location;
8149 c_do_switch_warnings (cs->cases, switch_location,
8150 TREE_TYPE (cs->switch_expr),
8151 SWITCH_COND (cs->switch_expr));
8153 /* Pop the stack. */
8154 c_switch_stack = cs->next;
8155 splay_tree_delete (cs->cases);
8159 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
8160 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
8161 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
8162 statement, and was not surrounded with parenthesis. */
8165 c_finish_if_stmt (location_t if_locus, tree cond, tree then_block,
8166 tree else_block, bool nested_if)
8170 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
8171 if (warn_parentheses && nested_if && else_block == NULL)
8173 tree inner_if = then_block;
8175 /* We know from the grammar productions that there is an IF nested
8176 within THEN_BLOCK. Due to labels and c99 conditional declarations,
8177 it might not be exactly THEN_BLOCK, but should be the last
8178 non-container statement within. */
8180 switch (TREE_CODE (inner_if))
8185 inner_if = BIND_EXPR_BODY (inner_if);
8187 case STATEMENT_LIST:
8188 inner_if = expr_last (then_block);
8190 case TRY_FINALLY_EXPR:
8191 case TRY_CATCH_EXPR:
8192 inner_if = TREE_OPERAND (inner_if, 0);
8199 if (COND_EXPR_ELSE (inner_if))
8200 warning (OPT_Wparentheses,
8201 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
8205 stmt = build3 (COND_EXPR, void_type_node, cond, then_block, else_block);
8206 SET_EXPR_LOCATION (stmt, if_locus);
8210 /* Emit a general-purpose loop construct. START_LOCUS is the location of
8211 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
8212 is false for DO loops. INCR is the FOR increment expression. BODY is
8213 the statement controlled by the loop. BLAB is the break label. CLAB is
8214 the continue label. Everything is allowed to be NULL. */
8217 c_finish_loop (location_t start_locus, tree cond, tree incr, tree body,
8218 tree blab, tree clab, bool cond_is_first)
8220 tree entry = NULL, exit = NULL, t;
8222 /* If the condition is zero don't generate a loop construct. */
8223 if (cond && integer_zerop (cond))
8227 t = build_and_jump (&blab);
8228 SET_EXPR_LOCATION (t, start_locus);
8234 tree top = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
8236 /* If we have an exit condition, then we build an IF with gotos either
8237 out of the loop, or to the top of it. If there's no exit condition,
8238 then we just build a jump back to the top. */
8239 exit = build_and_jump (&LABEL_EXPR_LABEL (top));
8241 if (cond && !integer_nonzerop (cond))
8243 /* Canonicalize the loop condition to the end. This means
8244 generating a branch to the loop condition. Reuse the
8245 continue label, if possible. */
8250 entry = build1 (LABEL_EXPR, void_type_node, NULL_TREE);
8251 t = build_and_jump (&LABEL_EXPR_LABEL (entry));
8254 t = build1 (GOTO_EXPR, void_type_node, clab);
8255 SET_EXPR_LOCATION (t, start_locus);
8259 t = build_and_jump (&blab);
8260 exit = fold_build3 (COND_EXPR, void_type_node, cond, exit, t);
8262 SET_EXPR_LOCATION (exit, start_locus);
8264 SET_EXPR_LOCATION (exit, input_location);
8273 add_stmt (build1 (LABEL_EXPR, void_type_node, clab));
8281 add_stmt (build1 (LABEL_EXPR, void_type_node, blab));
8285 c_finish_bc_stmt (tree *label_p, bool is_break)
8288 tree label = *label_p;
8290 /* In switch statements break is sometimes stylistically used after
8291 a return statement. This can lead to spurious warnings about
8292 control reaching the end of a non-void function when it is
8293 inlined. Note that we are calling block_may_fallthru with
8294 language specific tree nodes; this works because
8295 block_may_fallthru returns true when given something it does not
8297 skip = !block_may_fallthru (cur_stmt_list);
8302 *label_p = label = create_artificial_label ();
8304 else if (TREE_CODE (label) == LABEL_DECL)
8306 else switch (TREE_INT_CST_LOW (label))
8310 error ("break statement not within loop or switch");
8312 error ("continue statement not within a loop");
8316 gcc_assert (is_break);
8317 error ("break statement used with OpenMP for loop");
8328 add_stmt (build_predict_expr (PRED_CONTINUE, NOT_TAKEN));
8330 return add_stmt (build1 (GOTO_EXPR, void_type_node, label));
8333 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
8336 emit_side_effect_warnings (tree expr)
8338 if (expr == error_mark_node)
8340 else if (!TREE_SIDE_EFFECTS (expr))
8342 if (!VOID_TYPE_P (TREE_TYPE (expr)) && !TREE_NO_WARNING (expr))
8343 warning (OPT_Wunused_value, "%Hstatement with no effect",
8344 EXPR_HAS_LOCATION (expr) ? EXPR_LOCUS (expr) : &input_location);
8347 warn_if_unused_value (expr, input_location);
8350 /* Process an expression as if it were a complete statement. Emit
8351 diagnostics, but do not call ADD_STMT. */
8354 c_process_expr_stmt (tree expr)
8359 expr = c_fully_fold (expr, false, NULL);
8361 if (warn_sequence_point)
8362 verify_sequence_points (expr);
8364 if (TREE_TYPE (expr) != error_mark_node
8365 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr))
8366 && TREE_CODE (TREE_TYPE (expr)) != ARRAY_TYPE)
8367 error ("expression statement has incomplete type");
8369 /* If we're not processing a statement expression, warn about unused values.
8370 Warnings for statement expressions will be emitted later, once we figure
8371 out which is the result. */
8372 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
8373 && warn_unused_value)
8374 emit_side_effect_warnings (expr);
8376 /* If the expression is not of a type to which we cannot assign a line
8377 number, wrap the thing in a no-op NOP_EXPR. */
8378 if (DECL_P (expr) || CONSTANT_CLASS_P (expr))
8379 expr = build1 (NOP_EXPR, TREE_TYPE (expr), expr);
8381 if (CAN_HAVE_LOCATION_P (expr))
8382 SET_EXPR_LOCATION (expr, input_location);
8387 /* Emit an expression as a statement. */
8390 c_finish_expr_stmt (tree expr)
8393 return add_stmt (c_process_expr_stmt (expr));
8398 /* Do the opposite and emit a statement as an expression. To begin,
8399 create a new binding level and return it. */
8402 c_begin_stmt_expr (void)
8405 struct c_label_context_se *nstack;
8406 struct c_label_list *glist;
8408 /* We must force a BLOCK for this level so that, if it is not expanded
8409 later, there is a way to turn off the entire subtree of blocks that
8410 are contained in it. */
8412 ret = c_begin_compound_stmt (true);
8415 c_switch_stack->blocked_stmt_expr++;
8416 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
8418 for (glist = label_context_stack_se->labels_used;
8420 glist = glist->next)
8422 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 1;
8424 nstack = XOBNEW (&parser_obstack, struct c_label_context_se);
8425 nstack->labels_def = NULL;
8426 nstack->labels_used = NULL;
8427 nstack->next = label_context_stack_se;
8428 label_context_stack_se = nstack;
8430 /* Mark the current statement list as belonging to a statement list. */
8431 STATEMENT_LIST_STMT_EXPR (ret) = 1;
8437 c_finish_stmt_expr (tree body)
8439 tree last, type, tmp, val;
8441 struct c_label_list *dlist, *glist, *glist_prev = NULL;
8443 body = c_end_compound_stmt (body, true);
8446 gcc_assert (c_switch_stack->blocked_stmt_expr != 0);
8447 c_switch_stack->blocked_stmt_expr--;
8449 /* It is no longer possible to jump to labels defined within this
8450 statement expression. */
8451 for (dlist = label_context_stack_se->labels_def;
8453 dlist = dlist->next)
8455 C_DECL_UNJUMPABLE_STMT_EXPR (dlist->label) = 1;
8457 /* It is again possible to define labels with a goto just outside
8458 this statement expression. */
8459 for (glist = label_context_stack_se->next->labels_used;
8461 glist = glist->next)
8463 C_DECL_UNDEFINABLE_STMT_EXPR (glist->label) = 0;
8466 if (glist_prev != NULL)
8467 glist_prev->next = label_context_stack_se->labels_used;
8469 label_context_stack_se->next->labels_used
8470 = label_context_stack_se->labels_used;
8471 label_context_stack_se = label_context_stack_se->next;
8473 /* Locate the last statement in BODY. See c_end_compound_stmt
8474 about always returning a BIND_EXPR. */
8475 last_p = &BIND_EXPR_BODY (body);
8476 last = BIND_EXPR_BODY (body);
8479 if (TREE_CODE (last) == STATEMENT_LIST)
8481 tree_stmt_iterator i;
8483 /* This can happen with degenerate cases like ({ }). No value. */
8484 if (!TREE_SIDE_EFFECTS (last))
8487 /* If we're supposed to generate side effects warnings, process
8488 all of the statements except the last. */
8489 if (warn_unused_value)
8491 for (i = tsi_start (last); !tsi_one_before_end_p (i); tsi_next (&i))
8492 emit_side_effect_warnings (tsi_stmt (i));
8495 i = tsi_last (last);
8496 last_p = tsi_stmt_ptr (i);
8500 /* If the end of the list is exception related, then the list was split
8501 by a call to push_cleanup. Continue searching. */
8502 if (TREE_CODE (last) == TRY_FINALLY_EXPR
8503 || TREE_CODE (last) == TRY_CATCH_EXPR)
8505 last_p = &TREE_OPERAND (last, 0);
8507 goto continue_searching;
8510 /* In the case that the BIND_EXPR is not necessary, return the
8511 expression out from inside it. */
8512 if (last == error_mark_node
8513 || (last == BIND_EXPR_BODY (body)
8514 && BIND_EXPR_VARS (body) == NULL))
8516 /* Even if this looks constant, do not allow it in a constant
8518 last = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (last), NULL_TREE, last);
8519 C_MAYBE_CONST_EXPR_NON_CONST (last) = 1;
8520 /* Do not warn if the return value of a statement expression is
8522 TREE_NO_WARNING (last) = 1;
8526 /* Extract the type of said expression. */
8527 type = TREE_TYPE (last);
8529 /* If we're not returning a value at all, then the BIND_EXPR that
8530 we already have is a fine expression to return. */
8531 if (!type || VOID_TYPE_P (type))
8534 /* Now that we've located the expression containing the value, it seems
8535 silly to make voidify_wrapper_expr repeat the process. Create a
8536 temporary of the appropriate type and stick it in a TARGET_EXPR. */
8537 tmp = create_tmp_var_raw (type, NULL);
8539 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
8540 tree_expr_nonnegative_p giving up immediately. */
8542 if (TREE_CODE (val) == NOP_EXPR
8543 && TREE_TYPE (val) == TREE_TYPE (TREE_OPERAND (val, 0)))
8544 val = TREE_OPERAND (val, 0);
8546 *last_p = build2 (MODIFY_EXPR, void_type_node, tmp, val);
8547 SET_EXPR_LOCUS (*last_p, EXPR_LOCUS (last));
8549 return build4 (TARGET_EXPR, type, tmp, body, NULL_TREE, NULL_TREE);
8552 /* Begin the scope of an identifier of variably modified type, scope
8553 number SCOPE. Jumping from outside this scope to inside it is not
8557 c_begin_vm_scope (unsigned int scope)
8559 struct c_label_context_vm *nstack;
8560 struct c_label_list *glist;
8562 gcc_assert (scope > 0);
8564 /* At file_scope, we don't have to do any processing. */
8565 if (label_context_stack_vm == NULL)
8568 if (c_switch_stack && !c_switch_stack->blocked_vm)
8569 c_switch_stack->blocked_vm = scope;
8570 for (glist = label_context_stack_vm->labels_used;
8572 glist = glist->next)
8574 C_DECL_UNDEFINABLE_VM (glist->label) = 1;
8576 nstack = XOBNEW (&parser_obstack, struct c_label_context_vm);
8577 nstack->labels_def = NULL;
8578 nstack->labels_used = NULL;
8579 nstack->scope = scope;
8580 nstack->next = label_context_stack_vm;
8581 label_context_stack_vm = nstack;
8584 /* End a scope which may contain identifiers of variably modified
8585 type, scope number SCOPE. */
8588 c_end_vm_scope (unsigned int scope)
8590 if (label_context_stack_vm == NULL)
8592 if (c_switch_stack && c_switch_stack->blocked_vm == scope)
8593 c_switch_stack->blocked_vm = 0;
8594 /* We may have a number of nested scopes of identifiers with
8595 variably modified type, all at this depth. Pop each in turn. */
8596 while (label_context_stack_vm->scope == scope)
8598 struct c_label_list *dlist, *glist, *glist_prev = NULL;
8600 /* It is no longer possible to jump to labels defined within this
8602 for (dlist = label_context_stack_vm->labels_def;
8604 dlist = dlist->next)
8606 C_DECL_UNJUMPABLE_VM (dlist->label) = 1;
8608 /* It is again possible to define labels with a goto just outside
8610 for (glist = label_context_stack_vm->next->labels_used;
8612 glist = glist->next)
8614 C_DECL_UNDEFINABLE_VM (glist->label) = 0;
8617 if (glist_prev != NULL)
8618 glist_prev->next = label_context_stack_vm->labels_used;
8620 label_context_stack_vm->next->labels_used
8621 = label_context_stack_vm->labels_used;
8622 label_context_stack_vm = label_context_stack_vm->next;
8626 /* Begin and end compound statements. This is as simple as pushing
8627 and popping new statement lists from the tree. */
8630 c_begin_compound_stmt (bool do_scope)
8632 tree stmt = push_stmt_list ();
8639 c_end_compound_stmt (tree stmt, bool do_scope)
8645 if (c_dialect_objc ())
8646 objc_clear_super_receiver ();
8647 block = pop_scope ();
8650 stmt = pop_stmt_list (stmt);
8651 stmt = c_build_bind_expr (block, stmt);
8653 /* If this compound statement is nested immediately inside a statement
8654 expression, then force a BIND_EXPR to be created. Otherwise we'll
8655 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
8656 STATEMENT_LISTs merge, and thus we can lose track of what statement
8659 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list)
8660 && TREE_CODE (stmt) != BIND_EXPR)
8662 stmt = build3 (BIND_EXPR, void_type_node, NULL, stmt, NULL);
8663 TREE_SIDE_EFFECTS (stmt) = 1;
8669 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
8670 when the current scope is exited. EH_ONLY is true when this is not
8671 meant to apply to normal control flow transfer. */
8674 push_cleanup (tree ARG_UNUSED (decl), tree cleanup, bool eh_only)
8676 enum tree_code code;
8680 code = eh_only ? TRY_CATCH_EXPR : TRY_FINALLY_EXPR;
8681 stmt = build_stmt (code, NULL, cleanup);
8683 stmt_expr = STATEMENT_LIST_STMT_EXPR (cur_stmt_list);
8684 list = push_stmt_list ();
8685 TREE_OPERAND (stmt, 0) = list;
8686 STATEMENT_LIST_STMT_EXPR (list) = stmt_expr;
8689 /* Build a binary-operation expression without default conversions.
8690 CODE is the kind of expression to build.
8691 LOCATION is the operator's location.
8692 This function differs from `build' in several ways:
8693 the data type of the result is computed and recorded in it,
8694 warnings are generated if arg data types are invalid,
8695 special handling for addition and subtraction of pointers is known,
8696 and some optimization is done (operations on narrow ints
8697 are done in the narrower type when that gives the same result).
8698 Constant folding is also done before the result is returned.
8700 Note that the operands will never have enumeral types, or function
8701 or array types, because either they will have the default conversions
8702 performed or they have both just been converted to some other type in which
8703 the arithmetic is to be done. */
8706 build_binary_op (location_t location, enum tree_code code,
8707 tree orig_op0, tree orig_op1, int convert_p)
8709 tree type0, type1, orig_type0, orig_type1;
8711 enum tree_code code0, code1;
8713 tree ret = error_mark_node;
8714 const char *invalid_op_diag;
8715 bool op0_int_operands, op1_int_operands;
8716 bool int_const, int_const_or_overflow, int_operands;
8718 /* Expression code to give to the expression when it is built.
8719 Normally this is CODE, which is what the caller asked for,
8720 but in some special cases we change it. */
8721 enum tree_code resultcode = code;
8723 /* Data type in which the computation is to be performed.
8724 In the simplest cases this is the common type of the arguments. */
8725 tree result_type = NULL;
8727 /* When the computation is in excess precision, the type of the
8728 final EXCESS_PRECISION_EXPR. */
8729 tree real_result_type = NULL;
8731 /* Nonzero means operands have already been type-converted
8732 in whatever way is necessary.
8733 Zero means they need to be converted to RESULT_TYPE. */
8736 /* Nonzero means create the expression with this type, rather than
8738 tree build_type = 0;
8740 /* Nonzero means after finally constructing the expression
8741 convert it to this type. */
8742 tree final_type = 0;
8744 /* Nonzero if this is an operation like MIN or MAX which can
8745 safely be computed in short if both args are promoted shorts.
8746 Also implies COMMON.
8747 -1 indicates a bitwise operation; this makes a difference
8748 in the exact conditions for when it is safe to do the operation
8749 in a narrower mode. */
8752 /* Nonzero if this is a comparison operation;
8753 if both args are promoted shorts, compare the original shorts.
8754 Also implies COMMON. */
8755 int short_compare = 0;
8757 /* Nonzero if this is a right-shift operation, which can be computed on the
8758 original short and then promoted if the operand is a promoted short. */
8759 int short_shift = 0;
8761 /* Nonzero means set RESULT_TYPE to the common type of the args. */
8764 /* True means types are compatible as far as ObjC is concerned. */
8767 /* True means this is an arithmetic operation that may need excess
8769 bool may_need_excess_precision;
8771 if (location == UNKNOWN_LOCATION)
8772 location = input_location;
8777 op0_int_operands = EXPR_INT_CONST_OPERANDS (orig_op0);
8778 if (op0_int_operands)
8779 op0 = remove_c_maybe_const_expr (op0);
8780 op1_int_operands = EXPR_INT_CONST_OPERANDS (orig_op1);
8781 if (op1_int_operands)
8782 op1 = remove_c_maybe_const_expr (op1);
8783 int_operands = (op0_int_operands && op1_int_operands);
8786 int_const_or_overflow = (TREE_CODE (orig_op0) == INTEGER_CST
8787 && TREE_CODE (orig_op1) == INTEGER_CST);
8788 int_const = (int_const_or_overflow
8789 && !TREE_OVERFLOW (orig_op0)
8790 && !TREE_OVERFLOW (orig_op1));
8793 int_const = int_const_or_overflow = false;
8797 op0 = default_conversion (op0);
8798 op1 = default_conversion (op1);
8801 orig_type0 = type0 = TREE_TYPE (op0);
8802 orig_type1 = type1 = TREE_TYPE (op1);
8804 /* The expression codes of the data types of the arguments tell us
8805 whether the arguments are integers, floating, pointers, etc. */
8806 code0 = TREE_CODE (type0);
8807 code1 = TREE_CODE (type1);
8809 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
8810 STRIP_TYPE_NOPS (op0);
8811 STRIP_TYPE_NOPS (op1);
8813 /* If an error was already reported for one of the arguments,
8814 avoid reporting another error. */
8816 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
8817 return error_mark_node;
8819 if ((invalid_op_diag
8820 = targetm.invalid_binary_op (code, type0, type1)))
8822 error_at (location, invalid_op_diag);
8823 return error_mark_node;
8831 case TRUNC_DIV_EXPR:
8833 case FLOOR_DIV_EXPR:
8834 case ROUND_DIV_EXPR:
8835 case EXACT_DIV_EXPR:
8836 may_need_excess_precision = true;
8839 may_need_excess_precision = false;
8842 if (TREE_CODE (op0) == EXCESS_PRECISION_EXPR)
8844 op0 = TREE_OPERAND (op0, 0);
8845 type0 = TREE_TYPE (op0);
8847 else if (may_need_excess_precision
8848 && (eptype = excess_precision_type (type0)) != NULL_TREE)
8851 op0 = convert (eptype, op0);
8853 if (TREE_CODE (op1) == EXCESS_PRECISION_EXPR)
8855 op1 = TREE_OPERAND (op1, 0);
8856 type1 = TREE_TYPE (op1);
8858 else if (may_need_excess_precision
8859 && (eptype = excess_precision_type (type1)) != NULL_TREE)
8862 op1 = convert (eptype, op1);
8865 objc_ok = objc_compare_types (type0, type1, -3, NULL_TREE);
8870 /* Handle the pointer + int case. */
8871 if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8873 ret = pointer_int_sum (location, PLUS_EXPR, op0, op1);
8874 goto return_build_binary_op;
8876 else if (code1 == POINTER_TYPE && code0 == INTEGER_TYPE)
8878 ret = pointer_int_sum (location, PLUS_EXPR, op1, op0);
8879 goto return_build_binary_op;
8886 /* Subtraction of two similar pointers.
8887 We must subtract them as integers, then divide by object size. */
8888 if (code0 == POINTER_TYPE && code1 == POINTER_TYPE
8889 && comp_target_types (type0, type1))
8891 ret = pointer_diff (op0, op1);
8892 goto return_build_binary_op;
8894 /* Handle pointer minus int. Just like pointer plus int. */
8895 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
8897 ret = pointer_int_sum (location, MINUS_EXPR, op0, op1);
8898 goto return_build_binary_op;
8908 case TRUNC_DIV_EXPR:
8910 case FLOOR_DIV_EXPR:
8911 case ROUND_DIV_EXPR:
8912 case EXACT_DIV_EXPR:
8913 warn_for_div_by_zero (location, op1);
8915 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
8916 || code0 == FIXED_POINT_TYPE
8917 || code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8918 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
8919 || code1 == FIXED_POINT_TYPE
8920 || code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE))
8922 enum tree_code tcode0 = code0, tcode1 = code1;
8924 if (code0 == COMPLEX_TYPE || code0 == VECTOR_TYPE)
8925 tcode0 = TREE_CODE (TREE_TYPE (TREE_TYPE (op0)));
8926 if (code1 == COMPLEX_TYPE || code1 == VECTOR_TYPE)
8927 tcode1 = TREE_CODE (TREE_TYPE (TREE_TYPE (op1)));
8929 if (!((tcode0 == INTEGER_TYPE && tcode1 == INTEGER_TYPE)
8930 || (tcode0 == FIXED_POINT_TYPE && tcode1 == FIXED_POINT_TYPE)))
8931 resultcode = RDIV_EXPR;
8933 /* Although it would be tempting to shorten always here, that
8934 loses on some targets, since the modulo instruction is
8935 undefined if the quotient can't be represented in the
8936 computation mode. We shorten only if unsigned or if
8937 dividing by something we know != -1. */
8938 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8939 || (TREE_CODE (op1) == INTEGER_CST
8940 && !integer_all_onesp (op1)));
8948 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8950 /* Allow vector types which are not floating point types. */
8951 else if (code0 == VECTOR_TYPE
8952 && code1 == VECTOR_TYPE
8953 && !VECTOR_FLOAT_TYPE_P (type0)
8954 && !VECTOR_FLOAT_TYPE_P (type1))
8958 case TRUNC_MOD_EXPR:
8959 case FLOOR_MOD_EXPR:
8960 warn_for_div_by_zero (location, op1);
8962 if (code0 == INTEGER_TYPE && code1 == INTEGER_TYPE)
8964 /* Although it would be tempting to shorten always here, that loses
8965 on some targets, since the modulo instruction is undefined if the
8966 quotient can't be represented in the computation mode. We shorten
8967 only if unsigned or if dividing by something we know != -1. */
8968 shorten = (TYPE_UNSIGNED (TREE_TYPE (orig_op0))
8969 || (TREE_CODE (op1) == INTEGER_CST
8970 && !integer_all_onesp (op1)));
8975 case TRUTH_ANDIF_EXPR:
8976 case TRUTH_ORIF_EXPR:
8977 case TRUTH_AND_EXPR:
8979 case TRUTH_XOR_EXPR:
8980 if ((code0 == INTEGER_TYPE || code0 == POINTER_TYPE
8981 || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
8982 || code0 == FIXED_POINT_TYPE)
8983 && (code1 == INTEGER_TYPE || code1 == POINTER_TYPE
8984 || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
8985 || code1 == FIXED_POINT_TYPE))
8987 /* Result of these operations is always an int,
8988 but that does not mean the operands should be
8989 converted to ints! */
8990 result_type = integer_type_node;
8991 op0 = c_common_truthvalue_conversion (location, op0);
8992 op1 = c_common_truthvalue_conversion (location, op1);
8995 if (code == TRUTH_ANDIF_EXPR)
8997 int_const_or_overflow = (int_operands
8998 && TREE_CODE (orig_op0) == INTEGER_CST
8999 && (op0 == truthvalue_false_node
9000 || TREE_CODE (orig_op1) == INTEGER_CST));
9001 int_const = (int_const_or_overflow
9002 && !TREE_OVERFLOW (orig_op0)
9003 && (op0 == truthvalue_false_node
9004 || !TREE_OVERFLOW (orig_op1)));
9006 else if (code == TRUTH_ORIF_EXPR)
9008 int_const_or_overflow = (int_operands
9009 && TREE_CODE (orig_op0) == INTEGER_CST
9010 && (op0 == truthvalue_true_node
9011 || TREE_CODE (orig_op1) == INTEGER_CST));
9012 int_const = (int_const_or_overflow
9013 && !TREE_OVERFLOW (orig_op0)
9014 && (op0 == truthvalue_true_node
9015 || !TREE_OVERFLOW (orig_op1)));
9019 /* Shift operations: result has same type as first operand;
9020 always convert second operand to int.
9021 Also set SHORT_SHIFT if shifting rightward. */
9024 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
9025 && code1 == INTEGER_TYPE)
9027 if (TREE_CODE (op1) == INTEGER_CST)
9029 if (tree_int_cst_sgn (op1) < 0)
9032 if (skip_evaluation == 0)
9033 warning (0, "right shift count is negative");
9037 if (!integer_zerop (op1))
9040 if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
9043 if (skip_evaluation == 0)
9044 warning (0, "right shift count >= width of type");
9049 /* Use the type of the value to be shifted. */
9050 result_type = type0;
9051 /* Convert the shift-count to an integer, regardless of size
9052 of value being shifted. */
9053 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
9054 op1 = convert (integer_type_node, op1);
9055 /* Avoid converting op1 to result_type later. */
9061 if ((code0 == INTEGER_TYPE || code0 == FIXED_POINT_TYPE)
9062 && code1 == INTEGER_TYPE)
9064 if (TREE_CODE (op1) == INTEGER_CST)
9066 if (tree_int_cst_sgn (op1) < 0)
9069 if (skip_evaluation == 0)
9070 warning (0, "left shift count is negative");
9073 else if (compare_tree_int (op1, TYPE_PRECISION (type0)) >= 0)
9076 if (skip_evaluation == 0)
9077 warning (0, "left shift count >= width of type");
9081 /* Use the type of the value to be shifted. */
9082 result_type = type0;
9083 /* Convert the shift-count to an integer, regardless of size
9084 of value being shifted. */
9085 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1)) != integer_type_node)
9086 op1 = convert (integer_type_node, op1);
9087 /* Avoid converting op1 to result_type later. */
9094 if (FLOAT_TYPE_P (type0) || FLOAT_TYPE_P (type1))
9095 warning_at (location,
9097 "comparing floating point with == or != is unsafe");
9098 /* Result of comparison is always int,
9099 but don't convert the args to int! */
9100 build_type = integer_type_node;
9101 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
9102 || code0 == FIXED_POINT_TYPE || code0 == COMPLEX_TYPE)
9103 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
9104 || code1 == FIXED_POINT_TYPE || code1 == COMPLEX_TYPE))
9106 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
9108 tree tt0 = TREE_TYPE (type0);
9109 tree tt1 = TREE_TYPE (type1);
9110 /* Anything compares with void *. void * compares with anything.
9111 Otherwise, the targets must be compatible
9112 and both must be object or both incomplete. */
9113 if (comp_target_types (type0, type1))
9114 result_type = common_pointer_type (type0, type1);
9115 else if (VOID_TYPE_P (tt0))
9117 /* op0 != orig_op0 detects the case of something
9118 whose value is 0 but which isn't a valid null ptr const. */
9119 if (pedantic && !null_pointer_constant_p (orig_op0)
9120 && TREE_CODE (tt1) == FUNCTION_TYPE)
9121 pedwarn (location, OPT_pedantic, "ISO C forbids "
9122 "comparison of %<void *%> with function pointer");
9124 else if (VOID_TYPE_P (tt1))
9126 if (pedantic && !null_pointer_constant_p (orig_op1)
9127 && TREE_CODE (tt0) == FUNCTION_TYPE)
9128 pedwarn (location, OPT_pedantic, "ISO C forbids "
9129 "comparison of %<void *%> with function pointer");
9132 /* Avoid warning about the volatile ObjC EH puts on decls. */
9134 pedwarn (location, 0,
9135 "comparison of distinct pointer types lacks a cast");
9137 if (result_type == NULL_TREE)
9138 result_type = ptr_type_node;
9140 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
9142 if (TREE_CODE (op0) == ADDR_EXPR
9143 && decl_with_nonnull_addr_p (TREE_OPERAND (op0, 0)))
9144 warning_at (location,
9145 OPT_Waddress, "the address of %qD will never be NULL",
9146 TREE_OPERAND (op0, 0));
9147 result_type = type0;
9149 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
9151 if (TREE_CODE (op1) == ADDR_EXPR
9152 && decl_with_nonnull_addr_p (TREE_OPERAND (op1, 0)))
9153 warning_at (location,
9154 OPT_Waddress, "the address of %qD will never be NULL",
9155 TREE_OPERAND (op1, 0));
9156 result_type = type1;
9158 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
9160 result_type = type0;
9161 pedwarn (location, 0, "comparison between pointer and integer");
9163 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
9165 result_type = type1;
9166 pedwarn (location, 0, "comparison between pointer and integer");
9174 build_type = integer_type_node;
9175 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE
9176 || code0 == FIXED_POINT_TYPE)
9177 && (code1 == INTEGER_TYPE || code1 == REAL_TYPE
9178 || code1 == FIXED_POINT_TYPE))
9180 else if (code0 == POINTER_TYPE && code1 == POINTER_TYPE)
9182 if (comp_target_types (type0, type1))
9184 result_type = common_pointer_type (type0, type1);
9185 if (!COMPLETE_TYPE_P (TREE_TYPE (type0))
9186 != !COMPLETE_TYPE_P (TREE_TYPE (type1)))
9187 pedwarn (location, 0,
9188 "comparison of complete and incomplete pointers");
9189 else if (TREE_CODE (TREE_TYPE (type0)) == FUNCTION_TYPE)
9190 pedwarn (location, OPT_pedantic, "ISO C forbids "
9191 "ordered comparisons of pointers to functions");
9195 result_type = ptr_type_node;
9196 pedwarn (location, 0,
9197 "comparison of distinct pointer types lacks a cast");
9200 else if (code0 == POINTER_TYPE && null_pointer_constant_p (orig_op1))
9202 result_type = type0;
9204 pedwarn (location, OPT_pedantic,
9205 "ordered comparison of pointer with integer zero");
9206 else if (extra_warnings)
9207 warning_at (location, OPT_Wextra,
9208 "ordered comparison of pointer with integer zero");
9210 else if (code1 == POINTER_TYPE && null_pointer_constant_p (orig_op0))
9212 result_type = type1;
9213 pedwarn (location, OPT_pedantic,
9214 "ordered comparison of pointer with integer zero");
9216 else if (code0 == POINTER_TYPE && code1 == INTEGER_TYPE)
9218 result_type = type0;
9219 pedwarn (location, 0, "comparison between pointer and integer");
9221 else if (code0 == INTEGER_TYPE && code1 == POINTER_TYPE)
9223 result_type = type1;
9224 pedwarn (location, 0, "comparison between pointer and integer");
9232 if (code0 == ERROR_MARK || code1 == ERROR_MARK)
9233 return error_mark_node;
9235 if (code0 == VECTOR_TYPE && code1 == VECTOR_TYPE
9236 && (!tree_int_cst_equal (TYPE_SIZE (type0), TYPE_SIZE (type1))
9237 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0),
9238 TREE_TYPE (type1))))
9240 binary_op_error (location, code, type0, type1);
9241 return error_mark_node;
9244 if ((code0 == INTEGER_TYPE || code0 == REAL_TYPE || code0 == COMPLEX_TYPE
9245 || code0 == FIXED_POINT_TYPE || code0 == VECTOR_TYPE)
9247 (code1 == INTEGER_TYPE || code1 == REAL_TYPE || code1 == COMPLEX_TYPE
9248 || code1 == FIXED_POINT_TYPE || code1 == VECTOR_TYPE))
9250 int none_complex = (code0 != COMPLEX_TYPE && code1 != COMPLEX_TYPE);
9252 if (shorten || common || short_compare)
9254 result_type = c_common_type (type0, type1);
9255 if (result_type == error_mark_node)
9256 return error_mark_node;
9259 /* For certain operations (which identify themselves by shorten != 0)
9260 if both args were extended from the same smaller type,
9261 do the arithmetic in that type and then extend.
9263 shorten !=0 and !=1 indicates a bitwise operation.
9264 For them, this optimization is safe only if
9265 both args are zero-extended or both are sign-extended.
9266 Otherwise, we might change the result.
9267 Eg, (short)-1 | (unsigned short)-1 is (int)-1
9268 but calculated in (unsigned short) it would be (unsigned short)-1. */
9270 if (shorten && none_complex)
9272 final_type = result_type;
9273 result_type = shorten_binary_op (result_type, op0, op1,
9277 /* Shifts can be shortened if shifting right. */
9282 tree arg0 = get_narrower (op0, &unsigned_arg);
9284 final_type = result_type;
9286 if (arg0 == op0 && final_type == TREE_TYPE (op0))
9287 unsigned_arg = TYPE_UNSIGNED (TREE_TYPE (op0));
9289 if (TYPE_PRECISION (TREE_TYPE (arg0)) < TYPE_PRECISION (result_type)
9290 /* We can shorten only if the shift count is less than the
9291 number of bits in the smaller type size. */
9292 && compare_tree_int (op1, TYPE_PRECISION (TREE_TYPE (arg0))) < 0
9293 /* We cannot drop an unsigned shift after sign-extension. */
9294 && (!TYPE_UNSIGNED (final_type) || unsigned_arg))
9296 /* Do an unsigned shift if the operand was zero-extended. */
9298 = c_common_signed_or_unsigned_type (unsigned_arg,
9300 /* Convert value-to-be-shifted to that type. */
9301 if (TREE_TYPE (op0) != result_type)
9302 op0 = convert (result_type, op0);
9307 /* Comparison operations are shortened too but differently.
9308 They identify themselves by setting short_compare = 1. */
9312 /* Don't write &op0, etc., because that would prevent op0
9313 from being kept in a register.
9314 Instead, make copies of the our local variables and
9315 pass the copies by reference, then copy them back afterward. */
9316 tree xop0 = op0, xop1 = op1, xresult_type = result_type;
9317 enum tree_code xresultcode = resultcode;
9319 = shorten_compare (&xop0, &xop1, &xresult_type, &xresultcode);
9324 goto return_build_binary_op;
9327 op0 = xop0, op1 = xop1;
9329 resultcode = xresultcode;
9331 if (!skip_evaluation)
9333 bool op0_maybe_const = true;
9334 bool op1_maybe_const = true;
9335 tree orig_op0_folded, orig_op1_folded;
9337 if (in_late_binary_op)
9339 orig_op0_folded = orig_op0;
9340 orig_op1_folded = orig_op1;
9344 /* Fold for the sake of possible warnings, as in
9345 build_conditional_expr. This requires the
9346 "original" values to be folded, not just op0 and
9348 op0 = c_fully_fold (op0, require_constant_value,
9350 op1 = c_fully_fold (op1, require_constant_value,
9352 orig_op0_folded = c_fully_fold (orig_op0,
9353 require_constant_value,
9355 orig_op1_folded = c_fully_fold (orig_op1,
9356 require_constant_value,
9360 if (warn_sign_compare)
9361 warn_for_sign_compare (location, orig_op0_folded,
9362 orig_op1_folded, op0, op1,
9363 result_type, resultcode);
9364 if (!in_late_binary_op)
9366 if (!op0_maybe_const || TREE_CODE (op0) != INTEGER_CST)
9368 op0 = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (op0),
9370 C_MAYBE_CONST_EXPR_NON_CONST (op0) = !op0_maybe_const;
9372 if (!op1_maybe_const || TREE_CODE (op1) != INTEGER_CST)
9374 op1 = build2 (C_MAYBE_CONST_EXPR, TREE_TYPE (op1),
9376 C_MAYBE_CONST_EXPR_NON_CONST (op1) = !op1_maybe_const;
9383 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
9384 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
9385 Then the expression will be built.
9386 It will be given type FINAL_TYPE if that is nonzero;
9387 otherwise, it will be given type RESULT_TYPE. */
9391 binary_op_error (location, code, TREE_TYPE (op0), TREE_TYPE (op1));
9392 return error_mark_node;
9397 if (TREE_TYPE (op0) != result_type)
9398 op0 = convert_and_check (result_type, op0);
9399 if (TREE_TYPE (op1) != result_type)
9400 op1 = convert_and_check (result_type, op1);
9402 /* This can happen if one operand has a vector type, and the other
9403 has a different type. */
9404 if (TREE_CODE (op0) == ERROR_MARK || TREE_CODE (op1) == ERROR_MARK)
9405 return error_mark_node;
9408 if (build_type == NULL_TREE)
9410 build_type = result_type;
9411 if (type0 != orig_type0 || type1 != orig_type1)
9413 gcc_assert (may_need_excess_precision && common);
9414 real_result_type = c_common_type (orig_type0, orig_type1);
9418 /* Treat expressions in initializers specially as they can't trap. */
9419 if (int_const_or_overflow)
9420 ret = (require_constant_value
9421 ? fold_build2_initializer (resultcode, build_type, op0, op1)
9422 : fold_build2 (resultcode, build_type, op0, op1));
9424 ret = build2 (resultcode, build_type, op0, op1);
9425 if (final_type != 0)
9426 ret = convert (final_type, ret);
9428 return_build_binary_op:
9429 gcc_assert (ret != error_mark_node);
9430 if (TREE_CODE (ret) == INTEGER_CST && !TREE_OVERFLOW (ret) && !int_const)
9432 ? note_integer_operands (ret)
9433 : build1 (NOP_EXPR, TREE_TYPE (ret), ret));
9434 else if (TREE_CODE (ret) != INTEGER_CST && int_operands
9435 && !in_late_binary_op)
9436 ret = note_integer_operands (ret);
9437 if (real_result_type)
9438 ret = build1 (EXCESS_PRECISION_EXPR, real_result_type, ret);
9439 protected_set_expr_location (ret, location);
9444 /* Convert EXPR to be a truth-value, validating its type for this
9445 purpose. LOCATION is the source location for the expression. */
9448 c_objc_common_truthvalue_conversion (location_t location, tree expr)
9450 bool int_const, int_operands;
9452 switch (TREE_CODE (TREE_TYPE (expr)))
9455 error_at (location, "used array that cannot be converted to pointer where scalar is required");
9456 return error_mark_node;
9459 error_at (location, "used struct type value where scalar is required");
9460 return error_mark_node;
9463 error_at (location, "used union type value where scalar is required");
9464 return error_mark_node;
9473 int_const = (TREE_CODE (expr) == INTEGER_CST && !TREE_OVERFLOW (expr));
9474 int_operands = EXPR_INT_CONST_OPERANDS (expr);
9476 expr = remove_c_maybe_const_expr (expr);
9478 /* ??? Should we also give an error for void and vectors rather than
9479 leaving those to give errors later? */
9480 expr = c_common_truthvalue_conversion (location, expr);
9482 if (TREE_CODE (expr) == INTEGER_CST && int_operands && !int_const)
9484 if (TREE_OVERFLOW (expr))
9487 return note_integer_operands (expr);
9489 if (TREE_CODE (expr) == INTEGER_CST && !int_const)
9490 return build1 (NOP_EXPR, TREE_TYPE (expr), expr);
9495 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
9499 c_expr_to_decl (tree expr, bool *tc ATTRIBUTE_UNUSED, bool *se)
9501 if (TREE_CODE (expr) == COMPOUND_LITERAL_EXPR)
9503 tree decl = COMPOUND_LITERAL_EXPR_DECL (expr);
9504 /* Executing a compound literal inside a function reinitializes
9506 if (!TREE_STATIC (decl))
9514 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
9517 c_begin_omp_parallel (void)
9522 block = c_begin_compound_stmt (true);
9527 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound statement. */
9530 c_finish_omp_parallel (tree clauses, tree block)
9534 block = c_end_compound_stmt (block, true);
9536 stmt = make_node (OMP_PARALLEL);
9537 TREE_TYPE (stmt) = void_type_node;
9538 OMP_PARALLEL_CLAUSES (stmt) = clauses;
9539 OMP_PARALLEL_BODY (stmt) = block;
9541 return add_stmt (stmt);
9544 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
9547 c_begin_omp_task (void)
9552 block = c_begin_compound_stmt (true);
9557 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound statement. */
9560 c_finish_omp_task (tree clauses, tree block)
9564 block = c_end_compound_stmt (block, true);
9566 stmt = make_node (OMP_TASK);
9567 TREE_TYPE (stmt) = void_type_node;
9568 OMP_TASK_CLAUSES (stmt) = clauses;
9569 OMP_TASK_BODY (stmt) = block;
9571 return add_stmt (stmt);
9574 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
9575 Remove any elements from the list that are invalid. */
9578 c_finish_omp_clauses (tree clauses)
9580 bitmap_head generic_head, firstprivate_head, lastprivate_head;
9581 tree c, t, *pc = &clauses;
9584 bitmap_obstack_initialize (NULL);
9585 bitmap_initialize (&generic_head, &bitmap_default_obstack);
9586 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
9587 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
9589 for (pc = &clauses, c = clauses; c ; c = *pc)
9591 bool remove = false;
9592 bool need_complete = false;
9593 bool need_implicitly_determined = false;
9595 switch (OMP_CLAUSE_CODE (c))
9597 case OMP_CLAUSE_SHARED:
9599 need_implicitly_determined = true;
9600 goto check_dup_generic;
9602 case OMP_CLAUSE_PRIVATE:
9604 need_complete = true;
9605 need_implicitly_determined = true;
9606 goto check_dup_generic;
9608 case OMP_CLAUSE_REDUCTION:
9610 need_implicitly_determined = true;
9611 t = OMP_CLAUSE_DECL (c);
9612 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
9613 || POINTER_TYPE_P (TREE_TYPE (t)))
9615 error ("%qE has invalid type for %<reduction%>", t);
9618 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
9620 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
9621 const char *r_name = NULL;
9638 case TRUTH_ANDIF_EXPR:
9641 case TRUTH_ORIF_EXPR:
9649 error ("%qE has invalid type for %<reduction(%s)%>",
9654 goto check_dup_generic;
9656 case OMP_CLAUSE_COPYPRIVATE:
9657 name = "copyprivate";
9658 goto check_dup_generic;
9660 case OMP_CLAUSE_COPYIN:
9662 t = OMP_CLAUSE_DECL (c);
9663 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
9665 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
9668 goto check_dup_generic;
9671 t = OMP_CLAUSE_DECL (c);
9672 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
9674 error ("%qE is not a variable in clause %qs", t, name);
9677 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
9678 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
9679 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
9681 error ("%qE appears more than once in data clauses", t);
9685 bitmap_set_bit (&generic_head, DECL_UID (t));
9688 case OMP_CLAUSE_FIRSTPRIVATE:
9689 name = "firstprivate";
9690 t = OMP_CLAUSE_DECL (c);
9691 need_complete = true;
9692 need_implicitly_determined = true;
9693 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
9695 error ("%qE is not a variable in clause %<firstprivate%>", t);
9698 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
9699 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
9701 error ("%qE appears more than once in data clauses", t);
9705 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
9708 case OMP_CLAUSE_LASTPRIVATE:
9709 name = "lastprivate";
9710 t = OMP_CLAUSE_DECL (c);
9711 need_complete = true;
9712 need_implicitly_determined = true;
9713 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
9715 error ("%qE is not a variable in clause %<lastprivate%>", t);
9718 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
9719 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
9721 error ("%qE appears more than once in data clauses", t);
9725 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
9729 case OMP_CLAUSE_NUM_THREADS:
9730 case OMP_CLAUSE_SCHEDULE:
9731 case OMP_CLAUSE_NOWAIT:
9732 case OMP_CLAUSE_ORDERED:
9733 case OMP_CLAUSE_DEFAULT:
9734 case OMP_CLAUSE_UNTIED:
9735 case OMP_CLAUSE_COLLAPSE:
9736 pc = &OMP_CLAUSE_CHAIN (c);
9745 t = OMP_CLAUSE_DECL (c);
9749 t = require_complete_type (t);
9750 if (t == error_mark_node)
9754 if (need_implicitly_determined)
9756 const char *share_name = NULL;
9758 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
9759 share_name = "threadprivate";
9760 else switch (c_omp_predetermined_sharing (t))
9762 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
9764 case OMP_CLAUSE_DEFAULT_SHARED:
9765 share_name = "shared";
9767 case OMP_CLAUSE_DEFAULT_PRIVATE:
9768 share_name = "private";
9775 error ("%qE is predetermined %qs for %qs",
9776 t, share_name, name);
9783 *pc = OMP_CLAUSE_CHAIN (c);
9785 pc = &OMP_CLAUSE_CHAIN (c);
9788 bitmap_obstack_release (NULL);
9792 /* Make a variant type in the proper way for C/C++, propagating qualifiers
9793 down to the element type of an array. */
9796 c_build_qualified_type (tree type, int type_quals)
9798 if (type == error_mark_node)
9801 if (TREE_CODE (type) == ARRAY_TYPE)
9804 tree element_type = c_build_qualified_type (TREE_TYPE (type),
9807 /* See if we already have an identically qualified type. */
9808 for (t = TYPE_MAIN_VARIANT (type); t; t = TYPE_NEXT_VARIANT (t))
9810 if (TYPE_QUALS (strip_array_types (t)) == type_quals
9811 && TYPE_NAME (t) == TYPE_NAME (type)
9812 && TYPE_CONTEXT (t) == TYPE_CONTEXT (type)
9813 && attribute_list_equal (TYPE_ATTRIBUTES (t),
9814 TYPE_ATTRIBUTES (type)))
9819 tree domain = TYPE_DOMAIN (type);
9821 t = build_variant_type_copy (type);
9822 TREE_TYPE (t) = element_type;
9824 if (TYPE_STRUCTURAL_EQUALITY_P (element_type)
9825 || (domain && TYPE_STRUCTURAL_EQUALITY_P (domain)))
9826 SET_TYPE_STRUCTURAL_EQUALITY (t);
9827 else if (TYPE_CANONICAL (element_type) != element_type
9828 || (domain && TYPE_CANONICAL (domain) != domain))
9830 tree unqualified_canon
9831 = build_array_type (TYPE_CANONICAL (element_type),
9832 domain? TYPE_CANONICAL (domain)
9835 = c_build_qualified_type (unqualified_canon, type_quals);
9838 TYPE_CANONICAL (t) = t;
9843 /* A restrict-qualified pointer type must be a pointer to object or
9844 incomplete type. Note that the use of POINTER_TYPE_P also allows
9845 REFERENCE_TYPEs, which is appropriate for C++. */
9846 if ((type_quals & TYPE_QUAL_RESTRICT)
9847 && (!POINTER_TYPE_P (type)
9848 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type))))
9850 error ("invalid use of %<restrict%>");
9851 type_quals &= ~TYPE_QUAL_RESTRICT;
9854 return build_qualified_type (type, type_quals);