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
4 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
24 /* This file is part of the C front end.
25 It contains routines to build C expressions given their operands,
26 including computing the types of the result, C-specific error checks,
27 and some optimization. */
31 #include "coretypes.h"
35 #include "langhooks.h"
45 #include "tree-iterator.h"
46 #include "tree-gimple.h"
47 #include "tree-flow.h"
49 /* Possible cases of implicit bad conversions. Used to select
50 diagnostic messages in convert_for_assignment. */
59 /* The level of nesting inside "__alignof__". */
62 /* The level of nesting inside "sizeof". */
65 /* The level of nesting inside "typeof". */
68 struct c_label_context_se
*label_context_stack_se
;
69 struct c_label_context_vm
*label_context_stack_vm
;
71 /* Nonzero if we've already printed a "missing braces around initializer"
72 message within this initializer. */
73 static int missing_braces_mentioned
;
75 static int require_constant_value
;
76 static int require_constant_elements
;
78 static bool null_pointer_constant_p (tree
);
79 static tree
qualify_type (tree
, tree
);
80 static int tagged_types_tu_compatible_p (tree
, tree
);
81 static int comp_target_types (tree
, tree
);
82 static int function_types_compatible_p (tree
, tree
);
83 static int type_lists_compatible_p (tree
, tree
);
84 static tree
decl_constant_value_for_broken_optimization (tree
);
85 static tree
lookup_field (tree
, tree
);
86 static int convert_arguments (int, tree
*, tree
, tree
, tree
, tree
);
87 static tree
pointer_diff (tree
, tree
);
88 static tree
convert_for_assignment (tree
, tree
, enum impl_conv
, tree
, tree
,
90 static tree
valid_compound_expr_initializer (tree
, tree
);
91 static void push_string (const char *);
92 static void push_member_name (tree
);
93 static int spelling_length (void);
94 static char *print_spelling (char *);
95 static void warning_init (const char *);
96 static tree
digest_init (tree
, tree
, bool, int);
97 static void output_init_element (tree
, bool, tree
, tree
, int);
98 static void output_pending_init_elements (int);
99 static int set_designator (int);
100 static void push_range_stack (tree
);
101 static void add_pending_init (tree
, tree
);
102 static void set_nonincremental_init (void);
103 static void set_nonincremental_init_from_string (tree
);
104 static tree
find_init_member (tree
);
105 static void readonly_error (tree
, enum lvalue_use
);
106 static int lvalue_or_else (tree
, enum lvalue_use
);
107 static int lvalue_p (tree
);
108 static void record_maybe_used_decl (tree
);
109 static int comptypes_internal (tree
, tree
);
111 /* Return true if EXP is a null pointer constant, false otherwise. */
114 null_pointer_constant_p (tree expr
)
116 /* This should really operate on c_expr structures, but they aren't
117 yet available everywhere required. */
118 tree type
= TREE_TYPE (expr
);
119 return (TREE_CODE (expr
) == INTEGER_CST
120 && !TREE_OVERFLOW (expr
)
121 && integer_zerop (expr
)
122 && (INTEGRAL_TYPE_P (type
)
123 || (TREE_CODE (type
) == POINTER_TYPE
124 && VOID_TYPE_P (TREE_TYPE (type
))
125 && TYPE_QUALS (TREE_TYPE (type
)) == TYPE_UNQUALIFIED
)));
127 \f/* This is a cache to hold if two types are compatible or not. */
129 struct tagged_tu_seen_cache
{
130 const struct tagged_tu_seen_cache
* next
;
133 /* The return value of tagged_types_tu_compatible_p if we had seen
134 these two types already. */
138 static const struct tagged_tu_seen_cache
* tagged_tu_seen_base
;
139 static void free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache
*);
141 /* Do `exp = require_complete_type (exp);' to make sure exp
142 does not have an incomplete type. (That includes void types.) */
145 require_complete_type (tree value
)
147 tree type
= TREE_TYPE (value
);
149 if (value
== error_mark_node
|| type
== error_mark_node
)
150 return error_mark_node
;
152 /* First, detect a valid value with a complete type. */
153 if (COMPLETE_TYPE_P (type
))
156 c_incomplete_type_error (value
, type
);
157 return error_mark_node
;
160 /* Print an error message for invalid use of an incomplete type.
161 VALUE is the expression that was used (or 0 if that isn't known)
162 and TYPE is the type that was invalid. */
165 c_incomplete_type_error (tree value
, tree type
)
167 const char *type_code_string
;
169 /* Avoid duplicate error message. */
170 if (TREE_CODE (type
) == ERROR_MARK
)
173 if (value
!= 0 && (TREE_CODE (value
) == VAR_DECL
174 || TREE_CODE (value
) == PARM_DECL
))
175 error ("%qD has an incomplete type", value
);
179 /* We must print an error message. Be clever about what it says. */
181 switch (TREE_CODE (type
))
184 type_code_string
= "struct";
188 type_code_string
= "union";
192 type_code_string
= "enum";
196 error ("invalid use of void expression");
200 if (TYPE_DOMAIN (type
))
202 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL
)
204 error ("invalid use of flexible array member");
207 type
= TREE_TYPE (type
);
210 error ("invalid use of array with unspecified bounds");
217 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
218 error ("invalid use of undefined type %<%s %E%>",
219 type_code_string
, TYPE_NAME (type
));
221 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
222 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type
));
226 /* Given a type, apply default promotions wrt unnamed function
227 arguments and return the new type. */
230 c_type_promotes_to (tree type
)
232 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
233 return double_type_node
;
235 if (c_promoting_integer_type_p (type
))
237 /* Preserve unsignedness if not really getting any wider. */
238 if (TYPE_UNSIGNED (type
)
239 && (TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
)))
240 return unsigned_type_node
;
241 return integer_type_node
;
247 /* Return a variant of TYPE which has all the type qualifiers of LIKE
248 as well as those of TYPE. */
251 qualify_type (tree type
, tree like
)
253 return c_build_qualified_type (type
,
254 TYPE_QUALS (type
) | TYPE_QUALS (like
));
257 /* Return true iff the given tree T is a variable length array. */
260 c_vla_type_p (tree t
)
262 if (TREE_CODE (t
) == ARRAY_TYPE
263 && C_TYPE_VARIABLE_SIZE (t
))
268 /* Return the composite type of two compatible types.
270 We assume that comptypes has already been done and returned
271 nonzero; if that isn't so, this may crash. In particular, we
272 assume that qualifiers match. */
275 composite_type (tree t1
, tree t2
)
277 enum tree_code code1
;
278 enum tree_code code2
;
281 /* Save time if the two types are the same. */
283 if (t1
== t2
) return t1
;
285 /* If one type is nonsense, use the other. */
286 if (t1
== error_mark_node
)
288 if (t2
== error_mark_node
)
291 code1
= TREE_CODE (t1
);
292 code2
= TREE_CODE (t2
);
294 /* Merge the attributes. */
295 attributes
= targetm
.merge_type_attributes (t1
, t2
);
297 /* If one is an enumerated type and the other is the compatible
298 integer type, the composite type might be either of the two
299 (DR#013 question 3). For consistency, use the enumerated type as
300 the composite type. */
302 if (code1
== ENUMERAL_TYPE
&& code2
== INTEGER_TYPE
)
304 if (code2
== ENUMERAL_TYPE
&& code1
== INTEGER_TYPE
)
307 gcc_assert (code1
== code2
);
312 /* For two pointers, do this recursively on the target type. */
314 tree pointed_to_1
= TREE_TYPE (t1
);
315 tree pointed_to_2
= TREE_TYPE (t2
);
316 tree target
= composite_type (pointed_to_1
, pointed_to_2
);
317 t1
= build_pointer_type (target
);
318 t1
= build_type_attribute_variant (t1
, attributes
);
319 return qualify_type (t1
, t2
);
324 tree elt
= composite_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
327 tree d1
= TYPE_DOMAIN (t1
);
328 tree d2
= TYPE_DOMAIN (t2
);
329 bool d1_variable
, d2_variable
;
330 bool d1_zero
, d2_zero
;
332 /* We should not have any type quals on arrays at all. */
333 gcc_assert (!TYPE_QUALS (t1
) && !TYPE_QUALS (t2
));
335 d1_zero
= d1
== 0 || !TYPE_MAX_VALUE (d1
);
336 d2_zero
= d2
== 0 || !TYPE_MAX_VALUE (d2
);
338 d1_variable
= (!d1_zero
339 && (TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
340 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
));
341 d2_variable
= (!d2_zero
342 && (TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
343 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
));
344 d1_variable
= d1_variable
|| (d1_zero
&& c_vla_type_p (t1
));
345 d2_variable
= d2_variable
|| (d2_zero
&& c_vla_type_p (t2
));
347 /* Save space: see if the result is identical to one of the args. */
348 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
)
349 && (d2_variable
|| d2_zero
|| !d1_variable
))
350 return build_type_attribute_variant (t1
, attributes
);
351 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
)
352 && (d1_variable
|| d1_zero
|| !d2_variable
))
353 return build_type_attribute_variant (t2
, attributes
);
355 if (elt
== TREE_TYPE (t1
) && !TYPE_DOMAIN (t2
) && !TYPE_DOMAIN (t1
))
356 return build_type_attribute_variant (t1
, attributes
);
357 if (elt
== TREE_TYPE (t2
) && !TYPE_DOMAIN (t2
) && !TYPE_DOMAIN (t1
))
358 return build_type_attribute_variant (t2
, attributes
);
360 /* Merge the element types, and have a size if either arg has
361 one. We may have qualifiers on the element types. To set
362 up TYPE_MAIN_VARIANT correctly, we need to form the
363 composite of the unqualified types and add the qualifiers
365 quals
= TYPE_QUALS (strip_array_types (elt
));
366 unqual_elt
= c_build_qualified_type (elt
, TYPE_UNQUALIFIED
);
367 t1
= build_array_type (unqual_elt
,
368 TYPE_DOMAIN ((TYPE_DOMAIN (t1
)
374 t1
= c_build_qualified_type (t1
, quals
);
375 return build_type_attribute_variant (t1
, attributes
);
381 if (attributes
!= NULL
)
383 /* Try harder not to create a new aggregate type. */
384 if (attribute_list_equal (TYPE_ATTRIBUTES (t1
), attributes
))
386 if (attribute_list_equal (TYPE_ATTRIBUTES (t2
), attributes
))
389 return build_type_attribute_variant (t1
, attributes
);
392 /* Function types: prefer the one that specified arg types.
393 If both do, merge the arg types. Also merge the return types. */
395 tree valtype
= composite_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
396 tree p1
= TYPE_ARG_TYPES (t1
);
397 tree p2
= TYPE_ARG_TYPES (t2
);
402 /* Save space: see if the result is identical to one of the args. */
403 if (valtype
== TREE_TYPE (t1
) && !TYPE_ARG_TYPES (t2
))
404 return build_type_attribute_variant (t1
, attributes
);
405 if (valtype
== TREE_TYPE (t2
) && !TYPE_ARG_TYPES (t1
))
406 return build_type_attribute_variant (t2
, attributes
);
408 /* Simple way if one arg fails to specify argument types. */
409 if (TYPE_ARG_TYPES (t1
) == 0)
411 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t2
));
412 t1
= build_type_attribute_variant (t1
, attributes
);
413 return qualify_type (t1
, t2
);
415 if (TYPE_ARG_TYPES (t2
) == 0)
417 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t1
));
418 t1
= build_type_attribute_variant (t1
, attributes
);
419 return qualify_type (t1
, t2
);
422 /* If both args specify argument types, we must merge the two
423 lists, argument by argument. */
424 /* Tell global_bindings_p to return false so that variable_size
425 doesn't die on VLAs in parameter types. */
426 c_override_global_bindings_to_false
= true;
428 len
= list_length (p1
);
431 for (i
= 0; i
< len
; i
++)
432 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
437 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
))
439 /* A null type means arg type is not specified.
440 Take whatever the other function type has. */
441 if (TREE_VALUE (p1
) == 0)
443 TREE_VALUE (n
) = TREE_VALUE (p2
);
446 if (TREE_VALUE (p2
) == 0)
448 TREE_VALUE (n
) = TREE_VALUE (p1
);
452 /* Given wait (union {union wait *u; int *i} *)
453 and wait (union wait *),
454 prefer union wait * as type of parm. */
455 if (TREE_CODE (TREE_VALUE (p1
)) == UNION_TYPE
456 && TREE_VALUE (p1
) != TREE_VALUE (p2
))
459 tree mv2
= TREE_VALUE (p2
);
460 if (mv2
&& mv2
!= error_mark_node
461 && TREE_CODE (mv2
) != ARRAY_TYPE
)
462 mv2
= TYPE_MAIN_VARIANT (mv2
);
463 for (memb
= TYPE_FIELDS (TREE_VALUE (p1
));
464 memb
; memb
= TREE_CHAIN (memb
))
466 tree mv3
= TREE_TYPE (memb
);
467 if (mv3
&& mv3
!= error_mark_node
468 && TREE_CODE (mv3
) != ARRAY_TYPE
)
469 mv3
= TYPE_MAIN_VARIANT (mv3
);
470 if (comptypes (mv3
, mv2
))
472 TREE_VALUE (n
) = composite_type (TREE_TYPE (memb
),
475 pedwarn ("function types not truly compatible in ISO C");
480 if (TREE_CODE (TREE_VALUE (p2
)) == UNION_TYPE
481 && TREE_VALUE (p2
) != TREE_VALUE (p1
))
484 tree mv1
= TREE_VALUE (p1
);
485 if (mv1
&& mv1
!= error_mark_node
486 && TREE_CODE (mv1
) != ARRAY_TYPE
)
487 mv1
= TYPE_MAIN_VARIANT (mv1
);
488 for (memb
= TYPE_FIELDS (TREE_VALUE (p2
));
489 memb
; memb
= TREE_CHAIN (memb
))
491 tree mv3
= TREE_TYPE (memb
);
492 if (mv3
&& mv3
!= error_mark_node
493 && TREE_CODE (mv3
) != ARRAY_TYPE
)
494 mv3
= TYPE_MAIN_VARIANT (mv3
);
495 if (comptypes (mv3
, mv1
))
497 TREE_VALUE (n
) = composite_type (TREE_TYPE (memb
),
500 pedwarn ("function types not truly compatible in ISO C");
505 TREE_VALUE (n
) = composite_type (TREE_VALUE (p1
), TREE_VALUE (p2
));
509 c_override_global_bindings_to_false
= false;
510 t1
= build_function_type (valtype
, newargs
);
511 t1
= qualify_type (t1
, t2
);
512 /* ... falls through ... */
516 return build_type_attribute_variant (t1
, attributes
);
521 /* Return the type of a conditional expression between pointers to
522 possibly differently qualified versions of compatible types.
524 We assume that comp_target_types has already been done and returned
525 nonzero; if that isn't so, this may crash. */
528 common_pointer_type (tree t1
, tree t2
)
531 tree pointed_to_1
, mv1
;
532 tree pointed_to_2
, mv2
;
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
);
561 t1
= build_pointer_type (c_build_qualified_type
563 TYPE_QUALS (pointed_to_1
) |
564 TYPE_QUALS (pointed_to_2
)));
565 return build_type_attribute_variant (t1
, attributes
);
568 /* Return the common type for two arithmetic types under the usual
569 arithmetic conversions. The default conversions have already been
570 applied, and enumerated types converted to their compatible integer
571 types. The resulting type is unqualified and has no attributes.
573 This is the type for the result of most arithmetic operations
574 if the operands have the given two types. */
577 c_common_type (tree t1
, tree t2
)
579 enum tree_code code1
;
580 enum tree_code code2
;
582 /* If one type is nonsense, use the other. */
583 if (t1
== error_mark_node
)
585 if (t2
== error_mark_node
)
588 if (TYPE_QUALS (t1
) != TYPE_UNQUALIFIED
)
589 t1
= TYPE_MAIN_VARIANT (t1
);
591 if (TYPE_QUALS (t2
) != TYPE_UNQUALIFIED
)
592 t2
= TYPE_MAIN_VARIANT (t2
);
594 if (TYPE_ATTRIBUTES (t1
) != NULL_TREE
)
595 t1
= build_type_attribute_variant (t1
, NULL_TREE
);
597 if (TYPE_ATTRIBUTES (t2
) != NULL_TREE
)
598 t2
= build_type_attribute_variant (t2
, NULL_TREE
);
600 /* Save time if the two types are the same. */
602 if (t1
== t2
) return t1
;
604 code1
= TREE_CODE (t1
);
605 code2
= TREE_CODE (t2
);
607 gcc_assert (code1
== VECTOR_TYPE
|| code1
== COMPLEX_TYPE
608 || code1
== REAL_TYPE
|| code1
== INTEGER_TYPE
);
609 gcc_assert (code2
== VECTOR_TYPE
|| code2
== COMPLEX_TYPE
610 || code2
== REAL_TYPE
|| code2
== INTEGER_TYPE
);
612 /* When one operand is a decimal float type, the other operand cannot be
613 a generic float type or a complex type. We also disallow vector types
615 if ((DECIMAL_FLOAT_TYPE_P (t1
) || DECIMAL_FLOAT_TYPE_P (t2
))
616 && !(DECIMAL_FLOAT_TYPE_P (t1
) && DECIMAL_FLOAT_TYPE_P (t2
)))
618 if (code1
== VECTOR_TYPE
|| code2
== VECTOR_TYPE
)
620 error ("can%'t mix operands of decimal float and vector types");
621 return error_mark_node
;
623 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
625 error ("can%'t mix operands of decimal float and complex types");
626 return error_mark_node
;
628 if (code1
== REAL_TYPE
&& code2
== REAL_TYPE
)
630 error ("can%'t mix operands of decimal float and other float types");
631 return error_mark_node
;
635 /* If one type is a vector type, return that type. (How the usual
636 arithmetic conversions apply to the vector types extension is not
637 precisely specified.) */
638 if (code1
== VECTOR_TYPE
)
641 if (code2
== VECTOR_TYPE
)
644 /* If one type is complex, form the common type of the non-complex
645 components, then make that complex. Use T1 or T2 if it is the
647 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
649 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
650 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
651 tree subtype
= c_common_type (subtype1
, subtype2
);
653 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
655 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
658 return build_complex_type (subtype
);
661 /* If only one is real, use it as the result. */
663 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
666 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
669 /* If both are real and either are decimal floating point types, use
670 the decimal floating point type with the greater precision. */
672 if (code1
== REAL_TYPE
&& code2
== REAL_TYPE
)
674 if (TYPE_MAIN_VARIANT (t1
) == dfloat128_type_node
675 || TYPE_MAIN_VARIANT (t2
) == dfloat128_type_node
)
676 return dfloat128_type_node
;
677 else if (TYPE_MAIN_VARIANT (t1
) == dfloat64_type_node
678 || TYPE_MAIN_VARIANT (t2
) == dfloat64_type_node
)
679 return dfloat64_type_node
;
680 else if (TYPE_MAIN_VARIANT (t1
) == dfloat32_type_node
681 || TYPE_MAIN_VARIANT (t2
) == dfloat32_type_node
)
682 return dfloat32_type_node
;
685 /* Both real or both integers; use the one with greater precision. */
687 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
689 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
692 /* Same precision. Prefer long longs to longs to ints when the
693 same precision, following the C99 rules on integer type rank
694 (which are equivalent to the C90 rules for C90 types). */
696 if (TYPE_MAIN_VARIANT (t1
) == long_long_unsigned_type_node
697 || TYPE_MAIN_VARIANT (t2
) == long_long_unsigned_type_node
)
698 return long_long_unsigned_type_node
;
700 if (TYPE_MAIN_VARIANT (t1
) == long_long_integer_type_node
701 || TYPE_MAIN_VARIANT (t2
) == long_long_integer_type_node
)
703 if (TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
704 return long_long_unsigned_type_node
;
706 return long_long_integer_type_node
;
709 if (TYPE_MAIN_VARIANT (t1
) == long_unsigned_type_node
710 || TYPE_MAIN_VARIANT (t2
) == long_unsigned_type_node
)
711 return long_unsigned_type_node
;
713 if (TYPE_MAIN_VARIANT (t1
) == long_integer_type_node
714 || TYPE_MAIN_VARIANT (t2
) == long_integer_type_node
)
716 /* But preserve unsignedness from the other type,
717 since long cannot hold all the values of an unsigned int. */
718 if (TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
719 return long_unsigned_type_node
;
721 return long_integer_type_node
;
724 /* Likewise, prefer long double to double even if same size. */
725 if (TYPE_MAIN_VARIANT (t1
) == long_double_type_node
726 || TYPE_MAIN_VARIANT (t2
) == long_double_type_node
)
727 return long_double_type_node
;
729 /* Otherwise prefer the unsigned one. */
731 if (TYPE_UNSIGNED (t1
))
737 /* Wrapper around c_common_type that is used by c-common.c and other
738 front end optimizations that remove promotions. ENUMERAL_TYPEs
739 are allowed here and are converted to their compatible integer types.
740 BOOLEAN_TYPEs are allowed here and return either boolean_type_node or
741 preferably a non-Boolean type as the common type. */
743 common_type (tree t1
, tree t2
)
745 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
746 t1
= c_common_type_for_size (TYPE_PRECISION (t1
), 1);
747 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
748 t2
= c_common_type_for_size (TYPE_PRECISION (t2
), 1);
750 /* If both types are BOOLEAN_TYPE, then return boolean_type_node. */
751 if (TREE_CODE (t1
) == BOOLEAN_TYPE
752 && TREE_CODE (t2
) == BOOLEAN_TYPE
)
753 return boolean_type_node
;
755 /* If either type is BOOLEAN_TYPE, then return the other. */
756 if (TREE_CODE (t1
) == BOOLEAN_TYPE
)
758 if (TREE_CODE (t2
) == BOOLEAN_TYPE
)
761 return c_common_type (t1
, t2
);
764 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
765 or various other operations. Return 2 if they are compatible
766 but a warning may be needed if you use them together. */
769 comptypes (tree type1
, tree type2
)
771 const struct tagged_tu_seen_cache
* tagged_tu_seen_base1
= tagged_tu_seen_base
;
774 val
= comptypes_internal (type1
, type2
);
775 free_all_tagged_tu_seen_up_to (tagged_tu_seen_base1
);
780 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
781 or various other operations. Return 2 if they are compatible
782 but a warning may be needed if you use them together. This
783 differs from comptypes, in that we don't free the seen types. */
786 comptypes_internal (tree type1
, tree type2
)
792 /* Suppress errors caused by previously reported errors. */
794 if (t1
== t2
|| !t1
|| !t2
795 || TREE_CODE (t1
) == ERROR_MARK
|| TREE_CODE (t2
) == ERROR_MARK
)
798 /* If either type is the internal version of sizetype, return the
800 if (TREE_CODE (t1
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t1
)
801 && TYPE_ORIG_SIZE_TYPE (t1
))
802 t1
= TYPE_ORIG_SIZE_TYPE (t1
);
804 if (TREE_CODE (t2
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t2
)
805 && TYPE_ORIG_SIZE_TYPE (t2
))
806 t2
= TYPE_ORIG_SIZE_TYPE (t2
);
809 /* Enumerated types are compatible with integer types, but this is
810 not transitive: two enumerated types in the same translation unit
811 are compatible with each other only if they are the same type. */
813 if (TREE_CODE (t1
) == ENUMERAL_TYPE
&& TREE_CODE (t2
) != ENUMERAL_TYPE
)
814 t1
= c_common_type_for_size (TYPE_PRECISION (t1
), TYPE_UNSIGNED (t1
));
815 else if (TREE_CODE (t2
) == ENUMERAL_TYPE
&& TREE_CODE (t1
) != ENUMERAL_TYPE
)
816 t2
= c_common_type_for_size (TYPE_PRECISION (t2
), TYPE_UNSIGNED (t2
));
821 /* Different classes of types can't be compatible. */
823 if (TREE_CODE (t1
) != TREE_CODE (t2
))
826 /* Qualifiers must match. C99 6.7.3p9 */
828 if (TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
831 /* Allow for two different type nodes which have essentially the same
832 definition. Note that we already checked for equality of the type
833 qualifiers (just above). */
835 if (TREE_CODE (t1
) != ARRAY_TYPE
836 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
839 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
840 if (!(attrval
= targetm
.comp_type_attributes (t1
, t2
)))
843 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
846 switch (TREE_CODE (t1
))
849 /* Do not remove mode or aliasing information. */
850 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
851 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
))
853 val
= (TREE_TYPE (t1
) == TREE_TYPE (t2
)
854 ? 1 : comptypes_internal (TREE_TYPE (t1
), TREE_TYPE (t2
)));
858 val
= function_types_compatible_p (t1
, t2
);
863 tree d1
= TYPE_DOMAIN (t1
);
864 tree d2
= TYPE_DOMAIN (t2
);
865 bool d1_variable
, d2_variable
;
866 bool d1_zero
, d2_zero
;
869 /* Target types must match incl. qualifiers. */
870 if (TREE_TYPE (t1
) != TREE_TYPE (t2
)
871 && 0 == (val
= comptypes_internal (TREE_TYPE (t1
), TREE_TYPE (t2
))))
874 /* Sizes must match unless one is missing or variable. */
875 if (d1
== 0 || d2
== 0 || d1
== d2
)
878 d1_zero
= !TYPE_MAX_VALUE (d1
);
879 d2_zero
= !TYPE_MAX_VALUE (d2
);
881 d1_variable
= (!d1_zero
882 && (TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
883 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
));
884 d2_variable
= (!d2_zero
885 && (TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
886 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
));
887 d1_variable
= d1_variable
|| (d1_zero
&& c_vla_type_p (t1
));
888 d2_variable
= d2_variable
|| (d2_zero
&& c_vla_type_p (t2
));
890 if (d1_variable
|| d2_variable
)
892 if (d1_zero
&& d2_zero
)
894 if (d1_zero
|| d2_zero
895 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
))
896 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1
), TYPE_MAX_VALUE (d2
)))
905 if (val
!= 1 && !same_translation_unit_p (t1
, t2
))
907 tree a1
= TYPE_ATTRIBUTES (t1
);
908 tree a2
= TYPE_ATTRIBUTES (t2
);
910 if (! attribute_list_contained (a1
, a2
)
911 && ! attribute_list_contained (a2
, a1
))
915 return tagged_types_tu_compatible_p (t1
, t2
);
916 val
= tagged_types_tu_compatible_p (t1
, t2
);
921 val
= TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
922 && comptypes_internal (TREE_TYPE (t1
), TREE_TYPE (t2
));
928 return attrval
== 2 && val
== 1 ? 2 : val
;
931 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
932 ignoring their qualifiers. */
935 comp_target_types (tree ttl
, tree ttr
)
940 /* Do not lose qualifiers on element types of array types that are
941 pointer targets by taking their TYPE_MAIN_VARIANT. */
942 mvl
= TREE_TYPE (ttl
);
943 mvr
= TREE_TYPE (ttr
);
944 if (TREE_CODE (mvl
) != ARRAY_TYPE
)
945 mvl
= TYPE_MAIN_VARIANT (mvl
);
946 if (TREE_CODE (mvr
) != ARRAY_TYPE
)
947 mvr
= TYPE_MAIN_VARIANT (mvr
);
948 val
= comptypes (mvl
, mvr
);
950 if (val
== 2 && pedantic
)
951 pedwarn ("types are not quite compatible");
955 /* Subroutines of `comptypes'. */
957 /* Determine whether two trees derive from the same translation unit.
958 If the CONTEXT chain ends in a null, that tree's context is still
959 being parsed, so if two trees have context chains ending in null,
960 they're in the same translation unit. */
962 same_translation_unit_p (tree t1
, tree t2
)
964 while (t1
&& TREE_CODE (t1
) != TRANSLATION_UNIT_DECL
)
965 switch (TREE_CODE_CLASS (TREE_CODE (t1
)))
967 case tcc_declaration
:
968 t1
= DECL_CONTEXT (t1
); break;
970 t1
= TYPE_CONTEXT (t1
); break;
971 case tcc_exceptional
:
972 t1
= BLOCK_SUPERCONTEXT (t1
); break; /* assume block */
973 default: gcc_unreachable ();
976 while (t2
&& TREE_CODE (t2
) != TRANSLATION_UNIT_DECL
)
977 switch (TREE_CODE_CLASS (TREE_CODE (t2
)))
979 case tcc_declaration
:
980 t2
= DECL_CONTEXT (t2
); break;
982 t2
= TYPE_CONTEXT (t2
); break;
983 case tcc_exceptional
:
984 t2
= BLOCK_SUPERCONTEXT (t2
); break; /* assume block */
985 default: gcc_unreachable ();
991 /* Allocate the seen two types, assuming that they are compatible. */
993 static struct tagged_tu_seen_cache
*
994 alloc_tagged_tu_seen_cache (tree t1
, tree t2
)
996 struct tagged_tu_seen_cache
*tu
= XNEW (struct tagged_tu_seen_cache
);
997 tu
->next
= tagged_tu_seen_base
;
1001 tagged_tu_seen_base
= tu
;
1003 /* The C standard says that two structures in different translation
1004 units are compatible with each other only if the types of their
1005 fields are compatible (among other things). We assume that they
1006 are compatible until proven otherwise when building the cache.
1007 An example where this can occur is:
1012 If we are comparing this against a similar struct in another TU,
1013 and did not assume they were compatible, we end up with an infinite
1019 /* Free the seen types until we get to TU_TIL. */
1022 free_all_tagged_tu_seen_up_to (const struct tagged_tu_seen_cache
*tu_til
)
1024 const struct tagged_tu_seen_cache
*tu
= tagged_tu_seen_base
;
1025 while (tu
!= tu_til
)
1027 struct tagged_tu_seen_cache
*tu1
= (struct tagged_tu_seen_cache
*)tu
;
1031 tagged_tu_seen_base
= tu_til
;
1034 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
1035 compatible. If the two types are not the same (which has been
1036 checked earlier), this can only happen when multiple translation
1037 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
1041 tagged_types_tu_compatible_p (tree t1
, tree t2
)
1044 bool needs_warning
= false;
1046 /* We have to verify that the tags of the types are the same. This
1047 is harder than it looks because this may be a typedef, so we have
1048 to go look at the original type. It may even be a typedef of a
1050 In the case of compiler-created builtin structs the TYPE_DECL
1051 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
1052 while (TYPE_NAME (t1
)
1053 && TREE_CODE (TYPE_NAME (t1
)) == TYPE_DECL
1054 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1
)))
1055 t1
= DECL_ORIGINAL_TYPE (TYPE_NAME (t1
));
1057 while (TYPE_NAME (t2
)
1058 && TREE_CODE (TYPE_NAME (t2
)) == TYPE_DECL
1059 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2
)))
1060 t2
= DECL_ORIGINAL_TYPE (TYPE_NAME (t2
));
1062 /* C90 didn't have the requirement that the two tags be the same. */
1063 if (flag_isoc99
&& TYPE_NAME (t1
) != TYPE_NAME (t2
))
1066 /* C90 didn't say what happened if one or both of the types were
1067 incomplete; we choose to follow C99 rules here, which is that they
1069 if (TYPE_SIZE (t1
) == NULL
1070 || TYPE_SIZE (t2
) == NULL
)
1074 const struct tagged_tu_seen_cache
* tts_i
;
1075 for (tts_i
= tagged_tu_seen_base
; tts_i
!= NULL
; tts_i
= tts_i
->next
)
1076 if (tts_i
->t1
== t1
&& tts_i
->t2
== t2
)
1080 switch (TREE_CODE (t1
))
1084 struct tagged_tu_seen_cache
*tu
= alloc_tagged_tu_seen_cache (t1
, t2
);
1085 /* Speed up the case where the type values are in the same order. */
1086 tree tv1
= TYPE_VALUES (t1
);
1087 tree tv2
= TYPE_VALUES (t2
);
1094 for (;tv1
&& tv2
; tv1
= TREE_CHAIN (tv1
), tv2
= TREE_CHAIN (tv2
))
1096 if (TREE_PURPOSE (tv1
) != TREE_PURPOSE (tv2
))
1098 if (simple_cst_equal (TREE_VALUE (tv1
), TREE_VALUE (tv2
)) != 1)
1105 if (tv1
== NULL_TREE
&& tv2
== NULL_TREE
)
1109 if (tv1
== NULL_TREE
|| tv2
== NULL_TREE
)
1115 if (list_length (TYPE_VALUES (t1
)) != list_length (TYPE_VALUES (t2
)))
1121 for (s1
= TYPE_VALUES (t1
); s1
; s1
= TREE_CHAIN (s1
))
1123 s2
= purpose_member (TREE_PURPOSE (s1
), TYPE_VALUES (t2
));
1125 || simple_cst_equal (TREE_VALUE (s1
), TREE_VALUE (s2
)) != 1)
1136 struct tagged_tu_seen_cache
*tu
= alloc_tagged_tu_seen_cache (t1
, t2
);
1137 if (list_length (TYPE_FIELDS (t1
)) != list_length (TYPE_FIELDS (t2
)))
1143 /* Speed up the common case where the fields are in the same order. */
1144 for (s1
= TYPE_FIELDS (t1
), s2
= TYPE_FIELDS (t2
); s1
&& s2
;
1145 s1
= TREE_CHAIN (s1
), s2
= TREE_CHAIN (s2
))
1150 if (DECL_NAME (s1
) == NULL
1151 || DECL_NAME (s1
) != DECL_NAME (s2
))
1153 result
= comptypes_internal (TREE_TYPE (s1
), TREE_TYPE (s2
));
1160 needs_warning
= true;
1162 if (TREE_CODE (s1
) == FIELD_DECL
1163 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
1164 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
1172 tu
->val
= needs_warning
? 2 : 1;
1176 for (s1
= TYPE_FIELDS (t1
); s1
; s1
= TREE_CHAIN (s1
))
1180 if (DECL_NAME (s1
) != NULL
)
1181 for (s2
= TYPE_FIELDS (t2
); s2
; s2
= TREE_CHAIN (s2
))
1182 if (DECL_NAME (s1
) == DECL_NAME (s2
))
1185 result
= comptypes_internal (TREE_TYPE (s1
), TREE_TYPE (s2
));
1192 needs_warning
= true;
1194 if (TREE_CODE (s1
) == FIELD_DECL
1195 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
1196 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
1208 tu
->val
= needs_warning
? 2 : 10;
1214 struct tagged_tu_seen_cache
*tu
= alloc_tagged_tu_seen_cache (t1
, t2
);
1216 for (s1
= TYPE_FIELDS (t1
), s2
= TYPE_FIELDS (t2
);
1218 s1
= TREE_CHAIN (s1
), s2
= TREE_CHAIN (s2
))
1221 if (TREE_CODE (s1
) != TREE_CODE (s2
)
1222 || DECL_NAME (s1
) != DECL_NAME (s2
))
1224 result
= comptypes_internal (TREE_TYPE (s1
), TREE_TYPE (s2
));
1228 needs_warning
= true;
1230 if (TREE_CODE (s1
) == FIELD_DECL
1231 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
1232 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
1238 tu
->val
= needs_warning
? 2 : 1;
1247 /* Return 1 if two function types F1 and F2 are compatible.
1248 If either type specifies no argument types,
1249 the other must specify a fixed number of self-promoting arg types.
1250 Otherwise, if one type specifies only the number of arguments,
1251 the other must specify that number of self-promoting arg types.
1252 Otherwise, the argument types must match. */
1255 function_types_compatible_p (tree f1
, tree f2
)
1258 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1263 ret1
= TREE_TYPE (f1
);
1264 ret2
= TREE_TYPE (f2
);
1266 /* 'volatile' qualifiers on a function's return type used to mean
1267 the function is noreturn. */
1268 if (TYPE_VOLATILE (ret1
) != TYPE_VOLATILE (ret2
))
1269 pedwarn ("function return types not compatible due to %<volatile%>");
1270 if (TYPE_VOLATILE (ret1
))
1271 ret1
= build_qualified_type (TYPE_MAIN_VARIANT (ret1
),
1272 TYPE_QUALS (ret1
) & ~TYPE_QUAL_VOLATILE
);
1273 if (TYPE_VOLATILE (ret2
))
1274 ret2
= build_qualified_type (TYPE_MAIN_VARIANT (ret2
),
1275 TYPE_QUALS (ret2
) & ~TYPE_QUAL_VOLATILE
);
1276 val
= comptypes_internal (ret1
, ret2
);
1280 args1
= TYPE_ARG_TYPES (f1
);
1281 args2
= TYPE_ARG_TYPES (f2
);
1283 /* An unspecified parmlist matches any specified parmlist
1284 whose argument types don't need default promotions. */
1288 if (!self_promoting_args_p (args2
))
1290 /* If one of these types comes from a non-prototype fn definition,
1291 compare that with the other type's arglist.
1292 If they don't match, ask for a warning (but no error). */
1293 if (TYPE_ACTUAL_ARG_TYPES (f1
)
1294 && 1 != type_lists_compatible_p (args2
, TYPE_ACTUAL_ARG_TYPES (f1
)))
1300 if (!self_promoting_args_p (args1
))
1302 if (TYPE_ACTUAL_ARG_TYPES (f2
)
1303 && 1 != type_lists_compatible_p (args1
, TYPE_ACTUAL_ARG_TYPES (f2
)))
1308 /* Both types have argument lists: compare them and propagate results. */
1309 val1
= type_lists_compatible_p (args1
, args2
);
1310 return val1
!= 1 ? val1
: val
;
1313 /* Check two lists of types for compatibility,
1314 returning 0 for incompatible, 1 for compatible,
1315 or 2 for compatible with warning. */
1318 type_lists_compatible_p (tree args1
, tree args2
)
1320 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1326 tree a1
, mv1
, a2
, mv2
;
1327 if (args1
== 0 && args2
== 0)
1329 /* If one list is shorter than the other,
1330 they fail to match. */
1331 if (args1
== 0 || args2
== 0)
1333 mv1
= a1
= TREE_VALUE (args1
);
1334 mv2
= a2
= TREE_VALUE (args2
);
1335 if (mv1
&& mv1
!= error_mark_node
&& TREE_CODE (mv1
) != ARRAY_TYPE
)
1336 mv1
= TYPE_MAIN_VARIANT (mv1
);
1337 if (mv2
&& mv2
!= error_mark_node
&& TREE_CODE (mv2
) != ARRAY_TYPE
)
1338 mv2
= TYPE_MAIN_VARIANT (mv2
);
1339 /* A null pointer instead of a type
1340 means there is supposed to be an argument
1341 but nothing is specified about what type it has.
1342 So match anything that self-promotes. */
1345 if (c_type_promotes_to (a2
) != a2
)
1350 if (c_type_promotes_to (a1
) != a1
)
1353 /* If one of the lists has an error marker, ignore this arg. */
1354 else if (TREE_CODE (a1
) == ERROR_MARK
1355 || TREE_CODE (a2
) == ERROR_MARK
)
1357 else if (!(newval
= comptypes_internal (mv1
, mv2
)))
1359 /* Allow wait (union {union wait *u; int *i} *)
1360 and wait (union wait *) to be compatible. */
1361 if (TREE_CODE (a1
) == UNION_TYPE
1362 && (TYPE_NAME (a1
) == 0
1363 || TYPE_TRANSPARENT_UNION (a1
))
1364 && TREE_CODE (TYPE_SIZE (a1
)) == INTEGER_CST
1365 && tree_int_cst_equal (TYPE_SIZE (a1
),
1369 for (memb
= TYPE_FIELDS (a1
);
1370 memb
; memb
= TREE_CHAIN (memb
))
1372 tree mv3
= TREE_TYPE (memb
);
1373 if (mv3
&& mv3
!= error_mark_node
1374 && TREE_CODE (mv3
) != ARRAY_TYPE
)
1375 mv3
= TYPE_MAIN_VARIANT (mv3
);
1376 if (comptypes_internal (mv3
, mv2
))
1382 else if (TREE_CODE (a2
) == UNION_TYPE
1383 && (TYPE_NAME (a2
) == 0
1384 || TYPE_TRANSPARENT_UNION (a2
))
1385 && TREE_CODE (TYPE_SIZE (a2
)) == INTEGER_CST
1386 && tree_int_cst_equal (TYPE_SIZE (a2
),
1390 for (memb
= TYPE_FIELDS (a2
);
1391 memb
; memb
= TREE_CHAIN (memb
))
1393 tree mv3
= TREE_TYPE (memb
);
1394 if (mv3
&& mv3
!= error_mark_node
1395 && TREE_CODE (mv3
) != ARRAY_TYPE
)
1396 mv3
= TYPE_MAIN_VARIANT (mv3
);
1397 if (comptypes_internal (mv3
, mv1
))
1407 /* comptypes said ok, but record if it said to warn. */
1411 args1
= TREE_CHAIN (args1
);
1412 args2
= TREE_CHAIN (args2
);
1416 /* Compute the size to increment a pointer by. */
1419 c_size_in_bytes (tree type
)
1421 enum tree_code code
= TREE_CODE (type
);
1423 if (code
== FUNCTION_TYPE
|| code
== VOID_TYPE
|| code
== ERROR_MARK
)
1424 return size_one_node
;
1426 if (!COMPLETE_OR_VOID_TYPE_P (type
))
1428 error ("arithmetic on pointer to an incomplete type");
1429 return size_one_node
;
1432 /* Convert in case a char is more than one unit. */
1433 return size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
1434 size_int (TYPE_PRECISION (char_type_node
)
1438 /* Return either DECL or its known constant value (if it has one). */
1441 decl_constant_value (tree decl
)
1443 if (/* Don't change a variable array bound or initial value to a constant
1444 in a place where a variable is invalid. Note that DECL_INITIAL
1445 isn't valid for a PARM_DECL. */
1446 current_function_decl
!= 0
1447 && TREE_CODE (decl
) != PARM_DECL
1448 && !TREE_THIS_VOLATILE (decl
)
1449 && TREE_READONLY (decl
)
1450 && DECL_INITIAL (decl
) != 0
1451 && TREE_CODE (DECL_INITIAL (decl
)) != ERROR_MARK
1452 /* This is invalid if initial value is not constant.
1453 If it has either a function call, a memory reference,
1454 or a variable, then re-evaluating it could give different results. */
1455 && TREE_CONSTANT (DECL_INITIAL (decl
))
1456 /* Check for cases where this is sub-optimal, even though valid. */
1457 && TREE_CODE (DECL_INITIAL (decl
)) != CONSTRUCTOR
)
1458 return DECL_INITIAL (decl
);
1462 /* Return either DECL or its known constant value (if it has one), but
1463 return DECL if pedantic or DECL has mode BLKmode. This is for
1464 bug-compatibility with the old behavior of decl_constant_value
1465 (before GCC 3.0); every use of this function is a bug and it should
1466 be removed before GCC 3.1. It is not appropriate to use pedantic
1467 in a way that affects optimization, and BLKmode is probably not the
1468 right test for avoiding misoptimizations either. */
1471 decl_constant_value_for_broken_optimization (tree decl
)
1475 if (pedantic
|| DECL_MODE (decl
) == BLKmode
)
1478 ret
= decl_constant_value (decl
);
1479 /* Avoid unwanted tree sharing between the initializer and current
1480 function's body where the tree can be modified e.g. by the
1482 if (ret
!= decl
&& TREE_STATIC (decl
))
1483 ret
= unshare_expr (ret
);
1487 /* Convert the array expression EXP to a pointer. */
1489 array_to_pointer_conversion (tree exp
)
1491 tree orig_exp
= exp
;
1492 tree type
= TREE_TYPE (exp
);
1494 tree restype
= TREE_TYPE (type
);
1497 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
1499 STRIP_TYPE_NOPS (exp
);
1501 if (TREE_NO_WARNING (orig_exp
))
1502 TREE_NO_WARNING (exp
) = 1;
1504 ptrtype
= build_pointer_type (restype
);
1506 if (TREE_CODE (exp
) == INDIRECT_REF
)
1507 return convert (ptrtype
, TREE_OPERAND (exp
, 0));
1509 if (TREE_CODE (exp
) == VAR_DECL
)
1511 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1512 ADDR_EXPR because it's the best way of representing what
1513 happens in C when we take the address of an array and place
1514 it in a pointer to the element type. */
1515 adr
= build1 (ADDR_EXPR
, ptrtype
, exp
);
1516 if (!c_mark_addressable (exp
))
1517 return error_mark_node
;
1518 TREE_SIDE_EFFECTS (adr
) = 0; /* Default would be, same as EXP. */
1522 /* This way is better for a COMPONENT_REF since it can
1523 simplify the offset for a component. */
1524 adr
= build_unary_op (ADDR_EXPR
, exp
, 1);
1525 return convert (ptrtype
, adr
);
1528 /* Convert the function expression EXP to a pointer. */
1530 function_to_pointer_conversion (tree exp
)
1532 tree orig_exp
= exp
;
1534 gcc_assert (TREE_CODE (TREE_TYPE (exp
)) == FUNCTION_TYPE
);
1536 STRIP_TYPE_NOPS (exp
);
1538 if (TREE_NO_WARNING (orig_exp
))
1539 TREE_NO_WARNING (exp
) = 1;
1541 return build_unary_op (ADDR_EXPR
, exp
, 0);
1544 /* Perform the default conversion of arrays and functions to pointers.
1545 Return the result of converting EXP. For any other expression, just
1546 return EXP after removing NOPs. */
1549 default_function_array_conversion (struct c_expr exp
)
1551 tree orig_exp
= exp
.value
;
1552 tree type
= TREE_TYPE (exp
.value
);
1553 enum tree_code code
= TREE_CODE (type
);
1559 bool not_lvalue
= false;
1560 bool lvalue_array_p
;
1562 while ((TREE_CODE (exp
.value
) == NON_LVALUE_EXPR
1563 || TREE_CODE (exp
.value
) == NOP_EXPR
1564 || TREE_CODE (exp
.value
) == CONVERT_EXPR
)
1565 && TREE_TYPE (TREE_OPERAND (exp
.value
, 0)) == type
)
1567 if (TREE_CODE (exp
.value
) == NON_LVALUE_EXPR
)
1569 exp
.value
= TREE_OPERAND (exp
.value
, 0);
1572 if (TREE_NO_WARNING (orig_exp
))
1573 TREE_NO_WARNING (exp
.value
) = 1;
1575 lvalue_array_p
= !not_lvalue
&& lvalue_p (exp
.value
);
1576 if (!flag_isoc99
&& !lvalue_array_p
)
1578 /* Before C99, non-lvalue arrays do not decay to pointers.
1579 Normally, using such an array would be invalid; but it can
1580 be used correctly inside sizeof or as a statement expression.
1581 Thus, do not give an error here; an error will result later. */
1585 exp
.value
= array_to_pointer_conversion (exp
.value
);
1589 exp
.value
= function_to_pointer_conversion (exp
.value
);
1592 STRIP_TYPE_NOPS (exp
.value
);
1593 if (TREE_NO_WARNING (orig_exp
))
1594 TREE_NO_WARNING (exp
.value
) = 1;
1602 /* EXP is an expression of integer type. Apply the integer promotions
1603 to it and return the promoted value. */
1606 perform_integral_promotions (tree exp
)
1608 tree type
= TREE_TYPE (exp
);
1609 enum tree_code code
= TREE_CODE (type
);
1611 gcc_assert (INTEGRAL_TYPE_P (type
));
1613 /* Normally convert enums to int,
1614 but convert wide enums to something wider. */
1615 if (code
== ENUMERAL_TYPE
)
1617 type
= c_common_type_for_size (MAX (TYPE_PRECISION (type
),
1618 TYPE_PRECISION (integer_type_node
)),
1619 ((TYPE_PRECISION (type
)
1620 >= TYPE_PRECISION (integer_type_node
))
1621 && TYPE_UNSIGNED (type
)));
1623 return convert (type
, exp
);
1626 /* ??? This should no longer be needed now bit-fields have their
1628 if (TREE_CODE (exp
) == COMPONENT_REF
1629 && DECL_C_BIT_FIELD (TREE_OPERAND (exp
, 1))
1630 /* If it's thinner than an int, promote it like a
1631 c_promoting_integer_type_p, otherwise leave it alone. */
1632 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp
, 1)),
1633 TYPE_PRECISION (integer_type_node
)))
1634 return convert (integer_type_node
, exp
);
1636 if (c_promoting_integer_type_p (type
))
1638 /* Preserve unsignedness if not really getting any wider. */
1639 if (TYPE_UNSIGNED (type
)
1640 && TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
))
1641 return convert (unsigned_type_node
, exp
);
1643 return convert (integer_type_node
, exp
);
1650 /* Perform default promotions for C data used in expressions.
1651 Enumeral types or short or char are converted to int.
1652 In addition, manifest constants symbols are replaced by their values. */
1655 default_conversion (tree exp
)
1658 tree type
= TREE_TYPE (exp
);
1659 enum tree_code code
= TREE_CODE (type
);
1661 /* Functions and arrays have been converted during parsing. */
1662 gcc_assert (code
!= FUNCTION_TYPE
);
1663 if (code
== ARRAY_TYPE
)
1666 /* Constants can be used directly unless they're not loadable. */
1667 if (TREE_CODE (exp
) == CONST_DECL
)
1668 exp
= DECL_INITIAL (exp
);
1670 /* Replace a nonvolatile const static variable with its value unless
1671 it is an array, in which case we must be sure that taking the
1672 address of the array produces consistent results. */
1673 else if (optimize
&& TREE_CODE (exp
) == VAR_DECL
&& code
!= ARRAY_TYPE
)
1675 exp
= decl_constant_value_for_broken_optimization (exp
);
1676 type
= TREE_TYPE (exp
);
1679 /* Strip no-op conversions. */
1681 STRIP_TYPE_NOPS (exp
);
1683 if (TREE_NO_WARNING (orig_exp
))
1684 TREE_NO_WARNING (exp
) = 1;
1686 if (INTEGRAL_TYPE_P (type
))
1687 return perform_integral_promotions (exp
);
1689 if (code
== VOID_TYPE
)
1691 error ("void value not ignored as it ought to be");
1692 return error_mark_node
;
1697 /* Look up COMPONENT in a structure or union DECL.
1699 If the component name is not found, returns NULL_TREE. Otherwise,
1700 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1701 stepping down the chain to the component, which is in the last
1702 TREE_VALUE of the list. Normally the list is of length one, but if
1703 the component is embedded within (nested) anonymous structures or
1704 unions, the list steps down the chain to the component. */
1707 lookup_field (tree decl
, tree component
)
1709 tree type
= TREE_TYPE (decl
);
1712 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1713 to the field elements. Use a binary search on this array to quickly
1714 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1715 will always be set for structures which have many elements. */
1717 if (TYPE_LANG_SPECIFIC (type
) && TYPE_LANG_SPECIFIC (type
)->s
)
1720 tree
*field_array
= &TYPE_LANG_SPECIFIC (type
)->s
->elts
[0];
1722 field
= TYPE_FIELDS (type
);
1724 top
= TYPE_LANG_SPECIFIC (type
)->s
->len
;
1725 while (top
- bot
> 1)
1727 half
= (top
- bot
+ 1) >> 1;
1728 field
= field_array
[bot
+half
];
1730 if (DECL_NAME (field
) == NULL_TREE
)
1732 /* Step through all anon unions in linear fashion. */
1733 while (DECL_NAME (field_array
[bot
]) == NULL_TREE
)
1735 field
= field_array
[bot
++];
1736 if (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
1737 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
1739 tree anon
= lookup_field (field
, component
);
1742 return tree_cons (NULL_TREE
, field
, anon
);
1746 /* Entire record is only anon unions. */
1750 /* Restart the binary search, with new lower bound. */
1754 if (DECL_NAME (field
) == component
)
1756 if (DECL_NAME (field
) < component
)
1762 if (DECL_NAME (field_array
[bot
]) == component
)
1763 field
= field_array
[bot
];
1764 else if (DECL_NAME (field
) != component
)
1769 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1771 if (DECL_NAME (field
) == NULL_TREE
1772 && (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
1773 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
))
1775 tree anon
= lookup_field (field
, component
);
1778 return tree_cons (NULL_TREE
, field
, anon
);
1781 if (DECL_NAME (field
) == component
)
1785 if (field
== NULL_TREE
)
1789 return tree_cons (NULL_TREE
, field
, NULL_TREE
);
1792 /* Make an expression to refer to the COMPONENT field of
1793 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1796 build_component_ref (tree datum
, tree component
)
1798 tree type
= TREE_TYPE (datum
);
1799 enum tree_code code
= TREE_CODE (type
);
1803 if (!objc_is_public (datum
, component
))
1804 return error_mark_node
;
1806 /* See if there is a field or component with name COMPONENT. */
1808 if (code
== RECORD_TYPE
|| code
== UNION_TYPE
)
1810 if (!COMPLETE_TYPE_P (type
))
1812 c_incomplete_type_error (NULL_TREE
, type
);
1813 return error_mark_node
;
1816 field
= lookup_field (datum
, component
);
1820 error ("%qT has no member named %qE", type
, component
);
1821 return error_mark_node
;
1824 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1825 This might be better solved in future the way the C++ front
1826 end does it - by giving the anonymous entities each a
1827 separate name and type, and then have build_component_ref
1828 recursively call itself. We can't do that here. */
1831 tree subdatum
= TREE_VALUE (field
);
1835 if (TREE_TYPE (subdatum
) == error_mark_node
)
1836 return error_mark_node
;
1838 quals
= TYPE_QUALS (strip_array_types (TREE_TYPE (subdatum
)));
1839 quals
|= TYPE_QUALS (TREE_TYPE (datum
));
1840 subtype
= c_build_qualified_type (TREE_TYPE (subdatum
), quals
);
1842 ref
= build3 (COMPONENT_REF
, subtype
, datum
, subdatum
,
1844 if (TREE_READONLY (datum
) || TREE_READONLY (subdatum
))
1845 TREE_READONLY (ref
) = 1;
1846 if (TREE_THIS_VOLATILE (datum
) || TREE_THIS_VOLATILE (subdatum
))
1847 TREE_THIS_VOLATILE (ref
) = 1;
1849 if (TREE_DEPRECATED (subdatum
))
1850 warn_deprecated_use (subdatum
);
1854 field
= TREE_CHAIN (field
);
1860 else if (code
!= ERROR_MARK
)
1861 error ("request for member %qE in something not a structure or union",
1864 return error_mark_node
;
1867 /* Given an expression PTR for a pointer, return an expression
1868 for the value pointed to.
1869 ERRORSTRING is the name of the operator to appear in error messages. */
1872 build_indirect_ref (tree ptr
, const char *errorstring
)
1874 tree pointer
= default_conversion (ptr
);
1875 tree type
= TREE_TYPE (pointer
);
1877 if (TREE_CODE (type
) == POINTER_TYPE
)
1879 if (TREE_CODE (pointer
) == CONVERT_EXPR
1880 || TREE_CODE (pointer
) == NOP_EXPR
1881 || TREE_CODE (pointer
) == VIEW_CONVERT_EXPR
)
1883 /* If a warning is issued, mark it to avoid duplicates from
1884 the backend. This only needs to be done at
1885 warn_strict_aliasing > 2. */
1886 if (warn_strict_aliasing
> 2)
1887 if (strict_aliasing_warning (TREE_TYPE (TREE_OPERAND (pointer
, 0)),
1888 type
, TREE_OPERAND (pointer
, 0)))
1889 TREE_NO_WARNING (pointer
) = 1;
1892 if (TREE_CODE (pointer
) == ADDR_EXPR
1893 && (TREE_TYPE (TREE_OPERAND (pointer
, 0))
1894 == TREE_TYPE (type
)))
1895 return TREE_OPERAND (pointer
, 0);
1898 tree t
= TREE_TYPE (type
);
1901 ref
= build1 (INDIRECT_REF
, t
, pointer
);
1903 if (!COMPLETE_OR_VOID_TYPE_P (t
) && TREE_CODE (t
) != ARRAY_TYPE
)
1905 error ("dereferencing pointer to incomplete type");
1906 return error_mark_node
;
1908 if (VOID_TYPE_P (t
) && skip_evaluation
== 0)
1909 warning (0, "dereferencing %<void *%> pointer");
1911 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1912 so that we get the proper error message if the result is used
1913 to assign to. Also, &* is supposed to be a no-op.
1914 And ANSI C seems to specify that the type of the result
1915 should be the const type. */
1916 /* A de-reference of a pointer to const is not a const. It is valid
1917 to change it via some other pointer. */
1918 TREE_READONLY (ref
) = TYPE_READONLY (t
);
1919 TREE_SIDE_EFFECTS (ref
)
1920 = TYPE_VOLATILE (t
) || TREE_SIDE_EFFECTS (pointer
);
1921 TREE_THIS_VOLATILE (ref
) = TYPE_VOLATILE (t
);
1925 else if (TREE_CODE (pointer
) != ERROR_MARK
)
1926 error ("invalid type argument of %qs (have %qT)", errorstring
, type
);
1927 return error_mark_node
;
1930 /* This handles expressions of the form "a[i]", which denotes
1933 This is logically equivalent in C to *(a+i), but we may do it differently.
1934 If A is a variable or a member, we generate a primitive ARRAY_REF.
1935 This avoids forcing the array out of registers, and can work on
1936 arrays that are not lvalues (for example, members of structures returned
1940 build_array_ref (tree array
, tree index
)
1942 bool swapped
= false;
1943 if (TREE_TYPE (array
) == error_mark_node
1944 || TREE_TYPE (index
) == error_mark_node
)
1945 return error_mark_node
;
1947 if (TREE_CODE (TREE_TYPE (array
)) != ARRAY_TYPE
1948 && TREE_CODE (TREE_TYPE (array
)) != POINTER_TYPE
)
1951 if (TREE_CODE (TREE_TYPE (index
)) != ARRAY_TYPE
1952 && TREE_CODE (TREE_TYPE (index
)) != POINTER_TYPE
)
1954 error ("subscripted value is neither array nor pointer");
1955 return error_mark_node
;
1963 if (!INTEGRAL_TYPE_P (TREE_TYPE (index
)))
1965 error ("array subscript is not an integer");
1966 return error_mark_node
;
1969 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array
))) == FUNCTION_TYPE
)
1971 error ("subscripted value is pointer to function");
1972 return error_mark_node
;
1975 /* ??? Existing practice has been to warn only when the char
1976 index is syntactically the index, not for char[array]. */
1978 warn_array_subscript_with_type_char (index
);
1980 /* Apply default promotions *after* noticing character types. */
1981 index
= default_conversion (index
);
1983 gcc_assert (TREE_CODE (TREE_TYPE (index
)) == INTEGER_TYPE
);
1985 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
1989 /* An array that is indexed by a non-constant
1990 cannot be stored in a register; we must be able to do
1991 address arithmetic on its address.
1992 Likewise an array of elements of variable size. */
1993 if (TREE_CODE (index
) != INTEGER_CST
1994 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
1995 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
)))) != INTEGER_CST
))
1997 if (!c_mark_addressable (array
))
1998 return error_mark_node
;
2000 /* An array that is indexed by a constant value which is not within
2001 the array bounds cannot be stored in a register either; because we
2002 would get a crash in store_bit_field/extract_bit_field when trying
2003 to access a non-existent part of the register. */
2004 if (TREE_CODE (index
) == INTEGER_CST
2005 && TYPE_DOMAIN (TREE_TYPE (array
))
2006 && !int_fits_type_p (index
, TYPE_DOMAIN (TREE_TYPE (array
))))
2008 if (!c_mark_addressable (array
))
2009 return error_mark_node
;
2015 while (TREE_CODE (foo
) == COMPONENT_REF
)
2016 foo
= TREE_OPERAND (foo
, 0);
2017 if (TREE_CODE (foo
) == VAR_DECL
&& C_DECL_REGISTER (foo
))
2018 pedwarn ("ISO C forbids subscripting %<register%> array");
2019 else if (!flag_isoc99
&& !lvalue_p (foo
))
2020 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
2023 type
= TREE_TYPE (TREE_TYPE (array
));
2024 if (TREE_CODE (type
) != ARRAY_TYPE
)
2025 type
= TYPE_MAIN_VARIANT (type
);
2026 rval
= build4 (ARRAY_REF
, type
, array
, index
, NULL_TREE
, NULL_TREE
);
2027 /* Array ref is const/volatile if the array elements are
2028 or if the array is. */
2029 TREE_READONLY (rval
)
2030 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array
)))
2031 | TREE_READONLY (array
));
2032 TREE_SIDE_EFFECTS (rval
)
2033 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
2034 | TREE_SIDE_EFFECTS (array
));
2035 TREE_THIS_VOLATILE (rval
)
2036 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
2037 /* This was added by rms on 16 Nov 91.
2038 It fixes vol struct foo *a; a->elts[1]
2039 in an inline function.
2040 Hope it doesn't break something else. */
2041 | TREE_THIS_VOLATILE (array
));
2042 return require_complete_type (fold (rval
));
2046 tree ar
= default_conversion (array
);
2048 if (ar
== error_mark_node
)
2051 gcc_assert (TREE_CODE (TREE_TYPE (ar
)) == POINTER_TYPE
);
2052 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar
))) != FUNCTION_TYPE
);
2054 return build_indirect_ref (build_binary_op (PLUS_EXPR
, ar
, index
, 0),
2059 /* Build an external reference to identifier ID. FUN indicates
2060 whether this will be used for a function call. LOC is the source
2061 location of the identifier. */
2063 build_external_ref (tree id
, int fun
, location_t loc
)
2066 tree decl
= lookup_name (id
);
2068 /* In Objective-C, an instance variable (ivar) may be preferred to
2069 whatever lookup_name() found. */
2070 decl
= objc_lookup_ivar (decl
, id
);
2072 if (decl
&& decl
!= error_mark_node
)
2075 /* Implicit function declaration. */
2076 ref
= implicitly_declare (id
);
2077 else if (decl
== error_mark_node
)
2078 /* Don't complain about something that's already been
2079 complained about. */
2080 return error_mark_node
;
2083 undeclared_variable (id
, loc
);
2084 return error_mark_node
;
2087 if (TREE_TYPE (ref
) == error_mark_node
)
2088 return error_mark_node
;
2090 if (TREE_DEPRECATED (ref
))
2091 warn_deprecated_use (ref
);
2093 if (!skip_evaluation
)
2094 assemble_external (ref
);
2095 TREE_USED (ref
) = 1;
2097 if (TREE_CODE (ref
) == FUNCTION_DECL
&& !in_alignof
)
2099 if (!in_sizeof
&& !in_typeof
)
2100 C_DECL_USED (ref
) = 1;
2101 else if (DECL_INITIAL (ref
) == 0
2102 && DECL_EXTERNAL (ref
)
2103 && !TREE_PUBLIC (ref
))
2104 record_maybe_used_decl (ref
);
2107 if (TREE_CODE (ref
) == CONST_DECL
)
2109 used_types_insert (TREE_TYPE (ref
));
2110 ref
= DECL_INITIAL (ref
);
2111 TREE_CONSTANT (ref
) = 1;
2112 TREE_INVARIANT (ref
) = 1;
2114 else if (current_function_decl
!= 0
2115 && !DECL_FILE_SCOPE_P (current_function_decl
)
2116 && (TREE_CODE (ref
) == VAR_DECL
2117 || TREE_CODE (ref
) == PARM_DECL
2118 || TREE_CODE (ref
) == FUNCTION_DECL
))
2120 tree context
= decl_function_context (ref
);
2122 if (context
!= 0 && context
!= current_function_decl
)
2123 DECL_NONLOCAL (ref
) = 1;
2125 /* C99 6.7.4p3: An inline definition of a function with external
2126 linkage ... shall not contain a reference to an identifier with
2127 internal linkage. */
2128 else if (current_function_decl
!= 0
2129 && DECL_DECLARED_INLINE_P (current_function_decl
)
2130 && DECL_EXTERNAL (current_function_decl
)
2131 && VAR_OR_FUNCTION_DECL_P (ref
)
2132 && (TREE_CODE (ref
) != VAR_DECL
|| TREE_STATIC (ref
))
2133 && ! TREE_PUBLIC (ref
))
2134 pedwarn ("%H%qD is static but used in inline function %qD "
2135 "which is not static", &loc
, ref
, current_function_decl
);
2140 /* Record details of decls possibly used inside sizeof or typeof. */
2141 struct maybe_used_decl
2145 /* The level seen at (in_sizeof + in_typeof). */
2147 /* The next one at this level or above, or NULL. */
2148 struct maybe_used_decl
*next
;
2151 static struct maybe_used_decl
*maybe_used_decls
;
2153 /* Record that DECL, an undefined static function reference seen
2154 inside sizeof or typeof, might be used if the operand of sizeof is
2155 a VLA type or the operand of typeof is a variably modified
2159 record_maybe_used_decl (tree decl
)
2161 struct maybe_used_decl
*t
= XOBNEW (&parser_obstack
, struct maybe_used_decl
);
2163 t
->level
= in_sizeof
+ in_typeof
;
2164 t
->next
= maybe_used_decls
;
2165 maybe_used_decls
= t
;
2168 /* Pop the stack of decls possibly used inside sizeof or typeof. If
2169 USED is false, just discard them. If it is true, mark them used
2170 (if no longer inside sizeof or typeof) or move them to the next
2171 level up (if still inside sizeof or typeof). */
2174 pop_maybe_used (bool used
)
2176 struct maybe_used_decl
*p
= maybe_used_decls
;
2177 int cur_level
= in_sizeof
+ in_typeof
;
2178 while (p
&& p
->level
> cur_level
)
2183 C_DECL_USED (p
->decl
) = 1;
2185 p
->level
= cur_level
;
2189 if (!used
|| cur_level
== 0)
2190 maybe_used_decls
= p
;
2193 /* Return the result of sizeof applied to EXPR. */
2196 c_expr_sizeof_expr (struct c_expr expr
)
2199 if (expr
.value
== error_mark_node
)
2201 ret
.value
= error_mark_node
;
2202 ret
.original_code
= ERROR_MARK
;
2203 pop_maybe_used (false);
2207 ret
.value
= c_sizeof (TREE_TYPE (expr
.value
));
2208 ret
.original_code
= ERROR_MARK
;
2209 if (c_vla_type_p (TREE_TYPE (expr
.value
)))
2211 /* sizeof is evaluated when given a vla (C99 6.5.3.4p2). */
2212 ret
.value
= build2 (COMPOUND_EXPR
, TREE_TYPE (ret
.value
), expr
.value
, ret
.value
);
2214 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr
.value
)));
2219 /* Return the result of sizeof applied to T, a structure for the type
2220 name passed to sizeof (rather than the type itself). */
2223 c_expr_sizeof_type (struct c_type_name
*t
)
2227 type
= groktypename (t
);
2228 ret
.value
= c_sizeof (type
);
2229 ret
.original_code
= ERROR_MARK
;
2230 pop_maybe_used (type
!= error_mark_node
2231 ? C_TYPE_VARIABLE_SIZE (type
) : false);
2235 /* Build a function call to function FUNCTION with parameters PARAMS.
2236 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2237 TREE_VALUE of each node is a parameter-expression.
2238 FUNCTION's data type may be a function type or a pointer-to-function. */
2241 build_function_call (tree function
, tree params
)
2243 tree fntype
, fundecl
= 0;
2244 tree name
= NULL_TREE
, result
;
2250 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
2251 STRIP_TYPE_NOPS (function
);
2253 /* Convert anything with function type to a pointer-to-function. */
2254 if (TREE_CODE (function
) == FUNCTION_DECL
)
2256 /* Implement type-directed function overloading for builtins.
2257 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
2258 handle all the type checking. The result is a complete expression
2259 that implements this function call. */
2260 tem
= resolve_overloaded_builtin (function
, params
);
2264 name
= DECL_NAME (function
);
2267 if (TREE_CODE (TREE_TYPE (function
)) == FUNCTION_TYPE
)
2268 function
= function_to_pointer_conversion (function
);
2270 /* For Objective-C, convert any calls via a cast to OBJC_TYPE_REF
2271 expressions, like those used for ObjC messenger dispatches. */
2272 function
= objc_rewrite_function_call (function
, params
);
2274 fntype
= TREE_TYPE (function
);
2276 if (TREE_CODE (fntype
) == ERROR_MARK
)
2277 return error_mark_node
;
2279 if (!(TREE_CODE (fntype
) == POINTER_TYPE
2280 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
))
2282 error ("called object %qE is not a function", function
);
2283 return error_mark_node
;
2286 if (fundecl
&& TREE_THIS_VOLATILE (fundecl
))
2287 current_function_returns_abnormally
= 1;
2289 /* fntype now gets the type of function pointed to. */
2290 fntype
= TREE_TYPE (fntype
);
2292 /* Check that the function is called through a compatible prototype.
2293 If it is not, replace the call by a trap, wrapped up in a compound
2294 expression if necessary. This has the nice side-effect to prevent
2295 the tree-inliner from generating invalid assignment trees which may
2296 blow up in the RTL expander later. */
2297 if ((TREE_CODE (function
) == NOP_EXPR
2298 || TREE_CODE (function
) == CONVERT_EXPR
)
2299 && TREE_CODE (tem
= TREE_OPERAND (function
, 0)) == ADDR_EXPR
2300 && TREE_CODE (tem
= TREE_OPERAND (tem
, 0)) == FUNCTION_DECL
2301 && !comptypes (fntype
, TREE_TYPE (tem
)))
2303 tree return_type
= TREE_TYPE (fntype
);
2304 tree trap
= build_function_call (built_in_decls
[BUILT_IN_TRAP
],
2307 /* This situation leads to run-time undefined behavior. We can't,
2308 therefore, simply error unless we can prove that all possible
2309 executions of the program must execute the code. */
2310 warning (0, "function called through a non-compatible type");
2312 /* We can, however, treat "undefined" any way we please.
2313 Call abort to encourage the user to fix the program. */
2314 inform ("if this code is reached, the program will abort");
2316 if (VOID_TYPE_P (return_type
))
2322 if (AGGREGATE_TYPE_P (return_type
))
2323 rhs
= build_compound_literal (return_type
,
2324 build_constructor (return_type
, 0));
2326 rhs
= fold_convert (return_type
, integer_zero_node
);
2328 return build2 (COMPOUND_EXPR
, return_type
, trap
, rhs
);
2332 /* Convert the parameters to the types declared in the
2333 function prototype, or apply default promotions. */
2335 nargs
= list_length (params
);
2336 argarray
= (tree
*) alloca (nargs
* sizeof (tree
));
2337 nargs
= convert_arguments (nargs
, argarray
, TYPE_ARG_TYPES (fntype
),
2338 params
, function
, fundecl
);
2340 return error_mark_node
;
2342 /* Check that the arguments to the function are valid. */
2344 check_function_arguments (TYPE_ATTRIBUTES (fntype
), nargs
, argarray
,
2345 TYPE_ARG_TYPES (fntype
));
2347 if (require_constant_value
)
2349 result
= fold_build_call_array_initializer (TREE_TYPE (fntype
),
2350 function
, nargs
, argarray
);
2351 if (TREE_CONSTANT (result
)
2352 && (name
== NULL_TREE
2353 || strncmp (IDENTIFIER_POINTER (name
), "__builtin_", 10) != 0))
2354 pedwarn_init ("initializer element is not constant");
2357 result
= fold_build_call_array (TREE_TYPE (fntype
),
2358 function
, nargs
, argarray
);
2360 if (VOID_TYPE_P (TREE_TYPE (result
)))
2362 return require_complete_type (result
);
2365 /* Convert the argument expressions in the list VALUES
2366 to the types in the list TYPELIST. The resulting arguments are
2367 stored in the array ARGARRAY which has size NARGS.
2369 If TYPELIST is exhausted, or when an element has NULL as its type,
2370 perform the default conversions.
2372 PARMLIST is the chain of parm decls for the function being called.
2373 It may be 0, if that info is not available.
2374 It is used only for generating error messages.
2376 FUNCTION is a tree for the called function. It is used only for
2377 error messages, where it is formatted with %qE.
2379 This is also where warnings about wrong number of args are generated.
2381 VALUES is a chain of TREE_LIST nodes with the elements of the list
2382 in the TREE_VALUE slots of those nodes.
2384 Returns the actual number of arguments processed (which may be less
2385 than NARGS in some error situations), or -1 on failure. */
2388 convert_arguments (int nargs
, tree
*argarray
,
2389 tree typelist
, tree values
, tree function
, tree fundecl
)
2391 tree typetail
, valtail
;
2395 /* Change pointer to function to the function itself for
2397 if (TREE_CODE (function
) == ADDR_EXPR
2398 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
2399 function
= TREE_OPERAND (function
, 0);
2401 /* Handle an ObjC selector specially for diagnostics. */
2402 selector
= objc_message_selector ();
2404 /* Scan the given expressions and types, producing individual
2405 converted arguments and storing them in ARGARRAY. */
2407 for (valtail
= values
, typetail
= typelist
, parmnum
= 0;
2409 valtail
= TREE_CHAIN (valtail
), parmnum
++)
2411 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
2412 tree val
= TREE_VALUE (valtail
);
2413 tree rname
= function
;
2414 int argnum
= parmnum
+ 1;
2415 const char *invalid_func_diag
;
2417 if (type
== void_type_node
)
2419 error ("too many arguments to function %qE", function
);
2423 if (selector
&& argnum
> 2)
2429 STRIP_TYPE_NOPS (val
);
2431 val
= require_complete_type (val
);
2435 /* Formal parm type is specified by a function prototype. */
2438 if (type
== error_mark_node
|| !COMPLETE_TYPE_P (type
))
2440 error ("type of formal parameter %d is incomplete", parmnum
+ 1);
2445 /* Optionally warn about conversions that
2446 differ from the default conversions. */
2447 if (warn_traditional_conversion
|| warn_traditional
)
2449 unsigned int formal_prec
= TYPE_PRECISION (type
);
2451 if (INTEGRAL_TYPE_P (type
)
2452 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
2453 warning (0, "passing argument %d of %qE as integer "
2454 "rather than floating due to prototype",
2456 if (INTEGRAL_TYPE_P (type
)
2457 && TREE_CODE (TREE_TYPE (val
)) == COMPLEX_TYPE
)
2458 warning (0, "passing argument %d of %qE as integer "
2459 "rather than complex due to prototype",
2461 else if (TREE_CODE (type
) == COMPLEX_TYPE
2462 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
2463 warning (0, "passing argument %d of %qE as complex "
2464 "rather than floating due to prototype",
2466 else if (TREE_CODE (type
) == REAL_TYPE
2467 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
2468 warning (0, "passing argument %d of %qE as floating "
2469 "rather than integer due to prototype",
2471 else if (TREE_CODE (type
) == COMPLEX_TYPE
2472 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
2473 warning (0, "passing argument %d of %qE as complex "
2474 "rather than integer due to prototype",
2476 else if (TREE_CODE (type
) == REAL_TYPE
2477 && TREE_CODE (TREE_TYPE (val
)) == COMPLEX_TYPE
)
2478 warning (0, "passing argument %d of %qE as floating "
2479 "rather than complex due to prototype",
2481 /* ??? At some point, messages should be written about
2482 conversions between complex types, but that's too messy
2484 else if (TREE_CODE (type
) == REAL_TYPE
2485 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
2487 /* Warn if any argument is passed as `float',
2488 since without a prototype it would be `double'. */
2489 if (formal_prec
== TYPE_PRECISION (float_type_node
)
2490 && type
!= dfloat32_type_node
)
2491 warning (0, "passing argument %d of %qE as %<float%> "
2492 "rather than %<double%> due to prototype",
2495 /* Warn if mismatch between argument and prototype
2496 for decimal float types. Warn of conversions with
2497 binary float types and of precision narrowing due to
2499 else if (type
!= TREE_TYPE (val
)
2500 && (type
== dfloat32_type_node
2501 || type
== dfloat64_type_node
2502 || type
== dfloat128_type_node
2503 || TREE_TYPE (val
) == dfloat32_type_node
2504 || TREE_TYPE (val
) == dfloat64_type_node
2505 || TREE_TYPE (val
) == dfloat128_type_node
)
2507 <= TYPE_PRECISION (TREE_TYPE (val
))
2508 || (type
== dfloat128_type_node
2510 != dfloat64_type_node
2512 != dfloat32_type_node
)))
2513 || (type
== dfloat64_type_node
2515 != dfloat32_type_node
))))
2516 warning (0, "passing argument %d of %qE as %qT "
2517 "rather than %qT due to prototype",
2518 argnum
, rname
, type
, TREE_TYPE (val
));
2521 /* Detect integer changing in width or signedness.
2522 These warnings are only activated with
2523 -Wtraditional-conversion, not with -Wtraditional. */
2524 else if (warn_traditional_conversion
&& INTEGRAL_TYPE_P (type
)
2525 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
2527 tree would_have_been
= default_conversion (val
);
2528 tree type1
= TREE_TYPE (would_have_been
);
2530 if (TREE_CODE (type
) == ENUMERAL_TYPE
2531 && (TYPE_MAIN_VARIANT (type
)
2532 == TYPE_MAIN_VARIANT (TREE_TYPE (val
))))
2533 /* No warning if function asks for enum
2534 and the actual arg is that enum type. */
2536 else if (formal_prec
!= TYPE_PRECISION (type1
))
2537 warning (OPT_Wtraditional_conversion
, "passing argument %d of %qE "
2538 "with different width due to prototype",
2540 else if (TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (type1
))
2542 /* Don't complain if the formal parameter type
2543 is an enum, because we can't tell now whether
2544 the value was an enum--even the same enum. */
2545 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
2547 else if (TREE_CODE (val
) == INTEGER_CST
2548 && int_fits_type_p (val
, type
))
2549 /* Change in signedness doesn't matter
2550 if a constant value is unaffected. */
2552 /* If the value is extended from a narrower
2553 unsigned type, it doesn't matter whether we
2554 pass it as signed or unsigned; the value
2555 certainly is the same either way. */
2556 else if (TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
)
2557 && TYPE_UNSIGNED (TREE_TYPE (val
)))
2559 else if (TYPE_UNSIGNED (type
))
2560 warning (OPT_Wtraditional_conversion
, "passing argument %d of %qE "
2561 "as unsigned due to prototype",
2564 warning (OPT_Wtraditional_conversion
, "passing argument %d of %qE "
2565 "as signed due to prototype", argnum
, rname
);
2569 parmval
= convert_for_assignment (type
, val
, ic_argpass
,
2573 if (targetm
.calls
.promote_prototypes (fundecl
? TREE_TYPE (fundecl
) : 0)
2574 && INTEGRAL_TYPE_P (type
)
2575 && (TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)))
2576 parmval
= default_conversion (parmval
);
2578 argarray
[parmnum
] = parmval
;
2580 else if (TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
2581 && (TYPE_PRECISION (TREE_TYPE (val
))
2582 < TYPE_PRECISION (double_type_node
))
2583 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (val
))))
2584 /* Convert `float' to `double'. */
2585 argarray
[parmnum
] = convert (double_type_node
, val
);
2586 else if ((invalid_func_diag
=
2587 targetm
.calls
.invalid_arg_for_unprototyped_fn (typelist
, fundecl
, val
)))
2589 error (invalid_func_diag
);
2593 /* Convert `short' and `char' to full-size `int'. */
2594 argarray
[parmnum
] = default_conversion (val
);
2597 typetail
= TREE_CHAIN (typetail
);
2600 gcc_assert (parmnum
== nargs
);
2602 if (typetail
!= 0 && TREE_VALUE (typetail
) != void_type_node
)
2604 error ("too few arguments to function %qE", function
);
2611 /* This is the entry point used by the parser to build unary operators
2612 in the input. CODE, a tree_code, specifies the unary operator, and
2613 ARG is the operand. For unary plus, the C parser currently uses
2614 CONVERT_EXPR for code. */
2617 parser_build_unary_op (enum tree_code code
, struct c_expr arg
)
2619 struct c_expr result
;
2621 result
.original_code
= ERROR_MARK
;
2622 result
.value
= build_unary_op (code
, arg
.value
, 0);
2624 if (TREE_OVERFLOW_P (result
.value
) && !TREE_OVERFLOW_P (arg
.value
))
2625 overflow_warning (result
.value
);
2630 /* This is the entry point used by the parser to build binary operators
2631 in the input. CODE, a tree_code, specifies the binary operator, and
2632 ARG1 and ARG2 are the operands. In addition to constructing the
2633 expression, we check for operands that were written with other binary
2634 operators in a way that is likely to confuse the user. */
2637 parser_build_binary_op (enum tree_code code
, struct c_expr arg1
,
2640 struct c_expr result
;
2642 enum tree_code code1
= arg1
.original_code
;
2643 enum tree_code code2
= arg2
.original_code
;
2645 result
.value
= build_binary_op (code
, arg1
.value
, arg2
.value
, 1);
2646 result
.original_code
= code
;
2648 if (TREE_CODE (result
.value
) == ERROR_MARK
)
2651 /* Check for cases such as x+y<<z which users are likely
2653 if (warn_parentheses
)
2654 warn_about_parentheses (code
, code1
, code2
);
2656 if (code1
!= tcc_comparison
)
2657 warn_logical_operator (code
, arg1
.value
, arg2
.value
);
2659 /* Warn about comparisons against string literals, with the exception
2660 of testing for equality or inequality of a string literal with NULL. */
2661 if (code
== EQ_EXPR
|| code
== NE_EXPR
)
2663 if ((code1
== STRING_CST
&& !integer_zerop (arg2
.value
))
2664 || (code2
== STRING_CST
&& !integer_zerop (arg1
.value
)))
2665 warning (OPT_Waddress
, "comparison with string literal results in unspecified behavior");
2667 else if (TREE_CODE_CLASS (code
) == tcc_comparison
2668 && (code1
== STRING_CST
|| code2
== STRING_CST
))
2669 warning (OPT_Waddress
, "comparison with string literal results in unspecified behavior");
2671 if (TREE_OVERFLOW_P (result
.value
)
2672 && !TREE_OVERFLOW_P (arg1
.value
)
2673 && !TREE_OVERFLOW_P (arg2
.value
))
2674 overflow_warning (result
.value
);
2679 /* Return a tree for the difference of pointers OP0 and OP1.
2680 The resulting tree has type int. */
2683 pointer_diff (tree op0
, tree op1
)
2685 tree restype
= ptrdiff_type_node
;
2687 tree target_type
= TREE_TYPE (TREE_TYPE (op0
));
2688 tree con0
, con1
, lit0
, lit1
;
2689 tree orig_op1
= op1
;
2691 if (pedantic
|| warn_pointer_arith
)
2693 if (TREE_CODE (target_type
) == VOID_TYPE
)
2694 pedwarn ("pointer of type %<void *%> used in subtraction");
2695 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
2696 pedwarn ("pointer to a function used in subtraction");
2699 /* If the conversion to ptrdiff_type does anything like widening or
2700 converting a partial to an integral mode, we get a convert_expression
2701 that is in the way to do any simplifications.
2702 (fold-const.c doesn't know that the extra bits won't be needed.
2703 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2704 different mode in place.)
2705 So first try to find a common term here 'by hand'; we want to cover
2706 at least the cases that occur in legal static initializers. */
2707 if ((TREE_CODE (op0
) == NOP_EXPR
|| TREE_CODE (op0
) == CONVERT_EXPR
)
2708 && (TYPE_PRECISION (TREE_TYPE (op0
))
2709 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0
, 0)))))
2710 con0
= TREE_OPERAND (op0
, 0);
2713 if ((TREE_CODE (op1
) == NOP_EXPR
|| TREE_CODE (op1
) == CONVERT_EXPR
)
2714 && (TYPE_PRECISION (TREE_TYPE (op1
))
2715 == TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1
, 0)))))
2716 con1
= TREE_OPERAND (op1
, 0);
2720 if (TREE_CODE (con0
) == PLUS_EXPR
)
2722 lit0
= TREE_OPERAND (con0
, 1);
2723 con0
= TREE_OPERAND (con0
, 0);
2726 lit0
= integer_zero_node
;
2728 if (TREE_CODE (con1
) == PLUS_EXPR
)
2730 lit1
= TREE_OPERAND (con1
, 1);
2731 con1
= TREE_OPERAND (con1
, 0);
2734 lit1
= integer_zero_node
;
2736 if (operand_equal_p (con0
, con1
, 0))
2743 /* First do the subtraction as integers;
2744 then drop through to build the divide operator.
2745 Do not do default conversions on the minus operator
2746 in case restype is a short type. */
2748 op0
= build_binary_op (MINUS_EXPR
, convert (restype
, op0
),
2749 convert (restype
, op1
), 0);
2750 /* This generates an error if op1 is pointer to incomplete type. */
2751 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1
))))
2752 error ("arithmetic on pointer to an incomplete type");
2754 /* This generates an error if op0 is pointer to incomplete type. */
2755 op1
= c_size_in_bytes (target_type
);
2757 /* Divide by the size, in easiest possible way. */
2758 return fold_build2 (EXACT_DIV_EXPR
, restype
, op0
, convert (restype
, op1
));
2761 /* Construct and perhaps optimize a tree representation
2762 for a unary operation. CODE, a tree_code, specifies the operation
2763 and XARG is the operand.
2764 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2765 the default promotions (such as from short to int).
2766 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2767 allows non-lvalues; this is only used to handle conversion of non-lvalue
2768 arrays to pointers in C99. */
2771 build_unary_op (enum tree_code code
, tree xarg
, int flag
)
2773 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2776 enum tree_code typecode
= TREE_CODE (TREE_TYPE (arg
));
2778 int noconvert
= flag
;
2779 const char *invalid_op_diag
;
2781 if (typecode
== ERROR_MARK
)
2782 return error_mark_node
;
2783 if (typecode
== ENUMERAL_TYPE
|| typecode
== BOOLEAN_TYPE
)
2784 typecode
= INTEGER_TYPE
;
2786 if ((invalid_op_diag
2787 = targetm
.invalid_unary_op (code
, TREE_TYPE (xarg
))))
2789 error (invalid_op_diag
);
2790 return error_mark_node
;
2796 /* This is used for unary plus, because a CONVERT_EXPR
2797 is enough to prevent anybody from looking inside for
2798 associativity, but won't generate any code. */
2799 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2800 || typecode
== COMPLEX_TYPE
2801 || typecode
== VECTOR_TYPE
))
2803 error ("wrong type argument to unary plus");
2804 return error_mark_node
;
2806 else if (!noconvert
)
2807 arg
= default_conversion (arg
);
2808 arg
= non_lvalue (arg
);
2812 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2813 || typecode
== COMPLEX_TYPE
2814 || typecode
== VECTOR_TYPE
))
2816 error ("wrong type argument to unary minus");
2817 return error_mark_node
;
2819 else if (!noconvert
)
2820 arg
= default_conversion (arg
);
2824 if (typecode
== INTEGER_TYPE
|| typecode
== VECTOR_TYPE
)
2827 arg
= default_conversion (arg
);
2829 else if (typecode
== COMPLEX_TYPE
)
2833 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2835 arg
= default_conversion (arg
);
2839 error ("wrong type argument to bit-complement");
2840 return error_mark_node
;
2845 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
))
2847 error ("wrong type argument to abs");
2848 return error_mark_node
;
2850 else if (!noconvert
)
2851 arg
= default_conversion (arg
);
2855 /* Conjugating a real value is a no-op, but allow it anyway. */
2856 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2857 || typecode
== COMPLEX_TYPE
))
2859 error ("wrong type argument to conjugation");
2860 return error_mark_node
;
2862 else if (!noconvert
)
2863 arg
= default_conversion (arg
);
2866 case TRUTH_NOT_EXPR
:
2867 if (typecode
!= INTEGER_TYPE
2868 && typecode
!= REAL_TYPE
&& typecode
!= POINTER_TYPE
2869 && typecode
!= COMPLEX_TYPE
)
2871 error ("wrong type argument to unary exclamation mark");
2872 return error_mark_node
;
2874 arg
= c_objc_common_truthvalue_conversion (arg
);
2875 return invert_truthvalue (arg
);
2878 if (TREE_CODE (arg
) == COMPLEX_CST
)
2879 return TREE_REALPART (arg
);
2880 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
2881 return fold_build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
2886 if (TREE_CODE (arg
) == COMPLEX_CST
)
2887 return TREE_IMAGPART (arg
);
2888 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
2889 return fold_build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
);
2891 return convert (TREE_TYPE (arg
), integer_zero_node
);
2893 case PREINCREMENT_EXPR
:
2894 case POSTINCREMENT_EXPR
:
2895 case PREDECREMENT_EXPR
:
2896 case POSTDECREMENT_EXPR
:
2898 /* Increment or decrement the real part of the value,
2899 and don't change the imaginary part. */
2900 if (typecode
== COMPLEX_TYPE
)
2905 pedwarn ("ISO C does not support %<++%> and %<--%>"
2906 " on complex types");
2908 arg
= stabilize_reference (arg
);
2909 real
= build_unary_op (REALPART_EXPR
, arg
, 1);
2910 imag
= build_unary_op (IMAGPART_EXPR
, arg
, 1);
2911 real
= build_unary_op (code
, real
, 1);
2912 if (real
== error_mark_node
|| imag
== error_mark_node
)
2913 return error_mark_node
;
2914 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
2918 /* Report invalid types. */
2920 if (typecode
!= POINTER_TYPE
2921 && typecode
!= INTEGER_TYPE
&& typecode
!= REAL_TYPE
)
2923 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2924 error ("wrong type argument to increment");
2926 error ("wrong type argument to decrement");
2928 return error_mark_node
;
2933 tree result_type
= TREE_TYPE (arg
);
2935 arg
= get_unwidened (arg
, 0);
2936 argtype
= TREE_TYPE (arg
);
2938 /* Compute the increment. */
2940 if (typecode
== POINTER_TYPE
)
2942 /* If pointer target is an undefined struct,
2943 we just cannot know how to do the arithmetic. */
2944 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type
)))
2946 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2947 error ("increment of pointer to unknown structure");
2949 error ("decrement of pointer to unknown structure");
2951 else if ((pedantic
|| warn_pointer_arith
)
2952 && (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
2953 || TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
))
2955 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2956 pedwarn ("wrong type argument to increment");
2958 pedwarn ("wrong type argument to decrement");
2961 inc
= c_size_in_bytes (TREE_TYPE (result_type
));
2964 inc
= integer_one_node
;
2966 inc
= convert (argtype
, inc
);
2968 /* Complain about anything else that is not a true lvalue. */
2969 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
2970 || code
== POSTINCREMENT_EXPR
)
2973 return error_mark_node
;
2975 /* Report a read-only lvalue. */
2976 if (TREE_READONLY (arg
))
2978 readonly_error (arg
,
2979 ((code
== PREINCREMENT_EXPR
2980 || code
== POSTINCREMENT_EXPR
)
2981 ? lv_increment
: lv_decrement
));
2982 return error_mark_node
;
2985 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
)
2986 val
= boolean_increment (code
, arg
);
2988 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
2989 TREE_SIDE_EFFECTS (val
) = 1;
2990 val
= convert (result_type
, val
);
2991 if (TREE_CODE (val
) != code
)
2992 TREE_NO_WARNING (val
) = 1;
2997 /* Note that this operation never does default_conversion. */
2999 /* Let &* cancel out to simplify resulting code. */
3000 if (TREE_CODE (arg
) == INDIRECT_REF
)
3002 /* Don't let this be an lvalue. */
3003 if (lvalue_p (TREE_OPERAND (arg
, 0)))
3004 return non_lvalue (TREE_OPERAND (arg
, 0));
3005 return TREE_OPERAND (arg
, 0);
3008 /* For &x[y], return x+y */
3009 if (TREE_CODE (arg
) == ARRAY_REF
)
3011 tree op0
= TREE_OPERAND (arg
, 0);
3012 if (!c_mark_addressable (op0
))
3013 return error_mark_node
;
3014 return build_binary_op (PLUS_EXPR
,
3015 (TREE_CODE (TREE_TYPE (op0
)) == ARRAY_TYPE
3016 ? array_to_pointer_conversion (op0
)
3018 TREE_OPERAND (arg
, 1), 1);
3021 /* Anything not already handled and not a true memory reference
3022 or a non-lvalue array is an error. */
3023 else if (typecode
!= FUNCTION_TYPE
&& !flag
3024 && !lvalue_or_else (arg
, lv_addressof
))
3025 return error_mark_node
;
3027 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3028 argtype
= TREE_TYPE (arg
);
3030 /* If the lvalue is const or volatile, merge that into the type
3031 to which the address will point. Note that you can't get a
3032 restricted pointer by taking the address of something, so we
3033 only have to deal with `const' and `volatile' here. */
3034 if ((DECL_P (arg
) || REFERENCE_CLASS_P (arg
))
3035 && (TREE_READONLY (arg
) || TREE_THIS_VOLATILE (arg
)))
3036 argtype
= c_build_type_variant (argtype
,
3037 TREE_READONLY (arg
),
3038 TREE_THIS_VOLATILE (arg
));
3040 if (!c_mark_addressable (arg
))
3041 return error_mark_node
;
3043 gcc_assert (TREE_CODE (arg
) != COMPONENT_REF
3044 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)));
3046 argtype
= build_pointer_type (argtype
);
3048 /* ??? Cope with user tricks that amount to offsetof. Delete this
3049 when we have proper support for integer constant expressions. */
3050 val
= get_base_address (arg
);
3051 if (val
&& TREE_CODE (val
) == INDIRECT_REF
3052 && TREE_CONSTANT (TREE_OPERAND (val
, 0)))
3054 tree op0
= fold_convert (argtype
, fold_offsetof (arg
, val
)), op1
;
3056 op1
= fold_convert (argtype
, TREE_OPERAND (val
, 0));
3057 return fold_build2 (PLUS_EXPR
, argtype
, op0
, op1
);
3060 val
= build1 (ADDR_EXPR
, argtype
, arg
);
3069 argtype
= TREE_TYPE (arg
);
3070 return require_constant_value
? fold_build1_initializer (code
, argtype
, arg
)
3071 : fold_build1 (code
, argtype
, arg
);
3074 /* Return nonzero if REF is an lvalue valid for this language.
3075 Lvalues can be assigned, unless their type has TYPE_READONLY.
3076 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
3081 enum tree_code code
= TREE_CODE (ref
);
3088 return lvalue_p (TREE_OPERAND (ref
, 0));
3090 case COMPOUND_LITERAL_EXPR
:
3100 return (TREE_CODE (TREE_TYPE (ref
)) != FUNCTION_TYPE
3101 && TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
);
3104 return TREE_CODE (TREE_TYPE (ref
)) == ARRAY_TYPE
;
3111 /* Give an error for storing in something that is 'const'. */
3114 readonly_error (tree arg
, enum lvalue_use use
)
3116 gcc_assert (use
== lv_assign
|| use
== lv_increment
|| use
== lv_decrement
3118 /* Using this macro rather than (for example) arrays of messages
3119 ensures that all the format strings are checked at compile
3121 #define READONLY_MSG(A, I, D, AS) (use == lv_assign ? (A) \
3122 : (use == lv_increment ? (I) \
3123 : (use == lv_decrement ? (D) : (AS))))
3124 if (TREE_CODE (arg
) == COMPONENT_REF
)
3126 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg
, 0))))
3127 readonly_error (TREE_OPERAND (arg
, 0), use
);
3129 error (READONLY_MSG (G_("assignment of read-only member %qD"),
3130 G_("increment of read-only member %qD"),
3131 G_("decrement of read-only member %qD"),
3132 G_("read-only member %qD used as %<asm%> output")),
3133 TREE_OPERAND (arg
, 1));
3135 else if (TREE_CODE (arg
) == VAR_DECL
)
3136 error (READONLY_MSG (G_("assignment of read-only variable %qD"),
3137 G_("increment of read-only variable %qD"),
3138 G_("decrement of read-only variable %qD"),
3139 G_("read-only variable %qD used as %<asm%> output")),
3142 error (READONLY_MSG (G_("assignment of read-only location"),
3143 G_("increment of read-only location"),
3144 G_("decrement of read-only location"),
3145 G_("read-only location used as %<asm%> output")));
3149 /* Return nonzero if REF is an lvalue valid for this language;
3150 otherwise, print an error message and return zero. USE says
3151 how the lvalue is being used and so selects the error message. */
3154 lvalue_or_else (tree ref
, enum lvalue_use use
)
3156 int win
= lvalue_p (ref
);
3164 /* Mark EXP saying that we need to be able to take the
3165 address of it; it should not be allocated in a register.
3166 Returns true if successful. */
3169 c_mark_addressable (tree exp
)
3174 switch (TREE_CODE (x
))
3177 if (DECL_C_BIT_FIELD (TREE_OPERAND (x
, 1)))
3180 ("cannot take address of bit-field %qD", TREE_OPERAND (x
, 1));
3184 /* ... fall through ... */
3190 x
= TREE_OPERAND (x
, 0);
3193 case COMPOUND_LITERAL_EXPR
:
3195 TREE_ADDRESSABLE (x
) = 1;
3202 if (C_DECL_REGISTER (x
)
3203 && DECL_NONLOCAL (x
))
3205 if (TREE_PUBLIC (x
) || TREE_STATIC (x
) || DECL_EXTERNAL (x
))
3208 ("global register variable %qD used in nested function", x
);
3211 pedwarn ("register variable %qD used in nested function", x
);
3213 else if (C_DECL_REGISTER (x
))
3215 if (TREE_PUBLIC (x
) || TREE_STATIC (x
) || DECL_EXTERNAL (x
))
3216 error ("address of global register variable %qD requested", x
);
3218 error ("address of register variable %qD requested", x
);
3224 TREE_ADDRESSABLE (x
) = 1;
3231 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3234 build_conditional_expr (tree ifexp
, tree op1
, tree op2
)
3238 enum tree_code code1
;
3239 enum tree_code code2
;
3240 tree result_type
= NULL
;
3241 tree orig_op1
= op1
, orig_op2
= op2
;
3243 /* Promote both alternatives. */
3245 if (TREE_CODE (TREE_TYPE (op1
)) != VOID_TYPE
)
3246 op1
= default_conversion (op1
);
3247 if (TREE_CODE (TREE_TYPE (op2
)) != VOID_TYPE
)
3248 op2
= default_conversion (op2
);
3250 if (TREE_CODE (ifexp
) == ERROR_MARK
3251 || TREE_CODE (TREE_TYPE (op1
)) == ERROR_MARK
3252 || TREE_CODE (TREE_TYPE (op2
)) == ERROR_MARK
)
3253 return error_mark_node
;
3255 type1
= TREE_TYPE (op1
);
3256 code1
= TREE_CODE (type1
);
3257 type2
= TREE_TYPE (op2
);
3258 code2
= TREE_CODE (type2
);
3260 /* C90 does not permit non-lvalue arrays in conditional expressions.
3261 In C99 they will be pointers by now. */
3262 if (code1
== ARRAY_TYPE
|| code2
== ARRAY_TYPE
)
3264 error ("non-lvalue array in conditional expression");
3265 return error_mark_node
;
3268 /* Quickly detect the usual case where op1 and op2 have the same type
3270 if (TYPE_MAIN_VARIANT (type1
) == TYPE_MAIN_VARIANT (type2
))
3273 result_type
= type1
;
3275 result_type
= TYPE_MAIN_VARIANT (type1
);
3277 else if ((code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3278 || code1
== COMPLEX_TYPE
)
3279 && (code2
== INTEGER_TYPE
|| code2
== REAL_TYPE
3280 || code2
== COMPLEX_TYPE
))
3282 result_type
= c_common_type (type1
, type2
);
3284 /* If -Wsign-compare, warn here if type1 and type2 have
3285 different signedness. We'll promote the signed to unsigned
3286 and later code won't know it used to be different.
3287 Do this check on the original types, so that explicit casts
3288 will be considered, but default promotions won't. */
3289 if (warn_sign_compare
&& !skip_evaluation
)
3291 int unsigned_op1
= TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
3292 int unsigned_op2
= TYPE_UNSIGNED (TREE_TYPE (orig_op2
));
3294 if (unsigned_op1
^ unsigned_op2
)
3298 /* Do not warn if the result type is signed, since the
3299 signed type will only be chosen if it can represent
3300 all the values of the unsigned type. */
3301 if (!TYPE_UNSIGNED (result_type
))
3303 /* Do not warn if the signed quantity is an unsuffixed
3304 integer literal (or some static constant expression
3305 involving such literals) and it is non-negative. */
3306 else if ((unsigned_op2
3307 && tree_expr_nonnegative_warnv_p (op1
, &ovf
))
3309 && tree_expr_nonnegative_warnv_p (op2
, &ovf
)))
3312 warning (0, "signed and unsigned type in conditional expression");
3316 else if (code1
== VOID_TYPE
|| code2
== VOID_TYPE
)
3318 if (pedantic
&& (code1
!= VOID_TYPE
|| code2
!= VOID_TYPE
))
3319 pedwarn ("ISO C forbids conditional expr with only one void side");
3320 result_type
= void_type_node
;
3322 else if (code1
== POINTER_TYPE
&& code2
== POINTER_TYPE
)
3324 if (comp_target_types (type1
, type2
))
3325 result_type
= common_pointer_type (type1
, type2
);
3326 else if (null_pointer_constant_p (orig_op1
))
3327 result_type
= qualify_type (type2
, type1
);
3328 else if (null_pointer_constant_p (orig_op2
))
3329 result_type
= qualify_type (type1
, type2
);
3330 else if (VOID_TYPE_P (TREE_TYPE (type1
)))
3332 if (pedantic
&& TREE_CODE (TREE_TYPE (type2
)) == FUNCTION_TYPE
)
3333 pedwarn ("ISO C forbids conditional expr between "
3334 "%<void *%> and function pointer");
3335 result_type
= build_pointer_type (qualify_type (TREE_TYPE (type1
),
3336 TREE_TYPE (type2
)));
3338 else if (VOID_TYPE_P (TREE_TYPE (type2
)))
3340 if (pedantic
&& TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
)
3341 pedwarn ("ISO C forbids conditional expr between "
3342 "%<void *%> and function pointer");
3343 result_type
= build_pointer_type (qualify_type (TREE_TYPE (type2
),
3344 TREE_TYPE (type1
)));
3348 pedwarn ("pointer type mismatch in conditional expression");
3349 result_type
= build_pointer_type (void_type_node
);
3352 else if (code1
== POINTER_TYPE
&& code2
== INTEGER_TYPE
)
3354 if (!null_pointer_constant_p (orig_op2
))
3355 pedwarn ("pointer/integer type mismatch in conditional expression");
3358 op2
= null_pointer_node
;
3360 result_type
= type1
;
3362 else if (code2
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3364 if (!null_pointer_constant_p (orig_op1
))
3365 pedwarn ("pointer/integer type mismatch in conditional expression");
3368 op1
= null_pointer_node
;
3370 result_type
= type2
;
3375 if (flag_cond_mismatch
)
3376 result_type
= void_type_node
;
3379 error ("type mismatch in conditional expression");
3380 return error_mark_node
;
3384 /* Merge const and volatile flags of the incoming types. */
3386 = build_type_variant (result_type
,
3387 TREE_READONLY (op1
) || TREE_READONLY (op2
),
3388 TREE_THIS_VOLATILE (op1
) || TREE_THIS_VOLATILE (op2
));
3390 if (result_type
!= TREE_TYPE (op1
))
3391 op1
= convert_and_check (result_type
, op1
);
3392 if (result_type
!= TREE_TYPE (op2
))
3393 op2
= convert_and_check (result_type
, op2
);
3395 return fold_build3 (COND_EXPR
, result_type
, ifexp
, op1
, op2
);
3398 /* Return a compound expression that performs two expressions and
3399 returns the value of the second of them. */
3402 build_compound_expr (tree expr1
, tree expr2
)
3404 if (!TREE_SIDE_EFFECTS (expr1
))
3406 /* The left-hand operand of a comma expression is like an expression
3407 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3408 any side-effects, unless it was explicitly cast to (void). */
3409 if (warn_unused_value
)
3411 if (VOID_TYPE_P (TREE_TYPE (expr1
))
3412 && (TREE_CODE (expr1
) == NOP_EXPR
3413 || TREE_CODE (expr1
) == CONVERT_EXPR
))
3415 else if (VOID_TYPE_P (TREE_TYPE (expr1
))
3416 && TREE_CODE (expr1
) == COMPOUND_EXPR
3417 && (TREE_CODE (TREE_OPERAND (expr1
, 1)) == CONVERT_EXPR
3418 || TREE_CODE (TREE_OPERAND (expr1
, 1)) == NOP_EXPR
))
3419 ; /* (void) a, (void) b, c */
3421 warning (OPT_Wunused_value
,
3422 "left-hand operand of comma expression has no effect");
3426 /* With -Wunused, we should also warn if the left-hand operand does have
3427 side-effects, but computes a value which is not used. For example, in
3428 `foo() + bar(), baz()' the result of the `+' operator is not used,
3429 so we should issue a warning. */
3430 else if (warn_unused_value
)
3431 warn_if_unused_value (expr1
, input_location
);
3433 if (expr2
== error_mark_node
)
3434 return error_mark_node
;
3436 return build2 (COMPOUND_EXPR
, TREE_TYPE (expr2
), expr1
, expr2
);
3439 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3442 build_c_cast (tree type
, tree expr
)
3446 if (type
== error_mark_node
|| expr
== error_mark_node
)
3447 return error_mark_node
;
3449 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3450 only in <protocol> qualifications. But when constructing cast expressions,
3451 the protocols do matter and must be kept around. */
3452 if (objc_is_object_ptr (type
) && objc_is_object_ptr (TREE_TYPE (expr
)))
3453 return build1 (NOP_EXPR
, type
, expr
);
3455 type
= TYPE_MAIN_VARIANT (type
);
3457 if (TREE_CODE (type
) == ARRAY_TYPE
)
3459 error ("cast specifies array type");
3460 return error_mark_node
;
3463 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3465 error ("cast specifies function type");
3466 return error_mark_node
;
3469 if (type
== TYPE_MAIN_VARIANT (TREE_TYPE (value
)))
3473 if (TREE_CODE (type
) == RECORD_TYPE
3474 || TREE_CODE (type
) == UNION_TYPE
)
3475 pedwarn ("ISO C forbids casting nonscalar to the same type");
3478 else if (TREE_CODE (type
) == UNION_TYPE
)
3482 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
3483 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field
)),
3484 TYPE_MAIN_VARIANT (TREE_TYPE (value
))))
3492 pedwarn ("ISO C forbids casts to union type");
3493 t
= digest_init (type
,
3494 build_constructor_single (type
, field
, value
),
3496 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
3497 TREE_INVARIANT (t
) = TREE_INVARIANT (value
);
3500 error ("cast to union type from type not present in union");
3501 return error_mark_node
;
3507 if (type
== void_type_node
)
3508 return build1 (CONVERT_EXPR
, type
, value
);
3510 otype
= TREE_TYPE (value
);
3512 /* Optionally warn about potentially worrisome casts. */
3515 && TREE_CODE (type
) == POINTER_TYPE
3516 && TREE_CODE (otype
) == POINTER_TYPE
)
3518 tree in_type
= type
;
3519 tree in_otype
= otype
;
3523 /* Check that the qualifiers on IN_TYPE are a superset of
3524 the qualifiers of IN_OTYPE. The outermost level of
3525 POINTER_TYPE nodes is uninteresting and we stop as soon
3526 as we hit a non-POINTER_TYPE node on either type. */
3529 in_otype
= TREE_TYPE (in_otype
);
3530 in_type
= TREE_TYPE (in_type
);
3532 /* GNU C allows cv-qualified function types. 'const'
3533 means the function is very pure, 'volatile' means it
3534 can't return. We need to warn when such qualifiers
3535 are added, not when they're taken away. */
3536 if (TREE_CODE (in_otype
) == FUNCTION_TYPE
3537 && TREE_CODE (in_type
) == FUNCTION_TYPE
)
3538 added
|= (TYPE_QUALS (in_type
) & ~TYPE_QUALS (in_otype
));
3540 discarded
|= (TYPE_QUALS (in_otype
) & ~TYPE_QUALS (in_type
));
3542 while (TREE_CODE (in_type
) == POINTER_TYPE
3543 && TREE_CODE (in_otype
) == POINTER_TYPE
);
3546 warning (0, "cast adds new qualifiers to function type");
3549 /* There are qualifiers present in IN_OTYPE that are not
3550 present in IN_TYPE. */
3551 warning (0, "cast discards qualifiers from pointer target type");
3554 /* Warn about possible alignment problems. */
3555 if (STRICT_ALIGNMENT
3556 && TREE_CODE (type
) == POINTER_TYPE
3557 && TREE_CODE (otype
) == POINTER_TYPE
3558 && TREE_CODE (TREE_TYPE (otype
)) != VOID_TYPE
3559 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
3560 /* Don't warn about opaque types, where the actual alignment
3561 restriction is unknown. */
3562 && !((TREE_CODE (TREE_TYPE (otype
)) == UNION_TYPE
3563 || TREE_CODE (TREE_TYPE (otype
)) == RECORD_TYPE
)
3564 && TYPE_MODE (TREE_TYPE (otype
)) == VOIDmode
)
3565 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (otype
)))
3566 warning (OPT_Wcast_align
,
3567 "cast increases required alignment of target type");
3569 if (TREE_CODE (type
) == INTEGER_TYPE
3570 && TREE_CODE (otype
) == POINTER_TYPE
3571 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
))
3572 /* Unlike conversion of integers to pointers, where the
3573 warning is disabled for converting constants because
3574 of cases such as SIG_*, warn about converting constant
3575 pointers to integers. In some cases it may cause unwanted
3576 sign extension, and a warning is appropriate. */
3577 warning (OPT_Wpointer_to_int_cast
,
3578 "cast from pointer to integer of different size");
3580 if (TREE_CODE (value
) == CALL_EXPR
3581 && TREE_CODE (type
) != TREE_CODE (otype
))
3582 warning (OPT_Wbad_function_cast
, "cast from function call of type %qT "
3583 "to non-matching type %qT", otype
, type
);
3585 if (TREE_CODE (type
) == POINTER_TYPE
3586 && TREE_CODE (otype
) == INTEGER_TYPE
3587 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
3588 /* Don't warn about converting any constant. */
3589 && !TREE_CONSTANT (value
))
3590 warning (OPT_Wint_to_pointer_cast
, "cast to pointer from integer "
3591 "of different size");
3593 if (warn_strict_aliasing
<= 2)
3594 strict_aliasing_warning (otype
, type
, expr
);
3596 /* If pedantic, warn for conversions between function and object
3597 pointer types, except for converting a null pointer constant
3598 to function pointer type. */
3600 && TREE_CODE (type
) == POINTER_TYPE
3601 && TREE_CODE (otype
) == POINTER_TYPE
3602 && TREE_CODE (TREE_TYPE (otype
)) == FUNCTION_TYPE
3603 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
3604 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3607 && TREE_CODE (type
) == POINTER_TYPE
3608 && TREE_CODE (otype
) == POINTER_TYPE
3609 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
3610 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
3611 && !null_pointer_constant_p (value
))
3612 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3615 value
= convert (type
, value
);
3617 /* Ignore any integer overflow caused by the cast. */
3618 if (TREE_CODE (value
) == INTEGER_CST
)
3620 if (CONSTANT_CLASS_P (ovalue
) && TREE_OVERFLOW (ovalue
))
3622 if (!TREE_OVERFLOW (value
))
3624 /* Avoid clobbering a shared constant. */
3625 value
= copy_node (value
);
3626 TREE_OVERFLOW (value
) = TREE_OVERFLOW (ovalue
);
3629 else if (TREE_OVERFLOW (value
))
3630 /* Reset VALUE's overflow flags, ensuring constant sharing. */
3631 value
= build_int_cst_wide (TREE_TYPE (value
),
3632 TREE_INT_CST_LOW (value
),
3633 TREE_INT_CST_HIGH (value
));
3637 /* Don't let a cast be an lvalue. */
3639 value
= non_lvalue (value
);
3644 /* Interpret a cast of expression EXPR to type TYPE. */
3646 c_cast_expr (struct c_type_name
*type_name
, tree expr
)
3649 int saved_wsp
= warn_strict_prototypes
;
3651 /* This avoids warnings about unprototyped casts on
3652 integers. E.g. "#define SIG_DFL (void(*)())0". */
3653 if (TREE_CODE (expr
) == INTEGER_CST
)
3654 warn_strict_prototypes
= 0;
3655 type
= groktypename (type_name
);
3656 warn_strict_prototypes
= saved_wsp
;
3658 return build_c_cast (type
, expr
);
3661 /* Build an assignment expression of lvalue LHS from value RHS.
3662 MODIFYCODE is the code for a binary operator that we use
3663 to combine the old value of LHS with RHS to get the new value.
3664 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3667 build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
)
3671 tree lhstype
= TREE_TYPE (lhs
);
3672 tree olhstype
= lhstype
;
3674 /* Types that aren't fully specified cannot be used in assignments. */
3675 lhs
= require_complete_type (lhs
);
3677 /* Avoid duplicate error messages from operands that had errors. */
3678 if (TREE_CODE (lhs
) == ERROR_MARK
|| TREE_CODE (rhs
) == ERROR_MARK
)
3679 return error_mark_node
;
3681 if (!lvalue_or_else (lhs
, lv_assign
))
3682 return error_mark_node
;
3684 STRIP_TYPE_NOPS (rhs
);
3688 /* If a binary op has been requested, combine the old LHS value with the RHS
3689 producing the value we should actually store into the LHS. */
3691 if (modifycode
!= NOP_EXPR
)
3693 lhs
= stabilize_reference (lhs
);
3694 newrhs
= build_binary_op (modifycode
, lhs
, rhs
, 1);
3697 /* Give an error for storing in something that is 'const'. */
3699 if (TREE_READONLY (lhs
) || TYPE_READONLY (lhstype
)
3700 || ((TREE_CODE (lhstype
) == RECORD_TYPE
3701 || TREE_CODE (lhstype
) == UNION_TYPE
)
3702 && C_TYPE_FIELDS_READONLY (lhstype
)))
3704 readonly_error (lhs
, lv_assign
);
3705 return error_mark_node
;
3708 /* If storing into a structure or union member,
3709 it has probably been given type `int'.
3710 Compute the type that would go with
3711 the actual amount of storage the member occupies. */
3713 if (TREE_CODE (lhs
) == COMPONENT_REF
3714 && (TREE_CODE (lhstype
) == INTEGER_TYPE
3715 || TREE_CODE (lhstype
) == BOOLEAN_TYPE
3716 || TREE_CODE (lhstype
) == REAL_TYPE
3717 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
3718 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
3720 /* If storing in a field that is in actuality a short or narrower than one,
3721 we must store in the field in its actual type. */
3723 if (lhstype
!= TREE_TYPE (lhs
))
3725 lhs
= copy_node (lhs
);
3726 TREE_TYPE (lhs
) = lhstype
;
3729 /* Convert new value to destination type. */
3731 newrhs
= convert_for_assignment (lhstype
, newrhs
, ic_assign
,
3732 NULL_TREE
, NULL_TREE
, 0);
3733 if (TREE_CODE (newrhs
) == ERROR_MARK
)
3734 return error_mark_node
;
3736 /* Emit ObjC write barrier, if necessary. */
3737 if (c_dialect_objc () && flag_objc_gc
)
3739 result
= objc_generate_write_barrier (lhs
, modifycode
, newrhs
);
3744 /* Scan operands. */
3746 result
= build2 (MODIFY_EXPR
, lhstype
, lhs
, newrhs
);
3747 TREE_SIDE_EFFECTS (result
) = 1;
3749 /* If we got the LHS in a different type for storing in,
3750 convert the result back to the nominal type of LHS
3751 so that the value we return always has the same type
3752 as the LHS argument. */
3754 if (olhstype
== TREE_TYPE (result
))
3756 return convert_for_assignment (olhstype
, result
, ic_assign
,
3757 NULL_TREE
, NULL_TREE
, 0);
3760 /* Convert value RHS to type TYPE as preparation for an assignment
3761 to an lvalue of type TYPE.
3762 The real work of conversion is done by `convert'.
3763 The purpose of this function is to generate error messages
3764 for assignments that are not allowed in C.
3765 ERRTYPE says whether it is argument passing, assignment,
3766 initialization or return.
3768 FUNCTION is a tree for the function being called.
3769 PARMNUM is the number of the argument, for printing in error messages. */
3772 convert_for_assignment (tree type
, tree rhs
, enum impl_conv errtype
,
3773 tree fundecl
, tree function
, int parmnum
)
3775 enum tree_code codel
= TREE_CODE (type
);
3777 enum tree_code coder
;
3778 tree rname
= NULL_TREE
;
3779 bool objc_ok
= false;
3781 if (errtype
== ic_argpass
|| errtype
== ic_argpass_nonproto
)
3784 /* Change pointer to function to the function itself for
3786 if (TREE_CODE (function
) == ADDR_EXPR
3787 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
3788 function
= TREE_OPERAND (function
, 0);
3790 /* Handle an ObjC selector specially for diagnostics. */
3791 selector
= objc_message_selector ();
3793 if (selector
&& parmnum
> 2)
3800 /* This macro is used to emit diagnostics to ensure that all format
3801 strings are complete sentences, visible to gettext and checked at
3803 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3808 pedwarn (AR, parmnum, rname); \
3810 case ic_argpass_nonproto: \
3811 warning (0, AR, parmnum, rname); \
3823 gcc_unreachable (); \
3827 STRIP_TYPE_NOPS (rhs
);
3829 if (optimize
&& TREE_CODE (rhs
) == VAR_DECL
3830 && TREE_CODE (TREE_TYPE (rhs
)) != ARRAY_TYPE
)
3831 rhs
= decl_constant_value_for_broken_optimization (rhs
);
3833 rhstype
= TREE_TYPE (rhs
);
3834 coder
= TREE_CODE (rhstype
);
3836 if (coder
== ERROR_MARK
)
3837 return error_mark_node
;
3839 if (c_dialect_objc ())
3862 objc_ok
= objc_compare_types (type
, rhstype
, parmno
, rname
);
3865 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (rhstype
))
3868 if (coder
== VOID_TYPE
)
3870 /* Except for passing an argument to an unprototyped function,
3871 this is a constraint violation. When passing an argument to
3872 an unprototyped function, it is compile-time undefined;
3873 making it a constraint in that case was rejected in
3875 error ("void value not ignored as it ought to be");
3876 return error_mark_node
;
3878 /* A type converts to a reference to it.
3879 This code doesn't fully support references, it's just for the
3880 special case of va_start and va_copy. */
3881 if (codel
== REFERENCE_TYPE
3882 && comptypes (TREE_TYPE (type
), TREE_TYPE (rhs
)) == 1)
3884 if (!lvalue_p (rhs
))
3886 error ("cannot pass rvalue to reference parameter");
3887 return error_mark_node
;
3889 if (!c_mark_addressable (rhs
))
3890 return error_mark_node
;
3891 rhs
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (rhs
)), rhs
);
3893 /* We already know that these two types are compatible, but they
3894 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3895 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3896 likely to be va_list, a typedef to __builtin_va_list, which
3897 is different enough that it will cause problems later. */
3898 if (TREE_TYPE (TREE_TYPE (rhs
)) != TREE_TYPE (type
))
3899 rhs
= build1 (NOP_EXPR
, build_pointer_type (TREE_TYPE (type
)), rhs
);
3901 rhs
= build1 (NOP_EXPR
, type
, rhs
);
3904 /* Some types can interconvert without explicit casts. */
3905 else if (codel
== VECTOR_TYPE
&& coder
== VECTOR_TYPE
3906 && vector_types_convertible_p (type
, TREE_TYPE (rhs
), true))
3907 return convert (type
, rhs
);
3908 /* Arithmetic types all interconvert, and enum is treated like int. */
3909 else if ((codel
== INTEGER_TYPE
|| codel
== REAL_TYPE
3910 || codel
== ENUMERAL_TYPE
|| codel
== COMPLEX_TYPE
3911 || codel
== BOOLEAN_TYPE
)
3912 && (coder
== INTEGER_TYPE
|| coder
== REAL_TYPE
3913 || coder
== ENUMERAL_TYPE
|| coder
== COMPLEX_TYPE
3914 || coder
== BOOLEAN_TYPE
))
3915 return convert_and_check (type
, rhs
);
3917 /* Aggregates in different TUs might need conversion. */
3918 if ((codel
== RECORD_TYPE
|| codel
== UNION_TYPE
)
3920 && comptypes (type
, rhstype
))
3921 return convert_and_check (type
, rhs
);
3923 /* Conversion to a transparent union from its member types.
3924 This applies only to function arguments. */
3925 if (codel
== UNION_TYPE
&& TYPE_TRANSPARENT_UNION (type
)
3926 && (errtype
== ic_argpass
|| errtype
== ic_argpass_nonproto
))
3928 tree memb
, marginal_memb
= NULL_TREE
;
3930 for (memb
= TYPE_FIELDS (type
); memb
; memb
= TREE_CHAIN (memb
))
3932 tree memb_type
= TREE_TYPE (memb
);
3934 if (comptypes (TYPE_MAIN_VARIANT (memb_type
),
3935 TYPE_MAIN_VARIANT (rhstype
)))
3938 if (TREE_CODE (memb_type
) != POINTER_TYPE
)
3941 if (coder
== POINTER_TYPE
)
3943 tree ttl
= TREE_TYPE (memb_type
);
3944 tree ttr
= TREE_TYPE (rhstype
);
3946 /* Any non-function converts to a [const][volatile] void *
3947 and vice versa; otherwise, targets must be the same.
3948 Meanwhile, the lhs target must have all the qualifiers of
3950 if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
3951 || comp_target_types (memb_type
, rhstype
))
3953 /* If this type won't generate any warnings, use it. */
3954 if (TYPE_QUALS (ttl
) == TYPE_QUALS (ttr
)
3955 || ((TREE_CODE (ttr
) == FUNCTION_TYPE
3956 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
3957 ? ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
3958 == TYPE_QUALS (ttr
))
3959 : ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
3960 == TYPE_QUALS (ttl
))))
3963 /* Keep looking for a better type, but remember this one. */
3965 marginal_memb
= memb
;
3969 /* Can convert integer zero to any pointer type. */
3970 if (null_pointer_constant_p (rhs
))
3972 rhs
= null_pointer_node
;
3977 if (memb
|| marginal_memb
)
3981 /* We have only a marginally acceptable member type;
3982 it needs a warning. */
3983 tree ttl
= TREE_TYPE (TREE_TYPE (marginal_memb
));
3984 tree ttr
= TREE_TYPE (rhstype
);
3986 /* Const and volatile mean something different for function
3987 types, so the usual warnings are not appropriate. */
3988 if (TREE_CODE (ttr
) == FUNCTION_TYPE
3989 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
3991 /* Because const and volatile on functions are
3992 restrictions that say the function will not do
3993 certain things, it is okay to use a const or volatile
3994 function where an ordinary one is wanted, but not
3996 if (TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
))
3997 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE "
3998 "makes qualified function "
3999 "pointer from unqualified"),
4000 G_("assignment makes qualified "
4001 "function pointer from "
4003 G_("initialization makes qualified "
4004 "function pointer from "
4006 G_("return makes qualified function "
4007 "pointer from unqualified"));
4009 else if (TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
))
4010 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4011 "qualifiers from pointer target type"),
4012 G_("assignment discards qualifiers "
4013 "from pointer target type"),
4014 G_("initialization discards qualifiers "
4015 "from pointer target type"),
4016 G_("return discards qualifiers from "
4017 "pointer target type"));
4019 memb
= marginal_memb
;
4022 if (pedantic
&& (!fundecl
|| !DECL_IN_SYSTEM_HEADER (fundecl
)))
4023 pedwarn ("ISO C prohibits argument conversion to union type");
4025 return build_constructor_single (type
, memb
, rhs
);
4029 /* Conversions among pointers */
4030 else if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
4031 && (coder
== codel
))
4033 tree ttl
= TREE_TYPE (type
);
4034 tree ttr
= TREE_TYPE (rhstype
);
4037 bool is_opaque_pointer
;
4038 int target_cmp
= 0; /* Cache comp_target_types () result. */
4040 if (TREE_CODE (mvl
) != ARRAY_TYPE
)
4041 mvl
= TYPE_MAIN_VARIANT (mvl
);
4042 if (TREE_CODE (mvr
) != ARRAY_TYPE
)
4043 mvr
= TYPE_MAIN_VARIANT (mvr
);
4044 /* Opaque pointers are treated like void pointers. */
4045 is_opaque_pointer
= (targetm
.vector_opaque_p (type
)
4046 || targetm
.vector_opaque_p (rhstype
))
4047 && TREE_CODE (ttl
) == VECTOR_TYPE
4048 && TREE_CODE (ttr
) == VECTOR_TYPE
;
4050 /* C++ does not allow the implicit conversion void* -> T*. However,
4051 for the purpose of reducing the number of false positives, we
4052 tolerate the special case of
4056 where NULL is typically defined in C to be '(void *) 0'. */
4057 if (VOID_TYPE_P (ttr
) && rhs
!= null_pointer_node
&& !VOID_TYPE_P (ttl
))
4058 warning (OPT_Wc___compat
, "request for implicit conversion from "
4059 "%qT to %qT not permitted in C++", rhstype
, type
);
4061 /* Check if the right-hand side has a format attribute but the
4062 left-hand side doesn't. */
4063 if (warn_missing_format_attribute
4064 && check_missing_format_attribute (type
, rhstype
))
4069 case ic_argpass_nonproto
:
4070 warning (OPT_Wmissing_format_attribute
,
4071 "argument %d of %qE might be "
4072 "a candidate for a format attribute",
4076 warning (OPT_Wmissing_format_attribute
,
4077 "assignment left-hand side might be "
4078 "a candidate for a format attribute");
4081 warning (OPT_Wmissing_format_attribute
,
4082 "initialization left-hand side might be "
4083 "a candidate for a format attribute");
4086 warning (OPT_Wmissing_format_attribute
,
4087 "return type might be "
4088 "a candidate for a format attribute");
4095 /* Any non-function converts to a [const][volatile] void *
4096 and vice versa; otherwise, targets must be the same.
4097 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4098 if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
4099 || (target_cmp
= comp_target_types (type
, rhstype
))
4100 || is_opaque_pointer
4101 || (c_common_unsigned_type (mvl
)
4102 == c_common_unsigned_type (mvr
)))
4105 && ((VOID_TYPE_P (ttl
) && TREE_CODE (ttr
) == FUNCTION_TYPE
)
4108 && !null_pointer_constant_p (rhs
)
4109 && TREE_CODE (ttl
) == FUNCTION_TYPE
)))
4110 WARN_FOR_ASSIGNMENT (G_("ISO C forbids passing argument %d of "
4111 "%qE between function pointer "
4113 G_("ISO C forbids assignment between "
4114 "function pointer and %<void *%>"),
4115 G_("ISO C forbids initialization between "
4116 "function pointer and %<void *%>"),
4117 G_("ISO C forbids return between function "
4118 "pointer and %<void *%>"));
4119 /* Const and volatile mean something different for function types,
4120 so the usual warnings are not appropriate. */
4121 else if (TREE_CODE (ttr
) != FUNCTION_TYPE
4122 && TREE_CODE (ttl
) != FUNCTION_TYPE
)
4124 if (TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
))
4126 /* Types differing only by the presence of the 'volatile'
4127 qualifier are acceptable if the 'volatile' has been added
4128 in by the Objective-C EH machinery. */
4129 if (!objc_type_quals_match (ttl
, ttr
))
4130 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE discards "
4131 "qualifiers from pointer target type"),
4132 G_("assignment discards qualifiers "
4133 "from pointer target type"),
4134 G_("initialization discards qualifiers "
4135 "from pointer target type"),
4136 G_("return discards qualifiers from "
4137 "pointer target type"));
4139 /* If this is not a case of ignoring a mismatch in signedness,
4141 else if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
4144 /* If there is a mismatch, do warn. */
4145 else if (warn_pointer_sign
)
4146 WARN_FOR_ASSIGNMENT (G_("pointer targets in passing argument "
4147 "%d of %qE differ in signedness"),
4148 G_("pointer targets in assignment "
4149 "differ in signedness"),
4150 G_("pointer targets in initialization "
4151 "differ in signedness"),
4152 G_("pointer targets in return differ "
4155 else if (TREE_CODE (ttl
) == FUNCTION_TYPE
4156 && TREE_CODE (ttr
) == FUNCTION_TYPE
)
4158 /* Because const and volatile on functions are restrictions
4159 that say the function will not do certain things,
4160 it is okay to use a const or volatile function
4161 where an ordinary one is wanted, but not vice-versa. */
4162 if (TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
))
4163 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4164 "qualified function pointer "
4165 "from unqualified"),
4166 G_("assignment makes qualified function "
4167 "pointer from unqualified"),
4168 G_("initialization makes qualified "
4169 "function pointer from unqualified"),
4170 G_("return makes qualified function "
4171 "pointer from unqualified"));
4175 /* Avoid warning about the volatile ObjC EH puts on decls. */
4177 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE from "
4178 "incompatible pointer type"),
4179 G_("assignment from incompatible pointer type"),
4180 G_("initialization from incompatible "
4182 G_("return from incompatible pointer type"));
4184 return convert (type
, rhs
);
4186 else if (codel
== POINTER_TYPE
&& coder
== ARRAY_TYPE
)
4188 /* ??? This should not be an error when inlining calls to
4189 unprototyped functions. */
4190 error ("invalid use of non-lvalue array");
4191 return error_mark_node
;
4193 else if (codel
== POINTER_TYPE
&& coder
== INTEGER_TYPE
)
4195 /* An explicit constant 0 can convert to a pointer,
4196 or one that results from arithmetic, even including
4197 a cast to integer type. */
4198 if (!null_pointer_constant_p (rhs
))
4199 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes "
4200 "pointer from integer without a cast"),
4201 G_("assignment makes pointer from integer "
4203 G_("initialization makes pointer from "
4204 "integer without a cast"),
4205 G_("return makes pointer from integer "
4208 return convert (type
, rhs
);
4210 else if (codel
== INTEGER_TYPE
&& coder
== POINTER_TYPE
)
4212 WARN_FOR_ASSIGNMENT (G_("passing argument %d of %qE makes integer "
4213 "from pointer without a cast"),
4214 G_("assignment makes integer from pointer "
4216 G_("initialization makes integer from pointer "
4218 G_("return makes integer from pointer "
4220 return convert (type
, rhs
);
4222 else if (codel
== BOOLEAN_TYPE
&& coder
== POINTER_TYPE
)
4223 return convert (type
, rhs
);
4228 case ic_argpass_nonproto
:
4229 /* ??? This should not be an error when inlining calls to
4230 unprototyped functions. */
4231 error ("incompatible type for argument %d of %qE", parmnum
, rname
);
4234 error ("incompatible types in assignment");
4237 error ("incompatible types in initialization");
4240 error ("incompatible types in return");
4246 return error_mark_node
;
4249 /* Convert VALUE for assignment into inlined parameter PARM. ARGNUM
4250 is used for error and warning reporting and indicates which argument
4251 is being processed. */
4254 c_convert_parm_for_inlining (tree parm
, tree value
, tree fn
, int argnum
)
4258 /* If FN was prototyped at the call site, the value has been converted
4259 already in convert_arguments.
4260 However, we might see a prototype now that was not in place when
4261 the function call was seen, so check that the VALUE actually matches
4262 PARM before taking an early exit. */
4264 || (TYPE_ARG_TYPES (TREE_TYPE (fn
))
4265 && (TYPE_MAIN_VARIANT (TREE_TYPE (parm
))
4266 == TYPE_MAIN_VARIANT (TREE_TYPE (value
)))))
4269 type
= TREE_TYPE (parm
);
4270 ret
= convert_for_assignment (type
, value
,
4271 ic_argpass_nonproto
, fn
,
4273 if (targetm
.calls
.promote_prototypes (TREE_TYPE (fn
))
4274 && INTEGRAL_TYPE_P (type
)
4275 && (TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)))
4276 ret
= default_conversion (ret
);
4280 /* If VALUE is a compound expr all of whose expressions are constant, then
4281 return its value. Otherwise, return error_mark_node.
4283 This is for handling COMPOUND_EXPRs as initializer elements
4284 which is allowed with a warning when -pedantic is specified. */
4287 valid_compound_expr_initializer (tree value
, tree endtype
)
4289 if (TREE_CODE (value
) == COMPOUND_EXPR
)
4291 if (valid_compound_expr_initializer (TREE_OPERAND (value
, 0), endtype
)
4293 return error_mark_node
;
4294 return valid_compound_expr_initializer (TREE_OPERAND (value
, 1),
4297 else if (!initializer_constant_valid_p (value
, endtype
))
4298 return error_mark_node
;
4303 /* Perform appropriate conversions on the initial value of a variable,
4304 store it in the declaration DECL,
4305 and print any error messages that are appropriate.
4306 If the init is invalid, store an ERROR_MARK. */
4309 store_init_value (tree decl
, tree init
)
4313 /* If variable's type was invalidly declared, just ignore it. */
4315 type
= TREE_TYPE (decl
);
4316 if (TREE_CODE (type
) == ERROR_MARK
)
4319 /* Digest the specified initializer into an expression. */
4321 value
= digest_init (type
, init
, true, TREE_STATIC (decl
));
4323 /* Store the expression if valid; else report error. */
4325 if (!in_system_header
4326 && AGGREGATE_TYPE_P (TREE_TYPE (decl
)) && !TREE_STATIC (decl
))
4327 warning (OPT_Wtraditional
, "traditional C rejects automatic "
4328 "aggregate initialization");
4330 DECL_INITIAL (decl
) = value
;
4332 /* ANSI wants warnings about out-of-range constant initializers. */
4333 STRIP_TYPE_NOPS (value
);
4334 if (TREE_STATIC (decl
))
4335 constant_expression_warning (value
);
4337 /* Check if we need to set array size from compound literal size. */
4338 if (TREE_CODE (type
) == ARRAY_TYPE
4339 && TYPE_DOMAIN (type
) == 0
4340 && value
!= error_mark_node
)
4342 tree inside_init
= init
;
4344 STRIP_TYPE_NOPS (inside_init
);
4345 inside_init
= fold (inside_init
);
4347 if (TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
4349 tree cldecl
= COMPOUND_LITERAL_EXPR_DECL (inside_init
);
4351 if (TYPE_DOMAIN (TREE_TYPE (cldecl
)))
4353 /* For int foo[] = (int [3]){1}; we need to set array size
4354 now since later on array initializer will be just the
4355 brace enclosed list of the compound literal. */
4356 type
= build_distinct_type_copy (TYPE_MAIN_VARIANT (type
));
4357 TREE_TYPE (decl
) = type
;
4358 TYPE_DOMAIN (type
) = TYPE_DOMAIN (TREE_TYPE (cldecl
));
4360 layout_decl (cldecl
, 0);
4366 /* Methods for storing and printing names for error messages. */
4368 /* Implement a spelling stack that allows components of a name to be pushed
4369 and popped. Each element on the stack is this structure. */
4376 unsigned HOST_WIDE_INT i
;
4381 #define SPELLING_STRING 1
4382 #define SPELLING_MEMBER 2
4383 #define SPELLING_BOUNDS 3
4385 static struct spelling
*spelling
; /* Next stack element (unused). */
4386 static struct spelling
*spelling_base
; /* Spelling stack base. */
4387 static int spelling_size
; /* Size of the spelling stack. */
4389 /* Macros to save and restore the spelling stack around push_... functions.
4390 Alternative to SAVE_SPELLING_STACK. */
4392 #define SPELLING_DEPTH() (spelling - spelling_base)
4393 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4395 /* Push an element on the spelling stack with type KIND and assign VALUE
4398 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4400 int depth = SPELLING_DEPTH (); \
4402 if (depth >= spelling_size) \
4404 spelling_size += 10; \
4405 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4407 RESTORE_SPELLING_DEPTH (depth); \
4410 spelling->kind = (KIND); \
4411 spelling->MEMBER = (VALUE); \
4415 /* Push STRING on the stack. Printed literally. */
4418 push_string (const char *string
)
4420 PUSH_SPELLING (SPELLING_STRING
, string
, u
.s
);
4423 /* Push a member name on the stack. Printed as '.' STRING. */
4426 push_member_name (tree decl
)
4428 const char *const string
4429 = DECL_NAME (decl
) ? IDENTIFIER_POINTER (DECL_NAME (decl
)) : "<anonymous>";
4430 PUSH_SPELLING (SPELLING_MEMBER
, string
, u
.s
);
4433 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4436 push_array_bounds (unsigned HOST_WIDE_INT bounds
)
4438 PUSH_SPELLING (SPELLING_BOUNDS
, bounds
, u
.i
);
4441 /* Compute the maximum size in bytes of the printed spelling. */
4444 spelling_length (void)
4449 for (p
= spelling_base
; p
< spelling
; p
++)
4451 if (p
->kind
== SPELLING_BOUNDS
)
4454 size
+= strlen (p
->u
.s
) + 1;
4460 /* Print the spelling to BUFFER and return it. */
4463 print_spelling (char *buffer
)
4468 for (p
= spelling_base
; p
< spelling
; p
++)
4469 if (p
->kind
== SPELLING_BOUNDS
)
4471 sprintf (d
, "[" HOST_WIDE_INT_PRINT_UNSIGNED
"]", p
->u
.i
);
4477 if (p
->kind
== SPELLING_MEMBER
)
4479 for (s
= p
->u
.s
; (*d
= *s
++); d
++)
4486 /* Issue an error message for a bad initializer component.
4487 MSGID identifies the message.
4488 The component name is taken from the spelling stack. */
4491 error_init (const char *msgid
)
4495 error ("%s", _(msgid
));
4496 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4498 error ("(near initialization for %qs)", ofwhat
);
4501 /* Issue a pedantic warning for a bad initializer component.
4502 MSGID identifies the message.
4503 The component name is taken from the spelling stack. */
4506 pedwarn_init (const char *msgid
)
4510 pedwarn ("%s", _(msgid
));
4511 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4513 pedwarn ("(near initialization for %qs)", ofwhat
);
4516 /* Issue a warning for a bad initializer component.
4517 MSGID identifies the message.
4518 The component name is taken from the spelling stack. */
4521 warning_init (const char *msgid
)
4525 warning (0, "%s", _(msgid
));
4526 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4528 warning (0, "(near initialization for %qs)", ofwhat
);
4531 /* If TYPE is an array type and EXPR is a parenthesized string
4532 constant, warn if pedantic that EXPR is being used to initialize an
4533 object of type TYPE. */
4536 maybe_warn_string_init (tree type
, struct c_expr expr
)
4539 && TREE_CODE (type
) == ARRAY_TYPE
4540 && TREE_CODE (expr
.value
) == STRING_CST
4541 && expr
.original_code
!= STRING_CST
)
4542 pedwarn_init ("array initialized from parenthesized string constant");
4545 /* Digest the parser output INIT as an initializer for type TYPE.
4546 Return a C expression of type TYPE to represent the initial value.
4548 If INIT is a string constant, STRICT_STRING is true if it is
4549 unparenthesized or we should not warn here for it being parenthesized.
4550 For other types of INIT, STRICT_STRING is not used.
4552 REQUIRE_CONSTANT requests an error if non-constant initializers or
4553 elements are seen. */
4556 digest_init (tree type
, tree init
, bool strict_string
, int require_constant
)
4558 enum tree_code code
= TREE_CODE (type
);
4559 tree inside_init
= init
;
4561 if (type
== error_mark_node
4563 || init
== error_mark_node
4564 || TREE_TYPE (init
) == error_mark_node
)
4565 return error_mark_node
;
4567 STRIP_TYPE_NOPS (inside_init
);
4569 inside_init
= fold (inside_init
);
4571 /* Initialization of an array of chars from a string constant
4572 optionally enclosed in braces. */
4574 if (code
== ARRAY_TYPE
&& inside_init
4575 && TREE_CODE (inside_init
) == STRING_CST
)
4577 tree typ1
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
4578 /* Note that an array could be both an array of character type
4579 and an array of wchar_t if wchar_t is signed char or unsigned
4581 bool char_array
= (typ1
== char_type_node
4582 || typ1
== signed_char_type_node
4583 || typ1
== unsigned_char_type_node
);
4584 bool wchar_array
= !!comptypes (typ1
, wchar_type_node
);
4585 if (char_array
|| wchar_array
)
4589 expr
.value
= inside_init
;
4590 expr
.original_code
= (strict_string
? STRING_CST
: ERROR_MARK
);
4591 maybe_warn_string_init (type
, expr
);
4594 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init
)))
4597 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4598 TYPE_MAIN_VARIANT (type
)))
4601 if (!wchar_array
&& !char_string
)
4603 error_init ("char-array initialized from wide string");
4604 return error_mark_node
;
4606 if (char_string
&& !char_array
)
4608 error_init ("wchar_t-array initialized from non-wide string");
4609 return error_mark_node
;
4612 TREE_TYPE (inside_init
) = type
;
4613 if (TYPE_DOMAIN (type
) != 0
4614 && TYPE_SIZE (type
) != 0
4615 && TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
4616 /* Subtract 1 (or sizeof (wchar_t))
4617 because it's ok to ignore the terminating null char
4618 that is counted in the length of the constant. */
4619 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type
),
4620 TREE_STRING_LENGTH (inside_init
)
4621 - ((TYPE_PRECISION (typ1
)
4622 != TYPE_PRECISION (char_type_node
))
4623 ? (TYPE_PRECISION (wchar_type_node
)
4626 pedwarn_init ("initializer-string for array of chars is too long");
4630 else if (INTEGRAL_TYPE_P (typ1
))
4632 error_init ("array of inappropriate type initialized "
4633 "from string constant");
4634 return error_mark_node
;
4638 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4639 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4640 below and handle as a constructor. */
4641 if (code
== VECTOR_TYPE
4642 && TREE_CODE (TREE_TYPE (inside_init
)) == VECTOR_TYPE
4643 && vector_types_convertible_p (TREE_TYPE (inside_init
), type
, true)
4644 && TREE_CONSTANT (inside_init
))
4646 if (TREE_CODE (inside_init
) == VECTOR_CST
4647 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4648 TYPE_MAIN_VARIANT (type
)))
4651 if (TREE_CODE (inside_init
) == CONSTRUCTOR
)
4653 unsigned HOST_WIDE_INT ix
;
4655 bool constant_p
= true;
4657 /* Iterate through elements and check if all constructor
4658 elements are *_CSTs. */
4659 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (inside_init
), ix
, value
)
4660 if (!CONSTANT_CLASS_P (value
))
4667 return build_vector_from_ctor (type
,
4668 CONSTRUCTOR_ELTS (inside_init
));
4672 /* Any type can be initialized
4673 from an expression of the same type, optionally with braces. */
4675 if (inside_init
&& TREE_TYPE (inside_init
) != 0
4676 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4677 TYPE_MAIN_VARIANT (type
))
4678 || (code
== ARRAY_TYPE
4679 && comptypes (TREE_TYPE (inside_init
), type
))
4680 || (code
== VECTOR_TYPE
4681 && comptypes (TREE_TYPE (inside_init
), type
))
4682 || (code
== POINTER_TYPE
4683 && TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
4684 && comptypes (TREE_TYPE (TREE_TYPE (inside_init
)),
4685 TREE_TYPE (type
)))))
4687 if (code
== POINTER_TYPE
)
4689 if (TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
)
4691 if (TREE_CODE (inside_init
) == STRING_CST
4692 || TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
4693 inside_init
= array_to_pointer_conversion (inside_init
);
4696 error_init ("invalid use of non-lvalue array");
4697 return error_mark_node
;
4702 if (code
== VECTOR_TYPE
)
4703 /* Although the types are compatible, we may require a
4705 inside_init
= convert (type
, inside_init
);
4707 if (require_constant
4708 && (code
== VECTOR_TYPE
|| !flag_isoc99
)
4709 && TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
4711 /* As an extension, allow initializing objects with static storage
4712 duration with compound literals (which are then treated just as
4713 the brace enclosed list they contain). Also allow this for
4714 vectors, as we can only assign them with compound literals. */
4715 tree decl
= COMPOUND_LITERAL_EXPR_DECL (inside_init
);
4716 inside_init
= DECL_INITIAL (decl
);
4719 if (code
== ARRAY_TYPE
&& TREE_CODE (inside_init
) != STRING_CST
4720 && TREE_CODE (inside_init
) != CONSTRUCTOR
)
4722 error_init ("array initialized from non-constant array expression");
4723 return error_mark_node
;
4726 if (optimize
&& TREE_CODE (inside_init
) == VAR_DECL
)
4727 inside_init
= decl_constant_value_for_broken_optimization (inside_init
);
4729 /* Compound expressions can only occur here if -pedantic or
4730 -pedantic-errors is specified. In the later case, we always want
4731 an error. In the former case, we simply want a warning. */
4732 if (require_constant
&& pedantic
4733 && TREE_CODE (inside_init
) == COMPOUND_EXPR
)
4736 = valid_compound_expr_initializer (inside_init
,
4737 TREE_TYPE (inside_init
));
4738 if (inside_init
== error_mark_node
)
4739 error_init ("initializer element is not constant");
4741 pedwarn_init ("initializer element is not constant");
4742 if (flag_pedantic_errors
)
4743 inside_init
= error_mark_node
;
4745 else if (require_constant
4746 && !initializer_constant_valid_p (inside_init
,
4747 TREE_TYPE (inside_init
)))
4749 error_init ("initializer element is not constant");
4750 inside_init
= error_mark_node
;
4753 /* Added to enable additional -Wmissing-format-attribute warnings. */
4754 if (TREE_CODE (TREE_TYPE (inside_init
)) == POINTER_TYPE
)
4755 inside_init
= convert_for_assignment (type
, inside_init
, ic_init
, NULL_TREE
,
4760 /* Handle scalar types, including conversions. */
4762 if (code
== INTEGER_TYPE
|| code
== REAL_TYPE
|| code
== POINTER_TYPE
4763 || code
== ENUMERAL_TYPE
|| code
== BOOLEAN_TYPE
|| code
== COMPLEX_TYPE
4764 || code
== VECTOR_TYPE
)
4766 if (TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
4767 && (TREE_CODE (init
) == STRING_CST
4768 || TREE_CODE (init
) == COMPOUND_LITERAL_EXPR
))
4769 init
= array_to_pointer_conversion (init
);
4771 = convert_for_assignment (type
, init
, ic_init
,
4772 NULL_TREE
, NULL_TREE
, 0);
4774 /* Check to see if we have already given an error message. */
4775 if (inside_init
== error_mark_node
)
4777 else if (require_constant
&& !TREE_CONSTANT (inside_init
))
4779 error_init ("initializer element is not constant");
4780 inside_init
= error_mark_node
;
4782 else if (require_constant
4783 && !initializer_constant_valid_p (inside_init
,
4784 TREE_TYPE (inside_init
)))
4786 error_init ("initializer element is not computable at load time");
4787 inside_init
= error_mark_node
;
4793 /* Come here only for records and arrays. */
4795 if (COMPLETE_TYPE_P (type
) && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4797 error_init ("variable-sized object may not be initialized");
4798 return error_mark_node
;
4801 error_init ("invalid initializer");
4802 return error_mark_node
;
4805 /* Handle initializers that use braces. */
4807 /* Type of object we are accumulating a constructor for.
4808 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4809 static tree constructor_type
;
4811 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4813 static tree constructor_fields
;
4815 /* For an ARRAY_TYPE, this is the specified index
4816 at which to store the next element we get. */
4817 static tree constructor_index
;
4819 /* For an ARRAY_TYPE, this is the maximum index. */
4820 static tree constructor_max_index
;
4822 /* For a RECORD_TYPE, this is the first field not yet written out. */
4823 static tree constructor_unfilled_fields
;
4825 /* For an ARRAY_TYPE, this is the index of the first element
4826 not yet written out. */
4827 static tree constructor_unfilled_index
;
4829 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4830 This is so we can generate gaps between fields, when appropriate. */
4831 static tree constructor_bit_index
;
4833 /* If we are saving up the elements rather than allocating them,
4834 this is the list of elements so far (in reverse order,
4835 most recent first). */
4836 static VEC(constructor_elt
,gc
) *constructor_elements
;
4838 /* 1 if constructor should be incrementally stored into a constructor chain,
4839 0 if all the elements should be kept in AVL tree. */
4840 static int constructor_incremental
;
4842 /* 1 if so far this constructor's elements are all compile-time constants. */
4843 static int constructor_constant
;
4845 /* 1 if so far this constructor's elements are all valid address constants. */
4846 static int constructor_simple
;
4848 /* 1 if this constructor is erroneous so far. */
4849 static int constructor_erroneous
;
4851 /* Structure for managing pending initializer elements, organized as an
4856 struct init_node
*left
, *right
;
4857 struct init_node
*parent
;
4863 /* Tree of pending elements at this constructor level.
4864 These are elements encountered out of order
4865 which belong at places we haven't reached yet in actually
4867 Will never hold tree nodes across GC runs. */
4868 static struct init_node
*constructor_pending_elts
;
4870 /* The SPELLING_DEPTH of this constructor. */
4871 static int constructor_depth
;
4873 /* DECL node for which an initializer is being read.
4874 0 means we are reading a constructor expression
4875 such as (struct foo) {...}. */
4876 static tree constructor_decl
;
4878 /* Nonzero if this is an initializer for a top-level decl. */
4879 static int constructor_top_level
;
4881 /* Nonzero if there were any member designators in this initializer. */
4882 static int constructor_designated
;
4884 /* Nesting depth of designator list. */
4885 static int designator_depth
;
4887 /* Nonzero if there were diagnosed errors in this designator list. */
4888 static int designator_erroneous
;
4891 /* This stack has a level for each implicit or explicit level of
4892 structuring in the initializer, including the outermost one. It
4893 saves the values of most of the variables above. */
4895 struct constructor_range_stack
;
4897 struct constructor_stack
4899 struct constructor_stack
*next
;
4904 tree unfilled_index
;
4905 tree unfilled_fields
;
4907 VEC(constructor_elt
,gc
) *elements
;
4908 struct init_node
*pending_elts
;
4911 /* If value nonzero, this value should replace the entire
4912 constructor at this level. */
4913 struct c_expr replacement_value
;
4914 struct constructor_range_stack
*range_stack
;
4924 static struct constructor_stack
*constructor_stack
;
4926 /* This stack represents designators from some range designator up to
4927 the last designator in the list. */
4929 struct constructor_range_stack
4931 struct constructor_range_stack
*next
, *prev
;
4932 struct constructor_stack
*stack
;
4939 static struct constructor_range_stack
*constructor_range_stack
;
4941 /* This stack records separate initializers that are nested.
4942 Nested initializers can't happen in ANSI C, but GNU C allows them
4943 in cases like { ... (struct foo) { ... } ... }. */
4945 struct initializer_stack
4947 struct initializer_stack
*next
;
4949 struct constructor_stack
*constructor_stack
;
4950 struct constructor_range_stack
*constructor_range_stack
;
4951 VEC(constructor_elt
,gc
) *elements
;
4952 struct spelling
*spelling
;
4953 struct spelling
*spelling_base
;
4956 char require_constant_value
;
4957 char require_constant_elements
;
4960 static struct initializer_stack
*initializer_stack
;
4962 /* Prepare to parse and output the initializer for variable DECL. */
4965 start_init (tree decl
, tree asmspec_tree ATTRIBUTE_UNUSED
, int top_level
)
4968 struct initializer_stack
*p
= XNEW (struct initializer_stack
);
4970 p
->decl
= constructor_decl
;
4971 p
->require_constant_value
= require_constant_value
;
4972 p
->require_constant_elements
= require_constant_elements
;
4973 p
->constructor_stack
= constructor_stack
;
4974 p
->constructor_range_stack
= constructor_range_stack
;
4975 p
->elements
= constructor_elements
;
4976 p
->spelling
= spelling
;
4977 p
->spelling_base
= spelling_base
;
4978 p
->spelling_size
= spelling_size
;
4979 p
->top_level
= constructor_top_level
;
4980 p
->next
= initializer_stack
;
4981 initializer_stack
= p
;
4983 constructor_decl
= decl
;
4984 constructor_designated
= 0;
4985 constructor_top_level
= top_level
;
4987 if (decl
!= 0 && decl
!= error_mark_node
)
4989 require_constant_value
= TREE_STATIC (decl
);
4990 require_constant_elements
4991 = ((TREE_STATIC (decl
) || (pedantic
&& !flag_isoc99
))
4992 /* For a scalar, you can always use any value to initialize,
4993 even within braces. */
4994 && (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
4995 || TREE_CODE (TREE_TYPE (decl
)) == RECORD_TYPE
4996 || TREE_CODE (TREE_TYPE (decl
)) == UNION_TYPE
4997 || TREE_CODE (TREE_TYPE (decl
)) == QUAL_UNION_TYPE
));
4998 locus
= IDENTIFIER_POINTER (DECL_NAME (decl
));
5002 require_constant_value
= 0;
5003 require_constant_elements
= 0;
5004 locus
= "(anonymous)";
5007 constructor_stack
= 0;
5008 constructor_range_stack
= 0;
5010 missing_braces_mentioned
= 0;
5014 RESTORE_SPELLING_DEPTH (0);
5017 push_string (locus
);
5023 struct initializer_stack
*p
= initializer_stack
;
5025 /* Free the whole constructor stack of this initializer. */
5026 while (constructor_stack
)
5028 struct constructor_stack
*q
= constructor_stack
;
5029 constructor_stack
= q
->next
;
5033 gcc_assert (!constructor_range_stack
);
5035 /* Pop back to the data of the outer initializer (if any). */
5036 free (spelling_base
);
5038 constructor_decl
= p
->decl
;
5039 require_constant_value
= p
->require_constant_value
;
5040 require_constant_elements
= p
->require_constant_elements
;
5041 constructor_stack
= p
->constructor_stack
;
5042 constructor_range_stack
= p
->constructor_range_stack
;
5043 constructor_elements
= p
->elements
;
5044 spelling
= p
->spelling
;
5045 spelling_base
= p
->spelling_base
;
5046 spelling_size
= p
->spelling_size
;
5047 constructor_top_level
= p
->top_level
;
5048 initializer_stack
= p
->next
;
5052 /* Call here when we see the initializer is surrounded by braces.
5053 This is instead of a call to push_init_level;
5054 it is matched by a call to pop_init_level.
5056 TYPE is the type to initialize, for a constructor expression.
5057 For an initializer for a decl, TYPE is zero. */
5060 really_start_incremental_init (tree type
)
5062 struct constructor_stack
*p
= XNEW (struct constructor_stack
);
5065 type
= TREE_TYPE (constructor_decl
);
5067 if (targetm
.vector_opaque_p (type
))
5068 error ("opaque vector types cannot be initialized");
5070 p
->type
= constructor_type
;
5071 p
->fields
= constructor_fields
;
5072 p
->index
= constructor_index
;
5073 p
->max_index
= constructor_max_index
;
5074 p
->unfilled_index
= constructor_unfilled_index
;
5075 p
->unfilled_fields
= constructor_unfilled_fields
;
5076 p
->bit_index
= constructor_bit_index
;
5077 p
->elements
= constructor_elements
;
5078 p
->constant
= constructor_constant
;
5079 p
->simple
= constructor_simple
;
5080 p
->erroneous
= constructor_erroneous
;
5081 p
->pending_elts
= constructor_pending_elts
;
5082 p
->depth
= constructor_depth
;
5083 p
->replacement_value
.value
= 0;
5084 p
->replacement_value
.original_code
= ERROR_MARK
;
5088 p
->incremental
= constructor_incremental
;
5089 p
->designated
= constructor_designated
;
5091 constructor_stack
= p
;
5093 constructor_constant
= 1;
5094 constructor_simple
= 1;
5095 constructor_depth
= SPELLING_DEPTH ();
5096 constructor_elements
= 0;
5097 constructor_pending_elts
= 0;
5098 constructor_type
= type
;
5099 constructor_incremental
= 1;
5100 constructor_designated
= 0;
5101 designator_depth
= 0;
5102 designator_erroneous
= 0;
5104 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5105 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5107 constructor_fields
= TYPE_FIELDS (constructor_type
);
5108 /* Skip any nameless bit fields at the beginning. */
5109 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
5110 && DECL_NAME (constructor_fields
) == 0)
5111 constructor_fields
= TREE_CHAIN (constructor_fields
);
5113 constructor_unfilled_fields
= constructor_fields
;
5114 constructor_bit_index
= bitsize_zero_node
;
5116 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5118 if (TYPE_DOMAIN (constructor_type
))
5120 constructor_max_index
5121 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
5123 /* Detect non-empty initializations of zero-length arrays. */
5124 if (constructor_max_index
== NULL_TREE
5125 && TYPE_SIZE (constructor_type
))
5126 constructor_max_index
= build_int_cst (NULL_TREE
, -1);
5128 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5129 to initialize VLAs will cause a proper error; avoid tree
5130 checking errors as well by setting a safe value. */
5131 if (constructor_max_index
5132 && TREE_CODE (constructor_max_index
) != INTEGER_CST
)
5133 constructor_max_index
= build_int_cst (NULL_TREE
, -1);
5136 = convert (bitsizetype
,
5137 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
5141 constructor_index
= bitsize_zero_node
;
5142 constructor_max_index
= NULL_TREE
;
5145 constructor_unfilled_index
= constructor_index
;
5147 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
5149 /* Vectors are like simple fixed-size arrays. */
5150 constructor_max_index
=
5151 build_int_cst (NULL_TREE
, TYPE_VECTOR_SUBPARTS (constructor_type
) - 1);
5152 constructor_index
= bitsize_zero_node
;
5153 constructor_unfilled_index
= constructor_index
;
5157 /* Handle the case of int x = {5}; */
5158 constructor_fields
= constructor_type
;
5159 constructor_unfilled_fields
= constructor_type
;
5163 /* Push down into a subobject, for initialization.
5164 If this is for an explicit set of braces, IMPLICIT is 0.
5165 If it is because the next element belongs at a lower level,
5166 IMPLICIT is 1 (or 2 if the push is because of designator list). */
5169 push_init_level (int implicit
)
5171 struct constructor_stack
*p
;
5172 tree value
= NULL_TREE
;
5174 /* If we've exhausted any levels that didn't have braces,
5175 pop them now. If implicit == 1, this will have been done in
5176 process_init_element; do not repeat it here because in the case
5177 of excess initializers for an empty aggregate this leads to an
5178 infinite cycle of popping a level and immediately recreating
5182 while (constructor_stack
->implicit
)
5184 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
5185 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5186 && constructor_fields
== 0)
5187 process_init_element (pop_init_level (1));
5188 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5189 && constructor_max_index
5190 && tree_int_cst_lt (constructor_max_index
,
5192 process_init_element (pop_init_level (1));
5198 /* Unless this is an explicit brace, we need to preserve previous
5202 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
5203 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5204 && constructor_fields
)
5205 value
= find_init_member (constructor_fields
);
5206 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5207 value
= find_init_member (constructor_index
);
5210 p
= XNEW (struct constructor_stack
);
5211 p
->type
= constructor_type
;
5212 p
->fields
= constructor_fields
;
5213 p
->index
= constructor_index
;
5214 p
->max_index
= constructor_max_index
;
5215 p
->unfilled_index
= constructor_unfilled_index
;
5216 p
->unfilled_fields
= constructor_unfilled_fields
;
5217 p
->bit_index
= constructor_bit_index
;
5218 p
->elements
= constructor_elements
;
5219 p
->constant
= constructor_constant
;
5220 p
->simple
= constructor_simple
;
5221 p
->erroneous
= constructor_erroneous
;
5222 p
->pending_elts
= constructor_pending_elts
;
5223 p
->depth
= constructor_depth
;
5224 p
->replacement_value
.value
= 0;
5225 p
->replacement_value
.original_code
= ERROR_MARK
;
5226 p
->implicit
= implicit
;
5228 p
->incremental
= constructor_incremental
;
5229 p
->designated
= constructor_designated
;
5230 p
->next
= constructor_stack
;
5232 constructor_stack
= p
;
5234 constructor_constant
= 1;
5235 constructor_simple
= 1;
5236 constructor_depth
= SPELLING_DEPTH ();
5237 constructor_elements
= 0;
5238 constructor_incremental
= 1;
5239 constructor_designated
= 0;
5240 constructor_pending_elts
= 0;
5243 p
->range_stack
= constructor_range_stack
;
5244 constructor_range_stack
= 0;
5245 designator_depth
= 0;
5246 designator_erroneous
= 0;
5249 /* Don't die if an entire brace-pair level is superfluous
5250 in the containing level. */
5251 if (constructor_type
== 0)
5253 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
5254 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5256 /* Don't die if there are extra init elts at the end. */
5257 if (constructor_fields
== 0)
5258 constructor_type
= 0;
5261 constructor_type
= TREE_TYPE (constructor_fields
);
5262 push_member_name (constructor_fields
);
5263 constructor_depth
++;
5266 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5268 constructor_type
= TREE_TYPE (constructor_type
);
5269 push_array_bounds (tree_low_cst (constructor_index
, 1));
5270 constructor_depth
++;
5273 if (constructor_type
== 0)
5275 error_init ("extra brace group at end of initializer");
5276 constructor_fields
= 0;
5277 constructor_unfilled_fields
= 0;
5281 if (value
&& TREE_CODE (value
) == CONSTRUCTOR
)
5283 constructor_constant
= TREE_CONSTANT (value
);
5284 constructor_simple
= TREE_STATIC (value
);
5285 constructor_elements
= CONSTRUCTOR_ELTS (value
);
5286 if (!VEC_empty (constructor_elt
, constructor_elements
)
5287 && (TREE_CODE (constructor_type
) == RECORD_TYPE
5288 || TREE_CODE (constructor_type
) == ARRAY_TYPE
))
5289 set_nonincremental_init ();
5292 if (implicit
== 1 && warn_missing_braces
&& !missing_braces_mentioned
)
5294 missing_braces_mentioned
= 1;
5295 warning_init ("missing braces around initializer");
5298 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5299 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5301 constructor_fields
= TYPE_FIELDS (constructor_type
);
5302 /* Skip any nameless bit fields at the beginning. */
5303 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
5304 && DECL_NAME (constructor_fields
) == 0)
5305 constructor_fields
= TREE_CHAIN (constructor_fields
);
5307 constructor_unfilled_fields
= constructor_fields
;
5308 constructor_bit_index
= bitsize_zero_node
;
5310 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
5312 /* Vectors are like simple fixed-size arrays. */
5313 constructor_max_index
=
5314 build_int_cst (NULL_TREE
, TYPE_VECTOR_SUBPARTS (constructor_type
) - 1);
5315 constructor_index
= convert (bitsizetype
, integer_zero_node
);
5316 constructor_unfilled_index
= constructor_index
;
5318 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5320 if (TYPE_DOMAIN (constructor_type
))
5322 constructor_max_index
5323 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
5325 /* Detect non-empty initializations of zero-length arrays. */
5326 if (constructor_max_index
== NULL_TREE
5327 && TYPE_SIZE (constructor_type
))
5328 constructor_max_index
= build_int_cst (NULL_TREE
, -1);
5330 /* constructor_max_index needs to be an INTEGER_CST. Attempts
5331 to initialize VLAs will cause a proper error; avoid tree
5332 checking errors as well by setting a safe value. */
5333 if (constructor_max_index
5334 && TREE_CODE (constructor_max_index
) != INTEGER_CST
)
5335 constructor_max_index
= build_int_cst (NULL_TREE
, -1);
5338 = convert (bitsizetype
,
5339 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
5342 constructor_index
= bitsize_zero_node
;
5344 constructor_unfilled_index
= constructor_index
;
5345 if (value
&& TREE_CODE (value
) == STRING_CST
)
5347 /* We need to split the char/wchar array into individual
5348 characters, so that we don't have to special case it
5350 set_nonincremental_init_from_string (value
);
5355 if (constructor_type
!= error_mark_node
)
5356 warning_init ("braces around scalar initializer");
5357 constructor_fields
= constructor_type
;
5358 constructor_unfilled_fields
= constructor_type
;
5362 /* At the end of an implicit or explicit brace level,
5363 finish up that level of constructor. If a single expression
5364 with redundant braces initialized that level, return the
5365 c_expr structure for that expression. Otherwise, the original_code
5366 element is set to ERROR_MARK.
5367 If we were outputting the elements as they are read, return 0 as the value
5368 from inner levels (process_init_element ignores that),
5369 but return error_mark_node as the value from the outermost level
5370 (that's what we want to put in DECL_INITIAL).
5371 Otherwise, return a CONSTRUCTOR expression as the value. */
5374 pop_init_level (int implicit
)
5376 struct constructor_stack
*p
;
5379 ret
.original_code
= ERROR_MARK
;
5383 /* When we come to an explicit close brace,
5384 pop any inner levels that didn't have explicit braces. */
5385 while (constructor_stack
->implicit
)
5386 process_init_element (pop_init_level (1));
5388 gcc_assert (!constructor_range_stack
);
5391 /* Now output all pending elements. */
5392 constructor_incremental
= 1;
5393 output_pending_init_elements (1);
5395 p
= constructor_stack
;
5397 /* Error for initializing a flexible array member, or a zero-length
5398 array member in an inappropriate context. */
5399 if (constructor_type
&& constructor_fields
5400 && TREE_CODE (constructor_type
) == ARRAY_TYPE
5401 && TYPE_DOMAIN (constructor_type
)
5402 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
)))
5404 /* Silently discard empty initializations. The parser will
5405 already have pedwarned for empty brackets. */
5406 if (integer_zerop (constructor_unfilled_index
))
5407 constructor_type
= NULL_TREE
;
5410 gcc_assert (!TYPE_SIZE (constructor_type
));
5412 if (constructor_depth
> 2)
5413 error_init ("initialization of flexible array member in a nested context");
5415 pedwarn_init ("initialization of a flexible array member");
5417 /* We have already issued an error message for the existence
5418 of a flexible array member not at the end of the structure.
5419 Discard the initializer so that we do not die later. */
5420 if (TREE_CHAIN (constructor_fields
) != NULL_TREE
)
5421 constructor_type
= NULL_TREE
;
5425 /* Warn when some struct elements are implicitly initialized to zero. */
5426 if (warn_missing_field_initializers
5428 && TREE_CODE (constructor_type
) == RECORD_TYPE
5429 && constructor_unfilled_fields
)
5431 /* Do not warn for flexible array members or zero-length arrays. */
5432 while (constructor_unfilled_fields
5433 && (!DECL_SIZE (constructor_unfilled_fields
)
5434 || integer_zerop (DECL_SIZE (constructor_unfilled_fields
))))
5435 constructor_unfilled_fields
= TREE_CHAIN (constructor_unfilled_fields
);
5437 /* Do not warn if this level of the initializer uses member
5438 designators; it is likely to be deliberate. */
5439 if (constructor_unfilled_fields
&& !constructor_designated
)
5441 push_member_name (constructor_unfilled_fields
);
5442 warning_init ("missing initializer");
5443 RESTORE_SPELLING_DEPTH (constructor_depth
);
5447 /* Pad out the end of the structure. */
5448 if (p
->replacement_value
.value
)
5449 /* If this closes a superfluous brace pair,
5450 just pass out the element between them. */
5451 ret
= p
->replacement_value
;
5452 else if (constructor_type
== 0)
5454 else if (TREE_CODE (constructor_type
) != RECORD_TYPE
5455 && TREE_CODE (constructor_type
) != UNION_TYPE
5456 && TREE_CODE (constructor_type
) != ARRAY_TYPE
5457 && TREE_CODE (constructor_type
) != VECTOR_TYPE
)
5459 /* A nonincremental scalar initializer--just return
5460 the element, after verifying there is just one. */
5461 if (VEC_empty (constructor_elt
,constructor_elements
))
5463 if (!constructor_erroneous
)
5464 error_init ("empty scalar initializer");
5465 ret
.value
= error_mark_node
;
5467 else if (VEC_length (constructor_elt
,constructor_elements
) != 1)
5469 error_init ("extra elements in scalar initializer");
5470 ret
.value
= VEC_index (constructor_elt
,constructor_elements
,0)->value
;
5473 ret
.value
= VEC_index (constructor_elt
,constructor_elements
,0)->value
;
5477 if (constructor_erroneous
)
5478 ret
.value
= error_mark_node
;
5481 ret
.value
= build_constructor (constructor_type
,
5482 constructor_elements
);
5483 if (constructor_constant
)
5484 TREE_CONSTANT (ret
.value
) = TREE_INVARIANT (ret
.value
) = 1;
5485 if (constructor_constant
&& constructor_simple
)
5486 TREE_STATIC (ret
.value
) = 1;
5490 constructor_type
= p
->type
;
5491 constructor_fields
= p
->fields
;
5492 constructor_index
= p
->index
;
5493 constructor_max_index
= p
->max_index
;
5494 constructor_unfilled_index
= p
->unfilled_index
;
5495 constructor_unfilled_fields
= p
->unfilled_fields
;
5496 constructor_bit_index
= p
->bit_index
;
5497 constructor_elements
= p
->elements
;
5498 constructor_constant
= p
->constant
;
5499 constructor_simple
= p
->simple
;
5500 constructor_erroneous
= p
->erroneous
;
5501 constructor_incremental
= p
->incremental
;
5502 constructor_designated
= p
->designated
;
5503 constructor_pending_elts
= p
->pending_elts
;
5504 constructor_depth
= p
->depth
;
5506 constructor_range_stack
= p
->range_stack
;
5507 RESTORE_SPELLING_DEPTH (constructor_depth
);
5509 constructor_stack
= p
->next
;
5512 if (ret
.value
== 0 && constructor_stack
== 0)
5513 ret
.value
= error_mark_node
;
5517 /* Common handling for both array range and field name designators.
5518 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5521 set_designator (int array
)
5524 enum tree_code subcode
;
5526 /* Don't die if an entire brace-pair level is superfluous
5527 in the containing level. */
5528 if (constructor_type
== 0)
5531 /* If there were errors in this designator list already, bail out
5533 if (designator_erroneous
)
5536 if (!designator_depth
)
5538 gcc_assert (!constructor_range_stack
);
5540 /* Designator list starts at the level of closest explicit
5542 while (constructor_stack
->implicit
)
5543 process_init_element (pop_init_level (1));
5544 constructor_designated
= 1;
5548 switch (TREE_CODE (constructor_type
))
5552 subtype
= TREE_TYPE (constructor_fields
);
5553 if (subtype
!= error_mark_node
)
5554 subtype
= TYPE_MAIN_VARIANT (subtype
);
5557 subtype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
5563 subcode
= TREE_CODE (subtype
);
5564 if (array
&& subcode
!= ARRAY_TYPE
)
5566 error_init ("array index in non-array initializer");
5569 else if (!array
&& subcode
!= RECORD_TYPE
&& subcode
!= UNION_TYPE
)
5571 error_init ("field name not in record or union initializer");
5575 constructor_designated
= 1;
5576 push_init_level (2);
5580 /* If there are range designators in designator list, push a new designator
5581 to constructor_range_stack. RANGE_END is end of such stack range or
5582 NULL_TREE if there is no range designator at this level. */
5585 push_range_stack (tree range_end
)
5587 struct constructor_range_stack
*p
;
5589 p
= GGC_NEW (struct constructor_range_stack
);
5590 p
->prev
= constructor_range_stack
;
5592 p
->fields
= constructor_fields
;
5593 p
->range_start
= constructor_index
;
5594 p
->index
= constructor_index
;
5595 p
->stack
= constructor_stack
;
5596 p
->range_end
= range_end
;
5597 if (constructor_range_stack
)
5598 constructor_range_stack
->next
= p
;
5599 constructor_range_stack
= p
;
5602 /* Within an array initializer, specify the next index to be initialized.
5603 FIRST is that index. If LAST is nonzero, then initialize a range
5604 of indices, running from FIRST through LAST. */
5607 set_init_index (tree first
, tree last
)
5609 if (set_designator (1))
5612 designator_erroneous
= 1;
5614 if (!INTEGRAL_TYPE_P (TREE_TYPE (first
))
5615 || (last
&& !INTEGRAL_TYPE_P (TREE_TYPE (last
))))
5617 error_init ("array index in initializer not of integer type");
5621 if (TREE_CODE (first
) != INTEGER_CST
)
5622 error_init ("nonconstant array index in initializer");
5623 else if (last
!= 0 && TREE_CODE (last
) != INTEGER_CST
)
5624 error_init ("nonconstant array index in initializer");
5625 else if (TREE_CODE (constructor_type
) != ARRAY_TYPE
)
5626 error_init ("array index in non-array initializer");
5627 else if (tree_int_cst_sgn (first
) == -1)
5628 error_init ("array index in initializer exceeds array bounds");
5629 else if (constructor_max_index
5630 && tree_int_cst_lt (constructor_max_index
, first
))
5631 error_init ("array index in initializer exceeds array bounds");
5634 constructor_index
= convert (bitsizetype
, first
);
5638 if (tree_int_cst_equal (first
, last
))
5640 else if (tree_int_cst_lt (last
, first
))
5642 error_init ("empty index range in initializer");
5647 last
= convert (bitsizetype
, last
);
5648 if (constructor_max_index
!= 0
5649 && tree_int_cst_lt (constructor_max_index
, last
))
5651 error_init ("array index range in initializer exceeds array bounds");
5658 designator_erroneous
= 0;
5659 if (constructor_range_stack
|| last
)
5660 push_range_stack (last
);
5664 /* Within a struct initializer, specify the next field to be initialized. */
5667 set_init_label (tree fieldname
)
5671 if (set_designator (0))
5674 designator_erroneous
= 1;
5676 if (TREE_CODE (constructor_type
) != RECORD_TYPE
5677 && TREE_CODE (constructor_type
) != UNION_TYPE
)
5679 error_init ("field name not in record or union initializer");
5683 for (tail
= TYPE_FIELDS (constructor_type
); tail
;
5684 tail
= TREE_CHAIN (tail
))
5686 if (DECL_NAME (tail
) == fieldname
)
5691 error ("unknown field %qE specified in initializer", fieldname
);
5694 constructor_fields
= tail
;
5696 designator_erroneous
= 0;
5697 if (constructor_range_stack
)
5698 push_range_stack (NULL_TREE
);
5702 /* Add a new initializer to the tree of pending initializers. PURPOSE
5703 identifies the initializer, either array index or field in a structure.
5704 VALUE is the value of that index or field. */
5707 add_pending_init (tree purpose
, tree value
)
5709 struct init_node
*p
, **q
, *r
;
5711 q
= &constructor_pending_elts
;
5714 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5719 if (tree_int_cst_lt (purpose
, p
->purpose
))
5721 else if (tree_int_cst_lt (p
->purpose
, purpose
))
5725 if (TREE_SIDE_EFFECTS (p
->value
))
5726 warning_init ("initialized field with side-effects overwritten");
5727 else if (warn_override_init
)
5728 warning_init ("initialized field overwritten");
5738 bitpos
= bit_position (purpose
);
5742 if (tree_int_cst_lt (bitpos
, bit_position (p
->purpose
)))
5744 else if (p
->purpose
!= purpose
)
5748 if (TREE_SIDE_EFFECTS (p
->value
))
5749 warning_init ("initialized field with side-effects overwritten");
5750 else if (warn_override_init
)
5751 warning_init ("initialized field overwritten");
5758 r
= GGC_NEW (struct init_node
);
5759 r
->purpose
= purpose
;
5770 struct init_node
*s
;
5774 if (p
->balance
== 0)
5776 else if (p
->balance
< 0)
5783 p
->left
->parent
= p
;
5800 constructor_pending_elts
= r
;
5805 struct init_node
*t
= r
->right
;
5809 r
->right
->parent
= r
;
5814 p
->left
->parent
= p
;
5817 p
->balance
= t
->balance
< 0;
5818 r
->balance
= -(t
->balance
> 0);
5833 constructor_pending_elts
= t
;
5839 /* p->balance == +1; growth of left side balances the node. */
5844 else /* r == p->right */
5846 if (p
->balance
== 0)
5847 /* Growth propagation from right side. */
5849 else if (p
->balance
> 0)
5856 p
->right
->parent
= p
;
5873 constructor_pending_elts
= r
;
5875 else /* r->balance == -1 */
5878 struct init_node
*t
= r
->left
;
5882 r
->left
->parent
= r
;
5887 p
->right
->parent
= p
;
5890 r
->balance
= (t
->balance
< 0);
5891 p
->balance
= -(t
->balance
> 0);
5906 constructor_pending_elts
= t
;
5912 /* p->balance == -1; growth of right side balances the node. */
5923 /* Build AVL tree from a sorted chain. */
5926 set_nonincremental_init (void)
5928 unsigned HOST_WIDE_INT ix
;
5931 if (TREE_CODE (constructor_type
) != RECORD_TYPE
5932 && TREE_CODE (constructor_type
) != ARRAY_TYPE
)
5935 FOR_EACH_CONSTRUCTOR_ELT (constructor_elements
, ix
, index
, value
)
5936 add_pending_init (index
, value
);
5937 constructor_elements
= 0;
5938 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
5940 constructor_unfilled_fields
= TYPE_FIELDS (constructor_type
);
5941 /* Skip any nameless bit fields at the beginning. */
5942 while (constructor_unfilled_fields
!= 0
5943 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
5944 && DECL_NAME (constructor_unfilled_fields
) == 0)
5945 constructor_unfilled_fields
= TREE_CHAIN (constructor_unfilled_fields
);
5948 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5950 if (TYPE_DOMAIN (constructor_type
))
5951 constructor_unfilled_index
5952 = convert (bitsizetype
,
5953 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
5955 constructor_unfilled_index
= bitsize_zero_node
;
5957 constructor_incremental
= 0;
5960 /* Build AVL tree from a string constant. */
5963 set_nonincremental_init_from_string (tree str
)
5965 tree value
, purpose
, type
;
5966 HOST_WIDE_INT val
[2];
5967 const char *p
, *end
;
5968 int byte
, wchar_bytes
, charwidth
, bitpos
;
5970 gcc_assert (TREE_CODE (constructor_type
) == ARRAY_TYPE
);
5972 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str
)))
5973 == TYPE_PRECISION (char_type_node
))
5977 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str
)))
5978 == TYPE_PRECISION (wchar_type_node
));
5979 wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
5981 charwidth
= TYPE_PRECISION (char_type_node
);
5982 type
= TREE_TYPE (constructor_type
);
5983 p
= TREE_STRING_POINTER (str
);
5984 end
= p
+ TREE_STRING_LENGTH (str
);
5986 for (purpose
= bitsize_zero_node
;
5987 p
< end
&& !tree_int_cst_lt (constructor_max_index
, purpose
);
5988 purpose
= size_binop (PLUS_EXPR
, purpose
, bitsize_one_node
))
5990 if (wchar_bytes
== 1)
5992 val
[1] = (unsigned char) *p
++;
5999 for (byte
= 0; byte
< wchar_bytes
; byte
++)
6001 if (BYTES_BIG_ENDIAN
)
6002 bitpos
= (wchar_bytes
- byte
- 1) * charwidth
;
6004 bitpos
= byte
* charwidth
;
6005 val
[bitpos
< HOST_BITS_PER_WIDE_INT
]
6006 |= ((unsigned HOST_WIDE_INT
) ((unsigned char) *p
++))
6007 << (bitpos
% HOST_BITS_PER_WIDE_INT
);
6011 if (!TYPE_UNSIGNED (type
))
6013 bitpos
= ((wchar_bytes
- 1) * charwidth
) + HOST_BITS_PER_CHAR
;
6014 if (bitpos
< HOST_BITS_PER_WIDE_INT
)
6016 if (val
[1] & (((HOST_WIDE_INT
) 1) << (bitpos
- 1)))
6018 val
[1] |= ((HOST_WIDE_INT
) -1) << bitpos
;
6022 else if (bitpos
== HOST_BITS_PER_WIDE_INT
)
6027 else if (val
[0] & (((HOST_WIDE_INT
) 1)
6028 << (bitpos
- 1 - HOST_BITS_PER_WIDE_INT
)))
6029 val
[0] |= ((HOST_WIDE_INT
) -1)
6030 << (bitpos
- HOST_BITS_PER_WIDE_INT
);
6033 value
= build_int_cst_wide (type
, val
[1], val
[0]);
6034 add_pending_init (purpose
, value
);
6037 constructor_incremental
= 0;
6040 /* Return value of FIELD in pending initializer or zero if the field was
6041 not initialized yet. */
6044 find_init_member (tree field
)
6046 struct init_node
*p
;
6048 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6050 if (constructor_incremental
6051 && tree_int_cst_lt (field
, constructor_unfilled_index
))
6052 set_nonincremental_init ();
6054 p
= constructor_pending_elts
;
6057 if (tree_int_cst_lt (field
, p
->purpose
))
6059 else if (tree_int_cst_lt (p
->purpose
, field
))
6065 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
6067 tree bitpos
= bit_position (field
);
6069 if (constructor_incremental
6070 && (!constructor_unfilled_fields
6071 || tree_int_cst_lt (bitpos
,
6072 bit_position (constructor_unfilled_fields
))))
6073 set_nonincremental_init ();
6075 p
= constructor_pending_elts
;
6078 if (field
== p
->purpose
)
6080 else if (tree_int_cst_lt (bitpos
, bit_position (p
->purpose
)))
6086 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
6088 if (!VEC_empty (constructor_elt
, constructor_elements
)
6089 && (VEC_last (constructor_elt
, constructor_elements
)->index
6091 return VEC_last (constructor_elt
, constructor_elements
)->value
;
6096 /* "Output" the next constructor element.
6097 At top level, really output it to assembler code now.
6098 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
6099 TYPE is the data type that the containing data type wants here.
6100 FIELD is the field (a FIELD_DECL) or the index that this element fills.
6101 If VALUE is a string constant, STRICT_STRING is true if it is
6102 unparenthesized or we should not warn here for it being parenthesized.
6103 For other types of VALUE, STRICT_STRING is not used.
6105 PENDING if non-nil means output pending elements that belong
6106 right after this element. (PENDING is normally 1;
6107 it is 0 while outputting pending elements, to avoid recursion.) */
6110 output_init_element (tree value
, bool strict_string
, tree type
, tree field
,
6113 constructor_elt
*celt
;
6115 if (type
== error_mark_node
|| value
== error_mark_node
)
6117 constructor_erroneous
= 1;
6120 if (TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
6121 && (TREE_CODE (value
) == STRING_CST
6122 || TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
)
6123 && !(TREE_CODE (value
) == STRING_CST
6124 && TREE_CODE (type
) == ARRAY_TYPE
6125 && INTEGRAL_TYPE_P (TREE_TYPE (type
)))
6126 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value
)),
6127 TYPE_MAIN_VARIANT (type
)))
6128 value
= array_to_pointer_conversion (value
);
6130 if (TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
6131 && require_constant_value
&& !flag_isoc99
&& pending
)
6133 /* As an extension, allow initializing objects with static storage
6134 duration with compound literals (which are then treated just as
6135 the brace enclosed list they contain). */
6136 tree decl
= COMPOUND_LITERAL_EXPR_DECL (value
);
6137 value
= DECL_INITIAL (decl
);
6140 if (value
== error_mark_node
)
6141 constructor_erroneous
= 1;
6142 else if (!TREE_CONSTANT (value
))
6143 constructor_constant
= 0;
6144 else if (!initializer_constant_valid_p (value
, TREE_TYPE (value
))
6145 || ((TREE_CODE (constructor_type
) == RECORD_TYPE
6146 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6147 && DECL_C_BIT_FIELD (field
)
6148 && TREE_CODE (value
) != INTEGER_CST
))
6149 constructor_simple
= 0;
6151 if (!initializer_constant_valid_p (value
, TREE_TYPE (value
)))
6153 if (require_constant_value
)
6155 error_init ("initializer element is not constant");
6156 value
= error_mark_node
;
6158 else if (require_constant_elements
)
6159 pedwarn ("initializer element is not computable at load time");
6162 /* If this field is empty (and not at the end of structure),
6163 don't do anything other than checking the initializer. */
6165 && (TREE_TYPE (field
) == error_mark_node
6166 || (COMPLETE_TYPE_P (TREE_TYPE (field
))
6167 && integer_zerop (TYPE_SIZE (TREE_TYPE (field
)))
6168 && (TREE_CODE (constructor_type
) == ARRAY_TYPE
6169 || TREE_CHAIN (field
)))))
6172 value
= digest_init (type
, value
, strict_string
, require_constant_value
);
6173 if (value
== error_mark_node
)
6175 constructor_erroneous
= 1;
6179 /* If this element doesn't come next in sequence,
6180 put it on constructor_pending_elts. */
6181 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
6182 && (!constructor_incremental
6183 || !tree_int_cst_equal (field
, constructor_unfilled_index
)))
6185 if (constructor_incremental
6186 && tree_int_cst_lt (field
, constructor_unfilled_index
))
6187 set_nonincremental_init ();
6189 add_pending_init (field
, value
);
6192 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
6193 && (!constructor_incremental
6194 || field
!= constructor_unfilled_fields
))
6196 /* We do this for records but not for unions. In a union,
6197 no matter which field is specified, it can be initialized
6198 right away since it starts at the beginning of the union. */
6199 if (constructor_incremental
)
6201 if (!constructor_unfilled_fields
)
6202 set_nonincremental_init ();
6205 tree bitpos
, unfillpos
;
6207 bitpos
= bit_position (field
);
6208 unfillpos
= bit_position (constructor_unfilled_fields
);
6210 if (tree_int_cst_lt (bitpos
, unfillpos
))
6211 set_nonincremental_init ();
6215 add_pending_init (field
, value
);
6218 else if (TREE_CODE (constructor_type
) == UNION_TYPE
6219 && !VEC_empty (constructor_elt
, constructor_elements
))
6221 if (TREE_SIDE_EFFECTS (VEC_last (constructor_elt
,
6222 constructor_elements
)->value
))
6223 warning_init ("initialized field with side-effects overwritten");
6224 else if (warn_override_init
)
6225 warning_init ("initialized field overwritten");
6227 /* We can have just one union field set. */
6228 constructor_elements
= 0;
6231 /* Otherwise, output this element either to
6232 constructor_elements or to the assembler file. */
6234 celt
= VEC_safe_push (constructor_elt
, gc
, constructor_elements
, NULL
);
6235 celt
->index
= field
;
6236 celt
->value
= value
;
6238 /* Advance the variable that indicates sequential elements output. */
6239 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6240 constructor_unfilled_index
6241 = size_binop (PLUS_EXPR
, constructor_unfilled_index
,
6243 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
6245 constructor_unfilled_fields
6246 = TREE_CHAIN (constructor_unfilled_fields
);
6248 /* Skip any nameless bit fields. */
6249 while (constructor_unfilled_fields
!= 0
6250 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
6251 && DECL_NAME (constructor_unfilled_fields
) == 0)
6252 constructor_unfilled_fields
=
6253 TREE_CHAIN (constructor_unfilled_fields
);
6255 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
6256 constructor_unfilled_fields
= 0;
6258 /* Now output any pending elements which have become next. */
6260 output_pending_init_elements (0);
6263 /* Output any pending elements which have become next.
6264 As we output elements, constructor_unfilled_{fields,index}
6265 advances, which may cause other elements to become next;
6266 if so, they too are output.
6268 If ALL is 0, we return when there are
6269 no more pending elements to output now.
6271 If ALL is 1, we output space as necessary so that
6272 we can output all the pending elements. */
6275 output_pending_init_elements (int all
)
6277 struct init_node
*elt
= constructor_pending_elts
;
6282 /* Look through the whole pending tree.
6283 If we find an element that should be output now,
6284 output it. Otherwise, set NEXT to the element
6285 that comes first among those still pending. */
6290 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6292 if (tree_int_cst_equal (elt
->purpose
,
6293 constructor_unfilled_index
))
6294 output_init_element (elt
->value
, true,
6295 TREE_TYPE (constructor_type
),
6296 constructor_unfilled_index
, 0);
6297 else if (tree_int_cst_lt (constructor_unfilled_index
,
6300 /* Advance to the next smaller node. */
6305 /* We have reached the smallest node bigger than the
6306 current unfilled index. Fill the space first. */
6307 next
= elt
->purpose
;
6313 /* Advance to the next bigger node. */
6318 /* We have reached the biggest node in a subtree. Find
6319 the parent of it, which is the next bigger node. */
6320 while (elt
->parent
&& elt
->parent
->right
== elt
)
6323 if (elt
&& tree_int_cst_lt (constructor_unfilled_index
,
6326 next
= elt
->purpose
;
6332 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
6333 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6335 tree ctor_unfilled_bitpos
, elt_bitpos
;
6337 /* If the current record is complete we are done. */
6338 if (constructor_unfilled_fields
== 0)
6341 ctor_unfilled_bitpos
= bit_position (constructor_unfilled_fields
);
6342 elt_bitpos
= bit_position (elt
->purpose
);
6343 /* We can't compare fields here because there might be empty
6344 fields in between. */
6345 if (tree_int_cst_equal (elt_bitpos
, ctor_unfilled_bitpos
))
6347 constructor_unfilled_fields
= elt
->purpose
;
6348 output_init_element (elt
->value
, true, TREE_TYPE (elt
->purpose
),
6351 else if (tree_int_cst_lt (ctor_unfilled_bitpos
, elt_bitpos
))
6353 /* Advance to the next smaller node. */
6358 /* We have reached the smallest node bigger than the
6359 current unfilled field. Fill the space first. */
6360 next
= elt
->purpose
;
6366 /* Advance to the next bigger node. */
6371 /* We have reached the biggest node in a subtree. Find
6372 the parent of it, which is the next bigger node. */
6373 while (elt
->parent
&& elt
->parent
->right
== elt
)
6377 && (tree_int_cst_lt (ctor_unfilled_bitpos
,
6378 bit_position (elt
->purpose
))))
6380 next
= elt
->purpose
;
6388 /* Ordinarily return, but not if we want to output all
6389 and there are elements left. */
6390 if (!(all
&& next
!= 0))
6393 /* If it's not incremental, just skip over the gap, so that after
6394 jumping to retry we will output the next successive element. */
6395 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6396 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6397 constructor_unfilled_fields
= next
;
6398 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6399 constructor_unfilled_index
= next
;
6401 /* ELT now points to the node in the pending tree with the next
6402 initializer to output. */
6406 /* Add one non-braced element to the current constructor level.
6407 This adjusts the current position within the constructor's type.
6408 This may also start or terminate implicit levels
6409 to handle a partly-braced initializer.
6411 Once this has found the correct level for the new element,
6412 it calls output_init_element. */
6415 process_init_element (struct c_expr value
)
6417 tree orig_value
= value
.value
;
6418 int string_flag
= orig_value
!= 0 && TREE_CODE (orig_value
) == STRING_CST
;
6419 bool strict_string
= value
.original_code
== STRING_CST
;
6421 designator_depth
= 0;
6422 designator_erroneous
= 0;
6424 /* Handle superfluous braces around string cst as in
6425 char x[] = {"foo"}; */
6428 && TREE_CODE (constructor_type
) == ARRAY_TYPE
6429 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type
))
6430 && integer_zerop (constructor_unfilled_index
))
6432 if (constructor_stack
->replacement_value
.value
)
6433 error_init ("excess elements in char array initializer");
6434 constructor_stack
->replacement_value
= value
;
6438 if (constructor_stack
->replacement_value
.value
!= 0)
6440 error_init ("excess elements in struct initializer");
6444 /* Ignore elements of a brace group if it is entirely superfluous
6445 and has already been diagnosed. */
6446 if (constructor_type
== 0)
6449 /* If we've exhausted any levels that didn't have braces,
6451 while (constructor_stack
->implicit
)
6453 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
6454 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6455 && constructor_fields
== 0)
6456 process_init_element (pop_init_level (1));
6457 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
6458 && (constructor_max_index
== 0
6459 || tree_int_cst_lt (constructor_max_index
,
6460 constructor_index
)))
6461 process_init_element (pop_init_level (1));
6466 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6467 if (constructor_range_stack
)
6469 /* If value is a compound literal and we'll be just using its
6470 content, don't put it into a SAVE_EXPR. */
6471 if (TREE_CODE (value
.value
) != COMPOUND_LITERAL_EXPR
6472 || !require_constant_value
6474 value
.value
= save_expr (value
.value
);
6479 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
6482 enum tree_code fieldcode
;
6484 if (constructor_fields
== 0)
6486 pedwarn_init ("excess elements in struct initializer");
6490 fieldtype
= TREE_TYPE (constructor_fields
);
6491 if (fieldtype
!= error_mark_node
)
6492 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
6493 fieldcode
= TREE_CODE (fieldtype
);
6495 /* Error for non-static initialization of a flexible array member. */
6496 if (fieldcode
== ARRAY_TYPE
6497 && !require_constant_value
6498 && TYPE_SIZE (fieldtype
) == NULL_TREE
6499 && TREE_CHAIN (constructor_fields
) == NULL_TREE
)
6501 error_init ("non-static initialization of a flexible array member");
6505 /* Accept a string constant to initialize a subarray. */
6506 if (value
.value
!= 0
6507 && fieldcode
== ARRAY_TYPE
6508 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype
))
6510 value
.value
= orig_value
;
6511 /* Otherwise, if we have come to a subaggregate,
6512 and we don't have an element of its type, push into it. */
6513 else if (value
.value
!= 0
6514 && value
.value
!= error_mark_node
6515 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != fieldtype
6516 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
6517 || fieldcode
== UNION_TYPE
))
6519 push_init_level (1);
6525 push_member_name (constructor_fields
);
6526 output_init_element (value
.value
, strict_string
,
6527 fieldtype
, constructor_fields
, 1);
6528 RESTORE_SPELLING_DEPTH (constructor_depth
);
6531 /* Do the bookkeeping for an element that was
6532 directly output as a constructor. */
6534 /* For a record, keep track of end position of last field. */
6535 if (DECL_SIZE (constructor_fields
))
6536 constructor_bit_index
6537 = size_binop (PLUS_EXPR
,
6538 bit_position (constructor_fields
),
6539 DECL_SIZE (constructor_fields
));
6541 /* If the current field was the first one not yet written out,
6542 it isn't now, so update. */
6543 if (constructor_unfilled_fields
== constructor_fields
)
6545 constructor_unfilled_fields
= TREE_CHAIN (constructor_fields
);
6546 /* Skip any nameless bit fields. */
6547 while (constructor_unfilled_fields
!= 0
6548 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
6549 && DECL_NAME (constructor_unfilled_fields
) == 0)
6550 constructor_unfilled_fields
=
6551 TREE_CHAIN (constructor_unfilled_fields
);
6555 constructor_fields
= TREE_CHAIN (constructor_fields
);
6556 /* Skip any nameless bit fields at the beginning. */
6557 while (constructor_fields
!= 0
6558 && DECL_C_BIT_FIELD (constructor_fields
)
6559 && DECL_NAME (constructor_fields
) == 0)
6560 constructor_fields
= TREE_CHAIN (constructor_fields
);
6562 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
6565 enum tree_code fieldcode
;
6567 if (constructor_fields
== 0)
6569 pedwarn_init ("excess elements in union initializer");
6573 fieldtype
= TREE_TYPE (constructor_fields
);
6574 if (fieldtype
!= error_mark_node
)
6575 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
6576 fieldcode
= TREE_CODE (fieldtype
);
6578 /* Warn that traditional C rejects initialization of unions.
6579 We skip the warning if the value is zero. This is done
6580 under the assumption that the zero initializer in user
6581 code appears conditioned on e.g. __STDC__ to avoid
6582 "missing initializer" warnings and relies on default
6583 initialization to zero in the traditional C case.
6584 We also skip the warning if the initializer is designated,
6585 again on the assumption that this must be conditional on
6586 __STDC__ anyway (and we've already complained about the
6587 member-designator already). */
6588 if (!in_system_header
&& !constructor_designated
6589 && !(value
.value
&& (integer_zerop (value
.value
)
6590 || real_zerop (value
.value
))))
6591 warning (OPT_Wtraditional
, "traditional C rejects initialization "
6594 /* Accept a string constant to initialize a subarray. */
6595 if (value
.value
!= 0
6596 && fieldcode
== ARRAY_TYPE
6597 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype
))
6599 value
.value
= orig_value
;
6600 /* Otherwise, if we have come to a subaggregate,
6601 and we don't have an element of its type, push into it. */
6602 else if (value
.value
!= 0
6603 && value
.value
!= error_mark_node
6604 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != fieldtype
6605 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
6606 || fieldcode
== UNION_TYPE
))
6608 push_init_level (1);
6614 push_member_name (constructor_fields
);
6615 output_init_element (value
.value
, strict_string
,
6616 fieldtype
, constructor_fields
, 1);
6617 RESTORE_SPELLING_DEPTH (constructor_depth
);
6620 /* Do the bookkeeping for an element that was
6621 directly output as a constructor. */
6623 constructor_bit_index
= DECL_SIZE (constructor_fields
);
6624 constructor_unfilled_fields
= TREE_CHAIN (constructor_fields
);
6627 constructor_fields
= 0;
6629 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6631 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
6632 enum tree_code eltcode
= TREE_CODE (elttype
);
6634 /* Accept a string constant to initialize a subarray. */
6635 if (value
.value
!= 0
6636 && eltcode
== ARRAY_TYPE
6637 && INTEGRAL_TYPE_P (TREE_TYPE (elttype
))
6639 value
.value
= orig_value
;
6640 /* Otherwise, if we have come to a subaggregate,
6641 and we don't have an element of its type, push into it. */
6642 else if (value
.value
!= 0
6643 && value
.value
!= error_mark_node
6644 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != elttype
6645 && (eltcode
== RECORD_TYPE
|| eltcode
== ARRAY_TYPE
6646 || eltcode
== UNION_TYPE
))
6648 push_init_level (1);
6652 if (constructor_max_index
!= 0
6653 && (tree_int_cst_lt (constructor_max_index
, constructor_index
)
6654 || integer_all_onesp (constructor_max_index
)))
6656 pedwarn_init ("excess elements in array initializer");
6660 /* Now output the actual element. */
6663 push_array_bounds (tree_low_cst (constructor_index
, 1));
6664 output_init_element (value
.value
, strict_string
,
6665 elttype
, constructor_index
, 1);
6666 RESTORE_SPELLING_DEPTH (constructor_depth
);
6670 = size_binop (PLUS_EXPR
, constructor_index
, bitsize_one_node
);
6673 /* If we are doing the bookkeeping for an element that was
6674 directly output as a constructor, we must update
6675 constructor_unfilled_index. */
6676 constructor_unfilled_index
= constructor_index
;
6678 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
6680 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
6682 /* Do a basic check of initializer size. Note that vectors
6683 always have a fixed size derived from their type. */
6684 if (tree_int_cst_lt (constructor_max_index
, constructor_index
))
6686 pedwarn_init ("excess elements in vector initializer");
6690 /* Now output the actual element. */
6692 output_init_element (value
.value
, strict_string
,
6693 elttype
, constructor_index
, 1);
6696 = size_binop (PLUS_EXPR
, constructor_index
, bitsize_one_node
);
6699 /* If we are doing the bookkeeping for an element that was
6700 directly output as a constructor, we must update
6701 constructor_unfilled_index. */
6702 constructor_unfilled_index
= constructor_index
;
6705 /* Handle the sole element allowed in a braced initializer
6706 for a scalar variable. */
6707 else if (constructor_type
!= error_mark_node
6708 && constructor_fields
== 0)
6710 pedwarn_init ("excess elements in scalar initializer");
6716 output_init_element (value
.value
, strict_string
,
6717 constructor_type
, NULL_TREE
, 1);
6718 constructor_fields
= 0;
6721 /* Handle range initializers either at this level or anywhere higher
6722 in the designator stack. */
6723 if (constructor_range_stack
)
6725 struct constructor_range_stack
*p
, *range_stack
;
6728 range_stack
= constructor_range_stack
;
6729 constructor_range_stack
= 0;
6730 while (constructor_stack
!= range_stack
->stack
)
6732 gcc_assert (constructor_stack
->implicit
);
6733 process_init_element (pop_init_level (1));
6735 for (p
= range_stack
;
6736 !p
->range_end
|| tree_int_cst_equal (p
->index
, p
->range_end
);
6739 gcc_assert (constructor_stack
->implicit
);
6740 process_init_element (pop_init_level (1));
6743 p
->index
= size_binop (PLUS_EXPR
, p
->index
, bitsize_one_node
);
6744 if (tree_int_cst_equal (p
->index
, p
->range_end
) && !p
->prev
)
6749 constructor_index
= p
->index
;
6750 constructor_fields
= p
->fields
;
6751 if (finish
&& p
->range_end
&& p
->index
== p
->range_start
)
6759 push_init_level (2);
6760 p
->stack
= constructor_stack
;
6761 if (p
->range_end
&& tree_int_cst_equal (p
->index
, p
->range_end
))
6762 p
->index
= p
->range_start
;
6766 constructor_range_stack
= range_stack
;
6773 constructor_range_stack
= 0;
6776 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6777 (guaranteed to be 'volatile' or null) and ARGS (represented using
6778 an ASM_EXPR node). */
6780 build_asm_stmt (tree cv_qualifier
, tree args
)
6782 if (!ASM_VOLATILE_P (args
) && cv_qualifier
)
6783 ASM_VOLATILE_P (args
) = 1;
6784 return add_stmt (args
);
6787 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6788 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6789 SIMPLE indicates whether there was anything at all after the
6790 string in the asm expression -- asm("blah") and asm("blah" : )
6791 are subtly different. We use a ASM_EXPR node to represent this. */
6793 build_asm_expr (tree string
, tree outputs
, tree inputs
, tree clobbers
,
6799 const char *constraint
;
6800 const char **oconstraints
;
6801 bool allows_mem
, allows_reg
, is_inout
;
6802 int ninputs
, noutputs
;
6804 ninputs
= list_length (inputs
);
6805 noutputs
= list_length (outputs
);
6806 oconstraints
= (const char **) alloca (noutputs
* sizeof (const char *));
6808 string
= resolve_asm_operand_names (string
, outputs
, inputs
);
6810 /* Remove output conversions that change the type but not the mode. */
6811 for (i
= 0, tail
= outputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
6813 tree output
= TREE_VALUE (tail
);
6815 /* ??? Really, this should not be here. Users should be using a
6816 proper lvalue, dammit. But there's a long history of using casts
6817 in the output operands. In cases like longlong.h, this becomes a
6818 primitive form of typechecking -- if the cast can be removed, then
6819 the output operand had a type of the proper width; otherwise we'll
6820 get an error. Gross, but ... */
6821 STRIP_NOPS (output
);
6823 if (!lvalue_or_else (output
, lv_asm
))
6824 output
= error_mark_node
;
6826 if (output
!= error_mark_node
6827 && (TREE_READONLY (output
)
6828 || TYPE_READONLY (TREE_TYPE (output
))
6829 || ((TREE_CODE (TREE_TYPE (output
)) == RECORD_TYPE
6830 || TREE_CODE (TREE_TYPE (output
)) == UNION_TYPE
)
6831 && C_TYPE_FIELDS_READONLY (TREE_TYPE (output
)))))
6832 readonly_error (output
, lv_asm
);
6834 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
6835 oconstraints
[i
] = constraint
;
6837 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
6838 &allows_mem
, &allows_reg
, &is_inout
))
6840 /* If the operand is going to end up in memory,
6841 mark it addressable. */
6842 if (!allows_reg
&& !c_mark_addressable (output
))
6843 output
= error_mark_node
;
6846 output
= error_mark_node
;
6848 TREE_VALUE (tail
) = output
;
6851 for (i
= 0, tail
= inputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
6855 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
6856 input
= TREE_VALUE (tail
);
6858 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
6859 oconstraints
, &allows_mem
, &allows_reg
))
6861 /* If the operand is going to end up in memory,
6862 mark it addressable. */
6863 if (!allows_reg
&& allows_mem
)
6865 /* Strip the nops as we allow this case. FIXME, this really
6866 should be rejected or made deprecated. */
6868 if (!c_mark_addressable (input
))
6869 input
= error_mark_node
;
6873 input
= error_mark_node
;
6875 TREE_VALUE (tail
) = input
;
6878 args
= build_stmt (ASM_EXPR
, string
, outputs
, inputs
, clobbers
);
6880 /* asm statements without outputs, including simple ones, are treated
6882 ASM_INPUT_P (args
) = simple
;
6883 ASM_VOLATILE_P (args
) = (noutputs
== 0);
6888 /* Generate a goto statement to LABEL. */
6891 c_finish_goto_label (tree label
)
6893 tree decl
= lookup_label (label
);
6897 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl
))
6899 error ("jump into statement expression");
6903 if (C_DECL_UNJUMPABLE_VM (decl
))
6905 error ("jump into scope of identifier with variably modified type");
6909 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl
))
6911 /* No jump from outside this statement expression context, so
6912 record that there is a jump from within this context. */
6913 struct c_label_list
*nlist
;
6914 nlist
= XOBNEW (&parser_obstack
, struct c_label_list
);
6915 nlist
->next
= label_context_stack_se
->labels_used
;
6916 nlist
->label
= decl
;
6917 label_context_stack_se
->labels_used
= nlist
;
6920 if (!C_DECL_UNDEFINABLE_VM (decl
))
6922 /* No jump from outside this context context of identifiers with
6923 variably modified type, so record that there is a jump from
6924 within this context. */
6925 struct c_label_list
*nlist
;
6926 nlist
= XOBNEW (&parser_obstack
, struct c_label_list
);
6927 nlist
->next
= label_context_stack_vm
->labels_used
;
6928 nlist
->label
= decl
;
6929 label_context_stack_vm
->labels_used
= nlist
;
6932 TREE_USED (decl
) = 1;
6933 return add_stmt (build1 (GOTO_EXPR
, void_type_node
, decl
));
6936 /* Generate a computed goto statement to EXPR. */
6939 c_finish_goto_ptr (tree expr
)
6942 pedwarn ("ISO C forbids %<goto *expr;%>");
6943 expr
= convert (ptr_type_node
, expr
);
6944 return add_stmt (build1 (GOTO_EXPR
, void_type_node
, expr
));
6947 /* Generate a C `return' statement. RETVAL is the expression for what
6948 to return, or a null pointer for `return;' with no value. */
6951 c_finish_return (tree retval
)
6953 tree valtype
= TREE_TYPE (TREE_TYPE (current_function_decl
)), ret_stmt
;
6954 bool no_warning
= false;
6956 if (TREE_THIS_VOLATILE (current_function_decl
))
6957 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6961 current_function_returns_null
= 1;
6962 if ((warn_return_type
|| flag_isoc99
)
6963 && valtype
!= 0 && TREE_CODE (valtype
) != VOID_TYPE
)
6965 pedwarn_c99 ("%<return%> with no value, in "
6966 "function returning non-void");
6970 else if (valtype
== 0 || TREE_CODE (valtype
) == VOID_TYPE
)
6972 current_function_returns_null
= 1;
6973 if (TREE_CODE (TREE_TYPE (retval
)) != VOID_TYPE
)
6974 pedwarn ("%<return%> with a value, in function returning void");
6976 pedwarn ("ISO C forbids %<return%> with expression, in function returning void");
6980 tree t
= convert_for_assignment (valtype
, retval
, ic_return
,
6981 NULL_TREE
, NULL_TREE
, 0);
6982 tree res
= DECL_RESULT (current_function_decl
);
6985 current_function_returns_value
= 1;
6986 if (t
== error_mark_node
)
6989 inner
= t
= convert (TREE_TYPE (res
), t
);
6991 /* Strip any conversions, additions, and subtractions, and see if
6992 we are returning the address of a local variable. Warn if so. */
6995 switch (TREE_CODE (inner
))
6997 case NOP_EXPR
: case NON_LVALUE_EXPR
: case CONVERT_EXPR
:
6999 inner
= TREE_OPERAND (inner
, 0);
7003 /* If the second operand of the MINUS_EXPR has a pointer
7004 type (or is converted from it), this may be valid, so
7005 don't give a warning. */
7007 tree op1
= TREE_OPERAND (inner
, 1);
7009 while (!POINTER_TYPE_P (TREE_TYPE (op1
))
7010 && (TREE_CODE (op1
) == NOP_EXPR
7011 || TREE_CODE (op1
) == NON_LVALUE_EXPR
7012 || TREE_CODE (op1
) == CONVERT_EXPR
))
7013 op1
= TREE_OPERAND (op1
, 0);
7015 if (POINTER_TYPE_P (TREE_TYPE (op1
)))
7018 inner
= TREE_OPERAND (inner
, 0);
7023 inner
= TREE_OPERAND (inner
, 0);
7025 while (REFERENCE_CLASS_P (inner
)
7026 && TREE_CODE (inner
) != INDIRECT_REF
)
7027 inner
= TREE_OPERAND (inner
, 0);
7030 && !DECL_EXTERNAL (inner
)
7031 && !TREE_STATIC (inner
)
7032 && DECL_CONTEXT (inner
) == current_function_decl
)
7033 warning (0, "function returns address of local variable");
7043 retval
= build2 (MODIFY_EXPR
, TREE_TYPE (res
), res
, t
);
7046 ret_stmt
= build_stmt (RETURN_EXPR
, retval
);
7047 TREE_NO_WARNING (ret_stmt
) |= no_warning
;
7048 return add_stmt (ret_stmt
);
7052 /* The SWITCH_EXPR being built. */
7055 /* The original type of the testing expression, i.e. before the
7056 default conversion is applied. */
7059 /* A splay-tree mapping the low element of a case range to the high
7060 element, or NULL_TREE if there is no high element. Used to
7061 determine whether or not a new case label duplicates an old case
7062 label. We need a tree, rather than simply a hash table, because
7063 of the GNU case range extension. */
7066 /* Number of nested statement expressions within this switch
7067 statement; if nonzero, case and default labels may not
7069 unsigned int blocked_stmt_expr
;
7071 /* Scope of outermost declarations of identifiers with variably
7072 modified type within this switch statement; if nonzero, case and
7073 default labels may not appear. */
7074 unsigned int blocked_vm
;
7076 /* The next node on the stack. */
7077 struct c_switch
*next
;
7080 /* A stack of the currently active switch statements. The innermost
7081 switch statement is on the top of the stack. There is no need to
7082 mark the stack for garbage collection because it is only active
7083 during the processing of the body of a function, and we never
7084 collect at that point. */
7086 struct c_switch
*c_switch_stack
;
7088 /* Start a C switch statement, testing expression EXP. Return the new
7092 c_start_case (tree exp
)
7094 tree orig_type
= error_mark_node
;
7095 struct c_switch
*cs
;
7097 if (exp
!= error_mark_node
)
7099 orig_type
= TREE_TYPE (exp
);
7101 if (!INTEGRAL_TYPE_P (orig_type
))
7103 if (orig_type
!= error_mark_node
)
7105 error ("switch quantity not an integer");
7106 orig_type
= error_mark_node
;
7108 exp
= integer_zero_node
;
7112 tree type
= TYPE_MAIN_VARIANT (orig_type
);
7114 if (!in_system_header
7115 && (type
== long_integer_type_node
7116 || type
== long_unsigned_type_node
))
7117 warning (OPT_Wtraditional
, "%<long%> switch expression not "
7118 "converted to %<int%> in ISO C");
7120 exp
= default_conversion (exp
);
7124 /* Add this new SWITCH_EXPR to the stack. */
7125 cs
= XNEW (struct c_switch
);
7126 cs
->switch_expr
= build3 (SWITCH_EXPR
, orig_type
, exp
, NULL_TREE
, NULL_TREE
);
7127 cs
->orig_type
= orig_type
;
7128 cs
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
7129 cs
->blocked_stmt_expr
= 0;
7131 cs
->next
= c_switch_stack
;
7132 c_switch_stack
= cs
;
7134 return add_stmt (cs
->switch_expr
);
7137 /* Process a case label. */
7140 do_case (tree low_value
, tree high_value
)
7142 tree label
= NULL_TREE
;
7144 if (c_switch_stack
&& !c_switch_stack
->blocked_stmt_expr
7145 && !c_switch_stack
->blocked_vm
)
7147 label
= c_add_case_label (c_switch_stack
->cases
,
7148 SWITCH_COND (c_switch_stack
->switch_expr
),
7149 c_switch_stack
->orig_type
,
7150 low_value
, high_value
);
7151 if (label
== error_mark_node
)
7154 else if (c_switch_stack
&& c_switch_stack
->blocked_stmt_expr
)
7157 error ("case label in statement expression not containing "
7158 "enclosing switch statement");
7160 error ("%<default%> label in statement expression not containing "
7161 "enclosing switch statement");
7163 else if (c_switch_stack
&& c_switch_stack
->blocked_vm
)
7166 error ("case label in scope of identifier with variably modified "
7167 "type not containing enclosing switch statement");
7169 error ("%<default%> label in scope of identifier with variably "
7170 "modified type not containing enclosing switch statement");
7173 error ("case label not within a switch statement");
7175 error ("%<default%> label not within a switch statement");
7180 /* Finish the switch statement. */
7183 c_finish_case (tree body
)
7185 struct c_switch
*cs
= c_switch_stack
;
7186 location_t switch_location
;
7188 SWITCH_BODY (cs
->switch_expr
) = body
;
7190 /* We must not be within a statement expression nested in the switch
7191 at this point; we might, however, be within the scope of an
7192 identifier with variably modified type nested in the switch. */
7193 gcc_assert (!cs
->blocked_stmt_expr
);
7195 /* Emit warnings as needed. */
7196 if (EXPR_HAS_LOCATION (cs
->switch_expr
))
7197 switch_location
= EXPR_LOCATION (cs
->switch_expr
);
7199 switch_location
= input_location
;
7200 c_do_switch_warnings (cs
->cases
, switch_location
,
7201 TREE_TYPE (cs
->switch_expr
),
7202 SWITCH_COND (cs
->switch_expr
));
7204 /* Pop the stack. */
7205 c_switch_stack
= cs
->next
;
7206 splay_tree_delete (cs
->cases
);
7210 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
7211 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
7212 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
7213 statement, and was not surrounded with parenthesis. */
7216 c_finish_if_stmt (location_t if_locus
, tree cond
, tree then_block
,
7217 tree else_block
, bool nested_if
)
7221 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
7222 if (warn_parentheses
&& nested_if
&& else_block
== NULL
)
7224 tree inner_if
= then_block
;
7226 /* We know from the grammar productions that there is an IF nested
7227 within THEN_BLOCK. Due to labels and c99 conditional declarations,
7228 it might not be exactly THEN_BLOCK, but should be the last
7229 non-container statement within. */
7231 switch (TREE_CODE (inner_if
))
7236 inner_if
= BIND_EXPR_BODY (inner_if
);
7238 case STATEMENT_LIST
:
7239 inner_if
= expr_last (then_block
);
7241 case TRY_FINALLY_EXPR
:
7242 case TRY_CATCH_EXPR
:
7243 inner_if
= TREE_OPERAND (inner_if
, 0);
7250 if (COND_EXPR_ELSE (inner_if
))
7251 warning (OPT_Wparentheses
,
7252 "%Hsuggest explicit braces to avoid ambiguous %<else%>",
7256 empty_if_body_warning (then_block
, else_block
);
7258 stmt
= build3 (COND_EXPR
, void_type_node
, cond
, then_block
, else_block
);
7259 SET_EXPR_LOCATION (stmt
, if_locus
);
7263 /* Emit a general-purpose loop construct. START_LOCUS is the location of
7264 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
7265 is false for DO loops. INCR is the FOR increment expression. BODY is
7266 the statement controlled by the loop. BLAB is the break label. CLAB is
7267 the continue label. Everything is allowed to be NULL. */
7270 c_finish_loop (location_t start_locus
, tree cond
, tree incr
, tree body
,
7271 tree blab
, tree clab
, bool cond_is_first
)
7273 tree entry
= NULL
, exit
= NULL
, t
;
7275 /* If the condition is zero don't generate a loop construct. */
7276 if (cond
&& integer_zerop (cond
))
7280 t
= build_and_jump (&blab
);
7281 SET_EXPR_LOCATION (t
, start_locus
);
7287 tree top
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
7289 /* If we have an exit condition, then we build an IF with gotos either
7290 out of the loop, or to the top of it. If there's no exit condition,
7291 then we just build a jump back to the top. */
7292 exit
= build_and_jump (&LABEL_EXPR_LABEL (top
));
7294 if (cond
&& !integer_nonzerop (cond
))
7296 /* Canonicalize the loop condition to the end. This means
7297 generating a branch to the loop condition. Reuse the
7298 continue label, if possible. */
7303 entry
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
7304 t
= build_and_jump (&LABEL_EXPR_LABEL (entry
));
7307 t
= build1 (GOTO_EXPR
, void_type_node
, clab
);
7308 SET_EXPR_LOCATION (t
, start_locus
);
7312 t
= build_and_jump (&blab
);
7313 exit
= fold_build3 (COND_EXPR
, void_type_node
, cond
, exit
, t
);
7315 SET_EXPR_LOCATION (exit
, start_locus
);
7317 SET_EXPR_LOCATION (exit
, input_location
);
7326 add_stmt (build1 (LABEL_EXPR
, void_type_node
, clab
));
7334 add_stmt (build1 (LABEL_EXPR
, void_type_node
, blab
));
7338 c_finish_bc_stmt (tree
*label_p
, bool is_break
)
7341 tree label
= *label_p
;
7343 /* In switch statements break is sometimes stylistically used after
7344 a return statement. This can lead to spurious warnings about
7345 control reaching the end of a non-void function when it is
7346 inlined. Note that we are calling block_may_fallthru with
7347 language specific tree nodes; this works because
7348 block_may_fallthru returns true when given something it does not
7350 skip
= !block_may_fallthru (cur_stmt_list
);
7355 *label_p
= label
= create_artificial_label ();
7357 else if (TREE_CODE (label
) == LABEL_DECL
)
7359 else switch (TREE_INT_CST_LOW (label
))
7363 error ("break statement not within loop or switch");
7365 error ("continue statement not within a loop");
7369 gcc_assert (is_break
);
7370 error ("break statement used with OpenMP for loop");
7380 return add_stmt (build1 (GOTO_EXPR
, void_type_node
, label
));
7383 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7386 emit_side_effect_warnings (tree expr
)
7388 if (expr
== error_mark_node
)
7390 else if (!TREE_SIDE_EFFECTS (expr
))
7392 if (!VOID_TYPE_P (TREE_TYPE (expr
)) && !TREE_NO_WARNING (expr
))
7393 warning (OPT_Wunused_value
, "%Hstatement with no effect",
7394 EXPR_HAS_LOCATION (expr
) ? EXPR_LOCUS (expr
) : &input_location
);
7397 warn_if_unused_value (expr
, input_location
);
7400 /* Process an expression as if it were a complete statement. Emit
7401 diagnostics, but do not call ADD_STMT. */
7404 c_process_expr_stmt (tree expr
)
7409 if (warn_sequence_point
)
7410 verify_sequence_points (expr
);
7412 if (TREE_TYPE (expr
) != error_mark_node
7413 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr
))
7414 && TREE_CODE (TREE_TYPE (expr
)) != ARRAY_TYPE
)
7415 error ("expression statement has incomplete type");
7417 /* If we're not processing a statement expression, warn about unused values.
7418 Warnings for statement expressions will be emitted later, once we figure
7419 out which is the result. */
7420 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list
)
7421 && warn_unused_value
)
7422 emit_side_effect_warnings (expr
);
7424 /* If the expression is not of a type to which we cannot assign a line
7425 number, wrap the thing in a no-op NOP_EXPR. */
7426 if (DECL_P (expr
) || CONSTANT_CLASS_P (expr
))
7427 expr
= build1 (NOP_EXPR
, TREE_TYPE (expr
), expr
);
7429 if (CAN_HAVE_LOCATION_P (expr
))
7430 SET_EXPR_LOCATION (expr
, input_location
);
7435 /* Emit an expression as a statement. */
7438 c_finish_expr_stmt (tree expr
)
7441 return add_stmt (c_process_expr_stmt (expr
));
7446 /* Do the opposite and emit a statement as an expression. To begin,
7447 create a new binding level and return it. */
7450 c_begin_stmt_expr (void)
7453 struct c_label_context_se
*nstack
;
7454 struct c_label_list
*glist
;
7456 /* We must force a BLOCK for this level so that, if it is not expanded
7457 later, there is a way to turn off the entire subtree of blocks that
7458 are contained in it. */
7460 ret
= c_begin_compound_stmt (true);
7463 c_switch_stack
->blocked_stmt_expr
++;
7464 gcc_assert (c_switch_stack
->blocked_stmt_expr
!= 0);
7466 for (glist
= label_context_stack_se
->labels_used
;
7468 glist
= glist
->next
)
7470 C_DECL_UNDEFINABLE_STMT_EXPR (glist
->label
) = 1;
7472 nstack
= XOBNEW (&parser_obstack
, struct c_label_context_se
);
7473 nstack
->labels_def
= NULL
;
7474 nstack
->labels_used
= NULL
;
7475 nstack
->next
= label_context_stack_se
;
7476 label_context_stack_se
= nstack
;
7478 /* Mark the current statement list as belonging to a statement list. */
7479 STATEMENT_LIST_STMT_EXPR (ret
) = 1;
7485 c_finish_stmt_expr (tree body
)
7487 tree last
, type
, tmp
, val
;
7489 struct c_label_list
*dlist
, *glist
, *glist_prev
= NULL
;
7491 body
= c_end_compound_stmt (body
, true);
7494 gcc_assert (c_switch_stack
->blocked_stmt_expr
!= 0);
7495 c_switch_stack
->blocked_stmt_expr
--;
7497 /* It is no longer possible to jump to labels defined within this
7498 statement expression. */
7499 for (dlist
= label_context_stack_se
->labels_def
;
7501 dlist
= dlist
->next
)
7503 C_DECL_UNJUMPABLE_STMT_EXPR (dlist
->label
) = 1;
7505 /* It is again possible to define labels with a goto just outside
7506 this statement expression. */
7507 for (glist
= label_context_stack_se
->next
->labels_used
;
7509 glist
= glist
->next
)
7511 C_DECL_UNDEFINABLE_STMT_EXPR (glist
->label
) = 0;
7514 if (glist_prev
!= NULL
)
7515 glist_prev
->next
= label_context_stack_se
->labels_used
;
7517 label_context_stack_se
->next
->labels_used
7518 = label_context_stack_se
->labels_used
;
7519 label_context_stack_se
= label_context_stack_se
->next
;
7521 /* Locate the last statement in BODY. See c_end_compound_stmt
7522 about always returning a BIND_EXPR. */
7523 last_p
= &BIND_EXPR_BODY (body
);
7524 last
= BIND_EXPR_BODY (body
);
7527 if (TREE_CODE (last
) == STATEMENT_LIST
)
7529 tree_stmt_iterator i
;
7531 /* This can happen with degenerate cases like ({ }). No value. */
7532 if (!TREE_SIDE_EFFECTS (last
))
7535 /* If we're supposed to generate side effects warnings, process
7536 all of the statements except the last. */
7537 if (warn_unused_value
)
7539 for (i
= tsi_start (last
); !tsi_one_before_end_p (i
); tsi_next (&i
))
7540 emit_side_effect_warnings (tsi_stmt (i
));
7543 i
= tsi_last (last
);
7544 last_p
= tsi_stmt_ptr (i
);
7548 /* If the end of the list is exception related, then the list was split
7549 by a call to push_cleanup. Continue searching. */
7550 if (TREE_CODE (last
) == TRY_FINALLY_EXPR
7551 || TREE_CODE (last
) == TRY_CATCH_EXPR
)
7553 last_p
= &TREE_OPERAND (last
, 0);
7555 goto continue_searching
;
7558 /* In the case that the BIND_EXPR is not necessary, return the
7559 expression out from inside it. */
7560 if (last
== error_mark_node
7561 || (last
== BIND_EXPR_BODY (body
)
7562 && BIND_EXPR_VARS (body
) == NULL
))
7564 /* Do not warn if the return value of a statement expression is
7566 if (CAN_HAVE_LOCATION_P (last
))
7567 TREE_NO_WARNING (last
) = 1;
7571 /* Extract the type of said expression. */
7572 type
= TREE_TYPE (last
);
7574 /* If we're not returning a value at all, then the BIND_EXPR that
7575 we already have is a fine expression to return. */
7576 if (!type
|| VOID_TYPE_P (type
))
7579 /* Now that we've located the expression containing the value, it seems
7580 silly to make voidify_wrapper_expr repeat the process. Create a
7581 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7582 tmp
= create_tmp_var_raw (type
, NULL
);
7584 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7585 tree_expr_nonnegative_p giving up immediately. */
7587 if (TREE_CODE (val
) == NOP_EXPR
7588 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0)))
7589 val
= TREE_OPERAND (val
, 0);
7591 *last_p
= build2 (MODIFY_EXPR
, void_type_node
, tmp
, val
);
7592 SET_EXPR_LOCUS (*last_p
, EXPR_LOCUS (last
));
7594 return build4 (TARGET_EXPR
, type
, tmp
, body
, NULL_TREE
, NULL_TREE
);
7597 /* Begin the scope of an identifier of variably modified type, scope
7598 number SCOPE. Jumping from outside this scope to inside it is not
7602 c_begin_vm_scope (unsigned int scope
)
7604 struct c_label_context_vm
*nstack
;
7605 struct c_label_list
*glist
;
7607 gcc_assert (scope
> 0);
7609 /* At file_scope, we don't have to do any processing. */
7610 if (label_context_stack_vm
== NULL
)
7613 if (c_switch_stack
&& !c_switch_stack
->blocked_vm
)
7614 c_switch_stack
->blocked_vm
= scope
;
7615 for (glist
= label_context_stack_vm
->labels_used
;
7617 glist
= glist
->next
)
7619 C_DECL_UNDEFINABLE_VM (glist
->label
) = 1;
7621 nstack
= XOBNEW (&parser_obstack
, struct c_label_context_vm
);
7622 nstack
->labels_def
= NULL
;
7623 nstack
->labels_used
= NULL
;
7624 nstack
->scope
= scope
;
7625 nstack
->next
= label_context_stack_vm
;
7626 label_context_stack_vm
= nstack
;
7629 /* End a scope which may contain identifiers of variably modified
7630 type, scope number SCOPE. */
7633 c_end_vm_scope (unsigned int scope
)
7635 if (label_context_stack_vm
== NULL
)
7637 if (c_switch_stack
&& c_switch_stack
->blocked_vm
== scope
)
7638 c_switch_stack
->blocked_vm
= 0;
7639 /* We may have a number of nested scopes of identifiers with
7640 variably modified type, all at this depth. Pop each in turn. */
7641 while (label_context_stack_vm
->scope
== scope
)
7643 struct c_label_list
*dlist
, *glist
, *glist_prev
= NULL
;
7645 /* It is no longer possible to jump to labels defined within this
7647 for (dlist
= label_context_stack_vm
->labels_def
;
7649 dlist
= dlist
->next
)
7651 C_DECL_UNJUMPABLE_VM (dlist
->label
) = 1;
7653 /* It is again possible to define labels with a goto just outside
7655 for (glist
= label_context_stack_vm
->next
->labels_used
;
7657 glist
= glist
->next
)
7659 C_DECL_UNDEFINABLE_VM (glist
->label
) = 0;
7662 if (glist_prev
!= NULL
)
7663 glist_prev
->next
= label_context_stack_vm
->labels_used
;
7665 label_context_stack_vm
->next
->labels_used
7666 = label_context_stack_vm
->labels_used
;
7667 label_context_stack_vm
= label_context_stack_vm
->next
;
7671 /* Begin and end compound statements. This is as simple as pushing
7672 and popping new statement lists from the tree. */
7675 c_begin_compound_stmt (bool do_scope
)
7677 tree stmt
= push_stmt_list ();
7684 c_end_compound_stmt (tree stmt
, bool do_scope
)
7690 if (c_dialect_objc ())
7691 objc_clear_super_receiver ();
7692 block
= pop_scope ();
7695 stmt
= pop_stmt_list (stmt
);
7696 stmt
= c_build_bind_expr (block
, stmt
);
7698 /* If this compound statement is nested immediately inside a statement
7699 expression, then force a BIND_EXPR to be created. Otherwise we'll
7700 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7701 STATEMENT_LISTs merge, and thus we can lose track of what statement
7704 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list
)
7705 && TREE_CODE (stmt
) != BIND_EXPR
)
7707 stmt
= build3 (BIND_EXPR
, void_type_node
, NULL
, stmt
, NULL
);
7708 TREE_SIDE_EFFECTS (stmt
) = 1;
7714 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7715 when the current scope is exited. EH_ONLY is true when this is not
7716 meant to apply to normal control flow transfer. */
7719 push_cleanup (tree
ARG_UNUSED (decl
), tree cleanup
, bool eh_only
)
7721 enum tree_code code
;
7725 code
= eh_only
? TRY_CATCH_EXPR
: TRY_FINALLY_EXPR
;
7726 stmt
= build_stmt (code
, NULL
, cleanup
);
7728 stmt_expr
= STATEMENT_LIST_STMT_EXPR (cur_stmt_list
);
7729 list
= push_stmt_list ();
7730 TREE_OPERAND (stmt
, 0) = list
;
7731 STATEMENT_LIST_STMT_EXPR (list
) = stmt_expr
;
7734 /* Build a binary-operation expression without default conversions.
7735 CODE is the kind of expression to build.
7736 This function differs from `build' in several ways:
7737 the data type of the result is computed and recorded in it,
7738 warnings are generated if arg data types are invalid,
7739 special handling for addition and subtraction of pointers is known,
7740 and some optimization is done (operations on narrow ints
7741 are done in the narrower type when that gives the same result).
7742 Constant folding is also done before the result is returned.
7744 Note that the operands will never have enumeral types, or function
7745 or array types, because either they will have the default conversions
7746 performed or they have both just been converted to some other type in which
7747 the arithmetic is to be done. */
7750 build_binary_op (enum tree_code code
, tree orig_op0
, tree orig_op1
,
7754 enum tree_code code0
, code1
;
7756 const char *invalid_op_diag
;
7758 /* Expression code to give to the expression when it is built.
7759 Normally this is CODE, which is what the caller asked for,
7760 but in some special cases we change it. */
7761 enum tree_code resultcode
= code
;
7763 /* Data type in which the computation is to be performed.
7764 In the simplest cases this is the common type of the arguments. */
7765 tree result_type
= NULL
;
7767 /* Nonzero means operands have already been type-converted
7768 in whatever way is necessary.
7769 Zero means they need to be converted to RESULT_TYPE. */
7772 /* Nonzero means create the expression with this type, rather than
7774 tree build_type
= 0;
7776 /* Nonzero means after finally constructing the expression
7777 convert it to this type. */
7778 tree final_type
= 0;
7780 /* Nonzero if this is an operation like MIN or MAX which can
7781 safely be computed in short if both args are promoted shorts.
7782 Also implies COMMON.
7783 -1 indicates a bitwise operation; this makes a difference
7784 in the exact conditions for when it is safe to do the operation
7785 in a narrower mode. */
7788 /* Nonzero if this is a comparison operation;
7789 if both args are promoted shorts, compare the original shorts.
7790 Also implies COMMON. */
7791 int short_compare
= 0;
7793 /* Nonzero if this is a right-shift operation, which can be computed on the
7794 original short and then promoted if the operand is a promoted short. */
7795 int short_shift
= 0;
7797 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7800 /* True means types are compatible as far as ObjC is concerned. */
7805 op0
= default_conversion (orig_op0
);
7806 op1
= default_conversion (orig_op1
);
7814 type0
= TREE_TYPE (op0
);
7815 type1
= TREE_TYPE (op1
);
7817 /* The expression codes of the data types of the arguments tell us
7818 whether the arguments are integers, floating, pointers, etc. */
7819 code0
= TREE_CODE (type0
);
7820 code1
= TREE_CODE (type1
);
7822 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7823 STRIP_TYPE_NOPS (op0
);
7824 STRIP_TYPE_NOPS (op1
);
7826 /* If an error was already reported for one of the arguments,
7827 avoid reporting another error. */
7829 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
7830 return error_mark_node
;
7832 if ((invalid_op_diag
7833 = targetm
.invalid_binary_op (code
, type0
, type1
)))
7835 error (invalid_op_diag
);
7836 return error_mark_node
;
7839 objc_ok
= objc_compare_types (type0
, type1
, -3, NULL_TREE
);
7844 /* Handle the pointer + int case. */
7845 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
7846 return pointer_int_sum (PLUS_EXPR
, op0
, op1
);
7847 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
7848 return pointer_int_sum (PLUS_EXPR
, op1
, op0
);
7854 /* Subtraction of two similar pointers.
7855 We must subtract them as integers, then divide by object size. */
7856 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
7857 && comp_target_types (type0
, type1
))
7858 return pointer_diff (op0
, op1
);
7859 /* Handle pointer minus int. Just like pointer plus int. */
7860 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
7861 return pointer_int_sum (MINUS_EXPR
, op0
, op1
);
7870 case TRUNC_DIV_EXPR
:
7872 case FLOOR_DIV_EXPR
:
7873 case ROUND_DIV_EXPR
:
7874 case EXACT_DIV_EXPR
:
7875 warn_for_div_by_zero (op1
);
7877 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
7878 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
7879 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
7880 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
7882 enum tree_code tcode0
= code0
, tcode1
= code1
;
7884 if (code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
7885 tcode0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
7886 if (code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
)
7887 tcode1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
7889 if (!(tcode0
== INTEGER_TYPE
&& tcode1
== INTEGER_TYPE
))
7890 resultcode
= RDIV_EXPR
;
7892 /* Although it would be tempting to shorten always here, that
7893 loses on some targets, since the modulo instruction is
7894 undefined if the quotient can't be represented in the
7895 computation mode. We shorten only if unsigned or if
7896 dividing by something we know != -1. */
7897 shorten
= (TYPE_UNSIGNED (TREE_TYPE (orig_op0
))
7898 || (TREE_CODE (op1
) == INTEGER_CST
7899 && !integer_all_onesp (op1
)));
7907 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
7909 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
7913 case TRUNC_MOD_EXPR
:
7914 case FLOOR_MOD_EXPR
:
7915 warn_for_div_by_zero (op1
);
7917 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
7919 /* Although it would be tempting to shorten always here, that loses
7920 on some targets, since the modulo instruction is undefined if the
7921 quotient can't be represented in the computation mode. We shorten
7922 only if unsigned or if dividing by something we know != -1. */
7923 shorten
= (TYPE_UNSIGNED (TREE_TYPE (orig_op0
))
7924 || (TREE_CODE (op1
) == INTEGER_CST
7925 && !integer_all_onesp (op1
)));
7930 case TRUTH_ANDIF_EXPR
:
7931 case TRUTH_ORIF_EXPR
:
7932 case TRUTH_AND_EXPR
:
7934 case TRUTH_XOR_EXPR
:
7935 if ((code0
== INTEGER_TYPE
|| code0
== POINTER_TYPE
7936 || code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
7937 && (code1
== INTEGER_TYPE
|| code1
== POINTER_TYPE
7938 || code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
))
7940 /* Result of these operations is always an int,
7941 but that does not mean the operands should be
7942 converted to ints! */
7943 result_type
= integer_type_node
;
7944 op0
= c_common_truthvalue_conversion (op0
);
7945 op1
= c_common_truthvalue_conversion (op1
);
7950 /* Shift operations: result has same type as first operand;
7951 always convert second operand to int.
7952 Also set SHORT_SHIFT if shifting rightward. */
7955 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
7957 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
7959 if (tree_int_cst_sgn (op1
) < 0)
7960 warning (0, "right shift count is negative");
7963 if (!integer_zerop (op1
))
7966 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
7967 warning (0, "right shift count >= width of type");
7971 /* Use the type of the value to be shifted. */
7972 result_type
= type0
;
7973 /* Convert the shift-count to an integer, regardless of size
7974 of value being shifted. */
7975 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
7976 op1
= convert (integer_type_node
, op1
);
7977 /* Avoid converting op1 to result_type later. */
7983 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
7985 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
7987 if (tree_int_cst_sgn (op1
) < 0)
7988 warning (0, "left shift count is negative");
7990 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
7991 warning (0, "left shift count >= width of type");
7994 /* Use the type of the value to be shifted. */
7995 result_type
= type0
;
7996 /* Convert the shift-count to an integer, regardless of size
7997 of value being shifted. */
7998 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
7999 op1
= convert (integer_type_node
, op1
);
8000 /* Avoid converting op1 to result_type later. */
8007 if (code0
== REAL_TYPE
|| code1
== REAL_TYPE
)
8008 warning (OPT_Wfloat_equal
,
8009 "comparing floating point with == or != is unsafe");
8010 /* Result of comparison is always int,
8011 but don't convert the args to int! */
8012 build_type
= integer_type_node
;
8013 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
8014 || code0
== COMPLEX_TYPE
)
8015 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
8016 || code1
== COMPLEX_TYPE
))
8018 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
8020 tree tt0
= TREE_TYPE (type0
);
8021 tree tt1
= TREE_TYPE (type1
);
8022 /* Anything compares with void *. void * compares with anything.
8023 Otherwise, the targets must be compatible
8024 and both must be object or both incomplete. */
8025 if (comp_target_types (type0
, type1
))
8026 result_type
= common_pointer_type (type0
, type1
);
8027 else if (VOID_TYPE_P (tt0
))
8029 /* op0 != orig_op0 detects the case of something
8030 whose value is 0 but which isn't a valid null ptr const. */
8031 if (pedantic
&& !null_pointer_constant_p (orig_op0
)
8032 && TREE_CODE (tt1
) == FUNCTION_TYPE
)
8033 pedwarn ("ISO C forbids comparison of %<void *%>"
8034 " with function pointer");
8036 else if (VOID_TYPE_P (tt1
))
8038 if (pedantic
&& !null_pointer_constant_p (orig_op1
)
8039 && TREE_CODE (tt0
) == FUNCTION_TYPE
)
8040 pedwarn ("ISO C forbids comparison of %<void *%>"
8041 " with function pointer");
8044 /* Avoid warning about the volatile ObjC EH puts on decls. */
8046 pedwarn ("comparison of distinct pointer types lacks a cast");
8048 if (result_type
== NULL_TREE
)
8049 result_type
= ptr_type_node
;
8051 else if (code0
== POINTER_TYPE
&& null_pointer_constant_p (orig_op1
))
8053 if (TREE_CODE (op0
) == ADDR_EXPR
8054 && decl_with_nonnull_addr_p (TREE_OPERAND (op0
, 0)))
8055 warning (OPT_Waddress
, "the address of %qD will never be NULL",
8056 TREE_OPERAND (op0
, 0));
8057 result_type
= type0
;
8059 else if (code1
== POINTER_TYPE
&& null_pointer_constant_p (orig_op0
))
8061 if (TREE_CODE (op1
) == ADDR_EXPR
8062 && decl_with_nonnull_addr_p (TREE_OPERAND (op1
, 0)))
8063 warning (OPT_Waddress
, "the address of %qD will never be NULL",
8064 TREE_OPERAND (op1
, 0));
8065 result_type
= type1
;
8067 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
8069 result_type
= type0
;
8070 pedwarn ("comparison between pointer and integer");
8072 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
8074 result_type
= type1
;
8075 pedwarn ("comparison between pointer and integer");
8083 build_type
= integer_type_node
;
8084 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
8085 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
8087 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
8089 if (comp_target_types (type0
, type1
))
8091 result_type
= common_pointer_type (type0
, type1
);
8092 if (!COMPLETE_TYPE_P (TREE_TYPE (type0
))
8093 != !COMPLETE_TYPE_P (TREE_TYPE (type1
)))
8094 pedwarn ("comparison of complete and incomplete pointers");
8096 && TREE_CODE (TREE_TYPE (type0
)) == FUNCTION_TYPE
)
8097 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
8101 result_type
= ptr_type_node
;
8102 pedwarn ("comparison of distinct pointer types lacks a cast");
8105 else if (code0
== POINTER_TYPE
&& null_pointer_constant_p (orig_op1
))
8107 result_type
= type0
;
8108 if (pedantic
|| extra_warnings
)
8109 pedwarn ("ordered comparison of pointer with integer zero");
8111 else if (code1
== POINTER_TYPE
&& null_pointer_constant_p (orig_op0
))
8113 result_type
= type1
;
8115 pedwarn ("ordered comparison of pointer with integer zero");
8117 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
8119 result_type
= type0
;
8120 pedwarn ("comparison between pointer and integer");
8122 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
8124 result_type
= type1
;
8125 pedwarn ("comparison between pointer and integer");
8133 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
8134 return error_mark_node
;
8136 if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
8137 && (!tree_int_cst_equal (TYPE_SIZE (type0
), TYPE_SIZE (type1
))
8138 || !same_scalar_type_ignoring_signedness (TREE_TYPE (type0
),
8139 TREE_TYPE (type1
))))
8141 binary_op_error (code
, type0
, type1
);
8142 return error_mark_node
;
8145 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
8146 || code0
== VECTOR_TYPE
)
8148 (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
8149 || code1
== VECTOR_TYPE
))
8151 int none_complex
= (code0
!= COMPLEX_TYPE
&& code1
!= COMPLEX_TYPE
);
8153 if (shorten
|| common
|| short_compare
)
8155 result_type
= c_common_type (type0
, type1
);
8156 if (result_type
== error_mark_node
)
8157 return error_mark_node
;
8160 /* For certain operations (which identify themselves by shorten != 0)
8161 if both args were extended from the same smaller type,
8162 do the arithmetic in that type and then extend.
8164 shorten !=0 and !=1 indicates a bitwise operation.
8165 For them, this optimization is safe only if
8166 both args are zero-extended or both are sign-extended.
8167 Otherwise, we might change the result.
8168 Eg, (short)-1 | (unsigned short)-1 is (int)-1
8169 but calculated in (unsigned short) it would be (unsigned short)-1. */
8171 if (shorten
&& none_complex
)
8173 int unsigned0
, unsigned1
;
8178 /* Cast OP0 and OP1 to RESULT_TYPE. Doing so prevents
8179 excessive narrowing when we call get_narrower below. For
8180 example, suppose that OP0 is of unsigned int extended
8181 from signed char and that RESULT_TYPE is long long int.
8182 If we explicitly cast OP0 to RESULT_TYPE, OP0 would look
8185 (long long int) (unsigned int) signed_char
8187 which get_narrower would narrow down to
8189 (unsigned int) signed char
8191 If we do not cast OP0 first, get_narrower would return
8192 signed_char, which is inconsistent with the case of the
8194 op0
= convert (result_type
, op0
);
8195 op1
= convert (result_type
, op1
);
8197 arg0
= get_narrower (op0
, &unsigned0
);
8198 arg1
= get_narrower (op1
, &unsigned1
);
8200 /* UNS is 1 if the operation to be done is an unsigned one. */
8201 uns
= TYPE_UNSIGNED (result_type
);
8203 final_type
= result_type
;
8205 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
8206 but it *requires* conversion to FINAL_TYPE. */
8208 if ((TYPE_PRECISION (TREE_TYPE (op0
))
8209 == TYPE_PRECISION (TREE_TYPE (arg0
)))
8210 && TREE_TYPE (op0
) != final_type
)
8211 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
8212 if ((TYPE_PRECISION (TREE_TYPE (op1
))
8213 == TYPE_PRECISION (TREE_TYPE (arg1
)))
8214 && TREE_TYPE (op1
) != final_type
)
8215 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
8217 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
8219 /* For bitwise operations, signedness of nominal type
8220 does not matter. Consider only how operands were extended. */
8224 /* Note that in all three cases below we refrain from optimizing
8225 an unsigned operation on sign-extended args.
8226 That would not be valid. */
8228 /* Both args variable: if both extended in same way
8229 from same width, do it in that width.
8230 Do it unsigned if args were zero-extended. */
8231 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
8232 < TYPE_PRECISION (result_type
))
8233 && (TYPE_PRECISION (TREE_TYPE (arg1
))
8234 == TYPE_PRECISION (TREE_TYPE (arg0
)))
8235 && unsigned0
== unsigned1
8236 && (unsigned0
|| !uns
))
8238 = c_common_signed_or_unsigned_type
8239 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
8240 else if (TREE_CODE (arg0
) == INTEGER_CST
8241 && (unsigned1
|| !uns
)
8242 && (TYPE_PRECISION (TREE_TYPE (arg1
))
8243 < TYPE_PRECISION (result_type
))
8245 = c_common_signed_or_unsigned_type (unsigned1
,
8247 int_fits_type_p (arg0
, type
)))
8249 else if (TREE_CODE (arg1
) == INTEGER_CST
8250 && (unsigned0
|| !uns
)
8251 && (TYPE_PRECISION (TREE_TYPE (arg0
))
8252 < TYPE_PRECISION (result_type
))
8254 = c_common_signed_or_unsigned_type (unsigned0
,
8256 int_fits_type_p (arg1
, type
)))
8260 /* Shifts can be shortened if shifting right. */
8265 tree arg0
= get_narrower (op0
, &unsigned_arg
);
8267 final_type
= result_type
;
8269 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
8270 unsigned_arg
= TYPE_UNSIGNED (TREE_TYPE (op0
));
8272 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
8273 /* We can shorten only if the shift count is less than the
8274 number of bits in the smaller type size. */
8275 && compare_tree_int (op1
, TYPE_PRECISION (TREE_TYPE (arg0
))) < 0
8276 /* We cannot drop an unsigned shift after sign-extension. */
8277 && (!TYPE_UNSIGNED (final_type
) || unsigned_arg
))
8279 /* Do an unsigned shift if the operand was zero-extended. */
8281 = c_common_signed_or_unsigned_type (unsigned_arg
,
8283 /* Convert value-to-be-shifted to that type. */
8284 if (TREE_TYPE (op0
) != result_type
)
8285 op0
= convert (result_type
, op0
);
8290 /* Comparison operations are shortened too but differently.
8291 They identify themselves by setting short_compare = 1. */
8295 /* Don't write &op0, etc., because that would prevent op0
8296 from being kept in a register.
8297 Instead, make copies of the our local variables and
8298 pass the copies by reference, then copy them back afterward. */
8299 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
8300 enum tree_code xresultcode
= resultcode
;
8302 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
8307 op0
= xop0
, op1
= xop1
;
8309 resultcode
= xresultcode
;
8311 if (warn_sign_compare
&& skip_evaluation
== 0)
8313 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
8314 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
8315 int unsignedp0
, unsignedp1
;
8316 tree primop0
= get_narrower (op0
, &unsignedp0
);
8317 tree primop1
= get_narrower (op1
, &unsignedp1
);
8321 STRIP_TYPE_NOPS (xop0
);
8322 STRIP_TYPE_NOPS (xop1
);
8324 /* Give warnings for comparisons between signed and unsigned
8325 quantities that may fail.
8327 Do the checking based on the original operand trees, so that
8328 casts will be considered, but default promotions won't be.
8330 Do not warn if the comparison is being done in a signed type,
8331 since the signed type will only be chosen if it can represent
8332 all the values of the unsigned type. */
8333 if (!TYPE_UNSIGNED (result_type
))
8335 /* Do not warn if both operands are the same signedness. */
8336 else if (op0_signed
== op1_signed
)
8344 sop
= xop0
, uop
= xop1
;
8346 sop
= xop1
, uop
= xop0
;
8348 /* Do not warn if the signed quantity is an
8349 unsuffixed integer literal (or some static
8350 constant expression involving such literals or a
8351 conditional expression involving such literals)
8352 and it is non-negative. */
8353 if (tree_expr_nonnegative_warnv_p (sop
, &ovf
))
8355 /* Do not warn if the comparison is an equality operation,
8356 the unsigned quantity is an integral constant, and it
8357 would fit in the result if the result were signed. */
8358 else if (TREE_CODE (uop
) == INTEGER_CST
8359 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
8361 (uop
, c_common_signed_type (result_type
)))
8363 /* Do not warn if the unsigned quantity is an enumeration
8364 constant and its maximum value would fit in the result
8365 if the result were signed. */
8366 else if (TREE_CODE (uop
) == INTEGER_CST
8367 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
8369 (TYPE_MAX_VALUE (TREE_TYPE (uop
)),
8370 c_common_signed_type (result_type
)))
8373 warning (0, "comparison between signed and unsigned");
8376 /* Warn if two unsigned values are being compared in a size
8377 larger than their original size, and one (and only one) is the
8378 result of a `~' operator. This comparison will always fail.
8380 Also warn if one operand is a constant, and the constant
8381 does not have all bits set that are set in the ~ operand
8382 when it is extended. */
8384 if ((TREE_CODE (primop0
) == BIT_NOT_EXPR
)
8385 != (TREE_CODE (primop1
) == BIT_NOT_EXPR
))
8387 if (TREE_CODE (primop0
) == BIT_NOT_EXPR
)
8388 primop0
= get_narrower (TREE_OPERAND (primop0
, 0),
8391 primop1
= get_narrower (TREE_OPERAND (primop1
, 0),
8394 if (host_integerp (primop0
, 0) || host_integerp (primop1
, 0))
8397 HOST_WIDE_INT constant
, mask
;
8398 int unsignedp
, bits
;
8400 if (host_integerp (primop0
, 0))
8403 unsignedp
= unsignedp1
;
8404 constant
= tree_low_cst (primop0
, 0);
8409 unsignedp
= unsignedp0
;
8410 constant
= tree_low_cst (primop1
, 0);
8413 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
8414 if (bits
< TYPE_PRECISION (result_type
)
8415 && bits
< HOST_BITS_PER_WIDE_INT
&& unsignedp
)
8417 mask
= (~(HOST_WIDE_INT
) 0) << bits
;
8418 if ((mask
& constant
) != mask
)
8419 warning (0, "comparison of promoted ~unsigned with constant");
8422 else if (unsignedp0
&& unsignedp1
8423 && (TYPE_PRECISION (TREE_TYPE (primop0
))
8424 < TYPE_PRECISION (result_type
))
8425 && (TYPE_PRECISION (TREE_TYPE (primop1
))
8426 < TYPE_PRECISION (result_type
)))
8427 warning (0, "comparison of promoted ~unsigned with unsigned");
8433 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
8434 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
8435 Then the expression will be built.
8436 It will be given type FINAL_TYPE if that is nonzero;
8437 otherwise, it will be given type RESULT_TYPE. */
8441 binary_op_error (code
, TREE_TYPE (op0
), TREE_TYPE (op1
));
8442 return error_mark_node
;
8447 if (TREE_TYPE (op0
) != result_type
)
8448 op0
= convert_and_check (result_type
, op0
);
8449 if (TREE_TYPE (op1
) != result_type
)
8450 op1
= convert_and_check (result_type
, op1
);
8452 /* This can happen if one operand has a vector type, and the other
8453 has a different type. */
8454 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
8455 return error_mark_node
;
8458 if (build_type
== NULL_TREE
)
8459 build_type
= result_type
;
8462 /* Treat expressions in initializers specially as they can't trap. */
8463 tree result
= require_constant_value
? fold_build2_initializer (resultcode
,
8466 : fold_build2 (resultcode
, build_type
,
8469 if (final_type
!= 0)
8470 result
= convert (final_type
, result
);
8476 /* Convert EXPR to be a truth-value, validating its type for this
8480 c_objc_common_truthvalue_conversion (tree expr
)
8482 switch (TREE_CODE (TREE_TYPE (expr
)))
8485 error ("used array that cannot be converted to pointer where scalar is required");
8486 return error_mark_node
;
8489 error ("used struct type value where scalar is required");
8490 return error_mark_node
;
8493 error ("used union type value where scalar is required");
8494 return error_mark_node
;
8503 /* ??? Should we also give an error for void and vectors rather than
8504 leaving those to give errors later? */
8505 return c_common_truthvalue_conversion (expr
);
8509 /* Convert EXPR to a contained DECL, updating *TC, *TI and *SE as
8513 c_expr_to_decl (tree expr
, bool *tc ATTRIBUTE_UNUSED
,
8514 bool *ti ATTRIBUTE_UNUSED
, bool *se
)
8516 if (TREE_CODE (expr
) == COMPOUND_LITERAL_EXPR
)
8518 tree decl
= COMPOUND_LITERAL_EXPR_DECL (expr
);
8519 /* Executing a compound literal inside a function reinitializes
8521 if (!TREE_STATIC (decl
))
8529 /* Like c_begin_compound_stmt, except force the retention of the BLOCK. */
8532 c_begin_omp_parallel (void)
8537 block
= c_begin_compound_stmt (true);
8543 c_finish_omp_parallel (tree clauses
, tree block
)
8547 block
= c_end_compound_stmt (block
, true);
8549 stmt
= make_node (OMP_PARALLEL
);
8550 TREE_TYPE (stmt
) = void_type_node
;
8551 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
8552 OMP_PARALLEL_BODY (stmt
) = block
;
8554 return add_stmt (stmt
);
8557 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
8558 Remove any elements from the list that are invalid. */
8561 c_finish_omp_clauses (tree clauses
)
8563 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
8564 tree c
, t
, *pc
= &clauses
;
8567 bitmap_obstack_initialize (NULL
);
8568 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
8569 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
8570 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
8572 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
8574 bool remove
= false;
8575 bool need_complete
= false;
8576 bool need_implicitly_determined
= false;
8578 switch (OMP_CLAUSE_CODE (c
))
8580 case OMP_CLAUSE_SHARED
:
8582 need_implicitly_determined
= true;
8583 goto check_dup_generic
;
8585 case OMP_CLAUSE_PRIVATE
:
8587 need_complete
= true;
8588 need_implicitly_determined
= true;
8589 goto check_dup_generic
;
8591 case OMP_CLAUSE_REDUCTION
:
8593 need_implicitly_determined
= true;
8594 t
= OMP_CLAUSE_DECL (c
);
8595 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
8596 || POINTER_TYPE_P (TREE_TYPE (t
)))
8598 error ("%qE has invalid type for %<reduction%>", t
);
8601 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
8603 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
8604 const char *r_name
= NULL
;
8621 case TRUTH_ANDIF_EXPR
:
8624 case TRUTH_ORIF_EXPR
:
8632 error ("%qE has invalid type for %<reduction(%s)%>",
8637 goto check_dup_generic
;
8639 case OMP_CLAUSE_COPYPRIVATE
:
8640 name
= "copyprivate";
8641 goto check_dup_generic
;
8643 case OMP_CLAUSE_COPYIN
:
8645 t
= OMP_CLAUSE_DECL (c
);
8646 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
8648 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
8651 goto check_dup_generic
;
8654 t
= OMP_CLAUSE_DECL (c
);
8655 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
8657 error ("%qE is not a variable in clause %qs", t
, name
);
8660 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
8661 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
8662 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
8664 error ("%qE appears more than once in data clauses", t
);
8668 bitmap_set_bit (&generic_head
, DECL_UID (t
));
8671 case OMP_CLAUSE_FIRSTPRIVATE
:
8672 name
= "firstprivate";
8673 t
= OMP_CLAUSE_DECL (c
);
8674 need_complete
= true;
8675 need_implicitly_determined
= true;
8676 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
8678 error ("%qE is not a variable in clause %<firstprivate%>", t
);
8681 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
8682 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
8684 error ("%qE appears more than once in data clauses", t
);
8688 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
8691 case OMP_CLAUSE_LASTPRIVATE
:
8692 name
= "lastprivate";
8693 t
= OMP_CLAUSE_DECL (c
);
8694 need_complete
= true;
8695 need_implicitly_determined
= true;
8696 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
8698 error ("%qE is not a variable in clause %<lastprivate%>", t
);
8701 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
8702 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
8704 error ("%qE appears more than once in data clauses", t
);
8708 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
8712 case OMP_CLAUSE_NUM_THREADS
:
8713 case OMP_CLAUSE_SCHEDULE
:
8714 case OMP_CLAUSE_NOWAIT
:
8715 case OMP_CLAUSE_ORDERED
:
8716 case OMP_CLAUSE_DEFAULT
:
8717 pc
= &OMP_CLAUSE_CHAIN (c
);
8726 t
= OMP_CLAUSE_DECL (c
);
8730 t
= require_complete_type (t
);
8731 if (t
== error_mark_node
)
8735 if (need_implicitly_determined
)
8737 const char *share_name
= NULL
;
8739 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
8740 share_name
= "threadprivate";
8741 else switch (c_omp_predetermined_sharing (t
))
8743 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
8745 case OMP_CLAUSE_DEFAULT_SHARED
:
8746 share_name
= "shared";
8748 case OMP_CLAUSE_DEFAULT_PRIVATE
:
8749 share_name
= "private";
8756 error ("%qE is predetermined %qs for %qs",
8757 t
, share_name
, name
);
8764 *pc
= OMP_CLAUSE_CHAIN (c
);
8766 pc
= &OMP_CLAUSE_CHAIN (c
);
8769 bitmap_obstack_release (NULL
);