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 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
23 /* This file is part of the C front end.
24 It contains routines to build C expressions given their operands,
25 including computing the types of the result, C-specific error checks,
26 and some optimization. */
30 #include "coretypes.h"
34 #include "langhooks.h"
44 #include "tree-iterator.h"
45 #include "tree-gimple.h"
46 #include "tree-flow.h"
48 /* Possible cases of implicit bad conversions. Used to select
49 diagnostic messages in convert_for_assignment. */
58 /* The level of nesting inside "__alignof__". */
61 /* The level of nesting inside "sizeof". */
64 /* The level of nesting inside "typeof". */
67 struct c_label_context_se
*label_context_stack_se
;
68 struct c_label_context_vm
*label_context_stack_vm
;
70 /* Nonzero if we've already printed a "missing braces around initializer"
71 message within this initializer. */
72 static int missing_braces_mentioned
;
74 static int require_constant_value
;
75 static int require_constant_elements
;
77 static tree
qualify_type (tree
, tree
);
78 static int tagged_types_tu_compatible_p (tree
, tree
);
79 static int comp_target_types (tree
, tree
, int);
80 static int function_types_compatible_p (tree
, tree
);
81 static int type_lists_compatible_p (tree
, tree
);
82 static tree
decl_constant_value_for_broken_optimization (tree
);
83 static tree
default_function_array_conversion (tree
);
84 static tree
lookup_field (tree
, tree
);
85 static tree
convert_arguments (tree
, tree
, tree
, tree
);
86 static tree
pointer_diff (tree
, tree
);
87 static tree
convert_for_assignment (tree
, tree
, enum impl_conv
, tree
, tree
,
89 static tree
valid_compound_expr_initializer (tree
, tree
);
90 static void push_string (const char *);
91 static void push_member_name (tree
);
92 static void push_array_bounds (int);
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
);
110 /* Do `exp = require_complete_type (exp);' to make sure exp
111 does not have an incomplete type. (That includes void types.) */
114 require_complete_type (tree value
)
116 tree type
= TREE_TYPE (value
);
118 if (value
== error_mark_node
|| type
== error_mark_node
)
119 return error_mark_node
;
121 /* First, detect a valid value with a complete type. */
122 if (COMPLETE_TYPE_P (type
))
125 c_incomplete_type_error (value
, type
);
126 return error_mark_node
;
129 /* Print an error message for invalid use of an incomplete type.
130 VALUE is the expression that was used (or 0 if that isn't known)
131 and TYPE is the type that was invalid. */
134 c_incomplete_type_error (tree value
, tree type
)
136 const char *type_code_string
;
138 /* Avoid duplicate error message. */
139 if (TREE_CODE (type
) == ERROR_MARK
)
142 if (value
!= 0 && (TREE_CODE (value
) == VAR_DECL
143 || TREE_CODE (value
) == PARM_DECL
))
144 error ("%qD has an incomplete type", value
);
148 /* We must print an error message. Be clever about what it says. */
150 switch (TREE_CODE (type
))
153 type_code_string
= "struct";
157 type_code_string
= "union";
161 type_code_string
= "enum";
165 error ("invalid use of void expression");
169 if (TYPE_DOMAIN (type
))
171 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL
)
173 error ("invalid use of flexible array member");
176 type
= TREE_TYPE (type
);
179 error ("invalid use of array with unspecified bounds");
186 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
187 error ("invalid use of undefined type %<%s %E%>",
188 type_code_string
, TYPE_NAME (type
));
190 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
191 error ("invalid use of incomplete typedef %qD", TYPE_NAME (type
));
195 /* Given a type, apply default promotions wrt unnamed function
196 arguments and return the new type. */
199 c_type_promotes_to (tree type
)
201 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
202 return double_type_node
;
204 if (c_promoting_integer_type_p (type
))
206 /* Preserve unsignedness if not really getting any wider. */
207 if (TYPE_UNSIGNED (type
)
208 && (TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
)))
209 return unsigned_type_node
;
210 return integer_type_node
;
216 /* Return a variant of TYPE which has all the type qualifiers of LIKE
217 as well as those of TYPE. */
220 qualify_type (tree type
, tree like
)
222 return c_build_qualified_type (type
,
223 TYPE_QUALS (type
) | TYPE_QUALS (like
));
226 /* Return the composite type of two compatible types.
228 We assume that comptypes has already been done and returned
229 nonzero; if that isn't so, this may crash. In particular, we
230 assume that qualifiers match. */
233 composite_type (tree t1
, tree t2
)
235 enum tree_code code1
;
236 enum tree_code code2
;
239 /* Save time if the two types are the same. */
241 if (t1
== t2
) return t1
;
243 /* If one type is nonsense, use the other. */
244 if (t1
== error_mark_node
)
246 if (t2
== error_mark_node
)
249 code1
= TREE_CODE (t1
);
250 code2
= TREE_CODE (t2
);
252 /* Merge the attributes. */
253 attributes
= targetm
.merge_type_attributes (t1
, t2
);
255 /* If one is an enumerated type and the other is the compatible
256 integer type, the composite type might be either of the two
257 (DR#013 question 3). For consistency, use the enumerated type as
258 the composite type. */
260 if (code1
== ENUMERAL_TYPE
&& code2
== INTEGER_TYPE
)
262 if (code2
== ENUMERAL_TYPE
&& code1
== INTEGER_TYPE
)
265 gcc_assert (code1
== code2
);
270 /* For two pointers, do this recursively on the target type. */
272 tree pointed_to_1
= TREE_TYPE (t1
);
273 tree pointed_to_2
= TREE_TYPE (t2
);
274 tree target
= composite_type (pointed_to_1
, pointed_to_2
);
275 t1
= build_pointer_type (target
);
276 t1
= build_type_attribute_variant (t1
, attributes
);
277 return qualify_type (t1
, t2
);
282 tree elt
= composite_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
286 /* We should not have any type quals on arrays at all. */
287 gcc_assert (!TYPE_QUALS (t1
) && !TYPE_QUALS (t2
));
289 /* Save space: see if the result is identical to one of the args. */
290 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
291 return build_type_attribute_variant (t1
, attributes
);
292 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
293 return build_type_attribute_variant (t2
, attributes
);
295 if (elt
== TREE_TYPE (t1
) && !TYPE_DOMAIN (t2
) && !TYPE_DOMAIN (t1
))
296 return build_type_attribute_variant (t1
, attributes
);
297 if (elt
== TREE_TYPE (t2
) && !TYPE_DOMAIN (t2
) && !TYPE_DOMAIN (t1
))
298 return build_type_attribute_variant (t2
, attributes
);
300 /* Merge the element types, and have a size if either arg has
301 one. We may have qualifiers on the element types. To set
302 up TYPE_MAIN_VARIANT correctly, we need to form the
303 composite of the unqualified types and add the qualifiers
305 quals
= TYPE_QUALS (strip_array_types (elt
));
306 unqual_elt
= c_build_qualified_type (elt
, TYPE_UNQUALIFIED
);
307 t1
= build_array_type (unqual_elt
,
308 TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
309 t1
= c_build_qualified_type (t1
, quals
);
310 return build_type_attribute_variant (t1
, attributes
);
314 /* Function types: prefer the one that specified arg types.
315 If both do, merge the arg types. Also merge the return types. */
317 tree valtype
= composite_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
318 tree p1
= TYPE_ARG_TYPES (t1
);
319 tree p2
= TYPE_ARG_TYPES (t2
);
324 /* Save space: see if the result is identical to one of the args. */
325 if (valtype
== TREE_TYPE (t1
) && !TYPE_ARG_TYPES (t2
))
326 return build_type_attribute_variant (t1
, attributes
);
327 if (valtype
== TREE_TYPE (t2
) && !TYPE_ARG_TYPES (t1
))
328 return build_type_attribute_variant (t2
, attributes
);
330 /* Simple way if one arg fails to specify argument types. */
331 if (TYPE_ARG_TYPES (t1
) == 0)
333 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t2
));
334 t1
= build_type_attribute_variant (t1
, attributes
);
335 return qualify_type (t1
, t2
);
337 if (TYPE_ARG_TYPES (t2
) == 0)
339 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t1
));
340 t1
= build_type_attribute_variant (t1
, attributes
);
341 return qualify_type (t1
, t2
);
344 /* If both args specify argument types, we must merge the two
345 lists, argument by argument. */
346 /* Tell global_bindings_p to return false so that variable_size
347 doesn't die on VLAs in parameter types. */
348 c_override_global_bindings_to_false
= true;
350 len
= list_length (p1
);
353 for (i
= 0; i
< len
; i
++)
354 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
359 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
))
361 /* A null type means arg type is not specified.
362 Take whatever the other function type has. */
363 if (TREE_VALUE (p1
) == 0)
365 TREE_VALUE (n
) = TREE_VALUE (p2
);
368 if (TREE_VALUE (p2
) == 0)
370 TREE_VALUE (n
) = TREE_VALUE (p1
);
374 /* Given wait (union {union wait *u; int *i} *)
375 and wait (union wait *),
376 prefer union wait * as type of parm. */
377 if (TREE_CODE (TREE_VALUE (p1
)) == UNION_TYPE
378 && TREE_VALUE (p1
) != TREE_VALUE (p2
))
381 tree mv2
= TREE_VALUE (p2
);
382 if (mv2
&& mv2
!= error_mark_node
383 && TREE_CODE (mv2
) != ARRAY_TYPE
)
384 mv2
= TYPE_MAIN_VARIANT (mv2
);
385 for (memb
= TYPE_FIELDS (TREE_VALUE (p1
));
386 memb
; memb
= TREE_CHAIN (memb
))
388 tree mv3
= TREE_TYPE (memb
);
389 if (mv3
&& mv3
!= error_mark_node
390 && TREE_CODE (mv3
) != ARRAY_TYPE
)
391 mv3
= TYPE_MAIN_VARIANT (mv3
);
392 if (comptypes (mv3
, mv2
))
394 TREE_VALUE (n
) = composite_type (TREE_TYPE (memb
),
397 pedwarn ("function types not truly compatible in ISO C");
402 if (TREE_CODE (TREE_VALUE (p2
)) == UNION_TYPE
403 && TREE_VALUE (p2
) != TREE_VALUE (p1
))
406 tree mv1
= TREE_VALUE (p1
);
407 if (mv1
&& mv1
!= error_mark_node
408 && TREE_CODE (mv1
) != ARRAY_TYPE
)
409 mv1
= TYPE_MAIN_VARIANT (mv1
);
410 for (memb
= TYPE_FIELDS (TREE_VALUE (p2
));
411 memb
; memb
= TREE_CHAIN (memb
))
413 tree mv3
= TREE_TYPE (memb
);
414 if (mv3
&& mv3
!= error_mark_node
415 && TREE_CODE (mv3
) != ARRAY_TYPE
)
416 mv3
= TYPE_MAIN_VARIANT (mv3
);
417 if (comptypes (mv3
, mv1
))
419 TREE_VALUE (n
) = composite_type (TREE_TYPE (memb
),
422 pedwarn ("function types not truly compatible in ISO C");
427 TREE_VALUE (n
) = composite_type (TREE_VALUE (p1
), TREE_VALUE (p2
));
431 c_override_global_bindings_to_false
= false;
432 t1
= build_function_type (valtype
, newargs
);
433 t1
= qualify_type (t1
, t2
);
434 /* ... falls through ... */
438 return build_type_attribute_variant (t1
, attributes
);
443 /* Return the type of a conditional expression between pointers to
444 possibly differently qualified versions of compatible types.
446 We assume that comp_target_types has already been done and returned
447 nonzero; if that isn't so, this may crash. */
450 common_pointer_type (tree t1
, tree t2
)
453 tree pointed_to_1
, mv1
;
454 tree pointed_to_2
, mv2
;
457 /* Save time if the two types are the same. */
459 if (t1
== t2
) return t1
;
461 /* If one type is nonsense, use the other. */
462 if (t1
== error_mark_node
)
464 if (t2
== error_mark_node
)
467 gcc_assert (TREE_CODE (t1
) == POINTER_TYPE
468 && TREE_CODE (t2
) == POINTER_TYPE
);
470 /* Merge the attributes. */
471 attributes
= targetm
.merge_type_attributes (t1
, t2
);
473 /* Find the composite type of the target types, and combine the
474 qualifiers of the two types' targets. Do not lose qualifiers on
475 array element types by taking the TYPE_MAIN_VARIANT. */
476 mv1
= pointed_to_1
= TREE_TYPE (t1
);
477 mv2
= pointed_to_2
= TREE_TYPE (t2
);
478 if (TREE_CODE (mv1
) != ARRAY_TYPE
)
479 mv1
= TYPE_MAIN_VARIANT (pointed_to_1
);
480 if (TREE_CODE (mv2
) != ARRAY_TYPE
)
481 mv2
= TYPE_MAIN_VARIANT (pointed_to_2
);
482 target
= composite_type (mv1
, mv2
);
483 t1
= build_pointer_type (c_build_qualified_type
485 TYPE_QUALS (pointed_to_1
) |
486 TYPE_QUALS (pointed_to_2
)));
487 return build_type_attribute_variant (t1
, attributes
);
490 /* Return the common type for two arithmetic types under the usual
491 arithmetic conversions. The default conversions have already been
492 applied, and enumerated types converted to their compatible integer
493 types. The resulting type is unqualified and has no attributes.
495 This is the type for the result of most arithmetic operations
496 if the operands have the given two types. */
499 c_common_type (tree t1
, tree t2
)
501 enum tree_code code1
;
502 enum tree_code code2
;
504 /* If one type is nonsense, use the other. */
505 if (t1
== error_mark_node
)
507 if (t2
== error_mark_node
)
510 if (TYPE_QUALS (t1
) != TYPE_UNQUALIFIED
)
511 t1
= TYPE_MAIN_VARIANT (t1
);
513 if (TYPE_QUALS (t2
) != TYPE_UNQUALIFIED
)
514 t2
= TYPE_MAIN_VARIANT (t2
);
516 if (TYPE_ATTRIBUTES (t1
) != NULL_TREE
)
517 t1
= build_type_attribute_variant (t1
, NULL_TREE
);
519 if (TYPE_ATTRIBUTES (t2
) != NULL_TREE
)
520 t2
= build_type_attribute_variant (t2
, NULL_TREE
);
522 /* Save time if the two types are the same. */
524 if (t1
== t2
) return t1
;
526 code1
= TREE_CODE (t1
);
527 code2
= TREE_CODE (t2
);
529 gcc_assert (code1
== VECTOR_TYPE
|| code1
== COMPLEX_TYPE
530 || code1
== REAL_TYPE
|| code1
== INTEGER_TYPE
);
531 gcc_assert (code2
== VECTOR_TYPE
|| code2
== COMPLEX_TYPE
532 || code2
== REAL_TYPE
|| code2
== INTEGER_TYPE
);
534 /* If one type is a vector type, return that type. (How the usual
535 arithmetic conversions apply to the vector types extension is not
536 precisely specified.) */
537 if (code1
== VECTOR_TYPE
)
540 if (code2
== VECTOR_TYPE
)
543 /* If one type is complex, form the common type of the non-complex
544 components, then make that complex. Use T1 or T2 if it is the
546 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
548 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
549 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
550 tree subtype
= c_common_type (subtype1
, subtype2
);
552 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
554 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
557 return build_complex_type (subtype
);
560 /* If only one is real, use it as the result. */
562 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
565 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
568 /* Both real or both integers; use the one with greater precision. */
570 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
572 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
575 /* Same precision. Prefer long longs to longs to ints when the
576 same precision, following the C99 rules on integer type rank
577 (which are equivalent to the C90 rules for C90 types). */
579 if (TYPE_MAIN_VARIANT (t1
) == long_long_unsigned_type_node
580 || TYPE_MAIN_VARIANT (t2
) == long_long_unsigned_type_node
)
581 return long_long_unsigned_type_node
;
583 if (TYPE_MAIN_VARIANT (t1
) == long_long_integer_type_node
584 || TYPE_MAIN_VARIANT (t2
) == long_long_integer_type_node
)
586 if (TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
587 return long_long_unsigned_type_node
;
589 return long_long_integer_type_node
;
592 if (TYPE_MAIN_VARIANT (t1
) == long_unsigned_type_node
593 || TYPE_MAIN_VARIANT (t2
) == long_unsigned_type_node
)
594 return long_unsigned_type_node
;
596 if (TYPE_MAIN_VARIANT (t1
) == long_integer_type_node
597 || TYPE_MAIN_VARIANT (t2
) == long_integer_type_node
)
599 /* But preserve unsignedness from the other type,
600 since long cannot hold all the values of an unsigned int. */
601 if (TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
602 return long_unsigned_type_node
;
604 return long_integer_type_node
;
607 /* Likewise, prefer long double to double even if same size. */
608 if (TYPE_MAIN_VARIANT (t1
) == long_double_type_node
609 || TYPE_MAIN_VARIANT (t2
) == long_double_type_node
)
610 return long_double_type_node
;
612 /* Otherwise prefer the unsigned one. */
614 if (TYPE_UNSIGNED (t1
))
620 /* Wrapper around c_common_type that is used by c-common.c. ENUMERAL_TYPEs
621 are allowed here and are converted to their compatible integer types. */
623 common_type (tree t1
, tree t2
)
625 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
626 t1
= c_common_type_for_size (TYPE_PRECISION (t1
), 1);
627 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
628 t2
= c_common_type_for_size (TYPE_PRECISION (t2
), 1);
629 return c_common_type (t1
, t2
);
632 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
633 or various other operations. Return 2 if they are compatible
634 but a warning may be needed if you use them together. */
637 comptypes (tree type1
, tree type2
)
643 /* Suppress errors caused by previously reported errors. */
645 if (t1
== t2
|| !t1
|| !t2
646 || TREE_CODE (t1
) == ERROR_MARK
|| TREE_CODE (t2
) == ERROR_MARK
)
649 /* If either type is the internal version of sizetype, return the
651 if (TREE_CODE (t1
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t1
)
652 && TYPE_ORIG_SIZE_TYPE (t1
))
653 t1
= TYPE_ORIG_SIZE_TYPE (t1
);
655 if (TREE_CODE (t2
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t2
)
656 && TYPE_ORIG_SIZE_TYPE (t2
))
657 t2
= TYPE_ORIG_SIZE_TYPE (t2
);
660 /* Enumerated types are compatible with integer types, but this is
661 not transitive: two enumerated types in the same translation unit
662 are compatible with each other only if they are the same type. */
664 if (TREE_CODE (t1
) == ENUMERAL_TYPE
&& TREE_CODE (t2
) != ENUMERAL_TYPE
)
665 t1
= c_common_type_for_size (TYPE_PRECISION (t1
), TYPE_UNSIGNED (t1
));
666 else if (TREE_CODE (t2
) == ENUMERAL_TYPE
&& TREE_CODE (t1
) != ENUMERAL_TYPE
)
667 t2
= c_common_type_for_size (TYPE_PRECISION (t2
), TYPE_UNSIGNED (t2
));
672 /* Different classes of types can't be compatible. */
674 if (TREE_CODE (t1
) != TREE_CODE (t2
))
677 /* Qualifiers must match. C99 6.7.3p9 */
679 if (TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
682 /* Allow for two different type nodes which have essentially the same
683 definition. Note that we already checked for equality of the type
684 qualifiers (just above). */
686 if (TREE_CODE (t1
) != ARRAY_TYPE
687 && TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
690 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
691 if (!(attrval
= targetm
.comp_type_attributes (t1
, t2
)))
694 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
697 switch (TREE_CODE (t1
))
700 /* We must give ObjC the first crack at comparing pointers, since
701 protocol qualifiers may be involved. */
702 if (c_dialect_objc () && (val
= objc_comptypes (t1
, t2
, 0)) >= 0)
704 /* Do not remove mode or aliasing information. */
705 if (TYPE_MODE (t1
) != TYPE_MODE (t2
)
706 || TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
))
708 val
= (TREE_TYPE (t1
) == TREE_TYPE (t2
)
709 ? 1 : comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
)));
713 val
= function_types_compatible_p (t1
, t2
);
718 tree d1
= TYPE_DOMAIN (t1
);
719 tree d2
= TYPE_DOMAIN (t2
);
720 bool d1_variable
, d2_variable
;
721 bool d1_zero
, d2_zero
;
724 /* Target types must match incl. qualifiers. */
725 if (TREE_TYPE (t1
) != TREE_TYPE (t2
)
726 && 0 == (val
= comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
))))
729 /* Sizes must match unless one is missing or variable. */
730 if (d1
== 0 || d2
== 0 || d1
== d2
)
733 d1_zero
= !TYPE_MAX_VALUE (d1
);
734 d2_zero
= !TYPE_MAX_VALUE (d2
);
736 d1_variable
= (!d1_zero
737 && (TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
738 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
));
739 d2_variable
= (!d2_zero
740 && (TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
741 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
));
743 if (d1_variable
|| d2_variable
)
745 if (d1_zero
&& d2_zero
)
747 if (d1_zero
|| d2_zero
748 || !tree_int_cst_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
))
749 || !tree_int_cst_equal (TYPE_MAX_VALUE (d1
), TYPE_MAX_VALUE (d2
)))
756 /* We are dealing with two distinct structs. In assorted Objective-C
757 corner cases, however, these can still be deemed equivalent. */
758 if (c_dialect_objc () && objc_comptypes (t1
, t2
, 0) == 1)
763 if (val
!= 1 && !same_translation_unit_p (t1
, t2
))
764 val
= tagged_types_tu_compatible_p (t1
, t2
);
768 val
= TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
769 && comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
));
775 return attrval
== 2 && val
== 1 ? 2 : val
;
778 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
779 ignoring their qualifiers. REFLEXIVE is only used by ObjC - set it
780 to 1 or 0 depending if the check of the pointer types is meant to
781 be reflexive or not (typically, assignments are not reflexive,
782 while comparisons are reflexive).
786 comp_target_types (tree ttl
, tree ttr
, int reflexive
)
791 /* Give objc_comptypes a crack at letting these types through. */
792 if ((val
= objc_comptypes (ttl
, ttr
, reflexive
)) >= 0)
795 /* Do not lose qualifiers on element types of array types that are
796 pointer targets by taking their TYPE_MAIN_VARIANT. */
797 mvl
= TREE_TYPE (ttl
);
798 mvr
= TREE_TYPE (ttr
);
799 if (TREE_CODE (mvl
) != ARRAY_TYPE
)
800 mvl
= TYPE_MAIN_VARIANT (mvl
);
801 if (TREE_CODE (mvr
) != ARRAY_TYPE
)
802 mvr
= TYPE_MAIN_VARIANT (mvr
);
803 val
= comptypes (mvl
, mvr
);
805 if (val
== 2 && pedantic
)
806 pedwarn ("types are not quite compatible");
810 /* Subroutines of `comptypes'. */
812 /* Determine whether two trees derive from the same translation unit.
813 If the CONTEXT chain ends in a null, that tree's context is still
814 being parsed, so if two trees have context chains ending in null,
815 they're in the same translation unit. */
817 same_translation_unit_p (tree t1
, tree t2
)
819 while (t1
&& TREE_CODE (t1
) != TRANSLATION_UNIT_DECL
)
820 switch (TREE_CODE_CLASS (TREE_CODE (t1
)))
822 case tcc_declaration
:
823 t1
= DECL_CONTEXT (t1
); break;
825 t1
= TYPE_CONTEXT (t1
); break;
826 case tcc_exceptional
:
827 t1
= BLOCK_SUPERCONTEXT (t1
); break; /* assume block */
828 default: gcc_unreachable ();
831 while (t2
&& TREE_CODE (t2
) != TRANSLATION_UNIT_DECL
)
832 switch (TREE_CODE_CLASS (TREE_CODE (t2
)))
834 case tcc_declaration
:
835 t2
= DECL_CONTEXT (t2
); break;
837 t2
= TYPE_CONTEXT (t2
); break;
838 case tcc_exceptional
:
839 t2
= BLOCK_SUPERCONTEXT (t2
); break; /* assume block */
840 default: gcc_unreachable ();
846 /* The C standard says that two structures in different translation
847 units are compatible with each other only if the types of their
848 fields are compatible (among other things). So, consider two copies
849 of this structure: */
851 struct tagged_tu_seen
{
852 const struct tagged_tu_seen
* next
;
857 /* Can they be compatible with each other? We choose to break the
858 recursion by allowing those types to be compatible. */
860 static const struct tagged_tu_seen
* tagged_tu_seen_base
;
862 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
863 compatible. If the two types are not the same (which has been
864 checked earlier), this can only happen when multiple translation
865 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
869 tagged_types_tu_compatible_p (tree t1
, tree t2
)
872 bool needs_warning
= false;
874 /* We have to verify that the tags of the types are the same. This
875 is harder than it looks because this may be a typedef, so we have
876 to go look at the original type. It may even be a typedef of a
878 In the case of compiler-created builtin structs the TYPE_DECL
879 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
880 while (TYPE_NAME (t1
)
881 && TREE_CODE (TYPE_NAME (t1
)) == TYPE_DECL
882 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1
)))
883 t1
= DECL_ORIGINAL_TYPE (TYPE_NAME (t1
));
885 while (TYPE_NAME (t2
)
886 && TREE_CODE (TYPE_NAME (t2
)) == TYPE_DECL
887 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2
)))
888 t2
= DECL_ORIGINAL_TYPE (TYPE_NAME (t2
));
890 /* C90 didn't have the requirement that the two tags be the same. */
891 if (flag_isoc99
&& TYPE_NAME (t1
) != TYPE_NAME (t2
))
894 /* C90 didn't say what happened if one or both of the types were
895 incomplete; we choose to follow C99 rules here, which is that they
897 if (TYPE_SIZE (t1
) == NULL
898 || TYPE_SIZE (t2
) == NULL
)
902 const struct tagged_tu_seen
* tts_i
;
903 for (tts_i
= tagged_tu_seen_base
; tts_i
!= NULL
; tts_i
= tts_i
->next
)
904 if (tts_i
->t1
== t1
&& tts_i
->t2
== t2
)
908 switch (TREE_CODE (t1
))
913 /* Speed up the case where the type values are in the same order. */
914 tree tv1
= TYPE_VALUES (t1
);
915 tree tv2
= TYPE_VALUES (t2
);
920 for (;tv1
&& tv2
; tv1
= TREE_CHAIN (tv1
), tv2
= TREE_CHAIN (tv2
))
922 if (TREE_PURPOSE (tv1
) != TREE_PURPOSE (tv2
))
924 if (simple_cst_equal (TREE_VALUE (tv1
), TREE_VALUE (tv2
)) != 1)
928 if (tv1
== NULL_TREE
&& tv2
== NULL_TREE
)
930 if (tv1
== NULL_TREE
|| tv2
== NULL_TREE
)
933 if (list_length (TYPE_VALUES (t1
)) != list_length (TYPE_VALUES (t2
)))
936 for (s1
= TYPE_VALUES (t1
); s1
; s1
= TREE_CHAIN (s1
))
938 s2
= purpose_member (TREE_PURPOSE (s1
), TYPE_VALUES (t2
));
940 || simple_cst_equal (TREE_VALUE (s1
), TREE_VALUE (s2
)) != 1)
948 if (list_length (TYPE_FIELDS (t1
)) != list_length (TYPE_FIELDS (t2
)))
951 for (s1
= TYPE_FIELDS (t1
); s1
; s1
= TREE_CHAIN (s1
))
954 struct tagged_tu_seen tts
;
956 tts
.next
= tagged_tu_seen_base
;
959 tagged_tu_seen_base
= &tts
;
961 if (DECL_NAME (s1
) != NULL
)
962 for (s2
= TYPE_FIELDS (t2
); s2
; s2
= TREE_CHAIN (s2
))
963 if (DECL_NAME (s1
) == DECL_NAME (s2
))
966 result
= comptypes (TREE_TYPE (s1
), TREE_TYPE (s2
));
970 needs_warning
= true;
972 if (TREE_CODE (s1
) == FIELD_DECL
973 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
974 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
980 tagged_tu_seen_base
= tts
.next
;
984 return needs_warning
? 2 : 1;
989 struct tagged_tu_seen tts
;
991 tts
.next
= tagged_tu_seen_base
;
994 tagged_tu_seen_base
= &tts
;
996 for (s1
= TYPE_FIELDS (t1
), s2
= TYPE_FIELDS (t2
);
998 s1
= TREE_CHAIN (s1
), s2
= TREE_CHAIN (s2
))
1001 if (TREE_CODE (s1
) != TREE_CODE (s2
)
1002 || DECL_NAME (s1
) != DECL_NAME (s2
))
1004 result
= comptypes (TREE_TYPE (s1
), TREE_TYPE (s2
));
1008 needs_warning
= true;
1010 if (TREE_CODE (s1
) == FIELD_DECL
1011 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
1012 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
1015 tagged_tu_seen_base
= tts
.next
;
1018 return needs_warning
? 2 : 1;
1026 /* Return 1 if two function types F1 and F2 are compatible.
1027 If either type specifies no argument types,
1028 the other must specify a fixed number of self-promoting arg types.
1029 Otherwise, if one type specifies only the number of arguments,
1030 the other must specify that number of self-promoting arg types.
1031 Otherwise, the argument types must match. */
1034 function_types_compatible_p (tree f1
, tree f2
)
1037 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1042 ret1
= TREE_TYPE (f1
);
1043 ret2
= TREE_TYPE (f2
);
1045 /* 'volatile' qualifiers on a function's return type used to mean
1046 the function is noreturn. */
1047 if (TYPE_VOLATILE (ret1
) != TYPE_VOLATILE (ret2
))
1048 pedwarn ("function return types not compatible due to %<volatile%>");
1049 if (TYPE_VOLATILE (ret1
))
1050 ret1
= build_qualified_type (TYPE_MAIN_VARIANT (ret1
),
1051 TYPE_QUALS (ret1
) & ~TYPE_QUAL_VOLATILE
);
1052 if (TYPE_VOLATILE (ret2
))
1053 ret2
= build_qualified_type (TYPE_MAIN_VARIANT (ret2
),
1054 TYPE_QUALS (ret2
) & ~TYPE_QUAL_VOLATILE
);
1055 val
= comptypes (ret1
, ret2
);
1059 args1
= TYPE_ARG_TYPES (f1
);
1060 args2
= TYPE_ARG_TYPES (f2
);
1062 /* An unspecified parmlist matches any specified parmlist
1063 whose argument types don't need default promotions. */
1067 if (!self_promoting_args_p (args2
))
1069 /* If one of these types comes from a non-prototype fn definition,
1070 compare that with the other type's arglist.
1071 If they don't match, ask for a warning (0, but no error). */
1072 if (TYPE_ACTUAL_ARG_TYPES (f1
)
1073 && 1 != type_lists_compatible_p (args2
, TYPE_ACTUAL_ARG_TYPES (f1
)))
1079 if (!self_promoting_args_p (args1
))
1081 if (TYPE_ACTUAL_ARG_TYPES (f2
)
1082 && 1 != type_lists_compatible_p (args1
, TYPE_ACTUAL_ARG_TYPES (f2
)))
1087 /* Both types have argument lists: compare them and propagate results. */
1088 val1
= type_lists_compatible_p (args1
, args2
);
1089 return val1
!= 1 ? val1
: val
;
1092 /* Check two lists of types for compatibility,
1093 returning 0 for incompatible, 1 for compatible,
1094 or 2 for compatible with warning. */
1097 type_lists_compatible_p (tree args1
, tree args2
)
1099 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1105 tree a1
, mv1
, a2
, mv2
;
1106 if (args1
== 0 && args2
== 0)
1108 /* If one list is shorter than the other,
1109 they fail to match. */
1110 if (args1
== 0 || args2
== 0)
1112 mv1
= a1
= TREE_VALUE (args1
);
1113 mv2
= a2
= TREE_VALUE (args2
);
1114 if (mv1
&& mv1
!= error_mark_node
&& TREE_CODE (mv1
) != ARRAY_TYPE
)
1115 mv1
= TYPE_MAIN_VARIANT (mv1
);
1116 if (mv2
&& mv2
!= error_mark_node
&& TREE_CODE (mv2
) != ARRAY_TYPE
)
1117 mv2
= TYPE_MAIN_VARIANT (mv2
);
1118 /* A null pointer instead of a type
1119 means there is supposed to be an argument
1120 but nothing is specified about what type it has.
1121 So match anything that self-promotes. */
1124 if (c_type_promotes_to (a2
) != a2
)
1129 if (c_type_promotes_to (a1
) != a1
)
1132 /* If one of the lists has an error marker, ignore this arg. */
1133 else if (TREE_CODE (a1
) == ERROR_MARK
1134 || TREE_CODE (a2
) == ERROR_MARK
)
1136 else if (!(newval
= comptypes (mv1
, mv2
)))
1138 /* Allow wait (union {union wait *u; int *i} *)
1139 and wait (union wait *) to be compatible. */
1140 if (TREE_CODE (a1
) == UNION_TYPE
1141 && (TYPE_NAME (a1
) == 0
1142 || TYPE_TRANSPARENT_UNION (a1
))
1143 && TREE_CODE (TYPE_SIZE (a1
)) == INTEGER_CST
1144 && tree_int_cst_equal (TYPE_SIZE (a1
),
1148 for (memb
= TYPE_FIELDS (a1
);
1149 memb
; memb
= TREE_CHAIN (memb
))
1151 tree mv3
= TREE_TYPE (memb
);
1152 if (mv3
&& mv3
!= error_mark_node
1153 && TREE_CODE (mv3
) != ARRAY_TYPE
)
1154 mv3
= TYPE_MAIN_VARIANT (mv3
);
1155 if (comptypes (mv3
, mv2
))
1161 else if (TREE_CODE (a2
) == UNION_TYPE
1162 && (TYPE_NAME (a2
) == 0
1163 || TYPE_TRANSPARENT_UNION (a2
))
1164 && TREE_CODE (TYPE_SIZE (a2
)) == INTEGER_CST
1165 && tree_int_cst_equal (TYPE_SIZE (a2
),
1169 for (memb
= TYPE_FIELDS (a2
);
1170 memb
; memb
= TREE_CHAIN (memb
))
1172 tree mv3
= TREE_TYPE (memb
);
1173 if (mv3
&& mv3
!= error_mark_node
1174 && TREE_CODE (mv3
) != ARRAY_TYPE
)
1175 mv3
= TYPE_MAIN_VARIANT (mv3
);
1176 if (comptypes (mv3
, mv1
))
1186 /* comptypes said ok, but record if it said to warn. */
1190 args1
= TREE_CHAIN (args1
);
1191 args2
= TREE_CHAIN (args2
);
1195 /* Compute the size to increment a pointer by. */
1198 c_size_in_bytes (tree type
)
1200 enum tree_code code
= TREE_CODE (type
);
1202 if (code
== FUNCTION_TYPE
|| code
== VOID_TYPE
|| code
== ERROR_MARK
)
1203 return size_one_node
;
1205 if (!COMPLETE_OR_VOID_TYPE_P (type
))
1207 error ("arithmetic on pointer to an incomplete type");
1208 return size_one_node
;
1211 /* Convert in case a char is more than one unit. */
1212 return size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
1213 size_int (TYPE_PRECISION (char_type_node
)
1217 /* Return either DECL or its known constant value (if it has one). */
1220 decl_constant_value (tree decl
)
1222 if (/* Don't change a variable array bound or initial value to a constant
1223 in a place where a variable is invalid. Note that DECL_INITIAL
1224 isn't valid for a PARM_DECL. */
1225 current_function_decl
!= 0
1226 && TREE_CODE (decl
) != PARM_DECL
1227 && !TREE_THIS_VOLATILE (decl
)
1228 && TREE_READONLY (decl
)
1229 && DECL_INITIAL (decl
) != 0
1230 && TREE_CODE (DECL_INITIAL (decl
)) != ERROR_MARK
1231 /* This is invalid if initial value is not constant.
1232 If it has either a function call, a memory reference,
1233 or a variable, then re-evaluating it could give different results. */
1234 && TREE_CONSTANT (DECL_INITIAL (decl
))
1235 /* Check for cases where this is sub-optimal, even though valid. */
1236 && TREE_CODE (DECL_INITIAL (decl
)) != CONSTRUCTOR
)
1237 return DECL_INITIAL (decl
);
1241 /* Return either DECL or its known constant value (if it has one), but
1242 return DECL if pedantic or DECL has mode BLKmode. This is for
1243 bug-compatibility with the old behavior of decl_constant_value
1244 (before GCC 3.0); every use of this function is a bug and it should
1245 be removed before GCC 3.1. It is not appropriate to use pedantic
1246 in a way that affects optimization, and BLKmode is probably not the
1247 right test for avoiding misoptimizations either. */
1250 decl_constant_value_for_broken_optimization (tree decl
)
1252 if (pedantic
|| DECL_MODE (decl
) == BLKmode
)
1255 return decl_constant_value (decl
);
1259 /* Perform the default conversion of arrays and functions to pointers.
1260 Return the result of converting EXP. For any other expression, just
1264 default_function_array_conversion (tree exp
)
1267 tree type
= TREE_TYPE (exp
);
1268 enum tree_code code
= TREE_CODE (type
);
1271 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
1274 Do not use STRIP_NOPS here! It will remove conversions from pointer
1275 to integer and cause infinite recursion. */
1277 while (TREE_CODE (exp
) == NON_LVALUE_EXPR
1278 || (TREE_CODE (exp
) == NOP_EXPR
1279 && TREE_TYPE (TREE_OPERAND (exp
, 0)) == TREE_TYPE (exp
)))
1281 if (TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1283 exp
= TREE_OPERAND (exp
, 0);
1286 if (TREE_NO_WARNING (orig_exp
))
1287 TREE_NO_WARNING (exp
) = 1;
1289 if (code
== FUNCTION_TYPE
)
1291 return build_unary_op (ADDR_EXPR
, exp
, 0);
1293 if (code
== ARRAY_TYPE
)
1296 tree restype
= TREE_TYPE (type
);
1302 if (REFERENCE_CLASS_P (exp
) || DECL_P (exp
))
1304 constp
= TREE_READONLY (exp
);
1305 volatilep
= TREE_THIS_VOLATILE (exp
);
1308 if (TYPE_QUALS (type
) || constp
|| volatilep
)
1310 = c_build_qualified_type (restype
,
1312 | (constp
* TYPE_QUAL_CONST
)
1313 | (volatilep
* TYPE_QUAL_VOLATILE
));
1315 if (TREE_CODE (exp
) == INDIRECT_REF
)
1316 return convert (build_pointer_type (restype
),
1317 TREE_OPERAND (exp
, 0));
1319 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1321 tree op1
= default_conversion (TREE_OPERAND (exp
, 1));
1322 return build2 (COMPOUND_EXPR
, TREE_TYPE (op1
),
1323 TREE_OPERAND (exp
, 0), op1
);
1326 lvalue_array_p
= !not_lvalue
&& lvalue_p (exp
);
1327 if (!flag_isoc99
&& !lvalue_array_p
)
1329 /* Before C99, non-lvalue arrays do not decay to pointers.
1330 Normally, using such an array would be invalid; but it can
1331 be used correctly inside sizeof or as a statement expression.
1332 Thus, do not give an error here; an error will result later. */
1336 ptrtype
= build_pointer_type (restype
);
1338 if (TREE_CODE (exp
) == VAR_DECL
)
1340 /* We are making an ADDR_EXPR of ptrtype. This is a valid
1341 ADDR_EXPR because it's the best way of representing what
1342 happens in C when we take the address of an array and place
1343 it in a pointer to the element type. */
1344 adr
= build1 (ADDR_EXPR
, ptrtype
, exp
);
1345 if (!c_mark_addressable (exp
))
1346 return error_mark_node
;
1347 TREE_SIDE_EFFECTS (adr
) = 0; /* Default would be, same as EXP. */
1350 /* This way is better for a COMPONENT_REF since it can
1351 simplify the offset for a component. */
1352 adr
= build_unary_op (ADDR_EXPR
, exp
, 1);
1353 return convert (ptrtype
, adr
);
1359 /* EXP is an expression of integer type. Apply the integer promotions
1360 to it and return the promoted value. */
1363 perform_integral_promotions (tree exp
)
1365 tree type
= TREE_TYPE (exp
);
1366 enum tree_code code
= TREE_CODE (type
);
1368 gcc_assert (INTEGRAL_TYPE_P (type
));
1370 /* Normally convert enums to int,
1371 but convert wide enums to something wider. */
1372 if (code
== ENUMERAL_TYPE
)
1374 type
= c_common_type_for_size (MAX (TYPE_PRECISION (type
),
1375 TYPE_PRECISION (integer_type_node
)),
1376 ((TYPE_PRECISION (type
)
1377 >= TYPE_PRECISION (integer_type_node
))
1378 && TYPE_UNSIGNED (type
)));
1380 return convert (type
, exp
);
1383 /* ??? This should no longer be needed now bit-fields have their
1385 if (TREE_CODE (exp
) == COMPONENT_REF
1386 && DECL_C_BIT_FIELD (TREE_OPERAND (exp
, 1))
1387 /* If it's thinner than an int, promote it like a
1388 c_promoting_integer_type_p, otherwise leave it alone. */
1389 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp
, 1)),
1390 TYPE_PRECISION (integer_type_node
)))
1391 return convert (integer_type_node
, exp
);
1393 if (c_promoting_integer_type_p (type
))
1395 /* Preserve unsignedness if not really getting any wider. */
1396 if (TYPE_UNSIGNED (type
)
1397 && TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
))
1398 return convert (unsigned_type_node
, exp
);
1400 return convert (integer_type_node
, exp
);
1407 /* Perform default promotions for C data used in expressions.
1408 Arrays and functions are converted to pointers;
1409 enumeral types or short or char, to int.
1410 In addition, manifest constants symbols are replaced by their values. */
1413 default_conversion (tree exp
)
1416 tree type
= TREE_TYPE (exp
);
1417 enum tree_code code
= TREE_CODE (type
);
1419 if (code
== FUNCTION_TYPE
|| code
== ARRAY_TYPE
)
1420 return default_function_array_conversion (exp
);
1422 /* Constants can be used directly unless they're not loadable. */
1423 if (TREE_CODE (exp
) == CONST_DECL
)
1424 exp
= DECL_INITIAL (exp
);
1426 /* Replace a nonvolatile const static variable with its value unless
1427 it is an array, in which case we must be sure that taking the
1428 address of the array produces consistent results. */
1429 else if (optimize
&& TREE_CODE (exp
) == VAR_DECL
&& code
!= ARRAY_TYPE
)
1431 exp
= decl_constant_value_for_broken_optimization (exp
);
1432 type
= TREE_TYPE (exp
);
1435 /* Strip no-op conversions. */
1437 STRIP_TYPE_NOPS (exp
);
1439 if (TREE_NO_WARNING (orig_exp
))
1440 TREE_NO_WARNING (exp
) = 1;
1442 if (INTEGRAL_TYPE_P (type
))
1443 return perform_integral_promotions (exp
);
1445 if (code
== VOID_TYPE
)
1447 error ("void value not ignored as it ought to be");
1448 return error_mark_node
;
1453 /* Look up COMPONENT in a structure or union DECL.
1455 If the component name is not found, returns NULL_TREE. Otherwise,
1456 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1457 stepping down the chain to the component, which is in the last
1458 TREE_VALUE of the list. Normally the list is of length one, but if
1459 the component is embedded within (nested) anonymous structures or
1460 unions, the list steps down the chain to the component. */
1463 lookup_field (tree decl
, tree component
)
1465 tree type
= TREE_TYPE (decl
);
1468 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1469 to the field elements. Use a binary search on this array to quickly
1470 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1471 will always be set for structures which have many elements. */
1473 if (TYPE_LANG_SPECIFIC (type
) && TYPE_LANG_SPECIFIC (type
)->s
)
1476 tree
*field_array
= &TYPE_LANG_SPECIFIC (type
)->s
->elts
[0];
1478 field
= TYPE_FIELDS (type
);
1480 top
= TYPE_LANG_SPECIFIC (type
)->s
->len
;
1481 while (top
- bot
> 1)
1483 half
= (top
- bot
+ 1) >> 1;
1484 field
= field_array
[bot
+half
];
1486 if (DECL_NAME (field
) == NULL_TREE
)
1488 /* Step through all anon unions in linear fashion. */
1489 while (DECL_NAME (field_array
[bot
]) == NULL_TREE
)
1491 field
= field_array
[bot
++];
1492 if (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
1493 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
1495 tree anon
= lookup_field (field
, component
);
1498 return tree_cons (NULL_TREE
, field
, anon
);
1502 /* Entire record is only anon unions. */
1506 /* Restart the binary search, with new lower bound. */
1510 if (DECL_NAME (field
) == component
)
1512 if (DECL_NAME (field
) < component
)
1518 if (DECL_NAME (field_array
[bot
]) == component
)
1519 field
= field_array
[bot
];
1520 else if (DECL_NAME (field
) != component
)
1525 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1527 if (DECL_NAME (field
) == NULL_TREE
1528 && (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
1529 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
))
1531 tree anon
= lookup_field (field
, component
);
1534 return tree_cons (NULL_TREE
, field
, anon
);
1537 if (DECL_NAME (field
) == component
)
1541 if (field
== NULL_TREE
)
1545 return tree_cons (NULL_TREE
, field
, NULL_TREE
);
1548 /* Make an expression to refer to the COMPONENT field of
1549 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1552 build_component_ref (tree datum
, tree component
)
1554 tree type
= TREE_TYPE (datum
);
1555 enum tree_code code
= TREE_CODE (type
);
1559 if (!objc_is_public (datum
, component
))
1560 return error_mark_node
;
1562 /* See if there is a field or component with name COMPONENT. */
1564 if (code
== RECORD_TYPE
|| code
== UNION_TYPE
)
1566 if (!COMPLETE_TYPE_P (type
))
1568 c_incomplete_type_error (NULL_TREE
, type
);
1569 return error_mark_node
;
1572 field
= lookup_field (datum
, component
);
1576 error ("%qT has no member named %qE", type
, component
);
1577 return error_mark_node
;
1580 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1581 This might be better solved in future the way the C++ front
1582 end does it - by giving the anonymous entities each a
1583 separate name and type, and then have build_component_ref
1584 recursively call itself. We can't do that here. */
1587 tree subdatum
= TREE_VALUE (field
);
1589 if (TREE_TYPE (subdatum
) == error_mark_node
)
1590 return error_mark_node
;
1592 ref
= build3 (COMPONENT_REF
, TREE_TYPE (subdatum
), datum
, subdatum
,
1594 if (TREE_READONLY (datum
) || TREE_READONLY (subdatum
))
1595 TREE_READONLY (ref
) = 1;
1596 if (TREE_THIS_VOLATILE (datum
) || TREE_THIS_VOLATILE (subdatum
))
1597 TREE_THIS_VOLATILE (ref
) = 1;
1599 if (TREE_DEPRECATED (subdatum
))
1600 warn_deprecated_use (subdatum
);
1604 field
= TREE_CHAIN (field
);
1610 else if (code
!= ERROR_MARK
)
1611 error ("request for member %qE in something not a structure or union",
1614 return error_mark_node
;
1617 /* Given an expression PTR for a pointer, return an expression
1618 for the value pointed to.
1619 ERRORSTRING is the name of the operator to appear in error messages. */
1622 build_indirect_ref (tree ptr
, const char *errorstring
)
1624 tree pointer
= default_conversion (ptr
);
1625 tree type
= TREE_TYPE (pointer
);
1627 if (TREE_CODE (type
) == POINTER_TYPE
)
1629 if (TREE_CODE (pointer
) == ADDR_EXPR
1630 && (TREE_TYPE (TREE_OPERAND (pointer
, 0))
1631 == TREE_TYPE (type
)))
1632 return TREE_OPERAND (pointer
, 0);
1635 tree t
= TREE_TYPE (type
);
1639 if (TREE_CODE (mvt
) != ARRAY_TYPE
)
1640 mvt
= TYPE_MAIN_VARIANT (mvt
);
1641 ref
= build1 (INDIRECT_REF
, mvt
, pointer
);
1643 if (!COMPLETE_OR_VOID_TYPE_P (t
) && TREE_CODE (t
) != ARRAY_TYPE
)
1645 error ("dereferencing pointer to incomplete type");
1646 return error_mark_node
;
1648 if (VOID_TYPE_P (t
) && skip_evaluation
== 0)
1649 warning (0, "dereferencing %<void *%> pointer");
1651 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1652 so that we get the proper error message if the result is used
1653 to assign to. Also, &* is supposed to be a no-op.
1654 And ANSI C seems to specify that the type of the result
1655 should be the const type. */
1656 /* A de-reference of a pointer to const is not a const. It is valid
1657 to change it via some other pointer. */
1658 TREE_READONLY (ref
) = TYPE_READONLY (t
);
1659 TREE_SIDE_EFFECTS (ref
)
1660 = TYPE_VOLATILE (t
) || TREE_SIDE_EFFECTS (pointer
);
1661 TREE_THIS_VOLATILE (ref
) = TYPE_VOLATILE (t
);
1665 else if (TREE_CODE (pointer
) != ERROR_MARK
)
1666 error ("invalid type argument of %qs", errorstring
);
1667 return error_mark_node
;
1670 /* This handles expressions of the form "a[i]", which denotes
1673 This is logically equivalent in C to *(a+i), but we may do it differently.
1674 If A is a variable or a member, we generate a primitive ARRAY_REF.
1675 This avoids forcing the array out of registers, and can work on
1676 arrays that are not lvalues (for example, members of structures returned
1680 build_array_ref (tree array
, tree index
)
1682 bool swapped
= false;
1683 if (TREE_TYPE (array
) == error_mark_node
1684 || TREE_TYPE (index
) == error_mark_node
)
1685 return error_mark_node
;
1687 if (TREE_CODE (TREE_TYPE (array
)) != ARRAY_TYPE
1688 && TREE_CODE (TREE_TYPE (array
)) != POINTER_TYPE
)
1691 if (TREE_CODE (TREE_TYPE (index
)) != ARRAY_TYPE
1692 && TREE_CODE (TREE_TYPE (index
)) != POINTER_TYPE
)
1694 error ("subscripted value is neither array nor pointer");
1695 return error_mark_node
;
1703 if (!INTEGRAL_TYPE_P (TREE_TYPE (index
)))
1705 error ("array subscript is not an integer");
1706 return error_mark_node
;
1709 if (TREE_CODE (TREE_TYPE (TREE_TYPE (array
))) == FUNCTION_TYPE
)
1711 error ("subscripted value is pointer to function");
1712 return error_mark_node
;
1715 /* Subscripting with type char is likely to lose on a machine where
1716 chars are signed. So warn on any machine, but optionally. Don't
1717 warn for unsigned char since that type is safe. Don't warn for
1718 signed char because anyone who uses that must have done so
1719 deliberately. ??? Existing practice has also been to warn only
1720 when the char index is syntactically the index, not for
1722 if (warn_char_subscripts
&& !swapped
1723 && TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
)
1724 warning (0, "array subscript has type %<char%>");
1726 /* Apply default promotions *after* noticing character types. */
1727 index
= default_conversion (index
);
1729 gcc_assert (TREE_CODE (TREE_TYPE (index
)) == INTEGER_TYPE
);
1731 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
1735 /* An array that is indexed by a non-constant
1736 cannot be stored in a register; we must be able to do
1737 address arithmetic on its address.
1738 Likewise an array of elements of variable size. */
1739 if (TREE_CODE (index
) != INTEGER_CST
1740 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
1741 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
)))) != INTEGER_CST
))
1743 if (!c_mark_addressable (array
))
1744 return error_mark_node
;
1746 /* An array that is indexed by a constant value which is not within
1747 the array bounds cannot be stored in a register either; because we
1748 would get a crash in store_bit_field/extract_bit_field when trying
1749 to access a non-existent part of the register. */
1750 if (TREE_CODE (index
) == INTEGER_CST
1751 && TYPE_DOMAIN (TREE_TYPE (array
))
1752 && !int_fits_type_p (index
, TYPE_DOMAIN (TREE_TYPE (array
))))
1754 if (!c_mark_addressable (array
))
1755 return error_mark_node
;
1761 while (TREE_CODE (foo
) == COMPONENT_REF
)
1762 foo
= TREE_OPERAND (foo
, 0);
1763 if (TREE_CODE (foo
) == VAR_DECL
&& C_DECL_REGISTER (foo
))
1764 pedwarn ("ISO C forbids subscripting %<register%> array");
1765 else if (!flag_isoc99
&& !lvalue_p (foo
))
1766 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
1769 type
= TREE_TYPE (TREE_TYPE (array
));
1770 if (TREE_CODE (type
) != ARRAY_TYPE
)
1771 type
= TYPE_MAIN_VARIANT (type
);
1772 rval
= build4 (ARRAY_REF
, type
, array
, index
, NULL_TREE
, NULL_TREE
);
1773 /* Array ref is const/volatile if the array elements are
1774 or if the array is. */
1775 TREE_READONLY (rval
)
1776 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array
)))
1777 | TREE_READONLY (array
));
1778 TREE_SIDE_EFFECTS (rval
)
1779 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
1780 | TREE_SIDE_EFFECTS (array
));
1781 TREE_THIS_VOLATILE (rval
)
1782 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
1783 /* This was added by rms on 16 Nov 91.
1784 It fixes vol struct foo *a; a->elts[1]
1785 in an inline function.
1786 Hope it doesn't break something else. */
1787 | TREE_THIS_VOLATILE (array
));
1788 return require_complete_type (fold (rval
));
1792 tree ar
= default_conversion (array
);
1794 if (ar
== error_mark_node
)
1797 gcc_assert (TREE_CODE (TREE_TYPE (ar
)) == POINTER_TYPE
);
1798 gcc_assert (TREE_CODE (TREE_TYPE (TREE_TYPE (ar
))) != FUNCTION_TYPE
);
1800 return build_indirect_ref (build_binary_op (PLUS_EXPR
, ar
, index
, 0),
1805 /* Build an external reference to identifier ID. FUN indicates
1806 whether this will be used for a function call. LOC is the source
1807 location of the identifier. */
1809 build_external_ref (tree id
, int fun
, location_t loc
)
1812 tree decl
= lookup_name (id
);
1814 /* In Objective-C, an instance variable (ivar) may be preferred to
1815 whatever lookup_name() found. */
1816 decl
= objc_lookup_ivar (decl
, id
);
1818 if (decl
&& decl
!= error_mark_node
)
1821 /* Implicit function declaration. */
1822 ref
= implicitly_declare (id
);
1823 else if (decl
== error_mark_node
)
1824 /* Don't complain about something that's already been
1825 complained about. */
1826 return error_mark_node
;
1829 undeclared_variable (id
, loc
);
1830 return error_mark_node
;
1833 if (TREE_TYPE (ref
) == error_mark_node
)
1834 return error_mark_node
;
1836 if (TREE_DEPRECATED (ref
))
1837 warn_deprecated_use (ref
);
1839 if (!skip_evaluation
)
1840 assemble_external (ref
);
1841 TREE_USED (ref
) = 1;
1843 if (TREE_CODE (ref
) == FUNCTION_DECL
&& !in_alignof
)
1845 if (!in_sizeof
&& !in_typeof
)
1846 C_DECL_USED (ref
) = 1;
1847 else if (DECL_INITIAL (ref
) == 0
1848 && DECL_EXTERNAL (ref
)
1849 && !TREE_PUBLIC (ref
))
1850 record_maybe_used_decl (ref
);
1853 if (TREE_CODE (ref
) == CONST_DECL
)
1855 ref
= DECL_INITIAL (ref
);
1856 TREE_CONSTANT (ref
) = 1;
1857 TREE_INVARIANT (ref
) = 1;
1859 else if (current_function_decl
!= 0
1860 && !DECL_FILE_SCOPE_P (current_function_decl
)
1861 && (TREE_CODE (ref
) == VAR_DECL
1862 || TREE_CODE (ref
) == PARM_DECL
1863 || TREE_CODE (ref
) == FUNCTION_DECL
))
1865 tree context
= decl_function_context (ref
);
1867 if (context
!= 0 && context
!= current_function_decl
)
1868 DECL_NONLOCAL (ref
) = 1;
1874 /* Record details of decls possibly used inside sizeof or typeof. */
1875 struct maybe_used_decl
1879 /* The level seen at (in_sizeof + in_typeof). */
1881 /* The next one at this level or above, or NULL. */
1882 struct maybe_used_decl
*next
;
1885 static struct maybe_used_decl
*maybe_used_decls
;
1887 /* Record that DECL, an undefined static function reference seen
1888 inside sizeof or typeof, might be used if the operand of sizeof is
1889 a VLA type or the operand of typeof is a variably modified
1893 record_maybe_used_decl (tree decl
)
1895 struct maybe_used_decl
*t
= XOBNEW (&parser_obstack
, struct maybe_used_decl
);
1897 t
->level
= in_sizeof
+ in_typeof
;
1898 t
->next
= maybe_used_decls
;
1899 maybe_used_decls
= t
;
1902 /* Pop the stack of decls possibly used inside sizeof or typeof. If
1903 USED is false, just discard them. If it is true, mark them used
1904 (if no longer inside sizeof or typeof) or move them to the next
1905 level up (if still inside sizeof or typeof). */
1908 pop_maybe_used (bool used
)
1910 struct maybe_used_decl
*p
= maybe_used_decls
;
1911 int cur_level
= in_sizeof
+ in_typeof
;
1912 while (p
&& p
->level
> cur_level
)
1917 C_DECL_USED (p
->decl
) = 1;
1919 p
->level
= cur_level
;
1923 if (!used
|| cur_level
== 0)
1924 maybe_used_decls
= p
;
1927 /* Return the result of sizeof applied to EXPR. */
1930 c_expr_sizeof_expr (struct c_expr expr
)
1933 if (expr
.value
== error_mark_node
)
1935 ret
.value
= error_mark_node
;
1936 ret
.original_code
= ERROR_MARK
;
1937 pop_maybe_used (false);
1941 ret
.value
= c_sizeof (TREE_TYPE (expr
.value
));
1942 ret
.original_code
= ERROR_MARK
;
1943 pop_maybe_used (C_TYPE_VARIABLE_SIZE (TREE_TYPE (expr
.value
)));
1948 /* Return the result of sizeof applied to T, a structure for the type
1949 name passed to sizeof (rather than the type itself). */
1952 c_expr_sizeof_type (struct c_type_name
*t
)
1956 type
= groktypename (t
);
1957 ret
.value
= c_sizeof (type
);
1958 ret
.original_code
= ERROR_MARK
;
1959 pop_maybe_used (C_TYPE_VARIABLE_SIZE (type
));
1963 /* Build a function call to function FUNCTION with parameters PARAMS.
1964 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1965 TREE_VALUE of each node is a parameter-expression.
1966 FUNCTION's data type may be a function type or a pointer-to-function. */
1969 build_function_call (tree function
, tree params
)
1971 tree fntype
, fundecl
= 0;
1972 tree coerced_params
;
1973 tree name
= NULL_TREE
, result
;
1976 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1977 STRIP_TYPE_NOPS (function
);
1979 /* Convert anything with function type to a pointer-to-function. */
1980 if (TREE_CODE (function
) == FUNCTION_DECL
)
1982 /* Implement type-directed function overloading for builtins.
1983 resolve_overloaded_builtin and targetm.resolve_overloaded_builtin
1984 handle all the type checking. The result is a complete expression
1985 that implements this function call. */
1986 tem
= resolve_overloaded_builtin (function
, params
);
1990 name
= DECL_NAME (function
);
1992 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1993 (because calling an inline function does not mean the function
1994 needs to be separately compiled). */
1995 fntype
= build_type_variant (TREE_TYPE (function
),
1996 TREE_READONLY (function
),
1997 TREE_THIS_VOLATILE (function
));
1999 function
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), function
);
2002 function
= default_conversion (function
);
2004 fntype
= TREE_TYPE (function
);
2006 if (TREE_CODE (fntype
) == ERROR_MARK
)
2007 return error_mark_node
;
2009 if (!(TREE_CODE (fntype
) == POINTER_TYPE
2010 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
))
2012 error ("called object %qE is not a function", function
);
2013 return error_mark_node
;
2016 if (fundecl
&& TREE_THIS_VOLATILE (fundecl
))
2017 current_function_returns_abnormally
= 1;
2019 /* fntype now gets the type of function pointed to. */
2020 fntype
= TREE_TYPE (fntype
);
2022 /* Check that the function is called through a compatible prototype.
2023 If it is not, replace the call by a trap, wrapped up in a compound
2024 expression if necessary. This has the nice side-effect to prevent
2025 the tree-inliner from generating invalid assignment trees which may
2026 blow up in the RTL expander later.
2028 ??? This doesn't work for Objective-C because objc_comptypes
2029 refuses to compare function prototypes, yet the compiler appears
2030 to build calls that are flagged as invalid by C's comptypes. */
2031 if (!c_dialect_objc ()
2032 && TREE_CODE (function
) == NOP_EXPR
2033 && TREE_CODE (tem
= TREE_OPERAND (function
, 0)) == ADDR_EXPR
2034 && TREE_CODE (tem
= TREE_OPERAND (tem
, 0)) == FUNCTION_DECL
2035 && !comptypes (fntype
, TREE_TYPE (tem
)))
2037 tree return_type
= TREE_TYPE (fntype
);
2038 tree trap
= build_function_call (built_in_decls
[BUILT_IN_TRAP
],
2041 /* This situation leads to run-time undefined behavior. We can't,
2042 therefore, simply error unless we can prove that all possible
2043 executions of the program must execute the code. */
2044 warning (0, "function called through a non-compatible type");
2046 /* We can, however, treat "undefined" any way we please.
2047 Call abort to encourage the user to fix the program. */
2048 inform ("if this code is reached, the program will abort");
2050 if (VOID_TYPE_P (return_type
))
2056 if (AGGREGATE_TYPE_P (return_type
))
2057 rhs
= build_compound_literal (return_type
,
2058 build_constructor (return_type
,
2061 rhs
= fold (build1 (NOP_EXPR
, return_type
, integer_zero_node
));
2063 return build2 (COMPOUND_EXPR
, return_type
, trap
, rhs
);
2067 /* Convert the parameters to the types declared in the
2068 function prototype, or apply default promotions. */
2071 = convert_arguments (TYPE_ARG_TYPES (fntype
), params
, function
, fundecl
);
2073 if (coerced_params
== error_mark_node
)
2074 return error_mark_node
;
2076 /* Check that the arguments to the function are valid. */
2078 check_function_arguments (TYPE_ATTRIBUTES (fntype
), coerced_params
);
2080 result
= build3 (CALL_EXPR
, TREE_TYPE (fntype
),
2081 function
, coerced_params
, NULL_TREE
);
2082 TREE_SIDE_EFFECTS (result
) = 1;
2084 if (require_constant_value
)
2086 result
= fold_initializer (result
);
2088 if (TREE_CONSTANT (result
)
2089 && (name
== NULL_TREE
2090 || strncmp (IDENTIFIER_POINTER (name
), "__builtin_", 10) != 0))
2091 pedwarn_init ("initializer element is not constant");
2094 result
= fold (result
);
2096 if (VOID_TYPE_P (TREE_TYPE (result
)))
2098 return require_complete_type (result
);
2101 /* Convert the argument expressions in the list VALUES
2102 to the types in the list TYPELIST. The result is a list of converted
2103 argument expressions, unless there are too few arguments in which
2104 case it is error_mark_node.
2106 If TYPELIST is exhausted, or when an element has NULL as its type,
2107 perform the default conversions.
2109 PARMLIST is the chain of parm decls for the function being called.
2110 It may be 0, if that info is not available.
2111 It is used only for generating error messages.
2113 FUNCTION is a tree for the called function. It is used only for
2114 error messages, where it is formatted with %qE.
2116 This is also where warnings about wrong number of args are generated.
2118 Both VALUES and the returned value are chains of TREE_LIST nodes
2119 with the elements of the list in the TREE_VALUE slots of those nodes. */
2122 convert_arguments (tree typelist
, tree values
, tree function
, tree fundecl
)
2124 tree typetail
, valtail
;
2129 /* Change pointer to function to the function itself for
2131 if (TREE_CODE (function
) == ADDR_EXPR
2132 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
2133 function
= TREE_OPERAND (function
, 0);
2135 /* Handle an ObjC selector specially for diagnostics. */
2136 selector
= objc_message_selector ();
2138 /* Scan the given expressions and types, producing individual
2139 converted arguments and pushing them on RESULT in reverse order. */
2141 for (valtail
= values
, typetail
= typelist
, parmnum
= 0;
2143 valtail
= TREE_CHAIN (valtail
), parmnum
++)
2145 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
2146 tree val
= TREE_VALUE (valtail
);
2147 tree rname
= function
;
2148 int argnum
= parmnum
+ 1;
2149 const char *invalid_func_diag
;
2151 if (type
== void_type_node
)
2153 error ("too many arguments to function %qE", function
);
2157 if (selector
&& argnum
> 2)
2163 STRIP_TYPE_NOPS (val
);
2165 val
= default_function_array_conversion (val
);
2167 val
= require_complete_type (val
);
2171 /* Formal parm type is specified by a function prototype. */
2174 if (type
== error_mark_node
|| !COMPLETE_TYPE_P (type
))
2176 error ("type of formal parameter %d is incomplete", parmnum
+ 1);
2181 /* Optionally warn about conversions that
2182 differ from the default conversions. */
2183 if (warn_conversion
|| warn_traditional
)
2185 unsigned int formal_prec
= TYPE_PRECISION (type
);
2187 if (INTEGRAL_TYPE_P (type
)
2188 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
2189 warning (0, "passing argument %d of %qE as integer "
2190 "rather than floating due to prototype",
2192 if (INTEGRAL_TYPE_P (type
)
2193 && TREE_CODE (TREE_TYPE (val
)) == COMPLEX_TYPE
)
2194 warning (0, "passing argument %d of %qE as integer "
2195 "rather than complex due to prototype",
2197 else if (TREE_CODE (type
) == COMPLEX_TYPE
2198 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
2199 warning (0, "passing argument %d of %qE as complex "
2200 "rather than floating due to prototype",
2202 else if (TREE_CODE (type
) == REAL_TYPE
2203 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
2204 warning (0, "passing argument %d of %qE as floating "
2205 "rather than integer due to prototype",
2207 else if (TREE_CODE (type
) == COMPLEX_TYPE
2208 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
2209 warning (0, "passing argument %d of %qE as complex "
2210 "rather than integer due to prototype",
2212 else if (TREE_CODE (type
) == REAL_TYPE
2213 && TREE_CODE (TREE_TYPE (val
)) == COMPLEX_TYPE
)
2214 warning (0, "passing argument %d of %qE as floating "
2215 "rather than complex due to prototype",
2217 /* ??? At some point, messages should be written about
2218 conversions between complex types, but that's too messy
2220 else if (TREE_CODE (type
) == REAL_TYPE
2221 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
2223 /* Warn if any argument is passed as `float',
2224 since without a prototype it would be `double'. */
2225 if (formal_prec
== TYPE_PRECISION (float_type_node
))
2226 warning (0, "passing argument %d of %qE as %<float%> "
2227 "rather than %<double%> due to prototype",
2230 /* Detect integer changing in width or signedness.
2231 These warnings are only activated with
2232 -Wconversion, not with -Wtraditional. */
2233 else if (warn_conversion
&& INTEGRAL_TYPE_P (type
)
2234 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
2236 tree would_have_been
= default_conversion (val
);
2237 tree type1
= TREE_TYPE (would_have_been
);
2239 if (TREE_CODE (type
) == ENUMERAL_TYPE
2240 && (TYPE_MAIN_VARIANT (type
)
2241 == TYPE_MAIN_VARIANT (TREE_TYPE (val
))))
2242 /* No warning if function asks for enum
2243 and the actual arg is that enum type. */
2245 else if (formal_prec
!= TYPE_PRECISION (type1
))
2246 warning (0, "passing argument %d of %qE with different "
2247 "width due to prototype", argnum
, rname
);
2248 else if (TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (type1
))
2250 /* Don't complain if the formal parameter type
2251 is an enum, because we can't tell now whether
2252 the value was an enum--even the same enum. */
2253 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
2255 else if (TREE_CODE (val
) == INTEGER_CST
2256 && int_fits_type_p (val
, type
))
2257 /* Change in signedness doesn't matter
2258 if a constant value is unaffected. */
2260 /* If the value is extended from a narrower
2261 unsigned type, it doesn't matter whether we
2262 pass it as signed or unsigned; the value
2263 certainly is the same either way. */
2264 else if (TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
)
2265 && TYPE_UNSIGNED (TREE_TYPE (val
)))
2267 else if (TYPE_UNSIGNED (type
))
2268 warning (0, "passing argument %d of %qE as unsigned "
2269 "due to prototype", argnum
, rname
);
2271 warning (0, "passing argument %d of %qE as signed "
2272 "due to prototype", argnum
, rname
);
2276 parmval
= convert_for_assignment (type
, val
, ic_argpass
,
2280 if (targetm
.calls
.promote_prototypes (fundecl
? TREE_TYPE (fundecl
) : 0)
2281 && INTEGRAL_TYPE_P (type
)
2282 && (TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)))
2283 parmval
= default_conversion (parmval
);
2285 result
= tree_cons (NULL_TREE
, parmval
, result
);
2287 else if (TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
2288 && (TYPE_PRECISION (TREE_TYPE (val
))
2289 < TYPE_PRECISION (double_type_node
)))
2290 /* Convert `float' to `double'. */
2291 result
= tree_cons (NULL_TREE
, convert (double_type_node
, val
), result
);
2292 else if ((invalid_func_diag
=
2293 targetm
.calls
.invalid_arg_for_unprototyped_fn (typelist
, fundecl
, val
)))
2295 error (invalid_func_diag
);
2296 return error_mark_node
;
2299 /* Convert `short' and `char' to full-size `int'. */
2300 result
= tree_cons (NULL_TREE
, default_conversion (val
), result
);
2303 typetail
= TREE_CHAIN (typetail
);
2306 if (typetail
!= 0 && TREE_VALUE (typetail
) != void_type_node
)
2308 error ("too few arguments to function %qE", function
);
2309 return error_mark_node
;
2312 return nreverse (result
);
2315 /* This is the entry point used by the parser to build unary operators
2316 in the input. CODE, a tree_code, specifies the unary operator, and
2317 ARG is the operand. For unary plus, the C parser currently uses
2318 CONVERT_EXPR for code. */
2321 parser_build_unary_op (enum tree_code code
, struct c_expr arg
)
2323 struct c_expr result
;
2325 result
.original_code
= ERROR_MARK
;
2326 result
.value
= build_unary_op (code
, arg
.value
, 0);
2327 overflow_warning (result
.value
);
2331 /* This is the entry point used by the parser to build binary operators
2332 in the input. CODE, a tree_code, specifies the binary operator, and
2333 ARG1 and ARG2 are the operands. In addition to constructing the
2334 expression, we check for operands that were written with other binary
2335 operators in a way that is likely to confuse the user. */
2338 parser_build_binary_op (enum tree_code code
, struct c_expr arg1
,
2341 struct c_expr result
;
2343 enum tree_code code1
= arg1
.original_code
;
2344 enum tree_code code2
= arg2
.original_code
;
2346 result
.value
= build_binary_op (code
, arg1
.value
, arg2
.value
, 1);
2347 result
.original_code
= code
;
2349 if (TREE_CODE (result
.value
) == ERROR_MARK
)
2352 /* Check for cases such as x+y<<z which users are likely
2354 if (warn_parentheses
)
2356 if (code
== LSHIFT_EXPR
|| code
== RSHIFT_EXPR
)
2358 if (code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
2359 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
2360 warning (0, "suggest parentheses around + or - inside shift");
2363 if (code
== TRUTH_ORIF_EXPR
)
2365 if (code1
== TRUTH_ANDIF_EXPR
2366 || code2
== TRUTH_ANDIF_EXPR
)
2367 warning (0, "suggest parentheses around && within ||");
2370 if (code
== BIT_IOR_EXPR
)
2372 if (code1
== BIT_AND_EXPR
|| code1
== BIT_XOR_EXPR
2373 || code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
2374 || code2
== BIT_AND_EXPR
|| code2
== BIT_XOR_EXPR
2375 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
2376 warning (0, "suggest parentheses around arithmetic in operand of |");
2377 /* Check cases like x|y==z */
2378 if (TREE_CODE_CLASS (code1
) == tcc_comparison
2379 || TREE_CODE_CLASS (code2
) == tcc_comparison
)
2380 warning (0, "suggest parentheses around comparison in operand of |");
2383 if (code
== BIT_XOR_EXPR
)
2385 if (code1
== BIT_AND_EXPR
2386 || code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
2387 || code2
== BIT_AND_EXPR
2388 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
2389 warning (0, "suggest parentheses around arithmetic in operand of ^");
2390 /* Check cases like x^y==z */
2391 if (TREE_CODE_CLASS (code1
) == tcc_comparison
2392 || TREE_CODE_CLASS (code2
) == tcc_comparison
)
2393 warning (0, "suggest parentheses around comparison in operand of ^");
2396 if (code
== BIT_AND_EXPR
)
2398 if (code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
2399 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
2400 warning (0, "suggest parentheses around + or - in operand of &");
2401 /* Check cases like x&y==z */
2402 if (TREE_CODE_CLASS (code1
) == tcc_comparison
2403 || TREE_CODE_CLASS (code2
) == tcc_comparison
)
2404 warning (0, "suggest parentheses around comparison in operand of &");
2406 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
2407 if (TREE_CODE_CLASS (code
) == tcc_comparison
2408 && (TREE_CODE_CLASS (code1
) == tcc_comparison
2409 || TREE_CODE_CLASS (code2
) == tcc_comparison
))
2410 warning (0, "comparisons like X<=Y<=Z do not have their mathematical meaning");
2414 unsigned_conversion_warning (result
.value
, arg1
.value
);
2415 unsigned_conversion_warning (result
.value
, arg2
.value
);
2416 overflow_warning (result
.value
);
2421 /* Return a tree for the difference of pointers OP0 and OP1.
2422 The resulting tree has type int. */
2425 pointer_diff (tree op0
, tree op1
)
2427 tree restype
= ptrdiff_type_node
;
2429 tree target_type
= TREE_TYPE (TREE_TYPE (op0
));
2430 tree con0
, con1
, lit0
, lit1
;
2431 tree orig_op1
= op1
;
2433 if (pedantic
|| warn_pointer_arith
)
2435 if (TREE_CODE (target_type
) == VOID_TYPE
)
2436 pedwarn ("pointer of type %<void *%> used in subtraction");
2437 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
2438 pedwarn ("pointer to a function used in subtraction");
2441 /* If the conversion to ptrdiff_type does anything like widening or
2442 converting a partial to an integral mode, we get a convert_expression
2443 that is in the way to do any simplifications.
2444 (fold-const.c doesn't know that the extra bits won't be needed.
2445 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2446 different mode in place.)
2447 So first try to find a common term here 'by hand'; we want to cover
2448 at least the cases that occur in legal static initializers. */
2449 con0
= TREE_CODE (op0
) == NOP_EXPR
? TREE_OPERAND (op0
, 0) : op0
;
2450 con1
= TREE_CODE (op1
) == NOP_EXPR
? TREE_OPERAND (op1
, 0) : op1
;
2452 if (TREE_CODE (con0
) == PLUS_EXPR
)
2454 lit0
= TREE_OPERAND (con0
, 1);
2455 con0
= TREE_OPERAND (con0
, 0);
2458 lit0
= integer_zero_node
;
2460 if (TREE_CODE (con1
) == PLUS_EXPR
)
2462 lit1
= TREE_OPERAND (con1
, 1);
2463 con1
= TREE_OPERAND (con1
, 0);
2466 lit1
= integer_zero_node
;
2468 if (operand_equal_p (con0
, con1
, 0))
2475 /* First do the subtraction as integers;
2476 then drop through to build the divide operator.
2477 Do not do default conversions on the minus operator
2478 in case restype is a short type. */
2480 op0
= build_binary_op (MINUS_EXPR
, convert (restype
, op0
),
2481 convert (restype
, op1
), 0);
2482 /* This generates an error if op1 is pointer to incomplete type. */
2483 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1
))))
2484 error ("arithmetic on pointer to an incomplete type");
2486 /* This generates an error if op0 is pointer to incomplete type. */
2487 op1
= c_size_in_bytes (target_type
);
2489 /* Divide by the size, in easiest possible way. */
2490 return fold (build2 (EXACT_DIV_EXPR
, restype
, op0
, convert (restype
, op1
)));
2493 /* Construct and perhaps optimize a tree representation
2494 for a unary operation. CODE, a tree_code, specifies the operation
2495 and XARG is the operand.
2496 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2497 the default promotions (such as from short to int).
2498 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2499 allows non-lvalues; this is only used to handle conversion of non-lvalue
2500 arrays to pointers in C99. */
2503 build_unary_op (enum tree_code code
, tree xarg
, int flag
)
2505 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2508 enum tree_code typecode
= TREE_CODE (TREE_TYPE (arg
));
2510 int noconvert
= flag
;
2512 if (typecode
== ERROR_MARK
)
2513 return error_mark_node
;
2514 if (typecode
== ENUMERAL_TYPE
|| typecode
== BOOLEAN_TYPE
)
2515 typecode
= INTEGER_TYPE
;
2520 /* This is used for unary plus, because a CONVERT_EXPR
2521 is enough to prevent anybody from looking inside for
2522 associativity, but won't generate any code. */
2523 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2524 || typecode
== COMPLEX_TYPE
2525 || typecode
== VECTOR_TYPE
))
2527 error ("wrong type argument to unary plus");
2528 return error_mark_node
;
2530 else if (!noconvert
)
2531 arg
= default_conversion (arg
);
2532 arg
= non_lvalue (arg
);
2536 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2537 || typecode
== COMPLEX_TYPE
2538 || typecode
== VECTOR_TYPE
))
2540 error ("wrong type argument to unary minus");
2541 return error_mark_node
;
2543 else if (!noconvert
)
2544 arg
= default_conversion (arg
);
2548 if (typecode
== INTEGER_TYPE
|| typecode
== VECTOR_TYPE
)
2551 arg
= default_conversion (arg
);
2553 else if (typecode
== COMPLEX_TYPE
)
2557 pedwarn ("ISO C does not support %<~%> for complex conjugation");
2559 arg
= default_conversion (arg
);
2563 error ("wrong type argument to bit-complement");
2564 return error_mark_node
;
2569 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
))
2571 error ("wrong type argument to abs");
2572 return error_mark_node
;
2574 else if (!noconvert
)
2575 arg
= default_conversion (arg
);
2579 /* Conjugating a real value is a no-op, but allow it anyway. */
2580 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2581 || typecode
== COMPLEX_TYPE
))
2583 error ("wrong type argument to conjugation");
2584 return error_mark_node
;
2586 else if (!noconvert
)
2587 arg
= default_conversion (arg
);
2590 case TRUTH_NOT_EXPR
:
2591 /* ??? Why do most validation here but that for non-lvalue arrays
2592 in c_objc_common_truthvalue_conversion? */
2593 if (typecode
!= INTEGER_TYPE
2594 && typecode
!= REAL_TYPE
&& typecode
!= POINTER_TYPE
2595 && typecode
!= COMPLEX_TYPE
2596 /* These will convert to a pointer. */
2597 && typecode
!= ARRAY_TYPE
&& typecode
!= FUNCTION_TYPE
)
2599 error ("wrong type argument to unary exclamation mark");
2600 return error_mark_node
;
2602 arg
= c_objc_common_truthvalue_conversion (arg
);
2603 return invert_truthvalue (arg
);
2609 if (TREE_CODE (arg
) == COMPLEX_CST
)
2610 return TREE_REALPART (arg
);
2611 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
2612 return fold (build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
2617 if (TREE_CODE (arg
) == COMPLEX_CST
)
2618 return TREE_IMAGPART (arg
);
2619 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
2620 return fold (build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
2622 return convert (TREE_TYPE (arg
), integer_zero_node
);
2624 case PREINCREMENT_EXPR
:
2625 case POSTINCREMENT_EXPR
:
2626 case PREDECREMENT_EXPR
:
2627 case POSTDECREMENT_EXPR
:
2629 /* Increment or decrement the real part of the value,
2630 and don't change the imaginary part. */
2631 if (typecode
== COMPLEX_TYPE
)
2636 pedwarn ("ISO C does not support %<++%> and %<--%>"
2637 " on complex types");
2639 arg
= stabilize_reference (arg
);
2640 real
= build_unary_op (REALPART_EXPR
, arg
, 1);
2641 imag
= build_unary_op (IMAGPART_EXPR
, arg
, 1);
2642 return build2 (COMPLEX_EXPR
, TREE_TYPE (arg
),
2643 build_unary_op (code
, real
, 1), imag
);
2646 /* Report invalid types. */
2648 if (typecode
!= POINTER_TYPE
2649 && typecode
!= INTEGER_TYPE
&& typecode
!= REAL_TYPE
)
2651 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2652 error ("wrong type argument to increment");
2654 error ("wrong type argument to decrement");
2656 return error_mark_node
;
2661 tree result_type
= TREE_TYPE (arg
);
2663 arg
= get_unwidened (arg
, 0);
2664 argtype
= TREE_TYPE (arg
);
2666 /* Compute the increment. */
2668 if (typecode
== POINTER_TYPE
)
2670 /* If pointer target is an undefined struct,
2671 we just cannot know how to do the arithmetic. */
2672 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type
)))
2674 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2675 error ("increment of pointer to unknown structure");
2677 error ("decrement of pointer to unknown structure");
2679 else if ((pedantic
|| warn_pointer_arith
)
2680 && (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
2681 || TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
))
2683 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2684 pedwarn ("wrong type argument to increment");
2686 pedwarn ("wrong type argument to decrement");
2689 inc
= c_size_in_bytes (TREE_TYPE (result_type
));
2692 inc
= integer_one_node
;
2694 inc
= convert (argtype
, inc
);
2696 /* Complain about anything else that is not a true lvalue. */
2697 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
2698 || code
== POSTINCREMENT_EXPR
)
2701 return error_mark_node
;
2703 /* Report a read-only lvalue. */
2704 if (TREE_READONLY (arg
))
2705 readonly_error (arg
,
2706 ((code
== PREINCREMENT_EXPR
2707 || code
== POSTINCREMENT_EXPR
)
2708 ? lv_increment
: lv_decrement
));
2710 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
)
2711 val
= boolean_increment (code
, arg
);
2713 val
= build2 (code
, TREE_TYPE (arg
), arg
, inc
);
2714 TREE_SIDE_EFFECTS (val
) = 1;
2715 val
= convert (result_type
, val
);
2716 if (TREE_CODE (val
) != code
)
2717 TREE_NO_WARNING (val
) = 1;
2722 /* Note that this operation never does default_conversion. */
2724 /* Let &* cancel out to simplify resulting code. */
2725 if (TREE_CODE (arg
) == INDIRECT_REF
)
2727 /* Don't let this be an lvalue. */
2728 if (lvalue_p (TREE_OPERAND (arg
, 0)))
2729 return non_lvalue (TREE_OPERAND (arg
, 0));
2730 return TREE_OPERAND (arg
, 0);
2733 /* For &x[y], return x+y */
2734 if (TREE_CODE (arg
) == ARRAY_REF
)
2736 if (!c_mark_addressable (TREE_OPERAND (arg
, 0)))
2737 return error_mark_node
;
2738 return build_binary_op (PLUS_EXPR
, TREE_OPERAND (arg
, 0),
2739 TREE_OPERAND (arg
, 1), 1);
2742 /* Anything not already handled and not a true memory reference
2743 or a non-lvalue array is an error. */
2744 else if (typecode
!= FUNCTION_TYPE
&& !flag
2745 && !lvalue_or_else (arg
, lv_addressof
))
2746 return error_mark_node
;
2748 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
2749 argtype
= TREE_TYPE (arg
);
2751 /* If the lvalue is const or volatile, merge that into the type
2752 to which the address will point. Note that you can't get a
2753 restricted pointer by taking the address of something, so we
2754 only have to deal with `const' and `volatile' here. */
2755 if ((DECL_P (arg
) || REFERENCE_CLASS_P (arg
))
2756 && (TREE_READONLY (arg
) || TREE_THIS_VOLATILE (arg
)))
2757 argtype
= c_build_type_variant (argtype
,
2758 TREE_READONLY (arg
),
2759 TREE_THIS_VOLATILE (arg
));
2761 if (!c_mark_addressable (arg
))
2762 return error_mark_node
;
2764 gcc_assert (TREE_CODE (arg
) != COMPONENT_REF
2765 || !DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)));
2767 argtype
= build_pointer_type (argtype
);
2769 /* ??? Cope with user tricks that amount to offsetof. Delete this
2770 when we have proper support for integer constant expressions. */
2771 val
= get_base_address (arg
);
2772 if (val
&& TREE_CODE (val
) == INDIRECT_REF
2773 && integer_zerop (TREE_OPERAND (val
, 0)))
2774 return fold_convert (argtype
, fold_offsetof (arg
));
2776 val
= build1 (ADDR_EXPR
, argtype
, arg
);
2778 if (TREE_CODE (arg
) == COMPOUND_LITERAL_EXPR
)
2779 TREE_INVARIANT (val
) = TREE_CONSTANT (val
) = 1;
2788 argtype
= TREE_TYPE (arg
);
2789 val
= build1 (code
, argtype
, arg
);
2790 return require_constant_value
? fold_initializer (val
) : fold (val
);
2793 /* Return nonzero if REF is an lvalue valid for this language.
2794 Lvalues can be assigned, unless their type has TYPE_READONLY.
2795 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
2800 enum tree_code code
= TREE_CODE (ref
);
2807 return lvalue_p (TREE_OPERAND (ref
, 0));
2809 case COMPOUND_LITERAL_EXPR
:
2819 return (TREE_CODE (TREE_TYPE (ref
)) != FUNCTION_TYPE
2820 && TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
);
2823 return TREE_CODE (TREE_TYPE (ref
)) == ARRAY_TYPE
;
2830 /* Give an error for storing in something that is 'const'. */
2833 readonly_error (tree arg
, enum lvalue_use use
)
2835 gcc_assert (use
== lv_assign
|| use
== lv_increment
|| use
== lv_decrement
);
2836 /* Using this macro rather than (for example) arrays of messages
2837 ensures that all the format strings are checked at compile
2839 #define READONLY_MSG(A, I, D) (use == lv_assign \
2841 : (use == lv_increment ? (I) : (D)))
2842 if (TREE_CODE (arg
) == COMPONENT_REF
)
2844 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg
, 0))))
2845 readonly_error (TREE_OPERAND (arg
, 0), use
);
2847 error (READONLY_MSG (N_("assignment of read-only member %qD"),
2848 N_("increment of read-only member %qD"),
2849 N_("decrement of read-only member %qD")),
2850 TREE_OPERAND (arg
, 1));
2852 else if (TREE_CODE (arg
) == VAR_DECL
)
2853 error (READONLY_MSG (N_("assignment of read-only variable %qD"),
2854 N_("increment of read-only variable %qD"),
2855 N_("decrement of read-only variable %qD")),
2858 error (READONLY_MSG (N_("assignment of read-only location"),
2859 N_("increment of read-only location"),
2860 N_("decrement of read-only location")));
2864 /* Return nonzero if REF is an lvalue valid for this language;
2865 otherwise, print an error message and return zero. USE says
2866 how the lvalue is being used and so selects the error message. */
2869 lvalue_or_else (tree ref
, enum lvalue_use use
)
2871 int win
= lvalue_p (ref
);
2879 /* Mark EXP saying that we need to be able to take the
2880 address of it; it should not be allocated in a register.
2881 Returns true if successful. */
2884 c_mark_addressable (tree exp
)
2889 switch (TREE_CODE (x
))
2892 if (DECL_C_BIT_FIELD (TREE_OPERAND (x
, 1)))
2895 ("cannot take address of bit-field %qD", TREE_OPERAND (x
, 1));
2899 /* ... fall through ... */
2905 x
= TREE_OPERAND (x
, 0);
2908 case COMPOUND_LITERAL_EXPR
:
2910 TREE_ADDRESSABLE (x
) = 1;
2917 if (C_DECL_REGISTER (x
)
2918 && DECL_NONLOCAL (x
))
2920 if (TREE_PUBLIC (x
) || TREE_STATIC (x
) || DECL_EXTERNAL (x
))
2923 ("global register variable %qD used in nested function", x
);
2926 pedwarn ("register variable %qD used in nested function", x
);
2928 else if (C_DECL_REGISTER (x
))
2930 if (TREE_PUBLIC (x
) || TREE_STATIC (x
) || DECL_EXTERNAL (x
))
2931 error ("address of global register variable %qD requested", x
);
2933 error ("address of register variable %qD requested", x
);
2939 TREE_ADDRESSABLE (x
) = 1;
2946 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
2949 build_conditional_expr (tree ifexp
, tree op1
, tree op2
)
2953 enum tree_code code1
;
2954 enum tree_code code2
;
2955 tree result_type
= NULL
;
2956 tree orig_op1
= op1
, orig_op2
= op2
;
2958 /* Promote both alternatives. */
2960 if (TREE_CODE (TREE_TYPE (op1
)) != VOID_TYPE
)
2961 op1
= default_conversion (op1
);
2962 if (TREE_CODE (TREE_TYPE (op2
)) != VOID_TYPE
)
2963 op2
= default_conversion (op2
);
2965 if (TREE_CODE (ifexp
) == ERROR_MARK
2966 || TREE_CODE (TREE_TYPE (op1
)) == ERROR_MARK
2967 || TREE_CODE (TREE_TYPE (op2
)) == ERROR_MARK
)
2968 return error_mark_node
;
2970 type1
= TREE_TYPE (op1
);
2971 code1
= TREE_CODE (type1
);
2972 type2
= TREE_TYPE (op2
);
2973 code2
= TREE_CODE (type2
);
2975 /* C90 does not permit non-lvalue arrays in conditional expressions.
2976 In C99 they will be pointers by now. */
2977 if (code1
== ARRAY_TYPE
|| code2
== ARRAY_TYPE
)
2979 error ("non-lvalue array in conditional expression");
2980 return error_mark_node
;
2983 /* Quickly detect the usual case where op1 and op2 have the same type
2985 if (TYPE_MAIN_VARIANT (type1
) == TYPE_MAIN_VARIANT (type2
))
2988 result_type
= type1
;
2990 result_type
= TYPE_MAIN_VARIANT (type1
);
2992 else if ((code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
2993 || code1
== COMPLEX_TYPE
)
2994 && (code2
== INTEGER_TYPE
|| code2
== REAL_TYPE
2995 || code2
== COMPLEX_TYPE
))
2997 result_type
= c_common_type (type1
, type2
);
2999 /* If -Wsign-compare, warn here if type1 and type2 have
3000 different signedness. We'll promote the signed to unsigned
3001 and later code won't know it used to be different.
3002 Do this check on the original types, so that explicit casts
3003 will be considered, but default promotions won't. */
3004 if (warn_sign_compare
&& !skip_evaluation
)
3006 int unsigned_op1
= TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
3007 int unsigned_op2
= TYPE_UNSIGNED (TREE_TYPE (orig_op2
));
3009 if (unsigned_op1
^ unsigned_op2
)
3011 /* Do not warn if the result type is signed, since the
3012 signed type will only be chosen if it can represent
3013 all the values of the unsigned type. */
3014 if (!TYPE_UNSIGNED (result_type
))
3016 /* Do not warn if the signed quantity is an unsuffixed
3017 integer literal (or some static constant expression
3018 involving such literals) and it is non-negative. */
3019 else if ((unsigned_op2
&& tree_expr_nonnegative_p (op1
))
3020 || (unsigned_op1
&& tree_expr_nonnegative_p (op2
)))
3023 warning (0, "signed and unsigned type in conditional expression");
3027 else if (code1
== VOID_TYPE
|| code2
== VOID_TYPE
)
3029 if (pedantic
&& (code1
!= VOID_TYPE
|| code2
!= VOID_TYPE
))
3030 pedwarn ("ISO C forbids conditional expr with only one void side");
3031 result_type
= void_type_node
;
3033 else if (code1
== POINTER_TYPE
&& code2
== POINTER_TYPE
)
3035 if (comp_target_types (type1
, type2
, 1))
3036 result_type
= common_pointer_type (type1
, type2
);
3037 else if (integer_zerop (op1
) && TREE_TYPE (type1
) == void_type_node
3038 && TREE_CODE (orig_op1
) != NOP_EXPR
)
3039 result_type
= qualify_type (type2
, type1
);
3040 else if (integer_zerop (op2
) && TREE_TYPE (type2
) == void_type_node
3041 && TREE_CODE (orig_op2
) != NOP_EXPR
)
3042 result_type
= qualify_type (type1
, type2
);
3043 else if (VOID_TYPE_P (TREE_TYPE (type1
)))
3045 if (pedantic
&& TREE_CODE (TREE_TYPE (type2
)) == FUNCTION_TYPE
)
3046 pedwarn ("ISO C forbids conditional expr between "
3047 "%<void *%> and function pointer");
3048 result_type
= build_pointer_type (qualify_type (TREE_TYPE (type1
),
3049 TREE_TYPE (type2
)));
3051 else if (VOID_TYPE_P (TREE_TYPE (type2
)))
3053 if (pedantic
&& TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
)
3054 pedwarn ("ISO C forbids conditional expr between "
3055 "%<void *%> and function pointer");
3056 result_type
= build_pointer_type (qualify_type (TREE_TYPE (type2
),
3057 TREE_TYPE (type1
)));
3061 pedwarn ("pointer type mismatch in conditional expression");
3062 result_type
= build_pointer_type (void_type_node
);
3065 else if (code1
== POINTER_TYPE
&& code2
== INTEGER_TYPE
)
3067 if (!integer_zerop (op2
))
3068 pedwarn ("pointer/integer type mismatch in conditional expression");
3071 op2
= null_pointer_node
;
3073 result_type
= type1
;
3075 else if (code2
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3077 if (!integer_zerop (op1
))
3078 pedwarn ("pointer/integer type mismatch in conditional expression");
3081 op1
= null_pointer_node
;
3083 result_type
= type2
;
3088 if (flag_cond_mismatch
)
3089 result_type
= void_type_node
;
3092 error ("type mismatch in conditional expression");
3093 return error_mark_node
;
3097 /* Merge const and volatile flags of the incoming types. */
3099 = build_type_variant (result_type
,
3100 TREE_READONLY (op1
) || TREE_READONLY (op2
),
3101 TREE_THIS_VOLATILE (op1
) || TREE_THIS_VOLATILE (op2
));
3103 if (result_type
!= TREE_TYPE (op1
))
3104 op1
= convert_and_check (result_type
, op1
);
3105 if (result_type
!= TREE_TYPE (op2
))
3106 op2
= convert_and_check (result_type
, op2
);
3108 if (TREE_CODE (ifexp
) == INTEGER_CST
)
3109 return non_lvalue (integer_zerop (ifexp
) ? op2
: op1
);
3111 return fold (build3 (COND_EXPR
, result_type
, ifexp
, op1
, op2
));
3114 /* Return a compound expression that performs two expressions and
3115 returns the value of the second of them. */
3118 build_compound_expr (tree expr1
, tree expr2
)
3120 /* Convert arrays and functions to pointers. */
3121 expr2
= default_function_array_conversion (expr2
);
3123 if (!TREE_SIDE_EFFECTS (expr1
))
3125 /* The left-hand operand of a comma expression is like an expression
3126 statement: with -Wextra or -Wunused, we should warn if it doesn't have
3127 any side-effects, unless it was explicitly cast to (void). */
3128 if (warn_unused_value
)
3130 if (VOID_TYPE_P (TREE_TYPE (expr1
))
3131 && TREE_CODE (expr1
) == CONVERT_EXPR
)
3133 else if (VOID_TYPE_P (TREE_TYPE (expr1
))
3134 && TREE_CODE (expr1
) == COMPOUND_EXPR
3135 && TREE_CODE (TREE_OPERAND (expr1
, 1)) == CONVERT_EXPR
)
3136 ; /* (void) a, (void) b, c */
3138 warning (0, "left-hand operand of comma expression has no effect");
3142 /* With -Wunused, we should also warn if the left-hand operand does have
3143 side-effects, but computes a value which is not used. For example, in
3144 `foo() + bar(), baz()' the result of the `+' operator is not used,
3145 so we should issue a warning. */
3146 else if (warn_unused_value
)
3147 warn_if_unused_value (expr1
, input_location
);
3149 return build2 (COMPOUND_EXPR
, TREE_TYPE (expr2
), expr1
, expr2
);
3152 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3155 build_c_cast (tree type
, tree expr
)
3159 if (type
== error_mark_node
|| expr
== error_mark_node
)
3160 return error_mark_node
;
3162 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
3163 only in <protocol> qualifications. But when constructing cast expressions,
3164 the protocols do matter and must be kept around. */
3165 if (objc_is_object_ptr (type
) && objc_is_object_ptr (TREE_TYPE (expr
)))
3166 return build1 (NOP_EXPR
, type
, expr
);
3168 type
= TYPE_MAIN_VARIANT (type
);
3170 if (TREE_CODE (type
) == ARRAY_TYPE
)
3172 error ("cast specifies array type");
3173 return error_mark_node
;
3176 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3178 error ("cast specifies function type");
3179 return error_mark_node
;
3182 if (type
== TYPE_MAIN_VARIANT (TREE_TYPE (value
)))
3186 if (TREE_CODE (type
) == RECORD_TYPE
3187 || TREE_CODE (type
) == UNION_TYPE
)
3188 pedwarn ("ISO C forbids casting nonscalar to the same type");
3191 else if (TREE_CODE (type
) == UNION_TYPE
)
3194 value
= default_function_array_conversion (value
);
3196 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
3197 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field
)),
3198 TYPE_MAIN_VARIANT (TREE_TYPE (value
))))
3206 pedwarn ("ISO C forbids casts to union type");
3207 t
= digest_init (type
,
3208 build_constructor (type
,
3209 build_tree_list (field
, value
)),
3211 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
3212 TREE_INVARIANT (t
) = TREE_INVARIANT (value
);
3215 error ("cast to union type from type not present in union");
3216 return error_mark_node
;
3222 /* If casting to void, avoid the error that would come
3223 from default_conversion in the case of a non-lvalue array. */
3224 if (type
== void_type_node
)
3225 return build1 (CONVERT_EXPR
, type
, value
);
3227 /* Convert functions and arrays to pointers,
3228 but don't convert any other types. */
3229 value
= default_function_array_conversion (value
);
3230 otype
= TREE_TYPE (value
);
3232 /* Optionally warn about potentially worrisome casts. */
3235 && TREE_CODE (type
) == POINTER_TYPE
3236 && TREE_CODE (otype
) == POINTER_TYPE
)
3238 tree in_type
= type
;
3239 tree in_otype
= otype
;
3243 /* Check that the qualifiers on IN_TYPE are a superset of
3244 the qualifiers of IN_OTYPE. The outermost level of
3245 POINTER_TYPE nodes is uninteresting and we stop as soon
3246 as we hit a non-POINTER_TYPE node on either type. */
3249 in_otype
= TREE_TYPE (in_otype
);
3250 in_type
= TREE_TYPE (in_type
);
3252 /* GNU C allows cv-qualified function types. 'const'
3253 means the function is very pure, 'volatile' means it
3254 can't return. We need to warn when such qualifiers
3255 are added, not when they're taken away. */
3256 if (TREE_CODE (in_otype
) == FUNCTION_TYPE
3257 && TREE_CODE (in_type
) == FUNCTION_TYPE
)
3258 added
|= (TYPE_QUALS (in_type
) & ~TYPE_QUALS (in_otype
));
3260 discarded
|= (TYPE_QUALS (in_otype
) & ~TYPE_QUALS (in_type
));
3262 while (TREE_CODE (in_type
) == POINTER_TYPE
3263 && TREE_CODE (in_otype
) == POINTER_TYPE
);
3266 warning (0, "cast adds new qualifiers to function type");
3269 /* There are qualifiers present in IN_OTYPE that are not
3270 present in IN_TYPE. */
3271 warning (0, "cast discards qualifiers from pointer target type");
3274 /* Warn about possible alignment problems. */
3275 if (STRICT_ALIGNMENT
&& warn_cast_align
3276 && TREE_CODE (type
) == POINTER_TYPE
3277 && TREE_CODE (otype
) == POINTER_TYPE
3278 && TREE_CODE (TREE_TYPE (otype
)) != VOID_TYPE
3279 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
3280 /* Don't warn about opaque types, where the actual alignment
3281 restriction is unknown. */
3282 && !((TREE_CODE (TREE_TYPE (otype
)) == UNION_TYPE
3283 || TREE_CODE (TREE_TYPE (otype
)) == RECORD_TYPE
)
3284 && TYPE_MODE (TREE_TYPE (otype
)) == VOIDmode
)
3285 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (otype
)))
3286 warning (0, "cast increases required alignment of target type");
3288 if (warn_pointer_to_int_cast
3289 && TREE_CODE (type
) == INTEGER_TYPE
3290 && TREE_CODE (otype
) == POINTER_TYPE
3291 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
3292 && !TREE_CONSTANT (value
))
3293 warning (0, "cast from pointer to integer of different size");
3295 if (warn_bad_function_cast
3296 && TREE_CODE (value
) == CALL_EXPR
3297 && TREE_CODE (type
) != TREE_CODE (otype
))
3298 warning (0, "cast from function call of type %qT to non-matching "
3299 "type %qT", otype
, type
);
3301 if (warn_int_to_pointer_cast
3302 && TREE_CODE (type
) == POINTER_TYPE
3303 && TREE_CODE (otype
) == INTEGER_TYPE
3304 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
3305 /* Don't warn about converting any constant. */
3306 && !TREE_CONSTANT (value
))
3307 warning (0, "cast to pointer from integer of different size");
3309 if (TREE_CODE (type
) == POINTER_TYPE
3310 && TREE_CODE (otype
) == POINTER_TYPE
3311 && TREE_CODE (expr
) == ADDR_EXPR
3312 && DECL_P (TREE_OPERAND (expr
, 0))
3313 && flag_strict_aliasing
&& warn_strict_aliasing
3314 && !VOID_TYPE_P (TREE_TYPE (type
)))
3316 /* Casting the address of a decl to non void pointer. Warn
3317 if the cast breaks type based aliasing. */
3318 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)))
3319 warning (0, "type-punning to incomplete type might break strict-aliasing rules");
3322 HOST_WIDE_INT set1
= get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
3323 HOST_WIDE_INT set2
= get_alias_set (TREE_TYPE (type
));
3325 if (!alias_sets_conflict_p (set1
, set2
))
3326 warning (0, "dereferencing type-punned pointer will break strict-aliasing rules");
3327 else if (warn_strict_aliasing
> 1
3328 && !alias_sets_might_conflict_p (set1
, set2
))
3329 warning (0, "dereferencing type-punned pointer might break strict-aliasing rules");
3333 /* If pedantic, warn for conversions between function and object
3334 pointer types, except for converting a null pointer constant
3335 to function pointer type. */
3337 && TREE_CODE (type
) == POINTER_TYPE
3338 && TREE_CODE (otype
) == POINTER_TYPE
3339 && TREE_CODE (TREE_TYPE (otype
)) == FUNCTION_TYPE
3340 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
3341 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3344 && TREE_CODE (type
) == POINTER_TYPE
3345 && TREE_CODE (otype
) == POINTER_TYPE
3346 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
3347 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
3348 && !(integer_zerop (value
) && TREE_TYPE (otype
) == void_type_node
3349 && TREE_CODE (expr
) != NOP_EXPR
))
3350 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3353 value
= convert (type
, value
);
3355 /* Ignore any integer overflow caused by the cast. */
3356 if (TREE_CODE (value
) == INTEGER_CST
)
3358 if (EXPR_P (ovalue
))
3359 /* If OVALUE had overflow set, then so will VALUE, so it
3360 is safe to overwrite. */
3361 TREE_OVERFLOW (value
) = TREE_OVERFLOW (ovalue
);
3363 TREE_OVERFLOW (value
) = 0;
3365 if (CONSTANT_CLASS_P (ovalue
))
3366 /* Similarly, constant_overflow cannot have become
3368 TREE_CONSTANT_OVERFLOW (value
) = TREE_CONSTANT_OVERFLOW (ovalue
);
3372 /* Don't let a cast be an lvalue. */
3374 value
= non_lvalue (value
);
3379 /* Interpret a cast of expression EXPR to type TYPE. */
3381 c_cast_expr (struct c_type_name
*type_name
, tree expr
)
3384 int saved_wsp
= warn_strict_prototypes
;
3386 /* This avoids warnings about unprototyped casts on
3387 integers. E.g. "#define SIG_DFL (void(*)())0". */
3388 if (TREE_CODE (expr
) == INTEGER_CST
)
3389 warn_strict_prototypes
= 0;
3390 type
= groktypename (type_name
);
3391 warn_strict_prototypes
= saved_wsp
;
3393 return build_c_cast (type
, expr
);
3397 /* Build an assignment expression of lvalue LHS from value RHS.
3398 MODIFYCODE is the code for a binary operator that we use
3399 to combine the old value of LHS with RHS to get the new value.
3400 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3403 build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
)
3407 tree lhstype
= TREE_TYPE (lhs
);
3408 tree olhstype
= lhstype
;
3410 /* Types that aren't fully specified cannot be used in assignments. */
3411 lhs
= require_complete_type (lhs
);
3413 /* Avoid duplicate error messages from operands that had errors. */
3414 if (TREE_CODE (lhs
) == ERROR_MARK
|| TREE_CODE (rhs
) == ERROR_MARK
)
3415 return error_mark_node
;
3417 STRIP_TYPE_NOPS (rhs
);
3421 /* If a binary op has been requested, combine the old LHS value with the RHS
3422 producing the value we should actually store into the LHS. */
3424 if (modifycode
!= NOP_EXPR
)
3426 lhs
= stabilize_reference (lhs
);
3427 newrhs
= build_binary_op (modifycode
, lhs
, rhs
, 1);
3430 if (!lvalue_or_else (lhs
, lv_assign
))
3431 return error_mark_node
;
3433 /* Give an error for storing in something that is 'const'. */
3435 if (TREE_READONLY (lhs
) || TYPE_READONLY (lhstype
)
3436 || ((TREE_CODE (lhstype
) == RECORD_TYPE
3437 || TREE_CODE (lhstype
) == UNION_TYPE
)
3438 && C_TYPE_FIELDS_READONLY (lhstype
)))
3439 readonly_error (lhs
, lv_assign
);
3441 /* If storing into a structure or union member,
3442 it has probably been given type `int'.
3443 Compute the type that would go with
3444 the actual amount of storage the member occupies. */
3446 if (TREE_CODE (lhs
) == COMPONENT_REF
3447 && (TREE_CODE (lhstype
) == INTEGER_TYPE
3448 || TREE_CODE (lhstype
) == BOOLEAN_TYPE
3449 || TREE_CODE (lhstype
) == REAL_TYPE
3450 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
3451 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
3453 /* If storing in a field that is in actuality a short or narrower than one,
3454 we must store in the field in its actual type. */
3456 if (lhstype
!= TREE_TYPE (lhs
))
3458 lhs
= copy_node (lhs
);
3459 TREE_TYPE (lhs
) = lhstype
;
3462 /* Convert new value to destination type. */
3464 newrhs
= convert_for_assignment (lhstype
, newrhs
, ic_assign
,
3465 NULL_TREE
, NULL_TREE
, 0);
3466 if (TREE_CODE (newrhs
) == ERROR_MARK
)
3467 return error_mark_node
;
3469 /* Scan operands. */
3471 result
= build2 (MODIFY_EXPR
, lhstype
, lhs
, newrhs
);
3472 TREE_SIDE_EFFECTS (result
) = 1;
3474 /* If we got the LHS in a different type for storing in,
3475 convert the result back to the nominal type of LHS
3476 so that the value we return always has the same type
3477 as the LHS argument. */
3479 if (olhstype
== TREE_TYPE (result
))
3481 return convert_for_assignment (olhstype
, result
, ic_assign
,
3482 NULL_TREE
, NULL_TREE
, 0);
3485 /* Convert value RHS to type TYPE as preparation for an assignment
3486 to an lvalue of type TYPE.
3487 The real work of conversion is done by `convert'.
3488 The purpose of this function is to generate error messages
3489 for assignments that are not allowed in C.
3490 ERRTYPE says whether it is argument passing, assignment,
3491 initialization or return.
3493 FUNCTION is a tree for the function being called.
3494 PARMNUM is the number of the argument, for printing in error messages. */
3497 convert_for_assignment (tree type
, tree rhs
, enum impl_conv errtype
,
3498 tree fundecl
, tree function
, int parmnum
)
3500 enum tree_code codel
= TREE_CODE (type
);
3502 enum tree_code coder
;
3503 tree rname
= NULL_TREE
;
3505 if (errtype
== ic_argpass
|| errtype
== ic_argpass_nonproto
)
3508 /* Change pointer to function to the function itself for
3510 if (TREE_CODE (function
) == ADDR_EXPR
3511 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
3512 function
= TREE_OPERAND (function
, 0);
3514 /* Handle an ObjC selector specially for diagnostics. */
3515 selector
= objc_message_selector ();
3517 if (selector
&& parmnum
> 2)
3524 /* This macro is used to emit diagnostics to ensure that all format
3525 strings are complete sentences, visible to gettext and checked at
3527 #define WARN_FOR_ASSIGNMENT(AR, AS, IN, RE) \
3532 pedwarn (AR, parmnum, rname); \
3534 case ic_argpass_nonproto: \
3535 warning (0, AR, parmnum, rname); \
3547 gcc_unreachable (); \
3551 STRIP_TYPE_NOPS (rhs
);
3553 if (TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
3554 || TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
)
3555 rhs
= default_conversion (rhs
);
3556 else if (optimize
&& TREE_CODE (rhs
) == VAR_DECL
)
3557 rhs
= decl_constant_value_for_broken_optimization (rhs
);
3559 rhstype
= TREE_TYPE (rhs
);
3560 coder
= TREE_CODE (rhstype
);
3562 if (coder
== ERROR_MARK
)
3563 return error_mark_node
;
3565 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (rhstype
))
3567 overflow_warning (rhs
);
3568 /* Check for Objective-C protocols. This will automatically
3569 issue a warning if there are protocol violations. No need to
3570 use the return value. */
3571 if (c_dialect_objc ())
3572 objc_comptypes (type
, rhstype
, 0);
3576 if (coder
== VOID_TYPE
)
3578 /* Except for passing an argument to an unprototyped function,
3579 this is a constraint violation. When passing an argument to
3580 an unprototyped function, it is compile-time undefined;
3581 making it a constraint in that case was rejected in
3583 error ("void value not ignored as it ought to be");
3584 return error_mark_node
;
3586 /* A type converts to a reference to it.
3587 This code doesn't fully support references, it's just for the
3588 special case of va_start and va_copy. */
3589 if (codel
== REFERENCE_TYPE
3590 && comptypes (TREE_TYPE (type
), TREE_TYPE (rhs
)) == 1)
3592 if (!lvalue_p (rhs
))
3594 error ("cannot pass rvalue to reference parameter");
3595 return error_mark_node
;
3597 if (!c_mark_addressable (rhs
))
3598 return error_mark_node
;
3599 rhs
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (rhs
)), rhs
);
3601 /* We already know that these two types are compatible, but they
3602 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3603 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3604 likely to be va_list, a typedef to __builtin_va_list, which
3605 is different enough that it will cause problems later. */
3606 if (TREE_TYPE (TREE_TYPE (rhs
)) != TREE_TYPE (type
))
3607 rhs
= build1 (NOP_EXPR
, build_pointer_type (TREE_TYPE (type
)), rhs
);
3609 rhs
= build1 (NOP_EXPR
, type
, rhs
);
3612 /* Some types can interconvert without explicit casts. */
3613 else if (codel
== VECTOR_TYPE
&& coder
== VECTOR_TYPE
3614 && vector_types_convertible_p (type
, TREE_TYPE (rhs
)))
3615 return convert (type
, rhs
);
3616 /* Arithmetic types all interconvert, and enum is treated like int. */
3617 else if ((codel
== INTEGER_TYPE
|| codel
== REAL_TYPE
3618 || codel
== ENUMERAL_TYPE
|| codel
== COMPLEX_TYPE
3619 || codel
== BOOLEAN_TYPE
)
3620 && (coder
== INTEGER_TYPE
|| coder
== REAL_TYPE
3621 || coder
== ENUMERAL_TYPE
|| coder
== COMPLEX_TYPE
3622 || coder
== BOOLEAN_TYPE
))
3623 return convert_and_check (type
, rhs
);
3625 /* Conversion to a transparent union from its member types.
3626 This applies only to function arguments. */
3627 else if (codel
== UNION_TYPE
&& TYPE_TRANSPARENT_UNION (type
)
3628 && (errtype
== ic_argpass
|| errtype
== ic_argpass_nonproto
))
3631 tree marginal_memb_type
= 0;
3633 for (memb_types
= TYPE_FIELDS (type
); memb_types
;
3634 memb_types
= TREE_CHAIN (memb_types
))
3636 tree memb_type
= TREE_TYPE (memb_types
);
3638 if (comptypes (TYPE_MAIN_VARIANT (memb_type
),
3639 TYPE_MAIN_VARIANT (rhstype
)))
3642 if (TREE_CODE (memb_type
) != POINTER_TYPE
)
3645 if (coder
== POINTER_TYPE
)
3647 tree ttl
= TREE_TYPE (memb_type
);
3648 tree ttr
= TREE_TYPE (rhstype
);
3650 /* Any non-function converts to a [const][volatile] void *
3651 and vice versa; otherwise, targets must be the same.
3652 Meanwhile, the lhs target must have all the qualifiers of
3654 if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
3655 || comp_target_types (memb_type
, rhstype
, 0))
3657 /* If this type won't generate any warnings, use it. */
3658 if (TYPE_QUALS (ttl
) == TYPE_QUALS (ttr
)
3659 || ((TREE_CODE (ttr
) == FUNCTION_TYPE
3660 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
3661 ? ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
3662 == TYPE_QUALS (ttr
))
3663 : ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
3664 == TYPE_QUALS (ttl
))))
3667 /* Keep looking for a better type, but remember this one. */
3668 if (!marginal_memb_type
)
3669 marginal_memb_type
= memb_type
;
3673 /* Can convert integer zero to any pointer type. */
3674 if (integer_zerop (rhs
)
3675 || (TREE_CODE (rhs
) == NOP_EXPR
3676 && integer_zerop (TREE_OPERAND (rhs
, 0))))
3678 rhs
= null_pointer_node
;
3683 if (memb_types
|| marginal_memb_type
)
3687 /* We have only a marginally acceptable member type;
3688 it needs a warning. */
3689 tree ttl
= TREE_TYPE (marginal_memb_type
);
3690 tree ttr
= TREE_TYPE (rhstype
);
3692 /* Const and volatile mean something different for function
3693 types, so the usual warnings are not appropriate. */
3694 if (TREE_CODE (ttr
) == FUNCTION_TYPE
3695 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
3697 /* Because const and volatile on functions are
3698 restrictions that say the function will not do
3699 certain things, it is okay to use a const or volatile
3700 function where an ordinary one is wanted, but not
3702 if (TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
))
3703 WARN_FOR_ASSIGNMENT (N_("passing argument %d of %qE "
3704 "makes qualified function "
3705 "pointer from unqualified"),
3706 N_("assignment makes qualified "
3707 "function pointer from "
3709 N_("initialization makes qualified "
3710 "function pointer from "
3712 N_("return makes qualified function "
3713 "pointer from unqualified"));
3715 else if (TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
))
3716 WARN_FOR_ASSIGNMENT (N_("passing argument %d of %qE discards "
3717 "qualifiers from pointer target type"),
3718 N_("assignment discards qualifiers "
3719 "from pointer target type"),
3720 N_("initialization discards qualifiers "
3721 "from pointer target type"),
3722 N_("return discards qualifiers from "
3723 "pointer target type"));
3726 if (pedantic
&& !DECL_IN_SYSTEM_HEADER (fundecl
))
3727 pedwarn ("ISO C prohibits argument conversion to union type");
3729 return build1 (NOP_EXPR
, type
, rhs
);
3733 /* Conversions among pointers */
3734 else if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
3735 && (coder
== codel
))
3737 tree ttl
= TREE_TYPE (type
);
3738 tree ttr
= TREE_TYPE (rhstype
);
3741 bool is_opaque_pointer
;
3742 int target_cmp
= 0; /* Cache comp_target_types () result. */
3744 if (TREE_CODE (mvl
) != ARRAY_TYPE
)
3745 mvl
= TYPE_MAIN_VARIANT (mvl
);
3746 if (TREE_CODE (mvr
) != ARRAY_TYPE
)
3747 mvr
= TYPE_MAIN_VARIANT (mvr
);
3748 /* Opaque pointers are treated like void pointers. */
3749 is_opaque_pointer
= (targetm
.vector_opaque_p (type
)
3750 || targetm
.vector_opaque_p (rhstype
))
3751 && TREE_CODE (ttl
) == VECTOR_TYPE
3752 && TREE_CODE (ttr
) == VECTOR_TYPE
;
3754 /* Any non-function converts to a [const][volatile] void *
3755 and vice versa; otherwise, targets must be the same.
3756 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
3757 if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
3758 || (target_cmp
= comp_target_types (type
, rhstype
, 0))
3759 || is_opaque_pointer
3760 || (c_common_unsigned_type (mvl
)
3761 == c_common_unsigned_type (mvr
)))
3764 && ((VOID_TYPE_P (ttl
) && TREE_CODE (ttr
) == FUNCTION_TYPE
)
3767 /* Check TREE_CODE to catch cases like (void *) (char *) 0
3768 which are not ANSI null ptr constants. */
3769 && (!integer_zerop (rhs
) || TREE_CODE (rhs
) == NOP_EXPR
)
3770 && TREE_CODE (ttl
) == FUNCTION_TYPE
)))
3771 WARN_FOR_ASSIGNMENT (N_("ISO C forbids passing argument %d of "
3772 "%qE between function pointer "
3774 N_("ISO C forbids assignment between "
3775 "function pointer and %<void *%>"),
3776 N_("ISO C forbids initialization between "
3777 "function pointer and %<void *%>"),
3778 N_("ISO C forbids return between function "
3779 "pointer and %<void *%>"));
3780 /* Const and volatile mean something different for function types,
3781 so the usual warnings are not appropriate. */
3782 else if (TREE_CODE (ttr
) != FUNCTION_TYPE
3783 && TREE_CODE (ttl
) != FUNCTION_TYPE
)
3785 if (TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
))
3786 WARN_FOR_ASSIGNMENT (N_("passing argument %d of %qE discards "
3787 "qualifiers from pointer target type"),
3788 N_("assignment discards qualifiers "
3789 "from pointer target type"),
3790 N_("initialization discards qualifiers "
3791 "from pointer target type"),
3792 N_("return discards qualifiers from "
3793 "pointer target type"));
3794 /* If this is not a case of ignoring a mismatch in signedness,
3796 else if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
3799 /* If there is a mismatch, do warn. */
3800 else if (warn_pointer_sign
)
3801 WARN_FOR_ASSIGNMENT (N_("pointer targets in passing argument "
3802 "%d of %qE differ in signedness"),
3803 N_("pointer targets in assignment "
3804 "differ in signedness"),
3805 N_("pointer targets in initialization "
3806 "differ in signedness"),
3807 N_("pointer targets in return differ "
3810 else if (TREE_CODE (ttl
) == FUNCTION_TYPE
3811 && TREE_CODE (ttr
) == FUNCTION_TYPE
)
3813 /* Because const and volatile on functions are restrictions
3814 that say the function will not do certain things,
3815 it is okay to use a const or volatile function
3816 where an ordinary one is wanted, but not vice-versa. */
3817 if (TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
))
3818 WARN_FOR_ASSIGNMENT (N_("passing argument %d of %qE makes "
3819 "qualified function pointer "
3820 "from unqualified"),
3821 N_("assignment makes qualified function "
3822 "pointer from unqualified"),
3823 N_("initialization makes qualified "
3824 "function pointer from unqualified"),
3825 N_("return makes qualified function "
3826 "pointer from unqualified"));
3830 WARN_FOR_ASSIGNMENT (N_("passing argument %d of %qE from "
3831 "incompatible pointer type"),
3832 N_("assignment from incompatible pointer type"),
3833 N_("initialization from incompatible "
3835 N_("return from incompatible pointer type"));
3836 return convert (type
, rhs
);
3838 else if (codel
== POINTER_TYPE
&& coder
== ARRAY_TYPE
)
3840 /* ??? This should not be an error when inlining calls to
3841 unprototyped functions. */
3842 error ("invalid use of non-lvalue array");
3843 return error_mark_node
;
3845 else if (codel
== POINTER_TYPE
&& coder
== INTEGER_TYPE
)
3847 /* An explicit constant 0 can convert to a pointer,
3848 or one that results from arithmetic, even including
3849 a cast to integer type. */
3850 if (!(TREE_CODE (rhs
) == INTEGER_CST
&& integer_zerop (rhs
))
3852 !(TREE_CODE (rhs
) == NOP_EXPR
3853 && TREE_CODE (TREE_TYPE (rhs
)) == INTEGER_TYPE
3854 && TREE_CODE (TREE_OPERAND (rhs
, 0)) == INTEGER_CST
3855 && integer_zerop (TREE_OPERAND (rhs
, 0))))
3856 WARN_FOR_ASSIGNMENT (N_("passing argument %d of %qE makes "
3857 "pointer from integer without a cast"),
3858 N_("assignment makes pointer from integer "
3860 N_("initialization makes pointer from "
3861 "integer without a cast"),
3862 N_("return makes pointer from integer "
3865 return convert (type
, rhs
);
3867 else if (codel
== INTEGER_TYPE
&& coder
== POINTER_TYPE
)
3869 WARN_FOR_ASSIGNMENT (N_("passing argument %d of %qE makes integer "
3870 "from pointer without a cast"),
3871 N_("assignment makes integer from pointer "
3873 N_("initialization makes integer from pointer "
3875 N_("return makes integer from pointer "
3877 return convert (type
, rhs
);
3879 else if (codel
== BOOLEAN_TYPE
&& coder
== POINTER_TYPE
)
3880 return convert (type
, rhs
);
3885 case ic_argpass_nonproto
:
3886 /* ??? This should not be an error when inlining calls to
3887 unprototyped functions. */
3888 error ("incompatible type for argument %d of %qE", parmnum
, rname
);
3891 error ("incompatible types in assignment");
3894 error ("incompatible types in initialization");
3897 error ("incompatible types in return");
3903 return error_mark_node
;
3906 /* Convert VALUE for assignment into inlined parameter PARM. ARGNUM
3907 is used for error and waring reporting and indicates which argument
3908 is being processed. */
3911 c_convert_parm_for_inlining (tree parm
, tree value
, tree fn
, int argnum
)
3915 /* If FN was prototyped, the value has been converted already
3916 in convert_arguments. */
3917 if (!value
|| TYPE_ARG_TYPES (TREE_TYPE (fn
)))
3920 type
= TREE_TYPE (parm
);
3921 ret
= convert_for_assignment (type
, value
,
3922 ic_argpass_nonproto
, fn
,
3924 if (targetm
.calls
.promote_prototypes (TREE_TYPE (fn
))
3925 && INTEGRAL_TYPE_P (type
)
3926 && (TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)))
3927 ret
= default_conversion (ret
);
3931 /* If VALUE is a compound expr all of whose expressions are constant, then
3932 return its value. Otherwise, return error_mark_node.
3934 This is for handling COMPOUND_EXPRs as initializer elements
3935 which is allowed with a warning when -pedantic is specified. */
3938 valid_compound_expr_initializer (tree value
, tree endtype
)
3940 if (TREE_CODE (value
) == COMPOUND_EXPR
)
3942 if (valid_compound_expr_initializer (TREE_OPERAND (value
, 0), endtype
)
3944 return error_mark_node
;
3945 return valid_compound_expr_initializer (TREE_OPERAND (value
, 1),
3948 else if (!initializer_constant_valid_p (value
, endtype
))
3949 return error_mark_node
;
3954 /* Perform appropriate conversions on the initial value of a variable,
3955 store it in the declaration DECL,
3956 and print any error messages that are appropriate.
3957 If the init is invalid, store an ERROR_MARK. */
3960 store_init_value (tree decl
, tree init
)
3964 /* If variable's type was invalidly declared, just ignore it. */
3966 type
= TREE_TYPE (decl
);
3967 if (TREE_CODE (type
) == ERROR_MARK
)
3970 /* Digest the specified initializer into an expression. */
3972 value
= digest_init (type
, init
, true, TREE_STATIC (decl
));
3974 /* Store the expression if valid; else report error. */
3976 if (warn_traditional
&& !in_system_header
3977 && AGGREGATE_TYPE_P (TREE_TYPE (decl
)) && !TREE_STATIC (decl
))
3978 warning (0, "traditional C rejects automatic aggregate initialization");
3980 DECL_INITIAL (decl
) = value
;
3982 /* ANSI wants warnings about out-of-range constant initializers. */
3983 STRIP_TYPE_NOPS (value
);
3984 constant_expression_warning (value
);
3986 /* Check if we need to set array size from compound literal size. */
3987 if (TREE_CODE (type
) == ARRAY_TYPE
3988 && TYPE_DOMAIN (type
) == 0
3989 && value
!= error_mark_node
)
3991 tree inside_init
= init
;
3993 STRIP_TYPE_NOPS (inside_init
);
3994 inside_init
= fold (inside_init
);
3996 if (TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
3998 tree decl
= COMPOUND_LITERAL_EXPR_DECL (inside_init
);
4000 if (TYPE_DOMAIN (TREE_TYPE (decl
)))
4002 /* For int foo[] = (int [3]){1}; we need to set array size
4003 now since later on array initializer will be just the
4004 brace enclosed list of the compound literal. */
4005 TYPE_DOMAIN (type
) = TYPE_DOMAIN (TREE_TYPE (decl
));
4007 layout_decl (decl
, 0);
4013 /* Methods for storing and printing names for error messages. */
4015 /* Implement a spelling stack that allows components of a name to be pushed
4016 and popped. Each element on the stack is this structure. */
4028 #define SPELLING_STRING 1
4029 #define SPELLING_MEMBER 2
4030 #define SPELLING_BOUNDS 3
4032 static struct spelling
*spelling
; /* Next stack element (unused). */
4033 static struct spelling
*spelling_base
; /* Spelling stack base. */
4034 static int spelling_size
; /* Size of the spelling stack. */
4036 /* Macros to save and restore the spelling stack around push_... functions.
4037 Alternative to SAVE_SPELLING_STACK. */
4039 #define SPELLING_DEPTH() (spelling - spelling_base)
4040 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
4042 /* Push an element on the spelling stack with type KIND and assign VALUE
4045 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4047 int depth = SPELLING_DEPTH (); \
4049 if (depth >= spelling_size) \
4051 spelling_size += 10; \
4052 spelling_base = XRESIZEVEC (struct spelling, spelling_base, \
4054 RESTORE_SPELLING_DEPTH (depth); \
4057 spelling->kind = (KIND); \
4058 spelling->MEMBER = (VALUE); \
4062 /* Push STRING on the stack. Printed literally. */
4065 push_string (const char *string
)
4067 PUSH_SPELLING (SPELLING_STRING
, string
, u
.s
);
4070 /* Push a member name on the stack. Printed as '.' STRING. */
4073 push_member_name (tree decl
)
4075 const char *const string
4076 = DECL_NAME (decl
) ? IDENTIFIER_POINTER (DECL_NAME (decl
)) : "<anonymous>";
4077 PUSH_SPELLING (SPELLING_MEMBER
, string
, u
.s
);
4080 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4083 push_array_bounds (int bounds
)
4085 PUSH_SPELLING (SPELLING_BOUNDS
, bounds
, u
.i
);
4088 /* Compute the maximum size in bytes of the printed spelling. */
4091 spelling_length (void)
4096 for (p
= spelling_base
; p
< spelling
; p
++)
4098 if (p
->kind
== SPELLING_BOUNDS
)
4101 size
+= strlen (p
->u
.s
) + 1;
4107 /* Print the spelling to BUFFER and return it. */
4110 print_spelling (char *buffer
)
4115 for (p
= spelling_base
; p
< spelling
; p
++)
4116 if (p
->kind
== SPELLING_BOUNDS
)
4118 sprintf (d
, "[%d]", p
->u
.i
);
4124 if (p
->kind
== SPELLING_MEMBER
)
4126 for (s
= p
->u
.s
; (*d
= *s
++); d
++)
4133 /* Issue an error message for a bad initializer component.
4134 MSGID identifies the message.
4135 The component name is taken from the spelling stack. */
4138 error_init (const char *msgid
)
4142 error ("%s", _(msgid
));
4143 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4145 error ("(near initialization for %qs)", ofwhat
);
4148 /* Issue a pedantic warning for a bad initializer component.
4149 MSGID identifies the message.
4150 The component name is taken from the spelling stack. */
4153 pedwarn_init (const char *msgid
)
4157 pedwarn ("%s", _(msgid
));
4158 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4160 pedwarn ("(near initialization for %qs)", ofwhat
);
4163 /* Issue a warning for a bad initializer component.
4164 MSGID identifies the message.
4165 The component name is taken from the spelling stack. */
4168 warning_init (const char *msgid
)
4172 warning (0, "%s", _(msgid
));
4173 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4175 warning (0, "(near initialization for %qs)", ofwhat
);
4178 /* If TYPE is an array type and EXPR is a parenthesized string
4179 constant, warn if pedantic that EXPR is being used to initialize an
4180 object of type TYPE. */
4183 maybe_warn_string_init (tree type
, struct c_expr expr
)
4186 && TREE_CODE (type
) == ARRAY_TYPE
4187 && TREE_CODE (expr
.value
) == STRING_CST
4188 && expr
.original_code
!= STRING_CST
)
4189 pedwarn_init ("array initialized from parenthesized string constant");
4192 /* Digest the parser output INIT as an initializer for type TYPE.
4193 Return a C expression of type TYPE to represent the initial value.
4195 If INIT is a string constant, STRICT_STRING is true if it is
4196 unparenthesized or we should not warn here for it being parenthesized.
4197 For other types of INIT, STRICT_STRING is not used.
4199 REQUIRE_CONSTANT requests an error if non-constant initializers or
4200 elements are seen. */
4203 digest_init (tree type
, tree init
, bool strict_string
, int require_constant
)
4205 enum tree_code code
= TREE_CODE (type
);
4206 tree inside_init
= init
;
4208 if (type
== error_mark_node
4209 || init
== error_mark_node
4210 || TREE_TYPE (init
) == error_mark_node
)
4211 return error_mark_node
;
4213 STRIP_TYPE_NOPS (inside_init
);
4215 inside_init
= fold (inside_init
);
4217 /* Initialization of an array of chars from a string constant
4218 optionally enclosed in braces. */
4220 if (code
== ARRAY_TYPE
&& inside_init
4221 && TREE_CODE (inside_init
) == STRING_CST
)
4223 tree typ1
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
4224 /* Note that an array could be both an array of character type
4225 and an array of wchar_t if wchar_t is signed char or unsigned
4227 bool char_array
= (typ1
== char_type_node
4228 || typ1
== signed_char_type_node
4229 || typ1
== unsigned_char_type_node
);
4230 bool wchar_array
= !!comptypes (typ1
, wchar_type_node
);
4231 if (char_array
|| wchar_array
)
4235 expr
.value
= inside_init
;
4236 expr
.original_code
= (strict_string
? STRING_CST
: ERROR_MARK
);
4237 maybe_warn_string_init (type
, expr
);
4240 = (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init
)))
4243 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4244 TYPE_MAIN_VARIANT (type
)))
4247 if (!wchar_array
&& !char_string
)
4249 error_init ("char-array initialized from wide string");
4250 return error_mark_node
;
4252 if (char_string
&& !char_array
)
4254 error_init ("wchar_t-array initialized from non-wide string");
4255 return error_mark_node
;
4258 TREE_TYPE (inside_init
) = type
;
4259 if (TYPE_DOMAIN (type
) != 0
4260 && TYPE_SIZE (type
) != 0
4261 && TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
4262 /* Subtract 1 (or sizeof (wchar_t))
4263 because it's ok to ignore the terminating null char
4264 that is counted in the length of the constant. */
4265 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type
),
4266 TREE_STRING_LENGTH (inside_init
)
4267 - ((TYPE_PRECISION (typ1
)
4268 != TYPE_PRECISION (char_type_node
))
4269 ? (TYPE_PRECISION (wchar_type_node
)
4272 pedwarn_init ("initializer-string for array of chars is too long");
4276 else if (INTEGRAL_TYPE_P (typ1
))
4278 error_init ("array of inappropriate type initialized "
4279 "from string constant");
4280 return error_mark_node
;
4284 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4285 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4286 below and handle as a constructor. */
4287 if (code
== VECTOR_TYPE
4288 && TREE_CODE (TREE_TYPE (inside_init
)) == VECTOR_TYPE
4289 && vector_types_convertible_p (TREE_TYPE (inside_init
), type
)
4290 && TREE_CONSTANT (inside_init
))
4292 if (TREE_CODE (inside_init
) == VECTOR_CST
4293 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4294 TYPE_MAIN_VARIANT (type
)))
4297 if (TREE_CODE (inside_init
) == CONSTRUCTOR
)
4301 /* Iterate through elements and check if all constructor
4302 elements are *_CSTs. */
4303 for (link
= CONSTRUCTOR_ELTS (inside_init
);
4305 link
= TREE_CHAIN (link
))
4306 if (! CONSTANT_CLASS_P (TREE_VALUE (link
)))
4310 return build_vector (type
, CONSTRUCTOR_ELTS (inside_init
));
4314 /* Any type can be initialized
4315 from an expression of the same type, optionally with braces. */
4317 if (inside_init
&& TREE_TYPE (inside_init
) != 0
4318 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4319 TYPE_MAIN_VARIANT (type
))
4320 || (code
== ARRAY_TYPE
4321 && comptypes (TREE_TYPE (inside_init
), type
))
4322 || (code
== VECTOR_TYPE
4323 && comptypes (TREE_TYPE (inside_init
), type
))
4324 || (code
== POINTER_TYPE
4325 && TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
4326 && comptypes (TREE_TYPE (TREE_TYPE (inside_init
)),
4328 || (code
== POINTER_TYPE
4329 && TREE_CODE (TREE_TYPE (inside_init
)) == FUNCTION_TYPE
4330 && comptypes (TREE_TYPE (inside_init
),
4331 TREE_TYPE (type
)))))
4333 if (code
== POINTER_TYPE
)
4335 inside_init
= default_function_array_conversion (inside_init
);
4337 if (TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
)
4339 error_init ("invalid use of non-lvalue array");
4340 return error_mark_node
;
4344 if (code
== VECTOR_TYPE
)
4345 /* Although the types are compatible, we may require a
4347 inside_init
= convert (type
, inside_init
);
4349 if (require_constant
&& !flag_isoc99
4350 && TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
4352 /* As an extension, allow initializing objects with static storage
4353 duration with compound literals (which are then treated just as
4354 the brace enclosed list they contain). */
4355 tree decl
= COMPOUND_LITERAL_EXPR_DECL (inside_init
);
4356 inside_init
= DECL_INITIAL (decl
);
4359 if (code
== ARRAY_TYPE
&& TREE_CODE (inside_init
) != STRING_CST
4360 && TREE_CODE (inside_init
) != CONSTRUCTOR
)
4362 error_init ("array initialized from non-constant array expression");
4363 return error_mark_node
;
4366 if (optimize
&& TREE_CODE (inside_init
) == VAR_DECL
)
4367 inside_init
= decl_constant_value_for_broken_optimization (inside_init
);
4369 /* Compound expressions can only occur here if -pedantic or
4370 -pedantic-errors is specified. In the later case, we always want
4371 an error. In the former case, we simply want a warning. */
4372 if (require_constant
&& pedantic
4373 && TREE_CODE (inside_init
) == COMPOUND_EXPR
)
4376 = valid_compound_expr_initializer (inside_init
,
4377 TREE_TYPE (inside_init
));
4378 if (inside_init
== error_mark_node
)
4379 error_init ("initializer element is not constant");
4381 pedwarn_init ("initializer element is not constant");
4382 if (flag_pedantic_errors
)
4383 inside_init
= error_mark_node
;
4385 else if (require_constant
4386 && !initializer_constant_valid_p (inside_init
,
4387 TREE_TYPE (inside_init
)))
4389 error_init ("initializer element is not constant");
4390 inside_init
= error_mark_node
;
4396 /* Handle scalar types, including conversions. */
4398 if (code
== INTEGER_TYPE
|| code
== REAL_TYPE
|| code
== POINTER_TYPE
4399 || code
== ENUMERAL_TYPE
|| code
== BOOLEAN_TYPE
|| code
== COMPLEX_TYPE
4400 || code
== VECTOR_TYPE
)
4402 /* Note that convert_for_assignment calls default_conversion
4403 for arrays and functions. We must not call it in the
4404 case where inside_init is a null pointer constant. */
4406 = convert_for_assignment (type
, init
, ic_init
,
4407 NULL_TREE
, NULL_TREE
, 0);
4409 /* Check to see if we have already given an error message. */
4410 if (inside_init
== error_mark_node
)
4412 else if (require_constant
&& !TREE_CONSTANT (inside_init
))
4414 error_init ("initializer element is not constant");
4415 inside_init
= error_mark_node
;
4417 else if (require_constant
4418 && !initializer_constant_valid_p (inside_init
,
4419 TREE_TYPE (inside_init
)))
4421 error_init ("initializer element is not computable at load time");
4422 inside_init
= error_mark_node
;
4428 /* Come here only for records and arrays. */
4430 if (COMPLETE_TYPE_P (type
) && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4432 error_init ("variable-sized object may not be initialized");
4433 return error_mark_node
;
4436 error_init ("invalid initializer");
4437 return error_mark_node
;
4440 /* Handle initializers that use braces. */
4442 /* Type of object we are accumulating a constructor for.
4443 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4444 static tree constructor_type
;
4446 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4448 static tree constructor_fields
;
4450 /* For an ARRAY_TYPE, this is the specified index
4451 at which to store the next element we get. */
4452 static tree constructor_index
;
4454 /* For an ARRAY_TYPE, this is the maximum index. */
4455 static tree constructor_max_index
;
4457 /* For a RECORD_TYPE, this is the first field not yet written out. */
4458 static tree constructor_unfilled_fields
;
4460 /* For an ARRAY_TYPE, this is the index of the first element
4461 not yet written out. */
4462 static tree constructor_unfilled_index
;
4464 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4465 This is so we can generate gaps between fields, when appropriate. */
4466 static tree constructor_bit_index
;
4468 /* If we are saving up the elements rather than allocating them,
4469 this is the list of elements so far (in reverse order,
4470 most recent first). */
4471 static tree constructor_elements
;
4473 /* 1 if constructor should be incrementally stored into a constructor chain,
4474 0 if all the elements should be kept in AVL tree. */
4475 static int constructor_incremental
;
4477 /* 1 if so far this constructor's elements are all compile-time constants. */
4478 static int constructor_constant
;
4480 /* 1 if so far this constructor's elements are all valid address constants. */
4481 static int constructor_simple
;
4483 /* 1 if this constructor is erroneous so far. */
4484 static int constructor_erroneous
;
4486 /* Structure for managing pending initializer elements, organized as an
4491 struct init_node
*left
, *right
;
4492 struct init_node
*parent
;
4498 /* Tree of pending elements at this constructor level.
4499 These are elements encountered out of order
4500 which belong at places we haven't reached yet in actually
4502 Will never hold tree nodes across GC runs. */
4503 static struct init_node
*constructor_pending_elts
;
4505 /* The SPELLING_DEPTH of this constructor. */
4506 static int constructor_depth
;
4508 /* DECL node for which an initializer is being read.
4509 0 means we are reading a constructor expression
4510 such as (struct foo) {...}. */
4511 static tree constructor_decl
;
4513 /* Nonzero if this is an initializer for a top-level decl. */
4514 static int constructor_top_level
;
4516 /* Nonzero if there were any member designators in this initializer. */
4517 static int constructor_designated
;
4519 /* Nesting depth of designator list. */
4520 static int designator_depth
;
4522 /* Nonzero if there were diagnosed errors in this designator list. */
4523 static int designator_errorneous
;
4526 /* This stack has a level for each implicit or explicit level of
4527 structuring in the initializer, including the outermost one. It
4528 saves the values of most of the variables above. */
4530 struct constructor_range_stack
;
4532 struct constructor_stack
4534 struct constructor_stack
*next
;
4539 tree unfilled_index
;
4540 tree unfilled_fields
;
4543 struct init_node
*pending_elts
;
4546 /* If value nonzero, this value should replace the entire
4547 constructor at this level. */
4548 struct c_expr replacement_value
;
4549 struct constructor_range_stack
*range_stack
;
4559 static struct constructor_stack
*constructor_stack
;
4561 /* This stack represents designators from some range designator up to
4562 the last designator in the list. */
4564 struct constructor_range_stack
4566 struct constructor_range_stack
*next
, *prev
;
4567 struct constructor_stack
*stack
;
4574 static struct constructor_range_stack
*constructor_range_stack
;
4576 /* This stack records separate initializers that are nested.
4577 Nested initializers can't happen in ANSI C, but GNU C allows them
4578 in cases like { ... (struct foo) { ... } ... }. */
4580 struct initializer_stack
4582 struct initializer_stack
*next
;
4584 struct constructor_stack
*constructor_stack
;
4585 struct constructor_range_stack
*constructor_range_stack
;
4587 struct spelling
*spelling
;
4588 struct spelling
*spelling_base
;
4591 char require_constant_value
;
4592 char require_constant_elements
;
4595 static struct initializer_stack
*initializer_stack
;
4597 /* Prepare to parse and output the initializer for variable DECL. */
4600 start_init (tree decl
, tree asmspec_tree ATTRIBUTE_UNUSED
, int top_level
)
4603 struct initializer_stack
*p
= xmalloc (sizeof (struct initializer_stack
));
4605 p
->decl
= constructor_decl
;
4606 p
->require_constant_value
= require_constant_value
;
4607 p
->require_constant_elements
= require_constant_elements
;
4608 p
->constructor_stack
= constructor_stack
;
4609 p
->constructor_range_stack
= constructor_range_stack
;
4610 p
->elements
= constructor_elements
;
4611 p
->spelling
= spelling
;
4612 p
->spelling_base
= spelling_base
;
4613 p
->spelling_size
= spelling_size
;
4614 p
->top_level
= constructor_top_level
;
4615 p
->next
= initializer_stack
;
4616 initializer_stack
= p
;
4618 constructor_decl
= decl
;
4619 constructor_designated
= 0;
4620 constructor_top_level
= top_level
;
4622 if (decl
!= 0 && decl
!= error_mark_node
)
4624 require_constant_value
= TREE_STATIC (decl
);
4625 require_constant_elements
4626 = ((TREE_STATIC (decl
) || (pedantic
&& !flag_isoc99
))
4627 /* For a scalar, you can always use any value to initialize,
4628 even within braces. */
4629 && (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
4630 || TREE_CODE (TREE_TYPE (decl
)) == RECORD_TYPE
4631 || TREE_CODE (TREE_TYPE (decl
)) == UNION_TYPE
4632 || TREE_CODE (TREE_TYPE (decl
)) == QUAL_UNION_TYPE
));
4633 locus
= IDENTIFIER_POINTER (DECL_NAME (decl
));
4637 require_constant_value
= 0;
4638 require_constant_elements
= 0;
4639 locus
= "(anonymous)";
4642 constructor_stack
= 0;
4643 constructor_range_stack
= 0;
4645 missing_braces_mentioned
= 0;
4649 RESTORE_SPELLING_DEPTH (0);
4652 push_string (locus
);
4658 struct initializer_stack
*p
= initializer_stack
;
4660 /* Free the whole constructor stack of this initializer. */
4661 while (constructor_stack
)
4663 struct constructor_stack
*q
= constructor_stack
;
4664 constructor_stack
= q
->next
;
4668 gcc_assert (!constructor_range_stack
);
4670 /* Pop back to the data of the outer initializer (if any). */
4671 free (spelling_base
);
4673 constructor_decl
= p
->decl
;
4674 require_constant_value
= p
->require_constant_value
;
4675 require_constant_elements
= p
->require_constant_elements
;
4676 constructor_stack
= p
->constructor_stack
;
4677 constructor_range_stack
= p
->constructor_range_stack
;
4678 constructor_elements
= p
->elements
;
4679 spelling
= p
->spelling
;
4680 spelling_base
= p
->spelling_base
;
4681 spelling_size
= p
->spelling_size
;
4682 constructor_top_level
= p
->top_level
;
4683 initializer_stack
= p
->next
;
4687 /* Call here when we see the initializer is surrounded by braces.
4688 This is instead of a call to push_init_level;
4689 it is matched by a call to pop_init_level.
4691 TYPE is the type to initialize, for a constructor expression.
4692 For an initializer for a decl, TYPE is zero. */
4695 really_start_incremental_init (tree type
)
4697 struct constructor_stack
*p
= XNEW (struct constructor_stack
);
4700 type
= TREE_TYPE (constructor_decl
);
4702 if (targetm
.vector_opaque_p (type
))
4703 error ("opaque vector types cannot be initialized");
4705 p
->type
= constructor_type
;
4706 p
->fields
= constructor_fields
;
4707 p
->index
= constructor_index
;
4708 p
->max_index
= constructor_max_index
;
4709 p
->unfilled_index
= constructor_unfilled_index
;
4710 p
->unfilled_fields
= constructor_unfilled_fields
;
4711 p
->bit_index
= constructor_bit_index
;
4712 p
->elements
= constructor_elements
;
4713 p
->constant
= constructor_constant
;
4714 p
->simple
= constructor_simple
;
4715 p
->erroneous
= constructor_erroneous
;
4716 p
->pending_elts
= constructor_pending_elts
;
4717 p
->depth
= constructor_depth
;
4718 p
->replacement_value
.value
= 0;
4719 p
->replacement_value
.original_code
= ERROR_MARK
;
4723 p
->incremental
= constructor_incremental
;
4724 p
->designated
= constructor_designated
;
4726 constructor_stack
= p
;
4728 constructor_constant
= 1;
4729 constructor_simple
= 1;
4730 constructor_depth
= SPELLING_DEPTH ();
4731 constructor_elements
= 0;
4732 constructor_pending_elts
= 0;
4733 constructor_type
= type
;
4734 constructor_incremental
= 1;
4735 constructor_designated
= 0;
4736 designator_depth
= 0;
4737 designator_errorneous
= 0;
4739 if (TREE_CODE (constructor_type
) == RECORD_TYPE
4740 || TREE_CODE (constructor_type
) == UNION_TYPE
)
4742 constructor_fields
= TYPE_FIELDS (constructor_type
);
4743 /* Skip any nameless bit fields at the beginning. */
4744 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
4745 && DECL_NAME (constructor_fields
) == 0)
4746 constructor_fields
= TREE_CHAIN (constructor_fields
);
4748 constructor_unfilled_fields
= constructor_fields
;
4749 constructor_bit_index
= bitsize_zero_node
;
4751 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
4753 if (TYPE_DOMAIN (constructor_type
))
4755 constructor_max_index
4756 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
4758 /* Detect non-empty initializations of zero-length arrays. */
4759 if (constructor_max_index
== NULL_TREE
4760 && TYPE_SIZE (constructor_type
))
4761 constructor_max_index
= build_int_cst (NULL_TREE
, -1);
4763 /* constructor_max_index needs to be an INTEGER_CST. Attempts
4764 to initialize VLAs will cause a proper error; avoid tree
4765 checking errors as well by setting a safe value. */
4766 if (constructor_max_index
4767 && TREE_CODE (constructor_max_index
) != INTEGER_CST
)
4768 constructor_max_index
= build_int_cst (NULL_TREE
, -1);
4771 = convert (bitsizetype
,
4772 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
4776 constructor_index
= bitsize_zero_node
;
4777 constructor_max_index
= NULL_TREE
;
4780 constructor_unfilled_index
= constructor_index
;
4782 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
4784 /* Vectors are like simple fixed-size arrays. */
4785 constructor_max_index
=
4786 build_int_cst (NULL_TREE
, TYPE_VECTOR_SUBPARTS (constructor_type
) - 1);
4787 constructor_index
= convert (bitsizetype
, bitsize_zero_node
);
4788 constructor_unfilled_index
= constructor_index
;
4792 /* Handle the case of int x = {5}; */
4793 constructor_fields
= constructor_type
;
4794 constructor_unfilled_fields
= constructor_type
;
4798 /* Push down into a subobject, for initialization.
4799 If this is for an explicit set of braces, IMPLICIT is 0.
4800 If it is because the next element belongs at a lower level,
4801 IMPLICIT is 1 (or 2 if the push is because of designator list). */
4804 push_init_level (int implicit
)
4806 struct constructor_stack
*p
;
4807 tree value
= NULL_TREE
;
4809 /* If we've exhausted any levels that didn't have braces,
4811 while (constructor_stack
->implicit
)
4813 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
4814 || TREE_CODE (constructor_type
) == UNION_TYPE
)
4815 && constructor_fields
== 0)
4816 process_init_element (pop_init_level (1));
4817 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
4818 && constructor_max_index
4819 && tree_int_cst_lt (constructor_max_index
, constructor_index
))
4820 process_init_element (pop_init_level (1));
4825 /* Unless this is an explicit brace, we need to preserve previous
4829 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
4830 || TREE_CODE (constructor_type
) == UNION_TYPE
)
4831 && constructor_fields
)
4832 value
= find_init_member (constructor_fields
);
4833 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
4834 value
= find_init_member (constructor_index
);
4837 p
= XNEW (struct constructor_stack
);
4838 p
->type
= constructor_type
;
4839 p
->fields
= constructor_fields
;
4840 p
->index
= constructor_index
;
4841 p
->max_index
= constructor_max_index
;
4842 p
->unfilled_index
= constructor_unfilled_index
;
4843 p
->unfilled_fields
= constructor_unfilled_fields
;
4844 p
->bit_index
= constructor_bit_index
;
4845 p
->elements
= constructor_elements
;
4846 p
->constant
= constructor_constant
;
4847 p
->simple
= constructor_simple
;
4848 p
->erroneous
= constructor_erroneous
;
4849 p
->pending_elts
= constructor_pending_elts
;
4850 p
->depth
= constructor_depth
;
4851 p
->replacement_value
.value
= 0;
4852 p
->replacement_value
.original_code
= ERROR_MARK
;
4853 p
->implicit
= implicit
;
4855 p
->incremental
= constructor_incremental
;
4856 p
->designated
= constructor_designated
;
4857 p
->next
= constructor_stack
;
4859 constructor_stack
= p
;
4861 constructor_constant
= 1;
4862 constructor_simple
= 1;
4863 constructor_depth
= SPELLING_DEPTH ();
4864 constructor_elements
= 0;
4865 constructor_incremental
= 1;
4866 constructor_designated
= 0;
4867 constructor_pending_elts
= 0;
4870 p
->range_stack
= constructor_range_stack
;
4871 constructor_range_stack
= 0;
4872 designator_depth
= 0;
4873 designator_errorneous
= 0;
4876 /* Don't die if an entire brace-pair level is superfluous
4877 in the containing level. */
4878 if (constructor_type
== 0)
4880 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
4881 || TREE_CODE (constructor_type
) == UNION_TYPE
)
4883 /* Don't die if there are extra init elts at the end. */
4884 if (constructor_fields
== 0)
4885 constructor_type
= 0;
4888 constructor_type
= TREE_TYPE (constructor_fields
);
4889 push_member_name (constructor_fields
);
4890 constructor_depth
++;
4893 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
4895 constructor_type
= TREE_TYPE (constructor_type
);
4896 push_array_bounds (tree_low_cst (constructor_index
, 0));
4897 constructor_depth
++;
4900 if (constructor_type
== 0)
4902 error_init ("extra brace group at end of initializer");
4903 constructor_fields
= 0;
4904 constructor_unfilled_fields
= 0;
4908 if (value
&& TREE_CODE (value
) == CONSTRUCTOR
)
4910 constructor_constant
= TREE_CONSTANT (value
);
4911 constructor_simple
= TREE_STATIC (value
);
4912 constructor_elements
= CONSTRUCTOR_ELTS (value
);
4913 if (constructor_elements
4914 && (TREE_CODE (constructor_type
) == RECORD_TYPE
4915 || TREE_CODE (constructor_type
) == ARRAY_TYPE
))
4916 set_nonincremental_init ();
4919 if (implicit
== 1 && warn_missing_braces
&& !missing_braces_mentioned
)
4921 missing_braces_mentioned
= 1;
4922 warning_init ("missing braces around initializer");
4925 if (TREE_CODE (constructor_type
) == RECORD_TYPE
4926 || TREE_CODE (constructor_type
) == UNION_TYPE
)
4928 constructor_fields
= TYPE_FIELDS (constructor_type
);
4929 /* Skip any nameless bit fields at the beginning. */
4930 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
4931 && DECL_NAME (constructor_fields
) == 0)
4932 constructor_fields
= TREE_CHAIN (constructor_fields
);
4934 constructor_unfilled_fields
= constructor_fields
;
4935 constructor_bit_index
= bitsize_zero_node
;
4937 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
4939 /* Vectors are like simple fixed-size arrays. */
4940 constructor_max_index
=
4941 build_int_cst (NULL_TREE
, TYPE_VECTOR_SUBPARTS (constructor_type
) - 1);
4942 constructor_index
= convert (bitsizetype
, integer_zero_node
);
4943 constructor_unfilled_index
= constructor_index
;
4945 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
4947 if (TYPE_DOMAIN (constructor_type
))
4949 constructor_max_index
4950 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
4952 /* Detect non-empty initializations of zero-length arrays. */
4953 if (constructor_max_index
== NULL_TREE
4954 && TYPE_SIZE (constructor_type
))
4955 constructor_max_index
= build_int_cst (NULL_TREE
, -1);
4957 /* constructor_max_index needs to be an INTEGER_CST. Attempts
4958 to initialize VLAs will cause a proper error; avoid tree
4959 checking errors as well by setting a safe value. */
4960 if (constructor_max_index
4961 && TREE_CODE (constructor_max_index
) != INTEGER_CST
)
4962 constructor_max_index
= build_int_cst (NULL_TREE
, -1);
4965 = convert (bitsizetype
,
4966 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
4969 constructor_index
= bitsize_zero_node
;
4971 constructor_unfilled_index
= constructor_index
;
4972 if (value
&& TREE_CODE (value
) == STRING_CST
)
4974 /* We need to split the char/wchar array into individual
4975 characters, so that we don't have to special case it
4977 set_nonincremental_init_from_string (value
);
4982 if (constructor_type
!= error_mark_node
)
4983 warning_init ("braces around scalar initializer");
4984 constructor_fields
= constructor_type
;
4985 constructor_unfilled_fields
= constructor_type
;
4989 /* At the end of an implicit or explicit brace level,
4990 finish up that level of constructor. If a single expression
4991 with redundant braces initialized that level, return the
4992 c_expr structure for that expression. Otherwise, the original_code
4993 element is set to ERROR_MARK.
4994 If we were outputting the elements as they are read, return 0 as the value
4995 from inner levels (process_init_element ignores that),
4996 but return error_mark_node as the value from the outermost level
4997 (that's what we want to put in DECL_INITIAL).
4998 Otherwise, return a CONSTRUCTOR expression as the value. */
5001 pop_init_level (int implicit
)
5003 struct constructor_stack
*p
;
5006 ret
.original_code
= ERROR_MARK
;
5010 /* When we come to an explicit close brace,
5011 pop any inner levels that didn't have explicit braces. */
5012 while (constructor_stack
->implicit
)
5013 process_init_element (pop_init_level (1));
5015 gcc_assert (!constructor_range_stack
);
5018 /* Now output all pending elements. */
5019 constructor_incremental
= 1;
5020 output_pending_init_elements (1);
5022 p
= constructor_stack
;
5024 /* Error for initializing a flexible array member, or a zero-length
5025 array member in an inappropriate context. */
5026 if (constructor_type
&& constructor_fields
5027 && TREE_CODE (constructor_type
) == ARRAY_TYPE
5028 && TYPE_DOMAIN (constructor_type
)
5029 && !TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
)))
5031 /* Silently discard empty initializations. The parser will
5032 already have pedwarned for empty brackets. */
5033 if (integer_zerop (constructor_unfilled_index
))
5034 constructor_type
= NULL_TREE
;
5037 gcc_assert (!TYPE_SIZE (constructor_type
));
5039 if (constructor_depth
> 2)
5040 error_init ("initialization of flexible array member in a nested context");
5042 pedwarn_init ("initialization of a flexible array member");
5044 /* We have already issued an error message for the existence
5045 of a flexible array member not at the end of the structure.
5046 Discard the initializer so that we do not die later. */
5047 if (TREE_CHAIN (constructor_fields
) != NULL_TREE
)
5048 constructor_type
= NULL_TREE
;
5052 /* Warn when some struct elements are implicitly initialized to zero. */
5053 if (warn_missing_field_initializers
5055 && TREE_CODE (constructor_type
) == RECORD_TYPE
5056 && constructor_unfilled_fields
)
5058 /* Do not warn for flexible array members or zero-length arrays. */
5059 while (constructor_unfilled_fields
5060 && (!DECL_SIZE (constructor_unfilled_fields
)
5061 || integer_zerop (DECL_SIZE (constructor_unfilled_fields
))))
5062 constructor_unfilled_fields
= TREE_CHAIN (constructor_unfilled_fields
);
5064 /* Do not warn if this level of the initializer uses member
5065 designators; it is likely to be deliberate. */
5066 if (constructor_unfilled_fields
&& !constructor_designated
)
5068 push_member_name (constructor_unfilled_fields
);
5069 warning_init ("missing initializer");
5070 RESTORE_SPELLING_DEPTH (constructor_depth
);
5074 /* Pad out the end of the structure. */
5075 if (p
->replacement_value
.value
)
5076 /* If this closes a superfluous brace pair,
5077 just pass out the element between them. */
5078 ret
= p
->replacement_value
;
5079 else if (constructor_type
== 0)
5081 else if (TREE_CODE (constructor_type
) != RECORD_TYPE
5082 && TREE_CODE (constructor_type
) != UNION_TYPE
5083 && TREE_CODE (constructor_type
) != ARRAY_TYPE
5084 && TREE_CODE (constructor_type
) != VECTOR_TYPE
)
5086 /* A nonincremental scalar initializer--just return
5087 the element, after verifying there is just one. */
5088 if (constructor_elements
== 0)
5090 if (!constructor_erroneous
)
5091 error_init ("empty scalar initializer");
5092 ret
.value
= error_mark_node
;
5094 else if (TREE_CHAIN (constructor_elements
) != 0)
5096 error_init ("extra elements in scalar initializer");
5097 ret
.value
= TREE_VALUE (constructor_elements
);
5100 ret
.value
= TREE_VALUE (constructor_elements
);
5104 if (constructor_erroneous
)
5105 ret
.value
= error_mark_node
;
5108 ret
.value
= build_constructor (constructor_type
,
5109 nreverse (constructor_elements
));
5110 if (constructor_constant
)
5111 TREE_CONSTANT (ret
.value
) = TREE_INVARIANT (ret
.value
) = 1;
5112 if (constructor_constant
&& constructor_simple
)
5113 TREE_STATIC (ret
.value
) = 1;
5117 constructor_type
= p
->type
;
5118 constructor_fields
= p
->fields
;
5119 constructor_index
= p
->index
;
5120 constructor_max_index
= p
->max_index
;
5121 constructor_unfilled_index
= p
->unfilled_index
;
5122 constructor_unfilled_fields
= p
->unfilled_fields
;
5123 constructor_bit_index
= p
->bit_index
;
5124 constructor_elements
= p
->elements
;
5125 constructor_constant
= p
->constant
;
5126 constructor_simple
= p
->simple
;
5127 constructor_erroneous
= p
->erroneous
;
5128 constructor_incremental
= p
->incremental
;
5129 constructor_designated
= p
->designated
;
5130 constructor_pending_elts
= p
->pending_elts
;
5131 constructor_depth
= p
->depth
;
5133 constructor_range_stack
= p
->range_stack
;
5134 RESTORE_SPELLING_DEPTH (constructor_depth
);
5136 constructor_stack
= p
->next
;
5141 if (constructor_stack
== 0)
5143 ret
.value
= error_mark_node
;
5151 /* Common handling for both array range and field name designators.
5152 ARRAY argument is nonzero for array ranges. Returns zero for success. */
5155 set_designator (int array
)
5158 enum tree_code subcode
;
5160 /* Don't die if an entire brace-pair level is superfluous
5161 in the containing level. */
5162 if (constructor_type
== 0)
5165 /* If there were errors in this designator list already, bail out
5167 if (designator_errorneous
)
5170 if (!designator_depth
)
5172 gcc_assert (!constructor_range_stack
);
5174 /* Designator list starts at the level of closest explicit
5176 while (constructor_stack
->implicit
)
5177 process_init_element (pop_init_level (1));
5178 constructor_designated
= 1;
5182 switch (TREE_CODE (constructor_type
))
5186 subtype
= TREE_TYPE (constructor_fields
);
5187 if (subtype
!= error_mark_node
)
5188 subtype
= TYPE_MAIN_VARIANT (subtype
);
5191 subtype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
5197 subcode
= TREE_CODE (subtype
);
5198 if (array
&& subcode
!= ARRAY_TYPE
)
5200 error_init ("array index in non-array initializer");
5203 else if (!array
&& subcode
!= RECORD_TYPE
&& subcode
!= UNION_TYPE
)
5205 error_init ("field name not in record or union initializer");
5209 constructor_designated
= 1;
5210 push_init_level (2);
5214 /* If there are range designators in designator list, push a new designator
5215 to constructor_range_stack. RANGE_END is end of such stack range or
5216 NULL_TREE if there is no range designator at this level. */
5219 push_range_stack (tree range_end
)
5221 struct constructor_range_stack
*p
;
5223 p
= GGC_NEW (struct constructor_range_stack
);
5224 p
->prev
= constructor_range_stack
;
5226 p
->fields
= constructor_fields
;
5227 p
->range_start
= constructor_index
;
5228 p
->index
= constructor_index
;
5229 p
->stack
= constructor_stack
;
5230 p
->range_end
= range_end
;
5231 if (constructor_range_stack
)
5232 constructor_range_stack
->next
= p
;
5233 constructor_range_stack
= p
;
5236 /* Within an array initializer, specify the next index to be initialized.
5237 FIRST is that index. If LAST is nonzero, then initialize a range
5238 of indices, running from FIRST through LAST. */
5241 set_init_index (tree first
, tree last
)
5243 if (set_designator (1))
5246 designator_errorneous
= 1;
5248 if (!INTEGRAL_TYPE_P (TREE_TYPE (first
))
5249 || (last
&& !INTEGRAL_TYPE_P (TREE_TYPE (last
))))
5251 error_init ("array index in initializer not of integer type");
5255 if (TREE_CODE (first
) != INTEGER_CST
)
5256 error_init ("nonconstant array index in initializer");
5257 else if (last
!= 0 && TREE_CODE (last
) != INTEGER_CST
)
5258 error_init ("nonconstant array index in initializer");
5259 else if (TREE_CODE (constructor_type
) != ARRAY_TYPE
)
5260 error_init ("array index in non-array initializer");
5261 else if (tree_int_cst_sgn (first
) == -1)
5262 error_init ("array index in initializer exceeds array bounds");
5263 else if (constructor_max_index
5264 && tree_int_cst_lt (constructor_max_index
, first
))
5265 error_init ("array index in initializer exceeds array bounds");
5268 constructor_index
= convert (bitsizetype
, first
);
5272 if (tree_int_cst_equal (first
, last
))
5274 else if (tree_int_cst_lt (last
, first
))
5276 error_init ("empty index range in initializer");
5281 last
= convert (bitsizetype
, last
);
5282 if (constructor_max_index
!= 0
5283 && tree_int_cst_lt (constructor_max_index
, last
))
5285 error_init ("array index range in initializer exceeds array bounds");
5292 designator_errorneous
= 0;
5293 if (constructor_range_stack
|| last
)
5294 push_range_stack (last
);
5298 /* Within a struct initializer, specify the next field to be initialized. */
5301 set_init_label (tree fieldname
)
5305 if (set_designator (0))
5308 designator_errorneous
= 1;
5310 if (TREE_CODE (constructor_type
) != RECORD_TYPE
5311 && TREE_CODE (constructor_type
) != UNION_TYPE
)
5313 error_init ("field name not in record or union initializer");
5317 for (tail
= TYPE_FIELDS (constructor_type
); tail
;
5318 tail
= TREE_CHAIN (tail
))
5320 if (DECL_NAME (tail
) == fieldname
)
5325 error ("unknown field %qE specified in initializer", fieldname
);
5328 constructor_fields
= tail
;
5330 designator_errorneous
= 0;
5331 if (constructor_range_stack
)
5332 push_range_stack (NULL_TREE
);
5336 /* Add a new initializer to the tree of pending initializers. PURPOSE
5337 identifies the initializer, either array index or field in a structure.
5338 VALUE is the value of that index or field. */
5341 add_pending_init (tree purpose
, tree value
)
5343 struct init_node
*p
, **q
, *r
;
5345 q
= &constructor_pending_elts
;
5348 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5353 if (tree_int_cst_lt (purpose
, p
->purpose
))
5355 else if (tree_int_cst_lt (p
->purpose
, purpose
))
5359 if (TREE_SIDE_EFFECTS (p
->value
))
5360 warning_init ("initialized field with side-effects overwritten");
5370 bitpos
= bit_position (purpose
);
5374 if (tree_int_cst_lt (bitpos
, bit_position (p
->purpose
)))
5376 else if (p
->purpose
!= purpose
)
5380 if (TREE_SIDE_EFFECTS (p
->value
))
5381 warning_init ("initialized field with side-effects overwritten");
5388 r
= GGC_NEW (struct init_node
);
5389 r
->purpose
= purpose
;
5400 struct init_node
*s
;
5404 if (p
->balance
== 0)
5406 else if (p
->balance
< 0)
5413 p
->left
->parent
= p
;
5430 constructor_pending_elts
= r
;
5435 struct init_node
*t
= r
->right
;
5439 r
->right
->parent
= r
;
5444 p
->left
->parent
= p
;
5447 p
->balance
= t
->balance
< 0;
5448 r
->balance
= -(t
->balance
> 0);
5463 constructor_pending_elts
= t
;
5469 /* p->balance == +1; growth of left side balances the node. */
5474 else /* r == p->right */
5476 if (p
->balance
== 0)
5477 /* Growth propagation from right side. */
5479 else if (p
->balance
> 0)
5486 p
->right
->parent
= p
;
5503 constructor_pending_elts
= r
;
5505 else /* r->balance == -1 */
5508 struct init_node
*t
= r
->left
;
5512 r
->left
->parent
= r
;
5517 p
->right
->parent
= p
;
5520 r
->balance
= (t
->balance
< 0);
5521 p
->balance
= -(t
->balance
> 0);
5536 constructor_pending_elts
= t
;
5542 /* p->balance == -1; growth of right side balances the node. */
5553 /* Build AVL tree from a sorted chain. */
5556 set_nonincremental_init (void)
5560 if (TREE_CODE (constructor_type
) != RECORD_TYPE
5561 && TREE_CODE (constructor_type
) != ARRAY_TYPE
)
5564 for (chain
= constructor_elements
; chain
; chain
= TREE_CHAIN (chain
))
5565 add_pending_init (TREE_PURPOSE (chain
), TREE_VALUE (chain
));
5566 constructor_elements
= 0;
5567 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
5569 constructor_unfilled_fields
= TYPE_FIELDS (constructor_type
);
5570 /* Skip any nameless bit fields at the beginning. */
5571 while (constructor_unfilled_fields
!= 0
5572 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
5573 && DECL_NAME (constructor_unfilled_fields
) == 0)
5574 constructor_unfilled_fields
= TREE_CHAIN (constructor_unfilled_fields
);
5577 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5579 if (TYPE_DOMAIN (constructor_type
))
5580 constructor_unfilled_index
5581 = convert (bitsizetype
,
5582 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
5584 constructor_unfilled_index
= bitsize_zero_node
;
5586 constructor_incremental
= 0;
5589 /* Build AVL tree from a string constant. */
5592 set_nonincremental_init_from_string (tree str
)
5594 tree value
, purpose
, type
;
5595 HOST_WIDE_INT val
[2];
5596 const char *p
, *end
;
5597 int byte
, wchar_bytes
, charwidth
, bitpos
;
5599 gcc_assert (TREE_CODE (constructor_type
) == ARRAY_TYPE
);
5601 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str
)))
5602 == TYPE_PRECISION (char_type_node
))
5606 gcc_assert (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str
)))
5607 == TYPE_PRECISION (wchar_type_node
));
5608 wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
5610 charwidth
= TYPE_PRECISION (char_type_node
);
5611 type
= TREE_TYPE (constructor_type
);
5612 p
= TREE_STRING_POINTER (str
);
5613 end
= p
+ TREE_STRING_LENGTH (str
);
5615 for (purpose
= bitsize_zero_node
;
5616 p
< end
&& !tree_int_cst_lt (constructor_max_index
, purpose
);
5617 purpose
= size_binop (PLUS_EXPR
, purpose
, bitsize_one_node
))
5619 if (wchar_bytes
== 1)
5621 val
[1] = (unsigned char) *p
++;
5628 for (byte
= 0; byte
< wchar_bytes
; byte
++)
5630 if (BYTES_BIG_ENDIAN
)
5631 bitpos
= (wchar_bytes
- byte
- 1) * charwidth
;
5633 bitpos
= byte
* charwidth
;
5634 val
[bitpos
< HOST_BITS_PER_WIDE_INT
]
5635 |= ((unsigned HOST_WIDE_INT
) ((unsigned char) *p
++))
5636 << (bitpos
% HOST_BITS_PER_WIDE_INT
);
5640 if (!TYPE_UNSIGNED (type
))
5642 bitpos
= ((wchar_bytes
- 1) * charwidth
) + HOST_BITS_PER_CHAR
;
5643 if (bitpos
< HOST_BITS_PER_WIDE_INT
)
5645 if (val
[1] & (((HOST_WIDE_INT
) 1) << (bitpos
- 1)))
5647 val
[1] |= ((HOST_WIDE_INT
) -1) << bitpos
;
5651 else if (bitpos
== HOST_BITS_PER_WIDE_INT
)
5656 else if (val
[0] & (((HOST_WIDE_INT
) 1)
5657 << (bitpos
- 1 - HOST_BITS_PER_WIDE_INT
)))
5658 val
[0] |= ((HOST_WIDE_INT
) -1)
5659 << (bitpos
- HOST_BITS_PER_WIDE_INT
);
5662 value
= build_int_cst_wide (type
, val
[1], val
[0]);
5663 add_pending_init (purpose
, value
);
5666 constructor_incremental
= 0;
5669 /* Return value of FIELD in pending initializer or zero if the field was
5670 not initialized yet. */
5673 find_init_member (tree field
)
5675 struct init_node
*p
;
5677 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5679 if (constructor_incremental
5680 && tree_int_cst_lt (field
, constructor_unfilled_index
))
5681 set_nonincremental_init ();
5683 p
= constructor_pending_elts
;
5686 if (tree_int_cst_lt (field
, p
->purpose
))
5688 else if (tree_int_cst_lt (p
->purpose
, field
))
5694 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
5696 tree bitpos
= bit_position (field
);
5698 if (constructor_incremental
5699 && (!constructor_unfilled_fields
5700 || tree_int_cst_lt (bitpos
,
5701 bit_position (constructor_unfilled_fields
))))
5702 set_nonincremental_init ();
5704 p
= constructor_pending_elts
;
5707 if (field
== p
->purpose
)
5709 else if (tree_int_cst_lt (bitpos
, bit_position (p
->purpose
)))
5715 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
5717 if (constructor_elements
5718 && TREE_PURPOSE (constructor_elements
) == field
)
5719 return TREE_VALUE (constructor_elements
);
5724 /* "Output" the next constructor element.
5725 At top level, really output it to assembler code now.
5726 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
5727 TYPE is the data type that the containing data type wants here.
5728 FIELD is the field (a FIELD_DECL) or the index that this element fills.
5729 If VALUE is a string constant, STRICT_STRING is true if it is
5730 unparenthesized or we should not warn here for it being parenthesized.
5731 For other types of VALUE, STRICT_STRING is not used.
5733 PENDING if non-nil means output pending elements that belong
5734 right after this element. (PENDING is normally 1;
5735 it is 0 while outputting pending elements, to avoid recursion.) */
5738 output_init_element (tree value
, bool strict_string
, tree type
, tree field
,
5741 if (type
== error_mark_node
|| value
== error_mark_node
)
5743 constructor_erroneous
= 1;
5746 if (TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
5747 || (TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
5748 && !(TREE_CODE (value
) == STRING_CST
5749 && TREE_CODE (type
) == ARRAY_TYPE
5750 && INTEGRAL_TYPE_P (TREE_TYPE (type
)))
5751 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value
)),
5752 TYPE_MAIN_VARIANT (type
))))
5753 value
= default_conversion (value
);
5755 if (TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
5756 && require_constant_value
&& !flag_isoc99
&& pending
)
5758 /* As an extension, allow initializing objects with static storage
5759 duration with compound literals (which are then treated just as
5760 the brace enclosed list they contain). */
5761 tree decl
= COMPOUND_LITERAL_EXPR_DECL (value
);
5762 value
= DECL_INITIAL (decl
);
5765 if (value
== error_mark_node
)
5766 constructor_erroneous
= 1;
5767 else if (!TREE_CONSTANT (value
))
5768 constructor_constant
= 0;
5769 else if (!initializer_constant_valid_p (value
, TREE_TYPE (value
))
5770 || ((TREE_CODE (constructor_type
) == RECORD_TYPE
5771 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5772 && DECL_C_BIT_FIELD (field
)
5773 && TREE_CODE (value
) != INTEGER_CST
))
5774 constructor_simple
= 0;
5776 if (!initializer_constant_valid_p (value
, TREE_TYPE (value
)))
5778 if (require_constant_value
)
5780 error_init ("initializer element is not constant");
5781 value
= error_mark_node
;
5783 else if (require_constant_elements
)
5784 pedwarn ("initializer element is not computable at load time");
5787 /* If this field is empty (and not at the end of structure),
5788 don't do anything other than checking the initializer. */
5790 && (TREE_TYPE (field
) == error_mark_node
5791 || (COMPLETE_TYPE_P (TREE_TYPE (field
))
5792 && integer_zerop (TYPE_SIZE (TREE_TYPE (field
)))
5793 && (TREE_CODE (constructor_type
) == ARRAY_TYPE
5794 || TREE_CHAIN (field
)))))
5797 value
= digest_init (type
, value
, strict_string
, require_constant_value
);
5798 if (value
== error_mark_node
)
5800 constructor_erroneous
= 1;
5804 /* If this element doesn't come next in sequence,
5805 put it on constructor_pending_elts. */
5806 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5807 && (!constructor_incremental
5808 || !tree_int_cst_equal (field
, constructor_unfilled_index
)))
5810 if (constructor_incremental
5811 && tree_int_cst_lt (field
, constructor_unfilled_index
))
5812 set_nonincremental_init ();
5814 add_pending_init (field
, value
);
5817 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
5818 && (!constructor_incremental
5819 || field
!= constructor_unfilled_fields
))
5821 /* We do this for records but not for unions. In a union,
5822 no matter which field is specified, it can be initialized
5823 right away since it starts at the beginning of the union. */
5824 if (constructor_incremental
)
5826 if (!constructor_unfilled_fields
)
5827 set_nonincremental_init ();
5830 tree bitpos
, unfillpos
;
5832 bitpos
= bit_position (field
);
5833 unfillpos
= bit_position (constructor_unfilled_fields
);
5835 if (tree_int_cst_lt (bitpos
, unfillpos
))
5836 set_nonincremental_init ();
5840 add_pending_init (field
, value
);
5843 else if (TREE_CODE (constructor_type
) == UNION_TYPE
5844 && constructor_elements
)
5846 if (TREE_SIDE_EFFECTS (TREE_VALUE (constructor_elements
)))
5847 warning_init ("initialized field with side-effects overwritten");
5849 /* We can have just one union field set. */
5850 constructor_elements
= 0;
5853 /* Otherwise, output this element either to
5854 constructor_elements or to the assembler file. */
5856 if (field
&& TREE_CODE (field
) == INTEGER_CST
)
5857 field
= copy_node (field
);
5858 constructor_elements
5859 = tree_cons (field
, value
, constructor_elements
);
5861 /* Advance the variable that indicates sequential elements output. */
5862 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5863 constructor_unfilled_index
5864 = size_binop (PLUS_EXPR
, constructor_unfilled_index
,
5866 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
5868 constructor_unfilled_fields
5869 = TREE_CHAIN (constructor_unfilled_fields
);
5871 /* Skip any nameless bit fields. */
5872 while (constructor_unfilled_fields
!= 0
5873 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
5874 && DECL_NAME (constructor_unfilled_fields
) == 0)
5875 constructor_unfilled_fields
=
5876 TREE_CHAIN (constructor_unfilled_fields
);
5878 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
5879 constructor_unfilled_fields
= 0;
5881 /* Now output any pending elements which have become next. */
5883 output_pending_init_elements (0);
5886 /* Output any pending elements which have become next.
5887 As we output elements, constructor_unfilled_{fields,index}
5888 advances, which may cause other elements to become next;
5889 if so, they too are output.
5891 If ALL is 0, we return when there are
5892 no more pending elements to output now.
5894 If ALL is 1, we output space as necessary so that
5895 we can output all the pending elements. */
5898 output_pending_init_elements (int all
)
5900 struct init_node
*elt
= constructor_pending_elts
;
5905 /* Look through the whole pending tree.
5906 If we find an element that should be output now,
5907 output it. Otherwise, set NEXT to the element
5908 that comes first among those still pending. */
5913 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5915 if (tree_int_cst_equal (elt
->purpose
,
5916 constructor_unfilled_index
))
5917 output_init_element (elt
->value
, true,
5918 TREE_TYPE (constructor_type
),
5919 constructor_unfilled_index
, 0);
5920 else if (tree_int_cst_lt (constructor_unfilled_index
,
5923 /* Advance to the next smaller node. */
5928 /* We have reached the smallest node bigger than the
5929 current unfilled index. Fill the space first. */
5930 next
= elt
->purpose
;
5936 /* Advance to the next bigger node. */
5941 /* We have reached the biggest node in a subtree. Find
5942 the parent of it, which is the next bigger node. */
5943 while (elt
->parent
&& elt
->parent
->right
== elt
)
5946 if (elt
&& tree_int_cst_lt (constructor_unfilled_index
,
5949 next
= elt
->purpose
;
5955 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
5956 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5958 tree ctor_unfilled_bitpos
, elt_bitpos
;
5960 /* If the current record is complete we are done. */
5961 if (constructor_unfilled_fields
== 0)
5964 ctor_unfilled_bitpos
= bit_position (constructor_unfilled_fields
);
5965 elt_bitpos
= bit_position (elt
->purpose
);
5966 /* We can't compare fields here because there might be empty
5967 fields in between. */
5968 if (tree_int_cst_equal (elt_bitpos
, ctor_unfilled_bitpos
))
5970 constructor_unfilled_fields
= elt
->purpose
;
5971 output_init_element (elt
->value
, true, TREE_TYPE (elt
->purpose
),
5974 else if (tree_int_cst_lt (ctor_unfilled_bitpos
, elt_bitpos
))
5976 /* Advance to the next smaller node. */
5981 /* We have reached the smallest node bigger than the
5982 current unfilled field. Fill the space first. */
5983 next
= elt
->purpose
;
5989 /* Advance to the next bigger node. */
5994 /* We have reached the biggest node in a subtree. Find
5995 the parent of it, which is the next bigger node. */
5996 while (elt
->parent
&& elt
->parent
->right
== elt
)
6000 && (tree_int_cst_lt (ctor_unfilled_bitpos
,
6001 bit_position (elt
->purpose
))))
6003 next
= elt
->purpose
;
6011 /* Ordinarily return, but not if we want to output all
6012 and there are elements left. */
6013 if (!(all
&& next
!= 0))
6016 /* If it's not incremental, just skip over the gap, so that after
6017 jumping to retry we will output the next successive element. */
6018 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6019 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6020 constructor_unfilled_fields
= next
;
6021 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6022 constructor_unfilled_index
= next
;
6024 /* ELT now points to the node in the pending tree with the next
6025 initializer to output. */
6029 /* Add one non-braced element to the current constructor level.
6030 This adjusts the current position within the constructor's type.
6031 This may also start or terminate implicit levels
6032 to handle a partly-braced initializer.
6034 Once this has found the correct level for the new element,
6035 it calls output_init_element. */
6038 process_init_element (struct c_expr value
)
6040 tree orig_value
= value
.value
;
6041 int string_flag
= orig_value
!= 0 && TREE_CODE (orig_value
) == STRING_CST
;
6042 bool strict_string
= value
.original_code
== STRING_CST
;
6044 designator_depth
= 0;
6045 designator_errorneous
= 0;
6047 /* Handle superfluous braces around string cst as in
6048 char x[] = {"foo"}; */
6051 && TREE_CODE (constructor_type
) == ARRAY_TYPE
6052 && INTEGRAL_TYPE_P (TREE_TYPE (constructor_type
))
6053 && integer_zerop (constructor_unfilled_index
))
6055 if (constructor_stack
->replacement_value
.value
)
6056 error_init ("excess elements in char array initializer");
6057 constructor_stack
->replacement_value
= value
;
6061 if (constructor_stack
->replacement_value
.value
!= 0)
6063 error_init ("excess elements in struct initializer");
6067 /* Ignore elements of a brace group if it is entirely superfluous
6068 and has already been diagnosed. */
6069 if (constructor_type
== 0)
6072 /* If we've exhausted any levels that didn't have braces,
6074 while (constructor_stack
->implicit
)
6076 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
6077 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6078 && constructor_fields
== 0)
6079 process_init_element (pop_init_level (1));
6080 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
6081 && (constructor_max_index
== 0
6082 || tree_int_cst_lt (constructor_max_index
,
6083 constructor_index
)))
6084 process_init_element (pop_init_level (1));
6089 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
6090 if (constructor_range_stack
)
6092 /* If value is a compound literal and we'll be just using its
6093 content, don't put it into a SAVE_EXPR. */
6094 if (TREE_CODE (value
.value
) != COMPOUND_LITERAL_EXPR
6095 || !require_constant_value
6097 value
.value
= save_expr (value
.value
);
6102 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
6105 enum tree_code fieldcode
;
6107 if (constructor_fields
== 0)
6109 pedwarn_init ("excess elements in struct initializer");
6113 fieldtype
= TREE_TYPE (constructor_fields
);
6114 if (fieldtype
!= error_mark_node
)
6115 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
6116 fieldcode
= TREE_CODE (fieldtype
);
6118 /* Error for non-static initialization of a flexible array member. */
6119 if (fieldcode
== ARRAY_TYPE
6120 && !require_constant_value
6121 && TYPE_SIZE (fieldtype
) == NULL_TREE
6122 && TREE_CHAIN (constructor_fields
) == NULL_TREE
)
6124 error_init ("non-static initialization of a flexible array member");
6128 /* Accept a string constant to initialize a subarray. */
6129 if (value
.value
!= 0
6130 && fieldcode
== ARRAY_TYPE
6131 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype
))
6133 value
.value
= orig_value
;
6134 /* Otherwise, if we have come to a subaggregate,
6135 and we don't have an element of its type, push into it. */
6136 else if (value
.value
!= 0
6137 && value
.value
!= error_mark_node
6138 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != fieldtype
6139 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
6140 || fieldcode
== UNION_TYPE
))
6142 push_init_level (1);
6148 push_member_name (constructor_fields
);
6149 output_init_element (value
.value
, strict_string
,
6150 fieldtype
, constructor_fields
, 1);
6151 RESTORE_SPELLING_DEPTH (constructor_depth
);
6154 /* Do the bookkeeping for an element that was
6155 directly output as a constructor. */
6157 /* For a record, keep track of end position of last field. */
6158 if (DECL_SIZE (constructor_fields
))
6159 constructor_bit_index
6160 = size_binop (PLUS_EXPR
,
6161 bit_position (constructor_fields
),
6162 DECL_SIZE (constructor_fields
));
6164 /* If the current field was the first one not yet written out,
6165 it isn't now, so update. */
6166 if (constructor_unfilled_fields
== constructor_fields
)
6168 constructor_unfilled_fields
= TREE_CHAIN (constructor_fields
);
6169 /* Skip any nameless bit fields. */
6170 while (constructor_unfilled_fields
!= 0
6171 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
6172 && DECL_NAME (constructor_unfilled_fields
) == 0)
6173 constructor_unfilled_fields
=
6174 TREE_CHAIN (constructor_unfilled_fields
);
6178 constructor_fields
= TREE_CHAIN (constructor_fields
);
6179 /* Skip any nameless bit fields at the beginning. */
6180 while (constructor_fields
!= 0
6181 && DECL_C_BIT_FIELD (constructor_fields
)
6182 && DECL_NAME (constructor_fields
) == 0)
6183 constructor_fields
= TREE_CHAIN (constructor_fields
);
6185 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
6188 enum tree_code fieldcode
;
6190 if (constructor_fields
== 0)
6192 pedwarn_init ("excess elements in union initializer");
6196 fieldtype
= TREE_TYPE (constructor_fields
);
6197 if (fieldtype
!= error_mark_node
)
6198 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
6199 fieldcode
= TREE_CODE (fieldtype
);
6201 /* Warn that traditional C rejects initialization of unions.
6202 We skip the warning if the value is zero. This is done
6203 under the assumption that the zero initializer in user
6204 code appears conditioned on e.g. __STDC__ to avoid
6205 "missing initializer" warnings and relies on default
6206 initialization to zero in the traditional C case.
6207 We also skip the warning if the initializer is designated,
6208 again on the assumption that this must be conditional on
6209 __STDC__ anyway (and we've already complained about the
6210 member-designator already). */
6211 if (warn_traditional
&& !in_system_header
&& !constructor_designated
6212 && !(value
.value
&& (integer_zerop (value
.value
)
6213 || real_zerop (value
.value
))))
6214 warning (0, "traditional C rejects initialization of unions");
6216 /* Accept a string constant to initialize a subarray. */
6217 if (value
.value
!= 0
6218 && fieldcode
== ARRAY_TYPE
6219 && INTEGRAL_TYPE_P (TREE_TYPE (fieldtype
))
6221 value
.value
= orig_value
;
6222 /* Otherwise, if we have come to a subaggregate,
6223 and we don't have an element of its type, push into it. */
6224 else if (value
.value
!= 0
6225 && value
.value
!= error_mark_node
6226 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != fieldtype
6227 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
6228 || fieldcode
== UNION_TYPE
))
6230 push_init_level (1);
6236 push_member_name (constructor_fields
);
6237 output_init_element (value
.value
, strict_string
,
6238 fieldtype
, constructor_fields
, 1);
6239 RESTORE_SPELLING_DEPTH (constructor_depth
);
6242 /* Do the bookkeeping for an element that was
6243 directly output as a constructor. */
6245 constructor_bit_index
= DECL_SIZE (constructor_fields
);
6246 constructor_unfilled_fields
= TREE_CHAIN (constructor_fields
);
6249 constructor_fields
= 0;
6251 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6253 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
6254 enum tree_code eltcode
= TREE_CODE (elttype
);
6256 /* Accept a string constant to initialize a subarray. */
6257 if (value
.value
!= 0
6258 && eltcode
== ARRAY_TYPE
6259 && INTEGRAL_TYPE_P (TREE_TYPE (elttype
))
6261 value
.value
= orig_value
;
6262 /* Otherwise, if we have come to a subaggregate,
6263 and we don't have an element of its type, push into it. */
6264 else if (value
.value
!= 0
6265 && value
.value
!= error_mark_node
6266 && TYPE_MAIN_VARIANT (TREE_TYPE (value
.value
)) != elttype
6267 && (eltcode
== RECORD_TYPE
|| eltcode
== ARRAY_TYPE
6268 || eltcode
== UNION_TYPE
))
6270 push_init_level (1);
6274 if (constructor_max_index
!= 0
6275 && (tree_int_cst_lt (constructor_max_index
, constructor_index
)
6276 || integer_all_onesp (constructor_max_index
)))
6278 pedwarn_init ("excess elements in array initializer");
6282 /* Now output the actual element. */
6285 push_array_bounds (tree_low_cst (constructor_index
, 0));
6286 output_init_element (value
.value
, strict_string
,
6287 elttype
, constructor_index
, 1);
6288 RESTORE_SPELLING_DEPTH (constructor_depth
);
6292 = size_binop (PLUS_EXPR
, constructor_index
, bitsize_one_node
);
6295 /* If we are doing the bookkeeping for an element that was
6296 directly output as a constructor, we must update
6297 constructor_unfilled_index. */
6298 constructor_unfilled_index
= constructor_index
;
6300 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
6302 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
6304 /* Do a basic check of initializer size. Note that vectors
6305 always have a fixed size derived from their type. */
6306 if (tree_int_cst_lt (constructor_max_index
, constructor_index
))
6308 pedwarn_init ("excess elements in vector initializer");
6312 /* Now output the actual element. */
6314 output_init_element (value
.value
, strict_string
,
6315 elttype
, constructor_index
, 1);
6318 = size_binop (PLUS_EXPR
, constructor_index
, bitsize_one_node
);
6321 /* If we are doing the bookkeeping for an element that was
6322 directly output as a constructor, we must update
6323 constructor_unfilled_index. */
6324 constructor_unfilled_index
= constructor_index
;
6327 /* Handle the sole element allowed in a braced initializer
6328 for a scalar variable. */
6329 else if (constructor_type
!= error_mark_node
6330 && constructor_fields
== 0)
6332 pedwarn_init ("excess elements in scalar initializer");
6338 output_init_element (value
.value
, strict_string
,
6339 constructor_type
, NULL_TREE
, 1);
6340 constructor_fields
= 0;
6343 /* Handle range initializers either at this level or anywhere higher
6344 in the designator stack. */
6345 if (constructor_range_stack
)
6347 struct constructor_range_stack
*p
, *range_stack
;
6350 range_stack
= constructor_range_stack
;
6351 constructor_range_stack
= 0;
6352 while (constructor_stack
!= range_stack
->stack
)
6354 gcc_assert (constructor_stack
->implicit
);
6355 process_init_element (pop_init_level (1));
6357 for (p
= range_stack
;
6358 !p
->range_end
|| tree_int_cst_equal (p
->index
, p
->range_end
);
6361 gcc_assert (constructor_stack
->implicit
);
6362 process_init_element (pop_init_level (1));
6365 p
->index
= size_binop (PLUS_EXPR
, p
->index
, bitsize_one_node
);
6366 if (tree_int_cst_equal (p
->index
, p
->range_end
) && !p
->prev
)
6371 constructor_index
= p
->index
;
6372 constructor_fields
= p
->fields
;
6373 if (finish
&& p
->range_end
&& p
->index
== p
->range_start
)
6381 push_init_level (2);
6382 p
->stack
= constructor_stack
;
6383 if (p
->range_end
&& tree_int_cst_equal (p
->index
, p
->range_end
))
6384 p
->index
= p
->range_start
;
6388 constructor_range_stack
= range_stack
;
6395 constructor_range_stack
= 0;
6398 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6399 (guaranteed to be 'volatile' or null) and ARGS (represented using
6400 an ASM_EXPR node). */
6402 build_asm_stmt (tree cv_qualifier
, tree args
)
6404 if (!ASM_VOLATILE_P (args
) && cv_qualifier
)
6405 ASM_VOLATILE_P (args
) = 1;
6406 return add_stmt (args
);
6409 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6410 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6411 SIMPLE indicates whether there was anything at all after the
6412 string in the asm expression -- asm("blah") and asm("blah" : )
6413 are subtly different. We use a ASM_EXPR node to represent this. */
6415 build_asm_expr (tree string
, tree outputs
, tree inputs
, tree clobbers
,
6421 const char *constraint
;
6422 const char **oconstraints
;
6423 bool allows_mem
, allows_reg
, is_inout
;
6424 int ninputs
, noutputs
;
6426 ninputs
= list_length (inputs
);
6427 noutputs
= list_length (outputs
);
6428 oconstraints
= (const char **) alloca (noutputs
* sizeof (const char *));
6430 string
= resolve_asm_operand_names (string
, outputs
, inputs
);
6432 /* Remove output conversions that change the type but not the mode. */
6433 for (i
= 0, tail
= outputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
6435 tree output
= TREE_VALUE (tail
);
6437 /* ??? Really, this should not be here. Users should be using a
6438 proper lvalue, dammit. But there's a long history of using casts
6439 in the output operands. In cases like longlong.h, this becomes a
6440 primitive form of typechecking -- if the cast can be removed, then
6441 the output operand had a type of the proper width; otherwise we'll
6442 get an error. Gross, but ... */
6443 STRIP_NOPS (output
);
6445 if (!lvalue_or_else (output
, lv_asm
))
6446 output
= error_mark_node
;
6448 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
6449 oconstraints
[i
] = constraint
;
6451 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
6452 &allows_mem
, &allows_reg
, &is_inout
))
6454 /* If the operand is going to end up in memory,
6455 mark it addressable. */
6456 if (!allows_reg
&& !c_mark_addressable (output
))
6457 output
= error_mark_node
;
6460 output
= error_mark_node
;
6462 TREE_VALUE (tail
) = output
;
6465 /* Perform default conversions on array and function inputs.
6466 Don't do this for other types as it would screw up operands
6467 expected to be in memory. */
6468 for (i
= 0, tail
= inputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
6472 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
6473 input
= TREE_VALUE (tail
);
6475 input
= default_function_array_conversion (input
);
6477 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
6478 oconstraints
, &allows_mem
, &allows_reg
))
6480 /* If the operand is going to end up in memory,
6481 mark it addressable. */
6482 if (!allows_reg
&& allows_mem
)
6484 /* Strip the nops as we allow this case. FIXME, this really
6485 should be rejected or made deprecated. */
6487 if (!c_mark_addressable (input
))
6488 input
= error_mark_node
;
6492 input
= error_mark_node
;
6494 TREE_VALUE (tail
) = input
;
6497 args
= build_stmt (ASM_EXPR
, string
, outputs
, inputs
, clobbers
);
6499 /* Simple asm statements are treated as volatile. */
6502 ASM_VOLATILE_P (args
) = 1;
6503 ASM_INPUT_P (args
) = 1;
6509 /* Generate a goto statement to LABEL. */
6512 c_finish_goto_label (tree label
)
6514 tree decl
= lookup_label (label
);
6518 if (C_DECL_UNJUMPABLE_STMT_EXPR (decl
))
6520 error ("jump into statement expression");
6524 if (C_DECL_UNJUMPABLE_VM (decl
))
6526 error ("jump into scope of identifier with variably modified type");
6530 if (!C_DECL_UNDEFINABLE_STMT_EXPR (decl
))
6532 /* No jump from outside this statement expression context, so
6533 record that there is a jump from within this context. */
6534 struct c_label_list
*nlist
;
6535 nlist
= XOBNEW (&parser_obstack
, struct c_label_list
);
6536 nlist
->next
= label_context_stack_se
->labels_used
;
6537 nlist
->label
= decl
;
6538 label_context_stack_se
->labels_used
= nlist
;
6541 if (!C_DECL_UNDEFINABLE_VM (decl
))
6543 /* No jump from outside this context context of identifiers with
6544 variably modified type, so record that there is a jump from
6545 within this context. */
6546 struct c_label_list
*nlist
;
6547 nlist
= XOBNEW (&parser_obstack
, struct c_label_list
);
6548 nlist
->next
= label_context_stack_vm
->labels_used
;
6549 nlist
->label
= decl
;
6550 label_context_stack_vm
->labels_used
= nlist
;
6553 TREE_USED (decl
) = 1;
6554 return add_stmt (build1 (GOTO_EXPR
, void_type_node
, decl
));
6557 /* Generate a computed goto statement to EXPR. */
6560 c_finish_goto_ptr (tree expr
)
6563 pedwarn ("ISO C forbids %<goto *expr;%>");
6564 expr
= convert (ptr_type_node
, expr
);
6565 return add_stmt (build1 (GOTO_EXPR
, void_type_node
, expr
));
6568 /* Generate a C `return' statement. RETVAL is the expression for what
6569 to return, or a null pointer for `return;' with no value. */
6572 c_finish_return (tree retval
)
6574 tree valtype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
6576 if (TREE_THIS_VOLATILE (current_function_decl
))
6577 warning (0, "function declared %<noreturn%> has a %<return%> statement");
6581 current_function_returns_null
= 1;
6582 if ((warn_return_type
|| flag_isoc99
)
6583 && valtype
!= 0 && TREE_CODE (valtype
) != VOID_TYPE
)
6584 pedwarn_c99 ("%<return%> with no value, in "
6585 "function returning non-void");
6587 else if (valtype
== 0 || TREE_CODE (valtype
) == VOID_TYPE
)
6589 current_function_returns_null
= 1;
6590 if (pedantic
|| TREE_CODE (TREE_TYPE (retval
)) != VOID_TYPE
)
6591 pedwarn ("%<return%> with a value, in function returning void");
6595 tree t
= convert_for_assignment (valtype
, retval
, ic_return
,
6596 NULL_TREE
, NULL_TREE
, 0);
6597 tree res
= DECL_RESULT (current_function_decl
);
6600 current_function_returns_value
= 1;
6601 if (t
== error_mark_node
)
6604 inner
= t
= convert (TREE_TYPE (res
), t
);
6606 /* Strip any conversions, additions, and subtractions, and see if
6607 we are returning the address of a local variable. Warn if so. */
6610 switch (TREE_CODE (inner
))
6612 case NOP_EXPR
: case NON_LVALUE_EXPR
: case CONVERT_EXPR
:
6614 inner
= TREE_OPERAND (inner
, 0);
6618 /* If the second operand of the MINUS_EXPR has a pointer
6619 type (or is converted from it), this may be valid, so
6620 don't give a warning. */
6622 tree op1
= TREE_OPERAND (inner
, 1);
6624 while (!POINTER_TYPE_P (TREE_TYPE (op1
))
6625 && (TREE_CODE (op1
) == NOP_EXPR
6626 || TREE_CODE (op1
) == NON_LVALUE_EXPR
6627 || TREE_CODE (op1
) == CONVERT_EXPR
))
6628 op1
= TREE_OPERAND (op1
, 0);
6630 if (POINTER_TYPE_P (TREE_TYPE (op1
)))
6633 inner
= TREE_OPERAND (inner
, 0);
6638 inner
= TREE_OPERAND (inner
, 0);
6640 while (REFERENCE_CLASS_P (inner
)
6641 && TREE_CODE (inner
) != INDIRECT_REF
)
6642 inner
= TREE_OPERAND (inner
, 0);
6645 && !DECL_EXTERNAL (inner
)
6646 && !TREE_STATIC (inner
)
6647 && DECL_CONTEXT (inner
) == current_function_decl
)
6648 warning (0, "function returns address of local variable");
6658 retval
= build2 (MODIFY_EXPR
, TREE_TYPE (res
), res
, t
);
6661 return add_stmt (build_stmt (RETURN_EXPR
, retval
));
6665 /* The SWITCH_EXPR being built. */
6668 /* The original type of the testing expression, i.e. before the
6669 default conversion is applied. */
6672 /* A splay-tree mapping the low element of a case range to the high
6673 element, or NULL_TREE if there is no high element. Used to
6674 determine whether or not a new case label duplicates an old case
6675 label. We need a tree, rather than simply a hash table, because
6676 of the GNU case range extension. */
6679 /* Number of nested statement expressions within this switch
6680 statement; if nonzero, case and default labels may not
6682 unsigned int blocked_stmt_expr
;
6684 /* Scope of outermost declarations of identifiers with variably
6685 modified type within this switch statement; if nonzero, case and
6686 default labels may not appear. */
6687 unsigned int blocked_vm
;
6689 /* The next node on the stack. */
6690 struct c_switch
*next
;
6693 /* A stack of the currently active switch statements. The innermost
6694 switch statement is on the top of the stack. There is no need to
6695 mark the stack for garbage collection because it is only active
6696 during the processing of the body of a function, and we never
6697 collect at that point. */
6699 struct c_switch
*c_switch_stack
;
6701 /* Start a C switch statement, testing expression EXP. Return the new
6705 c_start_case (tree exp
)
6707 enum tree_code code
;
6708 tree type
, orig_type
= error_mark_node
;
6709 struct c_switch
*cs
;
6711 if (exp
!= error_mark_node
)
6713 code
= TREE_CODE (TREE_TYPE (exp
));
6714 orig_type
= TREE_TYPE (exp
);
6716 if (!INTEGRAL_TYPE_P (orig_type
)
6717 && code
!= ERROR_MARK
)
6719 error ("switch quantity not an integer");
6720 exp
= integer_zero_node
;
6721 orig_type
= error_mark_node
;
6725 type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
6727 if (warn_traditional
&& !in_system_header
6728 && (type
== long_integer_type_node
6729 || type
== long_unsigned_type_node
))
6730 warning (0, "%<long%> switch expression not converted to "
6731 "%<int%> in ISO C");
6733 exp
= default_conversion (exp
);
6734 type
= TREE_TYPE (exp
);
6738 /* Add this new SWITCH_EXPR to the stack. */
6739 cs
= XNEW (struct c_switch
);
6740 cs
->switch_expr
= build3 (SWITCH_EXPR
, orig_type
, exp
, NULL_TREE
, NULL_TREE
);
6741 cs
->orig_type
= orig_type
;
6742 cs
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
6743 cs
->blocked_stmt_expr
= 0;
6745 cs
->next
= c_switch_stack
;
6746 c_switch_stack
= cs
;
6748 return add_stmt (cs
->switch_expr
);
6751 /* Process a case label. */
6754 do_case (tree low_value
, tree high_value
)
6756 tree label
= NULL_TREE
;
6758 if (c_switch_stack
&& !c_switch_stack
->blocked_stmt_expr
6759 && !c_switch_stack
->blocked_vm
)
6761 label
= c_add_case_label (c_switch_stack
->cases
,
6762 SWITCH_COND (c_switch_stack
->switch_expr
),
6763 c_switch_stack
->orig_type
,
6764 low_value
, high_value
);
6765 if (label
== error_mark_node
)
6768 else if (c_switch_stack
&& c_switch_stack
->blocked_stmt_expr
)
6771 error ("case label in statement expression not containing "
6772 "enclosing switch statement");
6774 error ("%<default%> label in statement expression not containing "
6775 "enclosing switch statement");
6777 else if (c_switch_stack
&& c_switch_stack
->blocked_vm
)
6780 error ("case label in scope of identifier with variably modified "
6781 "type not containing enclosing switch statement");
6783 error ("%<default%> label in scope of identifier with variably "
6784 "modified type not containing enclosing switch statement");
6787 error ("case label not within a switch statement");
6789 error ("%<default%> label not within a switch statement");
6794 /* Finish the switch statement. */
6797 c_finish_case (tree body
)
6799 struct c_switch
*cs
= c_switch_stack
;
6800 location_t switch_location
;
6802 SWITCH_BODY (cs
->switch_expr
) = body
;
6804 /* We must not be within a statement expression nested in the switch
6805 at this point; we might, however, be within the scope of an
6806 identifier with variably modified type nested in the switch. */
6807 gcc_assert (!cs
->blocked_stmt_expr
);
6809 /* Emit warnings as needed. */
6810 if (EXPR_HAS_LOCATION (cs
->switch_expr
))
6811 switch_location
= EXPR_LOCATION (cs
->switch_expr
);
6813 switch_location
= input_location
;
6814 c_do_switch_warnings (cs
->cases
, switch_location
,
6815 TREE_TYPE (cs
->switch_expr
),
6816 SWITCH_COND (cs
->switch_expr
));
6818 /* Pop the stack. */
6819 c_switch_stack
= cs
->next
;
6820 splay_tree_delete (cs
->cases
);
6824 /* Emit an if statement. IF_LOCUS is the location of the 'if'. COND,
6825 THEN_BLOCK and ELSE_BLOCK are expressions to be used; ELSE_BLOCK
6826 may be null. NESTED_IF is true if THEN_BLOCK contains another IF
6827 statement, and was not surrounded with parenthesis. */
6830 c_finish_if_stmt (location_t if_locus
, tree cond
, tree then_block
,
6831 tree else_block
, bool nested_if
)
6835 /* Diagnose an ambiguous else if if-then-else is nested inside if-then. */
6836 if (warn_parentheses
&& nested_if
&& else_block
== NULL
)
6838 tree inner_if
= then_block
;
6840 /* We know from the grammar productions that there is an IF nested
6841 within THEN_BLOCK. Due to labels and c99 conditional declarations,
6842 it might not be exactly THEN_BLOCK, but should be the last
6843 non-container statement within. */
6845 switch (TREE_CODE (inner_if
))
6850 inner_if
= BIND_EXPR_BODY (inner_if
);
6852 case STATEMENT_LIST
:
6853 inner_if
= expr_last (then_block
);
6855 case TRY_FINALLY_EXPR
:
6856 case TRY_CATCH_EXPR
:
6857 inner_if
= TREE_OPERAND (inner_if
, 0);
6864 if (COND_EXPR_ELSE (inner_if
))
6865 warning (0, "%Hsuggest explicit braces to avoid ambiguous %<else%>",
6869 /* Diagnose ";" via the special empty statement node that we create. */
6872 if (TREE_CODE (then_block
) == NOP_EXPR
&& !TREE_TYPE (then_block
))
6875 warning (0, "%Hempty body in an if-statement",
6876 EXPR_LOCUS (then_block
));
6877 then_block
= alloc_stmt_list ();
6880 && TREE_CODE (else_block
) == NOP_EXPR
6881 && !TREE_TYPE (else_block
))
6883 warning (0, "%Hempty body in an else-statement",
6884 EXPR_LOCUS (else_block
));
6885 else_block
= alloc_stmt_list ();
6889 stmt
= build3 (COND_EXPR
, NULL_TREE
, cond
, then_block
, else_block
);
6890 SET_EXPR_LOCATION (stmt
, if_locus
);
6894 /* Emit a general-purpose loop construct. START_LOCUS is the location of
6895 the beginning of the loop. COND is the loop condition. COND_IS_FIRST
6896 is false for DO loops. INCR is the FOR increment expression. BODY is
6897 the statement controlled by the loop. BLAB is the break label. CLAB is
6898 the continue label. Everything is allowed to be NULL. */
6901 c_finish_loop (location_t start_locus
, tree cond
, tree incr
, tree body
,
6902 tree blab
, tree clab
, bool cond_is_first
)
6904 tree entry
= NULL
, exit
= NULL
, t
;
6906 /* If the condition is zero don't generate a loop construct. */
6907 if (cond
&& integer_zerop (cond
))
6911 t
= build_and_jump (&blab
);
6912 SET_EXPR_LOCATION (t
, start_locus
);
6918 tree top
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
6920 /* If we have an exit condition, then we build an IF with gotos either
6921 out of the loop, or to the top of it. If there's no exit condition,
6922 then we just build a jump back to the top. */
6923 exit
= build_and_jump (&LABEL_EXPR_LABEL (top
));
6925 if (cond
&& !integer_nonzerop (cond
))
6927 /* Canonicalize the loop condition to the end. This means
6928 generating a branch to the loop condition. Reuse the
6929 continue label, if possible. */
6934 entry
= build1 (LABEL_EXPR
, void_type_node
, NULL_TREE
);
6935 t
= build_and_jump (&LABEL_EXPR_LABEL (entry
));
6938 t
= build1 (GOTO_EXPR
, void_type_node
, clab
);
6939 SET_EXPR_LOCATION (t
, start_locus
);
6943 t
= build_and_jump (&blab
);
6944 exit
= build3 (COND_EXPR
, void_type_node
, cond
, exit
, t
);
6947 SET_EXPR_LOCATION (exit
, start_locus
);
6949 SET_EXPR_LOCATION (exit
, input_location
);
6958 add_stmt (build1 (LABEL_EXPR
, void_type_node
, clab
));
6966 add_stmt (build1 (LABEL_EXPR
, void_type_node
, blab
));
6970 c_finish_bc_stmt (tree
*label_p
, bool is_break
)
6973 tree label
= *label_p
;
6975 /* In switch statements break is sometimes stylistically used after
6976 a return statement. This can lead to spurious warnings about
6977 control reaching the end of a non-void function when it is
6978 inlined. Note that we are calling block_may_fallthru with
6979 language specific tree nodes; this works because
6980 block_may_fallthru returns true when given something it does not
6982 skip
= !block_may_fallthru (cur_stmt_list
);
6987 *label_p
= label
= create_artificial_label ();
6989 else if (TREE_CODE (label
) != LABEL_DECL
)
6992 error ("break statement not within loop or switch");
6994 error ("continue statement not within a loop");
7001 return add_stmt (build1 (GOTO_EXPR
, void_type_node
, label
));
7004 /* A helper routine for c_process_expr_stmt and c_finish_stmt_expr. */
7007 emit_side_effect_warnings (tree expr
)
7009 if (expr
== error_mark_node
)
7011 else if (!TREE_SIDE_EFFECTS (expr
))
7013 if (!VOID_TYPE_P (TREE_TYPE (expr
)) && !TREE_NO_WARNING (expr
))
7014 warning (0, "%Hstatement with no effect",
7015 EXPR_HAS_LOCATION (expr
) ? EXPR_LOCUS (expr
) : &input_location
);
7017 else if (warn_unused_value
)
7018 warn_if_unused_value (expr
, input_location
);
7021 /* Process an expression as if it were a complete statement. Emit
7022 diagnostics, but do not call ADD_STMT. */
7025 c_process_expr_stmt (tree expr
)
7030 /* Do default conversion if safe and possibly important,
7031 in case within ({...}). */
7032 if ((TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
7033 && (flag_isoc99
|| lvalue_p (expr
)))
7034 || TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
)
7035 expr
= default_conversion (expr
);
7037 if (warn_sequence_point
)
7038 verify_sequence_points (expr
);
7040 if (TREE_TYPE (expr
) != error_mark_node
7041 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr
))
7042 && TREE_CODE (TREE_TYPE (expr
)) != ARRAY_TYPE
)
7043 error ("expression statement has incomplete type");
7045 /* If we're not processing a statement expression, warn about unused values.
7046 Warnings for statement expressions will be emitted later, once we figure
7047 out which is the result. */
7048 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list
)
7049 && (extra_warnings
|| warn_unused_value
))
7050 emit_side_effect_warnings (expr
);
7052 /* If the expression is not of a type to which we cannot assign a line
7053 number, wrap the thing in a no-op NOP_EXPR. */
7054 if (DECL_P (expr
) || CONSTANT_CLASS_P (expr
))
7055 expr
= build1 (NOP_EXPR
, TREE_TYPE (expr
), expr
);
7058 SET_EXPR_LOCATION (expr
, input_location
);
7063 /* Emit an expression as a statement. */
7066 c_finish_expr_stmt (tree expr
)
7069 return add_stmt (c_process_expr_stmt (expr
));
7074 /* Do the opposite and emit a statement as an expression. To begin,
7075 create a new binding level and return it. */
7078 c_begin_stmt_expr (void)
7081 struct c_label_context_se
*nstack
;
7082 struct c_label_list
*glist
;
7084 /* We must force a BLOCK for this level so that, if it is not expanded
7085 later, there is a way to turn off the entire subtree of blocks that
7086 are contained in it. */
7088 ret
= c_begin_compound_stmt (true);
7091 c_switch_stack
->blocked_stmt_expr
++;
7092 gcc_assert (c_switch_stack
->blocked_stmt_expr
!= 0);
7094 for (glist
= label_context_stack_se
->labels_used
;
7096 glist
= glist
->next
)
7098 C_DECL_UNDEFINABLE_STMT_EXPR (glist
->label
) = 1;
7100 nstack
= XOBNEW (&parser_obstack
, struct c_label_context_se
);
7101 nstack
->labels_def
= NULL
;
7102 nstack
->labels_used
= NULL
;
7103 nstack
->next
= label_context_stack_se
;
7104 label_context_stack_se
= nstack
;
7106 /* Mark the current statement list as belonging to a statement list. */
7107 STATEMENT_LIST_STMT_EXPR (ret
) = 1;
7113 c_finish_stmt_expr (tree body
)
7115 tree last
, type
, tmp
, val
;
7117 struct c_label_list
*dlist
, *glist
, *glist_prev
= NULL
;
7119 body
= c_end_compound_stmt (body
, true);
7122 gcc_assert (c_switch_stack
->blocked_stmt_expr
!= 0);
7123 c_switch_stack
->blocked_stmt_expr
--;
7125 /* It is no longer possible to jump to labels defined within this
7126 statement expression. */
7127 for (dlist
= label_context_stack_se
->labels_def
;
7129 dlist
= dlist
->next
)
7131 C_DECL_UNJUMPABLE_STMT_EXPR (dlist
->label
) = 1;
7133 /* It is again possible to define labels with a goto just outside
7134 this statement expression. */
7135 for (glist
= label_context_stack_se
->next
->labels_used
;
7137 glist
= glist
->next
)
7139 C_DECL_UNDEFINABLE_STMT_EXPR (glist
->label
) = 0;
7142 if (glist_prev
!= NULL
)
7143 glist_prev
->next
= label_context_stack_se
->labels_used
;
7145 label_context_stack_se
->next
->labels_used
7146 = label_context_stack_se
->labels_used
;
7147 label_context_stack_se
= label_context_stack_se
->next
;
7149 /* Locate the last statement in BODY. See c_end_compound_stmt
7150 about always returning a BIND_EXPR. */
7151 last_p
= &BIND_EXPR_BODY (body
);
7152 last
= BIND_EXPR_BODY (body
);
7155 if (TREE_CODE (last
) == STATEMENT_LIST
)
7157 tree_stmt_iterator i
;
7159 /* This can happen with degenerate cases like ({ }). No value. */
7160 if (!TREE_SIDE_EFFECTS (last
))
7163 /* If we're supposed to generate side effects warnings, process
7164 all of the statements except the last. */
7165 if (extra_warnings
|| warn_unused_value
)
7167 for (i
= tsi_start (last
); !tsi_one_before_end_p (i
); tsi_next (&i
))
7168 emit_side_effect_warnings (tsi_stmt (i
));
7171 i
= tsi_last (last
);
7172 last_p
= tsi_stmt_ptr (i
);
7176 /* If the end of the list is exception related, then the list was split
7177 by a call to push_cleanup. Continue searching. */
7178 if (TREE_CODE (last
) == TRY_FINALLY_EXPR
7179 || TREE_CODE (last
) == TRY_CATCH_EXPR
)
7181 last_p
= &TREE_OPERAND (last
, 0);
7183 goto continue_searching
;
7186 /* In the case that the BIND_EXPR is not necessary, return the
7187 expression out from inside it. */
7188 if (last
== error_mark_node
7189 || (last
== BIND_EXPR_BODY (body
)
7190 && BIND_EXPR_VARS (body
) == NULL
))
7193 /* Extract the type of said expression. */
7194 type
= TREE_TYPE (last
);
7196 /* If we're not returning a value at all, then the BIND_EXPR that
7197 we already have is a fine expression to return. */
7198 if (!type
|| VOID_TYPE_P (type
))
7201 /* Now that we've located the expression containing the value, it seems
7202 silly to make voidify_wrapper_expr repeat the process. Create a
7203 temporary of the appropriate type and stick it in a TARGET_EXPR. */
7204 tmp
= create_tmp_var_raw (type
, NULL
);
7206 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
7207 tree_expr_nonnegative_p giving up immediately. */
7209 if (TREE_CODE (val
) == NOP_EXPR
7210 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0)))
7211 val
= TREE_OPERAND (val
, 0);
7213 *last_p
= build2 (MODIFY_EXPR
, void_type_node
, tmp
, val
);
7214 SET_EXPR_LOCUS (*last_p
, EXPR_LOCUS (last
));
7216 return build4 (TARGET_EXPR
, type
, tmp
, body
, NULL_TREE
, NULL_TREE
);
7219 /* Begin the scope of an identifier of variably modified type, scope
7220 number SCOPE. Jumping from outside this scope to inside it is not
7224 c_begin_vm_scope (unsigned int scope
)
7226 struct c_label_context_vm
*nstack
;
7227 struct c_label_list
*glist
;
7229 gcc_assert (scope
> 0);
7230 if (c_switch_stack
&& !c_switch_stack
->blocked_vm
)
7231 c_switch_stack
->blocked_vm
= scope
;
7232 for (glist
= label_context_stack_vm
->labels_used
;
7234 glist
= glist
->next
)
7236 C_DECL_UNDEFINABLE_VM (glist
->label
) = 1;
7238 nstack
= XOBNEW (&parser_obstack
, struct c_label_context_vm
);
7239 nstack
->labels_def
= NULL
;
7240 nstack
->labels_used
= NULL
;
7241 nstack
->scope
= scope
;
7242 nstack
->next
= label_context_stack_vm
;
7243 label_context_stack_vm
= nstack
;
7246 /* End a scope which may contain identifiers of variably modified
7247 type, scope number SCOPE. */
7250 c_end_vm_scope (unsigned int scope
)
7252 if (label_context_stack_vm
== NULL
)
7254 if (c_switch_stack
&& c_switch_stack
->blocked_vm
== scope
)
7255 c_switch_stack
->blocked_vm
= 0;
7256 /* We may have a number of nested scopes of identifiers with
7257 variably modified type, all at this depth. Pop each in turn. */
7258 while (label_context_stack_vm
->scope
== scope
)
7260 struct c_label_list
*dlist
, *glist
, *glist_prev
= NULL
;
7262 /* It is no longer possible to jump to labels defined within this
7264 for (dlist
= label_context_stack_vm
->labels_def
;
7266 dlist
= dlist
->next
)
7268 C_DECL_UNJUMPABLE_VM (dlist
->label
) = 1;
7270 /* It is again possible to define labels with a goto just outside
7272 for (glist
= label_context_stack_vm
->next
->labels_used
;
7274 glist
= glist
->next
)
7276 C_DECL_UNDEFINABLE_VM (glist
->label
) = 0;
7279 if (glist_prev
!= NULL
)
7280 glist_prev
->next
= label_context_stack_vm
->labels_used
;
7282 label_context_stack_vm
->next
->labels_used
7283 = label_context_stack_vm
->labels_used
;
7284 label_context_stack_vm
= label_context_stack_vm
->next
;
7288 /* Begin and end compound statements. This is as simple as pushing
7289 and popping new statement lists from the tree. */
7292 c_begin_compound_stmt (bool do_scope
)
7294 tree stmt
= push_stmt_list ();
7301 c_end_compound_stmt (tree stmt
, bool do_scope
)
7307 if (c_dialect_objc ())
7308 objc_clear_super_receiver ();
7309 block
= pop_scope ();
7312 stmt
= pop_stmt_list (stmt
);
7313 stmt
= c_build_bind_expr (block
, stmt
);
7315 /* If this compound statement is nested immediately inside a statement
7316 expression, then force a BIND_EXPR to be created. Otherwise we'll
7317 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
7318 STATEMENT_LISTs merge, and thus we can lose track of what statement
7321 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list
)
7322 && TREE_CODE (stmt
) != BIND_EXPR
)
7324 stmt
= build3 (BIND_EXPR
, void_type_node
, NULL
, stmt
, NULL
);
7325 TREE_SIDE_EFFECTS (stmt
) = 1;
7331 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
7332 when the current scope is exited. EH_ONLY is true when this is not
7333 meant to apply to normal control flow transfer. */
7336 push_cleanup (tree
ARG_UNUSED (decl
), tree cleanup
, bool eh_only
)
7338 enum tree_code code
;
7342 code
= eh_only
? TRY_CATCH_EXPR
: TRY_FINALLY_EXPR
;
7343 stmt
= build_stmt (code
, NULL
, cleanup
);
7345 stmt_expr
= STATEMENT_LIST_STMT_EXPR (cur_stmt_list
);
7346 list
= push_stmt_list ();
7347 TREE_OPERAND (stmt
, 0) = list
;
7348 STATEMENT_LIST_STMT_EXPR (list
) = stmt_expr
;
7351 /* Build a binary-operation expression without default conversions.
7352 CODE is the kind of expression to build.
7353 This function differs from `build' in several ways:
7354 the data type of the result is computed and recorded in it,
7355 warnings are generated if arg data types are invalid,
7356 special handling for addition and subtraction of pointers is known,
7357 and some optimization is done (operations on narrow ints
7358 are done in the narrower type when that gives the same result).
7359 Constant folding is also done before the result is returned.
7361 Note that the operands will never have enumeral types, or function
7362 or array types, because either they will have the default conversions
7363 performed or they have both just been converted to some other type in which
7364 the arithmetic is to be done. */
7367 build_binary_op (enum tree_code code
, tree orig_op0
, tree orig_op1
,
7371 enum tree_code code0
, code1
;
7374 /* Expression code to give to the expression when it is built.
7375 Normally this is CODE, which is what the caller asked for,
7376 but in some special cases we change it. */
7377 enum tree_code resultcode
= code
;
7379 /* Data type in which the computation is to be performed.
7380 In the simplest cases this is the common type of the arguments. */
7381 tree result_type
= NULL
;
7383 /* Nonzero means operands have already been type-converted
7384 in whatever way is necessary.
7385 Zero means they need to be converted to RESULT_TYPE. */
7388 /* Nonzero means create the expression with this type, rather than
7390 tree build_type
= 0;
7392 /* Nonzero means after finally constructing the expression
7393 convert it to this type. */
7394 tree final_type
= 0;
7396 /* Nonzero if this is an operation like MIN or MAX which can
7397 safely be computed in short if both args are promoted shorts.
7398 Also implies COMMON.
7399 -1 indicates a bitwise operation; this makes a difference
7400 in the exact conditions for when it is safe to do the operation
7401 in a narrower mode. */
7404 /* Nonzero if this is a comparison operation;
7405 if both args are promoted shorts, compare the original shorts.
7406 Also implies COMMON. */
7407 int short_compare
= 0;
7409 /* Nonzero if this is a right-shift operation, which can be computed on the
7410 original short and then promoted if the operand is a promoted short. */
7411 int short_shift
= 0;
7413 /* Nonzero means set RESULT_TYPE to the common type of the args. */
7418 op0
= default_conversion (orig_op0
);
7419 op1
= default_conversion (orig_op1
);
7427 type0
= TREE_TYPE (op0
);
7428 type1
= TREE_TYPE (op1
);
7430 /* The expression codes of the data types of the arguments tell us
7431 whether the arguments are integers, floating, pointers, etc. */
7432 code0
= TREE_CODE (type0
);
7433 code1
= TREE_CODE (type1
);
7435 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
7436 STRIP_TYPE_NOPS (op0
);
7437 STRIP_TYPE_NOPS (op1
);
7439 /* If an error was already reported for one of the arguments,
7440 avoid reporting another error. */
7442 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
7443 return error_mark_node
;
7448 /* Handle the pointer + int case. */
7449 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
7450 return pointer_int_sum (PLUS_EXPR
, op0
, op1
);
7451 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
7452 return pointer_int_sum (PLUS_EXPR
, op1
, op0
);
7458 /* Subtraction of two similar pointers.
7459 We must subtract them as integers, then divide by object size. */
7460 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
7461 && comp_target_types (type0
, type1
, 1))
7462 return pointer_diff (op0
, op1
);
7463 /* Handle pointer minus int. Just like pointer plus int. */
7464 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
7465 return pointer_int_sum (MINUS_EXPR
, op0
, op1
);
7474 case TRUNC_DIV_EXPR
:
7476 case FLOOR_DIV_EXPR
:
7477 case ROUND_DIV_EXPR
:
7478 case EXACT_DIV_EXPR
:
7479 /* Floating point division by zero is a legitimate way to obtain
7480 infinities and NaNs. */
7481 if (warn_div_by_zero
&& skip_evaluation
== 0 && integer_zerop (op1
))
7482 warning (0, "division by zero");
7484 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
7485 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
7486 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
7487 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
7489 if (code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
7490 code0
= TREE_CODE (TREE_TYPE (TREE_TYPE (op0
)));
7491 if (code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
)
7492 code1
= TREE_CODE (TREE_TYPE (TREE_TYPE (op1
)));
7494 if (!(code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
))
7495 resultcode
= RDIV_EXPR
;
7497 /* Although it would be tempting to shorten always here, that
7498 loses on some targets, since the modulo instruction is
7499 undefined if the quotient can't be represented in the
7500 computation mode. We shorten only if unsigned or if
7501 dividing by something we know != -1. */
7502 shorten
= (TYPE_UNSIGNED (TREE_TYPE (orig_op0
))
7503 || (TREE_CODE (op1
) == INTEGER_CST
7504 && !integer_all_onesp (op1
)));
7512 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
7514 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
7518 case TRUNC_MOD_EXPR
:
7519 case FLOOR_MOD_EXPR
:
7520 if (warn_div_by_zero
&& skip_evaluation
== 0 && integer_zerop (op1
))
7521 warning (0, "division by zero");
7523 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
7525 /* Although it would be tempting to shorten always here, that loses
7526 on some targets, since the modulo instruction is undefined if the
7527 quotient can't be represented in the computation mode. We shorten
7528 only if unsigned or if dividing by something we know != -1. */
7529 shorten
= (TYPE_UNSIGNED (TREE_TYPE (orig_op0
))
7530 || (TREE_CODE (op1
) == INTEGER_CST
7531 && !integer_all_onesp (op1
)));
7536 case TRUTH_ANDIF_EXPR
:
7537 case TRUTH_ORIF_EXPR
:
7538 case TRUTH_AND_EXPR
:
7540 case TRUTH_XOR_EXPR
:
7541 if ((code0
== INTEGER_TYPE
|| code0
== POINTER_TYPE
7542 || code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
7543 && (code1
== INTEGER_TYPE
|| code1
== POINTER_TYPE
7544 || code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
))
7546 /* Result of these operations is always an int,
7547 but that does not mean the operands should be
7548 converted to ints! */
7549 result_type
= integer_type_node
;
7550 op0
= c_common_truthvalue_conversion (op0
);
7551 op1
= c_common_truthvalue_conversion (op1
);
7556 /* Shift operations: result has same type as first operand;
7557 always convert second operand to int.
7558 Also set SHORT_SHIFT if shifting rightward. */
7561 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
7563 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
7565 if (tree_int_cst_sgn (op1
) < 0)
7566 warning (0, "right shift count is negative");
7569 if (!integer_zerop (op1
))
7572 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
7573 warning (0, "right shift count >= width of type");
7577 /* Use the type of the value to be shifted. */
7578 result_type
= type0
;
7579 /* Convert the shift-count to an integer, regardless of size
7580 of value being shifted. */
7581 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
7582 op1
= convert (integer_type_node
, op1
);
7583 /* Avoid converting op1 to result_type later. */
7589 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
7591 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
7593 if (tree_int_cst_sgn (op1
) < 0)
7594 warning (0, "left shift count is negative");
7596 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
7597 warning (0, "left shift count >= width of type");
7600 /* Use the type of the value to be shifted. */
7601 result_type
= type0
;
7602 /* Convert the shift-count to an integer, regardless of size
7603 of value being shifted. */
7604 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
7605 op1
= convert (integer_type_node
, op1
);
7606 /* Avoid converting op1 to result_type later. */
7613 if (warn_float_equal
&& (code0
== REAL_TYPE
|| code1
== REAL_TYPE
))
7614 warning (0, "comparing floating point with == or != is unsafe");
7615 /* Result of comparison is always int,
7616 but don't convert the args to int! */
7617 build_type
= integer_type_node
;
7618 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
7619 || code0
== COMPLEX_TYPE
)
7620 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
7621 || code1
== COMPLEX_TYPE
))
7623 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
7625 tree tt0
= TREE_TYPE (type0
);
7626 tree tt1
= TREE_TYPE (type1
);
7627 /* Anything compares with void *. void * compares with anything.
7628 Otherwise, the targets must be compatible
7629 and both must be object or both incomplete. */
7630 if (comp_target_types (type0
, type1
, 1))
7631 result_type
= common_pointer_type (type0
, type1
);
7632 else if (VOID_TYPE_P (tt0
))
7634 /* op0 != orig_op0 detects the case of something
7635 whose value is 0 but which isn't a valid null ptr const. */
7636 if (pedantic
&& (!integer_zerop (op0
) || op0
!= orig_op0
)
7637 && TREE_CODE (tt1
) == FUNCTION_TYPE
)
7638 pedwarn ("ISO C forbids comparison of %<void *%>"
7639 " with function pointer");
7641 else if (VOID_TYPE_P (tt1
))
7643 if (pedantic
&& (!integer_zerop (op1
) || op1
!= orig_op1
)
7644 && TREE_CODE (tt0
) == FUNCTION_TYPE
)
7645 pedwarn ("ISO C forbids comparison of %<void *%>"
7646 " with function pointer");
7649 pedwarn ("comparison of distinct pointer types lacks a cast");
7651 if (result_type
== NULL_TREE
)
7652 result_type
= ptr_type_node
;
7654 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
7655 && integer_zerop (op1
))
7656 result_type
= type0
;
7657 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
7658 && integer_zerop (op0
))
7659 result_type
= type1
;
7660 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
7662 result_type
= type0
;
7663 pedwarn ("comparison between pointer and integer");
7665 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
7667 result_type
= type1
;
7668 pedwarn ("comparison between pointer and integer");
7676 build_type
= integer_type_node
;
7677 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
7678 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
7680 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
7682 if (comp_target_types (type0
, type1
, 1))
7684 result_type
= common_pointer_type (type0
, type1
);
7685 if (!COMPLETE_TYPE_P (TREE_TYPE (type0
))
7686 != !COMPLETE_TYPE_P (TREE_TYPE (type1
)))
7687 pedwarn ("comparison of complete and incomplete pointers");
7689 && TREE_CODE (TREE_TYPE (type0
)) == FUNCTION_TYPE
)
7690 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
7694 result_type
= ptr_type_node
;
7695 pedwarn ("comparison of distinct pointer types lacks a cast");
7698 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
7699 && integer_zerop (op1
))
7701 result_type
= type0
;
7702 if (pedantic
|| extra_warnings
)
7703 pedwarn ("ordered comparison of pointer with integer zero");
7705 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
7706 && integer_zerop (op0
))
7708 result_type
= type1
;
7710 pedwarn ("ordered comparison of pointer with integer zero");
7712 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
7714 result_type
= type0
;
7715 pedwarn ("comparison between pointer and integer");
7717 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
7719 result_type
= type1
;
7720 pedwarn ("comparison between pointer and integer");
7728 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
7729 return error_mark_node
;
7731 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
7732 || code0
== VECTOR_TYPE
)
7734 (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
7735 || code1
== VECTOR_TYPE
))
7737 int none_complex
= (code0
!= COMPLEX_TYPE
&& code1
!= COMPLEX_TYPE
);
7739 if (shorten
|| common
|| short_compare
)
7740 result_type
= c_common_type (type0
, type1
);
7742 /* For certain operations (which identify themselves by shorten != 0)
7743 if both args were extended from the same smaller type,
7744 do the arithmetic in that type and then extend.
7746 shorten !=0 and !=1 indicates a bitwise operation.
7747 For them, this optimization is safe only if
7748 both args are zero-extended or both are sign-extended.
7749 Otherwise, we might change the result.
7750 Eg, (short)-1 | (unsigned short)-1 is (int)-1
7751 but calculated in (unsigned short) it would be (unsigned short)-1. */
7753 if (shorten
&& none_complex
)
7755 int unsigned0
, unsigned1
;
7756 tree arg0
= get_narrower (op0
, &unsigned0
);
7757 tree arg1
= get_narrower (op1
, &unsigned1
);
7758 /* UNS is 1 if the operation to be done is an unsigned one. */
7759 int uns
= TYPE_UNSIGNED (result_type
);
7762 final_type
= result_type
;
7764 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
7765 but it *requires* conversion to FINAL_TYPE. */
7767 if ((TYPE_PRECISION (TREE_TYPE (op0
))
7768 == TYPE_PRECISION (TREE_TYPE (arg0
)))
7769 && TREE_TYPE (op0
) != final_type
)
7770 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
7771 if ((TYPE_PRECISION (TREE_TYPE (op1
))
7772 == TYPE_PRECISION (TREE_TYPE (arg1
)))
7773 && TREE_TYPE (op1
) != final_type
)
7774 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
7776 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
7778 /* For bitwise operations, signedness of nominal type
7779 does not matter. Consider only how operands were extended. */
7783 /* Note that in all three cases below we refrain from optimizing
7784 an unsigned operation on sign-extended args.
7785 That would not be valid. */
7787 /* Both args variable: if both extended in same way
7788 from same width, do it in that width.
7789 Do it unsigned if args were zero-extended. */
7790 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
7791 < TYPE_PRECISION (result_type
))
7792 && (TYPE_PRECISION (TREE_TYPE (arg1
))
7793 == TYPE_PRECISION (TREE_TYPE (arg0
)))
7794 && unsigned0
== unsigned1
7795 && (unsigned0
|| !uns
))
7797 = c_common_signed_or_unsigned_type
7798 (unsigned0
, c_common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
7799 else if (TREE_CODE (arg0
) == INTEGER_CST
7800 && (unsigned1
|| !uns
)
7801 && (TYPE_PRECISION (TREE_TYPE (arg1
))
7802 < TYPE_PRECISION (result_type
))
7804 = c_common_signed_or_unsigned_type (unsigned1
,
7806 int_fits_type_p (arg0
, type
)))
7808 else if (TREE_CODE (arg1
) == INTEGER_CST
7809 && (unsigned0
|| !uns
)
7810 && (TYPE_PRECISION (TREE_TYPE (arg0
))
7811 < TYPE_PRECISION (result_type
))
7813 = c_common_signed_or_unsigned_type (unsigned0
,
7815 int_fits_type_p (arg1
, type
)))
7819 /* Shifts can be shortened if shifting right. */
7824 tree arg0
= get_narrower (op0
, &unsigned_arg
);
7826 final_type
= result_type
;
7828 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
7829 unsigned_arg
= TYPE_UNSIGNED (TREE_TYPE (op0
));
7831 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
7832 /* We can shorten only if the shift count is less than the
7833 number of bits in the smaller type size. */
7834 && compare_tree_int (op1
, TYPE_PRECISION (TREE_TYPE (arg0
))) < 0
7835 /* We cannot drop an unsigned shift after sign-extension. */
7836 && (!TYPE_UNSIGNED (final_type
) || unsigned_arg
))
7838 /* Do an unsigned shift if the operand was zero-extended. */
7840 = c_common_signed_or_unsigned_type (unsigned_arg
,
7842 /* Convert value-to-be-shifted to that type. */
7843 if (TREE_TYPE (op0
) != result_type
)
7844 op0
= convert (result_type
, op0
);
7849 /* Comparison operations are shortened too but differently.
7850 They identify themselves by setting short_compare = 1. */
7854 /* Don't write &op0, etc., because that would prevent op0
7855 from being kept in a register.
7856 Instead, make copies of the our local variables and
7857 pass the copies by reference, then copy them back afterward. */
7858 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
7859 enum tree_code xresultcode
= resultcode
;
7861 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
7866 op0
= xop0
, op1
= xop1
;
7868 resultcode
= xresultcode
;
7870 if (warn_sign_compare
&& skip_evaluation
== 0)
7872 int op0_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
7873 int op1_signed
= !TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
7874 int unsignedp0
, unsignedp1
;
7875 tree primop0
= get_narrower (op0
, &unsignedp0
);
7876 tree primop1
= get_narrower (op1
, &unsignedp1
);
7880 STRIP_TYPE_NOPS (xop0
);
7881 STRIP_TYPE_NOPS (xop1
);
7883 /* Give warnings for comparisons between signed and unsigned
7884 quantities that may fail.
7886 Do the checking based on the original operand trees, so that
7887 casts will be considered, but default promotions won't be.
7889 Do not warn if the comparison is being done in a signed type,
7890 since the signed type will only be chosen if it can represent
7891 all the values of the unsigned type. */
7892 if (!TYPE_UNSIGNED (result_type
))
7894 /* Do not warn if both operands are the same signedness. */
7895 else if (op0_signed
== op1_signed
)
7902 sop
= xop0
, uop
= xop1
;
7904 sop
= xop1
, uop
= xop0
;
7906 /* Do not warn if the signed quantity is an
7907 unsuffixed integer literal (or some static
7908 constant expression involving such literals or a
7909 conditional expression involving such literals)
7910 and it is non-negative. */
7911 if (tree_expr_nonnegative_p (sop
))
7913 /* Do not warn if the comparison is an equality operation,
7914 the unsigned quantity is an integral constant, and it
7915 would fit in the result if the result were signed. */
7916 else if (TREE_CODE (uop
) == INTEGER_CST
7917 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
7919 (uop
, c_common_signed_type (result_type
)))
7921 /* Do not warn if the unsigned quantity is an enumeration
7922 constant and its maximum value would fit in the result
7923 if the result were signed. */
7924 else if (TREE_CODE (uop
) == INTEGER_CST
7925 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
7927 (TYPE_MAX_VALUE (TREE_TYPE (uop
)),
7928 c_common_signed_type (result_type
)))
7931 warning (0, "comparison between signed and unsigned");
7934 /* Warn if two unsigned values are being compared in a size
7935 larger than their original size, and one (and only one) is the
7936 result of a `~' operator. This comparison will always fail.
7938 Also warn if one operand is a constant, and the constant
7939 does not have all bits set that are set in the ~ operand
7940 when it is extended. */
7942 if ((TREE_CODE (primop0
) == BIT_NOT_EXPR
)
7943 != (TREE_CODE (primop1
) == BIT_NOT_EXPR
))
7945 if (TREE_CODE (primop0
) == BIT_NOT_EXPR
)
7946 primop0
= get_narrower (TREE_OPERAND (primop0
, 0),
7949 primop1
= get_narrower (TREE_OPERAND (primop1
, 0),
7952 if (host_integerp (primop0
, 0) || host_integerp (primop1
, 0))
7955 HOST_WIDE_INT constant
, mask
;
7956 int unsignedp
, bits
;
7958 if (host_integerp (primop0
, 0))
7961 unsignedp
= unsignedp1
;
7962 constant
= tree_low_cst (primop0
, 0);
7967 unsignedp
= unsignedp0
;
7968 constant
= tree_low_cst (primop1
, 0);
7971 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
7972 if (bits
< TYPE_PRECISION (result_type
)
7973 && bits
< HOST_BITS_PER_WIDE_INT
&& unsignedp
)
7975 mask
= (~(HOST_WIDE_INT
) 0) << bits
;
7976 if ((mask
& constant
) != mask
)
7977 warning (0, "comparison of promoted ~unsigned with constant");
7980 else if (unsignedp0
&& unsignedp1
7981 && (TYPE_PRECISION (TREE_TYPE (primop0
))
7982 < TYPE_PRECISION (result_type
))
7983 && (TYPE_PRECISION (TREE_TYPE (primop1
))
7984 < TYPE_PRECISION (result_type
)))
7985 warning (0, "comparison of promoted ~unsigned with unsigned");
7991 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
7992 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
7993 Then the expression will be built.
7994 It will be given type FINAL_TYPE if that is nonzero;
7995 otherwise, it will be given type RESULT_TYPE. */
7999 binary_op_error (code
);
8000 return error_mark_node
;
8005 if (TREE_TYPE (op0
) != result_type
)
8006 op0
= convert (result_type
, op0
);
8007 if (TREE_TYPE (op1
) != result_type
)
8008 op1
= convert (result_type
, op1
);
8010 /* This can happen if one operand has a vector type, and the other
8011 has a different type. */
8012 if (TREE_CODE (op0
) == ERROR_MARK
|| TREE_CODE (op1
) == ERROR_MARK
)
8013 return error_mark_node
;
8016 if (build_type
== NULL_TREE
)
8017 build_type
= result_type
;
8020 tree result
= build2 (resultcode
, build_type
, op0
, op1
);
8022 /* Treat expressions in initializers specially as they can't trap. */
8023 result
= require_constant_value
? fold_initializer (result
)
8026 if (final_type
!= 0)
8027 result
= convert (final_type
, result
);
8033 /* Convert EXPR to be a truth-value, validating its type for this
8034 purpose. Passes EXPR to default_function_array_conversion. */
8037 c_objc_common_truthvalue_conversion (tree expr
)
8039 expr
= default_function_array_conversion (expr
);
8040 switch (TREE_CODE (TREE_TYPE (expr
)))
8043 error ("used array that cannot be converted to pointer where scalar is required");
8044 return error_mark_node
;
8047 error ("used struct type value where scalar is required");
8048 return error_mark_node
;
8051 error ("used union type value where scalar is required");
8052 return error_mark_node
;
8058 /* ??? Should we also give an error for void and vectors rather than
8059 leaving those to give errors later? */
8060 return c_common_truthvalue_conversion (expr
);