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, 2010
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"
33 #include "langhooks.h"
41 #include "tree-iterator.h"
45 /* Possible cases of implicit bad conversions. Used to select
46 diagnostic messages in convert_for_assignment. */
54 /* Whether we are building a boolean conversion inside
55 convert_for_assignment, or some other late binary operation. If
56 build_binary_op is called (from code shared with C++) in this case,
57 then the operands have already been folded and the result will not
58 be folded again, so C_MAYBE_CONST_EXPR should not be generated. */
59 bool in_late_binary_op
;
61 /* The level of nesting inside "__alignof__". */
64 /* The level of nesting inside "sizeof". */
67 /* The level of nesting inside "typeof". */
70 /* Nonzero if we've already printed a "missing braces around initializer"
71 message within this initializer. */
72 static int missing_braces_mentioned
;
74 static int require_constant_value
;
75 static int require_constant_elements
;
77 static bool null_pointer_constant_p (const_tree
);
78 static tree
qualify_type (tree
, tree
);
79 static int tagged_types_tu_compatible_p (const_tree
, const_tree
, bool *,
81 static int comp_target_types (location_t
, tree
, tree
);
82 static int function_types_compatible_p (const_tree
, const_tree
, bool *,
84 static int type_lists_compatible_p (const_tree
, const_tree
, bool *, bool *);
85 static tree
lookup_field (tree
, tree
);
86 static int convert_arguments (tree
, VEC(tree
,gc
) *, VEC(tree
,gc
) *, tree
,
88 static tree
pointer_diff (location_t
, tree
, tree
);
89 static tree
convert_for_assignment (location_t
, tree
, tree
, tree
,
90 enum impl_conv
, bool, tree
, tree
, int);
91 static tree
valid_compound_expr_initializer (tree
, tree
);
92 static void push_string (const char *);
93 static void push_member_name (tree
);
94 static int spelling_length (void);
95 static char *print_spelling (char *);
96 static void warning_init (int, const char *);
97 static tree
digest_init (location_t
, tree
, tree
, tree
, bool, bool, int);
98 static void output_init_element (tree
, tree
, bool, tree
, tree
, int, bool,
100 static void output_pending_init_elements (int, struct obstack
*);
101 static int set_designator (int, struct obstack
*);
102 static void push_range_stack (tree
, struct obstack
*);
103 static void add_pending_init (tree
, tree
, tree
, bool, struct obstack
*);
104 static void set_nonincremental_init (struct obstack
*);
105 static void set_nonincremental_init_from_string (tree
, struct obstack
*);
106 static tree
find_init_member (tree
, struct obstack
*);
107 static void readonly_error (tree
, enum lvalue_use
);
108 static void readonly_warning (tree
, enum lvalue_use
);
109 static int lvalue_or_else (const_tree
, enum lvalue_use
);
110 static void record_maybe_used_decl (tree
);
111 static int comptypes_internal (const_tree
, const_tree
, bool *, bool *);
113 /* Return true if EXP is a null pointer constant, false otherwise. */
116 null_pointer_constant_p (const_tree expr
)
118 /* This should really operate on c_expr structures, but they aren't
119 yet available everywhere required. */
120 tree type
= TREE_TYPE (expr
);
121 return (TREE_CODE (expr
) == INTEGER_CST
122 && !TREE_OVERFLOW (expr
)
123 && integer_zerop (expr
)
124 && (INTEGRAL_TYPE_P (type
)
125 || (TREE_CODE (type
) == POINTER_TYPE
126 && VOID_TYPE_P (TREE_TYPE (type
))
127 && TYPE_QUALS (TREE_TYPE (type
)) == TYPE_UNQUALIFIED
)));
130 /* EXPR may appear in an unevaluated part of an integer constant
131 expression, but not in an evaluated part. Wrap it in a
132 C_MAYBE_CONST_EXPR, or mark it with TREE_OVERFLOW if it is just an
133 INTEGER_CST and we cannot create a C_MAYBE_CONST_EXPR. */
136 note_integer_operands (tree expr
)
139 if (TREE_CODE (expr
) == INTEGER_CST
&& in_late_binary_op
)
141 ret
= copy_node (expr
);
142 TREE_OVERFLOW (ret
) = 1;
146 ret
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (expr
), NULL_TREE
, expr
);
147 C_MAYBE_CONST_EXPR_INT_OPERANDS (ret
) = 1;
152 /* Having checked whether EXPR may appear in an unevaluated part of an
153 integer constant expression and found that it may, remove any
154 C_MAYBE_CONST_EXPR noting this fact and return the resulting
158 remove_c_maybe_const_expr (tree expr
)
160 if (TREE_CODE (expr
) == C_MAYBE_CONST_EXPR
)
161 return C_MAYBE_CONST_EXPR_EXPR (expr
);
166 \f/* This is a cache to hold if two types are compatible or not. */
168 struct tagged_tu_seen_cache
{
169 const struct tagged_tu_seen_cache
* next
;
172 /* The return value of tagged_types_tu_compatible_p if we had seen
173 these two types already. */
177 static const struct tagged_tu_seen_cache
* tagged_tu_seen_base
;
178 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache
*);
180 /* Do `exp = require_complete_type (exp);' to make sure exp
181 does not have an incomplete type. (That includes void types.) */
184 require_complete_type (tree value
)
186 tree type
= TREE_TYPE (value
);
188 if (value
== error_mark_node
|| type
== error_mark_node
)
189 return error_mark_node
;
191 /* First, detect a valid value with a complete type. */
192 if (COMPLETE_TYPE_P (type
))
195 c_incomplete_type_error (value
, type
);
196 return error_mark_node
;
199 /* Print an error message for invalid use of an incomplete type.
200 VALUE is the expression that was used (or 0 if that isn't known)
201 and TYPE is the type that was invalid. */
204 c_incomplete_type_error (const_tree value
, const_tree type
)
206 const char *type_code_string
;
208 /* Avoid duplicate error message. */
209 if (TREE_CODE (type
) == ERROR_MARK
)
212 if (value
!= 0 && (TREE_CODE (value
) == VAR_DECL
213 || TREE_CODE (value
) == PARM_DECL
))
214 error ("%qD has an incomplete type", value
);
218 /* We must print an error message. Be clever about what it says. */
220 switch (TREE_CODE (type
))
223 type_code_string
= "struct";
227 type_code_string
= "union";
231 type_code_string
= "enum";
235 error ("invalid use of void expression");
239 if (TYPE_DOMAIN (type
))
241 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL
)
243 error ("invalid use of flexible array member");
246 type
= TREE_TYPE (type
);
249 error ("invalid use of array with unspecified bounds");
256 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
257 error ("invalid use of undefined type %<%s %E%>",
258 type_code_string
, TYPE_NAME (type
));
260 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
261 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type
));
265 /* Given a type, apply default promotions wrt unnamed function
266 arguments and return the new type. */
269 c_type_promotes_to (tree type
)
271 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
272 return double_type_node
;
274 if (c_promoting_integer_type_p (type
))
276 /* Preserve unsignedness if not really getting any wider. */
277 if (TYPE_UNSIGNED (type
)
278 && (TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
)))
279 return unsigned_type_node
;
280 return integer_type_node
;
286 /* Return true if between two named address spaces, whether there is a superset
287 named address space that encompasses both address spaces. If there is a
288 superset, return which address space is the superset. */
291 addr_space_superset (addr_space_t as1
, addr_space_t as2
, addr_space_t
*common
)
298 else if (targetm
.addr_space
.subset_p (as1
, as2
))
303 else if (targetm
.addr_space
.subset_p (as2
, as1
))
312 /* Return a variant of TYPE which has all the type qualifiers of LIKE
313 as well as those of TYPE. */
316 qualify_type (tree type
, tree like
)
318 addr_space_t as_type
= TYPE_ADDR_SPACE (type
);
319 addr_space_t as_like
= TYPE_ADDR_SPACE (like
);
320 addr_space_t as_common
;
322 /* If the two named address spaces are different, determine the common
323 superset address space. If there isn't one, raise an error. */
324 if (!addr_space_superset (as_type
, as_like
, &as_common
))
327 error ("%qT and %qT are in disjoint named address spaces",
331 return c_build_qualified_type (type
,
332 TYPE_QUALS_NO_ADDR_SPACE (type
)
333 | TYPE_QUALS_NO_ADDR_SPACE (like
)
334 | ENCODE_QUAL_ADDR_SPACE (as_common
));
337 /* Return true iff the given tree T is a variable length array. */
340 c_vla_type_p (const_tree t
)
342 if (TREE_CODE (t
) == ARRAY_TYPE
343 && C_TYPE_VARIABLE_SIZE (t
))
348 /* Return the composite type of two compatible types.
350 We assume that comptypes has already been done and returned
351 nonzero; if that isn't so, this may crash. In particular, we
352 assume that qualifiers match. */
355 composite_type (tree t1
, tree t2
)
357 enum tree_code code1
;
358 enum tree_code code2
;
361 /* Save time if the two types are the same. */
363 if (t1
== t2
) return t1
;
365 /* If one type is nonsense, use the other. */
366 if (t1
== error_mark_node
)
368 if (t2
== error_mark_node
)
371 code1
= TREE_CODE (t1
);
372 code2
= TREE_CODE (t2
);
374 /* Merge the attributes. */
375 attributes
= targetm
.merge_type_attributes (t1
, t2
);
377 /* If one is an enumerated type and the other is the compatible
378 integer type, the composite type might be either of the two
379 (DR#013 question 3). For consistency, use the enumerated type as
380 the composite type. */
382 if (code1
== ENUMERAL_TYPE
&& code2
== INTEGER_TYPE
)
384 if (code2
== ENUMERAL_TYPE
&& code1
== INTEGER_TYPE
)
387 gcc_assert (code1
== code2
);
392 /* For two pointers, do this recursively on the target type. */
394 tree pointed_to_1
= TREE_TYPE (t1
);
395 tree pointed_to_2
= TREE_TYPE (t2
);
396 tree target
= composite_type (pointed_to_1
, pointed_to_2
);
397 t1
= build_pointer_type (target
);
398 t1
= build_type_attribute_variant (t1
, attributes
);
399 return qualify_type (t1
, t2
);
404 tree elt
= composite_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
407 tree d1
= TYPE_DOMAIN (t1
);
408 tree d2
= TYPE_DOMAIN (t2
);
409 bool d1_variable
, d2_variable
;
410 bool d1_zero
, d2_zero
;
411 bool t1_complete
, t2_complete
;
413 /* We should not have any type quals on arrays at all. */
414 gcc_assert (!TYPE_QUALS_NO_ADDR_SPACE (t1
)
415 && !TYPE_QUALS_NO_ADDR_SPACE (t2
));
417 t1_complete
= COMPLETE_TYPE_P (t1
);
418 t2_complete
= COMPLETE_TYPE_P (t2
);
420 d1_zero
= d1
== 0 || !TYPE_MAX_VALUE (d1
);
421 d2_zero
= d2
== 0 || !TYPE_MAX_VALUE (d2
);
423 d1_variable
= (!d1_zero
424 && (TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
425 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
));
426 d2_variable
= (!d2_zero
427 && (TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
428 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
));
429 d1_variable
= d1_variable
|| (d1_zero
&& c_vla_type_p (t1
));
430 d2_variable
= d2_variable
|| (d2_zero
&& c_vla_type_p (t2
));
432 /* Save space: see if the result is identical to one of the args. */
433 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
)
434 && (d2_variable
|| d2_zero
|| !d1_variable
))
435 return build_type_attribute_variant (t1
, attributes
);
436 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
)
437 && (d1_variable
|| d1_zero
|| !d2_variable
))
438 return build_type_attribute_variant (t2
, attributes
);
440 if (elt
== TREE_TYPE (t1
) && !TYPE_DOMAIN (t2
) && !TYPE_DOMAIN (t1
))
441 return build_type_attribute_variant (t1
, attributes
);
442 if (elt
== TREE_TYPE (t2
) && !TYPE_DOMAIN (t2
) && !TYPE_DOMAIN (t1
))
443 return build_type_attribute_variant (t2
, attributes
);
445 /* Merge the element types, and have a size if either arg has
446 one. We may have qualifiers on the element types. To set
447 up TYPE_MAIN_VARIANT correctly, we need to form the
448 composite of the unqualified types and add the qualifiers
450 quals
= TYPE_QUALS (strip_array_types (elt
));
451 unqual_elt
= c_build_qualified_type (elt
, TYPE_UNQUALIFIED
);
452 t1
= build_array_type (unqual_elt
,
453 TYPE_DOMAIN ((TYPE_DOMAIN (t1
)
459 /* Ensure a composite type involving a zero-length array type
460 is a zero-length type not an incomplete type. */
461 if (d1_zero
&& d2_zero
462 && (t1_complete
|| t2_complete
)
463 && !COMPLETE_TYPE_P (t1
))
465 TYPE_SIZE (t1
) = bitsize_zero_node
;
466 TYPE_SIZE_UNIT (t1
) = size_zero_node
;
468 t1
= c_build_qualified_type (t1
, quals
);
469 return build_type_attribute_variant (t1
, attributes
);
475 if (attributes
!= NULL
)
477 /* Try harder not to create a new aggregate type. */
478 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
480 if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
483 return build_type_attribute_variant (t1
, attributes
);
486 /* Function types: prefer the one that specified arg types.
487 If both do, merge the arg types. Also merge the return types. */
489 tree valtype
= composite_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
490 tree p1
= TYPE_ARG_TYPES (t1
);
491 tree p2
= TYPE_ARG_TYPES (t2
);
496 /* Save space: see if the result is identical to one of the args. */
497 if (valtype
== TREE_TYPE (t1
) && !TYPE_ARG_TYPES (t2
))
498 return build_type_attribute_variant (t1
, attributes
);
499 if (valtype
== TREE_TYPE (t2
) && !TYPE_ARG_TYPES (t1
))
500 return build_type_attribute_variant (t2
, attributes
);
502 /* Simple way if one arg fails to specify argument types. */
503 if (TYPE_ARG_TYPES (t1
) == 0)
505 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t2
));
506 t1
= build_type_attribute_variant (t1
, attributes
);
507 return qualify_type (t1
, t2
);
509 if (TYPE_ARG_TYPES (t2
) == 0)
511 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t1
));
512 t1
= build_type_attribute_variant (t1
, attributes
);
513 return qualify_type (t1
, t2
);
516 /* If both args specify argument types, we must merge the two
517 lists, argument by argument. */
518 /* Tell global_bindings_p to return false so that variable_size
519 doesn't die on VLAs in parameter types. */
520 c_override_global_bindings_to_false
= true;
522 len
= list_length (p1
);
525 for (i
= 0; i
< len
; i
++)
526 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
531 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
))
533 /* A null type means arg type is not specified.
534 Take whatever the other function type has. */
535 if (TREE_VALUE (p1
) == 0)
537 TREE_VALUE (n
) = TREE_VALUE (p2
);
540 if (TREE_VALUE (p2
) == 0)
542 TREE_VALUE (n
) = TREE_VALUE (p1
);
546 /* Given wait (union {union wait *u; int *i} *)
547 and wait (union wait *),
548 prefer union wait * as type of parm. */
549 if (TREE_CODE (TREE_VALUE (p1
)) == UNION_TYPE
550 && TREE_VALUE (p1
) != TREE_VALUE (p2
))
553 tree mv2
= TREE_VALUE (p2
);
554 if (mv2
&& mv2
!= error_mark_node
555 && TREE_CODE (mv2
) != ARRAY_TYPE
)
556 mv2
= TYPE_MAIN_VARIANT (mv2
);
557 for (memb
= TYPE_FIELDS (TREE_VALUE (p1
));
558 memb
; memb
= DECL_CHAIN (memb
))
560 tree mv3
= TREE_TYPE (memb
);
561 if (mv3
&& mv3
!= error_mark_node
562 && TREE_CODE (mv3
) != ARRAY_TYPE
)
563 mv3
= TYPE_MAIN_VARIANT (mv3
);
564 if (comptypes (mv3
, mv2
))
566 TREE_VALUE (n
) = composite_type (TREE_TYPE (memb
),
568 pedwarn (input_location
, OPT_pedantic
,
569 "function types not truly compatible in ISO C");
574 if (TREE_CODE (TREE_VALUE (p2
)) == UNION_TYPE
575 && TREE_VALUE (p2
) != TREE_VALUE (p1
))
578 tree mv1
= TREE_VALUE (p1
);
579 if (mv1
&& mv1
!= error_mark_node
580 && TREE_CODE (mv1
) != ARRAY_TYPE
)
581 mv1
= TYPE_MAIN_VARIANT (mv1
);
582 for (memb
= TYPE_FIELDS (TREE_VALUE (p2
));
583 memb
; memb
= DECL_CHAIN (memb
))
585 tree mv3
= TREE_TYPE (memb
);
586 if (mv3
&& mv3
!= error_mark_node
587 && TREE_CODE (mv3
) != ARRAY_TYPE
)
588 mv3
= TYPE_MAIN_VARIANT (mv3
);
589 if (comptypes (mv3
, mv1
))
591 TREE_VALUE (n
) = composite_type (TREE_TYPE (memb
),
593 pedwarn (input_location
, OPT_pedantic
,
594 "function types not truly compatible in ISO C");
599 TREE_VALUE (n
) = composite_type (TREE_VALUE (p1
), TREE_VALUE (p2
));
603 c_override_global_bindings_to_false
= false;
604 t1
= build_function_type (valtype
, newargs
);
605 t1
= qualify_type (t1
, t2
);
606 /* ... falls through ... */
610 return build_type_attribute_variant (t1
, attributes
);
615 /* Return the type of a conditional expression between pointers to
616 possibly differently qualified versions of compatible types.
618 We assume that comp_target_types has already been done and returned
619 nonzero; if that isn't so, this may crash. */
622 common_pointer_type (tree t1
, tree t2
)
625 tree pointed_to_1
, mv1
;
626 tree pointed_to_2
, mv2
;
628 unsigned target_quals
;
629 addr_space_t as1
, as2
, as_common
;
632 /* Save time if the two types are the same. */
634 if (t1
== t2
) return t1
;
636 /* If one type is nonsense, use the other. */
637 if (t1
== error_mark_node
)
639 if (t2
== error_mark_node
)
642 gcc_assert (TREE_CODE (t1
) == POINTER_TYPE
643 && TREE_CODE (t2
) == POINTER_TYPE
);
645 /* Merge the attributes. */
646 attributes
= targetm
.merge_type_attributes (t1
, t2
);
648 /* Find the composite type of the target types, and combine the
649 qualifiers of the two types' targets. Do not lose qualifiers on
650 array element types by taking the TYPE_MAIN_VARIANT. */
651 mv1
= pointed_to_1
= TREE_TYPE (t1
);
652 mv2
= pointed_to_2
= TREE_TYPE (t2
);
653 if (TREE_CODE (mv1
) != ARRAY_TYPE
)
654 mv1
= TYPE_MAIN_VARIANT (pointed_to_1
);
655 if (TREE_CODE (mv2
) != ARRAY_TYPE
)
656 mv2
= TYPE_MAIN_VARIANT (pointed_to_2
);
657 target
= composite_type (mv1
, mv2
);
659 /* For function types do not merge const qualifiers, but drop them
660 if used inconsistently. The middle-end uses these to mark const
661 and noreturn functions. */
662 quals1
= TYPE_QUALS_NO_ADDR_SPACE (pointed_to_1
);
663 quals2
= TYPE_QUALS_NO_ADDR_SPACE (pointed_to_2
);
665 if (TREE_CODE (pointed_to_1
) == FUNCTION_TYPE
)
666 target_quals
= (quals1
& quals2
);
668 target_quals
= (quals1
| quals2
);
670 /* If the two named address spaces are different, determine the common
671 superset address space. This is guaranteed to exist due to the
672 assumption that comp_target_type returned non-zero. */
673 as1
= TYPE_ADDR_SPACE (pointed_to_1
);
674 as2
= TYPE_ADDR_SPACE (pointed_to_2
);
675 if (!addr_space_superset (as1
, as2
, &as_common
))
678 target_quals
|= ENCODE_QUAL_ADDR_SPACE (as_common
);
680 t1
= build_pointer_type (c_build_qualified_type (target
, target_quals
));
681 return build_type_attribute_variant (t1
, attributes
);
684 /* Return the common type for two arithmetic types under the usual
685 arithmetic conversions. The default conversions have already been
686 applied, and enumerated types converted to their compatible integer
687 types. The resulting type is unqualified and has no attributes.
689 This is the type for the result of most arithmetic operations
690 if the operands have the given two types. */
693 c_common_type (tree t1
, tree t2
)
695 enum tree_code code1
;
696 enum tree_code code2
;
698 /* If one type is nonsense, use the other. */
699 if (t1
== error_mark_node
)
701 if (t2
== error_mark_node
)
704 if (TYPE_QUALS (t1
) != TYPE_UNQUALIFIED
)
705 t1
= TYPE_MAIN_VARIANT (t1
);
707 if (TYPE_QUALS (t2
) != TYPE_UNQUALIFIED
)
708 t2
= TYPE_MAIN_VARIANT (t2
);
710 if (TYPE_ATTRIBUTES (t1
) != NULL_TREE
)
711 t1
= build_type_attribute_variant (t1
, NULL_TREE
);
713 if (TYPE_ATTRIBUTES (t2
) != NULL_TREE
)
714 t2
= build_type_attribute_variant (t2
, NULL_TREE
);
716 /* Save time if the two types are the same. */
718 if (t1
== t2
) return t1
;
720 code1
= TREE_CODE (t1
);
721 code2
= TREE_CODE (t2
);
723 gcc_assert (code1
== VECTOR_TYPE
|| code1
== COMPLEX_TYPE
724 || code1
== FIXED_POINT_TYPE
|| code1
== REAL_TYPE
725 || code1
== INTEGER_TYPE
);
726 gcc_assert (code2
== VECTOR_TYPE
|| code2
== COMPLEX_TYPE
727 || code2
== FIXED_POINT_TYPE
|| code2
== REAL_TYPE
728 || code2
== INTEGER_TYPE
);
730 /* When one operand is a decimal float type, the other operand cannot be
731 a generic float type or a complex type. We also disallow vector types
733 if ((DECIMAL_FLOAT_TYPE_P (t1
) || DECIMAL_FLOAT_TYPE_P (t2
))
734 && !(DECIMAL_FLOAT_TYPE_P (t1
) && DECIMAL_FLOAT_TYPE_P (t2
)))
736 if (code1
== VECTOR_TYPE
|| code2
== VECTOR_TYPE
)
738 error ("can%'t mix operands of decimal float and vector types");
739 return error_mark_node
;
741 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
743 error ("can%'t mix operands of decimal float and complex types");
744 return error_mark_node
;
746 if (code1
== REAL_TYPE
&& code2
== REAL_TYPE
)
748 error ("can%'t mix operands of decimal float and other float types");
749 return error_mark_node
;
753 /* If one type is a vector type, return that type. (How the usual
754 arithmetic conversions apply to the vector types extension is not
755 precisely specified.) */
756 if (code1
== VECTOR_TYPE
)
759 if (code2
== VECTOR_TYPE
)
762 /* If one type is complex, form the common type of the non-complex
763 components, then make that complex. Use T1 or T2 if it is the
765 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
767 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
768 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
769 tree subtype
= c_common_type (subtype1
, subtype2
);
771 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
773 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
776 return build_complex_type (subtype
);
779 /* If only one is real, use it as the result. */
781 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
784 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
787 /* If both are real and either are decimal floating point types, use
788 the decimal floating point type with the greater precision. */
790 if (code1
== REAL_TYPE
&& code2
== REAL_TYPE
)
792 if (TYPE_MAIN_VARIANT (t1
) == dfloat128_type_node
793 || TYPE_MAIN_VARIANT (t2
) == dfloat128_type_node
)
794 return dfloat128_type_node
;
795 else if (TYPE_MAIN_VARIANT (t1
) == dfloat64_type_node
796 || TYPE_MAIN_VARIANT (t2
) == dfloat64_type_node
)
797 return dfloat64_type_node
;
798 else if (TYPE_MAIN_VARIANT (t1
) == dfloat32_type_node
799 || TYPE_MAIN_VARIANT (t2
) == dfloat32_type_node
)
800 return dfloat32_type_node
;
803 /* Deal with fixed-point types. */
804 if (code1
== FIXED_POINT_TYPE
|| code2
== FIXED_POINT_TYPE
)
806 unsigned int unsignedp
= 0, satp
= 0;
807 enum machine_mode m1
, m2
;
808 unsigned int fbit1
, ibit1
, fbit2
, ibit2
, max_fbit
, max_ibit
;
813 /* If one input type is saturating, the result type is saturating. */
814 if (TYPE_SATURATING (t1
) || TYPE_SATURATING (t2
))
817 /* If both fixed-point types are unsigned, the result type is unsigned.
818 When mixing fixed-point and integer types, follow the sign of the
820 Otherwise, the result type is signed. */
821 if ((TYPE_UNSIGNED (t1
) && TYPE_UNSIGNED (t2
)
822 && code1
== FIXED_POINT_TYPE
&& code2
== FIXED_POINT_TYPE
)
823 || (code1
== FIXED_POINT_TYPE
&& code2
!= FIXED_POINT_TYPE
824 && TYPE_UNSIGNED (t1
))
825 || (code1
!= FIXED_POINT_TYPE
&& code2
== FIXED_POINT_TYPE
826 && TYPE_UNSIGNED (t2
)))
829 /* The result type is signed. */
832 /* If the input type is unsigned, we need to convert to the
834 if (code1
== FIXED_POINT_TYPE
&& TYPE_UNSIGNED (t1
))
836 enum mode_class mclass
= (enum mode_class
) 0;
837 if (GET_MODE_CLASS (m1
) == MODE_UFRACT
)
839 else if (GET_MODE_CLASS (m1
) == MODE_UACCUM
)
843 m1
= mode_for_size (GET_MODE_PRECISION (m1
), mclass
, 0);
845 if (code2
== FIXED_POINT_TYPE
&& TYPE_UNSIGNED (t2
))
847 enum mode_class mclass
= (enum mode_class
) 0;
848 if (GET_MODE_CLASS (m2
) == MODE_UFRACT
)
850 else if (GET_MODE_CLASS (m2
) == MODE_UACCUM
)
854 m2
= mode_for_size (GET_MODE_PRECISION (m2
), mclass
, 0);
858 if (code1
== FIXED_POINT_TYPE
)
860 fbit1
= GET_MODE_FBIT (m1
);
861 ibit1
= GET_MODE_IBIT (m1
);
866 /* Signed integers need to subtract one sign bit. */
867 ibit1
= TYPE_PRECISION (t1
) - (!TYPE_UNSIGNED (t1
));
870 if (code2
== FIXED_POINT_TYPE
)
872 fbit2
= GET_MODE_FBIT (m2
);
873 ibit2
= GET_MODE_IBIT (m2
);
878 /* Signed integers need to subtract one sign bit. */
879 ibit2
= TYPE_PRECISION (t2
) - (!TYPE_UNSIGNED (t2
));
882 max_ibit
= ibit1
>= ibit2
? ibit1
: ibit2
;
883 max_fbit
= fbit1
>= fbit2
? fbit1
: fbit2
;
884 return c_common_fixed_point_type_for_size (max_ibit
, max_fbit
, unsignedp
,
888 /* Both real or both integers; use the one with greater precision. */
890 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
892 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
895 /* Same precision. Prefer long longs to longs to ints when the
896 same precision, following the C99 rules on integer type rank
897 (which are equivalent to the C90 rules for C90 types). */
899 if (TYPE_MAIN_VARIANT (t1
) == long_long_unsigned_type_node
900 || TYPE_MAIN_VARIANT (t2
) == long_long_unsigned_type_node
)
901 return long_long_unsigned_type_node
;
903 if (TYPE_MAIN_VARIANT (t1
) == long_long_integer_type_node
904 || TYPE_MAIN_VARIANT (t2
) == long_long_integer_type_node
)
906 if (TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
907 return long_long_unsigned_type_node
;
909 return long_long_integer_type_node
;
912 if (TYPE_MAIN_VARIANT (t1
) == long_unsigned_type_node
913 || TYPE_MAIN_VARIANT (t2
) == long_unsigned_type_node
)
914 return long_unsigned_type_node
;
916 if (TYPE_MAIN_VARIANT (t1
) == long_integer_type_node
917 || TYPE_MAIN_VARIANT (t2
) == long_integer_type_node
)
919 /* But preserve unsignedness from the other type,
920 since long cannot hold all the values of an unsigned int. */
921 if (TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
922 return long_unsigned_type_node
;
924 return long_integer_type_node
;
927 /* Likewise, prefer long double to double even if same size. */
928 if (TYPE_MAIN_VARIANT (t1
) == long_double_type_node
929 || TYPE_MAIN_VARIANT (t2
) == long_double_type_node
)
930 return long_double_type_node
;
932 /* Otherwise prefer the unsigned one. */
934 if (TYPE_UNSIGNED (t1
))
940 /* Wrapper around c_common_type that is used by c-common.c and other
941 front end optimizations that remove promotions. ENUMERAL_TYPEs
942 are allowed here and are converted to their compatible integer types.
943 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
944 preferably a non-Boolean type as the common type. */
946 common_type (tree t1
, tree t2
)
948 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
949 t1
= c_common_type_for_size (TYPE_PRECISION (t1
), 1);
950 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
951 t2
= c_common_type_for_size (TYPE_PRECISION (t2
), 1);
953 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
954 if (TREE_CODE (t1
) == BOOLEAN_TYPE
955 && TREE_CODE (t2
) == BOOLEAN_TYPE
)
956 return boolean_type_node
;
958 /* If either type is BOOLEAN_TYPE, then return the other. */
959 if (TREE_CODE (t1
) == BOOLEAN_TYPE
)
961 if (TREE_CODE (t2
) == BOOLEAN_TYPE
)
964 return c_common_type (t1
, t2
);
967 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
968 or various other operations. Return 2 if they are compatible
969 but a warning may be needed if you use them together. */
972 comptypes (tree type1
, tree type2
)
974 const struct tagged_tu_seen_cache
* tagged_tu_seen_base1
= tagged_tu_seen_base
;
977 val
= comptypes_internal (type1
, type2
, NULL
, NULL
);
978 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1
);
983 /* Like comptypes, but if it returns non-zero because enum and int are
984 compatible, it sets *ENUM_AND_INT_P to true. */
987 comptypes_check_enum_int (tree type1
, tree type2
, bool *enum_and_int_p
)
989 const struct tagged_tu_seen_cache
* tagged_tu_seen_base1
= tagged_tu_seen_base
;
992 val
= comptypes_internal (type1
, type2
, enum_and_int_p
, NULL
);
993 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1
);
998 /* Like comptypes, but if it returns nonzero for different types, it
999 sets *DIFFERENT_TYPES_P to true. */
1002 comptypes_check_different_types (tree type1
, tree type2
,
1003 bool *different_types_p
)
1005 const struct tagged_tu_seen_cache
* tagged_tu_seen_base1
= tagged_tu_seen_base
;
1008 val
= comptypes_internal (type1
, type2
, NULL
, different_types_p
);
1009 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1
);
1014 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1015 or various other operations. Return 2 if they are compatible
1016 but a warning may be needed if you use them together. If
1017 ENUM_AND_INT_P is not NULL, and one type is an enum and the other a
1018 compatible integer type, then this sets *ENUM_AND_INT_P to true;
1019 *ENUM_AND_INT_P is never set to false. If DIFFERENT_TYPES_P is not
1020 NULL, and the types are compatible but different enough not to be
1021 permitted in C1X typedef redeclarations, then this sets
1022 *DIFFERENT_TYPES_P to true; *DIFFERENT_TYPES_P is never set to
1023 false, but may or may not be set if the types are incompatible.
1024 This differs from comptypes, in that we don't free the seen
1028 comptypes_internal (const_tree type1
, const_tree type2
, bool *enum_and_int_p
,
1029 bool *different_types_p
)
1031 const_tree t1
= type1
;
1032 const_tree t2
= type2
;
1035 /* Suppress errors caused by previously reported errors. */
1037 if (t1
== t2
|| !t1
|| !t2
1038 || TREE_CODE (t1
) == ERROR_MARK
|| TREE_CODE (t2
) == ERROR_MARK
)
1041 /* If either type is the internal version of sizetype, return the
1042 language version. */
1043 if (TREE_CODE (t1
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t1
)
1044 && TYPE_ORIG_SIZE_TYPE (t1
))
1045 t1
= TYPE_ORIG_SIZE_TYPE (t1
);
1047 if (TREE_CODE (t2
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t2
)
1048 && TYPE_ORIG_SIZE_TYPE (t2
))
1049 t2
= TYPE_ORIG_SIZE_TYPE (t2
);
1052 /* Enumerated types are compatible with integer types, but this is
1053 not transitive: two enumerated types in the same translation unit
1054 are compatible with each other only if they are the same type. */
1056 if (TREE_CODE (t1
) == ENUMERAL_TYPE
&& TREE_CODE (t2
) != ENUMERAL_TYPE
)
1058 t1
= c_common_type_for_size (TYPE_PRECISION (t1
), TYPE_UNSIGNED (t1
));
1059 if (TREE_CODE (t2
) != VOID_TYPE
)
1061 if (enum_and_int_p
!= NULL
)
1062 *enum_and_int_p
= true;
1063 if (different_types_p
!= NULL
)
1064 *different_types_p
= true;
1067 else if (TREE_CODE (t2
) == ENUMERAL_TYPE
&& TREE_CODE (t1
) != ENUMERAL_TYPE
)
1069 t2
= c_common_type_for_size (TYPE_PRECISION (t2
), TYPE_UNSIGNED (t2
));
1070 if (TREE_CODE (t1
) != VOID_TYPE
)
1072 if (enum_and_int_p
!= NULL
)
1073 *enum_and_int_p
= true;
1074 if (different_types_p
!= NULL
)
1075 *different_types_p
= true;
1082 /* Different classes of types can't be compatible. */
1084 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1087 /* Qualifiers must match. C99 6.7.3p9 */
1089 if (TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
1092 /* Allow for two different type nodes which have essentially the same
1093 definition. Note that we already checked for equality of the type
1094 qualifiers (just above). */
1096 if (TREE_CODE (t1
) != ARRAY_TYPE
1097 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1100 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1101 if (!(attrval
= targetm
.comp_type_attributes (t1
, t2
)))
1104 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1107 switch (TREE_CODE (t1
))
1110 /* Do not remove mode or aliasing information. */
1111 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1112 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
))
1114 val
= (TREE_TYPE (t1
) == TREE_TYPE (t2
)
1115 ? 1 : comptypes_internal (TREE_TYPE (t1
), TREE_TYPE (t2
),
1116 enum_and_int_p
, different_types_p
));
1120 val
= function_types_compatible_p (t1
, t2
, enum_and_int_p
,
1126 tree d1
= TYPE_DOMAIN (t1
);
1127 tree d2
= TYPE_DOMAIN (t2
);
1128 bool d1_variable
, d2_variable
;
1129 bool d1_zero
, d2_zero
;
1132 /* Target types must match incl. qualifiers. */
1133 if (TREE_TYPE (t1
) != TREE_TYPE (t2
)
1134 && 0 == (val
= comptypes_internal (TREE_TYPE (t1
), TREE_TYPE (t2
),
1136 different_types_p
)))
1139 if (different_types_p
!= NULL
1140 && (d1
== 0) != (d2
== 0))
1141 *different_types_p
= true;
1142 /* Sizes must match unless one is missing or variable. */
1143 if (d1
== 0 || d2
== 0 || d1
== d2
)
1146 d1_zero
= !TYPE_MAX_VALUE (d1
);
1147 d2_zero
= !TYPE_MAX_VALUE (d2
);
1149 d1_variable
= (!d1_zero
1150 && (TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
1151 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
));
1152 d2_variable
= (!d2_zero
1153 && (TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
1154 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
));
1155 d1_variable
= d1_variable
|| (d1_zero
&& c_vla_type_p (t1
));
1156 d2_variable
= d2_variable
|| (d2_zero
&& c_vla_type_p (t2
));
1158 if (different_types_p
!= NULL
1159 && d1_variable
!= d2_variable
)
1160 *different_types_p
= true;
1161 if (d1_variable
|| d2_variable
)
1163 if (d1_zero
&& d2_zero
)
1165 if (d1_zero
|| d2_zero
1166 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
))
1167 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1
), TYPE_MAX_VALUE (d2
)))
1176 if (val
!= 1 && !same_translation_unit_p (t1
, t2
))
1178 tree a1
= TYPE_ATTRIBUTES (t1
);
1179 tree a2
= TYPE_ATTRIBUTES (t2
);
1181 if (! attribute_list_contained (a1
, a2
)
1182 && ! attribute_list_contained (a2
, a1
))
1186 return tagged_types_tu_compatible_p (t1
, t2
, enum_and_int_p
,
1188 val
= tagged_types_tu_compatible_p (t1
, t2
, enum_and_int_p
,
1194 val
= (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
1195 && comptypes_internal (TREE_TYPE (t1
), TREE_TYPE (t2
),
1196 enum_and_int_p
, different_types_p
));
1202 return attrval
== 2 && val
== 1 ? 2 : val
;
1205 /* Return 1 if TTL and TTR are pointers to types that are equivalent, ignoring
1206 their qualifiers, except for named address spaces. If the pointers point to
1207 different named addresses, then we must determine if one address space is a
1208 subset of the other. */
1211 comp_target_types (location_t location
, tree ttl
, tree ttr
)
1214 tree mvl
= TREE_TYPE (ttl
);
1215 tree mvr
= TREE_TYPE (ttr
);
1216 addr_space_t asl
= TYPE_ADDR_SPACE (mvl
);
1217 addr_space_t asr
= TYPE_ADDR_SPACE (mvr
);
1218 addr_space_t as_common
;
1219 bool enum_and_int_p
;
1221 /* Fail if pointers point to incompatible address spaces. */
1222 if (!addr_space_superset (asl
, asr
, &as_common
))
1225 /* Do not lose qualifiers on element types of array types that are
1226 pointer targets by taking their TYPE_MAIN_VARIANT. */
1227 if (TREE_CODE (mvl
) != ARRAY_TYPE
)
1228 mvl
= TYPE_MAIN_VARIANT (mvl
);
1229 if (TREE_CODE (mvr
) != ARRAY_TYPE
)
1230 mvr
= TYPE_MAIN_VARIANT (mvr
);
1231 enum_and_int_p
= false;
1232 val
= comptypes_check_enum_int (mvl
, mvr
, &enum_and_int_p
);
1235 pedwarn (location
, OPT_pedantic
, "types are not quite compatible");
1237 if (val
== 1 && enum_and_int_p
&& warn_cxx_compat
)
1238 warning_at (location
, OPT_Wc___compat
,
1239 "pointer target types incompatible in C++");
1244 /* Subroutines of `comptypes'. */
1246 /* Determine whether two trees derive from the same translation unit.
1247 If the CONTEXT chain ends in a null, that tree's context is still
1248 being parsed, so if two trees have context chains ending in null,
1249 they're in the same translation unit. */
1251 same_translation_unit_p (const_tree t1
, const_tree t2
)
1253 while (t1
&& TREE_CODE (t1
) != TRANSLATION_UNIT_DECL
)
1254 switch (TREE_CODE_CLASS (TREE_CODE (t1
)))
1256 case tcc_declaration
:
1257 t1
= DECL_CONTEXT (t1
); break;
1259 t1
= TYPE_CONTEXT (t1
); break;
1260 case tcc_exceptional
:
1261 t1
= BLOCK_SUPERCONTEXT (t1
); break; /* assume block */
1262 default: gcc_unreachable ();
1265 while (t2
&& TREE_CODE (t2
) != TRANSLATION_UNIT_DECL
)
1266 switch (TREE_CODE_CLASS (TREE_CODE (t2
)))
1268 case tcc_declaration
:
1269 t2
= DECL_CONTEXT (t2
); break;
1271 t2
= TYPE_CONTEXT (t2
); break;
1272 case tcc_exceptional
:
1273 t2
= BLOCK_SUPERCONTEXT (t2
); break; /* assume block */
1274 default: gcc_unreachable ();
1280 /* Allocate the seen two types, assuming that they are compatible. */
1282 static struct tagged_tu_seen_cache
*
1283 alloc_tagged_tu_seen_cache (const_tree t1
, const_tree t2
)
1285 struct tagged_tu_seen_cache
*tu
= XNEW (struct tagged_tu_seen_cache
);
1286 tu
->next
= tagged_tu_seen_base
;
1290 tagged_tu_seen_base
= tu
;
1292 /* The C standard says that two structures in different translation
1293 units are compatible with each other only if the types of their
1294 fields are compatible (among other things). We assume that they
1295 are compatible until proven otherwise when building the cache.
1296 An example where this can occur is:
1301 If we are comparing this against a similar struct in another TU,
1302 and did not assume they were compatible, we end up with an infinite
1308 /* Free the seen types until we get to TU_TIL. */
1311 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache
*tu_til
)
1313 const struct tagged_tu_seen_cache
*tu
= tagged_tu_seen_base
;
1314 while (tu
!= tu_til
)
1316 const struct tagged_tu_seen_cache
*const tu1
1317 = (const struct tagged_tu_seen_cache
*) tu
;
1319 free (CONST_CAST (struct tagged_tu_seen_cache
*, tu1
));
1321 tagged_tu_seen_base
= tu_til
;
1324 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1325 compatible. If the two types are not the same (which has been
1326 checked earlier), this can only happen when multiple translation
1327 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1328 rules. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1329 comptypes_internal. */
1332 tagged_types_tu_compatible_p (const_tree t1
, const_tree t2
,
1333 bool *enum_and_int_p
, bool *different_types_p
)
1336 bool needs_warning
= false;
1338 /* We have to verify that the tags of the types are the same. This
1339 is harder than it looks because this may be a typedef, so we have
1340 to go look at the original type. It may even be a typedef of a
1342 In the case of compiler-created builtin structs the TYPE_DECL
1343 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1344 while (TYPE_NAME (t1
)
1345 && TREE_CODE (TYPE_NAME (t1
)) == TYPE_DECL
1346 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1
)))
1347 t1
= DECL_ORIGINAL_TYPE (TYPE_NAME (t1
));
1349 while (TYPE_NAME (t2
)
1350 && TREE_CODE (TYPE_NAME (t2
)) == TYPE_DECL
1351 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2
)))
1352 t2
= DECL_ORIGINAL_TYPE (TYPE_NAME (t2
));
1354 /* C90 didn't have the requirement that the two tags be the same. */
1355 if (flag_isoc99
&& TYPE_NAME (t1
) != TYPE_NAME (t2
))
1358 /* C90 didn't say what happened if one or both of the types were
1359 incomplete; we choose to follow C99 rules here, which is that they
1361 if (TYPE_SIZE (t1
) == NULL
1362 || TYPE_SIZE (t2
) == NULL
)
1366 const struct tagged_tu_seen_cache
* tts_i
;
1367 for (tts_i
= tagged_tu_seen_base
; tts_i
!= NULL
; tts_i
= tts_i
->next
)
1368 if (tts_i
->t1
== t1
&& tts_i
->t2
== t2
)
1372 switch (TREE_CODE (t1
))
1376 struct tagged_tu_seen_cache
*tu
= alloc_tagged_tu_seen_cache (t1
, t2
);
1377 /* Speed up the case where the type values are in the same order. */
1378 tree tv1
= TYPE_VALUES (t1
);
1379 tree tv2
= TYPE_VALUES (t2
);
1386 for (;tv1
&& tv2
; tv1
= TREE_CHAIN (tv1
), tv2
= TREE_CHAIN (tv2
))
1388 if (TREE_PURPOSE (tv1
) != TREE_PURPOSE (tv2
))
1390 if (simple_cst_equal (TREE_VALUE (tv1
), TREE_VALUE (tv2
)) != 1)
1397 if (tv1
== NULL_TREE
&& tv2
== NULL_TREE
)
1401 if (tv1
== NULL_TREE
|| tv2
== NULL_TREE
)
1407 if (list_length (TYPE_VALUES (t1
)) != list_length (TYPE_VALUES (t2
)))
1413 for (s1
= TYPE_VALUES (t1
); s1
; s1
= TREE_CHAIN (s1
))
1415 s2
= purpose_member (TREE_PURPOSE (s1
), TYPE_VALUES (t2
));
1417 || simple_cst_equal (TREE_VALUE (s1
), TREE_VALUE (s2
)) != 1)
1428 struct tagged_tu_seen_cache
*tu
= alloc_tagged_tu_seen_cache (t1
, t2
);
1429 if (list_length (TYPE_FIELDS (t1
)) != list_length (TYPE_FIELDS (t2
)))
1435 /* Speed up the common case where the fields are in the same order. */
1436 for (s1
= TYPE_FIELDS (t1
), s2
= TYPE_FIELDS (t2
); s1
&& s2
;
1437 s1
= DECL_CHAIN (s1
), s2
= DECL_CHAIN (s2
))
1441 if (DECL_NAME (s1
) != DECL_NAME (s2
))
1443 result
= comptypes_internal (TREE_TYPE (s1
), TREE_TYPE (s2
),
1444 enum_and_int_p
, different_types_p
);
1446 if (result
!= 1 && !DECL_NAME (s1
))
1454 needs_warning
= true;
1456 if (TREE_CODE (s1
) == FIELD_DECL
1457 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
1458 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
1466 tu
->val
= needs_warning
? 2 : 1;
1470 for (s1
= TYPE_FIELDS (t1
); s1
; s1
= DECL_CHAIN (s1
))
1474 for (s2
= TYPE_FIELDS (t2
); s2
; s2
= DECL_CHAIN (s2
))
1475 if (DECL_NAME (s1
) == DECL_NAME (s2
))
1479 result
= comptypes_internal (TREE_TYPE (s1
), TREE_TYPE (s2
),
1483 if (result
!= 1 && !DECL_NAME (s1
))
1491 needs_warning
= true;
1493 if (TREE_CODE (s1
) == FIELD_DECL
1494 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
1495 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
1507 tu
->val
= needs_warning
? 2 : 10;
1513 struct tagged_tu_seen_cache
*tu
= alloc_tagged_tu_seen_cache (t1
, t2
);
1515 for (s1
= TYPE_FIELDS (t1
), s2
= TYPE_FIELDS (t2
);
1517 s1
= DECL_CHAIN (s1
), s2
= DECL_CHAIN (s2
))
1520 if (TREE_CODE (s1
) != TREE_CODE (s2
)
1521 || DECL_NAME (s1
) != DECL_NAME (s2
))
1523 result
= comptypes_internal (TREE_TYPE (s1
), TREE_TYPE (s2
),
1524 enum_and_int_p
, different_types_p
);
1528 needs_warning
= true;
1530 if (TREE_CODE (s1
) == FIELD_DECL
1531 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
1532 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
1538 tu
->val
= needs_warning
? 2 : 1;
1547 /* Return 1 if two function types F1 and F2 are compatible.
1548 If either type specifies no argument types,
1549 the other must specify a fixed number of self-promoting arg types.
1550 Otherwise, if one type specifies only the number of arguments,
1551 the other must specify that number of self-promoting arg types.
1552 Otherwise, the argument types must match.
1553 ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in comptypes_internal. */
1556 function_types_compatible_p (const_tree f1
, const_tree f2
,
1557 bool *enum_and_int_p
, bool *different_types_p
)
1560 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1565 ret1
= TREE_TYPE (f1
);
1566 ret2
= TREE_TYPE (f2
);
1568 /* 'volatile' qualifiers on a function's return type used to mean
1569 the function is noreturn. */
1570 if (TYPE_VOLATILE (ret1
) != TYPE_VOLATILE (ret2
))
1571 pedwarn (input_location
, 0, "function return types not compatible due to %<volatile%>");
1572 if (TYPE_VOLATILE (ret1
))
1573 ret1
= build_qualified_type (TYPE_MAIN_VARIANT (ret1
),
1574 TYPE_QUALS (ret1
) & ~TYPE_QUAL_VOLATILE
);
1575 if (TYPE_VOLATILE (ret2
))
1576 ret2
= build_qualified_type (TYPE_MAIN_VARIANT (ret2
),
1577 TYPE_QUALS (ret2
) & ~TYPE_QUAL_VOLATILE
);
1578 val
= comptypes_internal (ret1
, ret2
, enum_and_int_p
, different_types_p
);
1582 args1
= TYPE_ARG_TYPES (f1
);
1583 args2
= TYPE_ARG_TYPES (f2
);
1585 if (different_types_p
!= NULL
1586 && (args1
== 0) != (args2
== 0))
1587 *different_types_p
= true;
1589 /* An unspecified parmlist matches any specified parmlist
1590 whose argument types don't need default promotions. */
1594 if (!self_promoting_args_p (args2
))
1596 /* If one of these types comes from a non-prototype fn definition,
1597 compare that with the other type's arglist.
1598 If they don't match, ask for a warning (but no error). */
1599 if (TYPE_ACTUAL_ARG_TYPES (f1
)
1600 && 1 != type_lists_compatible_p (args2
, TYPE_ACTUAL_ARG_TYPES (f1
),
1601 enum_and_int_p
, different_types_p
))
1607 if (!self_promoting_args_p (args1
))
1609 if (TYPE_ACTUAL_ARG_TYPES (f2
)
1610 && 1 != type_lists_compatible_p (args1
, TYPE_ACTUAL_ARG_TYPES (f2
),
1611 enum_and_int_p
, different_types_p
))
1616 /* Both types have argument lists: compare them and propagate results. */
1617 val1
= type_lists_compatible_p (args1
, args2
, enum_and_int_p
,
1619 return val1
!= 1 ? val1
: val
;
1622 /* Check two lists of types for compatibility, returning 0 for
1623 incompatible, 1 for compatible, or 2 for compatible with
1624 warning. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1625 comptypes_internal. */
1628 type_lists_compatible_p (const_tree args1
, const_tree args2
,
1629 bool *enum_and_int_p
, bool *different_types_p
)
1631 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1637 tree a1
, mv1
, a2
, mv2
;
1638 if (args1
== 0 && args2
== 0)
1640 /* If one list is shorter than the other,
1641 they fail to match. */
1642 if (args1
== 0 || args2
== 0)
1644 mv1
= a1
= TREE_VALUE (args1
);
1645 mv2
= a2
= TREE_VALUE (args2
);
1646 if (mv1
&& mv1
!= error_mark_node
&& TREE_CODE (mv1
) != ARRAY_TYPE
)
1647 mv1
= TYPE_MAIN_VARIANT (mv1
);
1648 if (mv2
&& mv2
!= error_mark_node
&& TREE_CODE (mv2
) != ARRAY_TYPE
)
1649 mv2
= TYPE_MAIN_VARIANT (mv2
);
1650 /* A null pointer instead of a type
1651 means there is supposed to be an argument
1652 but nothing is specified about what type it has.
1653 So match anything that self-promotes. */
1654 if (different_types_p
!= NULL
1655 && (a1
== 0) != (a2
== 0))
1656 *different_types_p
= true;
1659 if (c_type_promotes_to (a2
) != a2
)
1664 if (c_type_promotes_to (a1
) != a1
)
1667 /* If one of the lists has an error marker, ignore this arg. */
1668 else if (TREE_CODE (a1
) == ERROR_MARK
1669 || TREE_CODE (a2
) == ERROR_MARK
)
1671 else if (!(newval
= comptypes_internal (mv1
, mv2
, enum_and_int_p
,
1672 different_types_p
)))
1674 if (different_types_p
!= NULL
)
1675 *different_types_p
= true;
1676 /* Allow wait (union {union wait *u; int *i} *)
1677 and wait (union wait *) to be compatible. */
1678 if (TREE_CODE (a1
) == UNION_TYPE
1679 && (TYPE_NAME (a1
) == 0
1680 || TYPE_TRANSPARENT_AGGR (a1
))
1681 && TREE_CODE (TYPE_SIZE (a1
)) == INTEGER_CST
1682 && tree_int_cst_equal (TYPE_SIZE (a1
),
1686 for (memb
= TYPE_FIELDS (a1
);
1687 memb
; memb
= DECL_CHAIN (memb
))
1689 tree mv3
= TREE_TYPE (memb
);
1690 if (mv3
&& mv3
!= error_mark_node
1691 && TREE_CODE (mv3
) != ARRAY_TYPE
)
1692 mv3
= TYPE_MAIN_VARIANT (mv3
);
1693 if (comptypes_internal (mv3
, mv2
, enum_and_int_p
,
1700 else if (TREE_CODE (a2
) == UNION_TYPE
1701 && (TYPE_NAME (a2
) == 0
1702 || TYPE_TRANSPARENT_AGGR (a2
))
1703 && TREE_CODE (TYPE_SIZE (a2
)) == INTEGER_CST
1704 && tree_int_cst_equal (TYPE_SIZE (a2
),
1708 for (memb
= TYPE_FIELDS (a2
);
1709 memb
; memb
= DECL_CHAIN (memb
))
1711 tree mv3
= TREE_TYPE (memb
);
1712 if (mv3
&& mv3
!= error_mark_node
1713 && TREE_CODE (mv3
) != ARRAY_TYPE
)
1714 mv3
= TYPE_MAIN_VARIANT (mv3
);
1715 if (comptypes_internal (mv3
, mv1
, enum_and_int_p
,
1726 /* comptypes said ok, but record if it said to warn. */
1730 args1
= TREE_CHAIN (args1
);
1731 args2
= TREE_CHAIN (args2
);
1735 /* Compute the size to increment a pointer by. */
1738 c_size_in_bytes (const_tree type
)
1740 enum tree_code code
= TREE_CODE (type
);
1742 if (code
== FUNCTION_TYPE
|| code
== VOID_TYPE
|| code
== ERROR_MARK
)
1743 return size_one_node
;
1745 if (!COMPLETE_OR_VOID_TYPE_P (type
))
1747 error ("arithmetic on pointer to an incomplete type");
1748 return size_one_node
;
1751 /* Convert in case a char is more than one unit. */
1752 return size_binop_loc (input_location
, CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
1753 size_int (TYPE_PRECISION (char_type_node
)
1757 /* Return either DECL or its known constant value (if it has one). */
1760 decl_constant_value (tree decl
)
1762 if (/* Don't change a variable array bound or initial value to a constant
1763 in a place where a variable is invalid. Note that DECL_INITIAL
1764 isn't valid for a PARM_DECL. */
1765 current_function_decl
!= 0
1766 && TREE_CODE (decl
) != PARM_DECL
1767 && !TREE_THIS_VOLATILE (decl
)
1768 && TREE_READONLY (decl
)
1769 && DECL_INITIAL (decl
) != 0
1770 && TREE_CODE (DECL_INITIAL (decl
)) != ERROR_MARK
1771 /* This is invalid if initial value is not constant.
1772 If it has either a function call, a memory reference,
1773 or a variable, then re-evaluating it could give different results. */
1774 && TREE_CONSTANT (DECL_INITIAL (decl
))
1775 /* Check for cases where this is sub-optimal, even though valid. */
1776 && TREE_CODE (DECL_INITIAL (decl
)) != CONSTRUCTOR
)
1777 return DECL_INITIAL (decl
);
1781 /* Convert the array expression EXP to a pointer. */
1783 array_to_pointer_conversion (location_t loc
, tree exp
)
1785 tree orig_exp
= exp
;
1786 tree type
= TREE_TYPE (exp
);
1788 tree restype
= TREE_TYPE (type
);
1791 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
1793 STRIP_TYPE_NOPS (exp
);
1795 if (TREE_NO_WARNING (orig_exp
))
1796 TREE_NO_WARNING (exp
) = 1;
1798 ptrtype
= build_pointer_type (restype
);
1800 if (TREE_CODE (exp
) == INDIRECT_REF
)
1801 return convert (ptrtype
, TREE_OPERAND (exp
, 0));
1803 adr
= build_unary_op (loc
, ADDR_EXPR
, exp
, 1);
1804 return convert (ptrtype
, adr
);
1807 /* Convert the function expression EXP to a pointer. */
1809 function_to_pointer_conversion (location_t loc
, tree exp
)
1811 tree orig_exp
= exp
;
1813 gcc_assert (TREE_CODE (TREE_TYPE (exp
)) == FUNCTION_TYPE
);
1815 STRIP_TYPE_NOPS (exp
);
1817 if (TREE_NO_WARNING (orig_exp
))
1818 TREE_NO_WARNING (exp
) = 1;
1820 return build_unary_op (loc
, ADDR_EXPR
, exp
, 0);
1823 /* Mark EXP as read, not just set, for set but not used -Wunused
1824 warning purposes. */
1827 mark_exp_read (tree exp
)
1829 switch (TREE_CODE (exp
))
1833 DECL_READ_P (exp
) = 1;
1842 mark_exp_read (TREE_OPERAND (exp
, 0));
1845 case C_MAYBE_CONST_EXPR
:
1846 mark_exp_read (TREE_OPERAND (exp
, 1));
1853 /* Perform the default conversion of arrays and functions to pointers.
1854 Return the result of converting EXP. For any other expression, just
1857 LOC is the location of the expression. */
1860 default_function_array_conversion (location_t loc
, struct c_expr exp
)
1862 tree orig_exp
= exp
.value
;
1863 tree type
= TREE_TYPE (exp
.value
);
1864 enum tree_code code
= TREE_CODE (type
);
1870 bool not_lvalue
= false;
1871 bool lvalue_array_p
;
1873 while ((TREE_CODE (exp
.value
) == NON_LVALUE_EXPR
1874 || CONVERT_EXPR_P (exp
.value
))
1875 && TREE_TYPE (TREE_OPERAND (exp
.value
, 0)) == type
)
1877 if (TREE_CODE (exp
.value
) == NON_LVALUE_EXPR
)
1879 exp
.value
= TREE_OPERAND (exp
.value
, 0);
1882 if (TREE_NO_WARNING (orig_exp
))
1883 TREE_NO_WARNING (exp
.value
) = 1;
1885 lvalue_array_p
= !not_lvalue
&& lvalue_p (exp
.value
);
1886 if (!flag_isoc99
&& !lvalue_array_p
)
1888 /* Before C99, non-lvalue arrays do not decay to pointers.
1889 Normally, using such an array would be invalid; but it can
1890 be used correctly inside sizeof or as a statement expression.
1891 Thus, do not give an error here; an error will result later. */
1895 exp
.value
= array_to_pointer_conversion (loc
, exp
.value
);
1899 exp
.value
= function_to_pointer_conversion (loc
, exp
.value
);
1909 default_function_array_read_conversion (location_t loc
, struct c_expr exp
)
1911 mark_exp_read (exp
.value
);
1912 return default_function_array_conversion (loc
, exp
);
1915 /* EXP is an expression of integer type. Apply the integer promotions
1916 to it and return the promoted value. */
1919 perform_integral_promotions (tree exp
)
1921 tree type
= TREE_TYPE (exp
);
1922 enum tree_code code
= TREE_CODE (type
);
1924 gcc_assert (INTEGRAL_TYPE_P (type
));
1926 /* Normally convert enums to int,
1927 but convert wide enums to something wider. */
1928 if (code
== ENUMERAL_TYPE
)
1930 type
= c_common_type_for_size (MAX (TYPE_PRECISION (type
),
1931 TYPE_PRECISION (integer_type_node
)),
1932 ((TYPE_PRECISION (type
)
1933 >= TYPE_PRECISION (integer_type_node
))
1934 && TYPE_UNSIGNED (type
)));
1936 return convert (type
, exp
);
1939 /* ??? This should no longer be needed now bit-fields have their
1941 if (TREE_CODE (exp
) == COMPONENT_REF
1942 && DECL_C_BIT_FIELD (TREE_OPERAND (exp
, 1))
1943 /* If it's thinner than an int, promote it like a
1944 c_promoting_integer_type_p, otherwise leave it alone. */
1945 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp
, 1)),
1946 TYPE_PRECISION (integer_type_node
)))
1947 return convert (integer_type_node
, exp
);
1949 if (c_promoting_integer_type_p (type
))
1951 /* Preserve unsignedness if not really getting any wider. */
1952 if (TYPE_UNSIGNED (type
)
1953 && TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
))
1954 return convert (unsigned_type_node
, exp
);
1956 return convert (integer_type_node
, exp
);
1963 /* Perform default promotions for C data used in expressions.
1964 Enumeral types or short or char are converted to int.
1965 In addition, manifest constants symbols are replaced by their values. */
1968 default_conversion (tree exp
)
1971 tree type
= TREE_TYPE (exp
);
1972 enum tree_code code
= TREE_CODE (type
);
1975 mark_exp_read (exp
);
1977 /* Functions and arrays have been converted during parsing. */
1978 gcc_assert (code
!= FUNCTION_TYPE
);
1979 if (code
== ARRAY_TYPE
)
1982 /* Constants can be used directly unless they're not loadable. */
1983 if (TREE_CODE (exp
) == CONST_DECL
)
1984 exp
= DECL_INITIAL (exp
);
1986 /* Strip no-op conversions. */
1988 STRIP_TYPE_NOPS (exp
);
1990 if (TREE_NO_WARNING (orig_exp
))
1991 TREE_NO_WARNING (exp
) = 1;
1993 if (code
== VOID_TYPE
)
1995 error ("void value not ignored as it ought to be");
1996 return error_mark_node
;
1999 exp
= require_complete_type (exp
);
2000 if (exp
== error_mark_node
)
2001 return error_mark_node
;
2003 promoted_type
= targetm
.promoted_type (type
);
2005 return convert (promoted_type
, exp
);
2007 if (INTEGRAL_TYPE_P (type
))
2008 return perform_integral_promotions (exp
);
2013 /* Look up COMPONENT in a structure or union TYPE.
2015 If the component name is not found, returns NULL_TREE. Otherwise,
2016 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
2017 stepping down the chain to the component, which is in the last
2018 TREE_VALUE of the list. Normally the list is of length one, but if
2019 the component is embedded within (nested) anonymous structures or
2020 unions, the list steps down the chain to the component. */
2023 lookup_field (tree type
, tree component
)
2027 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
2028 to the field elements. Use a binary search on this array to quickly
2029 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
2030 will always be set for structures which have many elements. */
2032 if (TYPE_LANG_SPECIFIC (type
) && TYPE_LANG_SPECIFIC (type
)->s
)
2035 tree
*field_array
= &TYPE_LANG_SPECIFIC (type
)->s
->elts
[0];
2037 field
= TYPE_FIELDS (type
);
2039 top
= TYPE_LANG_SPECIFIC (type
)->s
->len
;
2040 while (top
- bot
> 1)
2042 half
= (top
- bot
+ 1) >> 1;
2043 field
= field_array
[bot
+half
];
2045 if (DECL_NAME (field
) == NULL_TREE
)
2047 /* Step through all anon unions in linear fashion. */
2048 while (DECL_NAME (field_array
[bot
]) == NULL_TREE
)
2050 field
= field_array
[bot
++];
2051 if (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
2052 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
2054 tree anon
= lookup_field (TREE_TYPE (field
), component
);
2057 return tree_cons (NULL_TREE
, field
, anon
);
2061 /* Entire record is only anon unions. */
2065 /* Restart the binary search, with new lower bound. */
2069 if (DECL_NAME (field
) == component
)
2071 if (DECL_NAME (field
) < component
)
2077 if (DECL_NAME (field_array
[bot
]) == component
)
2078 field
= field_array
[bot
];
2079 else if (DECL_NAME (field
) != component
)
2084 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
2086 if (DECL_NAME (field
) == NULL_TREE
2087 && (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
2088 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
))
2090 tree anon
= lookup_field (TREE_TYPE (field
), component
);
2093 return tree_cons (NULL_TREE
, field
, anon
);
2096 if (DECL_NAME (field
) == component
)
2100 if (field
== NULL_TREE
)
2104 return tree_cons (NULL_TREE
, field
, NULL_TREE
);
2107 /* Make an expression to refer to the COMPONENT field of structure or
2108 union value DATUM. COMPONENT is an IDENTIFIER_NODE. LOC is the
2109 location of the COMPONENT_REF. */
2112 build_component_ref (location_t loc
, tree datum
, tree component
)
2114 tree type
= TREE_TYPE (datum
);
2115 enum tree_code code
= TREE_CODE (type
);
2118 bool datum_lvalue
= lvalue_p (datum
);
2120 if (!objc_is_public (datum
, component
))
2121 return error_mark_node
;
2123 /* See if there is a field or component with name COMPONENT. */
2125 if (code
== RECORD_TYPE
|| code
== UNION_TYPE
)
2127 if (!COMPLETE_TYPE_P (type
))
2129 c_incomplete_type_error (NULL_TREE
, type
);
2130 return error_mark_node
;
2133 field
= lookup_field (type
, component
);
2137 error_at (loc
, "%qT has no member named %qE", type
, component
);
2138 return error_mark_node
;
2141 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2142 This might be better solved in future the way the C++ front
2143 end does it - by giving the anonymous entities each a
2144 separate name and type, and then have build_component_ref
2145 recursively call itself. We can't do that here. */
2148 tree subdatum
= TREE_VALUE (field
);
2151 bool use_datum_quals
;
2153 if (TREE_TYPE (subdatum
) == error_mark_node
)
2154 return error_mark_node
;
2156 /* If this is an rvalue, it does not have qualifiers in C
2157 standard terms and we must avoid propagating such
2158 qualifiers down to a non-lvalue array that is then
2159 converted to a pointer. */
2160 use_datum_quals
= (datum_lvalue
2161 || TREE_CODE (TREE_TYPE (subdatum
)) != ARRAY_TYPE
);
2163 quals
= TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum
)));
2164 if (use_datum_quals
)
2165 quals
|= TYPE_QUALS (TREE_TYPE (datum
));
2166 subtype
= c_build_qualified_type (TREE_TYPE (subdatum
), quals
);
2168 ref
= build3 (COMPONENT_REF
, subtype
, datum
, subdatum
,
2170 SET_EXPR_LOCATION (ref
, loc
);
2171 if (TREE_READONLY (subdatum
)
2172 || (use_datum_quals
&& TREE_READONLY (datum
)))
2173 TREE_READONLY (ref
) = 1;
2174 if (TREE_THIS_VOLATILE (subdatum
)
2175 || (use_datum_quals
&& TREE_THIS_VOLATILE (datum
)))
2176 TREE_THIS_VOLATILE (ref
) = 1;
2178 if (TREE_DEPRECATED (subdatum
))
2179 warn_deprecated_use (subdatum
, NULL_TREE
);
2183 field
= TREE_CHAIN (field
);
2189 else if (code
!= ERROR_MARK
)
2191 "request for member %qE in something not a structure or union",
2194 return error_mark_node
;
2197 /* Given an expression PTR for a pointer, return an expression
2198 for the value pointed to.
2199 ERRORSTRING is the name of the operator to appear in error messages.
2201 LOC is the location to use for the generated tree. */
2204 build_indirect_ref (location_t loc
, tree ptr
, ref_operator errstring
)
2206 tree pointer
= default_conversion (ptr
);
2207 tree type
= TREE_TYPE (pointer
);
2210 if (TREE_CODE (type
) == POINTER_TYPE
)
2212 if (CONVERT_EXPR_P (pointer
)
2213 || TREE_CODE (pointer
) == VIEW_CONVERT_EXPR
)
2215 /* If a warning is issued, mark it to avoid duplicates from
2216 the backend. This only needs to be done at
2217 warn_strict_aliasing > 2. */
2218 if (warn_strict_aliasing
> 2)
2219 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer
, 0)),
2220 type
, TREE_OPERAND (pointer
, 0)))
2221 TREE_NO_WARNING (pointer
) = 1;
2224 if (TREE_CODE (pointer
) == ADDR_EXPR
2225 && (TREE_TYPE (TREE_OPERAND (pointer
, 0))
2226 == TREE_TYPE (type
)))
2228 ref
= TREE_OPERAND (pointer
, 0);
2229 protected_set_expr_location (ref
, loc
);
2234 tree t
= TREE_TYPE (type
);
2236 ref
= build1 (INDIRECT_REF
, t
, pointer
);
2238 if (!COMPLETE_OR_VOID_TYPE_P (t
) && TREE_CODE (t
) != ARRAY_TYPE
)
2240 error_at (loc
, "dereferencing pointer to incomplete type");
2241 return error_mark_node
;
2243 if (VOID_TYPE_P (t
) && c_inhibit_evaluation_warnings
== 0)
2244 warning_at (loc
, 0, "dereferencing %<void *%> pointer");
2246 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2247 so that we get the proper error message if the result is used
2248 to assign to. Also, &* is supposed to be a no-op.
2249 And ANSI C seems to specify that the type of the result
2250 should be the const type. */
2251 /* A de-reference of a pointer to const is not a const. It is valid
2252 to change it via some other pointer. */
2253 TREE_READONLY (ref
) = TYPE_READONLY (t
);
2254 TREE_SIDE_EFFECTS (ref
)
2255 = TYPE_VOLATILE (t
) || TREE_SIDE_EFFECTS (pointer
);
2256 TREE_THIS_VOLATILE (ref
) = TYPE_VOLATILE (t
);
2257 protected_set_expr_location (ref
, loc
);
2261 else if (TREE_CODE (pointer
) != ERROR_MARK
)
2264 case RO_ARRAY_INDEXING
:
2266 "invalid type argument of array indexing (have %qT)",
2271 "invalid type argument of unary %<*%> (have %qT)",
2276 "invalid type argument of %<->%> (have %qT)",
2282 return error_mark_node
;
2285 /* This handles expressions of the form "a[i]", which denotes
2288 This is logically equivalent in C to *(a+i), but we may do it differently.
2289 If A is a variable or a member, we generate a primitive ARRAY_REF.
2290 This avoids forcing the array out of registers, and can work on
2291 arrays that are not lvalues (for example, members of structures returned
2294 LOC is the location to use for the returned expression. */
2297 build_array_ref (location_t loc
, tree array
, tree index
)
2300 bool swapped
= false;
2301 if (TREE_TYPE (array
) == error_mark_node
2302 || TREE_TYPE (index
) == error_mark_node
)
2303 return error_mark_node
;
2305 if (TREE_CODE (TREE_TYPE (array
)) != ARRAY_TYPE
2306 && TREE_CODE (TREE_TYPE (array
)) != POINTER_TYPE
)
2309 if (TREE_CODE (TREE_TYPE (index
)) != ARRAY_TYPE
2310 && TREE_CODE (TREE_TYPE (index
)) != POINTER_TYPE
)
2312 error_at (loc
, "subscripted value is neither array nor pointer");
2313 return error_mark_node
;
2321 if (!INTEGRAL_TYPE_P (TREE_TYPE (index
)))
2323 error_at (loc
, "array subscript is not an integer");
2324 return error_mark_node
;
2327 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array
))) == FUNCTION_TYPE
)
2329 error_at (loc
, "subscripted value is pointer to function");
2330 return error_mark_node
;
2333 /* ??? Existing practice has been to warn only when the char
2334 index is syntactically the index, not for char[array]. */
2336 warn_array_subscript_with_type_char (index
);
2338 /* Apply default promotions *after* noticing character types. */
2339 index
= default_conversion (index
);
2341 gcc_assert (TREE_CODE (TREE_TYPE (index
)) == INTEGER_TYPE
);
2343 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2347 /* An array that is indexed by a non-constant
2348 cannot be stored in a register; we must be able to do
2349 address arithmetic on its address.
2350 Likewise an array of elements of variable size. */
2351 if (TREE_CODE (index
) != INTEGER_CST
2352 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2353 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
)))) != INTEGER_CST
))
2355 if (!c_mark_addressable (array
))
2356 return error_mark_node
;
2358 /* An array that is indexed by a constant value which is not within
2359 the array bounds cannot be stored in a register either; because we
2360 would get a crash in store_bit_field/extract_bit_field when trying
2361 to access a non-existent part of the register. */
2362 if (TREE_CODE (index
) == INTEGER_CST
2363 && TYPE_DOMAIN (TREE_TYPE (array
))
2364 && !int_fits_type_p (index
, TYPE_DOMAIN (TREE_TYPE (array
))))
2366 if (!c_mark_addressable (array
))
2367 return error_mark_node
;
2373 while (TREE_CODE (foo
) == COMPONENT_REF
)
2374 foo
= TREE_OPERAND (foo
, 0);
2375 if (TREE_CODE (foo
) == VAR_DECL
&& C_DECL_REGISTER (foo
))
2376 pedwarn (loc
, OPT_pedantic
,
2377 "ISO C forbids subscripting %<register%> array");
2378 else if (!flag_isoc99
&& !lvalue_p (foo
))
2379 pedwarn (loc
, OPT_pedantic
,
2380 "ISO C90 forbids subscripting non-lvalue array");
2383 type
= TREE_TYPE (TREE_TYPE (array
));
2384 rval
= build4 (ARRAY_REF
, type
, array
, index
, NULL_TREE
, NULL_TREE
);
2385 /* Array ref is const/volatile if the array elements are
2386 or if the array is. */
2387 TREE_READONLY (rval
)
2388 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array
)))
2389 | TREE_READONLY (array
));
2390 TREE_SIDE_EFFECTS (rval
)
2391 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
2392 | TREE_SIDE_EFFECTS (array
));
2393 TREE_THIS_VOLATILE (rval
)
2394 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
2395 /* This was added by rms on 16 Nov 91.
2396 It fixes vol struct foo *a; a->elts[1]
2397 in an inline function.
2398 Hope it doesn't break something else. */
2399 | TREE_THIS_VOLATILE (array
));
2400 ret
= require_complete_type (rval
);
2401 protected_set_expr_location (ret
, loc
);
2406 tree ar
= default_conversion (array
);
2408 if (ar
== error_mark_node
)
2411 gcc_assert (TREE_CODE (TREE_TYPE (ar
)) == POINTER_TYPE
);
2412 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar
))) != FUNCTION_TYPE
);
2414 return build_indirect_ref
2415 (loc
, build_binary_op (loc
, PLUS_EXPR
, ar
, index
, 0),
2420 /* Build an external reference to identifier ID. FUN indicates
2421 whether this will be used for a function call. LOC is the source
2422 location of the identifier. This sets *TYPE to the type of the
2423 identifier, which is not the same as the type of the returned value
2424 for CONST_DECLs defined as enum constants. If the type of the
2425 identifier is not available, *TYPE is set to NULL. */
2427 build_external_ref (location_t loc
, tree id
, int fun
, tree
*type
)
2430 tree decl
= lookup_name (id
);
2432 /* In Objective-C, an instance variable (ivar) may be preferred to
2433 whatever lookup_name() found. */
2434 decl
= objc_lookup_ivar (decl
, id
);
2437 if (decl
&& decl
!= error_mark_node
)
2440 *type
= TREE_TYPE (ref
);
2443 /* Implicit function declaration. */
2444 ref
= implicitly_declare (loc
, id
);
2445 else if (decl
== error_mark_node
)
2446 /* Don't complain about something that's already been
2447 complained about. */
2448 return error_mark_node
;
2451 undeclared_variable (loc
, id
);
2452 return error_mark_node
;
2455 if (TREE_TYPE (ref
) == error_mark_node
)
2456 return error_mark_node
;
2458 if (TREE_DEPRECATED (ref
))
2459 warn_deprecated_use (ref
, NULL_TREE
);
2461 /* Recursive call does not count as usage. */
2462 if (ref
!= current_function_decl
)
2464 TREE_USED (ref
) = 1;
2467 if (TREE_CODE (ref
) == FUNCTION_DECL
&& !in_alignof
)
2469 if (!in_sizeof
&& !in_typeof
)
2470 C_DECL_USED (ref
) = 1;
2471 else if (DECL_INITIAL (ref
) == 0
2472 && DECL_EXTERNAL (ref
)
2473 && !TREE_PUBLIC (ref
))
2474 record_maybe_used_decl (ref
);
2477 if (TREE_CODE (ref
) == CONST_DECL
)
2479 used_types_insert (TREE_TYPE (ref
));
2482 && TREE_CODE (TREE_TYPE (ref
)) == ENUMERAL_TYPE
2483 && C_TYPE_DEFINED_IN_STRUCT (TREE_TYPE (ref
)))
2485 warning_at (loc
, OPT_Wc___compat
,
2486 ("enum constant defined in struct or union "
2487 "is not visible in C++"));
2488 inform (DECL_SOURCE_LOCATION (ref
), "enum constant defined here");
2491 ref
= DECL_INITIAL (ref
);
2492 TREE_CONSTANT (ref
) = 1;
2494 else if (current_function_decl
!= 0
2495 && !DECL_FILE_SCOPE_P (current_function_decl
)
2496 && (TREE_CODE (ref
) == VAR_DECL
2497 || TREE_CODE (ref
) == PARM_DECL
2498 || TREE_CODE (ref
) == FUNCTION_DECL
))
2500 tree context
= decl_function_context (ref
);
2502 if (context
!= 0 && context
!= current_function_decl
)
2503 DECL_NONLOCAL (ref
) = 1;
2505 /* C99 6.7.4p3: An inline definition of a function with external
2506 linkage ... shall not contain a reference to an identifier with
2507 internal linkage. */
2508 else if (current_function_decl
!= 0
2509 && DECL_DECLARED_INLINE_P (current_function_decl
)
2510 && DECL_EXTERNAL (current_function_decl
)
2511 && VAR_OR_FUNCTION_DECL_P (ref
)
2512 && (TREE_CODE (ref
) != VAR_DECL
|| TREE_STATIC (ref
))
2513 && ! TREE_PUBLIC (ref
)
2514 && DECL_CONTEXT (ref
) != current_function_decl
)
2515 record_inline_static (loc
, current_function_decl
, ref
,
2521 /* Record details of decls possibly used inside sizeof or typeof. */
2522 struct maybe_used_decl
2526 /* The level seen at (in_sizeof + in_typeof). */
2528 /* The next one at this level or above, or NULL. */
2529 struct maybe_used_decl
*next
;
2532 static struct maybe_used_decl
*maybe_used_decls
;
2534 /* Record that DECL, an undefined static function reference seen
2535 inside sizeof or typeof, might be used if the operand of sizeof is
2536 a VLA type or the operand of typeof is a variably modified
2540 record_maybe_used_decl (tree decl
)
2542 struct maybe_used_decl
*t
= XOBNEW (&parser_obstack
, struct maybe_used_decl
);
2544 t
->level
= in_sizeof
+ in_typeof
;
2545 t
->next
= maybe_used_decls
;
2546 maybe_used_decls
= t
;
2549 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2550 USED is false, just discard them. If it is true, mark them used
2551 (if no longer inside sizeof or typeof) or move them to the next
2552 level up (if still inside sizeof or typeof). */
2555 pop_maybe_used (bool used
)
2557 struct maybe_used_decl
*p
= maybe_used_decls
;
2558 int cur_level
= in_sizeof
+ in_typeof
;
2559 while (p
&& p
->level
> cur_level
)
2564 C_DECL_USED (p
->decl
) = 1;
2566 p
->level
= cur_level
;
2570 if (!used
|| cur_level
== 0)
2571 maybe_used_decls
= p
;
2574 /* Return the result of sizeof applied to EXPR. */
2577 c_expr_sizeof_expr (location_t loc
, struct c_expr expr
)
2580 if (expr
.value
== error_mark_node
)
2582 ret
.value
= error_mark_node
;
2583 ret
.original_code
= ERROR_MARK
;
2584 ret
.original_type
= NULL
;
2585 pop_maybe_used (false);
2589 bool expr_const_operands
= true;
2590 tree folded_expr
= c_fully_fold (expr
.value
, require_constant_value
,
2591 &expr_const_operands
);
2592 ret
.value
= c_sizeof (loc
, TREE_TYPE (folded_expr
));
2593 ret
.original_code
= ERROR_MARK
;
2594 ret
.original_type
= NULL
;
2595 if (c_vla_type_p (TREE_TYPE (folded_expr
)))
2597 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2598 ret
.value
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (ret
.value
),
2599 folded_expr
, ret
.value
);
2600 C_MAYBE_CONST_EXPR_NON_CONST (ret
.value
) = !expr_const_operands
;
2601 SET_EXPR_LOCATION (ret
.value
, loc
);
2603 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (folded_expr
)));
2608 /* Return the result of sizeof applied to T, a structure for the type
2609 name passed to sizeof (rather than the type itself). LOC is the
2610 location of the original expression. */
2613 c_expr_sizeof_type (location_t loc
, struct c_type_name
*t
)
2617 tree type_expr
= NULL_TREE
;
2618 bool type_expr_const
= true;
2619 type
= groktypename (t
, &type_expr
, &type_expr_const
);
2620 ret
.value
= c_sizeof (loc
, type
);
2621 ret
.original_code
= ERROR_MARK
;
2622 ret
.original_type
= NULL
;
2623 if ((type_expr
|| TREE_CODE (ret
.value
) == INTEGER_CST
)
2624 && c_vla_type_p (type
))
2626 /* If the type is a [*] array, it is a VLA but is represented as
2627 having a size of zero. In such a case we must ensure that
2628 the result of sizeof does not get folded to a constant by
2629 c_fully_fold, because if the size is evaluated the result is
2630 not constant and so constraints on zero or negative size
2631 arrays must not be applied when this sizeof call is inside
2632 another array declarator. */
2634 type_expr
= integer_zero_node
;
2635 ret
.value
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (ret
.value
),
2636 type_expr
, ret
.value
);
2637 C_MAYBE_CONST_EXPR_NON_CONST (ret
.value
) = !type_expr_const
;
2639 pop_maybe_used (type
!= error_mark_node
2640 ? C_TYPE_VARIABLE_SIZE (type
) : false);
2644 /* Build a function call to function FUNCTION with parameters PARAMS.
2645 The function call is at LOC.
2646 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2647 TREE_VALUE of each node is a parameter-expression.
2648 FUNCTION's data type may be a function type or a pointer-to-function. */
2651 build_function_call (location_t loc
, tree function
, tree params
)
2656 vec
= VEC_alloc (tree
, gc
, list_length (params
));
2657 for (; params
; params
= TREE_CHAIN (params
))
2658 VEC_quick_push (tree
, vec
, TREE_VALUE (params
));
2659 ret
= build_function_call_vec (loc
, function
, vec
, NULL
);
2660 VEC_free (tree
, gc
, vec
);
2664 /* Build a function call to function FUNCTION with parameters PARAMS.
2665 ORIGTYPES, if not NULL, is a vector of types; each element is
2666 either NULL or the original type of the corresponding element in
2667 PARAMS. The original type may differ from TREE_TYPE of the
2668 parameter for enums. FUNCTION's data type may be a function type
2669 or pointer-to-function. This function changes the elements of
2673 build_function_call_vec (location_t loc
, tree function
, VEC(tree
,gc
) *params
,
2674 VEC(tree
,gc
) *origtypes
)
2676 tree fntype
, fundecl
= 0;
2677 tree name
= NULL_TREE
, result
;
2683 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2684 STRIP_TYPE_NOPS (function
);
2686 /* Convert anything with function type to a pointer-to-function. */
2687 if (TREE_CODE (function
) == FUNCTION_DECL
)
2689 /* Implement type-directed function overloading for builtins.
2690 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2691 handle all the type checking. The result is a complete expression
2692 that implements this function call. */
2693 tem
= resolve_overloaded_builtin (loc
, function
, params
);
2697 name
= DECL_NAME (function
);
2700 if (TREE_CODE (TREE_TYPE (function
)) == FUNCTION_TYPE
)
2701 function
= function_to_pointer_conversion (loc
, function
);
2703 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2704 expressions, like those used for ObjC messenger dispatches. */
2705 if (!VEC_empty (tree
, params
))
2706 function
= objc_rewrite_function_call (function
,
2707 VEC_index (tree
, params
, 0));
2709 function
= c_fully_fold (function
, false, NULL
);
2711 fntype
= TREE_TYPE (function
);
2713 if (TREE_CODE (fntype
) == ERROR_MARK
)
2714 return error_mark_node
;
2716 if (!(TREE_CODE (fntype
) == POINTER_TYPE
2717 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
))
2719 error_at (loc
, "called object %qE is not a function", function
);
2720 return error_mark_node
;
2723 if (fundecl
&& TREE_THIS_VOLATILE (fundecl
))
2724 current_function_returns_abnormally
= 1;
2726 /* fntype now gets the type of function pointed to. */
2727 fntype
= TREE_TYPE (fntype
);
2729 /* Convert the parameters to the types declared in the
2730 function prototype, or apply default promotions. */
2732 nargs
= convert_arguments (TYPE_ARG_TYPES (fntype
), params
, origtypes
,
2735 return error_mark_node
;
2737 /* Check that the function is called through a compatible prototype.
2738 If it is not, replace the call by a trap, wrapped up in a compound
2739 expression if necessary. This has the nice side-effect to prevent
2740 the tree-inliner from generating invalid assignment trees which may
2741 blow up in the RTL expander later. */
2742 if (CONVERT_EXPR_P (function
)
2743 && TREE_CODE (tem
= TREE_OPERAND (function
, 0)) == ADDR_EXPR
2744 && TREE_CODE (tem
= TREE_OPERAND (tem
, 0)) == FUNCTION_DECL
2745 && !comptypes (fntype
, TREE_TYPE (tem
)))
2747 tree return_type
= TREE_TYPE (fntype
);
2748 tree trap
= build_function_call (loc
, built_in_decls
[BUILT_IN_TRAP
],
2752 /* This situation leads to run-time undefined behavior. We can't,
2753 therefore, simply error unless we can prove that all possible
2754 executions of the program must execute the code. */
2755 if (warning_at (loc
, 0, "function called through a non-compatible type"))
2756 /* We can, however, treat "undefined" any way we please.
2757 Call abort to encourage the user to fix the program. */
2758 inform (loc
, "if this code is reached, the program will abort");
2759 /* Before the abort, allow the function arguments to exit or
2761 for (i
= 0; i
< nargs
; i
++)
2762 trap
= build2 (COMPOUND_EXPR
, void_type_node
,
2763 VEC_index (tree
, params
, i
), trap
);
2765 if (VOID_TYPE_P (return_type
))
2767 if (TYPE_QUALS (return_type
) != TYPE_UNQUALIFIED
)
2769 "function with qualified void return type called");
2776 if (AGGREGATE_TYPE_P (return_type
))
2777 rhs
= build_compound_literal (loc
, return_type
,
2778 build_constructor (return_type
, 0),
2781 rhs
= fold_convert_loc (loc
, return_type
, integer_zero_node
);
2783 return require_complete_type (build2 (COMPOUND_EXPR
, return_type
,
2788 argarray
= VEC_address (tree
, params
);
2790 /* Check that arguments to builtin functions match the expectations. */
2792 && DECL_BUILT_IN (fundecl
)
2793 && DECL_BUILT_IN_CLASS (fundecl
) == BUILT_IN_NORMAL
2794 && !check_builtin_function_arguments (fundecl
, nargs
, argarray
))
2795 return error_mark_node
;
2797 /* Check that the arguments to the function are valid. */
2798 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
2799 TYPE_ARG_TYPES (fntype
));
2801 if (name
!= NULL_TREE
2802 && !strncmp (IDENTIFIER_POINTER (name
), "__builtin_", 10))
2804 if (require_constant_value
)
2806 fold_build_call_array_initializer_loc (loc
, TREE_TYPE (fntype
),
2807 function
, nargs
, argarray
);
2809 result
= fold_build_call_array_loc (loc
, TREE_TYPE (fntype
),
2810 function
, nargs
, argarray
);
2811 if (TREE_CODE (result
) == NOP_EXPR
2812 && TREE_CODE (TREE_OPERAND (result
, 0)) == INTEGER_CST
)
2813 STRIP_TYPE_NOPS (result
);
2816 result
= build_call_array_loc (loc
, TREE_TYPE (fntype
),
2817 function
, nargs
, argarray
);
2819 if (VOID_TYPE_P (TREE_TYPE (result
)))
2821 if (TYPE_QUALS (TREE_TYPE (result
)) != TYPE_UNQUALIFIED
)
2823 "function with qualified void return type called");
2826 return require_complete_type (result
);
2829 /* Convert the argument expressions in the vector VALUES
2830 to the types in the list TYPELIST.
2832 If TYPELIST is exhausted, or when an element has NULL as its type,
2833 perform the default conversions.
2835 ORIGTYPES is the original types of the expressions in VALUES. This
2836 holds the type of enum values which have been converted to integral
2837 types. It may be NULL.
2839 FUNCTION is a tree for the called function. It is used only for
2840 error messages, where it is formatted with %qE.
2842 This is also where warnings about wrong number of args are generated.
2844 Returns the actual number of arguments processed (which may be less
2845 than the length of VALUES in some error situations), or -1 on
2849 convert_arguments (tree typelist
, VEC(tree
,gc
) *values
,
2850 VEC(tree
,gc
) *origtypes
, tree function
, tree fundecl
)
2853 unsigned int parmnum
;
2854 bool error_args
= false;
2855 const bool type_generic
= fundecl
2856 && lookup_attribute ("type generic", TYPE_ATTRIBUTES(TREE_TYPE (fundecl
)));
2857 bool type_generic_remove_excess_precision
= false;
2860 /* Change pointer to function to the function itself for
2862 if (TREE_CODE (function
) == ADDR_EXPR
2863 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
2864 function
= TREE_OPERAND (function
, 0);
2866 /* Handle an ObjC selector specially for diagnostics. */
2867 selector
= objc_message_selector ();
2869 /* For type-generic built-in functions, determine whether excess
2870 precision should be removed (classification) or not
2873 && DECL_BUILT_IN (fundecl
)
2874 && DECL_BUILT_IN_CLASS (fundecl
) == BUILT_IN_NORMAL
)
2876 switch (DECL_FUNCTION_CODE (fundecl
))
2878 case BUILT_IN_ISFINITE
:
2879 case BUILT_IN_ISINF
:
2880 case BUILT_IN_ISINF_SIGN
:
2881 case BUILT_IN_ISNAN
:
2882 case BUILT_IN_ISNORMAL
:
2883 case BUILT_IN_FPCLASSIFY
:
2884 type_generic_remove_excess_precision
= true;
2888 type_generic_remove_excess_precision
= false;
2893 /* Scan the given expressions and types, producing individual
2894 converted arguments. */
2896 for (typetail
= typelist
, parmnum
= 0;
2897 VEC_iterate (tree
, values
, parmnum
, val
);
2900 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
2901 tree valtype
= TREE_TYPE (val
);
2902 tree rname
= function
;
2903 int argnum
= parmnum
+ 1;
2904 const char *invalid_func_diag
;
2905 bool excess_precision
= false;
2909 if (type
== void_type_node
)
2911 error_at (input_location
,
2912 "too many arguments to function %qE", function
);
2913 if (fundecl
&& !DECL_BUILT_IN (fundecl
))
2914 inform (DECL_SOURCE_LOCATION (fundecl
), "declared here");
2918 if (selector
&& argnum
> 2)
2924 npc
= null_pointer_constant_p (val
);
2926 /* If there is excess precision and a prototype, convert once to
2927 the required type rather than converting via the semantic
2928 type. Likewise without a prototype a float value represented
2929 as long double should be converted once to double. But for
2930 type-generic classification functions excess precision must
2932 if (TREE_CODE (val
) == EXCESS_PRECISION_EXPR
2933 && (type
|| !type_generic
|| !type_generic_remove_excess_precision
))
2935 val
= TREE_OPERAND (val
, 0);
2936 excess_precision
= true;
2938 val
= c_fully_fold (val
, false, NULL
);
2939 STRIP_TYPE_NOPS (val
);
2941 val
= require_complete_type (val
);
2945 /* Formal parm type is specified by a function prototype. */
2947 if (type
== error_mark_node
|| !COMPLETE_TYPE_P (type
))
2949 error ("type of formal parameter %d is incomplete", parmnum
+ 1);
2956 /* Optionally warn about conversions that
2957 differ from the default conversions. */
2958 if (warn_traditional_conversion
|| warn_traditional
)
2960 unsigned int formal_prec
= TYPE_PRECISION (type
);
2962 if (INTEGRAL_TYPE_P (type
)
2963 && TREE_CODE (valtype
) == REAL_TYPE
)
2964 warning (0, "passing argument %d of %qE as integer "
2965 "rather than floating due to prototype",
2967 if (INTEGRAL_TYPE_P (type
)
2968 && TREE_CODE (valtype
) == COMPLEX_TYPE
)
2969 warning (0, "passing argument %d of %qE as integer "
2970 "rather than complex due to prototype",
2972 else if (TREE_CODE (type
) == COMPLEX_TYPE
2973 && TREE_CODE (valtype
) == REAL_TYPE
)
2974 warning (0, "passing argument %d of %qE as complex "
2975 "rather than floating due to prototype",
2977 else if (TREE_CODE (type
) == REAL_TYPE
2978 && INTEGRAL_TYPE_P (valtype
))
2979 warning (0, "passing argument %d of %qE as floating "
2980 "rather than integer due to prototype",
2982 else if (TREE_CODE (type
) == COMPLEX_TYPE
2983 && INTEGRAL_TYPE_P (valtype
))
2984 warning (0, "passing argument %d of %qE as complex "
2985 "rather than integer due to prototype",
2987 else if (TREE_CODE (type
) == REAL_TYPE
2988 && TREE_CODE (valtype
) == COMPLEX_TYPE
)
2989 warning (0, "passing argument %d of %qE as floating "
2990 "rather than complex due to prototype",
2992 /* ??? At some point, messages should be written about
2993 conversions between complex types, but that's too messy
2995 else if (TREE_CODE (type
) == REAL_TYPE
2996 && TREE_CODE (valtype
) == REAL_TYPE
)
2998 /* Warn if any argument is passed as `float',
2999 since without a prototype it would be `double'. */
3000 if (formal_prec
== TYPE_PRECISION (float_type_node
)
3001 && type
!= dfloat32_type_node
)
3002 warning (0, "passing argument %d of %qE as %<float%> "
3003 "rather than %<double%> due to prototype",
3006 /* Warn if mismatch between argument and prototype
3007 for decimal float types. Warn of conversions with
3008 binary float types and of precision narrowing due to
3010 else if (type
!= valtype
3011 && (type
== dfloat32_type_node
3012 || type
== dfloat64_type_node
3013 || type
== dfloat128_type_node
3014 || valtype
== dfloat32_type_node
3015 || valtype
== dfloat64_type_node
3016 || valtype
== dfloat128_type_node
)
3018 <= TYPE_PRECISION (valtype
)
3019 || (type
== dfloat128_type_node
3021 != dfloat64_type_node
3023 != dfloat32_type_node
)))
3024 || (type
== dfloat64_type_node
3026 != dfloat32_type_node
))))
3027 warning (0, "passing argument %d of %qE as %qT "
3028 "rather than %qT due to prototype",
3029 argnum
, rname
, type
, valtype
);
3032 /* Detect integer changing in width or signedness.
3033 These warnings are only activated with
3034 -Wtraditional-conversion, not with -Wtraditional. */
3035 else if (warn_traditional_conversion
&& INTEGRAL_TYPE_P (type
)
3036 && INTEGRAL_TYPE_P (valtype
))
3038 tree would_have_been
= default_conversion (val
);
3039 tree type1
= TREE_TYPE (would_have_been
);
3041 if (TREE_CODE (type
) == ENUMERAL_TYPE
3042 && (TYPE_MAIN_VARIANT (type
)
3043 == TYPE_MAIN_VARIANT (valtype
)))
3044 /* No warning if function asks for enum
3045 and the actual arg is that enum type. */
3047 else if (formal_prec
!= TYPE_PRECISION (type1
))
3048 warning (OPT_Wtraditional_conversion
,
3049 "passing argument %d of %qE "
3050 "with different width due to prototype",
3052 else if (TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (type1
))
3054 /* Don't complain if the formal parameter type
3055 is an enum, because we can't tell now whether
3056 the value was an enum--even the same enum. */
3057 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
3059 else if (TREE_CODE (val
) == INTEGER_CST
3060 && int_fits_type_p (val
, type
))
3061 /* Change in signedness doesn't matter
3062 if a constant value is unaffected. */
3064 /* If the value is extended from a narrower
3065 unsigned type, it doesn't matter whether we
3066 pass it as signed or unsigned; the value
3067 certainly is the same either way. */
3068 else if (TYPE_PRECISION (valtype
) < TYPE_PRECISION (type
)
3069 && TYPE_UNSIGNED (valtype
))
3071 else if (TYPE_UNSIGNED (type
))
3072 warning (OPT_Wtraditional_conversion
,
3073 "passing argument %d of %qE "
3074 "as unsigned due to prototype",
3077 warning (OPT_Wtraditional_conversion
,
3078 "passing argument %d of %qE "
3079 "as signed due to prototype", argnum
, rname
);
3083 /* Possibly restore an EXCESS_PRECISION_EXPR for the
3084 sake of better warnings from convert_and_check. */
3085 if (excess_precision
)
3086 val
= build1 (EXCESS_PRECISION_EXPR
, valtype
, val
);
3087 origtype
= (origtypes
== NULL
3089 : VEC_index (tree
, origtypes
, parmnum
));
3090 parmval
= convert_for_assignment (input_location
, type
, val
,
3091 origtype
, ic_argpass
, npc
,
3095 if (targetm
.calls
.promote_prototypes (fundecl
? TREE_TYPE (fundecl
) : 0)
3096 && INTEGRAL_TYPE_P (type
)
3097 && (TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)))
3098 parmval
= default_conversion (parmval
);
3101 else if (TREE_CODE (valtype
) == REAL_TYPE
3102 && (TYPE_PRECISION (valtype
)
3103 < TYPE_PRECISION (double_type_node
))
3104 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (valtype
)))
3109 /* Convert `float' to `double'. */
3110 parmval
= convert (double_type_node
, val
);
3112 else if (excess_precision
&& !type_generic
)
3113 /* A "double" argument with excess precision being passed
3114 without a prototype or in variable arguments. */
3115 parmval
= convert (valtype
, val
);
3116 else if ((invalid_func_diag
=
3117 targetm
.calls
.invalid_arg_for_unprototyped_fn (typelist
, fundecl
, val
)))
3119 error (invalid_func_diag
);
3123 /* Convert `short' and `char' to full-size `int'. */
3124 parmval
= default_conversion (val
);
3126 VEC_replace (tree
, values
, parmnum
, parmval
);
3127 if (parmval
== error_mark_node
)
3131 typetail
= TREE_CHAIN (typetail
);
3134 gcc_assert (parmnum
== VEC_length (tree
, values
));
3136 if (typetail
!= 0 && TREE_VALUE (typetail
) != void_type_node
)
3138 error_at (input_location
,
3139 "too few arguments to function %qE", function
);
3140 if (fundecl
&& !DECL_BUILT_IN (fundecl
))
3141 inform (DECL_SOURCE_LOCATION (fundecl
), "declared here");
3145 return error_args
? -1 : (int) parmnum
;
3148 /* This is the entry point used by the parser to build unary operators
3149 in the input. CODE, a tree_code, specifies the unary operator, and
3150 ARG is the operand. For unary plus, the C parser currently uses
3151 CONVERT_EXPR for code.
3153 LOC is the location to use for the tree generated.
3157 parser_build_unary_op (location_t loc
, enum tree_code code
, struct c_expr arg
)
3159 struct c_expr result
;
3161 result
.value
= build_unary_op (loc
, code
, arg
.value
, 0);
3162 result
.original_code
= code
;
3163 result
.original_type
= NULL
;
3165 if (TREE_OVERFLOW_P (result
.value
) && !TREE_OVERFLOW_P (arg
.value
))
3166 overflow_warning (loc
, result
.value
);
3171 /* This is the entry point used by the parser to build binary operators
3172 in the input. CODE, a tree_code, specifies the binary operator, and
3173 ARG1 and ARG2 are the operands. In addition to constructing the
3174 expression, we check for operands that were written with other binary
3175 operators in a way that is likely to confuse the user.
3177 LOCATION is the location of the binary operator. */
3180 parser_build_binary_op (location_t location
, enum tree_code code
,
3181 struct c_expr arg1
, struct c_expr arg2
)
3183 struct c_expr result
;
3185 enum tree_code code1
= arg1
.original_code
;
3186 enum tree_code code2
= arg2
.original_code
;
3187 tree type1
= (arg1
.original_type
3188 ? arg1
.original_type
3189 : TREE_TYPE (arg1
.value
));
3190 tree type2
= (arg2
.original_type
3191 ? arg2
.original_type
3192 : TREE_TYPE (arg2
.value
));
3194 result
.value
= build_binary_op (location
, code
,
3195 arg1
.value
, arg2
.value
, 1);
3196 result
.original_code
= code
;
3197 result
.original_type
= NULL
;
3199 if (TREE_CODE (result
.value
) == ERROR_MARK
)
3202 if (location
!= UNKNOWN_LOCATION
)
3203 protected_set_expr_location (result
.value
, location
);
3205 /* Check for cases such as x+y<<z which users are likely
3207 if (warn_parentheses
)
3208 warn_about_parentheses (code
, code1
, arg1
.value
, code2
, arg2
.value
);
3210 if (warn_logical_op
)
3211 warn_logical_operator (input_location
, code
, TREE_TYPE (result
.value
),
3212 code1
, arg1
.value
, code2
, arg2
.value
);
3214 /* Warn about comparisons against string literals, with the exception
3215 of testing for equality or inequality of a string literal with NULL. */
3216 if (code
== EQ_EXPR
|| code
== NE_EXPR
)
3218 if ((code1
== STRING_CST
&& !integer_zerop (arg2
.value
))
3219 || (code2
== STRING_CST
&& !integer_zerop (arg1
.value
)))
3220 warning_at (location
, OPT_Waddress
,
3221 "comparison with string literal results in unspecified behavior");
3223 else if (TREE_CODE_CLASS (code
) == tcc_comparison
3224 && (code1
== STRING_CST
|| code2
== STRING_CST
))
3225 warning_at (location
, OPT_Waddress
,
3226 "comparison with string literal results in unspecified behavior");
3228 if (TREE_OVERFLOW_P (result
.value
)
3229 && !TREE_OVERFLOW_P (arg1
.value
)
3230 && !TREE_OVERFLOW_P (arg2
.value
))
3231 overflow_warning (location
, result
.value
);
3233 /* Warn about comparisons of different enum types. */
3234 if (warn_enum_compare
3235 && TREE_CODE_CLASS (code
) == tcc_comparison
3236 && TREE_CODE (type1
) == ENUMERAL_TYPE
3237 && TREE_CODE (type2
) == ENUMERAL_TYPE
3238 && TYPE_MAIN_VARIANT (type1
) != TYPE_MAIN_VARIANT (type2
))
3239 warning_at (location
, OPT_Wenum_compare
,
3240 "comparison between %qT and %qT",
3246 /* Return a tree for the difference of pointers OP0 and OP1.
3247 The resulting tree has type int. */
3250 pointer_diff (location_t loc
, tree op0
, tree op1
)
3252 tree restype
= ptrdiff_type_node
;
3253 tree result
, inttype
;
3255 addr_space_t as0
= TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (op0
)));
3256 addr_space_t as1
= TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (op1
)));
3257 tree target_type
= TREE_TYPE (TREE_TYPE (op0
));
3258 tree con0
, con1
, lit0
, lit1
;
3259 tree orig_op1
= op1
;
3261 /* If the operands point into different address spaces, we need to
3262 explicitly convert them to pointers into the common address space
3263 before we can subtract the numerical address values. */
3266 addr_space_t as_common
;
3269 /* Determine the common superset address space. This is guaranteed
3270 to exist because the caller verified that comp_target_types
3271 returned non-zero. */
3272 if (!addr_space_superset (as0
, as1
, &as_common
))
3275 common_type
= common_pointer_type (TREE_TYPE (op0
), TREE_TYPE (op1
));
3276 op0
= convert (common_type
, op0
);
3277 op1
= convert (common_type
, op1
);
3280 /* Determine integer type to perform computations in. This will usually
3281 be the same as the result type (ptrdiff_t), but may need to be a wider
3282 type if pointers for the address space are wider than ptrdiff_t. */
3283 if (TYPE_PRECISION (restype
) < TYPE_PRECISION (TREE_TYPE (op0
)))
3284 inttype
= lang_hooks
.types
.type_for_size
3285 (TYPE_PRECISION (TREE_TYPE (op0
)), 0);
3290 if (TREE_CODE (target_type
) == VOID_TYPE
)
3291 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3292 "pointer of type %<void *%> used in subtraction");
3293 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
3294 pedwarn (loc
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3295 "pointer to a function used in subtraction");
3297 /* If the conversion to ptrdiff_type does anything like widening or
3298 converting a partial to an integral mode, we get a convert_expression
3299 that is in the way to do any simplifications.
3300 (fold-const.c doesn't know that the extra bits won't be needed.
3301 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
3302 different mode in place.)
3303 So first try to find a common term here 'by hand'; we want to cover
3304 at least the cases that occur in legal static initializers. */
3305 if (CONVERT_EXPR_P (op0
)
3306 && (TYPE_PRECISION (TREE_TYPE (op0
))
3307 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0
, 0)))))
3308 con0
= TREE_OPERAND (op0
, 0);
3311 if (CONVERT_EXPR_P (op1
)
3312 && (TYPE_PRECISION (TREE_TYPE (op1
))
3313 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1
, 0)))))
3314 con1
= TREE_OPERAND (op1
, 0);
3318 if (TREE_CODE (con0
) == PLUS_EXPR
)
3320 lit0
= TREE_OPERAND (con0
, 1);
3321 con0
= TREE_OPERAND (con0
, 0);
3324 lit0
= integer_zero_node
;
3326 if (TREE_CODE (con1
) == PLUS_EXPR
)
3328 lit1
= TREE_OPERAND (con1
, 1);
3329 con1
= TREE_OPERAND (con1
, 0);
3332 lit1
= integer_zero_node
;
3334 if (operand_equal_p (con0
, con1
, 0))
3341 /* First do the subtraction as integers;
3342 then drop through to build the divide operator.
3343 Do not do default conversions on the minus operator
3344 in case restype is a short type. */
3346 op0
= build_binary_op (loc
,
3347 MINUS_EXPR
, convert (inttype
, op0
),
3348 convert (inttype
, op1
), 0);
3349 /* This generates an error if op1 is pointer to incomplete type. */
3350 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1
))))
3351 error_at (loc
, "arithmetic on pointer to an incomplete type");
3353 /* This generates an error if op0 is pointer to incomplete type. */
3354 op1
= c_size_in_bytes (target_type
);
3356 /* Divide by the size, in easiest possible way. */
3357 result
= fold_build2_loc (loc
, EXACT_DIV_EXPR
, inttype
,
3358 op0
, convert (inttype
, op1
));
3360 /* Convert to final result type if necessary. */
3361 return convert (restype
, result
);
3364 /* Construct and perhaps optimize a tree representation
3365 for a unary operation. CODE, a tree_code, specifies the operation
3366 and XARG is the operand.
3367 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
3368 the default promotions (such as from short to int).
3369 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
3370 allows non-lvalues; this is only used to handle conversion of non-lvalue
3371 arrays to pointers in C99.
3373 LOCATION is the location of the operator. */
3376 build_unary_op (location_t location
,
3377 enum tree_code code
, tree xarg
, int flag
)
3379 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
3382 enum tree_code typecode
;
3384 tree ret
= error_mark_node
;
3385 tree eptype
= NULL_TREE
;
3386 int noconvert
= flag
;
3387 const char *invalid_op_diag
;
3390 int_operands
= EXPR_INT_CONST_OPERANDS (xarg
);
3392 arg
= remove_c_maybe_const_expr (arg
);
3394 if (code
!= ADDR_EXPR
)
3395 arg
= require_complete_type (arg
);
3397 typecode
= TREE_CODE (TREE_TYPE (arg
));
3398 if (typecode
== ERROR_MARK
)
3399 return error_mark_node
;
3400 if (typecode
== ENUMERAL_TYPE
|| typecode
== BOOLEAN_TYPE
)
3401 typecode
= INTEGER_TYPE
;
3403 if ((invalid_op_diag
3404 = targetm
.invalid_unary_op (code
, TREE_TYPE (xarg
))))
3406 error_at (location
, invalid_op_diag
);
3407 return error_mark_node
;
3410 if (TREE_CODE (arg
) == EXCESS_PRECISION_EXPR
)
3412 eptype
= TREE_TYPE (arg
);
3413 arg
= TREE_OPERAND (arg
, 0);
3419 /* This is used for unary plus, because a CONVERT_EXPR
3420 is enough to prevent anybody from looking inside for
3421 associativity, but won't generate any code. */
3422 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
3423 || typecode
== FIXED_POINT_TYPE
|| typecode
== COMPLEX_TYPE
3424 || typecode
== VECTOR_TYPE
))
3426 error_at (location
, "wrong type argument to unary plus");
3427 return error_mark_node
;
3429 else if (!noconvert
)
3430 arg
= default_conversion (arg
);
3431 arg
= non_lvalue_loc (location
, arg
);
3435 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
3436 || typecode
== FIXED_POINT_TYPE
|| typecode
== COMPLEX_TYPE
3437 || typecode
== VECTOR_TYPE
))
3439 error_at (location
, "wrong type argument to unary minus");
3440 return error_mark_node
;
3442 else if (!noconvert
)
3443 arg
= default_conversion (arg
);
3447 /* ~ works on integer types and non float vectors. */
3448 if (typecode
== INTEGER_TYPE
3449 || (typecode
== VECTOR_TYPE
3450 && !VECTOR_FLOAT_TYPE_P (TREE_TYPE (arg
))))
3453 arg
= default_conversion (arg
);
3455 else if (typecode
== COMPLEX_TYPE
)
3458 pedwarn (location
, OPT_pedantic
,
3459 "ISO C does not support %<~%> for complex conjugation");
3461 arg
= default_conversion (arg
);
3465 error_at (location
, "wrong type argument to bit-complement");
3466 return error_mark_node
;
3471 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
))
3473 error_at (location
, "wrong type argument to abs");
3474 return error_mark_node
;
3476 else if (!noconvert
)
3477 arg
= default_conversion (arg
);
3481 /* Conjugating a real value is a no-op, but allow it anyway. */
3482 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
3483 || typecode
== COMPLEX_TYPE
))
3485 error_at (location
, "wrong type argument to conjugation");
3486 return error_mark_node
;
3488 else if (!noconvert
)
3489 arg
= default_conversion (arg
);
3492 case TRUTH_NOT_EXPR
:
3493 if (typecode
!= INTEGER_TYPE
&& typecode
!= FIXED_POINT_TYPE
3494 && typecode
!= REAL_TYPE
&& typecode
!= POINTER_TYPE
3495 && typecode
!= COMPLEX_TYPE
)
3498 "wrong type argument to unary exclamation mark");
3499 return error_mark_node
;
3501 arg
= c_objc_common_truthvalue_conversion (location
, arg
);
3502 ret
= invert_truthvalue_loc (location
, arg
);
3503 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
3504 if (EXPR_P (ret
) && EXPR_HAS_LOCATION (ret
))
3505 location
= EXPR_LOCATION (ret
);
3506 goto return_build_unary_op
;
3509 if (TREE_CODE (arg
) == COMPLEX_CST
)
3510 ret
= TREE_REALPART (arg
);
3511 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3512 ret
= fold_build1_loc (location
,
3513 REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
3516 if (eptype
&& TREE_CODE (eptype
) == COMPLEX_TYPE
)
3517 eptype
= TREE_TYPE (eptype
);
3518 goto return_build_unary_op
;
3521 if (TREE_CODE (arg
) == COMPLEX_CST
)
3522 ret
= TREE_IMAGPART (arg
);
3523 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3524 ret
= fold_build1_loc (location
,
3525 IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
3527 ret
= omit_one_operand_loc (location
, TREE_TYPE (arg
),
3528 integer_zero_node
, arg
);
3529 if (eptype
&& TREE_CODE (eptype
) == COMPLEX_TYPE
)
3530 eptype
= TREE_TYPE (eptype
);
3531 goto return_build_unary_op
;
3533 case PREINCREMENT_EXPR
:
3534 case POSTINCREMENT_EXPR
:
3535 case PREDECREMENT_EXPR
:
3536 case POSTDECREMENT_EXPR
:
3538 if (TREE_CODE (arg
) == C_MAYBE_CONST_EXPR
)
3540 tree inner
= build_unary_op (location
, code
,
3541 C_MAYBE_CONST_EXPR_EXPR (arg
), flag
);
3542 if (inner
== error_mark_node
)
3543 return error_mark_node
;
3544 ret
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (inner
),
3545 C_MAYBE_CONST_EXPR_PRE (arg
), inner
);
3546 gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (arg
));
3547 C_MAYBE_CONST_EXPR_NON_CONST (ret
) = 1;
3548 goto return_build_unary_op
;
3551 /* Complain about anything that is not a true lvalue. */
3552 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
3553 || code
== POSTINCREMENT_EXPR
)
3556 return error_mark_node
;
3558 if (warn_cxx_compat
&& TREE_CODE (TREE_TYPE (arg
)) == ENUMERAL_TYPE
)
3560 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
3561 warning_at (location
, OPT_Wc___compat
,
3562 "increment of enumeration value is invalid in C++");
3564 warning_at (location
, OPT_Wc___compat
,
3565 "decrement of enumeration value is invalid in C++");
3568 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
3569 arg
= c_fully_fold (arg
, false, NULL
);
3571 /* Increment or decrement the real part of the value,
3572 and don't change the imaginary part. */
3573 if (typecode
== COMPLEX_TYPE
)
3577 pedwarn (location
, OPT_pedantic
,
3578 "ISO C does not support %<++%> and %<--%> on complex types");
3580 arg
= stabilize_reference (arg
);
3581 real
= build_unary_op (EXPR_LOCATION (arg
), REALPART_EXPR
, arg
, 1);
3582 imag
= build_unary_op (EXPR_LOCATION (arg
), IMAGPART_EXPR
, arg
, 1);
3583 real
= build_unary_op (EXPR_LOCATION (arg
), code
, real
, 1);
3584 if (real
== error_mark_node
|| imag
== error_mark_node
)
3585 return error_mark_node
;
3586 ret
= build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
3588 goto return_build_unary_op
;
3591 /* Report invalid types. */
3593 if (typecode
!= POINTER_TYPE
&& typecode
!= FIXED_POINT_TYPE
3594 && typecode
!= INTEGER_TYPE
&& typecode
!= REAL_TYPE
)
3596 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
3597 error_at (location
, "wrong type argument to increment");
3599 error_at (location
, "wrong type argument to decrement");
3601 return error_mark_node
;
3607 argtype
= TREE_TYPE (arg
);
3609 /* Compute the increment. */
3611 if (typecode
== POINTER_TYPE
)
3613 /* If pointer target is an undefined struct,
3614 we just cannot know how to do the arithmetic. */
3615 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (argtype
)))
3617 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
3619 "increment of pointer to unknown structure");
3622 "decrement of pointer to unknown structure");
3624 else if (TREE_CODE (TREE_TYPE (argtype
)) == FUNCTION_TYPE
3625 || TREE_CODE (TREE_TYPE (argtype
)) == VOID_TYPE
)
3627 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
3628 pedwarn (location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3629 "wrong type argument to increment");
3631 pedwarn (location
, pedantic
? OPT_pedantic
: OPT_Wpointer_arith
,
3632 "wrong type argument to decrement");
3635 inc
= c_size_in_bytes (TREE_TYPE (argtype
));
3636 inc
= fold_convert_loc (location
, sizetype
, inc
);
3638 else if (FRACT_MODE_P (TYPE_MODE (argtype
)))
3640 /* For signed fract types, we invert ++ to -- or
3641 -- to ++, and change inc from 1 to -1, because
3642 it is not possible to represent 1 in signed fract constants.
3643 For unsigned fract types, the result always overflows and
3644 we get an undefined (original) or the maximum value. */
3645 if (code
== PREINCREMENT_EXPR
)
3646 code
= PREDECREMENT_EXPR
;
3647 else if (code
== PREDECREMENT_EXPR
)
3648 code
= PREINCREMENT_EXPR
;
3649 else if (code
== POSTINCREMENT_EXPR
)
3650 code
= POSTDECREMENT_EXPR
;
3651 else /* code == POSTDECREMENT_EXPR */
3652 code
= POSTINCREMENT_EXPR
;
3654 inc
= integer_minus_one_node
;
3655 inc
= convert (argtype
, inc
);
3659 inc
= integer_one_node
;
3660 inc
= convert (argtype
, inc
);
3663 /* Report a read-only lvalue. */
3664 if (TYPE_READONLY (argtype
))
3666 readonly_error (arg
,
3667 ((code
== PREINCREMENT_EXPR
3668 || code
== POSTINCREMENT_EXPR
)
3669 ? lv_increment
: lv_decrement
));
3670 return error_mark_node
;
3672 else if (TREE_READONLY (arg
))
3673 readonly_warning (arg
,
3674 ((code
== PREINCREMENT_EXPR
3675 || code
== POSTINCREMENT_EXPR
)
3676 ? lv_increment
: lv_decrement
));
3678 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
)
3679 val
= boolean_increment (code
, arg
);
3681 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
3682 TREE_SIDE_EFFECTS (val
) = 1;
3683 if (TREE_CODE (val
) != code
)
3684 TREE_NO_WARNING (val
) = 1;
3686 goto return_build_unary_op
;
3690 /* Note that this operation never does default_conversion. */
3692 /* The operand of unary '&' must be an lvalue (which excludes
3693 expressions of type void), or, in C99, the result of a [] or
3694 unary '*' operator. */
3695 if (VOID_TYPE_P (TREE_TYPE (arg
))
3696 && TYPE_QUALS (TREE_TYPE (arg
)) == TYPE_UNQUALIFIED
3697 && (TREE_CODE (arg
) != INDIRECT_REF
3699 pedwarn (location
, 0, "taking address of expression of type %<void%>");
3701 /* Let &* cancel out to simplify resulting code. */
3702 if (TREE_CODE (arg
) == INDIRECT_REF
)
3704 /* Don't let this be an lvalue. */
3705 if (lvalue_p (TREE_OPERAND (arg
, 0)))
3706 return non_lvalue_loc (location
, TREE_OPERAND (arg
, 0));
3707 ret
= TREE_OPERAND (arg
, 0);
3708 goto return_build_unary_op
;
3711 /* For &x[y], return x+y */
3712 if (TREE_CODE (arg
) == ARRAY_REF
)
3714 tree op0
= TREE_OPERAND (arg
, 0);
3715 if (!c_mark_addressable (op0
))
3716 return error_mark_node
;
3717 return build_binary_op (location
, PLUS_EXPR
,
3718 (TREE_CODE (TREE_TYPE (op0
)) == ARRAY_TYPE
3719 ? array_to_pointer_conversion (location
,
3722 TREE_OPERAND (arg
, 1), 1);
3725 /* Anything not already handled and not a true memory reference
3726 or a non-lvalue array is an error. */
3727 else if (typecode
!= FUNCTION_TYPE
&& !flag
3728 && !lvalue_or_else (arg
, lv_addressof
))
3729 return error_mark_node
;
3731 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
3733 if (TREE_CODE (arg
) == C_MAYBE_CONST_EXPR
)
3735 tree inner
= build_unary_op (location
, code
,
3736 C_MAYBE_CONST_EXPR_EXPR (arg
), flag
);
3737 ret
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (inner
),
3738 C_MAYBE_CONST_EXPR_PRE (arg
), inner
);
3739 gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (arg
));
3740 C_MAYBE_CONST_EXPR_NON_CONST (ret
)
3741 = C_MAYBE_CONST_EXPR_NON_CONST (arg
);
3742 goto return_build_unary_op
;
3745 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3746 argtype
= TREE_TYPE (arg
);
3748 /* If the lvalue is const or volatile, merge that into the type
3749 to which the address will point. This should only be needed
3750 for function types. */
3751 if ((DECL_P (arg
) || REFERENCE_CLASS_P (arg
))
3752 && (TREE_READONLY (arg
) || TREE_THIS_VOLATILE (arg
)))
3754 int orig_quals
= TYPE_QUALS (strip_array_types (argtype
));
3755 int quals
= orig_quals
;
3757 if (TREE_READONLY (arg
))
3758 quals
|= TYPE_QUAL_CONST
;
3759 if (TREE_THIS_VOLATILE (arg
))
3760 quals
|= TYPE_QUAL_VOLATILE
;
3762 gcc_assert (quals
== orig_quals
3763 || TREE_CODE (argtype
) == FUNCTION_TYPE
);
3765 argtype
= c_build_qualified_type (argtype
, quals
);
3768 if (!c_mark_addressable (arg
))
3769 return error_mark_node
;
3771 gcc_assert (TREE_CODE (arg
) != COMPONENT_REF
3772 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)));
3774 argtype
= build_pointer_type (argtype
);
3776 /* ??? Cope with user tricks that amount to offsetof. Delete this
3777 when we have proper support for integer constant expressions. */
3778 val
= get_base_address (arg
);
3779 if (val
&& TREE_CODE (val
) == INDIRECT_REF
3780 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
3782 tree op0
= fold_convert_loc (location
, sizetype
,
3783 fold_offsetof (arg
, val
)), op1
;
3785 op1
= fold_convert_loc (location
, argtype
, TREE_OPERAND (val
, 0));
3786 ret
= fold_build2_loc (location
, POINTER_PLUS_EXPR
, argtype
, op1
, op0
);
3787 goto return_build_unary_op
;
3790 val
= build1 (ADDR_EXPR
, argtype
, arg
);
3793 goto return_build_unary_op
;
3800 argtype
= TREE_TYPE (arg
);
3801 if (TREE_CODE (arg
) == INTEGER_CST
)
3802 ret
= (require_constant_value
3803 ? fold_build1_initializer_loc (location
, code
, argtype
, arg
)
3804 : fold_build1_loc (location
, code
, argtype
, arg
));
3806 ret
= build1 (code
, argtype
, arg
);
3807 return_build_unary_op
:
3808 gcc_assert (ret
!= error_mark_node
);
3809 if (TREE_CODE (ret
) == INTEGER_CST
&& !TREE_OVERFLOW (ret
)
3810 && !(TREE_CODE (xarg
) == INTEGER_CST
&& !TREE_OVERFLOW (xarg
)))
3811 ret
= build1 (NOP_EXPR
, TREE_TYPE (ret
), ret
);
3812 else if (TREE_CODE (ret
) != INTEGER_CST
&& int_operands
)
3813 ret
= note_integer_operands (ret
);
3815 ret
= build1 (EXCESS_PRECISION_EXPR
, eptype
, ret
);
3816 protected_set_expr_location (ret
, location
);
3820 /* Return nonzero if REF is an lvalue valid for this language.
3821 Lvalues can be assigned, unless their type has TYPE_READONLY.
3822 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3825 lvalue_p (const_tree ref
)
3827 const enum tree_code code
= TREE_CODE (ref
);
3834 return lvalue_p (TREE_OPERAND (ref
, 0));
3836 case C_MAYBE_CONST_EXPR
:
3837 return lvalue_p (TREE_OPERAND (ref
, 1));
3839 case COMPOUND_LITERAL_EXPR
:
3849 return (TREE_CODE (TREE_TYPE (ref
)) != FUNCTION_TYPE
3850 && TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
);
3853 return TREE_CODE (TREE_TYPE (ref
)) == ARRAY_TYPE
;
3860 /* Give an error for storing in something that is 'const'. */
3863 readonly_error (tree arg
, enum lvalue_use use
)
3865 gcc_assert (use
== lv_assign
|| use
== lv_increment
|| use
== lv_decrement
3867 /* Using this macro rather than (for example) arrays of messages
3868 ensures that all the format strings are checked at compile
3870 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3871 : (use == lv_increment ? (I) \
3872 : (use == lv_decrement ? (D) : (AS))))
3873 if (TREE_CODE (arg
) == COMPONENT_REF
)
3875 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg
, 0))))
3876 readonly_error (TREE_OPERAND (arg
, 0), use
);
3878 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3879 G_("increment of read-only member %qD"),
3880 G_("decrement of read-only member %qD"),
3881 G_("read-only member %qD used as %<asm%> output")),
3882 TREE_OPERAND (arg
, 1));
3884 else if (TREE_CODE (arg
) == VAR_DECL
)
3885 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3886 G_("increment of read-only variable %qD"),
3887 G_("decrement of read-only variable %qD"),
3888 G_("read-only variable %qD used as %<asm%> output")),
3891 error (READONLY_MSG (G_("assignment of read-only location %qE"),
3892 G_("increment of read-only location %qE"),
3893 G_("decrement of read-only location %qE"),
3894 G_("read-only location %qE used as %<asm%> output")),
3898 /* Give a warning for storing in something that is read-only in GCC
3899 terms but not const in ISO C terms. */
3902 readonly_warning (tree arg
, enum lvalue_use use
)
3907 warning (0, "assignment of read-only location %qE", arg
);
3910 warning (0, "increment of read-only location %qE", arg
);
3913 warning (0, "decrement of read-only location %qE", arg
);
3922 /* Return nonzero if REF is an lvalue valid for this language;
3923 otherwise, print an error message and return zero. USE says
3924 how the lvalue is being used and so selects the error message. */
3927 lvalue_or_else (const_tree ref
, enum lvalue_use use
)
3929 int win
= lvalue_p (ref
);
3937 /* Mark EXP saying that we need to be able to take the
3938 address of it; it should not be allocated in a register.
3939 Returns true if successful. */
3942 c_mark_addressable (tree exp
)
3947 switch (TREE_CODE (x
))
3950 if (DECL_C_BIT_FIELD (TREE_OPERAND (x
, 1)))
3953 ("cannot take address of bit-field %qD", TREE_OPERAND (x
, 1));
3957 /* ... fall through ... */
3963 x
= TREE_OPERAND (x
, 0);
3966 case COMPOUND_LITERAL_EXPR
:
3968 TREE_ADDRESSABLE (x
) = 1;
3975 if (C_DECL_REGISTER (x
)
3976 && DECL_NONLOCAL (x
))
3978 if (TREE_PUBLIC (x
) || TREE_STATIC (x
) || DECL_EXTERNAL (x
))
3981 ("global register variable %qD used in nested function", x
);
3984 pedwarn (input_location
, 0, "register variable %qD used in nested function", x
);
3986 else if (C_DECL_REGISTER (x
))
3988 if (TREE_PUBLIC (x
) || TREE_STATIC (x
) || DECL_EXTERNAL (x
))
3989 error ("address of global register variable %qD requested", x
);
3991 error ("address of register variable %qD requested", x
);
3997 TREE_ADDRESSABLE (x
) = 1;
4004 /* Convert EXPR to TYPE, warning about conversion problems with
4005 constants. SEMANTIC_TYPE is the type this conversion would use
4006 without excess precision. If SEMANTIC_TYPE is NULL, this function
4007 is equivalent to convert_and_check. This function is a wrapper that
4008 handles conversions that may be different than
4009 the usual ones because of excess precision. */
4012 ep_convert_and_check (tree type
, tree expr
, tree semantic_type
)
4014 if (TREE_TYPE (expr
) == type
)
4018 return convert_and_check (type
, expr
);
4020 if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
4021 && TREE_TYPE (expr
) != semantic_type
)
4023 /* For integers, we need to check the real conversion, not
4024 the conversion to the excess precision type. */
4025 expr
= convert_and_check (semantic_type
, expr
);
4027 /* Result type is the excess precision type, which should be
4028 large enough, so do not check. */
4029 return convert (type
, expr
);
4032 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
4033 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
4034 if folded to an integer constant then the unselected half may
4035 contain arbitrary operations not normally permitted in constant
4036 expressions. Set the location of the expression to LOC. */
4039 build_conditional_expr (location_t colon_loc
, tree ifexp
, bool ifexp_bcp
,
4040 tree op1
, tree op1_original_type
, tree op2
,
4041 tree op2_original_type
)
4045 enum tree_code code1
;
4046 enum tree_code code2
;
4047 tree result_type
= NULL
;
4048 tree semantic_result_type
= NULL
;
4049 tree orig_op1
= op1
, orig_op2
= op2
;
4050 bool int_const
, op1_int_operands
, op2_int_operands
, int_operands
;
4051 bool ifexp_int_operands
;
4055 op1_int_operands
= EXPR_INT_CONST_OPERANDS (orig_op1
);
4056 if (op1_int_operands
)
4057 op1
= remove_c_maybe_const_expr (op1
);
4058 op2_int_operands
= EXPR_INT_CONST_OPERANDS (orig_op2
);
4059 if (op2_int_operands
)
4060 op2
= remove_c_maybe_const_expr (op2
);
4061 ifexp_int_operands
= EXPR_INT_CONST_OPERANDS (ifexp
);
4062 if (ifexp_int_operands
)
4063 ifexp
= remove_c_maybe_const_expr (ifexp
);
4065 /* Promote both alternatives. */
4067 if (TREE_CODE (TREE_TYPE (op1
)) != VOID_TYPE
)
4068 op1
= default_conversion (op1
);
4069 if (TREE_CODE (TREE_TYPE (op2
)) != VOID_TYPE
)
4070 op2
= default_conversion (op2
);
4072 if (TREE_CODE (ifexp
) == ERROR_MARK
4073 || TREE_CODE (TREE_TYPE (op1
)) == ERROR_MARK
4074 || TREE_CODE (TREE_TYPE (op2
)) == ERROR_MARK
)
4075 return error_mark_node
;
4077 type1
= TREE_TYPE (op1
);
4078 code1
= TREE_CODE (type1
);
4079 type2
= TREE_TYPE (op2
);
4080 code2
= TREE_CODE (type2
);
4082 /* C90 does not permit non-lvalue arrays in conditional expressions.
4083 In C99 they will be pointers by now. */
4084 if (code1
== ARRAY_TYPE
|| code2
== ARRAY_TYPE
)
4086 error_at (colon_loc
, "non-lvalue array in conditional expression");
4087 return error_mark_node
;
4090 objc_ok
= objc_compare_types (type1
, type2
, -3, NULL_TREE
);
4092 if ((TREE_CODE (op1
) == EXCESS_PRECISION_EXPR
4093 || TREE_CODE (op2
) == EXCESS_PRECISION_EXPR
)
4094 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4095 || code1
== COMPLEX_TYPE
)
4096 && (code2
== INTEGER_TYPE
|| code2
== REAL_TYPE
4097 || code2
== COMPLEX_TYPE
))
4099 semantic_result_type
= c_common_type (type1
, type2
);
4100 if (TREE_CODE (op1
) == EXCESS_PRECISION_EXPR
)
4102 op1
= TREE_OPERAND (op1
, 0);
4103 type1
= TREE_TYPE (op1
);
4104 gcc_assert (TREE_CODE (type1
) == code1
);
4106 if (TREE_CODE (op2
) == EXCESS_PRECISION_EXPR
)
4108 op2
= TREE_OPERAND (op2
, 0);
4109 type2
= TREE_TYPE (op2
);
4110 gcc_assert (TREE_CODE (type2
) == code2
);
4114 if (warn_cxx_compat
)
4116 tree t1
= op1_original_type
? op1_original_type
: TREE_TYPE (orig_op1
);
4117 tree t2
= op2_original_type
? op2_original_type
: TREE_TYPE (orig_op2
);
4119 if (TREE_CODE (t1
) == ENUMERAL_TYPE
4120 && TREE_CODE (t2
) == ENUMERAL_TYPE
4121 && TYPE_MAIN_VARIANT (t1
) != TYPE_MAIN_VARIANT (t2
))
4122 warning_at (colon_loc
, OPT_Wc___compat
,
4123 ("different enum types in conditional is "
4124 "invalid in C++: %qT vs %qT"),
4128 /* Quickly detect the usual case where op1 and op2 have the same type
4130 if (TYPE_MAIN_VARIANT (type1
) == TYPE_MAIN_VARIANT (type2
))
4133 result_type
= type1
;
4135 result_type
= TYPE_MAIN_VARIANT (type1
);
4137 else if ((code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4138 || code1
== COMPLEX_TYPE
)
4139 && (code2
== INTEGER_TYPE
|| code2
== REAL_TYPE
4140 || code2
== COMPLEX_TYPE
))
4142 result_type
= c_common_type (type1
, type2
);
4144 /* If -Wsign-compare, warn here if type1 and type2 have
4145 different signedness. We'll promote the signed to unsigned
4146 and later code won't know it used to be different.
4147 Do this check on the original types, so that explicit casts
4148 will be considered, but default promotions won't. */
4149 if (c_inhibit_evaluation_warnings
== 0)
4151 int unsigned_op1
= TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
4152 int unsigned_op2
= TYPE_UNSIGNED (TREE_TYPE (orig_op2
));
4154 if (unsigned_op1
^ unsigned_op2
)
4158 /* Do not warn if the result type is signed, since the
4159 signed type will only be chosen if it can represent
4160 all the values of the unsigned type. */
4161 if (!TYPE_UNSIGNED (result_type
))
4165 bool op1_maybe_const
= true;
4166 bool op2_maybe_const
= true;
4168 /* Do not warn if the signed quantity is an
4169 unsuffixed integer literal (or some static
4170 constant expression involving such literals) and
4171 it is non-negative. This warning requires the
4172 operands to be folded for best results, so do
4173 that folding in this case even without
4174 warn_sign_compare to avoid warning options
4175 possibly affecting code generation. */
4176 c_inhibit_evaluation_warnings
4177 += (ifexp
== truthvalue_false_node
);
4178 op1
= c_fully_fold (op1
, require_constant_value
,
4180 c_inhibit_evaluation_warnings
4181 -= (ifexp
== truthvalue_false_node
);
4183 c_inhibit_evaluation_warnings
4184 += (ifexp
== truthvalue_true_node
);
4185 op2
= c_fully_fold (op2
, require_constant_value
,
4187 c_inhibit_evaluation_warnings
4188 -= (ifexp
== truthvalue_true_node
);
4190 if (warn_sign_compare
)
4193 && tree_expr_nonnegative_warnv_p (op1
, &ovf
))
4195 && tree_expr_nonnegative_warnv_p (op2
, &ovf
)))
4198 warning_at (colon_loc
, OPT_Wsign_compare
,
4199 ("signed and unsigned type in "
4200 "conditional expression"));
4202 if (!op1_maybe_const
|| TREE_CODE (op1
) != INTEGER_CST
)
4203 op1
= c_wrap_maybe_const (op1
, !op1_maybe_const
);
4204 if (!op2_maybe_const
|| TREE_CODE (op2
) != INTEGER_CST
)
4205 op2
= c_wrap_maybe_const (op2
, !op2_maybe_const
);
4210 else if (code1
== VOID_TYPE
|| code2
== VOID_TYPE
)
4212 if (code1
!= VOID_TYPE
|| code2
!= VOID_TYPE
)
4213 pedwarn (colon_loc
, OPT_pedantic
,
4214 "ISO C forbids conditional expr with only one void side");
4215 result_type
= void_type_node
;
4217 else if (code1
== POINTER_TYPE
&& code2
== POINTER_TYPE
)
4219 addr_space_t as1
= TYPE_ADDR_SPACE (TREE_TYPE (type1
));
4220 addr_space_t as2
= TYPE_ADDR_SPACE (TREE_TYPE (type2
));
4221 addr_space_t as_common
;
4223 if (comp_target_types (colon_loc
, type1
, type2
))
4224 result_type
= common_pointer_type (type1
, type2
);
4225 else if (null_pointer_constant_p (orig_op1
))
4226 result_type
= type2
;
4227 else if (null_pointer_constant_p (orig_op2
))
4228 result_type
= type1
;
4229 else if (!addr_space_superset (as1
, as2
, &as_common
))
4231 error_at (colon_loc
, "pointers to disjoint address spaces "
4232 "used in conditional expression");
4233 return error_mark_node
;
4235 else if (VOID_TYPE_P (TREE_TYPE (type1
)))
4237 if (TREE_CODE (TREE_TYPE (type2
)) == FUNCTION_TYPE
)
4238 pedwarn (colon_loc
, OPT_pedantic
,
4239 "ISO C forbids conditional expr between "
4240 "%<void *%> and function pointer");
4241 result_type
= build_pointer_type (qualify_type (TREE_TYPE (type1
),
4242 TREE_TYPE (type2
)));
4244 else if (VOID_TYPE_P (TREE_TYPE (type2
)))
4246 if (TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
)
4247 pedwarn (colon_loc
, OPT_pedantic
,
4248 "ISO C forbids conditional expr between "
4249 "%<void *%> and function pointer");
4250 result_type
= build_pointer_type (qualify_type (TREE_TYPE (type2
),
4251 TREE_TYPE (type1
)));
4255 int qual
= ENCODE_QUAL_ADDR_SPACE (as_common
);
4258 pedwarn (colon_loc
, 0,
4259 "pointer type mismatch in conditional expression");
4260 result_type
= build_pointer_type
4261 (build_qualified_type (void_type_node
, qual
));
4264 else if (code1
== POINTER_TYPE
&& code2
== INTEGER_TYPE
)
4266 if (!null_pointer_constant_p (orig_op2
))
4267 pedwarn (colon_loc
, 0,
4268 "pointer/integer type mismatch in conditional expression");
4271 op2
= null_pointer_node
;
4273 result_type
= type1
;
4275 else if (code2
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4277 if (!null_pointer_constant_p (orig_op1
))
4278 pedwarn (colon_loc
, 0,
4279 "pointer/integer type mismatch in conditional expression");
4282 op1
= null_pointer_node
;
4284 result_type
= type2
;
4289 if (flag_cond_mismatch
)
4290 result_type
= void_type_node
;
4293 error_at (colon_loc
, "type mismatch in conditional expression");
4294 return error_mark_node
;
4298 /* Merge const and volatile flags of the incoming types. */
4300 = build_type_variant (result_type
,
4301 TYPE_READONLY (type1
) || TYPE_READONLY (type2
),
4302 TYPE_VOLATILE (type1
) || TYPE_VOLATILE (type2
));
4304 op1
= ep_convert_and_check (result_type
, op1
, semantic_result_type
);
4305 op2
= ep_convert_and_check (result_type
, op2
, semantic_result_type
);
4307 if (ifexp_bcp
&& ifexp
== truthvalue_true_node
)
4309 op2_int_operands
= true;
4310 op1
= c_fully_fold (op1
, require_constant_value
, NULL
);
4312 if (ifexp_bcp
&& ifexp
== truthvalue_false_node
)
4314 op1_int_operands
= true;
4315 op2
= c_fully_fold (op2
, require_constant_value
, NULL
);
4317 int_const
= int_operands
= (ifexp_int_operands
4319 && op2_int_operands
);
4322 int_const
= ((ifexp
== truthvalue_true_node
4323 && TREE_CODE (orig_op1
) == INTEGER_CST
4324 && !TREE_OVERFLOW (orig_op1
))
4325 || (ifexp
== truthvalue_false_node
4326 && TREE_CODE (orig_op2
) == INTEGER_CST
4327 && !TREE_OVERFLOW (orig_op2
)));
4329 if (int_const
|| (ifexp_bcp
&& TREE_CODE (ifexp
) == INTEGER_CST
))
4330 ret
= fold_build3_loc (colon_loc
, COND_EXPR
, result_type
, ifexp
, op1
, op2
);
4333 ret
= build3 (COND_EXPR
, result_type
, ifexp
, op1
, op2
);
4335 ret
= note_integer_operands (ret
);
4337 if (semantic_result_type
)
4338 ret
= build1 (EXCESS_PRECISION_EXPR
, semantic_result_type
, ret
);
4340 protected_set_expr_location (ret
, colon_loc
);
4344 /* Return a compound expression that performs two expressions and
4345 returns the value of the second of them.
4347 LOC is the location of the COMPOUND_EXPR. */
4350 build_compound_expr (location_t loc
, tree expr1
, tree expr2
)
4352 bool expr1_int_operands
, expr2_int_operands
;
4353 tree eptype
= NULL_TREE
;
4356 expr1_int_operands
= EXPR_INT_CONST_OPERANDS (expr1
);
4357 if (expr1_int_operands
)
4358 expr1
= remove_c_maybe_const_expr (expr1
);
4359 expr2_int_operands
= EXPR_INT_CONST_OPERANDS (expr2
);
4360 if (expr2_int_operands
)
4361 expr2
= remove_c_maybe_const_expr (expr2
);
4363 if (TREE_CODE (expr1
) == EXCESS_PRECISION_EXPR
)
4364 expr1
= TREE_OPERAND (expr1
, 0);
4365 if (TREE_CODE (expr2
) == EXCESS_PRECISION_EXPR
)
4367 eptype
= TREE_TYPE (expr2
);
4368 expr2
= TREE_OPERAND (expr2
, 0);
4371 if (!TREE_SIDE_EFFECTS (expr1
))
4373 /* The left-hand operand of a comma expression is like an expression
4374 statement: with -Wunused, we should warn if it doesn't have
4375 any side-effects, unless it was explicitly cast to (void). */
4376 if (warn_unused_value
)
4378 if (VOID_TYPE_P (TREE_TYPE (expr1
))
4379 && CONVERT_EXPR_P (expr1
))
4381 else if (VOID_TYPE_P (TREE_TYPE (expr1
))
4382 && TREE_CODE (expr1
) == COMPOUND_EXPR
4383 && CONVERT_EXPR_P (TREE_OPERAND (expr1
, 1)))
4384 ; /* (void) a, (void) b, c */
4386 warning_at (loc
, OPT_Wunused_value
,
4387 "left-hand operand of comma expression has no effect");
4391 /* With -Wunused, we should also warn if the left-hand operand does have
4392 side-effects, but computes a value which is not used. For example, in
4393 `foo() + bar(), baz()' the result of the `+' operator is not used,
4394 so we should issue a warning. */
4395 else if (warn_unused_value
)
4396 warn_if_unused_value (expr1
, loc
);
4398 if (expr2
== error_mark_node
)
4399 return error_mark_node
;
4401 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr2
), expr1
, expr2
);
4404 && expr1_int_operands
4405 && expr2_int_operands
)
4406 ret
= note_integer_operands (ret
);
4409 ret
= build1 (EXCESS_PRECISION_EXPR
, eptype
, ret
);
4411 protected_set_expr_location (ret
, loc
);
4415 /* Issue -Wcast-qual warnings when appropriate. TYPE is the type to
4416 which we are casting. OTYPE is the type of the expression being
4417 cast. Both TYPE and OTYPE are pointer types. LOC is the location
4418 of the cast. -Wcast-qual appeared on the command line. Named
4419 address space qualifiers are not handled here, because they result
4420 in different warnings. */
4423 handle_warn_cast_qual (location_t loc
, tree type
, tree otype
)
4425 tree in_type
= type
;
4426 tree in_otype
= otype
;
4431 /* Check that the qualifiers on IN_TYPE are a superset of the
4432 qualifiers of IN_OTYPE. The outermost level of POINTER_TYPE
4433 nodes is uninteresting and we stop as soon as we hit a
4434 non-POINTER_TYPE node on either type. */
4437 in_otype
= TREE_TYPE (in_otype
);
4438 in_type
= TREE_TYPE (in_type
);
4440 /* GNU C allows cv-qualified function types. 'const' means the
4441 function is very pure, 'volatile' means it can't return. We
4442 need to warn when such qualifiers are added, not when they're
4444 if (TREE_CODE (in_otype
) == FUNCTION_TYPE
4445 && TREE_CODE (in_type
) == FUNCTION_TYPE
)
4446 added
|= (TYPE_QUALS_NO_ADDR_SPACE (in_type
)
4447 & ~TYPE_QUALS_NO_ADDR_SPACE (in_otype
));
4449 discarded
|= (TYPE_QUALS_NO_ADDR_SPACE (in_otype
)
4450 & ~TYPE_QUALS_NO_ADDR_SPACE (in_type
));
4452 while (TREE_CODE (in_type
) == POINTER_TYPE
4453 && TREE_CODE (in_otype
) == POINTER_TYPE
);
4456 warning_at (loc
, OPT_Wcast_qual
,
4457 "cast adds %q#v qualifier to function type", added
);
4460 /* There are qualifiers present in IN_OTYPE that are not present
4462 warning_at (loc
, OPT_Wcast_qual
,
4463 "cast discards %q#v qualifier from pointer target type",
4466 if (added
|| discarded
)
4469 /* A cast from **T to const **T is unsafe, because it can cause a
4470 const value to be changed with no additional warning. We only
4471 issue this warning if T is the same on both sides, and we only
4472 issue the warning if there are the same number of pointers on
4473 both sides, as otherwise the cast is clearly unsafe anyhow. A
4474 cast is unsafe when a qualifier is added at one level and const
4475 is not present at all outer levels.
4477 To issue this warning, we check at each level whether the cast
4478 adds new qualifiers not already seen. We don't need to special
4479 case function types, as they won't have the same
4480 TYPE_MAIN_VARIANT. */
4482 if (TYPE_MAIN_VARIANT (in_type
) != TYPE_MAIN_VARIANT (in_otype
))
4484 if (TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
)
4489 is_const
= TYPE_READONLY (TREE_TYPE (in_type
));
4492 in_type
= TREE_TYPE (in_type
);
4493 in_otype
= TREE_TYPE (in_otype
);
4494 if ((TYPE_QUALS (in_type
) &~ TYPE_QUALS (in_otype
)) != 0
4497 warning_at (loc
, OPT_Wcast_qual
,
4498 "to be safe all intermediate pointers in cast from "
4499 "%qT to %qT must be %<const%> qualified",
4504 is_const
= TYPE_READONLY (in_type
);
4506 while (TREE_CODE (in_type
) == POINTER_TYPE
);
4509 /* Build an expression representing a cast to type TYPE of expression EXPR.
4510 LOC is the location of the cast-- typically the open paren of the cast. */
4513 build_c_cast (location_t loc
, tree type
, tree expr
)
4517 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
4518 expr
= TREE_OPERAND (expr
, 0);
4522 if (type
== error_mark_node
|| expr
== error_mark_node
)
4523 return error_mark_node
;
4525 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
4526 only in <protocol> qualifications. But when constructing cast expressions,
4527 the protocols do matter and must be kept around. */
4528 if (objc_is_object_ptr (type
) && objc_is_object_ptr (TREE_TYPE (expr
)))
4529 return build1 (NOP_EXPR
, type
, expr
);
4531 type
= TYPE_MAIN_VARIANT (type
);
4533 if (TREE_CODE (type
) == ARRAY_TYPE
)
4535 error_at (loc
, "cast specifies array type");
4536 return error_mark_node
;
4539 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4541 error_at (loc
, "cast specifies function type");
4542 return error_mark_node
;
4545 if (!VOID_TYPE_P (type
))
4547 value
= require_complete_type (value
);
4548 if (value
== error_mark_node
)
4549 return error_mark_node
;
4552 if (type
== TYPE_MAIN_VARIANT (TREE_TYPE (value
)))
4554 if (TREE_CODE (type
) == RECORD_TYPE
4555 || TREE_CODE (type
) == UNION_TYPE
)
4556 pedwarn (loc
, OPT_pedantic
,
4557 "ISO C forbids casting nonscalar to the same type");
4559 else if (TREE_CODE (type
) == UNION_TYPE
)
4563 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
4564 if (TREE_TYPE (field
) != error_mark_node
4565 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field
)),
4566 TYPE_MAIN_VARIANT (TREE_TYPE (value
))))
4572 bool maybe_const
= true;
4574 pedwarn (loc
, OPT_pedantic
, "ISO C forbids casts to union type");
4575 t
= c_fully_fold (value
, false, &maybe_const
);
4576 t
= build_constructor_single (type
, field
, t
);
4578 t
= c_wrap_maybe_const (t
, true);
4579 t
= digest_init (loc
, type
, t
,
4580 NULL_TREE
, false, true, 0);
4581 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
4584 error_at (loc
, "cast to union type from type not present in union");
4585 return error_mark_node
;
4591 if (type
== void_type_node
)
4593 tree t
= build1 (CONVERT_EXPR
, type
, value
);
4594 SET_EXPR_LOCATION (t
, loc
);
4598 otype
= TREE_TYPE (value
);
4600 /* Optionally warn about potentially worrisome casts. */
4602 && TREE_CODE (type
) == POINTER_TYPE
4603 && TREE_CODE (otype
) == POINTER_TYPE
)
4604 handle_warn_cast_qual (loc
, type
, otype
);
4606 /* Warn about conversions between pointers to disjoint
4608 if (TREE_CODE (type
) == POINTER_TYPE
4609 && TREE_CODE (otype
) == POINTER_TYPE
4610 && !null_pointer_constant_p (value
))
4612 addr_space_t as_to
= TYPE_ADDR_SPACE (TREE_TYPE (type
));
4613 addr_space_t as_from
= TYPE_ADDR_SPACE (TREE_TYPE (otype
));
4614 addr_space_t as_common
;
4616 if (!addr_space_superset (as_to
, as_from
, &as_common
))
4618 if (ADDR_SPACE_GENERIC_P (as_from
))
4619 warning_at (loc
, 0, "cast to %s address space pointer "
4620 "from disjoint generic address space pointer",
4621 c_addr_space_name (as_to
));
4623 else if (ADDR_SPACE_GENERIC_P (as_to
))
4624 warning_at (loc
, 0, "cast to generic address space pointer "
4625 "from disjoint %s address space pointer",
4626 c_addr_space_name (as_from
));
4629 warning_at (loc
, 0, "cast to %s address space pointer "
4630 "from disjoint %s address space pointer",
4631 c_addr_space_name (as_to
),
4632 c_addr_space_name (as_from
));
4636 /* Warn about possible alignment problems. */
4637 if (STRICT_ALIGNMENT
4638 && TREE_CODE (type
) == POINTER_TYPE
4639 && TREE_CODE (otype
) == POINTER_TYPE
4640 && TREE_CODE (TREE_TYPE (otype
)) != VOID_TYPE
4641 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
4642 /* Don't warn about opaque types, where the actual alignment
4643 restriction is unknown. */
4644 && !((TREE_CODE (TREE_TYPE (otype
)) == UNION_TYPE
4645 || TREE_CODE (TREE_TYPE (otype
)) == RECORD_TYPE
)
4646 && TYPE_MODE (TREE_TYPE (otype
)) == VOIDmode
)
4647 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (otype
)))
4648 warning_at (loc
, OPT_Wcast_align
,
4649 "cast increases required alignment of target type");
4651 if (TREE_CODE (type
) == INTEGER_TYPE
4652 && TREE_CODE (otype
) == POINTER_TYPE
4653 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
))
4654 /* Unlike conversion of integers to pointers, where the
4655 warning is disabled for converting constants because
4656 of cases such as SIG_*, warn about converting constant
4657 pointers to integers. In some cases it may cause unwanted
4658 sign extension, and a warning is appropriate. */
4659 warning_at (loc
, OPT_Wpointer_to_int_cast
,
4660 "cast from pointer to integer of different size");
4662 if (TREE_CODE (value
) == CALL_EXPR
4663 && TREE_CODE (type
) != TREE_CODE (otype
))
4664 warning_at (loc
, OPT_Wbad_function_cast
,
4665 "cast from function call of type %qT "
4666 "to non-matching type %qT", otype
, type
);
4668 if (TREE_CODE (type
) == POINTER_TYPE
4669 && TREE_CODE (otype
) == INTEGER_TYPE
4670 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
4671 /* Don't warn about converting any constant. */
4672 && !TREE_CONSTANT (value
))
4674 OPT_Wint_to_pointer_cast
, "cast to pointer from integer "
4675 "of different size");
4677 if (warn_strict_aliasing
<= 2)
4678 strict_aliasing_warning (otype
, type
, expr
);
4680 /* If pedantic, warn for conversions between function and object
4681 pointer types, except for converting a null pointer constant
4682 to function pointer type. */
4684 && TREE_CODE (type
) == POINTER_TYPE
4685 && TREE_CODE (otype
) == POINTER_TYPE
4686 && TREE_CODE (TREE_TYPE (otype
)) == FUNCTION_TYPE
4687 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
4688 pedwarn (loc
, OPT_pedantic
, "ISO C forbids "
4689 "conversion of function pointer to object pointer type");
4692 && TREE_CODE (type
) == POINTER_TYPE
4693 && TREE_CODE (otype
) == POINTER_TYPE
4694 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
4695 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
4696 && !null_pointer_constant_p (value
))
4697 pedwarn (loc
, OPT_pedantic
, "ISO C forbids "
4698 "conversion of object pointer to function pointer type");
4701 value
= convert (type
, value
);
4703 /* Ignore any integer overflow caused by the cast. */
4704 if (TREE_CODE (value
) == INTEGER_CST
&& !FLOAT_TYPE_P (otype
))
4706 if (CONSTANT_CLASS_P (ovalue
) && TREE_OVERFLOW (ovalue
))
4708 if (!TREE_OVERFLOW (value
))
4710 /* Avoid clobbering a shared constant. */
4711 value
= copy_node (value
);
4712 TREE_OVERFLOW (value
) = TREE_OVERFLOW (ovalue
);
4715 else if (TREE_OVERFLOW (value
))
4716 /* Reset VALUE's overflow flags, ensuring constant sharing. */
4717 value
= build_int_cst_wide (TREE_TYPE (value
),
4718 TREE_INT_CST_LOW (value
),
4719 TREE_INT_CST_HIGH (value
));
4723 /* Don't let a cast be an lvalue. */
4725 value
= non_lvalue_loc (loc
, value
);
4727 /* Don't allow the results of casting to floating-point or complex
4728 types be confused with actual constants, or casts involving
4729 integer and pointer types other than direct integer-to-integer
4730 and integer-to-pointer be confused with integer constant
4731 expressions and null pointer constants. */
4732 if (TREE_CODE (value
) == REAL_CST
4733 || TREE_CODE (value
) == COMPLEX_CST
4734 || (TREE_CODE (value
) == INTEGER_CST
4735 && !((TREE_CODE (expr
) == INTEGER_CST
4736 && INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
4737 || TREE_CODE (expr
) == REAL_CST
4738 || TREE_CODE (expr
) == COMPLEX_CST
)))
4739 value
= build1 (NOP_EXPR
, type
, value
);
4741 if (CAN_HAVE_LOCATION_P (value
))
4742 SET_EXPR_LOCATION (value
, loc
);
4746 /* Interpret a cast of expression EXPR to type TYPE. LOC is the
4747 location of the open paren of the cast, or the position of the cast
4750 c_cast_expr (location_t loc
, struct c_type_name
*type_name
, tree expr
)
4753 tree type_expr
= NULL_TREE
;
4754 bool type_expr_const
= true;
4756 int saved_wsp
= warn_strict_prototypes
;
4758 /* This avoids warnings about unprototyped casts on
4759 integers. E.g. "#define SIG_DFL (void(*)())0". */
4760 if (TREE_CODE (expr
) == INTEGER_CST
)
4761 warn_strict_prototypes
= 0;
4762 type
= groktypename (type_name
, &type_expr
, &type_expr_const
);
4763 warn_strict_prototypes
= saved_wsp
;
4765 ret
= build_c_cast (loc
, type
, expr
);
4768 ret
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (ret
), type_expr
, ret
);
4769 C_MAYBE_CONST_EXPR_NON_CONST (ret
) = !type_expr_const
;
4770 SET_EXPR_LOCATION (ret
, loc
);
4773 if (CAN_HAVE_LOCATION_P (ret
) && !EXPR_HAS_LOCATION (ret
))
4774 SET_EXPR_LOCATION (ret
, loc
);
4776 /* C++ does not permits types to be defined in a cast. */
4777 if (warn_cxx_compat
&& type_name
->specs
->tag_defined_p
)
4778 warning_at (loc
, OPT_Wc___compat
,
4779 "defining a type in a cast is invalid in C++");
4784 /* Build an assignment expression of lvalue LHS from value RHS.
4785 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
4786 may differ from TREE_TYPE (LHS) for an enum bitfield.
4787 MODIFYCODE is the code for a binary operator that we use
4788 to combine the old value of LHS with RHS to get the new value.
4789 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
4790 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
4791 which may differ from TREE_TYPE (RHS) for an enum value.
4793 LOCATION is the location of the MODIFYCODE operator.
4794 RHS_LOC is the location of the RHS. */
4797 build_modify_expr (location_t location
, tree lhs
, tree lhs_origtype
,
4798 enum tree_code modifycode
,
4799 location_t rhs_loc
, tree rhs
, tree rhs_origtype
)
4803 tree rhs_semantic_type
= NULL_TREE
;
4804 tree lhstype
= TREE_TYPE (lhs
);
4805 tree olhstype
= lhstype
;
4808 /* Types that aren't fully specified cannot be used in assignments. */
4809 lhs
= require_complete_type (lhs
);
4811 /* Avoid duplicate error messages from operands that had errors. */
4812 if (TREE_CODE (lhs
) == ERROR_MARK
|| TREE_CODE (rhs
) == ERROR_MARK
)
4813 return error_mark_node
;
4815 if (!lvalue_or_else (lhs
, lv_assign
))
4816 return error_mark_node
;
4818 if (TREE_CODE (rhs
) == EXCESS_PRECISION_EXPR
)
4820 rhs_semantic_type
= TREE_TYPE (rhs
);
4821 rhs
= TREE_OPERAND (rhs
, 0);
4826 if (TREE_CODE (lhs
) == C_MAYBE_CONST_EXPR
)
4828 tree inner
= build_modify_expr (location
, C_MAYBE_CONST_EXPR_EXPR (lhs
),
4829 lhs_origtype
, modifycode
, rhs_loc
, rhs
,
4831 if (inner
== error_mark_node
)
4832 return error_mark_node
;
4833 result
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (inner
),
4834 C_MAYBE_CONST_EXPR_PRE (lhs
), inner
);
4835 gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (lhs
));
4836 C_MAYBE_CONST_EXPR_NON_CONST (result
) = 1;
4837 protected_set_expr_location (result
, location
);
4841 /* If a binary op has been requested, combine the old LHS value with the RHS
4842 producing the value we should actually store into the LHS. */
4844 if (modifycode
!= NOP_EXPR
)
4846 lhs
= c_fully_fold (lhs
, false, NULL
);
4847 lhs
= stabilize_reference (lhs
);
4848 newrhs
= build_binary_op (location
,
4849 modifycode
, lhs
, rhs
, 1);
4851 /* The original type of the right hand side is no longer
4853 rhs_origtype
= NULL_TREE
;
4856 /* Give an error for storing in something that is 'const'. */
4858 if (TYPE_READONLY (lhstype
)
4859 || ((TREE_CODE (lhstype
) == RECORD_TYPE
4860 || TREE_CODE (lhstype
) == UNION_TYPE
)
4861 && C_TYPE_FIELDS_READONLY (lhstype
)))
4863 readonly_error (lhs
, lv_assign
);
4864 return error_mark_node
;
4866 else if (TREE_READONLY (lhs
))
4867 readonly_warning (lhs
, lv_assign
);
4869 /* If storing into a structure or union member,
4870 it has probably been given type `int'.
4871 Compute the type that would go with
4872 the actual amount of storage the member occupies. */
4874 if (TREE_CODE (lhs
) == COMPONENT_REF
4875 && (TREE_CODE (lhstype
) == INTEGER_TYPE
4876 || TREE_CODE (lhstype
) == BOOLEAN_TYPE
4877 || TREE_CODE (lhstype
) == REAL_TYPE
4878 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
4879 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
4881 /* If storing in a field that is in actuality a short or narrower than one,
4882 we must store in the field in its actual type. */
4884 if (lhstype
!= TREE_TYPE (lhs
))
4886 lhs
= copy_node (lhs
);
4887 TREE_TYPE (lhs
) = lhstype
;
4890 /* Issue -Wc++-compat warnings about an assignment to an enum type
4891 when LHS does not have its original type. This happens for,
4892 e.g., an enum bitfield in a struct. */
4894 && lhs_origtype
!= NULL_TREE
4895 && lhs_origtype
!= lhstype
4896 && TREE_CODE (lhs_origtype
) == ENUMERAL_TYPE
)
4898 tree checktype
= (rhs_origtype
!= NULL_TREE
4901 if (checktype
!= error_mark_node
4902 && TYPE_MAIN_VARIANT (checktype
) != TYPE_MAIN_VARIANT (lhs_origtype
))
4903 warning_at (location
, OPT_Wc___compat
,
4904 "enum conversion in assignment is invalid in C++");
4907 /* Convert new value to destination type. Fold it first, then
4908 restore any excess precision information, for the sake of
4909 conversion warnings. */
4911 npc
= null_pointer_constant_p (newrhs
);
4912 newrhs
= c_fully_fold (newrhs
, false, NULL
);
4913 if (rhs_semantic_type
)
4914 newrhs
= build1 (EXCESS_PRECISION_EXPR
, rhs_semantic_type
, newrhs
);
4915 newrhs
= convert_for_assignment (location
, lhstype
, newrhs
, rhs_origtype
,
4916 ic_assign
, npc
, NULL_TREE
, NULL_TREE
, 0);
4917 if (TREE_CODE (newrhs
) == ERROR_MARK
)
4918 return error_mark_node
;
4920 /* Emit ObjC write barrier, if necessary. */
4921 if (c_dialect_objc () && flag_objc_gc
)
4923 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
4926 protected_set_expr_location (result
, location
);
4931 /* Scan operands. */
4933 result
= build2 (MODIFY_EXPR
, lhstype
, lhs
, newrhs
);
4934 TREE_SIDE_EFFECTS (result
) = 1;
4935 protected_set_expr_location (result
, location
);
4937 /* If we got the LHS in a different type for storing in,
4938 convert the result back to the nominal type of LHS
4939 so that the value we return always has the same type
4940 as the LHS argument. */
4942 if (olhstype
== TREE_TYPE (result
))
4945 result
= convert_for_assignment (location
, olhstype
, result
, rhs_origtype
,
4946 ic_assign
, false, NULL_TREE
, NULL_TREE
, 0);
4947 protected_set_expr_location (result
, location
);
4951 /* Convert value RHS to type TYPE as preparation for an assignment to
4952 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
4953 original type of RHS; this differs from TREE_TYPE (RHS) for enum
4954 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
4955 constant before any folding.
4956 The real work of conversion is done by `convert'.
4957 The purpose of this function is to generate error messages
4958 for assignments that are not allowed in C.
4959 ERRTYPE says whether it is argument passing, assignment,
4960 initialization or return.
4962 LOCATION is the location of the RHS.
4963 FUNCTION is a tree for the function being called.
4964 PARMNUM is the number of the argument, for printing in error messages. */
4967 convert_for_assignment (location_t location
, tree type
, tree rhs
,
4968 tree origtype
, enum impl_conv errtype
,
4969 bool null_pointer_constant
, tree fundecl
,
4970 tree function
, int parmnum
)
4972 enum tree_code codel
= TREE_CODE (type
);
4973 tree orig_rhs
= rhs
;
4975 enum tree_code coder
;
4976 tree rname
= NULL_TREE
;
4977 bool objc_ok
= false;
4979 if (errtype
== ic_argpass
)
4982 /* Change pointer to function to the function itself for
4984 if (TREE_CODE (function
) == ADDR_EXPR
4985 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
4986 function
= TREE_OPERAND (function
, 0);
4988 /* Handle an ObjC selector specially for diagnostics. */
4989 selector
= objc_message_selector ();
4991 if (selector
&& parmnum
> 2)
4998 /* This macro is used to emit diagnostics to ensure that all format
4999 strings are complete sentences, visible to gettext and checked at
5001 #define WARN_FOR_ASSIGNMENT(LOCATION, OPT, AR, AS, IN, RE) \
5006 if (pedwarn (LOCATION, OPT, AR, parmnum, rname)) \
5007 inform ((fundecl && !DECL_IS_BUILTIN (fundecl)) \
5008 ? DECL_SOURCE_LOCATION (fundecl) : LOCATION, \
5009 "expected %qT but argument is of type %qT", \
5013 pedwarn (LOCATION, OPT, AS); \
5016 pedwarn_init (LOCATION, OPT, IN); \
5019 pedwarn (LOCATION, OPT, RE); \
5022 gcc_unreachable (); \
5026 /* This macro is used to emit diagnostics to ensure that all format
5027 strings are complete sentences, visible to gettext and checked at
5028 compile time. It is the same as WARN_FOR_ASSIGNMENT but with an
5029 extra parameter to enumerate qualifiers. */
5031 #define WARN_FOR_QUALIFIERS(LOCATION, OPT, AR, AS, IN, RE, QUALS) \
5036 if (pedwarn (LOCATION, OPT, AR, parmnum, rname, QUALS)) \
5037 inform ((fundecl && !DECL_IS_BUILTIN (fundecl)) \
5038 ? DECL_SOURCE_LOCATION (fundecl) : LOCATION, \
5039 "expected %qT but argument is of type %qT", \
5043 pedwarn (LOCATION, OPT, AS, QUALS); \
5046 pedwarn (LOCATION, OPT, IN, QUALS); \
5049 pedwarn (LOCATION, OPT, RE, QUALS); \
5052 gcc_unreachable (); \
5056 if (TREE_CODE (rhs
) == EXCESS_PRECISION_EXPR
)
5057 rhs
= TREE_OPERAND (rhs
, 0);
5059 rhstype
= TREE_TYPE (rhs
);
5060 coder
= TREE_CODE (rhstype
);
5062 if (coder
== ERROR_MARK
)
5063 return error_mark_node
;
5065 if (c_dialect_objc ())
5088 objc_ok
= objc_compare_types (type
, rhstype
, parmno
, rname
);
5091 if (warn_cxx_compat
)
5093 tree checktype
= origtype
!= NULL_TREE
? origtype
: rhstype
;
5094 if (checktype
!= error_mark_node
5095 && TREE_CODE (type
) == ENUMERAL_TYPE
5096 && TYPE_MAIN_VARIANT (checktype
) != TYPE_MAIN_VARIANT (type
))
5098 WARN_FOR_ASSIGNMENT (input_location
, OPT_Wc___compat
,
5099 G_("enum conversion when passing argument "
5100 "%d of %qE is invalid in C++"),
5101 G_("enum conversion in assignment is "
5103 G_("enum conversion in initialization is "
5105 G_("enum conversion in return is "
5110 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (rhstype
))
5113 if (coder
== VOID_TYPE
)
5115 /* Except for passing an argument to an unprototyped function,
5116 this is a constraint violation. When passing an argument to
5117 an unprototyped function, it is compile-time undefined;
5118 making it a constraint in that case was rejected in
5120 error_at (location
, "void value not ignored as it ought to be");
5121 return error_mark_node
;
5123 rhs
= require_complete_type (rhs
);
5124 if (rhs
== error_mark_node
)
5125 return error_mark_node
;
5126 /* A type converts to a reference to it.
5127 This code doesn't fully support references, it's just for the
5128 special case of va_start and va_copy. */
5129 if (codel
== REFERENCE_TYPE
5130 && comptypes (TREE_TYPE (type
), TREE_TYPE (rhs
)) == 1)
5132 if (!lvalue_p (rhs
))
5134 error_at (location
, "cannot pass rvalue to reference parameter");
5135 return error_mark_node
;
5137 if (!c_mark_addressable (rhs
))
5138 return error_mark_node
;
5139 rhs
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (rhs
)), rhs
);
5140 SET_EXPR_LOCATION (rhs
, location
);
5142 /* We already know that these two types are compatible, but they
5143 may not be exactly identical. In fact, `TREE_TYPE (type)' is
5144 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
5145 likely to be va_list, a typedef to __builtin_va_list, which
5146 is different enough that it will cause problems later. */
5147 if (TREE_TYPE (TREE_TYPE (rhs
)) != TREE_TYPE (type
))
5149 rhs
= build1 (NOP_EXPR
, build_pointer_type (TREE_TYPE (type
)), rhs
);
5150 SET_EXPR_LOCATION (rhs
, location
);
5153 rhs
= build1 (NOP_EXPR
, type
, rhs
);
5154 SET_EXPR_LOCATION (rhs
, location
);
5157 /* Some types can interconvert without explicit casts. */
5158 else if (codel
== VECTOR_TYPE
&& coder
== VECTOR_TYPE
5159 && vector_types_convertible_p (type
, TREE_TYPE (rhs
), true))
5160 return convert (type
, rhs
);
5161 /* Arithmetic types all interconvert, and enum is treated like int. */
5162 else if ((codel
== INTEGER_TYPE
|| codel
== REAL_TYPE
5163 || codel
== FIXED_POINT_TYPE
5164 || codel
== ENUMERAL_TYPE
|| codel
== COMPLEX_TYPE
5165 || codel
== BOOLEAN_TYPE
)
5166 && (coder
== INTEGER_TYPE
|| coder
== REAL_TYPE
5167 || coder
== FIXED_POINT_TYPE
5168 || coder
== ENUMERAL_TYPE
|| coder
== COMPLEX_TYPE
5169 || coder
== BOOLEAN_TYPE
))
5172 bool save
= in_late_binary_op
;
5173 if (codel
== BOOLEAN_TYPE
)
5174 in_late_binary_op
= true;
5175 ret
= convert_and_check (type
, orig_rhs
);
5176 if (codel
== BOOLEAN_TYPE
)
5177 in_late_binary_op
= save
;
5181 /* Aggregates in different TUs might need conversion. */
5182 if ((codel
== RECORD_TYPE
|| codel
== UNION_TYPE
)
5184 && comptypes (type
, rhstype
))
5185 return convert_and_check (type
, rhs
);
5187 /* Conversion to a transparent union or record from its member types.
5188 This applies only to function arguments. */
5189 if (((codel
== UNION_TYPE
|| codel
== RECORD_TYPE
)
5190 && TYPE_TRANSPARENT_AGGR (type
))
5191 && errtype
== ic_argpass
)
5193 tree memb
, marginal_memb
= NULL_TREE
;
5195 for (memb
= TYPE_FIELDS (type
); memb
; memb
= DECL_CHAIN (memb
))
5197 tree memb_type
= TREE_TYPE (memb
);
5199 if (comptypes (TYPE_MAIN_VARIANT (memb_type
),
5200 TYPE_MAIN_VARIANT (rhstype
)))
5203 if (TREE_CODE (memb_type
) != POINTER_TYPE
)
5206 if (coder
== POINTER_TYPE
)
5208 tree ttl
= TREE_TYPE (memb_type
);
5209 tree ttr
= TREE_TYPE (rhstype
);
5211 /* Any non-function converts to a [const][volatile] void *
5212 and vice versa; otherwise, targets must be the same.
5213 Meanwhile, the lhs target must have all the qualifiers of
5215 if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
5216 || comp_target_types (location
, memb_type
, rhstype
))
5218 /* If this type won't generate any warnings, use it. */
5219 if (TYPE_QUALS (ttl
) == TYPE_QUALS (ttr
)
5220 || ((TREE_CODE (ttr
) == FUNCTION_TYPE
5221 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
5222 ? ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
5223 == TYPE_QUALS (ttr
))
5224 : ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
5225 == TYPE_QUALS (ttl
))))
5228 /* Keep looking for a better type, but remember this one. */
5230 marginal_memb
= memb
;
5234 /* Can convert integer zero to any pointer type. */
5235 if (null_pointer_constant
)
5237 rhs
= null_pointer_node
;
5242 if (memb
|| marginal_memb
)
5246 /* We have only a marginally acceptable member type;
5247 it needs a warning. */
5248 tree ttl
= TREE_TYPE (TREE_TYPE (marginal_memb
));
5249 tree ttr
= TREE_TYPE (rhstype
);
5251 /* Const and volatile mean something different for function
5252 types, so the usual warnings are not appropriate. */
5253 if (TREE_CODE (ttr
) == FUNCTION_TYPE
5254 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
5256 /* Because const and volatile on functions are
5257 restrictions that say the function will not do
5258 certain things, it is okay to use a const or volatile
5259 function where an ordinary one is wanted, but not
5261 if (TYPE_QUALS_NO_ADDR_SPACE (ttl
)
5262 & ~TYPE_QUALS_NO_ADDR_SPACE (ttr
))
5263 WARN_FOR_QUALIFIERS (location
, 0,
5264 G_("passing argument %d of %qE "
5265 "makes %q#v qualified function "
5266 "pointer from unqualified"),
5267 G_("assignment makes %q#v qualified "
5268 "function pointer from "
5270 G_("initialization makes %q#v qualified "
5271 "function pointer from "
5273 G_("return makes %q#v qualified function "
5274 "pointer from unqualified"),
5275 TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
));
5277 else if (TYPE_QUALS_NO_ADDR_SPACE (ttr
)
5278 & ~TYPE_QUALS_NO_ADDR_SPACE (ttl
))
5279 WARN_FOR_QUALIFIERS (location
, 0,
5280 G_("passing argument %d of %qE discards "
5281 "%qv qualifier from pointer target type"),
5282 G_("assignment discards %qv qualifier "
5283 "from pointer target type"),
5284 G_("initialization discards %qv qualifier "
5285 "from pointer target type"),
5286 G_("return discards %qv qualifier from "
5287 "pointer target type"),
5288 TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
));
5290 memb
= marginal_memb
;
5293 if (!fundecl
|| !DECL_IN_SYSTEM_HEADER (fundecl
))
5294 pedwarn (location
, OPT_pedantic
,
5295 "ISO C prohibits argument conversion to union type");
5297 rhs
= fold_convert_loc (location
, TREE_TYPE (memb
), rhs
);
5298 return build_constructor_single (type
, memb
, rhs
);
5302 /* Conversions among pointers */
5303 else if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
5304 && (coder
== codel
))
5306 tree ttl
= TREE_TYPE (type
);
5307 tree ttr
= TREE_TYPE (rhstype
);
5310 bool is_opaque_pointer
;
5311 int target_cmp
= 0; /* Cache comp_target_types () result. */
5315 if (TREE_CODE (mvl
) != ARRAY_TYPE
)
5316 mvl
= TYPE_MAIN_VARIANT (mvl
);
5317 if (TREE_CODE (mvr
) != ARRAY_TYPE
)
5318 mvr
= TYPE_MAIN_VARIANT (mvr
);
5319 /* Opaque pointers are treated like void pointers. */
5320 is_opaque_pointer
= vector_targets_convertible_p (ttl
, ttr
);
5322 /* C++ does not allow the implicit conversion void* -> T*. However,
5323 for the purpose of reducing the number of false positives, we
5324 tolerate the special case of
5328 where NULL is typically defined in C to be '(void *) 0'. */
5329 if (VOID_TYPE_P (ttr
) && rhs
!= null_pointer_node
&& !VOID_TYPE_P (ttl
))
5330 warning_at (location
, OPT_Wc___compat
,
5331 "request for implicit conversion "
5332 "from %qT to %qT not permitted in C++", rhstype
, type
);
5334 /* See if the pointers point to incompatible address spaces. */
5335 asl
= TYPE_ADDR_SPACE (ttl
);
5336 asr
= TYPE_ADDR_SPACE (ttr
);
5337 if (!null_pointer_constant_p (rhs
)
5338 && asr
!= asl
&& !targetm
.addr_space
.subset_p (asr
, asl
))
5343 error_at (location
, "passing argument %d of %qE from pointer to "
5344 "non-enclosed address space", parmnum
, rname
);
5347 error_at (location
, "assignment from pointer to "
5348 "non-enclosed address space");
5351 error_at (location
, "initialization from pointer to "
5352 "non-enclosed address space");
5355 error_at (location
, "return from pointer to "
5356 "non-enclosed address space");
5361 return error_mark_node
;
5364 /* Check if the right-hand side has a format attribute but the
5365 left-hand side doesn't. */
5366 if (warn_missing_format_attribute
5367 && check_missing_format_attribute (type
, rhstype
))
5372 warning_at (location
, OPT_Wmissing_format_attribute
,
5373 "argument %d of %qE might be "
5374 "a candidate for a format attribute",
5378 warning_at (location
, OPT_Wmissing_format_attribute
,
5379 "assignment left-hand side might be "
5380 "a candidate for a format attribute");
5383 warning_at (location
, OPT_Wmissing_format_attribute
,
5384 "initialization left-hand side might be "
5385 "a candidate for a format attribute");
5388 warning_at (location
, OPT_Wmissing_format_attribute
,
5389 "return type might be "
5390 "a candidate for a format attribute");
5397 /* Any non-function converts to a [const][volatile] void *
5398 and vice versa; otherwise, targets must be the same.
5399 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
5400 if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
5401 || (target_cmp
= comp_target_types (location
, type
, rhstype
))
5402 || is_opaque_pointer
5403 || (c_common_unsigned_type (mvl
)
5404 == c_common_unsigned_type (mvr
)))
5407 && ((VOID_TYPE_P (ttl
) && TREE_CODE (ttr
) == FUNCTION_TYPE
)
5410 && !null_pointer_constant
5411 && TREE_CODE (ttl
) == FUNCTION_TYPE
)))
5412 WARN_FOR_ASSIGNMENT (location
, OPT_pedantic
,
5413 G_("ISO C forbids passing argument %d of "
5414 "%qE between function pointer "
5416 G_("ISO C forbids assignment between "
5417 "function pointer and %<void *%>"),
5418 G_("ISO C forbids initialization between "
5419 "function pointer and %<void *%>"),
5420 G_("ISO C forbids return between function "
5421 "pointer and %<void *%>"));
5422 /* Const and volatile mean something different for function types,
5423 so the usual warnings are not appropriate. */
5424 else if (TREE_CODE (ttr
) != FUNCTION_TYPE
5425 && TREE_CODE (ttl
) != FUNCTION_TYPE
)
5427 if (TYPE_QUALS_NO_ADDR_SPACE (ttr
)
5428 & ~TYPE_QUALS_NO_ADDR_SPACE (ttl
))
5430 /* Types differing only by the presence of the 'volatile'
5431 qualifier are acceptable if the 'volatile' has been added
5432 in by the Objective-C EH machinery. */
5433 if (!objc_type_quals_match (ttl
, ttr
))
5434 WARN_FOR_QUALIFIERS (location
, 0,
5435 G_("passing argument %d of %qE discards "
5436 "%qv qualifier from pointer target type"),
5437 G_("assignment discards %qv qualifier "
5438 "from pointer target type"),
5439 G_("initialization discards %qv qualifier "
5440 "from pointer target type"),
5441 G_("return discards %qv qualifier from "
5442 "pointer target type"),
5443 TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
));
5445 /* If this is not a case of ignoring a mismatch in signedness,
5447 else if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
5450 /* If there is a mismatch, do warn. */
5451 else if (warn_pointer_sign
)
5452 WARN_FOR_ASSIGNMENT (location
, OPT_Wpointer_sign
,
5453 G_("pointer targets in passing argument "
5454 "%d of %qE differ in signedness"),
5455 G_("pointer targets in assignment "
5456 "differ in signedness"),
5457 G_("pointer targets in initialization "
5458 "differ in signedness"),
5459 G_("pointer targets in return differ "
5462 else if (TREE_CODE (ttl
) == FUNCTION_TYPE
5463 && TREE_CODE (ttr
) == FUNCTION_TYPE
)
5465 /* Because const and volatile on functions are restrictions
5466 that say the function will not do certain things,
5467 it is okay to use a const or volatile function
5468 where an ordinary one is wanted, but not vice-versa. */
5469 if (TYPE_QUALS_NO_ADDR_SPACE (ttl
)
5470 & ~TYPE_QUALS_NO_ADDR_SPACE (ttr
))
5471 WARN_FOR_QUALIFIERS (location
, 0,
5472 G_("passing argument %d of %qE makes "
5473 "%q#v qualified function pointer "
5474 "from unqualified"),
5475 G_("assignment makes %q#v qualified function "
5476 "pointer from unqualified"),
5477 G_("initialization makes %q#v qualified "
5478 "function pointer from unqualified"),
5479 G_("return makes %q#v qualified function "
5480 "pointer from unqualified"),
5481 TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
));
5485 /* Avoid warning about the volatile ObjC EH puts on decls. */
5487 WARN_FOR_ASSIGNMENT (location
, 0,
5488 G_("passing argument %d of %qE from "
5489 "incompatible pointer type"),
5490 G_("assignment from incompatible pointer type"),
5491 G_("initialization from incompatible "
5493 G_("return from incompatible pointer type"));
5495 return convert (type
, rhs
);
5497 else if (codel
== POINTER_TYPE
&& coder
== ARRAY_TYPE
)
5499 /* ??? This should not be an error when inlining calls to
5500 unprototyped functions. */
5501 error_at (location
, "invalid use of non-lvalue array");
5502 return error_mark_node
;
5504 else if (codel
== POINTER_TYPE
&& coder
== INTEGER_TYPE
)
5506 /* An explicit constant 0 can convert to a pointer,
5507 or one that results from arithmetic, even including
5508 a cast to integer type. */
5509 if (!null_pointer_constant
)
5510 WARN_FOR_ASSIGNMENT (location
, 0,
5511 G_("passing argument %d of %qE makes "
5512 "pointer from integer without a cast"),
5513 G_("assignment makes pointer from integer "
5515 G_("initialization makes pointer from "
5516 "integer without a cast"),
5517 G_("return makes pointer from integer "
5520 return convert (type
, rhs
);
5522 else if (codel
== INTEGER_TYPE
&& coder
== POINTER_TYPE
)
5524 WARN_FOR_ASSIGNMENT (location
, 0,
5525 G_("passing argument %d of %qE makes integer "
5526 "from pointer without a cast"),
5527 G_("assignment makes integer from pointer "
5529 G_("initialization makes integer from pointer "
5531 G_("return makes integer from pointer "
5533 return convert (type
, rhs
);
5535 else if (codel
== BOOLEAN_TYPE
&& coder
== POINTER_TYPE
)
5538 bool save
= in_late_binary_op
;
5539 in_late_binary_op
= true;
5540 ret
= convert (type
, rhs
);
5541 in_late_binary_op
= save
;
5548 error_at (location
, "incompatible type for argument %d of %qE", parmnum
, rname
);
5549 inform ((fundecl
&& !DECL_IS_BUILTIN (fundecl
))
5550 ? DECL_SOURCE_LOCATION (fundecl
) : input_location
,
5551 "expected %qT but argument is of type %qT", type
, rhstype
);
5554 error_at (location
, "incompatible types when assigning to type %qT from "
5555 "type %qT", type
, rhstype
);
5559 "incompatible types when initializing type %qT using type %qT",
5564 "incompatible types when returning type %qT but %qT was "
5565 "expected", rhstype
, type
);
5571 return error_mark_node
;
5574 /* If VALUE is a compound expr all of whose expressions are constant, then
5575 return its value. Otherwise, return error_mark_node.
5577 This is for handling COMPOUND_EXPRs as initializer elements
5578 which is allowed with a warning when -pedantic is specified. */
5581 valid_compound_expr_initializer (tree value
, tree endtype
)
5583 if (TREE_CODE (value
) == COMPOUND_EXPR
)
5585 if (valid_compound_expr_initializer (TREE_OPERAND (value
, 0), endtype
)
5587 return error_mark_node
;
5588 return valid_compound_expr_initializer (TREE_OPERAND (value
, 1),
5591 else if (!initializer_constant_valid_p (value
, endtype
))
5592 return error_mark_node
;
5597 /* Perform appropriate conversions on the initial value of a variable,
5598 store it in the declaration DECL,
5599 and print any error messages that are appropriate.
5600 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
5601 If the init is invalid, store an ERROR_MARK.
5603 INIT_LOC is the location of the initial value. */
5606 store_init_value (location_t init_loc
, tree decl
, tree init
, tree origtype
)
5611 /* If variable's type was invalidly declared, just ignore it. */
5613 type
= TREE_TYPE (decl
);
5614 if (TREE_CODE (type
) == ERROR_MARK
)
5617 /* Digest the specified initializer into an expression. */
5620 npc
= null_pointer_constant_p (init
);
5621 value
= digest_init (init_loc
, type
, init
, origtype
, npc
,
5622 true, TREE_STATIC (decl
));
5624 /* Store the expression if valid; else report error. */
5626 if (!in_system_header
5627 && AGGREGATE_TYPE_P (TREE_TYPE (decl
)) && !TREE_STATIC (decl
))
5628 warning (OPT_Wtraditional
, "traditional C rejects automatic "
5629 "aggregate initialization");
5631 DECL_INITIAL (decl
) = value
;
5633 /* ANSI wants warnings about out-of-range constant initializers. */
5634 STRIP_TYPE_NOPS (value
);
5635 if (TREE_STATIC (decl
))
5636 constant_expression_warning (value
);
5638 /* Check if we need to set array size from compound literal size. */
5639 if (TREE_CODE (type
) == ARRAY_TYPE
5640 && TYPE_DOMAIN (type
) == 0
5641 && value
!= error_mark_node
)
5643 tree inside_init
= init
;
5645 STRIP_TYPE_NOPS (inside_init
);
5646 inside_init
= fold (inside_init
);
5648 if (TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
5650 tree cldecl
= COMPOUND_LITERAL_EXPR_DECL (inside_init
);
5652 if (TYPE_DOMAIN (TREE_TYPE (cldecl
)))
5654 /* For int foo[] = (int [3]){1}; we need to set array size
5655 now since later on array initializer will be just the
5656 brace enclosed list of the compound literal. */
5657 type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
5658 TREE_TYPE (decl
) = type
;
5659 TYPE_DOMAIN (type
) = TYPE_DOMAIN (TREE_TYPE (cldecl
));
5661 layout_decl (cldecl
, 0);
5667 /* Methods for storing and printing names for error messages. */
5669 /* Implement a spelling stack that allows components of a name to be pushed
5670 and popped. Each element on the stack is this structure. */
5677 unsigned HOST_WIDE_INT i
;
5682 #define SPELLING_STRING 1
5683 #define SPELLING_MEMBER 2
5684 #define SPELLING_BOUNDS 3
5686 static struct spelling
*spelling
; /* Next stack element (unused). */
5687 static struct spelling
*spelling_base
; /* Spelling stack base. */
5688 static int spelling_size
; /* Size of the spelling stack. */
5690 /* Macros to save and restore the spelling stack around push_... functions.
5691 Alternative to SAVE_SPELLING_STACK. */
5693 #define SPELLING_DEPTH() (spelling - spelling_base)
5694 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
5696 /* Push an element on the spelling stack with type KIND and assign VALUE
5699 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
5701 int depth = SPELLING_DEPTH (); \
5703 if (depth >= spelling_size) \
5705 spelling_size += 10; \
5706 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
5708 RESTORE_SPELLING_DEPTH (depth); \
5711 spelling->kind = (KIND); \
5712 spelling->MEMBER = (VALUE); \
5716 /* Push STRING on the stack. Printed literally. */
5719 push_string (const char *string
)
5721 PUSH_SPELLING (SPELLING_STRING
, string
, u
.s
);
5724 /* Push a member name on the stack. Printed as '.' STRING. */
5727 push_member_name (tree decl
)
5729 const char *const string
5731 ? identifier_to_locale (IDENTIFIER_POINTER (DECL_NAME (decl
)))
5732 : _("<anonymous>"));
5733 PUSH_SPELLING (SPELLING_MEMBER
, string
, u
.s
);
5736 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
5739 push_array_bounds (unsigned HOST_WIDE_INT bounds
)
5741 PUSH_SPELLING (SPELLING_BOUNDS
, bounds
, u
.i
);
5744 /* Compute the maximum size in bytes of the printed spelling. */
5747 spelling_length (void)
5752 for (p
= spelling_base
; p
< spelling
; p
++)
5754 if (p
->kind
== SPELLING_BOUNDS
)
5757 size
+= strlen (p
->u
.s
) + 1;
5763 /* Print the spelling to BUFFER and return it. */
5766 print_spelling (char *buffer
)
5771 for (p
= spelling_base
; p
< spelling
; p
++)
5772 if (p
->kind
== SPELLING_BOUNDS
)
5774 sprintf (d
, "[" HOST_WIDE_INT_PRINT_UNSIGNED
"]", p
->u
.i
);
5780 if (p
->kind
== SPELLING_MEMBER
)
5782 for (s
= p
->u
.s
; (*d
= *s
++); d
++)
5789 /* Issue an error message for a bad initializer component.
5790 GMSGID identifies the message.
5791 The component name is taken from the spelling stack. */
5794 error_init (const char *gmsgid
)
5798 /* The gmsgid may be a format string with %< and %>. */
5800 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
5802 error ("(near initialization for %qs)", ofwhat
);
5805 /* Issue a pedantic warning for a bad initializer component. OPT is
5806 the option OPT_* (from options.h) controlling this warning or 0 if
5807 it is unconditionally given. GMSGID identifies the message. The
5808 component name is taken from the spelling stack. */
5811 pedwarn_init (location_t location
, int opt
, const char *gmsgid
)
5815 /* The gmsgid may be a format string with %< and %>. */
5816 pedwarn (location
, opt
, gmsgid
);
5817 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
5819 pedwarn (location
, opt
, "(near initialization for %qs)", ofwhat
);
5822 /* Issue a warning for a bad initializer component.
5824 OPT is the OPT_W* value corresponding to the warning option that
5825 controls this warning. GMSGID identifies the message. The
5826 component name is taken from the spelling stack. */
5829 warning_init (int opt
, const char *gmsgid
)
5833 /* The gmsgid may be a format string with %< and %>. */
5834 warning (opt
, gmsgid
);
5835 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
5837 warning (opt
, "(near initialization for %qs)", ofwhat
);
5840 /* If TYPE is an array type and EXPR is a parenthesized string
5841 constant, warn if pedantic that EXPR is being used to initialize an
5842 object of type TYPE. */
5845 maybe_warn_string_init (tree type
, struct c_expr expr
)
5848 && TREE_CODE (type
) == ARRAY_TYPE
5849 && TREE_CODE (expr
.value
) == STRING_CST
5850 && expr
.original_code
!= STRING_CST
)
5851 pedwarn_init (input_location
, OPT_pedantic
,
5852 "array initialized from parenthesized string constant");
5855 /* Digest the parser output INIT as an initializer for type TYPE.
5856 Return a C expression of type TYPE to represent the initial value.
5858 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
5860 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
5862 If INIT is a string constant, STRICT_STRING is true if it is
5863 unparenthesized or we should not warn here for it being parenthesized.
5864 For other types of INIT, STRICT_STRING is not used.
5866 INIT_LOC is the location of the INIT.
5868 REQUIRE_CONSTANT requests an error if non-constant initializers or
5869 elements are seen. */
5872 digest_init (location_t init_loc
, tree type
, tree init
, tree origtype
,
5873 bool null_pointer_constant
, bool strict_string
,
5874 int require_constant
)
5876 enum tree_code code
= TREE_CODE (type
);
5877 tree inside_init
= init
;
5878 tree semantic_type
= NULL_TREE
;
5879 bool maybe_const
= true;
5881 if (type
== error_mark_node
5883 || init
== error_mark_node
5884 || TREE_TYPE (init
) == error_mark_node
)
5885 return error_mark_node
;
5887 STRIP_TYPE_NOPS (inside_init
);
5889 if (TREE_CODE (inside_init
) == EXCESS_PRECISION_EXPR
)
5891 semantic_type
= TREE_TYPE (inside_init
);
5892 inside_init
= TREE_OPERAND (inside_init
, 0);
5894 inside_init
= c_fully_fold (inside_init
, require_constant
, &maybe_const
);
5895 inside_init
= decl_constant_value_for_optimization (inside_init
);
5897 /* Initialization of an array of chars from a string constant
5898 optionally enclosed in braces. */
5900 if (code
== ARRAY_TYPE
&& inside_init
5901 && TREE_CODE (inside_init
) == STRING_CST
)
5903 tree typ1
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
5904 /* Note that an array could be both an array of character type
5905 and an array of wchar_t if wchar_t is signed char or unsigned
5907 bool char_array
= (typ1
== char_type_node
5908 || typ1
== signed_char_type_node
5909 || typ1
== unsigned_char_type_node
);
5910 bool wchar_array
= !!comptypes (typ1
, wchar_type_node
);
5911 bool char16_array
= !!comptypes (typ1
, char16_type_node
);
5912 bool char32_array
= !!comptypes (typ1
, char32_type_node
);
5914 if (char_array
|| wchar_array
|| char16_array
|| char32_array
)
5917 tree typ2
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init
)));
5918 expr
.value
= inside_init
;
5919 expr
.original_code
= (strict_string
? STRING_CST
: ERROR_MARK
);
5920 expr
.original_type
= NULL
;
5921 maybe_warn_string_init (type
, expr
);
5923 if (TYPE_DOMAIN (type
) && !TYPE_MAX_VALUE (TYPE_DOMAIN (type
)))
5924 pedwarn_init (init_loc
, OPT_pedantic
,
5925 "initialization of a flexible array member");
5927 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
5928 TYPE_MAIN_VARIANT (type
)))
5933 if (typ2
!= char_type_node
)
5935 error_init ("char-array initialized from wide string");
5936 return error_mark_node
;
5941 if (typ2
== char_type_node
)
5943 error_init ("wide character array initialized from non-wide "
5945 return error_mark_node
;
5947 else if (!comptypes(typ1
, typ2
))
5949 error_init ("wide character array initialized from "
5950 "incompatible wide string");
5951 return error_mark_node
;
5955 TREE_TYPE (inside_init
) = type
;
5956 if (TYPE_DOMAIN (type
) != 0
5957 && TYPE_SIZE (type
) != 0
5958 && TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
)
5960 unsigned HOST_WIDE_INT len
= TREE_STRING_LENGTH (inside_init
);
5962 /* Subtract the size of a single (possibly wide) character
5963 because it's ok to ignore the terminating null char
5964 that is counted in the length of the constant. */
5965 if (0 > compare_tree_int (TYPE_SIZE_UNIT (type
),
5967 - (TYPE_PRECISION (typ1
)
5969 pedwarn_init (init_loc
, 0,
5970 ("initializer-string for array of chars "
5972 else if (warn_cxx_compat
5973 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type
), len
))
5974 warning_at (init_loc
, OPT_Wc___compat
,
5975 ("initializer-string for array chars "
5976 "is too long for C++"));
5981 else if (INTEGRAL_TYPE_P (typ1
))
5983 error_init ("array of inappropriate type initialized "
5984 "from string constant");
5985 return error_mark_node
;
5989 /* Build a VECTOR_CST from a *constant* vector constructor. If the
5990 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
5991 below and handle as a constructor. */
5992 if (code
== VECTOR_TYPE
5993 && TREE_CODE (TREE_TYPE (inside_init
)) == VECTOR_TYPE
5994 && vector_types_convertible_p (TREE_TYPE (inside_init
), type
, true)
5995 && TREE_CONSTANT (inside_init
))
5997 if (TREE_CODE (inside_init
) == VECTOR_CST
5998 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
5999 TYPE_MAIN_VARIANT (type
)))
6002 if (TREE_CODE (inside_init
) == CONSTRUCTOR
)
6004 unsigned HOST_WIDE_INT ix
;
6006 bool constant_p
= true;
6008 /* Iterate through elements and check if all constructor
6009 elements are *_CSTs. */
6010 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init
), ix
, value
)
6011 if (!CONSTANT_CLASS_P (value
))
6018 return build_vector_from_ctor (type
,
6019 CONSTRUCTOR_ELTS (inside_init
));
6023 if (warn_sequence_point
)
6024 verify_sequence_points (inside_init
);
6026 /* Any type can be initialized
6027 from an expression of the same type, optionally with braces. */
6029 if (inside_init
&& TREE_TYPE (inside_init
) != 0
6030 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
6031 TYPE_MAIN_VARIANT (type
))
6032 || (code
== ARRAY_TYPE
6033 && comptypes (TREE_TYPE (inside_init
), type
))
6034 || (code
== VECTOR_TYPE
6035 && comptypes (TREE_TYPE (inside_init
), type
))
6036 || (code
== POINTER_TYPE
6037 && TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
6038 && comptypes (TREE_TYPE (TREE_TYPE (inside_init
)),
6039 TREE_TYPE (type
)))))
6041 if (code
== POINTER_TYPE
)
6043 if (TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
)
6045 if (TREE_CODE (inside_init
) == STRING_CST
6046 || TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
6047 inside_init
= array_to_pointer_conversion
6048 (init_loc
, inside_init
);
6051 error_init ("invalid use of non-lvalue array");
6052 return error_mark_node
;
6057 if (code
== VECTOR_TYPE
)
6058 /* Although the types are compatible, we may require a
6060 inside_init
= convert (type
, inside_init
);
6062 if (require_constant
6063 && (code
== VECTOR_TYPE
|| !flag_isoc99
)
6064 && TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
6066 /* As an extension, allow initializing objects with static storage
6067 duration with compound literals (which are then treated just as
6068 the brace enclosed list they contain). Also allow this for
6069 vectors, as we can only assign them with compound literals. */
6070 tree decl
= COMPOUND_LITERAL_EXPR_DECL (inside_init
);
6071 inside_init
= DECL_INITIAL (decl
);
6074 if (code
== ARRAY_TYPE
&& TREE_CODE (inside_init
) != STRING_CST
6075 && TREE_CODE (inside_init
) != CONSTRUCTOR
)
6077 error_init ("array initialized from non-constant array expression");
6078 return error_mark_node
;
6081 /* Compound expressions can only occur here if -pedantic or
6082 -pedantic-errors is specified. In the later case, we always want
6083 an error. In the former case, we simply want a warning. */
6084 if (require_constant
&& pedantic
6085 && TREE_CODE (inside_init
) == COMPOUND_EXPR
)
6088 = valid_compound_expr_initializer (inside_init
,
6089 TREE_TYPE (inside_init
));
6090 if (inside_init
== error_mark_node
)
6091 error_init ("initializer element is not constant");
6093 pedwarn_init (init_loc
, OPT_pedantic
,
6094 "initializer element is not constant");
6095 if (flag_pedantic_errors
)
6096 inside_init
= error_mark_node
;
6098 else if (require_constant
6099 && !initializer_constant_valid_p (inside_init
,
6100 TREE_TYPE (inside_init
)))
6102 error_init ("initializer element is not constant");
6103 inside_init
= error_mark_node
;
6105 else if (require_constant
&& !maybe_const
)
6106 pedwarn_init (init_loc
, 0,
6107 "initializer element is not a constant expression");
6109 /* Added to enable additional -Wmissing-format-attribute warnings. */
6110 if (TREE_CODE (TREE_TYPE (inside_init
)) == POINTER_TYPE
)
6111 inside_init
= convert_for_assignment (init_loc
, type
, inside_init
,
6113 ic_init
, null_pointer_constant
,
6114 NULL_TREE
, NULL_TREE
, 0);
6118 /* Handle scalar types, including conversions. */
6120 if (code
== INTEGER_TYPE
|| code
== REAL_TYPE
|| code
== FIXED_POINT_TYPE
6121 || code
== POINTER_TYPE
|| code
== ENUMERAL_TYPE
|| code
== BOOLEAN_TYPE
6122 || code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
6124 if (TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
6125 && (TREE_CODE (init
) == STRING_CST
6126 || TREE_CODE (init
) == COMPOUND_LITERAL_EXPR
))
6127 inside_init
= init
= array_to_pointer_conversion (init_loc
, init
);
6129 inside_init
= build1 (EXCESS_PRECISION_EXPR
, semantic_type
,
6132 = convert_for_assignment (init_loc
, type
, inside_init
, origtype
,
6133 ic_init
, null_pointer_constant
,
6134 NULL_TREE
, NULL_TREE
, 0);
6136 /* Check to see if we have already given an error message. */
6137 if (inside_init
== error_mark_node
)
6139 else if (require_constant
&& !TREE_CONSTANT (inside_init
))
6141 error_init ("initializer element is not constant");
6142 inside_init
= error_mark_node
;
6144 else if (require_constant
6145 && !initializer_constant_valid_p (inside_init
,
6146 TREE_TYPE (inside_init
)))
6148 error_init ("initializer element is not computable at load time");
6149 inside_init
= error_mark_node
;
6151 else if (require_constant
&& !maybe_const
)
6152 pedwarn_init (init_loc
, 0,
6153 "initializer element is not a constant expression");
6158 /* Come here only for records and arrays. */
6160 if (COMPLETE_TYPE_P (type
) && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
6162 error_init ("variable-sized object may not be initialized");
6163 return error_mark_node
;
6166 error_init ("invalid initializer");
6167 return error_mark_node
;
6170 /* Handle initializers that use braces. */
6172 /* Type of object we are accumulating a constructor for.
6173 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
6174 static tree constructor_type
;
6176 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
6178 static tree constructor_fields
;
6180 /* For an ARRAY_TYPE, this is the specified index
6181 at which to store the next element we get. */
6182 static tree constructor_index
;
6184 /* For an ARRAY_TYPE, this is the maximum index. */
6185 static tree constructor_max_index
;
6187 /* For a RECORD_TYPE, this is the first field not yet written out. */
6188 static tree constructor_unfilled_fields
;
6190 /* For an ARRAY_TYPE, this is the index of the first element
6191 not yet written out. */
6192 static tree constructor_unfilled_index
;
6194 /* In a RECORD_TYPE, the byte index of the next consecutive field.
6195 This is so we can generate gaps between fields, when appropriate. */
6196 static tree constructor_bit_index
;
6198 /* If we are saving up the elements rather than allocating them,
6199 this is the list of elements so far (in reverse order,
6200 most recent first). */
6201 static VEC(constructor_elt
,gc
) *constructor_elements
;
6203 /* 1 if constructor should be incrementally stored into a constructor chain,
6204 0 if all the elements should be kept in AVL tree. */
6205 static int constructor_incremental
;
6207 /* 1 if so far this constructor's elements are all compile-time constants. */
6208 static int constructor_constant
;
6210 /* 1 if so far this constructor's elements are all valid address constants. */
6211 static int constructor_simple
;
6213 /* 1 if this constructor has an element that cannot be part of a
6214 constant expression. */
6215 static int constructor_nonconst
;
6217 /* 1 if this constructor is erroneous so far. */
6218 static int constructor_erroneous
;
6220 /* Structure for managing pending initializer elements, organized as an
6225 struct init_node
*left
, *right
;
6226 struct init_node
*parent
;
6233 /* Tree of pending elements at this constructor level.
6234 These are elements encountered out of order
6235 which belong at places we haven't reached yet in actually
6237 Will never hold tree nodes across GC runs. */
6238 static struct init_node
*constructor_pending_elts
;
6240 /* The SPELLING_DEPTH of this constructor. */
6241 static int constructor_depth
;
6243 /* DECL node for which an initializer is being read.
6244 0 means we are reading a constructor expression
6245 such as (struct foo) {...}. */
6246 static tree constructor_decl
;
6248 /* Nonzero if this is an initializer for a top-level decl. */
6249 static int constructor_top_level
;
6251 /* Nonzero if there were any member designators in this initializer. */
6252 static int constructor_designated
;
6254 /* Nesting depth of designator list. */
6255 static int designator_depth
;
6257 /* Nonzero if there were diagnosed errors in this designator list. */
6258 static int designator_erroneous
;
6261 /* This stack has a level for each implicit or explicit level of
6262 structuring in the initializer, including the outermost one. It
6263 saves the values of most of the variables above. */
6265 struct constructor_range_stack
;
6267 struct constructor_stack
6269 struct constructor_stack
*next
;
6274 tree unfilled_index
;
6275 tree unfilled_fields
;
6277 VEC(constructor_elt
,gc
) *elements
;
6278 struct init_node
*pending_elts
;
6281 /* If value nonzero, this value should replace the entire
6282 constructor at this level. */
6283 struct c_expr replacement_value
;
6284 struct constructor_range_stack
*range_stack
;
6295 static struct constructor_stack
*constructor_stack
;
6297 /* This stack represents designators from some range designator up to
6298 the last designator in the list. */
6300 struct constructor_range_stack
6302 struct constructor_range_stack
*next
, *prev
;
6303 struct constructor_stack
*stack
;
6310 static struct constructor_range_stack
*constructor_range_stack
;
6312 /* This stack records separate initializers that are nested.
6313 Nested initializers can't happen in ANSI C, but GNU C allows them
6314 in cases like { ... (struct foo) { ... } ... }. */
6316 struct initializer_stack
6318 struct initializer_stack
*next
;
6320 struct constructor_stack
*constructor_stack
;
6321 struct constructor_range_stack
*constructor_range_stack
;
6322 VEC(constructor_elt
,gc
) *elements
;
6323 struct spelling
*spelling
;
6324 struct spelling
*spelling_base
;
6327 char require_constant_value
;
6328 char require_constant_elements
;
6331 static struct initializer_stack
*initializer_stack
;
6333 /* Prepare to parse and output the initializer for variable DECL. */
6336 start_init (tree decl
, tree asmspec_tree ATTRIBUTE_UNUSED
, int top_level
)
6339 struct initializer_stack
*p
= XNEW (struct initializer_stack
);
6341 p
->decl
= constructor_decl
;
6342 p
->require_constant_value
= require_constant_value
;
6343 p
->require_constant_elements
= require_constant_elements
;
6344 p
->constructor_stack
= constructor_stack
;
6345 p
->constructor_range_stack
= constructor_range_stack
;
6346 p
->elements
= constructor_elements
;
6347 p
->spelling
= spelling
;
6348 p
->spelling_base
= spelling_base
;
6349 p
->spelling_size
= spelling_size
;
6350 p
->top_level
= constructor_top_level
;
6351 p
->next
= initializer_stack
;
6352 initializer_stack
= p
;
6354 constructor_decl
= decl
;
6355 constructor_designated
= 0;
6356 constructor_top_level
= top_level
;
6358 if (decl
!= 0 && decl
!= error_mark_node
)
6360 require_constant_value
= TREE_STATIC (decl
);
6361 require_constant_elements
6362 = ((TREE_STATIC (decl
) || (pedantic
&& !flag_isoc99
))
6363 /* For a scalar, you can always use any value to initialize,
6364 even within braces. */
6365 && (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
6366 || TREE_CODE (TREE_TYPE (decl
)) == RECORD_TYPE
6367 || TREE_CODE (TREE_TYPE (decl
)) == UNION_TYPE
6368 || TREE_CODE (TREE_TYPE (decl
)) == QUAL_UNION_TYPE
));
6369 locus
= identifier_to_locale (IDENTIFIER_POINTER (DECL_NAME (decl
)));
6373 require_constant_value
= 0;
6374 require_constant_elements
= 0;
6375 locus
= _("(anonymous)");
6378 constructor_stack
= 0;
6379 constructor_range_stack
= 0;
6381 missing_braces_mentioned
= 0;
6385 RESTORE_SPELLING_DEPTH (0);
6388 push_string (locus
);
6394 struct initializer_stack
*p
= initializer_stack
;
6396 /* Free the whole constructor stack of this initializer. */
6397 while (constructor_stack
)
6399 struct constructor_stack
*q
= constructor_stack
;
6400 constructor_stack
= q
->next
;
6404 gcc_assert (!constructor_range_stack
);
6406 /* Pop back to the data of the outer initializer (if any). */
6407 free (spelling_base
);
6409 constructor_decl
= p
->decl
;
6410 require_constant_value
= p
->require_constant_value
;
6411 require_constant_elements
= p
->require_constant_elements
;
6412 constructor_stack
= p
->constructor_stack
;
6413 constructor_range_stack
= p
->constructor_range_stack
;
6414 constructor_elements
= p
->elements
;
6415 spelling
= p
->spelling
;
6416 spelling_base
= p
->spelling_base
;
6417 spelling_size
= p
->spelling_size
;
6418 constructor_top_level
= p
->top_level
;
6419 initializer_stack
= p
->next
;
6423 /* Call here when we see the initializer is surrounded by braces.
6424 This is instead of a call to push_init_level;
6425 it is matched by a call to pop_init_level.
6427 TYPE is the type to initialize, for a constructor expression.
6428 For an initializer for a decl, TYPE is zero. */
6431 really_start_incremental_init (tree type
)
6433 struct constructor_stack
*p
= XNEW (struct constructor_stack
);
6436 type
= TREE_TYPE (constructor_decl
);
6438 if (TREE_CODE (type
) == VECTOR_TYPE
6439 && TYPE_VECTOR_OPAQUE (type
))
6440 error ("opaque vector types cannot be initialized");
6442 p
->type
= constructor_type
;
6443 p
->fields
= constructor_fields
;
6444 p
->index
= constructor_index
;
6445 p
->max_index
= constructor_max_index
;
6446 p
->unfilled_index
= constructor_unfilled_index
;
6447 p
->unfilled_fields
= constructor_unfilled_fields
;
6448 p
->bit_index
= constructor_bit_index
;
6449 p
->elements
= constructor_elements
;
6450 p
->constant
= constructor_constant
;
6451 p
->simple
= constructor_simple
;
6452 p
->nonconst
= constructor_nonconst
;
6453 p
->erroneous
= constructor_erroneous
;
6454 p
->pending_elts
= constructor_pending_elts
;
6455 p
->depth
= constructor_depth
;
6456 p
->replacement_value
.value
= 0;
6457 p
->replacement_value
.original_code
= ERROR_MARK
;
6458 p
->replacement_value
.original_type
= NULL
;
6462 p
->incremental
= constructor_incremental
;
6463 p
->designated
= constructor_designated
;
6465 constructor_stack
= p
;
6467 constructor_constant
= 1;
6468 constructor_simple
= 1;
6469 constructor_nonconst
= 0;
6470 constructor_depth
= SPELLING_DEPTH ();
6471 constructor_elements
= 0;
6472 constructor_pending_elts
= 0;
6473 constructor_type
= type
;
6474 constructor_incremental
= 1;
6475 constructor_designated
= 0;
6476 designator_depth
= 0;
6477 designator_erroneous
= 0;
6479 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6480 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6482 constructor_fields
= TYPE_FIELDS (constructor_type
);
6483 /* Skip any nameless bit fields at the beginning. */
6484 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
6485 && DECL_NAME (constructor_fields
) == 0)
6486 constructor_fields
= DECL_CHAIN (constructor_fields
);
6488 constructor_unfilled_fields
= constructor_fields
;
6489 constructor_bit_index
= bitsize_zero_node
;
6491 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6493 if (TYPE_DOMAIN (constructor_type
))
6495 constructor_max_index
6496 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
6498 /* Detect non-empty initializations of zero-length arrays. */
6499 if (constructor_max_index
== NULL_TREE
6500 && TYPE_SIZE (constructor_type
))
6501 constructor_max_index
= integer_minus_one_node
;
6503 /* constructor_max_index needs to be an INTEGER_CST. Attempts
6504 to initialize VLAs will cause a proper error; avoid tree
6505 checking errors as well by setting a safe value. */
6506 if (constructor_max_index
6507 && TREE_CODE (constructor_max_index
) != INTEGER_CST
)
6508 constructor_max_index
= integer_minus_one_node
;
6511 = convert (bitsizetype
,
6512 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
6516 constructor_index
= bitsize_zero_node
;
6517 constructor_max_index
= NULL_TREE
;
6520 constructor_unfilled_index
= constructor_index
;
6522 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
6524 /* Vectors are like simple fixed-size arrays. */
6525 constructor_max_index
=
6526 build_int_cst (NULL_TREE
, TYPE_VECTOR_SUBPARTS (constructor_type
) - 1);
6527 constructor_index
= bitsize_zero_node
;
6528 constructor_unfilled_index
= constructor_index
;
6532 /* Handle the case of int x = {5}; */
6533 constructor_fields
= constructor_type
;
6534 constructor_unfilled_fields
= constructor_type
;
6538 /* Push down into a subobject, for initialization.
6539 If this is for an explicit set of braces, IMPLICIT is 0.
6540 If it is because the next element belongs at a lower level,
6541 IMPLICIT is 1 (or 2 if the push is because of designator list). */
6544 push_init_level (int implicit
, struct obstack
* braced_init_obstack
)
6546 struct constructor_stack
*p
;
6547 tree value
= NULL_TREE
;
6549 /* If we've exhausted any levels that didn't have braces,
6550 pop them now. If implicit == 1, this will have been done in
6551 process_init_element; do not repeat it here because in the case
6552 of excess initializers for an empty aggregate this leads to an
6553 infinite cycle of popping a level and immediately recreating
6557 while (constructor_stack
->implicit
)
6559 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
6560 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6561 && constructor_fields
== 0)
6562 process_init_element (pop_init_level (1, braced_init_obstack
),
6563 true, braced_init_obstack
);
6564 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
6565 && constructor_max_index
6566 && tree_int_cst_lt (constructor_max_index
,
6568 process_init_element (pop_init_level (1, braced_init_obstack
),
6569 true, braced_init_obstack
);
6575 /* Unless this is an explicit brace, we need to preserve previous
6579 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
6580 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6581 && constructor_fields
)
6582 value
= find_init_member (constructor_fields
, braced_init_obstack
);
6583 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6584 value
= find_init_member (constructor_index
, braced_init_obstack
);
6587 p
= XNEW (struct constructor_stack
);
6588 p
->type
= constructor_type
;
6589 p
->fields
= constructor_fields
;
6590 p
->index
= constructor_index
;
6591 p
->max_index
= constructor_max_index
;
6592 p
->unfilled_index
= constructor_unfilled_index
;
6593 p
->unfilled_fields
= constructor_unfilled_fields
;
6594 p
->bit_index
= constructor_bit_index
;
6595 p
->elements
= constructor_elements
;
6596 p
->constant
= constructor_constant
;
6597 p
->simple
= constructor_simple
;
6598 p
->nonconst
= constructor_nonconst
;
6599 p
->erroneous
= constructor_erroneous
;
6600 p
->pending_elts
= constructor_pending_elts
;
6601 p
->depth
= constructor_depth
;
6602 p
->replacement_value
.value
= 0;
6603 p
->replacement_value
.original_code
= ERROR_MARK
;
6604 p
->replacement_value
.original_type
= NULL
;
6605 p
->implicit
= implicit
;
6607 p
->incremental
= constructor_incremental
;
6608 p
->designated
= constructor_designated
;
6609 p
->next
= constructor_stack
;
6611 constructor_stack
= p
;
6613 constructor_constant
= 1;
6614 constructor_simple
= 1;
6615 constructor_nonconst
= 0;
6616 constructor_depth
= SPELLING_DEPTH ();
6617 constructor_elements
= 0;
6618 constructor_incremental
= 1;
6619 constructor_designated
= 0;
6620 constructor_pending_elts
= 0;
6623 p
->range_stack
= constructor_range_stack
;
6624 constructor_range_stack
= 0;
6625 designator_depth
= 0;
6626 designator_erroneous
= 0;
6629 /* Don't die if an entire brace-pair level is superfluous
6630 in the containing level. */
6631 if (constructor_type
== 0)
6633 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
6634 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6636 /* Don't die if there are extra init elts at the end. */
6637 if (constructor_fields
== 0)
6638 constructor_type
= 0;
6641 constructor_type
= TREE_TYPE (constructor_fields
);
6642 push_member_name (constructor_fields
);
6643 constructor_depth
++;
6646 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6648 constructor_type
= TREE_TYPE (constructor_type
);
6649 push_array_bounds (tree_low_cst (constructor_index
, 1));
6650 constructor_depth
++;
6653 if (constructor_type
== 0)
6655 error_init ("extra brace group at end of initializer");
6656 constructor_fields
= 0;
6657 constructor_unfilled_fields
= 0;
6661 if (value
&& TREE_CODE (value
) == CONSTRUCTOR
)
6663 constructor_constant
= TREE_CONSTANT (value
);
6664 constructor_simple
= TREE_STATIC (value
);
6665 constructor_nonconst
= CONSTRUCTOR_NON_CONST (value
);
6666 constructor_elements
= CONSTRUCTOR_ELTS (value
);
6667 if (!VEC_empty (constructor_elt
, constructor_elements
)
6668 && (TREE_CODE (constructor_type
) == RECORD_TYPE
6669 || TREE_CODE (constructor_type
) == ARRAY_TYPE
))
6670 set_nonincremental_init (braced_init_obstack
);
6673 if (implicit
== 1 && warn_missing_braces
&& !missing_braces_mentioned
)
6675 missing_braces_mentioned
= 1;
6676 warning_init (OPT_Wmissing_braces
, "missing braces around initializer");
6679 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6680 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6682 constructor_fields
= TYPE_FIELDS (constructor_type
);
6683 /* Skip any nameless bit fields at the beginning. */
6684 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
6685 && DECL_NAME (constructor_fields
) == 0)
6686 constructor_fields
= DECL_CHAIN (constructor_fields
);
6688 constructor_unfilled_fields
= constructor_fields
;
6689 constructor_bit_index
= bitsize_zero_node
;
6691 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
6693 /* Vectors are like simple fixed-size arrays. */
6694 constructor_max_index
=
6695 build_int_cst (NULL_TREE
, TYPE_VECTOR_SUBPARTS (constructor_type
) - 1);
6696 constructor_index
= convert (bitsizetype
, integer_zero_node
);
6697 constructor_unfilled_index
= constructor_index
;
6699 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6701 if (TYPE_DOMAIN (constructor_type
))
6703 constructor_max_index
6704 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
6706 /* Detect non-empty initializations of zero-length arrays. */
6707 if (constructor_max_index
== NULL_TREE
6708 && TYPE_SIZE (constructor_type
))
6709 constructor_max_index
= integer_minus_one_node
;
6711 /* constructor_max_index needs to be an INTEGER_CST. Attempts
6712 to initialize VLAs will cause a proper error; avoid tree
6713 checking errors as well by setting a safe value. */
6714 if (constructor_max_index
6715 && TREE_CODE (constructor_max_index
) != INTEGER_CST
)
6716 constructor_max_index
= integer_minus_one_node
;
6719 = convert (bitsizetype
,
6720 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
6723 constructor_index
= bitsize_zero_node
;
6725 constructor_unfilled_index
= constructor_index
;
6726 if (value
&& TREE_CODE (value
) == STRING_CST
)
6728 /* We need to split the char/wchar array into individual
6729 characters, so that we don't have to special case it
6731 set_nonincremental_init_from_string (value
, braced_init_obstack
);
6736 if (constructor_type
!= error_mark_node
)
6737 warning_init (0, "braces around scalar initializer");
6738 constructor_fields
= constructor_type
;
6739 constructor_unfilled_fields
= constructor_type
;
6743 /* At the end of an implicit or explicit brace level,
6744 finish up that level of constructor. If a single expression
6745 with redundant braces initialized that level, return the
6746 c_expr structure for that expression. Otherwise, the original_code
6747 element is set to ERROR_MARK.
6748 If we were outputting the elements as they are read, return 0 as the value
6749 from inner levels (process_init_element ignores that),
6750 but return error_mark_node as the value from the outermost level
6751 (that's what we want to put in DECL_INITIAL).
6752 Otherwise, return a CONSTRUCTOR expression as the value. */
6755 pop_init_level (int implicit
, struct obstack
* braced_init_obstack
)
6757 struct constructor_stack
*p
;
6760 ret
.original_code
= ERROR_MARK
;
6761 ret
.original_type
= NULL
;
6765 /* When we come to an explicit close brace,
6766 pop any inner levels that didn't have explicit braces. */
6767 while (constructor_stack
->implicit
)
6769 process_init_element (pop_init_level (1, braced_init_obstack
),
6770 true, braced_init_obstack
);
6772 gcc_assert (!constructor_range_stack
);
6775 /* Now output all pending elements. */
6776 constructor_incremental
= 1;
6777 output_pending_init_elements (1, braced_init_obstack
);
6779 p
= constructor_stack
;
6781 /* Error for initializing a flexible array member, or a zero-length
6782 array member in an inappropriate context. */
6783 if (constructor_type
&& constructor_fields
6784 && TREE_CODE (constructor_type
) == ARRAY_TYPE
6785 && TYPE_DOMAIN (constructor_type
)
6786 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
)))
6788 /* Silently discard empty initializations. The parser will
6789 already have pedwarned for empty brackets. */
6790 if (integer_zerop (constructor_unfilled_index
))
6791 constructor_type
= NULL_TREE
;
6794 gcc_assert (!TYPE_SIZE (constructor_type
));
6796 if (constructor_depth
> 2)
6797 error_init ("initialization of flexible array member in a nested context");
6799 pedwarn_init (input_location
, OPT_pedantic
,
6800 "initialization of a flexible array member");
6802 /* We have already issued an error message for the existence
6803 of a flexible array member not at the end of the structure.
6804 Discard the initializer so that we do not die later. */
6805 if (DECL_CHAIN (constructor_fields
) != NULL_TREE
)
6806 constructor_type
= NULL_TREE
;
6810 /* Warn when some struct elements are implicitly initialized to zero. */
6811 if (warn_missing_field_initializers
6813 && TREE_CODE (constructor_type
) == RECORD_TYPE
6814 && constructor_unfilled_fields
)
6816 /* Do not warn for flexible array members or zero-length arrays. */
6817 while (constructor_unfilled_fields
6818 && (!DECL_SIZE (constructor_unfilled_fields
)
6819 || integer_zerop (DECL_SIZE (constructor_unfilled_fields
))))
6820 constructor_unfilled_fields
= DECL_CHAIN (constructor_unfilled_fields
);
6822 /* Do not warn if this level of the initializer uses member
6823 designators; it is likely to be deliberate. */
6824 if (constructor_unfilled_fields
&& !constructor_designated
)
6826 push_member_name (constructor_unfilled_fields
);
6827 warning_init (OPT_Wmissing_field_initializers
,
6828 "missing initializer");
6829 RESTORE_SPELLING_DEPTH (constructor_depth
);
6833 /* Pad out the end of the structure. */
6834 if (p
->replacement_value
.value
)
6835 /* If this closes a superfluous brace pair,
6836 just pass out the element between them. */
6837 ret
= p
->replacement_value
;
6838 else if (constructor_type
== 0)
6840 else if (TREE_CODE (constructor_type
) != RECORD_TYPE
6841 && TREE_CODE (constructor_type
) != UNION_TYPE
6842 && TREE_CODE (constructor_type
) != ARRAY_TYPE
6843 && TREE_CODE (constructor_type
) != VECTOR_TYPE
)
6845 /* A nonincremental scalar initializer--just return
6846 the element, after verifying there is just one. */
6847 if (VEC_empty (constructor_elt
,constructor_elements
))
6849 if (!constructor_erroneous
)
6850 error_init ("empty scalar initializer");
6851 ret
.value
= error_mark_node
;
6853 else if (VEC_length (constructor_elt
,constructor_elements
) != 1)
6855 error_init ("extra elements in scalar initializer");
6856 ret
.value
= VEC_index (constructor_elt
,constructor_elements
,0)->value
;
6859 ret
.value
= VEC_index (constructor_elt
,constructor_elements
,0)->value
;
6863 if (constructor_erroneous
)
6864 ret
.value
= error_mark_node
;
6867 ret
.value
= build_constructor (constructor_type
,
6868 constructor_elements
);
6869 if (constructor_constant
)
6870 TREE_CONSTANT (ret
.value
) = 1;
6871 if (constructor_constant
&& constructor_simple
)
6872 TREE_STATIC (ret
.value
) = 1;
6873 if (constructor_nonconst
)
6874 CONSTRUCTOR_NON_CONST (ret
.value
) = 1;
6878 if (ret
.value
&& TREE_CODE (ret
.value
) != CONSTRUCTOR
)
6880 if (constructor_nonconst
)
6881 ret
.original_code
= C_MAYBE_CONST_EXPR
;
6882 else if (ret
.original_code
== C_MAYBE_CONST_EXPR
)
6883 ret
.original_code
= ERROR_MARK
;
6886 constructor_type
= p
->type
;
6887 constructor_fields
= p
->fields
;
6888 constructor_index
= p
->index
;
6889 constructor_max_index
= p
->max_index
;
6890 constructor_unfilled_index
= p
->unfilled_index
;
6891 constructor_unfilled_fields
= p
->unfilled_fields
;
6892 constructor_bit_index
= p
->bit_index
;
6893 constructor_elements
= p
->elements
;
6894 constructor_constant
= p
->constant
;
6895 constructor_simple
= p
->simple
;
6896 constructor_nonconst
= p
->nonconst
;
6897 constructor_erroneous
= p
->erroneous
;
6898 constructor_incremental
= p
->incremental
;
6899 constructor_designated
= p
->designated
;
6900 constructor_pending_elts
= p
->pending_elts
;
6901 constructor_depth
= p
->depth
;
6903 constructor_range_stack
= p
->range_stack
;
6904 RESTORE_SPELLING_DEPTH (constructor_depth
);
6906 constructor_stack
= p
->next
;
6909 if (ret
.value
== 0 && constructor_stack
== 0)
6910 ret
.value
= error_mark_node
;
6914 /* Common handling for both array range and field name designators.
6915 ARRAY argument is nonzero for array ranges. Returns zero for success. */
6918 set_designator (int array
, struct obstack
* braced_init_obstack
)
6921 enum tree_code subcode
;
6923 /* Don't die if an entire brace-pair level is superfluous
6924 in the containing level. */
6925 if (constructor_type
== 0)
6928 /* If there were errors in this designator list already, bail out
6930 if (designator_erroneous
)
6933 if (!designator_depth
)
6935 gcc_assert (!constructor_range_stack
);
6937 /* Designator list starts at the level of closest explicit
6939 while (constructor_stack
->implicit
)
6941 process_init_element (pop_init_level (1, braced_init_obstack
),
6942 true, braced_init_obstack
);
6944 constructor_designated
= 1;
6948 switch (TREE_CODE (constructor_type
))
6952 subtype
= TREE_TYPE (constructor_fields
);
6953 if (subtype
!= error_mark_node
)
6954 subtype
= TYPE_MAIN_VARIANT (subtype
);
6957 subtype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
6963 subcode
= TREE_CODE (subtype
);
6964 if (array
&& subcode
!= ARRAY_TYPE
)
6966 error_init ("array index in non-array initializer");
6969 else if (!array
&& subcode
!= RECORD_TYPE
&& subcode
!= UNION_TYPE
)
6971 error_init ("field name not in record or union initializer");
6975 constructor_designated
= 1;
6976 push_init_level (2, braced_init_obstack
);
6980 /* If there are range designators in designator list, push a new designator
6981 to constructor_range_stack. RANGE_END is end of such stack range or
6982 NULL_TREE if there is no range designator at this level. */
6985 push_range_stack (tree range_end
, struct obstack
* braced_init_obstack
)
6987 struct constructor_range_stack
*p
;
6989 p
= (struct constructor_range_stack
*)
6990 obstack_alloc (braced_init_obstack
,
6991 sizeof (struct constructor_range_stack
));
6992 p
->prev
= constructor_range_stack
;
6994 p
->fields
= constructor_fields
;
6995 p
->range_start
= constructor_index
;
6996 p
->index
= constructor_index
;
6997 p
->stack
= constructor_stack
;
6998 p
->range_end
= range_end
;
6999 if (constructor_range_stack
)
7000 constructor_range_stack
->next
= p
;
7001 constructor_range_stack
= p
;
7004 /* Within an array initializer, specify the next index to be initialized.
7005 FIRST is that index. If LAST is nonzero, then initialize a range
7006 of indices, running from FIRST through LAST. */
7009 set_init_index (tree first
, tree last
,
7010 struct obstack
* braced_init_obstack
)
7012 if (set_designator (1, braced_init_obstack
))
7015 designator_erroneous
= 1;
7017 if (!INTEGRAL_TYPE_P (TREE_TYPE (first
))
7018 || (last
&& !INTEGRAL_TYPE_P (TREE_TYPE (last
))))
7020 error_init ("array index in initializer not of integer type");
7024 if (TREE_CODE (first
) != INTEGER_CST
)
7026 first
= c_fully_fold (first
, false, NULL
);
7027 if (TREE_CODE (first
) == INTEGER_CST
)
7028 pedwarn_init (input_location
, OPT_pedantic
,
7029 "array index in initializer is not "
7030 "an integer constant expression");
7033 if (last
&& TREE_CODE (last
) != INTEGER_CST
)
7035 last
= c_fully_fold (last
, false, NULL
);
7036 if (TREE_CODE (last
) == INTEGER_CST
)
7037 pedwarn_init (input_location
, OPT_pedantic
,
7038 "array index in initializer is not "
7039 "an integer constant expression");
7042 if (TREE_CODE (first
) != INTEGER_CST
)
7043 error_init ("nonconstant array index in initializer");
7044 else if (last
!= 0 && TREE_CODE (last
) != INTEGER_CST
)
7045 error_init ("nonconstant array index in initializer");
7046 else if (TREE_CODE (constructor_type
) != ARRAY_TYPE
)
7047 error_init ("array index in non-array initializer");
7048 else if (tree_int_cst_sgn (first
) == -1)
7049 error_init ("array index in initializer exceeds array bounds");
7050 else if (constructor_max_index
7051 && tree_int_cst_lt (constructor_max_index
, first
))
7052 error_init ("array index in initializer exceeds array bounds");
7055 constant_expression_warning (first
);
7057 constant_expression_warning (last
);
7058 constructor_index
= convert (bitsizetype
, first
);
7062 if (tree_int_cst_equal (first
, last
))
7064 else if (tree_int_cst_lt (last
, first
))
7066 error_init ("empty index range in initializer");
7071 last
= convert (bitsizetype
, last
);
7072 if (constructor_max_index
!= 0
7073 && tree_int_cst_lt (constructor_max_index
, last
))
7075 error_init ("array index range in initializer exceeds array bounds");
7082 designator_erroneous
= 0;
7083 if (constructor_range_stack
|| last
)
7084 push_range_stack (last
, braced_init_obstack
);
7088 /* Within a struct initializer, specify the next field to be initialized. */
7091 set_init_label (tree fieldname
, struct obstack
* braced_init_obstack
)
7095 if (set_designator (0, braced_init_obstack
))
7098 designator_erroneous
= 1;
7100 if (TREE_CODE (constructor_type
) != RECORD_TYPE
7101 && TREE_CODE (constructor_type
) != UNION_TYPE
)
7103 error_init ("field name not in record or union initializer");
7107 field
= lookup_field (constructor_type
, fieldname
);
7110 error ("unknown field %qE specified in initializer", fieldname
);
7114 constructor_fields
= TREE_VALUE (field
);
7116 designator_erroneous
= 0;
7117 if (constructor_range_stack
)
7118 push_range_stack (NULL_TREE
, braced_init_obstack
);
7119 field
= TREE_CHAIN (field
);
7122 if (set_designator (0, braced_init_obstack
))
7126 while (field
!= NULL_TREE
);
7129 /* Add a new initializer to the tree of pending initializers. PURPOSE
7130 identifies the initializer, either array index or field in a structure.
7131 VALUE is the value of that index or field. If ORIGTYPE is not
7132 NULL_TREE, it is the original type of VALUE.
7134 IMPLICIT is true if value comes from pop_init_level (1),
7135 the new initializer has been merged with the existing one
7136 and thus no warnings should be emitted about overriding an
7137 existing initializer. */
7140 add_pending_init (tree purpose
, tree value
, tree origtype
, bool implicit
,
7141 struct obstack
* braced_init_obstack
)
7143 struct init_node
*p
, **q
, *r
;
7145 q
= &constructor_pending_elts
;
7148 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
7153 if (tree_int_cst_lt (purpose
, p
->purpose
))
7155 else if (tree_int_cst_lt (p
->purpose
, purpose
))
7161 if (TREE_SIDE_EFFECTS (p
->value
))
7162 warning_init (0, "initialized field with side-effects overwritten");
7163 else if (warn_override_init
)
7164 warning_init (OPT_Woverride_init
, "initialized field overwritten");
7167 p
->origtype
= origtype
;
7176 bitpos
= bit_position (purpose
);
7180 if (tree_int_cst_lt (bitpos
, bit_position (p
->purpose
)))
7182 else if (p
->purpose
!= purpose
)
7188 if (TREE_SIDE_EFFECTS (p
->value
))
7189 warning_init (0, "initialized field with side-effects overwritten");
7190 else if (warn_override_init
)
7191 warning_init (OPT_Woverride_init
, "initialized field overwritten");
7194 p
->origtype
= origtype
;
7200 r
= (struct init_node
*) obstack_alloc (braced_init_obstack
,
7201 sizeof (struct init_node
));
7202 r
->purpose
= purpose
;
7204 r
->origtype
= origtype
;
7214 struct init_node
*s
;
7218 if (p
->balance
== 0)
7220 else if (p
->balance
< 0)
7227 p
->left
->parent
= p
;
7244 constructor_pending_elts
= r
;
7249 struct init_node
*t
= r
->right
;
7253 r
->right
->parent
= r
;
7258 p
->left
->parent
= p
;
7261 p
->balance
= t
->balance
< 0;
7262 r
->balance
= -(t
->balance
> 0);
7277 constructor_pending_elts
= t
;
7283 /* p->balance == +1; growth of left side balances the node. */
7288 else /* r == p->right */
7290 if (p
->balance
== 0)
7291 /* Growth propagation from right side. */
7293 else if (p
->balance
> 0)
7300 p
->right
->parent
= p
;
7317 constructor_pending_elts
= r
;
7319 else /* r->balance == -1 */
7322 struct init_node
*t
= r
->left
;
7326 r
->left
->parent
= r
;
7331 p
->right
->parent
= p
;
7334 r
->balance
= (t
->balance
< 0);
7335 p
->balance
= -(t
->balance
> 0);
7350 constructor_pending_elts
= t
;
7356 /* p->balance == -1; growth of right side balances the node. */
7367 /* Build AVL tree from a sorted chain. */
7370 set_nonincremental_init (struct obstack
* braced_init_obstack
)
7372 unsigned HOST_WIDE_INT ix
;
7375 if (TREE_CODE (constructor_type
) != RECORD_TYPE
7376 && TREE_CODE (constructor_type
) != ARRAY_TYPE
)
7379 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements
, ix
, index
, value
)
7381 add_pending_init (index
, value
, NULL_TREE
, false,
7382 braced_init_obstack
);
7384 constructor_elements
= 0;
7385 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
7387 constructor_unfilled_fields
= TYPE_FIELDS (constructor_type
);
7388 /* Skip any nameless bit fields at the beginning. */
7389 while (constructor_unfilled_fields
!= 0
7390 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
7391 && DECL_NAME (constructor_unfilled_fields
) == 0)
7392 constructor_unfilled_fields
= TREE_CHAIN (constructor_unfilled_fields
);
7395 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
7397 if (TYPE_DOMAIN (constructor_type
))
7398 constructor_unfilled_index
7399 = convert (bitsizetype
,
7400 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
7402 constructor_unfilled_index
= bitsize_zero_node
;
7404 constructor_incremental
= 0;
7407 /* Build AVL tree from a string constant. */
7410 set_nonincremental_init_from_string (tree str
,
7411 struct obstack
* braced_init_obstack
)
7413 tree value
, purpose
, type
;
7414 HOST_WIDE_INT val
[2];
7415 const char *p
, *end
;
7416 int byte
, wchar_bytes
, charwidth
, bitpos
;
7418 gcc_assert (TREE_CODE (constructor_type
) == ARRAY_TYPE
);
7420 wchar_bytes
= TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str
))) / BITS_PER_UNIT
;
7421 charwidth
= TYPE_PRECISION (char_type_node
);
7422 type
= TREE_TYPE (constructor_type
);
7423 p
= TREE_STRING_POINTER (str
);
7424 end
= p
+ TREE_STRING_LENGTH (str
);
7426 for (purpose
= bitsize_zero_node
;
7427 p
< end
&& !tree_int_cst_lt (constructor_max_index
, purpose
);
7428 purpose
= size_binop (PLUS_EXPR
, purpose
, bitsize_one_node
))
7430 if (wchar_bytes
== 1)
7432 val
[1] = (unsigned char) *p
++;
7439 for (byte
= 0; byte
< wchar_bytes
; byte
++)
7441 if (BYTES_BIG_ENDIAN
)
7442 bitpos
= (wchar_bytes
- byte
- 1) * charwidth
;
7444 bitpos
= byte
* charwidth
;
7445 val
[bitpos
< HOST_BITS_PER_WIDE_INT
]
7446 |= ((unsigned HOST_WIDE_INT
) ((unsigned char) *p
++))
7447 << (bitpos
% HOST_BITS_PER_WIDE_INT
);
7451 if (!TYPE_UNSIGNED (type
))
7453 bitpos
= ((wchar_bytes
- 1) * charwidth
) + HOST_BITS_PER_CHAR
;
7454 if (bitpos
< HOST_BITS_PER_WIDE_INT
)
7456 if (val
[1] & (((HOST_WIDE_INT
) 1) << (bitpos
- 1)))
7458 val
[1] |= ((HOST_WIDE_INT
) -1) << bitpos
;
7462 else if (bitpos
== HOST_BITS_PER_WIDE_INT
)
7467 else if (val
[0] & (((HOST_WIDE_INT
) 1)
7468 << (bitpos
- 1 - HOST_BITS_PER_WIDE_INT
)))
7469 val
[0] |= ((HOST_WIDE_INT
) -1)
7470 << (bitpos
- HOST_BITS_PER_WIDE_INT
);
7473 value
= build_int_cst_wide (type
, val
[1], val
[0]);
7474 add_pending_init (purpose
, value
, NULL_TREE
, false,
7475 braced_init_obstack
);
7478 constructor_incremental
= 0;
7481 /* Return value of FIELD in pending initializer or zero if the field was
7482 not initialized yet. */
7485 find_init_member (tree field
, struct obstack
* braced_init_obstack
)
7487 struct init_node
*p
;
7489 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
7491 if (constructor_incremental
7492 && tree_int_cst_lt (field
, constructor_unfilled_index
))
7493 set_nonincremental_init (braced_init_obstack
);
7495 p
= constructor_pending_elts
;
7498 if (tree_int_cst_lt (field
, p
->purpose
))
7500 else if (tree_int_cst_lt (p
->purpose
, field
))
7506 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
7508 tree bitpos
= bit_position (field
);
7510 if (constructor_incremental
7511 && (!constructor_unfilled_fields
7512 || tree_int_cst_lt (bitpos
,
7513 bit_position (constructor_unfilled_fields
))))
7514 set_nonincremental_init (braced_init_obstack
);
7516 p
= constructor_pending_elts
;
7519 if (field
== p
->purpose
)
7521 else if (tree_int_cst_lt (bitpos
, bit_position (p
->purpose
)))
7527 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
7529 if (!VEC_empty (constructor_elt
, constructor_elements
)
7530 && (VEC_last (constructor_elt
, constructor_elements
)->index
7532 return VEC_last (constructor_elt
, constructor_elements
)->value
;
7537 /* "Output" the next constructor element.
7538 At top level, really output it to assembler code now.
7539 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
7540 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
7541 TYPE is the data type that the containing data type wants here.
7542 FIELD is the field (a FIELD_DECL) or the index that this element fills.
7543 If VALUE is a string constant, STRICT_STRING is true if it is
7544 unparenthesized or we should not warn here for it being parenthesized.
7545 For other types of VALUE, STRICT_STRING is not used.
7547 PENDING if non-nil means output pending elements that belong
7548 right after this element. (PENDING is normally 1;
7549 it is 0 while outputting pending elements, to avoid recursion.)
7551 IMPLICIT is true if value comes from pop_init_level (1),
7552 the new initializer has been merged with the existing one
7553 and thus no warnings should be emitted about overriding an
7554 existing initializer. */
7557 output_init_element (tree value
, tree origtype
, bool strict_string
, tree type
,
7558 tree field
, int pending
, bool implicit
,
7559 struct obstack
* braced_init_obstack
)
7561 tree semantic_type
= NULL_TREE
;
7562 constructor_elt
*celt
;
7563 bool maybe_const
= true;
7566 if (type
== error_mark_node
|| value
== error_mark_node
)
7568 constructor_erroneous
= 1;
7571 if (TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
7572 && (TREE_CODE (value
) == STRING_CST
7573 || TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
)
7574 && !(TREE_CODE (value
) == STRING_CST
7575 && TREE_CODE (type
) == ARRAY_TYPE
7576 && INTEGRAL_TYPE_P (TREE_TYPE (type
)))
7577 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value
)),
7578 TYPE_MAIN_VARIANT (type
)))
7579 value
= array_to_pointer_conversion (input_location
, value
);
7581 if (TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
7582 && require_constant_value
&& !flag_isoc99
&& pending
)
7584 /* As an extension, allow initializing objects with static storage
7585 duration with compound literals (which are then treated just as
7586 the brace enclosed list they contain). */
7587 tree decl
= COMPOUND_LITERAL_EXPR_DECL (value
);
7588 value
= DECL_INITIAL (decl
);
7591 npc
= null_pointer_constant_p (value
);
7592 if (TREE_CODE (value
) == EXCESS_PRECISION_EXPR
)
7594 semantic_type
= TREE_TYPE (value
);
7595 value
= TREE_OPERAND (value
, 0);
7597 value
= c_fully_fold (value
, require_constant_value
, &maybe_const
);
7599 if (value
== error_mark_node
)
7600 constructor_erroneous
= 1;
7601 else if (!TREE_CONSTANT (value
))
7602 constructor_constant
= 0;
7603 else if (!initializer_constant_valid_p (value
, TREE_TYPE (value
))
7604 || ((TREE_CODE (constructor_type
) == RECORD_TYPE
7605 || TREE_CODE (constructor_type
) == UNION_TYPE
)
7606 && DECL_C_BIT_FIELD (field
)
7607 && TREE_CODE (value
) != INTEGER_CST
))
7608 constructor_simple
= 0;
7610 constructor_nonconst
= 1;
7612 if (!initializer_constant_valid_p (value
, TREE_TYPE (value
)))
7614 if (require_constant_value
)
7616 error_init ("initializer element is not constant");
7617 value
= error_mark_node
;
7619 else if (require_constant_elements
)
7620 pedwarn (input_location
, 0,
7621 "initializer element is not computable at load time");
7623 else if (!maybe_const
7624 && (require_constant_value
|| require_constant_elements
))
7625 pedwarn_init (input_location
, 0,
7626 "initializer element is not a constant expression");
7628 /* Issue -Wc++-compat warnings about initializing a bitfield with
7631 && field
!= NULL_TREE
7632 && TREE_CODE (field
) == FIELD_DECL
7633 && DECL_BIT_FIELD_TYPE (field
) != NULL_TREE
7634 && (TYPE_MAIN_VARIANT (DECL_BIT_FIELD_TYPE (field
))
7635 != TYPE_MAIN_VARIANT (type
))
7636 && TREE_CODE (DECL_BIT_FIELD_TYPE (field
)) == ENUMERAL_TYPE
)
7638 tree checktype
= origtype
!= NULL_TREE
? origtype
: TREE_TYPE (value
);
7639 if (checktype
!= error_mark_node
7640 && (TYPE_MAIN_VARIANT (checktype
)
7641 != TYPE_MAIN_VARIANT (DECL_BIT_FIELD_TYPE (field
))))
7642 warning_init (OPT_Wc___compat
,
7643 "enum conversion in initialization is invalid in C++");
7646 /* If this field is empty (and not at the end of structure),
7647 don't do anything other than checking the initializer. */
7649 && (TREE_TYPE (field
) == error_mark_node
7650 || (COMPLETE_TYPE_P (TREE_TYPE (field
))
7651 && integer_zerop (TYPE_SIZE (TREE_TYPE (field
)))
7652 && (TREE_CODE (constructor_type
) == ARRAY_TYPE
7653 || DECL_CHAIN (field
)))))
7657 value
= build1 (EXCESS_PRECISION_EXPR
, semantic_type
, value
);
7658 value
= digest_init (input_location
, type
, value
, origtype
, npc
,
7659 strict_string
, require_constant_value
);
7660 if (value
== error_mark_node
)
7662 constructor_erroneous
= 1;
7665 if (require_constant_value
|| require_constant_elements
)
7666 constant_expression_warning (value
);
7668 /* If this element doesn't come next in sequence,
7669 put it on constructor_pending_elts. */
7670 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
7671 && (!constructor_incremental
7672 || !tree_int_cst_equal (field
, constructor_unfilled_index
)))
7674 if (constructor_incremental
7675 && tree_int_cst_lt (field
, constructor_unfilled_index
))
7676 set_nonincremental_init (braced_init_obstack
);
7678 add_pending_init (field
, value
, origtype
, implicit
,
7679 braced_init_obstack
);
7682 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
7683 && (!constructor_incremental
7684 || field
!= constructor_unfilled_fields
))
7686 /* We do this for records but not for unions. In a union,
7687 no matter which field is specified, it can be initialized
7688 right away since it starts at the beginning of the union. */
7689 if (constructor_incremental
)
7691 if (!constructor_unfilled_fields
)
7692 set_nonincremental_init (braced_init_obstack
);
7695 tree bitpos
, unfillpos
;
7697 bitpos
= bit_position (field
);
7698 unfillpos
= bit_position (constructor_unfilled_fields
);
7700 if (tree_int_cst_lt (bitpos
, unfillpos
))
7701 set_nonincremental_init (braced_init_obstack
);
7705 add_pending_init (field
, value
, origtype
, implicit
,
7706 braced_init_obstack
);
7709 else if (TREE_CODE (constructor_type
) == UNION_TYPE
7710 && !VEC_empty (constructor_elt
, constructor_elements
))
7714 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt
,
7715 constructor_elements
)->value
))
7717 "initialized field with side-effects overwritten");
7718 else if (warn_override_init
)
7719 warning_init (OPT_Woverride_init
, "initialized field overwritten");
7722 /* We can have just one union field set. */
7723 constructor_elements
= 0;
7726 /* Otherwise, output this element either to
7727 constructor_elements or to the assembler file. */
7729 celt
= VEC_safe_push (constructor_elt
, gc
, constructor_elements
, NULL
);
7730 celt
->index
= field
;
7731 celt
->value
= value
;
7733 /* Advance the variable that indicates sequential elements output. */
7734 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
7735 constructor_unfilled_index
7736 = size_binop_loc (input_location
, PLUS_EXPR
, constructor_unfilled_index
,
7738 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
7740 constructor_unfilled_fields
7741 = DECL_CHAIN (constructor_unfilled_fields
);
7743 /* Skip any nameless bit fields. */
7744 while (constructor_unfilled_fields
!= 0
7745 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
7746 && DECL_NAME (constructor_unfilled_fields
) == 0)
7747 constructor_unfilled_fields
=
7748 DECL_CHAIN (constructor_unfilled_fields
);
7750 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
7751 constructor_unfilled_fields
= 0;
7753 /* Now output any pending elements which have become next. */
7755 output_pending_init_elements (0, braced_init_obstack
);
7758 /* Output any pending elements which have become next.
7759 As we output elements, constructor_unfilled_{fields,index}
7760 advances, which may cause other elements to become next;
7761 if so, they too are output.
7763 If ALL is 0, we return when there are
7764 no more pending elements to output now.
7766 If ALL is 1, we output space as necessary so that
7767 we can output all the pending elements. */
7769 output_pending_init_elements (int all
, struct obstack
* braced_init_obstack
)
7771 struct init_node
*elt
= constructor_pending_elts
;
7776 /* Look through the whole pending tree.
7777 If we find an element that should be output now,
7778 output it. Otherwise, set NEXT to the element
7779 that comes first among those still pending. */
7784 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
7786 if (tree_int_cst_equal (elt
->purpose
,
7787 constructor_unfilled_index
))
7788 output_init_element (elt
->value
, elt
->origtype
, true,
7789 TREE_TYPE (constructor_type
),
7790 constructor_unfilled_index
, 0, false,
7791 braced_init_obstack
);
7792 else if (tree_int_cst_lt (constructor_unfilled_index
,
7795 /* Advance to the next smaller node. */
7800 /* We have reached the smallest node bigger than the
7801 current unfilled index. Fill the space first. */
7802 next
= elt
->purpose
;
7808 /* Advance to the next bigger node. */
7813 /* We have reached the biggest node in a subtree. Find
7814 the parent of it, which is the next bigger node. */
7815 while (elt
->parent
&& elt
->parent
->right
== elt
)
7818 if (elt
&& tree_int_cst_lt (constructor_unfilled_index
,
7821 next
= elt
->purpose
;
7827 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
7828 || TREE_CODE (constructor_type
) == UNION_TYPE
)
7830 tree ctor_unfilled_bitpos
, elt_bitpos
;
7832 /* If the current record is complete we are done. */
7833 if (constructor_unfilled_fields
== 0)
7836 ctor_unfilled_bitpos
= bit_position (constructor_unfilled_fields
);
7837 elt_bitpos
= bit_position (elt
->purpose
);
7838 /* We can't compare fields here because there might be empty
7839 fields in between. */
7840 if (tree_int_cst_equal (elt_bitpos
, ctor_unfilled_bitpos
))
7842 constructor_unfilled_fields
= elt
->purpose
;
7843 output_init_element (elt
->value
, elt
->origtype
, true,
7844 TREE_TYPE (elt
->purpose
),
7845 elt
->purpose
, 0, false,
7846 braced_init_obstack
);
7848 else if (tree_int_cst_lt (ctor_unfilled_bitpos
, elt_bitpos
))
7850 /* Advance to the next smaller node. */
7855 /* We have reached the smallest node bigger than the
7856 current unfilled field. Fill the space first. */
7857 next
= elt
->purpose
;
7863 /* Advance to the next bigger node. */
7868 /* We have reached the biggest node in a subtree. Find
7869 the parent of it, which is the next bigger node. */
7870 while (elt
->parent
&& elt
->parent
->right
== elt
)
7874 && (tree_int_cst_lt (ctor_unfilled_bitpos
,
7875 bit_position (elt
->purpose
))))
7877 next
= elt
->purpose
;
7885 /* Ordinarily return, but not if we want to output all
7886 and there are elements left. */
7887 if (!(all
&& next
!= 0))
7890 /* If it's not incremental, just skip over the gap, so that after
7891 jumping to retry we will output the next successive element. */
7892 if (TREE_CODE (constructor_type
) == RECORD_TYPE
7893 || TREE_CODE (constructor_type
) == UNION_TYPE
)
7894 constructor_unfilled_fields
= next
;
7895 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
7896 constructor_unfilled_index
= next
;
7898 /* ELT now points to the node in the pending tree with the next
7899 initializer to output. */
7903 /* Add one non-braced element to the current constructor level.
7904 This adjusts the current position within the constructor's type.
7905 This may also start or terminate implicit levels
7906 to handle a partly-braced initializer.
7908 Once this has found the correct level for the new element,
7909 it calls output_init_element.
7911 IMPLICIT is true if value comes from pop_init_level (1),
7912 the new initializer has been merged with the existing one
7913 and thus no warnings should be emitted about overriding an
7914 existing initializer. */
7917 process_init_element (struct c_expr value
, bool implicit
,
7918 struct obstack
* braced_init_obstack
)
7920 tree orig_value
= value
.value
;
7921 int string_flag
= orig_value
!= 0 && TREE_CODE (orig_value
) == STRING_CST
;
7922 bool strict_string
= value
.original_code
== STRING_CST
;
7924 designator_depth
= 0;
7925 designator_erroneous
= 0;
7927 /* Handle superfluous braces around string cst as in
7928 char x[] = {"foo"}; */
7931 && TREE_CODE (constructor_type
) == ARRAY_TYPE
7932 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type
))
7933 && integer_zerop (constructor_unfilled_index
))
7935 if (constructor_stack
->replacement_value
.value
)
7936 error_init ("excess elements in char array initializer");
7937 constructor_stack
->replacement_value
= value
;
7941 if (constructor_stack
->replacement_value
.value
!= 0)
7943 error_init ("excess elements in struct initializer");
7947 /* Ignore elements of a brace group if it is entirely superfluous
7948 and has already been diagnosed. */
7949 if (constructor_type
== 0)
7952 /* If we've exhausted any levels that didn't have braces,
7954 while (constructor_stack
->implicit
)
7956 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
7957 || TREE_CODE (constructor_type
) == UNION_TYPE
)
7958 && constructor_fields
== 0)
7959 process_init_element (pop_init_level (1, braced_init_obstack
),
7960 true, braced_init_obstack
);
7961 else if ((TREE_CODE (constructor_type
) == ARRAY_TYPE
7962 || TREE_CODE (constructor_type
) == VECTOR_TYPE
)
7963 && (constructor_max_index
== 0
7964 || tree_int_cst_lt (constructor_max_index
,
7965 constructor_index
)))
7966 process_init_element (pop_init_level (1, braced_init_obstack
),
7967 true, braced_init_obstack
);
7972 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
7973 if (constructor_range_stack
)
7975 /* If value is a compound literal and we'll be just using its
7976 content, don't put it into a SAVE_EXPR. */
7977 if (TREE_CODE (value
.value
) != COMPOUND_LITERAL_EXPR
7978 || !require_constant_value
7981 tree semantic_type
= NULL_TREE
;
7982 if (TREE_CODE (value
.value
) == EXCESS_PRECISION_EXPR
)
7984 semantic_type
= TREE_TYPE (value
.value
);
7985 value
.value
= TREE_OPERAND (value
.value
, 0);
7987 value
.value
= c_save_expr (value
.value
);
7989 value
.value
= build1 (EXCESS_PRECISION_EXPR
, semantic_type
,
7996 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
7999 enum tree_code fieldcode
;
8001 if (constructor_fields
== 0)
8003 pedwarn_init (input_location
, 0,
8004 "excess elements in struct initializer");
8008 fieldtype
= TREE_TYPE (constructor_fields
);
8009 if (fieldtype
!= error_mark_node
)
8010 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
8011 fieldcode
= TREE_CODE (fieldtype
);
8013 /* Error for non-static initialization of a flexible array member. */
8014 if (fieldcode
== ARRAY_TYPE
8015 && !require_constant_value
8016 && TYPE_SIZE (fieldtype
) == NULL_TREE
8017 && DECL_CHAIN (constructor_fields
) == NULL_TREE
)
8019 error_init ("non-static initialization of a flexible array member");
8023 /* Accept a string constant to initialize a subarray. */
8024 if (value
.value
!= 0
8025 && fieldcode
== ARRAY_TYPE
8026 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype
))
8028 value
.value
= orig_value
;
8029 /* Otherwise, if we have come to a subaggregate,
8030 and we don't have an element of its type, push into it. */
8031 else if (value
.value
!= 0
8032 && value
.value
!= error_mark_node
8033 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != fieldtype
8034 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
8035 || fieldcode
== UNION_TYPE
|| fieldcode
== VECTOR_TYPE
))
8037 push_init_level (1, braced_init_obstack
);
8043 push_member_name (constructor_fields
);
8044 output_init_element (value
.value
, value
.original_type
,
8045 strict_string
, fieldtype
,
8046 constructor_fields
, 1, implicit
,
8047 braced_init_obstack
);
8048 RESTORE_SPELLING_DEPTH (constructor_depth
);
8051 /* Do the bookkeeping for an element that was
8052 directly output as a constructor. */
8054 /* For a record, keep track of end position of last field. */
8055 if (DECL_SIZE (constructor_fields
))
8056 constructor_bit_index
8057 = size_binop_loc (input_location
, PLUS_EXPR
,
8058 bit_position (constructor_fields
),
8059 DECL_SIZE (constructor_fields
));
8061 /* If the current field was the first one not yet written out,
8062 it isn't now, so update. */
8063 if (constructor_unfilled_fields
== constructor_fields
)
8065 constructor_unfilled_fields
= DECL_CHAIN (constructor_fields
);
8066 /* Skip any nameless bit fields. */
8067 while (constructor_unfilled_fields
!= 0
8068 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
8069 && DECL_NAME (constructor_unfilled_fields
) == 0)
8070 constructor_unfilled_fields
=
8071 DECL_CHAIN (constructor_unfilled_fields
);
8075 constructor_fields
= DECL_CHAIN (constructor_fields
);
8076 /* Skip any nameless bit fields at the beginning. */
8077 while (constructor_fields
!= 0
8078 && DECL_C_BIT_FIELD (constructor_fields
)
8079 && DECL_NAME (constructor_fields
) == 0)
8080 constructor_fields
= DECL_CHAIN (constructor_fields
);
8082 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
8085 enum tree_code fieldcode
;
8087 if (constructor_fields
== 0)
8089 pedwarn_init (input_location
, 0,
8090 "excess elements in union initializer");
8094 fieldtype
= TREE_TYPE (constructor_fields
);
8095 if (fieldtype
!= error_mark_node
)
8096 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
8097 fieldcode
= TREE_CODE (fieldtype
);
8099 /* Warn that traditional C rejects initialization of unions.
8100 We skip the warning if the value is zero. This is done
8101 under the assumption that the zero initializer in user
8102 code appears conditioned on e.g. __STDC__ to avoid
8103 "missing initializer" warnings and relies on default
8104 initialization to zero in the traditional C case.
8105 We also skip the warning if the initializer is designated,
8106 again on the assumption that this must be conditional on
8107 __STDC__ anyway (and we've already complained about the
8108 member-designator already). */
8109 if (!in_system_header
&& !constructor_designated
8110 && !(value
.value
&& (integer_zerop (value
.value
)
8111 || real_zerop (value
.value
))))
8112 warning (OPT_Wtraditional
, "traditional C rejects initialization "
8115 /* Accept a string constant to initialize a subarray. */
8116 if (value
.value
!= 0
8117 && fieldcode
== ARRAY_TYPE
8118 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype
))
8120 value
.value
= orig_value
;
8121 /* Otherwise, if we have come to a subaggregate,
8122 and we don't have an element of its type, push into it. */
8123 else if (value
.value
!= 0
8124 && value
.value
!= error_mark_node
8125 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != fieldtype
8126 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
8127 || fieldcode
== UNION_TYPE
|| fieldcode
== VECTOR_TYPE
))
8129 push_init_level (1, braced_init_obstack
);
8135 push_member_name (constructor_fields
);
8136 output_init_element (value
.value
, value
.original_type
,
8137 strict_string
, fieldtype
,
8138 constructor_fields
, 1, implicit
,
8139 braced_init_obstack
);
8140 RESTORE_SPELLING_DEPTH (constructor_depth
);
8143 /* Do the bookkeeping for an element that was
8144 directly output as a constructor. */
8146 constructor_bit_index
= DECL_SIZE (constructor_fields
);
8147 constructor_unfilled_fields
= DECL_CHAIN (constructor_fields
);
8150 constructor_fields
= 0;
8152 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
8154 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
8155 enum tree_code eltcode
= TREE_CODE (elttype
);
8157 /* Accept a string constant to initialize a subarray. */
8158 if (value
.value
!= 0
8159 && eltcode
== ARRAY_TYPE
8160 && INTEGRAL_TYPE_P (TREE_TYPE (elttype
))
8162 value
.value
= orig_value
;
8163 /* Otherwise, if we have come to a subaggregate,
8164 and we don't have an element of its type, push into it. */
8165 else if (value
.value
!= 0
8166 && value
.value
!= error_mark_node
8167 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != elttype
8168 && (eltcode
== RECORD_TYPE
|| eltcode
== ARRAY_TYPE
8169 || eltcode
== UNION_TYPE
|| eltcode
== VECTOR_TYPE
))
8171 push_init_level (1, braced_init_obstack
);
8175 if (constructor_max_index
!= 0
8176 && (tree_int_cst_lt (constructor_max_index
, constructor_index
)
8177 || integer_all_onesp (constructor_max_index
)))
8179 pedwarn_init (input_location
, 0,
8180 "excess elements in array initializer");
8184 /* Now output the actual element. */
8187 push_array_bounds (tree_low_cst (constructor_index
, 1));
8188 output_init_element (value
.value
, value
.original_type
,
8189 strict_string
, elttype
,
8190 constructor_index
, 1, implicit
,
8191 braced_init_obstack
);
8192 RESTORE_SPELLING_DEPTH (constructor_depth
);
8196 = size_binop_loc (input_location
, PLUS_EXPR
,
8197 constructor_index
, bitsize_one_node
);
8200 /* If we are doing the bookkeeping for an element that was
8201 directly output as a constructor, we must update
8202 constructor_unfilled_index. */
8203 constructor_unfilled_index
= constructor_index
;
8205 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
8207 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
8209 /* Do a basic check of initializer size. Note that vectors
8210 always have a fixed size derived from their type. */
8211 if (tree_int_cst_lt (constructor_max_index
, constructor_index
))
8213 pedwarn_init (input_location
, 0,
8214 "excess elements in vector initializer");
8218 /* Now output the actual element. */
8221 if (TREE_CODE (value
.value
) == VECTOR_CST
)
8222 elttype
= TYPE_MAIN_VARIANT (constructor_type
);
8223 output_init_element (value
.value
, value
.original_type
,
8224 strict_string
, elttype
,
8225 constructor_index
, 1, implicit
,
8226 braced_init_obstack
);
8230 = size_binop_loc (input_location
,
8231 PLUS_EXPR
, constructor_index
, bitsize_one_node
);
8234 /* If we are doing the bookkeeping for an element that was
8235 directly output as a constructor, we must update
8236 constructor_unfilled_index. */
8237 constructor_unfilled_index
= constructor_index
;
8240 /* Handle the sole element allowed in a braced initializer
8241 for a scalar variable. */
8242 else if (constructor_type
!= error_mark_node
8243 && constructor_fields
== 0)
8245 pedwarn_init (input_location
, 0,
8246 "excess elements in scalar initializer");
8252 output_init_element (value
.value
, value
.original_type
,
8253 strict_string
, constructor_type
,
8254 NULL_TREE
, 1, implicit
,
8255 braced_init_obstack
);
8256 constructor_fields
= 0;
8259 /* Handle range initializers either at this level or anywhere higher
8260 in the designator stack. */
8261 if (constructor_range_stack
)
8263 struct constructor_range_stack
*p
, *range_stack
;
8266 range_stack
= constructor_range_stack
;
8267 constructor_range_stack
= 0;
8268 while (constructor_stack
!= range_stack
->stack
)
8270 gcc_assert (constructor_stack
->implicit
);
8271 process_init_element (pop_init_level (1,
8272 braced_init_obstack
),
8273 true, braced_init_obstack
);
8275 for (p
= range_stack
;
8276 !p
->range_end
|| tree_int_cst_equal (p
->index
, p
->range_end
);
8279 gcc_assert (constructor_stack
->implicit
);
8280 process_init_element (pop_init_level (1, braced_init_obstack
),
8281 true, braced_init_obstack
);
8284 p
->index
= size_binop_loc (input_location
,
8285 PLUS_EXPR
, p
->index
, bitsize_one_node
);
8286 if (tree_int_cst_equal (p
->index
, p
->range_end
) && !p
->prev
)
8291 constructor_index
= p
->index
;
8292 constructor_fields
= p
->fields
;
8293 if (finish
&& p
->range_end
&& p
->index
== p
->range_start
)
8301 push_init_level (2, braced_init_obstack
);
8302 p
->stack
= constructor_stack
;
8303 if (p
->range_end
&& tree_int_cst_equal (p
->index
, p
->range_end
))
8304 p
->index
= p
->range_start
;
8308 constructor_range_stack
= range_stack
;
8315 constructor_range_stack
= 0;
8318 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
8319 (guaranteed to be 'volatile' or null) and ARGS (represented using
8320 an ASM_EXPR node). */
8322 build_asm_stmt (tree cv_qualifier
, tree args
)
8324 if (!ASM_VOLATILE_P (args
) && cv_qualifier
)
8325 ASM_VOLATILE_P (args
) = 1;
8326 return add_stmt (args
);
8329 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
8330 some INPUTS, and some CLOBBERS. The latter three may be NULL.
8331 SIMPLE indicates whether there was anything at all after the
8332 string in the asm expression -- asm("blah") and asm("blah" : )
8333 are subtly different. We use a ASM_EXPR node to represent this. */
8335 build_asm_expr (location_t loc
, tree string
, tree outputs
, tree inputs
,
8336 tree clobbers
, tree labels
, bool simple
)
8341 const char *constraint
;
8342 const char **oconstraints
;
8343 bool allows_mem
, allows_reg
, is_inout
;
8344 int ninputs
, noutputs
;
8346 ninputs
= list_length (inputs
);
8347 noutputs
= list_length (outputs
);
8348 oconstraints
= (const char **) alloca (noutputs
* sizeof (const char *));
8350 string
= resolve_asm_operand_names (string
, outputs
, inputs
, labels
);
8352 /* Remove output conversions that change the type but not the mode. */
8353 for (i
= 0, tail
= outputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
8355 tree output
= TREE_VALUE (tail
);
8357 /* ??? Really, this should not be here. Users should be using a
8358 proper lvalue, dammit. But there's a long history of using casts
8359 in the output operands. In cases like longlong.h, this becomes a
8360 primitive form of typechecking -- if the cast can be removed, then
8361 the output operand had a type of the proper width; otherwise we'll
8362 get an error. Gross, but ... */
8363 STRIP_NOPS (output
);
8365 if (!lvalue_or_else (output
, lv_asm
))
8366 output
= error_mark_node
;
8368 if (output
!= error_mark_node
8369 && (TREE_READONLY (output
)
8370 || TYPE_READONLY (TREE_TYPE (output
))
8371 || ((TREE_CODE (TREE_TYPE (output
)) == RECORD_TYPE
8372 || TREE_CODE (TREE_TYPE (output
)) == UNION_TYPE
)
8373 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output
)))))
8374 readonly_error (output
, lv_asm
);
8376 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
8377 oconstraints
[i
] = constraint
;
8379 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
8380 &allows_mem
, &allows_reg
, &is_inout
))
8382 /* If the operand is going to end up in memory,
8383 mark it addressable. */
8384 if (!allows_reg
&& !c_mark_addressable (output
))
8385 output
= error_mark_node
;
8388 output
= error_mark_node
;
8390 TREE_VALUE (tail
) = output
;
8393 for (i
= 0, tail
= inputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
8397 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
8398 input
= TREE_VALUE (tail
);
8400 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
8401 oconstraints
, &allows_mem
, &allows_reg
))
8403 /* If the operand is going to end up in memory,
8404 mark it addressable. */
8405 if (!allows_reg
&& allows_mem
)
8407 /* Strip the nops as we allow this case. FIXME, this really
8408 should be rejected or made deprecated. */
8410 if (!c_mark_addressable (input
))
8411 input
= error_mark_node
;
8415 input
= error_mark_node
;
8417 TREE_VALUE (tail
) = input
;
8420 /* ASMs with labels cannot have outputs. This should have been
8421 enforced by the parser. */
8422 gcc_assert (outputs
== NULL
|| labels
== NULL
);
8424 args
= build_stmt (loc
, ASM_EXPR
, string
, outputs
, inputs
, clobbers
, labels
);
8426 /* asm statements without outputs, including simple ones, are treated
8428 ASM_INPUT_P (args
) = simple
;
8429 ASM_VOLATILE_P (args
) = (noutputs
== 0);
8434 /* Generate a goto statement to LABEL. LOC is the location of the
8438 c_finish_goto_label (location_t loc
, tree label
)
8440 tree decl
= lookup_label_for_goto (loc
, label
);
8443 TREE_USED (decl
) = 1;
8445 tree t
= build1 (GOTO_EXPR
, void_type_node
, decl
);
8446 SET_EXPR_LOCATION (t
, loc
);
8447 return add_stmt (t
);
8451 /* Generate a computed goto statement to EXPR. LOC is the location of
8455 c_finish_goto_ptr (location_t loc
, tree expr
)
8458 pedwarn (loc
, OPT_pedantic
, "ISO C forbids %<goto *expr;%>");
8459 expr
= c_fully_fold (expr
, false, NULL
);
8460 expr
= convert (ptr_type_node
, expr
);
8461 t
= build1 (GOTO_EXPR
, void_type_node
, expr
);
8462 SET_EXPR_LOCATION (t
, loc
);
8463 return add_stmt (t
);
8466 /* Generate a C `return' statement. RETVAL is the expression for what
8467 to return, or a null pointer for `return;' with no value. LOC is
8468 the location of the return statement. If ORIGTYPE is not NULL_TREE, it
8469 is the original type of RETVAL. */
8472 c_finish_return (location_t loc
, tree retval
, tree origtype
)
8474 tree valtype
= TREE_TYPE (TREE_TYPE (current_function_decl
)), ret_stmt
;
8475 bool no_warning
= false;
8478 if (TREE_THIS_VOLATILE (current_function_decl
))
8480 "function declared %<noreturn%> has a %<return%> statement");
8484 tree semantic_type
= NULL_TREE
;
8485 npc
= null_pointer_constant_p (retval
);
8486 if (TREE_CODE (retval
) == EXCESS_PRECISION_EXPR
)
8488 semantic_type
= TREE_TYPE (retval
);
8489 retval
= TREE_OPERAND (retval
, 0);
8491 retval
= c_fully_fold (retval
, false, NULL
);
8493 retval
= build1 (EXCESS_PRECISION_EXPR
, semantic_type
, retval
);
8498 current_function_returns_null
= 1;
8499 if ((warn_return_type
|| flag_isoc99
)
8500 && valtype
!= 0 && TREE_CODE (valtype
) != VOID_TYPE
)
8502 pedwarn_c99 (loc
, flag_isoc99
? 0 : OPT_Wreturn_type
,
8503 "%<return%> with no value, in "
8504 "function returning non-void");
8508 else if (valtype
== 0 || TREE_CODE (valtype
) == VOID_TYPE
)
8510 current_function_returns_null
= 1;
8511 if (TREE_CODE (TREE_TYPE (retval
)) != VOID_TYPE
)
8513 "%<return%> with a value, in function returning void");
8515 pedwarn (loc
, OPT_pedantic
, "ISO C forbids "
8516 "%<return%> with expression, in function returning void");
8520 tree t
= convert_for_assignment (loc
, valtype
, retval
, origtype
,
8522 npc
, NULL_TREE
, NULL_TREE
, 0);
8523 tree res
= DECL_RESULT (current_function_decl
);
8526 current_function_returns_value
= 1;
8527 if (t
== error_mark_node
)
8530 inner
= t
= convert (TREE_TYPE (res
), t
);
8532 /* Strip any conversions, additions, and subtractions, and see if
8533 we are returning the address of a local variable. Warn if so. */
8536 switch (TREE_CODE (inner
))
8539 case NON_LVALUE_EXPR
:
8541 case POINTER_PLUS_EXPR
:
8542 inner
= TREE_OPERAND (inner
, 0);
8546 /* If the second operand of the MINUS_EXPR has a pointer
8547 type (or is converted from it), this may be valid, so
8548 don't give a warning. */
8550 tree op1
= TREE_OPERAND (inner
, 1);
8552 while (!POINTER_TYPE_P (TREE_TYPE (op1
))
8553 && (CONVERT_EXPR_P (op1
)
8554 || TREE_CODE (op1
) == NON_LVALUE_EXPR
))
8555 op1
= TREE_OPERAND (op1
, 0);
8557 if (POINTER_TYPE_P (TREE_TYPE (op1
)))
8560 inner
= TREE_OPERAND (inner
, 0);
8565 inner
= TREE_OPERAND (inner
, 0);
8567 while (REFERENCE_CLASS_P (inner
)
8568 && TREE_CODE (inner
) != INDIRECT_REF
)
8569 inner
= TREE_OPERAND (inner
, 0);
8572 && !DECL_EXTERNAL (inner
)
8573 && !TREE_STATIC (inner
)
8574 && DECL_CONTEXT (inner
) == current_function_decl
)
8576 0, "function returns address of local variable");
8586 retval
= build2 (MODIFY_EXPR
, TREE_TYPE (res
), res
, t
);
8587 SET_EXPR_LOCATION (retval
, loc
);
8589 if (warn_sequence_point
)
8590 verify_sequence_points (retval
);
8593 ret_stmt
= build_stmt (loc
, RETURN_EXPR
, retval
);
8594 TREE_NO_WARNING (ret_stmt
) |= no_warning
;
8595 return add_stmt (ret_stmt
);
8599 /* The SWITCH_EXPR being built. */
8602 /* The original type of the testing expression, i.e. before the
8603 default conversion is applied. */
8606 /* A splay-tree mapping the low element of a case range to the high
8607 element, or NULL_TREE if there is no high element. Used to
8608 determine whether or not a new case label duplicates an old case
8609 label. We need a tree, rather than simply a hash table, because
8610 of the GNU case range extension. */
8613 /* The bindings at the point of the switch. This is used for
8614 warnings crossing decls when branching to a case label. */
8615 struct c_spot_bindings
*bindings
;
8617 /* The next node on the stack. */
8618 struct c_switch
*next
;
8621 /* A stack of the currently active switch statements. The innermost
8622 switch statement is on the top of the stack. There is no need to
8623 mark the stack for garbage collection because it is only active
8624 during the processing of the body of a function, and we never
8625 collect at that point. */
8627 struct c_switch
*c_switch_stack
;
8629 /* Start a C switch statement, testing expression EXP. Return the new
8630 SWITCH_EXPR. SWITCH_LOC is the location of the `switch'.
8631 SWITCH_COND_LOC is the location of the switch's condition. */
8634 c_start_case (location_t switch_loc
,
8635 location_t switch_cond_loc
,
8638 tree orig_type
= error_mark_node
;
8639 struct c_switch
*cs
;
8641 if (exp
!= error_mark_node
)
8643 orig_type
= TREE_TYPE (exp
);
8645 if (!INTEGRAL_TYPE_P (orig_type
))
8647 if (orig_type
!= error_mark_node
)
8649 error_at (switch_cond_loc
, "switch quantity not an integer");
8650 orig_type
= error_mark_node
;
8652 exp
= integer_zero_node
;
8656 tree type
= TYPE_MAIN_VARIANT (orig_type
);
8658 if (!in_system_header
8659 && (type
== long_integer_type_node
8660 || type
== long_unsigned_type_node
))
8661 warning_at (switch_cond_loc
,
8662 OPT_Wtraditional
, "%<long%> switch expression not "
8663 "converted to %<int%> in ISO C");
8665 exp
= c_fully_fold (exp
, false, NULL
);
8666 exp
= default_conversion (exp
);
8668 if (warn_sequence_point
)
8669 verify_sequence_points (exp
);
8673 /* Add this new SWITCH_EXPR to the stack. */
8674 cs
= XNEW (struct c_switch
);
8675 cs
->switch_expr
= build3 (SWITCH_EXPR
, orig_type
, exp
, NULL_TREE
, NULL_TREE
);
8676 SET_EXPR_LOCATION (cs
->switch_expr
, switch_loc
);
8677 cs
->orig_type
= orig_type
;
8678 cs
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
8679 cs
->bindings
= c_get_switch_bindings ();
8680 cs
->next
= c_switch_stack
;
8681 c_switch_stack
= cs
;
8683 return add_stmt (cs
->switch_expr
);
8686 /* Process a case label at location LOC. */
8689 do_case (location_t loc
, tree low_value
, tree high_value
)
8691 tree label
= NULL_TREE
;
8693 if (low_value
&& TREE_CODE (low_value
) != INTEGER_CST
)
8695 low_value
= c_fully_fold (low_value
, false, NULL
);
8696 if (TREE_CODE (low_value
) == INTEGER_CST
)
8697 pedwarn (input_location
, OPT_pedantic
,
8698 "case label is not an integer constant expression");
8701 if (high_value
&& TREE_CODE (high_value
) != INTEGER_CST
)
8703 high_value
= c_fully_fold (high_value
, false, NULL
);
8704 if (TREE_CODE (high_value
) == INTEGER_CST
)
8705 pedwarn (input_location
, OPT_pedantic
,
8706 "case label is not an integer constant expression");
8709 if (c_switch_stack
== NULL
)
8712 error_at (loc
, "case label not within a switch statement");
8714 error_at (loc
, "%<default%> label not within a switch statement");
8718 if (c_check_switch_jump_warnings (c_switch_stack
->bindings
,
8719 EXPR_LOCATION (c_switch_stack
->switch_expr
),
8723 label
= c_add_case_label (loc
, c_switch_stack
->cases
,
8724 SWITCH_COND (c_switch_stack
->switch_expr
),
8725 c_switch_stack
->orig_type
,
8726 low_value
, high_value
);
8727 if (label
== error_mark_node
)
8732 /* Finish the switch statement. */
8735 c_finish_case (tree body
)
8737 struct c_switch
*cs
= c_switch_stack
;
8738 location_t switch_location
;
8740 SWITCH_BODY (cs
->switch_expr
) = body
;
8742 /* Emit warnings as needed. */
8743 switch_location
= EXPR_LOCATION (cs
->switch_expr
);
8744 c_do_switch_warnings (cs
->cases
, switch_location
,
8745 TREE_TYPE (cs
->switch_expr
),
8746 SWITCH_COND (cs
->switch_expr
));
8748 /* Pop the stack. */
8749 c_switch_stack
= cs
->next
;
8750 splay_tree_delete (cs
->cases
);
8751 c_release_switch_bindings (cs
->bindings
);
8755 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
8756 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
8757 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
8758 statement, and was not surrounded with parenthesis. */
8761 c_finish_if_stmt (location_t if_locus
, tree cond
, tree then_block
,
8762 tree else_block
, bool nested_if
)
8766 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
8767 if (warn_parentheses
&& nested_if
&& else_block
== NULL
)
8769 tree inner_if
= then_block
;
8771 /* We know from the grammar productions that there is an IF nested
8772 within THEN_BLOCK. Due to labels and c99 conditional declarations,
8773 it might not be exactly THEN_BLOCK, but should be the last
8774 non-container statement within. */
8776 switch (TREE_CODE (inner_if
))
8781 inner_if
= BIND_EXPR_BODY (inner_if
);
8783 case STATEMENT_LIST
:
8784 inner_if
= expr_last (then_block
);
8786 case TRY_FINALLY_EXPR
:
8787 case TRY_CATCH_EXPR
:
8788 inner_if
= TREE_OPERAND (inner_if
, 0);
8795 if (COND_EXPR_ELSE (inner_if
))
8796 warning_at (if_locus
, OPT_Wparentheses
,
8797 "suggest explicit braces to avoid ambiguous %<else%>");
8800 stmt
= build3 (COND_EXPR
, void_type_node
, cond
, then_block
, else_block
);
8801 SET_EXPR_LOCATION (stmt
, if_locus
);
8805 /* Emit a general-purpose loop construct. START_LOCUS is the location of
8806 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
8807 is false for DO loops. INCR is the FOR increment expression. BODY is
8808 the statement controlled by the loop. BLAB is the break label. CLAB is
8809 the continue label. Everything is allowed to be NULL. */
8812 c_finish_loop (location_t start_locus
, tree cond
, tree incr
, tree body
,
8813 tree blab
, tree clab
, bool cond_is_first
)
8815 tree entry
= NULL
, exit
= NULL
, t
;
8817 /* If the condition is zero don't generate a loop construct. */
8818 if (cond
&& integer_zerop (cond
))
8822 t
= build_and_jump (&blab
);
8823 SET_EXPR_LOCATION (t
, start_locus
);
8829 tree top
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
8831 /* If we have an exit condition, then we build an IF with gotos either
8832 out of the loop, or to the top of it. If there's no exit condition,
8833 then we just build a jump back to the top. */
8834 exit
= build_and_jump (&LABEL_EXPR_LABEL (top
));
8836 if (cond
&& !integer_nonzerop (cond
))
8838 /* Canonicalize the loop condition to the end. This means
8839 generating a branch to the loop condition. Reuse the
8840 continue label, if possible. */
8845 entry
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
8846 t
= build_and_jump (&LABEL_EXPR_LABEL (entry
));
8849 t
= build1 (GOTO_EXPR
, void_type_node
, clab
);
8850 SET_EXPR_LOCATION (t
, start_locus
);
8854 t
= build_and_jump (&blab
);
8856 exit
= fold_build3_loc (start_locus
,
8857 COND_EXPR
, void_type_node
, cond
, exit
, t
);
8859 exit
= fold_build3_loc (input_location
,
8860 COND_EXPR
, void_type_node
, cond
, exit
, t
);
8869 add_stmt (build1 (LABEL_EXPR
, void_type_node
, clab
));
8877 add_stmt (build1 (LABEL_EXPR
, void_type_node
, blab
));
8881 c_finish_bc_stmt (location_t loc
, tree
*label_p
, bool is_break
)
8884 tree label
= *label_p
;
8886 /* In switch statements break is sometimes stylistically used after
8887 a return statement. This can lead to spurious warnings about
8888 control reaching the end of a non-void function when it is
8889 inlined. Note that we are calling block_may_fallthru with
8890 language specific tree nodes; this works because
8891 block_may_fallthru returns true when given something it does not
8893 skip
= !block_may_fallthru (cur_stmt_list
);
8898 *label_p
= label
= create_artificial_label (loc
);
8900 else if (TREE_CODE (label
) == LABEL_DECL
)
8902 else switch (TREE_INT_CST_LOW (label
))
8906 error_at (loc
, "break statement not within loop or switch");
8908 error_at (loc
, "continue statement not within a loop");
8912 gcc_assert (is_break
);
8913 error_at (loc
, "break statement used with OpenMP for loop");
8924 add_stmt (build_predict_expr (PRED_CONTINUE
, NOT_TAKEN
));
8926 return add_stmt (build1 (GOTO_EXPR
, void_type_node
, label
));
8929 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
8932 emit_side_effect_warnings (location_t loc
, tree expr
)
8934 if (expr
== error_mark_node
)
8936 else if (!TREE_SIDE_EFFECTS (expr
))
8938 if (!VOID_TYPE_P (TREE_TYPE (expr
)) && !TREE_NO_WARNING (expr
))
8939 warning_at (loc
, OPT_Wunused_value
, "statement with no effect");
8942 warn_if_unused_value (expr
, loc
);
8945 /* Process an expression as if it were a complete statement. Emit
8946 diagnostics, but do not call ADD_STMT. LOC is the location of the
8950 c_process_expr_stmt (location_t loc
, tree expr
)
8957 expr
= c_fully_fold (expr
, false, NULL
);
8959 if (warn_sequence_point
)
8960 verify_sequence_points (expr
);
8962 if (TREE_TYPE (expr
) != error_mark_node
8963 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr
))
8964 && TREE_CODE (TREE_TYPE (expr
)) != ARRAY_TYPE
)
8965 error_at (loc
, "expression statement has incomplete type");
8967 /* If we're not processing a statement expression, warn about unused values.
8968 Warnings for statement expressions will be emitted later, once we figure
8969 out which is the result. */
8970 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list
)
8971 && warn_unused_value
)
8972 emit_side_effect_warnings (loc
, expr
);
8975 while (TREE_CODE (exprv
) == COMPOUND_EXPR
)
8976 exprv
= TREE_OPERAND (exprv
, 1);
8977 if (DECL_P (exprv
) || handled_component_p (exprv
))
8978 mark_exp_read (exprv
);
8980 /* If the expression is not of a type to which we cannot assign a line
8981 number, wrap the thing in a no-op NOP_EXPR. */
8982 if (DECL_P (expr
) || CONSTANT_CLASS_P (expr
))
8984 expr
= build1 (NOP_EXPR
, TREE_TYPE (expr
), expr
);
8985 SET_EXPR_LOCATION (expr
, loc
);
8991 /* Emit an expression as a statement. LOC is the location of the
8995 c_finish_expr_stmt (location_t loc
, tree expr
)
8998 return add_stmt (c_process_expr_stmt (loc
, expr
));
9003 /* Do the opposite and emit a statement as an expression. To begin,
9004 create a new binding level and return it. */
9007 c_begin_stmt_expr (void)
9011 /* We must force a BLOCK for this level so that, if it is not expanded
9012 later, there is a way to turn off the entire subtree of blocks that
9013 are contained in it. */
9015 ret
= c_begin_compound_stmt (true);
9017 c_bindings_start_stmt_expr (c_switch_stack
== NULL
9019 : c_switch_stack
->bindings
);
9021 /* Mark the current statement list as belonging to a statement list. */
9022 STATEMENT_LIST_STMT_EXPR (ret
) = 1;
9027 /* LOC is the location of the compound statement to which this body
9031 c_finish_stmt_expr (location_t loc
, tree body
)
9033 tree last
, type
, tmp
, val
;
9036 body
= c_end_compound_stmt (loc
, body
, true);
9038 c_bindings_end_stmt_expr (c_switch_stack
== NULL
9040 : c_switch_stack
->bindings
);
9042 /* Locate the last statement in BODY. See c_end_compound_stmt
9043 about always returning a BIND_EXPR. */
9044 last_p
= &BIND_EXPR_BODY (body
);
9045 last
= BIND_EXPR_BODY (body
);
9048 if (TREE_CODE (last
) == STATEMENT_LIST
)
9050 tree_stmt_iterator i
;
9052 /* This can happen with degenerate cases like ({ }). No value. */
9053 if (!TREE_SIDE_EFFECTS (last
))
9056 /* If we're supposed to generate side effects warnings, process
9057 all of the statements except the last. */
9058 if (warn_unused_value
)
9060 for (i
= tsi_start (last
); !tsi_one_before_end_p (i
); tsi_next (&i
))
9063 tree t
= tsi_stmt (i
);
9065 tloc
= EXPR_HAS_LOCATION (t
) ? EXPR_LOCATION (t
) : loc
;
9066 emit_side_effect_warnings (tloc
, t
);
9070 i
= tsi_last (last
);
9071 last_p
= tsi_stmt_ptr (i
);
9075 /* If the end of the list is exception related, then the list was split
9076 by a call to push_cleanup. Continue searching. */
9077 if (TREE_CODE (last
) == TRY_FINALLY_EXPR
9078 || TREE_CODE (last
) == TRY_CATCH_EXPR
)
9080 last_p
= &TREE_OPERAND (last
, 0);
9082 goto continue_searching
;
9085 if (last
== error_mark_node
)
9088 /* In the case that the BIND_EXPR is not necessary, return the
9089 expression out from inside it. */
9090 if (last
== BIND_EXPR_BODY (body
)
9091 && BIND_EXPR_VARS (body
) == NULL
)
9093 /* Even if this looks constant, do not allow it in a constant
9095 last
= c_wrap_maybe_const (last
, true);
9096 /* Do not warn if the return value of a statement expression is
9098 TREE_NO_WARNING (last
) = 1;
9102 /* Extract the type of said expression. */
9103 type
= TREE_TYPE (last
);
9105 /* If we're not returning a value at all, then the BIND_EXPR that
9106 we already have is a fine expression to return. */
9107 if (!type
|| VOID_TYPE_P (type
))
9110 /* Now that we've located the expression containing the value, it seems
9111 silly to make voidify_wrapper_expr repeat the process. Create a
9112 temporary of the appropriate type and stick it in a TARGET_EXPR. */
9113 tmp
= create_tmp_var_raw (type
, NULL
);
9115 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
9116 tree_expr_nonnegative_p giving up immediately. */
9118 if (TREE_CODE (val
) == NOP_EXPR
9119 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0)))
9120 val
= TREE_OPERAND (val
, 0);
9122 *last_p
= build2 (MODIFY_EXPR
, void_type_node
, tmp
, val
);
9123 SET_EXPR_LOCATION (*last_p
, EXPR_LOCATION (last
));
9126 tree t
= build4 (TARGET_EXPR
, type
, tmp
, body
, NULL_TREE
, NULL_TREE
);
9127 SET_EXPR_LOCATION (t
, loc
);
9132 /* Begin and end compound statements. This is as simple as pushing
9133 and popping new statement lists from the tree. */
9136 c_begin_compound_stmt (bool do_scope
)
9138 tree stmt
= push_stmt_list ();
9144 /* End a compound statement. STMT is the statement. LOC is the
9145 location of the compound statement-- this is usually the location
9146 of the opening brace. */
9149 c_end_compound_stmt (location_t loc
, tree stmt
, bool do_scope
)
9155 if (c_dialect_objc ())
9156 objc_clear_super_receiver ();
9157 block
= pop_scope ();
9160 stmt
= pop_stmt_list (stmt
);
9161 stmt
= c_build_bind_expr (loc
, block
, stmt
);
9163 /* If this compound statement is nested immediately inside a statement
9164 expression, then force a BIND_EXPR to be created. Otherwise we'll
9165 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
9166 STATEMENT_LISTs merge, and thus we can lose track of what statement
9169 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list
)
9170 && TREE_CODE (stmt
) != BIND_EXPR
)
9172 stmt
= build3 (BIND_EXPR
, void_type_node
, NULL
, stmt
, NULL
);
9173 TREE_SIDE_EFFECTS (stmt
) = 1;
9174 SET_EXPR_LOCATION (stmt
, loc
);
9180 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
9181 when the current scope is exited. EH_ONLY is true when this is not
9182 meant to apply to normal control flow transfer. */
9185 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
9187 enum tree_code code
;
9191 code
= eh_only
? TRY_CATCH_EXPR
: TRY_FINALLY_EXPR
;
9192 stmt
= build_stmt (DECL_SOURCE_LOCATION (decl
), code
, NULL
, cleanup
);
9194 stmt_expr
= STATEMENT_LIST_STMT_EXPR (cur_stmt_list
);
9195 list
= push_stmt_list ();
9196 TREE_OPERAND (stmt
, 0) = list
;
9197 STATEMENT_LIST_STMT_EXPR (list
) = stmt_expr
;
9200 /* Build a binary-operation expression without default conversions.
9201 CODE is the kind of expression to build.
9202 LOCATION is the operator's location.
9203 This function differs from `build' in several ways:
9204 the data type of the result is computed and recorded in it,
9205 warnings are generated if arg data types are invalid,
9206 special handling for addition and subtraction of pointers is known,
9207 and some optimization is done (operations on narrow ints
9208 are done in the narrower type when that gives the same result).
9209 Constant folding is also done before the result is returned.
9211 Note that the operands will never have enumeral types, or function
9212 or array types, because either they will have the default conversions
9213 performed or they have both just been converted to some other type in which
9214 the arithmetic is to be done. */
9217 build_binary_op (location_t location
, enum tree_code code
,
9218 tree orig_op0
, tree orig_op1
, int convert_p
)
9220 tree type0
, type1
, orig_type0
, orig_type1
;
9222 enum tree_code code0
, code1
;
9224 tree ret
= error_mark_node
;
9225 const char *invalid_op_diag
;
9226 bool op0_int_operands
, op1_int_operands
;
9227 bool int_const
, int_const_or_overflow
, int_operands
;
9229 /* Expression code to give to the expression when it is built.
9230 Normally this is CODE, which is what the caller asked for,
9231 but in some special cases we change it. */
9232 enum tree_code resultcode
= code
;
9234 /* Data type in which the computation is to be performed.
9235 In the simplest cases this is the common type of the arguments. */
9236 tree result_type
= NULL
;
9238 /* When the computation is in excess precision, the type of the
9239 final EXCESS_PRECISION_EXPR. */
9240 tree semantic_result_type
= NULL
;
9242 /* Nonzero means operands have already been type-converted
9243 in whatever way is necessary.
9244 Zero means they need to be converted to RESULT_TYPE. */
9247 /* Nonzero means create the expression with this type, rather than
9249 tree build_type
= 0;
9251 /* Nonzero means after finally constructing the expression
9252 convert it to this type. */
9253 tree final_type
= 0;
9255 /* Nonzero if this is an operation like MIN or MAX which can
9256 safely be computed in short if both args are promoted shorts.
9257 Also implies COMMON.
9258 -1 indicates a bitwise operation; this makes a difference
9259 in the exact conditions for when it is safe to do the operation
9260 in a narrower mode. */
9263 /* Nonzero if this is a comparison operation;
9264 if both args are promoted shorts, compare the original shorts.
9265 Also implies COMMON. */
9266 int short_compare
= 0;
9268 /* Nonzero if this is a right-shift operation, which can be computed on the
9269 original short and then promoted if the operand is a promoted short. */
9270 int short_shift
= 0;
9272 /* Nonzero means set RESULT_TYPE to the common type of the args. */
9275 /* True means types are compatible as far as ObjC is concerned. */
9278 /* True means this is an arithmetic operation that may need excess
9280 bool may_need_excess_precision
;
9282 if (location
== UNKNOWN_LOCATION
)
9283 location
= input_location
;
9288 op0_int_operands
= EXPR_INT_CONST_OPERANDS (orig_op0
);
9289 if (op0_int_operands
)
9290 op0
= remove_c_maybe_const_expr (op0
);
9291 op1_int_operands
= EXPR_INT_CONST_OPERANDS (orig_op1
);
9292 if (op1_int_operands
)
9293 op1
= remove_c_maybe_const_expr (op1
);
9294 int_operands
= (op0_int_operands
&& op1_int_operands
);
9297 int_const_or_overflow
= (TREE_CODE (orig_op0
) == INTEGER_CST
9298 && TREE_CODE (orig_op1
) == INTEGER_CST
);
9299 int_const
= (int_const_or_overflow
9300 && !TREE_OVERFLOW (orig_op0
)
9301 && !TREE_OVERFLOW (orig_op1
));
9304 int_const
= int_const_or_overflow
= false;
9308 op0
= default_conversion (op0
);
9309 op1
= default_conversion (op1
);
9312 orig_type0
= type0
= TREE_TYPE (op0
);
9313 orig_type1
= type1
= TREE_TYPE (op1
);
9315 /* The expression codes of the data types of the arguments tell us
9316 whether the arguments are integers, floating, pointers, etc. */
9317 code0
= TREE_CODE (type0
);
9318 code1
= TREE_CODE (type1
);
9320 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
9321 STRIP_TYPE_NOPS (op0
);
9322 STRIP_TYPE_NOPS (op1
);
9324 /* If an error was already reported for one of the arguments,
9325 avoid reporting another error. */
9327 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
9328 return error_mark_node
;
9330 if ((invalid_op_diag
9331 = targetm
.invalid_binary_op (code
, type0
, type1
)))
9333 error_at (location
, invalid_op_diag
);
9334 return error_mark_node
;
9342 case TRUNC_DIV_EXPR
:
9344 case FLOOR_DIV_EXPR
:
9345 case ROUND_DIV_EXPR
:
9346 case EXACT_DIV_EXPR
:
9347 may_need_excess_precision
= true;
9350 may_need_excess_precision
= false;
9353 if (TREE_CODE (op0
) == EXCESS_PRECISION_EXPR
)
9355 op0
= TREE_OPERAND (op0
, 0);
9356 type0
= TREE_TYPE (op0
);
9358 else if (may_need_excess_precision
9359 && (eptype
= excess_precision_type (type0
)) != NULL_TREE
)
9362 op0
= convert (eptype
, op0
);
9364 if (TREE_CODE (op1
) == EXCESS_PRECISION_EXPR
)
9366 op1
= TREE_OPERAND (op1
, 0);
9367 type1
= TREE_TYPE (op1
);
9369 else if (may_need_excess_precision
9370 && (eptype
= excess_precision_type (type1
)) != NULL_TREE
)
9373 op1
= convert (eptype
, op1
);
9376 objc_ok
= objc_compare_types (type0
, type1
, -3, NULL_TREE
);
9381 /* Handle the pointer + int case. */
9382 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
9384 ret
= pointer_int_sum (location
, PLUS_EXPR
, op0
, op1
);
9385 goto return_build_binary_op
;
9387 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
9389 ret
= pointer_int_sum (location
, PLUS_EXPR
, op1
, op0
);
9390 goto return_build_binary_op
;
9397 /* Subtraction of two similar pointers.
9398 We must subtract them as integers, then divide by object size. */
9399 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
9400 && comp_target_types (location
, type0
, type1
))
9402 ret
= pointer_diff (location
, op0
, op1
);
9403 goto return_build_binary_op
;
9405 /* Handle pointer minus int. Just like pointer plus int. */
9406 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
9408 ret
= pointer_int_sum (location
, MINUS_EXPR
, op0
, op1
);
9409 goto return_build_binary_op
;
9419 case TRUNC_DIV_EXPR
:
9421 case FLOOR_DIV_EXPR
:
9422 case ROUND_DIV_EXPR
:
9423 case EXACT_DIV_EXPR
:
9424 warn_for_div_by_zero (location
, op1
);
9426 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
9427 || code0
== FIXED_POINT_TYPE
9428 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
9429 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
9430 || code1
== FIXED_POINT_TYPE
9431 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
9433 enum tree_code tcode0
= code0
, tcode1
= code1
;
9435 if (code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
9436 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
9437 if (code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
)
9438 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
9440 if (!((tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
)
9441 || (tcode0
== FIXED_POINT_TYPE
&& tcode1
== FIXED_POINT_TYPE
)))
9442 resultcode
= RDIV_EXPR
;
9444 /* Although it would be tempting to shorten always here, that
9445 loses on some targets, since the modulo instruction is
9446 undefined if the quotient can't be represented in the
9447 computation mode. We shorten only if unsigned or if
9448 dividing by something we know != -1. */
9449 shorten
= (TYPE_UNSIGNED (TREE_TYPE (orig_op0
))
9450 || (TREE_CODE (op1
) == INTEGER_CST
9451 && !integer_all_onesp (op1
)));
9459 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
9461 /* Allow vector types which are not floating point types. */
9462 else if (code0
== VECTOR_TYPE
9463 && code1
== VECTOR_TYPE
9464 && !VECTOR_FLOAT_TYPE_P (type0
)
9465 && !VECTOR_FLOAT_TYPE_P (type1
))
9469 case TRUNC_MOD_EXPR
:
9470 case FLOOR_MOD_EXPR
:
9471 warn_for_div_by_zero (location
, op1
);
9473 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
9474 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
9475 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
9477 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
9479 /* Although it would be tempting to shorten always here, that loses
9480 on some targets, since the modulo instruction is undefined if the
9481 quotient can't be represented in the computation mode. We shorten
9482 only if unsigned or if dividing by something we know != -1. */
9483 shorten
= (TYPE_UNSIGNED (TREE_TYPE (orig_op0
))
9484 || (TREE_CODE (op1
) == INTEGER_CST
9485 && !integer_all_onesp (op1
)));
9490 case TRUTH_ANDIF_EXPR
:
9491 case TRUTH_ORIF_EXPR
:
9492 case TRUTH_AND_EXPR
:
9494 case TRUTH_XOR_EXPR
:
9495 if ((code0
== INTEGER_TYPE
|| code0
== POINTER_TYPE
9496 || code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
9497 || code0
== FIXED_POINT_TYPE
)
9498 && (code1
== INTEGER_TYPE
|| code1
== POINTER_TYPE
9499 || code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
9500 || code1
== FIXED_POINT_TYPE
))
9502 /* Result of these operations is always an int,
9503 but that does not mean the operands should be
9504 converted to ints! */
9505 result_type
= integer_type_node
;
9506 op0
= c_common_truthvalue_conversion (location
, op0
);
9507 op1
= c_common_truthvalue_conversion (location
, op1
);
9510 if (code
== TRUTH_ANDIF_EXPR
)
9512 int_const_or_overflow
= (int_operands
9513 && TREE_CODE (orig_op0
) == INTEGER_CST
9514 && (op0
== truthvalue_false_node
9515 || TREE_CODE (orig_op1
) == INTEGER_CST
));
9516 int_const
= (int_const_or_overflow
9517 && !TREE_OVERFLOW (orig_op0
)
9518 && (op0
== truthvalue_false_node
9519 || !TREE_OVERFLOW (orig_op1
)));
9521 else if (code
== TRUTH_ORIF_EXPR
)
9523 int_const_or_overflow
= (int_operands
9524 && TREE_CODE (orig_op0
) == INTEGER_CST
9525 && (op0
== truthvalue_true_node
9526 || TREE_CODE (orig_op1
) == INTEGER_CST
));
9527 int_const
= (int_const_or_overflow
9528 && !TREE_OVERFLOW (orig_op0
)
9529 && (op0
== truthvalue_true_node
9530 || !TREE_OVERFLOW (orig_op1
)));
9534 /* Shift operations: result has same type as first operand;
9535 always convert second operand to int.
9536 Also set SHORT_SHIFT if shifting rightward. */
9539 if ((code0
== INTEGER_TYPE
|| code0
== FIXED_POINT_TYPE
)
9540 && code1
== INTEGER_TYPE
)
9542 if (TREE_CODE (op1
) == INTEGER_CST
)
9544 if (tree_int_cst_sgn (op1
) < 0)
9547 if (c_inhibit_evaluation_warnings
== 0)
9548 warning (0, "right shift count is negative");
9552 if (!integer_zerop (op1
))
9555 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
9558 if (c_inhibit_evaluation_warnings
== 0)
9559 warning (0, "right shift count >= width of type");
9564 /* Use the type of the value to be shifted. */
9565 result_type
= type0
;
9566 /* Convert the shift-count to an integer, regardless of size
9567 of value being shifted. */
9568 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
9569 op1
= convert (integer_type_node
, op1
);
9570 /* Avoid converting op1 to result_type later. */
9576 if ((code0
== INTEGER_TYPE
|| code0
== FIXED_POINT_TYPE
)
9577 && code1
== INTEGER_TYPE
)
9579 if (TREE_CODE (op1
) == INTEGER_CST
)
9581 if (tree_int_cst_sgn (op1
) < 0)
9584 if (c_inhibit_evaluation_warnings
== 0)
9585 warning (0, "left shift count is negative");
9588 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
9591 if (c_inhibit_evaluation_warnings
== 0)
9592 warning (0, "left shift count >= width of type");
9596 /* Use the type of the value to be shifted. */
9597 result_type
= type0
;
9598 /* Convert the shift-count to an integer, regardless of size
9599 of value being shifted. */
9600 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
9601 op1
= convert (integer_type_node
, op1
);
9602 /* Avoid converting op1 to result_type later. */
9609 if (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
))
9610 warning_at (location
,
9612 "comparing floating point with == or != is unsafe");
9613 /* Result of comparison is always int,
9614 but don't convert the args to int! */
9615 build_type
= integer_type_node
;
9616 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
9617 || code0
== FIXED_POINT_TYPE
|| code0
== COMPLEX_TYPE
)
9618 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
9619 || code1
== FIXED_POINT_TYPE
|| code1
== COMPLEX_TYPE
))
9621 else if (code0
== POINTER_TYPE
&& null_pointer_constant_p (orig_op1
))
9623 if (TREE_CODE (op0
) == ADDR_EXPR
9624 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
9626 if (code
== EQ_EXPR
)
9627 warning_at (location
,
9629 "the comparison will always evaluate as %<false%> "
9630 "for the address of %qD will never be NULL",
9631 TREE_OPERAND (op0
, 0));
9633 warning_at (location
,
9635 "the comparison will always evaluate as %<true%> "
9636 "for the address of %qD will never be NULL",
9637 TREE_OPERAND (op0
, 0));
9639 result_type
= type0
;
9641 else if (code1
== POINTER_TYPE
&& null_pointer_constant_p (orig_op0
))
9643 if (TREE_CODE (op1
) == ADDR_EXPR
9644 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
9646 if (code
== EQ_EXPR
)
9647 warning_at (location
,
9649 "the comparison will always evaluate as %<false%> "
9650 "for the address of %qD will never be NULL",
9651 TREE_OPERAND (op1
, 0));
9653 warning_at (location
,
9655 "the comparison will always evaluate as %<true%> "
9656 "for the address of %qD will never be NULL",
9657 TREE_OPERAND (op1
, 0));
9659 result_type
= type1
;
9661 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
9663 tree tt0
= TREE_TYPE (type0
);
9664 tree tt1
= TREE_TYPE (type1
);
9665 addr_space_t as0
= TYPE_ADDR_SPACE (tt0
);
9666 addr_space_t as1
= TYPE_ADDR_SPACE (tt1
);
9667 addr_space_t as_common
= ADDR_SPACE_GENERIC
;
9669 /* Anything compares with void *. void * compares with anything.
9670 Otherwise, the targets must be compatible
9671 and both must be object or both incomplete. */
9672 if (comp_target_types (location
, type0
, type1
))
9673 result_type
= common_pointer_type (type0
, type1
);
9674 else if (!addr_space_superset (as0
, as1
, &as_common
))
9676 error_at (location
, "comparison of pointers to "
9677 "disjoint address spaces");
9678 return error_mark_node
;
9680 else if (VOID_TYPE_P (tt0
))
9682 if (pedantic
&& TREE_CODE (tt1
) == FUNCTION_TYPE
)
9683 pedwarn (location
, OPT_pedantic
, "ISO C forbids "
9684 "comparison of %<void *%> with function pointer");
9686 else if (VOID_TYPE_P (tt1
))
9688 if (pedantic
&& TREE_CODE (tt0
) == FUNCTION_TYPE
)
9689 pedwarn (location
, OPT_pedantic
, "ISO C forbids "
9690 "comparison of %<void *%> with function pointer");
9693 /* Avoid warning about the volatile ObjC EH puts on decls. */
9695 pedwarn (location
, 0,
9696 "comparison of distinct pointer types lacks a cast");
9698 if (result_type
== NULL_TREE
)
9700 int qual
= ENCODE_QUAL_ADDR_SPACE (as_common
);
9701 result_type
= build_pointer_type
9702 (build_qualified_type (void_type_node
, qual
));
9705 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
9707 result_type
= type0
;
9708 pedwarn (location
, 0, "comparison between pointer and integer");
9710 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
9712 result_type
= type1
;
9713 pedwarn (location
, 0, "comparison between pointer and integer");
9721 build_type
= integer_type_node
;
9722 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
9723 || code0
== FIXED_POINT_TYPE
)
9724 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
9725 || code1
== FIXED_POINT_TYPE
))
9727 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
9729 addr_space_t as0
= TYPE_ADDR_SPACE (TREE_TYPE (type0
));
9730 addr_space_t as1
= TYPE_ADDR_SPACE (TREE_TYPE (type1
));
9731 addr_space_t as_common
;
9733 if (comp_target_types (location
, type0
, type1
))
9735 result_type
= common_pointer_type (type0
, type1
);
9736 if (!COMPLETE_TYPE_P (TREE_TYPE (type0
))
9737 != !COMPLETE_TYPE_P (TREE_TYPE (type1
)))
9738 pedwarn (location
, 0,
9739 "comparison of complete and incomplete pointers");
9740 else if (TREE_CODE (TREE_TYPE (type0
)) == FUNCTION_TYPE
)
9741 pedwarn (location
, OPT_pedantic
, "ISO C forbids "
9742 "ordered comparisons of pointers to functions");
9743 else if (null_pointer_constant_p (orig_op0
)
9744 || null_pointer_constant_p (orig_op1
))
9745 warning_at (location
, OPT_Wextra
,
9746 "ordered comparison of pointer with null pointer");
9749 else if (!addr_space_superset (as0
, as1
, &as_common
))
9751 error_at (location
, "comparison of pointers to "
9752 "disjoint address spaces");
9753 return error_mark_node
;
9757 int qual
= ENCODE_QUAL_ADDR_SPACE (as_common
);
9758 result_type
= build_pointer_type
9759 (build_qualified_type (void_type_node
, qual
));
9760 pedwarn (location
, 0,
9761 "comparison of distinct pointer types lacks a cast");
9764 else if (code0
== POINTER_TYPE
&& null_pointer_constant_p (orig_op1
))
9766 result_type
= type0
;
9768 pedwarn (location
, OPT_pedantic
,
9769 "ordered comparison of pointer with integer zero");
9770 else if (extra_warnings
)
9771 warning_at (location
, OPT_Wextra
,
9772 "ordered comparison of pointer with integer zero");
9774 else if (code1
== POINTER_TYPE
&& null_pointer_constant_p (orig_op0
))
9776 result_type
= type1
;
9778 pedwarn (location
, OPT_pedantic
,
9779 "ordered comparison of pointer with integer zero");
9780 else if (extra_warnings
)
9781 warning_at (location
, OPT_Wextra
,
9782 "ordered comparison of pointer with integer zero");
9784 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
9786 result_type
= type0
;
9787 pedwarn (location
, 0, "comparison between pointer and integer");
9789 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
9791 result_type
= type1
;
9792 pedwarn (location
, 0, "comparison between pointer and integer");
9800 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
9801 return error_mark_node
;
9803 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
9804 && (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
9805 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
9806 TREE_TYPE (type1
))))
9808 binary_op_error (location
, code
, type0
, type1
);
9809 return error_mark_node
;
9812 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
9813 || code0
== FIXED_POINT_TYPE
|| code0
== VECTOR_TYPE
)
9815 (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
9816 || code1
== FIXED_POINT_TYPE
|| code1
== VECTOR_TYPE
))
9818 bool first_complex
= (code0
== COMPLEX_TYPE
);
9819 bool second_complex
= (code1
== COMPLEX_TYPE
);
9820 int none_complex
= (!first_complex
&& !second_complex
);
9822 if (shorten
|| common
|| short_compare
)
9824 result_type
= c_common_type (type0
, type1
);
9825 if (result_type
== error_mark_node
)
9826 return error_mark_node
;
9829 if (first_complex
!= second_complex
9830 && (code
== PLUS_EXPR
9831 || code
== MINUS_EXPR
9832 || code
== MULT_EXPR
9833 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
9834 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
9835 && flag_signed_zeros
)
9837 /* An operation on mixed real/complex operands must be
9838 handled specially, but the language-independent code can
9839 more easily optimize the plain complex arithmetic if
9840 -fno-signed-zeros. */
9841 tree real_type
= TREE_TYPE (result_type
);
9843 if (type0
!= orig_type0
|| type1
!= orig_type1
)
9845 gcc_assert (may_need_excess_precision
&& common
);
9846 semantic_result_type
= c_common_type (orig_type0
, orig_type1
);
9850 if (TREE_TYPE (op0
) != result_type
)
9851 op0
= convert_and_check (result_type
, op0
);
9852 if (TREE_TYPE (op1
) != real_type
)
9853 op1
= convert_and_check (real_type
, op1
);
9857 if (TREE_TYPE (op0
) != real_type
)
9858 op0
= convert_and_check (real_type
, op0
);
9859 if (TREE_TYPE (op1
) != result_type
)
9860 op1
= convert_and_check (result_type
, op1
);
9862 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
9863 return error_mark_node
;
9866 op0
= c_save_expr (op0
);
9867 real
= build_unary_op (EXPR_LOCATION (orig_op0
), REALPART_EXPR
,
9869 imag
= build_unary_op (EXPR_LOCATION (orig_op0
), IMAGPART_EXPR
,
9874 case TRUNC_DIV_EXPR
:
9875 imag
= build2 (resultcode
, real_type
, imag
, op1
);
9879 real
= build2 (resultcode
, real_type
, real
, op1
);
9887 op1
= c_save_expr (op1
);
9888 real
= build_unary_op (EXPR_LOCATION (orig_op1
), REALPART_EXPR
,
9890 imag
= build_unary_op (EXPR_LOCATION (orig_op1
), IMAGPART_EXPR
,
9895 imag
= build2 (resultcode
, real_type
, op0
, imag
);
9898 real
= build2 (resultcode
, real_type
, op0
, real
);
9901 real
= build2 (resultcode
, real_type
, op0
, real
);
9902 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
9908 ret
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
9909 goto return_build_binary_op
;
9912 /* For certain operations (which identify themselves by shorten != 0)
9913 if both args were extended from the same smaller type,
9914 do the arithmetic in that type and then extend.
9916 shorten !=0 and !=1 indicates a bitwise operation.
9917 For them, this optimization is safe only if
9918 both args are zero-extended or both are sign-extended.
9919 Otherwise, we might change the result.
9920 Eg, (short)-1 | (unsigned short)-1 is (int)-1
9921 but calculated in (unsigned short) it would be (unsigned short)-1. */
9923 if (shorten
&& none_complex
)
9925 final_type
= result_type
;
9926 result_type
= shorten_binary_op (result_type
, op0
, op1
,
9930 /* Shifts can be shortened if shifting right. */
9935 tree arg0
= get_narrower (op0
, &unsigned_arg
);
9937 final_type
= result_type
;
9939 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
9940 unsigned_arg
= TYPE_UNSIGNED (TREE_TYPE (op0
));
9942 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
9943 && tree_int_cst_sgn (op1
) > 0
9944 /* We can shorten only if the shift count is less than the
9945 number of bits in the smaller type size. */
9946 && compare_tree_int (op1
, TYPE_PRECISION (TREE_TYPE (arg0
))) < 0
9947 /* We cannot drop an unsigned shift after sign-extension. */
9948 && (!TYPE_UNSIGNED (final_type
) || unsigned_arg
))
9950 /* Do an unsigned shift if the operand was zero-extended. */
9952 = c_common_signed_or_unsigned_type (unsigned_arg
,
9954 /* Convert value-to-be-shifted to that type. */
9955 if (TREE_TYPE (op0
) != result_type
)
9956 op0
= convert (result_type
, op0
);
9961 /* Comparison operations are shortened too but differently.
9962 They identify themselves by setting short_compare = 1. */
9966 /* Don't write &op0, etc., because that would prevent op0
9967 from being kept in a register.
9968 Instead, make copies of the our local variables and
9969 pass the copies by reference, then copy them back afterward. */
9970 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
9971 enum tree_code xresultcode
= resultcode
;
9973 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
9978 goto return_build_binary_op
;
9981 op0
= xop0
, op1
= xop1
;
9983 resultcode
= xresultcode
;
9985 if (c_inhibit_evaluation_warnings
== 0)
9987 bool op0_maybe_const
= true;
9988 bool op1_maybe_const
= true;
9989 tree orig_op0_folded
, orig_op1_folded
;
9991 if (in_late_binary_op
)
9993 orig_op0_folded
= orig_op0
;
9994 orig_op1_folded
= orig_op1
;
9998 /* Fold for the sake of possible warnings, as in
9999 build_conditional_expr. This requires the
10000 "original" values to be folded, not just op0 and
10002 c_inhibit_evaluation_warnings
++;
10003 op0
= c_fully_fold (op0
, require_constant_value
,
10005 op1
= c_fully_fold (op1
, require_constant_value
,
10007 c_inhibit_evaluation_warnings
--;
10008 orig_op0_folded
= c_fully_fold (orig_op0
,
10009 require_constant_value
,
10011 orig_op1_folded
= c_fully_fold (orig_op1
,
10012 require_constant_value
,
10016 if (warn_sign_compare
)
10017 warn_for_sign_compare (location
, orig_op0_folded
,
10018 orig_op1_folded
, op0
, op1
,
10019 result_type
, resultcode
);
10020 if (!in_late_binary_op
)
10022 if (!op0_maybe_const
|| TREE_CODE (op0
) != INTEGER_CST
)
10023 op0
= c_wrap_maybe_const (op0
, !op0_maybe_const
);
10024 if (!op1_maybe_const
|| TREE_CODE (op1
) != INTEGER_CST
)
10025 op1
= c_wrap_maybe_const (op1
, !op1_maybe_const
);
10031 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
10032 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
10033 Then the expression will be built.
10034 It will be given type FINAL_TYPE if that is nonzero;
10035 otherwise, it will be given type RESULT_TYPE. */
10039 binary_op_error (location
, code
, TREE_TYPE (op0
), TREE_TYPE (op1
));
10040 return error_mark_node
;
10043 if (build_type
== NULL_TREE
)
10045 build_type
= result_type
;
10046 if (type0
!= orig_type0
|| type1
!= orig_type1
)
10048 gcc_assert (may_need_excess_precision
&& common
);
10049 semantic_result_type
= c_common_type (orig_type0
, orig_type1
);
10055 op0
= ep_convert_and_check (result_type
, op0
, semantic_result_type
);
10056 op1
= ep_convert_and_check (result_type
, op1
, semantic_result_type
);
10058 /* This can happen if one operand has a vector type, and the other
10059 has a different type. */
10060 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
10061 return error_mark_node
;
10064 /* Treat expressions in initializers specially as they can't trap. */
10065 if (int_const_or_overflow
)
10066 ret
= (require_constant_value
10067 ? fold_build2_initializer_loc (location
, resultcode
, build_type
,
10069 : fold_build2_loc (location
, resultcode
, build_type
, op0
, op1
));
10071 ret
= build2 (resultcode
, build_type
, op0
, op1
);
10072 if (final_type
!= 0)
10073 ret
= convert (final_type
, ret
);
10075 return_build_binary_op
:
10076 gcc_assert (ret
!= error_mark_node
);
10077 if (TREE_CODE (ret
) == INTEGER_CST
&& !TREE_OVERFLOW (ret
) && !int_const
)
10078 ret
= (int_operands
10079 ? note_integer_operands (ret
)
10080 : build1 (NOP_EXPR
, TREE_TYPE (ret
), ret
));
10081 else if (TREE_CODE (ret
) != INTEGER_CST
&& int_operands
10082 && !in_late_binary_op
)
10083 ret
= note_integer_operands (ret
);
10084 if (semantic_result_type
)
10085 ret
= build1 (EXCESS_PRECISION_EXPR
, semantic_result_type
, ret
);
10086 protected_set_expr_location (ret
, location
);
10091 /* Convert EXPR to be a truth-value, validating its type for this
10092 purpose. LOCATION is the source location for the expression. */
10095 c_objc_common_truthvalue_conversion (location_t location
, tree expr
)
10097 bool int_const
, int_operands
;
10099 switch (TREE_CODE (TREE_TYPE (expr
)))
10102 error_at (location
, "used array that cannot be converted to pointer where scalar is required");
10103 return error_mark_node
;
10106 error_at (location
, "used struct type value where scalar is required");
10107 return error_mark_node
;
10110 error_at (location
, "used union type value where scalar is required");
10111 return error_mark_node
;
10113 case FUNCTION_TYPE
:
10114 gcc_unreachable ();
10120 int_const
= (TREE_CODE (expr
) == INTEGER_CST
&& !TREE_OVERFLOW (expr
));
10121 int_operands
= EXPR_INT_CONST_OPERANDS (expr
);
10123 expr
= remove_c_maybe_const_expr (expr
);
10125 /* ??? Should we also give an error for void and vectors rather than
10126 leaving those to give errors later? */
10127 expr
= c_common_truthvalue_conversion (location
, expr
);
10129 if (TREE_CODE (expr
) == INTEGER_CST
&& int_operands
&& !int_const
)
10131 if (TREE_OVERFLOW (expr
))
10134 return note_integer_operands (expr
);
10136 if (TREE_CODE (expr
) == INTEGER_CST
&& !int_const
)
10137 return build1 (NOP_EXPR
, TREE_TYPE (expr
), expr
);
10142 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
10146 c_expr_to_decl (tree expr
, bool *tc ATTRIBUTE_UNUSED
, bool *se
)
10148 if (TREE_CODE (expr
) == COMPOUND_LITERAL_EXPR
)
10150 tree decl
= COMPOUND_LITERAL_EXPR_DECL (expr
);
10151 /* Executing a compound literal inside a function reinitializes
10153 if (!TREE_STATIC (decl
))
10161 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
10164 c_begin_omp_parallel (void)
10168 keep_next_level ();
10169 block
= c_begin_compound_stmt (true);
10174 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
10175 statement. LOC is the location of the OMP_PARALLEL. */
10178 c_finish_omp_parallel (location_t loc
, tree clauses
, tree block
)
10182 block
= c_end_compound_stmt (loc
, block
, true);
10184 stmt
= make_node (OMP_PARALLEL
);
10185 TREE_TYPE (stmt
) = void_type_node
;
10186 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
10187 OMP_PARALLEL_BODY (stmt
) = block
;
10188 SET_EXPR_LOCATION (stmt
, loc
);
10190 return add_stmt (stmt
);
10193 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
10196 c_begin_omp_task (void)
10200 keep_next_level ();
10201 block
= c_begin_compound_stmt (true);
10206 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
10207 statement. LOC is the location of the #pragma. */
10210 c_finish_omp_task (location_t loc
, tree clauses
, tree block
)
10214 block
= c_end_compound_stmt (loc
, block
, true);
10216 stmt
= make_node (OMP_TASK
);
10217 TREE_TYPE (stmt
) = void_type_node
;
10218 OMP_TASK_CLAUSES (stmt
) = clauses
;
10219 OMP_TASK_BODY (stmt
) = block
;
10220 SET_EXPR_LOCATION (stmt
, loc
);
10222 return add_stmt (stmt
);
10225 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
10226 Remove any elements from the list that are invalid. */
10229 c_finish_omp_clauses (tree clauses
)
10231 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
10232 tree c
, t
, *pc
= &clauses
;
10235 bitmap_obstack_initialize (NULL
);
10236 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
10237 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
10238 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
10240 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
10242 bool remove
= false;
10243 bool need_complete
= false;
10244 bool need_implicitly_determined
= false;
10246 switch (OMP_CLAUSE_CODE (c
))
10248 case OMP_CLAUSE_SHARED
:
10250 need_implicitly_determined
= true;
10251 goto check_dup_generic
;
10253 case OMP_CLAUSE_PRIVATE
:
10255 need_complete
= true;
10256 need_implicitly_determined
= true;
10257 goto check_dup_generic
;
10259 case OMP_CLAUSE_REDUCTION
:
10260 name
= "reduction";
10261 need_implicitly_determined
= true;
10262 t
= OMP_CLAUSE_DECL (c
);
10263 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
10264 || POINTER_TYPE_P (TREE_TYPE (t
)))
10266 error_at (OMP_CLAUSE_LOCATION (c
),
10267 "%qE has invalid type for %<reduction%>", t
);
10270 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
10272 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
10273 const char *r_name
= NULL
;
10290 case TRUTH_ANDIF_EXPR
:
10293 case TRUTH_ORIF_EXPR
:
10297 gcc_unreachable ();
10301 error_at (OMP_CLAUSE_LOCATION (c
),
10302 "%qE has invalid type for %<reduction(%s)%>",
10307 goto check_dup_generic
;
10309 case OMP_CLAUSE_COPYPRIVATE
:
10310 name
= "copyprivate";
10311 goto check_dup_generic
;
10313 case OMP_CLAUSE_COPYIN
:
10315 t
= OMP_CLAUSE_DECL (c
);
10316 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
10318 error_at (OMP_CLAUSE_LOCATION (c
),
10319 "%qE must be %<threadprivate%> for %<copyin%>", t
);
10322 goto check_dup_generic
;
10325 t
= OMP_CLAUSE_DECL (c
);
10326 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
10328 error_at (OMP_CLAUSE_LOCATION (c
),
10329 "%qE is not a variable in clause %qs", t
, name
);
10332 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
10333 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
10334 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
10336 error_at (OMP_CLAUSE_LOCATION (c
),
10337 "%qE appears more than once in data clauses", t
);
10341 bitmap_set_bit (&generic_head
, DECL_UID (t
));
10344 case OMP_CLAUSE_FIRSTPRIVATE
:
10345 name
= "firstprivate";
10346 t
= OMP_CLAUSE_DECL (c
);
10347 need_complete
= true;
10348 need_implicitly_determined
= true;
10349 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
10351 error_at (OMP_CLAUSE_LOCATION (c
),
10352 "%qE is not a variable in clause %<firstprivate%>", t
);
10355 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
10356 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
10358 error_at (OMP_CLAUSE_LOCATION (c
),
10359 "%qE appears more than once in data clauses", t
);
10363 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
10366 case OMP_CLAUSE_LASTPRIVATE
:
10367 name
= "lastprivate";
10368 t
= OMP_CLAUSE_DECL (c
);
10369 need_complete
= true;
10370 need_implicitly_determined
= true;
10371 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
10373 error_at (OMP_CLAUSE_LOCATION (c
),
10374 "%qE is not a variable in clause %<lastprivate%>", t
);
10377 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
10378 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
10380 error_at (OMP_CLAUSE_LOCATION (c
),
10381 "%qE appears more than once in data clauses", t
);
10385 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
10388 case OMP_CLAUSE_IF
:
10389 case OMP_CLAUSE_NUM_THREADS
:
10390 case OMP_CLAUSE_SCHEDULE
:
10391 case OMP_CLAUSE_NOWAIT
:
10392 case OMP_CLAUSE_ORDERED
:
10393 case OMP_CLAUSE_DEFAULT
:
10394 case OMP_CLAUSE_UNTIED
:
10395 case OMP_CLAUSE_COLLAPSE
:
10396 pc
= &OMP_CLAUSE_CHAIN (c
);
10400 gcc_unreachable ();
10405 t
= OMP_CLAUSE_DECL (c
);
10409 t
= require_complete_type (t
);
10410 if (t
== error_mark_node
)
10414 if (need_implicitly_determined
)
10416 const char *share_name
= NULL
;
10418 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
10419 share_name
= "threadprivate";
10420 else switch (c_omp_predetermined_sharing (t
))
10422 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
10424 case OMP_CLAUSE_DEFAULT_SHARED
:
10425 share_name
= "shared";
10427 case OMP_CLAUSE_DEFAULT_PRIVATE
:
10428 share_name
= "private";
10431 gcc_unreachable ();
10435 error_at (OMP_CLAUSE_LOCATION (c
),
10436 "%qE is predetermined %qs for %qs",
10437 t
, share_name
, name
);
10444 *pc
= OMP_CLAUSE_CHAIN (c
);
10446 pc
= &OMP_CLAUSE_CHAIN (c
);
10449 bitmap_obstack_release (NULL
);
10453 /* Make a variant type in the proper way for C/C++, propagating qualifiers
10454 down to the element type of an array. */
10457 c_build_qualified_type (tree type
, int type_quals
)
10459 if (type
== error_mark_node
)
10462 if (TREE_CODE (type
) == ARRAY_TYPE
)
10465 tree element_type
= c_build_qualified_type (TREE_TYPE (type
),
10468 /* See if we already have an identically qualified type. */
10469 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10471 if (TYPE_QUALS (strip_array_types (t
)) == type_quals
10472 && TYPE_NAME (t
) == TYPE_NAME (type
)
10473 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
)
10474 && attribute_list_equal (TYPE_ATTRIBUTES (t
),
10475 TYPE_ATTRIBUTES (type
)))
10480 tree domain
= TYPE_DOMAIN (type
);
10482 t
= build_variant_type_copy (type
);
10483 TREE_TYPE (t
) = element_type
;
10485 if (TYPE_STRUCTURAL_EQUALITY_P (element_type
)
10486 || (domain
&& TYPE_STRUCTURAL_EQUALITY_P (domain
)))
10487 SET_TYPE_STRUCTURAL_EQUALITY (t
);
10488 else if (TYPE_CANONICAL (element_type
) != element_type
10489 || (domain
&& TYPE_CANONICAL (domain
) != domain
))
10491 tree unqualified_canon
10492 = build_array_type (TYPE_CANONICAL (element_type
),
10493 domain
? TYPE_CANONICAL (domain
)
10496 = c_build_qualified_type (unqualified_canon
, type_quals
);
10499 TYPE_CANONICAL (t
) = t
;
10504 /* A restrict-qualified pointer type must be a pointer to object or
10505 incomplete type. Note that the use of POINTER_TYPE_P also allows
10506 REFERENCE_TYPEs, which is appropriate for C++. */
10507 if ((type_quals
& TYPE_QUAL_RESTRICT
)
10508 && (!POINTER_TYPE_P (type
)
10509 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
))))
10511 error ("invalid use of %<restrict%>");
10512 type_quals
&= ~TYPE_QUAL_RESTRICT
;
10515 return build_qualified_type (type
, type_quals
);
10518 /* Build a VA_ARG_EXPR for the C parser. */
10521 c_build_va_arg (location_t loc
, tree expr
, tree type
)
10523 if (warn_cxx_compat
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
10524 warning_at (loc
, OPT_Wc___compat
,
10525 "C++ requires promoted type, not enum type, in %<va_arg%>");
10526 return build_va_arg (loc
, expr
, type
);