1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987-2013 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
21 /* This file is part of the C front end.
22 It contains routines to build C expressions given their operands,
23 including computing the types of the result, C-specific error checks,
24 and some optimization. */
28 #include "coretypes.h"
31 #include "langhooks.h"
37 #include "tree-iterator.h"
40 #include "c-family/c-objc.h"
41 #include "c-family/c-common.h"
43 /* Possible cases of implicit bad conversions. Used to select
44 diagnostic messages in convert_for_assignment. */
52 /* The level of nesting inside "__alignof__". */
55 /* The level of nesting inside "sizeof". */
58 /* The level of nesting inside "typeof". */
61 /* The argument of last parsed sizeof expression, only to be tested
62 if expr.original_code == SIZEOF_EXPR. */
63 tree c_last_sizeof_arg
;
65 /* Nonzero if we've already printed a "missing braces around initializer"
66 message within this initializer. */
67 static int missing_braces_mentioned
;
69 static int require_constant_value
;
70 static int require_constant_elements
;
72 static bool null_pointer_constant_p (const_tree
);
73 static tree
qualify_type (tree
, tree
);
74 static int tagged_types_tu_compatible_p (const_tree
, const_tree
, bool *,
76 static int comp_target_types (location_t
, tree
, tree
);
77 static int function_types_compatible_p (const_tree
, const_tree
, bool *,
79 static int type_lists_compatible_p (const_tree
, const_tree
, bool *, bool *);
80 static tree
lookup_field (tree
, tree
);
81 static int convert_arguments (tree
, vec
<tree
, va_gc
> *, vec
<tree
, va_gc
> *,
83 static tree
pointer_diff (location_t
, tree
, tree
);
84 static tree
convert_for_assignment (location_t
, tree
, tree
, tree
,
85 enum impl_conv
, bool, tree
, tree
, int);
86 static tree
valid_compound_expr_initializer (tree
, tree
);
87 static void push_string (const char *);
88 static void push_member_name (tree
);
89 static int spelling_length (void);
90 static char *print_spelling (char *);
91 static void warning_init (int, const char *);
92 static tree
digest_init (location_t
, tree
, tree
, tree
, bool, bool, int);
93 static void output_init_element (tree
, tree
, bool, tree
, tree
, int, bool,
95 static void output_pending_init_elements (int, struct obstack
*);
96 static int set_designator (int, struct obstack
*);
97 static void push_range_stack (tree
, struct obstack
*);
98 static void add_pending_init (tree
, tree
, tree
, bool, struct obstack
*);
99 static void set_nonincremental_init (struct obstack
*);
100 static void set_nonincremental_init_from_string (tree
, struct obstack
*);
101 static tree
find_init_member (tree
, struct obstack
*);
102 static void readonly_warning (tree
, enum lvalue_use
);
103 static int lvalue_or_else (location_t
, const_tree
, enum lvalue_use
);
104 static void record_maybe_used_decl (tree
);
105 static int comptypes_internal (const_tree
, const_tree
, bool *, bool *);
107 /* Return true if EXP is a null pointer constant, false otherwise. */
110 null_pointer_constant_p (const_tree expr
)
112 /* This should really operate on c_expr structures, but they aren't
113 yet available everywhere required. */
114 tree type
= TREE_TYPE (expr
);
115 return (TREE_CODE (expr
) == INTEGER_CST
116 && !TREE_OVERFLOW (expr
)
117 && integer_zerop (expr
)
118 && (INTEGRAL_TYPE_P (type
)
119 || (TREE_CODE (type
) == POINTER_TYPE
120 && VOID_TYPE_P (TREE_TYPE (type
))
121 && TYPE_QUALS (TREE_TYPE (type
)) == TYPE_UNQUALIFIED
)));
124 /* EXPR may appear in an unevaluated part of an integer constant
125 expression, but not in an evaluated part. Wrap it in a
126 C_MAYBE_CONST_EXPR, or mark it with TREE_OVERFLOW if it is just an
127 INTEGER_CST and we cannot create a C_MAYBE_CONST_EXPR. */
130 note_integer_operands (tree expr
)
133 if (TREE_CODE (expr
) == INTEGER_CST
&& in_late_binary_op
)
135 ret
= copy_node (expr
);
136 TREE_OVERFLOW (ret
) = 1;
140 ret
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (expr
), NULL_TREE
, expr
);
141 C_MAYBE_CONST_EXPR_INT_OPERANDS (ret
) = 1;
146 /* Having checked whether EXPR may appear in an unevaluated part of an
147 integer constant expression and found that it may, remove any
148 C_MAYBE_CONST_EXPR noting this fact and return the resulting
152 remove_c_maybe_const_expr (tree expr
)
154 if (TREE_CODE (expr
) == C_MAYBE_CONST_EXPR
)
155 return C_MAYBE_CONST_EXPR_EXPR (expr
);
160 \f/* This is a cache to hold if two types are compatible or not. */
162 struct tagged_tu_seen_cache
{
163 const struct tagged_tu_seen_cache
* next
;
166 /* The return value of tagged_types_tu_compatible_p if we had seen
167 these two types already. */
171 static const struct tagged_tu_seen_cache
* tagged_tu_seen_base
;
172 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache
*);
174 /* Do `exp = require_complete_type (exp);' to make sure exp
175 does not have an incomplete type. (That includes void types.) */
178 require_complete_type (tree value
)
180 tree type
= TREE_TYPE (value
);
182 if (value
== error_mark_node
|| type
== error_mark_node
)
183 return error_mark_node
;
185 /* First, detect a valid value with a complete type. */
186 if (COMPLETE_TYPE_P (type
))
189 c_incomplete_type_error (value
, type
);
190 return error_mark_node
;
193 /* Print an error message for invalid use of an incomplete type.
194 VALUE is the expression that was used (or 0 if that isn't known)
195 and TYPE is the type that was invalid. */
198 c_incomplete_type_error (const_tree value
, const_tree type
)
200 const char *type_code_string
;
202 /* Avoid duplicate error message. */
203 if (TREE_CODE (type
) == ERROR_MARK
)
206 if (value
!= 0 && (TREE_CODE (value
) == VAR_DECL
207 || TREE_CODE (value
) == PARM_DECL
))
208 error ("%qD has an incomplete type", value
);
212 /* We must print an error message. Be clever about what it says. */
214 switch (TREE_CODE (type
))
217 type_code_string
= "struct";
221 type_code_string
= "union";
225 type_code_string
= "enum";
229 error ("invalid use of void expression");
233 if (TYPE_DOMAIN (type
))
235 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL
)
237 error ("invalid use of flexible array member");
240 type
= TREE_TYPE (type
);
243 error ("invalid use of array with unspecified bounds");
250 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
251 error ("invalid use of undefined type %<%s %E%>",
252 type_code_string
, TYPE_NAME (type
));
254 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
255 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type
));
259 /* Given a type, apply default promotions wrt unnamed function
260 arguments and return the new type. */
263 c_type_promotes_to (tree type
)
265 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
266 return double_type_node
;
268 if (c_promoting_integer_type_p (type
))
270 /* Preserve unsignedness if not really getting any wider. */
271 if (TYPE_UNSIGNED (type
)
272 && (TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
)))
273 return unsigned_type_node
;
274 return integer_type_node
;
280 /* Return true if between two named address spaces, whether there is a superset
281 named address space that encompasses both address spaces. If there is a
282 superset, return which address space is the superset. */
285 addr_space_superset (addr_space_t as1
, addr_space_t as2
, addr_space_t
*common
)
292 else if (targetm
.addr_space
.subset_p (as1
, as2
))
297 else if (targetm
.addr_space
.subset_p (as2
, as1
))
306 /* Return a variant of TYPE which has all the type qualifiers of LIKE
307 as well as those of TYPE. */
310 qualify_type (tree type
, tree like
)
312 addr_space_t as_type
= TYPE_ADDR_SPACE (type
);
313 addr_space_t as_like
= TYPE_ADDR_SPACE (like
);
314 addr_space_t as_common
;
316 /* If the two named address spaces are different, determine the common
317 superset address space. If there isn't one, raise an error. */
318 if (!addr_space_superset (as_type
, as_like
, &as_common
))
321 error ("%qT and %qT are in disjoint named address spaces",
325 return c_build_qualified_type (type
,
326 TYPE_QUALS_NO_ADDR_SPACE (type
)
327 | TYPE_QUALS_NO_ADDR_SPACE (like
)
328 | ENCODE_QUAL_ADDR_SPACE (as_common
));
331 /* Return true iff the given tree T is a variable length array. */
334 c_vla_type_p (const_tree t
)
336 if (TREE_CODE (t
) == ARRAY_TYPE
337 && C_TYPE_VARIABLE_SIZE (t
))
342 /* Return the composite type of two compatible types.
344 We assume that comptypes has already been done and returned
345 nonzero; if that isn't so, this may crash. In particular, we
346 assume that qualifiers match. */
349 composite_type (tree t1
, tree t2
)
351 enum tree_code code1
;
352 enum tree_code code2
;
355 /* Save time if the two types are the same. */
357 if (t1
== t2
) return t1
;
359 /* If one type is nonsense, use the other. */
360 if (t1
== error_mark_node
)
362 if (t2
== error_mark_node
)
365 code1
= TREE_CODE (t1
);
366 code2
= TREE_CODE (t2
);
368 /* Merge the attributes. */
369 attributes
= targetm
.merge_type_attributes (t1
, t2
);
371 /* If one is an enumerated type and the other is the compatible
372 integer type, the composite type might be either of the two
373 (DR#013 question 3). For consistency, use the enumerated type as
374 the composite type. */
376 if (code1
== ENUMERAL_TYPE
&& code2
== INTEGER_TYPE
)
378 if (code2
== ENUMERAL_TYPE
&& code1
== INTEGER_TYPE
)
381 gcc_assert (code1
== code2
);
386 /* For two pointers, do this recursively on the target type. */
388 tree pointed_to_1
= TREE_TYPE (t1
);
389 tree pointed_to_2
= TREE_TYPE (t2
);
390 tree target
= composite_type (pointed_to_1
, pointed_to_2
);
391 t1
= build_pointer_type_for_mode (target
, TYPE_MODE (t1
), false);
392 t1
= build_type_attribute_variant (t1
, attributes
);
393 return qualify_type (t1
, t2
);
398 tree elt
= composite_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
401 tree d1
= TYPE_DOMAIN (t1
);
402 tree d2
= TYPE_DOMAIN (t2
);
403 bool d1_variable
, d2_variable
;
404 bool d1_zero
, d2_zero
;
405 bool t1_complete
, t2_complete
;
407 /* We should not have any type quals on arrays at all. */
408 gcc_assert (!TYPE_QUALS_NO_ADDR_SPACE (t1
)
409 && !TYPE_QUALS_NO_ADDR_SPACE (t2
));
411 t1_complete
= COMPLETE_TYPE_P (t1
);
412 t2_complete
= COMPLETE_TYPE_P (t2
);
414 d1_zero
= d1
== 0 || !TYPE_MAX_VALUE (d1
);
415 d2_zero
= d2
== 0 || !TYPE_MAX_VALUE (d2
);
417 d1_variable
= (!d1_zero
418 && (TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
419 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
));
420 d2_variable
= (!d2_zero
421 && (TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
422 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
));
423 d1_variable
= d1_variable
|| (d1_zero
&& c_vla_type_p (t1
));
424 d2_variable
= d2_variable
|| (d2_zero
&& c_vla_type_p (t2
));
426 /* Save space: see if the result is identical to one of the args. */
427 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
)
428 && (d2_variable
|| d2_zero
|| !d1_variable
))
429 return build_type_attribute_variant (t1
, attributes
);
430 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
)
431 && (d1_variable
|| d1_zero
|| !d2_variable
))
432 return build_type_attribute_variant (t2
, attributes
);
434 if (elt
== TREE_TYPE (t1
) && !TYPE_DOMAIN (t2
) && !TYPE_DOMAIN (t1
))
435 return build_type_attribute_variant (t1
, attributes
);
436 if (elt
== TREE_TYPE (t2
) && !TYPE_DOMAIN (t2
) && !TYPE_DOMAIN (t1
))
437 return build_type_attribute_variant (t2
, attributes
);
439 /* Merge the element types, and have a size if either arg has
440 one. We may have qualifiers on the element types. To set
441 up TYPE_MAIN_VARIANT correctly, we need to form the
442 composite of the unqualified types and add the qualifiers
444 quals
= TYPE_QUALS (strip_array_types (elt
));
445 unqual_elt
= c_build_qualified_type (elt
, TYPE_UNQUALIFIED
);
446 t1
= build_array_type (unqual_elt
,
447 TYPE_DOMAIN ((TYPE_DOMAIN (t1
)
453 /* Ensure a composite type involving a zero-length array type
454 is a zero-length type not an incomplete type. */
455 if (d1_zero
&& d2_zero
456 && (t1_complete
|| t2_complete
)
457 && !COMPLETE_TYPE_P (t1
))
459 TYPE_SIZE (t1
) = bitsize_zero_node
;
460 TYPE_SIZE_UNIT (t1
) = size_zero_node
;
462 t1
= c_build_qualified_type (t1
, quals
);
463 return build_type_attribute_variant (t1
, attributes
);
469 if (attributes
!= NULL
)
471 /* Try harder not to create a new aggregate type. */
472 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
474 if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
477 return build_type_attribute_variant (t1
, attributes
);
480 /* Function types: prefer the one that specified arg types.
481 If both do, merge the arg types. Also merge the return types. */
483 tree valtype
= composite_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
484 tree p1
= TYPE_ARG_TYPES (t1
);
485 tree p2
= TYPE_ARG_TYPES (t2
);
490 /* Save space: see if the result is identical to one of the args. */
491 if (valtype
== TREE_TYPE (t1
) && !TYPE_ARG_TYPES (t2
))
492 return build_type_attribute_variant (t1
, attributes
);
493 if (valtype
== TREE_TYPE (t2
) && !TYPE_ARG_TYPES (t1
))
494 return build_type_attribute_variant (t2
, attributes
);
496 /* Simple way if one arg fails to specify argument types. */
497 if (TYPE_ARG_TYPES (t1
) == 0)
499 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t2
));
500 t1
= build_type_attribute_variant (t1
, attributes
);
501 return qualify_type (t1
, t2
);
503 if (TYPE_ARG_TYPES (t2
) == 0)
505 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t1
));
506 t1
= build_type_attribute_variant (t1
, attributes
);
507 return qualify_type (t1
, t2
);
510 /* If both args specify argument types, we must merge the two
511 lists, argument by argument. */
513 len
= list_length (p1
);
516 for (i
= 0; i
< len
; i
++)
517 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
522 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
))
524 /* A null type means arg type is not specified.
525 Take whatever the other function type has. */
526 if (TREE_VALUE (p1
) == 0)
528 TREE_VALUE (n
) = TREE_VALUE (p2
);
531 if (TREE_VALUE (p2
) == 0)
533 TREE_VALUE (n
) = TREE_VALUE (p1
);
537 /* Given wait (union {union wait *u; int *i} *)
538 and wait (union wait *),
539 prefer union wait * as type of parm. */
540 if (TREE_CODE (TREE_VALUE (p1
)) == UNION_TYPE
541 && TREE_VALUE (p1
) != TREE_VALUE (p2
))
544 tree mv2
= TREE_VALUE (p2
);
545 if (mv2
&& mv2
!= error_mark_node
546 && TREE_CODE (mv2
) != ARRAY_TYPE
)
547 mv2
= TYPE_MAIN_VARIANT (mv2
);
548 for (memb
= TYPE_FIELDS (TREE_VALUE (p1
));
549 memb
; memb
= DECL_CHAIN (memb
))
551 tree mv3
= TREE_TYPE (memb
);
552 if (mv3
&& mv3
!= error_mark_node
553 && TREE_CODE (mv3
) != ARRAY_TYPE
)
554 mv3
= TYPE_MAIN_VARIANT (mv3
);
555 if (comptypes (mv3
, mv2
))
557 TREE_VALUE (n
) = composite_type (TREE_TYPE (memb
),
559 pedwarn (input_location
, OPT_Wpedantic
,
560 "function types not truly compatible in ISO C");
565 if (TREE_CODE (TREE_VALUE (p2
)) == UNION_TYPE
566 && TREE_VALUE (p2
) != TREE_VALUE (p1
))
569 tree mv1
= TREE_VALUE (p1
);
570 if (mv1
&& mv1
!= error_mark_node
571 && TREE_CODE (mv1
) != ARRAY_TYPE
)
572 mv1
= TYPE_MAIN_VARIANT (mv1
);
573 for (memb
= TYPE_FIELDS (TREE_VALUE (p2
));
574 memb
; memb
= DECL_CHAIN (memb
))
576 tree mv3
= TREE_TYPE (memb
);
577 if (mv3
&& mv3
!= error_mark_node
578 && TREE_CODE (mv3
) != ARRAY_TYPE
)
579 mv3
= TYPE_MAIN_VARIANT (mv3
);
580 if (comptypes (mv3
, mv1
))
582 TREE_VALUE (n
) = composite_type (TREE_TYPE (memb
),
584 pedwarn (input_location
, OPT_Wpedantic
,
585 "function types not truly compatible in ISO C");
590 TREE_VALUE (n
) = composite_type (TREE_VALUE (p1
), TREE_VALUE (p2
));
594 t1
= build_function_type (valtype
, newargs
);
595 t1
= qualify_type (t1
, t2
);
596 /* ... falls through ... */
600 return build_type_attribute_variant (t1
, attributes
);
605 /* Return the type of a conditional expression between pointers to
606 possibly differently qualified versions of compatible types.
608 We assume that comp_target_types has already been done and returned
609 nonzero; if that isn't so, this may crash. */
612 common_pointer_type (tree t1
, tree t2
)
615 tree pointed_to_1
, mv1
;
616 tree pointed_to_2
, mv2
;
618 unsigned target_quals
;
619 addr_space_t as1
, as2
, as_common
;
622 /* Save time if the two types are the same. */
624 if (t1
== t2
) return t1
;
626 /* If one type is nonsense, use the other. */
627 if (t1
== error_mark_node
)
629 if (t2
== error_mark_node
)
632 gcc_assert (TREE_CODE (t1
) == POINTER_TYPE
633 && TREE_CODE (t2
) == POINTER_TYPE
);
635 /* Merge the attributes. */
636 attributes
= targetm
.merge_type_attributes (t1
, t2
);
638 /* Find the composite type of the target types, and combine the
639 qualifiers of the two types' targets. Do not lose qualifiers on
640 array element types by taking the TYPE_MAIN_VARIANT. */
641 mv1
= pointed_to_1
= TREE_TYPE (t1
);
642 mv2
= pointed_to_2
= TREE_TYPE (t2
);
643 if (TREE_CODE (mv1
) != ARRAY_TYPE
)
644 mv1
= TYPE_MAIN_VARIANT (pointed_to_1
);
645 if (TREE_CODE (mv2
) != ARRAY_TYPE
)
646 mv2
= TYPE_MAIN_VARIANT (pointed_to_2
);
647 target
= composite_type (mv1
, mv2
);
649 /* For function types do not merge const qualifiers, but drop them
650 if used inconsistently. The middle-end uses these to mark const
651 and noreturn functions. */
652 quals1
= TYPE_QUALS_NO_ADDR_SPACE (pointed_to_1
);
653 quals2
= TYPE_QUALS_NO_ADDR_SPACE (pointed_to_2
);
655 if (TREE_CODE (pointed_to_1
) == FUNCTION_TYPE
)
656 target_quals
= (quals1
& quals2
);
658 target_quals
= (quals1
| quals2
);
660 /* If the two named address spaces are different, determine the common
661 superset address space. This is guaranteed to exist due to the
662 assumption that comp_target_type returned non-zero. */
663 as1
= TYPE_ADDR_SPACE (pointed_to_1
);
664 as2
= TYPE_ADDR_SPACE (pointed_to_2
);
665 if (!addr_space_superset (as1
, as2
, &as_common
))
668 target_quals
|= ENCODE_QUAL_ADDR_SPACE (as_common
);
670 t1
= build_pointer_type (c_build_qualified_type (target
, target_quals
));
671 return build_type_attribute_variant (t1
, attributes
);
674 /* Return the common type for two arithmetic types under the usual
675 arithmetic conversions. The default conversions have already been
676 applied, and enumerated types converted to their compatible integer
677 types. The resulting type is unqualified and has no attributes.
679 This is the type for the result of most arithmetic operations
680 if the operands have the given two types. */
683 c_common_type (tree t1
, tree t2
)
685 enum tree_code code1
;
686 enum tree_code code2
;
688 /* If one type is nonsense, use the other. */
689 if (t1
== error_mark_node
)
691 if (t2
== error_mark_node
)
694 if (TYPE_QUALS (t1
) != TYPE_UNQUALIFIED
)
695 t1
= TYPE_MAIN_VARIANT (t1
);
697 if (TYPE_QUALS (t2
) != TYPE_UNQUALIFIED
)
698 t2
= TYPE_MAIN_VARIANT (t2
);
700 if (TYPE_ATTRIBUTES (t1
) != NULL_TREE
)
701 t1
= build_type_attribute_variant (t1
, NULL_TREE
);
703 if (TYPE_ATTRIBUTES (t2
) != NULL_TREE
)
704 t2
= build_type_attribute_variant (t2
, NULL_TREE
);
706 /* Save time if the two types are the same. */
708 if (t1
== t2
) return t1
;
710 code1
= TREE_CODE (t1
);
711 code2
= TREE_CODE (t2
);
713 gcc_assert (code1
== VECTOR_TYPE
|| code1
== COMPLEX_TYPE
714 || code1
== FIXED_POINT_TYPE
|| code1
== REAL_TYPE
715 || code1
== INTEGER_TYPE
);
716 gcc_assert (code2
== VECTOR_TYPE
|| code2
== COMPLEX_TYPE
717 || code2
== FIXED_POINT_TYPE
|| code2
== REAL_TYPE
718 || code2
== INTEGER_TYPE
);
720 /* When one operand is a decimal float type, the other operand cannot be
721 a generic float type or a complex type. We also disallow vector types
723 if ((DECIMAL_FLOAT_TYPE_P (t1
) || DECIMAL_FLOAT_TYPE_P (t2
))
724 && !(DECIMAL_FLOAT_TYPE_P (t1
) && DECIMAL_FLOAT_TYPE_P (t2
)))
726 if (code1
== VECTOR_TYPE
|| code2
== VECTOR_TYPE
)
728 error ("can%'t mix operands of decimal float and vector types");
729 return error_mark_node
;
731 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
733 error ("can%'t mix operands of decimal float and complex types");
734 return error_mark_node
;
736 if (code1
== REAL_TYPE
&& code2
== REAL_TYPE
)
738 error ("can%'t mix operands of decimal float and other float types");
739 return error_mark_node
;
743 /* If one type is a vector type, return that type. (How the usual
744 arithmetic conversions apply to the vector types extension is not
745 precisely specified.) */
746 if (code1
== VECTOR_TYPE
)
749 if (code2
== VECTOR_TYPE
)
752 /* If one type is complex, form the common type of the non-complex
753 components, then make that complex. Use T1 or T2 if it is the
755 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
757 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
758 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
759 tree subtype
= c_common_type (subtype1
, subtype2
);
761 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
763 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
766 return build_complex_type (subtype
);
769 /* If only one is real, use it as the result. */
771 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
774 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
777 /* If both are real and either are decimal floating point types, use
778 the decimal floating point type with the greater precision. */
780 if (code1
== REAL_TYPE
&& code2
== REAL_TYPE
)
782 if (TYPE_MAIN_VARIANT (t1
) == dfloat128_type_node
783 || TYPE_MAIN_VARIANT (t2
) == dfloat128_type_node
)
784 return dfloat128_type_node
;
785 else if (TYPE_MAIN_VARIANT (t1
) == dfloat64_type_node
786 || TYPE_MAIN_VARIANT (t2
) == dfloat64_type_node
)
787 return dfloat64_type_node
;
788 else if (TYPE_MAIN_VARIANT (t1
) == dfloat32_type_node
789 || TYPE_MAIN_VARIANT (t2
) == dfloat32_type_node
)
790 return dfloat32_type_node
;
793 /* Deal with fixed-point types. */
794 if (code1
== FIXED_POINT_TYPE
|| code2
== FIXED_POINT_TYPE
)
796 unsigned int unsignedp
= 0, satp
= 0;
797 enum machine_mode m1
, m2
;
798 unsigned int fbit1
, ibit1
, fbit2
, ibit2
, max_fbit
, max_ibit
;
803 /* If one input type is saturating, the result type is saturating. */
804 if (TYPE_SATURATING (t1
) || TYPE_SATURATING (t2
))
807 /* If both fixed-point types are unsigned, the result type is unsigned.
808 When mixing fixed-point and integer types, follow the sign of the
810 Otherwise, the result type is signed. */
811 if ((TYPE_UNSIGNED (t1
) && TYPE_UNSIGNED (t2
)
812 && code1
== FIXED_POINT_TYPE
&& code2
== FIXED_POINT_TYPE
)
813 || (code1
== FIXED_POINT_TYPE
&& code2
!= FIXED_POINT_TYPE
814 && TYPE_UNSIGNED (t1
))
815 || (code1
!= FIXED_POINT_TYPE
&& code2
== FIXED_POINT_TYPE
816 && TYPE_UNSIGNED (t2
)))
819 /* The result type is signed. */
822 /* If the input type is unsigned, we need to convert to the
824 if (code1
== FIXED_POINT_TYPE
&& TYPE_UNSIGNED (t1
))
826 enum mode_class mclass
= (enum mode_class
) 0;
827 if (GET_MODE_CLASS (m1
) == MODE_UFRACT
)
829 else if (GET_MODE_CLASS (m1
) == MODE_UACCUM
)
833 m1
= mode_for_size (GET_MODE_PRECISION (m1
), mclass
, 0);
835 if (code2
== FIXED_POINT_TYPE
&& TYPE_UNSIGNED (t2
))
837 enum mode_class mclass
= (enum mode_class
) 0;
838 if (GET_MODE_CLASS (m2
) == MODE_UFRACT
)
840 else if (GET_MODE_CLASS (m2
) == MODE_UACCUM
)
844 m2
= mode_for_size (GET_MODE_PRECISION (m2
), mclass
, 0);
848 if (code1
== FIXED_POINT_TYPE
)
850 fbit1
= GET_MODE_FBIT (m1
);
851 ibit1
= GET_MODE_IBIT (m1
);
856 /* Signed integers need to subtract one sign bit. */
857 ibit1
= TYPE_PRECISION (t1
) - (!TYPE_UNSIGNED (t1
));
860 if (code2
== FIXED_POINT_TYPE
)
862 fbit2
= GET_MODE_FBIT (m2
);
863 ibit2
= GET_MODE_IBIT (m2
);
868 /* Signed integers need to subtract one sign bit. */
869 ibit2
= TYPE_PRECISION (t2
) - (!TYPE_UNSIGNED (t2
));
872 max_ibit
= ibit1
>= ibit2
? ibit1
: ibit2
;
873 max_fbit
= fbit1
>= fbit2
? fbit1
: fbit2
;
874 return c_common_fixed_point_type_for_size (max_ibit
, max_fbit
, unsignedp
,
878 /* Both real or both integers; use the one with greater precision. */
880 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
882 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
885 /* Same precision. Prefer long longs to longs to ints when the
886 same precision, following the C99 rules on integer type rank
887 (which are equivalent to the C90 rules for C90 types). */
889 if (TYPE_MAIN_VARIANT (t1
) == long_long_unsigned_type_node
890 || TYPE_MAIN_VARIANT (t2
) == long_long_unsigned_type_node
)
891 return long_long_unsigned_type_node
;
893 if (TYPE_MAIN_VARIANT (t1
) == long_long_integer_type_node
894 || TYPE_MAIN_VARIANT (t2
) == long_long_integer_type_node
)
896 if (TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
897 return long_long_unsigned_type_node
;
899 return long_long_integer_type_node
;
902 if (TYPE_MAIN_VARIANT (t1
) == long_unsigned_type_node
903 || TYPE_MAIN_VARIANT (t2
) == long_unsigned_type_node
)
904 return long_unsigned_type_node
;
906 if (TYPE_MAIN_VARIANT (t1
) == long_integer_type_node
907 || TYPE_MAIN_VARIANT (t2
) == long_integer_type_node
)
909 /* But preserve unsignedness from the other type,
910 since long cannot hold all the values of an unsigned int. */
911 if (TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
912 return long_unsigned_type_node
;
914 return long_integer_type_node
;
917 /* Likewise, prefer long double to double even if same size. */
918 if (TYPE_MAIN_VARIANT (t1
) == long_double_type_node
919 || TYPE_MAIN_VARIANT (t2
) == long_double_type_node
)
920 return long_double_type_node
;
922 /* Otherwise prefer the unsigned one. */
924 if (TYPE_UNSIGNED (t1
))
930 /* Wrapper around c_common_type that is used by c-common.c and other
931 front end optimizations that remove promotions. ENUMERAL_TYPEs
932 are allowed here and are converted to their compatible integer types.
933 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
934 preferably a non-Boolean type as the common type. */
936 common_type (tree t1
, tree t2
)
938 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
939 t1
= c_common_type_for_size (TYPE_PRECISION (t1
), 1);
940 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
941 t2
= c_common_type_for_size (TYPE_PRECISION (t2
), 1);
943 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
944 if (TREE_CODE (t1
) == BOOLEAN_TYPE
945 && TREE_CODE (t2
) == BOOLEAN_TYPE
)
946 return boolean_type_node
;
948 /* If either type is BOOLEAN_TYPE, then return the other. */
949 if (TREE_CODE (t1
) == BOOLEAN_TYPE
)
951 if (TREE_CODE (t2
) == BOOLEAN_TYPE
)
954 return c_common_type (t1
, t2
);
957 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
958 or various other operations. Return 2 if they are compatible
959 but a warning may be needed if you use them together. */
962 comptypes (tree type1
, tree type2
)
964 const struct tagged_tu_seen_cache
* tagged_tu_seen_base1
= tagged_tu_seen_base
;
967 val
= comptypes_internal (type1
, type2
, NULL
, NULL
);
968 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1
);
973 /* Like comptypes, but if it returns non-zero because enum and int are
974 compatible, it sets *ENUM_AND_INT_P to true. */
977 comptypes_check_enum_int (tree type1
, tree type2
, bool *enum_and_int_p
)
979 const struct tagged_tu_seen_cache
* tagged_tu_seen_base1
= tagged_tu_seen_base
;
982 val
= comptypes_internal (type1
, type2
, enum_and_int_p
, NULL
);
983 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1
);
988 /* Like comptypes, but if it returns nonzero for different types, it
989 sets *DIFFERENT_TYPES_P to true. */
992 comptypes_check_different_types (tree type1
, tree type2
,
993 bool *different_types_p
)
995 const struct tagged_tu_seen_cache
* tagged_tu_seen_base1
= tagged_tu_seen_base
;
998 val
= comptypes_internal (type1
, type2
, NULL
, different_types_p
);
999 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1
);
1004 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
1005 or various other operations. Return 2 if they are compatible
1006 but a warning may be needed if you use them together. If
1007 ENUM_AND_INT_P is not NULL, and one type is an enum and the other a
1008 compatible integer type, then this sets *ENUM_AND_INT_P to true;
1009 *ENUM_AND_INT_P is never set to false. If DIFFERENT_TYPES_P is not
1010 NULL, and the types are compatible but different enough not to be
1011 permitted in C11 typedef redeclarations, then this sets
1012 *DIFFERENT_TYPES_P to true; *DIFFERENT_TYPES_P is never set to
1013 false, but may or may not be set if the types are incompatible.
1014 This differs from comptypes, in that we don't free the seen
1018 comptypes_internal (const_tree type1
, const_tree type2
, bool *enum_and_int_p
,
1019 bool *different_types_p
)
1021 const_tree t1
= type1
;
1022 const_tree t2
= type2
;
1025 /* Suppress errors caused by previously reported errors. */
1027 if (t1
== t2
|| !t1
|| !t2
1028 || TREE_CODE (t1
) == ERROR_MARK
|| TREE_CODE (t2
) == ERROR_MARK
)
1031 /* Enumerated types are compatible with integer types, but this is
1032 not transitive: two enumerated types in the same translation unit
1033 are compatible with each other only if they are the same type. */
1035 if (TREE_CODE (t1
) == ENUMERAL_TYPE
&& TREE_CODE (t2
) != ENUMERAL_TYPE
)
1037 t1
= c_common_type_for_size (TYPE_PRECISION (t1
), TYPE_UNSIGNED (t1
));
1038 if (TREE_CODE (t2
) != VOID_TYPE
)
1040 if (enum_and_int_p
!= NULL
)
1041 *enum_and_int_p
= true;
1042 if (different_types_p
!= NULL
)
1043 *different_types_p
= true;
1046 else if (TREE_CODE (t2
) == ENUMERAL_TYPE
&& TREE_CODE (t1
) != ENUMERAL_TYPE
)
1048 t2
= c_common_type_for_size (TYPE_PRECISION (t2
), TYPE_UNSIGNED (t2
));
1049 if (TREE_CODE (t1
) != VOID_TYPE
)
1051 if (enum_and_int_p
!= NULL
)
1052 *enum_and_int_p
= true;
1053 if (different_types_p
!= NULL
)
1054 *different_types_p
= true;
1061 /* Different classes of types can't be compatible. */
1063 if (TREE_CODE (t1
) != TREE_CODE (t2
))
1066 /* Qualifiers must match. C99 6.7.3p9 */
1068 if (TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
1071 /* Allow for two different type nodes which have essentially the same
1072 definition. Note that we already checked for equality of the type
1073 qualifiers (just above). */
1075 if (TREE_CODE (t1
) != ARRAY_TYPE
1076 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
1079 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1080 if (!(attrval
= comp_type_attributes (t1
, t2
)))
1083 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1086 switch (TREE_CODE (t1
))
1089 /* Do not remove mode or aliasing information. */
1090 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
1091 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
))
1093 val
= (TREE_TYPE (t1
) == TREE_TYPE (t2
)
1094 ? 1 : comptypes_internal (TREE_TYPE (t1
), TREE_TYPE (t2
),
1095 enum_and_int_p
, different_types_p
));
1099 val
= function_types_compatible_p (t1
, t2
, enum_and_int_p
,
1105 tree d1
= TYPE_DOMAIN (t1
);
1106 tree d2
= TYPE_DOMAIN (t2
);
1107 bool d1_variable
, d2_variable
;
1108 bool d1_zero
, d2_zero
;
1111 /* Target types must match incl. qualifiers. */
1112 if (TREE_TYPE (t1
) != TREE_TYPE (t2
)
1113 && 0 == (val
= comptypes_internal (TREE_TYPE (t1
), TREE_TYPE (t2
),
1115 different_types_p
)))
1118 if (different_types_p
!= NULL
1119 && (d1
== 0) != (d2
== 0))
1120 *different_types_p
= true;
1121 /* Sizes must match unless one is missing or variable. */
1122 if (d1
== 0 || d2
== 0 || d1
== d2
)
1125 d1_zero
= !TYPE_MAX_VALUE (d1
);
1126 d2_zero
= !TYPE_MAX_VALUE (d2
);
1128 d1_variable
= (!d1_zero
1129 && (TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
1130 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
));
1131 d2_variable
= (!d2_zero
1132 && (TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
1133 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
));
1134 d1_variable
= d1_variable
|| (d1_zero
&& c_vla_type_p (t1
));
1135 d2_variable
= d2_variable
|| (d2_zero
&& c_vla_type_p (t2
));
1137 if (different_types_p
!= NULL
1138 && d1_variable
!= d2_variable
)
1139 *different_types_p
= true;
1140 if (d1_variable
|| d2_variable
)
1142 if (d1_zero
&& d2_zero
)
1144 if (d1_zero
|| d2_zero
1145 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
))
1146 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1
), TYPE_MAX_VALUE (d2
)))
1155 if (val
!= 1 && !same_translation_unit_p (t1
, t2
))
1157 tree a1
= TYPE_ATTRIBUTES (t1
);
1158 tree a2
= TYPE_ATTRIBUTES (t2
);
1160 if (! attribute_list_contained (a1
, a2
)
1161 && ! attribute_list_contained (a2
, a1
))
1165 return tagged_types_tu_compatible_p (t1
, t2
, enum_and_int_p
,
1167 val
= tagged_types_tu_compatible_p (t1
, t2
, enum_and_int_p
,
1173 val
= (TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
1174 && comptypes_internal (TREE_TYPE (t1
), TREE_TYPE (t2
),
1175 enum_and_int_p
, different_types_p
));
1181 return attrval
== 2 && val
== 1 ? 2 : val
;
1184 /* Return 1 if TTL and TTR are pointers to types that are equivalent, ignoring
1185 their qualifiers, except for named address spaces. If the pointers point to
1186 different named addresses, then we must determine if one address space is a
1187 subset of the other. */
1190 comp_target_types (location_t location
, tree ttl
, tree ttr
)
1193 tree mvl
= TREE_TYPE (ttl
);
1194 tree mvr
= TREE_TYPE (ttr
);
1195 addr_space_t asl
= TYPE_ADDR_SPACE (mvl
);
1196 addr_space_t asr
= TYPE_ADDR_SPACE (mvr
);
1197 addr_space_t as_common
;
1198 bool enum_and_int_p
;
1200 /* Fail if pointers point to incompatible address spaces. */
1201 if (!addr_space_superset (asl
, asr
, &as_common
))
1204 /* Do not lose qualifiers on element types of array types that are
1205 pointer targets by taking their TYPE_MAIN_VARIANT. */
1206 if (TREE_CODE (mvl
) != ARRAY_TYPE
)
1207 mvl
= TYPE_MAIN_VARIANT (mvl
);
1208 if (TREE_CODE (mvr
) != ARRAY_TYPE
)
1209 mvr
= TYPE_MAIN_VARIANT (mvr
);
1210 enum_and_int_p
= false;
1211 val
= comptypes_check_enum_int (mvl
, mvr
, &enum_and_int_p
);
1214 pedwarn (location
, OPT_Wpedantic
, "types are not quite compatible");
1216 if (val
== 1 && enum_and_int_p
&& warn_cxx_compat
)
1217 warning_at (location
, OPT_Wc___compat
,
1218 "pointer target types incompatible in C++");
1223 /* Subroutines of `comptypes'. */
1225 /* Determine whether two trees derive from the same translation unit.
1226 If the CONTEXT chain ends in a null, that tree's context is still
1227 being parsed, so if two trees have context chains ending in null,
1228 they're in the same translation unit. */
1230 same_translation_unit_p (const_tree t1
, const_tree t2
)
1232 while (t1
&& TREE_CODE (t1
) != TRANSLATION_UNIT_DECL
)
1233 switch (TREE_CODE_CLASS (TREE_CODE (t1
)))
1235 case tcc_declaration
:
1236 t1
= DECL_CONTEXT (t1
); break;
1238 t1
= TYPE_CONTEXT (t1
); break;
1239 case tcc_exceptional
:
1240 t1
= BLOCK_SUPERCONTEXT (t1
); break; /* assume block */
1241 default: gcc_unreachable ();
1244 while (t2
&& TREE_CODE (t2
) != TRANSLATION_UNIT_DECL
)
1245 switch (TREE_CODE_CLASS (TREE_CODE (t2
)))
1247 case tcc_declaration
:
1248 t2
= DECL_CONTEXT (t2
); break;
1250 t2
= TYPE_CONTEXT (t2
); break;
1251 case tcc_exceptional
:
1252 t2
= BLOCK_SUPERCONTEXT (t2
); break; /* assume block */
1253 default: gcc_unreachable ();
1259 /* Allocate the seen two types, assuming that they are compatible. */
1261 static struct tagged_tu_seen_cache
*
1262 alloc_tagged_tu_seen_cache (const_tree t1
, const_tree t2
)
1264 struct tagged_tu_seen_cache
*tu
= XNEW (struct tagged_tu_seen_cache
);
1265 tu
->next
= tagged_tu_seen_base
;
1269 tagged_tu_seen_base
= tu
;
1271 /* The C standard says that two structures in different translation
1272 units are compatible with each other only if the types of their
1273 fields are compatible (among other things). We assume that they
1274 are compatible until proven otherwise when building the cache.
1275 An example where this can occur is:
1280 If we are comparing this against a similar struct in another TU,
1281 and did not assume they were compatible, we end up with an infinite
1287 /* Free the seen types until we get to TU_TIL. */
1290 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache
*tu_til
)
1292 const struct tagged_tu_seen_cache
*tu
= tagged_tu_seen_base
;
1293 while (tu
!= tu_til
)
1295 const struct tagged_tu_seen_cache
*const tu1
1296 = (const struct tagged_tu_seen_cache
*) tu
;
1298 free (CONST_CAST (struct tagged_tu_seen_cache
*, tu1
));
1300 tagged_tu_seen_base
= tu_til
;
1303 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1304 compatible. If the two types are not the same (which has been
1305 checked earlier), this can only happen when multiple translation
1306 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1307 rules. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1308 comptypes_internal. */
1311 tagged_types_tu_compatible_p (const_tree t1
, const_tree t2
,
1312 bool *enum_and_int_p
, bool *different_types_p
)
1315 bool needs_warning
= false;
1317 /* We have to verify that the tags of the types are the same. This
1318 is harder than it looks because this may be a typedef, so we have
1319 to go look at the original type. It may even be a typedef of a
1321 In the case of compiler-created builtin structs the TYPE_DECL
1322 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1323 while (TYPE_NAME (t1
)
1324 && TREE_CODE (TYPE_NAME (t1
)) == TYPE_DECL
1325 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1
)))
1326 t1
= DECL_ORIGINAL_TYPE (TYPE_NAME (t1
));
1328 while (TYPE_NAME (t2
)
1329 && TREE_CODE (TYPE_NAME (t2
)) == TYPE_DECL
1330 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2
)))
1331 t2
= DECL_ORIGINAL_TYPE (TYPE_NAME (t2
));
1333 /* C90 didn't have the requirement that the two tags be the same. */
1334 if (flag_isoc99
&& TYPE_NAME (t1
) != TYPE_NAME (t2
))
1337 /* C90 didn't say what happened if one or both of the types were
1338 incomplete; we choose to follow C99 rules here, which is that they
1340 if (TYPE_SIZE (t1
) == NULL
1341 || TYPE_SIZE (t2
) == NULL
)
1345 const struct tagged_tu_seen_cache
* tts_i
;
1346 for (tts_i
= tagged_tu_seen_base
; tts_i
!= NULL
; tts_i
= tts_i
->next
)
1347 if (tts_i
->t1
== t1
&& tts_i
->t2
== t2
)
1351 switch (TREE_CODE (t1
))
1355 struct tagged_tu_seen_cache
*tu
= alloc_tagged_tu_seen_cache (t1
, t2
);
1356 /* Speed up the case where the type values are in the same order. */
1357 tree tv1
= TYPE_VALUES (t1
);
1358 tree tv2
= TYPE_VALUES (t2
);
1365 for (;tv1
&& tv2
; tv1
= TREE_CHAIN (tv1
), tv2
= TREE_CHAIN (tv2
))
1367 if (TREE_PURPOSE (tv1
) != TREE_PURPOSE (tv2
))
1369 if (simple_cst_equal (TREE_VALUE (tv1
), TREE_VALUE (tv2
)) != 1)
1376 if (tv1
== NULL_TREE
&& tv2
== NULL_TREE
)
1380 if (tv1
== NULL_TREE
|| tv2
== NULL_TREE
)
1386 if (list_length (TYPE_VALUES (t1
)) != list_length (TYPE_VALUES (t2
)))
1392 for (s1
= TYPE_VALUES (t1
); s1
; s1
= TREE_CHAIN (s1
))
1394 s2
= purpose_member (TREE_PURPOSE (s1
), TYPE_VALUES (t2
));
1396 || simple_cst_equal (TREE_VALUE (s1
), TREE_VALUE (s2
)) != 1)
1407 struct tagged_tu_seen_cache
*tu
= alloc_tagged_tu_seen_cache (t1
, t2
);
1408 if (list_length (TYPE_FIELDS (t1
)) != list_length (TYPE_FIELDS (t2
)))
1414 /* Speed up the common case where the fields are in the same order. */
1415 for (s1
= TYPE_FIELDS (t1
), s2
= TYPE_FIELDS (t2
); s1
&& s2
;
1416 s1
= DECL_CHAIN (s1
), s2
= DECL_CHAIN (s2
))
1420 if (DECL_NAME (s1
) != DECL_NAME (s2
))
1422 result
= comptypes_internal (TREE_TYPE (s1
), TREE_TYPE (s2
),
1423 enum_and_int_p
, different_types_p
);
1425 if (result
!= 1 && !DECL_NAME (s1
))
1433 needs_warning
= true;
1435 if (TREE_CODE (s1
) == FIELD_DECL
1436 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
1437 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
1445 tu
->val
= needs_warning
? 2 : 1;
1449 for (s1
= TYPE_FIELDS (t1
); s1
; s1
= DECL_CHAIN (s1
))
1453 for (s2
= TYPE_FIELDS (t2
); s2
; s2
= DECL_CHAIN (s2
))
1454 if (DECL_NAME (s1
) == DECL_NAME (s2
))
1458 result
= comptypes_internal (TREE_TYPE (s1
), TREE_TYPE (s2
),
1462 if (result
!= 1 && !DECL_NAME (s1
))
1470 needs_warning
= true;
1472 if (TREE_CODE (s1
) == FIELD_DECL
1473 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
1474 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
1486 tu
->val
= needs_warning
? 2 : 10;
1492 struct tagged_tu_seen_cache
*tu
= alloc_tagged_tu_seen_cache (t1
, t2
);
1494 for (s1
= TYPE_FIELDS (t1
), s2
= TYPE_FIELDS (t2
);
1496 s1
= DECL_CHAIN (s1
), s2
= DECL_CHAIN (s2
))
1499 if (TREE_CODE (s1
) != TREE_CODE (s2
)
1500 || DECL_NAME (s1
) != DECL_NAME (s2
))
1502 result
= comptypes_internal (TREE_TYPE (s1
), TREE_TYPE (s2
),
1503 enum_and_int_p
, different_types_p
);
1507 needs_warning
= true;
1509 if (TREE_CODE (s1
) == FIELD_DECL
1510 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
1511 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
1517 tu
->val
= needs_warning
? 2 : 1;
1526 /* Return 1 if two function types F1 and F2 are compatible.
1527 If either type specifies no argument types,
1528 the other must specify a fixed number of self-promoting arg types.
1529 Otherwise, if one type specifies only the number of arguments,
1530 the other must specify that number of self-promoting arg types.
1531 Otherwise, the argument types must match.
1532 ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in comptypes_internal. */
1535 function_types_compatible_p (const_tree f1
, const_tree f2
,
1536 bool *enum_and_int_p
, bool *different_types_p
)
1539 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1544 ret1
= TREE_TYPE (f1
);
1545 ret2
= TREE_TYPE (f2
);
1547 /* 'volatile' qualifiers on a function's return type used to mean
1548 the function is noreturn. */
1549 if (TYPE_VOLATILE (ret1
) != TYPE_VOLATILE (ret2
))
1550 pedwarn (input_location
, 0, "function return types not compatible due to %<volatile%>");
1551 if (TYPE_VOLATILE (ret1
))
1552 ret1
= build_qualified_type (TYPE_MAIN_VARIANT (ret1
),
1553 TYPE_QUALS (ret1
) & ~TYPE_QUAL_VOLATILE
);
1554 if (TYPE_VOLATILE (ret2
))
1555 ret2
= build_qualified_type (TYPE_MAIN_VARIANT (ret2
),
1556 TYPE_QUALS (ret2
) & ~TYPE_QUAL_VOLATILE
);
1557 val
= comptypes_internal (ret1
, ret2
, enum_and_int_p
, different_types_p
);
1561 args1
= TYPE_ARG_TYPES (f1
);
1562 args2
= TYPE_ARG_TYPES (f2
);
1564 if (different_types_p
!= NULL
1565 && (args1
== 0) != (args2
== 0))
1566 *different_types_p
= true;
1568 /* An unspecified parmlist matches any specified parmlist
1569 whose argument types don't need default promotions. */
1573 if (!self_promoting_args_p (args2
))
1575 /* If one of these types comes from a non-prototype fn definition,
1576 compare that with the other type's arglist.
1577 If they don't match, ask for a warning (but no error). */
1578 if (TYPE_ACTUAL_ARG_TYPES (f1
)
1579 && 1 != type_lists_compatible_p (args2
, TYPE_ACTUAL_ARG_TYPES (f1
),
1580 enum_and_int_p
, different_types_p
))
1586 if (!self_promoting_args_p (args1
))
1588 if (TYPE_ACTUAL_ARG_TYPES (f2
)
1589 && 1 != type_lists_compatible_p (args1
, TYPE_ACTUAL_ARG_TYPES (f2
),
1590 enum_and_int_p
, different_types_p
))
1595 /* Both types have argument lists: compare them and propagate results. */
1596 val1
= type_lists_compatible_p (args1
, args2
, enum_and_int_p
,
1598 return val1
!= 1 ? val1
: val
;
1601 /* Check two lists of types for compatibility, returning 0 for
1602 incompatible, 1 for compatible, or 2 for compatible with
1603 warning. ENUM_AND_INT_P and DIFFERENT_TYPES_P are as in
1604 comptypes_internal. */
1607 type_lists_compatible_p (const_tree args1
, const_tree args2
,
1608 bool *enum_and_int_p
, bool *different_types_p
)
1610 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1616 tree a1
, mv1
, a2
, mv2
;
1617 if (args1
== 0 && args2
== 0)
1619 /* If one list is shorter than the other,
1620 they fail to match. */
1621 if (args1
== 0 || args2
== 0)
1623 mv1
= a1
= TREE_VALUE (args1
);
1624 mv2
= a2
= TREE_VALUE (args2
);
1625 if (mv1
&& mv1
!= error_mark_node
&& TREE_CODE (mv1
) != ARRAY_TYPE
)
1626 mv1
= TYPE_MAIN_VARIANT (mv1
);
1627 if (mv2
&& mv2
!= error_mark_node
&& TREE_CODE (mv2
) != ARRAY_TYPE
)
1628 mv2
= TYPE_MAIN_VARIANT (mv2
);
1629 /* A null pointer instead of a type
1630 means there is supposed to be an argument
1631 but nothing is specified about what type it has.
1632 So match anything that self-promotes. */
1633 if (different_types_p
!= NULL
1634 && (a1
== 0) != (a2
== 0))
1635 *different_types_p
= true;
1638 if (c_type_promotes_to (a2
) != a2
)
1643 if (c_type_promotes_to (a1
) != a1
)
1646 /* If one of the lists has an error marker, ignore this arg. */
1647 else if (TREE_CODE (a1
) == ERROR_MARK
1648 || TREE_CODE (a2
) == ERROR_MARK
)
1650 else if (!(newval
= comptypes_internal (mv1
, mv2
, enum_and_int_p
,
1651 different_types_p
)))
1653 if (different_types_p
!= NULL
)
1654 *different_types_p
= true;
1655 /* Allow wait (union {union wait *u; int *i} *)
1656 and wait (union wait *) to be compatible. */
1657 if (TREE_CODE (a1
) == UNION_TYPE
1658 && (TYPE_NAME (a1
) == 0
1659 || TYPE_TRANSPARENT_AGGR (a1
))
1660 && TREE_CODE (TYPE_SIZE (a1
)) == INTEGER_CST
1661 && tree_int_cst_equal (TYPE_SIZE (a1
),
1665 for (memb
= TYPE_FIELDS (a1
);
1666 memb
; memb
= DECL_CHAIN (memb
))
1668 tree mv3
= TREE_TYPE (memb
);
1669 if (mv3
&& mv3
!= error_mark_node
1670 && TREE_CODE (mv3
) != ARRAY_TYPE
)
1671 mv3
= TYPE_MAIN_VARIANT (mv3
);
1672 if (comptypes_internal (mv3
, mv2
, enum_and_int_p
,
1679 else if (TREE_CODE (a2
) == UNION_TYPE
1680 && (TYPE_NAME (a2
) == 0
1681 || TYPE_TRANSPARENT_AGGR (a2
))
1682 && TREE_CODE (TYPE_SIZE (a2
)) == INTEGER_CST
1683 && tree_int_cst_equal (TYPE_SIZE (a2
),
1687 for (memb
= TYPE_FIELDS (a2
);
1688 memb
; memb
= DECL_CHAIN (memb
))
1690 tree mv3
= TREE_TYPE (memb
);
1691 if (mv3
&& mv3
!= error_mark_node
1692 && TREE_CODE (mv3
) != ARRAY_TYPE
)
1693 mv3
= TYPE_MAIN_VARIANT (mv3
);
1694 if (comptypes_internal (mv3
, mv1
, enum_and_int_p
,
1705 /* comptypes said ok, but record if it said to warn. */
1709 args1
= TREE_CHAIN (args1
);
1710 args2
= TREE_CHAIN (args2
);
1714 /* Compute the size to increment a pointer by. */
1717 c_size_in_bytes (const_tree type
)
1719 enum tree_code code
= TREE_CODE (type
);
1721 if (code
== FUNCTION_TYPE
|| code
== VOID_TYPE
|| code
== ERROR_MARK
)
1722 return size_one_node
;
1724 if (!COMPLETE_OR_VOID_TYPE_P (type
))
1726 error ("arithmetic on pointer to an incomplete type");
1727 return size_one_node
;
1730 /* Convert in case a char is more than one unit. */
1731 return size_binop_loc (input_location
, CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
1732 size_int (TYPE_PRECISION (char_type_node
)
1736 /* Return either DECL or its known constant value (if it has one). */
1739 decl_constant_value (tree decl
)
1741 if (/* Don't change a variable array bound or initial value to a constant
1742 in a place where a variable is invalid. Note that DECL_INITIAL
1743 isn't valid for a PARM_DECL. */
1744 current_function_decl
!= 0
1745 && TREE_CODE (decl
) != PARM_DECL
1746 && !TREE_THIS_VOLATILE (decl
)
1747 && TREE_READONLY (decl
)
1748 && DECL_INITIAL (decl
) != 0
1749 && TREE_CODE (DECL_INITIAL (decl
)) != ERROR_MARK
1750 /* This is invalid if initial value is not constant.
1751 If it has either a function call, a memory reference,
1752 or a variable, then re-evaluating it could give different results. */
1753 && TREE_CONSTANT (DECL_INITIAL (decl
))
1754 /* Check for cases where this is sub-optimal, even though valid. */
1755 && TREE_CODE (DECL_INITIAL (decl
)) != CONSTRUCTOR
)
1756 return DECL_INITIAL (decl
);
1760 /* Convert the array expression EXP to a pointer. */
1762 array_to_pointer_conversion (location_t loc
, tree exp
)
1764 tree orig_exp
= exp
;
1765 tree type
= TREE_TYPE (exp
);
1767 tree restype
= TREE_TYPE (type
);
1770 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
1772 STRIP_TYPE_NOPS (exp
);
1774 if (TREE_NO_WARNING (orig_exp
))
1775 TREE_NO_WARNING (exp
) = 1;
1777 ptrtype
= build_pointer_type (restype
);
1779 if (TREE_CODE (exp
) == INDIRECT_REF
)
1780 return convert (ptrtype
, TREE_OPERAND (exp
, 0));
1782 /* In C++ array compound literals are temporary objects unless they are
1783 const or appear in namespace scope, so they are destroyed too soon
1784 to use them for much of anything (c++/53220). */
1785 if (warn_cxx_compat
&& TREE_CODE (exp
) == COMPOUND_LITERAL_EXPR
)
1787 tree decl
= TREE_OPERAND (TREE_OPERAND (exp
, 0), 0);
1788 if (!TREE_READONLY (decl
) && !TREE_STATIC (decl
))
1789 warning_at (DECL_SOURCE_LOCATION (decl
), OPT_Wc___compat
,
1790 "converting an array compound literal to a pointer "
1791 "is ill-formed in C++");
1794 adr
= build_unary_op (loc
, ADDR_EXPR
, exp
, 1);
1795 return convert (ptrtype
, adr
);
1798 /* Convert the function expression EXP to a pointer. */
1800 function_to_pointer_conversion (location_t loc
, tree exp
)
1802 tree orig_exp
= exp
;
1804 gcc_assert (TREE_CODE (TREE_TYPE (exp
)) == FUNCTION_TYPE
);
1806 STRIP_TYPE_NOPS (exp
);
1808 if (TREE_NO_WARNING (orig_exp
))
1809 TREE_NO_WARNING (exp
) = 1;
1811 return build_unary_op (loc
, ADDR_EXPR
, exp
, 0);
1814 /* Mark EXP as read, not just set, for set but not used -Wunused
1815 warning purposes. */
1818 mark_exp_read (tree exp
)
1820 switch (TREE_CODE (exp
))
1824 DECL_READ_P (exp
) = 1;
1833 mark_exp_read (TREE_OPERAND (exp
, 0));
1836 case C_MAYBE_CONST_EXPR
:
1837 mark_exp_read (TREE_OPERAND (exp
, 1));
1844 /* Perform the default conversion of arrays and functions to pointers.
1845 Return the result of converting EXP. For any other expression, just
1848 LOC is the location of the expression. */
1851 default_function_array_conversion (location_t loc
, struct c_expr exp
)
1853 tree orig_exp
= exp
.value
;
1854 tree type
= TREE_TYPE (exp
.value
);
1855 enum tree_code code
= TREE_CODE (type
);
1861 bool not_lvalue
= false;
1862 bool lvalue_array_p
;
1864 while ((TREE_CODE (exp
.value
) == NON_LVALUE_EXPR
1865 || CONVERT_EXPR_P (exp
.value
))
1866 && TREE_TYPE (TREE_OPERAND (exp
.value
, 0)) == type
)
1868 if (TREE_CODE (exp
.value
) == NON_LVALUE_EXPR
)
1870 exp
.value
= TREE_OPERAND (exp
.value
, 0);
1873 if (TREE_NO_WARNING (orig_exp
))
1874 TREE_NO_WARNING (exp
.value
) = 1;
1876 lvalue_array_p
= !not_lvalue
&& lvalue_p (exp
.value
);
1877 if (!flag_isoc99
&& !lvalue_array_p
)
1879 /* Before C99, non-lvalue arrays do not decay to pointers.
1880 Normally, using such an array would be invalid; but it can
1881 be used correctly inside sizeof or as a statement expression.
1882 Thus, do not give an error here; an error will result later. */
1886 exp
.value
= array_to_pointer_conversion (loc
, exp
.value
);
1890 exp
.value
= function_to_pointer_conversion (loc
, exp
.value
);
1900 default_function_array_read_conversion (location_t loc
, struct c_expr exp
)
1902 mark_exp_read (exp
.value
);
1903 return default_function_array_conversion (loc
, exp
);
1906 /* EXP is an expression of integer type. Apply the integer promotions
1907 to it and return the promoted value. */
1910 perform_integral_promotions (tree exp
)
1912 tree type
= TREE_TYPE (exp
);
1913 enum tree_code code
= TREE_CODE (type
);
1915 gcc_assert (INTEGRAL_TYPE_P (type
));
1917 /* Normally convert enums to int,
1918 but convert wide enums to something wider. */
1919 if (code
== ENUMERAL_TYPE
)
1921 type
= c_common_type_for_size (MAX (TYPE_PRECISION (type
),
1922 TYPE_PRECISION (integer_type_node
)),
1923 ((TYPE_PRECISION (type
)
1924 >= TYPE_PRECISION (integer_type_node
))
1925 && TYPE_UNSIGNED (type
)));
1927 return convert (type
, exp
);
1930 /* ??? This should no longer be needed now bit-fields have their
1932 if (TREE_CODE (exp
) == COMPONENT_REF
1933 && DECL_C_BIT_FIELD (TREE_OPERAND (exp
, 1))
1934 /* If it's thinner than an int, promote it like a
1935 c_promoting_integer_type_p, otherwise leave it alone. */
1936 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp
, 1)),
1937 TYPE_PRECISION (integer_type_node
)))
1938 return convert (integer_type_node
, exp
);
1940 if (c_promoting_integer_type_p (type
))
1942 /* Preserve unsignedness if not really getting any wider. */
1943 if (TYPE_UNSIGNED (type
)
1944 && TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
))
1945 return convert (unsigned_type_node
, exp
);
1947 return convert (integer_type_node
, exp
);
1954 /* Perform default promotions for C data used in expressions.
1955 Enumeral types or short or char are converted to int.
1956 In addition, manifest constants symbols are replaced by their values. */
1959 default_conversion (tree exp
)
1962 tree type
= TREE_TYPE (exp
);
1963 enum tree_code code
= TREE_CODE (type
);
1966 mark_exp_read (exp
);
1968 /* Functions and arrays have been converted during parsing. */
1969 gcc_assert (code
!= FUNCTION_TYPE
);
1970 if (code
== ARRAY_TYPE
)
1973 /* Constants can be used directly unless they're not loadable. */
1974 if (TREE_CODE (exp
) == CONST_DECL
)
1975 exp
= DECL_INITIAL (exp
);
1977 /* Strip no-op conversions. */
1979 STRIP_TYPE_NOPS (exp
);
1981 if (TREE_NO_WARNING (orig_exp
))
1982 TREE_NO_WARNING (exp
) = 1;
1984 if (code
== VOID_TYPE
)
1986 error ("void value not ignored as it ought to be");
1987 return error_mark_node
;
1990 exp
= require_complete_type (exp
);
1991 if (exp
== error_mark_node
)
1992 return error_mark_node
;
1994 promoted_type
= targetm
.promoted_type (type
);
1996 return convert (promoted_type
, exp
);
1998 if (INTEGRAL_TYPE_P (type
))
1999 return perform_integral_promotions (exp
);
2004 /* Look up COMPONENT in a structure or union TYPE.
2006 If the component name is not found, returns NULL_TREE. Otherwise,
2007 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
2008 stepping down the chain to the component, which is in the last
2009 TREE_VALUE of the list. Normally the list is of length one, but if
2010 the component is embedded within (nested) anonymous structures or
2011 unions, the list steps down the chain to the component. */
2014 lookup_field (tree type
, tree component
)
2018 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
2019 to the field elements. Use a binary search on this array to quickly
2020 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
2021 will always be set for structures which have many elements. */
2023 if (TYPE_LANG_SPECIFIC (type
) && TYPE_LANG_SPECIFIC (type
)->s
)
2026 tree
*field_array
= &TYPE_LANG_SPECIFIC (type
)->s
->elts
[0];
2028 field
= TYPE_FIELDS (type
);
2030 top
= TYPE_LANG_SPECIFIC (type
)->s
->len
;
2031 while (top
- bot
> 1)
2033 half
= (top
- bot
+ 1) >> 1;
2034 field
= field_array
[bot
+half
];
2036 if (DECL_NAME (field
) == NULL_TREE
)
2038 /* Step through all anon unions in linear fashion. */
2039 while (DECL_NAME (field_array
[bot
]) == NULL_TREE
)
2041 field
= field_array
[bot
++];
2042 if (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
2043 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
2045 tree anon
= lookup_field (TREE_TYPE (field
), component
);
2048 return tree_cons (NULL_TREE
, field
, anon
);
2050 /* The Plan 9 compiler permits referring
2051 directly to an anonymous struct/union field
2052 using a typedef name. */
2053 if (flag_plan9_extensions
2054 && TYPE_NAME (TREE_TYPE (field
)) != NULL_TREE
2055 && (TREE_CODE (TYPE_NAME (TREE_TYPE (field
)))
2057 && (DECL_NAME (TYPE_NAME (TREE_TYPE (field
)))
2063 /* Entire record is only anon unions. */
2067 /* Restart the binary search, with new lower bound. */
2071 if (DECL_NAME (field
) == component
)
2073 if (DECL_NAME (field
) < component
)
2079 if (DECL_NAME (field_array
[bot
]) == component
)
2080 field
= field_array
[bot
];
2081 else if (DECL_NAME (field
) != component
)
2086 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
2088 if (DECL_NAME (field
) == NULL_TREE
2089 && (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
2090 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
))
2092 tree anon
= lookup_field (TREE_TYPE (field
), component
);
2095 return tree_cons (NULL_TREE
, field
, anon
);
2097 /* The Plan 9 compiler permits referring directly to an
2098 anonymous struct/union field using a typedef
2100 if (flag_plan9_extensions
2101 && TYPE_NAME (TREE_TYPE (field
)) != NULL_TREE
2102 && TREE_CODE (TYPE_NAME (TREE_TYPE (field
))) == TYPE_DECL
2103 && (DECL_NAME (TYPE_NAME (TREE_TYPE (field
)))
2108 if (DECL_NAME (field
) == component
)
2112 if (field
== NULL_TREE
)
2116 return tree_cons (NULL_TREE
, field
, NULL_TREE
);
2119 /* Make an expression to refer to the COMPONENT field of structure or
2120 union value DATUM. COMPONENT is an IDENTIFIER_NODE. LOC is the
2121 location of the COMPONENT_REF. */
2124 build_component_ref (location_t loc
, tree datum
, tree component
)
2126 tree type
= TREE_TYPE (datum
);
2127 enum tree_code code
= TREE_CODE (type
);
2130 bool datum_lvalue
= lvalue_p (datum
);
2132 if (!objc_is_public (datum
, component
))
2133 return error_mark_node
;
2135 /* Detect Objective-C property syntax object.property. */
2136 if (c_dialect_objc ()
2137 && (ref
= objc_maybe_build_component_ref (datum
, component
)))
2140 /* See if there is a field or component with name COMPONENT. */
2142 if (code
== RECORD_TYPE
|| code
== UNION_TYPE
)
2144 if (!COMPLETE_TYPE_P (type
))
2146 c_incomplete_type_error (NULL_TREE
, type
);
2147 return error_mark_node
;
2150 field
= lookup_field (type
, component
);
2154 error_at (loc
, "%qT has no member named %qE", type
, component
);
2155 return error_mark_node
;
2158 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
2159 This might be better solved in future the way the C++ front
2160 end does it - by giving the anonymous entities each a
2161 separate name and type, and then have build_component_ref
2162 recursively call itself. We can't do that here. */
2165 tree subdatum
= TREE_VALUE (field
);
2168 bool use_datum_quals
;
2170 if (TREE_TYPE (subdatum
) == error_mark_node
)
2171 return error_mark_node
;
2173 /* If this is an rvalue, it does not have qualifiers in C
2174 standard terms and we must avoid propagating such
2175 qualifiers down to a non-lvalue array that is then
2176 converted to a pointer. */
2177 use_datum_quals
= (datum_lvalue
2178 || TREE_CODE (TREE_TYPE (subdatum
)) != ARRAY_TYPE
);
2180 quals
= TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum
)));
2181 if (use_datum_quals
)
2182 quals
|= TYPE_QUALS (TREE_TYPE (datum
));
2183 subtype
= c_build_qualified_type (TREE_TYPE (subdatum
), quals
);
2185 ref
= build3 (COMPONENT_REF
, subtype
, datum
, subdatum
,
2187 SET_EXPR_LOCATION (ref
, loc
);
2188 if (TREE_READONLY (subdatum
)
2189 || (use_datum_quals
&& TREE_READONLY (datum
)))
2190 TREE_READONLY (ref
) = 1;
2191 if (TREE_THIS_VOLATILE (subdatum
)
2192 || (use_datum_quals
&& TREE_THIS_VOLATILE (datum
)))
2193 TREE_THIS_VOLATILE (ref
) = 1;
2195 if (TREE_DEPRECATED (subdatum
))
2196 warn_deprecated_use (subdatum
, NULL_TREE
);
2200 field
= TREE_CHAIN (field
);
2206 else if (code
!= ERROR_MARK
)
2208 "request for member %qE in something not a structure or union",
2211 return error_mark_node
;
2214 /* Given an expression PTR for a pointer, return an expression
2215 for the value pointed to.
2216 ERRORSTRING is the name of the operator to appear in error messages.
2218 LOC is the location to use for the generated tree. */
2221 build_indirect_ref (location_t loc
, tree ptr
, ref_operator errstring
)
2223 tree pointer
= default_conversion (ptr
);
2224 tree type
= TREE_TYPE (pointer
);
2227 if (TREE_CODE (type
) == POINTER_TYPE
)
2229 if (CONVERT_EXPR_P (pointer
)
2230 || TREE_CODE (pointer
) == VIEW_CONVERT_EXPR
)
2232 /* If a warning is issued, mark it to avoid duplicates from
2233 the backend. This only needs to be done at
2234 warn_strict_aliasing > 2. */
2235 if (warn_strict_aliasing
> 2)
2236 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer
, 0)),
2237 type
, TREE_OPERAND (pointer
, 0)))
2238 TREE_NO_WARNING (pointer
) = 1;
2241 if (TREE_CODE (pointer
) == ADDR_EXPR
2242 && (TREE_TYPE (TREE_OPERAND (pointer
, 0))
2243 == TREE_TYPE (type
)))
2245 ref
= TREE_OPERAND (pointer
, 0);
2246 protected_set_expr_location (ref
, loc
);
2251 tree t
= TREE_TYPE (type
);
2253 ref
= build1 (INDIRECT_REF
, t
, pointer
);
2255 if (!COMPLETE_OR_VOID_TYPE_P (t
) && TREE_CODE (t
) != ARRAY_TYPE
)
2257 error_at (loc
, "dereferencing pointer to incomplete type");
2258 return error_mark_node
;
2260 if (VOID_TYPE_P (t
) && c_inhibit_evaluation_warnings
== 0)
2261 warning_at (loc
, 0, "dereferencing %<void *%> pointer");
2263 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2264 so that we get the proper error message if the result is used
2265 to assign to. Also, &* is supposed to be a no-op.
2266 And ANSI C seems to specify that the type of the result
2267 should be the const type. */
2268 /* A de-reference of a pointer to const is not a const. It is valid
2269 to change it via some other pointer. */
2270 TREE_READONLY (ref
) = TYPE_READONLY (t
);
2271 TREE_SIDE_EFFECTS (ref
)
2272 = TYPE_VOLATILE (t
) || TREE_SIDE_EFFECTS (pointer
);
2273 TREE_THIS_VOLATILE (ref
) = TYPE_VOLATILE (t
);
2274 protected_set_expr_location (ref
, loc
);
2278 else if (TREE_CODE (pointer
) != ERROR_MARK
)
2279 invalid_indirection_error (loc
, type
, errstring
);
2281 return error_mark_node
;
2284 /* This handles expressions of the form "a[i]", which denotes
2287 This is logically equivalent in C to *(a+i), but we may do it differently.
2288 If A is a variable or a member, we generate a primitive ARRAY_REF.
2289 This avoids forcing the array out of registers, and can work on
2290 arrays that are not lvalues (for example, members of structures returned
2293 For vector types, allow vector[i] but not i[vector], and create
2294 *(((type*)&vectortype) + i) for the expression.
2296 LOC is the location to use for the returned expression. */
2299 build_array_ref (location_t loc
, tree array
, tree index
)
2302 bool swapped
= false;
2303 if (TREE_TYPE (array
) == error_mark_node
2304 || TREE_TYPE (index
) == error_mark_node
)
2305 return error_mark_node
;
2307 if (flag_enable_cilkplus
&& contains_array_notation_expr (index
))
2310 if (!find_rank (loc
, index
, index
, true, &rank
))
2311 return error_mark_node
;
2314 error_at (loc
, "rank of the array's index is greater than 1");
2315 return error_mark_node
;
2318 if (TREE_CODE (TREE_TYPE (array
)) != ARRAY_TYPE
2319 && TREE_CODE (TREE_TYPE (array
)) != POINTER_TYPE
2320 /* Allow vector[index] but not index[vector]. */
2321 && TREE_CODE (TREE_TYPE (array
)) != VECTOR_TYPE
)
2324 if (TREE_CODE (TREE_TYPE (index
)) != ARRAY_TYPE
2325 && TREE_CODE (TREE_TYPE (index
)) != POINTER_TYPE
)
2328 "subscripted value is neither array nor pointer nor vector");
2330 return error_mark_node
;
2338 if (!INTEGRAL_TYPE_P (TREE_TYPE (index
)))
2340 error_at (loc
, "array subscript is not an integer");
2341 return error_mark_node
;
2344 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array
))) == FUNCTION_TYPE
)
2346 error_at (loc
, "subscripted value is pointer to function");
2347 return error_mark_node
;
2350 /* ??? Existing practice has been to warn only when the char
2351 index is syntactically the index, not for char[array]. */
2353 warn_array_subscript_with_type_char (index
);
2355 /* Apply default promotions *after* noticing character types. */
2356 index
= default_conversion (index
);
2358 gcc_assert (TREE_CODE (TREE_TYPE (index
)) == INTEGER_TYPE
);
2360 convert_vector_to_pointer_for_subscript (loc
, &array
, index
);
2362 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2366 /* An array that is indexed by a non-constant
2367 cannot be stored in a register; we must be able to do
2368 address arithmetic on its address.
2369 Likewise an array of elements of variable size. */
2370 if (TREE_CODE (index
) != INTEGER_CST
2371 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2372 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
)))) != INTEGER_CST
))
2374 if (!c_mark_addressable (array
))
2375 return error_mark_node
;
2377 /* An array that is indexed by a constant value which is not within
2378 the array bounds cannot be stored in a register either; because we
2379 would get a crash in store_bit_field/extract_bit_field when trying
2380 to access a non-existent part of the register. */
2381 if (TREE_CODE (index
) == INTEGER_CST
2382 && TYPE_DOMAIN (TREE_TYPE (array
))
2383 && !int_fits_type_p (index
, TYPE_DOMAIN (TREE_TYPE (array
))))
2385 if (!c_mark_addressable (array
))
2386 return error_mark_node
;
2392 while (TREE_CODE (foo
) == COMPONENT_REF
)
2393 foo
= TREE_OPERAND (foo
, 0);
2394 if (TREE_CODE (foo
) == VAR_DECL
&& C_DECL_REGISTER (foo
))
2395 pedwarn (loc
, OPT_Wpedantic
,
2396 "ISO C forbids subscripting %<register%> array");
2397 else if (!flag_isoc99
&& !lvalue_p (foo
))
2398 pedwarn (loc
, OPT_Wpedantic
,
2399 "ISO C90 forbids subscripting non-lvalue array");
2402 type
= TREE_TYPE (TREE_TYPE (array
));
2403 rval
= build4 (ARRAY_REF
, type
, array
, index
, NULL_TREE
, NULL_TREE
);
2404 /* Array ref is const/volatile if the array elements are
2405 or if the array is. */
2406 TREE_READONLY (rval
)
2407 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array
)))
2408 | TREE_READONLY (array
));
2409 TREE_SIDE_EFFECTS (rval
)
2410 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
2411 | TREE_SIDE_EFFECTS (array
));
2412 TREE_THIS_VOLATILE (rval
)
2413 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
2414 /* This was added by rms on 16 Nov 91.
2415 It fixes vol struct foo *a; a->elts[1]
2416 in an inline function.
2417 Hope it doesn't break something else. */
2418 | TREE_THIS_VOLATILE (array
));
2419 ret
= require_complete_type (rval
);
2420 protected_set_expr_location (ret
, loc
);
2425 tree ar
= default_conversion (array
);
2427 if (ar
== error_mark_node
)
2430 gcc_assert (TREE_CODE (TREE_TYPE (ar
)) == POINTER_TYPE
);
2431 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar
))) != FUNCTION_TYPE
);
2433 return build_indirect_ref
2434 (loc
, build_binary_op (loc
, PLUS_EXPR
, ar
, index
, 0),
2439 /* Build an external reference to identifier ID. FUN indicates
2440 whether this will be used for a function call. LOC is the source
2441 location of the identifier. This sets *TYPE to the type of the
2442 identifier, which is not the same as the type of the returned value
2443 for CONST_DECLs defined as enum constants. If the type of the
2444 identifier is not available, *TYPE is set to NULL. */
2446 build_external_ref (location_t loc
, tree id
, int fun
, tree
*type
)
2449 tree decl
= lookup_name (id
);
2451 /* In Objective-C, an instance variable (ivar) may be preferred to
2452 whatever lookup_name() found. */
2453 decl
= objc_lookup_ivar (decl
, id
);
2456 if (decl
&& decl
!= error_mark_node
)
2459 *type
= TREE_TYPE (ref
);
2462 /* Implicit function declaration. */
2463 ref
= implicitly_declare (loc
, id
);
2464 else if (decl
== error_mark_node
)
2465 /* Don't complain about something that's already been
2466 complained about. */
2467 return error_mark_node
;
2470 undeclared_variable (loc
, id
);
2471 return error_mark_node
;
2474 if (TREE_TYPE (ref
) == error_mark_node
)
2475 return error_mark_node
;
2477 if (TREE_DEPRECATED (ref
))
2478 warn_deprecated_use (ref
, NULL_TREE
);
2480 /* Recursive call does not count as usage. */
2481 if (ref
!= current_function_decl
)
2483 TREE_USED (ref
) = 1;
2486 if (TREE_CODE (ref
) == FUNCTION_DECL
&& !in_alignof
)
2488 if (!in_sizeof
&& !in_typeof
)
2489 C_DECL_USED (ref
) = 1;
2490 else if (DECL_INITIAL (ref
) == 0
2491 && DECL_EXTERNAL (ref
)
2492 && !TREE_PUBLIC (ref
))
2493 record_maybe_used_decl (ref
);
2496 if (TREE_CODE (ref
) == CONST_DECL
)
2498 used_types_insert (TREE_TYPE (ref
));
2501 && TREE_CODE (TREE_TYPE (ref
)) == ENUMERAL_TYPE
2502 && C_TYPE_DEFINED_IN_STRUCT (TREE_TYPE (ref
)))
2504 warning_at (loc
, OPT_Wc___compat
,
2505 ("enum constant defined in struct or union "
2506 "is not visible in C++"));
2507 inform (DECL_SOURCE_LOCATION (ref
), "enum constant defined here");
2510 ref
= DECL_INITIAL (ref
);
2511 TREE_CONSTANT (ref
) = 1;
2513 else if (current_function_decl
!= 0
2514 && !DECL_FILE_SCOPE_P (current_function_decl
)
2515 && (TREE_CODE (ref
) == VAR_DECL
2516 || TREE_CODE (ref
) == PARM_DECL
2517 || TREE_CODE (ref
) == FUNCTION_DECL
))
2519 tree context
= decl_function_context (ref
);
2521 if (context
!= 0 && context
!= current_function_decl
)
2522 DECL_NONLOCAL (ref
) = 1;
2524 /* C99 6.7.4p3: An inline definition of a function with external
2525 linkage ... shall not contain a reference to an identifier with
2526 internal linkage. */
2527 else if (current_function_decl
!= 0
2528 && DECL_DECLARED_INLINE_P (current_function_decl
)
2529 && DECL_EXTERNAL (current_function_decl
)
2530 && VAR_OR_FUNCTION_DECL_P (ref
)
2531 && (TREE_CODE (ref
) != VAR_DECL
|| TREE_STATIC (ref
))
2532 && ! TREE_PUBLIC (ref
)
2533 && DECL_CONTEXT (ref
) != current_function_decl
)
2534 record_inline_static (loc
, current_function_decl
, ref
,
2540 /* Record details of decls possibly used inside sizeof or typeof. */
2541 struct maybe_used_decl
2545 /* The level seen at (in_sizeof + in_typeof). */
2547 /* The next one at this level or above, or NULL. */
2548 struct maybe_used_decl
*next
;
2551 static struct maybe_used_decl
*maybe_used_decls
;
2553 /* Record that DECL, an undefined static function reference seen
2554 inside sizeof or typeof, might be used if the operand of sizeof is
2555 a VLA type or the operand of typeof is a variably modified
2559 record_maybe_used_decl (tree decl
)
2561 struct maybe_used_decl
*t
= XOBNEW (&parser_obstack
, struct maybe_used_decl
);
2563 t
->level
= in_sizeof
+ in_typeof
;
2564 t
->next
= maybe_used_decls
;
2565 maybe_used_decls
= t
;
2568 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2569 USED is false, just discard them. If it is true, mark them used
2570 (if no longer inside sizeof or typeof) or move them to the next
2571 level up (if still inside sizeof or typeof). */
2574 pop_maybe_used (bool used
)
2576 struct maybe_used_decl
*p
= maybe_used_decls
;
2577 int cur_level
= in_sizeof
+ in_typeof
;
2578 while (p
&& p
->level
> cur_level
)
2583 C_DECL_USED (p
->decl
) = 1;
2585 p
->level
= cur_level
;
2589 if (!used
|| cur_level
== 0)
2590 maybe_used_decls
= p
;
2593 /* Return the result of sizeof applied to EXPR. */
2596 c_expr_sizeof_expr (location_t loc
, struct c_expr expr
)
2599 if (expr
.value
== error_mark_node
)
2601 ret
.value
= error_mark_node
;
2602 ret
.original_code
= ERROR_MARK
;
2603 ret
.original_type
= NULL
;
2604 pop_maybe_used (false);
2608 bool expr_const_operands
= true;
2609 tree folded_expr
= c_fully_fold (expr
.value
, require_constant_value
,
2610 &expr_const_operands
);
2611 ret
.value
= c_sizeof (loc
, TREE_TYPE (folded_expr
));
2612 c_last_sizeof_arg
= expr
.value
;
2613 ret
.original_code
= SIZEOF_EXPR
;
2614 ret
.original_type
= NULL
;
2615 if (c_vla_type_p (TREE_TYPE (folded_expr
)))
2617 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2618 ret
.value
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (ret
.value
),
2619 folded_expr
, ret
.value
);
2620 C_MAYBE_CONST_EXPR_NON_CONST (ret
.value
) = !expr_const_operands
;
2621 SET_EXPR_LOCATION (ret
.value
, loc
);
2623 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (folded_expr
)));
2628 /* Return the result of sizeof applied to T, a structure for the type
2629 name passed to sizeof (rather than the type itself). LOC is the
2630 location of the original expression. */
2633 c_expr_sizeof_type (location_t loc
, struct c_type_name
*t
)
2637 tree type_expr
= NULL_TREE
;
2638 bool type_expr_const
= true;
2639 type
= groktypename (t
, &type_expr
, &type_expr_const
);
2640 ret
.value
= c_sizeof (loc
, type
);
2641 c_last_sizeof_arg
= type
;
2642 ret
.original_code
= SIZEOF_EXPR
;
2643 ret
.original_type
= NULL
;
2644 if ((type_expr
|| TREE_CODE (ret
.value
) == INTEGER_CST
)
2645 && c_vla_type_p (type
))
2647 /* If the type is a [*] array, it is a VLA but is represented as
2648 having a size of zero. In such a case we must ensure that
2649 the result of sizeof does not get folded to a constant by
2650 c_fully_fold, because if the size is evaluated the result is
2651 not constant and so constraints on zero or negative size
2652 arrays must not be applied when this sizeof call is inside
2653 another array declarator. */
2655 type_expr
= integer_zero_node
;
2656 ret
.value
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (ret
.value
),
2657 type_expr
, ret
.value
);
2658 C_MAYBE_CONST_EXPR_NON_CONST (ret
.value
) = !type_expr_const
;
2660 pop_maybe_used (type
!= error_mark_node
2661 ? C_TYPE_VARIABLE_SIZE (type
) : false);
2665 /* Build a function call to function FUNCTION with parameters PARAMS.
2666 The function call is at LOC.
2667 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2668 TREE_VALUE of each node is a parameter-expression.
2669 FUNCTION's data type may be a function type or a pointer-to-function. */
2672 build_function_call (location_t loc
, tree function
, tree params
)
2674 vec
<tree
, va_gc
> *v
;
2677 vec_alloc (v
, list_length (params
));
2678 for (; params
; params
= TREE_CHAIN (params
))
2679 v
->quick_push (TREE_VALUE (params
));
2680 ret
= build_function_call_vec (loc
, function
, v
, NULL
);
2685 /* Give a note about the location of the declaration of DECL. */
2687 static void inform_declaration (tree decl
)
2689 if (decl
&& (TREE_CODE (decl
) != FUNCTION_DECL
|| !DECL_BUILT_IN (decl
)))
2690 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
2693 /* Build a function call to function FUNCTION with parameters PARAMS.
2694 ORIGTYPES, if not NULL, is a vector of types; each element is
2695 either NULL or the original type of the corresponding element in
2696 PARAMS. The original type may differ from TREE_TYPE of the
2697 parameter for enums. FUNCTION's data type may be a function type
2698 or pointer-to-function. This function changes the elements of
2702 build_function_call_vec (location_t loc
, tree function
,
2703 vec
<tree
, va_gc
> *params
,
2704 vec
<tree
, va_gc
> *origtypes
)
2706 tree fntype
, fundecl
= 0;
2707 tree name
= NULL_TREE
, result
;
2713 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2714 STRIP_TYPE_NOPS (function
);
2716 /* Convert anything with function type to a pointer-to-function. */
2717 if (TREE_CODE (function
) == FUNCTION_DECL
)
2719 /* Implement type-directed function overloading for builtins.
2720 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2721 handle all the type checking. The result is a complete expression
2722 that implements this function call. */
2723 tem
= resolve_overloaded_builtin (loc
, function
, params
);
2727 name
= DECL_NAME (function
);
2730 tm_malloc_replacement (function
);
2732 /* Atomic functions have type checking/casting already done. They are
2733 often rewritten and don't match the original parameter list. */
2734 if (name
&& !strncmp (IDENTIFIER_POINTER (name
), "__atomic_", 9))
2737 if (flag_enable_cilkplus
2738 && is_cilkplus_reduce_builtin (function
))
2741 if (TREE_CODE (TREE_TYPE (function
)) == FUNCTION_TYPE
)
2742 function
= function_to_pointer_conversion (loc
, function
);
2744 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2745 expressions, like those used for ObjC messenger dispatches. */
2746 if (params
&& !params
->is_empty ())
2747 function
= objc_rewrite_function_call (function
, (*params
)[0]);
2749 function
= c_fully_fold (function
, false, NULL
);
2751 fntype
= TREE_TYPE (function
);
2753 if (TREE_CODE (fntype
) == ERROR_MARK
)
2754 return error_mark_node
;
2756 if (!(TREE_CODE (fntype
) == POINTER_TYPE
2757 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
))
2759 if (!flag_diagnostics_show_caret
)
2761 "called object %qE is not a function or function pointer",
2763 else if (DECL_P (function
))
2766 "called object %qD is not a function or function pointer",
2768 inform_declaration (function
);
2772 "called object is not a function or function pointer");
2773 return error_mark_node
;
2776 if (fundecl
&& TREE_THIS_VOLATILE (fundecl
))
2777 current_function_returns_abnormally
= 1;
2779 /* fntype now gets the type of function pointed to. */
2780 fntype
= TREE_TYPE (fntype
);
2782 /* Convert the parameters to the types declared in the
2783 function prototype, or apply default promotions. */
2785 nargs
= convert_arguments (TYPE_ARG_TYPES (fntype
), params
, origtypes
,
2788 return error_mark_node
;
2790 /* Check that the function is called through a compatible prototype.
2791 If it is not, replace the call by a trap, wrapped up in a compound
2792 expression if necessary. This has the nice side-effect to prevent
2793 the tree-inliner from generating invalid assignment trees which may
2794 blow up in the RTL expander later. */
2795 if (CONVERT_EXPR_P (function
)
2796 && TREE_CODE (tem
= TREE_OPERAND (function
, 0)) == ADDR_EXPR
2797 && TREE_CODE (tem
= TREE_OPERAND (tem
, 0)) == FUNCTION_DECL
2798 && !comptypes (fntype
, TREE_TYPE (tem
)))
2800 tree return_type
= TREE_TYPE (fntype
);
2801 tree trap
= build_function_call (loc
,
2802 builtin_decl_explicit (BUILT_IN_TRAP
),
2806 /* This situation leads to run-time undefined behavior. We can't,
2807 therefore, simply error unless we can prove that all possible
2808 executions of the program must execute the code. */
2809 if (warning_at (loc
, 0, "function called through a non-compatible type"))
2810 /* We can, however, treat "undefined" any way we please.
2811 Call abort to encourage the user to fix the program. */
2812 inform (loc
, "if this code is reached, the program will abort");
2813 /* Before the abort, allow the function arguments to exit or
2815 for (i
= 0; i
< nargs
; i
++)
2816 trap
= build2 (COMPOUND_EXPR
, void_type_node
, (*params
)[i
], trap
);
2818 if (VOID_TYPE_P (return_type
))
2820 if (TYPE_QUALS (return_type
) != TYPE_UNQUALIFIED
)
2822 "function with qualified void return type called");
2829 if (AGGREGATE_TYPE_P (return_type
))
2830 rhs
= build_compound_literal (loc
, return_type
,
2831 build_constructor (return_type
,
2835 rhs
= build_zero_cst (return_type
);
2837 return require_complete_type (build2 (COMPOUND_EXPR
, return_type
,
2842 argarray
= vec_safe_address (params
);
2844 /* Check that arguments to builtin functions match the expectations. */
2846 && DECL_BUILT_IN (fundecl
)
2847 && DECL_BUILT_IN_CLASS (fundecl
) == BUILT_IN_NORMAL
2848 && !check_builtin_function_arguments (fundecl
, nargs
, argarray
))
2849 return error_mark_node
;
2851 /* Check that the arguments to the function are valid. */
2852 check_function_arguments (fntype
, nargs
, argarray
);
2854 if (name
!= NULL_TREE
2855 && !strncmp (IDENTIFIER_POINTER (name
), "__builtin_", 10))
2857 if (require_constant_value
)
2859 fold_build_call_array_initializer_loc (loc
, TREE_TYPE (fntype
),
2860 function
, nargs
, argarray
);
2862 result
= fold_build_call_array_loc (loc
, TREE_TYPE (fntype
),
2863 function
, nargs
, argarray
);
2864 if (TREE_CODE (result
) == NOP_EXPR
2865 && TREE_CODE (TREE_OPERAND (result
, 0)) == INTEGER_CST
)
2866 STRIP_TYPE_NOPS (result
);
2869 result
= build_call_array_loc (loc
, TREE_TYPE (fntype
),
2870 function
, nargs
, argarray
);
2872 if (VOID_TYPE_P (TREE_TYPE (result
)))
2874 if (TYPE_QUALS (TREE_TYPE (result
)) != TYPE_UNQUALIFIED
)
2876 "function with qualified void return type called");
2879 return require_complete_type (result
);
2882 /* Convert the argument expressions in the vector VALUES
2883 to the types in the list TYPELIST.
2885 If TYPELIST is exhausted, or when an element has NULL as its type,
2886 perform the default conversions.
2888 ORIGTYPES is the original types of the expressions in VALUES. This
2889 holds the type of enum values which have been converted to integral
2890 types. It may be NULL.
2892 FUNCTION is a tree for the called function. It is used only for
2893 error messages, where it is formatted with %qE.
2895 This is also where warnings about wrong number of args are generated.
2897 Returns the actual number of arguments processed (which may be less
2898 than the length of VALUES in some error situations), or -1 on
2902 convert_arguments (tree typelist
, vec
<tree
, va_gc
> *values
,
2903 vec
<tree
, va_gc
> *origtypes
, tree function
, tree fundecl
)
2906 unsigned int parmnum
;
2907 bool error_args
= false;
2908 const bool type_generic
= fundecl
2909 && lookup_attribute ("type generic", TYPE_ATTRIBUTES(TREE_TYPE (fundecl
)));
2910 bool type_generic_remove_excess_precision
= false;
2913 /* Change pointer to function to the function itself for
2915 if (TREE_CODE (function
) == ADDR_EXPR
2916 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
2917 function
= TREE_OPERAND (function
, 0);
2919 /* Handle an ObjC selector specially for diagnostics. */
2920 selector
= objc_message_selector ();
2922 /* For type-generic built-in functions, determine whether excess
2923 precision should be removed (classification) or not
2926 && DECL_BUILT_IN (fundecl
)
2927 && DECL_BUILT_IN_CLASS (fundecl
) == BUILT_IN_NORMAL
)
2929 switch (DECL_FUNCTION_CODE (fundecl
))
2931 case BUILT_IN_ISFINITE
:
2932 case BUILT_IN_ISINF
:
2933 case BUILT_IN_ISINF_SIGN
:
2934 case BUILT_IN_ISNAN
:
2935 case BUILT_IN_ISNORMAL
:
2936 case BUILT_IN_FPCLASSIFY
:
2937 type_generic_remove_excess_precision
= true;
2941 type_generic_remove_excess_precision
= false;
2946 /* Scan the given expressions and types, producing individual
2947 converted arguments. */
2949 for (typetail
= typelist
, parmnum
= 0;
2950 values
&& values
->iterate (parmnum
, &val
);
2953 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
2954 tree valtype
= TREE_TYPE (val
);
2955 tree rname
= function
;
2956 int argnum
= parmnum
+ 1;
2957 const char *invalid_func_diag
;
2958 bool excess_precision
= false;
2962 // FIXME: I assume this code is here to handle the overloaded
2963 // behavior of the __sec_reduce* builtins, and avoid giving
2964 // argument mismatch warnings/errors. We should probably handle
2965 // this with the resolve_overloaded_builtin infrastructure.
2966 /* If the function call is a builtin function call, then we do not
2967 worry about it since we break them up into its equivalent later and
2968 we do the appropriate checks there. */
2969 if (flag_enable_cilkplus
2970 && is_cilkplus_reduce_builtin (fundecl
))
2973 if (type
== void_type_node
)
2976 error_at (input_location
,
2977 "too many arguments to method %qE", selector
);
2979 error_at (input_location
,
2980 "too many arguments to function %qE", function
);
2981 inform_declaration (fundecl
);
2985 if (selector
&& argnum
> 2)
2991 npc
= null_pointer_constant_p (val
);
2993 /* If there is excess precision and a prototype, convert once to
2994 the required type rather than converting via the semantic
2995 type. Likewise without a prototype a float value represented
2996 as long double should be converted once to double. But for
2997 type-generic classification functions excess precision must
2999 if (TREE_CODE (val
) == EXCESS_PRECISION_EXPR
3000 && (type
|| !type_generic
|| !type_generic_remove_excess_precision
))
3002 val
= TREE_OPERAND (val
, 0);
3003 excess_precision
= true;
3005 val
= c_fully_fold (val
, false, NULL
);
3006 STRIP_TYPE_NOPS (val
);
3008 val
= require_complete_type (val
);
3012 /* Formal parm type is specified by a function prototype. */
3014 if (type
== error_mark_node
|| !COMPLETE_TYPE_P (type
))
3016 error ("type of formal parameter %d is incomplete", parmnum
+ 1);
3023 /* Optionally warn about conversions that
3024 differ from the default conversions. */
3025 if (warn_traditional_conversion
|| warn_traditional
)
3027 unsigned int formal_prec
= TYPE_PRECISION (type
);
3029 if (INTEGRAL_TYPE_P (type
)
3030 && TREE_CODE (valtype
) == REAL_TYPE
)
3031 warning (0, "passing argument %d of %qE as integer "
3032 "rather than floating due to prototype",
3034 if (INTEGRAL_TYPE_P (type
)
3035 && TREE_CODE (valtype
) == COMPLEX_TYPE
)
3036 warning (0, "passing argument %d of %qE as integer "
3037 "rather than complex due to prototype",
3039 else if (TREE_CODE (type
) == COMPLEX_TYPE
3040 && TREE_CODE (valtype
) == REAL_TYPE
)
3041 warning (0, "passing argument %d of %qE as complex "
3042 "rather than floating due to prototype",
3044 else if (TREE_CODE (type
) == REAL_TYPE
3045 && INTEGRAL_TYPE_P (valtype
))
3046 warning (0, "passing argument %d of %qE as floating "
3047 "rather than integer due to prototype",
3049 else if (TREE_CODE (type
) == COMPLEX_TYPE
3050 && INTEGRAL_TYPE_P (valtype
))
3051 warning (0, "passing argument %d of %qE as complex "
3052 "rather than integer due to prototype",
3054 else if (TREE_CODE (type
) == REAL_TYPE
3055 && TREE_CODE (valtype
) == COMPLEX_TYPE
)
3056 warning (0, "passing argument %d of %qE as floating "
3057 "rather than complex due to prototype",
3059 /* ??? At some point, messages should be written about
3060 conversions between complex types, but that's too messy
3062 else if (TREE_CODE (type
) == REAL_TYPE
3063 && TREE_CODE (valtype
) == REAL_TYPE
)
3065 /* Warn if any argument is passed as `float',
3066 since without a prototype it would be `double'. */
3067 if (formal_prec
== TYPE_PRECISION (float_type_node
)
3068 && type
!= dfloat32_type_node
)
3069 warning (0, "passing argument %d of %qE as %<float%> "
3070 "rather than %<double%> due to prototype",
3073 /* Warn if mismatch between argument and prototype
3074 for decimal float types. Warn of conversions with
3075 binary float types and of precision narrowing due to
3077 else if (type
!= valtype
3078 && (type
== dfloat32_type_node
3079 || type
== dfloat64_type_node
3080 || type
== dfloat128_type_node
3081 || valtype
== dfloat32_type_node
3082 || valtype
== dfloat64_type_node
3083 || valtype
== dfloat128_type_node
)
3085 <= TYPE_PRECISION (valtype
)
3086 || (type
== dfloat128_type_node
3088 != dfloat64_type_node
3090 != dfloat32_type_node
)))
3091 || (type
== dfloat64_type_node
3093 != dfloat32_type_node
))))
3094 warning (0, "passing argument %d of %qE as %qT "
3095 "rather than %qT due to prototype",
3096 argnum
, rname
, type
, valtype
);
3099 /* Detect integer changing in width or signedness.
3100 These warnings are only activated with
3101 -Wtraditional-conversion, not with -Wtraditional. */
3102 else if (warn_traditional_conversion
&& INTEGRAL_TYPE_P (type
)
3103 && INTEGRAL_TYPE_P (valtype
))
3105 tree would_have_been
= default_conversion (val
);
3106 tree type1
= TREE_TYPE (would_have_been
);
3108 if (TREE_CODE (type
) == ENUMERAL_TYPE
3109 && (TYPE_MAIN_VARIANT (type
)
3110 == TYPE_MAIN_VARIANT (valtype
)))
3111 /* No warning if function asks for enum
3112 and the actual arg is that enum type. */
3114 else if (formal_prec
!= TYPE_PRECISION (type1
))
3115 warning (OPT_Wtraditional_conversion
,
3116 "passing argument %d of %qE "
3117 "with different width due to prototype",
3119 else if (TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (type1
))
3121 /* Don't complain if the formal parameter type
3122 is an enum, because we can't tell now whether
3123 the value was an enum--even the same enum. */
3124 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
3126 else if (TREE_CODE (val
) == INTEGER_CST
3127 && int_fits_type_p (val
, type
))
3128 /* Change in signedness doesn't matter
3129 if a constant value is unaffected. */
3131 /* If the value is extended from a narrower
3132 unsigned type, it doesn't matter whether we
3133 pass it as signed or unsigned; the value
3134 certainly is the same either way. */
3135 else if (TYPE_PRECISION (valtype
) < TYPE_PRECISION (type
)
3136 && TYPE_UNSIGNED (valtype
))
3138 else if (TYPE_UNSIGNED (type
))
3139 warning (OPT_Wtraditional_conversion
,
3140 "passing argument %d of %qE "
3141 "as unsigned due to prototype",
3144 warning (OPT_Wtraditional_conversion
,
3145 "passing argument %d of %qE "
3146 "as signed due to prototype", argnum
, rname
);
3150 /* Possibly restore an EXCESS_PRECISION_EXPR for the
3151 sake of better warnings from convert_and_check. */
3152 if (excess_precision
)
3153 val
= build1 (EXCESS_PRECISION_EXPR
, valtype
, val
);
3154 origtype
= (!origtypes
) ? NULL_TREE
: (*origtypes
)[parmnum
];
3155 parmval
= convert_for_assignment (input_location
, type
, val
,
3156 origtype
, ic_argpass
, npc
,
3160 if (targetm
.calls
.promote_prototypes (fundecl
? TREE_TYPE (fundecl
) : 0)
3161 && INTEGRAL_TYPE_P (type
)
3162 && (TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)))
3163 parmval
= default_conversion (parmval
);
3166 else if (TREE_CODE (valtype
) == REAL_TYPE
3167 && (TYPE_PRECISION (valtype
)
3168 < TYPE_PRECISION (double_type_node
))
3169 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (valtype
)))
3175 /* Convert `float' to `double'. */
3176 if (warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
3177 warning (OPT_Wdouble_promotion
,
3178 "implicit conversion from %qT to %qT when passing "
3179 "argument to function",
3180 valtype
, double_type_node
);
3181 parmval
= convert (double_type_node
, val
);
3184 else if (excess_precision
&& !type_generic
)
3185 /* A "double" argument with excess precision being passed
3186 without a prototype or in variable arguments. */
3187 parmval
= convert (valtype
, val
);
3188 else if ((invalid_func_diag
=
3189 targetm
.calls
.invalid_arg_for_unprototyped_fn (typelist
, fundecl
, val
)))
3191 error (invalid_func_diag
);
3195 /* Convert `short' and `char' to full-size `int'. */
3196 parmval
= default_conversion (val
);
3198 (*values
)[parmnum
] = parmval
;
3199 if (parmval
== error_mark_node
)
3203 typetail
= TREE_CHAIN (typetail
);
3206 gcc_assert (parmnum
== vec_safe_length (values
));
3208 if (typetail
!= 0 && TREE_VALUE (typetail
) != void_type_node
)
3210 /* If array notation is used and Cilk Plus is enabled, then we do not
3211 worry about this error now. We will handle them in a later place. */
3212 if (!flag_enable_cilkplus
3213 || !is_cilkplus_reduce_builtin (fundecl
))
3215 error_at (input_location
,
3216 "too few arguments to function %qE", function
);
3217 inform_declaration (fundecl
);
3222 return error_args
? -1 : (int) parmnum
;
3225 /* This is the entry point used by the parser to build unary operators
3226 in the input. CODE, a tree_code, specifies the unary operator, and
3227 ARG is the operand. For unary plus, the C parser currently uses
3228 CONVERT_EXPR for code.
3230 LOC is the location to use for the tree generated.
3234 parser_build_unary_op (location_t loc
, enum tree_code code
, struct c_expr arg
)
3236 struct c_expr result
;
3238 result
.value
= build_unary_op (loc
, code
, arg
.value
, 0);
3239 result
.original_code
= code
;
3240 result
.original_type
= NULL
;
3242 if (TREE_OVERFLOW_P (result
.value
) && !TREE_OVERFLOW_P (arg
.value
))
3243 overflow_warning (loc
, result
.value
);
3248 /* This is the entry point used by the parser to build binary operators
3249 in the input. CODE, a tree_code, specifies the binary operator, and
3250 ARG1 and ARG2 are the operands. In addition to constructing the
3251 expression, we check for operands that were written with other binary
3252 operators in a way that is likely to confuse the user.
3254 LOCATION is the location of the binary operator. */
3257 parser_build_binary_op (location_t location
, enum tree_code code
,
3258 struct c_expr arg1
, struct c_expr arg2
)
3260 struct c_expr result
;
3262 enum tree_code code1
= arg1
.original_code
;
3263 enum tree_code code2
= arg2
.original_code
;
3264 tree type1
= (arg1
.original_type
3265 ? arg1
.original_type
3266 : TREE_TYPE (arg1
.value
));
3267 tree type2
= (arg2
.original_type
3268 ? arg2
.original_type
3269 : TREE_TYPE (arg2
.value
));
3271 result
.value
= build_binary_op (location
, code
,
3272 arg1
.value
, arg2
.value
, 1);
3273 result
.original_code
= code
;
3274 result
.original_type
= NULL
;
3276 if (TREE_CODE (result
.value
) == ERROR_MARK
)
3279 if (location
!= UNKNOWN_LOCATION
)
3280 protected_set_expr_location (result
.value
, location
);
3282 /* Check for cases such as x+y<<z which users are likely
3284 if (warn_parentheses
)
3285 warn_about_parentheses (input_location
, code
,
3286 code1
, arg1
.value
, code2
, arg2
.value
);
3288 if (warn_logical_op
)
3289 warn_logical_operator (input_location
, code
, TREE_TYPE (result
.value
),
3290 code1
, arg1
.value
, code2
, arg2
.value
);
3292 /* Warn about comparisons against string literals, with the exception
3293 of testing for equality or inequality of a string literal with NULL. */
3294 if (code
== EQ_EXPR
|| code
== NE_EXPR
)
3296 if ((code1
== STRING_CST
&& !integer_zerop (arg2
.value
))
3297 || (code2
== STRING_CST
&& !integer_zerop (arg1
.value
)))
3298 warning_at (location
, OPT_Waddress
,
3299 "comparison with string literal results in unspecified behavior");
3301 else if (TREE_CODE_CLASS (code
) == tcc_comparison
3302 && (code1
== STRING_CST
|| code2
== STRING_CST
))
3303 warning_at (location
, OPT_Waddress
,
3304 "comparison with string literal results in unspecified behavior");
3306 if (TREE_OVERFLOW_P (result
.value
)
3307 && !TREE_OVERFLOW_P (arg1
.value
)
3308 && !TREE_OVERFLOW_P (arg2
.value
))
3309 overflow_warning (location
, result
.value
);
3311 /* Warn about comparisons of different enum types. */
3312 if (warn_enum_compare
3313 && TREE_CODE_CLASS (code
) == tcc_comparison
3314 && TREE_CODE (type1
) == ENUMERAL_TYPE
3315 && TREE_CODE (type2
) == ENUMERAL_TYPE
3316 && TYPE_MAIN_VARIANT (type1
) != TYPE_MAIN_VARIANT (type2
))
3317 warning_at (location
, OPT_Wenum_compare
,
3318 "comparison between %qT and %qT",
3324 /* Return a tree for the difference of pointers OP0 and OP1.
3325 The resulting tree has type int. */
3328 pointer_diff (location_t loc
, tree op0
, tree op1
)
3330 tree restype
= ptrdiff_type_node
;
3331 tree result
, inttype
;
3333 addr_space_t as0
= TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (op0
)));
3334 addr_space_t as1
= TYPE_ADDR_SPACE (TREE_TYPE (TREE_TYPE (op1
)));
3335 tree target_type
= TREE_TYPE (TREE_TYPE (op0
));
3336 tree con0
, con1
, lit0
, lit1
;
3337 tree orig_op1
= op1
;
3339 /* If the operands point into different address spaces, we need to
3340 explicitly convert them to pointers into the common address space
3341 before we can subtract the numerical address values. */
3344 addr_space_t as_common
;
3347 /* Determine the common superset address space. This is guaranteed
3348 to exist because the caller verified that comp_target_types
3349 returned non-zero. */
3350 if (!addr_space_superset (as0
, as1
, &as_common
))
3353 common_type
= common_pointer_type (TREE_TYPE (op0
), TREE_TYPE (op1
));
3354 op0
= convert (common_type
, op0
);
3355 op1
= convert (common_type
, op1
);
3358 /* Determine integer type to perform computations in. This will usually
3359 be the same as the result type (ptrdiff_t), but may need to be a wider
3360 type if pointers for the address space are wider than ptrdiff_t. */
3361 if (TYPE_PRECISION (restype
) < TYPE_PRECISION (TREE_TYPE (op0
)))
3362 inttype
= c_common_type_for_size (TYPE_PRECISION (TREE_TYPE (op0
)), 0);
3367 if (TREE_CODE (target_type
) == VOID_TYPE
)
3368 pedwarn (loc
, OPT_Wpointer_arith
,
3369 "pointer of type %<void *%> used in subtraction");
3370 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
3371 pedwarn (loc
, OPT_Wpointer_arith
,
3372 "pointer to a function used in subtraction");
3374 /* If the conversion to ptrdiff_type does anything like widening or
3375 converting a partial to an integral mode, we get a convert_expression
3376 that is in the way to do any simplifications.
3377 (fold-const.c doesn't know that the extra bits won't be needed.
3378 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
3379 different mode in place.)
3380 So first try to find a common term here 'by hand'; we want to cover
3381 at least the cases that occur in legal static initializers. */
3382 if (CONVERT_EXPR_P (op0
)
3383 && (TYPE_PRECISION (TREE_TYPE (op0
))
3384 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0
, 0)))))
3385 con0
= TREE_OPERAND (op0
, 0);
3388 if (CONVERT_EXPR_P (op1
)
3389 && (TYPE_PRECISION (TREE_TYPE (op1
))
3390 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1
, 0)))))
3391 con1
= TREE_OPERAND (op1
, 0);
3395 if (TREE_CODE (con0
) == POINTER_PLUS_EXPR
)
3397 lit0
= TREE_OPERAND (con0
, 1);
3398 con0
= TREE_OPERAND (con0
, 0);
3401 lit0
= integer_zero_node
;
3403 if (TREE_CODE (con1
) == POINTER_PLUS_EXPR
)
3405 lit1
= TREE_OPERAND (con1
, 1);
3406 con1
= TREE_OPERAND (con1
, 0);
3409 lit1
= integer_zero_node
;
3411 if (operand_equal_p (con0
, con1
, 0))
3418 /* First do the subtraction as integers;
3419 then drop through to build the divide operator.
3420 Do not do default conversions on the minus operator
3421 in case restype is a short type. */
3423 op0
= build_binary_op (loc
,
3424 MINUS_EXPR
, convert (inttype
, op0
),
3425 convert (inttype
, op1
), 0);
3426 /* This generates an error if op1 is pointer to incomplete type. */
3427 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1
))))
3428 error_at (loc
, "arithmetic on pointer to an incomplete type");
3430 /* This generates an error if op0 is pointer to incomplete type. */
3431 op1
= c_size_in_bytes (target_type
);
3433 /* Divide by the size, in easiest possible way. */
3434 result
= fold_build2_loc (loc
, EXACT_DIV_EXPR
, inttype
,
3435 op0
, convert (inttype
, op1
));
3437 /* Convert to final result type if necessary. */
3438 return convert (restype
, result
);
3441 /* Construct and perhaps optimize a tree representation
3442 for a unary operation. CODE, a tree_code, specifies the operation
3443 and XARG is the operand.
3444 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
3445 the default promotions (such as from short to int).
3446 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
3447 allows non-lvalues; this is only used to handle conversion of non-lvalue
3448 arrays to pointers in C99.
3450 LOCATION is the location of the operator. */
3453 build_unary_op (location_t location
,
3454 enum tree_code code
, tree xarg
, int flag
)
3456 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
3459 enum tree_code typecode
;
3461 tree ret
= error_mark_node
;
3462 tree eptype
= NULL_TREE
;
3463 int noconvert
= flag
;
3464 const char *invalid_op_diag
;
3467 int_operands
= EXPR_INT_CONST_OPERANDS (xarg
);
3469 arg
= remove_c_maybe_const_expr (arg
);
3471 if (code
!= ADDR_EXPR
)
3472 arg
= require_complete_type (arg
);
3474 typecode
= TREE_CODE (TREE_TYPE (arg
));
3475 if (typecode
== ERROR_MARK
)
3476 return error_mark_node
;
3477 if (typecode
== ENUMERAL_TYPE
|| typecode
== BOOLEAN_TYPE
)
3478 typecode
= INTEGER_TYPE
;
3480 if ((invalid_op_diag
3481 = targetm
.invalid_unary_op (code
, TREE_TYPE (xarg
))))
3483 error_at (location
, invalid_op_diag
);
3484 return error_mark_node
;
3487 if (TREE_CODE (arg
) == EXCESS_PRECISION_EXPR
)
3489 eptype
= TREE_TYPE (arg
);
3490 arg
= TREE_OPERAND (arg
, 0);
3496 /* This is used for unary plus, because a CONVERT_EXPR
3497 is enough to prevent anybody from looking inside for
3498 associativity, but won't generate any code. */
3499 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
3500 || typecode
== FIXED_POINT_TYPE
|| typecode
== COMPLEX_TYPE
3501 || typecode
== VECTOR_TYPE
))
3503 error_at (location
, "wrong type argument to unary plus");
3504 return error_mark_node
;
3506 else if (!noconvert
)
3507 arg
= default_conversion (arg
);
3508 arg
= non_lvalue_loc (location
, arg
);
3512 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
3513 || typecode
== FIXED_POINT_TYPE
|| typecode
== COMPLEX_TYPE
3514 || typecode
== VECTOR_TYPE
))
3516 error_at (location
, "wrong type argument to unary minus");
3517 return error_mark_node
;
3519 else if (!noconvert
)
3520 arg
= default_conversion (arg
);
3524 /* ~ works on integer types and non float vectors. */
3525 if (typecode
== INTEGER_TYPE
3526 || (typecode
== VECTOR_TYPE
3527 && !VECTOR_FLOAT_TYPE_P (TREE_TYPE (arg
))))
3530 arg
= default_conversion (arg
);
3532 else if (typecode
== COMPLEX_TYPE
)
3535 pedwarn (location
, OPT_Wpedantic
,
3536 "ISO C does not support %<~%> for complex conjugation");
3538 arg
= default_conversion (arg
);
3542 error_at (location
, "wrong type argument to bit-complement");
3543 return error_mark_node
;
3548 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
))
3550 error_at (location
, "wrong type argument to abs");
3551 return error_mark_node
;
3553 else if (!noconvert
)
3554 arg
= default_conversion (arg
);
3558 /* Conjugating a real value is a no-op, but allow it anyway. */
3559 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
3560 || typecode
== COMPLEX_TYPE
))
3562 error_at (location
, "wrong type argument to conjugation");
3563 return error_mark_node
;
3565 else if (!noconvert
)
3566 arg
= default_conversion (arg
);
3569 case TRUTH_NOT_EXPR
:
3570 if (typecode
!= INTEGER_TYPE
&& typecode
!= FIXED_POINT_TYPE
3571 && typecode
!= REAL_TYPE
&& typecode
!= POINTER_TYPE
3572 && typecode
!= COMPLEX_TYPE
)
3575 "wrong type argument to unary exclamation mark");
3576 return error_mark_node
;
3580 arg
= c_objc_common_truthvalue_conversion (location
, xarg
);
3581 arg
= remove_c_maybe_const_expr (arg
);
3584 arg
= c_objc_common_truthvalue_conversion (location
, arg
);
3585 ret
= invert_truthvalue_loc (location
, arg
);
3586 /* If the TRUTH_NOT_EXPR has been folded, reset the location. */
3587 if (EXPR_P (ret
) && EXPR_HAS_LOCATION (ret
))
3588 location
= EXPR_LOCATION (ret
);
3589 goto return_build_unary_op
;
3593 ret
= build_real_imag_expr (location
, code
, arg
);
3594 if (ret
== error_mark_node
)
3595 return error_mark_node
;
3596 if (eptype
&& TREE_CODE (eptype
) == COMPLEX_TYPE
)
3597 eptype
= TREE_TYPE (eptype
);
3598 goto return_build_unary_op
;
3600 case PREINCREMENT_EXPR
:
3601 case POSTINCREMENT_EXPR
:
3602 case PREDECREMENT_EXPR
:
3603 case POSTDECREMENT_EXPR
:
3605 if (TREE_CODE (arg
) == C_MAYBE_CONST_EXPR
)
3607 tree inner
= build_unary_op (location
, code
,
3608 C_MAYBE_CONST_EXPR_EXPR (arg
), flag
);
3609 if (inner
== error_mark_node
)
3610 return error_mark_node
;
3611 ret
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (inner
),
3612 C_MAYBE_CONST_EXPR_PRE (arg
), inner
);
3613 gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (arg
));
3614 C_MAYBE_CONST_EXPR_NON_CONST (ret
) = 1;
3615 goto return_build_unary_op
;
3618 /* Complain about anything that is not a true lvalue. In
3619 Objective-C, skip this check for property_refs. */
3620 if (!objc_is_property_ref (arg
)
3621 && !lvalue_or_else (location
,
3622 arg
, ((code
== PREINCREMENT_EXPR
3623 || code
== POSTINCREMENT_EXPR
)
3626 return error_mark_node
;
3628 if (warn_cxx_compat
&& TREE_CODE (TREE_TYPE (arg
)) == ENUMERAL_TYPE
)
3630 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
3631 warning_at (location
, OPT_Wc___compat
,
3632 "increment of enumeration value is invalid in C++");
3634 warning_at (location
, OPT_Wc___compat
,
3635 "decrement of enumeration value is invalid in C++");
3638 /* Ensure the argument is fully folded inside any SAVE_EXPR. */
3639 arg
= c_fully_fold (arg
, false, NULL
);
3641 /* Increment or decrement the real part of the value,
3642 and don't change the imaginary part. */
3643 if (typecode
== COMPLEX_TYPE
)
3647 pedwarn (location
, OPT_Wpedantic
,
3648 "ISO C does not support %<++%> and %<--%> on complex types");
3650 arg
= stabilize_reference (arg
);
3651 real
= build_unary_op (EXPR_LOCATION (arg
), REALPART_EXPR
, arg
, 1);
3652 imag
= build_unary_op (EXPR_LOCATION (arg
), IMAGPART_EXPR
, arg
, 1);
3653 real
= build_unary_op (EXPR_LOCATION (arg
), code
, real
, 1);
3654 if (real
== error_mark_node
|| imag
== error_mark_node
)
3655 return error_mark_node
;
3656 ret
= build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
3658 goto return_build_unary_op
;
3661 /* Report invalid types. */
3663 if (typecode
!= POINTER_TYPE
&& typecode
!= FIXED_POINT_TYPE
3664 && typecode
!= INTEGER_TYPE
&& typecode
!= REAL_TYPE
)
3666 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
3667 error_at (location
, "wrong type argument to increment");
3669 error_at (location
, "wrong type argument to decrement");
3671 return error_mark_node
;
3677 argtype
= TREE_TYPE (arg
);
3679 /* Compute the increment. */
3681 if (typecode
== POINTER_TYPE
)
3683 /* If pointer target is an undefined struct,
3684 we just cannot know how to do the arithmetic. */
3685 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (argtype
)))
3687 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
3689 "increment of pointer to unknown structure");
3692 "decrement of pointer to unknown structure");
3694 else if (TREE_CODE (TREE_TYPE (argtype
)) == FUNCTION_TYPE
3695 || TREE_CODE (TREE_TYPE (argtype
)) == VOID_TYPE
)
3697 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
3698 pedwarn (location
, OPT_Wpointer_arith
,
3699 "wrong type argument to increment");
3701 pedwarn (location
, OPT_Wpointer_arith
,
3702 "wrong type argument to decrement");
3705 inc
= c_size_in_bytes (TREE_TYPE (argtype
));
3706 inc
= convert_to_ptrofftype_loc (location
, inc
);
3708 else if (FRACT_MODE_P (TYPE_MODE (argtype
)))
3710 /* For signed fract types, we invert ++ to -- or
3711 -- to ++, and change inc from 1 to -1, because
3712 it is not possible to represent 1 in signed fract constants.
3713 For unsigned fract types, the result always overflows and
3714 we get an undefined (original) or the maximum value. */
3715 if (code
== PREINCREMENT_EXPR
)
3716 code
= PREDECREMENT_EXPR
;
3717 else if (code
== PREDECREMENT_EXPR
)
3718 code
= PREINCREMENT_EXPR
;
3719 else if (code
== POSTINCREMENT_EXPR
)
3720 code
= POSTDECREMENT_EXPR
;
3721 else /* code == POSTDECREMENT_EXPR */
3722 code
= POSTINCREMENT_EXPR
;
3724 inc
= integer_minus_one_node
;
3725 inc
= convert (argtype
, inc
);
3729 inc
= integer_one_node
;
3730 inc
= convert (argtype
, inc
);
3733 /* If 'arg' is an Objective-C PROPERTY_REF expression, then we
3734 need to ask Objective-C to build the increment or decrement
3735 expression for it. */
3736 if (objc_is_property_ref (arg
))
3737 return objc_build_incr_expr_for_property_ref (location
, code
,
3740 /* Report a read-only lvalue. */
3741 if (TYPE_READONLY (argtype
))
3743 readonly_error (arg
,
3744 ((code
== PREINCREMENT_EXPR
3745 || code
== POSTINCREMENT_EXPR
)
3746 ? lv_increment
: lv_decrement
));
3747 return error_mark_node
;
3749 else if (TREE_READONLY (arg
))
3750 readonly_warning (arg
,
3751 ((code
== PREINCREMENT_EXPR
3752 || code
== POSTINCREMENT_EXPR
)
3753 ? lv_increment
: lv_decrement
));
3755 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
)
3756 val
= boolean_increment (code
, arg
);
3758 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
3759 TREE_SIDE_EFFECTS (val
) = 1;
3760 if (TREE_CODE (val
) != code
)
3761 TREE_NO_WARNING (val
) = 1;
3763 goto return_build_unary_op
;
3767 /* Note that this operation never does default_conversion. */
3769 /* The operand of unary '&' must be an lvalue (which excludes
3770 expressions of type void), or, in C99, the result of a [] or
3771 unary '*' operator. */
3772 if (VOID_TYPE_P (TREE_TYPE (arg
))
3773 && TYPE_QUALS (TREE_TYPE (arg
)) == TYPE_UNQUALIFIED
3774 && (TREE_CODE (arg
) != INDIRECT_REF
3776 pedwarn (location
, 0, "taking address of expression of type %<void%>");
3778 /* Let &* cancel out to simplify resulting code. */
3779 if (TREE_CODE (arg
) == INDIRECT_REF
)
3781 /* Don't let this be an lvalue. */
3782 if (lvalue_p (TREE_OPERAND (arg
, 0)))
3783 return non_lvalue_loc (location
, TREE_OPERAND (arg
, 0));
3784 ret
= TREE_OPERAND (arg
, 0);
3785 goto return_build_unary_op
;
3788 /* For &x[y], return x+y */
3789 if (TREE_CODE (arg
) == ARRAY_REF
)
3791 tree op0
= TREE_OPERAND (arg
, 0);
3792 if (!c_mark_addressable (op0
))
3793 return error_mark_node
;
3796 /* Anything not already handled and not a true memory reference
3797 or a non-lvalue array is an error. */
3798 else if (typecode
!= FUNCTION_TYPE
&& !flag
3799 && !lvalue_or_else (location
, arg
, lv_addressof
))
3800 return error_mark_node
;
3802 /* Move address operations inside C_MAYBE_CONST_EXPR to simplify
3804 if (TREE_CODE (arg
) == C_MAYBE_CONST_EXPR
)
3806 tree inner
= build_unary_op (location
, code
,
3807 C_MAYBE_CONST_EXPR_EXPR (arg
), flag
);
3808 ret
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (inner
),
3809 C_MAYBE_CONST_EXPR_PRE (arg
), inner
);
3810 gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (arg
));
3811 C_MAYBE_CONST_EXPR_NON_CONST (ret
)
3812 = C_MAYBE_CONST_EXPR_NON_CONST (arg
);
3813 goto return_build_unary_op
;
3816 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3817 argtype
= TREE_TYPE (arg
);
3819 /* If the lvalue is const or volatile, merge that into the type
3820 to which the address will point. This is only needed
3821 for function types. */
3822 if ((DECL_P (arg
) || REFERENCE_CLASS_P (arg
))
3823 && (TREE_READONLY (arg
) || TREE_THIS_VOLATILE (arg
))
3824 && TREE_CODE (argtype
) == FUNCTION_TYPE
)
3826 int orig_quals
= TYPE_QUALS (strip_array_types (argtype
));
3827 int quals
= orig_quals
;
3829 if (TREE_READONLY (arg
))
3830 quals
|= TYPE_QUAL_CONST
;
3831 if (TREE_THIS_VOLATILE (arg
))
3832 quals
|= TYPE_QUAL_VOLATILE
;
3834 argtype
= c_build_qualified_type (argtype
, quals
);
3837 if (!c_mark_addressable (arg
))
3838 return error_mark_node
;
3840 gcc_assert (TREE_CODE (arg
) != COMPONENT_REF
3841 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)));
3843 argtype
= build_pointer_type (argtype
);
3845 /* ??? Cope with user tricks that amount to offsetof. Delete this
3846 when we have proper support for integer constant expressions. */
3847 val
= get_base_address (arg
);
3848 if (val
&& TREE_CODE (val
) == INDIRECT_REF
3849 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
3851 ret
= fold_convert_loc (location
, argtype
, fold_offsetof_1 (arg
));
3852 goto return_build_unary_op
;
3855 val
= build1 (ADDR_EXPR
, argtype
, arg
);
3858 goto return_build_unary_op
;
3865 argtype
= TREE_TYPE (arg
);
3866 if (TREE_CODE (arg
) == INTEGER_CST
)
3867 ret
= (require_constant_value
3868 ? fold_build1_initializer_loc (location
, code
, argtype
, arg
)
3869 : fold_build1_loc (location
, code
, argtype
, arg
));
3871 ret
= build1 (code
, argtype
, arg
);
3872 return_build_unary_op
:
3873 gcc_assert (ret
!= error_mark_node
);
3874 if (TREE_CODE (ret
) == INTEGER_CST
&& !TREE_OVERFLOW (ret
)
3875 && !(TREE_CODE (xarg
) == INTEGER_CST
&& !TREE_OVERFLOW (xarg
)))
3876 ret
= build1 (NOP_EXPR
, TREE_TYPE (ret
), ret
);
3877 else if (TREE_CODE (ret
) != INTEGER_CST
&& int_operands
)
3878 ret
= note_integer_operands (ret
);
3880 ret
= build1 (EXCESS_PRECISION_EXPR
, eptype
, ret
);
3881 protected_set_expr_location (ret
, location
);
3885 /* Return nonzero if REF is an lvalue valid for this language.
3886 Lvalues can be assigned, unless their type has TYPE_READONLY.
3887 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3890 lvalue_p (const_tree ref
)
3892 const enum tree_code code
= TREE_CODE (ref
);
3899 return lvalue_p (TREE_OPERAND (ref
, 0));
3901 case C_MAYBE_CONST_EXPR
:
3902 return lvalue_p (TREE_OPERAND (ref
, 1));
3904 case COMPOUND_LITERAL_EXPR
:
3910 case ARRAY_NOTATION_REF
:
3915 return (TREE_CODE (TREE_TYPE (ref
)) != FUNCTION_TYPE
3916 && TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
);
3919 return TREE_CODE (TREE_TYPE (ref
)) == ARRAY_TYPE
;
3926 /* Give a warning for storing in something that is read-only in GCC
3927 terms but not const in ISO C terms. */
3930 readonly_warning (tree arg
, enum lvalue_use use
)
3935 warning (0, "assignment of read-only location %qE", arg
);
3938 warning (0, "increment of read-only location %qE", arg
);
3941 warning (0, "decrement of read-only location %qE", arg
);
3950 /* Return nonzero if REF is an lvalue valid for this language;
3951 otherwise, print an error message and return zero. USE says
3952 how the lvalue is being used and so selects the error message.
3953 LOCATION is the location at which any error should be reported. */
3956 lvalue_or_else (location_t loc
, const_tree ref
, enum lvalue_use use
)
3958 int win
= lvalue_p (ref
);
3961 lvalue_error (loc
, use
);
3966 /* Mark EXP saying that we need to be able to take the
3967 address of it; it should not be allocated in a register.
3968 Returns true if successful. */
3971 c_mark_addressable (tree exp
)
3976 switch (TREE_CODE (x
))
3979 if (DECL_C_BIT_FIELD (TREE_OPERAND (x
, 1)))
3982 ("cannot take address of bit-field %qD", TREE_OPERAND (x
, 1));
3986 /* ... fall through ... */
3992 x
= TREE_OPERAND (x
, 0);
3995 case COMPOUND_LITERAL_EXPR
:
3997 TREE_ADDRESSABLE (x
) = 1;
4004 if (C_DECL_REGISTER (x
)
4005 && DECL_NONLOCAL (x
))
4007 if (TREE_PUBLIC (x
) || TREE_STATIC (x
) || DECL_EXTERNAL (x
))
4010 ("global register variable %qD used in nested function", x
);
4013 pedwarn (input_location
, 0, "register variable %qD used in nested function", x
);
4015 else if (C_DECL_REGISTER (x
))
4017 if (TREE_PUBLIC (x
) || TREE_STATIC (x
) || DECL_EXTERNAL (x
))
4018 error ("address of global register variable %qD requested", x
);
4020 error ("address of register variable %qD requested", x
);
4026 TREE_ADDRESSABLE (x
) = 1;
4033 /* Convert EXPR to TYPE, warning about conversion problems with
4034 constants. SEMANTIC_TYPE is the type this conversion would use
4035 without excess precision. If SEMANTIC_TYPE is NULL, this function
4036 is equivalent to convert_and_check. This function is a wrapper that
4037 handles conversions that may be different than
4038 the usual ones because of excess precision. */
4041 ep_convert_and_check (tree type
, tree expr
, tree semantic_type
)
4043 if (TREE_TYPE (expr
) == type
)
4047 return convert_and_check (type
, expr
);
4049 if (TREE_CODE (TREE_TYPE (expr
)) == INTEGER_TYPE
4050 && TREE_TYPE (expr
) != semantic_type
)
4052 /* For integers, we need to check the real conversion, not
4053 the conversion to the excess precision type. */
4054 expr
= convert_and_check (semantic_type
, expr
);
4056 /* Result type is the excess precision type, which should be
4057 large enough, so do not check. */
4058 return convert (type
, expr
);
4061 /* Build and return a conditional expression IFEXP ? OP1 : OP2. If
4062 IFEXP_BCP then the condition is a call to __builtin_constant_p, and
4063 if folded to an integer constant then the unselected half may
4064 contain arbitrary operations not normally permitted in constant
4065 expressions. Set the location of the expression to LOC. */
4068 build_conditional_expr (location_t colon_loc
, tree ifexp
, bool ifexp_bcp
,
4069 tree op1
, tree op1_original_type
, tree op2
,
4070 tree op2_original_type
)
4074 enum tree_code code1
;
4075 enum tree_code code2
;
4076 tree result_type
= NULL
;
4077 tree semantic_result_type
= NULL
;
4078 tree orig_op1
= op1
, orig_op2
= op2
;
4079 bool int_const
, op1_int_operands
, op2_int_operands
, int_operands
;
4080 bool ifexp_int_operands
;
4083 op1_int_operands
= EXPR_INT_CONST_OPERANDS (orig_op1
);
4084 if (op1_int_operands
)
4085 op1
= remove_c_maybe_const_expr (op1
);
4086 op2_int_operands
= EXPR_INT_CONST_OPERANDS (orig_op2
);
4087 if (op2_int_operands
)
4088 op2
= remove_c_maybe_const_expr (op2
);
4089 ifexp_int_operands
= EXPR_INT_CONST_OPERANDS (ifexp
);
4090 if (ifexp_int_operands
)
4091 ifexp
= remove_c_maybe_const_expr (ifexp
);
4093 /* Promote both alternatives. */
4095 if (TREE_CODE (TREE_TYPE (op1
)) != VOID_TYPE
)
4096 op1
= default_conversion (op1
);
4097 if (TREE_CODE (TREE_TYPE (op2
)) != VOID_TYPE
)
4098 op2
= default_conversion (op2
);
4100 if (TREE_CODE (ifexp
) == ERROR_MARK
4101 || TREE_CODE (TREE_TYPE (op1
)) == ERROR_MARK
4102 || TREE_CODE (TREE_TYPE (op2
)) == ERROR_MARK
)
4103 return error_mark_node
;
4105 type1
= TREE_TYPE (op1
);
4106 code1
= TREE_CODE (type1
);
4107 type2
= TREE_TYPE (op2
);
4108 code2
= TREE_CODE (type2
);
4110 /* C90 does not permit non-lvalue arrays in conditional expressions.
4111 In C99 they will be pointers by now. */
4112 if (code1
== ARRAY_TYPE
|| code2
== ARRAY_TYPE
)
4114 error_at (colon_loc
, "non-lvalue array in conditional expression");
4115 return error_mark_node
;
4118 if ((TREE_CODE (op1
) == EXCESS_PRECISION_EXPR
4119 || TREE_CODE (op2
) == EXCESS_PRECISION_EXPR
)
4120 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4121 || code1
== COMPLEX_TYPE
)
4122 && (code2
== INTEGER_TYPE
|| code2
== REAL_TYPE
4123 || code2
== COMPLEX_TYPE
))
4125 semantic_result_type
= c_common_type (type1
, type2
);
4126 if (TREE_CODE (op1
) == EXCESS_PRECISION_EXPR
)
4128 op1
= TREE_OPERAND (op1
, 0);
4129 type1
= TREE_TYPE (op1
);
4130 gcc_assert (TREE_CODE (type1
) == code1
);
4132 if (TREE_CODE (op2
) == EXCESS_PRECISION_EXPR
)
4134 op2
= TREE_OPERAND (op2
, 0);
4135 type2
= TREE_TYPE (op2
);
4136 gcc_assert (TREE_CODE (type2
) == code2
);
4140 if (warn_cxx_compat
)
4142 tree t1
= op1_original_type
? op1_original_type
: TREE_TYPE (orig_op1
);
4143 tree t2
= op2_original_type
? op2_original_type
: TREE_TYPE (orig_op2
);
4145 if (TREE_CODE (t1
) == ENUMERAL_TYPE
4146 && TREE_CODE (t2
) == ENUMERAL_TYPE
4147 && TYPE_MAIN_VARIANT (t1
) != TYPE_MAIN_VARIANT (t2
))
4148 warning_at (colon_loc
, OPT_Wc___compat
,
4149 ("different enum types in conditional is "
4150 "invalid in C++: %qT vs %qT"),
4154 /* Quickly detect the usual case where op1 and op2 have the same type
4156 if (TYPE_MAIN_VARIANT (type1
) == TYPE_MAIN_VARIANT (type2
))
4159 result_type
= type1
;
4161 result_type
= TYPE_MAIN_VARIANT (type1
);
4163 else if ((code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
4164 || code1
== COMPLEX_TYPE
)
4165 && (code2
== INTEGER_TYPE
|| code2
== REAL_TYPE
4166 || code2
== COMPLEX_TYPE
))
4168 result_type
= c_common_type (type1
, type2
);
4169 do_warn_double_promotion (result_type
, type1
, type2
,
4170 "implicit conversion from %qT to %qT to "
4171 "match other result of conditional",
4174 /* If -Wsign-compare, warn here if type1 and type2 have
4175 different signedness. We'll promote the signed to unsigned
4176 and later code won't know it used to be different.
4177 Do this check on the original types, so that explicit casts
4178 will be considered, but default promotions won't. */
4179 if (c_inhibit_evaluation_warnings
== 0)
4181 int unsigned_op1
= TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
4182 int unsigned_op2
= TYPE_UNSIGNED (TREE_TYPE (orig_op2
));
4184 if (unsigned_op1
^ unsigned_op2
)
4188 /* Do not warn if the result type is signed, since the
4189 signed type will only be chosen if it can represent
4190 all the values of the unsigned type. */
4191 if (!TYPE_UNSIGNED (result_type
))
4195 bool op1_maybe_const
= true;
4196 bool op2_maybe_const
= true;
4198 /* Do not warn if the signed quantity is an
4199 unsuffixed integer literal (or some static
4200 constant expression involving such literals) and
4201 it is non-negative. This warning requires the
4202 operands to be folded for best results, so do
4203 that folding in this case even without
4204 warn_sign_compare to avoid warning options
4205 possibly affecting code generation. */
4206 c_inhibit_evaluation_warnings
4207 += (ifexp
== truthvalue_false_node
);
4208 op1
= c_fully_fold (op1
, require_constant_value
,
4210 c_inhibit_evaluation_warnings
4211 -= (ifexp
== truthvalue_false_node
);
4213 c_inhibit_evaluation_warnings
4214 += (ifexp
== truthvalue_true_node
);
4215 op2
= c_fully_fold (op2
, require_constant_value
,
4217 c_inhibit_evaluation_warnings
4218 -= (ifexp
== truthvalue_true_node
);
4220 if (warn_sign_compare
)
4223 && tree_expr_nonnegative_warnv_p (op1
, &ovf
))
4225 && tree_expr_nonnegative_warnv_p (op2
, &ovf
)))
4228 warning_at (colon_loc
, OPT_Wsign_compare
,
4229 ("signed and unsigned type in "
4230 "conditional expression"));
4232 if (!op1_maybe_const
|| TREE_CODE (op1
) != INTEGER_CST
)
4233 op1
= c_wrap_maybe_const (op1
, !op1_maybe_const
);
4234 if (!op2_maybe_const
|| TREE_CODE (op2
) != INTEGER_CST
)
4235 op2
= c_wrap_maybe_const (op2
, !op2_maybe_const
);
4240 else if (code1
== VOID_TYPE
|| code2
== VOID_TYPE
)
4242 if (code1
!= VOID_TYPE
|| code2
!= VOID_TYPE
)
4243 pedwarn (colon_loc
, OPT_Wpedantic
,
4244 "ISO C forbids conditional expr with only one void side");
4245 result_type
= void_type_node
;
4247 else if (code1
== POINTER_TYPE
&& code2
== POINTER_TYPE
)
4249 addr_space_t as1
= TYPE_ADDR_SPACE (TREE_TYPE (type1
));
4250 addr_space_t as2
= TYPE_ADDR_SPACE (TREE_TYPE (type2
));
4251 addr_space_t as_common
;
4253 if (comp_target_types (colon_loc
, type1
, type2
))
4254 result_type
= common_pointer_type (type1
, type2
);
4255 else if (null_pointer_constant_p (orig_op1
))
4256 result_type
= type2
;
4257 else if (null_pointer_constant_p (orig_op2
))
4258 result_type
= type1
;
4259 else if (!addr_space_superset (as1
, as2
, &as_common
))
4261 error_at (colon_loc
, "pointers to disjoint address spaces "
4262 "used in conditional expression");
4263 return error_mark_node
;
4265 else if (VOID_TYPE_P (TREE_TYPE (type1
)))
4267 if (TREE_CODE (TREE_TYPE (type2
)) == FUNCTION_TYPE
)
4268 pedwarn (colon_loc
, OPT_Wpedantic
,
4269 "ISO C forbids conditional expr between "
4270 "%<void *%> and function pointer");
4271 result_type
= build_pointer_type (qualify_type (TREE_TYPE (type1
),
4272 TREE_TYPE (type2
)));
4274 else if (VOID_TYPE_P (TREE_TYPE (type2
)))
4276 if (TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
)
4277 pedwarn (colon_loc
, OPT_Wpedantic
,
4278 "ISO C forbids conditional expr between "
4279 "%<void *%> and function pointer");
4280 result_type
= build_pointer_type (qualify_type (TREE_TYPE (type2
),
4281 TREE_TYPE (type1
)));
4283 /* Objective-C pointer comparisons are a bit more lenient. */
4284 else if (objc_have_common_type (type1
, type2
, -3, NULL_TREE
))
4285 result_type
= objc_common_type (type1
, type2
);
4288 int qual
= ENCODE_QUAL_ADDR_SPACE (as_common
);
4290 pedwarn (colon_loc
, 0,
4291 "pointer type mismatch in conditional expression");
4292 result_type
= build_pointer_type
4293 (build_qualified_type (void_type_node
, qual
));
4296 else if (code1
== POINTER_TYPE
&& code2
== INTEGER_TYPE
)
4298 if (!null_pointer_constant_p (orig_op2
))
4299 pedwarn (colon_loc
, 0,
4300 "pointer/integer type mismatch in conditional expression");
4303 op2
= null_pointer_node
;
4305 result_type
= type1
;
4307 else if (code2
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
4309 if (!null_pointer_constant_p (orig_op1
))
4310 pedwarn (colon_loc
, 0,
4311 "pointer/integer type mismatch in conditional expression");
4314 op1
= null_pointer_node
;
4316 result_type
= type2
;
4321 if (flag_cond_mismatch
)
4322 result_type
= void_type_node
;
4325 error_at (colon_loc
, "type mismatch in conditional expression");
4326 return error_mark_node
;
4330 /* Merge const and volatile flags of the incoming types. */
4332 = build_type_variant (result_type
,
4333 TYPE_READONLY (type1
) || TYPE_READONLY (type2
),
4334 TYPE_VOLATILE (type1
) || TYPE_VOLATILE (type2
));
4336 op1
= ep_convert_and_check (result_type
, op1
, semantic_result_type
);
4337 op2
= ep_convert_and_check (result_type
, op2
, semantic_result_type
);
4339 if (ifexp_bcp
&& ifexp
== truthvalue_true_node
)
4341 op2_int_operands
= true;
4342 op1
= c_fully_fold (op1
, require_constant_value
, NULL
);
4344 if (ifexp_bcp
&& ifexp
== truthvalue_false_node
)
4346 op1_int_operands
= true;
4347 op2
= c_fully_fold (op2
, require_constant_value
, NULL
);
4349 int_const
= int_operands
= (ifexp_int_operands
4351 && op2_int_operands
);
4354 int_const
= ((ifexp
== truthvalue_true_node
4355 && TREE_CODE (orig_op1
) == INTEGER_CST
4356 && !TREE_OVERFLOW (orig_op1
))
4357 || (ifexp
== truthvalue_false_node
4358 && TREE_CODE (orig_op2
) == INTEGER_CST
4359 && !TREE_OVERFLOW (orig_op2
)));
4361 if (int_const
|| (ifexp_bcp
&& TREE_CODE (ifexp
) == INTEGER_CST
))
4362 ret
= fold_build3_loc (colon_loc
, COND_EXPR
, result_type
, ifexp
, op1
, op2
);
4367 op1
= remove_c_maybe_const_expr (op1
);
4368 op2
= remove_c_maybe_const_expr (op2
);
4370 ret
= build3 (COND_EXPR
, result_type
, ifexp
, op1
, op2
);
4372 ret
= note_integer_operands (ret
);
4374 if (semantic_result_type
)
4375 ret
= build1 (EXCESS_PRECISION_EXPR
, semantic_result_type
, ret
);
4377 protected_set_expr_location (ret
, colon_loc
);
4381 /* Return a compound expression that performs two expressions and
4382 returns the value of the second of them.
4384 LOC is the location of the COMPOUND_EXPR. */
4387 build_compound_expr (location_t loc
, tree expr1
, tree expr2
)
4389 bool expr1_int_operands
, expr2_int_operands
;
4390 tree eptype
= NULL_TREE
;
4393 expr1_int_operands
= EXPR_INT_CONST_OPERANDS (expr1
);
4394 if (expr1_int_operands
)
4395 expr1
= remove_c_maybe_const_expr (expr1
);
4396 expr2_int_operands
= EXPR_INT_CONST_OPERANDS (expr2
);
4397 if (expr2_int_operands
)
4398 expr2
= remove_c_maybe_const_expr (expr2
);
4400 if (TREE_CODE (expr1
) == EXCESS_PRECISION_EXPR
)
4401 expr1
= TREE_OPERAND (expr1
, 0);
4402 if (TREE_CODE (expr2
) == EXCESS_PRECISION_EXPR
)
4404 eptype
= TREE_TYPE (expr2
);
4405 expr2
= TREE_OPERAND (expr2
, 0);
4408 if (!TREE_SIDE_EFFECTS (expr1
))
4410 /* The left-hand operand of a comma expression is like an expression
4411 statement: with -Wunused, we should warn if it doesn't have
4412 any side-effects, unless it was explicitly cast to (void). */
4413 if (warn_unused_value
)
4415 if (VOID_TYPE_P (TREE_TYPE (expr1
))
4416 && CONVERT_EXPR_P (expr1
))
4418 else if (VOID_TYPE_P (TREE_TYPE (expr1
))
4419 && TREE_CODE (expr1
) == COMPOUND_EXPR
4420 && CONVERT_EXPR_P (TREE_OPERAND (expr1
, 1)))
4421 ; /* (void) a, (void) b, c */
4423 warning_at (loc
, OPT_Wunused_value
,
4424 "left-hand operand of comma expression has no effect");
4428 /* With -Wunused, we should also warn if the left-hand operand does have
4429 side-effects, but computes a value which is not used. For example, in
4430 `foo() + bar(), baz()' the result of the `+' operator is not used,
4431 so we should issue a warning. */
4432 else if (warn_unused_value
)
4433 warn_if_unused_value (expr1
, loc
);
4435 if (expr2
== error_mark_node
)
4436 return error_mark_node
;
4438 ret
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr2
), expr1
, expr2
);
4441 && expr1_int_operands
4442 && expr2_int_operands
)
4443 ret
= note_integer_operands (ret
);
4446 ret
= build1 (EXCESS_PRECISION_EXPR
, eptype
, ret
);
4448 protected_set_expr_location (ret
, loc
);
4452 /* Issue -Wcast-qual warnings when appropriate. TYPE is the type to
4453 which we are casting. OTYPE is the type of the expression being
4454 cast. Both TYPE and OTYPE are pointer types. LOC is the location
4455 of the cast. -Wcast-qual appeared on the command line. Named
4456 address space qualifiers are not handled here, because they result
4457 in different warnings. */
4460 handle_warn_cast_qual (location_t loc
, tree type
, tree otype
)
4462 tree in_type
= type
;
4463 tree in_otype
= otype
;
4468 /* Check that the qualifiers on IN_TYPE are a superset of the
4469 qualifiers of IN_OTYPE. The outermost level of POINTER_TYPE
4470 nodes is uninteresting and we stop as soon as we hit a
4471 non-POINTER_TYPE node on either type. */
4474 in_otype
= TREE_TYPE (in_otype
);
4475 in_type
= TREE_TYPE (in_type
);
4477 /* GNU C allows cv-qualified function types. 'const' means the
4478 function is very pure, 'volatile' means it can't return. We
4479 need to warn when such qualifiers are added, not when they're
4481 if (TREE_CODE (in_otype
) == FUNCTION_TYPE
4482 && TREE_CODE (in_type
) == FUNCTION_TYPE
)
4483 added
|= (TYPE_QUALS_NO_ADDR_SPACE (in_type
)
4484 & ~TYPE_QUALS_NO_ADDR_SPACE (in_otype
));
4486 discarded
|= (TYPE_QUALS_NO_ADDR_SPACE (in_otype
)
4487 & ~TYPE_QUALS_NO_ADDR_SPACE (in_type
));
4489 while (TREE_CODE (in_type
) == POINTER_TYPE
4490 && TREE_CODE (in_otype
) == POINTER_TYPE
);
4493 warning_at (loc
, OPT_Wcast_qual
,
4494 "cast adds %q#v qualifier to function type", added
);
4497 /* There are qualifiers present in IN_OTYPE that are not present
4499 warning_at (loc
, OPT_Wcast_qual
,
4500 "cast discards %q#v qualifier from pointer target type",
4503 if (added
|| discarded
)
4506 /* A cast from **T to const **T is unsafe, because it can cause a
4507 const value to be changed with no additional warning. We only
4508 issue this warning if T is the same on both sides, and we only
4509 issue the warning if there are the same number of pointers on
4510 both sides, as otherwise the cast is clearly unsafe anyhow. A
4511 cast is unsafe when a qualifier is added at one level and const
4512 is not present at all outer levels.
4514 To issue this warning, we check at each level whether the cast
4515 adds new qualifiers not already seen. We don't need to special
4516 case function types, as they won't have the same
4517 TYPE_MAIN_VARIANT. */
4519 if (TYPE_MAIN_VARIANT (in_type
) != TYPE_MAIN_VARIANT (in_otype
))
4521 if (TREE_CODE (TREE_TYPE (type
)) != POINTER_TYPE
)
4526 is_const
= TYPE_READONLY (TREE_TYPE (in_type
));
4529 in_type
= TREE_TYPE (in_type
);
4530 in_otype
= TREE_TYPE (in_otype
);
4531 if ((TYPE_QUALS (in_type
) &~ TYPE_QUALS (in_otype
)) != 0
4534 warning_at (loc
, OPT_Wcast_qual
,
4535 "to be safe all intermediate pointers in cast from "
4536 "%qT to %qT must be %<const%> qualified",
4541 is_const
= TYPE_READONLY (in_type
);
4543 while (TREE_CODE (in_type
) == POINTER_TYPE
);
4546 /* Build an expression representing a cast to type TYPE of expression EXPR.
4547 LOC is the location of the cast-- typically the open paren of the cast. */
4550 build_c_cast (location_t loc
, tree type
, tree expr
)
4554 if (TREE_CODE (expr
) == EXCESS_PRECISION_EXPR
)
4555 expr
= TREE_OPERAND (expr
, 0);
4559 if (type
== error_mark_node
|| expr
== error_mark_node
)
4560 return error_mark_node
;
4562 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
4563 only in <protocol> qualifications. But when constructing cast expressions,
4564 the protocols do matter and must be kept around. */
4565 if (objc_is_object_ptr (type
) && objc_is_object_ptr (TREE_TYPE (expr
)))
4566 return build1 (NOP_EXPR
, type
, expr
);
4568 type
= TYPE_MAIN_VARIANT (type
);
4570 if (TREE_CODE (type
) == ARRAY_TYPE
)
4572 error_at (loc
, "cast specifies array type");
4573 return error_mark_node
;
4576 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4578 error_at (loc
, "cast specifies function type");
4579 return error_mark_node
;
4582 if (!VOID_TYPE_P (type
))
4584 value
= require_complete_type (value
);
4585 if (value
== error_mark_node
)
4586 return error_mark_node
;
4589 if (type
== TYPE_MAIN_VARIANT (TREE_TYPE (value
)))
4591 if (TREE_CODE (type
) == RECORD_TYPE
4592 || TREE_CODE (type
) == UNION_TYPE
)
4593 pedwarn (loc
, OPT_Wpedantic
,
4594 "ISO C forbids casting nonscalar to the same type");
4596 else if (TREE_CODE (type
) == UNION_TYPE
)
4600 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
4601 if (TREE_TYPE (field
) != error_mark_node
4602 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field
)),
4603 TYPE_MAIN_VARIANT (TREE_TYPE (value
))))
4609 bool maybe_const
= true;
4611 pedwarn (loc
, OPT_Wpedantic
, "ISO C forbids casts to union type");
4612 t
= c_fully_fold (value
, false, &maybe_const
);
4613 t
= build_constructor_single (type
, field
, t
);
4615 t
= c_wrap_maybe_const (t
, true);
4616 t
= digest_init (loc
, type
, t
,
4617 NULL_TREE
, false, true, 0);
4618 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
4621 error_at (loc
, "cast to union type from type not present in union");
4622 return error_mark_node
;
4628 if (type
== void_type_node
)
4630 tree t
= build1 (CONVERT_EXPR
, type
, value
);
4631 SET_EXPR_LOCATION (t
, loc
);
4635 otype
= TREE_TYPE (value
);
4637 /* Optionally warn about potentially worrisome casts. */
4639 && TREE_CODE (type
) == POINTER_TYPE
4640 && TREE_CODE (otype
) == POINTER_TYPE
)
4641 handle_warn_cast_qual (loc
, type
, otype
);
4643 /* Warn about conversions between pointers to disjoint
4645 if (TREE_CODE (type
) == POINTER_TYPE
4646 && TREE_CODE (otype
) == POINTER_TYPE
4647 && !null_pointer_constant_p (value
))
4649 addr_space_t as_to
= TYPE_ADDR_SPACE (TREE_TYPE (type
));
4650 addr_space_t as_from
= TYPE_ADDR_SPACE (TREE_TYPE (otype
));
4651 addr_space_t as_common
;
4653 if (!addr_space_superset (as_to
, as_from
, &as_common
))
4655 if (ADDR_SPACE_GENERIC_P (as_from
))
4656 warning_at (loc
, 0, "cast to %s address space pointer "
4657 "from disjoint generic address space pointer",
4658 c_addr_space_name (as_to
));
4660 else if (ADDR_SPACE_GENERIC_P (as_to
))
4661 warning_at (loc
, 0, "cast to generic address space pointer "
4662 "from disjoint %s address space pointer",
4663 c_addr_space_name (as_from
));
4666 warning_at (loc
, 0, "cast to %s address space pointer "
4667 "from disjoint %s address space pointer",
4668 c_addr_space_name (as_to
),
4669 c_addr_space_name (as_from
));
4673 /* Warn about possible alignment problems. */
4674 if (STRICT_ALIGNMENT
4675 && TREE_CODE (type
) == POINTER_TYPE
4676 && TREE_CODE (otype
) == POINTER_TYPE
4677 && TREE_CODE (TREE_TYPE (otype
)) != VOID_TYPE
4678 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
4679 /* Don't warn about opaque types, where the actual alignment
4680 restriction is unknown. */
4681 && !((TREE_CODE (TREE_TYPE (otype
)) == UNION_TYPE
4682 || TREE_CODE (TREE_TYPE (otype
)) == RECORD_TYPE
)
4683 && TYPE_MODE (TREE_TYPE (otype
)) == VOIDmode
)
4684 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (otype
)))
4685 warning_at (loc
, OPT_Wcast_align
,
4686 "cast increases required alignment of target type");
4688 if (TREE_CODE (type
) == INTEGER_TYPE
4689 && TREE_CODE (otype
) == POINTER_TYPE
4690 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
))
4691 /* Unlike conversion of integers to pointers, where the
4692 warning is disabled for converting constants because
4693 of cases such as SIG_*, warn about converting constant
4694 pointers to integers. In some cases it may cause unwanted
4695 sign extension, and a warning is appropriate. */
4696 warning_at (loc
, OPT_Wpointer_to_int_cast
,
4697 "cast from pointer to integer of different size");
4699 if (TREE_CODE (value
) == CALL_EXPR
4700 && TREE_CODE (type
) != TREE_CODE (otype
))
4701 warning_at (loc
, OPT_Wbad_function_cast
,
4702 "cast from function call of type %qT "
4703 "to non-matching type %qT", otype
, type
);
4705 if (TREE_CODE (type
) == POINTER_TYPE
4706 && TREE_CODE (otype
) == INTEGER_TYPE
4707 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
4708 /* Don't warn about converting any constant. */
4709 && !TREE_CONSTANT (value
))
4711 OPT_Wint_to_pointer_cast
, "cast to pointer from integer "
4712 "of different size");
4714 if (warn_strict_aliasing
<= 2)
4715 strict_aliasing_warning (otype
, type
, expr
);
4717 /* If pedantic, warn for conversions between function and object
4718 pointer types, except for converting a null pointer constant
4719 to function pointer type. */
4721 && TREE_CODE (type
) == POINTER_TYPE
4722 && TREE_CODE (otype
) == POINTER_TYPE
4723 && TREE_CODE (TREE_TYPE (otype
)) == FUNCTION_TYPE
4724 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
4725 pedwarn (loc
, OPT_Wpedantic
, "ISO C forbids "
4726 "conversion of function pointer to object pointer type");
4729 && TREE_CODE (type
) == POINTER_TYPE
4730 && TREE_CODE (otype
) == POINTER_TYPE
4731 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
4732 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
4733 && !null_pointer_constant_p (value
))
4734 pedwarn (loc
, OPT_Wpedantic
, "ISO C forbids "
4735 "conversion of object pointer to function pointer type");
4738 value
= convert (type
, value
);
4740 /* Ignore any integer overflow caused by the cast. */
4741 if (TREE_CODE (value
) == INTEGER_CST
&& !FLOAT_TYPE_P (otype
))
4743 if (CONSTANT_CLASS_P (ovalue
) && TREE_OVERFLOW (ovalue
))
4745 if (!TREE_OVERFLOW (value
))
4747 /* Avoid clobbering a shared constant. */
4748 value
= copy_node (value
);
4749 TREE_OVERFLOW (value
) = TREE_OVERFLOW (ovalue
);
4752 else if (TREE_OVERFLOW (value
))
4753 /* Reset VALUE's overflow flags, ensuring constant sharing. */
4754 value
= build_int_cst_wide (TREE_TYPE (value
),
4755 TREE_INT_CST_LOW (value
),
4756 TREE_INT_CST_HIGH (value
));
4760 /* Don't let a cast be an lvalue. */
4762 value
= non_lvalue_loc (loc
, value
);
4764 /* Don't allow the results of casting to floating-point or complex
4765 types be confused with actual constants, or casts involving
4766 integer and pointer types other than direct integer-to-integer
4767 and integer-to-pointer be confused with integer constant
4768 expressions and null pointer constants. */
4769 if (TREE_CODE (value
) == REAL_CST
4770 || TREE_CODE (value
) == COMPLEX_CST
4771 || (TREE_CODE (value
) == INTEGER_CST
4772 && !((TREE_CODE (expr
) == INTEGER_CST
4773 && INTEGRAL_TYPE_P (TREE_TYPE (expr
)))
4774 || TREE_CODE (expr
) == REAL_CST
4775 || TREE_CODE (expr
) == COMPLEX_CST
)))
4776 value
= build1 (NOP_EXPR
, type
, value
);
4778 if (CAN_HAVE_LOCATION_P (value
))
4779 SET_EXPR_LOCATION (value
, loc
);
4783 /* Interpret a cast of expression EXPR to type TYPE. LOC is the
4784 location of the open paren of the cast, or the position of the cast
4787 c_cast_expr (location_t loc
, struct c_type_name
*type_name
, tree expr
)
4790 tree type_expr
= NULL_TREE
;
4791 bool type_expr_const
= true;
4793 int saved_wsp
= warn_strict_prototypes
;
4795 /* This avoids warnings about unprototyped casts on
4796 integers. E.g. "#define SIG_DFL (void(*)())0". */
4797 if (TREE_CODE (expr
) == INTEGER_CST
)
4798 warn_strict_prototypes
= 0;
4799 type
= groktypename (type_name
, &type_expr
, &type_expr_const
);
4800 warn_strict_prototypes
= saved_wsp
;
4802 ret
= build_c_cast (loc
, type
, expr
);
4805 bool inner_expr_const
= true;
4806 ret
= c_fully_fold (ret
, require_constant_value
, &inner_expr_const
);
4807 ret
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (ret
), type_expr
, ret
);
4808 C_MAYBE_CONST_EXPR_NON_CONST (ret
) = !(type_expr_const
4809 && inner_expr_const
);
4810 SET_EXPR_LOCATION (ret
, loc
);
4813 if (CAN_HAVE_LOCATION_P (ret
) && !EXPR_HAS_LOCATION (ret
))
4814 SET_EXPR_LOCATION (ret
, loc
);
4816 /* C++ does not permits types to be defined in a cast, but it
4817 allows references to incomplete types. */
4818 if (warn_cxx_compat
&& type_name
->specs
->typespec_kind
== ctsk_tagdef
)
4819 warning_at (loc
, OPT_Wc___compat
,
4820 "defining a type in a cast is invalid in C++");
4825 /* Build an assignment expression of lvalue LHS from value RHS.
4826 If LHS_ORIGTYPE is not NULL, it is the original type of LHS, which
4827 may differ from TREE_TYPE (LHS) for an enum bitfield.
4828 MODIFYCODE is the code for a binary operator that we use
4829 to combine the old value of LHS with RHS to get the new value.
4830 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
4831 If RHS_ORIGTYPE is not NULL_TREE, it is the original type of RHS,
4832 which may differ from TREE_TYPE (RHS) for an enum value.
4834 LOCATION is the location of the MODIFYCODE operator.
4835 RHS_LOC is the location of the RHS. */
4838 build_modify_expr (location_t location
, tree lhs
, tree lhs_origtype
,
4839 enum tree_code modifycode
,
4840 location_t rhs_loc
, tree rhs
, tree rhs_origtype
)
4844 tree rhs_semantic_type
= NULL_TREE
;
4845 tree lhstype
= TREE_TYPE (lhs
);
4846 tree olhstype
= lhstype
;
4849 /* Types that aren't fully specified cannot be used in assignments. */
4850 lhs
= require_complete_type (lhs
);
4852 /* Avoid duplicate error messages from operands that had errors. */
4853 if (TREE_CODE (lhs
) == ERROR_MARK
|| TREE_CODE (rhs
) == ERROR_MARK
)
4854 return error_mark_node
;
4856 /* For ObjC properties, defer this check. */
4857 if (!objc_is_property_ref (lhs
) && !lvalue_or_else (location
, lhs
, lv_assign
))
4858 return error_mark_node
;
4860 if (TREE_CODE (rhs
) == EXCESS_PRECISION_EXPR
)
4862 rhs_semantic_type
= TREE_TYPE (rhs
);
4863 rhs
= TREE_OPERAND (rhs
, 0);
4868 if (TREE_CODE (lhs
) == C_MAYBE_CONST_EXPR
)
4870 tree inner
= build_modify_expr (location
, C_MAYBE_CONST_EXPR_EXPR (lhs
),
4871 lhs_origtype
, modifycode
, rhs_loc
, rhs
,
4873 if (inner
== error_mark_node
)
4874 return error_mark_node
;
4875 result
= build2 (C_MAYBE_CONST_EXPR
, TREE_TYPE (inner
),
4876 C_MAYBE_CONST_EXPR_PRE (lhs
), inner
);
4877 gcc_assert (!C_MAYBE_CONST_EXPR_INT_OPERANDS (lhs
));
4878 C_MAYBE_CONST_EXPR_NON_CONST (result
) = 1;
4879 protected_set_expr_location (result
, location
);
4883 /* If a binary op has been requested, combine the old LHS value with the RHS
4884 producing the value we should actually store into the LHS. */
4886 if (modifycode
!= NOP_EXPR
)
4888 lhs
= c_fully_fold (lhs
, false, NULL
);
4889 lhs
= stabilize_reference (lhs
);
4890 newrhs
= build_binary_op (location
,
4891 modifycode
, lhs
, rhs
, 1);
4893 /* The original type of the right hand side is no longer
4895 rhs_origtype
= NULL_TREE
;
4898 if (c_dialect_objc ())
4900 /* Check if we are modifying an Objective-C property reference;
4901 if so, we need to generate setter calls. */
4902 result
= objc_maybe_build_modify_expr (lhs
, newrhs
);
4906 /* Else, do the check that we postponed for Objective-C. */
4907 if (!lvalue_or_else (location
, lhs
, lv_assign
))
4908 return error_mark_node
;
4911 /* Give an error for storing in something that is 'const'. */
4913 if (TYPE_READONLY (lhstype
)
4914 || ((TREE_CODE (lhstype
) == RECORD_TYPE
4915 || TREE_CODE (lhstype
) == UNION_TYPE
)
4916 && C_TYPE_FIELDS_READONLY (lhstype
)))
4918 readonly_error (lhs
, lv_assign
);
4919 return error_mark_node
;
4921 else if (TREE_READONLY (lhs
))
4922 readonly_warning (lhs
, lv_assign
);
4924 /* If storing into a structure or union member,
4925 it has probably been given type `int'.
4926 Compute the type that would go with
4927 the actual amount of storage the member occupies. */
4929 if (TREE_CODE (lhs
) == COMPONENT_REF
4930 && (TREE_CODE (lhstype
) == INTEGER_TYPE
4931 || TREE_CODE (lhstype
) == BOOLEAN_TYPE
4932 || TREE_CODE (lhstype
) == REAL_TYPE
4933 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
4934 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
4936 /* If storing in a field that is in actuality a short or narrower than one,
4937 we must store in the field in its actual type. */
4939 if (lhstype
!= TREE_TYPE (lhs
))
4941 lhs
= copy_node (lhs
);
4942 TREE_TYPE (lhs
) = lhstype
;
4945 /* Issue -Wc++-compat warnings about an assignment to an enum type
4946 when LHS does not have its original type. This happens for,
4947 e.g., an enum bitfield in a struct. */
4949 && lhs_origtype
!= NULL_TREE
4950 && lhs_origtype
!= lhstype
4951 && TREE_CODE (lhs_origtype
) == ENUMERAL_TYPE
)
4953 tree checktype
= (rhs_origtype
!= NULL_TREE
4956 if (checktype
!= error_mark_node
4957 && TYPE_MAIN_VARIANT (checktype
) != TYPE_MAIN_VARIANT (lhs_origtype
))
4958 warning_at (location
, OPT_Wc___compat
,
4959 "enum conversion in assignment is invalid in C++");
4962 /* Convert new value to destination type. Fold it first, then
4963 restore any excess precision information, for the sake of
4964 conversion warnings. */
4966 npc
= null_pointer_constant_p (newrhs
);
4967 newrhs
= c_fully_fold (newrhs
, false, NULL
);
4968 if (rhs_semantic_type
)
4969 newrhs
= build1 (EXCESS_PRECISION_EXPR
, rhs_semantic_type
, newrhs
);
4970 newrhs
= convert_for_assignment (location
, lhstype
, newrhs
, rhs_origtype
,
4971 ic_assign
, npc
, NULL_TREE
, NULL_TREE
, 0);
4972 if (TREE_CODE (newrhs
) == ERROR_MARK
)
4973 return error_mark_node
;
4975 /* Emit ObjC write barrier, if necessary. */
4976 if (c_dialect_objc () && flag_objc_gc
)
4978 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
4981 protected_set_expr_location (result
, location
);
4986 /* Scan operands. */
4988 result
= build2 (MODIFY_EXPR
, lhstype
, lhs
, newrhs
);
4989 TREE_SIDE_EFFECTS (result
) = 1;
4990 protected_set_expr_location (result
, location
);
4992 /* If we got the LHS in a different type for storing in,
4993 convert the result back to the nominal type of LHS
4994 so that the value we return always has the same type
4995 as the LHS argument. */
4997 if (olhstype
== TREE_TYPE (result
))
5000 result
= convert_for_assignment (location
, olhstype
, result
, rhs_origtype
,
5001 ic_assign
, false, NULL_TREE
, NULL_TREE
, 0);
5002 protected_set_expr_location (result
, location
);
5006 /* Return whether STRUCT_TYPE has an anonymous field with type TYPE.
5007 This is used to implement -fplan9-extensions. */
5010 find_anonymous_field_with_type (tree struct_type
, tree type
)
5015 gcc_assert (TREE_CODE (struct_type
) == RECORD_TYPE
5016 || TREE_CODE (struct_type
) == UNION_TYPE
);
5018 for (field
= TYPE_FIELDS (struct_type
);
5020 field
= TREE_CHAIN (field
))
5022 if (DECL_NAME (field
) == NULL
5023 && comptypes (type
, TYPE_MAIN_VARIANT (TREE_TYPE (field
))))
5029 else if (DECL_NAME (field
) == NULL
5030 && (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
5031 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
5032 && find_anonymous_field_with_type (TREE_TYPE (field
), type
))
5042 /* RHS is an expression whose type is pointer to struct. If there is
5043 an anonymous field in RHS with type TYPE, then return a pointer to
5044 that field in RHS. This is used with -fplan9-extensions. This
5045 returns NULL if no conversion could be found. */
5048 convert_to_anonymous_field (location_t location
, tree type
, tree rhs
)
5050 tree rhs_struct_type
, lhs_main_type
;
5051 tree field
, found_field
;
5052 bool found_sub_field
;
5055 gcc_assert (POINTER_TYPE_P (TREE_TYPE (rhs
)));
5056 rhs_struct_type
= TREE_TYPE (TREE_TYPE (rhs
));
5057 gcc_assert (TREE_CODE (rhs_struct_type
) == RECORD_TYPE
5058 || TREE_CODE (rhs_struct_type
) == UNION_TYPE
);
5060 gcc_assert (POINTER_TYPE_P (type
));
5061 lhs_main_type
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
5063 found_field
= NULL_TREE
;
5064 found_sub_field
= false;
5065 for (field
= TYPE_FIELDS (rhs_struct_type
);
5067 field
= TREE_CHAIN (field
))
5069 if (DECL_NAME (field
) != NULL_TREE
5070 || (TREE_CODE (TREE_TYPE (field
)) != RECORD_TYPE
5071 && TREE_CODE (TREE_TYPE (field
)) != UNION_TYPE
))
5073 if (comptypes (lhs_main_type
, TYPE_MAIN_VARIANT (TREE_TYPE (field
))))
5075 if (found_field
!= NULL_TREE
)
5077 found_field
= field
;
5079 else if (find_anonymous_field_with_type (TREE_TYPE (field
),
5082 if (found_field
!= NULL_TREE
)
5084 found_field
= field
;
5085 found_sub_field
= true;
5089 if (found_field
== NULL_TREE
)
5092 ret
= fold_build3_loc (location
, COMPONENT_REF
, TREE_TYPE (found_field
),
5093 build_fold_indirect_ref (rhs
), found_field
,
5095 ret
= build_fold_addr_expr_loc (location
, ret
);
5097 if (found_sub_field
)
5099 ret
= convert_to_anonymous_field (location
, type
, ret
);
5100 gcc_assert (ret
!= NULL_TREE
);
5106 /* Convert value RHS to type TYPE as preparation for an assignment to
5107 an lvalue of type TYPE. If ORIGTYPE is not NULL_TREE, it is the
5108 original type of RHS; this differs from TREE_TYPE (RHS) for enum
5109 types. NULL_POINTER_CONSTANT says whether RHS was a null pointer
5110 constant before any folding.
5111 The real work of conversion is done by `convert'.
5112 The purpose of this function is to generate error messages
5113 for assignments that are not allowed in C.
5114 ERRTYPE says whether it is argument passing, assignment,
5115 initialization or return.
5117 LOCATION is the location of the RHS.
5118 FUNCTION is a tree for the function being called.
5119 PARMNUM is the number of the argument, for printing in error messages. */
5122 convert_for_assignment (location_t location
, tree type
, tree rhs
,
5123 tree origtype
, enum impl_conv errtype
,
5124 bool null_pointer_constant
, tree fundecl
,
5125 tree function
, int parmnum
)
5127 enum tree_code codel
= TREE_CODE (type
);
5128 tree orig_rhs
= rhs
;
5130 enum tree_code coder
;
5131 tree rname
= NULL_TREE
;
5132 bool objc_ok
= false;
5134 if (errtype
== ic_argpass
)
5137 /* Change pointer to function to the function itself for
5139 if (TREE_CODE (function
) == ADDR_EXPR
5140 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
5141 function
= TREE_OPERAND (function
, 0);
5143 /* Handle an ObjC selector specially for diagnostics. */
5144 selector
= objc_message_selector ();
5146 if (selector
&& parmnum
> 2)
5153 /* This macro is used to emit diagnostics to ensure that all format
5154 strings are complete sentences, visible to gettext and checked at
5156 #define WARN_FOR_ASSIGNMENT(LOCATION, OPT, AR, AS, IN, RE) \
5161 if (pedwarn (LOCATION, OPT, AR, parmnum, rname)) \
5162 inform ((fundecl && !DECL_IS_BUILTIN (fundecl)) \
5163 ? DECL_SOURCE_LOCATION (fundecl) : LOCATION, \
5164 "expected %qT but argument is of type %qT", \
5168 pedwarn (LOCATION, OPT, AS); \
5171 pedwarn_init (LOCATION, OPT, IN); \
5174 pedwarn (LOCATION, OPT, RE); \
5177 gcc_unreachable (); \
5181 /* This macro is used to emit diagnostics to ensure that all format
5182 strings are complete sentences, visible to gettext and checked at
5183 compile time. It is the same as WARN_FOR_ASSIGNMENT but with an
5184 extra parameter to enumerate qualifiers. */
5186 #define WARN_FOR_QUALIFIERS(LOCATION, OPT, AR, AS, IN, RE, QUALS) \
5191 if (pedwarn (LOCATION, OPT, AR, parmnum, rname, QUALS)) \
5192 inform ((fundecl && !DECL_IS_BUILTIN (fundecl)) \
5193 ? DECL_SOURCE_LOCATION (fundecl) : LOCATION, \
5194 "expected %qT but argument is of type %qT", \
5198 pedwarn (LOCATION, OPT, AS, QUALS); \
5201 pedwarn (LOCATION, OPT, IN, QUALS); \
5204 pedwarn (LOCATION, OPT, RE, QUALS); \
5207 gcc_unreachable (); \
5211 if (TREE_CODE (rhs
) == EXCESS_PRECISION_EXPR
)
5212 rhs
= TREE_OPERAND (rhs
, 0);
5214 rhstype
= TREE_TYPE (rhs
);
5215 coder
= TREE_CODE (rhstype
);
5217 if (coder
== ERROR_MARK
)
5218 return error_mark_node
;
5220 if (c_dialect_objc ())
5243 objc_ok
= objc_compare_types (type
, rhstype
, parmno
, rname
);
5246 if (warn_cxx_compat
)
5248 tree checktype
= origtype
!= NULL_TREE
? origtype
: rhstype
;
5249 if (checktype
!= error_mark_node
5250 && TREE_CODE (type
) == ENUMERAL_TYPE
5251 && TYPE_MAIN_VARIANT (checktype
) != TYPE_MAIN_VARIANT (type
))
5253 WARN_FOR_ASSIGNMENT (input_location
, OPT_Wc___compat
,
5254 G_("enum conversion when passing argument "
5255 "%d of %qE is invalid in C++"),
5256 G_("enum conversion in assignment is "
5258 G_("enum conversion in initialization is "
5260 G_("enum conversion in return is "
5265 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (rhstype
))
5268 if (coder
== VOID_TYPE
)
5270 /* Except for passing an argument to an unprototyped function,
5271 this is a constraint violation. When passing an argument to
5272 an unprototyped function, it is compile-time undefined;
5273 making it a constraint in that case was rejected in
5275 error_at (location
, "void value not ignored as it ought to be");
5276 return error_mark_node
;
5278 rhs
= require_complete_type (rhs
);
5279 if (rhs
== error_mark_node
)
5280 return error_mark_node
;
5281 /* A non-reference type can convert to a reference. This handles
5282 va_start, va_copy and possibly port built-ins. */
5283 if (codel
== REFERENCE_TYPE
&& coder
!= REFERENCE_TYPE
)
5285 if (!lvalue_p (rhs
))
5287 error_at (location
, "cannot pass rvalue to reference parameter");
5288 return error_mark_node
;
5290 if (!c_mark_addressable (rhs
))
5291 return error_mark_node
;
5292 rhs
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (rhs
)), rhs
);
5293 SET_EXPR_LOCATION (rhs
, location
);
5295 rhs
= convert_for_assignment (location
, build_pointer_type (TREE_TYPE (type
)),
5296 rhs
, origtype
, errtype
, null_pointer_constant
,
5297 fundecl
, function
, parmnum
);
5298 if (rhs
== error_mark_node
)
5299 return error_mark_node
;
5301 rhs
= build1 (NOP_EXPR
, type
, rhs
);
5302 SET_EXPR_LOCATION (rhs
, location
);
5305 /* Some types can interconvert without explicit casts. */
5306 else if (codel
== VECTOR_TYPE
&& coder
== VECTOR_TYPE
5307 && vector_types_convertible_p (type
, TREE_TYPE (rhs
), true))
5308 return convert (type
, rhs
);
5309 /* Arithmetic types all interconvert, and enum is treated like int. */
5310 else if ((codel
== INTEGER_TYPE
|| codel
== REAL_TYPE
5311 || codel
== FIXED_POINT_TYPE
5312 || codel
== ENUMERAL_TYPE
|| codel
== COMPLEX_TYPE
5313 || codel
== BOOLEAN_TYPE
)
5314 && (coder
== INTEGER_TYPE
|| coder
== REAL_TYPE
5315 || coder
== FIXED_POINT_TYPE
5316 || coder
== ENUMERAL_TYPE
|| coder
== COMPLEX_TYPE
5317 || coder
== BOOLEAN_TYPE
))
5320 bool save
= in_late_binary_op
;
5321 if (codel
== BOOLEAN_TYPE
|| codel
== COMPLEX_TYPE
)
5322 in_late_binary_op
= true;
5323 ret
= convert_and_check (type
, orig_rhs
);
5324 if (codel
== BOOLEAN_TYPE
|| codel
== COMPLEX_TYPE
)
5325 in_late_binary_op
= save
;
5329 /* Aggregates in different TUs might need conversion. */
5330 if ((codel
== RECORD_TYPE
|| codel
== UNION_TYPE
)
5332 && comptypes (type
, rhstype
))
5333 return convert_and_check (type
, rhs
);
5335 /* Conversion to a transparent union or record from its member types.
5336 This applies only to function arguments. */
5337 if (((codel
== UNION_TYPE
|| codel
== RECORD_TYPE
)
5338 && TYPE_TRANSPARENT_AGGR (type
))
5339 && errtype
== ic_argpass
)
5341 tree memb
, marginal_memb
= NULL_TREE
;
5343 for (memb
= TYPE_FIELDS (type
); memb
; memb
= DECL_CHAIN (memb
))
5345 tree memb_type
= TREE_TYPE (memb
);
5347 if (comptypes (TYPE_MAIN_VARIANT (memb_type
),
5348 TYPE_MAIN_VARIANT (rhstype
)))
5351 if (TREE_CODE (memb_type
) != POINTER_TYPE
)
5354 if (coder
== POINTER_TYPE
)
5356 tree ttl
= TREE_TYPE (memb_type
);
5357 tree ttr
= TREE_TYPE (rhstype
);
5359 /* Any non-function converts to a [const][volatile] void *
5360 and vice versa; otherwise, targets must be the same.
5361 Meanwhile, the lhs target must have all the qualifiers of
5363 if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
5364 || comp_target_types (location
, memb_type
, rhstype
))
5366 /* If this type won't generate any warnings, use it. */
5367 if (TYPE_QUALS (ttl
) == TYPE_QUALS (ttr
)
5368 || ((TREE_CODE (ttr
) == FUNCTION_TYPE
5369 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
5370 ? ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
5371 == TYPE_QUALS (ttr
))
5372 : ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
5373 == TYPE_QUALS (ttl
))))
5376 /* Keep looking for a better type, but remember this one. */
5378 marginal_memb
= memb
;
5382 /* Can convert integer zero to any pointer type. */
5383 if (null_pointer_constant
)
5385 rhs
= null_pointer_node
;
5390 if (memb
|| marginal_memb
)
5394 /* We have only a marginally acceptable member type;
5395 it needs a warning. */
5396 tree ttl
= TREE_TYPE (TREE_TYPE (marginal_memb
));
5397 tree ttr
= TREE_TYPE (rhstype
);
5399 /* Const and volatile mean something different for function
5400 types, so the usual warnings are not appropriate. */
5401 if (TREE_CODE (ttr
) == FUNCTION_TYPE
5402 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
5404 /* Because const and volatile on functions are
5405 restrictions that say the function will not do
5406 certain things, it is okay to use a const or volatile
5407 function where an ordinary one is wanted, but not
5409 if (TYPE_QUALS_NO_ADDR_SPACE (ttl
)
5410 & ~TYPE_QUALS_NO_ADDR_SPACE (ttr
))
5411 WARN_FOR_QUALIFIERS (location
, 0,
5412 G_("passing argument %d of %qE "
5413 "makes %q#v qualified function "
5414 "pointer from unqualified"),
5415 G_("assignment makes %q#v qualified "
5416 "function pointer from "
5418 G_("initialization makes %q#v qualified "
5419 "function pointer from "
5421 G_("return makes %q#v qualified function "
5422 "pointer from unqualified"),
5423 TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
));
5425 else if (TYPE_QUALS_NO_ADDR_SPACE (ttr
)
5426 & ~TYPE_QUALS_NO_ADDR_SPACE (ttl
))
5427 WARN_FOR_QUALIFIERS (location
, 0,
5428 G_("passing argument %d of %qE discards "
5429 "%qv qualifier from pointer target type"),
5430 G_("assignment discards %qv qualifier "
5431 "from pointer target type"),
5432 G_("initialization discards %qv qualifier "
5433 "from pointer target type"),
5434 G_("return discards %qv qualifier from "
5435 "pointer target type"),
5436 TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
));
5438 memb
= marginal_memb
;
5441 if (!fundecl
|| !DECL_IN_SYSTEM_HEADER (fundecl
))
5442 pedwarn (location
, OPT_Wpedantic
,
5443 "ISO C prohibits argument conversion to union type");
5445 rhs
= fold_convert_loc (location
, TREE_TYPE (memb
), rhs
);
5446 return build_constructor_single (type
, memb
, rhs
);
5450 /* Conversions among pointers */
5451 else if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
5452 && (coder
== codel
))
5454 tree ttl
= TREE_TYPE (type
);
5455 tree ttr
= TREE_TYPE (rhstype
);
5458 bool is_opaque_pointer
;
5459 int target_cmp
= 0; /* Cache comp_target_types () result. */
5463 if (TREE_CODE (mvl
) != ARRAY_TYPE
)
5464 mvl
= TYPE_MAIN_VARIANT (mvl
);
5465 if (TREE_CODE (mvr
) != ARRAY_TYPE
)
5466 mvr
= TYPE_MAIN_VARIANT (mvr
);
5467 /* Opaque pointers are treated like void pointers. */
5468 is_opaque_pointer
= vector_targets_convertible_p (ttl
, ttr
);
5470 /* The Plan 9 compiler permits a pointer to a struct to be
5471 automatically converted into a pointer to an anonymous field
5472 within the struct. */
5473 if (flag_plan9_extensions
5474 && (TREE_CODE (mvl
) == RECORD_TYPE
|| TREE_CODE(mvl
) == UNION_TYPE
)
5475 && (TREE_CODE (mvr
) == RECORD_TYPE
|| TREE_CODE(mvr
) == UNION_TYPE
)
5478 tree new_rhs
= convert_to_anonymous_field (location
, type
, rhs
);
5479 if (new_rhs
!= NULL_TREE
)
5482 rhstype
= TREE_TYPE (rhs
);
5483 coder
= TREE_CODE (rhstype
);
5484 ttr
= TREE_TYPE (rhstype
);
5485 mvr
= TYPE_MAIN_VARIANT (ttr
);
5489 /* C++ does not allow the implicit conversion void* -> T*. However,
5490 for the purpose of reducing the number of false positives, we
5491 tolerate the special case of
5495 where NULL is typically defined in C to be '(void *) 0'. */
5496 if (VOID_TYPE_P (ttr
) && rhs
!= null_pointer_node
&& !VOID_TYPE_P (ttl
))
5497 warning_at (location
, OPT_Wc___compat
,
5498 "request for implicit conversion "
5499 "from %qT to %qT not permitted in C++", rhstype
, type
);
5501 /* See if the pointers point to incompatible address spaces. */
5502 asl
= TYPE_ADDR_SPACE (ttl
);
5503 asr
= TYPE_ADDR_SPACE (ttr
);
5504 if (!null_pointer_constant_p (rhs
)
5505 && asr
!= asl
&& !targetm
.addr_space
.subset_p (asr
, asl
))
5510 error_at (location
, "passing argument %d of %qE from pointer to "
5511 "non-enclosed address space", parmnum
, rname
);
5514 error_at (location
, "assignment from pointer to "
5515 "non-enclosed address space");
5518 error_at (location
, "initialization from pointer to "
5519 "non-enclosed address space");
5522 error_at (location
, "return from pointer to "
5523 "non-enclosed address space");
5528 return error_mark_node
;
5531 /* Check if the right-hand side has a format attribute but the
5532 left-hand side doesn't. */
5533 if (warn_suggest_attribute_format
5534 && check_missing_format_attribute (type
, rhstype
))
5539 warning_at (location
, OPT_Wsuggest_attribute_format
,
5540 "argument %d of %qE might be "
5541 "a candidate for a format attribute",
5545 warning_at (location
, OPT_Wsuggest_attribute_format
,
5546 "assignment left-hand side might be "
5547 "a candidate for a format attribute");
5550 warning_at (location
, OPT_Wsuggest_attribute_format
,
5551 "initialization left-hand side might be "
5552 "a candidate for a format attribute");
5555 warning_at (location
, OPT_Wsuggest_attribute_format
,
5556 "return type might be "
5557 "a candidate for a format attribute");
5564 /* Any non-function converts to a [const][volatile] void *
5565 and vice versa; otherwise, targets must be the same.
5566 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
5567 if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
5568 || (target_cmp
= comp_target_types (location
, type
, rhstype
))
5569 || is_opaque_pointer
5570 || ((c_common_unsigned_type (mvl
)
5571 == c_common_unsigned_type (mvr
))
5572 && c_common_signed_type (mvl
)
5573 == c_common_signed_type (mvr
)))
5576 && ((VOID_TYPE_P (ttl
) && TREE_CODE (ttr
) == FUNCTION_TYPE
)
5579 && !null_pointer_constant
5580 && TREE_CODE (ttl
) == FUNCTION_TYPE
)))
5581 WARN_FOR_ASSIGNMENT (location
, OPT_Wpedantic
,
5582 G_("ISO C forbids passing argument %d of "
5583 "%qE between function pointer "
5585 G_("ISO C forbids assignment between "
5586 "function pointer and %<void *%>"),
5587 G_("ISO C forbids initialization between "
5588 "function pointer and %<void *%>"),
5589 G_("ISO C forbids return between function "
5590 "pointer and %<void *%>"));
5591 /* Const and volatile mean something different for function types,
5592 so the usual warnings are not appropriate. */
5593 else if (TREE_CODE (ttr
) != FUNCTION_TYPE
5594 && TREE_CODE (ttl
) != FUNCTION_TYPE
)
5596 if (TYPE_QUALS_NO_ADDR_SPACE (ttr
)
5597 & ~TYPE_QUALS_NO_ADDR_SPACE (ttl
))
5599 WARN_FOR_QUALIFIERS (location
, 0,
5600 G_("passing argument %d of %qE discards "
5601 "%qv qualifier from pointer target type"),
5602 G_("assignment discards %qv qualifier "
5603 "from pointer target type"),
5604 G_("initialization discards %qv qualifier "
5605 "from pointer target type"),
5606 G_("return discards %qv qualifier from "
5607 "pointer target type"),
5608 TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
));
5610 /* If this is not a case of ignoring a mismatch in signedness,
5612 else if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
5615 /* If there is a mismatch, do warn. */
5616 else if (warn_pointer_sign
)
5617 WARN_FOR_ASSIGNMENT (location
, OPT_Wpointer_sign
,
5618 G_("pointer targets in passing argument "
5619 "%d of %qE differ in signedness"),
5620 G_("pointer targets in assignment "
5621 "differ in signedness"),
5622 G_("pointer targets in initialization "
5623 "differ in signedness"),
5624 G_("pointer targets in return differ "
5627 else if (TREE_CODE (ttl
) == FUNCTION_TYPE
5628 && TREE_CODE (ttr
) == FUNCTION_TYPE
)
5630 /* Because const and volatile on functions are restrictions
5631 that say the function will not do certain things,
5632 it is okay to use a const or volatile function
5633 where an ordinary one is wanted, but not vice-versa. */
5634 if (TYPE_QUALS_NO_ADDR_SPACE (ttl
)
5635 & ~TYPE_QUALS_NO_ADDR_SPACE (ttr
))
5636 WARN_FOR_QUALIFIERS (location
, 0,
5637 G_("passing argument %d of %qE makes "
5638 "%q#v qualified function pointer "
5639 "from unqualified"),
5640 G_("assignment makes %q#v qualified function "
5641 "pointer from unqualified"),
5642 G_("initialization makes %q#v qualified "
5643 "function pointer from unqualified"),
5644 G_("return makes %q#v qualified function "
5645 "pointer from unqualified"),
5646 TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
));
5650 /* Avoid warning about the volatile ObjC EH puts on decls. */
5652 WARN_FOR_ASSIGNMENT (location
, 0,
5653 G_("passing argument %d of %qE from "
5654 "incompatible pointer type"),
5655 G_("assignment from incompatible pointer type"),
5656 G_("initialization from incompatible "
5658 G_("return from incompatible pointer type"));
5660 return convert (type
, rhs
);
5662 else if (codel
== POINTER_TYPE
&& coder
== ARRAY_TYPE
)
5664 /* ??? This should not be an error when inlining calls to
5665 unprototyped functions. */
5666 error_at (location
, "invalid use of non-lvalue array");
5667 return error_mark_node
;
5669 else if (codel
== POINTER_TYPE
&& coder
== INTEGER_TYPE
)
5671 /* An explicit constant 0 can convert to a pointer,
5672 or one that results from arithmetic, even including
5673 a cast to integer type. */
5674 if (!null_pointer_constant
)
5675 WARN_FOR_ASSIGNMENT (location
, 0,
5676 G_("passing argument %d of %qE makes "
5677 "pointer from integer without a cast"),
5678 G_("assignment makes pointer from integer "
5680 G_("initialization makes pointer from "
5681 "integer without a cast"),
5682 G_("return makes pointer from integer "
5685 return convert (type
, rhs
);
5687 else if (codel
== INTEGER_TYPE
&& coder
== POINTER_TYPE
)
5689 WARN_FOR_ASSIGNMENT (location
, 0,
5690 G_("passing argument %d of %qE makes integer "
5691 "from pointer without a cast"),
5692 G_("assignment makes integer from pointer "
5694 G_("initialization makes integer from pointer "
5696 G_("return makes integer from pointer "
5698 return convert (type
, rhs
);
5700 else if (codel
== BOOLEAN_TYPE
&& coder
== POINTER_TYPE
)
5703 bool save
= in_late_binary_op
;
5704 in_late_binary_op
= true;
5705 ret
= convert (type
, rhs
);
5706 in_late_binary_op
= save
;
5713 error_at (location
, "incompatible type for argument %d of %qE", parmnum
, rname
);
5714 inform ((fundecl
&& !DECL_IS_BUILTIN (fundecl
))
5715 ? DECL_SOURCE_LOCATION (fundecl
) : input_location
,
5716 "expected %qT but argument is of type %qT", type
, rhstype
);
5719 error_at (location
, "incompatible types when assigning to type %qT from "
5720 "type %qT", type
, rhstype
);
5724 "incompatible types when initializing type %qT using type %qT",
5729 "incompatible types when returning type %qT but %qT was "
5730 "expected", rhstype
, type
);
5736 return error_mark_node
;
5739 /* If VALUE is a compound expr all of whose expressions are constant, then
5740 return its value. Otherwise, return error_mark_node.
5742 This is for handling COMPOUND_EXPRs as initializer elements
5743 which is allowed with a warning when -pedantic is specified. */
5746 valid_compound_expr_initializer (tree value
, tree endtype
)
5748 if (TREE_CODE (value
) == COMPOUND_EXPR
)
5750 if (valid_compound_expr_initializer (TREE_OPERAND (value
, 0), endtype
)
5752 return error_mark_node
;
5753 return valid_compound_expr_initializer (TREE_OPERAND (value
, 1),
5756 else if (!initializer_constant_valid_p (value
, endtype
))
5757 return error_mark_node
;
5762 /* Perform appropriate conversions on the initial value of a variable,
5763 store it in the declaration DECL,
5764 and print any error messages that are appropriate.
5765 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
5766 If the init is invalid, store an ERROR_MARK.
5768 INIT_LOC is the location of the initial value. */
5771 store_init_value (location_t init_loc
, tree decl
, tree init
, tree origtype
)
5776 /* If variable's type was invalidly declared, just ignore it. */
5778 type
= TREE_TYPE (decl
);
5779 if (TREE_CODE (type
) == ERROR_MARK
)
5782 /* Digest the specified initializer into an expression. */
5785 npc
= null_pointer_constant_p (init
);
5786 value
= digest_init (init_loc
, type
, init
, origtype
, npc
,
5787 true, TREE_STATIC (decl
));
5789 /* Store the expression if valid; else report error. */
5791 if (!in_system_header
5792 && AGGREGATE_TYPE_P (TREE_TYPE (decl
)) && !TREE_STATIC (decl
))
5793 warning (OPT_Wtraditional
, "traditional C rejects automatic "
5794 "aggregate initialization");
5796 DECL_INITIAL (decl
) = value
;
5798 /* ANSI wants warnings about out-of-range constant initializers. */
5799 STRIP_TYPE_NOPS (value
);
5800 if (TREE_STATIC (decl
))
5801 constant_expression_warning (value
);
5803 /* Check if we need to set array size from compound literal size. */
5804 if (TREE_CODE (type
) == ARRAY_TYPE
5805 && TYPE_DOMAIN (type
) == 0
5806 && value
!= error_mark_node
)
5808 tree inside_init
= init
;
5810 STRIP_TYPE_NOPS (inside_init
);
5811 inside_init
= fold (inside_init
);
5813 if (TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
5815 tree cldecl
= COMPOUND_LITERAL_EXPR_DECL (inside_init
);
5817 if (TYPE_DOMAIN (TREE_TYPE (cldecl
)))
5819 /* For int foo[] = (int [3]){1}; we need to set array size
5820 now since later on array initializer will be just the
5821 brace enclosed list of the compound literal. */
5822 tree etype
= strip_array_types (TREE_TYPE (decl
));
5823 type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
5824 TYPE_DOMAIN (type
) = TYPE_DOMAIN (TREE_TYPE (cldecl
));
5826 layout_decl (cldecl
, 0);
5828 = c_build_qualified_type (type
, TYPE_QUALS (etype
));
5834 /* Methods for storing and printing names for error messages. */
5836 /* Implement a spelling stack that allows components of a name to be pushed
5837 and popped. Each element on the stack is this structure. */
5844 unsigned HOST_WIDE_INT i
;
5849 #define SPELLING_STRING 1
5850 #define SPELLING_MEMBER 2
5851 #define SPELLING_BOUNDS 3
5853 static struct spelling
*spelling
; /* Next stack element (unused). */
5854 static struct spelling
*spelling_base
; /* Spelling stack base. */
5855 static int spelling_size
; /* Size of the spelling stack. */
5857 /* Macros to save and restore the spelling stack around push_... functions.
5858 Alternative to SAVE_SPELLING_STACK. */
5860 #define SPELLING_DEPTH() (spelling - spelling_base)
5861 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
5863 /* Push an element on the spelling stack with type KIND and assign VALUE
5866 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
5868 int depth = SPELLING_DEPTH (); \
5870 if (depth >= spelling_size) \
5872 spelling_size += 10; \
5873 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
5875 RESTORE_SPELLING_DEPTH (depth); \
5878 spelling->kind = (KIND); \
5879 spelling->MEMBER = (VALUE); \
5883 /* Push STRING on the stack. Printed literally. */
5886 push_string (const char *string
)
5888 PUSH_SPELLING (SPELLING_STRING
, string
, u
.s
);
5891 /* Push a member name on the stack. Printed as '.' STRING. */
5894 push_member_name (tree decl
)
5896 const char *const string
5898 ? identifier_to_locale (IDENTIFIER_POINTER (DECL_NAME (decl
)))
5899 : _("<anonymous>"));
5900 PUSH_SPELLING (SPELLING_MEMBER
, string
, u
.s
);
5903 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
5906 push_array_bounds (unsigned HOST_WIDE_INT bounds
)
5908 PUSH_SPELLING (SPELLING_BOUNDS
, bounds
, u
.i
);
5911 /* Compute the maximum size in bytes of the printed spelling. */
5914 spelling_length (void)
5919 for (p
= spelling_base
; p
< spelling
; p
++)
5921 if (p
->kind
== SPELLING_BOUNDS
)
5924 size
+= strlen (p
->u
.s
) + 1;
5930 /* Print the spelling to BUFFER and return it. */
5933 print_spelling (char *buffer
)
5938 for (p
= spelling_base
; p
< spelling
; p
++)
5939 if (p
->kind
== SPELLING_BOUNDS
)
5941 sprintf (d
, "[" HOST_WIDE_INT_PRINT_UNSIGNED
"]", p
->u
.i
);
5947 if (p
->kind
== SPELLING_MEMBER
)
5949 for (s
= p
->u
.s
; (*d
= *s
++); d
++)
5956 /* Issue an error message for a bad initializer component.
5957 GMSGID identifies the message.
5958 The component name is taken from the spelling stack. */
5961 error_init (const char *gmsgid
)
5965 /* The gmsgid may be a format string with %< and %>. */
5967 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
5969 error ("(near initialization for %qs)", ofwhat
);
5972 /* Issue a pedantic warning for a bad initializer component. OPT is
5973 the option OPT_* (from options.h) controlling this warning or 0 if
5974 it is unconditionally given. GMSGID identifies the message. The
5975 component name is taken from the spelling stack. */
5978 pedwarn_init (location_t location
, int opt
, const char *gmsgid
)
5982 /* The gmsgid may be a format string with %< and %>. */
5983 pedwarn (location
, opt
, gmsgid
);
5984 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
5986 pedwarn (location
, opt
, "(near initialization for %qs)", ofwhat
);
5989 /* Issue a warning for a bad initializer component.
5991 OPT is the OPT_W* value corresponding to the warning option that
5992 controls this warning. GMSGID identifies the message. The
5993 component name is taken from the spelling stack. */
5996 warning_init (int opt
, const char *gmsgid
)
6000 /* The gmsgid may be a format string with %< and %>. */
6001 warning (opt
, gmsgid
);
6002 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
6004 warning (opt
, "(near initialization for %qs)", ofwhat
);
6007 /* If TYPE is an array type and EXPR is a parenthesized string
6008 constant, warn if pedantic that EXPR is being used to initialize an
6009 object of type TYPE. */
6012 maybe_warn_string_init (tree type
, struct c_expr expr
)
6015 && TREE_CODE (type
) == ARRAY_TYPE
6016 && TREE_CODE (expr
.value
) == STRING_CST
6017 && expr
.original_code
!= STRING_CST
)
6018 pedwarn_init (input_location
, OPT_Wpedantic
,
6019 "array initialized from parenthesized string constant");
6022 /* Digest the parser output INIT as an initializer for type TYPE.
6023 Return a C expression of type TYPE to represent the initial value.
6025 If ORIGTYPE is not NULL_TREE, it is the original type of INIT.
6027 NULL_POINTER_CONSTANT is true if INIT is a null pointer constant.
6029 If INIT is a string constant, STRICT_STRING is true if it is
6030 unparenthesized or we should not warn here for it being parenthesized.
6031 For other types of INIT, STRICT_STRING is not used.
6033 INIT_LOC is the location of the INIT.
6035 REQUIRE_CONSTANT requests an error if non-constant initializers or
6036 elements are seen. */
6039 digest_init (location_t init_loc
, tree type
, tree init
, tree origtype
,
6040 bool null_pointer_constant
, bool strict_string
,
6041 int require_constant
)
6043 enum tree_code code
= TREE_CODE (type
);
6044 tree inside_init
= init
;
6045 tree semantic_type
= NULL_TREE
;
6046 bool maybe_const
= true;
6048 if (type
== error_mark_node
6050 || init
== error_mark_node
6051 || TREE_TYPE (init
) == error_mark_node
)
6052 return error_mark_node
;
6054 STRIP_TYPE_NOPS (inside_init
);
6056 if (TREE_CODE (inside_init
) == EXCESS_PRECISION_EXPR
)
6058 semantic_type
= TREE_TYPE (inside_init
);
6059 inside_init
= TREE_OPERAND (inside_init
, 0);
6061 inside_init
= c_fully_fold (inside_init
, require_constant
, &maybe_const
);
6062 inside_init
= decl_constant_value_for_optimization (inside_init
);
6064 /* Initialization of an array of chars from a string constant
6065 optionally enclosed in braces. */
6067 if (code
== ARRAY_TYPE
&& inside_init
6068 && TREE_CODE (inside_init
) == STRING_CST
)
6070 tree typ1
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
6071 /* Note that an array could be both an array of character type
6072 and an array of wchar_t if wchar_t is signed char or unsigned
6074 bool char_array
= (typ1
== char_type_node
6075 || typ1
== signed_char_type_node
6076 || typ1
== unsigned_char_type_node
);
6077 bool wchar_array
= !!comptypes (typ1
, wchar_type_node
);
6078 bool char16_array
= !!comptypes (typ1
, char16_type_node
);
6079 bool char32_array
= !!comptypes (typ1
, char32_type_node
);
6081 if (char_array
|| wchar_array
|| char16_array
|| char32_array
)
6084 tree typ2
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init
)));
6085 expr
.value
= inside_init
;
6086 expr
.original_code
= (strict_string
? STRING_CST
: ERROR_MARK
);
6087 expr
.original_type
= NULL
;
6088 maybe_warn_string_init (type
, expr
);
6090 if (TYPE_DOMAIN (type
) && !TYPE_MAX_VALUE (TYPE_DOMAIN (type
)))
6091 pedwarn_init (init_loc
, OPT_Wpedantic
,
6092 "initialization of a flexible array member");
6094 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
6095 TYPE_MAIN_VARIANT (type
)))
6100 if (typ2
!= char_type_node
)
6102 error_init ("char-array initialized from wide string");
6103 return error_mark_node
;
6108 if (typ2
== char_type_node
)
6110 error_init ("wide character array initialized from non-wide "
6112 return error_mark_node
;
6114 else if (!comptypes(typ1
, typ2
))
6116 error_init ("wide character array initialized from "
6117 "incompatible wide string");
6118 return error_mark_node
;
6122 TREE_TYPE (inside_init
) = type
;
6123 if (TYPE_DOMAIN (type
) != 0
6124 && TYPE_SIZE (type
) != 0
6125 && TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
)
6127 unsigned HOST_WIDE_INT len
= TREE_STRING_LENGTH (inside_init
);
6129 /* Subtract the size of a single (possibly wide) character
6130 because it's ok to ignore the terminating null char
6131 that is counted in the length of the constant. */
6132 if (0 > compare_tree_int (TYPE_SIZE_UNIT (type
),
6134 - (TYPE_PRECISION (typ1
)
6136 pedwarn_init (init_loc
, 0,
6137 ("initializer-string for array of chars "
6139 else if (warn_cxx_compat
6140 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type
), len
))
6141 warning_at (init_loc
, OPT_Wc___compat
,
6142 ("initializer-string for array chars "
6143 "is too long for C++"));
6148 else if (INTEGRAL_TYPE_P (typ1
))
6150 error_init ("array of inappropriate type initialized "
6151 "from string constant");
6152 return error_mark_node
;
6156 /* Build a VECTOR_CST from a *constant* vector constructor. If the
6157 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
6158 below and handle as a constructor. */
6159 if (code
== VECTOR_TYPE
6160 && TREE_CODE (TREE_TYPE (inside_init
)) == VECTOR_TYPE
6161 && vector_types_convertible_p (TREE_TYPE (inside_init
), type
, true)
6162 && TREE_CONSTANT (inside_init
))
6164 if (TREE_CODE (inside_init
) == VECTOR_CST
6165 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
6166 TYPE_MAIN_VARIANT (type
)))
6169 if (TREE_CODE (inside_init
) == CONSTRUCTOR
)
6171 unsigned HOST_WIDE_INT ix
;
6173 bool constant_p
= true;
6175 /* Iterate through elements and check if all constructor
6176 elements are *_CSTs. */
6177 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init
), ix
, value
)
6178 if (!CONSTANT_CLASS_P (value
))
6185 return build_vector_from_ctor (type
,
6186 CONSTRUCTOR_ELTS (inside_init
));
6190 if (warn_sequence_point
)
6191 verify_sequence_points (inside_init
);
6193 /* Any type can be initialized
6194 from an expression of the same type, optionally with braces. */
6196 if (inside_init
&& TREE_TYPE (inside_init
) != 0
6197 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
6198 TYPE_MAIN_VARIANT (type
))
6199 || (code
== ARRAY_TYPE
6200 && comptypes (TREE_TYPE (inside_init
), type
))
6201 || (code
== VECTOR_TYPE
6202 && comptypes (TREE_TYPE (inside_init
), type
))
6203 || (code
== POINTER_TYPE
6204 && TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
6205 && comptypes (TREE_TYPE (TREE_TYPE (inside_init
)),
6206 TREE_TYPE (type
)))))
6208 if (code
== POINTER_TYPE
)
6210 if (TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
)
6212 if (TREE_CODE (inside_init
) == STRING_CST
6213 || TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
6214 inside_init
= array_to_pointer_conversion
6215 (init_loc
, inside_init
);
6218 error_init ("invalid use of non-lvalue array");
6219 return error_mark_node
;
6224 if (code
== VECTOR_TYPE
)
6225 /* Although the types are compatible, we may require a
6227 inside_init
= convert (type
, inside_init
);
6229 if (require_constant
6230 && (code
== VECTOR_TYPE
|| !flag_isoc99
)
6231 && TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
6233 /* As an extension, allow initializing objects with static storage
6234 duration with compound literals (which are then treated just as
6235 the brace enclosed list they contain). Also allow this for
6236 vectors, as we can only assign them with compound literals. */
6237 tree decl
= COMPOUND_LITERAL_EXPR_DECL (inside_init
);
6238 inside_init
= DECL_INITIAL (decl
);
6241 if (code
== ARRAY_TYPE
&& TREE_CODE (inside_init
) != STRING_CST
6242 && TREE_CODE (inside_init
) != CONSTRUCTOR
)
6244 error_init ("array initialized from non-constant array expression");
6245 return error_mark_node
;
6248 /* Compound expressions can only occur here if -Wpedantic or
6249 -pedantic-errors is specified. In the later case, we always want
6250 an error. In the former case, we simply want a warning. */
6251 if (require_constant
&& pedantic
6252 && TREE_CODE (inside_init
) == COMPOUND_EXPR
)
6255 = valid_compound_expr_initializer (inside_init
,
6256 TREE_TYPE (inside_init
));
6257 if (inside_init
== error_mark_node
)
6258 error_init ("initializer element is not constant");
6260 pedwarn_init (init_loc
, OPT_Wpedantic
,
6261 "initializer element is not constant");
6262 if (flag_pedantic_errors
)
6263 inside_init
= error_mark_node
;
6265 else if (require_constant
6266 && !initializer_constant_valid_p (inside_init
,
6267 TREE_TYPE (inside_init
)))
6269 error_init ("initializer element is not constant");
6270 inside_init
= error_mark_node
;
6272 else if (require_constant
&& !maybe_const
)
6273 pedwarn_init (init_loc
, 0,
6274 "initializer element is not a constant expression");
6276 /* Added to enable additional -Wsuggest-attribute=format warnings. */
6277 if (TREE_CODE (TREE_TYPE (inside_init
)) == POINTER_TYPE
)
6278 inside_init
= convert_for_assignment (init_loc
, type
, inside_init
,
6280 ic_init
, null_pointer_constant
,
6281 NULL_TREE
, NULL_TREE
, 0);
6285 /* Handle scalar types, including conversions. */
6287 if (code
== INTEGER_TYPE
|| code
== REAL_TYPE
|| code
== FIXED_POINT_TYPE
6288 || code
== POINTER_TYPE
|| code
== ENUMERAL_TYPE
|| code
== BOOLEAN_TYPE
6289 || code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
6291 if (TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
6292 && (TREE_CODE (init
) == STRING_CST
6293 || TREE_CODE (init
) == COMPOUND_LITERAL_EXPR
))
6294 inside_init
= init
= array_to_pointer_conversion (init_loc
, init
);
6296 inside_init
= build1 (EXCESS_PRECISION_EXPR
, semantic_type
,
6299 = convert_for_assignment (init_loc
, type
, inside_init
, origtype
,
6300 ic_init
, null_pointer_constant
,
6301 NULL_TREE
, NULL_TREE
, 0);
6303 /* Check to see if we have already given an error message. */
6304 if (inside_init
== error_mark_node
)
6306 else if (require_constant
&& !TREE_CONSTANT (inside_init
))
6308 error_init ("initializer element is not constant");
6309 inside_init
= error_mark_node
;
6311 else if (require_constant
6312 && !initializer_constant_valid_p (inside_init
,
6313 TREE_TYPE (inside_init
)))
6315 error_init ("initializer element is not computable at load time");
6316 inside_init
= error_mark_node
;
6318 else if (require_constant
&& !maybe_const
)
6319 pedwarn_init (init_loc
, 0,
6320 "initializer element is not a constant expression");
6325 /* Come here only for records and arrays. */
6327 if (COMPLETE_TYPE_P (type
) && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
6329 error_init ("variable-sized object may not be initialized");
6330 return error_mark_node
;
6333 error_init ("invalid initializer");
6334 return error_mark_node
;
6337 /* Handle initializers that use braces. */
6339 /* Type of object we are accumulating a constructor for.
6340 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
6341 static tree constructor_type
;
6343 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
6345 static tree constructor_fields
;
6347 /* For an ARRAY_TYPE, this is the specified index
6348 at which to store the next element we get. */
6349 static tree constructor_index
;
6351 /* For an ARRAY_TYPE, this is the maximum index. */
6352 static tree constructor_max_index
;
6354 /* For a RECORD_TYPE, this is the first field not yet written out. */
6355 static tree constructor_unfilled_fields
;
6357 /* For an ARRAY_TYPE, this is the index of the first element
6358 not yet written out. */
6359 static tree constructor_unfilled_index
;
6361 /* In a RECORD_TYPE, the byte index of the next consecutive field.
6362 This is so we can generate gaps between fields, when appropriate. */
6363 static tree constructor_bit_index
;
6365 /* If we are saving up the elements rather than allocating them,
6366 this is the list of elements so far (in reverse order,
6367 most recent first). */
6368 static vec
<constructor_elt
, va_gc
> *constructor_elements
;
6370 /* 1 if constructor should be incrementally stored into a constructor chain,
6371 0 if all the elements should be kept in AVL tree. */
6372 static int constructor_incremental
;
6374 /* 1 if so far this constructor's elements are all compile-time constants. */
6375 static int constructor_constant
;
6377 /* 1 if so far this constructor's elements are all valid address constants. */
6378 static int constructor_simple
;
6380 /* 1 if this constructor has an element that cannot be part of a
6381 constant expression. */
6382 static int constructor_nonconst
;
6384 /* 1 if this constructor is erroneous so far. */
6385 static int constructor_erroneous
;
6387 /* Structure for managing pending initializer elements, organized as an
6392 struct init_node
*left
, *right
;
6393 struct init_node
*parent
;
6400 /* Tree of pending elements at this constructor level.
6401 These are elements encountered out of order
6402 which belong at places we haven't reached yet in actually
6404 Will never hold tree nodes across GC runs. */
6405 static struct init_node
*constructor_pending_elts
;
6407 /* The SPELLING_DEPTH of this constructor. */
6408 static int constructor_depth
;
6410 /* DECL node for which an initializer is being read.
6411 0 means we are reading a constructor expression
6412 such as (struct foo) {...}. */
6413 static tree constructor_decl
;
6415 /* Nonzero if this is an initializer for a top-level decl. */
6416 static int constructor_top_level
;
6418 /* Nonzero if there were any member designators in this initializer. */
6419 static int constructor_designated
;
6421 /* Nesting depth of designator list. */
6422 static int designator_depth
;
6424 /* Nonzero if there were diagnosed errors in this designator list. */
6425 static int designator_erroneous
;
6428 /* This stack has a level for each implicit or explicit level of
6429 structuring in the initializer, including the outermost one. It
6430 saves the values of most of the variables above. */
6432 struct constructor_range_stack
;
6434 struct constructor_stack
6436 struct constructor_stack
*next
;
6441 tree unfilled_index
;
6442 tree unfilled_fields
;
6444 vec
<constructor_elt
, va_gc
> *elements
;
6445 struct init_node
*pending_elts
;
6448 /* If value nonzero, this value should replace the entire
6449 constructor at this level. */
6450 struct c_expr replacement_value
;
6451 struct constructor_range_stack
*range_stack
;
6462 static struct constructor_stack
*constructor_stack
;
6464 /* This stack represents designators from some range designator up to
6465 the last designator in the list. */
6467 struct constructor_range_stack
6469 struct constructor_range_stack
*next
, *prev
;
6470 struct constructor_stack
*stack
;
6477 static struct constructor_range_stack
*constructor_range_stack
;
6479 /* This stack records separate initializers that are nested.
6480 Nested initializers can't happen in ANSI C, but GNU C allows them
6481 in cases like { ... (struct foo) { ... } ... }. */
6483 struct initializer_stack
6485 struct initializer_stack
*next
;
6487 struct constructor_stack
*constructor_stack
;
6488 struct constructor_range_stack
*constructor_range_stack
;
6489 vec
<constructor_elt
, va_gc
> *elements
;
6490 struct spelling
*spelling
;
6491 struct spelling
*spelling_base
;
6494 char require_constant_value
;
6495 char require_constant_elements
;
6498 static struct initializer_stack
*initializer_stack
;
6500 /* Prepare to parse and output the initializer for variable DECL. */
6503 start_init (tree decl
, tree asmspec_tree ATTRIBUTE_UNUSED
, int top_level
)
6506 struct initializer_stack
*p
= XNEW (struct initializer_stack
);
6508 p
->decl
= constructor_decl
;
6509 p
->require_constant_value
= require_constant_value
;
6510 p
->require_constant_elements
= require_constant_elements
;
6511 p
->constructor_stack
= constructor_stack
;
6512 p
->constructor_range_stack
= constructor_range_stack
;
6513 p
->elements
= constructor_elements
;
6514 p
->spelling
= spelling
;
6515 p
->spelling_base
= spelling_base
;
6516 p
->spelling_size
= spelling_size
;
6517 p
->top_level
= constructor_top_level
;
6518 p
->next
= initializer_stack
;
6519 initializer_stack
= p
;
6521 constructor_decl
= decl
;
6522 constructor_designated
= 0;
6523 constructor_top_level
= top_level
;
6525 if (decl
!= 0 && decl
!= error_mark_node
)
6527 require_constant_value
= TREE_STATIC (decl
);
6528 require_constant_elements
6529 = ((TREE_STATIC (decl
) || (pedantic
&& !flag_isoc99
))
6530 /* For a scalar, you can always use any value to initialize,
6531 even within braces. */
6532 && (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
6533 || TREE_CODE (TREE_TYPE (decl
)) == RECORD_TYPE
6534 || TREE_CODE (TREE_TYPE (decl
)) == UNION_TYPE
6535 || TREE_CODE (TREE_TYPE (decl
)) == QUAL_UNION_TYPE
));
6536 locus
= identifier_to_locale (IDENTIFIER_POINTER (DECL_NAME (decl
)));
6540 require_constant_value
= 0;
6541 require_constant_elements
= 0;
6542 locus
= _("(anonymous)");
6545 constructor_stack
= 0;
6546 constructor_range_stack
= 0;
6548 missing_braces_mentioned
= 0;
6552 RESTORE_SPELLING_DEPTH (0);
6555 push_string (locus
);
6561 struct initializer_stack
*p
= initializer_stack
;
6563 /* Free the whole constructor stack of this initializer. */
6564 while (constructor_stack
)
6566 struct constructor_stack
*q
= constructor_stack
;
6567 constructor_stack
= q
->next
;
6571 gcc_assert (!constructor_range_stack
);
6573 /* Pop back to the data of the outer initializer (if any). */
6574 free (spelling_base
);
6576 constructor_decl
= p
->decl
;
6577 require_constant_value
= p
->require_constant_value
;
6578 require_constant_elements
= p
->require_constant_elements
;
6579 constructor_stack
= p
->constructor_stack
;
6580 constructor_range_stack
= p
->constructor_range_stack
;
6581 constructor_elements
= p
->elements
;
6582 spelling
= p
->spelling
;
6583 spelling_base
= p
->spelling_base
;
6584 spelling_size
= p
->spelling_size
;
6585 constructor_top_level
= p
->top_level
;
6586 initializer_stack
= p
->next
;
6590 /* Call here when we see the initializer is surrounded by braces.
6591 This is instead of a call to push_init_level;
6592 it is matched by a call to pop_init_level.
6594 TYPE is the type to initialize, for a constructor expression.
6595 For an initializer for a decl, TYPE is zero. */
6598 really_start_incremental_init (tree type
)
6600 struct constructor_stack
*p
= XNEW (struct constructor_stack
);
6603 type
= TREE_TYPE (constructor_decl
);
6605 if (TREE_CODE (type
) == VECTOR_TYPE
6606 && TYPE_VECTOR_OPAQUE (type
))
6607 error ("opaque vector types cannot be initialized");
6609 p
->type
= constructor_type
;
6610 p
->fields
= constructor_fields
;
6611 p
->index
= constructor_index
;
6612 p
->max_index
= constructor_max_index
;
6613 p
->unfilled_index
= constructor_unfilled_index
;
6614 p
->unfilled_fields
= constructor_unfilled_fields
;
6615 p
->bit_index
= constructor_bit_index
;
6616 p
->elements
= constructor_elements
;
6617 p
->constant
= constructor_constant
;
6618 p
->simple
= constructor_simple
;
6619 p
->nonconst
= constructor_nonconst
;
6620 p
->erroneous
= constructor_erroneous
;
6621 p
->pending_elts
= constructor_pending_elts
;
6622 p
->depth
= constructor_depth
;
6623 p
->replacement_value
.value
= 0;
6624 p
->replacement_value
.original_code
= ERROR_MARK
;
6625 p
->replacement_value
.original_type
= NULL
;
6629 p
->incremental
= constructor_incremental
;
6630 p
->designated
= constructor_designated
;
6632 constructor_stack
= p
;
6634 constructor_constant
= 1;
6635 constructor_simple
= 1;
6636 constructor_nonconst
= 0;
6637 constructor_depth
= SPELLING_DEPTH ();
6638 constructor_elements
= NULL
;
6639 constructor_pending_elts
= 0;
6640 constructor_type
= type
;
6641 constructor_incremental
= 1;
6642 constructor_designated
= 0;
6643 designator_depth
= 0;
6644 designator_erroneous
= 0;
6646 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6647 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6649 constructor_fields
= TYPE_FIELDS (constructor_type
);
6650 /* Skip any nameless bit fields at the beginning. */
6651 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
6652 && DECL_NAME (constructor_fields
) == 0)
6653 constructor_fields
= DECL_CHAIN (constructor_fields
);
6655 constructor_unfilled_fields
= constructor_fields
;
6656 constructor_bit_index
= bitsize_zero_node
;
6658 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6660 if (TYPE_DOMAIN (constructor_type
))
6662 constructor_max_index
6663 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
6665 /* Detect non-empty initializations of zero-length arrays. */
6666 if (constructor_max_index
== NULL_TREE
6667 && TYPE_SIZE (constructor_type
))
6668 constructor_max_index
= integer_minus_one_node
;
6670 /* constructor_max_index needs to be an INTEGER_CST. Attempts
6671 to initialize VLAs will cause a proper error; avoid tree
6672 checking errors as well by setting a safe value. */
6673 if (constructor_max_index
6674 && TREE_CODE (constructor_max_index
) != INTEGER_CST
)
6675 constructor_max_index
= integer_minus_one_node
;
6678 = convert (bitsizetype
,
6679 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
6683 constructor_index
= bitsize_zero_node
;
6684 constructor_max_index
= NULL_TREE
;
6687 constructor_unfilled_index
= constructor_index
;
6689 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
6691 /* Vectors are like simple fixed-size arrays. */
6692 constructor_max_index
=
6693 bitsize_int (TYPE_VECTOR_SUBPARTS (constructor_type
) - 1);
6694 constructor_index
= bitsize_zero_node
;
6695 constructor_unfilled_index
= constructor_index
;
6699 /* Handle the case of int x = {5}; */
6700 constructor_fields
= constructor_type
;
6701 constructor_unfilled_fields
= constructor_type
;
6705 /* Push down into a subobject, for initialization.
6706 If this is for an explicit set of braces, IMPLICIT is 0.
6707 If it is because the next element belongs at a lower level,
6708 IMPLICIT is 1 (or 2 if the push is because of designator list). */
6711 push_init_level (int implicit
, struct obstack
* braced_init_obstack
)
6713 struct constructor_stack
*p
;
6714 tree value
= NULL_TREE
;
6716 /* If we've exhausted any levels that didn't have braces,
6717 pop them now. If implicit == 1, this will have been done in
6718 process_init_element; do not repeat it here because in the case
6719 of excess initializers for an empty aggregate this leads to an
6720 infinite cycle of popping a level and immediately recreating
6724 while (constructor_stack
->implicit
)
6726 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
6727 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6728 && constructor_fields
== 0)
6729 process_init_element (pop_init_level (1, braced_init_obstack
),
6730 true, braced_init_obstack
);
6731 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
6732 && constructor_max_index
6733 && tree_int_cst_lt (constructor_max_index
,
6735 process_init_element (pop_init_level (1, braced_init_obstack
),
6736 true, braced_init_obstack
);
6742 /* Unless this is an explicit brace, we need to preserve previous
6746 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
6747 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6748 && constructor_fields
)
6749 value
= find_init_member (constructor_fields
, braced_init_obstack
);
6750 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6751 value
= find_init_member (constructor_index
, braced_init_obstack
);
6754 p
= XNEW (struct constructor_stack
);
6755 p
->type
= constructor_type
;
6756 p
->fields
= constructor_fields
;
6757 p
->index
= constructor_index
;
6758 p
->max_index
= constructor_max_index
;
6759 p
->unfilled_index
= constructor_unfilled_index
;
6760 p
->unfilled_fields
= constructor_unfilled_fields
;
6761 p
->bit_index
= constructor_bit_index
;
6762 p
->elements
= constructor_elements
;
6763 p
->constant
= constructor_constant
;
6764 p
->simple
= constructor_simple
;
6765 p
->nonconst
= constructor_nonconst
;
6766 p
->erroneous
= constructor_erroneous
;
6767 p
->pending_elts
= constructor_pending_elts
;
6768 p
->depth
= constructor_depth
;
6769 p
->replacement_value
.value
= 0;
6770 p
->replacement_value
.original_code
= ERROR_MARK
;
6771 p
->replacement_value
.original_type
= NULL
;
6772 p
->implicit
= implicit
;
6774 p
->incremental
= constructor_incremental
;
6775 p
->designated
= constructor_designated
;
6776 p
->next
= constructor_stack
;
6778 constructor_stack
= p
;
6780 constructor_constant
= 1;
6781 constructor_simple
= 1;
6782 constructor_nonconst
= 0;
6783 constructor_depth
= SPELLING_DEPTH ();
6784 constructor_elements
= NULL
;
6785 constructor_incremental
= 1;
6786 constructor_designated
= 0;
6787 constructor_pending_elts
= 0;
6790 p
->range_stack
= constructor_range_stack
;
6791 constructor_range_stack
= 0;
6792 designator_depth
= 0;
6793 designator_erroneous
= 0;
6796 /* Don't die if an entire brace-pair level is superfluous
6797 in the containing level. */
6798 if (constructor_type
== 0)
6800 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
6801 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6803 /* Don't die if there are extra init elts at the end. */
6804 if (constructor_fields
== 0)
6805 constructor_type
= 0;
6808 constructor_type
= TREE_TYPE (constructor_fields
);
6809 push_member_name (constructor_fields
);
6810 constructor_depth
++;
6813 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6815 constructor_type
= TREE_TYPE (constructor_type
);
6816 push_array_bounds (tree_low_cst (constructor_index
, 1));
6817 constructor_depth
++;
6820 if (constructor_type
== 0)
6822 error_init ("extra brace group at end of initializer");
6823 constructor_fields
= 0;
6824 constructor_unfilled_fields
= 0;
6828 if (value
&& TREE_CODE (value
) == CONSTRUCTOR
)
6830 constructor_constant
= TREE_CONSTANT (value
);
6831 constructor_simple
= TREE_STATIC (value
);
6832 constructor_nonconst
= CONSTRUCTOR_NON_CONST (value
);
6833 constructor_elements
= CONSTRUCTOR_ELTS (value
);
6834 if (!vec_safe_is_empty (constructor_elements
)
6835 && (TREE_CODE (constructor_type
) == RECORD_TYPE
6836 || TREE_CODE (constructor_type
) == ARRAY_TYPE
))
6837 set_nonincremental_init (braced_init_obstack
);
6840 if (implicit
== 1 && warn_missing_braces
&& !missing_braces_mentioned
)
6842 missing_braces_mentioned
= 1;
6843 warning_init (OPT_Wmissing_braces
, "missing braces around initializer");
6846 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6847 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6849 constructor_fields
= TYPE_FIELDS (constructor_type
);
6850 /* Skip any nameless bit fields at the beginning. */
6851 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
6852 && DECL_NAME (constructor_fields
) == 0)
6853 constructor_fields
= DECL_CHAIN (constructor_fields
);
6855 constructor_unfilled_fields
= constructor_fields
;
6856 constructor_bit_index
= bitsize_zero_node
;
6858 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
6860 /* Vectors are like simple fixed-size arrays. */
6861 constructor_max_index
=
6862 bitsize_int (TYPE_VECTOR_SUBPARTS (constructor_type
) - 1);
6863 constructor_index
= bitsize_int (0);
6864 constructor_unfilled_index
= constructor_index
;
6866 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6868 if (TYPE_DOMAIN (constructor_type
))
6870 constructor_max_index
6871 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
6873 /* Detect non-empty initializations of zero-length arrays. */
6874 if (constructor_max_index
== NULL_TREE
6875 && TYPE_SIZE (constructor_type
))
6876 constructor_max_index
= integer_minus_one_node
;
6878 /* constructor_max_index needs to be an INTEGER_CST. Attempts
6879 to initialize VLAs will cause a proper error; avoid tree
6880 checking errors as well by setting a safe value. */
6881 if (constructor_max_index
6882 && TREE_CODE (constructor_max_index
) != INTEGER_CST
)
6883 constructor_max_index
= integer_minus_one_node
;
6886 = convert (bitsizetype
,
6887 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
6890 constructor_index
= bitsize_zero_node
;
6892 constructor_unfilled_index
= constructor_index
;
6893 if (value
&& TREE_CODE (value
) == STRING_CST
)
6895 /* We need to split the char/wchar array into individual
6896 characters, so that we don't have to special case it
6898 set_nonincremental_init_from_string (value
, braced_init_obstack
);
6903 if (constructor_type
!= error_mark_node
)
6904 warning_init (0, "braces around scalar initializer");
6905 constructor_fields
= constructor_type
;
6906 constructor_unfilled_fields
= constructor_type
;
6910 /* At the end of an implicit or explicit brace level,
6911 finish up that level of constructor. If a single expression
6912 with redundant braces initialized that level, return the
6913 c_expr structure for that expression. Otherwise, the original_code
6914 element is set to ERROR_MARK.
6915 If we were outputting the elements as they are read, return 0 as the value
6916 from inner levels (process_init_element ignores that),
6917 but return error_mark_node as the value from the outermost level
6918 (that's what we want to put in DECL_INITIAL).
6919 Otherwise, return a CONSTRUCTOR expression as the value. */
6922 pop_init_level (int implicit
, struct obstack
* braced_init_obstack
)
6924 struct constructor_stack
*p
;
6927 ret
.original_code
= ERROR_MARK
;
6928 ret
.original_type
= NULL
;
6932 /* When we come to an explicit close brace,
6933 pop any inner levels that didn't have explicit braces. */
6934 while (constructor_stack
->implicit
)
6936 process_init_element (pop_init_level (1, braced_init_obstack
),
6937 true, braced_init_obstack
);
6939 gcc_assert (!constructor_range_stack
);
6942 /* Now output all pending elements. */
6943 constructor_incremental
= 1;
6944 output_pending_init_elements (1, braced_init_obstack
);
6946 p
= constructor_stack
;
6948 /* Error for initializing a flexible array member, or a zero-length
6949 array member in an inappropriate context. */
6950 if (constructor_type
&& constructor_fields
6951 && TREE_CODE (constructor_type
) == ARRAY_TYPE
6952 && TYPE_DOMAIN (constructor_type
)
6953 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
)))
6955 /* Silently discard empty initializations. The parser will
6956 already have pedwarned for empty brackets. */
6957 if (integer_zerop (constructor_unfilled_index
))
6958 constructor_type
= NULL_TREE
;
6961 gcc_assert (!TYPE_SIZE (constructor_type
));
6963 if (constructor_depth
> 2)
6964 error_init ("initialization of flexible array member in a nested context");
6966 pedwarn_init (input_location
, OPT_Wpedantic
,
6967 "initialization of a flexible array member");
6969 /* We have already issued an error message for the existence
6970 of a flexible array member not at the end of the structure.
6971 Discard the initializer so that we do not die later. */
6972 if (DECL_CHAIN (constructor_fields
) != NULL_TREE
)
6973 constructor_type
= NULL_TREE
;
6977 /* Warn when some struct elements are implicitly initialized to zero. */
6978 if (warn_missing_field_initializers
6980 && TREE_CODE (constructor_type
) == RECORD_TYPE
6981 && constructor_unfilled_fields
)
6983 bool constructor_zeroinit
=
6984 (vec_safe_length (constructor_elements
) == 1
6985 && integer_zerop ((*constructor_elements
)[0].value
));
6987 /* Do not warn for flexible array members or zero-length arrays. */
6988 while (constructor_unfilled_fields
6989 && (!DECL_SIZE (constructor_unfilled_fields
)
6990 || integer_zerop (DECL_SIZE (constructor_unfilled_fields
))))
6991 constructor_unfilled_fields
= DECL_CHAIN (constructor_unfilled_fields
);
6993 if (constructor_unfilled_fields
6994 /* Do not warn if this level of the initializer uses member
6995 designators; it is likely to be deliberate. */
6996 && !constructor_designated
6997 /* Do not warn about initializing with ` = {0}'. */
6998 && !constructor_zeroinit
)
7000 if (warning_at (input_location
, OPT_Wmissing_field_initializers
,
7001 "missing initializer for field %qD of %qT",
7002 constructor_unfilled_fields
,
7004 inform (DECL_SOURCE_LOCATION (constructor_unfilled_fields
),
7005 "%qD declared here", constructor_unfilled_fields
);
7009 /* Pad out the end of the structure. */
7010 if (p
->replacement_value
.value
)
7011 /* If this closes a superfluous brace pair,
7012 just pass out the element between them. */
7013 ret
= p
->replacement_value
;
7014 else if (constructor_type
== 0)
7016 else if (TREE_CODE (constructor_type
) != RECORD_TYPE
7017 && TREE_CODE (constructor_type
) != UNION_TYPE
7018 && TREE_CODE (constructor_type
) != ARRAY_TYPE
7019 && TREE_CODE (constructor_type
) != VECTOR_TYPE
)
7021 /* A nonincremental scalar initializer--just return
7022 the element, after verifying there is just one. */
7023 if (vec_safe_is_empty (constructor_elements
))
7025 if (!constructor_erroneous
)
7026 error_init ("empty scalar initializer");
7027 ret
.value
= error_mark_node
;
7029 else if (vec_safe_length (constructor_elements
) != 1)
7031 error_init ("extra elements in scalar initializer");
7032 ret
.value
= (*constructor_elements
)[0].value
;
7035 ret
.value
= (*constructor_elements
)[0].value
;
7039 if (constructor_erroneous
)
7040 ret
.value
= error_mark_node
;
7043 ret
.value
= build_constructor (constructor_type
,
7044 constructor_elements
);
7045 if (constructor_constant
)
7046 TREE_CONSTANT (ret
.value
) = 1;
7047 if (constructor_constant
&& constructor_simple
)
7048 TREE_STATIC (ret
.value
) = 1;
7049 if (constructor_nonconst
)
7050 CONSTRUCTOR_NON_CONST (ret
.value
) = 1;
7054 if (ret
.value
&& TREE_CODE (ret
.value
) != CONSTRUCTOR
)
7056 if (constructor_nonconst
)
7057 ret
.original_code
= C_MAYBE_CONST_EXPR
;
7058 else if (ret
.original_code
== C_MAYBE_CONST_EXPR
)
7059 ret
.original_code
= ERROR_MARK
;
7062 constructor_type
= p
->type
;
7063 constructor_fields
= p
->fields
;
7064 constructor_index
= p
->index
;
7065 constructor_max_index
= p
->max_index
;
7066 constructor_unfilled_index
= p
->unfilled_index
;
7067 constructor_unfilled_fields
= p
->unfilled_fields
;
7068 constructor_bit_index
= p
->bit_index
;
7069 constructor_elements
= p
->elements
;
7070 constructor_constant
= p
->constant
;
7071 constructor_simple
= p
->simple
;
7072 constructor_nonconst
= p
->nonconst
;
7073 constructor_erroneous
= p
->erroneous
;
7074 constructor_incremental
= p
->incremental
;
7075 constructor_designated
= p
->designated
;
7076 constructor_pending_elts
= p
->pending_elts
;
7077 constructor_depth
= p
->depth
;
7079 constructor_range_stack
= p
->range_stack
;
7080 RESTORE_SPELLING_DEPTH (constructor_depth
);
7082 constructor_stack
= p
->next
;
7085 if (ret
.value
== 0 && constructor_stack
== 0)
7086 ret
.value
= error_mark_node
;
7090 /* Common handling for both array range and field name designators.
7091 ARRAY argument is nonzero for array ranges. Returns zero for success. */
7094 set_designator (int array
, struct obstack
* braced_init_obstack
)
7097 enum tree_code subcode
;
7099 /* Don't die if an entire brace-pair level is superfluous
7100 in the containing level. */
7101 if (constructor_type
== 0)
7104 /* If there were errors in this designator list already, bail out
7106 if (designator_erroneous
)
7109 if (!designator_depth
)
7111 gcc_assert (!constructor_range_stack
);
7113 /* Designator list starts at the level of closest explicit
7115 while (constructor_stack
->implicit
)
7117 process_init_element (pop_init_level (1, braced_init_obstack
),
7118 true, braced_init_obstack
);
7120 constructor_designated
= 1;
7124 switch (TREE_CODE (constructor_type
))
7128 subtype
= TREE_TYPE (constructor_fields
);
7129 if (subtype
!= error_mark_node
)
7130 subtype
= TYPE_MAIN_VARIANT (subtype
);
7133 subtype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
7139 subcode
= TREE_CODE (subtype
);
7140 if (array
&& subcode
!= ARRAY_TYPE
)
7142 error_init ("array index in non-array initializer");
7145 else if (!array
&& subcode
!= RECORD_TYPE
&& subcode
!= UNION_TYPE
)
7147 error_init ("field name not in record or union initializer");
7151 constructor_designated
= 1;
7152 push_init_level (2, braced_init_obstack
);
7156 /* If there are range designators in designator list, push a new designator
7157 to constructor_range_stack. RANGE_END is end of such stack range or
7158 NULL_TREE if there is no range designator at this level. */
7161 push_range_stack (tree range_end
, struct obstack
* braced_init_obstack
)
7163 struct constructor_range_stack
*p
;
7165 p
= (struct constructor_range_stack
*)
7166 obstack_alloc (braced_init_obstack
,
7167 sizeof (struct constructor_range_stack
));
7168 p
->prev
= constructor_range_stack
;
7170 p
->fields
= constructor_fields
;
7171 p
->range_start
= constructor_index
;
7172 p
->index
= constructor_index
;
7173 p
->stack
= constructor_stack
;
7174 p
->range_end
= range_end
;
7175 if (constructor_range_stack
)
7176 constructor_range_stack
->next
= p
;
7177 constructor_range_stack
= p
;
7180 /* Within an array initializer, specify the next index to be initialized.
7181 FIRST is that index. If LAST is nonzero, then initialize a range
7182 of indices, running from FIRST through LAST. */
7185 set_init_index (tree first
, tree last
,
7186 struct obstack
* braced_init_obstack
)
7188 if (set_designator (1, braced_init_obstack
))
7191 designator_erroneous
= 1;
7193 if (!INTEGRAL_TYPE_P (TREE_TYPE (first
))
7194 || (last
&& !INTEGRAL_TYPE_P (TREE_TYPE (last
))))
7196 error_init ("array index in initializer not of integer type");
7200 if (TREE_CODE (first
) != INTEGER_CST
)
7202 first
= c_fully_fold (first
, false, NULL
);
7203 if (TREE_CODE (first
) == INTEGER_CST
)
7204 pedwarn_init (input_location
, OPT_Wpedantic
,
7205 "array index in initializer is not "
7206 "an integer constant expression");
7209 if (last
&& TREE_CODE (last
) != INTEGER_CST
)
7211 last
= c_fully_fold (last
, false, NULL
);
7212 if (TREE_CODE (last
) == INTEGER_CST
)
7213 pedwarn_init (input_location
, OPT_Wpedantic
,
7214 "array index in initializer is not "
7215 "an integer constant expression");
7218 if (TREE_CODE (first
) != INTEGER_CST
)
7219 error_init ("nonconstant array index in initializer");
7220 else if (last
!= 0 && TREE_CODE (last
) != INTEGER_CST
)
7221 error_init ("nonconstant array index in initializer");
7222 else if (TREE_CODE (constructor_type
) != ARRAY_TYPE
)
7223 error_init ("array index in non-array initializer");
7224 else if (tree_int_cst_sgn (first
) == -1)
7225 error_init ("array index in initializer exceeds array bounds");
7226 else if (constructor_max_index
7227 && tree_int_cst_lt (constructor_max_index
, first
))
7228 error_init ("array index in initializer exceeds array bounds");
7231 constant_expression_warning (first
);
7233 constant_expression_warning (last
);
7234 constructor_index
= convert (bitsizetype
, first
);
7238 if (tree_int_cst_equal (first
, last
))
7240 else if (tree_int_cst_lt (last
, first
))
7242 error_init ("empty index range in initializer");
7247 last
= convert (bitsizetype
, last
);
7248 if (constructor_max_index
!= 0
7249 && tree_int_cst_lt (constructor_max_index
, last
))
7251 error_init ("array index range in initializer exceeds array bounds");
7258 designator_erroneous
= 0;
7259 if (constructor_range_stack
|| last
)
7260 push_range_stack (last
, braced_init_obstack
);
7264 /* Within a struct initializer, specify the next field to be initialized. */
7267 set_init_label (tree fieldname
, struct obstack
* braced_init_obstack
)
7271 if (set_designator (0, braced_init_obstack
))
7274 designator_erroneous
= 1;
7276 if (TREE_CODE (constructor_type
) != RECORD_TYPE
7277 && TREE_CODE (constructor_type
) != UNION_TYPE
)
7279 error_init ("field name not in record or union initializer");
7283 field
= lookup_field (constructor_type
, fieldname
);
7286 error ("unknown field %qE specified in initializer", fieldname
);
7290 constructor_fields
= TREE_VALUE (field
);
7292 designator_erroneous
= 0;
7293 if (constructor_range_stack
)
7294 push_range_stack (NULL_TREE
, braced_init_obstack
);
7295 field
= TREE_CHAIN (field
);
7298 if (set_designator (0, braced_init_obstack
))
7302 while (field
!= NULL_TREE
);
7305 /* Add a new initializer to the tree of pending initializers. PURPOSE
7306 identifies the initializer, either array index or field in a structure.
7307 VALUE is the value of that index or field. If ORIGTYPE is not
7308 NULL_TREE, it is the original type of VALUE.
7310 IMPLICIT is true if value comes from pop_init_level (1),
7311 the new initializer has been merged with the existing one
7312 and thus no warnings should be emitted about overriding an
7313 existing initializer. */
7316 add_pending_init (tree purpose
, tree value
, tree origtype
, bool implicit
,
7317 struct obstack
* braced_init_obstack
)
7319 struct init_node
*p
, **q
, *r
;
7321 q
= &constructor_pending_elts
;
7324 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
7329 if (tree_int_cst_lt (purpose
, p
->purpose
))
7331 else if (tree_int_cst_lt (p
->purpose
, purpose
))
7337 if (TREE_SIDE_EFFECTS (p
->value
))
7338 warning_init (0, "initialized field with side-effects overwritten");
7339 else if (warn_override_init
)
7340 warning_init (OPT_Woverride_init
, "initialized field overwritten");
7343 p
->origtype
= origtype
;
7352 bitpos
= bit_position (purpose
);
7356 if (tree_int_cst_lt (bitpos
, bit_position (p
->purpose
)))
7358 else if (p
->purpose
!= purpose
)
7364 if (TREE_SIDE_EFFECTS (p
->value
))
7365 warning_init (0, "initialized field with side-effects overwritten");
7366 else if (warn_override_init
)
7367 warning_init (OPT_Woverride_init
, "initialized field overwritten");
7370 p
->origtype
= origtype
;
7376 r
= (struct init_node
*) obstack_alloc (braced_init_obstack
,
7377 sizeof (struct init_node
));
7378 r
->purpose
= purpose
;
7380 r
->origtype
= origtype
;
7390 struct init_node
*s
;
7394 if (p
->balance
== 0)
7396 else if (p
->balance
< 0)
7403 p
->left
->parent
= p
;
7420 constructor_pending_elts
= r
;
7425 struct init_node
*t
= r
->right
;
7429 r
->right
->parent
= r
;
7434 p
->left
->parent
= p
;
7437 p
->balance
= t
->balance
< 0;
7438 r
->balance
= -(t
->balance
> 0);
7453 constructor_pending_elts
= t
;
7459 /* p->balance == +1; growth of left side balances the node. */
7464 else /* r == p->right */
7466 if (p
->balance
== 0)
7467 /* Growth propagation from right side. */
7469 else if (p
->balance
> 0)
7476 p
->right
->parent
= p
;
7493 constructor_pending_elts
= r
;
7495 else /* r->balance == -1 */
7498 struct init_node
*t
= r
->left
;
7502 r
->left
->parent
= r
;
7507 p
->right
->parent
= p
;
7510 r
->balance
= (t
->balance
< 0);
7511 p
->balance
= -(t
->balance
> 0);
7526 constructor_pending_elts
= t
;
7532 /* p->balance == -1; growth of right side balances the node. */
7543 /* Build AVL tree from a sorted chain. */
7546 set_nonincremental_init (struct obstack
* braced_init_obstack
)
7548 unsigned HOST_WIDE_INT ix
;
7551 if (TREE_CODE (constructor_type
) != RECORD_TYPE
7552 && TREE_CODE (constructor_type
) != ARRAY_TYPE
)
7555 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements
, ix
, index
, value
)
7557 add_pending_init (index
, value
, NULL_TREE
, true,
7558 braced_init_obstack
);
7560 constructor_elements
= NULL
;
7561 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
7563 constructor_unfilled_fields
= TYPE_FIELDS (constructor_type
);
7564 /* Skip any nameless bit fields at the beginning. */
7565 while (constructor_unfilled_fields
!= 0
7566 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
7567 && DECL_NAME (constructor_unfilled_fields
) == 0)
7568 constructor_unfilled_fields
= TREE_CHAIN (constructor_unfilled_fields
);
7571 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
7573 if (TYPE_DOMAIN (constructor_type
))
7574 constructor_unfilled_index
7575 = convert (bitsizetype
,
7576 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
7578 constructor_unfilled_index
= bitsize_zero_node
;
7580 constructor_incremental
= 0;
7583 /* Build AVL tree from a string constant. */
7586 set_nonincremental_init_from_string (tree str
,
7587 struct obstack
* braced_init_obstack
)
7589 tree value
, purpose
, type
;
7590 HOST_WIDE_INT val
[2];
7591 const char *p
, *end
;
7592 int byte
, wchar_bytes
, charwidth
, bitpos
;
7594 gcc_assert (TREE_CODE (constructor_type
) == ARRAY_TYPE
);
7596 wchar_bytes
= TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str
))) / BITS_PER_UNIT
;
7597 charwidth
= TYPE_PRECISION (char_type_node
);
7598 type
= TREE_TYPE (constructor_type
);
7599 p
= TREE_STRING_POINTER (str
);
7600 end
= p
+ TREE_STRING_LENGTH (str
);
7602 for (purpose
= bitsize_zero_node
;
7604 && !(constructor_max_index
7605 && tree_int_cst_lt (constructor_max_index
, purpose
));
7606 purpose
= size_binop (PLUS_EXPR
, purpose
, bitsize_one_node
))
7608 if (wchar_bytes
== 1)
7610 val
[1] = (unsigned char) *p
++;
7617 for (byte
= 0; byte
< wchar_bytes
; byte
++)
7619 if (BYTES_BIG_ENDIAN
)
7620 bitpos
= (wchar_bytes
- byte
- 1) * charwidth
;
7622 bitpos
= byte
* charwidth
;
7623 val
[bitpos
< HOST_BITS_PER_WIDE_INT
]
7624 |= ((unsigned HOST_WIDE_INT
) ((unsigned char) *p
++))
7625 << (bitpos
% HOST_BITS_PER_WIDE_INT
);
7629 if (!TYPE_UNSIGNED (type
))
7631 bitpos
= ((wchar_bytes
- 1) * charwidth
) + HOST_BITS_PER_CHAR
;
7632 if (bitpos
< HOST_BITS_PER_WIDE_INT
)
7634 if (val
[1] & (((HOST_WIDE_INT
) 1) << (bitpos
- 1)))
7636 val
[1] |= ((HOST_WIDE_INT
) -1) << bitpos
;
7640 else if (bitpos
== HOST_BITS_PER_WIDE_INT
)
7645 else if (val
[0] & (((HOST_WIDE_INT
) 1)
7646 << (bitpos
- 1 - HOST_BITS_PER_WIDE_INT
)))
7647 val
[0] |= ((HOST_WIDE_INT
) -1)
7648 << (bitpos
- HOST_BITS_PER_WIDE_INT
);
7651 value
= build_int_cst_wide (type
, val
[1], val
[0]);
7652 add_pending_init (purpose
, value
, NULL_TREE
, true,
7653 braced_init_obstack
);
7656 constructor_incremental
= 0;
7659 /* Return value of FIELD in pending initializer or zero if the field was
7660 not initialized yet. */
7663 find_init_member (tree field
, struct obstack
* braced_init_obstack
)
7665 struct init_node
*p
;
7667 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
7669 if (constructor_incremental
7670 && tree_int_cst_lt (field
, constructor_unfilled_index
))
7671 set_nonincremental_init (braced_init_obstack
);
7673 p
= constructor_pending_elts
;
7676 if (tree_int_cst_lt (field
, p
->purpose
))
7678 else if (tree_int_cst_lt (p
->purpose
, field
))
7684 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
7686 tree bitpos
= bit_position (field
);
7688 if (constructor_incremental
7689 && (!constructor_unfilled_fields
7690 || tree_int_cst_lt (bitpos
,
7691 bit_position (constructor_unfilled_fields
))))
7692 set_nonincremental_init (braced_init_obstack
);
7694 p
= constructor_pending_elts
;
7697 if (field
== p
->purpose
)
7699 else if (tree_int_cst_lt (bitpos
, bit_position (p
->purpose
)))
7705 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
7707 if (!vec_safe_is_empty (constructor_elements
)
7708 && (constructor_elements
->last ().index
== field
))
7709 return constructor_elements
->last ().value
;
7714 /* "Output" the next constructor element.
7715 At top level, really output it to assembler code now.
7716 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
7717 If ORIGTYPE is not NULL_TREE, it is the original type of VALUE.
7718 TYPE is the data type that the containing data type wants here.
7719 FIELD is the field (a FIELD_DECL) or the index that this element fills.
7720 If VALUE is a string constant, STRICT_STRING is true if it is
7721 unparenthesized or we should not warn here for it being parenthesized.
7722 For other types of VALUE, STRICT_STRING is not used.
7724 PENDING if non-nil means output pending elements that belong
7725 right after this element. (PENDING is normally 1;
7726 it is 0 while outputting pending elements, to avoid recursion.)
7728 IMPLICIT is true if value comes from pop_init_level (1),
7729 the new initializer has been merged with the existing one
7730 and thus no warnings should be emitted about overriding an
7731 existing initializer. */
7734 output_init_element (tree value
, tree origtype
, bool strict_string
, tree type
,
7735 tree field
, int pending
, bool implicit
,
7736 struct obstack
* braced_init_obstack
)
7738 tree semantic_type
= NULL_TREE
;
7739 bool maybe_const
= true;
7742 if (type
== error_mark_node
|| value
== error_mark_node
)
7744 constructor_erroneous
= 1;
7747 if (TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
7748 && (TREE_CODE (value
) == STRING_CST
7749 || TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
)
7750 && !(TREE_CODE (value
) == STRING_CST
7751 && TREE_CODE (type
) == ARRAY_TYPE
7752 && INTEGRAL_TYPE_P (TREE_TYPE (type
)))
7753 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value
)),
7754 TYPE_MAIN_VARIANT (type
)))
7755 value
= array_to_pointer_conversion (input_location
, value
);
7757 if (TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
7758 && require_constant_value
&& !flag_isoc99
&& pending
)
7760 /* As an extension, allow initializing objects with static storage
7761 duration with compound literals (which are then treated just as
7762 the brace enclosed list they contain). */
7763 tree decl
= COMPOUND_LITERAL_EXPR_DECL (value
);
7764 value
= DECL_INITIAL (decl
);
7767 npc
= null_pointer_constant_p (value
);
7768 if (TREE_CODE (value
) == EXCESS_PRECISION_EXPR
)
7770 semantic_type
= TREE_TYPE (value
);
7771 value
= TREE_OPERAND (value
, 0);
7773 value
= c_fully_fold (value
, require_constant_value
, &maybe_const
);
7775 if (value
== error_mark_node
)
7776 constructor_erroneous
= 1;
7777 else if (!TREE_CONSTANT (value
))
7778 constructor_constant
= 0;
7779 else if (!initializer_constant_valid_p (value
, TREE_TYPE (value
))
7780 || ((TREE_CODE (constructor_type
) == RECORD_TYPE
7781 || TREE_CODE (constructor_type
) == UNION_TYPE
)
7782 && DECL_C_BIT_FIELD (field
)
7783 && TREE_CODE (value
) != INTEGER_CST
))
7784 constructor_simple
= 0;
7786 constructor_nonconst
= 1;
7788 if (!initializer_constant_valid_p (value
, TREE_TYPE (value
)))
7790 if (require_constant_value
)
7792 error_init ("initializer element is not constant");
7793 value
= error_mark_node
;
7795 else if (require_constant_elements
)
7796 pedwarn (input_location
, 0,
7797 "initializer element is not computable at load time");
7799 else if (!maybe_const
7800 && (require_constant_value
|| require_constant_elements
))
7801 pedwarn_init (input_location
, 0,
7802 "initializer element is not a constant expression");
7804 /* Issue -Wc++-compat warnings about initializing a bitfield with
7807 && field
!= NULL_TREE
7808 && TREE_CODE (field
) == FIELD_DECL
7809 && DECL_BIT_FIELD_TYPE (field
) != NULL_TREE
7810 && (TYPE_MAIN_VARIANT (DECL_BIT_FIELD_TYPE (field
))
7811 != TYPE_MAIN_VARIANT (type
))
7812 && TREE_CODE (DECL_BIT_FIELD_TYPE (field
)) == ENUMERAL_TYPE
)
7814 tree checktype
= origtype
!= NULL_TREE
? origtype
: TREE_TYPE (value
);
7815 if (checktype
!= error_mark_node
7816 && (TYPE_MAIN_VARIANT (checktype
)
7817 != TYPE_MAIN_VARIANT (DECL_BIT_FIELD_TYPE (field
))))
7818 warning_init (OPT_Wc___compat
,
7819 "enum conversion in initialization is invalid in C++");
7822 /* If this field is empty (and not at the end of structure),
7823 don't do anything other than checking the initializer. */
7825 && (TREE_TYPE (field
) == error_mark_node
7826 || (COMPLETE_TYPE_P (TREE_TYPE (field
))
7827 && integer_zerop (TYPE_SIZE (TREE_TYPE (field
)))
7828 && (TREE_CODE (constructor_type
) == ARRAY_TYPE
7829 || DECL_CHAIN (field
)))))
7833 value
= build1 (EXCESS_PRECISION_EXPR
, semantic_type
, value
);
7834 value
= digest_init (input_location
, type
, value
, origtype
, npc
,
7835 strict_string
, require_constant_value
);
7836 if (value
== error_mark_node
)
7838 constructor_erroneous
= 1;
7841 if (require_constant_value
|| require_constant_elements
)
7842 constant_expression_warning (value
);
7844 /* If this element doesn't come next in sequence,
7845 put it on constructor_pending_elts. */
7846 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
7847 && (!constructor_incremental
7848 || !tree_int_cst_equal (field
, constructor_unfilled_index
)))
7850 if (constructor_incremental
7851 && tree_int_cst_lt (field
, constructor_unfilled_index
))
7852 set_nonincremental_init (braced_init_obstack
);
7854 add_pending_init (field
, value
, origtype
, implicit
,
7855 braced_init_obstack
);
7858 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
7859 && (!constructor_incremental
7860 || field
!= constructor_unfilled_fields
))
7862 /* We do this for records but not for unions. In a union,
7863 no matter which field is specified, it can be initialized
7864 right away since it starts at the beginning of the union. */
7865 if (constructor_incremental
)
7867 if (!constructor_unfilled_fields
)
7868 set_nonincremental_init (braced_init_obstack
);
7871 tree bitpos
, unfillpos
;
7873 bitpos
= bit_position (field
);
7874 unfillpos
= bit_position (constructor_unfilled_fields
);
7876 if (tree_int_cst_lt (bitpos
, unfillpos
))
7877 set_nonincremental_init (braced_init_obstack
);
7881 add_pending_init (field
, value
, origtype
, implicit
,
7882 braced_init_obstack
);
7885 else if (TREE_CODE (constructor_type
) == UNION_TYPE
7886 && !vec_safe_is_empty (constructor_elements
))
7890 if (TREE_SIDE_EFFECTS (constructor_elements
->last ().value
))
7892 "initialized field with side-effects overwritten");
7893 else if (warn_override_init
)
7894 warning_init (OPT_Woverride_init
, "initialized field overwritten");
7897 /* We can have just one union field set. */
7898 constructor_elements
= NULL
;
7901 /* Otherwise, output this element either to
7902 constructor_elements or to the assembler file. */
7904 constructor_elt celt
= {field
, value
};
7905 vec_safe_push (constructor_elements
, celt
);
7907 /* Advance the variable that indicates sequential elements output. */
7908 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
7909 constructor_unfilled_index
7910 = size_binop_loc (input_location
, PLUS_EXPR
, constructor_unfilled_index
,
7912 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
7914 constructor_unfilled_fields
7915 = DECL_CHAIN (constructor_unfilled_fields
);
7917 /* Skip any nameless bit fields. */
7918 while (constructor_unfilled_fields
!= 0
7919 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
7920 && DECL_NAME (constructor_unfilled_fields
) == 0)
7921 constructor_unfilled_fields
=
7922 DECL_CHAIN (constructor_unfilled_fields
);
7924 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
7925 constructor_unfilled_fields
= 0;
7927 /* Now output any pending elements which have become next. */
7929 output_pending_init_elements (0, braced_init_obstack
);
7932 /* Output any pending elements which have become next.
7933 As we output elements, constructor_unfilled_{fields,index}
7934 advances, which may cause other elements to become next;
7935 if so, they too are output.
7937 If ALL is 0, we return when there are
7938 no more pending elements to output now.
7940 If ALL is 1, we output space as necessary so that
7941 we can output all the pending elements. */
7943 output_pending_init_elements (int all
, struct obstack
* braced_init_obstack
)
7945 struct init_node
*elt
= constructor_pending_elts
;
7950 /* Look through the whole pending tree.
7951 If we find an element that should be output now,
7952 output it. Otherwise, set NEXT to the element
7953 that comes first among those still pending. */
7958 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
7960 if (tree_int_cst_equal (elt
->purpose
,
7961 constructor_unfilled_index
))
7962 output_init_element (elt
->value
, elt
->origtype
, true,
7963 TREE_TYPE (constructor_type
),
7964 constructor_unfilled_index
, 0, false,
7965 braced_init_obstack
);
7966 else if (tree_int_cst_lt (constructor_unfilled_index
,
7969 /* Advance to the next smaller node. */
7974 /* We have reached the smallest node bigger than the
7975 current unfilled index. Fill the space first. */
7976 next
= elt
->purpose
;
7982 /* Advance to the next bigger node. */
7987 /* We have reached the biggest node in a subtree. Find
7988 the parent of it, which is the next bigger node. */
7989 while (elt
->parent
&& elt
->parent
->right
== elt
)
7992 if (elt
&& tree_int_cst_lt (constructor_unfilled_index
,
7995 next
= elt
->purpose
;
8001 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
8002 || TREE_CODE (constructor_type
) == UNION_TYPE
)
8004 tree ctor_unfilled_bitpos
, elt_bitpos
;
8006 /* If the current record is complete we are done. */
8007 if (constructor_unfilled_fields
== 0)
8010 ctor_unfilled_bitpos
= bit_position (constructor_unfilled_fields
);
8011 elt_bitpos
= bit_position (elt
->purpose
);
8012 /* We can't compare fields here because there might be empty
8013 fields in between. */
8014 if (tree_int_cst_equal (elt_bitpos
, ctor_unfilled_bitpos
))
8016 constructor_unfilled_fields
= elt
->purpose
;
8017 output_init_element (elt
->value
, elt
->origtype
, true,
8018 TREE_TYPE (elt
->purpose
),
8019 elt
->purpose
, 0, false,
8020 braced_init_obstack
);
8022 else if (tree_int_cst_lt (ctor_unfilled_bitpos
, elt_bitpos
))
8024 /* Advance to the next smaller node. */
8029 /* We have reached the smallest node bigger than the
8030 current unfilled field. Fill the space first. */
8031 next
= elt
->purpose
;
8037 /* Advance to the next bigger node. */
8042 /* We have reached the biggest node in a subtree. Find
8043 the parent of it, which is the next bigger node. */
8044 while (elt
->parent
&& elt
->parent
->right
== elt
)
8048 && (tree_int_cst_lt (ctor_unfilled_bitpos
,
8049 bit_position (elt
->purpose
))))
8051 next
= elt
->purpose
;
8059 /* Ordinarily return, but not if we want to output all
8060 and there are elements left. */
8061 if (!(all
&& next
!= 0))
8064 /* If it's not incremental, just skip over the gap, so that after
8065 jumping to retry we will output the next successive element. */
8066 if (TREE_CODE (constructor_type
) == RECORD_TYPE
8067 || TREE_CODE (constructor_type
) == UNION_TYPE
)
8068 constructor_unfilled_fields
= next
;
8069 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
8070 constructor_unfilled_index
= next
;
8072 /* ELT now points to the node in the pending tree with the next
8073 initializer to output. */
8077 /* Add one non-braced element to the current constructor level.
8078 This adjusts the current position within the constructor's type.
8079 This may also start or terminate implicit levels
8080 to handle a partly-braced initializer.
8082 Once this has found the correct level for the new element,
8083 it calls output_init_element.
8085 IMPLICIT is true if value comes from pop_init_level (1),
8086 the new initializer has been merged with the existing one
8087 and thus no warnings should be emitted about overriding an
8088 existing initializer. */
8091 process_init_element (struct c_expr value
, bool implicit
,
8092 struct obstack
* braced_init_obstack
)
8094 tree orig_value
= value
.value
;
8095 int string_flag
= orig_value
!= 0 && TREE_CODE (orig_value
) == STRING_CST
;
8096 bool strict_string
= value
.original_code
== STRING_CST
;
8098 designator_depth
= 0;
8099 designator_erroneous
= 0;
8101 /* Handle superfluous braces around string cst as in
8102 char x[] = {"foo"}; */
8105 && TREE_CODE (constructor_type
) == ARRAY_TYPE
8106 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type
))
8107 && integer_zerop (constructor_unfilled_index
))
8109 if (constructor_stack
->replacement_value
.value
)
8110 error_init ("excess elements in char array initializer");
8111 constructor_stack
->replacement_value
= value
;
8115 if (constructor_stack
->replacement_value
.value
!= 0)
8117 error_init ("excess elements in struct initializer");
8121 /* Ignore elements of a brace group if it is entirely superfluous
8122 and has already been diagnosed. */
8123 if (constructor_type
== 0)
8126 /* If we've exhausted any levels that didn't have braces,
8128 while (constructor_stack
->implicit
)
8130 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
8131 || TREE_CODE (constructor_type
) == UNION_TYPE
)
8132 && constructor_fields
== 0)
8133 process_init_element (pop_init_level (1, braced_init_obstack
),
8134 true, braced_init_obstack
);
8135 else if ((TREE_CODE (constructor_type
) == ARRAY_TYPE
8136 || TREE_CODE (constructor_type
) == VECTOR_TYPE
)
8137 && constructor_max_index
8138 && tree_int_cst_lt (constructor_max_index
,
8140 process_init_element (pop_init_level (1, braced_init_obstack
),
8141 true, braced_init_obstack
);
8146 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
8147 if (constructor_range_stack
)
8149 /* If value is a compound literal and we'll be just using its
8150 content, don't put it into a SAVE_EXPR. */
8151 if (TREE_CODE (value
.value
) != COMPOUND_LITERAL_EXPR
8152 || !require_constant_value
8155 tree semantic_type
= NULL_TREE
;
8156 if (TREE_CODE (value
.value
) == EXCESS_PRECISION_EXPR
)
8158 semantic_type
= TREE_TYPE (value
.value
);
8159 value
.value
= TREE_OPERAND (value
.value
, 0);
8161 value
.value
= c_save_expr (value
.value
);
8163 value
.value
= build1 (EXCESS_PRECISION_EXPR
, semantic_type
,
8170 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
8173 enum tree_code fieldcode
;
8175 if (constructor_fields
== 0)
8177 pedwarn_init (input_location
, 0,
8178 "excess elements in struct initializer");
8182 fieldtype
= TREE_TYPE (constructor_fields
);
8183 if (fieldtype
!= error_mark_node
)
8184 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
8185 fieldcode
= TREE_CODE (fieldtype
);
8187 /* Error for non-static initialization of a flexible array member. */
8188 if (fieldcode
== ARRAY_TYPE
8189 && !require_constant_value
8190 && TYPE_SIZE (fieldtype
) == NULL_TREE
8191 && DECL_CHAIN (constructor_fields
) == NULL_TREE
)
8193 error_init ("non-static initialization of a flexible array member");
8197 /* Accept a string constant to initialize a subarray. */
8198 if (value
.value
!= 0
8199 && fieldcode
== ARRAY_TYPE
8200 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype
))
8202 value
.value
= orig_value
;
8203 /* Otherwise, if we have come to a subaggregate,
8204 and we don't have an element of its type, push into it. */
8205 else if (value
.value
!= 0
8206 && value
.value
!= error_mark_node
8207 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != fieldtype
8208 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
8209 || fieldcode
== UNION_TYPE
|| fieldcode
== VECTOR_TYPE
))
8211 push_init_level (1, braced_init_obstack
);
8217 push_member_name (constructor_fields
);
8218 output_init_element (value
.value
, value
.original_type
,
8219 strict_string
, fieldtype
,
8220 constructor_fields
, 1, implicit
,
8221 braced_init_obstack
);
8222 RESTORE_SPELLING_DEPTH (constructor_depth
);
8225 /* Do the bookkeeping for an element that was
8226 directly output as a constructor. */
8228 /* For a record, keep track of end position of last field. */
8229 if (DECL_SIZE (constructor_fields
))
8230 constructor_bit_index
8231 = size_binop_loc (input_location
, PLUS_EXPR
,
8232 bit_position (constructor_fields
),
8233 DECL_SIZE (constructor_fields
));
8235 /* If the current field was the first one not yet written out,
8236 it isn't now, so update. */
8237 if (constructor_unfilled_fields
== constructor_fields
)
8239 constructor_unfilled_fields
= DECL_CHAIN (constructor_fields
);
8240 /* Skip any nameless bit fields. */
8241 while (constructor_unfilled_fields
!= 0
8242 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
8243 && DECL_NAME (constructor_unfilled_fields
) == 0)
8244 constructor_unfilled_fields
=
8245 DECL_CHAIN (constructor_unfilled_fields
);
8249 constructor_fields
= DECL_CHAIN (constructor_fields
);
8250 /* Skip any nameless bit fields at the beginning. */
8251 while (constructor_fields
!= 0
8252 && DECL_C_BIT_FIELD (constructor_fields
)
8253 && DECL_NAME (constructor_fields
) == 0)
8254 constructor_fields
= DECL_CHAIN (constructor_fields
);
8256 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
8259 enum tree_code fieldcode
;
8261 if (constructor_fields
== 0)
8263 pedwarn_init (input_location
, 0,
8264 "excess elements in union initializer");
8268 fieldtype
= TREE_TYPE (constructor_fields
);
8269 if (fieldtype
!= error_mark_node
)
8270 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
8271 fieldcode
= TREE_CODE (fieldtype
);
8273 /* Warn that traditional C rejects initialization of unions.
8274 We skip the warning if the value is zero. This is done
8275 under the assumption that the zero initializer in user
8276 code appears conditioned on e.g. __STDC__ to avoid
8277 "missing initializer" warnings and relies on default
8278 initialization to zero in the traditional C case.
8279 We also skip the warning if the initializer is designated,
8280 again on the assumption that this must be conditional on
8281 __STDC__ anyway (and we've already complained about the
8282 member-designator already). */
8283 if (!in_system_header
&& !constructor_designated
8284 && !(value
.value
&& (integer_zerop (value
.value
)
8285 || real_zerop (value
.value
))))
8286 warning (OPT_Wtraditional
, "traditional C rejects initialization "
8289 /* Accept a string constant to initialize a subarray. */
8290 if (value
.value
!= 0
8291 && fieldcode
== ARRAY_TYPE
8292 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype
))
8294 value
.value
= orig_value
;
8295 /* Otherwise, if we have come to a subaggregate,
8296 and we don't have an element of its type, push into it. */
8297 else if (value
.value
!= 0
8298 && value
.value
!= error_mark_node
8299 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != fieldtype
8300 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
8301 || fieldcode
== UNION_TYPE
|| fieldcode
== VECTOR_TYPE
))
8303 push_init_level (1, braced_init_obstack
);
8309 push_member_name (constructor_fields
);
8310 output_init_element (value
.value
, value
.original_type
,
8311 strict_string
, fieldtype
,
8312 constructor_fields
, 1, implicit
,
8313 braced_init_obstack
);
8314 RESTORE_SPELLING_DEPTH (constructor_depth
);
8317 /* Do the bookkeeping for an element that was
8318 directly output as a constructor. */
8320 constructor_bit_index
= DECL_SIZE (constructor_fields
);
8321 constructor_unfilled_fields
= DECL_CHAIN (constructor_fields
);
8324 constructor_fields
= 0;
8326 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
8328 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
8329 enum tree_code eltcode
= TREE_CODE (elttype
);
8331 /* Accept a string constant to initialize a subarray. */
8332 if (value
.value
!= 0
8333 && eltcode
== ARRAY_TYPE
8334 && INTEGRAL_TYPE_P (TREE_TYPE (elttype
))
8336 value
.value
= orig_value
;
8337 /* Otherwise, if we have come to a subaggregate,
8338 and we don't have an element of its type, push into it. */
8339 else if (value
.value
!= 0
8340 && value
.value
!= error_mark_node
8341 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != elttype
8342 && (eltcode
== RECORD_TYPE
|| eltcode
== ARRAY_TYPE
8343 || eltcode
== UNION_TYPE
|| eltcode
== VECTOR_TYPE
))
8345 push_init_level (1, braced_init_obstack
);
8349 if (constructor_max_index
!= 0
8350 && (tree_int_cst_lt (constructor_max_index
, constructor_index
)
8351 || integer_all_onesp (constructor_max_index
)))
8353 pedwarn_init (input_location
, 0,
8354 "excess elements in array initializer");
8358 /* Now output the actual element. */
8361 push_array_bounds (tree_low_cst (constructor_index
, 1));
8362 output_init_element (value
.value
, value
.original_type
,
8363 strict_string
, elttype
,
8364 constructor_index
, 1, implicit
,
8365 braced_init_obstack
);
8366 RESTORE_SPELLING_DEPTH (constructor_depth
);
8370 = size_binop_loc (input_location
, PLUS_EXPR
,
8371 constructor_index
, bitsize_one_node
);
8374 /* If we are doing the bookkeeping for an element that was
8375 directly output as a constructor, we must update
8376 constructor_unfilled_index. */
8377 constructor_unfilled_index
= constructor_index
;
8379 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
8381 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
8383 /* Do a basic check of initializer size. Note that vectors
8384 always have a fixed size derived from their type. */
8385 if (tree_int_cst_lt (constructor_max_index
, constructor_index
))
8387 pedwarn_init (input_location
, 0,
8388 "excess elements in vector initializer");
8392 /* Now output the actual element. */
8395 if (TREE_CODE (value
.value
) == VECTOR_CST
)
8396 elttype
= TYPE_MAIN_VARIANT (constructor_type
);
8397 output_init_element (value
.value
, value
.original_type
,
8398 strict_string
, elttype
,
8399 constructor_index
, 1, implicit
,
8400 braced_init_obstack
);
8404 = size_binop_loc (input_location
,
8405 PLUS_EXPR
, constructor_index
, bitsize_one_node
);
8408 /* If we are doing the bookkeeping for an element that was
8409 directly output as a constructor, we must update
8410 constructor_unfilled_index. */
8411 constructor_unfilled_index
= constructor_index
;
8414 /* Handle the sole element allowed in a braced initializer
8415 for a scalar variable. */
8416 else if (constructor_type
!= error_mark_node
8417 && constructor_fields
== 0)
8419 pedwarn_init (input_location
, 0,
8420 "excess elements in scalar initializer");
8426 output_init_element (value
.value
, value
.original_type
,
8427 strict_string
, constructor_type
,
8428 NULL_TREE
, 1, implicit
,
8429 braced_init_obstack
);
8430 constructor_fields
= 0;
8433 /* Handle range initializers either at this level or anywhere higher
8434 in the designator stack. */
8435 if (constructor_range_stack
)
8437 struct constructor_range_stack
*p
, *range_stack
;
8440 range_stack
= constructor_range_stack
;
8441 constructor_range_stack
= 0;
8442 while (constructor_stack
!= range_stack
->stack
)
8444 gcc_assert (constructor_stack
->implicit
);
8445 process_init_element (pop_init_level (1,
8446 braced_init_obstack
),
8447 true, braced_init_obstack
);
8449 for (p
= range_stack
;
8450 !p
->range_end
|| tree_int_cst_equal (p
->index
, p
->range_end
);
8453 gcc_assert (constructor_stack
->implicit
);
8454 process_init_element (pop_init_level (1, braced_init_obstack
),
8455 true, braced_init_obstack
);
8458 p
->index
= size_binop_loc (input_location
,
8459 PLUS_EXPR
, p
->index
, bitsize_one_node
);
8460 if (tree_int_cst_equal (p
->index
, p
->range_end
) && !p
->prev
)
8465 constructor_index
= p
->index
;
8466 constructor_fields
= p
->fields
;
8467 if (finish
&& p
->range_end
&& p
->index
== p
->range_start
)
8475 push_init_level (2, braced_init_obstack
);
8476 p
->stack
= constructor_stack
;
8477 if (p
->range_end
&& tree_int_cst_equal (p
->index
, p
->range_end
))
8478 p
->index
= p
->range_start
;
8482 constructor_range_stack
= range_stack
;
8489 constructor_range_stack
= 0;
8492 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
8493 (guaranteed to be 'volatile' or null) and ARGS (represented using
8494 an ASM_EXPR node). */
8496 build_asm_stmt (tree cv_qualifier
, tree args
)
8498 if (!ASM_VOLATILE_P (args
) && cv_qualifier
)
8499 ASM_VOLATILE_P (args
) = 1;
8500 return add_stmt (args
);
8503 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
8504 some INPUTS, and some CLOBBERS. The latter three may be NULL.
8505 SIMPLE indicates whether there was anything at all after the
8506 string in the asm expression -- asm("blah") and asm("blah" : )
8507 are subtly different. We use a ASM_EXPR node to represent this. */
8509 build_asm_expr (location_t loc
, tree string
, tree outputs
, tree inputs
,
8510 tree clobbers
, tree labels
, bool simple
)
8515 const char *constraint
;
8516 const char **oconstraints
;
8517 bool allows_mem
, allows_reg
, is_inout
;
8518 int ninputs
, noutputs
;
8520 ninputs
= list_length (inputs
);
8521 noutputs
= list_length (outputs
);
8522 oconstraints
= (const char **) alloca (noutputs
* sizeof (const char *));
8524 string
= resolve_asm_operand_names (string
, outputs
, inputs
, labels
);
8526 /* Remove output conversions that change the type but not the mode. */
8527 for (i
= 0, tail
= outputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
8529 tree output
= TREE_VALUE (tail
);
8531 output
= c_fully_fold (output
, false, NULL
);
8533 /* ??? Really, this should not be here. Users should be using a
8534 proper lvalue, dammit. But there's a long history of using casts
8535 in the output operands. In cases like longlong.h, this becomes a
8536 primitive form of typechecking -- if the cast can be removed, then
8537 the output operand had a type of the proper width; otherwise we'll
8538 get an error. Gross, but ... */
8539 STRIP_NOPS (output
);
8541 if (!lvalue_or_else (loc
, output
, lv_asm
))
8542 output
= error_mark_node
;
8544 if (output
!= error_mark_node
8545 && (TREE_READONLY (output
)
8546 || TYPE_READONLY (TREE_TYPE (output
))
8547 || ((TREE_CODE (TREE_TYPE (output
)) == RECORD_TYPE
8548 || TREE_CODE (TREE_TYPE (output
)) == UNION_TYPE
)
8549 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output
)))))
8550 readonly_error (output
, lv_asm
);
8552 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
8553 oconstraints
[i
] = constraint
;
8555 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
8556 &allows_mem
, &allows_reg
, &is_inout
))
8558 /* If the operand is going to end up in memory,
8559 mark it addressable. */
8560 if (!allows_reg
&& !c_mark_addressable (output
))
8561 output
= error_mark_node
;
8562 if (!(!allows_reg
&& allows_mem
)
8563 && output
!= error_mark_node
8564 && VOID_TYPE_P (TREE_TYPE (output
)))
8566 error_at (loc
, "invalid use of void expression");
8567 output
= error_mark_node
;
8571 output
= error_mark_node
;
8573 TREE_VALUE (tail
) = output
;
8576 for (i
= 0, tail
= inputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
8580 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
8581 input
= TREE_VALUE (tail
);
8583 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
8584 oconstraints
, &allows_mem
, &allows_reg
))
8586 /* If the operand is going to end up in memory,
8587 mark it addressable. */
8588 if (!allows_reg
&& allows_mem
)
8590 input
= c_fully_fold (input
, false, NULL
);
8592 /* Strip the nops as we allow this case. FIXME, this really
8593 should be rejected or made deprecated. */
8595 if (!c_mark_addressable (input
))
8596 input
= error_mark_node
;
8601 memset (&expr
, 0, sizeof (expr
));
8603 expr
= default_function_array_conversion (loc
, expr
);
8604 input
= c_fully_fold (expr
.value
, false, NULL
);
8606 if (input
!= error_mark_node
&& VOID_TYPE_P (TREE_TYPE (input
)))
8608 error_at (loc
, "invalid use of void expression");
8609 input
= error_mark_node
;
8614 input
= error_mark_node
;
8616 TREE_VALUE (tail
) = input
;
8619 /* ASMs with labels cannot have outputs. This should have been
8620 enforced by the parser. */
8621 gcc_assert (outputs
== NULL
|| labels
== NULL
);
8623 args
= build_stmt (loc
, ASM_EXPR
, string
, outputs
, inputs
, clobbers
, labels
);
8625 /* asm statements without outputs, including simple ones, are treated
8627 ASM_INPUT_P (args
) = simple
;
8628 ASM_VOLATILE_P (args
) = (noutputs
== 0);
8633 /* Generate a goto statement to LABEL. LOC is the location of the
8637 c_finish_goto_label (location_t loc
, tree label
)
8639 tree decl
= lookup_label_for_goto (loc
, label
);
8642 TREE_USED (decl
) = 1;
8644 tree t
= build1 (GOTO_EXPR
, void_type_node
, decl
);
8645 SET_EXPR_LOCATION (t
, loc
);
8646 return add_stmt (t
);
8650 /* Generate a computed goto statement to EXPR. LOC is the location of
8654 c_finish_goto_ptr (location_t loc
, tree expr
)
8657 pedwarn (loc
, OPT_Wpedantic
, "ISO C forbids %<goto *expr;%>");
8658 expr
= c_fully_fold (expr
, false, NULL
);
8659 expr
= convert (ptr_type_node
, expr
);
8660 t
= build1 (GOTO_EXPR
, void_type_node
, expr
);
8661 SET_EXPR_LOCATION (t
, loc
);
8662 return add_stmt (t
);
8665 /* Generate a C `return' statement. RETVAL is the expression for what
8666 to return, or a null pointer for `return;' with no value. LOC is
8667 the location of the return statement. If ORIGTYPE is not NULL_TREE, it
8668 is the original type of RETVAL. */
8671 c_finish_return (location_t loc
, tree retval
, tree origtype
)
8673 tree valtype
= TREE_TYPE (TREE_TYPE (current_function_decl
)), ret_stmt
;
8674 bool no_warning
= false;
8678 if (TREE_THIS_VOLATILE (current_function_decl
))
8680 "function declared %<noreturn%> has a %<return%> statement");
8682 if (flag_enable_cilkplus
&& contains_array_notation_expr (retval
))
8684 /* Array notations are allowed in a return statement if it is inside a
8685 built-in array notation reduction function. */
8686 if (!find_rank (loc
, retval
, retval
, false, &rank
))
8687 return error_mark_node
;
8690 error_at (loc
, "array notation expression cannot be used as a "
8692 return error_mark_node
;
8697 tree semantic_type
= NULL_TREE
;
8698 npc
= null_pointer_constant_p (retval
);
8699 if (TREE_CODE (retval
) == EXCESS_PRECISION_EXPR
)
8701 semantic_type
= TREE_TYPE (retval
);
8702 retval
= TREE_OPERAND (retval
, 0);
8704 retval
= c_fully_fold (retval
, false, NULL
);
8706 retval
= build1 (EXCESS_PRECISION_EXPR
, semantic_type
, retval
);
8711 current_function_returns_null
= 1;
8712 if ((warn_return_type
|| flag_isoc99
)
8713 && valtype
!= 0 && TREE_CODE (valtype
) != VOID_TYPE
)
8715 pedwarn_c99 (loc
, flag_isoc99
? 0 : OPT_Wreturn_type
,
8716 "%<return%> with no value, in "
8717 "function returning non-void");
8721 else if (valtype
== 0 || TREE_CODE (valtype
) == VOID_TYPE
)
8723 current_function_returns_null
= 1;
8724 if (TREE_CODE (TREE_TYPE (retval
)) != VOID_TYPE
)
8726 "%<return%> with a value, in function returning void");
8728 pedwarn (loc
, OPT_Wpedantic
, "ISO C forbids "
8729 "%<return%> with expression, in function returning void");
8733 tree t
= convert_for_assignment (loc
, valtype
, retval
, origtype
,
8735 npc
, NULL_TREE
, NULL_TREE
, 0);
8736 tree res
= DECL_RESULT (current_function_decl
);
8740 current_function_returns_value
= 1;
8741 if (t
== error_mark_node
)
8744 save
= in_late_binary_op
;
8745 if (TREE_CODE (TREE_TYPE (res
)) == BOOLEAN_TYPE
8746 || TREE_CODE (TREE_TYPE (res
)) == COMPLEX_TYPE
)
8747 in_late_binary_op
= true;
8748 inner
= t
= convert (TREE_TYPE (res
), t
);
8749 in_late_binary_op
= save
;
8751 /* Strip any conversions, additions, and subtractions, and see if
8752 we are returning the address of a local variable. Warn if so. */
8755 switch (TREE_CODE (inner
))
8758 case NON_LVALUE_EXPR
:
8760 case POINTER_PLUS_EXPR
:
8761 inner
= TREE_OPERAND (inner
, 0);
8765 /* If the second operand of the MINUS_EXPR has a pointer
8766 type (or is converted from it), this may be valid, so
8767 don't give a warning. */
8769 tree op1
= TREE_OPERAND (inner
, 1);
8771 while (!POINTER_TYPE_P (TREE_TYPE (op1
))
8772 && (CONVERT_EXPR_P (op1
)
8773 || TREE_CODE (op1
) == NON_LVALUE_EXPR
))
8774 op1
= TREE_OPERAND (op1
, 0);
8776 if (POINTER_TYPE_P (TREE_TYPE (op1
)))
8779 inner
= TREE_OPERAND (inner
, 0);
8784 inner
= TREE_OPERAND (inner
, 0);
8786 while (REFERENCE_CLASS_P (inner
)
8787 && TREE_CODE (inner
) != INDIRECT_REF
)
8788 inner
= TREE_OPERAND (inner
, 0);
8791 && !DECL_EXTERNAL (inner
)
8792 && !TREE_STATIC (inner
)
8793 && DECL_CONTEXT (inner
) == current_function_decl
)
8795 OPT_Wreturn_local_addr
, "function returns address "
8796 "of local variable");
8806 retval
= build2 (MODIFY_EXPR
, TREE_TYPE (res
), res
, t
);
8807 SET_EXPR_LOCATION (retval
, loc
);
8809 if (warn_sequence_point
)
8810 verify_sequence_points (retval
);
8813 ret_stmt
= build_stmt (loc
, RETURN_EXPR
, retval
);
8814 TREE_NO_WARNING (ret_stmt
) |= no_warning
;
8815 return add_stmt (ret_stmt
);
8819 /* The SWITCH_EXPR being built. */
8822 /* The original type of the testing expression, i.e. before the
8823 default conversion is applied. */
8826 /* A splay-tree mapping the low element of a case range to the high
8827 element, or NULL_TREE if there is no high element. Used to
8828 determine whether or not a new case label duplicates an old case
8829 label. We need a tree, rather than simply a hash table, because
8830 of the GNU case range extension. */
8833 /* The bindings at the point of the switch. This is used for
8834 warnings crossing decls when branching to a case label. */
8835 struct c_spot_bindings
*bindings
;
8837 /* The next node on the stack. */
8838 struct c_switch
*next
;
8841 /* A stack of the currently active switch statements. The innermost
8842 switch statement is on the top of the stack. There is no need to
8843 mark the stack for garbage collection because it is only active
8844 during the processing of the body of a function, and we never
8845 collect at that point. */
8847 struct c_switch
*c_switch_stack
;
8849 /* Start a C switch statement, testing expression EXP. Return the new
8850 SWITCH_EXPR. SWITCH_LOC is the location of the `switch'.
8851 SWITCH_COND_LOC is the location of the switch's condition. */
8854 c_start_case (location_t switch_loc
,
8855 location_t switch_cond_loc
,
8858 tree orig_type
= error_mark_node
;
8859 struct c_switch
*cs
;
8861 if (exp
!= error_mark_node
)
8863 orig_type
= TREE_TYPE (exp
);
8865 if (!INTEGRAL_TYPE_P (orig_type
))
8867 if (orig_type
!= error_mark_node
)
8869 error_at (switch_cond_loc
, "switch quantity not an integer");
8870 orig_type
= error_mark_node
;
8872 exp
= integer_zero_node
;
8876 tree type
= TYPE_MAIN_VARIANT (orig_type
);
8878 if (!in_system_header
8879 && (type
== long_integer_type_node
8880 || type
== long_unsigned_type_node
))
8881 warning_at (switch_cond_loc
,
8882 OPT_Wtraditional
, "%<long%> switch expression not "
8883 "converted to %<int%> in ISO C");
8885 exp
= c_fully_fold (exp
, false, NULL
);
8886 exp
= default_conversion (exp
);
8888 if (warn_sequence_point
)
8889 verify_sequence_points (exp
);
8893 /* Add this new SWITCH_EXPR to the stack. */
8894 cs
= XNEW (struct c_switch
);
8895 cs
->switch_expr
= build3 (SWITCH_EXPR
, orig_type
, exp
, NULL_TREE
, NULL_TREE
);
8896 SET_EXPR_LOCATION (cs
->switch_expr
, switch_loc
);
8897 cs
->orig_type
= orig_type
;
8898 cs
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
8899 cs
->bindings
= c_get_switch_bindings ();
8900 cs
->next
= c_switch_stack
;
8901 c_switch_stack
= cs
;
8903 return add_stmt (cs
->switch_expr
);
8906 /* Process a case label at location LOC. */
8909 do_case (location_t loc
, tree low_value
, tree high_value
)
8911 tree label
= NULL_TREE
;
8913 if (low_value
&& TREE_CODE (low_value
) != INTEGER_CST
)
8915 low_value
= c_fully_fold (low_value
, false, NULL
);
8916 if (TREE_CODE (low_value
) == INTEGER_CST
)
8917 pedwarn (input_location
, OPT_Wpedantic
,
8918 "case label is not an integer constant expression");
8921 if (high_value
&& TREE_CODE (high_value
) != INTEGER_CST
)
8923 high_value
= c_fully_fold (high_value
, false, NULL
);
8924 if (TREE_CODE (high_value
) == INTEGER_CST
)
8925 pedwarn (input_location
, OPT_Wpedantic
,
8926 "case label is not an integer constant expression");
8929 if (c_switch_stack
== NULL
)
8932 error_at (loc
, "case label not within a switch statement");
8934 error_at (loc
, "%<default%> label not within a switch statement");
8938 if (c_check_switch_jump_warnings (c_switch_stack
->bindings
,
8939 EXPR_LOCATION (c_switch_stack
->switch_expr
),
8943 label
= c_add_case_label (loc
, c_switch_stack
->cases
,
8944 SWITCH_COND (c_switch_stack
->switch_expr
),
8945 c_switch_stack
->orig_type
,
8946 low_value
, high_value
);
8947 if (label
== error_mark_node
)
8952 /* Finish the switch statement. */
8955 c_finish_case (tree body
)
8957 struct c_switch
*cs
= c_switch_stack
;
8958 location_t switch_location
;
8960 SWITCH_BODY (cs
->switch_expr
) = body
;
8962 /* Emit warnings as needed. */
8963 switch_location
= EXPR_LOCATION (cs
->switch_expr
);
8964 c_do_switch_warnings (cs
->cases
, switch_location
,
8965 TREE_TYPE (cs
->switch_expr
),
8966 SWITCH_COND (cs
->switch_expr
));
8968 /* Pop the stack. */
8969 c_switch_stack
= cs
->next
;
8970 splay_tree_delete (cs
->cases
);
8971 c_release_switch_bindings (cs
->bindings
);
8975 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
8976 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
8977 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
8978 statement, and was not surrounded with parenthesis. */
8981 c_finish_if_stmt (location_t if_locus
, tree cond
, tree then_block
,
8982 tree else_block
, bool nested_if
)
8986 /* If the condition has array notations, then the rank of the then_block and
8987 else_block must be either 0 or be equal to the rank of the condition. If
8988 the condition does not have array notations then break them up as it is
8989 broken up in a normal expression. */
8990 if (flag_enable_cilkplus
&& contains_array_notation_expr (cond
))
8992 size_t then_rank
= 0, cond_rank
= 0, else_rank
= 0;
8993 if (!find_rank (if_locus
, cond
, cond
, true, &cond_rank
))
8996 && !find_rank (if_locus
, then_block
, then_block
, true, &then_rank
))
8999 && !find_rank (if_locus
, else_block
, else_block
, true, &else_rank
))
9001 if (cond_rank
!= then_rank
&& then_rank
!= 0)
9003 error_at (if_locus
, "rank-mismatch between if-statement%'s condition"
9004 " and the then-block");
9007 else if (cond_rank
!= else_rank
&& else_rank
!= 0)
9009 error_at (if_locus
, "rank-mismatch between if-statement%'s condition"
9010 " and the else-block");
9014 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
9015 if (warn_parentheses
&& nested_if
&& else_block
== NULL
)
9017 tree inner_if
= then_block
;
9019 /* We know from the grammar productions that there is an IF nested
9020 within THEN_BLOCK. Due to labels and c99 conditional declarations,
9021 it might not be exactly THEN_BLOCK, but should be the last
9022 non-container statement within. */
9024 switch (TREE_CODE (inner_if
))
9029 inner_if
= BIND_EXPR_BODY (inner_if
);
9031 case STATEMENT_LIST
:
9032 inner_if
= expr_last (then_block
);
9034 case TRY_FINALLY_EXPR
:
9035 case TRY_CATCH_EXPR
:
9036 inner_if
= TREE_OPERAND (inner_if
, 0);
9043 if (COND_EXPR_ELSE (inner_if
))
9044 warning_at (if_locus
, OPT_Wparentheses
,
9045 "suggest explicit braces to avoid ambiguous %<else%>");
9048 stmt
= build3 (COND_EXPR
, void_type_node
, cond
, then_block
, else_block
);
9049 SET_EXPR_LOCATION (stmt
, if_locus
);
9053 /* Emit a general-purpose loop construct. START_LOCUS is the location of
9054 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
9055 is false for DO loops. INCR is the FOR increment expression. BODY is
9056 the statement controlled by the loop. BLAB is the break label. CLAB is
9057 the continue label. Everything is allowed to be NULL. */
9060 c_finish_loop (location_t start_locus
, tree cond
, tree incr
, tree body
,
9061 tree blab
, tree clab
, bool cond_is_first
)
9063 tree entry
= NULL
, exit
= NULL
, t
;
9065 if (flag_enable_cilkplus
&& contains_array_notation_expr (cond
))
9067 error_at (start_locus
, "array notation expression cannot be used in a "
9068 "loop%'s condition");
9072 /* If the condition is zero don't generate a loop construct. */
9073 if (cond
&& integer_zerop (cond
))
9077 t
= build_and_jump (&blab
);
9078 SET_EXPR_LOCATION (t
, start_locus
);
9084 tree top
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
9086 /* If we have an exit condition, then we build an IF with gotos either
9087 out of the loop, or to the top of it. If there's no exit condition,
9088 then we just build a jump back to the top. */
9089 exit
= build_and_jump (&LABEL_EXPR_LABEL (top
));
9091 if (cond
&& !integer_nonzerop (cond
))
9093 /* Canonicalize the loop condition to the end. This means
9094 generating a branch to the loop condition. Reuse the
9095 continue label, if possible. */
9100 entry
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
9101 t
= build_and_jump (&LABEL_EXPR_LABEL (entry
));
9104 t
= build1 (GOTO_EXPR
, void_type_node
, clab
);
9105 SET_EXPR_LOCATION (t
, start_locus
);
9109 t
= build_and_jump (&blab
);
9111 exit
= fold_build3_loc (start_locus
,
9112 COND_EXPR
, void_type_node
, cond
, exit
, t
);
9114 exit
= fold_build3_loc (input_location
,
9115 COND_EXPR
, void_type_node
, cond
, exit
, t
);
9124 add_stmt (build1 (LABEL_EXPR
, void_type_node
, clab
));
9132 add_stmt (build1 (LABEL_EXPR
, void_type_node
, blab
));
9136 c_finish_bc_stmt (location_t loc
, tree
*label_p
, bool is_break
)
9139 tree label
= *label_p
;
9141 /* In switch statements break is sometimes stylistically used after
9142 a return statement. This can lead to spurious warnings about
9143 control reaching the end of a non-void function when it is
9144 inlined. Note that we are calling block_may_fallthru with
9145 language specific tree nodes; this works because
9146 block_may_fallthru returns true when given something it does not
9148 skip
= !block_may_fallthru (cur_stmt_list
);
9153 *label_p
= label
= create_artificial_label (loc
);
9155 else if (TREE_CODE (label
) == LABEL_DECL
)
9157 else switch (TREE_INT_CST_LOW (label
))
9161 error_at (loc
, "break statement not within loop or switch");
9163 error_at (loc
, "continue statement not within a loop");
9167 gcc_assert (is_break
);
9168 error_at (loc
, "break statement used with OpenMP for loop");
9179 add_stmt (build_predict_expr (PRED_CONTINUE
, NOT_TAKEN
));
9181 return add_stmt (build1 (GOTO_EXPR
, void_type_node
, label
));
9184 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
9187 emit_side_effect_warnings (location_t loc
, tree expr
)
9189 if (expr
== error_mark_node
)
9191 else if (!TREE_SIDE_EFFECTS (expr
))
9193 if (!VOID_TYPE_P (TREE_TYPE (expr
)) && !TREE_NO_WARNING (expr
))
9194 warning_at (loc
, OPT_Wunused_value
, "statement with no effect");
9197 warn_if_unused_value (expr
, loc
);
9200 /* Process an expression as if it were a complete statement. Emit
9201 diagnostics, but do not call ADD_STMT. LOC is the location of the
9205 c_process_expr_stmt (location_t loc
, tree expr
)
9212 expr
= c_fully_fold (expr
, false, NULL
);
9214 if (warn_sequence_point
)
9215 verify_sequence_points (expr
);
9217 if (TREE_TYPE (expr
) != error_mark_node
9218 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr
))
9219 && TREE_CODE (TREE_TYPE (expr
)) != ARRAY_TYPE
)
9220 error_at (loc
, "expression statement has incomplete type");
9222 /* If we're not processing a statement expression, warn about unused values.
9223 Warnings for statement expressions will be emitted later, once we figure
9224 out which is the result. */
9225 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list
)
9226 && warn_unused_value
)
9227 emit_side_effect_warnings (loc
, expr
);
9230 while (TREE_CODE (exprv
) == COMPOUND_EXPR
)
9231 exprv
= TREE_OPERAND (exprv
, 1);
9232 while (CONVERT_EXPR_P (exprv
))
9233 exprv
= TREE_OPERAND (exprv
, 0);
9235 || handled_component_p (exprv
)
9236 || TREE_CODE (exprv
) == ADDR_EXPR
)
9237 mark_exp_read (exprv
);
9239 /* If the expression is not of a type to which we cannot assign a line
9240 number, wrap the thing in a no-op NOP_EXPR. */
9241 if (DECL_P (expr
) || CONSTANT_CLASS_P (expr
))
9243 expr
= build1 (NOP_EXPR
, TREE_TYPE (expr
), expr
);
9244 SET_EXPR_LOCATION (expr
, loc
);
9250 /* Emit an expression as a statement. LOC is the location of the
9254 c_finish_expr_stmt (location_t loc
, tree expr
)
9257 return add_stmt (c_process_expr_stmt (loc
, expr
));
9262 /* Do the opposite and emit a statement as an expression. To begin,
9263 create a new binding level and return it. */
9266 c_begin_stmt_expr (void)
9270 /* We must force a BLOCK for this level so that, if it is not expanded
9271 later, there is a way to turn off the entire subtree of blocks that
9272 are contained in it. */
9274 ret
= c_begin_compound_stmt (true);
9276 c_bindings_start_stmt_expr (c_switch_stack
== NULL
9278 : c_switch_stack
->bindings
);
9280 /* Mark the current statement list as belonging to a statement list. */
9281 STATEMENT_LIST_STMT_EXPR (ret
) = 1;
9286 /* LOC is the location of the compound statement to which this body
9290 c_finish_stmt_expr (location_t loc
, tree body
)
9292 tree last
, type
, tmp
, val
;
9295 body
= c_end_compound_stmt (loc
, body
, true);
9297 c_bindings_end_stmt_expr (c_switch_stack
== NULL
9299 : c_switch_stack
->bindings
);
9301 /* Locate the last statement in BODY. See c_end_compound_stmt
9302 about always returning a BIND_EXPR. */
9303 last_p
= &BIND_EXPR_BODY (body
);
9304 last
= BIND_EXPR_BODY (body
);
9307 if (TREE_CODE (last
) == STATEMENT_LIST
)
9309 tree_stmt_iterator i
;
9311 /* This can happen with degenerate cases like ({ }). No value. */
9312 if (!TREE_SIDE_EFFECTS (last
))
9315 /* If we're supposed to generate side effects warnings, process
9316 all of the statements except the last. */
9317 if (warn_unused_value
)
9319 for (i
= tsi_start (last
); !tsi_one_before_end_p (i
); tsi_next (&i
))
9322 tree t
= tsi_stmt (i
);
9324 tloc
= EXPR_HAS_LOCATION (t
) ? EXPR_LOCATION (t
) : loc
;
9325 emit_side_effect_warnings (tloc
, t
);
9329 i
= tsi_last (last
);
9330 last_p
= tsi_stmt_ptr (i
);
9334 /* If the end of the list is exception related, then the list was split
9335 by a call to push_cleanup. Continue searching. */
9336 if (TREE_CODE (last
) == TRY_FINALLY_EXPR
9337 || TREE_CODE (last
) == TRY_CATCH_EXPR
)
9339 last_p
= &TREE_OPERAND (last
, 0);
9341 goto continue_searching
;
9344 if (last
== error_mark_node
)
9347 /* In the case that the BIND_EXPR is not necessary, return the
9348 expression out from inside it. */
9349 if (last
== BIND_EXPR_BODY (body
)
9350 && BIND_EXPR_VARS (body
) == NULL
)
9352 /* Even if this looks constant, do not allow it in a constant
9354 last
= c_wrap_maybe_const (last
, true);
9355 /* Do not warn if the return value of a statement expression is
9357 TREE_NO_WARNING (last
) = 1;
9361 /* Extract the type of said expression. */
9362 type
= TREE_TYPE (last
);
9364 /* If we're not returning a value at all, then the BIND_EXPR that
9365 we already have is a fine expression to return. */
9366 if (!type
|| VOID_TYPE_P (type
))
9369 /* Now that we've located the expression containing the value, it seems
9370 silly to make voidify_wrapper_expr repeat the process. Create a
9371 temporary of the appropriate type and stick it in a TARGET_EXPR. */
9372 tmp
= create_tmp_var_raw (type
, NULL
);
9374 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
9375 tree_expr_nonnegative_p giving up immediately. */
9377 if (TREE_CODE (val
) == NOP_EXPR
9378 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0)))
9379 val
= TREE_OPERAND (val
, 0);
9381 *last_p
= build2 (MODIFY_EXPR
, void_type_node
, tmp
, val
);
9382 SET_EXPR_LOCATION (*last_p
, EXPR_LOCATION (last
));
9385 tree t
= build4 (TARGET_EXPR
, type
, tmp
, body
, NULL_TREE
, NULL_TREE
);
9386 SET_EXPR_LOCATION (t
, loc
);
9391 /* Begin and end compound statements. This is as simple as pushing
9392 and popping new statement lists from the tree. */
9395 c_begin_compound_stmt (bool do_scope
)
9397 tree stmt
= push_stmt_list ();
9403 /* End a compound statement. STMT is the statement. LOC is the
9404 location of the compound statement-- this is usually the location
9405 of the opening brace. */
9408 c_end_compound_stmt (location_t loc
, tree stmt
, bool do_scope
)
9414 if (c_dialect_objc ())
9415 objc_clear_super_receiver ();
9416 block
= pop_scope ();
9419 stmt
= pop_stmt_list (stmt
);
9420 stmt
= c_build_bind_expr (loc
, block
, stmt
);
9422 /* If this compound statement is nested immediately inside a statement
9423 expression, then force a BIND_EXPR to be created. Otherwise we'll
9424 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
9425 STATEMENT_LISTs merge, and thus we can lose track of what statement
9427 if (building_stmt_list_p ()
9428 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list
)
9429 && TREE_CODE (stmt
) != BIND_EXPR
)
9431 stmt
= build3 (BIND_EXPR
, void_type_node
, NULL
, stmt
, NULL
);
9432 TREE_SIDE_EFFECTS (stmt
) = 1;
9433 SET_EXPR_LOCATION (stmt
, loc
);
9439 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
9440 when the current scope is exited. EH_ONLY is true when this is not
9441 meant to apply to normal control flow transfer. */
9444 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
9446 enum tree_code code
;
9450 code
= eh_only
? TRY_CATCH_EXPR
: TRY_FINALLY_EXPR
;
9451 stmt
= build_stmt (DECL_SOURCE_LOCATION (decl
), code
, NULL
, cleanup
);
9453 stmt_expr
= STATEMENT_LIST_STMT_EXPR (cur_stmt_list
);
9454 list
= push_stmt_list ();
9455 TREE_OPERAND (stmt
, 0) = list
;
9456 STATEMENT_LIST_STMT_EXPR (list
) = stmt_expr
;
9459 /* Build a binary-operation expression without default conversions.
9460 CODE is the kind of expression to build.
9461 LOCATION is the operator's location.
9462 This function differs from `build' in several ways:
9463 the data type of the result is computed and recorded in it,
9464 warnings are generated if arg data types are invalid,
9465 special handling for addition and subtraction of pointers is known,
9466 and some optimization is done (operations on narrow ints
9467 are done in the narrower type when that gives the same result).
9468 Constant folding is also done before the result is returned.
9470 Note that the operands will never have enumeral types, or function
9471 or array types, because either they will have the default conversions
9472 performed or they have both just been converted to some other type in which
9473 the arithmetic is to be done. */
9476 build_binary_op (location_t location
, enum tree_code code
,
9477 tree orig_op0
, tree orig_op1
, int convert_p
)
9479 tree type0
, type1
, orig_type0
, orig_type1
;
9481 enum tree_code code0
, code1
;
9483 tree ret
= error_mark_node
;
9484 const char *invalid_op_diag
;
9485 bool op0_int_operands
, op1_int_operands
;
9486 bool int_const
, int_const_or_overflow
, int_operands
;
9488 /* Expression code to give to the expression when it is built.
9489 Normally this is CODE, which is what the caller asked for,
9490 but in some special cases we change it. */
9491 enum tree_code resultcode
= code
;
9493 /* Data type in which the computation is to be performed.
9494 In the simplest cases this is the common type of the arguments. */
9495 tree result_type
= NULL
;
9497 /* When the computation is in excess precision, the type of the
9498 final EXCESS_PRECISION_EXPR. */
9499 tree semantic_result_type
= NULL
;
9501 /* Nonzero means operands have already been type-converted
9502 in whatever way is necessary.
9503 Zero means they need to be converted to RESULT_TYPE. */
9506 /* Nonzero means create the expression with this type, rather than
9508 tree build_type
= 0;
9510 /* Nonzero means after finally constructing the expression
9511 convert it to this type. */
9512 tree final_type
= 0;
9514 /* Nonzero if this is an operation like MIN or MAX which can
9515 safely be computed in short if both args are promoted shorts.
9516 Also implies COMMON.
9517 -1 indicates a bitwise operation; this makes a difference
9518 in the exact conditions for when it is safe to do the operation
9519 in a narrower mode. */
9522 /* Nonzero if this is a comparison operation;
9523 if both args are promoted shorts, compare the original shorts.
9524 Also implies COMMON. */
9525 int short_compare
= 0;
9527 /* Nonzero if this is a right-shift operation, which can be computed on the
9528 original short and then promoted if the operand is a promoted short. */
9529 int short_shift
= 0;
9531 /* Nonzero means set RESULT_TYPE to the common type of the args. */
9534 /* True means types are compatible as far as ObjC is concerned. */
9537 /* True means this is an arithmetic operation that may need excess
9539 bool may_need_excess_precision
;
9541 /* True means this is a boolean operation that converts both its
9542 operands to truth-values. */
9543 bool boolean_op
= false;
9545 if (location
== UNKNOWN_LOCATION
)
9546 location
= input_location
;
9551 op0_int_operands
= EXPR_INT_CONST_OPERANDS (orig_op0
);
9552 if (op0_int_operands
)
9553 op0
= remove_c_maybe_const_expr (op0
);
9554 op1_int_operands
= EXPR_INT_CONST_OPERANDS (orig_op1
);
9555 if (op1_int_operands
)
9556 op1
= remove_c_maybe_const_expr (op1
);
9557 int_operands
= (op0_int_operands
&& op1_int_operands
);
9560 int_const_or_overflow
= (TREE_CODE (orig_op0
) == INTEGER_CST
9561 && TREE_CODE (orig_op1
) == INTEGER_CST
);
9562 int_const
= (int_const_or_overflow
9563 && !TREE_OVERFLOW (orig_op0
)
9564 && !TREE_OVERFLOW (orig_op1
));
9567 int_const
= int_const_or_overflow
= false;
9569 /* Do not apply default conversion in mixed vector/scalar expression. */
9571 && !((TREE_CODE (TREE_TYPE (op0
)) == VECTOR_TYPE
)
9572 != (TREE_CODE (TREE_TYPE (op1
)) == VECTOR_TYPE
)))
9574 op0
= default_conversion (op0
);
9575 op1
= default_conversion (op1
);
9578 /* When Cilk Plus is enabled and there are array notations inside op0, then
9579 we check to see if there are builtin array notation functions. If
9580 so, then we take on the type of the array notation inside it. */
9581 if (flag_enable_cilkplus
&& contains_array_notation_expr (op0
))
9582 orig_type0
= type0
= find_correct_array_notation_type (op0
);
9584 orig_type0
= type0
= TREE_TYPE (op0
);
9586 if (flag_enable_cilkplus
&& contains_array_notation_expr (op1
))
9587 orig_type1
= type1
= find_correct_array_notation_type (op1
);
9589 orig_type1
= type1
= TREE_TYPE (op1
);
9591 /* The expression codes of the data types of the arguments tell us
9592 whether the arguments are integers, floating, pointers, etc. */
9593 code0
= TREE_CODE (type0
);
9594 code1
= TREE_CODE (type1
);
9596 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
9597 STRIP_TYPE_NOPS (op0
);
9598 STRIP_TYPE_NOPS (op1
);
9600 /* If an error was already reported for one of the arguments,
9601 avoid reporting another error. */
9603 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
9604 return error_mark_node
;
9606 if ((invalid_op_diag
9607 = targetm
.invalid_binary_op (code
, type0
, type1
)))
9609 error_at (location
, invalid_op_diag
);
9610 return error_mark_node
;
9618 case TRUNC_DIV_EXPR
:
9620 case FLOOR_DIV_EXPR
:
9621 case ROUND_DIV_EXPR
:
9622 case EXACT_DIV_EXPR
:
9623 may_need_excess_precision
= true;
9626 may_need_excess_precision
= false;
9629 if (TREE_CODE (op0
) == EXCESS_PRECISION_EXPR
)
9631 op0
= TREE_OPERAND (op0
, 0);
9632 type0
= TREE_TYPE (op0
);
9634 else if (may_need_excess_precision
9635 && (eptype
= excess_precision_type (type0
)) != NULL_TREE
)
9638 op0
= convert (eptype
, op0
);
9640 if (TREE_CODE (op1
) == EXCESS_PRECISION_EXPR
)
9642 op1
= TREE_OPERAND (op1
, 0);
9643 type1
= TREE_TYPE (op1
);
9645 else if (may_need_excess_precision
9646 && (eptype
= excess_precision_type (type1
)) != NULL_TREE
)
9649 op1
= convert (eptype
, op1
);
9652 objc_ok
= objc_compare_types (type0
, type1
, -3, NULL_TREE
);
9654 /* In case when one of the operands of the binary operation is
9655 a vector and another is a scalar -- convert scalar to vector. */
9656 if ((code0
== VECTOR_TYPE
) != (code1
== VECTOR_TYPE
))
9658 enum stv_conv convert_flag
= scalar_to_vector (location
, code
, op0
, op1
,
9661 switch (convert_flag
)
9664 return error_mark_node
;
9667 bool maybe_const
= true;
9669 sc
= c_fully_fold (op0
, false, &maybe_const
);
9670 sc
= save_expr (sc
);
9671 sc
= convert (TREE_TYPE (type1
), sc
);
9672 op0
= build_vector_from_val (type1
, sc
);
9674 op0
= c_wrap_maybe_const (op0
, true);
9675 orig_type0
= type0
= TREE_TYPE (op0
);
9676 code0
= TREE_CODE (type0
);
9682 bool maybe_const
= true;
9684 sc
= c_fully_fold (op1
, false, &maybe_const
);
9685 sc
= save_expr (sc
);
9686 sc
= convert (TREE_TYPE (type0
), sc
);
9687 op1
= build_vector_from_val (type0
, sc
);
9689 op1
= c_wrap_maybe_const (op1
, true);
9690 orig_type1
= type1
= TREE_TYPE (op1
);
9691 code1
= TREE_CODE (type1
);
9703 /* Handle the pointer + int case. */
9704 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
9706 ret
= pointer_int_sum (location
, PLUS_EXPR
, op0
, op1
);
9707 goto return_build_binary_op
;
9709 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
9711 ret
= pointer_int_sum (location
, PLUS_EXPR
, op1
, op0
);
9712 goto return_build_binary_op
;
9719 /* Subtraction of two similar pointers.
9720 We must subtract them as integers, then divide by object size. */
9721 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
9722 && comp_target_types (location
, type0
, type1
))
9724 ret
= pointer_diff (location
, op0
, op1
);
9725 goto return_build_binary_op
;
9727 /* Handle pointer minus int. Just like pointer plus int. */
9728 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
9730 ret
= pointer_int_sum (location
, MINUS_EXPR
, op0
, op1
);
9731 goto return_build_binary_op
;
9741 case TRUNC_DIV_EXPR
:
9743 case FLOOR_DIV_EXPR
:
9744 case ROUND_DIV_EXPR
:
9745 case EXACT_DIV_EXPR
:
9746 warn_for_div_by_zero (location
, op1
);
9748 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
9749 || code0
== FIXED_POINT_TYPE
9750 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
9751 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
9752 || code1
== FIXED_POINT_TYPE
9753 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
9755 enum tree_code tcode0
= code0
, tcode1
= code1
;
9757 if (code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
9758 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
9759 if (code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
)
9760 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
9762 if (!((tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
)
9763 || (tcode0
== FIXED_POINT_TYPE
&& tcode1
== FIXED_POINT_TYPE
)))
9764 resultcode
= RDIV_EXPR
;
9766 /* Although it would be tempting to shorten always here, that
9767 loses on some targets, since the modulo instruction is
9768 undefined if the quotient can't be represented in the
9769 computation mode. We shorten only if unsigned or if
9770 dividing by something we know != -1. */
9771 shorten
= (TYPE_UNSIGNED (TREE_TYPE (orig_op0
))
9772 || (TREE_CODE (op1
) == INTEGER_CST
9773 && !integer_all_onesp (op1
)));
9781 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
9783 /* Allow vector types which are not floating point types. */
9784 else if (code0
== VECTOR_TYPE
9785 && code1
== VECTOR_TYPE
9786 && !VECTOR_FLOAT_TYPE_P (type0
)
9787 && !VECTOR_FLOAT_TYPE_P (type1
))
9791 case TRUNC_MOD_EXPR
:
9792 case FLOOR_MOD_EXPR
:
9793 warn_for_div_by_zero (location
, op1
);
9795 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
9796 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
9797 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
)
9799 else if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
9801 /* Although it would be tempting to shorten always here, that loses
9802 on some targets, since the modulo instruction is undefined if the
9803 quotient can't be represented in the computation mode. We shorten
9804 only if unsigned or if dividing by something we know != -1. */
9805 shorten
= (TYPE_UNSIGNED (TREE_TYPE (orig_op0
))
9806 || (TREE_CODE (op1
) == INTEGER_CST
9807 && !integer_all_onesp (op1
)));
9812 case TRUTH_ANDIF_EXPR
:
9813 case TRUTH_ORIF_EXPR
:
9814 case TRUTH_AND_EXPR
:
9816 case TRUTH_XOR_EXPR
:
9817 if ((code0
== INTEGER_TYPE
|| code0
== POINTER_TYPE
9818 || code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
9819 || code0
== FIXED_POINT_TYPE
)
9820 && (code1
== INTEGER_TYPE
|| code1
== POINTER_TYPE
9821 || code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
9822 || code1
== FIXED_POINT_TYPE
))
9824 /* Result of these operations is always an int,
9825 but that does not mean the operands should be
9826 converted to ints! */
9827 result_type
= integer_type_node
;
9828 if (op0_int_operands
)
9830 op0
= c_objc_common_truthvalue_conversion (location
, orig_op0
);
9831 op0
= remove_c_maybe_const_expr (op0
);
9834 op0
= c_objc_common_truthvalue_conversion (location
, op0
);
9835 if (op1_int_operands
)
9837 op1
= c_objc_common_truthvalue_conversion (location
, orig_op1
);
9838 op1
= remove_c_maybe_const_expr (op1
);
9841 op1
= c_objc_common_truthvalue_conversion (location
, op1
);
9845 if (code
== TRUTH_ANDIF_EXPR
)
9847 int_const_or_overflow
= (int_operands
9848 && TREE_CODE (orig_op0
) == INTEGER_CST
9849 && (op0
== truthvalue_false_node
9850 || TREE_CODE (orig_op1
) == INTEGER_CST
));
9851 int_const
= (int_const_or_overflow
9852 && !TREE_OVERFLOW (orig_op0
)
9853 && (op0
== truthvalue_false_node
9854 || !TREE_OVERFLOW (orig_op1
)));
9856 else if (code
== TRUTH_ORIF_EXPR
)
9858 int_const_or_overflow
= (int_operands
9859 && TREE_CODE (orig_op0
) == INTEGER_CST
9860 && (op0
== truthvalue_true_node
9861 || TREE_CODE (orig_op1
) == INTEGER_CST
));
9862 int_const
= (int_const_or_overflow
9863 && !TREE_OVERFLOW (orig_op0
)
9864 && (op0
== truthvalue_true_node
9865 || !TREE_OVERFLOW (orig_op1
)));
9869 /* Shift operations: result has same type as first operand;
9870 always convert second operand to int.
9871 Also set SHORT_SHIFT if shifting rightward. */
9874 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
9875 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
9877 result_type
= type0
;
9880 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
9881 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
9882 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
9883 && TYPE_VECTOR_SUBPARTS (type0
) == TYPE_VECTOR_SUBPARTS (type1
))
9885 result_type
= type0
;
9888 else if ((code0
== INTEGER_TYPE
|| code0
== FIXED_POINT_TYPE
)
9889 && code1
== INTEGER_TYPE
)
9891 if (TREE_CODE (op1
) == INTEGER_CST
)
9893 if (tree_int_cst_sgn (op1
) < 0)
9896 if (c_inhibit_evaluation_warnings
== 0)
9897 warning (0, "right shift count is negative");
9901 if (!integer_zerop (op1
))
9904 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
9907 if (c_inhibit_evaluation_warnings
== 0)
9908 warning (0, "right shift count >= width of type");
9913 /* Use the type of the value to be shifted. */
9914 result_type
= type0
;
9915 /* Convert the non vector shift-count to an integer, regardless
9916 of size of value being shifted. */
9917 if (TREE_CODE (TREE_TYPE (op1
)) != VECTOR_TYPE
9918 && TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
9919 op1
= convert (integer_type_node
, op1
);
9920 /* Avoid converting op1 to result_type later. */
9926 if (code0
== VECTOR_TYPE
&& code1
== INTEGER_TYPE
9927 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
)
9929 result_type
= type0
;
9932 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
9933 && TREE_CODE (TREE_TYPE (type0
)) == INTEGER_TYPE
9934 && TREE_CODE (TREE_TYPE (type1
)) == INTEGER_TYPE
9935 && TYPE_VECTOR_SUBPARTS (type0
) == TYPE_VECTOR_SUBPARTS (type1
))
9937 result_type
= type0
;
9940 else if ((code0
== INTEGER_TYPE
|| code0
== FIXED_POINT_TYPE
)
9941 && code1
== INTEGER_TYPE
)
9943 if (TREE_CODE (op1
) == INTEGER_CST
)
9945 if (tree_int_cst_sgn (op1
) < 0)
9948 if (c_inhibit_evaluation_warnings
== 0)
9949 warning (0, "left shift count is negative");
9952 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
9955 if (c_inhibit_evaluation_warnings
== 0)
9956 warning (0, "left shift count >= width of type");
9960 /* Use the type of the value to be shifted. */
9961 result_type
= type0
;
9962 /* Convert the non vector shift-count to an integer, regardless
9963 of size of value being shifted. */
9964 if (TREE_CODE (TREE_TYPE (op1
)) != VECTOR_TYPE
9965 && TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
9966 op1
= convert (integer_type_node
, op1
);
9967 /* Avoid converting op1 to result_type later. */
9974 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
9977 if (TREE_TYPE (type0
) != TREE_TYPE (type1
))
9979 error_at (location
, "comparing vectors with different "
9981 return error_mark_node
;
9984 if (TYPE_VECTOR_SUBPARTS (type0
) != TYPE_VECTOR_SUBPARTS (type1
))
9986 error_at (location
, "comparing vectors with different "
9987 "number of elements");
9988 return error_mark_node
;
9991 /* Always construct signed integer vector type. */
9992 intt
= c_common_type_for_size (GET_MODE_BITSIZE
9993 (TYPE_MODE (TREE_TYPE (type0
))), 0);
9994 result_type
= build_opaque_vector_type (intt
,
9995 TYPE_VECTOR_SUBPARTS (type0
));
9999 if (FLOAT_TYPE_P (type0
) || FLOAT_TYPE_P (type1
))
10000 warning_at (location
,
10002 "comparing floating point with == or != is unsafe");
10003 /* Result of comparison is always int,
10004 but don't convert the args to int! */
10005 build_type
= integer_type_node
;
10006 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
10007 || code0
== FIXED_POINT_TYPE
|| code0
== COMPLEX_TYPE
)
10008 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
10009 || code1
== FIXED_POINT_TYPE
|| code1
== COMPLEX_TYPE
))
10011 else if (code0
== POINTER_TYPE
&& null_pointer_constant_p (orig_op1
))
10013 if (TREE_CODE (op0
) == ADDR_EXPR
10014 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
10016 if (code
== EQ_EXPR
)
10017 warning_at (location
,
10019 "the comparison will always evaluate as %<false%> "
10020 "for the address of %qD will never be NULL",
10021 TREE_OPERAND (op0
, 0));
10023 warning_at (location
,
10025 "the comparison will always evaluate as %<true%> "
10026 "for the address of %qD will never be NULL",
10027 TREE_OPERAND (op0
, 0));
10029 result_type
= type0
;
10031 else if (code1
== POINTER_TYPE
&& null_pointer_constant_p (orig_op0
))
10033 if (TREE_CODE (op1
) == ADDR_EXPR
10034 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
10036 if (code
== EQ_EXPR
)
10037 warning_at (location
,
10039 "the comparison will always evaluate as %<false%> "
10040 "for the address of %qD will never be NULL",
10041 TREE_OPERAND (op1
, 0));
10043 warning_at (location
,
10045 "the comparison will always evaluate as %<true%> "
10046 "for the address of %qD will never be NULL",
10047 TREE_OPERAND (op1
, 0));
10049 result_type
= type1
;
10051 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
10053 tree tt0
= TREE_TYPE (type0
);
10054 tree tt1
= TREE_TYPE (type1
);
10055 addr_space_t as0
= TYPE_ADDR_SPACE (tt0
);
10056 addr_space_t as1
= TYPE_ADDR_SPACE (tt1
);
10057 addr_space_t as_common
= ADDR_SPACE_GENERIC
;
10059 /* Anything compares with void *. void * compares with anything.
10060 Otherwise, the targets must be compatible
10061 and both must be object or both incomplete. */
10062 if (comp_target_types (location
, type0
, type1
))
10063 result_type
= common_pointer_type (type0
, type1
);
10064 else if (!addr_space_superset (as0
, as1
, &as_common
))
10066 error_at (location
, "comparison of pointers to "
10067 "disjoint address spaces");
10068 return error_mark_node
;
10070 else if (VOID_TYPE_P (tt0
))
10072 if (pedantic
&& TREE_CODE (tt1
) == FUNCTION_TYPE
)
10073 pedwarn (location
, OPT_Wpedantic
, "ISO C forbids "
10074 "comparison of %<void *%> with function pointer");
10076 else if (VOID_TYPE_P (tt1
))
10078 if (pedantic
&& TREE_CODE (tt0
) == FUNCTION_TYPE
)
10079 pedwarn (location
, OPT_Wpedantic
, "ISO C forbids "
10080 "comparison of %<void *%> with function pointer");
10083 /* Avoid warning about the volatile ObjC EH puts on decls. */
10085 pedwarn (location
, 0,
10086 "comparison of distinct pointer types lacks a cast");
10088 if (result_type
== NULL_TREE
)
10090 int qual
= ENCODE_QUAL_ADDR_SPACE (as_common
);
10091 result_type
= build_pointer_type
10092 (build_qualified_type (void_type_node
, qual
));
10095 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
10097 result_type
= type0
;
10098 pedwarn (location
, 0, "comparison between pointer and integer");
10100 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
10102 result_type
= type1
;
10103 pedwarn (location
, 0, "comparison between pointer and integer");
10111 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
10114 if (TREE_TYPE (type0
) != TREE_TYPE (type1
))
10116 error_at (location
, "comparing vectors with different "
10118 return error_mark_node
;
10121 if (TYPE_VECTOR_SUBPARTS (type0
) != TYPE_VECTOR_SUBPARTS (type1
))
10123 error_at (location
, "comparing vectors with different "
10124 "number of elements");
10125 return error_mark_node
;
10128 /* Always construct signed integer vector type. */
10129 intt
= c_common_type_for_size (GET_MODE_BITSIZE
10130 (TYPE_MODE (TREE_TYPE (type0
))), 0);
10131 result_type
= build_opaque_vector_type (intt
,
10132 TYPE_VECTOR_SUBPARTS (type0
));
10136 build_type
= integer_type_node
;
10137 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
10138 || code0
== FIXED_POINT_TYPE
)
10139 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
10140 || code1
== FIXED_POINT_TYPE
))
10142 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
10144 addr_space_t as0
= TYPE_ADDR_SPACE (TREE_TYPE (type0
));
10145 addr_space_t as1
= TYPE_ADDR_SPACE (TREE_TYPE (type1
));
10146 addr_space_t as_common
;
10148 if (comp_target_types (location
, type0
, type1
))
10150 result_type
= common_pointer_type (type0
, type1
);
10151 if (!COMPLETE_TYPE_P (TREE_TYPE (type0
))
10152 != !COMPLETE_TYPE_P (TREE_TYPE (type1
)))
10153 pedwarn (location
, 0,
10154 "comparison of complete and incomplete pointers");
10155 else if (TREE_CODE (TREE_TYPE (type0
)) == FUNCTION_TYPE
)
10156 pedwarn (location
, OPT_Wpedantic
, "ISO C forbids "
10157 "ordered comparisons of pointers to functions");
10158 else if (null_pointer_constant_p (orig_op0
)
10159 || null_pointer_constant_p (orig_op1
))
10160 warning_at (location
, OPT_Wextra
,
10161 "ordered comparison of pointer with null pointer");
10164 else if (!addr_space_superset (as0
, as1
, &as_common
))
10166 error_at (location
, "comparison of pointers to "
10167 "disjoint address spaces");
10168 return error_mark_node
;
10172 int qual
= ENCODE_QUAL_ADDR_SPACE (as_common
);
10173 result_type
= build_pointer_type
10174 (build_qualified_type (void_type_node
, qual
));
10175 pedwarn (location
, 0,
10176 "comparison of distinct pointer types lacks a cast");
10179 else if (code0
== POINTER_TYPE
&& null_pointer_constant_p (orig_op1
))
10181 result_type
= type0
;
10183 pedwarn (location
, OPT_Wpedantic
,
10184 "ordered comparison of pointer with integer zero");
10185 else if (extra_warnings
)
10186 warning_at (location
, OPT_Wextra
,
10187 "ordered comparison of pointer with integer zero");
10189 else if (code1
== POINTER_TYPE
&& null_pointer_constant_p (orig_op0
))
10191 result_type
= type1
;
10193 pedwarn (location
, OPT_Wpedantic
,
10194 "ordered comparison of pointer with integer zero");
10195 else if (extra_warnings
)
10196 warning_at (location
, OPT_Wextra
,
10197 "ordered comparison of pointer with integer zero");
10199 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
10201 result_type
= type0
;
10202 pedwarn (location
, 0, "comparison between pointer and integer");
10204 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
10206 result_type
= type1
;
10207 pedwarn (location
, 0, "comparison between pointer and integer");
10212 gcc_unreachable ();
10215 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
10216 return error_mark_node
;
10218 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
10219 && (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
10220 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
10221 TREE_TYPE (type1
))))
10223 binary_op_error (location
, code
, type0
, type1
);
10224 return error_mark_node
;
10227 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
10228 || code0
== FIXED_POINT_TYPE
|| code0
== VECTOR_TYPE
)
10230 (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
10231 || code1
== FIXED_POINT_TYPE
|| code1
== VECTOR_TYPE
))
10233 bool first_complex
= (code0
== COMPLEX_TYPE
);
10234 bool second_complex
= (code1
== COMPLEX_TYPE
);
10235 int none_complex
= (!first_complex
&& !second_complex
);
10237 if (shorten
|| common
|| short_compare
)
10239 result_type
= c_common_type (type0
, type1
);
10240 do_warn_double_promotion (result_type
, type0
, type1
,
10241 "implicit conversion from %qT to %qT "
10242 "to match other operand of binary "
10245 if (result_type
== error_mark_node
)
10246 return error_mark_node
;
10249 if (first_complex
!= second_complex
10250 && (code
== PLUS_EXPR
10251 || code
== MINUS_EXPR
10252 || code
== MULT_EXPR
10253 || (code
== TRUNC_DIV_EXPR
&& first_complex
))
10254 && TREE_CODE (TREE_TYPE (result_type
)) == REAL_TYPE
10255 && flag_signed_zeros
)
10257 /* An operation on mixed real/complex operands must be
10258 handled specially, but the language-independent code can
10259 more easily optimize the plain complex arithmetic if
10260 -fno-signed-zeros. */
10261 tree real_type
= TREE_TYPE (result_type
);
10263 if (type0
!= orig_type0
|| type1
!= orig_type1
)
10265 gcc_assert (may_need_excess_precision
&& common
);
10266 semantic_result_type
= c_common_type (orig_type0
, orig_type1
);
10270 if (TREE_TYPE (op0
) != result_type
)
10271 op0
= convert_and_check (result_type
, op0
);
10272 if (TREE_TYPE (op1
) != real_type
)
10273 op1
= convert_and_check (real_type
, op1
);
10277 if (TREE_TYPE (op0
) != real_type
)
10278 op0
= convert_and_check (real_type
, op0
);
10279 if (TREE_TYPE (op1
) != result_type
)
10280 op1
= convert_and_check (result_type
, op1
);
10282 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
10283 return error_mark_node
;
10286 op0
= c_save_expr (op0
);
10287 real
= build_unary_op (EXPR_LOCATION (orig_op0
), REALPART_EXPR
,
10289 imag
= build_unary_op (EXPR_LOCATION (orig_op0
), IMAGPART_EXPR
,
10294 case TRUNC_DIV_EXPR
:
10295 op1
= c_save_expr (op1
);
10296 imag
= build2 (resultcode
, real_type
, imag
, op1
);
10297 /* Fall through. */
10300 real
= build2 (resultcode
, real_type
, real
, op1
);
10308 op1
= c_save_expr (op1
);
10309 real
= build_unary_op (EXPR_LOCATION (orig_op1
), REALPART_EXPR
,
10311 imag
= build_unary_op (EXPR_LOCATION (orig_op1
), IMAGPART_EXPR
,
10316 op0
= c_save_expr (op0
);
10317 imag
= build2 (resultcode
, real_type
, op0
, imag
);
10318 /* Fall through. */
10320 real
= build2 (resultcode
, real_type
, op0
, real
);
10323 real
= build2 (resultcode
, real_type
, op0
, real
);
10324 imag
= build1 (NEGATE_EXPR
, real_type
, imag
);
10330 ret
= build2 (COMPLEX_EXPR
, result_type
, real
, imag
);
10331 goto return_build_binary_op
;
10334 /* For certain operations (which identify themselves by shorten != 0)
10335 if both args were extended from the same smaller type,
10336 do the arithmetic in that type and then extend.
10338 shorten !=0 and !=1 indicates a bitwise operation.
10339 For them, this optimization is safe only if
10340 both args are zero-extended or both are sign-extended.
10341 Otherwise, we might change the result.
10342 Eg, (short)-1 | (unsigned short)-1 is (int)-1
10343 but calculated in (unsigned short) it would be (unsigned short)-1. */
10345 if (shorten
&& none_complex
)
10347 final_type
= result_type
;
10348 result_type
= shorten_binary_op (result_type
, op0
, op1
,
10352 /* Shifts can be shortened if shifting right. */
10357 tree arg0
= get_narrower (op0
, &unsigned_arg
);
10359 final_type
= result_type
;
10361 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
10362 unsigned_arg
= TYPE_UNSIGNED (TREE_TYPE (op0
));
10364 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
10365 && tree_int_cst_sgn (op1
) > 0
10366 /* We can shorten only if the shift count is less than the
10367 number of bits in the smaller type size. */
10368 && compare_tree_int (op1
, TYPE_PRECISION (TREE_TYPE (arg0
))) < 0
10369 /* We cannot drop an unsigned shift after sign-extension. */
10370 && (!TYPE_UNSIGNED (final_type
) || unsigned_arg
))
10372 /* Do an unsigned shift if the operand was zero-extended. */
10374 = c_common_signed_or_unsigned_type (unsigned_arg
,
10376 /* Convert value-to-be-shifted to that type. */
10377 if (TREE_TYPE (op0
) != result_type
)
10378 op0
= convert (result_type
, op0
);
10383 /* Comparison operations are shortened too but differently.
10384 They identify themselves by setting short_compare = 1. */
10388 /* Don't write &op0, etc., because that would prevent op0
10389 from being kept in a register.
10390 Instead, make copies of the our local variables and
10391 pass the copies by reference, then copy them back afterward. */
10392 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
10393 enum tree_code xresultcode
= resultcode
;
10395 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
10400 goto return_build_binary_op
;
10403 op0
= xop0
, op1
= xop1
;
10405 resultcode
= xresultcode
;
10407 if (c_inhibit_evaluation_warnings
== 0)
10409 bool op0_maybe_const
= true;
10410 bool op1_maybe_const
= true;
10411 tree orig_op0_folded
, orig_op1_folded
;
10413 if (in_late_binary_op
)
10415 orig_op0_folded
= orig_op0
;
10416 orig_op1_folded
= orig_op1
;
10420 /* Fold for the sake of possible warnings, as in
10421 build_conditional_expr. This requires the
10422 "original" values to be folded, not just op0 and
10424 c_inhibit_evaluation_warnings
++;
10425 op0
= c_fully_fold (op0
, require_constant_value
,
10427 op1
= c_fully_fold (op1
, require_constant_value
,
10429 c_inhibit_evaluation_warnings
--;
10430 orig_op0_folded
= c_fully_fold (orig_op0
,
10431 require_constant_value
,
10433 orig_op1_folded
= c_fully_fold (orig_op1
,
10434 require_constant_value
,
10438 if (warn_sign_compare
)
10439 warn_for_sign_compare (location
, orig_op0_folded
,
10440 orig_op1_folded
, op0
, op1
,
10441 result_type
, resultcode
);
10442 if (!in_late_binary_op
&& !int_operands
)
10444 if (!op0_maybe_const
|| TREE_CODE (op0
) != INTEGER_CST
)
10445 op0
= c_wrap_maybe_const (op0
, !op0_maybe_const
);
10446 if (!op1_maybe_const
|| TREE_CODE (op1
) != INTEGER_CST
)
10447 op1
= c_wrap_maybe_const (op1
, !op1_maybe_const
);
10453 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
10454 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
10455 Then the expression will be built.
10456 It will be given type FINAL_TYPE if that is nonzero;
10457 otherwise, it will be given type RESULT_TYPE. */
10461 binary_op_error (location
, code
, TREE_TYPE (op0
), TREE_TYPE (op1
));
10462 return error_mark_node
;
10465 if (build_type
== NULL_TREE
)
10467 build_type
= result_type
;
10468 if ((type0
!= orig_type0
|| type1
!= orig_type1
)
10471 gcc_assert (may_need_excess_precision
&& common
);
10472 semantic_result_type
= c_common_type (orig_type0
, orig_type1
);
10478 op0
= ep_convert_and_check (result_type
, op0
, semantic_result_type
);
10479 op1
= ep_convert_and_check (result_type
, op1
, semantic_result_type
);
10481 /* This can happen if one operand has a vector type, and the other
10482 has a different type. */
10483 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
10484 return error_mark_node
;
10487 /* Treat expressions in initializers specially as they can't trap. */
10488 if (int_const_or_overflow
)
10489 ret
= (require_constant_value
10490 ? fold_build2_initializer_loc (location
, resultcode
, build_type
,
10492 : fold_build2_loc (location
, resultcode
, build_type
, op0
, op1
));
10494 ret
= build2 (resultcode
, build_type
, op0
, op1
);
10495 if (final_type
!= 0)
10496 ret
= convert (final_type
, ret
);
10498 return_build_binary_op
:
10499 gcc_assert (ret
!= error_mark_node
);
10500 if (TREE_CODE (ret
) == INTEGER_CST
&& !TREE_OVERFLOW (ret
) && !int_const
)
10501 ret
= (int_operands
10502 ? note_integer_operands (ret
)
10503 : build1 (NOP_EXPR
, TREE_TYPE (ret
), ret
));
10504 else if (TREE_CODE (ret
) != INTEGER_CST
&& int_operands
10505 && !in_late_binary_op
)
10506 ret
= note_integer_operands (ret
);
10507 if (semantic_result_type
)
10508 ret
= build1 (EXCESS_PRECISION_EXPR
, semantic_result_type
, ret
);
10509 protected_set_expr_location (ret
, location
);
10514 /* Convert EXPR to be a truth-value, validating its type for this
10515 purpose. LOCATION is the source location for the expression. */
10518 c_objc_common_truthvalue_conversion (location_t location
, tree expr
)
10520 bool int_const
, int_operands
;
10522 switch (TREE_CODE (TREE_TYPE (expr
)))
10525 error_at (location
, "used array that cannot be converted to pointer where scalar is required");
10526 return error_mark_node
;
10529 error_at (location
, "used struct type value where scalar is required");
10530 return error_mark_node
;
10533 error_at (location
, "used union type value where scalar is required");
10534 return error_mark_node
;
10537 error_at (location
, "void value not ignored as it ought to be");
10538 return error_mark_node
;
10540 case FUNCTION_TYPE
:
10541 gcc_unreachable ();
10544 error_at (location
, "used vector type where scalar is required");
10545 return error_mark_node
;
10551 int_const
= (TREE_CODE (expr
) == INTEGER_CST
&& !TREE_OVERFLOW (expr
));
10552 int_operands
= EXPR_INT_CONST_OPERANDS (expr
);
10553 if (int_operands
&& TREE_CODE (expr
) != INTEGER_CST
)
10555 expr
= remove_c_maybe_const_expr (expr
);
10556 expr
= build2 (NE_EXPR
, integer_type_node
, expr
,
10557 convert (TREE_TYPE (expr
), integer_zero_node
));
10558 expr
= note_integer_operands (expr
);
10561 /* ??? Should we also give an error for vectors rather than leaving
10562 those to give errors later? */
10563 expr
= c_common_truthvalue_conversion (location
, expr
);
10565 if (TREE_CODE (expr
) == INTEGER_CST
&& int_operands
&& !int_const
)
10567 if (TREE_OVERFLOW (expr
))
10570 return note_integer_operands (expr
);
10572 if (TREE_CODE (expr
) == INTEGER_CST
&& !int_const
)
10573 return build1 (NOP_EXPR
, TREE_TYPE (expr
), expr
);
10578 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
10582 c_expr_to_decl (tree expr
, bool *tc ATTRIBUTE_UNUSED
, bool *se
)
10584 if (TREE_CODE (expr
) == COMPOUND_LITERAL_EXPR
)
10586 tree decl
= COMPOUND_LITERAL_EXPR_DECL (expr
);
10587 /* Executing a compound literal inside a function reinitializes
10589 if (!TREE_STATIC (decl
))
10597 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
10600 c_begin_omp_parallel (void)
10604 keep_next_level ();
10605 block
= c_begin_compound_stmt (true);
10610 /* Generate OMP_PARALLEL, with CLAUSES and BLOCK as its compound
10611 statement. LOC is the location of the OMP_PARALLEL. */
10614 c_finish_omp_parallel (location_t loc
, tree clauses
, tree block
)
10618 block
= c_end_compound_stmt (loc
, block
, true);
10620 stmt
= make_node (OMP_PARALLEL
);
10621 TREE_TYPE (stmt
) = void_type_node
;
10622 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
10623 OMP_PARALLEL_BODY (stmt
) = block
;
10624 SET_EXPR_LOCATION (stmt
, loc
);
10626 return add_stmt (stmt
);
10629 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
10632 c_begin_omp_task (void)
10636 keep_next_level ();
10637 block
= c_begin_compound_stmt (true);
10642 /* Generate OMP_TASK, with CLAUSES and BLOCK as its compound
10643 statement. LOC is the location of the #pragma. */
10646 c_finish_omp_task (location_t loc
, tree clauses
, tree block
)
10650 block
= c_end_compound_stmt (loc
, block
, true);
10652 stmt
= make_node (OMP_TASK
);
10653 TREE_TYPE (stmt
) = void_type_node
;
10654 OMP_TASK_CLAUSES (stmt
) = clauses
;
10655 OMP_TASK_BODY (stmt
) = block
;
10656 SET_EXPR_LOCATION (stmt
, loc
);
10658 return add_stmt (stmt
);
10661 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
10662 Remove any elements from the list that are invalid. */
10665 c_finish_omp_clauses (tree clauses
)
10667 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
10668 tree c
, t
, *pc
= &clauses
;
10671 bitmap_obstack_initialize (NULL
);
10672 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
10673 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
10674 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
10676 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
10678 bool remove
= false;
10679 bool need_complete
= false;
10680 bool need_implicitly_determined
= false;
10682 switch (OMP_CLAUSE_CODE (c
))
10684 case OMP_CLAUSE_SHARED
:
10686 need_implicitly_determined
= true;
10687 goto check_dup_generic
;
10689 case OMP_CLAUSE_PRIVATE
:
10691 need_complete
= true;
10692 need_implicitly_determined
= true;
10693 goto check_dup_generic
;
10695 case OMP_CLAUSE_REDUCTION
:
10696 name
= "reduction";
10697 need_implicitly_determined
= true;
10698 t
= OMP_CLAUSE_DECL (c
);
10699 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
10700 || POINTER_TYPE_P (TREE_TYPE (t
)))
10702 error_at (OMP_CLAUSE_LOCATION (c
),
10703 "%qE has invalid type for %<reduction%>", t
);
10706 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
10708 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
10709 const char *r_name
= NULL
;
10728 case TRUTH_ANDIF_EXPR
:
10731 case TRUTH_ORIF_EXPR
:
10735 gcc_unreachable ();
10739 error_at (OMP_CLAUSE_LOCATION (c
),
10740 "%qE has invalid type for %<reduction(%s)%>",
10745 goto check_dup_generic
;
10747 case OMP_CLAUSE_COPYPRIVATE
:
10748 name
= "copyprivate";
10749 goto check_dup_generic
;
10751 case OMP_CLAUSE_COPYIN
:
10753 t
= OMP_CLAUSE_DECL (c
);
10754 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
10756 error_at (OMP_CLAUSE_LOCATION (c
),
10757 "%qE must be %<threadprivate%> for %<copyin%>", t
);
10760 goto check_dup_generic
;
10763 t
= OMP_CLAUSE_DECL (c
);
10764 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
10766 error_at (OMP_CLAUSE_LOCATION (c
),
10767 "%qE is not a variable in clause %qs", t
, name
);
10770 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
10771 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
10772 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
10774 error_at (OMP_CLAUSE_LOCATION (c
),
10775 "%qE appears more than once in data clauses", t
);
10779 bitmap_set_bit (&generic_head
, DECL_UID (t
));
10782 case OMP_CLAUSE_FIRSTPRIVATE
:
10783 name
= "firstprivate";
10784 t
= OMP_CLAUSE_DECL (c
);
10785 need_complete
= true;
10786 need_implicitly_determined
= true;
10787 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
10789 error_at (OMP_CLAUSE_LOCATION (c
),
10790 "%qE is not a variable in clause %<firstprivate%>", t
);
10793 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
10794 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
10796 error_at (OMP_CLAUSE_LOCATION (c
),
10797 "%qE appears more than once in data clauses", t
);
10801 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
10804 case OMP_CLAUSE_LASTPRIVATE
:
10805 name
= "lastprivate";
10806 t
= OMP_CLAUSE_DECL (c
);
10807 need_complete
= true;
10808 need_implicitly_determined
= true;
10809 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
10811 error_at (OMP_CLAUSE_LOCATION (c
),
10812 "%qE is not a variable in clause %<lastprivate%>", t
);
10815 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
10816 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
10818 error_at (OMP_CLAUSE_LOCATION (c
),
10819 "%qE appears more than once in data clauses", t
);
10823 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
10826 case OMP_CLAUSE_IF
:
10827 case OMP_CLAUSE_NUM_THREADS
:
10828 case OMP_CLAUSE_SCHEDULE
:
10829 case OMP_CLAUSE_NOWAIT
:
10830 case OMP_CLAUSE_ORDERED
:
10831 case OMP_CLAUSE_DEFAULT
:
10832 case OMP_CLAUSE_UNTIED
:
10833 case OMP_CLAUSE_COLLAPSE
:
10834 case OMP_CLAUSE_FINAL
:
10835 case OMP_CLAUSE_MERGEABLE
:
10836 pc
= &OMP_CLAUSE_CHAIN (c
);
10840 gcc_unreachable ();
10845 t
= OMP_CLAUSE_DECL (c
);
10849 t
= require_complete_type (t
);
10850 if (t
== error_mark_node
)
10854 if (need_implicitly_determined
)
10856 const char *share_name
= NULL
;
10858 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
10859 share_name
= "threadprivate";
10860 else switch (c_omp_predetermined_sharing (t
))
10862 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
10864 case OMP_CLAUSE_DEFAULT_SHARED
:
10865 /* const vars may be specified in firstprivate clause. */
10866 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
10867 && TREE_READONLY (t
))
10869 share_name
= "shared";
10871 case OMP_CLAUSE_DEFAULT_PRIVATE
:
10872 share_name
= "private";
10875 gcc_unreachable ();
10879 error_at (OMP_CLAUSE_LOCATION (c
),
10880 "%qE is predetermined %qs for %qs",
10881 t
, share_name
, name
);
10888 *pc
= OMP_CLAUSE_CHAIN (c
);
10890 pc
= &OMP_CLAUSE_CHAIN (c
);
10893 bitmap_obstack_release (NULL
);
10897 /* Create a transaction node. */
10900 c_finish_transaction (location_t loc
, tree block
, int flags
)
10902 tree stmt
= build_stmt (loc
, TRANSACTION_EXPR
, block
);
10903 if (flags
& TM_STMT_ATTR_OUTER
)
10904 TRANSACTION_EXPR_OUTER (stmt
) = 1;
10905 if (flags
& TM_STMT_ATTR_RELAXED
)
10906 TRANSACTION_EXPR_RELAXED (stmt
) = 1;
10907 return add_stmt (stmt
);
10910 /* Make a variant type in the proper way for C/C++, propagating qualifiers
10911 down to the element type of an array. */
10914 c_build_qualified_type (tree type
, int type_quals
)
10916 if (type
== error_mark_node
)
10919 if (TREE_CODE (type
) == ARRAY_TYPE
)
10922 tree element_type
= c_build_qualified_type (TREE_TYPE (type
),
10925 /* See if we already have an identically qualified type. */
10926 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10928 if (TYPE_QUALS (strip_array_types (t
)) == type_quals
10929 && TYPE_NAME (t
) == TYPE_NAME (type
)
10930 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
)
10931 && attribute_list_equal (TYPE_ATTRIBUTES (t
),
10932 TYPE_ATTRIBUTES (type
)))
10937 tree domain
= TYPE_DOMAIN (type
);
10939 t
= build_variant_type_copy (type
);
10940 TREE_TYPE (t
) = element_type
;
10942 if (TYPE_STRUCTURAL_EQUALITY_P (element_type
)
10943 || (domain
&& TYPE_STRUCTURAL_EQUALITY_P (domain
)))
10944 SET_TYPE_STRUCTURAL_EQUALITY (t
);
10945 else if (TYPE_CANONICAL (element_type
) != element_type
10946 || (domain
&& TYPE_CANONICAL (domain
) != domain
))
10948 tree unqualified_canon
10949 = build_array_type (TYPE_CANONICAL (element_type
),
10950 domain
? TYPE_CANONICAL (domain
)
10953 = c_build_qualified_type (unqualified_canon
, type_quals
);
10956 TYPE_CANONICAL (t
) = t
;
10961 /* A restrict-qualified pointer type must be a pointer to object or
10962 incomplete type. Note that the use of POINTER_TYPE_P also allows
10963 REFERENCE_TYPEs, which is appropriate for C++. */
10964 if ((type_quals
& TYPE_QUAL_RESTRICT
)
10965 && (!POINTER_TYPE_P (type
)
10966 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
))))
10968 error ("invalid use of %<restrict%>");
10969 type_quals
&= ~TYPE_QUAL_RESTRICT
;
10972 return build_qualified_type (type
, type_quals
);
10975 /* Build a VA_ARG_EXPR for the C parser. */
10978 c_build_va_arg (location_t loc
, tree expr
, tree type
)
10980 if (warn_cxx_compat
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
10981 warning_at (loc
, OPT_Wc___compat
,
10982 "C++ requires promoted type, not enum type, in %<va_arg%>");
10983 return build_va_arg (loc
, expr
, type
);