1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* This file is part of the C front end.
24 It contains routines to build C expressions given their operands,
25 including computing the types of the result, C-specific error checks,
26 and some optimization. */
30 #include "coretypes.h"
34 #include "langhooks.h"
44 #include "tree-iterator.h"
45 #include "tree-gimple.h"
46 #include "tree-flow.h"
48 /* Possible cases of implicit bad conversions. Used to select
49 diagnostic messages in convert_for_assignment. */
58 /* The level of nesting inside "__alignof__". */
61 /* The level of nesting inside "sizeof". */
64 /* The level of nesting inside "typeof". */
67 struct c_label_context_se
*label_context_stack_se
;
68 struct c_label_context_vm
*label_context_stack_vm
;
70 /* Nonzero if we've already printed a "missing braces around initializer"
71 message within this initializer. */
72 static int missing_braces_mentioned
;
74 static int require_constant_value
;
75 static int require_constant_elements
;
77 static bool null_pointer_constant_p (const_tree
);
78 static tree
qualify_type (tree
, tree
);
79 static int tagged_types_tu_compatible_p (const_tree
, const_tree
);
80 static int comp_target_types (tree
, tree
);
81 static int function_types_compatible_p (const_tree
, const_tree
);
82 static int type_lists_compatible_p (const_tree
, const_tree
);
83 static tree
decl_constant_value_for_broken_optimization (tree
);
84 static tree
lookup_field (tree
, tree
);
85 static int convert_arguments (int, tree
*, tree
, tree
, tree
, tree
);
86 static tree
pointer_diff (tree
, tree
);
87 static tree
convert_for_assignment (tree
, tree
, enum impl_conv
, tree
, tree
,
89 static tree
valid_compound_expr_initializer (tree
, tree
);
90 static void push_string (const char *);
91 static void push_member_name (tree
);
92 static int spelling_length (void);
93 static char *print_spelling (char *);
94 static void warning_init (const char *);
95 static tree
digest_init (tree
, tree
, bool, int);
96 static void output_init_element (tree
, bool, tree
, tree
, int);
97 static void output_pending_init_elements (int);
98 static int set_designator (int);
99 static void push_range_stack (tree
);
100 static void add_pending_init (tree
, tree
);
101 static void set_nonincremental_init (void);
102 static void set_nonincremental_init_from_string (tree
);
103 static tree
find_init_member (tree
);
104 static void readonly_error (tree
, enum lvalue_use
);
105 static int lvalue_or_else (const_tree
, enum lvalue_use
);
106 static int lvalue_p (const_tree
);
107 static void record_maybe_used_decl (tree
);
108 static int comptypes_internal (const_tree
, const_tree
);
110 /* Return true if EXP is a null pointer constant, false otherwise. */
113 null_pointer_constant_p (const_tree expr
)
115 /* This should really operate on c_expr structures, but they aren't
116 yet available everywhere required. */
117 tree type
= TREE_TYPE (expr
);
118 return (TREE_CODE (expr
) == INTEGER_CST
119 && !TREE_OVERFLOW (expr
)
120 && integer_zerop (expr
)
121 && (INTEGRAL_TYPE_P (type
)
122 || (TREE_CODE (type
) == POINTER_TYPE
123 && VOID_TYPE_P (TREE_TYPE (type
))
124 && TYPE_QUALS (TREE_TYPE (type
)) == TYPE_UNQUALIFIED
)));
126 \f/* This is a cache to hold if two types are compatible or not. */
128 struct tagged_tu_seen_cache
{
129 const struct tagged_tu_seen_cache
* next
;
132 /* The return value of tagged_types_tu_compatible_p if we had seen
133 these two types already. */
137 static const struct tagged_tu_seen_cache
* tagged_tu_seen_base
;
138 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache
*);
140 /* Do `exp = require_complete_type (exp);' to make sure exp
141 does not have an incomplete type. (That includes void types.) */
144 require_complete_type (tree value
)
146 tree type
= TREE_TYPE (value
);
148 if (value
== error_mark_node
|| type
== error_mark_node
)
149 return error_mark_node
;
151 /* First, detect a valid value with a complete type. */
152 if (COMPLETE_TYPE_P (type
))
155 c_incomplete_type_error (value
, type
);
156 return error_mark_node
;
159 /* Print an error message for invalid use of an incomplete type.
160 VALUE is the expression that was used (or 0 if that isn't known)
161 and TYPE is the type that was invalid. */
164 c_incomplete_type_error (const_tree value
, const_tree type
)
166 const char *type_code_string
;
168 /* Avoid duplicate error message. */
169 if (TREE_CODE (type
) == ERROR_MARK
)
172 if (value
!= 0 && (TREE_CODE (value
) == VAR_DECL
173 || TREE_CODE (value
) == PARM_DECL
))
174 error ("%qD has an incomplete type", value
);
178 /* We must print an error message. Be clever about what it says. */
180 switch (TREE_CODE (type
))
183 type_code_string
= "struct";
187 type_code_string
= "union";
191 type_code_string
= "enum";
195 error ("invalid use of void expression");
199 if (TYPE_DOMAIN (type
))
201 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL
)
203 error ("invalid use of flexible array member");
206 type
= TREE_TYPE (type
);
209 error ("invalid use of array with unspecified bounds");
216 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
217 error ("invalid use of undefined type %<%s %E%>",
218 type_code_string
, TYPE_NAME (type
));
220 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
221 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type
));
225 /* Given a type, apply default promotions wrt unnamed function
226 arguments and return the new type. */
229 c_type_promotes_to (tree type
)
231 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
232 return double_type_node
;
234 if (c_promoting_integer_type_p (type
))
236 /* Preserve unsignedness if not really getting any wider. */
237 if (TYPE_UNSIGNED (type
)
238 && (TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
)))
239 return unsigned_type_node
;
240 return integer_type_node
;
246 /* Return a variant of TYPE which has all the type qualifiers of LIKE
247 as well as those of TYPE. */
250 qualify_type (tree type
, tree like
)
252 return c_build_qualified_type (type
,
253 TYPE_QUALS (type
) | TYPE_QUALS (like
));
256 /* Return true iff the given tree T is a variable length array. */
259 c_vla_type_p (const_tree t
)
261 if (TREE_CODE (t
) == ARRAY_TYPE
262 && C_TYPE_VARIABLE_SIZE (t
))
267 /* Return the composite type of two compatible types.
269 We assume that comptypes has already been done and returned
270 nonzero; if that isn't so, this may crash. In particular, we
271 assume that qualifiers match. */
274 composite_type (tree t1
, tree t2
)
276 enum tree_code code1
;
277 enum tree_code code2
;
280 /* Save time if the two types are the same. */
282 if (t1
== t2
) return t1
;
284 /* If one type is nonsense, use the other. */
285 if (t1
== error_mark_node
)
287 if (t2
== error_mark_node
)
290 code1
= TREE_CODE (t1
);
291 code2
= TREE_CODE (t2
);
293 /* Merge the attributes. */
294 attributes
= targetm
.merge_type_attributes (t1
, t2
);
296 /* If one is an enumerated type and the other is the compatible
297 integer type, the composite type might be either of the two
298 (DR#013 question 3). For consistency, use the enumerated type as
299 the composite type. */
301 if (code1
== ENUMERAL_TYPE
&& code2
== INTEGER_TYPE
)
303 if (code2
== ENUMERAL_TYPE
&& code1
== INTEGER_TYPE
)
306 gcc_assert (code1
== code2
);
311 /* For two pointers, do this recursively on the target type. */
313 tree pointed_to_1
= TREE_TYPE (t1
);
314 tree pointed_to_2
= TREE_TYPE (t2
);
315 tree target
= composite_type (pointed_to_1
, pointed_to_2
);
316 t1
= build_pointer_type (target
);
317 t1
= build_type_attribute_variant (t1
, attributes
);
318 return qualify_type (t1
, t2
);
323 tree elt
= composite_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
326 tree d1
= TYPE_DOMAIN (t1
);
327 tree d2
= TYPE_DOMAIN (t2
);
328 bool d1_variable
, d2_variable
;
329 bool d1_zero
, d2_zero
;
331 /* We should not have any type quals on arrays at all. */
332 gcc_assert (!TYPE_QUALS (t1
) && !TYPE_QUALS (t2
));
334 d1_zero
= d1
== 0 || !TYPE_MAX_VALUE (d1
);
335 d2_zero
= d2
== 0 || !TYPE_MAX_VALUE (d2
);
337 d1_variable
= (!d1_zero
338 && (TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
339 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
));
340 d2_variable
= (!d2_zero
341 && (TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
342 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
));
343 d1_variable
= d1_variable
|| (d1_zero
&& c_vla_type_p (t1
));
344 d2_variable
= d2_variable
|| (d2_zero
&& c_vla_type_p (t2
));
346 /* Save space: see if the result is identical to one of the args. */
347 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
)
348 && (d2_variable
|| d2_zero
|| !d1_variable
))
349 return build_type_attribute_variant (t1
, attributes
);
350 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
)
351 && (d1_variable
|| d1_zero
|| !d2_variable
))
352 return build_type_attribute_variant (t2
, attributes
);
354 if (elt
== TREE_TYPE (t1
) && !TYPE_DOMAIN (t2
) && !TYPE_DOMAIN (t1
))
355 return build_type_attribute_variant (t1
, attributes
);
356 if (elt
== TREE_TYPE (t2
) && !TYPE_DOMAIN (t2
) && !TYPE_DOMAIN (t1
))
357 return build_type_attribute_variant (t2
, attributes
);
359 /* Merge the element types, and have a size if either arg has
360 one. We may have qualifiers on the element types. To set
361 up TYPE_MAIN_VARIANT correctly, we need to form the
362 composite of the unqualified types and add the qualifiers
364 quals
= TYPE_QUALS (strip_array_types (elt
));
365 unqual_elt
= c_build_qualified_type (elt
, TYPE_UNQUALIFIED
);
366 t1
= build_array_type (unqual_elt
,
367 TYPE_DOMAIN ((TYPE_DOMAIN (t1
)
373 t1
= c_build_qualified_type (t1
, quals
);
374 return build_type_attribute_variant (t1
, attributes
);
380 if (attributes
!= NULL
)
382 /* Try harder not to create a new aggregate type. */
383 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
385 if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
388 return build_type_attribute_variant (t1
, attributes
);
391 /* Function types: prefer the one that specified arg types.
392 If both do, merge the arg types. Also merge the return types. */
394 tree valtype
= composite_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
395 tree p1
= TYPE_ARG_TYPES (t1
);
396 tree p2
= TYPE_ARG_TYPES (t2
);
401 /* Save space: see if the result is identical to one of the args. */
402 if (valtype
== TREE_TYPE (t1
) && !TYPE_ARG_TYPES (t2
))
403 return build_type_attribute_variant (t1
, attributes
);
404 if (valtype
== TREE_TYPE (t2
) && !TYPE_ARG_TYPES (t1
))
405 return build_type_attribute_variant (t2
, attributes
);
407 /* Simple way if one arg fails to specify argument types. */
408 if (TYPE_ARG_TYPES (t1
) == 0)
410 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t2
));
411 t1
= build_type_attribute_variant (t1
, attributes
);
412 return qualify_type (t1
, t2
);
414 if (TYPE_ARG_TYPES (t2
) == 0)
416 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t1
));
417 t1
= build_type_attribute_variant (t1
, attributes
);
418 return qualify_type (t1
, t2
);
421 /* If both args specify argument types, we must merge the two
422 lists, argument by argument. */
423 /* Tell global_bindings_p to return false so that variable_size
424 doesn't die on VLAs in parameter types. */
425 c_override_global_bindings_to_false
= true;
427 len
= list_length (p1
);
430 for (i
= 0; i
< len
; i
++)
431 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
436 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
))
438 /* A null type means arg type is not specified.
439 Take whatever the other function type has. */
440 if (TREE_VALUE (p1
) == 0)
442 TREE_VALUE (n
) = TREE_VALUE (p2
);
445 if (TREE_VALUE (p2
) == 0)
447 TREE_VALUE (n
) = TREE_VALUE (p1
);
451 /* Given wait (union {union wait *u; int *i} *)
452 and wait (union wait *),
453 prefer union wait * as type of parm. */
454 if (TREE_CODE (TREE_VALUE (p1
)) == UNION_TYPE
455 && TREE_VALUE (p1
) != TREE_VALUE (p2
))
458 tree mv2
= TREE_VALUE (p2
);
459 if (mv2
&& mv2
!= error_mark_node
460 && TREE_CODE (mv2
) != ARRAY_TYPE
)
461 mv2
= TYPE_MAIN_VARIANT (mv2
);
462 for (memb
= TYPE_FIELDS (TREE_VALUE (p1
));
463 memb
; memb
= TREE_CHAIN (memb
))
465 tree mv3
= TREE_TYPE (memb
);
466 if (mv3
&& mv3
!= error_mark_node
467 && TREE_CODE (mv3
) != ARRAY_TYPE
)
468 mv3
= TYPE_MAIN_VARIANT (mv3
);
469 if (comptypes (mv3
, mv2
))
471 TREE_VALUE (n
) = composite_type (TREE_TYPE (memb
),
474 pedwarn ("function types not truly compatible in ISO C");
479 if (TREE_CODE (TREE_VALUE (p2
)) == UNION_TYPE
480 && TREE_VALUE (p2
) != TREE_VALUE (p1
))
483 tree mv1
= TREE_VALUE (p1
);
484 if (mv1
&& mv1
!= error_mark_node
485 && TREE_CODE (mv1
) != ARRAY_TYPE
)
486 mv1
= TYPE_MAIN_VARIANT (mv1
);
487 for (memb
= TYPE_FIELDS (TREE_VALUE (p2
));
488 memb
; memb
= TREE_CHAIN (memb
))
490 tree mv3
= TREE_TYPE (memb
);
491 if (mv3
&& mv3
!= error_mark_node
492 && TREE_CODE (mv3
) != ARRAY_TYPE
)
493 mv3
= TYPE_MAIN_VARIANT (mv3
);
494 if (comptypes (mv3
, mv1
))
496 TREE_VALUE (n
) = composite_type (TREE_TYPE (memb
),
499 pedwarn ("function types not truly compatible in ISO C");
504 TREE_VALUE (n
) = composite_type (TREE_VALUE (p1
), TREE_VALUE (p2
));
508 c_override_global_bindings_to_false
= false;
509 t1
= build_function_type (valtype
, newargs
);
510 t1
= qualify_type (t1
, t2
);
511 /* ... falls through ... */
515 return build_type_attribute_variant (t1
, attributes
);
520 /* Return the type of a conditional expression between pointers to
521 possibly differently qualified versions of compatible types.
523 We assume that comp_target_types has already been done and returned
524 nonzero; if that isn't so, this may crash. */
527 common_pointer_type (tree t1
, tree t2
)
530 tree pointed_to_1
, mv1
;
531 tree pointed_to_2
, mv2
;
533 unsigned target_quals
;
535 /* Save time if the two types are the same. */
537 if (t1
== t2
) return t1
;
539 /* If one type is nonsense, use the other. */
540 if (t1
== error_mark_node
)
542 if (t2
== error_mark_node
)
545 gcc_assert (TREE_CODE (t1
) == POINTER_TYPE
546 && TREE_CODE (t2
) == POINTER_TYPE
);
548 /* Merge the attributes. */
549 attributes
= targetm
.merge_type_attributes (t1
, t2
);
551 /* Find the composite type of the target types, and combine the
552 qualifiers of the two types' targets. Do not lose qualifiers on
553 array element types by taking the TYPE_MAIN_VARIANT. */
554 mv1
= pointed_to_1
= TREE_TYPE (t1
);
555 mv2
= pointed_to_2
= TREE_TYPE (t2
);
556 if (TREE_CODE (mv1
) != ARRAY_TYPE
)
557 mv1
= TYPE_MAIN_VARIANT (pointed_to_1
);
558 if (TREE_CODE (mv2
) != ARRAY_TYPE
)
559 mv2
= TYPE_MAIN_VARIANT (pointed_to_2
);
560 target
= composite_type (mv1
, mv2
);
562 /* For function types do not merge const qualifiers, but drop them
563 if used inconsistently. The middle-end uses these to mark const
564 and noreturn functions. */
565 if (TREE_CODE (pointed_to_1
) == FUNCTION_TYPE
)
566 target_quals
= TYPE_QUALS (pointed_to_1
) & TYPE_QUALS (pointed_to_2
);
568 target_quals
= TYPE_QUALS (pointed_to_1
) | TYPE_QUALS (pointed_to_2
);
569 t1
= build_pointer_type (c_build_qualified_type (target
, target_quals
));
570 return build_type_attribute_variant (t1
, attributes
);
573 /* Return the common type for two arithmetic types under the usual
574 arithmetic conversions. The default conversions have already been
575 applied, and enumerated types converted to their compatible integer
576 types. The resulting type is unqualified and has no attributes.
578 This is the type for the result of most arithmetic operations
579 if the operands have the given two types. */
582 c_common_type (tree t1
, tree t2
)
584 enum tree_code code1
;
585 enum tree_code code2
;
587 /* If one type is nonsense, use the other. */
588 if (t1
== error_mark_node
)
590 if (t2
== error_mark_node
)
593 if (TYPE_QUALS (t1
) != TYPE_UNQUALIFIED
)
594 t1
= TYPE_MAIN_VARIANT (t1
);
596 if (TYPE_QUALS (t2
) != TYPE_UNQUALIFIED
)
597 t2
= TYPE_MAIN_VARIANT (t2
);
599 if (TYPE_ATTRIBUTES (t1
) != NULL_TREE
)
600 t1
= build_type_attribute_variant (t1
, NULL_TREE
);
602 if (TYPE_ATTRIBUTES (t2
) != NULL_TREE
)
603 t2
= build_type_attribute_variant (t2
, NULL_TREE
);
605 /* Save time if the two types are the same. */
607 if (t1
== t2
) return t1
;
609 code1
= TREE_CODE (t1
);
610 code2
= TREE_CODE (t2
);
612 gcc_assert (code1
== VECTOR_TYPE
|| code1
== COMPLEX_TYPE
613 || code1
== FIXED_POINT_TYPE
|| code1
== REAL_TYPE
614 || code1
== INTEGER_TYPE
);
615 gcc_assert (code2
== VECTOR_TYPE
|| code2
== COMPLEX_TYPE
616 || code2
== FIXED_POINT_TYPE
|| code2
== REAL_TYPE
617 || code2
== INTEGER_TYPE
);
619 /* When one operand is a decimal float type, the other operand cannot be
620 a generic float type or a complex type. We also disallow vector types
622 if ((DECIMAL_FLOAT_TYPE_P (t1
) || DECIMAL_FLOAT_TYPE_P (t2
))
623 && !(DECIMAL_FLOAT_TYPE_P (t1
) && DECIMAL_FLOAT_TYPE_P (t2
)))
625 if (code1
== VECTOR_TYPE
|| code2
== VECTOR_TYPE
)
627 error ("can%'t mix operands of decimal float and vector types");
628 return error_mark_node
;
630 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
632 error ("can%'t mix operands of decimal float and complex types");
633 return error_mark_node
;
635 if (code1
== REAL_TYPE
&& code2
== REAL_TYPE
)
637 error ("can%'t mix operands of decimal float and other float types");
638 return error_mark_node
;
642 /* If one type is a vector type, return that type. (How the usual
643 arithmetic conversions apply to the vector types extension is not
644 precisely specified.) */
645 if (code1
== VECTOR_TYPE
)
648 if (code2
== VECTOR_TYPE
)
651 /* If one type is complex, form the common type of the non-complex
652 components, then make that complex. Use T1 or T2 if it is the
654 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
656 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
657 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
658 tree subtype
= c_common_type (subtype1
, subtype2
);
660 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
662 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
665 return build_complex_type (subtype
);
668 /* If only one is real, use it as the result. */
670 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
673 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
676 /* If both are real and either are decimal floating point types, use
677 the decimal floating point type with the greater precision. */
679 if (code1
== REAL_TYPE
&& code2
== REAL_TYPE
)
681 if (TYPE_MAIN_VARIANT (t1
) == dfloat128_type_node
682 || TYPE_MAIN_VARIANT (t2
) == dfloat128_type_node
)
683 return dfloat128_type_node
;
684 else if (TYPE_MAIN_VARIANT (t1
) == dfloat64_type_node
685 || TYPE_MAIN_VARIANT (t2
) == dfloat64_type_node
)
686 return dfloat64_type_node
;
687 else if (TYPE_MAIN_VARIANT (t1
) == dfloat32_type_node
688 || TYPE_MAIN_VARIANT (t2
) == dfloat32_type_node
)
689 return dfloat32_type_node
;
692 /* Deal with fixed-point types. */
693 if (code1
== FIXED_POINT_TYPE
|| code2
== FIXED_POINT_TYPE
)
695 unsigned int unsignedp
= 0, satp
= 0;
696 enum machine_mode m1
, m2
;
697 unsigned int fbit1
, ibit1
, fbit2
, ibit2
, max_fbit
, max_ibit
;
702 /* If one input type is saturating, the result type is saturating. */
703 if (TYPE_SATURATING (t1
) || TYPE_SATURATING (t2
))
706 /* If both fixed-point types are unsigned, the result type is unsigned.
707 When mixing fixed-point and integer types, follow the sign of the
709 Otherwise, the result type is signed. */
710 if ((TYPE_UNSIGNED (t1
) && TYPE_UNSIGNED (t2
)
711 && code1
== FIXED_POINT_TYPE
&& code2
== FIXED_POINT_TYPE
)
712 || (code1
== FIXED_POINT_TYPE
&& code2
!= FIXED_POINT_TYPE
713 && TYPE_UNSIGNED (t1
))
714 || (code1
!= FIXED_POINT_TYPE
&& code2
== FIXED_POINT_TYPE
715 && TYPE_UNSIGNED (t2
)))
718 /* The result type is signed. */
721 /* If the input type is unsigned, we need to convert to the
723 if (code1
== FIXED_POINT_TYPE
&& TYPE_UNSIGNED (t1
))
725 unsigned char mclass
= 0;
726 if (GET_MODE_CLASS (m1
) == MODE_UFRACT
)
728 else if (GET_MODE_CLASS (m1
) == MODE_UACCUM
)
732 m1
= mode_for_size (GET_MODE_PRECISION (m1
), mclass
, 0);
734 if (code2
== FIXED_POINT_TYPE
&& TYPE_UNSIGNED (t2
))
736 unsigned char mclass
= 0;
737 if (GET_MODE_CLASS (m2
) == MODE_UFRACT
)
739 else if (GET_MODE_CLASS (m2
) == MODE_UACCUM
)
743 m2
= mode_for_size (GET_MODE_PRECISION (m2
), mclass
, 0);
747 if (code1
== FIXED_POINT_TYPE
)
749 fbit1
= GET_MODE_FBIT (m1
);
750 ibit1
= GET_MODE_IBIT (m1
);
755 /* Signed integers need to subtract one sign bit. */
756 ibit1
= TYPE_PRECISION (t1
) - (!TYPE_UNSIGNED (t1
));
759 if (code2
== FIXED_POINT_TYPE
)
761 fbit2
= GET_MODE_FBIT (m2
);
762 ibit2
= GET_MODE_IBIT (m2
);
767 /* Signed integers need to subtract one sign bit. */
768 ibit2
= TYPE_PRECISION (t2
) - (!TYPE_UNSIGNED (t2
));
771 max_ibit
= ibit1
>= ibit2
? ibit1
: ibit2
;
772 max_fbit
= fbit1
>= fbit2
? fbit1
: fbit2
;
773 return c_common_fixed_point_type_for_size (max_ibit
, max_fbit
, unsignedp
,
777 /* Both real or both integers; use the one with greater precision. */
779 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
781 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
784 /* Same precision. Prefer long longs to longs to ints when the
785 same precision, following the C99 rules on integer type rank
786 (which are equivalent to the C90 rules for C90 types). */
788 if (TYPE_MAIN_VARIANT (t1
) == long_long_unsigned_type_node
789 || TYPE_MAIN_VARIANT (t2
) == long_long_unsigned_type_node
)
790 return long_long_unsigned_type_node
;
792 if (TYPE_MAIN_VARIANT (t1
) == long_long_integer_type_node
793 || TYPE_MAIN_VARIANT (t2
) == long_long_integer_type_node
)
795 if (TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
796 return long_long_unsigned_type_node
;
798 return long_long_integer_type_node
;
801 if (TYPE_MAIN_VARIANT (t1
) == long_unsigned_type_node
802 || TYPE_MAIN_VARIANT (t2
) == long_unsigned_type_node
)
803 return long_unsigned_type_node
;
805 if (TYPE_MAIN_VARIANT (t1
) == long_integer_type_node
806 || TYPE_MAIN_VARIANT (t2
) == long_integer_type_node
)
808 /* But preserve unsignedness from the other type,
809 since long cannot hold all the values of an unsigned int. */
810 if (TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
811 return long_unsigned_type_node
;
813 return long_integer_type_node
;
816 /* Likewise, prefer long double to double even if same size. */
817 if (TYPE_MAIN_VARIANT (t1
) == long_double_type_node
818 || TYPE_MAIN_VARIANT (t2
) == long_double_type_node
)
819 return long_double_type_node
;
821 /* Otherwise prefer the unsigned one. */
823 if (TYPE_UNSIGNED (t1
))
829 /* Wrapper around c_common_type that is used by c-common.c and other
830 front end optimizations that remove promotions. ENUMERAL_TYPEs
831 are allowed here and are converted to their compatible integer types.
832 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
833 preferably a non-Boolean type as the common type. */
835 common_type (tree t1
, tree t2
)
837 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
838 t1
= c_common_type_for_size (TYPE_PRECISION (t1
), 1);
839 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
840 t2
= c_common_type_for_size (TYPE_PRECISION (t2
), 1);
842 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
843 if (TREE_CODE (t1
) == BOOLEAN_TYPE
844 && TREE_CODE (t2
) == BOOLEAN_TYPE
)
845 return boolean_type_node
;
847 /* If either type is BOOLEAN_TYPE, then return the other. */
848 if (TREE_CODE (t1
) == BOOLEAN_TYPE
)
850 if (TREE_CODE (t2
) == BOOLEAN_TYPE
)
853 return c_common_type (t1
, t2
);
856 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
857 or various other operations. Return 2 if they are compatible
858 but a warning may be needed if you use them together. */
861 comptypes (tree type1
, tree type2
)
863 const struct tagged_tu_seen_cache
* tagged_tu_seen_base1
= tagged_tu_seen_base
;
866 val
= comptypes_internal (type1
, type2
);
867 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1
);
872 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
873 or various other operations. Return 2 if they are compatible
874 but a warning may be needed if you use them together. This
875 differs from comptypes, in that we don't free the seen types. */
878 comptypes_internal (const_tree type1
, const_tree type2
)
880 const_tree t1
= type1
;
881 const_tree t2
= type2
;
884 /* Suppress errors caused by previously reported errors. */
886 if (t1
== t2
|| !t1
|| !t2
887 || TREE_CODE (t1
) == ERROR_MARK
|| TREE_CODE (t2
) == ERROR_MARK
)
890 /* If either type is the internal version of sizetype, return the
892 if (TREE_CODE (t1
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t1
)
893 && TYPE_ORIG_SIZE_TYPE (t1
))
894 t1
= TYPE_ORIG_SIZE_TYPE (t1
);
896 if (TREE_CODE (t2
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t2
)
897 && TYPE_ORIG_SIZE_TYPE (t2
))
898 t2
= TYPE_ORIG_SIZE_TYPE (t2
);
901 /* Enumerated types are compatible with integer types, but this is
902 not transitive: two enumerated types in the same translation unit
903 are compatible with each other only if they are the same type. */
905 if (TREE_CODE (t1
) == ENUMERAL_TYPE
&& TREE_CODE (t2
) != ENUMERAL_TYPE
)
906 t1
= c_common_type_for_size (TYPE_PRECISION (t1
), TYPE_UNSIGNED (t1
));
907 else if (TREE_CODE (t2
) == ENUMERAL_TYPE
&& TREE_CODE (t1
) != ENUMERAL_TYPE
)
908 t2
= c_common_type_for_size (TYPE_PRECISION (t2
), TYPE_UNSIGNED (t2
));
913 /* Different classes of types can't be compatible. */
915 if (TREE_CODE (t1
) != TREE_CODE (t2
))
918 /* Qualifiers must match. C99 6.7.3p9 */
920 if (TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
923 /* Allow for two different type nodes which have essentially the same
924 definition. Note that we already checked for equality of the type
925 qualifiers (just above). */
927 if (TREE_CODE (t1
) != ARRAY_TYPE
928 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
931 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
932 if (!(attrval
= targetm
.comp_type_attributes (t1
, t2
)))
935 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
938 switch (TREE_CODE (t1
))
941 /* Do not remove mode or aliasing information. */
942 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
943 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
))
945 val
= (TREE_TYPE (t1
) == TREE_TYPE (t2
)
946 ? 1 : comptypes_internal (TREE_TYPE (t1
), TREE_TYPE (t2
)));
950 val
= function_types_compatible_p (t1
, t2
);
955 tree d1
= TYPE_DOMAIN (t1
);
956 tree d2
= TYPE_DOMAIN (t2
);
957 bool d1_variable
, d2_variable
;
958 bool d1_zero
, d2_zero
;
961 /* Target types must match incl. qualifiers. */
962 if (TREE_TYPE (t1
) != TREE_TYPE (t2
)
963 && 0 == (val
= comptypes_internal (TREE_TYPE (t1
), TREE_TYPE (t2
))))
966 /* Sizes must match unless one is missing or variable. */
967 if (d1
== 0 || d2
== 0 || d1
== d2
)
970 d1_zero
= !TYPE_MAX_VALUE (d1
);
971 d2_zero
= !TYPE_MAX_VALUE (d2
);
973 d1_variable
= (!d1_zero
974 && (TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
975 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
));
976 d2_variable
= (!d2_zero
977 && (TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
978 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
));
979 d1_variable
= d1_variable
|| (d1_zero
&& c_vla_type_p (t1
));
980 d2_variable
= d2_variable
|| (d2_zero
&& c_vla_type_p (t2
));
982 if (d1_variable
|| d2_variable
)
984 if (d1_zero
&& d2_zero
)
986 if (d1_zero
|| d2_zero
987 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
))
988 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1
), TYPE_MAX_VALUE (d2
)))
997 if (val
!= 1 && !same_translation_unit_p (t1
, t2
))
999 tree a1
= TYPE_ATTRIBUTES (t1
);
1000 tree a2
= TYPE_ATTRIBUTES (t2
);
1002 if (! attribute_list_contained (a1
, a2
)
1003 && ! attribute_list_contained (a2
, a1
))
1007 return tagged_types_tu_compatible_p (t1
, t2
);
1008 val
= tagged_types_tu_compatible_p (t1
, t2
);
1013 val
= TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
1014 && comptypes_internal (TREE_TYPE (t1
), TREE_TYPE (t2
));
1020 return attrval
== 2 && val
== 1 ? 2 : val
;
1023 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
1024 ignoring their qualifiers. */
1027 comp_target_types (tree ttl
, tree ttr
)
1032 /* Do not lose qualifiers on element types of array types that are
1033 pointer targets by taking their TYPE_MAIN_VARIANT. */
1034 mvl
= TREE_TYPE (ttl
);
1035 mvr
= TREE_TYPE (ttr
);
1036 if (TREE_CODE (mvl
) != ARRAY_TYPE
)
1037 mvl
= TYPE_MAIN_VARIANT (mvl
);
1038 if (TREE_CODE (mvr
) != ARRAY_TYPE
)
1039 mvr
= TYPE_MAIN_VARIANT (mvr
);
1040 val
= comptypes (mvl
, mvr
);
1042 if (val
== 2 && pedantic
)
1043 pedwarn ("types are not quite compatible");
1047 /* Subroutines of `comptypes'. */
1049 /* Determine whether two trees derive from the same translation unit.
1050 If the CONTEXT chain ends in a null, that tree's context is still
1051 being parsed, so if two trees have context chains ending in null,
1052 they're in the same translation unit. */
1054 same_translation_unit_p (const_tree t1
, const_tree t2
)
1056 while (t1
&& TREE_CODE (t1
) != TRANSLATION_UNIT_DECL
)
1057 switch (TREE_CODE_CLASS (TREE_CODE (t1
)))
1059 case tcc_declaration
:
1060 t1
= DECL_CONTEXT (t1
); break;
1062 t1
= TYPE_CONTEXT (t1
); break;
1063 case tcc_exceptional
:
1064 t1
= BLOCK_SUPERCONTEXT (t1
); break; /* assume block */
1065 default: gcc_unreachable ();
1068 while (t2
&& TREE_CODE (t2
) != TRANSLATION_UNIT_DECL
)
1069 switch (TREE_CODE_CLASS (TREE_CODE (t2
)))
1071 case tcc_declaration
:
1072 t2
= DECL_CONTEXT (t2
); break;
1074 t2
= TYPE_CONTEXT (t2
); break;
1075 case tcc_exceptional
:
1076 t2
= BLOCK_SUPERCONTEXT (t2
); break; /* assume block */
1077 default: gcc_unreachable ();
1083 /* Allocate the seen two types, assuming that they are compatible. */
1085 static struct tagged_tu_seen_cache
*
1086 alloc_tagged_tu_seen_cache (const_tree t1
, const_tree t2
)
1088 struct tagged_tu_seen_cache
*tu
= XNEW (struct tagged_tu_seen_cache
);
1089 tu
->next
= tagged_tu_seen_base
;
1093 tagged_tu_seen_base
= tu
;
1095 /* The C standard says that two structures in different translation
1096 units are compatible with each other only if the types of their
1097 fields are compatible (among other things). We assume that they
1098 are compatible until proven otherwise when building the cache.
1099 An example where this can occur is:
1104 If we are comparing this against a similar struct in another TU,
1105 and did not assume they were compatible, we end up with an infinite
1111 /* Free the seen types until we get to TU_TIL. */
1114 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache
*tu_til
)
1116 const struct tagged_tu_seen_cache
*tu
= tagged_tu_seen_base
;
1117 while (tu
!= tu_til
)
1119 const struct tagged_tu_seen_cache
*const tu1
1120 = (const struct tagged_tu_seen_cache
*) tu
;
1122 free (CONST_CAST (struct tagged_tu_seen_cache
*, tu1
));
1124 tagged_tu_seen_base
= tu_til
;
1127 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1128 compatible. If the two types are not the same (which has been
1129 checked earlier), this can only happen when multiple translation
1130 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1134 tagged_types_tu_compatible_p (const_tree t1
, const_tree t2
)
1137 bool needs_warning
= false;
1139 /* We have to verify that the tags of the types are the same. This
1140 is harder than it looks because this may be a typedef, so we have
1141 to go look at the original type. It may even be a typedef of a
1143 In the case of compiler-created builtin structs the TYPE_DECL
1144 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1145 while (TYPE_NAME (t1
)
1146 && TREE_CODE (TYPE_NAME (t1
)) == TYPE_DECL
1147 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1
)))
1148 t1
= DECL_ORIGINAL_TYPE (TYPE_NAME (t1
));
1150 while (TYPE_NAME (t2
)
1151 && TREE_CODE (TYPE_NAME (t2
)) == TYPE_DECL
1152 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2
)))
1153 t2
= DECL_ORIGINAL_TYPE (TYPE_NAME (t2
));
1155 /* C90 didn't have the requirement that the two tags be the same. */
1156 if (flag_isoc99
&& TYPE_NAME (t1
) != TYPE_NAME (t2
))
1159 /* C90 didn't say what happened if one or both of the types were
1160 incomplete; we choose to follow C99 rules here, which is that they
1162 if (TYPE_SIZE (t1
) == NULL
1163 || TYPE_SIZE (t2
) == NULL
)
1167 const struct tagged_tu_seen_cache
* tts_i
;
1168 for (tts_i
= tagged_tu_seen_base
; tts_i
!= NULL
; tts_i
= tts_i
->next
)
1169 if (tts_i
->t1
== t1
&& tts_i
->t2
== t2
)
1173 switch (TREE_CODE (t1
))
1177 struct tagged_tu_seen_cache
*tu
= alloc_tagged_tu_seen_cache (t1
, t2
);
1178 /* Speed up the case where the type values are in the same order. */
1179 tree tv1
= TYPE_VALUES (t1
);
1180 tree tv2
= TYPE_VALUES (t2
);
1187 for (;tv1
&& tv2
; tv1
= TREE_CHAIN (tv1
), tv2
= TREE_CHAIN (tv2
))
1189 if (TREE_PURPOSE (tv1
) != TREE_PURPOSE (tv2
))
1191 if (simple_cst_equal (TREE_VALUE (tv1
), TREE_VALUE (tv2
)) != 1)
1198 if (tv1
== NULL_TREE
&& tv2
== NULL_TREE
)
1202 if (tv1
== NULL_TREE
|| tv2
== NULL_TREE
)
1208 if (list_length (TYPE_VALUES (t1
)) != list_length (TYPE_VALUES (t2
)))
1214 for (s1
= TYPE_VALUES (t1
); s1
; s1
= TREE_CHAIN (s1
))
1216 s2
= purpose_member (TREE_PURPOSE (s1
), TYPE_VALUES (t2
));
1218 || simple_cst_equal (TREE_VALUE (s1
), TREE_VALUE (s2
)) != 1)
1229 struct tagged_tu_seen_cache
*tu
= alloc_tagged_tu_seen_cache (t1
, t2
);
1230 if (list_length (TYPE_FIELDS (t1
)) != list_length (TYPE_FIELDS (t2
)))
1236 /* Speed up the common case where the fields are in the same order. */
1237 for (s1
= TYPE_FIELDS (t1
), s2
= TYPE_FIELDS (t2
); s1
&& s2
;
1238 s1
= TREE_CHAIN (s1
), s2
= TREE_CHAIN (s2
))
1242 if (DECL_NAME (s1
) != DECL_NAME (s2
))
1244 result
= comptypes_internal (TREE_TYPE (s1
), TREE_TYPE (s2
));
1246 if (result
!= 1 && !DECL_NAME (s1
))
1254 needs_warning
= true;
1256 if (TREE_CODE (s1
) == FIELD_DECL
1257 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
1258 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
1266 tu
->val
= needs_warning
? 2 : 1;
1270 for (s1
= TYPE_FIELDS (t1
); s1
; s1
= TREE_CHAIN (s1
))
1274 for (s2
= TYPE_FIELDS (t2
); s2
; s2
= TREE_CHAIN (s2
))
1275 if (DECL_NAME (s1
) == DECL_NAME (s2
))
1279 result
= comptypes_internal (TREE_TYPE (s1
), TREE_TYPE (s2
));
1281 if (result
!= 1 && !DECL_NAME (s1
))
1289 needs_warning
= true;
1291 if (TREE_CODE (s1
) == FIELD_DECL
1292 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
1293 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
1305 tu
->val
= needs_warning
? 2 : 10;
1311 struct tagged_tu_seen_cache
*tu
= alloc_tagged_tu_seen_cache (t1
, t2
);
1313 for (s1
= TYPE_FIELDS (t1
), s2
= TYPE_FIELDS (t2
);
1315 s1
= TREE_CHAIN (s1
), s2
= TREE_CHAIN (s2
))
1318 if (TREE_CODE (s1
) != TREE_CODE (s2
)
1319 || DECL_NAME (s1
) != DECL_NAME (s2
))
1321 result
= comptypes_internal (TREE_TYPE (s1
), TREE_TYPE (s2
));
1325 needs_warning
= true;
1327 if (TREE_CODE (s1
) == FIELD_DECL
1328 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
1329 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
1335 tu
->val
= needs_warning
? 2 : 1;
1344 /* Return 1 if two function types F1 and F2 are compatible.
1345 If either type specifies no argument types,
1346 the other must specify a fixed number of self-promoting arg types.
1347 Otherwise, if one type specifies only the number of arguments,
1348 the other must specify that number of self-promoting arg types.
1349 Otherwise, the argument types must match. */
1352 function_types_compatible_p (const_tree f1
, const_tree f2
)
1355 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1360 ret1
= TREE_TYPE (f1
);
1361 ret2
= TREE_TYPE (f2
);
1363 /* 'volatile' qualifiers on a function's return type used to mean
1364 the function is noreturn. */
1365 if (TYPE_VOLATILE (ret1
) != TYPE_VOLATILE (ret2
))
1366 pedwarn ("function return types not compatible due to %<volatile%>");
1367 if (TYPE_VOLATILE (ret1
))
1368 ret1
= build_qualified_type (TYPE_MAIN_VARIANT (ret1
),
1369 TYPE_QUALS (ret1
) & ~TYPE_QUAL_VOLATILE
);
1370 if (TYPE_VOLATILE (ret2
))
1371 ret2
= build_qualified_type (TYPE_MAIN_VARIANT (ret2
),
1372 TYPE_QUALS (ret2
) & ~TYPE_QUAL_VOLATILE
);
1373 val
= comptypes_internal (ret1
, ret2
);
1377 args1
= TYPE_ARG_TYPES (f1
);
1378 args2
= TYPE_ARG_TYPES (f2
);
1380 /* An unspecified parmlist matches any specified parmlist
1381 whose argument types don't need default promotions. */
1385 if (!self_promoting_args_p (args2
))
1387 /* If one of these types comes from a non-prototype fn definition,
1388 compare that with the other type's arglist.
1389 If they don't match, ask for a warning (but no error). */
1390 if (TYPE_ACTUAL_ARG_TYPES (f1
)
1391 && 1 != type_lists_compatible_p (args2
, TYPE_ACTUAL_ARG_TYPES (f1
)))
1397 if (!self_promoting_args_p (args1
))
1399 if (TYPE_ACTUAL_ARG_TYPES (f2
)
1400 && 1 != type_lists_compatible_p (args1
, TYPE_ACTUAL_ARG_TYPES (f2
)))
1405 /* Both types have argument lists: compare them and propagate results. */
1406 val1
= type_lists_compatible_p (args1
, args2
);
1407 return val1
!= 1 ? val1
: val
;
1410 /* Check two lists of types for compatibility,
1411 returning 0 for incompatible, 1 for compatible,
1412 or 2 for compatible with warning. */
1415 type_lists_compatible_p (const_tree args1
, const_tree args2
)
1417 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1423 tree a1
, mv1
, a2
, mv2
;
1424 if (args1
== 0 && args2
== 0)
1426 /* If one list is shorter than the other,
1427 they fail to match. */
1428 if (args1
== 0 || args2
== 0)
1430 mv1
= a1
= TREE_VALUE (args1
);
1431 mv2
= a2
= TREE_VALUE (args2
);
1432 if (mv1
&& mv1
!= error_mark_node
&& TREE_CODE (mv1
) != ARRAY_TYPE
)
1433 mv1
= TYPE_MAIN_VARIANT (mv1
);
1434 if (mv2
&& mv2
!= error_mark_node
&& TREE_CODE (mv2
) != ARRAY_TYPE
)
1435 mv2
= TYPE_MAIN_VARIANT (mv2
);
1436 /* A null pointer instead of a type
1437 means there is supposed to be an argument
1438 but nothing is specified about what type it has.
1439 So match anything that self-promotes. */
1442 if (c_type_promotes_to (a2
) != a2
)
1447 if (c_type_promotes_to (a1
) != a1
)
1450 /* If one of the lists has an error marker, ignore this arg. */
1451 else if (TREE_CODE (a1
) == ERROR_MARK
1452 || TREE_CODE (a2
) == ERROR_MARK
)
1454 else if (!(newval
= comptypes_internal (mv1
, mv2
)))
1456 /* Allow wait (union {union wait *u; int *i} *)
1457 and wait (union wait *) to be compatible. */
1458 if (TREE_CODE (a1
) == UNION_TYPE
1459 && (TYPE_NAME (a1
) == 0
1460 || TYPE_TRANSPARENT_UNION (a1
))
1461 && TREE_CODE (TYPE_SIZE (a1
)) == INTEGER_CST
1462 && tree_int_cst_equal (TYPE_SIZE (a1
),
1466 for (memb
= TYPE_FIELDS (a1
);
1467 memb
; memb
= TREE_CHAIN (memb
))
1469 tree mv3
= TREE_TYPE (memb
);
1470 if (mv3
&& mv3
!= error_mark_node
1471 && TREE_CODE (mv3
) != ARRAY_TYPE
)
1472 mv3
= TYPE_MAIN_VARIANT (mv3
);
1473 if (comptypes_internal (mv3
, mv2
))
1479 else if (TREE_CODE (a2
) == UNION_TYPE
1480 && (TYPE_NAME (a2
) == 0
1481 || TYPE_TRANSPARENT_UNION (a2
))
1482 && TREE_CODE (TYPE_SIZE (a2
)) == INTEGER_CST
1483 && tree_int_cst_equal (TYPE_SIZE (a2
),
1487 for (memb
= TYPE_FIELDS (a2
);
1488 memb
; memb
= TREE_CHAIN (memb
))
1490 tree mv3
= TREE_TYPE (memb
);
1491 if (mv3
&& mv3
!= error_mark_node
1492 && TREE_CODE (mv3
) != ARRAY_TYPE
)
1493 mv3
= TYPE_MAIN_VARIANT (mv3
);
1494 if (comptypes_internal (mv3
, mv1
))
1504 /* comptypes said ok, but record if it said to warn. */
1508 args1
= TREE_CHAIN (args1
);
1509 args2
= TREE_CHAIN (args2
);
1513 /* Compute the size to increment a pointer by. */
1516 c_size_in_bytes (const_tree type
)
1518 enum tree_code code
= TREE_CODE (type
);
1520 if (code
== FUNCTION_TYPE
|| code
== VOID_TYPE
|| code
== ERROR_MARK
)
1521 return size_one_node
;
1523 if (!COMPLETE_OR_VOID_TYPE_P (type
))
1525 error ("arithmetic on pointer to an incomplete type");
1526 return size_one_node
;
1529 /* Convert in case a char is more than one unit. */
1530 return size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
1531 size_int (TYPE_PRECISION (char_type_node
)
1535 /* Return either DECL or its known constant value (if it has one). */
1538 decl_constant_value (tree decl
)
1540 if (/* Don't change a variable array bound or initial value to a constant
1541 in a place where a variable is invalid. Note that DECL_INITIAL
1542 isn't valid for a PARM_DECL. */
1543 current_function_decl
!= 0
1544 && TREE_CODE (decl
) != PARM_DECL
1545 && !TREE_THIS_VOLATILE (decl
)
1546 && TREE_READONLY (decl
)
1547 && DECL_INITIAL (decl
) != 0
1548 && TREE_CODE (DECL_INITIAL (decl
)) != ERROR_MARK
1549 /* This is invalid if initial value is not constant.
1550 If it has either a function call, a memory reference,
1551 or a variable, then re-evaluating it could give different results. */
1552 && TREE_CONSTANT (DECL_INITIAL (decl
))
1553 /* Check for cases where this is sub-optimal, even though valid. */
1554 && TREE_CODE (DECL_INITIAL (decl
)) != CONSTRUCTOR
)
1555 return DECL_INITIAL (decl
);
1559 /* Return either DECL or its known constant value (if it has one), but
1560 return DECL if pedantic or DECL has mode BLKmode. This is for
1561 bug-compatibility with the old behavior of decl_constant_value
1562 (before GCC 3.0); every use of this function is a bug and it should
1563 be removed before GCC 3.1. It is not appropriate to use pedantic
1564 in a way that affects optimization, and BLKmode is probably not the
1565 right test for avoiding misoptimizations either. */
1568 decl_constant_value_for_broken_optimization (tree decl
)
1572 if (pedantic
|| DECL_MODE (decl
) == BLKmode
)
1575 ret
= decl_constant_value (decl
);
1576 /* Avoid unwanted tree sharing between the initializer and current
1577 function's body where the tree can be modified e.g. by the
1579 if (ret
!= decl
&& TREE_STATIC (decl
))
1580 ret
= unshare_expr (ret
);
1584 /* Convert the array expression EXP to a pointer. */
1586 array_to_pointer_conversion (tree exp
)
1588 tree orig_exp
= exp
;
1589 tree type
= TREE_TYPE (exp
);
1591 tree restype
= TREE_TYPE (type
);
1594 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
1596 STRIP_TYPE_NOPS (exp
);
1598 if (TREE_NO_WARNING (orig_exp
))
1599 TREE_NO_WARNING (exp
) = 1;
1601 ptrtype
= build_pointer_type (restype
);
1603 if (TREE_CODE (exp
) == INDIRECT_REF
)
1604 return convert (ptrtype
, TREE_OPERAND (exp
, 0));
1606 if (TREE_CODE (exp
) == VAR_DECL
)
1608 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1609 ADDR_EXPR because it's the best way of representing what
1610 happens in C when we take the address of an array and place
1611 it in a pointer to the element type. */
1612 adr
= build1 (ADDR_EXPR
, ptrtype
, exp
);
1613 if (!c_mark_addressable (exp
))
1614 return error_mark_node
;
1615 TREE_SIDE_EFFECTS (adr
) = 0; /* Default would be, same as EXP. */
1619 /* This way is better for a COMPONENT_REF since it can
1620 simplify the offset for a component. */
1621 adr
= build_unary_op (ADDR_EXPR
, exp
, 1);
1622 return convert (ptrtype
, adr
);
1625 /* Convert the function expression EXP to a pointer. */
1627 function_to_pointer_conversion (tree exp
)
1629 tree orig_exp
= exp
;
1631 gcc_assert (TREE_CODE (TREE_TYPE (exp
)) == FUNCTION_TYPE
);
1633 STRIP_TYPE_NOPS (exp
);
1635 if (TREE_NO_WARNING (orig_exp
))
1636 TREE_NO_WARNING (exp
) = 1;
1638 return build_unary_op (ADDR_EXPR
, exp
, 0);
1641 /* Perform the default conversion of arrays and functions to pointers.
1642 Return the result of converting EXP. For any other expression, just
1643 return EXP after removing NOPs. */
1646 default_function_array_conversion (struct c_expr exp
)
1648 tree orig_exp
= exp
.value
;
1649 tree type
= TREE_TYPE (exp
.value
);
1650 enum tree_code code
= TREE_CODE (type
);
1656 bool not_lvalue
= false;
1657 bool lvalue_array_p
;
1659 while ((TREE_CODE (exp
.value
) == NON_LVALUE_EXPR
1660 || TREE_CODE (exp
.value
) == NOP_EXPR
1661 || TREE_CODE (exp
.value
) == CONVERT_EXPR
)
1662 && TREE_TYPE (TREE_OPERAND (exp
.value
, 0)) == type
)
1664 if (TREE_CODE (exp
.value
) == NON_LVALUE_EXPR
)
1666 exp
.value
= TREE_OPERAND (exp
.value
, 0);
1669 if (TREE_NO_WARNING (orig_exp
))
1670 TREE_NO_WARNING (exp
.value
) = 1;
1672 lvalue_array_p
= !not_lvalue
&& lvalue_p (exp
.value
);
1673 if (!flag_isoc99
&& !lvalue_array_p
)
1675 /* Before C99, non-lvalue arrays do not decay to pointers.
1676 Normally, using such an array would be invalid; but it can
1677 be used correctly inside sizeof or as a statement expression.
1678 Thus, do not give an error here; an error will result later. */
1682 exp
.value
= array_to_pointer_conversion (exp
.value
);
1686 exp
.value
= function_to_pointer_conversion (exp
.value
);
1689 STRIP_TYPE_NOPS (exp
.value
);
1690 if (TREE_NO_WARNING (orig_exp
))
1691 TREE_NO_WARNING (exp
.value
) = 1;
1699 /* EXP is an expression of integer type. Apply the integer promotions
1700 to it and return the promoted value. */
1703 perform_integral_promotions (tree exp
)
1705 tree type
= TREE_TYPE (exp
);
1706 enum tree_code code
= TREE_CODE (type
);
1708 gcc_assert (INTEGRAL_TYPE_P (type
));
1710 /* Normally convert enums to int,
1711 but convert wide enums to something wider. */
1712 if (code
== ENUMERAL_TYPE
)
1714 type
= c_common_type_for_size (MAX (TYPE_PRECISION (type
),
1715 TYPE_PRECISION (integer_type_node
)),
1716 ((TYPE_PRECISION (type
)
1717 >= TYPE_PRECISION (integer_type_node
))
1718 && TYPE_UNSIGNED (type
)));
1720 return convert (type
, exp
);
1723 /* ??? This should no longer be needed now bit-fields have their
1725 if (TREE_CODE (exp
) == COMPONENT_REF
1726 && DECL_C_BIT_FIELD (TREE_OPERAND (exp
, 1))
1727 /* If it's thinner than an int, promote it like a
1728 c_promoting_integer_type_p, otherwise leave it alone. */
1729 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp
, 1)),
1730 TYPE_PRECISION (integer_type_node
)))
1731 return convert (integer_type_node
, exp
);
1733 if (c_promoting_integer_type_p (type
))
1735 /* Preserve unsignedness if not really getting any wider. */
1736 if (TYPE_UNSIGNED (type
)
1737 && TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
))
1738 return convert (unsigned_type_node
, exp
);
1740 return convert (integer_type_node
, exp
);
1747 /* Perform default promotions for C data used in expressions.
1748 Enumeral types or short or char are converted to int.
1749 In addition, manifest constants symbols are replaced by their values. */
1752 default_conversion (tree exp
)
1755 tree type
= TREE_TYPE (exp
);
1756 enum tree_code code
= TREE_CODE (type
);
1758 /* Functions and arrays have been converted during parsing. */
1759 gcc_assert (code
!= FUNCTION_TYPE
);
1760 if (code
== ARRAY_TYPE
)
1763 /* Constants can be used directly unless they're not loadable. */
1764 if (TREE_CODE (exp
) == CONST_DECL
)
1765 exp
= DECL_INITIAL (exp
);
1767 /* Replace a nonvolatile const static variable with its value unless
1768 it is an array, in which case we must be sure that taking the
1769 address of the array produces consistent results. */
1770 else if (optimize
&& TREE_CODE (exp
) == VAR_DECL
&& code
!= ARRAY_TYPE
)
1772 exp
= decl_constant_value_for_broken_optimization (exp
);
1773 type
= TREE_TYPE (exp
);
1776 /* Strip no-op conversions. */
1778 STRIP_TYPE_NOPS (exp
);
1780 if (TREE_NO_WARNING (orig_exp
))
1781 TREE_NO_WARNING (exp
) = 1;
1783 if (code
== VOID_TYPE
)
1785 error ("void value not ignored as it ought to be");
1786 return error_mark_node
;
1789 exp
= require_complete_type (exp
);
1790 if (exp
== error_mark_node
)
1791 return error_mark_node
;
1793 if (INTEGRAL_TYPE_P (type
))
1794 return perform_integral_promotions (exp
);
1799 /* Look up COMPONENT in a structure or union DECL.
1801 If the component name is not found, returns NULL_TREE. Otherwise,
1802 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1803 stepping down the chain to the component, which is in the last
1804 TREE_VALUE of the list. Normally the list is of length one, but if
1805 the component is embedded within (nested) anonymous structures or
1806 unions, the list steps down the chain to the component. */
1809 lookup_field (tree decl
, tree component
)
1811 tree type
= TREE_TYPE (decl
);
1814 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1815 to the field elements. Use a binary search on this array to quickly
1816 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1817 will always be set for structures which have many elements. */
1819 if (TYPE_LANG_SPECIFIC (type
) && TYPE_LANG_SPECIFIC (type
)->s
)
1822 tree
*field_array
= &TYPE_LANG_SPECIFIC (type
)->s
->elts
[0];
1824 field
= TYPE_FIELDS (type
);
1826 top
= TYPE_LANG_SPECIFIC (type
)->s
->len
;
1827 while (top
- bot
> 1)
1829 half
= (top
- bot
+ 1) >> 1;
1830 field
= field_array
[bot
+half
];
1832 if (DECL_NAME (field
) == NULL_TREE
)
1834 /* Step through all anon unions in linear fashion. */
1835 while (DECL_NAME (field_array
[bot
]) == NULL_TREE
)
1837 field
= field_array
[bot
++];
1838 if (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
1839 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
1841 tree anon
= lookup_field (field
, component
);
1844 return tree_cons (NULL_TREE
, field
, anon
);
1848 /* Entire record is only anon unions. */
1852 /* Restart the binary search, with new lower bound. */
1856 if (DECL_NAME (field
) == component
)
1858 if (DECL_NAME (field
) < component
)
1864 if (DECL_NAME (field_array
[bot
]) == component
)
1865 field
= field_array
[bot
];
1866 else if (DECL_NAME (field
) != component
)
1871 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1873 if (DECL_NAME (field
) == NULL_TREE
1874 && (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
1875 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
))
1877 tree anon
= lookup_field (field
, component
);
1880 return tree_cons (NULL_TREE
, field
, anon
);
1883 if (DECL_NAME (field
) == component
)
1887 if (field
== NULL_TREE
)
1891 return tree_cons (NULL_TREE
, field
, NULL_TREE
);
1894 /* Make an expression to refer to the COMPONENT field of
1895 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1898 build_component_ref (tree datum
, tree component
)
1900 tree type
= TREE_TYPE (datum
);
1901 enum tree_code code
= TREE_CODE (type
);
1905 if (!objc_is_public (datum
, component
))
1906 return error_mark_node
;
1908 /* See if there is a field or component with name COMPONENT. */
1910 if (code
== RECORD_TYPE
|| code
== UNION_TYPE
)
1912 if (!COMPLETE_TYPE_P (type
))
1914 c_incomplete_type_error (NULL_TREE
, type
);
1915 return error_mark_node
;
1918 field
= lookup_field (datum
, component
);
1922 error ("%qT has no member named %qE", type
, component
);
1923 return error_mark_node
;
1926 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1927 This might be better solved in future the way the C++ front
1928 end does it - by giving the anonymous entities each a
1929 separate name and type, and then have build_component_ref
1930 recursively call itself. We can't do that here. */
1933 tree subdatum
= TREE_VALUE (field
);
1937 if (TREE_TYPE (subdatum
) == error_mark_node
)
1938 return error_mark_node
;
1940 quals
= TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum
)));
1941 quals
|= TYPE_QUALS (TREE_TYPE (datum
));
1942 subtype
= c_build_qualified_type (TREE_TYPE (subdatum
), quals
);
1944 ref
= build3 (COMPONENT_REF
, subtype
, datum
, subdatum
,
1946 if (TREE_READONLY (datum
) || TREE_READONLY (subdatum
))
1947 TREE_READONLY (ref
) = 1;
1948 if (TREE_THIS_VOLATILE (datum
) || TREE_THIS_VOLATILE (subdatum
))
1949 TREE_THIS_VOLATILE (ref
) = 1;
1951 if (TREE_DEPRECATED (subdatum
))
1952 warn_deprecated_use (subdatum
);
1956 field
= TREE_CHAIN (field
);
1962 else if (code
!= ERROR_MARK
)
1963 error ("request for member %qE in something not a structure or union",
1966 return error_mark_node
;
1969 /* Given an expression PTR for a pointer, return an expression
1970 for the value pointed to.
1971 ERRORSTRING is the name of the operator to appear in error messages. */
1974 build_indirect_ref (tree ptr
, const char *errorstring
)
1976 tree pointer
= default_conversion (ptr
);
1977 tree type
= TREE_TYPE (pointer
);
1979 if (TREE_CODE (type
) == POINTER_TYPE
)
1981 if (TREE_CODE (pointer
) == CONVERT_EXPR
1982 || TREE_CODE (pointer
) == NOP_EXPR
1983 || TREE_CODE (pointer
) == VIEW_CONVERT_EXPR
)
1985 /* If a warning is issued, mark it to avoid duplicates from
1986 the backend. This only needs to be done at
1987 warn_strict_aliasing > 2. */
1988 if (warn_strict_aliasing
> 2)
1989 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer
, 0)),
1990 type
, TREE_OPERAND (pointer
, 0)))
1991 TREE_NO_WARNING (pointer
) = 1;
1994 if (TREE_CODE (pointer
) == ADDR_EXPR
1995 && (TREE_TYPE (TREE_OPERAND (pointer
, 0))
1996 == TREE_TYPE (type
)))
1997 return TREE_OPERAND (pointer
, 0);
2000 tree t
= TREE_TYPE (type
);
2003 ref
= build1 (INDIRECT_REF
, t
, pointer
);
2005 if (!COMPLETE_OR_VOID_TYPE_P (t
) && TREE_CODE (t
) != ARRAY_TYPE
)
2007 error ("dereferencing pointer to incomplete type");
2008 return error_mark_node
;
2010 if (VOID_TYPE_P (t
) && skip_evaluation
== 0)
2011 warning (0, "dereferencing %<void *%> pointer");
2013 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2014 so that we get the proper error message if the result is used
2015 to assign to. Also, &* is supposed to be a no-op.
2016 And ANSI C seems to specify that the type of the result
2017 should be the const type. */
2018 /* A de-reference of a pointer to const is not a const. It is valid
2019 to change it via some other pointer. */
2020 TREE_READONLY (ref
) = TYPE_READONLY (t
);
2021 TREE_SIDE_EFFECTS (ref
)
2022 = TYPE_VOLATILE (t
) || TREE_SIDE_EFFECTS (pointer
);
2023 TREE_THIS_VOLATILE (ref
) = TYPE_VOLATILE (t
);
2027 else if (TREE_CODE (pointer
) != ERROR_MARK
)
2028 error ("invalid type argument of %qs (have %qT)", errorstring
, type
);
2029 return error_mark_node
;
2032 /* This handles expressions of the form "a[i]", which denotes
2035 This is logically equivalent in C to *(a+i), but we may do it differently.
2036 If A is a variable or a member, we generate a primitive ARRAY_REF.
2037 This avoids forcing the array out of registers, and can work on
2038 arrays that are not lvalues (for example, members of structures returned
2042 build_array_ref (tree array
, tree index
)
2044 bool swapped
= false;
2045 if (TREE_TYPE (array
) == error_mark_node
2046 || TREE_TYPE (index
) == error_mark_node
)
2047 return error_mark_node
;
2049 if (TREE_CODE (TREE_TYPE (array
)) != ARRAY_TYPE
2050 && TREE_CODE (TREE_TYPE (array
)) != POINTER_TYPE
)
2053 if (TREE_CODE (TREE_TYPE (index
)) != ARRAY_TYPE
2054 && TREE_CODE (TREE_TYPE (index
)) != POINTER_TYPE
)
2056 error ("subscripted value is neither array nor pointer");
2057 return error_mark_node
;
2065 if (!INTEGRAL_TYPE_P (TREE_TYPE (index
)))
2067 error ("array subscript is not an integer");
2068 return error_mark_node
;
2071 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array
))) == FUNCTION_TYPE
)
2073 error ("subscripted value is pointer to function");
2074 return error_mark_node
;
2077 /* ??? Existing practice has been to warn only when the char
2078 index is syntactically the index, not for char[array]. */
2080 warn_array_subscript_with_type_char (index
);
2082 /* Apply default promotions *after* noticing character types. */
2083 index
= default_conversion (index
);
2085 gcc_assert (TREE_CODE (TREE_TYPE (index
)) == INTEGER_TYPE
);
2087 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
2091 /* An array that is indexed by a non-constant
2092 cannot be stored in a register; we must be able to do
2093 address arithmetic on its address.
2094 Likewise an array of elements of variable size. */
2095 if (TREE_CODE (index
) != INTEGER_CST
2096 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2097 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
)))) != INTEGER_CST
))
2099 if (!c_mark_addressable (array
))
2100 return error_mark_node
;
2102 /* An array that is indexed by a constant value which is not within
2103 the array bounds cannot be stored in a register either; because we
2104 would get a crash in store_bit_field/extract_bit_field when trying
2105 to access a non-existent part of the register. */
2106 if (TREE_CODE (index
) == INTEGER_CST
2107 && TYPE_DOMAIN (TREE_TYPE (array
))
2108 && !int_fits_type_p (index
, TYPE_DOMAIN (TREE_TYPE (array
))))
2110 if (!c_mark_addressable (array
))
2111 return error_mark_node
;
2117 while (TREE_CODE (foo
) == COMPONENT_REF
)
2118 foo
= TREE_OPERAND (foo
, 0);
2119 if (TREE_CODE (foo
) == VAR_DECL
&& C_DECL_REGISTER (foo
))
2120 pedwarn ("ISO C forbids subscripting %<register%> array");
2121 else if (!flag_isoc99
&& !lvalue_p (foo
))
2122 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
2125 type
= TREE_TYPE (TREE_TYPE (array
));
2126 rval
= build4 (ARRAY_REF
, type
, array
, index
, NULL_TREE
, NULL_TREE
);
2127 /* Array ref is const/volatile if the array elements are
2128 or if the array is. */
2129 TREE_READONLY (rval
)
2130 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array
)))
2131 | TREE_READONLY (array
));
2132 TREE_SIDE_EFFECTS (rval
)
2133 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
2134 | TREE_SIDE_EFFECTS (array
));
2135 TREE_THIS_VOLATILE (rval
)
2136 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
2137 /* This was added by rms on 16 Nov 91.
2138 It fixes vol struct foo *a; a->elts[1]
2139 in an inline function.
2140 Hope it doesn't break something else. */
2141 | TREE_THIS_VOLATILE (array
));
2142 return require_complete_type (fold (rval
));
2146 tree ar
= default_conversion (array
);
2148 if (ar
== error_mark_node
)
2151 gcc_assert (TREE_CODE (TREE_TYPE (ar
)) == POINTER_TYPE
);
2152 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar
))) != FUNCTION_TYPE
);
2154 return build_indirect_ref (build_binary_op (PLUS_EXPR
, ar
, index
, 0),
2159 /* Build an external reference to identifier ID. FUN indicates
2160 whether this will be used for a function call. LOC is the source
2161 location of the identifier. */
2163 build_external_ref (tree id
, int fun
, location_t loc
)
2166 tree decl
= lookup_name (id
);
2168 /* In Objective-C, an instance variable (ivar) may be preferred to
2169 whatever lookup_name() found. */
2170 decl
= objc_lookup_ivar (decl
, id
);
2172 if (decl
&& decl
!= error_mark_node
)
2175 /* Implicit function declaration. */
2176 ref
= implicitly_declare (id
);
2177 else if (decl
== error_mark_node
)
2178 /* Don't complain about something that's already been
2179 complained about. */
2180 return error_mark_node
;
2183 undeclared_variable (id
, loc
);
2184 return error_mark_node
;
2187 if (TREE_TYPE (ref
) == error_mark_node
)
2188 return error_mark_node
;
2190 if (TREE_DEPRECATED (ref
))
2191 warn_deprecated_use (ref
);
2193 /* Recursive call does not count as usage. */
2194 if (ref
!= current_function_decl
)
2196 if (!skip_evaluation
)
2197 assemble_external (ref
);
2198 TREE_USED (ref
) = 1;
2201 if (TREE_CODE (ref
) == FUNCTION_DECL
&& !in_alignof
)
2203 if (!in_sizeof
&& !in_typeof
)
2204 C_DECL_USED (ref
) = 1;
2205 else if (DECL_INITIAL (ref
) == 0
2206 && DECL_EXTERNAL (ref
)
2207 && !TREE_PUBLIC (ref
))
2208 record_maybe_used_decl (ref
);
2211 if (TREE_CODE (ref
) == CONST_DECL
)
2213 used_types_insert (TREE_TYPE (ref
));
2214 ref
= DECL_INITIAL (ref
);
2215 TREE_CONSTANT (ref
) = 1;
2216 TREE_INVARIANT (ref
) = 1;
2218 else if (current_function_decl
!= 0
2219 && !DECL_FILE_SCOPE_P (current_function_decl
)
2220 && (TREE_CODE (ref
) == VAR_DECL
2221 || TREE_CODE (ref
) == PARM_DECL
2222 || TREE_CODE (ref
) == FUNCTION_DECL
))
2224 tree context
= decl_function_context (ref
);
2226 if (context
!= 0 && context
!= current_function_decl
)
2227 DECL_NONLOCAL (ref
) = 1;
2229 /* C99 6.7.4p3: An inline definition of a function with external
2230 linkage ... shall not contain a reference to an identifier with
2231 internal linkage. */
2232 else if (current_function_decl
!= 0
2233 && DECL_DECLARED_INLINE_P (current_function_decl
)
2234 && DECL_EXTERNAL (current_function_decl
)
2235 && VAR_OR_FUNCTION_DECL_P (ref
)
2236 && (TREE_CODE (ref
) != VAR_DECL
|| TREE_STATIC (ref
))
2237 && ! TREE_PUBLIC (ref
)
2238 && DECL_CONTEXT (ref
) != current_function_decl
)
2239 pedwarn ("%H%qD is static but used in inline function %qD "
2240 "which is not static", &loc
, ref
, current_function_decl
);
2245 /* Record details of decls possibly used inside sizeof or typeof. */
2246 struct maybe_used_decl
2250 /* The level seen at (in_sizeof + in_typeof). */
2252 /* The next one at this level or above, or NULL. */
2253 struct maybe_used_decl
*next
;
2256 static struct maybe_used_decl
*maybe_used_decls
;
2258 /* Record that DECL, an undefined static function reference seen
2259 inside sizeof or typeof, might be used if the operand of sizeof is
2260 a VLA type or the operand of typeof is a variably modified
2264 record_maybe_used_decl (tree decl
)
2266 struct maybe_used_decl
*t
= XOBNEW (&parser_obstack
, struct maybe_used_decl
);
2268 t
->level
= in_sizeof
+ in_typeof
;
2269 t
->next
= maybe_used_decls
;
2270 maybe_used_decls
= t
;
2273 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2274 USED is false, just discard them. If it is true, mark them used
2275 (if no longer inside sizeof or typeof) or move them to the next
2276 level up (if still inside sizeof or typeof). */
2279 pop_maybe_used (bool used
)
2281 struct maybe_used_decl
*p
= maybe_used_decls
;
2282 int cur_level
= in_sizeof
+ in_typeof
;
2283 while (p
&& p
->level
> cur_level
)
2288 C_DECL_USED (p
->decl
) = 1;
2290 p
->level
= cur_level
;
2294 if (!used
|| cur_level
== 0)
2295 maybe_used_decls
= p
;
2298 /* Return the result of sizeof applied to EXPR. */
2301 c_expr_sizeof_expr (struct c_expr expr
)
2304 if (expr
.value
== error_mark_node
)
2306 ret
.value
= error_mark_node
;
2307 ret
.original_code
= ERROR_MARK
;
2308 pop_maybe_used (false);
2312 ret
.value
= c_sizeof (TREE_TYPE (expr
.value
));
2313 ret
.original_code
= ERROR_MARK
;
2314 if (c_vla_type_p (TREE_TYPE (expr
.value
)))
2316 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2317 ret
.value
= build2 (COMPOUND_EXPR
, TREE_TYPE (ret
.value
), expr
.value
, ret
.value
);
2319 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr
.value
)));
2324 /* Return the result of sizeof applied to T, a structure for the type
2325 name passed to sizeof (rather than the type itself). */
2328 c_expr_sizeof_type (struct c_type_name
*t
)
2332 type
= groktypename (t
);
2333 ret
.value
= c_sizeof (type
);
2334 ret
.original_code
= ERROR_MARK
;
2335 pop_maybe_used (type
!= error_mark_node
2336 ? C_TYPE_VARIABLE_SIZE (type
) : false);
2340 /* Build a function call to function FUNCTION with parameters PARAMS.
2341 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2342 TREE_VALUE of each node is a parameter-expression.
2343 FUNCTION's data type may be a function type or a pointer-to-function. */
2346 build_function_call (tree function
, tree params
)
2348 tree fntype
, fundecl
= 0;
2349 tree name
= NULL_TREE
, result
;
2355 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2356 STRIP_TYPE_NOPS (function
);
2358 /* Convert anything with function type to a pointer-to-function. */
2359 if (TREE_CODE (function
) == FUNCTION_DECL
)
2361 /* Implement type-directed function overloading for builtins.
2362 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2363 handle all the type checking. The result is a complete expression
2364 that implements this function call. */
2365 tem
= resolve_overloaded_builtin (function
, params
);
2369 name
= DECL_NAME (function
);
2372 if (TREE_CODE (TREE_TYPE (function
)) == FUNCTION_TYPE
)
2373 function
= function_to_pointer_conversion (function
);
2375 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2376 expressions, like those used for ObjC messenger dispatches. */
2377 function
= objc_rewrite_function_call (function
, params
);
2379 fntype
= TREE_TYPE (function
);
2381 if (TREE_CODE (fntype
) == ERROR_MARK
)
2382 return error_mark_node
;
2384 if (!(TREE_CODE (fntype
) == POINTER_TYPE
2385 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
))
2387 error ("called object %qE is not a function", function
);
2388 return error_mark_node
;
2391 if (fundecl
&& TREE_THIS_VOLATILE (fundecl
))
2392 current_function_returns_abnormally
= 1;
2394 /* fntype now gets the type of function pointed to. */
2395 fntype
= TREE_TYPE (fntype
);
2397 /* Check that the function is called through a compatible prototype.
2398 If it is not, replace the call by a trap, wrapped up in a compound
2399 expression if necessary. This has the nice side-effect to prevent
2400 the tree-inliner from generating invalid assignment trees which may
2401 blow up in the RTL expander later. */
2402 if ((TREE_CODE (function
) == NOP_EXPR
2403 || TREE_CODE (function
) == CONVERT_EXPR
)
2404 && TREE_CODE (tem
= TREE_OPERAND (function
, 0)) == ADDR_EXPR
2405 && TREE_CODE (tem
= TREE_OPERAND (tem
, 0)) == FUNCTION_DECL
2406 && !comptypes (fntype
, TREE_TYPE (tem
)))
2408 tree return_type
= TREE_TYPE (fntype
);
2409 tree trap
= build_function_call (built_in_decls
[BUILT_IN_TRAP
],
2412 /* This situation leads to run-time undefined behavior. We can't,
2413 therefore, simply error unless we can prove that all possible
2414 executions of the program must execute the code. */
2415 warning (0, "function called through a non-compatible type");
2417 /* We can, however, treat "undefined" any way we please.
2418 Call abort to encourage the user to fix the program. */
2419 inform ("if this code is reached, the program will abort");
2421 if (VOID_TYPE_P (return_type
))
2427 if (AGGREGATE_TYPE_P (return_type
))
2428 rhs
= build_compound_literal (return_type
,
2429 build_constructor (return_type
, 0));
2431 rhs
= fold_convert (return_type
, integer_zero_node
);
2433 return build2 (COMPOUND_EXPR
, return_type
, trap
, rhs
);
2437 /* Convert the parameters to the types declared in the
2438 function prototype, or apply default promotions. */
2440 nargs
= list_length (params
);
2441 argarray
= (tree
*) alloca (nargs
* sizeof (tree
));
2442 nargs
= convert_arguments (nargs
, argarray
, TYPE_ARG_TYPES (fntype
),
2443 params
, function
, fundecl
);
2445 return error_mark_node
;
2447 /* Check that the arguments to the function are valid. */
2449 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
2450 TYPE_ARG_TYPES (fntype
));
2452 if (require_constant_value
)
2454 result
= fold_build_call_array_initializer (TREE_TYPE (fntype
),
2455 function
, nargs
, argarray
);
2456 if (TREE_CONSTANT (result
)
2457 && (name
== NULL_TREE
2458 || strncmp (IDENTIFIER_POINTER (name
), "__builtin_", 10) != 0))
2459 pedwarn_init ("initializer element is not constant");
2462 result
= fold_build_call_array (TREE_TYPE (fntype
),
2463 function
, nargs
, argarray
);
2465 if (VOID_TYPE_P (TREE_TYPE (result
)))
2467 return require_complete_type (result
);
2470 /* Convert the argument expressions in the list VALUES
2471 to the types in the list TYPELIST. The resulting arguments are
2472 stored in the array ARGARRAY which has size NARGS.
2474 If TYPELIST is exhausted, or when an element has NULL as its type,
2475 perform the default conversions.
2477 PARMLIST is the chain of parm decls for the function being called.
2478 It may be 0, if that info is not available.
2479 It is used only for generating error messages.
2481 FUNCTION is a tree for the called function. It is used only for
2482 error messages, where it is formatted with %qE.
2484 This is also where warnings about wrong number of args are generated.
2486 VALUES is a chain of TREE_LIST nodes with the elements of the list
2487 in the TREE_VALUE slots of those nodes.
2489 Returns the actual number of arguments processed (which may be less
2490 than NARGS in some error situations), or -1 on failure. */
2493 convert_arguments (int nargs
, tree
*argarray
,
2494 tree typelist
, tree values
, tree function
, tree fundecl
)
2496 tree typetail
, valtail
;
2498 const bool type_generic
= fundecl
2499 && lookup_attribute ("type generic", TYPE_ATTRIBUTES(TREE_TYPE (fundecl
)));
2502 /* Change pointer to function to the function itself for
2504 if (TREE_CODE (function
) == ADDR_EXPR
2505 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
2506 function
= TREE_OPERAND (function
, 0);
2508 /* Handle an ObjC selector specially for diagnostics. */
2509 selector
= objc_message_selector ();
2511 /* Scan the given expressions and types, producing individual
2512 converted arguments and storing them in ARGARRAY. */
2514 for (valtail
= values
, typetail
= typelist
, parmnum
= 0;
2516 valtail
= TREE_CHAIN (valtail
), parmnum
++)
2518 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
2519 tree val
= TREE_VALUE (valtail
);
2520 tree rname
= function
;
2521 int argnum
= parmnum
+ 1;
2522 const char *invalid_func_diag
;
2524 if (type
== void_type_node
)
2526 error ("too many arguments to function %qE", function
);
2530 if (selector
&& argnum
> 2)
2536 STRIP_TYPE_NOPS (val
);
2538 val
= require_complete_type (val
);
2542 /* Formal parm type is specified by a function prototype. */
2545 if (type
== error_mark_node
|| !COMPLETE_TYPE_P (type
))
2547 error ("type of formal parameter %d is incomplete", parmnum
+ 1);
2552 /* Optionally warn about conversions that
2553 differ from the default conversions. */
2554 if (warn_traditional_conversion
|| warn_traditional
)
2556 unsigned int formal_prec
= TYPE_PRECISION (type
);
2558 if (INTEGRAL_TYPE_P (type
)
2559 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
2560 warning (0, "passing argument %d of %qE as integer "
2561 "rather than floating due to prototype",
2563 if (INTEGRAL_TYPE_P (type
)
2564 && TREE_CODE (TREE_TYPE (val
)) == COMPLEX_TYPE
)
2565 warning (0, "passing argument %d of %qE as integer "
2566 "rather than complex due to prototype",
2568 else if (TREE_CODE (type
) == COMPLEX_TYPE
2569 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
2570 warning (0, "passing argument %d of %qE as complex "
2571 "rather than floating due to prototype",
2573 else if (TREE_CODE (type
) == REAL_TYPE
2574 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
2575 warning (0, "passing argument %d of %qE as floating "
2576 "rather than integer due to prototype",
2578 else if (TREE_CODE (type
) == COMPLEX_TYPE
2579 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
2580 warning (0, "passing argument %d of %qE as complex "
2581 "rather than integer due to prototype",
2583 else if (TREE_CODE (type
) == REAL_TYPE
2584 && TREE_CODE (TREE_TYPE (val
)) == COMPLEX_TYPE
)
2585 warning (0, "passing argument %d of %qE as floating "
2586 "rather than complex due to prototype",
2588 /* ??? At some point, messages should be written about
2589 conversions between complex types, but that's too messy
2591 else if (TREE_CODE (type
) == REAL_TYPE
2592 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
2594 /* Warn if any argument is passed as `float',
2595 since without a prototype it would be `double'. */
2596 if (formal_prec
== TYPE_PRECISION (float_type_node
)
2597 && type
!= dfloat32_type_node
)
2598 warning (0, "passing argument %d of %qE as %<float%> "
2599 "rather than %<double%> due to prototype",
2602 /* Warn if mismatch between argument and prototype
2603 for decimal float types. Warn of conversions with
2604 binary float types and of precision narrowing due to
2606 else if (type
!= TREE_TYPE (val
)
2607 && (type
== dfloat32_type_node
2608 || type
== dfloat64_type_node
2609 || type
== dfloat128_type_node
2610 || TREE_TYPE (val
) == dfloat32_type_node
2611 || TREE_TYPE (val
) == dfloat64_type_node
2612 || TREE_TYPE (val
) == dfloat128_type_node
)
2614 <= TYPE_PRECISION (TREE_TYPE (val
))
2615 || (type
== dfloat128_type_node
2617 != dfloat64_type_node
2619 != dfloat32_type_node
)))
2620 || (type
== dfloat64_type_node
2622 != dfloat32_type_node
))))
2623 warning (0, "passing argument %d of %qE as %qT "
2624 "rather than %qT due to prototype",
2625 argnum
, rname
, type
, TREE_TYPE (val
));
2628 /* Detect integer changing in width or signedness.
2629 These warnings are only activated with
2630 -Wtraditional-conversion, not with -Wtraditional. */
2631 else if (warn_traditional_conversion
&& INTEGRAL_TYPE_P (type
)
2632 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
2634 tree would_have_been
= default_conversion (val
);
2635 tree type1
= TREE_TYPE (would_have_been
);
2637 if (TREE_CODE (type
) == ENUMERAL_TYPE
2638 && (TYPE_MAIN_VARIANT (type
)
2639 == TYPE_MAIN_VARIANT (TREE_TYPE (val
))))
2640 /* No warning if function asks for enum
2641 and the actual arg is that enum type. */
2643 else if (formal_prec
!= TYPE_PRECISION (type1
))
2644 warning (OPT_Wtraditional_conversion
, "passing argument %d of %qE "
2645 "with different width due to prototype",
2647 else if (TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (type1
))
2649 /* Don't complain if the formal parameter type
2650 is an enum, because we can't tell now whether
2651 the value was an enum--even the same enum. */
2652 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
2654 else if (TREE_CODE (val
) == INTEGER_CST
2655 && int_fits_type_p (val
, type
))
2656 /* Change in signedness doesn't matter
2657 if a constant value is unaffected. */
2659 /* If the value is extended from a narrower
2660 unsigned type, it doesn't matter whether we
2661 pass it as signed or unsigned; the value
2662 certainly is the same either way. */
2663 else if (TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
)
2664 && TYPE_UNSIGNED (TREE_TYPE (val
)))
2666 else if (TYPE_UNSIGNED (type
))
2667 warning (OPT_Wtraditional_conversion
, "passing argument %d of %qE "
2668 "as unsigned due to prototype",
2671 warning (OPT_Wtraditional_conversion
, "passing argument %d of %qE "
2672 "as signed due to prototype", argnum
, rname
);
2676 parmval
= convert_for_assignment (type
, val
, ic_argpass
,
2680 if (targetm
.calls
.promote_prototypes (fundecl
? TREE_TYPE (fundecl
) : 0)
2681 && INTEGRAL_TYPE_P (type
)
2682 && (TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)))
2683 parmval
= default_conversion (parmval
);
2685 argarray
[parmnum
] = parmval
;
2687 else if (TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
2688 && (TYPE_PRECISION (TREE_TYPE (val
))
2689 < TYPE_PRECISION (double_type_node
))
2690 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val
))))
2693 argarray
[parmnum
] = val
;
2695 /* Convert `float' to `double'. */
2696 argarray
[parmnum
] = convert (double_type_node
, val
);
2698 else if ((invalid_func_diag
=
2699 targetm
.calls
.invalid_arg_for_unprototyped_fn (typelist
, fundecl
, val
)))
2701 error (invalid_func_diag
);
2705 /* Convert `short' and `char' to full-size `int'. */
2706 argarray
[parmnum
] = default_conversion (val
);
2709 typetail
= TREE_CHAIN (typetail
);
2712 gcc_assert (parmnum
== nargs
);
2714 if (typetail
!= 0 && TREE_VALUE (typetail
) != void_type_node
)
2716 error ("too few arguments to function %qE", function
);
2723 /* This is the entry point used by the parser to build unary operators
2724 in the input. CODE, a tree_code, specifies the unary operator, and
2725 ARG is the operand. For unary plus, the C parser currently uses
2726 CONVERT_EXPR for code. */
2729 parser_build_unary_op (enum tree_code code
, struct c_expr arg
)
2731 struct c_expr result
;
2733 result
.original_code
= ERROR_MARK
;
2734 result
.value
= build_unary_op (code
, arg
.value
, 0);
2736 if (TREE_OVERFLOW_P (result
.value
) && !TREE_OVERFLOW_P (arg
.value
))
2737 overflow_warning (result
.value
);
2742 /* This is the entry point used by the parser to build binary operators
2743 in the input. CODE, a tree_code, specifies the binary operator, and
2744 ARG1 and ARG2 are the operands. In addition to constructing the
2745 expression, we check for operands that were written with other binary
2746 operators in a way that is likely to confuse the user. */
2749 parser_build_binary_op (enum tree_code code
, struct c_expr arg1
,
2752 struct c_expr result
;
2754 enum tree_code code1
= arg1
.original_code
;
2755 enum tree_code code2
= arg2
.original_code
;
2757 result
.value
= build_binary_op (code
, arg1
.value
, arg2
.value
, 1);
2758 result
.original_code
= code
;
2760 if (TREE_CODE (result
.value
) == ERROR_MARK
)
2763 /* Check for cases such as x+y<<z which users are likely
2765 if (warn_parentheses
)
2766 warn_about_parentheses (code
, code1
, code2
);
2768 if (code1
!= tcc_comparison
)
2769 warn_logical_operator (code
, arg1
.value
, arg2
.value
);
2771 /* Warn about comparisons against string literals, with the exception
2772 of testing for equality or inequality of a string literal with NULL. */
2773 if (code
== EQ_EXPR
|| code
== NE_EXPR
)
2775 if ((code1
== STRING_CST
&& !integer_zerop (arg2
.value
))
2776 || (code2
== STRING_CST
&& !integer_zerop (arg1
.value
)))
2777 warning (OPT_Waddress
, "comparison with string literal results in unspecified behavior");
2779 else if (TREE_CODE_CLASS (code
) == tcc_comparison
2780 && (code1
== STRING_CST
|| code2
== STRING_CST
))
2781 warning (OPT_Waddress
, "comparison with string literal results in unspecified behavior");
2783 if (TREE_OVERFLOW_P (result
.value
)
2784 && !TREE_OVERFLOW_P (arg1
.value
)
2785 && !TREE_OVERFLOW_P (arg2
.value
))
2786 overflow_warning (result
.value
);
2791 /* Return a tree for the difference of pointers OP0 and OP1.
2792 The resulting tree has type int. */
2795 pointer_diff (tree op0
, tree op1
)
2797 tree restype
= ptrdiff_type_node
;
2799 tree target_type
= TREE_TYPE (TREE_TYPE (op0
));
2800 tree con0
, con1
, lit0
, lit1
;
2801 tree orig_op1
= op1
;
2803 if (pedantic
|| warn_pointer_arith
)
2805 if (TREE_CODE (target_type
) == VOID_TYPE
)
2806 pedwarn ("pointer of type %<void *%> used in subtraction");
2807 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
2808 pedwarn ("pointer to a function used in subtraction");
2811 /* If the conversion to ptrdiff_type does anything like widening or
2812 converting a partial to an integral mode, we get a convert_expression
2813 that is in the way to do any simplifications.
2814 (fold-const.c doesn't know that the extra bits won't be needed.
2815 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2816 different mode in place.)
2817 So first try to find a common term here 'by hand'; we want to cover
2818 at least the cases that occur in legal static initializers. */
2819 if ((TREE_CODE (op0
) == NOP_EXPR
|| TREE_CODE (op0
) == CONVERT_EXPR
)
2820 && (TYPE_PRECISION (TREE_TYPE (op0
))
2821 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0
, 0)))))
2822 con0
= TREE_OPERAND (op0
, 0);
2825 if ((TREE_CODE (op1
) == NOP_EXPR
|| TREE_CODE (op1
) == CONVERT_EXPR
)
2826 && (TYPE_PRECISION (TREE_TYPE (op1
))
2827 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1
, 0)))))
2828 con1
= TREE_OPERAND (op1
, 0);
2832 if (TREE_CODE (con0
) == PLUS_EXPR
)
2834 lit0
= TREE_OPERAND (con0
, 1);
2835 con0
= TREE_OPERAND (con0
, 0);
2838 lit0
= integer_zero_node
;
2840 if (TREE_CODE (con1
) == PLUS_EXPR
)
2842 lit1
= TREE_OPERAND (con1
, 1);
2843 con1
= TREE_OPERAND (con1
, 0);
2846 lit1
= integer_zero_node
;
2848 if (operand_equal_p (con0
, con1
, 0))
2855 /* First do the subtraction as integers;
2856 then drop through to build the divide operator.
2857 Do not do default conversions on the minus operator
2858 in case restype is a short type. */
2860 op0
= build_binary_op (MINUS_EXPR
, convert (restype
, op0
),
2861 convert (restype
, op1
), 0);
2862 /* This generates an error if op1 is pointer to incomplete type. */
2863 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1
))))
2864 error ("arithmetic on pointer to an incomplete type");
2866 /* This generates an error if op0 is pointer to incomplete type. */
2867 op1
= c_size_in_bytes (target_type
);
2869 /* Divide by the size, in easiest possible way. */
2870 return fold_build2 (EXACT_DIV_EXPR
, restype
, op0
, convert (restype
, op1
));
2873 /* Construct and perhaps optimize a tree representation
2874 for a unary operation. CODE, a tree_code, specifies the operation
2875 and XARG is the operand.
2876 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2877 the default promotions (such as from short to int).
2878 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2879 allows non-lvalues; this is only used to handle conversion of non-lvalue
2880 arrays to pointers in C99. */
2883 build_unary_op (enum tree_code code
, tree xarg
, int flag
)
2885 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2888 enum tree_code typecode
;
2890 int noconvert
= flag
;
2891 const char *invalid_op_diag
;
2893 if (code
!= ADDR_EXPR
)
2894 arg
= require_complete_type (arg
);
2896 typecode
= TREE_CODE (TREE_TYPE (arg
));
2897 if (typecode
== ERROR_MARK
)
2898 return error_mark_node
;
2899 if (typecode
== ENUMERAL_TYPE
|| typecode
== BOOLEAN_TYPE
)
2900 typecode
= INTEGER_TYPE
;
2902 if ((invalid_op_diag
2903 = targetm
.invalid_unary_op (code
, TREE_TYPE (xarg
))))
2905 error (invalid_op_diag
);
2906 return error_mark_node
;
2912 /* This is used for unary plus, because a CONVERT_EXPR
2913 is enough to prevent anybody from looking inside for
2914 associativity, but won't generate any code. */
2915 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2916 || typecode
== FIXED_POINT_TYPE
|| typecode
== COMPLEX_TYPE
2917 || typecode
== VECTOR_TYPE
))
2919 error ("wrong type argument to unary plus");
2920 return error_mark_node
;
2922 else if (!noconvert
)
2923 arg
= default_conversion (arg
);
2924 arg
= non_lvalue (arg
);
2928 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2929 || typecode
== FIXED_POINT_TYPE
|| typecode
== COMPLEX_TYPE
2930 || typecode
== VECTOR_TYPE
))
2932 error ("wrong type argument to unary minus");
2933 return error_mark_node
;
2935 else if (!noconvert
)
2936 arg
= default_conversion (arg
);
2940 /* ~ works on integer types and non float vectors. */
2941 if (typecode
== INTEGER_TYPE
2942 || (typecode
== VECTOR_TYPE
2943 && !VECTOR_FLOAT_TYPE_P (TREE_TYPE (arg
))))
2946 arg
= default_conversion (arg
);
2948 else if (typecode
== COMPLEX_TYPE
)
2952 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2954 arg
= default_conversion (arg
);
2958 error ("wrong type argument to bit-complement");
2959 return error_mark_node
;
2964 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
))
2966 error ("wrong type argument to abs");
2967 return error_mark_node
;
2969 else if (!noconvert
)
2970 arg
= default_conversion (arg
);
2974 /* Conjugating a real value is a no-op, but allow it anyway. */
2975 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2976 || typecode
== COMPLEX_TYPE
))
2978 error ("wrong type argument to conjugation");
2979 return error_mark_node
;
2981 else if (!noconvert
)
2982 arg
= default_conversion (arg
);
2985 case TRUTH_NOT_EXPR
:
2986 if (typecode
!= INTEGER_TYPE
&& typecode
!= FIXED_POINT_TYPE
2987 && typecode
!= REAL_TYPE
&& typecode
!= POINTER_TYPE
2988 && typecode
!= COMPLEX_TYPE
)
2990 error ("wrong type argument to unary exclamation mark");
2991 return error_mark_node
;
2993 arg
= c_objc_common_truthvalue_conversion (arg
);
2994 return invert_truthvalue (arg
);
2997 if (TREE_CODE (arg
) == COMPLEX_CST
)
2998 return TREE_REALPART (arg
);
2999 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3000 return fold_build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
3005 if (TREE_CODE (arg
) == COMPLEX_CST
)
3006 return TREE_IMAGPART (arg
);
3007 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
3008 return fold_build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
3010 return convert (TREE_TYPE (arg
), integer_zero_node
);
3012 case PREINCREMENT_EXPR
:
3013 case POSTINCREMENT_EXPR
:
3014 case PREDECREMENT_EXPR
:
3015 case POSTDECREMENT_EXPR
:
3017 /* Increment or decrement the real part of the value,
3018 and don't change the imaginary part. */
3019 if (typecode
== COMPLEX_TYPE
)
3024 pedwarn ("ISO C does not support %<++%> and %<--%>"
3025 " on complex types");
3027 arg
= stabilize_reference (arg
);
3028 real
= build_unary_op (REALPART_EXPR
, arg
, 1);
3029 imag
= build_unary_op (IMAGPART_EXPR
, arg
, 1);
3030 real
= build_unary_op (code
, real
, 1);
3031 if (real
== error_mark_node
|| imag
== error_mark_node
)
3032 return error_mark_node
;
3033 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
3037 /* Report invalid types. */
3039 if (typecode
!= POINTER_TYPE
&& typecode
!= FIXED_POINT_TYPE
3040 && typecode
!= INTEGER_TYPE
&& typecode
!= REAL_TYPE
)
3042 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
3043 error ("wrong type argument to increment");
3045 error ("wrong type argument to decrement");
3047 return error_mark_node
;
3052 tree result_type
= TREE_TYPE (arg
);
3054 arg
= get_unwidened (arg
, 0);
3055 argtype
= TREE_TYPE (arg
);
3057 /* Compute the increment. */
3059 if (typecode
== POINTER_TYPE
)
3061 /* If pointer target is an undefined struct,
3062 we just cannot know how to do the arithmetic. */
3063 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type
)))
3065 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
3066 error ("increment of pointer to unknown structure");
3068 error ("decrement of pointer to unknown structure");
3070 else if ((pedantic
|| warn_pointer_arith
)
3071 && (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
3072 || TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
))
3074 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
3075 pedwarn ("wrong type argument to increment");
3077 pedwarn ("wrong type argument to decrement");
3080 inc
= c_size_in_bytes (TREE_TYPE (result_type
));
3081 inc
= fold_convert (sizetype
, inc
);
3083 else if (FRACT_MODE_P (TYPE_MODE (result_type
)))
3085 /* For signed fract types, we invert ++ to -- or
3086 -- to ++, and change inc from 1 to -1, because
3087 it is not possible to represent 1 in signed fract constants.
3088 For unsigned fract types, the result always overflows and
3089 we get an undefined (original) or the maximum value. */
3090 if (code
== PREINCREMENT_EXPR
)
3091 code
= PREDECREMENT_EXPR
;
3092 else if (code
== PREDECREMENT_EXPR
)
3093 code
= PREINCREMENT_EXPR
;
3094 else if (code
== POSTINCREMENT_EXPR
)
3095 code
= POSTDECREMENT_EXPR
;
3096 else /* code == POSTDECREMENT_EXPR */
3097 code
= POSTINCREMENT_EXPR
;
3099 inc
= integer_minus_one_node
;
3100 inc
= convert (argtype
, inc
);
3104 inc
= integer_one_node
;
3105 inc
= convert (argtype
, inc
);
3108 /* Complain about anything else that is not a true lvalue. */
3109 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
3110 || code
== POSTINCREMENT_EXPR
)
3113 return error_mark_node
;
3115 /* Report a read-only lvalue. */
3116 if (TREE_READONLY (arg
))
3118 readonly_error (arg
,
3119 ((code
== PREINCREMENT_EXPR
3120 || code
== POSTINCREMENT_EXPR
)
3121 ? lv_increment
: lv_decrement
));
3122 return error_mark_node
;
3125 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
)
3126 val
= boolean_increment (code
, arg
);
3128 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
3129 TREE_SIDE_EFFECTS (val
) = 1;
3130 val
= convert (result_type
, val
);
3131 if (TREE_CODE (val
) != code
)
3132 TREE_NO_WARNING (val
) = 1;
3137 /* Note that this operation never does default_conversion. */
3139 /* Let &* cancel out to simplify resulting code. */
3140 if (TREE_CODE (arg
) == INDIRECT_REF
)
3142 /* Don't let this be an lvalue. */
3143 if (lvalue_p (TREE_OPERAND (arg
, 0)))
3144 return non_lvalue (TREE_OPERAND (arg
, 0));
3145 return TREE_OPERAND (arg
, 0);
3148 /* For &x[y], return x+y */
3149 if (TREE_CODE (arg
) == ARRAY_REF
)
3151 tree op0
= TREE_OPERAND (arg
, 0);
3152 if (!c_mark_addressable (op0
))
3153 return error_mark_node
;
3154 return build_binary_op (PLUS_EXPR
,
3155 (TREE_CODE (TREE_TYPE (op0
)) == ARRAY_TYPE
3156 ? array_to_pointer_conversion (op0
)
3158 TREE_OPERAND (arg
, 1), 1);
3161 /* Anything not already handled and not a true memory reference
3162 or a non-lvalue array is an error. */
3163 else if (typecode
!= FUNCTION_TYPE
&& !flag
3164 && !lvalue_or_else (arg
, lv_addressof
))
3165 return error_mark_node
;
3167 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3168 argtype
= TREE_TYPE (arg
);
3170 /* If the lvalue is const or volatile, merge that into the type
3171 to which the address will point. Note that you can't get a
3172 restricted pointer by taking the address of something, so we
3173 only have to deal with `const' and `volatile' here. */
3174 if ((DECL_P (arg
) || REFERENCE_CLASS_P (arg
))
3175 && (TREE_READONLY (arg
) || TREE_THIS_VOLATILE (arg
)))
3176 argtype
= c_build_type_variant (argtype
,
3177 TREE_READONLY (arg
),
3178 TREE_THIS_VOLATILE (arg
));
3180 if (!c_mark_addressable (arg
))
3181 return error_mark_node
;
3183 gcc_assert (TREE_CODE (arg
) != COMPONENT_REF
3184 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)));
3186 argtype
= build_pointer_type (argtype
);
3188 /* ??? Cope with user tricks that amount to offsetof. Delete this
3189 when we have proper support for integer constant expressions. */
3190 val
= get_base_address (arg
);
3191 if (val
&& TREE_CODE (val
) == INDIRECT_REF
3192 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
3194 tree op0
= fold_convert (sizetype
, fold_offsetof (arg
, val
)), op1
;
3196 op1
= fold_convert (argtype
, TREE_OPERAND (val
, 0));
3197 return fold_build2 (POINTER_PLUS_EXPR
, argtype
, op1
, op0
);
3200 val
= build1 (ADDR_EXPR
, argtype
, arg
);
3209 argtype
= TREE_TYPE (arg
);
3210 return require_constant_value
? fold_build1_initializer (code
, argtype
, arg
)
3211 : fold_build1 (code
, argtype
, arg
);
3214 /* Return nonzero if REF is an lvalue valid for this language.
3215 Lvalues can be assigned, unless their type has TYPE_READONLY.
3216 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3219 lvalue_p (const_tree ref
)
3221 const enum tree_code code
= TREE_CODE (ref
);
3228 return lvalue_p (TREE_OPERAND (ref
, 0));
3230 case COMPOUND_LITERAL_EXPR
:
3240 return (TREE_CODE (TREE_TYPE (ref
)) != FUNCTION_TYPE
3241 && TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
);
3244 return TREE_CODE (TREE_TYPE (ref
)) == ARRAY_TYPE
;
3251 /* Give an error for storing in something that is 'const'. */
3254 readonly_error (tree arg
, enum lvalue_use use
)
3256 gcc_assert (use
== lv_assign
|| use
== lv_increment
|| use
== lv_decrement
3258 /* Using this macro rather than (for example) arrays of messages
3259 ensures that all the format strings are checked at compile
3261 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3262 : (use == lv_increment ? (I) \
3263 : (use == lv_decrement ? (D) : (AS))))
3264 if (TREE_CODE (arg
) == COMPONENT_REF
)
3266 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg
, 0))))
3267 readonly_error (TREE_OPERAND (arg
, 0), use
);
3269 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3270 G_("increment of read-only member %qD"),
3271 G_("decrement of read-only member %qD"),
3272 G_("read-only member %qD used as %<asm%> output")),
3273 TREE_OPERAND (arg
, 1));
3275 else if (TREE_CODE (arg
) == VAR_DECL
)
3276 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3277 G_("increment of read-only variable %qD"),
3278 G_("decrement of read-only variable %qD"),
3279 G_("read-only variable %qD used as %<asm%> output")),
3282 error (READONLY_MSG (G_("assignment of read-only location %qE"),
3283 G_("increment of read-only location %qE"),
3284 G_("decrement of read-only location %qE"),
3285 G_("read-only location %qE used as %<asm%> output")),
3290 /* Return nonzero if REF is an lvalue valid for this language;
3291 otherwise, print an error message and return zero. USE says
3292 how the lvalue is being used and so selects the error message. */
3295 lvalue_or_else (const_tree ref
, enum lvalue_use use
)
3297 int win
= lvalue_p (ref
);
3305 /* Mark EXP saying that we need to be able to take the
3306 address of it; it should not be allocated in a register.
3307 Returns true if successful. */
3310 c_mark_addressable (tree exp
)
3315 switch (TREE_CODE (x
))
3318 if (DECL_C_BIT_FIELD (TREE_OPERAND (x
, 1)))
3321 ("cannot take address of bit-field %qD", TREE_OPERAND (x
, 1));
3325 /* ... fall through ... */
3331 x
= TREE_OPERAND (x
, 0);
3334 case COMPOUND_LITERAL_EXPR
:
3336 TREE_ADDRESSABLE (x
) = 1;
3343 if (C_DECL_REGISTER (x
)
3344 && DECL_NONLOCAL (x
))
3346 if (TREE_PUBLIC (x
) || TREE_STATIC (x
) || DECL_EXTERNAL (x
))
3349 ("global register variable %qD used in nested function", x
);
3352 pedwarn ("register variable %qD used in nested function", x
);
3354 else if (C_DECL_REGISTER (x
))
3356 if (TREE_PUBLIC (x
) || TREE_STATIC (x
) || DECL_EXTERNAL (x
))
3357 error ("address of global register variable %qD requested", x
);
3359 error ("address of register variable %qD requested", x
);
3365 TREE_ADDRESSABLE (x
) = 1;
3372 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3375 build_conditional_expr (tree ifexp
, tree op1
, tree op2
)
3379 enum tree_code code1
;
3380 enum tree_code code2
;
3381 tree result_type
= NULL
;
3382 tree orig_op1
= op1
, orig_op2
= op2
;
3384 /* Promote both alternatives. */
3386 if (TREE_CODE (TREE_TYPE (op1
)) != VOID_TYPE
)
3387 op1
= default_conversion (op1
);
3388 if (TREE_CODE (TREE_TYPE (op2
)) != VOID_TYPE
)
3389 op2
= default_conversion (op2
);
3391 if (TREE_CODE (ifexp
) == ERROR_MARK
3392 || TREE_CODE (TREE_TYPE (op1
)) == ERROR_MARK
3393 || TREE_CODE (TREE_TYPE (op2
)) == ERROR_MARK
)
3394 return error_mark_node
;
3396 type1
= TREE_TYPE (op1
);
3397 code1
= TREE_CODE (type1
);
3398 type2
= TREE_TYPE (op2
);
3399 code2
= TREE_CODE (type2
);
3401 /* C90 does not permit non-lvalue arrays in conditional expressions.
3402 In C99 they will be pointers by now. */
3403 if (code1
== ARRAY_TYPE
|| code2
== ARRAY_TYPE
)
3405 error ("non-lvalue array in conditional expression");
3406 return error_mark_node
;
3409 /* Quickly detect the usual case where op1 and op2 have the same type
3411 if (TYPE_MAIN_VARIANT (type1
) == TYPE_MAIN_VARIANT (type2
))
3414 result_type
= type1
;
3416 result_type
= TYPE_MAIN_VARIANT (type1
);
3418 else if ((code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3419 || code1
== COMPLEX_TYPE
)
3420 && (code2
== INTEGER_TYPE
|| code2
== REAL_TYPE
3421 || code2
== COMPLEX_TYPE
))
3423 result_type
= c_common_type (type1
, type2
);
3425 /* If -Wsign-compare, warn here if type1 and type2 have
3426 different signedness. We'll promote the signed to unsigned
3427 and later code won't know it used to be different.
3428 Do this check on the original types, so that explicit casts
3429 will be considered, but default promotions won't. */
3430 if (warn_sign_compare
&& !skip_evaluation
)
3432 int unsigned_op1
= TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
3433 int unsigned_op2
= TYPE_UNSIGNED (TREE_TYPE (orig_op2
));
3435 if (unsigned_op1
^ unsigned_op2
)
3439 /* Do not warn if the result type is signed, since the
3440 signed type will only be chosen if it can represent
3441 all the values of the unsigned type. */
3442 if (!TYPE_UNSIGNED (result_type
))
3444 /* Do not warn if the signed quantity is an unsuffixed
3445 integer literal (or some static constant expression
3446 involving such literals) and it is non-negative. */
3447 else if ((unsigned_op2
3448 && tree_expr_nonnegative_warnv_p (op1
, &ovf
))
3450 && tree_expr_nonnegative_warnv_p (op2
, &ovf
)))
3453 warning (OPT_Wsign_compare
, "signed and unsigned type in conditional expression");
3457 else if (code1
== VOID_TYPE
|| code2
== VOID_TYPE
)
3459 if (pedantic
&& (code1
!= VOID_TYPE
|| code2
!= VOID_TYPE
))
3460 pedwarn ("ISO C forbids conditional expr with only one void side");
3461 result_type
= void_type_node
;
3463 else if (code1
== POINTER_TYPE
&& code2
== POINTER_TYPE
)
3465 if (comp_target_types (type1
, type2
))
3466 result_type
= common_pointer_type (type1
, type2
);
3467 else if (null_pointer_constant_p (orig_op1
))
3468 result_type
= qualify_type (type2
, type1
);
3469 else if (null_pointer_constant_p (orig_op2
))
3470 result_type
= qualify_type (type1
, type2
);
3471 else if (VOID_TYPE_P (TREE_TYPE (type1
)))
3473 if (pedantic
&& TREE_CODE (TREE_TYPE (type2
)) == FUNCTION_TYPE
)
3474 pedwarn ("ISO C forbids conditional expr between "
3475 "%<void *%> and function pointer");
3476 result_type
= build_pointer_type (qualify_type (TREE_TYPE (type1
),
3477 TREE_TYPE (type2
)));
3479 else if (VOID_TYPE_P (TREE_TYPE (type2
)))
3481 if (pedantic
&& TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
)
3482 pedwarn ("ISO C forbids conditional expr between "
3483 "%<void *%> and function pointer");
3484 result_type
= build_pointer_type (qualify_type (TREE_TYPE (type2
),
3485 TREE_TYPE (type1
)));
3489 pedwarn ("pointer type mismatch in conditional expression");
3490 result_type
= build_pointer_type (void_type_node
);
3493 else if (code1
== POINTER_TYPE
&& code2
== INTEGER_TYPE
)
3495 if (!null_pointer_constant_p (orig_op2
))
3496 pedwarn ("pointer/integer type mismatch in conditional expression");
3499 op2
= null_pointer_node
;
3501 result_type
= type1
;
3503 else if (code2
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3505 if (!null_pointer_constant_p (orig_op1
))
3506 pedwarn ("pointer/integer type mismatch in conditional expression");
3509 op1
= null_pointer_node
;
3511 result_type
= type2
;
3516 if (flag_cond_mismatch
)
3517 result_type
= void_type_node
;
3520 error ("type mismatch in conditional expression");
3521 return error_mark_node
;
3525 /* Merge const and volatile flags of the incoming types. */
3527 = build_type_variant (result_type
,
3528 TREE_READONLY (op1
) || TREE_READONLY (op2
),
3529 TREE_THIS_VOLATILE (op1
) || TREE_THIS_VOLATILE (op2
));
3531 if (result_type
!= TREE_TYPE (op1
))
3532 op1
= convert_and_check (result_type
, op1
);
3533 if (result_type
!= TREE_TYPE (op2
))
3534 op2
= convert_and_check (result_type
, op2
);
3536 return fold_build3 (COND_EXPR
, result_type
, ifexp
, op1
, op2
);
3539 /* Return a compound expression that performs two expressions and
3540 returns the value of the second of them. */
3543 build_compound_expr (tree expr1
, tree expr2
)
3545 if (!TREE_SIDE_EFFECTS (expr1
))
3547 /* The left-hand operand of a comma expression is like an expression
3548 statement: with -Wunused, we should warn if it doesn't have
3549 any side-effects, unless it was explicitly cast to (void). */
3550 if (warn_unused_value
)
3552 if (VOID_TYPE_P (TREE_TYPE (expr1
))
3553 && (TREE_CODE (expr1
) == NOP_EXPR
3554 || TREE_CODE (expr1
) == CONVERT_EXPR
))
3556 else if (VOID_TYPE_P (TREE_TYPE (expr1
))
3557 && TREE_CODE (expr1
) == COMPOUND_EXPR
3558 && (TREE_CODE (TREE_OPERAND (expr1
, 1)) == CONVERT_EXPR
3559 || TREE_CODE (TREE_OPERAND (expr1
, 1)) == NOP_EXPR
))
3560 ; /* (void) a, (void) b, c */
3562 warning (OPT_Wunused_value
,
3563 "left-hand operand of comma expression has no effect");
3567 /* With -Wunused, we should also warn if the left-hand operand does have
3568 side-effects, but computes a value which is not used. For example, in
3569 `foo() + bar(), baz()' the result of the `+' operator is not used,
3570 so we should issue a warning. */
3571 else if (warn_unused_value
)
3572 warn_if_unused_value (expr1
, input_location
);
3574 if (expr2
== error_mark_node
)
3575 return error_mark_node
;
3577 return build2 (COMPOUND_EXPR
, TREE_TYPE (expr2
), expr1
, expr2
);
3580 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3583 build_c_cast (tree type
, tree expr
)
3587 if (type
== error_mark_node
|| expr
== error_mark_node
)
3588 return error_mark_node
;
3590 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3591 only in <protocol> qualifications. But when constructing cast expressions,
3592 the protocols do matter and must be kept around. */
3593 if (objc_is_object_ptr (type
) && objc_is_object_ptr (TREE_TYPE (expr
)))
3594 return build1 (NOP_EXPR
, type
, expr
);
3596 type
= TYPE_MAIN_VARIANT (type
);
3598 if (TREE_CODE (type
) == ARRAY_TYPE
)
3600 error ("cast specifies array type");
3601 return error_mark_node
;
3604 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3606 error ("cast specifies function type");
3607 return error_mark_node
;
3610 if (!VOID_TYPE_P (type
))
3612 value
= require_complete_type (value
);
3613 if (value
== error_mark_node
)
3614 return error_mark_node
;
3617 if (type
== TYPE_MAIN_VARIANT (TREE_TYPE (value
)))
3621 if (TREE_CODE (type
) == RECORD_TYPE
3622 || TREE_CODE (type
) == UNION_TYPE
)
3623 pedwarn ("ISO C forbids casting nonscalar to the same type");
3626 else if (TREE_CODE (type
) == UNION_TYPE
)
3630 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
3631 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field
)),
3632 TYPE_MAIN_VARIANT (TREE_TYPE (value
))))
3640 pedwarn ("ISO C forbids casts to union type");
3641 t
= digest_init (type
,
3642 build_constructor_single (type
, field
, value
),
3644 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
3645 TREE_INVARIANT (t
) = TREE_INVARIANT (value
);
3648 error ("cast to union type from type not present in union");
3649 return error_mark_node
;
3655 if (type
== void_type_node
)
3656 return build1 (CONVERT_EXPR
, type
, value
);
3658 otype
= TREE_TYPE (value
);
3660 /* Optionally warn about potentially worrisome casts. */
3663 && TREE_CODE (type
) == POINTER_TYPE
3664 && TREE_CODE (otype
) == POINTER_TYPE
)
3666 tree in_type
= type
;
3667 tree in_otype
= otype
;
3671 /* Check that the qualifiers on IN_TYPE are a superset of
3672 the qualifiers of IN_OTYPE. The outermost level of
3673 POINTER_TYPE nodes is uninteresting and we stop as soon
3674 as we hit a non-POINTER_TYPE node on either type. */
3677 in_otype
= TREE_TYPE (in_otype
);
3678 in_type
= TREE_TYPE (in_type
);
3680 /* GNU C allows cv-qualified function types. 'const'
3681 means the function is very pure, 'volatile' means it
3682 can't return. We need to warn when such qualifiers
3683 are added, not when they're taken away. */
3684 if (TREE_CODE (in_otype
) == FUNCTION_TYPE
3685 && TREE_CODE (in_type
) == FUNCTION_TYPE
)
3686 added
|= (TYPE_QUALS (in_type
) & ~TYPE_QUALS (in_otype
));
3688 discarded
|= (TYPE_QUALS (in_otype
) & ~TYPE_QUALS (in_type
));
3690 while (TREE_CODE (in_type
) == POINTER_TYPE
3691 && TREE_CODE (in_otype
) == POINTER_TYPE
);
3694 warning (OPT_Wcast_qual
, "cast adds new qualifiers to function type");
3697 /* There are qualifiers present in IN_OTYPE that are not
3698 present in IN_TYPE. */
3699 warning (OPT_Wcast_qual
, "cast discards qualifiers from pointer target type");
3702 /* Warn about possible alignment problems. */
3703 if (STRICT_ALIGNMENT
3704 && TREE_CODE (type
) == POINTER_TYPE
3705 && TREE_CODE (otype
) == POINTER_TYPE
3706 && TREE_CODE (TREE_TYPE (otype
)) != VOID_TYPE
3707 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
3708 /* Don't warn about opaque types, where the actual alignment
3709 restriction is unknown. */
3710 && !((TREE_CODE (TREE_TYPE (otype
)) == UNION_TYPE
3711 || TREE_CODE (TREE_TYPE (otype
)) == RECORD_TYPE
)
3712 && TYPE_MODE (TREE_TYPE (otype
)) == VOIDmode
)
3713 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (otype
)))
3714 warning (OPT_Wcast_align
,
3715 "cast increases required alignment of target type");
3717 if (TREE_CODE (type
) == INTEGER_TYPE
3718 && TREE_CODE (otype
) == POINTER_TYPE
3719 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
))
3720 /* Unlike conversion of integers to pointers, where the
3721 warning is disabled for converting constants because
3722 of cases such as SIG_*, warn about converting constant
3723 pointers to integers. In some cases it may cause unwanted
3724 sign extension, and a warning is appropriate. */
3725 warning (OPT_Wpointer_to_int_cast
,
3726 "cast from pointer to integer of different size");
3728 if (TREE_CODE (value
) == CALL_EXPR
3729 && TREE_CODE (type
) != TREE_CODE (otype
))
3730 warning (OPT_Wbad_function_cast
, "cast from function call of type %qT "
3731 "to non-matching type %qT", otype
, type
);
3733 if (TREE_CODE (type
) == POINTER_TYPE
3734 && TREE_CODE (otype
) == INTEGER_TYPE
3735 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
3736 /* Don't warn about converting any constant. */
3737 && !TREE_CONSTANT (value
))
3738 warning (OPT_Wint_to_pointer_cast
, "cast to pointer from integer "
3739 "of different size");
3741 if (warn_strict_aliasing
<= 2)
3742 strict_aliasing_warning (otype
, type
, expr
);
3744 /* If pedantic, warn for conversions between function and object
3745 pointer types, except for converting a null pointer constant
3746 to function pointer type. */
3748 && TREE_CODE (type
) == POINTER_TYPE
3749 && TREE_CODE (otype
) == POINTER_TYPE
3750 && TREE_CODE (TREE_TYPE (otype
)) == FUNCTION_TYPE
3751 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
3752 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3755 && TREE_CODE (type
) == POINTER_TYPE
3756 && TREE_CODE (otype
) == POINTER_TYPE
3757 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
3758 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
3759 && !null_pointer_constant_p (value
))
3760 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3763 value
= convert (type
, value
);
3765 /* Ignore any integer overflow caused by the cast. */
3766 if (TREE_CODE (value
) == INTEGER_CST
)
3768 if (CONSTANT_CLASS_P (ovalue
) && TREE_OVERFLOW (ovalue
))
3770 if (!TREE_OVERFLOW (value
))
3772 /* Avoid clobbering a shared constant. */
3773 value
= copy_node (value
);
3774 TREE_OVERFLOW (value
) = TREE_OVERFLOW (ovalue
);
3777 else if (TREE_OVERFLOW (value
))
3778 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3779 value
= build_int_cst_wide (TREE_TYPE (value
),
3780 TREE_INT_CST_LOW (value
),
3781 TREE_INT_CST_HIGH (value
));
3785 /* Don't let a cast be an lvalue. */
3787 value
= non_lvalue (value
);
3792 /* Interpret a cast of expression EXPR to type TYPE. */
3794 c_cast_expr (struct c_type_name
*type_name
, tree expr
)
3797 int saved_wsp
= warn_strict_prototypes
;
3799 /* This avoids warnings about unprototyped casts on
3800 integers. E.g. "#define SIG_DFL (void(*)())0". */
3801 if (TREE_CODE (expr
) == INTEGER_CST
)
3802 warn_strict_prototypes
= 0;
3803 type
= groktypename (type_name
);
3804 warn_strict_prototypes
= saved_wsp
;
3806 return build_c_cast (type
, expr
);
3809 /* Build an assignment expression of lvalue LHS from value RHS.
3810 MODIFYCODE is the code for a binary operator that we use
3811 to combine the old value of LHS with RHS to get the new value.
3812 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3815 build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
)
3819 tree lhstype
= TREE_TYPE (lhs
);
3820 tree olhstype
= lhstype
;
3822 /* Types that aren't fully specified cannot be used in assignments. */
3823 lhs
= require_complete_type (lhs
);
3825 /* Avoid duplicate error messages from operands that had errors. */
3826 if (TREE_CODE (lhs
) == ERROR_MARK
|| TREE_CODE (rhs
) == ERROR_MARK
)
3827 return error_mark_node
;
3829 if (!lvalue_or_else (lhs
, lv_assign
))
3830 return error_mark_node
;
3832 STRIP_TYPE_NOPS (rhs
);
3836 /* If a binary op has been requested, combine the old LHS value with the RHS
3837 producing the value we should actually store into the LHS. */
3839 if (modifycode
!= NOP_EXPR
)
3841 lhs
= stabilize_reference (lhs
);
3842 newrhs
= build_binary_op (modifycode
, lhs
, rhs
, 1);
3845 /* Give an error for storing in something that is 'const'. */
3847 if (TREE_READONLY (lhs
) || TYPE_READONLY (lhstype
)
3848 || ((TREE_CODE (lhstype
) == RECORD_TYPE
3849 || TREE_CODE (lhstype
) == UNION_TYPE
)
3850 && C_TYPE_FIELDS_READONLY (lhstype
)))
3852 readonly_error (lhs
, lv_assign
);
3853 return error_mark_node
;
3856 /* If storing into a structure or union member,
3857 it has probably been given type `int'.
3858 Compute the type that would go with
3859 the actual amount of storage the member occupies. */
3861 if (TREE_CODE (lhs
) == COMPONENT_REF
3862 && (TREE_CODE (lhstype
) == INTEGER_TYPE
3863 || TREE_CODE (lhstype
) == BOOLEAN_TYPE
3864 || TREE_CODE (lhstype
) == REAL_TYPE
3865 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
3866 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
3868 /* If storing in a field that is in actuality a short or narrower than one,
3869 we must store in the field in its actual type. */
3871 if (lhstype
!= TREE_TYPE (lhs
))
3873 lhs
= copy_node (lhs
);
3874 TREE_TYPE (lhs
) = lhstype
;
3877 /* Convert new value to destination type. */
3879 newrhs
= convert_for_assignment (lhstype
, newrhs
, ic_assign
,
3880 NULL_TREE
, NULL_TREE
, 0);
3881 if (TREE_CODE (newrhs
) == ERROR_MARK
)
3882 return error_mark_node
;
3884 /* Emit ObjC write barrier, if necessary. */
3885 if (c_dialect_objc () && flag_objc_gc
)
3887 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
3892 /* Scan operands. */
3894 result
= build2 (MODIFY_EXPR
, lhstype
, lhs
, newrhs
);
3895 TREE_SIDE_EFFECTS (result
) = 1;
3897 /* If we got the LHS in a different type for storing in,
3898 convert the result back to the nominal type of LHS
3899 so that the value we return always has the same type
3900 as the LHS argument. */
3902 if (olhstype
== TREE_TYPE (result
))
3904 return convert_for_assignment (olhstype
, result
, ic_assign
,
3905 NULL_TREE
, NULL_TREE
, 0);
3908 /* Convert value RHS to type TYPE as preparation for an assignment
3909 to an lvalue of type TYPE.
3910 The real work of conversion is done by `convert'.
3911 The purpose of this function is to generate error messages
3912 for assignments that are not allowed in C.
3913 ERRTYPE says whether it is argument passing, assignment,
3914 initialization or return.
3916 FUNCTION is a tree for the function being called.
3917 PARMNUM is the number of the argument, for printing in error messages. */
3920 convert_for_assignment (tree type
, tree rhs
, enum impl_conv errtype
,
3921 tree fundecl
, tree function
, int parmnum
)
3923 enum tree_code codel
= TREE_CODE (type
);
3925 enum tree_code coder
;
3926 tree rname
= NULL_TREE
;
3927 bool objc_ok
= false;
3929 if (errtype
== ic_argpass
|| errtype
== ic_argpass_nonproto
)
3932 /* Change pointer to function to the function itself for
3934 if (TREE_CODE (function
) == ADDR_EXPR
3935 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
3936 function
= TREE_OPERAND (function
, 0);
3938 /* Handle an ObjC selector specially for diagnostics. */
3939 selector
= objc_message_selector ();
3941 if (selector
&& parmnum
> 2)
3948 /* This macro is used to emit diagnostics to ensure that all format
3949 strings are complete sentences, visible to gettext and checked at
3951 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3956 pedwarn (AR, parmnum, rname); \
3958 case ic_argpass_nonproto: \
3959 warning (0, AR, parmnum, rname); \
3971 gcc_unreachable (); \
3975 STRIP_TYPE_NOPS (rhs
);
3977 if (optimize
&& TREE_CODE (rhs
) == VAR_DECL
3978 && TREE_CODE (TREE_TYPE (rhs
)) != ARRAY_TYPE
)
3979 rhs
= decl_constant_value_for_broken_optimization (rhs
);
3981 rhstype
= TREE_TYPE (rhs
);
3982 coder
= TREE_CODE (rhstype
);
3984 if (coder
== ERROR_MARK
)
3985 return error_mark_node
;
3987 if (c_dialect_objc ())
4010 objc_ok
= objc_compare_types (type
, rhstype
, parmno
, rname
);
4013 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (rhstype
))
4016 if (coder
== VOID_TYPE
)
4018 /* Except for passing an argument to an unprototyped function,
4019 this is a constraint violation. When passing an argument to
4020 an unprototyped function, it is compile-time undefined;
4021 making it a constraint in that case was rejected in
4023 error ("void value not ignored as it ought to be");
4024 return error_mark_node
;
4026 rhs
= require_complete_type (rhs
);
4027 if (rhs
== error_mark_node
)
4028 return error_mark_node
;
4029 /* A type converts to a reference to it.
4030 This code doesn't fully support references, it's just for the
4031 special case of va_start and va_copy. */
4032 if (codel
== REFERENCE_TYPE
4033 && comptypes (TREE_TYPE (type
), TREE_TYPE (rhs
)) == 1)
4035 if (!lvalue_p (rhs
))
4037 error ("cannot pass rvalue to reference parameter");
4038 return error_mark_node
;
4040 if (!c_mark_addressable (rhs
))
4041 return error_mark_node
;
4042 rhs
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (rhs
)), rhs
);
4044 /* We already know that these two types are compatible, but they
4045 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4046 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4047 likely to be va_list, a typedef to __builtin_va_list, which
4048 is different enough that it will cause problems later. */
4049 if (TREE_TYPE (TREE_TYPE (rhs
)) != TREE_TYPE (type
))
4050 rhs
= build1 (NOP_EXPR
, build_pointer_type (TREE_TYPE (type
)), rhs
);
4052 rhs
= build1 (NOP_EXPR
, type
, rhs
);
4055 /* Some types can interconvert without explicit casts. */
4056 else if (codel
== VECTOR_TYPE
&& coder
== VECTOR_TYPE
4057 && vector_types_convertible_p (type
, TREE_TYPE (rhs
), true))
4058 return convert (type
, rhs
);
4059 /* Arithmetic types all interconvert, and enum is treated like int. */
4060 else if ((codel
== INTEGER_TYPE
|| codel
== REAL_TYPE
4061 || codel
== FIXED_POINT_TYPE
4062 || codel
== ENUMERAL_TYPE
|| codel
== COMPLEX_TYPE
4063 || codel
== BOOLEAN_TYPE
)
4064 && (coder
== INTEGER_TYPE
|| coder
== REAL_TYPE
4065 || coder
== FIXED_POINT_TYPE
4066 || coder
== ENUMERAL_TYPE
|| coder
== COMPLEX_TYPE
4067 || coder
== BOOLEAN_TYPE
))
4068 return convert_and_check (type
, rhs
);
4070 /* Aggregates in different TUs might need conversion. */
4071 if ((codel
== RECORD_TYPE
|| codel
== UNION_TYPE
)
4073 && comptypes (type
, rhstype
))
4074 return convert_and_check (type
, rhs
);
4076 /* Conversion to a transparent union from its member types.
4077 This applies only to function arguments. */
4078 if (codel
== UNION_TYPE
&& TYPE_TRANSPARENT_UNION (type
)
4079 && (errtype
== ic_argpass
|| errtype
== ic_argpass_nonproto
))
4081 tree memb
, marginal_memb
= NULL_TREE
;
4083 for (memb
= TYPE_FIELDS (type
); memb
; memb
= TREE_CHAIN (memb
))
4085 tree memb_type
= TREE_TYPE (memb
);
4087 if (comptypes (TYPE_MAIN_VARIANT (memb_type
),
4088 TYPE_MAIN_VARIANT (rhstype
)))
4091 if (TREE_CODE (memb_type
) != POINTER_TYPE
)
4094 if (coder
== POINTER_TYPE
)
4096 tree ttl
= TREE_TYPE (memb_type
);
4097 tree ttr
= TREE_TYPE (rhstype
);
4099 /* Any non-function converts to a [const][volatile] void *
4100 and vice versa; otherwise, targets must be the same.
4101 Meanwhile, the lhs target must have all the qualifiers of
4103 if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
4104 || comp_target_types (memb_type
, rhstype
))
4106 /* If this type won't generate any warnings, use it. */
4107 if (TYPE_QUALS (ttl
) == TYPE_QUALS (ttr
)
4108 || ((TREE_CODE (ttr
) == FUNCTION_TYPE
4109 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
4110 ? ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
4111 == TYPE_QUALS (ttr
))
4112 : ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
4113 == TYPE_QUALS (ttl
))))
4116 /* Keep looking for a better type, but remember this one. */
4118 marginal_memb
= memb
;
4122 /* Can convert integer zero to any pointer type. */
4123 if (null_pointer_constant_p (rhs
))
4125 rhs
= null_pointer_node
;
4130 if (memb
|| marginal_memb
)
4134 /* We have only a marginally acceptable member type;
4135 it needs a warning. */
4136 tree ttl
= TREE_TYPE (TREE_TYPE (marginal_memb
));
4137 tree ttr
= TREE_TYPE (rhstype
);
4139 /* Const and volatile mean something different for function
4140 types, so the usual warnings are not appropriate. */
4141 if (TREE_CODE (ttr
) == FUNCTION_TYPE
4142 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
4144 /* Because const and volatile on functions are
4145 restrictions that say the function will not do
4146 certain things, it is okay to use a const or volatile
4147 function where an ordinary one is wanted, but not
4149 if (TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
))
4150 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
4151 "makes qualified function "
4152 "pointer from unqualified"),
4153 G_("assignment makes qualified "
4154 "function pointer from "
4156 G_("initialization makes qualified "
4157 "function pointer from "
4159 G_("return makes qualified function "
4160 "pointer from unqualified"));
4162 else if (TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
))
4163 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4164 "qualifiers from pointer target type"),
4165 G_("assignment discards qualifiers "
4166 "from pointer target type"),
4167 G_("initialization discards qualifiers "
4168 "from pointer target type"),
4169 G_("return discards qualifiers from "
4170 "pointer target type"));
4172 memb
= marginal_memb
;
4175 if (pedantic
&& (!fundecl
|| !DECL_IN_SYSTEM_HEADER (fundecl
)))
4176 pedwarn ("ISO C prohibits argument conversion to union type");
4178 rhs
= fold_convert (TREE_TYPE (memb
), rhs
);
4179 return build_constructor_single (type
, memb
, rhs
);
4183 /* Conversions among pointers */
4184 else if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
4185 && (coder
== codel
))
4187 tree ttl
= TREE_TYPE (type
);
4188 tree ttr
= TREE_TYPE (rhstype
);
4191 bool is_opaque_pointer
;
4192 int target_cmp
= 0; /* Cache comp_target_types () result. */
4194 if (TREE_CODE (mvl
) != ARRAY_TYPE
)
4195 mvl
= TYPE_MAIN_VARIANT (mvl
);
4196 if (TREE_CODE (mvr
) != ARRAY_TYPE
)
4197 mvr
= TYPE_MAIN_VARIANT (mvr
);
4198 /* Opaque pointers are treated like void pointers. */
4199 is_opaque_pointer
= (targetm
.vector_opaque_p (type
)
4200 || targetm
.vector_opaque_p (rhstype
))
4201 && TREE_CODE (ttl
) == VECTOR_TYPE
4202 && TREE_CODE (ttr
) == VECTOR_TYPE
;
4204 /* C++ does not allow the implicit conversion void* -> T*. However,
4205 for the purpose of reducing the number of false positives, we
4206 tolerate the special case of
4210 where NULL is typically defined in C to be '(void *) 0'. */
4211 if (VOID_TYPE_P (ttr
) && rhs
!= null_pointer_node
&& !VOID_TYPE_P (ttl
))
4212 warning (OPT_Wc___compat
, "request for implicit conversion from "
4213 "%qT to %qT not permitted in C++", rhstype
, type
);
4215 /* Check if the right-hand side has a format attribute but the
4216 left-hand side doesn't. */
4217 if (warn_missing_format_attribute
4218 && check_missing_format_attribute (type
, rhstype
))
4223 case ic_argpass_nonproto
:
4224 warning (OPT_Wmissing_format_attribute
,
4225 "argument %d of %qE might be "
4226 "a candidate for a format attribute",
4230 warning (OPT_Wmissing_format_attribute
,
4231 "assignment left-hand side might be "
4232 "a candidate for a format attribute");
4235 warning (OPT_Wmissing_format_attribute
,
4236 "initialization left-hand side might be "
4237 "a candidate for a format attribute");
4240 warning (OPT_Wmissing_format_attribute
,
4241 "return type might be "
4242 "a candidate for a format attribute");
4249 /* Any non-function converts to a [const][volatile] void *
4250 and vice versa; otherwise, targets must be the same.
4251 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4252 if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
4253 || (target_cmp
= comp_target_types (type
, rhstype
))
4254 || is_opaque_pointer
4255 || (c_common_unsigned_type (mvl
)
4256 == c_common_unsigned_type (mvr
)))
4259 && ((VOID_TYPE_P (ttl
) && TREE_CODE (ttr
) == FUNCTION_TYPE
)
4262 && !null_pointer_constant_p (rhs
)
4263 && TREE_CODE (ttl
) == FUNCTION_TYPE
)))
4264 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
4265 "%qE between function pointer "
4267 G_("ISO C forbids assignment between "
4268 "function pointer and %<void *%>"),
4269 G_("ISO C forbids initialization between "
4270 "function pointer and %<void *%>"),
4271 G_("ISO C forbids return between function "
4272 "pointer and %<void *%>"));
4273 /* Const and volatile mean something different for function types,
4274 so the usual warnings are not appropriate. */
4275 else if (TREE_CODE (ttr
) != FUNCTION_TYPE
4276 && TREE_CODE (ttl
) != FUNCTION_TYPE
)
4278 if (TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
))
4280 /* Types differing only by the presence of the 'volatile'
4281 qualifier are acceptable if the 'volatile' has been added
4282 in by the Objective-C EH machinery. */
4283 if (!objc_type_quals_match (ttl
, ttr
))
4284 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4285 "qualifiers from pointer target type"),
4286 G_("assignment discards qualifiers "
4287 "from pointer target type"),
4288 G_("initialization discards qualifiers "
4289 "from pointer target type"),
4290 G_("return discards qualifiers from "
4291 "pointer target type"));
4293 /* If this is not a case of ignoring a mismatch in signedness,
4295 else if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
4298 /* If there is a mismatch, do warn. */
4299 else if (warn_pointer_sign
)
4300 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
4301 "%d of %qE differ in signedness"),
4302 G_("pointer targets in assignment "
4303 "differ in signedness"),
4304 G_("pointer targets in initialization "
4305 "differ in signedness"),
4306 G_("pointer targets in return differ "
4309 else if (TREE_CODE (ttl
) == FUNCTION_TYPE
4310 && TREE_CODE (ttr
) == FUNCTION_TYPE
)
4312 /* Because const and volatile on functions are restrictions
4313 that say the function will not do certain things,
4314 it is okay to use a const or volatile function
4315 where an ordinary one is wanted, but not vice-versa. */
4316 if (TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
))
4317 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4318 "qualified function pointer "
4319 "from unqualified"),
4320 G_("assignment makes qualified function "
4321 "pointer from unqualified"),
4322 G_("initialization makes qualified "
4323 "function pointer from unqualified"),
4324 G_("return makes qualified function "
4325 "pointer from unqualified"));
4329 /* Avoid warning about the volatile ObjC EH puts on decls. */
4331 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
4332 "incompatible pointer type"),
4333 G_("assignment from incompatible pointer type"),
4334 G_("initialization from incompatible "
4336 G_("return from incompatible pointer type"));
4338 return convert (type
, rhs
);
4340 else if (codel
== POINTER_TYPE
&& coder
== ARRAY_TYPE
)
4342 /* ??? This should not be an error when inlining calls to
4343 unprototyped functions. */
4344 error ("invalid use of non-lvalue array");
4345 return error_mark_node
;
4347 else if (codel
== POINTER_TYPE
&& coder
== INTEGER_TYPE
)
4349 /* An explicit constant 0 can convert to a pointer,
4350 or one that results from arithmetic, even including
4351 a cast to integer type. */
4352 if (!null_pointer_constant_p (rhs
))
4353 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4354 "pointer from integer without a cast"),
4355 G_("assignment makes pointer from integer "
4357 G_("initialization makes pointer from "
4358 "integer without a cast"),
4359 G_("return makes pointer from integer "
4362 return convert (type
, rhs
);
4364 else if (codel
== INTEGER_TYPE
&& coder
== POINTER_TYPE
)
4366 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
4367 "from pointer without a cast"),
4368 G_("assignment makes integer from pointer "
4370 G_("initialization makes integer from pointer "
4372 G_("return makes integer from pointer "
4374 return convert (type
, rhs
);
4376 else if (codel
== BOOLEAN_TYPE
&& coder
== POINTER_TYPE
)
4377 return convert (type
, rhs
);
4382 case ic_argpass_nonproto
:
4383 /* ??? This should not be an error when inlining calls to
4384 unprototyped functions. */
4385 error ("incompatible type for argument %d of %qE", parmnum
, rname
);
4388 error ("incompatible types in assignment");
4391 error ("incompatible types in initialization");
4394 error ("incompatible types in return");
4400 return error_mark_node
;
4403 /* If VALUE is a compound expr all of whose expressions are constant, then
4404 return its value. Otherwise, return error_mark_node.
4406 This is for handling COMPOUND_EXPRs as initializer elements
4407 which is allowed with a warning when -pedantic is specified. */
4410 valid_compound_expr_initializer (tree value
, tree endtype
)
4412 if (TREE_CODE (value
) == COMPOUND_EXPR
)
4414 if (valid_compound_expr_initializer (TREE_OPERAND (value
, 0), endtype
)
4416 return error_mark_node
;
4417 return valid_compound_expr_initializer (TREE_OPERAND (value
, 1),
4420 else if (!initializer_constant_valid_p (value
, endtype
))
4421 return error_mark_node
;
4426 /* Perform appropriate conversions on the initial value of a variable,
4427 store it in the declaration DECL,
4428 and print any error messages that are appropriate.
4429 If the init is invalid, store an ERROR_MARK. */
4432 store_init_value (tree decl
, tree init
)
4436 /* If variable's type was invalidly declared, just ignore it. */
4438 type
= TREE_TYPE (decl
);
4439 if (TREE_CODE (type
) == ERROR_MARK
)
4442 /* Digest the specified initializer into an expression. */
4444 value
= digest_init (type
, init
, true, TREE_STATIC (decl
));
4446 /* Store the expression if valid; else report error. */
4448 if (!in_system_header
4449 && AGGREGATE_TYPE_P (TREE_TYPE (decl
)) && !TREE_STATIC (decl
))
4450 warning (OPT_Wtraditional
, "traditional C rejects automatic "
4451 "aggregate initialization");
4453 DECL_INITIAL (decl
) = value
;
4455 /* ANSI wants warnings about out-of-range constant initializers. */
4456 STRIP_TYPE_NOPS (value
);
4457 if (TREE_STATIC (decl
))
4458 constant_expression_warning (value
);
4460 /* Check if we need to set array size from compound literal size. */
4461 if (TREE_CODE (type
) == ARRAY_TYPE
4462 && TYPE_DOMAIN (type
) == 0
4463 && value
!= error_mark_node
)
4465 tree inside_init
= init
;
4467 STRIP_TYPE_NOPS (inside_init
);
4468 inside_init
= fold (inside_init
);
4470 if (TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
4472 tree cldecl
= COMPOUND_LITERAL_EXPR_DECL (inside_init
);
4474 if (TYPE_DOMAIN (TREE_TYPE (cldecl
)))
4476 /* For int foo[] = (int [3]){1}; we need to set array size
4477 now since later on array initializer will be just the
4478 brace enclosed list of the compound literal. */
4479 type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
4480 TREE_TYPE (decl
) = type
;
4481 TYPE_DOMAIN (type
) = TYPE_DOMAIN (TREE_TYPE (cldecl
));
4483 layout_decl (cldecl
, 0);
4489 /* Methods for storing and printing names for error messages. */
4491 /* Implement a spelling stack that allows components of a name to be pushed
4492 and popped. Each element on the stack is this structure. */
4499 unsigned HOST_WIDE_INT i
;
4504 #define SPELLING_STRING 1
4505 #define SPELLING_MEMBER 2
4506 #define SPELLING_BOUNDS 3
4508 static struct spelling
*spelling
; /* Next stack element (unused). */
4509 static struct spelling
*spelling_base
; /* Spelling stack base. */
4510 static int spelling_size
; /* Size of the spelling stack. */
4512 /* Macros to save and restore the spelling stack around push_... functions.
4513 Alternative to SAVE_SPELLING_STACK. */
4515 #define SPELLING_DEPTH() (spelling - spelling_base)
4516 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4518 /* Push an element on the spelling stack with type KIND and assign VALUE
4521 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4523 int depth = SPELLING_DEPTH (); \
4525 if (depth >= spelling_size) \
4527 spelling_size += 10; \
4528 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4530 RESTORE_SPELLING_DEPTH (depth); \
4533 spelling->kind = (KIND); \
4534 spelling->MEMBER = (VALUE); \
4538 /* Push STRING on the stack. Printed literally. */
4541 push_string (const char *string
)
4543 PUSH_SPELLING (SPELLING_STRING
, string
, u
.s
);
4546 /* Push a member name on the stack. Printed as '.' STRING. */
4549 push_member_name (tree decl
)
4551 const char *const string
4552 = DECL_NAME (decl
) ? IDENTIFIER_POINTER (DECL_NAME (decl
)) : "<anonymous>";
4553 PUSH_SPELLING (SPELLING_MEMBER
, string
, u
.s
);
4556 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4559 push_array_bounds (unsigned HOST_WIDE_INT bounds
)
4561 PUSH_SPELLING (SPELLING_BOUNDS
, bounds
, u
.i
);
4564 /* Compute the maximum size in bytes of the printed spelling. */
4567 spelling_length (void)
4572 for (p
= spelling_base
; p
< spelling
; p
++)
4574 if (p
->kind
== SPELLING_BOUNDS
)
4577 size
+= strlen (p
->u
.s
) + 1;
4583 /* Print the spelling to BUFFER and return it. */
4586 print_spelling (char *buffer
)
4591 for (p
= spelling_base
; p
< spelling
; p
++)
4592 if (p
->kind
== SPELLING_BOUNDS
)
4594 sprintf (d
, "[" HOST_WIDE_INT_PRINT_UNSIGNED
"]", p
->u
.i
);
4600 if (p
->kind
== SPELLING_MEMBER
)
4602 for (s
= p
->u
.s
; (*d
= *s
++); d
++)
4609 /* Issue an error message for a bad initializer component.
4610 MSGID identifies the message.
4611 The component name is taken from the spelling stack. */
4614 error_init (const char *msgid
)
4618 error ("%s", _(msgid
));
4619 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4621 error ("(near initialization for %qs)", ofwhat
);
4624 /* Issue a pedantic warning for a bad initializer component.
4625 MSGID identifies the message.
4626 The component name is taken from the spelling stack. */
4629 pedwarn_init (const char *msgid
)
4633 pedwarn ("%s", _(msgid
));
4634 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4636 pedwarn ("(near initialization for %qs)", ofwhat
);
4639 /* Issue a warning for a bad initializer component.
4640 MSGID identifies the message.
4641 The component name is taken from the spelling stack. */
4644 warning_init (const char *msgid
)
4648 warning (0, "%s", _(msgid
));
4649 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4651 warning (0, "(near initialization for %qs)", ofwhat
);
4654 /* If TYPE is an array type and EXPR is a parenthesized string
4655 constant, warn if pedantic that EXPR is being used to initialize an
4656 object of type TYPE. */
4659 maybe_warn_string_init (tree type
, struct c_expr expr
)
4662 && TREE_CODE (type
) == ARRAY_TYPE
4663 && TREE_CODE (expr
.value
) == STRING_CST
4664 && expr
.original_code
!= STRING_CST
)
4665 pedwarn_init ("array initialized from parenthesized string constant");
4668 /* Digest the parser output INIT as an initializer for type TYPE.
4669 Return a C expression of type TYPE to represent the initial value.
4671 If INIT is a string constant, STRICT_STRING is true if it is
4672 unparenthesized or we should not warn here for it being parenthesized.
4673 For other types of INIT, STRICT_STRING is not used.
4675 REQUIRE_CONSTANT requests an error if non-constant initializers or
4676 elements are seen. */
4679 digest_init (tree type
, tree init
, bool strict_string
, int require_constant
)
4681 enum tree_code code
= TREE_CODE (type
);
4682 tree inside_init
= init
;
4684 if (type
== error_mark_node
4686 || init
== error_mark_node
4687 || TREE_TYPE (init
) == error_mark_node
)
4688 return error_mark_node
;
4690 STRIP_TYPE_NOPS (inside_init
);
4692 inside_init
= fold (inside_init
);
4694 /* Initialization of an array of chars from a string constant
4695 optionally enclosed in braces. */
4697 if (code
== ARRAY_TYPE
&& inside_init
4698 && TREE_CODE (inside_init
) == STRING_CST
)
4700 tree typ1
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
4701 /* Note that an array could be both an array of character type
4702 and an array of wchar_t if wchar_t is signed char or unsigned
4704 bool char_array
= (typ1
== char_type_node
4705 || typ1
== signed_char_type_node
4706 || typ1
== unsigned_char_type_node
);
4707 bool wchar_array
= !!comptypes (typ1
, wchar_type_node
);
4708 if (char_array
|| wchar_array
)
4712 expr
.value
= inside_init
;
4713 expr
.original_code
= (strict_string
? STRING_CST
: ERROR_MARK
);
4714 maybe_warn_string_init (type
, expr
);
4717 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init
)))
4720 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4721 TYPE_MAIN_VARIANT (type
)))
4724 if (!wchar_array
&& !char_string
)
4726 error_init ("char-array initialized from wide string");
4727 return error_mark_node
;
4729 if (char_string
&& !char_array
)
4731 error_init ("wchar_t-array initialized from non-wide string");
4732 return error_mark_node
;
4735 TREE_TYPE (inside_init
) = type
;
4736 if (TYPE_DOMAIN (type
) != 0
4737 && TYPE_SIZE (type
) != 0
4738 && TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
4739 /* Subtract 1 (or sizeof (wchar_t))
4740 because it's ok to ignore the terminating null char
4741 that is counted in the length of the constant. */
4742 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type
),
4743 TREE_STRING_LENGTH (inside_init
)
4744 - ((TYPE_PRECISION (typ1
)
4745 != TYPE_PRECISION (char_type_node
))
4746 ? (TYPE_PRECISION (wchar_type_node
)
4749 pedwarn_init ("initializer-string for array of chars is too long");
4753 else if (INTEGRAL_TYPE_P (typ1
))
4755 error_init ("array of inappropriate type initialized "
4756 "from string constant");
4757 return error_mark_node
;
4761 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4762 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4763 below and handle as a constructor. */
4764 if (code
== VECTOR_TYPE
4765 && TREE_CODE (TREE_TYPE (inside_init
)) == VECTOR_TYPE
4766 && vector_types_convertible_p (TREE_TYPE (inside_init
), type
, true)
4767 && TREE_CONSTANT (inside_init
))
4769 if (TREE_CODE (inside_init
) == VECTOR_CST
4770 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4771 TYPE_MAIN_VARIANT (type
)))
4774 if (TREE_CODE (inside_init
) == CONSTRUCTOR
)
4776 unsigned HOST_WIDE_INT ix
;
4778 bool constant_p
= true;
4780 /* Iterate through elements and check if all constructor
4781 elements are *_CSTs. */
4782 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init
), ix
, value
)
4783 if (!CONSTANT_CLASS_P (value
))
4790 return build_vector_from_ctor (type
,
4791 CONSTRUCTOR_ELTS (inside_init
));
4795 /* Any type can be initialized
4796 from an expression of the same type, optionally with braces. */
4798 if (inside_init
&& TREE_TYPE (inside_init
) != 0
4799 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4800 TYPE_MAIN_VARIANT (type
))
4801 || (code
== ARRAY_TYPE
4802 && comptypes (TREE_TYPE (inside_init
), type
))
4803 || (code
== VECTOR_TYPE
4804 && comptypes (TREE_TYPE (inside_init
), type
))
4805 || (code
== POINTER_TYPE
4806 && TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
4807 && comptypes (TREE_TYPE (TREE_TYPE (inside_init
)),
4808 TREE_TYPE (type
)))))
4810 if (code
== POINTER_TYPE
)
4812 if (TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
)
4814 if (TREE_CODE (inside_init
) == STRING_CST
4815 || TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
4816 inside_init
= array_to_pointer_conversion (inside_init
);
4819 error_init ("invalid use of non-lvalue array");
4820 return error_mark_node
;
4825 if (code
== VECTOR_TYPE
)
4826 /* Although the types are compatible, we may require a
4828 inside_init
= convert (type
, inside_init
);
4830 if (require_constant
4831 && (code
== VECTOR_TYPE
|| !flag_isoc99
)
4832 && TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
4834 /* As an extension, allow initializing objects with static storage
4835 duration with compound literals (which are then treated just as
4836 the brace enclosed list they contain). Also allow this for
4837 vectors, as we can only assign them with compound literals. */
4838 tree decl
= COMPOUND_LITERAL_EXPR_DECL (inside_init
);
4839 inside_init
= DECL_INITIAL (decl
);
4842 if (code
== ARRAY_TYPE
&& TREE_CODE (inside_init
) != STRING_CST
4843 && TREE_CODE (inside_init
) != CONSTRUCTOR
)
4845 error_init ("array initialized from non-constant array expression");
4846 return error_mark_node
;
4849 if (optimize
&& TREE_CODE (inside_init
) == VAR_DECL
)
4850 inside_init
= decl_constant_value_for_broken_optimization (inside_init
);
4852 /* Compound expressions can only occur here if -pedantic or
4853 -pedantic-errors is specified. In the later case, we always want
4854 an error. In the former case, we simply want a warning. */
4855 if (require_constant
&& pedantic
4856 && TREE_CODE (inside_init
) == COMPOUND_EXPR
)
4859 = valid_compound_expr_initializer (inside_init
,
4860 TREE_TYPE (inside_init
));
4861 if (inside_init
== error_mark_node
)
4862 error_init ("initializer element is not constant");
4864 pedwarn_init ("initializer element is not constant");
4865 if (flag_pedantic_errors
)
4866 inside_init
= error_mark_node
;
4868 else if (require_constant
4869 && !initializer_constant_valid_p (inside_init
,
4870 TREE_TYPE (inside_init
)))
4872 error_init ("initializer element is not constant");
4873 inside_init
= error_mark_node
;
4876 /* Added to enable additional -Wmissing-format-attribute warnings. */
4877 if (TREE_CODE (TREE_TYPE (inside_init
)) == POINTER_TYPE
)
4878 inside_init
= convert_for_assignment (type
, inside_init
, ic_init
, NULL_TREE
,
4883 /* Handle scalar types, including conversions. */
4885 if (code
== INTEGER_TYPE
|| code
== REAL_TYPE
|| code
== FIXED_POINT_TYPE
4886 || code
== POINTER_TYPE
|| code
== ENUMERAL_TYPE
|| code
== BOOLEAN_TYPE
4887 || code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
4889 if (TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
4890 && (TREE_CODE (init
) == STRING_CST
4891 || TREE_CODE (init
) == COMPOUND_LITERAL_EXPR
))
4892 init
= array_to_pointer_conversion (init
);
4894 = convert_for_assignment (type
, init
, ic_init
,
4895 NULL_TREE
, NULL_TREE
, 0);
4897 /* Check to see if we have already given an error message. */
4898 if (inside_init
== error_mark_node
)
4900 else if (require_constant
&& !TREE_CONSTANT (inside_init
))
4902 error_init ("initializer element is not constant");
4903 inside_init
= error_mark_node
;
4905 else if (require_constant
4906 && !initializer_constant_valid_p (inside_init
,
4907 TREE_TYPE (inside_init
)))
4909 error_init ("initializer element is not computable at load time");
4910 inside_init
= error_mark_node
;
4916 /* Come here only for records and arrays. */
4918 if (COMPLETE_TYPE_P (type
) && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4920 error_init ("variable-sized object may not be initialized");
4921 return error_mark_node
;
4924 error_init ("invalid initializer");
4925 return error_mark_node
;
4928 /* Handle initializers that use braces. */
4930 /* Type of object we are accumulating a constructor for.
4931 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4932 static tree constructor_type
;
4934 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4936 static tree constructor_fields
;
4938 /* For an ARRAY_TYPE, this is the specified index
4939 at which to store the next element we get. */
4940 static tree constructor_index
;
4942 /* For an ARRAY_TYPE, this is the maximum index. */
4943 static tree constructor_max_index
;
4945 /* For a RECORD_TYPE, this is the first field not yet written out. */
4946 static tree constructor_unfilled_fields
;
4948 /* For an ARRAY_TYPE, this is the index of the first element
4949 not yet written out. */
4950 static tree constructor_unfilled_index
;
4952 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4953 This is so we can generate gaps between fields, when appropriate. */
4954 static tree constructor_bit_index
;
4956 /* If we are saving up the elements rather than allocating them,
4957 this is the list of elements so far (in reverse order,
4958 most recent first). */
4959 static VEC(constructor_elt
,gc
) *constructor_elements
;
4961 /* 1 if constructor should be incrementally stored into a constructor chain,
4962 0 if all the elements should be kept in AVL tree. */
4963 static int constructor_incremental
;
4965 /* 1 if so far this constructor's elements are all compile-time constants. */
4966 static int constructor_constant
;
4968 /* 1 if so far this constructor's elements are all valid address constants. */
4969 static int constructor_simple
;
4971 /* 1 if this constructor is erroneous so far. */
4972 static int constructor_erroneous
;
4974 /* Structure for managing pending initializer elements, organized as an
4979 struct init_node
*left
, *right
;
4980 struct init_node
*parent
;
4986 /* Tree of pending elements at this constructor level.
4987 These are elements encountered out of order
4988 which belong at places we haven't reached yet in actually
4990 Will never hold tree nodes across GC runs. */
4991 static struct init_node
*constructor_pending_elts
;
4993 /* The SPELLING_DEPTH of this constructor. */
4994 static int constructor_depth
;
4996 /* DECL node for which an initializer is being read.
4997 0 means we are reading a constructor expression
4998 such as (struct foo) {...}. */
4999 static tree constructor_decl
;
5001 /* Nonzero if this is an initializer for a top-level decl. */
5002 static int constructor_top_level
;
5004 /* Nonzero if there were any member designators in this initializer. */
5005 static int constructor_designated
;
5007 /* Nesting depth of designator list. */
5008 static int designator_depth
;
5010 /* Nonzero if there were diagnosed errors in this designator list. */
5011 static int designator_erroneous
;
5014 /* This stack has a level for each implicit or explicit level of
5015 structuring in the initializer, including the outermost one. It
5016 saves the values of most of the variables above. */
5018 struct constructor_range_stack
;
5020 struct constructor_stack
5022 struct constructor_stack
*next
;
5027 tree unfilled_index
;
5028 tree unfilled_fields
;
5030 VEC(constructor_elt
,gc
) *elements
;
5031 struct init_node
*pending_elts
;
5034 /* If value nonzero, this value should replace the entire
5035 constructor at this level. */
5036 struct c_expr replacement_value
;
5037 struct constructor_range_stack
*range_stack
;
5047 static struct constructor_stack
*constructor_stack
;
5049 /* This stack represents designators from some range designator up to
5050 the last designator in the list. */
5052 struct constructor_range_stack
5054 struct constructor_range_stack
*next
, *prev
;
5055 struct constructor_stack
*stack
;
5062 static struct constructor_range_stack
*constructor_range_stack
;
5064 /* This stack records separate initializers that are nested.
5065 Nested initializers can't happen in ANSI C, but GNU C allows them
5066 in cases like { ... (struct foo) { ... } ... }. */
5068 struct initializer_stack
5070 struct initializer_stack
*next
;
5072 struct constructor_stack
*constructor_stack
;
5073 struct constructor_range_stack
*constructor_range_stack
;
5074 VEC(constructor_elt
,gc
) *elements
;
5075 struct spelling
*spelling
;
5076 struct spelling
*spelling_base
;
5079 char require_constant_value
;
5080 char require_constant_elements
;
5083 static struct initializer_stack
*initializer_stack
;
5085 /* Prepare to parse and output the initializer for variable DECL. */
5088 start_init (tree decl
, tree asmspec_tree ATTRIBUTE_UNUSED
, int top_level
)
5091 struct initializer_stack
*p
= XNEW (struct initializer_stack
);
5093 p
->decl
= constructor_decl
;
5094 p
->require_constant_value
= require_constant_value
;
5095 p
->require_constant_elements
= require_constant_elements
;
5096 p
->constructor_stack
= constructor_stack
;
5097 p
->constructor_range_stack
= constructor_range_stack
;
5098 p
->elements
= constructor_elements
;
5099 p
->spelling
= spelling
;
5100 p
->spelling_base
= spelling_base
;
5101 p
->spelling_size
= spelling_size
;
5102 p
->top_level
= constructor_top_level
;
5103 p
->next
= initializer_stack
;
5104 initializer_stack
= p
;
5106 constructor_decl
= decl
;
5107 constructor_designated
= 0;
5108 constructor_top_level
= top_level
;
5110 if (decl
!= 0 && decl
!= error_mark_node
)
5112 require_constant_value
= TREE_STATIC (decl
);
5113 require_constant_elements
5114 = ((TREE_STATIC (decl
) || (pedantic
&& !flag_isoc99
))
5115 /* For a scalar, you can always use any value to initialize,
5116 even within braces. */
5117 && (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
5118 || TREE_CODE (TREE_TYPE (decl
)) == RECORD_TYPE
5119 || TREE_CODE (TREE_TYPE (decl
)) == UNION_TYPE
5120 || TREE_CODE (TREE_TYPE (decl
)) == QUAL_UNION_TYPE
));
5121 locus
= IDENTIFIER_POINTER (DECL_NAME (decl
));
5125 require_constant_value
= 0;
5126 require_constant_elements
= 0;
5127 locus
= "(anonymous)";
5130 constructor_stack
= 0;
5131 constructor_range_stack
= 0;
5133 missing_braces_mentioned
= 0;
5137 RESTORE_SPELLING_DEPTH (0);
5140 push_string (locus
);
5146 struct initializer_stack
*p
= initializer_stack
;
5148 /* Free the whole constructor stack of this initializer. */
5149 while (constructor_stack
)
5151 struct constructor_stack
*q
= constructor_stack
;
5152 constructor_stack
= q
->next
;
5156 gcc_assert (!constructor_range_stack
);
5158 /* Pop back to the data of the outer initializer (if any). */
5159 free (spelling_base
);
5161 constructor_decl
= p
->decl
;
5162 require_constant_value
= p
->require_constant_value
;
5163 require_constant_elements
= p
->require_constant_elements
;
5164 constructor_stack
= p
->constructor_stack
;
5165 constructor_range_stack
= p
->constructor_range_stack
;
5166 constructor_elements
= p
->elements
;
5167 spelling
= p
->spelling
;
5168 spelling_base
= p
->spelling_base
;
5169 spelling_size
= p
->spelling_size
;
5170 constructor_top_level
= p
->top_level
;
5171 initializer_stack
= p
->next
;
5175 /* Call here when we see the initializer is surrounded by braces.
5176 This is instead of a call to push_init_level;
5177 it is matched by a call to pop_init_level.
5179 TYPE is the type to initialize, for a constructor expression.
5180 For an initializer for a decl, TYPE is zero. */
5183 really_start_incremental_init (tree type
)
5185 struct constructor_stack
*p
= XNEW (struct constructor_stack
);
5188 type
= TREE_TYPE (constructor_decl
);
5190 if (targetm
.vector_opaque_p (type
))
5191 error ("opaque vector types cannot be initialized");
5193 p
->type
= constructor_type
;
5194 p
->fields
= constructor_fields
;
5195 p
->index
= constructor_index
;
5196 p
->max_index
= constructor_max_index
;
5197 p
->unfilled_index
= constructor_unfilled_index
;
5198 p
->unfilled_fields
= constructor_unfilled_fields
;
5199 p
->bit_index
= constructor_bit_index
;
5200 p
->elements
= constructor_elements
;
5201 p
->constant
= constructor_constant
;
5202 p
->simple
= constructor_simple
;
5203 p
->erroneous
= constructor_erroneous
;
5204 p
->pending_elts
= constructor_pending_elts
;
5205 p
->depth
= constructor_depth
;
5206 p
->replacement_value
.value
= 0;
5207 p
->replacement_value
.original_code
= ERROR_MARK
;
5211 p
->incremental
= constructor_incremental
;
5212 p
->designated
= constructor_designated
;
5214 constructor_stack
= p
;
5216 constructor_constant
= 1;
5217 constructor_simple
= 1;
5218 constructor_depth
= SPELLING_DEPTH ();
5219 constructor_elements
= 0;
5220 constructor_pending_elts
= 0;
5221 constructor_type
= type
;
5222 constructor_incremental
= 1;
5223 constructor_designated
= 0;
5224 designator_depth
= 0;
5225 designator_erroneous
= 0;
5227 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5228 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5230 constructor_fields
= TYPE_FIELDS (constructor_type
);
5231 /* Skip any nameless bit fields at the beginning. */
5232 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
5233 && DECL_NAME (constructor_fields
) == 0)
5234 constructor_fields
= TREE_CHAIN (constructor_fields
);
5236 constructor_unfilled_fields
= constructor_fields
;
5237 constructor_bit_index
= bitsize_zero_node
;
5239 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5241 if (TYPE_DOMAIN (constructor_type
))
5243 constructor_max_index
5244 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
5246 /* Detect non-empty initializations of zero-length arrays. */
5247 if (constructor_max_index
== NULL_TREE
5248 && TYPE_SIZE (constructor_type
))
5249 constructor_max_index
= build_int_cst (NULL_TREE
, -1);
5251 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5252 to initialize VLAs will cause a proper error; avoid tree
5253 checking errors as well by setting a safe value. */
5254 if (constructor_max_index
5255 && TREE_CODE (constructor_max_index
) != INTEGER_CST
)
5256 constructor_max_index
= build_int_cst (NULL_TREE
, -1);
5259 = convert (bitsizetype
,
5260 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
5264 constructor_index
= bitsize_zero_node
;
5265 constructor_max_index
= NULL_TREE
;
5268 constructor_unfilled_index
= constructor_index
;
5270 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
5272 /* Vectors are like simple fixed-size arrays. */
5273 constructor_max_index
=
5274 build_int_cst (NULL_TREE
, TYPE_VECTOR_SUBPARTS (constructor_type
) - 1);
5275 constructor_index
= bitsize_zero_node
;
5276 constructor_unfilled_index
= constructor_index
;
5280 /* Handle the case of int x = {5}; */
5281 constructor_fields
= constructor_type
;
5282 constructor_unfilled_fields
= constructor_type
;
5286 /* Push down into a subobject, for initialization.
5287 If this is for an explicit set of braces, IMPLICIT is 0.
5288 If it is because the next element belongs at a lower level,
5289 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5292 push_init_level (int implicit
)
5294 struct constructor_stack
*p
;
5295 tree value
= NULL_TREE
;
5297 /* If we've exhausted any levels that didn't have braces,
5298 pop them now. If implicit == 1, this will have been done in
5299 process_init_element; do not repeat it here because in the case
5300 of excess initializers for an empty aggregate this leads to an
5301 infinite cycle of popping a level and immediately recreating
5305 while (constructor_stack
->implicit
)
5307 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
5308 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5309 && constructor_fields
== 0)
5310 process_init_element (pop_init_level (1));
5311 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5312 && constructor_max_index
5313 && tree_int_cst_lt (constructor_max_index
,
5315 process_init_element (pop_init_level (1));
5321 /* Unless this is an explicit brace, we need to preserve previous
5325 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
5326 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5327 && constructor_fields
)
5328 value
= find_init_member (constructor_fields
);
5329 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5330 value
= find_init_member (constructor_index
);
5333 p
= XNEW (struct constructor_stack
);
5334 p
->type
= constructor_type
;
5335 p
->fields
= constructor_fields
;
5336 p
->index
= constructor_index
;
5337 p
->max_index
= constructor_max_index
;
5338 p
->unfilled_index
= constructor_unfilled_index
;
5339 p
->unfilled_fields
= constructor_unfilled_fields
;
5340 p
->bit_index
= constructor_bit_index
;
5341 p
->elements
= constructor_elements
;
5342 p
->constant
= constructor_constant
;
5343 p
->simple
= constructor_simple
;
5344 p
->erroneous
= constructor_erroneous
;
5345 p
->pending_elts
= constructor_pending_elts
;
5346 p
->depth
= constructor_depth
;
5347 p
->replacement_value
.value
= 0;
5348 p
->replacement_value
.original_code
= ERROR_MARK
;
5349 p
->implicit
= implicit
;
5351 p
->incremental
= constructor_incremental
;
5352 p
->designated
= constructor_designated
;
5353 p
->next
= constructor_stack
;
5355 constructor_stack
= p
;
5357 constructor_constant
= 1;
5358 constructor_simple
= 1;
5359 constructor_depth
= SPELLING_DEPTH ();
5360 constructor_elements
= 0;
5361 constructor_incremental
= 1;
5362 constructor_designated
= 0;
5363 constructor_pending_elts
= 0;
5366 p
->range_stack
= constructor_range_stack
;
5367 constructor_range_stack
= 0;
5368 designator_depth
= 0;
5369 designator_erroneous
= 0;
5372 /* Don't die if an entire brace-pair level is superfluous
5373 in the containing level. */
5374 if (constructor_type
== 0)
5376 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
5377 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5379 /* Don't die if there are extra init elts at the end. */
5380 if (constructor_fields
== 0)
5381 constructor_type
= 0;
5384 constructor_type
= TREE_TYPE (constructor_fields
);
5385 push_member_name (constructor_fields
);
5386 constructor_depth
++;
5389 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5391 constructor_type
= TREE_TYPE (constructor_type
);
5392 push_array_bounds (tree_low_cst (constructor_index
, 1));
5393 constructor_depth
++;
5396 if (constructor_type
== 0)
5398 error_init ("extra brace group at end of initializer");
5399 constructor_fields
= 0;
5400 constructor_unfilled_fields
= 0;
5404 if (value
&& TREE_CODE (value
) == CONSTRUCTOR
)
5406 constructor_constant
= TREE_CONSTANT (value
);
5407 constructor_simple
= TREE_STATIC (value
);
5408 constructor_elements
= CONSTRUCTOR_ELTS (value
);
5409 if (!VEC_empty (constructor_elt
, constructor_elements
)
5410 && (TREE_CODE (constructor_type
) == RECORD_TYPE
5411 || TREE_CODE (constructor_type
) == ARRAY_TYPE
))
5412 set_nonincremental_init ();
5415 if (implicit
== 1 && warn_missing_braces
&& !missing_braces_mentioned
)
5417 missing_braces_mentioned
= 1;
5418 warning_init ("missing braces around initializer");
5421 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5422 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5424 constructor_fields
= TYPE_FIELDS (constructor_type
);
5425 /* Skip any nameless bit fields at the beginning. */
5426 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
5427 && DECL_NAME (constructor_fields
) == 0)
5428 constructor_fields
= TREE_CHAIN (constructor_fields
);
5430 constructor_unfilled_fields
= constructor_fields
;
5431 constructor_bit_index
= bitsize_zero_node
;
5433 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
5435 /* Vectors are like simple fixed-size arrays. */
5436 constructor_max_index
=
5437 build_int_cst (NULL_TREE
, TYPE_VECTOR_SUBPARTS (constructor_type
) - 1);
5438 constructor_index
= convert (bitsizetype
, integer_zero_node
);
5439 constructor_unfilled_index
= constructor_index
;
5441 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5443 if (TYPE_DOMAIN (constructor_type
))
5445 constructor_max_index
5446 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
5448 /* Detect non-empty initializations of zero-length arrays. */
5449 if (constructor_max_index
== NULL_TREE
5450 && TYPE_SIZE (constructor_type
))
5451 constructor_max_index
= build_int_cst (NULL_TREE
, -1);
5453 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5454 to initialize VLAs will cause a proper error; avoid tree
5455 checking errors as well by setting a safe value. */
5456 if (constructor_max_index
5457 && TREE_CODE (constructor_max_index
) != INTEGER_CST
)
5458 constructor_max_index
= build_int_cst (NULL_TREE
, -1);
5461 = convert (bitsizetype
,
5462 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
5465 constructor_index
= bitsize_zero_node
;
5467 constructor_unfilled_index
= constructor_index
;
5468 if (value
&& TREE_CODE (value
) == STRING_CST
)
5470 /* We need to split the char/wchar array into individual
5471 characters, so that we don't have to special case it
5473 set_nonincremental_init_from_string (value
);
5478 if (constructor_type
!= error_mark_node
)
5479 warning_init ("braces around scalar initializer");
5480 constructor_fields
= constructor_type
;
5481 constructor_unfilled_fields
= constructor_type
;
5485 /* At the end of an implicit or explicit brace level,
5486 finish up that level of constructor. If a single expression
5487 with redundant braces initialized that level, return the
5488 c_expr structure for that expression. Otherwise, the original_code
5489 element is set to ERROR_MARK.
5490 If we were outputting the elements as they are read, return 0 as the value
5491 from inner levels (process_init_element ignores that),
5492 but return error_mark_node as the value from the outermost level
5493 (that's what we want to put in DECL_INITIAL).
5494 Otherwise, return a CONSTRUCTOR expression as the value. */
5497 pop_init_level (int implicit
)
5499 struct constructor_stack
*p
;
5502 ret
.original_code
= ERROR_MARK
;
5506 /* When we come to an explicit close brace,
5507 pop any inner levels that didn't have explicit braces. */
5508 while (constructor_stack
->implicit
)
5509 process_init_element (pop_init_level (1));
5511 gcc_assert (!constructor_range_stack
);
5514 /* Now output all pending elements. */
5515 constructor_incremental
= 1;
5516 output_pending_init_elements (1);
5518 p
= constructor_stack
;
5520 /* Error for initializing a flexible array member, or a zero-length
5521 array member in an inappropriate context. */
5522 if (constructor_type
&& constructor_fields
5523 && TREE_CODE (constructor_type
) == ARRAY_TYPE
5524 && TYPE_DOMAIN (constructor_type
)
5525 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
)))
5527 /* Silently discard empty initializations. The parser will
5528 already have pedwarned for empty brackets. */
5529 if (integer_zerop (constructor_unfilled_index
))
5530 constructor_type
= NULL_TREE
;
5533 gcc_assert (!TYPE_SIZE (constructor_type
));
5535 if (constructor_depth
> 2)
5536 error_init ("initialization of flexible array member in a nested context");
5538 pedwarn_init ("initialization of a flexible array member");
5540 /* We have already issued an error message for the existence
5541 of a flexible array member not at the end of the structure.
5542 Discard the initializer so that we do not die later. */
5543 if (TREE_CHAIN (constructor_fields
) != NULL_TREE
)
5544 constructor_type
= NULL_TREE
;
5548 /* Warn when some struct elements are implicitly initialized to zero. */
5549 if (warn_missing_field_initializers
5551 && TREE_CODE (constructor_type
) == RECORD_TYPE
5552 && constructor_unfilled_fields
)
5554 /* Do not warn for flexible array members or zero-length arrays. */
5555 while (constructor_unfilled_fields
5556 && (!DECL_SIZE (constructor_unfilled_fields
)
5557 || integer_zerop (DECL_SIZE (constructor_unfilled_fields
))))
5558 constructor_unfilled_fields
= TREE_CHAIN (constructor_unfilled_fields
);
5560 /* Do not warn if this level of the initializer uses member
5561 designators; it is likely to be deliberate. */
5562 if (constructor_unfilled_fields
&& !constructor_designated
)
5564 push_member_name (constructor_unfilled_fields
);
5565 warning_init ("missing initializer");
5566 RESTORE_SPELLING_DEPTH (constructor_depth
);
5570 /* Pad out the end of the structure. */
5571 if (p
->replacement_value
.value
)
5572 /* If this closes a superfluous brace pair,
5573 just pass out the element between them. */
5574 ret
= p
->replacement_value
;
5575 else if (constructor_type
== 0)
5577 else if (TREE_CODE (constructor_type
) != RECORD_TYPE
5578 && TREE_CODE (constructor_type
) != UNION_TYPE
5579 && TREE_CODE (constructor_type
) != ARRAY_TYPE
5580 && TREE_CODE (constructor_type
) != VECTOR_TYPE
)
5582 /* A nonincremental scalar initializer--just return
5583 the element, after verifying there is just one. */
5584 if (VEC_empty (constructor_elt
,constructor_elements
))
5586 if (!constructor_erroneous
)
5587 error_init ("empty scalar initializer");
5588 ret
.value
= error_mark_node
;
5590 else if (VEC_length (constructor_elt
,constructor_elements
) != 1)
5592 error_init ("extra elements in scalar initializer");
5593 ret
.value
= VEC_index (constructor_elt
,constructor_elements
,0)->value
;
5596 ret
.value
= VEC_index (constructor_elt
,constructor_elements
,0)->value
;
5600 if (constructor_erroneous
)
5601 ret
.value
= error_mark_node
;
5604 ret
.value
= build_constructor (constructor_type
,
5605 constructor_elements
);
5606 if (constructor_constant
)
5607 TREE_CONSTANT (ret
.value
) = TREE_INVARIANT (ret
.value
) = 1;
5608 if (constructor_constant
&& constructor_simple
)
5609 TREE_STATIC (ret
.value
) = 1;
5613 constructor_type
= p
->type
;
5614 constructor_fields
= p
->fields
;
5615 constructor_index
= p
->index
;
5616 constructor_max_index
= p
->max_index
;
5617 constructor_unfilled_index
= p
->unfilled_index
;
5618 constructor_unfilled_fields
= p
->unfilled_fields
;
5619 constructor_bit_index
= p
->bit_index
;
5620 constructor_elements
= p
->elements
;
5621 constructor_constant
= p
->constant
;
5622 constructor_simple
= p
->simple
;
5623 constructor_erroneous
= p
->erroneous
;
5624 constructor_incremental
= p
->incremental
;
5625 constructor_designated
= p
->designated
;
5626 constructor_pending_elts
= p
->pending_elts
;
5627 constructor_depth
= p
->depth
;
5629 constructor_range_stack
= p
->range_stack
;
5630 RESTORE_SPELLING_DEPTH (constructor_depth
);
5632 constructor_stack
= p
->next
;
5635 if (ret
.value
== 0 && constructor_stack
== 0)
5636 ret
.value
= error_mark_node
;
5640 /* Common handling for both array range and field name designators.
5641 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5644 set_designator (int array
)
5647 enum tree_code subcode
;
5649 /* Don't die if an entire brace-pair level is superfluous
5650 in the containing level. */
5651 if (constructor_type
== 0)
5654 /* If there were errors in this designator list already, bail out
5656 if (designator_erroneous
)
5659 if (!designator_depth
)
5661 gcc_assert (!constructor_range_stack
);
5663 /* Designator list starts at the level of closest explicit
5665 while (constructor_stack
->implicit
)
5666 process_init_element (pop_init_level (1));
5667 constructor_designated
= 1;
5671 switch (TREE_CODE (constructor_type
))
5675 subtype
= TREE_TYPE (constructor_fields
);
5676 if (subtype
!= error_mark_node
)
5677 subtype
= TYPE_MAIN_VARIANT (subtype
);
5680 subtype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
5686 subcode
= TREE_CODE (subtype
);
5687 if (array
&& subcode
!= ARRAY_TYPE
)
5689 error_init ("array index in non-array initializer");
5692 else if (!array
&& subcode
!= RECORD_TYPE
&& subcode
!= UNION_TYPE
)
5694 error_init ("field name not in record or union initializer");
5698 constructor_designated
= 1;
5699 push_init_level (2);
5703 /* If there are range designators in designator list, push a new designator
5704 to constructor_range_stack. RANGE_END is end of such stack range or
5705 NULL_TREE if there is no range designator at this level. */
5708 push_range_stack (tree range_end
)
5710 struct constructor_range_stack
*p
;
5712 p
= GGC_NEW (struct constructor_range_stack
);
5713 p
->prev
= constructor_range_stack
;
5715 p
->fields
= constructor_fields
;
5716 p
->range_start
= constructor_index
;
5717 p
->index
= constructor_index
;
5718 p
->stack
= constructor_stack
;
5719 p
->range_end
= range_end
;
5720 if (constructor_range_stack
)
5721 constructor_range_stack
->next
= p
;
5722 constructor_range_stack
= p
;
5725 /* Within an array initializer, specify the next index to be initialized.
5726 FIRST is that index. If LAST is nonzero, then initialize a range
5727 of indices, running from FIRST through LAST. */
5730 set_init_index (tree first
, tree last
)
5732 if (set_designator (1))
5735 designator_erroneous
= 1;
5737 if (!INTEGRAL_TYPE_P (TREE_TYPE (first
))
5738 || (last
&& !INTEGRAL_TYPE_P (TREE_TYPE (last
))))
5740 error_init ("array index in initializer not of integer type");
5744 if (TREE_CODE (first
) != INTEGER_CST
)
5745 error_init ("nonconstant array index in initializer");
5746 else if (last
!= 0 && TREE_CODE (last
) != INTEGER_CST
)
5747 error_init ("nonconstant array index in initializer");
5748 else if (TREE_CODE (constructor_type
) != ARRAY_TYPE
)
5749 error_init ("array index in non-array initializer");
5750 else if (tree_int_cst_sgn (first
) == -1)
5751 error_init ("array index in initializer exceeds array bounds");
5752 else if (constructor_max_index
5753 && tree_int_cst_lt (constructor_max_index
, first
))
5754 error_init ("array index in initializer exceeds array bounds");
5757 constructor_index
= convert (bitsizetype
, first
);
5761 if (tree_int_cst_equal (first
, last
))
5763 else if (tree_int_cst_lt (last
, first
))
5765 error_init ("empty index range in initializer");
5770 last
= convert (bitsizetype
, last
);
5771 if (constructor_max_index
!= 0
5772 && tree_int_cst_lt (constructor_max_index
, last
))
5774 error_init ("array index range in initializer exceeds array bounds");
5781 designator_erroneous
= 0;
5782 if (constructor_range_stack
|| last
)
5783 push_range_stack (last
);
5787 /* Within a struct initializer, specify the next field to be initialized. */
5790 set_init_label (tree fieldname
)
5794 if (set_designator (0))
5797 designator_erroneous
= 1;
5799 if (TREE_CODE (constructor_type
) != RECORD_TYPE
5800 && TREE_CODE (constructor_type
) != UNION_TYPE
)
5802 error_init ("field name not in record or union initializer");
5806 for (tail
= TYPE_FIELDS (constructor_type
); tail
;
5807 tail
= TREE_CHAIN (tail
))
5809 if (DECL_NAME (tail
) == fieldname
)
5814 error ("unknown field %qE specified in initializer", fieldname
);
5817 constructor_fields
= tail
;
5819 designator_erroneous
= 0;
5820 if (constructor_range_stack
)
5821 push_range_stack (NULL_TREE
);
5825 /* Add a new initializer to the tree of pending initializers. PURPOSE
5826 identifies the initializer, either array index or field in a structure.
5827 VALUE is the value of that index or field. */
5830 add_pending_init (tree purpose
, tree value
)
5832 struct init_node
*p
, **q
, *r
;
5834 q
= &constructor_pending_elts
;
5837 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5842 if (tree_int_cst_lt (purpose
, p
->purpose
))
5844 else if (tree_int_cst_lt (p
->purpose
, purpose
))
5848 if (TREE_SIDE_EFFECTS (p
->value
))
5849 warning_init ("initialized field with side-effects overwritten");
5850 else if (warn_override_init
)
5851 warning_init ("initialized field overwritten");
5861 bitpos
= bit_position (purpose
);
5865 if (tree_int_cst_lt (bitpos
, bit_position (p
->purpose
)))
5867 else if (p
->purpose
!= purpose
)
5871 if (TREE_SIDE_EFFECTS (p
->value
))
5872 warning_init ("initialized field with side-effects overwritten");
5873 else if (warn_override_init
)
5874 warning_init ("initialized field overwritten");
5881 r
= GGC_NEW (struct init_node
);
5882 r
->purpose
= purpose
;
5893 struct init_node
*s
;
5897 if (p
->balance
== 0)
5899 else if (p
->balance
< 0)
5906 p
->left
->parent
= p
;
5923 constructor_pending_elts
= r
;
5928 struct init_node
*t
= r
->right
;
5932 r
->right
->parent
= r
;
5937 p
->left
->parent
= p
;
5940 p
->balance
= t
->balance
< 0;
5941 r
->balance
= -(t
->balance
> 0);
5956 constructor_pending_elts
= t
;
5962 /* p->balance == +1; growth of left side balances the node. */
5967 else /* r == p->right */
5969 if (p
->balance
== 0)
5970 /* Growth propagation from right side. */
5972 else if (p
->balance
> 0)
5979 p
->right
->parent
= p
;
5996 constructor_pending_elts
= r
;
5998 else /* r->balance == -1 */
6001 struct init_node
*t
= r
->left
;
6005 r
->left
->parent
= r
;
6010 p
->right
->parent
= p
;
6013 r
->balance
= (t
->balance
< 0);
6014 p
->balance
= -(t
->balance
> 0);
6029 constructor_pending_elts
= t
;
6035 /* p->balance == -1; growth of right side balances the node. */
6046 /* Build AVL tree from a sorted chain. */
6049 set_nonincremental_init (void)
6051 unsigned HOST_WIDE_INT ix
;
6054 if (TREE_CODE (constructor_type
) != RECORD_TYPE
6055 && TREE_CODE (constructor_type
) != ARRAY_TYPE
)
6058 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements
, ix
, index
, value
)
6059 add_pending_init (index
, value
);
6060 constructor_elements
= 0;
6061 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
6063 constructor_unfilled_fields
= TYPE_FIELDS (constructor_type
);
6064 /* Skip any nameless bit fields at the beginning. */
6065 while (constructor_unfilled_fields
!= 0
6066 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
6067 && DECL_NAME (constructor_unfilled_fields
) == 0)
6068 constructor_unfilled_fields
= TREE_CHAIN (constructor_unfilled_fields
);
6071 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6073 if (TYPE_DOMAIN (constructor_type
))
6074 constructor_unfilled_index
6075 = convert (bitsizetype
,
6076 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
6078 constructor_unfilled_index
= bitsize_zero_node
;
6080 constructor_incremental
= 0;
6083 /* Build AVL tree from a string constant. */
6086 set_nonincremental_init_from_string (tree str
)
6088 tree value
, purpose
, type
;
6089 HOST_WIDE_INT val
[2];
6090 const char *p
, *end
;
6091 int byte
, wchar_bytes
, charwidth
, bitpos
;
6093 gcc_assert (TREE_CODE (constructor_type
) == ARRAY_TYPE
);
6095 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str
)))
6096 == TYPE_PRECISION (char_type_node
))
6100 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str
)))
6101 == TYPE_PRECISION (wchar_type_node
));
6102 wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
6104 charwidth
= TYPE_PRECISION (char_type_node
);
6105 type
= TREE_TYPE (constructor_type
);
6106 p
= TREE_STRING_POINTER (str
);
6107 end
= p
+ TREE_STRING_LENGTH (str
);
6109 for (purpose
= bitsize_zero_node
;
6110 p
< end
&& !tree_int_cst_lt (constructor_max_index
, purpose
);
6111 purpose
= size_binop (PLUS_EXPR
, purpose
, bitsize_one_node
))
6113 if (wchar_bytes
== 1)
6115 val
[1] = (unsigned char) *p
++;
6122 for (byte
= 0; byte
< wchar_bytes
; byte
++)
6124 if (BYTES_BIG_ENDIAN
)
6125 bitpos
= (wchar_bytes
- byte
- 1) * charwidth
;
6127 bitpos
= byte
* charwidth
;
6128 val
[bitpos
< HOST_BITS_PER_WIDE_INT
]
6129 |= ((unsigned HOST_WIDE_INT
) ((unsigned char) *p
++))
6130 << (bitpos
% HOST_BITS_PER_WIDE_INT
);
6134 if (!TYPE_UNSIGNED (type
))
6136 bitpos
= ((wchar_bytes
- 1) * charwidth
) + HOST_BITS_PER_CHAR
;
6137 if (bitpos
< HOST_BITS_PER_WIDE_INT
)
6139 if (val
[1] & (((HOST_WIDE_INT
) 1) << (bitpos
- 1)))
6141 val
[1] |= ((HOST_WIDE_INT
) -1) << bitpos
;
6145 else if (bitpos
== HOST_BITS_PER_WIDE_INT
)
6150 else if (val
[0] & (((HOST_WIDE_INT
) 1)
6151 << (bitpos
- 1 - HOST_BITS_PER_WIDE_INT
)))
6152 val
[0] |= ((HOST_WIDE_INT
) -1)
6153 << (bitpos
- HOST_BITS_PER_WIDE_INT
);
6156 value
= build_int_cst_wide (type
, val
[1], val
[0]);
6157 add_pending_init (purpose
, value
);
6160 constructor_incremental
= 0;
6163 /* Return value of FIELD in pending initializer or zero if the field was
6164 not initialized yet. */
6167 find_init_member (tree field
)
6169 struct init_node
*p
;
6171 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6173 if (constructor_incremental
6174 && tree_int_cst_lt (field
, constructor_unfilled_index
))
6175 set_nonincremental_init ();
6177 p
= constructor_pending_elts
;
6180 if (tree_int_cst_lt (field
, p
->purpose
))
6182 else if (tree_int_cst_lt (p
->purpose
, field
))
6188 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
6190 tree bitpos
= bit_position (field
);
6192 if (constructor_incremental
6193 && (!constructor_unfilled_fields
6194 || tree_int_cst_lt (bitpos
,
6195 bit_position (constructor_unfilled_fields
))))
6196 set_nonincremental_init ();
6198 p
= constructor_pending_elts
;
6201 if (field
== p
->purpose
)
6203 else if (tree_int_cst_lt (bitpos
, bit_position (p
->purpose
)))
6209 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
6211 if (!VEC_empty (constructor_elt
, constructor_elements
)
6212 && (VEC_last (constructor_elt
, constructor_elements
)->index
6214 return VEC_last (constructor_elt
, constructor_elements
)->value
;
6219 /* "Output" the next constructor element.
6220 At top level, really output it to assembler code now.
6221 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6222 TYPE is the data type that the containing data type wants here.
6223 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6224 If VALUE is a string constant, STRICT_STRING is true if it is
6225 unparenthesized or we should not warn here for it being parenthesized.
6226 For other types of VALUE, STRICT_STRING is not used.
6228 PENDING if non-nil means output pending elements that belong
6229 right after this element. (PENDING is normally 1;
6230 it is 0 while outputting pending elements, to avoid recursion.) */
6233 output_init_element (tree value
, bool strict_string
, tree type
, tree field
,
6236 constructor_elt
*celt
;
6238 if (type
== error_mark_node
|| value
== error_mark_node
)
6240 constructor_erroneous
= 1;
6243 if (TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
6244 && (TREE_CODE (value
) == STRING_CST
6245 || TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
)
6246 && !(TREE_CODE (value
) == STRING_CST
6247 && TREE_CODE (type
) == ARRAY_TYPE
6248 && INTEGRAL_TYPE_P (TREE_TYPE (type
)))
6249 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value
)),
6250 TYPE_MAIN_VARIANT (type
)))
6251 value
= array_to_pointer_conversion (value
);
6253 if (TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
6254 && require_constant_value
&& !flag_isoc99
&& pending
)
6256 /* As an extension, allow initializing objects with static storage
6257 duration with compound literals (which are then treated just as
6258 the brace enclosed list they contain). */
6259 tree decl
= COMPOUND_LITERAL_EXPR_DECL (value
);
6260 value
= DECL_INITIAL (decl
);
6263 if (value
== error_mark_node
)
6264 constructor_erroneous
= 1;
6265 else if (!TREE_CONSTANT (value
))
6266 constructor_constant
= 0;
6267 else if (!initializer_constant_valid_p (value
, TREE_TYPE (value
))
6268 || ((TREE_CODE (constructor_type
) == RECORD_TYPE
6269 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6270 && DECL_C_BIT_FIELD (field
)
6271 && TREE_CODE (value
) != INTEGER_CST
))
6272 constructor_simple
= 0;
6274 if (!initializer_constant_valid_p (value
, TREE_TYPE (value
)))
6276 if (require_constant_value
)
6278 error_init ("initializer element is not constant");
6279 value
= error_mark_node
;
6281 else if (require_constant_elements
)
6282 pedwarn ("initializer element is not computable at load time");
6285 /* If this field is empty (and not at the end of structure),
6286 don't do anything other than checking the initializer. */
6288 && (TREE_TYPE (field
) == error_mark_node
6289 || (COMPLETE_TYPE_P (TREE_TYPE (field
))
6290 && integer_zerop (TYPE_SIZE (TREE_TYPE (field
)))
6291 && (TREE_CODE (constructor_type
) == ARRAY_TYPE
6292 || TREE_CHAIN (field
)))))
6295 value
= digest_init (type
, value
, strict_string
, require_constant_value
);
6296 if (value
== error_mark_node
)
6298 constructor_erroneous
= 1;
6302 /* If this element doesn't come next in sequence,
6303 put it on constructor_pending_elts. */
6304 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
6305 && (!constructor_incremental
6306 || !tree_int_cst_equal (field
, constructor_unfilled_index
)))
6308 if (constructor_incremental
6309 && tree_int_cst_lt (field
, constructor_unfilled_index
))
6310 set_nonincremental_init ();
6312 add_pending_init (field
, value
);
6315 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
6316 && (!constructor_incremental
6317 || field
!= constructor_unfilled_fields
))
6319 /* We do this for records but not for unions. In a union,
6320 no matter which field is specified, it can be initialized
6321 right away since it starts at the beginning of the union. */
6322 if (constructor_incremental
)
6324 if (!constructor_unfilled_fields
)
6325 set_nonincremental_init ();
6328 tree bitpos
, unfillpos
;
6330 bitpos
= bit_position (field
);
6331 unfillpos
= bit_position (constructor_unfilled_fields
);
6333 if (tree_int_cst_lt (bitpos
, unfillpos
))
6334 set_nonincremental_init ();
6338 add_pending_init (field
, value
);
6341 else if (TREE_CODE (constructor_type
) == UNION_TYPE
6342 && !VEC_empty (constructor_elt
, constructor_elements
))
6344 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt
,
6345 constructor_elements
)->value
))
6346 warning_init ("initialized field with side-effects overwritten");
6347 else if (warn_override_init
)
6348 warning_init ("initialized field overwritten");
6350 /* We can have just one union field set. */
6351 constructor_elements
= 0;
6354 /* Otherwise, output this element either to
6355 constructor_elements or to the assembler file. */
6357 celt
= VEC_safe_push (constructor_elt
, gc
, constructor_elements
, NULL
);
6358 celt
->index
= field
;
6359 celt
->value
= value
;
6361 /* Advance the variable that indicates sequential elements output. */
6362 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6363 constructor_unfilled_index
6364 = size_binop (PLUS_EXPR
, constructor_unfilled_index
,
6366 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
6368 constructor_unfilled_fields
6369 = TREE_CHAIN (constructor_unfilled_fields
);
6371 /* Skip any nameless bit fields. */
6372 while (constructor_unfilled_fields
!= 0
6373 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
6374 && DECL_NAME (constructor_unfilled_fields
) == 0)
6375 constructor_unfilled_fields
=
6376 TREE_CHAIN (constructor_unfilled_fields
);
6378 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
6379 constructor_unfilled_fields
= 0;
6381 /* Now output any pending elements which have become next. */
6383 output_pending_init_elements (0);
6386 /* Output any pending elements which have become next.
6387 As we output elements, constructor_unfilled_{fields,index}
6388 advances, which may cause other elements to become next;
6389 if so, they too are output.
6391 If ALL is 0, we return when there are
6392 no more pending elements to output now.
6394 If ALL is 1, we output space as necessary so that
6395 we can output all the pending elements. */
6398 output_pending_init_elements (int all
)
6400 struct init_node
*elt
= constructor_pending_elts
;
6405 /* Look through the whole pending tree.
6406 If we find an element that should be output now,
6407 output it. Otherwise, set NEXT to the element
6408 that comes first among those still pending. */
6413 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6415 if (tree_int_cst_equal (elt
->purpose
,
6416 constructor_unfilled_index
))
6417 output_init_element (elt
->value
, true,
6418 TREE_TYPE (constructor_type
),
6419 constructor_unfilled_index
, 0);
6420 else if (tree_int_cst_lt (constructor_unfilled_index
,
6423 /* Advance to the next smaller node. */
6428 /* We have reached the smallest node bigger than the
6429 current unfilled index. Fill the space first. */
6430 next
= elt
->purpose
;
6436 /* Advance to the next bigger node. */
6441 /* We have reached the biggest node in a subtree. Find
6442 the parent of it, which is the next bigger node. */
6443 while (elt
->parent
&& elt
->parent
->right
== elt
)
6446 if (elt
&& tree_int_cst_lt (constructor_unfilled_index
,
6449 next
= elt
->purpose
;
6455 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
6456 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6458 tree ctor_unfilled_bitpos
, elt_bitpos
;
6460 /* If the current record is complete we are done. */
6461 if (constructor_unfilled_fields
== 0)
6464 ctor_unfilled_bitpos
= bit_position (constructor_unfilled_fields
);
6465 elt_bitpos
= bit_position (elt
->purpose
);
6466 /* We can't compare fields here because there might be empty
6467 fields in between. */
6468 if (tree_int_cst_equal (elt_bitpos
, ctor_unfilled_bitpos
))
6470 constructor_unfilled_fields
= elt
->purpose
;
6471 output_init_element (elt
->value
, true, TREE_TYPE (elt
->purpose
),
6474 else if (tree_int_cst_lt (ctor_unfilled_bitpos
, elt_bitpos
))
6476 /* Advance to the next smaller node. */
6481 /* We have reached the smallest node bigger than the
6482 current unfilled field. Fill the space first. */
6483 next
= elt
->purpose
;
6489 /* Advance to the next bigger node. */
6494 /* We have reached the biggest node in a subtree. Find
6495 the parent of it, which is the next bigger node. */
6496 while (elt
->parent
&& elt
->parent
->right
== elt
)
6500 && (tree_int_cst_lt (ctor_unfilled_bitpos
,
6501 bit_position (elt
->purpose
))))
6503 next
= elt
->purpose
;
6511 /* Ordinarily return, but not if we want to output all
6512 and there are elements left. */
6513 if (!(all
&& next
!= 0))
6516 /* If it's not incremental, just skip over the gap, so that after
6517 jumping to retry we will output the next successive element. */
6518 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6519 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6520 constructor_unfilled_fields
= next
;
6521 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6522 constructor_unfilled_index
= next
;
6524 /* ELT now points to the node in the pending tree with the next
6525 initializer to output. */
6529 /* Add one non-braced element to the current constructor level.
6530 This adjusts the current position within the constructor's type.
6531 This may also start or terminate implicit levels
6532 to handle a partly-braced initializer.
6534 Once this has found the correct level for the new element,
6535 it calls output_init_element. */
6538 process_init_element (struct c_expr value
)
6540 tree orig_value
= value
.value
;
6541 int string_flag
= orig_value
!= 0 && TREE_CODE (orig_value
) == STRING_CST
;
6542 bool strict_string
= value
.original_code
== STRING_CST
;
6544 designator_depth
= 0;
6545 designator_erroneous
= 0;
6547 /* Handle superfluous braces around string cst as in
6548 char x[] = {"foo"}; */
6551 && TREE_CODE (constructor_type
) == ARRAY_TYPE
6552 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type
))
6553 && integer_zerop (constructor_unfilled_index
))
6555 if (constructor_stack
->replacement_value
.value
)
6556 error_init ("excess elements in char array initializer");
6557 constructor_stack
->replacement_value
= value
;
6561 if (constructor_stack
->replacement_value
.value
!= 0)
6563 error_init ("excess elements in struct initializer");
6567 /* Ignore elements of a brace group if it is entirely superfluous
6568 and has already been diagnosed. */
6569 if (constructor_type
== 0)
6572 /* If we've exhausted any levels that didn't have braces,
6574 while (constructor_stack
->implicit
)
6576 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
6577 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6578 && constructor_fields
== 0)
6579 process_init_element (pop_init_level (1));
6580 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
6581 && (constructor_max_index
== 0
6582 || tree_int_cst_lt (constructor_max_index
,
6583 constructor_index
)))
6584 process_init_element (pop_init_level (1));
6589 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6590 if (constructor_range_stack
)
6592 /* If value is a compound literal and we'll be just using its
6593 content, don't put it into a SAVE_EXPR. */
6594 if (TREE_CODE (value
.value
) != COMPOUND_LITERAL_EXPR
6595 || !require_constant_value
6597 value
.value
= save_expr (value
.value
);
6602 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
6605 enum tree_code fieldcode
;
6607 if (constructor_fields
== 0)
6609 pedwarn_init ("excess elements in struct initializer");
6613 fieldtype
= TREE_TYPE (constructor_fields
);
6614 if (fieldtype
!= error_mark_node
)
6615 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
6616 fieldcode
= TREE_CODE (fieldtype
);
6618 /* Error for non-static initialization of a flexible array member. */
6619 if (fieldcode
== ARRAY_TYPE
6620 && !require_constant_value
6621 && TYPE_SIZE (fieldtype
) == NULL_TREE
6622 && TREE_CHAIN (constructor_fields
) == NULL_TREE
)
6624 error_init ("non-static initialization of a flexible array member");
6628 /* Accept a string constant to initialize a subarray. */
6629 if (value
.value
!= 0
6630 && fieldcode
== ARRAY_TYPE
6631 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype
))
6633 value
.value
= orig_value
;
6634 /* Otherwise, if we have come to a subaggregate,
6635 and we don't have an element of its type, push into it. */
6636 else if (value
.value
!= 0
6637 && value
.value
!= error_mark_node
6638 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != fieldtype
6639 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
6640 || fieldcode
== UNION_TYPE
))
6642 push_init_level (1);
6648 push_member_name (constructor_fields
);
6649 output_init_element (value
.value
, strict_string
,
6650 fieldtype
, constructor_fields
, 1);
6651 RESTORE_SPELLING_DEPTH (constructor_depth
);
6654 /* Do the bookkeeping for an element that was
6655 directly output as a constructor. */
6657 /* For a record, keep track of end position of last field. */
6658 if (DECL_SIZE (constructor_fields
))
6659 constructor_bit_index
6660 = size_binop (PLUS_EXPR
,
6661 bit_position (constructor_fields
),
6662 DECL_SIZE (constructor_fields
));
6664 /* If the current field was the first one not yet written out,
6665 it isn't now, so update. */
6666 if (constructor_unfilled_fields
== constructor_fields
)
6668 constructor_unfilled_fields
= TREE_CHAIN (constructor_fields
);
6669 /* Skip any nameless bit fields. */
6670 while (constructor_unfilled_fields
!= 0
6671 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
6672 && DECL_NAME (constructor_unfilled_fields
) == 0)
6673 constructor_unfilled_fields
=
6674 TREE_CHAIN (constructor_unfilled_fields
);
6678 constructor_fields
= TREE_CHAIN (constructor_fields
);
6679 /* Skip any nameless bit fields at the beginning. */
6680 while (constructor_fields
!= 0
6681 && DECL_C_BIT_FIELD (constructor_fields
)
6682 && DECL_NAME (constructor_fields
) == 0)
6683 constructor_fields
= TREE_CHAIN (constructor_fields
);
6685 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
6688 enum tree_code fieldcode
;
6690 if (constructor_fields
== 0)
6692 pedwarn_init ("excess elements in union initializer");
6696 fieldtype
= TREE_TYPE (constructor_fields
);
6697 if (fieldtype
!= error_mark_node
)
6698 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
6699 fieldcode
= TREE_CODE (fieldtype
);
6701 /* Warn that traditional C rejects initialization of unions.
6702 We skip the warning if the value is zero. This is done
6703 under the assumption that the zero initializer in user
6704 code appears conditioned on e.g. __STDC__ to avoid
6705 "missing initializer" warnings and relies on default
6706 initialization to zero in the traditional C case.
6707 We also skip the warning if the initializer is designated,
6708 again on the assumption that this must be conditional on
6709 __STDC__ anyway (and we've already complained about the
6710 member-designator already). */
6711 if (!in_system_header
&& !constructor_designated
6712 && !(value
.value
&& (integer_zerop (value
.value
)
6713 || real_zerop (value
.value
))))
6714 warning (OPT_Wtraditional
, "traditional C rejects initialization "
6717 /* Accept a string constant to initialize a subarray. */
6718 if (value
.value
!= 0
6719 && fieldcode
== ARRAY_TYPE
6720 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype
))
6722 value
.value
= orig_value
;
6723 /* Otherwise, if we have come to a subaggregate,
6724 and we don't have an element of its type, push into it. */
6725 else if (value
.value
!= 0
6726 && value
.value
!= error_mark_node
6727 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != fieldtype
6728 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
6729 || fieldcode
== UNION_TYPE
))
6731 push_init_level (1);
6737 push_member_name (constructor_fields
);
6738 output_init_element (value
.value
, strict_string
,
6739 fieldtype
, constructor_fields
, 1);
6740 RESTORE_SPELLING_DEPTH (constructor_depth
);
6743 /* Do the bookkeeping for an element that was
6744 directly output as a constructor. */
6746 constructor_bit_index
= DECL_SIZE (constructor_fields
);
6747 constructor_unfilled_fields
= TREE_CHAIN (constructor_fields
);
6750 constructor_fields
= 0;
6752 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6754 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
6755 enum tree_code eltcode
= TREE_CODE (elttype
);
6757 /* Accept a string constant to initialize a subarray. */
6758 if (value
.value
!= 0
6759 && eltcode
== ARRAY_TYPE
6760 && INTEGRAL_TYPE_P (TREE_TYPE (elttype
))
6762 value
.value
= orig_value
;
6763 /* Otherwise, if we have come to a subaggregate,
6764 and we don't have an element of its type, push into it. */
6765 else if (value
.value
!= 0
6766 && value
.value
!= error_mark_node
6767 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != elttype
6768 && (eltcode
== RECORD_TYPE
|| eltcode
== ARRAY_TYPE
6769 || eltcode
== UNION_TYPE
))
6771 push_init_level (1);
6775 if (constructor_max_index
!= 0
6776 && (tree_int_cst_lt (constructor_max_index
, constructor_index
)
6777 || integer_all_onesp (constructor_max_index
)))
6779 pedwarn_init ("excess elements in array initializer");
6783 /* Now output the actual element. */
6786 push_array_bounds (tree_low_cst (constructor_index
, 1));
6787 output_init_element (value
.value
, strict_string
,
6788 elttype
, constructor_index
, 1);
6789 RESTORE_SPELLING_DEPTH (constructor_depth
);
6793 = size_binop (PLUS_EXPR
, constructor_index
, bitsize_one_node
);
6796 /* If we are doing the bookkeeping for an element that was
6797 directly output as a constructor, we must update
6798 constructor_unfilled_index. */
6799 constructor_unfilled_index
= constructor_index
;
6801 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
6803 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
6805 /* Do a basic check of initializer size. Note that vectors
6806 always have a fixed size derived from their type. */
6807 if (tree_int_cst_lt (constructor_max_index
, constructor_index
))
6809 pedwarn_init ("excess elements in vector initializer");
6813 /* Now output the actual element. */
6815 output_init_element (value
.value
, strict_string
,
6816 elttype
, constructor_index
, 1);
6819 = size_binop (PLUS_EXPR
, constructor_index
, bitsize_one_node
);
6822 /* If we are doing the bookkeeping for an element that was
6823 directly output as a constructor, we must update
6824 constructor_unfilled_index. */
6825 constructor_unfilled_index
= constructor_index
;
6828 /* Handle the sole element allowed in a braced initializer
6829 for a scalar variable. */
6830 else if (constructor_type
!= error_mark_node
6831 && constructor_fields
== 0)
6833 pedwarn_init ("excess elements in scalar initializer");
6839 output_init_element (value
.value
, strict_string
,
6840 constructor_type
, NULL_TREE
, 1);
6841 constructor_fields
= 0;
6844 /* Handle range initializers either at this level or anywhere higher
6845 in the designator stack. */
6846 if (constructor_range_stack
)
6848 struct constructor_range_stack
*p
, *range_stack
;
6851 range_stack
= constructor_range_stack
;
6852 constructor_range_stack
= 0;
6853 while (constructor_stack
!= range_stack
->stack
)
6855 gcc_assert (constructor_stack
->implicit
);
6856 process_init_element (pop_init_level (1));
6858 for (p
= range_stack
;
6859 !p
->range_end
|| tree_int_cst_equal (p
->index
, p
->range_end
);
6862 gcc_assert (constructor_stack
->implicit
);
6863 process_init_element (pop_init_level (1));
6866 p
->index
= size_binop (PLUS_EXPR
, p
->index
, bitsize_one_node
);
6867 if (tree_int_cst_equal (p
->index
, p
->range_end
) && !p
->prev
)
6872 constructor_index
= p
->index
;
6873 constructor_fields
= p
->fields
;
6874 if (finish
&& p
->range_end
&& p
->index
== p
->range_start
)
6882 push_init_level (2);
6883 p
->stack
= constructor_stack
;
6884 if (p
->range_end
&& tree_int_cst_equal (p
->index
, p
->range_end
))
6885 p
->index
= p
->range_start
;
6889 constructor_range_stack
= range_stack
;
6896 constructor_range_stack
= 0;
6899 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6900 (guaranteed to be 'volatile' or null) and ARGS (represented using
6901 an ASM_EXPR node). */
6903 build_asm_stmt (tree cv_qualifier
, tree args
)
6905 if (!ASM_VOLATILE_P (args
) && cv_qualifier
)
6906 ASM_VOLATILE_P (args
) = 1;
6907 return add_stmt (args
);
6910 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6911 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6912 SIMPLE indicates whether there was anything at all after the
6913 string in the asm expression -- asm("blah") and asm("blah" : )
6914 are subtly different. We use a ASM_EXPR node to represent this. */
6916 build_asm_expr (tree string
, tree outputs
, tree inputs
, tree clobbers
,
6922 const char *constraint
;
6923 const char **oconstraints
;
6924 bool allows_mem
, allows_reg
, is_inout
;
6925 int ninputs
, noutputs
;
6927 ninputs
= list_length (inputs
);
6928 noutputs
= list_length (outputs
);
6929 oconstraints
= (const char **) alloca (noutputs
* sizeof (const char *));
6931 string
= resolve_asm_operand_names (string
, outputs
, inputs
);
6933 /* Remove output conversions that change the type but not the mode. */
6934 for (i
= 0, tail
= outputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
6936 tree output
= TREE_VALUE (tail
);
6938 /* ??? Really, this should not be here. Users should be using a
6939 proper lvalue, dammit. But there's a long history of using casts
6940 in the output operands. In cases like longlong.h, this becomes a
6941 primitive form of typechecking -- if the cast can be removed, then
6942 the output operand had a type of the proper width; otherwise we'll
6943 get an error. Gross, but ... */
6944 STRIP_NOPS (output
);
6946 if (!lvalue_or_else (output
, lv_asm
))
6947 output
= error_mark_node
;
6949 if (output
!= error_mark_node
6950 && (TREE_READONLY (output
)
6951 || TYPE_READONLY (TREE_TYPE (output
))
6952 || ((TREE_CODE (TREE_TYPE (output
)) == RECORD_TYPE
6953 || TREE_CODE (TREE_TYPE (output
)) == UNION_TYPE
)
6954 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output
)))))
6955 readonly_error (output
, lv_asm
);
6957 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
6958 oconstraints
[i
] = constraint
;
6960 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
6961 &allows_mem
, &allows_reg
, &is_inout
))
6963 /* If the operand is going to end up in memory,
6964 mark it addressable. */
6965 if (!allows_reg
&& !c_mark_addressable (output
))
6966 output
= error_mark_node
;
6969 output
= error_mark_node
;
6971 TREE_VALUE (tail
) = output
;
6974 for (i
= 0, tail
= inputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
6978 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
6979 input
= TREE_VALUE (tail
);
6981 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
6982 oconstraints
, &allows_mem
, &allows_reg
))
6984 /* If the operand is going to end up in memory,
6985 mark it addressable. */
6986 if (!allows_reg
&& allows_mem
)
6988 /* Strip the nops as we allow this case. FIXME, this really
6989 should be rejected or made deprecated. */
6991 if (!c_mark_addressable (input
))
6992 input
= error_mark_node
;
6996 input
= error_mark_node
;
6998 TREE_VALUE (tail
) = input
;
7001 args
= build_stmt (ASM_EXPR
, string
, outputs
, inputs
, clobbers
);
7003 /* asm statements without outputs, including simple ones, are treated
7005 ASM_INPUT_P (args
) = simple
;
7006 ASM_VOLATILE_P (args
) = (noutputs
== 0);
7011 /* Generate a goto statement to LABEL. */
7014 c_finish_goto_label (tree label
)
7016 tree decl
= lookup_label (label
);
7020 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl
))
7022 error ("jump into statement expression");
7026 if (C_DECL_UNJUMPABLE_VM (decl
))
7028 error ("jump into scope of identifier with variably modified type");
7032 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl
))
7034 /* No jump from outside this statement expression context, so
7035 record that there is a jump from within this context. */
7036 struct c_label_list
*nlist
;
7037 nlist
= XOBNEW (&parser_obstack
, struct c_label_list
);
7038 nlist
->next
= label_context_stack_se
->labels_used
;
7039 nlist
->label
= decl
;
7040 label_context_stack_se
->labels_used
= nlist
;
7043 if (!C_DECL_UNDEFINABLE_VM (decl
))
7045 /* No jump from outside this context context of identifiers with
7046 variably modified type, so record that there is a jump from
7047 within this context. */
7048 struct c_label_list
*nlist
;
7049 nlist
= XOBNEW (&parser_obstack
, struct c_label_list
);
7050 nlist
->next
= label_context_stack_vm
->labels_used
;
7051 nlist
->label
= decl
;
7052 label_context_stack_vm
->labels_used
= nlist
;
7055 TREE_USED (decl
) = 1;
7056 return add_stmt (build1 (GOTO_EXPR
, void_type_node
, decl
));
7059 /* Generate a computed goto statement to EXPR. */
7062 c_finish_goto_ptr (tree expr
)
7065 pedwarn ("ISO C forbids %<goto *expr;%>");
7066 expr
= convert (ptr_type_node
, expr
);
7067 return add_stmt (build1 (GOTO_EXPR
, void_type_node
, expr
));
7070 /* Generate a C `return' statement. RETVAL is the expression for what
7071 to return, or a null pointer for `return;' with no value. */
7074 c_finish_return (tree retval
)
7076 tree valtype
= TREE_TYPE (TREE_TYPE (current_function_decl
)), ret_stmt
;
7077 bool no_warning
= false;
7079 if (TREE_THIS_VOLATILE (current_function_decl
))
7080 warning (0, "function declared %<noreturn%> has a %<return%> statement");
7084 current_function_returns_null
= 1;
7085 if ((warn_return_type
|| flag_isoc99
)
7086 && valtype
!= 0 && TREE_CODE (valtype
) != VOID_TYPE
)
7088 pedwarn_c99 ("%<return%> with no value, in "
7089 "function returning non-void");
7093 else if (valtype
== 0 || TREE_CODE (valtype
) == VOID_TYPE
)
7095 current_function_returns_null
= 1;
7096 if (TREE_CODE (TREE_TYPE (retval
)) != VOID_TYPE
)
7097 pedwarn ("%<return%> with a value, in function returning void");
7099 pedwarn ("ISO C forbids %<return%> with expression, in function returning void");
7103 tree t
= convert_for_assignment (valtype
, retval
, ic_return
,
7104 NULL_TREE
, NULL_TREE
, 0);
7105 tree res
= DECL_RESULT (current_function_decl
);
7108 current_function_returns_value
= 1;
7109 if (t
== error_mark_node
)
7112 inner
= t
= convert (TREE_TYPE (res
), t
);
7114 /* Strip any conversions, additions, and subtractions, and see if
7115 we are returning the address of a local variable. Warn if so. */
7118 switch (TREE_CODE (inner
))
7120 case NOP_EXPR
: case NON_LVALUE_EXPR
: case CONVERT_EXPR
:
7122 inner
= TREE_OPERAND (inner
, 0);
7126 /* If the second operand of the MINUS_EXPR has a pointer
7127 type (or is converted from it), this may be valid, so
7128 don't give a warning. */
7130 tree op1
= TREE_OPERAND (inner
, 1);
7132 while (!POINTER_TYPE_P (TREE_TYPE (op1
))
7133 && (TREE_CODE (op1
) == NOP_EXPR
7134 || TREE_CODE (op1
) == NON_LVALUE_EXPR
7135 || TREE_CODE (op1
) == CONVERT_EXPR
))
7136 op1
= TREE_OPERAND (op1
, 0);
7138 if (POINTER_TYPE_P (TREE_TYPE (op1
)))
7141 inner
= TREE_OPERAND (inner
, 0);
7146 inner
= TREE_OPERAND (inner
, 0);
7148 while (REFERENCE_CLASS_P (inner
)
7149 && TREE_CODE (inner
) != INDIRECT_REF
)
7150 inner
= TREE_OPERAND (inner
, 0);
7153 && !DECL_EXTERNAL (inner
)
7154 && !TREE_STATIC (inner
)
7155 && DECL_CONTEXT (inner
) == current_function_decl
)
7156 warning (0, "function returns address of local variable");
7166 retval
= build2 (MODIFY_EXPR
, TREE_TYPE (res
), res
, t
);
7169 ret_stmt
= build_stmt (RETURN_EXPR
, retval
);
7170 TREE_NO_WARNING (ret_stmt
) |= no_warning
;
7171 return add_stmt (ret_stmt
);
7175 /* The SWITCH_EXPR being built. */
7178 /* The original type of the testing expression, i.e. before the
7179 default conversion is applied. */
7182 /* A splay-tree mapping the low element of a case range to the high
7183 element, or NULL_TREE if there is no high element. Used to
7184 determine whether or not a new case label duplicates an old case
7185 label. We need a tree, rather than simply a hash table, because
7186 of the GNU case range extension. */
7189 /* Number of nested statement expressions within this switch
7190 statement; if nonzero, case and default labels may not
7192 unsigned int blocked_stmt_expr
;
7194 /* Scope of outermost declarations of identifiers with variably
7195 modified type within this switch statement; if nonzero, case and
7196 default labels may not appear. */
7197 unsigned int blocked_vm
;
7199 /* The next node on the stack. */
7200 struct c_switch
*next
;
7203 /* A stack of the currently active switch statements. The innermost
7204 switch statement is on the top of the stack. There is no need to
7205 mark the stack for garbage collection because it is only active
7206 during the processing of the body of a function, and we never
7207 collect at that point. */
7209 struct c_switch
*c_switch_stack
;
7211 /* Start a C switch statement, testing expression EXP. Return the new
7215 c_start_case (tree exp
)
7217 tree orig_type
= error_mark_node
;
7218 struct c_switch
*cs
;
7220 if (exp
!= error_mark_node
)
7222 orig_type
= TREE_TYPE (exp
);
7224 if (!INTEGRAL_TYPE_P (orig_type
))
7226 if (orig_type
!= error_mark_node
)
7228 error ("switch quantity not an integer");
7229 orig_type
= error_mark_node
;
7231 exp
= integer_zero_node
;
7235 tree type
= TYPE_MAIN_VARIANT (orig_type
);
7237 if (!in_system_header
7238 && (type
== long_integer_type_node
7239 || type
== long_unsigned_type_node
))
7240 warning (OPT_Wtraditional
, "%<long%> switch expression not "
7241 "converted to %<int%> in ISO C");
7243 exp
= default_conversion (exp
);
7247 /* Add this new SWITCH_EXPR to the stack. */
7248 cs
= XNEW (struct c_switch
);
7249 cs
->switch_expr
= build3 (SWITCH_EXPR
, orig_type
, exp
, NULL_TREE
, NULL_TREE
);
7250 cs
->orig_type
= orig_type
;
7251 cs
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
7252 cs
->blocked_stmt_expr
= 0;
7254 cs
->next
= c_switch_stack
;
7255 c_switch_stack
= cs
;
7257 return add_stmt (cs
->switch_expr
);
7260 /* Process a case label. */
7263 do_case (tree low_value
, tree high_value
)
7265 tree label
= NULL_TREE
;
7267 if (c_switch_stack
&& !c_switch_stack
->blocked_stmt_expr
7268 && !c_switch_stack
->blocked_vm
)
7270 label
= c_add_case_label (c_switch_stack
->cases
,
7271 SWITCH_COND (c_switch_stack
->switch_expr
),
7272 c_switch_stack
->orig_type
,
7273 low_value
, high_value
);
7274 if (label
== error_mark_node
)
7277 else if (c_switch_stack
&& c_switch_stack
->blocked_stmt_expr
)
7280 error ("case label in statement expression not containing "
7281 "enclosing switch statement");
7283 error ("%<default%> label in statement expression not containing "
7284 "enclosing switch statement");
7286 else if (c_switch_stack
&& c_switch_stack
->blocked_vm
)
7289 error ("case label in scope of identifier with variably modified "
7290 "type not containing enclosing switch statement");
7292 error ("%<default%> label in scope of identifier with variably "
7293 "modified type not containing enclosing switch statement");
7296 error ("case label not within a switch statement");
7298 error ("%<default%> label not within a switch statement");
7303 /* Finish the switch statement. */
7306 c_finish_case (tree body
)
7308 struct c_switch
*cs
= c_switch_stack
;
7309 location_t switch_location
;
7311 SWITCH_BODY (cs
->switch_expr
) = body
;
7313 /* We must not be within a statement expression nested in the switch
7314 at this point; we might, however, be within the scope of an
7315 identifier with variably modified type nested in the switch. */
7316 gcc_assert (!cs
->blocked_stmt_expr
);
7318 /* Emit warnings as needed. */
7319 if (EXPR_HAS_LOCATION (cs
->switch_expr
))
7320 switch_location
= EXPR_LOCATION (cs
->switch_expr
);
7322 switch_location
= input_location
;
7323 c_do_switch_warnings (cs
->cases
, switch_location
,
7324 TREE_TYPE (cs
->switch_expr
),
7325 SWITCH_COND (cs
->switch_expr
));
7327 /* Pop the stack. */
7328 c_switch_stack
= cs
->next
;
7329 splay_tree_delete (cs
->cases
);
7333 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7334 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7335 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7336 statement, and was not surrounded with parenthesis. */
7339 c_finish_if_stmt (location_t if_locus
, tree cond
, tree then_block
,
7340 tree else_block
, bool nested_if
)
7344 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7345 if (warn_parentheses
&& nested_if
&& else_block
== NULL
)
7347 tree inner_if
= then_block
;
7349 /* We know from the grammar productions that there is an IF nested
7350 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7351 it might not be exactly THEN_BLOCK, but should be the last
7352 non-container statement within. */
7354 switch (TREE_CODE (inner_if
))
7359 inner_if
= BIND_EXPR_BODY (inner_if
);
7361 case STATEMENT_LIST
:
7362 inner_if
= expr_last (then_block
);
7364 case TRY_FINALLY_EXPR
:
7365 case TRY_CATCH_EXPR
:
7366 inner_if
= TREE_OPERAND (inner_if
, 0);
7373 if (COND_EXPR_ELSE (inner_if
))
7374 warning (OPT_Wparentheses
,
7375 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7379 empty_if_body_warning (then_block
, else_block
);
7381 stmt
= build3 (COND_EXPR
, void_type_node
, cond
, then_block
, else_block
);
7382 SET_EXPR_LOCATION (stmt
, if_locus
);
7386 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7387 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7388 is false for DO loops. INCR is the FOR increment expression. BODY is
7389 the statement controlled by the loop. BLAB is the break label. CLAB is
7390 the continue label. Everything is allowed to be NULL. */
7393 c_finish_loop (location_t start_locus
, tree cond
, tree incr
, tree body
,
7394 tree blab
, tree clab
, bool cond_is_first
)
7396 tree entry
= NULL
, exit
= NULL
, t
;
7398 /* If the condition is zero don't generate a loop construct. */
7399 if (cond
&& integer_zerop (cond
))
7403 t
= build_and_jump (&blab
);
7404 SET_EXPR_LOCATION (t
, start_locus
);
7410 tree top
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
7412 /* If we have an exit condition, then we build an IF with gotos either
7413 out of the loop, or to the top of it. If there's no exit condition,
7414 then we just build a jump back to the top. */
7415 exit
= build_and_jump (&LABEL_EXPR_LABEL (top
));
7417 if (cond
&& !integer_nonzerop (cond
))
7419 /* Canonicalize the loop condition to the end. This means
7420 generating a branch to the loop condition. Reuse the
7421 continue label, if possible. */
7426 entry
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
7427 t
= build_and_jump (&LABEL_EXPR_LABEL (entry
));
7430 t
= build1 (GOTO_EXPR
, void_type_node
, clab
);
7431 SET_EXPR_LOCATION (t
, start_locus
);
7435 t
= build_and_jump (&blab
);
7436 exit
= fold_build3 (COND_EXPR
, void_type_node
, cond
, exit
, t
);
7438 SET_EXPR_LOCATION (exit
, start_locus
);
7440 SET_EXPR_LOCATION (exit
, input_location
);
7449 add_stmt (build1 (LABEL_EXPR
, void_type_node
, clab
));
7457 add_stmt (build1 (LABEL_EXPR
, void_type_node
, blab
));
7461 c_finish_bc_stmt (tree
*label_p
, bool is_break
)
7464 tree label
= *label_p
;
7466 /* In switch statements break is sometimes stylistically used after
7467 a return statement. This can lead to spurious warnings about
7468 control reaching the end of a non-void function when it is
7469 inlined. Note that we are calling block_may_fallthru with
7470 language specific tree nodes; this works because
7471 block_may_fallthru returns true when given something it does not
7473 skip
= !block_may_fallthru (cur_stmt_list
);
7478 *label_p
= label
= create_artificial_label ();
7480 else if (TREE_CODE (label
) == LABEL_DECL
)
7482 else switch (TREE_INT_CST_LOW (label
))
7486 error ("break statement not within loop or switch");
7488 error ("continue statement not within a loop");
7492 gcc_assert (is_break
);
7493 error ("break statement used with OpenMP for loop");
7503 return add_stmt (build1 (GOTO_EXPR
, void_type_node
, label
));
7506 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7509 emit_side_effect_warnings (tree expr
)
7511 if (expr
== error_mark_node
)
7513 else if (!TREE_SIDE_EFFECTS (expr
))
7515 if (!VOID_TYPE_P (TREE_TYPE (expr
)) && !TREE_NO_WARNING (expr
))
7516 warning (OPT_Wunused_value
, "%Hstatement with no effect",
7517 EXPR_HAS_LOCATION (expr
) ? EXPR_LOCUS (expr
) : &input_location
);
7520 warn_if_unused_value (expr
, input_location
);
7523 /* Process an expression as if it were a complete statement. Emit
7524 diagnostics, but do not call ADD_STMT. */
7527 c_process_expr_stmt (tree expr
)
7532 if (warn_sequence_point
)
7533 verify_sequence_points (expr
);
7535 if (TREE_TYPE (expr
) != error_mark_node
7536 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr
))
7537 && TREE_CODE (TREE_TYPE (expr
)) != ARRAY_TYPE
)
7538 error ("expression statement has incomplete type");
7540 /* If we're not processing a statement expression, warn about unused values.
7541 Warnings for statement expressions will be emitted later, once we figure
7542 out which is the result. */
7543 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list
)
7544 && warn_unused_value
)
7545 emit_side_effect_warnings (expr
);
7547 /* If the expression is not of a type to which we cannot assign a line
7548 number, wrap the thing in a no-op NOP_EXPR. */
7549 if (DECL_P (expr
) || CONSTANT_CLASS_P (expr
))
7550 expr
= build1 (NOP_EXPR
, TREE_TYPE (expr
), expr
);
7552 if (CAN_HAVE_LOCATION_P (expr
))
7553 SET_EXPR_LOCATION (expr
, input_location
);
7558 /* Emit an expression as a statement. */
7561 c_finish_expr_stmt (tree expr
)
7564 return add_stmt (c_process_expr_stmt (expr
));
7569 /* Do the opposite and emit a statement as an expression. To begin,
7570 create a new binding level and return it. */
7573 c_begin_stmt_expr (void)
7576 struct c_label_context_se
*nstack
;
7577 struct c_label_list
*glist
;
7579 /* We must force a BLOCK for this level so that, if it is not expanded
7580 later, there is a way to turn off the entire subtree of blocks that
7581 are contained in it. */
7583 ret
= c_begin_compound_stmt (true);
7586 c_switch_stack
->blocked_stmt_expr
++;
7587 gcc_assert (c_switch_stack
->blocked_stmt_expr
!= 0);
7589 for (glist
= label_context_stack_se
->labels_used
;
7591 glist
= glist
->next
)
7593 C_DECL_UNDEFINABLE_STMT_EXPR (glist
->label
) = 1;
7595 nstack
= XOBNEW (&parser_obstack
, struct c_label_context_se
);
7596 nstack
->labels_def
= NULL
;
7597 nstack
->labels_used
= NULL
;
7598 nstack
->next
= label_context_stack_se
;
7599 label_context_stack_se
= nstack
;
7601 /* Mark the current statement list as belonging to a statement list. */
7602 STATEMENT_LIST_STMT_EXPR (ret
) = 1;
7608 c_finish_stmt_expr (tree body
)
7610 tree last
, type
, tmp
, val
;
7612 struct c_label_list
*dlist
, *glist
, *glist_prev
= NULL
;
7614 body
= c_end_compound_stmt (body
, true);
7617 gcc_assert (c_switch_stack
->blocked_stmt_expr
!= 0);
7618 c_switch_stack
->blocked_stmt_expr
--;
7620 /* It is no longer possible to jump to labels defined within this
7621 statement expression. */
7622 for (dlist
= label_context_stack_se
->labels_def
;
7624 dlist
= dlist
->next
)
7626 C_DECL_UNJUMPABLE_STMT_EXPR (dlist
->label
) = 1;
7628 /* It is again possible to define labels with a goto just outside
7629 this statement expression. */
7630 for (glist
= label_context_stack_se
->next
->labels_used
;
7632 glist
= glist
->next
)
7634 C_DECL_UNDEFINABLE_STMT_EXPR (glist
->label
) = 0;
7637 if (glist_prev
!= NULL
)
7638 glist_prev
->next
= label_context_stack_se
->labels_used
;
7640 label_context_stack_se
->next
->labels_used
7641 = label_context_stack_se
->labels_used
;
7642 label_context_stack_se
= label_context_stack_se
->next
;
7644 /* Locate the last statement in BODY. See c_end_compound_stmt
7645 about always returning a BIND_EXPR. */
7646 last_p
= &BIND_EXPR_BODY (body
);
7647 last
= BIND_EXPR_BODY (body
);
7650 if (TREE_CODE (last
) == STATEMENT_LIST
)
7652 tree_stmt_iterator i
;
7654 /* This can happen with degenerate cases like ({ }). No value. */
7655 if (!TREE_SIDE_EFFECTS (last
))
7658 /* If we're supposed to generate side effects warnings, process
7659 all of the statements except the last. */
7660 if (warn_unused_value
)
7662 for (i
= tsi_start (last
); !tsi_one_before_end_p (i
); tsi_next (&i
))
7663 emit_side_effect_warnings (tsi_stmt (i
));
7666 i
= tsi_last (last
);
7667 last_p
= tsi_stmt_ptr (i
);
7671 /* If the end of the list is exception related, then the list was split
7672 by a call to push_cleanup. Continue searching. */
7673 if (TREE_CODE (last
) == TRY_FINALLY_EXPR
7674 || TREE_CODE (last
) == TRY_CATCH_EXPR
)
7676 last_p
= &TREE_OPERAND (last
, 0);
7678 goto continue_searching
;
7681 /* In the case that the BIND_EXPR is not necessary, return the
7682 expression out from inside it. */
7683 if (last
== error_mark_node
7684 || (last
== BIND_EXPR_BODY (body
)
7685 && BIND_EXPR_VARS (body
) == NULL
))
7687 /* Do not warn if the return value of a statement expression is
7689 if (CAN_HAVE_LOCATION_P (last
))
7690 TREE_NO_WARNING (last
) = 1;
7694 /* Extract the type of said expression. */
7695 type
= TREE_TYPE (last
);
7697 /* If we're not returning a value at all, then the BIND_EXPR that
7698 we already have is a fine expression to return. */
7699 if (!type
|| VOID_TYPE_P (type
))
7702 /* Now that we've located the expression containing the value, it seems
7703 silly to make voidify_wrapper_expr repeat the process. Create a
7704 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7705 tmp
= create_tmp_var_raw (type
, NULL
);
7707 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7708 tree_expr_nonnegative_p giving up immediately. */
7710 if (TREE_CODE (val
) == NOP_EXPR
7711 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0)))
7712 val
= TREE_OPERAND (val
, 0);
7714 *last_p
= build2 (MODIFY_EXPR
, void_type_node
, tmp
, val
);
7715 SET_EXPR_LOCUS (*last_p
, EXPR_LOCUS (last
));
7717 return build4 (TARGET_EXPR
, type
, tmp
, body
, NULL_TREE
, NULL_TREE
);
7720 /* Begin the scope of an identifier of variably modified type, scope
7721 number SCOPE. Jumping from outside this scope to inside it is not
7725 c_begin_vm_scope (unsigned int scope
)
7727 struct c_label_context_vm
*nstack
;
7728 struct c_label_list
*glist
;
7730 gcc_assert (scope
> 0);
7732 /* At file_scope, we don't have to do any processing. */
7733 if (label_context_stack_vm
== NULL
)
7736 if (c_switch_stack
&& !c_switch_stack
->blocked_vm
)
7737 c_switch_stack
->blocked_vm
= scope
;
7738 for (glist
= label_context_stack_vm
->labels_used
;
7740 glist
= glist
->next
)
7742 C_DECL_UNDEFINABLE_VM (glist
->label
) = 1;
7744 nstack
= XOBNEW (&parser_obstack
, struct c_label_context_vm
);
7745 nstack
->labels_def
= NULL
;
7746 nstack
->labels_used
= NULL
;
7747 nstack
->scope
= scope
;
7748 nstack
->next
= label_context_stack_vm
;
7749 label_context_stack_vm
= nstack
;
7752 /* End a scope which may contain identifiers of variably modified
7753 type, scope number SCOPE. */
7756 c_end_vm_scope (unsigned int scope
)
7758 if (label_context_stack_vm
== NULL
)
7760 if (c_switch_stack
&& c_switch_stack
->blocked_vm
== scope
)
7761 c_switch_stack
->blocked_vm
= 0;
7762 /* We may have a number of nested scopes of identifiers with
7763 variably modified type, all at this depth. Pop each in turn. */
7764 while (label_context_stack_vm
->scope
== scope
)
7766 struct c_label_list
*dlist
, *glist
, *glist_prev
= NULL
;
7768 /* It is no longer possible to jump to labels defined within this
7770 for (dlist
= label_context_stack_vm
->labels_def
;
7772 dlist
= dlist
->next
)
7774 C_DECL_UNJUMPABLE_VM (dlist
->label
) = 1;
7776 /* It is again possible to define labels with a goto just outside
7778 for (glist
= label_context_stack_vm
->next
->labels_used
;
7780 glist
= glist
->next
)
7782 C_DECL_UNDEFINABLE_VM (glist
->label
) = 0;
7785 if (glist_prev
!= NULL
)
7786 glist_prev
->next
= label_context_stack_vm
->labels_used
;
7788 label_context_stack_vm
->next
->labels_used
7789 = label_context_stack_vm
->labels_used
;
7790 label_context_stack_vm
= label_context_stack_vm
->next
;
7794 /* Begin and end compound statements. This is as simple as pushing
7795 and popping new statement lists from the tree. */
7798 c_begin_compound_stmt (bool do_scope
)
7800 tree stmt
= push_stmt_list ();
7807 c_end_compound_stmt (tree stmt
, bool do_scope
)
7813 if (c_dialect_objc ())
7814 objc_clear_super_receiver ();
7815 block
= pop_scope ();
7818 stmt
= pop_stmt_list (stmt
);
7819 stmt
= c_build_bind_expr (block
, stmt
);
7821 /* If this compound statement is nested immediately inside a statement
7822 expression, then force a BIND_EXPR to be created. Otherwise we'll
7823 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7824 STATEMENT_LISTs merge, and thus we can lose track of what statement
7827 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list
)
7828 && TREE_CODE (stmt
) != BIND_EXPR
)
7830 stmt
= build3 (BIND_EXPR
, void_type_node
, NULL
, stmt
, NULL
);
7831 TREE_SIDE_EFFECTS (stmt
) = 1;
7837 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7838 when the current scope is exited. EH_ONLY is true when this is not
7839 meant to apply to normal control flow transfer. */
7842 push_cleanup (tree
ARG_UNUSED (decl
), tree cleanup
, bool eh_only
)
7844 enum tree_code code
;
7848 code
= eh_only
? TRY_CATCH_EXPR
: TRY_FINALLY_EXPR
;
7849 stmt
= build_stmt (code
, NULL
, cleanup
);
7851 stmt_expr
= STATEMENT_LIST_STMT_EXPR (cur_stmt_list
);
7852 list
= push_stmt_list ();
7853 TREE_OPERAND (stmt
, 0) = list
;
7854 STATEMENT_LIST_STMT_EXPR (list
) = stmt_expr
;
7857 /* Build a binary-operation expression without default conversions.
7858 CODE is the kind of expression to build.
7859 This function differs from `build' in several ways:
7860 the data type of the result is computed and recorded in it,
7861 warnings are generated if arg data types are invalid,
7862 special handling for addition and subtraction of pointers is known,
7863 and some optimization is done (operations on narrow ints
7864 are done in the narrower type when that gives the same result).
7865 Constant folding is also done before the result is returned.
7867 Note that the operands will never have enumeral types, or function
7868 or array types, because either they will have the default conversions
7869 performed or they have both just been converted to some other type in which
7870 the arithmetic is to be done. */
7873 build_binary_op (enum tree_code code
, tree orig_op0
, tree orig_op1
,
7877 enum tree_code code0
, code1
;
7879 const char *invalid_op_diag
;
7881 /* Expression code to give to the expression when it is built.
7882 Normally this is CODE, which is what the caller asked for,
7883 but in some special cases we change it. */
7884 enum tree_code resultcode
= code
;
7886 /* Data type in which the computation is to be performed.
7887 In the simplest cases this is the common type of the arguments. */
7888 tree result_type
= NULL
;
7890 /* Nonzero means operands have already been type-converted
7891 in whatever way is necessary.
7892 Zero means they need to be converted to RESULT_TYPE. */
7895 /* Nonzero means create the expression with this type, rather than
7897 tree build_type
= 0;
7899 /* Nonzero means after finally constructing the expression
7900 convert it to this type. */
7901 tree final_type
= 0;
7903 /* Nonzero if this is an operation like MIN or MAX which can
7904 safely be computed in short if both args are promoted shorts.
7905 Also implies COMMON.
7906 -1 indicates a bitwise operation; this makes a difference
7907 in the exact conditions for when it is safe to do the operation
7908 in a narrower mode. */
7911 /* Nonzero if this is a comparison operation;
7912 if both args are promoted shorts, compare the original shorts.
7913 Also implies COMMON. */
7914 int short_compare
= 0;
7916 /* Nonzero if this is a right-shift operation, which can be computed on the
7917 original short and then promoted if the operand is a promoted short. */
7918 int short_shift
= 0;
7920 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7923 /* True means types are compatible as far as ObjC is concerned. */
7928 op0
= default_conversion (orig_op0
);
7929 op1
= default_conversion (orig_op1
);
7937 type0
= TREE_TYPE (op0
);
7938 type1
= TREE_TYPE (op1
);
7940 /* The expression codes of the data types of the arguments tell us
7941 whether the arguments are integers, floating, pointers, etc. */
7942 code0
= TREE_CODE (type0
);
7943 code1
= TREE_CODE (type1
);
7945 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7946 STRIP_TYPE_NOPS (op0
);
7947 STRIP_TYPE_NOPS (op1
);
7949 /* If an error was already reported for one of the arguments,
7950 avoid reporting another error. */
7952 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
7953 return error_mark_node
;
7955 if ((invalid_op_diag
7956 = targetm
.invalid_binary_op (code
, type0
, type1
)))
7958 error (invalid_op_diag
);
7959 return error_mark_node
;
7962 objc_ok
= objc_compare_types (type0
, type1
, -3, NULL_TREE
);
7967 /* Handle the pointer + int case. */
7968 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
7969 return pointer_int_sum (PLUS_EXPR
, op0
, op1
);
7970 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
7971 return pointer_int_sum (PLUS_EXPR
, op1
, op0
);
7977 /* Subtraction of two similar pointers.
7978 We must subtract them as integers, then divide by object size. */
7979 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
7980 && comp_target_types (type0
, type1
))
7981 return pointer_diff (op0
, op1
);
7982 /* Handle pointer minus int. Just like pointer plus int. */
7983 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
7984 return pointer_int_sum (MINUS_EXPR
, op0
, op1
);
7993 case TRUNC_DIV_EXPR
:
7995 case FLOOR_DIV_EXPR
:
7996 case ROUND_DIV_EXPR
:
7997 case EXACT_DIV_EXPR
:
7998 warn_for_div_by_zero (op1
);
8000 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
8001 || code0
== FIXED_POINT_TYPE
8002 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
8003 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
8004 || code1
== FIXED_POINT_TYPE
8005 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
8007 enum tree_code tcode0
= code0
, tcode1
= code1
;
8009 if (code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
8010 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
8011 if (code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
)
8012 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
8014 if (!((tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
)
8015 || (tcode0
== FIXED_POINT_TYPE
&& tcode1
== FIXED_POINT_TYPE
)))
8016 resultcode
= RDIV_EXPR
;
8018 /* Although it would be tempting to shorten always here, that
8019 loses on some targets, since the modulo instruction is
8020 undefined if the quotient can't be represented in the
8021 computation mode. We shorten only if unsigned or if
8022 dividing by something we know != -1. */
8023 shorten
= (TYPE_UNSIGNED (TREE_TYPE (orig_op0
))
8024 || (TREE_CODE (op1
) == INTEGER_CST
8025 && !integer_all_onesp (op1
)));
8033 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
8035 /* Allow vector types which are not floating point types. */
8036 else if (code0
== VECTOR_TYPE
8037 && code1
== VECTOR_TYPE
8038 && !VECTOR_FLOAT_TYPE_P (type0
)
8039 && !VECTOR_FLOAT_TYPE_P (type1
))
8043 case TRUNC_MOD_EXPR
:
8044 case FLOOR_MOD_EXPR
:
8045 warn_for_div_by_zero (op1
);
8047 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
8049 /* Although it would be tempting to shorten always here, that loses
8050 on some targets, since the modulo instruction is undefined if the
8051 quotient can't be represented in the computation mode. We shorten
8052 only if unsigned or if dividing by something we know != -1. */
8053 shorten
= (TYPE_UNSIGNED (TREE_TYPE (orig_op0
))
8054 || (TREE_CODE (op1
) == INTEGER_CST
8055 && !integer_all_onesp (op1
)));
8060 case TRUTH_ANDIF_EXPR
:
8061 case TRUTH_ORIF_EXPR
:
8062 case TRUTH_AND_EXPR
:
8064 case TRUTH_XOR_EXPR
:
8065 if ((code0
== INTEGER_TYPE
|| code0
== POINTER_TYPE
8066 || code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
8067 || code0
== FIXED_POINT_TYPE
)
8068 && (code1
== INTEGER_TYPE
|| code1
== POINTER_TYPE
8069 || code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
8070 || code1
== FIXED_POINT_TYPE
))
8072 /* Result of these operations is always an int,
8073 but that does not mean the operands should be
8074 converted to ints! */
8075 result_type
= integer_type_node
;
8076 op0
= c_common_truthvalue_conversion (op0
);
8077 op1
= c_common_truthvalue_conversion (op1
);
8082 /* Shift operations: result has same type as first operand;
8083 always convert second operand to int.
8084 Also set SHORT_SHIFT if shifting rightward. */
8087 if ((code0
== INTEGER_TYPE
|| code0
== FIXED_POINT_TYPE
)
8088 && code1
== INTEGER_TYPE
)
8090 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
8092 if (tree_int_cst_sgn (op1
) < 0)
8093 warning (0, "right shift count is negative");
8096 if (!integer_zerop (op1
))
8099 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
8100 warning (0, "right shift count >= width of type");
8104 /* Use the type of the value to be shifted. */
8105 result_type
= type0
;
8106 /* Convert the shift-count to an integer, regardless of size
8107 of value being shifted. */
8108 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
8109 op1
= convert (integer_type_node
, op1
);
8110 /* Avoid converting op1 to result_type later. */
8116 if ((code0
== INTEGER_TYPE
|| code0
== FIXED_POINT_TYPE
)
8117 && code1
== INTEGER_TYPE
)
8119 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
8121 if (tree_int_cst_sgn (op1
) < 0)
8122 warning (0, "left shift count is negative");
8124 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
8125 warning (0, "left shift count >= width of type");
8128 /* Use the type of the value to be shifted. */
8129 result_type
= type0
;
8130 /* Convert the shift-count to an integer, regardless of size
8131 of value being shifted. */
8132 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
8133 op1
= convert (integer_type_node
, op1
);
8134 /* Avoid converting op1 to result_type later. */
8141 if (code0
== REAL_TYPE
|| code1
== REAL_TYPE
)
8142 warning (OPT_Wfloat_equal
,
8143 "comparing floating point with == or != is unsafe");
8144 /* Result of comparison is always int,
8145 but don't convert the args to int! */
8146 build_type
= integer_type_node
;
8147 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
8148 || code0
== FIXED_POINT_TYPE
|| code0
== COMPLEX_TYPE
)
8149 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
8150 || code1
== FIXED_POINT_TYPE
|| code1
== COMPLEX_TYPE
))
8152 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
8154 tree tt0
= TREE_TYPE (type0
);
8155 tree tt1
= TREE_TYPE (type1
);
8156 /* Anything compares with void *. void * compares with anything.
8157 Otherwise, the targets must be compatible
8158 and both must be object or both incomplete. */
8159 if (comp_target_types (type0
, type1
))
8160 result_type
= common_pointer_type (type0
, type1
);
8161 else if (VOID_TYPE_P (tt0
))
8163 /* op0 != orig_op0 detects the case of something
8164 whose value is 0 but which isn't a valid null ptr const. */
8165 if (pedantic
&& !null_pointer_constant_p (orig_op0
)
8166 && TREE_CODE (tt1
) == FUNCTION_TYPE
)
8167 pedwarn ("ISO C forbids comparison of %<void *%>"
8168 " with function pointer");
8170 else if (VOID_TYPE_P (tt1
))
8172 if (pedantic
&& !null_pointer_constant_p (orig_op1
)
8173 && TREE_CODE (tt0
) == FUNCTION_TYPE
)
8174 pedwarn ("ISO C forbids comparison of %<void *%>"
8175 " with function pointer");
8178 /* Avoid warning about the volatile ObjC EH puts on decls. */
8180 pedwarn ("comparison of distinct pointer types lacks a cast");
8182 if (result_type
== NULL_TREE
)
8183 result_type
= ptr_type_node
;
8185 else if (code0
== POINTER_TYPE
&& null_pointer_constant_p (orig_op1
))
8187 if (TREE_CODE (op0
) == ADDR_EXPR
8188 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
8189 warning (OPT_Waddress
, "the address of %qD will never be NULL",
8190 TREE_OPERAND (op0
, 0));
8191 result_type
= type0
;
8193 else if (code1
== POINTER_TYPE
&& null_pointer_constant_p (orig_op0
))
8195 if (TREE_CODE (op1
) == ADDR_EXPR
8196 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
8197 warning (OPT_Waddress
, "the address of %qD will never be NULL",
8198 TREE_OPERAND (op1
, 0));
8199 result_type
= type1
;
8201 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
8203 result_type
= type0
;
8204 pedwarn ("comparison between pointer and integer");
8206 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
8208 result_type
= type1
;
8209 pedwarn ("comparison between pointer and integer");
8217 build_type
= integer_type_node
;
8218 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
8219 || code0
== FIXED_POINT_TYPE
)
8220 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
8221 || code1
== FIXED_POINT_TYPE
))
8223 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
8225 if (comp_target_types (type0
, type1
))
8227 result_type
= common_pointer_type (type0
, type1
);
8228 if (!COMPLETE_TYPE_P (TREE_TYPE (type0
))
8229 != !COMPLETE_TYPE_P (TREE_TYPE (type1
)))
8230 pedwarn ("comparison of complete and incomplete pointers");
8232 && TREE_CODE (TREE_TYPE (type0
)) == FUNCTION_TYPE
)
8233 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
8237 result_type
= ptr_type_node
;
8238 pedwarn ("comparison of distinct pointer types lacks a cast");
8241 else if (code0
== POINTER_TYPE
&& null_pointer_constant_p (orig_op1
))
8243 result_type
= type0
;
8244 if (pedantic
|| extra_warnings
)
8245 pedwarn ("ordered comparison of pointer with integer zero");
8247 else if (code1
== POINTER_TYPE
&& null_pointer_constant_p (orig_op0
))
8249 result_type
= type1
;
8251 pedwarn ("ordered comparison of pointer with integer zero");
8253 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
8255 result_type
= type0
;
8256 pedwarn ("comparison between pointer and integer");
8258 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
8260 result_type
= type1
;
8261 pedwarn ("comparison between pointer and integer");
8269 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
8270 return error_mark_node
;
8272 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
8273 && (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
8274 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
8275 TREE_TYPE (type1
))))
8277 binary_op_error (code
, type0
, type1
);
8278 return error_mark_node
;
8281 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
8282 || code0
== FIXED_POINT_TYPE
|| code0
== VECTOR_TYPE
)
8284 (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
8285 || code1
== FIXED_POINT_TYPE
|| code1
== VECTOR_TYPE
))
8287 int none_complex
= (code0
!= COMPLEX_TYPE
&& code1
!= COMPLEX_TYPE
);
8289 if (shorten
|| common
|| short_compare
)
8291 result_type
= c_common_type (type0
, type1
);
8292 if (result_type
== error_mark_node
)
8293 return error_mark_node
;
8296 /* For certain operations (which identify themselves by shorten != 0)
8297 if both args were extended from the same smaller type,
8298 do the arithmetic in that type and then extend.
8300 shorten !=0 and !=1 indicates a bitwise operation.
8301 For them, this optimization is safe only if
8302 both args are zero-extended or both are sign-extended.
8303 Otherwise, we might change the result.
8304 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8305 but calculated in (unsigned short) it would be (unsigned short)-1. */
8307 if (shorten
&& none_complex
)
8309 int unsigned0
, unsigned1
;
8314 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
8315 excessive narrowing when we call get_narrower below. For
8316 example, suppose that OP0 is of unsigned int extended
8317 from signed char and that RESULT_TYPE is long long int.
8318 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
8321 (long long int) (unsigned int) signed_char
8323 which get_narrower would narrow down to
8325 (unsigned int) signed char
8327 If we do not cast OP0 first, get_narrower would return
8328 signed_char, which is inconsistent with the case of the
8330 op0
= convert (result_type
, op0
);
8331 op1
= convert (result_type
, op1
);
8333 arg0
= get_narrower (op0
, &unsigned0
);
8334 arg1
= get_narrower (op1
, &unsigned1
);
8336 /* UNS is 1 if the operation to be done is an unsigned one. */
8337 uns
= TYPE_UNSIGNED (result_type
);
8339 final_type
= result_type
;
8341 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
8342 but it *requires* conversion to FINAL_TYPE. */
8344 if ((TYPE_PRECISION (TREE_TYPE (op0
))
8345 == TYPE_PRECISION (TREE_TYPE (arg0
)))
8346 && TREE_TYPE (op0
) != final_type
)
8347 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
8348 if ((TYPE_PRECISION (TREE_TYPE (op1
))
8349 == TYPE_PRECISION (TREE_TYPE (arg1
)))
8350 && TREE_TYPE (op1
) != final_type
)
8351 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
8353 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
8355 /* For bitwise operations, signedness of nominal type
8356 does not matter. Consider only how operands were extended. */
8360 /* Note that in all three cases below we refrain from optimizing
8361 an unsigned operation on sign-extended args.
8362 That would not be valid. */
8364 /* Both args variable: if both extended in same way
8365 from same width, do it in that width.
8366 Do it unsigned if args were zero-extended. */
8367 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
8368 < TYPE_PRECISION (result_type
))
8369 && (TYPE_PRECISION (TREE_TYPE (arg1
))
8370 == TYPE_PRECISION (TREE_TYPE (arg0
)))
8371 && unsigned0
== unsigned1
8372 && (unsigned0
|| !uns
))
8374 = c_common_signed_or_unsigned_type
8375 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
8376 else if (TREE_CODE (arg0
) == INTEGER_CST
8377 && (unsigned1
|| !uns
)
8378 && (TYPE_PRECISION (TREE_TYPE (arg1
))
8379 < TYPE_PRECISION (result_type
))
8381 = c_common_signed_or_unsigned_type (unsigned1
,
8383 && !POINTER_TYPE_P (type
)
8384 && int_fits_type_p (arg0
, type
))
8386 else if (TREE_CODE (arg1
) == INTEGER_CST
8387 && (unsigned0
|| !uns
)
8388 && (TYPE_PRECISION (TREE_TYPE (arg0
))
8389 < TYPE_PRECISION (result_type
))
8391 = c_common_signed_or_unsigned_type (unsigned0
,
8393 && !POINTER_TYPE_P (type
)
8394 && int_fits_type_p (arg1
, type
))
8398 /* Shifts can be shortened if shifting right. */
8403 tree arg0
= get_narrower (op0
, &unsigned_arg
);
8405 final_type
= result_type
;
8407 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
8408 unsigned_arg
= TYPE_UNSIGNED (TREE_TYPE (op0
));
8410 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
8411 /* We can shorten only if the shift count is less than the
8412 number of bits in the smaller type size. */
8413 && compare_tree_int (op1
, TYPE_PRECISION (TREE_TYPE (arg0
))) < 0
8414 /* We cannot drop an unsigned shift after sign-extension. */
8415 && (!TYPE_UNSIGNED (final_type
) || unsigned_arg
))
8417 /* Do an unsigned shift if the operand was zero-extended. */
8419 = c_common_signed_or_unsigned_type (unsigned_arg
,
8421 /* Convert value-to-be-shifted to that type. */
8422 if (TREE_TYPE (op0
) != result_type
)
8423 op0
= convert (result_type
, op0
);
8428 /* Comparison operations are shortened too but differently.
8429 They identify themselves by setting short_compare = 1. */
8433 /* Don't write &op0, etc., because that would prevent op0
8434 from being kept in a register.
8435 Instead, make copies of the our local variables and
8436 pass the copies by reference, then copy them back afterward. */
8437 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
8438 enum tree_code xresultcode
= resultcode
;
8440 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
8445 op0
= xop0
, op1
= xop1
;
8447 resultcode
= xresultcode
;
8449 if (warn_sign_compare
&& skip_evaluation
== 0)
8451 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
8452 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
8453 int unsignedp0
, unsignedp1
;
8454 tree primop0
= get_narrower (op0
, &unsignedp0
);
8455 tree primop1
= get_narrower (op1
, &unsignedp1
);
8459 STRIP_TYPE_NOPS (xop0
);
8460 STRIP_TYPE_NOPS (xop1
);
8462 /* Give warnings for comparisons between signed and unsigned
8463 quantities that may fail.
8465 Do the checking based on the original operand trees, so that
8466 casts will be considered, but default promotions won't be.
8468 Do not warn if the comparison is being done in a signed type,
8469 since the signed type will only be chosen if it can represent
8470 all the values of the unsigned type. */
8471 if (!TYPE_UNSIGNED (result_type
))
8473 /* Do not warn if both operands are the same signedness. */
8474 else if (op0_signed
== op1_signed
)
8482 sop
= xop0
, uop
= xop1
;
8484 sop
= xop1
, uop
= xop0
;
8486 /* Do not warn if the signed quantity is an
8487 unsuffixed integer literal (or some static
8488 constant expression involving such literals or a
8489 conditional expression involving such literals)
8490 and it is non-negative. */
8491 if (tree_expr_nonnegative_warnv_p (sop
, &ovf
))
8493 /* Do not warn if the comparison is an equality operation,
8494 the unsigned quantity is an integral constant, and it
8495 would fit in the result if the result were signed. */
8496 else if (TREE_CODE (uop
) == INTEGER_CST
8497 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
8499 (uop
, c_common_signed_type (result_type
)))
8501 /* Do not warn if the unsigned quantity is an enumeration
8502 constant and its maximum value would fit in the result
8503 if the result were signed. */
8504 else if (TREE_CODE (uop
) == INTEGER_CST
8505 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
8507 (TYPE_MAX_VALUE (TREE_TYPE (uop
)),
8508 c_common_signed_type (result_type
)))
8511 warning (OPT_Wsign_compare
, "comparison between signed and unsigned");
8514 /* Warn if two unsigned values are being compared in a size
8515 larger than their original size, and one (and only one) is the
8516 result of a `~' operator. This comparison will always fail.
8518 Also warn if one operand is a constant, and the constant
8519 does not have all bits set that are set in the ~ operand
8520 when it is extended. */
8522 if ((TREE_CODE (primop0
) == BIT_NOT_EXPR
)
8523 != (TREE_CODE (primop1
) == BIT_NOT_EXPR
))
8525 if (TREE_CODE (primop0
) == BIT_NOT_EXPR
)
8526 primop0
= get_narrower (TREE_OPERAND (primop0
, 0),
8529 primop1
= get_narrower (TREE_OPERAND (primop1
, 0),
8532 if (host_integerp (primop0
, 0) || host_integerp (primop1
, 0))
8535 HOST_WIDE_INT constant
, mask
;
8536 int unsignedp
, bits
;
8538 if (host_integerp (primop0
, 0))
8541 unsignedp
= unsignedp1
;
8542 constant
= tree_low_cst (primop0
, 0);
8547 unsignedp
= unsignedp0
;
8548 constant
= tree_low_cst (primop1
, 0);
8551 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
8552 if (bits
< TYPE_PRECISION (result_type
)
8553 && bits
< HOST_BITS_PER_WIDE_INT
&& unsignedp
)
8555 mask
= (~(HOST_WIDE_INT
) 0) << bits
;
8556 if ((mask
& constant
) != mask
)
8557 warning (OPT_Wsign_compare
, "comparison of promoted ~unsigned with constant");
8560 else if (unsignedp0
&& unsignedp1
8561 && (TYPE_PRECISION (TREE_TYPE (primop0
))
8562 < TYPE_PRECISION (result_type
))
8563 && (TYPE_PRECISION (TREE_TYPE (primop1
))
8564 < TYPE_PRECISION (result_type
)))
8565 warning (OPT_Wsign_compare
, "comparison of promoted ~unsigned with unsigned");
8571 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8572 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8573 Then the expression will be built.
8574 It will be given type FINAL_TYPE if that is nonzero;
8575 otherwise, it will be given type RESULT_TYPE. */
8579 binary_op_error (code
, TREE_TYPE (op0
), TREE_TYPE (op1
));
8580 return error_mark_node
;
8585 if (TREE_TYPE (op0
) != result_type
)
8586 op0
= convert_and_check (result_type
, op0
);
8587 if (TREE_TYPE (op1
) != result_type
)
8588 op1
= convert_and_check (result_type
, op1
);
8590 /* This can happen if one operand has a vector type, and the other
8591 has a different type. */
8592 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
8593 return error_mark_node
;
8596 if (build_type
== NULL_TREE
)
8597 build_type
= result_type
;
8600 /* Treat expressions in initializers specially as they can't trap. */
8601 tree result
= require_constant_value
? fold_build2_initializer (resultcode
,
8604 : fold_build2 (resultcode
, build_type
,
8607 if (final_type
!= 0)
8608 result
= convert (final_type
, result
);
8614 /* Convert EXPR to be a truth-value, validating its type for this
8618 c_objc_common_truthvalue_conversion (tree expr
)
8620 switch (TREE_CODE (TREE_TYPE (expr
)))
8623 error ("used array that cannot be converted to pointer where scalar is required");
8624 return error_mark_node
;
8627 error ("used struct type value where scalar is required");
8628 return error_mark_node
;
8631 error ("used union type value where scalar is required");
8632 return error_mark_node
;
8641 /* ??? Should we also give an error for void and vectors rather than
8642 leaving those to give errors later? */
8643 return c_common_truthvalue_conversion (expr
);
8647 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8651 c_expr_to_decl (tree expr
, bool *tc ATTRIBUTE_UNUSED
,
8652 bool *ti ATTRIBUTE_UNUSED
, bool *se
)
8654 if (TREE_CODE (expr
) == COMPOUND_LITERAL_EXPR
)
8656 tree decl
= COMPOUND_LITERAL_EXPR_DECL (expr
);
8657 /* Executing a compound literal inside a function reinitializes
8659 if (!TREE_STATIC (decl
))
8667 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8670 c_begin_omp_parallel (void)
8675 block
= c_begin_compound_stmt (true);
8681 c_finish_omp_parallel (tree clauses
, tree block
)
8685 block
= c_end_compound_stmt (block
, true);
8687 stmt
= make_node (OMP_PARALLEL
);
8688 TREE_TYPE (stmt
) = void_type_node
;
8689 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
8690 OMP_PARALLEL_BODY (stmt
) = block
;
8692 return add_stmt (stmt
);
8695 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8696 Remove any elements from the list that are invalid. */
8699 c_finish_omp_clauses (tree clauses
)
8701 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
8702 tree c
, t
, *pc
= &clauses
;
8705 bitmap_obstack_initialize (NULL
);
8706 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
8707 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
8708 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
8710 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
8712 bool remove
= false;
8713 bool need_complete
= false;
8714 bool need_implicitly_determined
= false;
8716 switch (OMP_CLAUSE_CODE (c
))
8718 case OMP_CLAUSE_SHARED
:
8720 need_implicitly_determined
= true;
8721 goto check_dup_generic
;
8723 case OMP_CLAUSE_PRIVATE
:
8725 need_complete
= true;
8726 need_implicitly_determined
= true;
8727 goto check_dup_generic
;
8729 case OMP_CLAUSE_REDUCTION
:
8731 need_implicitly_determined
= true;
8732 t
= OMP_CLAUSE_DECL (c
);
8733 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
8734 || POINTER_TYPE_P (TREE_TYPE (t
)))
8736 error ("%qE has invalid type for %<reduction%>", t
);
8739 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
8741 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
8742 const char *r_name
= NULL
;
8759 case TRUTH_ANDIF_EXPR
:
8762 case TRUTH_ORIF_EXPR
:
8770 error ("%qE has invalid type for %<reduction(%s)%>",
8775 goto check_dup_generic
;
8777 case OMP_CLAUSE_COPYPRIVATE
:
8778 name
= "copyprivate";
8779 goto check_dup_generic
;
8781 case OMP_CLAUSE_COPYIN
:
8783 t
= OMP_CLAUSE_DECL (c
);
8784 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
8786 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
8789 goto check_dup_generic
;
8792 t
= OMP_CLAUSE_DECL (c
);
8793 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
8795 error ("%qE is not a variable in clause %qs", t
, name
);
8798 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
8799 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
8800 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
8802 error ("%qE appears more than once in data clauses", t
);
8806 bitmap_set_bit (&generic_head
, DECL_UID (t
));
8809 case OMP_CLAUSE_FIRSTPRIVATE
:
8810 name
= "firstprivate";
8811 t
= OMP_CLAUSE_DECL (c
);
8812 need_complete
= true;
8813 need_implicitly_determined
= true;
8814 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
8816 error ("%qE is not a variable in clause %<firstprivate%>", t
);
8819 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
8820 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
8822 error ("%qE appears more than once in data clauses", t
);
8826 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
8829 case OMP_CLAUSE_LASTPRIVATE
:
8830 name
= "lastprivate";
8831 t
= OMP_CLAUSE_DECL (c
);
8832 need_complete
= true;
8833 need_implicitly_determined
= true;
8834 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
8836 error ("%qE is not a variable in clause %<lastprivate%>", t
);
8839 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
8840 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
8842 error ("%qE appears more than once in data clauses", t
);
8846 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
8850 case OMP_CLAUSE_NUM_THREADS
:
8851 case OMP_CLAUSE_SCHEDULE
:
8852 case OMP_CLAUSE_NOWAIT
:
8853 case OMP_CLAUSE_ORDERED
:
8854 case OMP_CLAUSE_DEFAULT
:
8855 pc
= &OMP_CLAUSE_CHAIN (c
);
8864 t
= OMP_CLAUSE_DECL (c
);
8868 t
= require_complete_type (t
);
8869 if (t
== error_mark_node
)
8873 if (need_implicitly_determined
)
8875 const char *share_name
= NULL
;
8877 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
8878 share_name
= "threadprivate";
8879 else switch (c_omp_predetermined_sharing (t
))
8881 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
8883 case OMP_CLAUSE_DEFAULT_SHARED
:
8884 share_name
= "shared";
8886 case OMP_CLAUSE_DEFAULT_PRIVATE
:
8887 share_name
= "private";
8894 error ("%qE is predetermined %qs for %qs",
8895 t
, share_name
, name
);
8902 *pc
= OMP_CLAUSE_CHAIN (c
);
8904 pc
= &OMP_CLAUSE_CHAIN (c
);
8907 bitmap_obstack_release (NULL
);
8911 /* Make a variant type in the proper way for C/C++, propagating qualifiers
8912 down to the element type of an array. */
8915 c_build_qualified_type (tree type
, int type_quals
)
8917 if (type
== error_mark_node
)
8920 if (TREE_CODE (type
) == ARRAY_TYPE
)
8923 tree element_type
= c_build_qualified_type (TREE_TYPE (type
),
8926 /* See if we already have an identically qualified type. */
8927 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
8929 if (TYPE_QUALS (strip_array_types (t
)) == type_quals
8930 && TYPE_NAME (t
) == TYPE_NAME (type
)
8931 && TYPE_CONTEXT (t
) == TYPE_CONTEXT (type
)
8932 && attribute_list_equal (TYPE_ATTRIBUTES (t
),
8933 TYPE_ATTRIBUTES (type
)))
8938 tree domain
= TYPE_DOMAIN (type
);
8940 t
= build_variant_type_copy (type
);
8941 TREE_TYPE (t
) = element_type
;
8943 if (TYPE_STRUCTURAL_EQUALITY_P (element_type
)
8944 || (domain
&& TYPE_STRUCTURAL_EQUALITY_P (domain
)))
8945 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8946 else if (TYPE_CANONICAL (element_type
) != element_type
8947 || (domain
&& TYPE_CANONICAL (domain
) != domain
))
8949 tree unqualified_canon
8950 = build_array_type (TYPE_CANONICAL (element_type
),
8951 domain
? TYPE_CANONICAL (domain
)
8954 = c_build_qualified_type (unqualified_canon
, type_quals
);
8957 TYPE_CANONICAL (t
) = t
;
8962 /* A restrict-qualified pointer type must be a pointer to object or
8963 incomplete type. Note that the use of POINTER_TYPE_P also allows
8964 REFERENCE_TYPEs, which is appropriate for C++. */
8965 if ((type_quals
& TYPE_QUAL_RESTRICT
)
8966 && (!POINTER_TYPE_P (type
)
8967 || !C_TYPE_OBJECT_OR_INCOMPLETE_P (TREE_TYPE (type
))))
8969 error ("invalid use of %<restrict%>");
8970 type_quals
&= ~TYPE_QUAL_RESTRICT
;
8973 return build_qualified_type (type
, type_quals
);