1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002, 2003, 2004 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.
28 There are also routines to build RETURN_STMT nodes and CASE_STMT nodes,
29 and to process initializations in declarations (since they work
30 like a strange sort of assignment). */
34 #include "coretypes.h"
38 #include "langhooks.h"
48 #include "tree-iterator.h"
49 #include "tree-gimple.h"
52 /* Nonzero if we've already printed a "missing braces around initializer"
53 message within this initializer. */
54 static int missing_braces_mentioned
;
56 static int require_constant_value
;
57 static int require_constant_elements
;
59 static tree
qualify_type (tree
, tree
);
60 static int tagged_types_tu_compatible_p (tree
, tree
);
61 static int comp_target_types (tree
, tree
, int);
62 static int function_types_compatible_p (tree
, tree
);
63 static int type_lists_compatible_p (tree
, tree
);
64 static tree
decl_constant_value_for_broken_optimization (tree
);
65 static tree
default_function_array_conversion (tree
);
66 static tree
lookup_field (tree
, tree
);
67 static tree
convert_arguments (tree
, tree
, tree
, tree
);
68 static tree
pointer_diff (tree
, tree
);
69 static tree
internal_build_compound_expr (tree
, int);
70 static tree
convert_for_assignment (tree
, tree
, const char *, tree
, tree
,
72 static void warn_for_assignment (const char *, const char *, tree
, int);
73 static tree
valid_compound_expr_initializer (tree
, tree
);
74 static void push_string (const char *);
75 static void push_member_name (tree
);
76 static void push_array_bounds (int);
77 static int spelling_length (void);
78 static char *print_spelling (char *);
79 static void warning_init (const char *);
80 static tree
digest_init (tree
, tree
, int);
81 static void output_init_element (tree
, tree
, tree
, int);
82 static void output_pending_init_elements (int);
83 static int set_designator (int);
84 static void push_range_stack (tree
);
85 static void add_pending_init (tree
, tree
);
86 static void set_nonincremental_init (void);
87 static void set_nonincremental_init_from_string (tree
);
88 static tree
find_init_member (tree
);
89 static int lvalue_or_else (tree
, const char *);
91 /* Do `exp = require_complete_type (exp);' to make sure exp
92 does not have an incomplete type. (That includes void types.) */
95 require_complete_type (tree value
)
97 tree type
= TREE_TYPE (value
);
99 if (value
== error_mark_node
|| type
== error_mark_node
)
100 return error_mark_node
;
102 /* First, detect a valid value with a complete type. */
103 if (COMPLETE_TYPE_P (type
))
106 c_incomplete_type_error (value
, type
);
107 return error_mark_node
;
110 /* Print an error message for invalid use of an incomplete type.
111 VALUE is the expression that was used (or 0 if that isn't known)
112 and TYPE is the type that was invalid. */
115 c_incomplete_type_error (tree value
, tree type
)
117 const char *type_code_string
;
119 /* Avoid duplicate error message. */
120 if (TREE_CODE (type
) == ERROR_MARK
)
123 if (value
!= 0 && (TREE_CODE (value
) == VAR_DECL
124 || TREE_CODE (value
) == PARM_DECL
))
125 error ("`%s' has an incomplete type",
126 IDENTIFIER_POINTER (DECL_NAME (value
)));
130 /* We must print an error message. Be clever about what it says. */
132 switch (TREE_CODE (type
))
135 type_code_string
= "struct";
139 type_code_string
= "union";
143 type_code_string
= "enum";
147 error ("invalid use of void expression");
151 if (TYPE_DOMAIN (type
))
153 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) == NULL
)
155 error ("invalid use of flexible array member");
158 type
= TREE_TYPE (type
);
161 error ("invalid use of array with unspecified bounds");
168 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
169 error ("invalid use of undefined type `%s %s'",
170 type_code_string
, IDENTIFIER_POINTER (TYPE_NAME (type
)));
172 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
173 error ("invalid use of incomplete typedef `%s'",
174 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
))));
178 /* Given a type, apply default promotions wrt unnamed function
179 arguments and return the new type. */
182 c_type_promotes_to (tree type
)
184 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
185 return double_type_node
;
187 if (c_promoting_integer_type_p (type
))
189 /* Preserve unsignedness if not really getting any wider. */
190 if (TYPE_UNSIGNED (type
)
191 && (TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
)))
192 return unsigned_type_node
;
193 return integer_type_node
;
199 /* Return a variant of TYPE which has all the type qualifiers of LIKE
200 as well as those of TYPE. */
203 qualify_type (tree type
, tree like
)
205 return c_build_qualified_type (type
,
206 TYPE_QUALS (type
) | TYPE_QUALS (like
));
209 /* Return the composite type of two compatible types.
211 We assume that comptypes has already been done and returned
212 nonzero; if that isn't so, this may crash. In particular, we
213 assume that qualifiers match. */
216 composite_type (tree t1
, tree t2
)
218 enum tree_code code1
;
219 enum tree_code code2
;
222 /* Save time if the two types are the same. */
224 if (t1
== t2
) return t1
;
226 /* If one type is nonsense, use the other. */
227 if (t1
== error_mark_node
)
229 if (t2
== error_mark_node
)
232 code1
= TREE_CODE (t1
);
233 code2
= TREE_CODE (t2
);
235 /* Merge the attributes. */
236 attributes
= targetm
.merge_type_attributes (t1
, t2
);
238 /* If one is an enumerated type and the other is the compatible
239 integer type, the composite type might be either of the two
240 (DR#013 question 3). For consistency, use the enumerated type as
241 the composite type. */
243 if (code1
== ENUMERAL_TYPE
&& code2
== INTEGER_TYPE
)
245 if (code2
== ENUMERAL_TYPE
&& code1
== INTEGER_TYPE
)
254 /* For two pointers, do this recursively on the target type. */
256 tree pointed_to_1
= TREE_TYPE (t1
);
257 tree pointed_to_2
= TREE_TYPE (t2
);
258 tree target
= composite_type (pointed_to_1
, pointed_to_2
);
259 t1
= build_pointer_type (target
);
260 return build_type_attribute_variant (t1
, attributes
);
265 tree elt
= composite_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
266 /* Save space: see if the result is identical to one of the args. */
267 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
268 return build_type_attribute_variant (t1
, attributes
);
269 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
270 return build_type_attribute_variant (t2
, attributes
);
271 /* Merge the element types, and have a size if either arg has one. */
272 t1
= build_array_type (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
273 return build_type_attribute_variant (t1
, attributes
);
277 /* Function types: prefer the one that specified arg types.
278 If both do, merge the arg types. Also merge the return types. */
280 tree valtype
= composite_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
281 tree p1
= TYPE_ARG_TYPES (t1
);
282 tree p2
= TYPE_ARG_TYPES (t2
);
287 /* Save space: see if the result is identical to one of the args. */
288 if (valtype
== TREE_TYPE (t1
) && ! TYPE_ARG_TYPES (t2
))
289 return build_type_attribute_variant (t1
, attributes
);
290 if (valtype
== TREE_TYPE (t2
) && ! TYPE_ARG_TYPES (t1
))
291 return build_type_attribute_variant (t2
, attributes
);
293 /* Simple way if one arg fails to specify argument types. */
294 if (TYPE_ARG_TYPES (t1
) == 0)
296 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t2
));
297 return build_type_attribute_variant (t1
, attributes
);
299 if (TYPE_ARG_TYPES (t2
) == 0)
301 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t1
));
302 return build_type_attribute_variant (t1
, attributes
);
305 /* If both args specify argument types, we must merge the two
306 lists, argument by argument. */
307 /* Tell global_bindings_p to return false so that variable_size
308 doesn't abort on VLAs in parameter types. */
309 c_override_global_bindings_to_false
= true;
311 len
= list_length (p1
);
314 for (i
= 0; i
< len
; i
++)
315 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
320 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
))
322 /* A null type means arg type is not specified.
323 Take whatever the other function type has. */
324 if (TREE_VALUE (p1
) == 0)
326 TREE_VALUE (n
) = TREE_VALUE (p2
);
329 if (TREE_VALUE (p2
) == 0)
331 TREE_VALUE (n
) = TREE_VALUE (p1
);
335 /* Given wait (union {union wait *u; int *i} *)
336 and wait (union wait *),
337 prefer union wait * as type of parm. */
338 if (TREE_CODE (TREE_VALUE (p1
)) == UNION_TYPE
339 && TREE_VALUE (p1
) != TREE_VALUE (p2
))
342 for (memb
= TYPE_FIELDS (TREE_VALUE (p1
));
343 memb
; memb
= TREE_CHAIN (memb
))
344 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (p2
)))
346 TREE_VALUE (n
) = TREE_VALUE (p2
);
348 pedwarn ("function types not truly compatible in ISO C");
352 if (TREE_CODE (TREE_VALUE (p2
)) == UNION_TYPE
353 && TREE_VALUE (p2
) != TREE_VALUE (p1
))
356 for (memb
= TYPE_FIELDS (TREE_VALUE (p2
));
357 memb
; memb
= TREE_CHAIN (memb
))
358 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (p1
)))
360 TREE_VALUE (n
) = TREE_VALUE (p1
);
362 pedwarn ("function types not truly compatible in ISO C");
366 TREE_VALUE (n
) = composite_type (TREE_VALUE (p1
), TREE_VALUE (p2
));
370 c_override_global_bindings_to_false
= false;
371 t1
= build_function_type (valtype
, newargs
);
372 /* ... falls through ... */
376 return build_type_attribute_variant (t1
, attributes
);
381 /* Return the type of a conditional expression between pointers to
382 possibly differently qualified versions of compatible types.
384 We assume that comp_target_types has already been done and returned
385 nonzero; if that isn't so, this may crash. */
388 common_pointer_type (tree t1
, tree t2
)
395 /* Save time if the two types are the same. */
397 if (t1
== t2
) return t1
;
399 /* If one type is nonsense, use the other. */
400 if (t1
== error_mark_node
)
402 if (t2
== error_mark_node
)
405 if (TREE_CODE (t1
) != POINTER_TYPE
|| TREE_CODE (t2
) != POINTER_TYPE
)
408 /* Merge the attributes. */
409 attributes
= targetm
.merge_type_attributes (t1
, t2
);
411 /* Find the composite type of the target types, and combine the
412 qualifiers of the two types' targets. */
413 pointed_to_1
= TREE_TYPE (t1
);
414 pointed_to_2
= TREE_TYPE (t2
);
415 target
= composite_type (TYPE_MAIN_VARIANT (pointed_to_1
),
416 TYPE_MAIN_VARIANT (pointed_to_2
));
417 t1
= build_pointer_type (c_build_qualified_type
419 TYPE_QUALS (pointed_to_1
) |
420 TYPE_QUALS (pointed_to_2
)));
421 return build_type_attribute_variant (t1
, attributes
);
424 /* Return the common type for two arithmetic types under the usual
425 arithmetic conversions. The default conversions have already been
426 applied, and enumerated types converted to their compatible integer
427 types. The resulting type is unqualified and has no attributes.
429 This is the type for the result of most arithmetic operations
430 if the operands have the given two types. */
433 common_type (tree t1
, tree t2
)
435 enum tree_code code1
;
436 enum tree_code code2
;
438 /* If one type is nonsense, use the other. */
439 if (t1
== error_mark_node
)
441 if (t2
== error_mark_node
)
444 if (TYPE_QUALS (t1
) != TYPE_UNQUALIFIED
)
445 t1
= TYPE_MAIN_VARIANT (t1
);
447 if (TYPE_QUALS (t2
) != TYPE_UNQUALIFIED
)
448 t2
= TYPE_MAIN_VARIANT (t2
);
450 if (TYPE_ATTRIBUTES (t1
) != NULL_TREE
)
451 t1
= build_type_attribute_variant (t1
, NULL_TREE
);
453 if (TYPE_ATTRIBUTES (t2
) != NULL_TREE
)
454 t2
= build_type_attribute_variant (t2
, NULL_TREE
);
456 /* Save time if the two types are the same. */
458 if (t1
== t2
) return t1
;
460 code1
= TREE_CODE (t1
);
461 code2
= TREE_CODE (t2
);
463 if (code1
!= VECTOR_TYPE
&& code1
!= COMPLEX_TYPE
464 && code1
!= REAL_TYPE
&& code1
!= INTEGER_TYPE
)
467 if (code2
!= VECTOR_TYPE
&& code2
!= COMPLEX_TYPE
468 && code2
!= REAL_TYPE
&& code2
!= INTEGER_TYPE
)
471 /* If one type is a vector type, return that type. (How the usual
472 arithmetic conversions apply to the vector types extension is not
473 precisely specified.) */
474 if (code1
== VECTOR_TYPE
)
477 if (code2
== VECTOR_TYPE
)
480 /* If one type is complex, form the common type of the non-complex
481 components, then make that complex. Use T1 or T2 if it is the
483 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
485 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
486 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
487 tree subtype
= common_type (subtype1
, subtype2
);
489 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
491 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
494 return build_complex_type (subtype
);
497 /* If only one is real, use it as the result. */
499 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
502 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
505 /* Both real or both integers; use the one with greater precision. */
507 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
509 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
512 /* Same precision. Prefer long longs to longs to ints when the
513 same precision, following the C99 rules on integer type rank
514 (which are equivalent to the C90 rules for C90 types). */
516 if (TYPE_MAIN_VARIANT (t1
) == long_long_unsigned_type_node
517 || TYPE_MAIN_VARIANT (t2
) == long_long_unsigned_type_node
)
518 return long_long_unsigned_type_node
;
520 if (TYPE_MAIN_VARIANT (t1
) == long_long_integer_type_node
521 || TYPE_MAIN_VARIANT (t2
) == long_long_integer_type_node
)
523 if (TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
524 return long_long_unsigned_type_node
;
526 return long_long_integer_type_node
;
529 if (TYPE_MAIN_VARIANT (t1
) == long_unsigned_type_node
530 || TYPE_MAIN_VARIANT (t2
) == long_unsigned_type_node
)
531 return long_unsigned_type_node
;
533 if (TYPE_MAIN_VARIANT (t1
) == long_integer_type_node
534 || TYPE_MAIN_VARIANT (t2
) == long_integer_type_node
)
536 /* But preserve unsignedness from the other type,
537 since long cannot hold all the values of an unsigned int. */
538 if (TYPE_UNSIGNED (t1
) || TYPE_UNSIGNED (t2
))
539 return long_unsigned_type_node
;
541 return long_integer_type_node
;
544 /* Likewise, prefer long double to double even if same size. */
545 if (TYPE_MAIN_VARIANT (t1
) == long_double_type_node
546 || TYPE_MAIN_VARIANT (t2
) == long_double_type_node
)
547 return long_double_type_node
;
549 /* Otherwise prefer the unsigned one. */
551 if (TYPE_UNSIGNED (t1
))
557 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
558 or various other operations. Return 2 if they are compatible
559 but a warning may be needed if you use them together. */
562 comptypes (tree type1
, tree type2
)
568 /* Suppress errors caused by previously reported errors. */
570 if (t1
== t2
|| !t1
|| !t2
571 || TREE_CODE (t1
) == ERROR_MARK
|| TREE_CODE (t2
) == ERROR_MARK
)
574 /* If either type is the internal version of sizetype, return the
576 if (TREE_CODE (t1
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t1
)
577 && TYPE_ORIG_SIZE_TYPE (t1
))
578 t1
= TYPE_ORIG_SIZE_TYPE (t1
);
580 if (TREE_CODE (t2
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t2
)
581 && TYPE_ORIG_SIZE_TYPE (t2
))
582 t2
= TYPE_ORIG_SIZE_TYPE (t2
);
585 /* Enumerated types are compatible with integer types, but this is
586 not transitive: two enumerated types in the same translation unit
587 are compatible with each other only if they are the same type. */
589 if (TREE_CODE (t1
) == ENUMERAL_TYPE
&& TREE_CODE (t2
) != ENUMERAL_TYPE
)
590 t1
= c_common_type_for_size (TYPE_PRECISION (t1
), TYPE_UNSIGNED (t1
));
591 else if (TREE_CODE (t2
) == ENUMERAL_TYPE
&& TREE_CODE (t1
) != ENUMERAL_TYPE
)
592 t2
= c_common_type_for_size (TYPE_PRECISION (t2
), TYPE_UNSIGNED (t2
));
597 /* Different classes of types can't be compatible. */
599 if (TREE_CODE (t1
) != TREE_CODE (t2
))
602 /* Qualifiers must match. C99 6.7.3p9 */
604 if (TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
607 /* Allow for two different type nodes which have essentially the same
608 definition. Note that we already checked for equality of the type
609 qualifiers (just above). */
611 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
614 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
615 if (! (attrval
= targetm
.comp_type_attributes (t1
, t2
)))
618 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
621 switch (TREE_CODE (t1
))
624 /* We must give ObjC the first crack at comparing pointers, since
625 protocol qualifiers may be involved. */
626 if (c_dialect_objc () && (val
= objc_comptypes (t1
, t2
, 0)) >= 0)
628 val
= (TREE_TYPE (t1
) == TREE_TYPE (t2
)
629 ? 1 : comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
)));
633 val
= function_types_compatible_p (t1
, t2
);
638 tree d1
= TYPE_DOMAIN (t1
);
639 tree d2
= TYPE_DOMAIN (t2
);
640 bool d1_variable
, d2_variable
;
641 bool d1_zero
, d2_zero
;
644 /* Target types must match incl. qualifiers. */
645 if (TREE_TYPE (t1
) != TREE_TYPE (t2
)
646 && 0 == (val
= comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
))))
649 /* Sizes must match unless one is missing or variable. */
650 if (d1
== 0 || d2
== 0 || d1
== d2
)
653 d1_zero
= ! TYPE_MAX_VALUE (d1
);
654 d2_zero
= ! TYPE_MAX_VALUE (d2
);
656 d1_variable
= (! d1_zero
657 && (TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
658 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
));
659 d2_variable
= (! d2_zero
660 && (TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
661 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
));
663 if (d1_variable
|| d2_variable
)
665 if (d1_zero
&& d2_zero
)
667 if (d1_zero
|| d2_zero
668 || ! tree_int_cst_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
))
669 || ! tree_int_cst_equal (TYPE_MAX_VALUE (d1
), TYPE_MAX_VALUE (d2
)))
676 /* We are dealing with two distinct structs. In assorted Objective-C
677 corner cases, however, these can still be deemed equivalent. */
678 if (c_dialect_objc () && objc_comptypes (t1
, t2
, 0) == 1)
683 if (val
!= 1 && !same_translation_unit_p (t1
, t2
))
684 val
= tagged_types_tu_compatible_p (t1
, t2
);
688 val
= TYPE_VECTOR_SUBPARTS (t1
) == TYPE_VECTOR_SUBPARTS (t2
)
689 && comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
));
695 return attrval
== 2 && val
== 1 ? 2 : val
;
698 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
699 ignoring their qualifiers. REFLEXIVE is only used by ObjC - set it
700 to 1 or 0 depending if the check of the pointer types is meant to
701 be reflexive or not (typically, assignments are not reflexive,
702 while comparisons are reflexive).
706 comp_target_types (tree ttl
, tree ttr
, int reflexive
)
710 /* Give objc_comptypes a crack at letting these types through. */
711 if ((val
= objc_comptypes (ttl
, ttr
, reflexive
)) >= 0)
714 val
= comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ttl
)),
715 TYPE_MAIN_VARIANT (TREE_TYPE (ttr
)));
717 if (val
== 2 && pedantic
)
718 pedwarn ("types are not quite compatible");
722 /* Subroutines of `comptypes'. */
724 /* Determine whether two trees derive from the same translation unit.
725 If the CONTEXT chain ends in a null, that tree's context is still
726 being parsed, so if two trees have context chains ending in null,
727 they're in the same translation unit. */
729 same_translation_unit_p (tree t1
, tree t2
)
731 while (t1
&& TREE_CODE (t1
) != TRANSLATION_UNIT_DECL
)
732 switch (TREE_CODE_CLASS (TREE_CODE (t1
)))
734 case 'd': t1
= DECL_CONTEXT (t1
); break;
735 case 't': t1
= TYPE_CONTEXT (t1
); break;
736 case 'x': t1
= BLOCK_SUPERCONTEXT (t1
); break; /* assume block */
740 while (t2
&& TREE_CODE (t2
) != TRANSLATION_UNIT_DECL
)
741 switch (TREE_CODE_CLASS (TREE_CODE (t2
)))
743 case 'd': t2
= DECL_CONTEXT (t2
); break;
744 case 't': t2
= TYPE_CONTEXT (t2
); break;
745 case 'x': t2
= BLOCK_SUPERCONTEXT (t2
); break; /* assume block */
752 /* The C standard says that two structures in different translation
753 units are compatible with each other only if the types of their
754 fields are compatible (among other things). So, consider two copies
755 of this structure: */
757 struct tagged_tu_seen
{
758 const struct tagged_tu_seen
* next
;
763 /* Can they be compatible with each other? We choose to break the
764 recursion by allowing those types to be compatible. */
766 static const struct tagged_tu_seen
* tagged_tu_seen_base
;
768 /* Return 1 if two 'struct', 'union', or 'enum' types T1 and T2 are
769 compatible. If the two types are not the same (which has been
770 checked earlier), this can only happen when multiple translation
771 units are being compiled. See C99 6.2.7 paragraph 1 for the exact
775 tagged_types_tu_compatible_p (tree t1
, tree t2
)
778 bool needs_warning
= false;
780 /* We have to verify that the tags of the types are the same. This
781 is harder than it looks because this may be a typedef, so we have
782 to go look at the original type. It may even be a typedef of a
784 In the case of compiler-created builtin structs the TYPE_DECL
785 may be a dummy, with no DECL_ORIGINAL_TYPE. Don't fault. */
786 while (TYPE_NAME (t1
)
787 && TREE_CODE (TYPE_NAME (t1
)) == TYPE_DECL
788 && DECL_ORIGINAL_TYPE (TYPE_NAME (t1
)))
789 t1
= DECL_ORIGINAL_TYPE (TYPE_NAME (t1
));
791 while (TYPE_NAME (t2
)
792 && TREE_CODE (TYPE_NAME (t2
)) == TYPE_DECL
793 && DECL_ORIGINAL_TYPE (TYPE_NAME (t2
)))
794 t2
= DECL_ORIGINAL_TYPE (TYPE_NAME (t2
));
796 /* C90 didn't have the requirement that the two tags be the same. */
797 if (flag_isoc99
&& TYPE_NAME (t1
) != TYPE_NAME (t2
))
800 /* C90 didn't say what happened if one or both of the types were
801 incomplete; we choose to follow C99 rules here, which is that they
803 if (TYPE_SIZE (t1
) == NULL
804 || TYPE_SIZE (t2
) == NULL
)
808 const struct tagged_tu_seen
* tts_i
;
809 for (tts_i
= tagged_tu_seen_base
; tts_i
!= NULL
; tts_i
= tts_i
->next
)
810 if (tts_i
->t1
== t1
&& tts_i
->t2
== t2
)
814 switch (TREE_CODE (t1
))
819 /* Speed up the case where the type values are in the same order. */
820 tree tv1
= TYPE_VALUES (t1
);
821 tree tv2
= TYPE_VALUES (t2
);
826 for (;tv1
&& tv2
; tv1
= TREE_CHAIN (tv1
), tv2
= TREE_CHAIN (tv2
))
828 if (TREE_PURPOSE (tv1
) != TREE_PURPOSE (tv2
))
830 if (simple_cst_equal (TREE_VALUE (tv1
), TREE_VALUE (tv2
)) != 1)
834 if (tv1
== NULL_TREE
&& tv2
== NULL_TREE
)
836 if (tv1
== NULL_TREE
|| tv2
== NULL_TREE
)
839 if (list_length (TYPE_VALUES (t1
)) != list_length (TYPE_VALUES (t2
)))
842 for (s1
= TYPE_VALUES (t1
); s1
; s1
= TREE_CHAIN (s1
))
844 s2
= purpose_member (TREE_PURPOSE (s1
), TYPE_VALUES (t2
));
846 || simple_cst_equal (TREE_VALUE (s1
), TREE_VALUE (s2
)) != 1)
854 if (list_length (TYPE_FIELDS (t1
)) != list_length (TYPE_FIELDS (t2
)))
857 for (s1
= TYPE_FIELDS (t1
); s1
; s1
= TREE_CHAIN (s1
))
860 struct tagged_tu_seen tts
;
862 tts
.next
= tagged_tu_seen_base
;
865 tagged_tu_seen_base
= &tts
;
867 if (DECL_NAME (s1
) != NULL
)
868 for (s2
= TYPE_FIELDS (t2
); s2
; s2
= TREE_CHAIN (s2
))
869 if (DECL_NAME (s1
) == DECL_NAME (s2
))
872 result
= comptypes (TREE_TYPE (s1
), TREE_TYPE (s2
));
876 needs_warning
= true;
878 if (TREE_CODE (s1
) == FIELD_DECL
879 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
880 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
886 tagged_tu_seen_base
= tts
.next
;
890 return needs_warning
? 2 : 1;
895 struct tagged_tu_seen tts
;
897 tts
.next
= tagged_tu_seen_base
;
900 tagged_tu_seen_base
= &tts
;
902 for (s1
= TYPE_FIELDS (t1
), s2
= TYPE_FIELDS (t2
);
904 s1
= TREE_CHAIN (s1
), s2
= TREE_CHAIN (s2
))
907 if (TREE_CODE (s1
) != TREE_CODE (s2
)
908 || DECL_NAME (s1
) != DECL_NAME (s2
))
910 result
= comptypes (TREE_TYPE (s1
), TREE_TYPE (s2
));
914 needs_warning
= true;
916 if (TREE_CODE (s1
) == FIELD_DECL
917 && simple_cst_equal (DECL_FIELD_BIT_OFFSET (s1
),
918 DECL_FIELD_BIT_OFFSET (s2
)) != 1)
921 tagged_tu_seen_base
= tts
.next
;
924 return needs_warning
? 2 : 1;
932 /* Return 1 if two function types F1 and F2 are compatible.
933 If either type specifies no argument types,
934 the other must specify a fixed number of self-promoting arg types.
935 Otherwise, if one type specifies only the number of arguments,
936 the other must specify that number of self-promoting arg types.
937 Otherwise, the argument types must match. */
940 function_types_compatible_p (tree f1
, tree f2
)
943 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
948 ret1
= TREE_TYPE (f1
);
949 ret2
= TREE_TYPE (f2
);
951 /* 'volatile' qualifiers on a function's return type mean the function
953 if (pedantic
&& TYPE_VOLATILE (ret1
) != TYPE_VOLATILE (ret2
))
954 pedwarn ("function return types not compatible due to `volatile'");
955 if (TYPE_VOLATILE (ret1
))
956 ret1
= build_qualified_type (TYPE_MAIN_VARIANT (ret1
),
957 TYPE_QUALS (ret1
) & ~TYPE_QUAL_VOLATILE
);
958 if (TYPE_VOLATILE (ret2
))
959 ret2
= build_qualified_type (TYPE_MAIN_VARIANT (ret2
),
960 TYPE_QUALS (ret2
) & ~TYPE_QUAL_VOLATILE
);
961 val
= comptypes (ret1
, ret2
);
965 args1
= TYPE_ARG_TYPES (f1
);
966 args2
= TYPE_ARG_TYPES (f2
);
968 /* An unspecified parmlist matches any specified parmlist
969 whose argument types don't need default promotions. */
973 if (!self_promoting_args_p (args2
))
975 /* If one of these types comes from a non-prototype fn definition,
976 compare that with the other type's arglist.
977 If they don't match, ask for a warning (but no error). */
978 if (TYPE_ACTUAL_ARG_TYPES (f1
)
979 && 1 != type_lists_compatible_p (args2
, TYPE_ACTUAL_ARG_TYPES (f1
)))
985 if (!self_promoting_args_p (args1
))
987 if (TYPE_ACTUAL_ARG_TYPES (f2
)
988 && 1 != type_lists_compatible_p (args1
, TYPE_ACTUAL_ARG_TYPES (f2
)))
993 /* Both types have argument lists: compare them and propagate results. */
994 val1
= type_lists_compatible_p (args1
, args2
);
995 return val1
!= 1 ? val1
: val
;
998 /* Check two lists of types for compatibility,
999 returning 0 for incompatible, 1 for compatible,
1000 or 2 for compatible with warning. */
1003 type_lists_compatible_p (tree args1
, tree args2
)
1005 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
1011 if (args1
== 0 && args2
== 0)
1013 /* If one list is shorter than the other,
1014 they fail to match. */
1015 if (args1
== 0 || args2
== 0)
1017 /* A null pointer instead of a type
1018 means there is supposed to be an argument
1019 but nothing is specified about what type it has.
1020 So match anything that self-promotes. */
1021 if (TREE_VALUE (args1
) == 0)
1023 if (c_type_promotes_to (TREE_VALUE (args2
)) != TREE_VALUE (args2
))
1026 else if (TREE_VALUE (args2
) == 0)
1028 if (c_type_promotes_to (TREE_VALUE (args1
)) != TREE_VALUE (args1
))
1031 /* If one of the lists has an error marker, ignore this arg. */
1032 else if (TREE_CODE (TREE_VALUE (args1
)) == ERROR_MARK
1033 || TREE_CODE (TREE_VALUE (args2
)) == ERROR_MARK
)
1035 else if (! (newval
= comptypes (TYPE_MAIN_VARIANT (TREE_VALUE (args1
)),
1036 TYPE_MAIN_VARIANT (TREE_VALUE (args2
)))))
1038 /* Allow wait (union {union wait *u; int *i} *)
1039 and wait (union wait *) to be compatible. */
1040 if (TREE_CODE (TREE_VALUE (args1
)) == UNION_TYPE
1041 && (TYPE_NAME (TREE_VALUE (args1
)) == 0
1042 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args1
)))
1043 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args1
))) == INTEGER_CST
1044 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args1
)),
1045 TYPE_SIZE (TREE_VALUE (args2
))))
1048 for (memb
= TYPE_FIELDS (TREE_VALUE (args1
));
1049 memb
; memb
= TREE_CHAIN (memb
))
1050 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (args2
)))
1055 else if (TREE_CODE (TREE_VALUE (args2
)) == UNION_TYPE
1056 && (TYPE_NAME (TREE_VALUE (args2
)) == 0
1057 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args2
)))
1058 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args2
))) == INTEGER_CST
1059 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args2
)),
1060 TYPE_SIZE (TREE_VALUE (args1
))))
1063 for (memb
= TYPE_FIELDS (TREE_VALUE (args2
));
1064 memb
; memb
= TREE_CHAIN (memb
))
1065 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (args1
)))
1074 /* comptypes said ok, but record if it said to warn. */
1078 args1
= TREE_CHAIN (args1
);
1079 args2
= TREE_CHAIN (args2
);
1083 /* Compute the size to increment a pointer by. */
1086 c_size_in_bytes (tree type
)
1088 enum tree_code code
= TREE_CODE (type
);
1090 if (code
== FUNCTION_TYPE
|| code
== VOID_TYPE
|| code
== ERROR_MARK
)
1091 return size_one_node
;
1093 if (!COMPLETE_OR_VOID_TYPE_P (type
))
1095 error ("arithmetic on pointer to an incomplete type");
1096 return size_one_node
;
1099 /* Convert in case a char is more than one unit. */
1100 return size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
1101 size_int (TYPE_PRECISION (char_type_node
)
1105 /* Return either DECL or its known constant value (if it has one). */
1108 decl_constant_value (tree decl
)
1110 if (/* Don't change a variable array bound or initial value to a constant
1111 in a place where a variable is invalid. Note that DECL_INITIAL
1112 isn't valid for a PARM_DECL. */
1113 current_function_decl
!= 0
1114 && TREE_CODE (decl
) != PARM_DECL
1115 && ! TREE_THIS_VOLATILE (decl
)
1116 && TREE_READONLY (decl
)
1117 && DECL_INITIAL (decl
) != 0
1118 && TREE_CODE (DECL_INITIAL (decl
)) != ERROR_MARK
1119 /* This is invalid if initial value is not constant.
1120 If it has either a function call, a memory reference,
1121 or a variable, then re-evaluating it could give different results. */
1122 && TREE_CONSTANT (DECL_INITIAL (decl
))
1123 /* Check for cases where this is sub-optimal, even though valid. */
1124 && TREE_CODE (DECL_INITIAL (decl
)) != CONSTRUCTOR
)
1125 return DECL_INITIAL (decl
);
1129 /* Return either DECL or its known constant value (if it has one), but
1130 return DECL if pedantic or DECL has mode BLKmode. This is for
1131 bug-compatibility with the old behavior of decl_constant_value
1132 (before GCC 3.0); every use of this function is a bug and it should
1133 be removed before GCC 3.1. It is not appropriate to use pedantic
1134 in a way that affects optimization, and BLKmode is probably not the
1135 right test for avoiding misoptimizations either. */
1138 decl_constant_value_for_broken_optimization (tree decl
)
1140 if (pedantic
|| DECL_MODE (decl
) == BLKmode
)
1143 return decl_constant_value (decl
);
1147 /* Perform the default conversion of arrays and functions to pointers.
1148 Return the result of converting EXP. For any other expression, just
1152 default_function_array_conversion (tree exp
)
1155 tree type
= TREE_TYPE (exp
);
1156 enum tree_code code
= TREE_CODE (type
);
1159 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
1162 Do not use STRIP_NOPS here! It will remove conversions from pointer
1163 to integer and cause infinite recursion. */
1165 while (TREE_CODE (exp
) == NON_LVALUE_EXPR
1166 || (TREE_CODE (exp
) == NOP_EXPR
1167 && TREE_TYPE (TREE_OPERAND (exp
, 0)) == TREE_TYPE (exp
)))
1169 if (TREE_CODE (exp
) == NON_LVALUE_EXPR
)
1171 exp
= TREE_OPERAND (exp
, 0);
1174 /* Preserve the original expression code. */
1175 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (exp
))))
1176 C_SET_EXP_ORIGINAL_CODE (exp
, C_EXP_ORIGINAL_CODE (orig_exp
));
1178 if (code
== FUNCTION_TYPE
)
1180 return build_unary_op (ADDR_EXPR
, exp
, 0);
1182 if (code
== ARRAY_TYPE
)
1185 tree restype
= TREE_TYPE (type
);
1191 if (TREE_CODE_CLASS (TREE_CODE (exp
)) == 'r' || DECL_P (exp
))
1193 constp
= TREE_READONLY (exp
);
1194 volatilep
= TREE_THIS_VOLATILE (exp
);
1197 if (TYPE_QUALS (type
) || constp
|| volatilep
)
1199 = c_build_qualified_type (restype
,
1201 | (constp
* TYPE_QUAL_CONST
)
1202 | (volatilep
* TYPE_QUAL_VOLATILE
));
1204 if (TREE_CODE (exp
) == INDIRECT_REF
)
1205 return convert (build_pointer_type (restype
),
1206 TREE_OPERAND (exp
, 0));
1208 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1210 tree op1
= default_conversion (TREE_OPERAND (exp
, 1));
1211 return build (COMPOUND_EXPR
, TREE_TYPE (op1
),
1212 TREE_OPERAND (exp
, 0), op1
);
1215 lvalue_array_p
= !not_lvalue
&& lvalue_p (exp
);
1216 if (!flag_isoc99
&& !lvalue_array_p
)
1218 /* Before C99, non-lvalue arrays do not decay to pointers.
1219 Normally, using such an array would be invalid; but it can
1220 be used correctly inside sizeof or as a statement expression.
1221 Thus, do not give an error here; an error will result later. */
1225 ptrtype
= build_pointer_type (restype
);
1227 if (TREE_CODE (exp
) == VAR_DECL
)
1229 /* ??? This is not really quite correct
1230 in that the type of the operand of ADDR_EXPR
1231 is not the target type of the type of the ADDR_EXPR itself.
1232 Question is, can this lossage be avoided? */
1233 adr
= build1 (ADDR_EXPR
, ptrtype
, exp
);
1234 if (!c_mark_addressable (exp
))
1235 return error_mark_node
;
1236 TREE_SIDE_EFFECTS (adr
) = 0; /* Default would be, same as EXP. */
1239 /* This way is better for a COMPONENT_REF since it can
1240 simplify the offset for a component. */
1241 adr
= build_unary_op (ADDR_EXPR
, exp
, 1);
1242 return convert (ptrtype
, adr
);
1247 /* Perform default promotions for C data used in expressions.
1248 Arrays and functions are converted to pointers;
1249 enumeral types or short or char, to int.
1250 In addition, manifest constants symbols are replaced by their values. */
1253 default_conversion (tree exp
)
1256 tree type
= TREE_TYPE (exp
);
1257 enum tree_code code
= TREE_CODE (type
);
1259 if (code
== FUNCTION_TYPE
|| code
== ARRAY_TYPE
)
1260 return default_function_array_conversion (exp
);
1262 /* Constants can be used directly unless they're not loadable. */
1263 if (TREE_CODE (exp
) == CONST_DECL
)
1264 exp
= DECL_INITIAL (exp
);
1266 /* Replace a nonvolatile const static variable with its value unless
1267 it is an array, in which case we must be sure that taking the
1268 address of the array produces consistent results. */
1269 else if (optimize
&& TREE_CODE (exp
) == VAR_DECL
&& code
!= ARRAY_TYPE
)
1271 exp
= decl_constant_value_for_broken_optimization (exp
);
1272 type
= TREE_TYPE (exp
);
1275 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
1278 Do not use STRIP_NOPS here! It will remove conversions from pointer
1279 to integer and cause infinite recursion. */
1281 while (TREE_CODE (exp
) == NON_LVALUE_EXPR
1282 || (TREE_CODE (exp
) == NOP_EXPR
1283 && TREE_TYPE (TREE_OPERAND (exp
, 0)) == TREE_TYPE (exp
)))
1284 exp
= TREE_OPERAND (exp
, 0);
1286 /* Preserve the original expression code. */
1287 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (exp
))))
1288 C_SET_EXP_ORIGINAL_CODE (exp
, C_EXP_ORIGINAL_CODE (orig_exp
));
1290 /* Normally convert enums to int,
1291 but convert wide enums to something wider. */
1292 if (code
== ENUMERAL_TYPE
)
1294 type
= c_common_type_for_size (MAX (TYPE_PRECISION (type
),
1295 TYPE_PRECISION (integer_type_node
)),
1296 ((TYPE_PRECISION (type
)
1297 >= TYPE_PRECISION (integer_type_node
))
1298 && TYPE_UNSIGNED (type
)));
1300 return convert (type
, exp
);
1303 if (TREE_CODE (exp
) == COMPONENT_REF
1304 && DECL_C_BIT_FIELD (TREE_OPERAND (exp
, 1))
1305 /* If it's thinner than an int, promote it like a
1306 c_promoting_integer_type_p, otherwise leave it alone. */
1307 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp
, 1)),
1308 TYPE_PRECISION (integer_type_node
)))
1309 return convert (integer_type_node
, exp
);
1311 if (c_promoting_integer_type_p (type
))
1313 /* Preserve unsignedness if not really getting any wider. */
1314 if (TYPE_UNSIGNED (type
)
1315 && TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
))
1316 return convert (unsigned_type_node
, exp
);
1318 return convert (integer_type_node
, exp
);
1321 if (code
== VOID_TYPE
)
1323 error ("void value not ignored as it ought to be");
1324 return error_mark_node
;
1329 /* Look up COMPONENT in a structure or union DECL.
1331 If the component name is not found, returns NULL_TREE. Otherwise,
1332 the return value is a TREE_LIST, with each TREE_VALUE a FIELD_DECL
1333 stepping down the chain to the component, which is in the last
1334 TREE_VALUE of the list. Normally the list is of length one, but if
1335 the component is embedded within (nested) anonymous structures or
1336 unions, the list steps down the chain to the component. */
1339 lookup_field (tree decl
, tree component
)
1341 tree type
= TREE_TYPE (decl
);
1344 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1345 to the field elements. Use a binary search on this array to quickly
1346 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1347 will always be set for structures which have many elements. */
1349 if (TYPE_LANG_SPECIFIC (type
))
1352 tree
*field_array
= &TYPE_LANG_SPECIFIC (type
)->s
->elts
[0];
1354 field
= TYPE_FIELDS (type
);
1356 top
= TYPE_LANG_SPECIFIC (type
)->s
->len
;
1357 while (top
- bot
> 1)
1359 half
= (top
- bot
+ 1) >> 1;
1360 field
= field_array
[bot
+half
];
1362 if (DECL_NAME (field
) == NULL_TREE
)
1364 /* Step through all anon unions in linear fashion. */
1365 while (DECL_NAME (field_array
[bot
]) == NULL_TREE
)
1367 field
= field_array
[bot
++];
1368 if (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
1369 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
1371 tree anon
= lookup_field (field
, component
);
1374 return tree_cons (NULL_TREE
, field
, anon
);
1378 /* Entire record is only anon unions. */
1382 /* Restart the binary search, with new lower bound. */
1386 if (DECL_NAME (field
) == component
)
1388 if (DECL_NAME (field
) < component
)
1394 if (DECL_NAME (field_array
[bot
]) == component
)
1395 field
= field_array
[bot
];
1396 else if (DECL_NAME (field
) != component
)
1401 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1403 if (DECL_NAME (field
) == NULL_TREE
1404 && (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
1405 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
))
1407 tree anon
= lookup_field (field
, component
);
1410 return tree_cons (NULL_TREE
, field
, anon
);
1413 if (DECL_NAME (field
) == component
)
1417 if (field
== NULL_TREE
)
1421 return tree_cons (NULL_TREE
, field
, NULL_TREE
);
1424 /* Make an expression to refer to the COMPONENT field of
1425 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1428 build_component_ref (tree datum
, tree component
)
1430 tree type
= TREE_TYPE (datum
);
1431 enum tree_code code
= TREE_CODE (type
);
1435 if (!objc_is_public (datum
, component
))
1436 return error_mark_node
;
1438 /* If DATUM is a COMPOUND_EXPR, move our reference inside it.
1439 Ensure that the arguments are not lvalues; otherwise,
1440 if the component is an array, it would wrongly decay to a pointer in
1442 We cannot do this with a COND_EXPR, because in a conditional expression
1443 the default promotions are applied to both sides, and this would yield
1444 the wrong type of the result; for example, if the components have
1446 switch (TREE_CODE (datum
))
1450 tree value
= build_component_ref (TREE_OPERAND (datum
, 1), component
);
1451 return build (COMPOUND_EXPR
, TREE_TYPE (value
),
1452 TREE_OPERAND (datum
, 0), non_lvalue (value
));
1458 /* See if there is a field or component with name COMPONENT. */
1460 if (code
== RECORD_TYPE
|| code
== UNION_TYPE
)
1462 if (!COMPLETE_TYPE_P (type
))
1464 c_incomplete_type_error (NULL_TREE
, type
);
1465 return error_mark_node
;
1468 field
= lookup_field (datum
, component
);
1472 error ("%s has no member named `%s'",
1473 code
== RECORD_TYPE
? "structure" : "union",
1474 IDENTIFIER_POINTER (component
));
1475 return error_mark_node
;
1478 /* Chain the COMPONENT_REFs if necessary down to the FIELD.
1479 This might be better solved in future the way the C++ front
1480 end does it - by giving the anonymous entities each a
1481 separate name and type, and then have build_component_ref
1482 recursively call itself. We can't do that here. */
1485 tree subdatum
= TREE_VALUE (field
);
1487 if (TREE_TYPE (subdatum
) == error_mark_node
)
1488 return error_mark_node
;
1490 ref
= build (COMPONENT_REF
, TREE_TYPE (subdatum
), datum
, subdatum
);
1491 if (TREE_READONLY (datum
) || TREE_READONLY (subdatum
))
1492 TREE_READONLY (ref
) = 1;
1493 if (TREE_THIS_VOLATILE (datum
) || TREE_THIS_VOLATILE (subdatum
))
1494 TREE_THIS_VOLATILE (ref
) = 1;
1496 if (TREE_DEPRECATED (subdatum
))
1497 warn_deprecated_use (subdatum
);
1501 field
= TREE_CHAIN (field
);
1507 else if (code
!= ERROR_MARK
)
1508 error ("request for member `%s' in something not a structure or union",
1509 IDENTIFIER_POINTER (component
));
1511 return error_mark_node
;
1514 /* Given an expression PTR for a pointer, return an expression
1515 for the value pointed to.
1516 ERRORSTRING is the name of the operator to appear in error messages. */
1519 build_indirect_ref (tree ptr
, const char *errorstring
)
1521 tree pointer
= default_conversion (ptr
);
1522 tree type
= TREE_TYPE (pointer
);
1524 if (TREE_CODE (type
) == POINTER_TYPE
)
1526 if (TREE_CODE (pointer
) == ADDR_EXPR
1527 && (TREE_TYPE (TREE_OPERAND (pointer
, 0))
1528 == TREE_TYPE (type
)))
1529 return TREE_OPERAND (pointer
, 0);
1532 tree t
= TREE_TYPE (type
);
1533 tree ref
= build1 (INDIRECT_REF
, TYPE_MAIN_VARIANT (t
), pointer
);
1535 if (!COMPLETE_OR_VOID_TYPE_P (t
) && TREE_CODE (t
) != ARRAY_TYPE
)
1537 error ("dereferencing pointer to incomplete type");
1538 return error_mark_node
;
1540 if (VOID_TYPE_P (t
) && skip_evaluation
== 0)
1541 warning ("dereferencing `void *' pointer");
1543 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1544 so that we get the proper error message if the result is used
1545 to assign to. Also, &* is supposed to be a no-op.
1546 And ANSI C seems to specify that the type of the result
1547 should be the const type. */
1548 /* A de-reference of a pointer to const is not a const. It is valid
1549 to change it via some other pointer. */
1550 TREE_READONLY (ref
) = TYPE_READONLY (t
);
1551 TREE_SIDE_EFFECTS (ref
)
1552 = TYPE_VOLATILE (t
) || TREE_SIDE_EFFECTS (pointer
);
1553 TREE_THIS_VOLATILE (ref
) = TYPE_VOLATILE (t
);
1557 else if (TREE_CODE (pointer
) != ERROR_MARK
)
1558 error ("invalid type argument of `%s'", errorstring
);
1559 return error_mark_node
;
1562 /* This handles expressions of the form "a[i]", which denotes
1565 This is logically equivalent in C to *(a+i), but we may do it differently.
1566 If A is a variable or a member, we generate a primitive ARRAY_REF.
1567 This avoids forcing the array out of registers, and can work on
1568 arrays that are not lvalues (for example, members of structures returned
1572 build_array_ref (tree array
, tree index
)
1576 error ("subscript missing in array reference");
1577 return error_mark_node
;
1580 if (TREE_TYPE (array
) == error_mark_node
1581 || TREE_TYPE (index
) == error_mark_node
)
1582 return error_mark_node
;
1584 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
)
1588 /* Subscripting with type char is likely to lose
1589 on a machine where chars are signed.
1590 So warn on any machine, but optionally.
1591 Don't warn for unsigned char since that type is safe.
1592 Don't warn for signed char because anyone who uses that
1593 must have done so deliberately. */
1594 if (warn_char_subscripts
1595 && TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
)
1596 warning ("array subscript has type `char'");
1598 /* Apply default promotions *after* noticing character types. */
1599 index
= default_conversion (index
);
1601 /* Require integer *after* promotion, for sake of enums. */
1602 if (TREE_CODE (TREE_TYPE (index
)) != INTEGER_TYPE
)
1604 error ("array subscript is not an integer");
1605 return error_mark_node
;
1608 /* An array that is indexed by a non-constant
1609 cannot be stored in a register; we must be able to do
1610 address arithmetic on its address.
1611 Likewise an array of elements of variable size. */
1612 if (TREE_CODE (index
) != INTEGER_CST
1613 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
1614 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
)))) != INTEGER_CST
))
1616 if (!c_mark_addressable (array
))
1617 return error_mark_node
;
1619 /* An array that is indexed by a constant value which is not within
1620 the array bounds cannot be stored in a register either; because we
1621 would get a crash in store_bit_field/extract_bit_field when trying
1622 to access a non-existent part of the register. */
1623 if (TREE_CODE (index
) == INTEGER_CST
1624 && TYPE_DOMAIN (TREE_TYPE (array
))
1625 && ! int_fits_type_p (index
, TYPE_DOMAIN (TREE_TYPE (array
))))
1627 if (!c_mark_addressable (array
))
1628 return error_mark_node
;
1634 while (TREE_CODE (foo
) == COMPONENT_REF
)
1635 foo
= TREE_OPERAND (foo
, 0);
1636 if (TREE_CODE (foo
) == VAR_DECL
&& C_DECL_REGISTER (foo
))
1637 pedwarn ("ISO C forbids subscripting `register' array");
1638 else if (! flag_isoc99
&& ! lvalue_p (foo
))
1639 pedwarn ("ISO C90 forbids subscripting non-lvalue array");
1642 type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array
)));
1643 rval
= build (ARRAY_REF
, type
, array
, index
);
1644 /* Array ref is const/volatile if the array elements are
1645 or if the array is. */
1646 TREE_READONLY (rval
)
1647 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array
)))
1648 | TREE_READONLY (array
));
1649 TREE_SIDE_EFFECTS (rval
)
1650 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
1651 | TREE_SIDE_EFFECTS (array
));
1652 TREE_THIS_VOLATILE (rval
)
1653 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
1654 /* This was added by rms on 16 Nov 91.
1655 It fixes vol struct foo *a; a->elts[1]
1656 in an inline function.
1657 Hope it doesn't break something else. */
1658 | TREE_THIS_VOLATILE (array
));
1659 return require_complete_type (fold (rval
));
1663 tree ar
= default_conversion (array
);
1664 tree ind
= default_conversion (index
);
1666 /* Do the same warning check as above, but only on the part that's
1667 syntactically the index and only if it is also semantically
1669 if (warn_char_subscripts
1670 && TREE_CODE (TREE_TYPE (index
)) == INTEGER_TYPE
1671 && TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
)
1672 warning ("subscript has type `char'");
1674 /* Put the integer in IND to simplify error checking. */
1675 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
1682 if (ar
== error_mark_node
)
1685 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
1686 || TREE_CODE (TREE_TYPE (TREE_TYPE (ar
))) == FUNCTION_TYPE
)
1688 error ("subscripted value is neither array nor pointer");
1689 return error_mark_node
;
1691 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
1693 error ("array subscript is not an integer");
1694 return error_mark_node
;
1697 return build_indirect_ref (build_binary_op (PLUS_EXPR
, ar
, ind
, 0),
1702 /* Build an external reference to identifier ID. FUN indicates
1703 whether this will be used for a function call. */
1705 build_external_ref (tree id
, int fun
)
1708 tree decl
= lookup_name (id
);
1709 tree objc_ivar
= lookup_objc_ivar (id
);
1711 if (decl
&& decl
!= error_mark_node
)
1713 /* Properly declared variable or function reference. */
1716 else if (decl
!= objc_ivar
&& !DECL_FILE_SCOPE_P (decl
))
1718 warning ("local declaration of `%s' hides instance variable",
1719 IDENTIFIER_POINTER (id
));
1728 /* Implicit function declaration. */
1729 ref
= implicitly_declare (id
);
1730 else if (decl
== error_mark_node
)
1731 /* Don't complain about something that's already been
1732 complained about. */
1733 return error_mark_node
;
1736 undeclared_variable (id
);
1737 return error_mark_node
;
1740 if (TREE_TYPE (ref
) == error_mark_node
)
1741 return error_mark_node
;
1743 if (TREE_DEPRECATED (ref
))
1744 warn_deprecated_use (ref
);
1746 if (!skip_evaluation
)
1747 assemble_external (ref
);
1748 TREE_USED (ref
) = 1;
1750 if (TREE_CODE (ref
) == CONST_DECL
)
1752 ref
= DECL_INITIAL (ref
);
1753 TREE_CONSTANT (ref
) = 1;
1754 TREE_INVARIANT (ref
) = 1;
1756 else if (current_function_decl
!= 0
1757 && !DECL_FILE_SCOPE_P (current_function_decl
)
1758 && (TREE_CODE (ref
) == VAR_DECL
1759 || TREE_CODE (ref
) == PARM_DECL
1760 || TREE_CODE (ref
) == FUNCTION_DECL
))
1762 tree context
= decl_function_context (ref
);
1764 if (context
!= 0 && context
!= current_function_decl
)
1765 DECL_NONLOCAL (ref
) = 1;
1771 /* Build a function call to function FUNCTION with parameters PARAMS.
1772 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1773 TREE_VALUE of each node is a parameter-expression.
1774 FUNCTION's data type may be a function type or a pointer-to-function. */
1777 build_function_call (tree function
, tree params
)
1779 tree fntype
, fundecl
= 0;
1780 tree coerced_params
;
1781 tree name
= NULL_TREE
, result
;
1784 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1785 STRIP_TYPE_NOPS (function
);
1787 /* Convert anything with function type to a pointer-to-function. */
1788 if (TREE_CODE (function
) == FUNCTION_DECL
)
1790 name
= DECL_NAME (function
);
1792 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1793 (because calling an inline function does not mean the function
1794 needs to be separately compiled). */
1795 fntype
= build_type_variant (TREE_TYPE (function
),
1796 TREE_READONLY (function
),
1797 TREE_THIS_VOLATILE (function
));
1799 function
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), function
);
1802 function
= default_conversion (function
);
1804 fntype
= TREE_TYPE (function
);
1806 if (TREE_CODE (fntype
) == ERROR_MARK
)
1807 return error_mark_node
;
1809 if (!(TREE_CODE (fntype
) == POINTER_TYPE
1810 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
))
1812 error ("called object is not a function");
1813 return error_mark_node
;
1816 if (fundecl
&& TREE_THIS_VOLATILE (fundecl
))
1817 current_function_returns_abnormally
= 1;
1819 /* fntype now gets the type of function pointed to. */
1820 fntype
= TREE_TYPE (fntype
);
1822 /* Check that the function is called through a compatible prototype.
1823 If it is not, replace the call by a trap, wrapped up in a compound
1824 expression if necessary. This has the nice side-effect to prevent
1825 the tree-inliner from generating invalid assignment trees which may
1826 blow up in the RTL expander later.
1828 ??? This doesn't work for Objective-C because objc_comptypes
1829 refuses to compare function prototypes, yet the compiler appears
1830 to build calls that are flagged as invalid by C's comptypes. */
1831 if (! c_dialect_objc ()
1832 && TREE_CODE (function
) == NOP_EXPR
1833 && TREE_CODE (tem
= TREE_OPERAND (function
, 0)) == ADDR_EXPR
1834 && TREE_CODE (tem
= TREE_OPERAND (tem
, 0)) == FUNCTION_DECL
1835 && ! comptypes (fntype
, TREE_TYPE (tem
)))
1837 tree return_type
= TREE_TYPE (fntype
);
1838 tree trap
= build_function_call (built_in_decls
[BUILT_IN_TRAP
],
1841 /* This situation leads to run-time undefined behavior. We can't,
1842 therefore, simply error unless we can prove that all possible
1843 executions of the program must execute the code. */
1844 warning ("function called through a non-compatible type");
1846 /* We can, however, treat "undefined" any way we please.
1847 Call abort to encourage the user to fix the program. */
1848 inform ("if this code is reached, the program will abort");
1850 if (VOID_TYPE_P (return_type
))
1856 if (AGGREGATE_TYPE_P (return_type
))
1857 rhs
= build_compound_literal (return_type
,
1858 build_constructor (return_type
,
1861 rhs
= fold (build1 (NOP_EXPR
, return_type
, integer_zero_node
));
1863 return build (COMPOUND_EXPR
, return_type
, trap
, rhs
);
1867 /* Convert the parameters to the types declared in the
1868 function prototype, or apply default promotions. */
1871 = convert_arguments (TYPE_ARG_TYPES (fntype
), params
, name
, fundecl
);
1873 /* Check that the arguments to the function are valid. */
1875 check_function_arguments (TYPE_ATTRIBUTES (fntype
), coerced_params
);
1877 /* Recognize certain built-in functions so we can make tree-codes
1878 other than CALL_EXPR. We do this when it enables fold-const.c
1879 to do something useful. */
1881 if (TREE_CODE (function
) == ADDR_EXPR
1882 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
1883 && DECL_BUILT_IN (TREE_OPERAND (function
, 0)))
1885 result
= expand_tree_builtin (TREE_OPERAND (function
, 0),
1886 params
, coerced_params
);
1891 result
= build (CALL_EXPR
, TREE_TYPE (fntype
),
1892 function
, coerced_params
, NULL_TREE
);
1893 TREE_SIDE_EFFECTS (result
) = 1;
1895 if (require_constant_value
)
1897 result
= fold_initializer (result
);
1899 if (TREE_CONSTANT (result
)
1900 && (name
== NULL_TREE
1901 || strncmp (IDENTIFIER_POINTER (name
), "__builtin_", 10) != 0))
1902 pedwarn_init ("initializer element is not constant");
1905 result
= fold (result
);
1907 if (VOID_TYPE_P (TREE_TYPE (result
)))
1909 return require_complete_type (result
);
1912 /* Convert the argument expressions in the list VALUES
1913 to the types in the list TYPELIST. The result is a list of converted
1914 argument expressions.
1916 If TYPELIST is exhausted, or when an element has NULL as its type,
1917 perform the default conversions.
1919 PARMLIST is the chain of parm decls for the function being called.
1920 It may be 0, if that info is not available.
1921 It is used only for generating error messages.
1923 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1925 This is also where warnings about wrong number of args are generated.
1927 Both VALUES and the returned value are chains of TREE_LIST nodes
1928 with the elements of the list in the TREE_VALUE slots of those nodes. */
1931 convert_arguments (tree typelist
, tree values
, tree name
, tree fundecl
)
1933 tree typetail
, valtail
;
1937 /* Scan the given expressions and types, producing individual
1938 converted arguments and pushing them on RESULT in reverse order. */
1940 for (valtail
= values
, typetail
= typelist
, parmnum
= 0;
1942 valtail
= TREE_CHAIN (valtail
), parmnum
++)
1944 tree type
= typetail
? TREE_VALUE (typetail
) : 0;
1945 tree val
= TREE_VALUE (valtail
);
1947 if (type
== void_type_node
)
1950 error ("too many arguments to function `%s'",
1951 IDENTIFIER_POINTER (name
));
1953 error ("too many arguments to function");
1957 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1958 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1959 to convert automatically to a pointer. */
1960 if (TREE_CODE (val
) == NON_LVALUE_EXPR
)
1961 val
= TREE_OPERAND (val
, 0);
1963 val
= default_function_array_conversion (val
);
1965 val
= require_complete_type (val
);
1969 /* Formal parm type is specified by a function prototype. */
1972 if (!COMPLETE_TYPE_P (type
))
1974 error ("type of formal parameter %d is incomplete", parmnum
+ 1);
1979 /* Optionally warn about conversions that
1980 differ from the default conversions. */
1981 if (warn_conversion
|| warn_traditional
)
1983 int formal_prec
= TYPE_PRECISION (type
);
1985 if (INTEGRAL_TYPE_P (type
)
1986 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
1987 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name
, parmnum
+ 1);
1988 if (INTEGRAL_TYPE_P (type
)
1989 && TREE_CODE (TREE_TYPE (val
)) == COMPLEX_TYPE
)
1990 warn_for_assignment ("%s as integer rather than complex due to prototype", (char *) 0, name
, parmnum
+ 1);
1991 else if (TREE_CODE (type
) == COMPLEX_TYPE
1992 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
1993 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name
, parmnum
+ 1);
1994 else if (TREE_CODE (type
) == REAL_TYPE
1995 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
1996 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name
, parmnum
+ 1);
1997 else if (TREE_CODE (type
) == COMPLEX_TYPE
1998 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
1999 warn_for_assignment ("%s as complex rather than integer due to prototype", (char *) 0, name
, parmnum
+ 1);
2000 else if (TREE_CODE (type
) == REAL_TYPE
2001 && TREE_CODE (TREE_TYPE (val
)) == COMPLEX_TYPE
)
2002 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name
, parmnum
+ 1);
2003 /* ??? At some point, messages should be written about
2004 conversions between complex types, but that's too messy
2006 else if (TREE_CODE (type
) == REAL_TYPE
2007 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
2009 /* Warn if any argument is passed as `float',
2010 since without a prototype it would be `double'. */
2011 if (formal_prec
== TYPE_PRECISION (float_type_node
))
2012 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name
, parmnum
+ 1);
2014 /* Detect integer changing in width or signedness.
2015 These warnings are only activated with
2016 -Wconversion, not with -Wtraditional. */
2017 else if (warn_conversion
&& INTEGRAL_TYPE_P (type
)
2018 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
2020 tree would_have_been
= default_conversion (val
);
2021 tree type1
= TREE_TYPE (would_have_been
);
2023 if (TREE_CODE (type
) == ENUMERAL_TYPE
2024 && (TYPE_MAIN_VARIANT (type
)
2025 == TYPE_MAIN_VARIANT (TREE_TYPE (val
))))
2026 /* No warning if function asks for enum
2027 and the actual arg is that enum type. */
2029 else if (formal_prec
!= TYPE_PRECISION (type1
))
2030 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name
, parmnum
+ 1);
2031 else if (TYPE_UNSIGNED (type
) == TYPE_UNSIGNED (type1
))
2033 /* Don't complain if the formal parameter type
2034 is an enum, because we can't tell now whether
2035 the value was an enum--even the same enum. */
2036 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
2038 else if (TREE_CODE (val
) == INTEGER_CST
2039 && int_fits_type_p (val
, type
))
2040 /* Change in signedness doesn't matter
2041 if a constant value is unaffected. */
2043 /* Likewise for a constant in a NOP_EXPR. */
2044 else if (TREE_CODE (val
) == NOP_EXPR
2045 && TREE_CODE (TREE_OPERAND (val
, 0)) == INTEGER_CST
2046 && int_fits_type_p (TREE_OPERAND (val
, 0), type
))
2048 /* If the value is extended from a narrower
2049 unsigned type, it doesn't matter whether we
2050 pass it as signed or unsigned; the value
2051 certainly is the same either way. */
2052 else if (TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
)
2053 && TYPE_UNSIGNED (TREE_TYPE (val
)))
2055 else if (TYPE_UNSIGNED (type
))
2056 warn_for_assignment ("%s as unsigned due to prototype", (char *) 0, name
, parmnum
+ 1);
2058 warn_for_assignment ("%s as signed due to prototype", (char *) 0, name
, parmnum
+ 1);
2062 parmval
= convert_for_assignment (type
, val
,
2063 (char *) 0, /* arg passing */
2064 fundecl
, name
, parmnum
+ 1);
2066 if (targetm
.calls
.promote_prototypes (fundecl
? TREE_TYPE (fundecl
) : 0)
2067 && INTEGRAL_TYPE_P (type
)
2068 && (TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)))
2069 parmval
= default_conversion (parmval
);
2071 result
= tree_cons (NULL_TREE
, parmval
, result
);
2073 else if (TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
2074 && (TYPE_PRECISION (TREE_TYPE (val
))
2075 < TYPE_PRECISION (double_type_node
)))
2076 /* Convert `float' to `double'. */
2077 result
= tree_cons (NULL_TREE
, convert (double_type_node
, val
), result
);
2079 /* Convert `short' and `char' to full-size `int'. */
2080 result
= tree_cons (NULL_TREE
, default_conversion (val
), result
);
2083 typetail
= TREE_CHAIN (typetail
);
2086 if (typetail
!= 0 && TREE_VALUE (typetail
) != void_type_node
)
2089 error ("too few arguments to function `%s'",
2090 IDENTIFIER_POINTER (name
));
2092 error ("too few arguments to function");
2095 return nreverse (result
);
2098 /* This is the entry point used by the parser
2099 for binary operators in the input.
2100 In addition to constructing the expression,
2101 we check for operands that were written with other binary operators
2102 in a way that is likely to confuse the user. */
2105 parser_build_binary_op (enum tree_code code
, tree arg1
, tree arg2
)
2107 tree result
= build_binary_op (code
, arg1
, arg2
, 1);
2110 char class1
= TREE_CODE_CLASS (TREE_CODE (arg1
));
2111 char class2
= TREE_CODE_CLASS (TREE_CODE (arg2
));
2112 enum tree_code code1
= ERROR_MARK
;
2113 enum tree_code code2
= ERROR_MARK
;
2115 if (TREE_CODE (result
) == ERROR_MARK
)
2116 return error_mark_node
;
2118 if (IS_EXPR_CODE_CLASS (class1
))
2119 code1
= C_EXP_ORIGINAL_CODE (arg1
);
2120 if (IS_EXPR_CODE_CLASS (class2
))
2121 code2
= C_EXP_ORIGINAL_CODE (arg2
);
2123 /* Check for cases such as x+y<<z which users are likely
2124 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
2125 is cleared to prevent these warnings. */
2126 if (warn_parentheses
)
2128 if (code
== LSHIFT_EXPR
|| code
== RSHIFT_EXPR
)
2130 if (code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
2131 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
2132 warning ("suggest parentheses around + or - inside shift");
2135 if (code
== TRUTH_ORIF_EXPR
)
2137 if (code1
== TRUTH_ANDIF_EXPR
2138 || code2
== TRUTH_ANDIF_EXPR
)
2139 warning ("suggest parentheses around && within ||");
2142 if (code
== BIT_IOR_EXPR
)
2144 if (code1
== BIT_AND_EXPR
|| code1
== BIT_XOR_EXPR
2145 || code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
2146 || code2
== BIT_AND_EXPR
|| code2
== BIT_XOR_EXPR
2147 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
2148 warning ("suggest parentheses around arithmetic in operand of |");
2149 /* Check cases like x|y==z */
2150 if (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<')
2151 warning ("suggest parentheses around comparison in operand of |");
2154 if (code
== BIT_XOR_EXPR
)
2156 if (code1
== BIT_AND_EXPR
2157 || code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
2158 || code2
== BIT_AND_EXPR
2159 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
2160 warning ("suggest parentheses around arithmetic in operand of ^");
2161 /* Check cases like x^y==z */
2162 if (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<')
2163 warning ("suggest parentheses around comparison in operand of ^");
2166 if (code
== BIT_AND_EXPR
)
2168 if (code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
2169 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
2170 warning ("suggest parentheses around + or - in operand of &");
2171 /* Check cases like x&y==z */
2172 if (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<')
2173 warning ("suggest parentheses around comparison in operand of &");
2177 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
2178 if (TREE_CODE_CLASS (code
) == '<' && extra_warnings
2179 && (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<'))
2180 warning ("comparisons like X<=Y<=Z do not have their mathematical meaning");
2182 unsigned_conversion_warning (result
, arg1
);
2183 unsigned_conversion_warning (result
, arg2
);
2184 overflow_warning (result
);
2186 class = TREE_CODE_CLASS (TREE_CODE (result
));
2188 /* Record the code that was specified in the source,
2189 for the sake of warnings about confusing nesting. */
2190 if (IS_EXPR_CODE_CLASS (class))
2191 C_SET_EXP_ORIGINAL_CODE (result
, code
);
2194 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
2195 so that convert_for_assignment wouldn't strip it.
2196 That way, we got warnings for things like p = (1 - 1).
2197 But it turns out we should not get those warnings. */
2198 result
= build1 (NON_LVALUE_EXPR
, TREE_TYPE (result
), result
);
2199 C_SET_EXP_ORIGINAL_CODE (result
, code
);
2205 /* Return a tree for the difference of pointers OP0 and OP1.
2206 The resulting tree has type int. */
2209 pointer_diff (tree op0
, tree op1
)
2211 tree restype
= ptrdiff_type_node
;
2213 tree target_type
= TREE_TYPE (TREE_TYPE (op0
));
2214 tree con0
, con1
, lit0
, lit1
;
2215 tree orig_op1
= op1
;
2217 if (pedantic
|| warn_pointer_arith
)
2219 if (TREE_CODE (target_type
) == VOID_TYPE
)
2220 pedwarn ("pointer of type `void *' used in subtraction");
2221 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
2222 pedwarn ("pointer to a function used in subtraction");
2225 /* If the conversion to ptrdiff_type does anything like widening or
2226 converting a partial to an integral mode, we get a convert_expression
2227 that is in the way to do any simplifications.
2228 (fold-const.c doesn't know that the extra bits won't be needed.
2229 split_tree uses STRIP_SIGN_NOPS, which leaves conversions to a
2230 different mode in place.)
2231 So first try to find a common term here 'by hand'; we want to cover
2232 at least the cases that occur in legal static initializers. */
2233 con0
= TREE_CODE (op0
) == NOP_EXPR
? TREE_OPERAND (op0
, 0) : op0
;
2234 con1
= TREE_CODE (op1
) == NOP_EXPR
? TREE_OPERAND (op1
, 0) : op1
;
2236 if (TREE_CODE (con0
) == PLUS_EXPR
)
2238 lit0
= TREE_OPERAND (con0
, 1);
2239 con0
= TREE_OPERAND (con0
, 0);
2242 lit0
= integer_zero_node
;
2244 if (TREE_CODE (con1
) == PLUS_EXPR
)
2246 lit1
= TREE_OPERAND (con1
, 1);
2247 con1
= TREE_OPERAND (con1
, 0);
2250 lit1
= integer_zero_node
;
2252 if (operand_equal_p (con0
, con1
, 0))
2259 /* First do the subtraction as integers;
2260 then drop through to build the divide operator.
2261 Do not do default conversions on the minus operator
2262 in case restype is a short type. */
2264 op0
= build_binary_op (MINUS_EXPR
, convert (restype
, op0
),
2265 convert (restype
, op1
), 0);
2266 /* This generates an error if op1 is pointer to incomplete type. */
2267 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (orig_op1
))))
2268 error ("arithmetic on pointer to an incomplete type");
2270 /* This generates an error if op0 is pointer to incomplete type. */
2271 op1
= c_size_in_bytes (target_type
);
2273 /* Divide by the size, in easiest possible way. */
2274 return fold (build (EXACT_DIV_EXPR
, restype
, op0
, convert (restype
, op1
)));
2277 /* Construct and perhaps optimize a tree representation
2278 for a unary operation. CODE, a tree_code, specifies the operation
2279 and XARG is the operand.
2280 For any CODE other than ADDR_EXPR, FLAG nonzero suppresses
2281 the default promotions (such as from short to int).
2282 For ADDR_EXPR, the default promotions are not applied; FLAG nonzero
2283 allows non-lvalues; this is only used to handle conversion of non-lvalue
2284 arrays to pointers in C99. */
2287 build_unary_op (enum tree_code code
, tree xarg
, int flag
)
2289 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2292 enum tree_code typecode
= TREE_CODE (TREE_TYPE (arg
));
2294 int noconvert
= flag
;
2296 if (typecode
== ERROR_MARK
)
2297 return error_mark_node
;
2298 if (typecode
== ENUMERAL_TYPE
|| typecode
== BOOLEAN_TYPE
)
2299 typecode
= INTEGER_TYPE
;
2304 /* This is used for unary plus, because a CONVERT_EXPR
2305 is enough to prevent anybody from looking inside for
2306 associativity, but won't generate any code. */
2307 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2308 || typecode
== COMPLEX_TYPE
))
2310 error ("wrong type argument to unary plus");
2311 return error_mark_node
;
2313 else if (!noconvert
)
2314 arg
= default_conversion (arg
);
2315 arg
= non_lvalue (arg
);
2319 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2320 || typecode
== COMPLEX_TYPE
2321 || typecode
== VECTOR_TYPE
))
2323 error ("wrong type argument to unary minus");
2324 return error_mark_node
;
2326 else if (!noconvert
)
2327 arg
= default_conversion (arg
);
2331 if (typecode
== INTEGER_TYPE
|| typecode
== VECTOR_TYPE
)
2334 arg
= default_conversion (arg
);
2336 else if (typecode
== COMPLEX_TYPE
)
2340 pedwarn ("ISO C does not support `~' for complex conjugation");
2342 arg
= default_conversion (arg
);
2346 error ("wrong type argument to bit-complement");
2347 return error_mark_node
;
2352 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
))
2354 error ("wrong type argument to abs");
2355 return error_mark_node
;
2357 else if (!noconvert
)
2358 arg
= default_conversion (arg
);
2362 /* Conjugating a real value is a no-op, but allow it anyway. */
2363 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2364 || typecode
== COMPLEX_TYPE
))
2366 error ("wrong type argument to conjugation");
2367 return error_mark_node
;
2369 else if (!noconvert
)
2370 arg
= default_conversion (arg
);
2373 case TRUTH_NOT_EXPR
:
2374 if (typecode
!= INTEGER_TYPE
2375 && typecode
!= REAL_TYPE
&& typecode
!= POINTER_TYPE
2376 && typecode
!= COMPLEX_TYPE
2377 /* These will convert to a pointer. */
2378 && typecode
!= ARRAY_TYPE
&& typecode
!= FUNCTION_TYPE
)
2380 error ("wrong type argument to unary exclamation mark");
2381 return error_mark_node
;
2383 arg
= lang_hooks
.truthvalue_conversion (arg
);
2384 return invert_truthvalue (arg
);
2390 if (TREE_CODE (arg
) == COMPLEX_CST
)
2391 return TREE_REALPART (arg
);
2392 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
2393 return fold (build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
2398 if (TREE_CODE (arg
) == COMPLEX_CST
)
2399 return TREE_IMAGPART (arg
);
2400 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
2401 return fold (build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
2403 return convert (TREE_TYPE (arg
), integer_zero_node
);
2405 case PREINCREMENT_EXPR
:
2406 case POSTINCREMENT_EXPR
:
2407 case PREDECREMENT_EXPR
:
2408 case POSTDECREMENT_EXPR
:
2410 /* Increment or decrement the real part of the value,
2411 and don't change the imaginary part. */
2412 if (typecode
== COMPLEX_TYPE
)
2417 pedwarn ("ISO C does not support `++' and `--' on complex types");
2419 arg
= stabilize_reference (arg
);
2420 real
= build_unary_op (REALPART_EXPR
, arg
, 1);
2421 imag
= build_unary_op (IMAGPART_EXPR
, arg
, 1);
2422 return build (COMPLEX_EXPR
, TREE_TYPE (arg
),
2423 build_unary_op (code
, real
, 1), imag
);
2426 /* Report invalid types. */
2428 if (typecode
!= POINTER_TYPE
2429 && typecode
!= INTEGER_TYPE
&& typecode
!= REAL_TYPE
)
2431 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2432 error ("wrong type argument to increment");
2434 error ("wrong type argument to decrement");
2436 return error_mark_node
;
2441 tree result_type
= TREE_TYPE (arg
);
2443 arg
= get_unwidened (arg
, 0);
2444 argtype
= TREE_TYPE (arg
);
2446 /* Compute the increment. */
2448 if (typecode
== POINTER_TYPE
)
2450 /* If pointer target is an undefined struct,
2451 we just cannot know how to do the arithmetic. */
2452 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type
)))
2454 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2455 error ("increment of pointer to unknown structure");
2457 error ("decrement of pointer to unknown structure");
2459 else if ((pedantic
|| warn_pointer_arith
)
2460 && (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
2461 || TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
))
2463 if (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
2464 pedwarn ("wrong type argument to increment");
2466 pedwarn ("wrong type argument to decrement");
2469 inc
= c_size_in_bytes (TREE_TYPE (result_type
));
2472 inc
= integer_one_node
;
2474 inc
= convert (argtype
, inc
);
2476 /* Complain about anything else that is not a true lvalue. */
2477 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
2478 || code
== POSTINCREMENT_EXPR
)
2479 ? "invalid lvalue in increment"
2480 : "invalid lvalue in decrement")))
2481 return error_mark_node
;
2483 /* Report a read-only lvalue. */
2484 if (TREE_READONLY (arg
))
2485 readonly_error (arg
,
2486 ((code
== PREINCREMENT_EXPR
2487 || code
== POSTINCREMENT_EXPR
)
2488 ? "increment" : "decrement"));
2490 if (TREE_CODE (TREE_TYPE (arg
)) == BOOLEAN_TYPE
)
2491 val
= boolean_increment (code
, arg
);
2493 val
= build (code
, TREE_TYPE (arg
), arg
, inc
);
2494 TREE_SIDE_EFFECTS (val
) = 1;
2495 val
= convert (result_type
, val
);
2496 if (TREE_CODE (val
) != code
)
2497 TREE_NO_WARNING (val
) = 1;
2502 /* Note that this operation never does default_conversion. */
2504 /* Let &* cancel out to simplify resulting code. */
2505 if (TREE_CODE (arg
) == INDIRECT_REF
)
2507 /* Don't let this be an lvalue. */
2508 if (lvalue_p (TREE_OPERAND (arg
, 0)))
2509 return non_lvalue (TREE_OPERAND (arg
, 0));
2510 return TREE_OPERAND (arg
, 0);
2513 /* For &x[y], return x+y */
2514 if (TREE_CODE (arg
) == ARRAY_REF
)
2516 if (!c_mark_addressable (TREE_OPERAND (arg
, 0)))
2517 return error_mark_node
;
2518 return build_binary_op (PLUS_EXPR
, TREE_OPERAND (arg
, 0),
2519 TREE_OPERAND (arg
, 1), 1);
2522 /* Anything not already handled and not a true memory reference
2523 or a non-lvalue array is an error. */
2524 else if (typecode
!= FUNCTION_TYPE
&& !flag
2525 && !lvalue_or_else (arg
, "invalid lvalue in unary `&'"))
2526 return error_mark_node
;
2528 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
2529 argtype
= TREE_TYPE (arg
);
2531 /* If the lvalue is const or volatile, merge that into the type
2532 to which the address will point. Note that you can't get a
2533 restricted pointer by taking the address of something, so we
2534 only have to deal with `const' and `volatile' here. */
2535 if ((DECL_P (arg
) || TREE_CODE_CLASS (TREE_CODE (arg
)) == 'r')
2536 && (TREE_READONLY (arg
) || TREE_THIS_VOLATILE (arg
)))
2537 argtype
= c_build_type_variant (argtype
,
2538 TREE_READONLY (arg
),
2539 TREE_THIS_VOLATILE (arg
));
2541 argtype
= build_pointer_type (argtype
);
2543 if (!c_mark_addressable (arg
))
2544 return error_mark_node
;
2549 if (TREE_CODE (arg
) == COMPONENT_REF
)
2551 tree field
= TREE_OPERAND (arg
, 1);
2553 addr
= build_unary_op (ADDR_EXPR
, TREE_OPERAND (arg
, 0), flag
);
2555 if (DECL_C_BIT_FIELD (field
))
2557 error ("attempt to take address of bit-field structure member `%s'",
2558 IDENTIFIER_POINTER (DECL_NAME (field
)));
2559 return error_mark_node
;
2562 addr
= fold (build (PLUS_EXPR
, argtype
,
2563 convert (argtype
, addr
),
2564 convert (argtype
, byte_position (field
))));
2567 addr
= build1 (code
, argtype
, arg
);
2577 argtype
= TREE_TYPE (arg
);
2578 val
= build1 (code
, argtype
, arg
);
2579 return require_constant_value
? fold_initializer (val
) : fold (val
);
2582 /* Return nonzero if REF is an lvalue valid for this language.
2583 Lvalues can be assigned, unless their type has TYPE_READONLY.
2584 Lvalues can have their address taken, unless they have C_DECL_REGISTER. */
2589 enum tree_code code
= TREE_CODE (ref
);
2596 return lvalue_p (TREE_OPERAND (ref
, 0));
2598 case COMPOUND_LITERAL_EXPR
:
2608 return (TREE_CODE (TREE_TYPE (ref
)) != FUNCTION_TYPE
2609 && TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
);
2613 return TREE_CODE (TREE_TYPE (ref
)) == ARRAY_TYPE
;
2620 /* Return nonzero if REF is an lvalue valid for this language;
2621 otherwise, print an error message and return zero. */
2624 lvalue_or_else (tree ref
, const char *msgid
)
2626 int win
= lvalue_p (ref
);
2629 error ("%s", msgid
);
2635 /* Warn about storing in something that is `const'. */
2638 readonly_error (tree arg
, const char *msgid
)
2640 if (TREE_CODE (arg
) == COMPONENT_REF
)
2642 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg
, 0))))
2643 readonly_error (TREE_OPERAND (arg
, 0), msgid
);
2645 error ("%s of read-only member `%s'", _(msgid
),
2646 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (arg
, 1))));
2648 else if (TREE_CODE (arg
) == VAR_DECL
)
2649 error ("%s of read-only variable `%s'", _(msgid
),
2650 IDENTIFIER_POINTER (DECL_NAME (arg
)));
2652 error ("%s of read-only location", _(msgid
));
2655 /* Mark EXP saying that we need to be able to take the
2656 address of it; it should not be allocated in a register.
2657 Returns true if successful. */
2660 c_mark_addressable (tree exp
)
2665 switch (TREE_CODE (x
))
2668 if (DECL_C_BIT_FIELD (TREE_OPERAND (x
, 1)))
2670 error ("cannot take address of bit-field `%s'",
2671 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (x
, 1))));
2675 /* ... fall through ... */
2681 x
= TREE_OPERAND (x
, 0);
2684 case COMPOUND_LITERAL_EXPR
:
2686 TREE_ADDRESSABLE (x
) = 1;
2693 if (C_DECL_REGISTER (x
)
2694 && DECL_NONLOCAL (x
))
2696 if (TREE_PUBLIC (x
) || TREE_STATIC (x
) || DECL_EXTERNAL (x
))
2698 error ("global register variable `%s' used in nested function",
2699 IDENTIFIER_POINTER (DECL_NAME (x
)));
2702 pedwarn ("register variable `%s' used in nested function",
2703 IDENTIFIER_POINTER (DECL_NAME (x
)));
2705 else if (C_DECL_REGISTER (x
))
2707 if (TREE_PUBLIC (x
) || TREE_STATIC (x
) || DECL_EXTERNAL (x
))
2709 error ("address of global register variable `%s' requested",
2710 IDENTIFIER_POINTER (DECL_NAME (x
)));
2714 pedwarn ("address of register variable `%s' requested",
2715 IDENTIFIER_POINTER (DECL_NAME (x
)));
2717 put_var_into_stack (x
, /*rescan=*/true);
2721 TREE_ADDRESSABLE (x
) = 1;
2728 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
2731 build_conditional_expr (tree ifexp
, tree op1
, tree op2
)
2735 enum tree_code code1
;
2736 enum tree_code code2
;
2737 tree result_type
= NULL
;
2738 tree orig_op1
= op1
, orig_op2
= op2
;
2740 ifexp
= lang_hooks
.truthvalue_conversion (default_conversion (ifexp
));
2742 /* Promote both alternatives. */
2744 if (TREE_CODE (TREE_TYPE (op1
)) != VOID_TYPE
)
2745 op1
= default_conversion (op1
);
2746 if (TREE_CODE (TREE_TYPE (op2
)) != VOID_TYPE
)
2747 op2
= default_conversion (op2
);
2749 if (TREE_CODE (ifexp
) == ERROR_MARK
2750 || TREE_CODE (TREE_TYPE (op1
)) == ERROR_MARK
2751 || TREE_CODE (TREE_TYPE (op2
)) == ERROR_MARK
)
2752 return error_mark_node
;
2754 type1
= TREE_TYPE (op1
);
2755 code1
= TREE_CODE (type1
);
2756 type2
= TREE_TYPE (op2
);
2757 code2
= TREE_CODE (type2
);
2759 /* C90 does not permit non-lvalue arrays in conditional expressions.
2760 In C99 they will be pointers by now. */
2761 if (code1
== ARRAY_TYPE
|| code2
== ARRAY_TYPE
)
2763 error ("non-lvalue array in conditional expression");
2764 return error_mark_node
;
2767 /* Quickly detect the usual case where op1 and op2 have the same type
2769 if (TYPE_MAIN_VARIANT (type1
) == TYPE_MAIN_VARIANT (type2
))
2772 result_type
= type1
;
2774 result_type
= TYPE_MAIN_VARIANT (type1
);
2776 else if ((code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
2777 || code1
== COMPLEX_TYPE
)
2778 && (code2
== INTEGER_TYPE
|| code2
== REAL_TYPE
2779 || code2
== COMPLEX_TYPE
))
2781 result_type
= common_type (type1
, type2
);
2783 /* If -Wsign-compare, warn here if type1 and type2 have
2784 different signedness. We'll promote the signed to unsigned
2785 and later code won't know it used to be different.
2786 Do this check on the original types, so that explicit casts
2787 will be considered, but default promotions won't. */
2788 if (warn_sign_compare
&& !skip_evaluation
)
2790 int unsigned_op1
= TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
2791 int unsigned_op2
= TYPE_UNSIGNED (TREE_TYPE (orig_op2
));
2793 if (unsigned_op1
^ unsigned_op2
)
2795 /* Do not warn if the result type is signed, since the
2796 signed type will only be chosen if it can represent
2797 all the values of the unsigned type. */
2798 if (! TYPE_UNSIGNED (result_type
))
2800 /* Do not warn if the signed quantity is an unsuffixed
2801 integer literal (or some static constant expression
2802 involving such literals) and it is non-negative. */
2803 else if ((unsigned_op2
&& tree_expr_nonnegative_p (op1
))
2804 || (unsigned_op1
&& tree_expr_nonnegative_p (op2
)))
2807 warning ("signed and unsigned type in conditional expression");
2811 else if (code1
== VOID_TYPE
|| code2
== VOID_TYPE
)
2813 if (pedantic
&& (code1
!= VOID_TYPE
|| code2
!= VOID_TYPE
))
2814 pedwarn ("ISO C forbids conditional expr with only one void side");
2815 result_type
= void_type_node
;
2817 else if (code1
== POINTER_TYPE
&& code2
== POINTER_TYPE
)
2819 if (comp_target_types (type1
, type2
, 1))
2820 result_type
= common_pointer_type (type1
, type2
);
2821 else if (integer_zerop (op1
) && TREE_TYPE (type1
) == void_type_node
2822 && TREE_CODE (orig_op1
) != NOP_EXPR
)
2823 result_type
= qualify_type (type2
, type1
);
2824 else if (integer_zerop (op2
) && TREE_TYPE (type2
) == void_type_node
2825 && TREE_CODE (orig_op2
) != NOP_EXPR
)
2826 result_type
= qualify_type (type1
, type2
);
2827 else if (VOID_TYPE_P (TREE_TYPE (type1
)))
2829 if (pedantic
&& TREE_CODE (TREE_TYPE (type2
)) == FUNCTION_TYPE
)
2830 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
2831 result_type
= build_pointer_type (qualify_type (TREE_TYPE (type1
),
2832 TREE_TYPE (type2
)));
2834 else if (VOID_TYPE_P (TREE_TYPE (type2
)))
2836 if (pedantic
&& TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
)
2837 pedwarn ("ISO C forbids conditional expr between `void *' and function pointer");
2838 result_type
= build_pointer_type (qualify_type (TREE_TYPE (type2
),
2839 TREE_TYPE (type1
)));
2843 pedwarn ("pointer type mismatch in conditional expression");
2844 result_type
= build_pointer_type (void_type_node
);
2847 else if (code1
== POINTER_TYPE
&& code2
== INTEGER_TYPE
)
2849 if (! integer_zerop (op2
))
2850 pedwarn ("pointer/integer type mismatch in conditional expression");
2853 op2
= null_pointer_node
;
2855 result_type
= type1
;
2857 else if (code2
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
2859 if (!integer_zerop (op1
))
2860 pedwarn ("pointer/integer type mismatch in conditional expression");
2863 op1
= null_pointer_node
;
2865 result_type
= type2
;
2870 if (flag_cond_mismatch
)
2871 result_type
= void_type_node
;
2874 error ("type mismatch in conditional expression");
2875 return error_mark_node
;
2879 /* Merge const and volatile flags of the incoming types. */
2881 = build_type_variant (result_type
,
2882 TREE_READONLY (op1
) || TREE_READONLY (op2
),
2883 TREE_THIS_VOLATILE (op1
) || TREE_THIS_VOLATILE (op2
));
2885 if (result_type
!= TREE_TYPE (op1
))
2886 op1
= convert_and_check (result_type
, op1
);
2887 if (result_type
!= TREE_TYPE (op2
))
2888 op2
= convert_and_check (result_type
, op2
);
2890 if (TREE_CODE (ifexp
) == INTEGER_CST
)
2891 return non_lvalue (integer_zerop (ifexp
) ? op2
: op1
);
2893 return fold (build (COND_EXPR
, result_type
, ifexp
, op1
, op2
));
2896 /* Given a list of expressions, return a compound expression
2897 that performs them all and returns the value of the last of them. */
2900 build_compound_expr (tree list
)
2902 return internal_build_compound_expr (list
, TRUE
);
2906 internal_build_compound_expr (tree list
, int first_p
)
2910 if (TREE_CHAIN (list
) == 0)
2912 /* Convert arrays and functions to pointers when there
2913 really is a comma operator. */
2916 = default_function_array_conversion (TREE_VALUE (list
));
2918 /* Don't let (0, 0) be null pointer constant. */
2919 if (!first_p
&& integer_zerop (TREE_VALUE (list
)))
2920 return non_lvalue (TREE_VALUE (list
));
2921 return TREE_VALUE (list
);
2924 rest
= internal_build_compound_expr (TREE_CHAIN (list
), FALSE
);
2926 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list
)))
2928 /* The left-hand operand of a comma expression is like an expression
2929 statement: with -Wextra or -Wunused, we should warn if it doesn't have
2930 any side-effects, unless it was explicitly cast to (void). */
2931 if (warn_unused_value
2932 && ! (TREE_CODE (TREE_VALUE (list
)) == CONVERT_EXPR
2933 && VOID_TYPE_P (TREE_TYPE (TREE_VALUE (list
)))))
2934 warning ("left-hand operand of comma expression has no effect");
2937 /* With -Wunused, we should also warn if the left-hand operand does have
2938 side-effects, but computes a value which is not used. For example, in
2939 `foo() + bar(), baz()' the result of the `+' operator is not used,
2940 so we should issue a warning. */
2941 else if (warn_unused_value
)
2942 warn_if_unused_value (TREE_VALUE (list
), input_location
);
2944 return build (COMPOUND_EXPR
, TREE_TYPE (rest
), TREE_VALUE (list
), rest
);
2947 /* Build an expression representing a cast to type TYPE of expression EXPR. */
2950 build_c_cast (tree type
, tree expr
)
2954 if (type
== error_mark_node
|| expr
== error_mark_node
)
2955 return error_mark_node
;
2957 /* The ObjC front-end uses TYPE_MAIN_VARIANT to tie together types differing
2958 only in <protocol> qualifications. But when constructing cast expressions,
2959 the protocols do matter and must be kept around. */
2960 if (!c_dialect_objc () || !objc_is_object_ptr (type
))
2961 type
= TYPE_MAIN_VARIANT (type
);
2963 if (TREE_CODE (type
) == ARRAY_TYPE
)
2965 error ("cast specifies array type");
2966 return error_mark_node
;
2969 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2971 error ("cast specifies function type");
2972 return error_mark_node
;
2975 if (type
== TYPE_MAIN_VARIANT (TREE_TYPE (value
)))
2979 if (TREE_CODE (type
) == RECORD_TYPE
2980 || TREE_CODE (type
) == UNION_TYPE
)
2981 pedwarn ("ISO C forbids casting nonscalar to the same type");
2984 else if (TREE_CODE (type
) == UNION_TYPE
)
2987 value
= default_function_array_conversion (value
);
2989 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
2990 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field
)),
2991 TYPE_MAIN_VARIANT (TREE_TYPE (value
))))
2999 pedwarn ("ISO C forbids casts to union type");
3000 t
= digest_init (type
,
3001 build_constructor (type
,
3002 build_tree_list (field
, value
)),
3004 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
3005 TREE_INVARIANT (t
) = TREE_INVARIANT (value
);
3008 error ("cast to union type from type not present in union");
3009 return error_mark_node
;
3015 /* If casting to void, avoid the error that would come
3016 from default_conversion in the case of a non-lvalue array. */
3017 if (type
== void_type_node
)
3018 return build1 (CONVERT_EXPR
, type
, value
);
3020 /* Convert functions and arrays to pointers,
3021 but don't convert any other types. */
3022 value
= default_function_array_conversion (value
);
3023 otype
= TREE_TYPE (value
);
3025 /* Optionally warn about potentially worrisome casts. */
3028 && TREE_CODE (type
) == POINTER_TYPE
3029 && TREE_CODE (otype
) == POINTER_TYPE
)
3031 tree in_type
= type
;
3032 tree in_otype
= otype
;
3036 /* Check that the qualifiers on IN_TYPE are a superset of
3037 the qualifiers of IN_OTYPE. The outermost level of
3038 POINTER_TYPE nodes is uninteresting and we stop as soon
3039 as we hit a non-POINTER_TYPE node on either type. */
3042 in_otype
= TREE_TYPE (in_otype
);
3043 in_type
= TREE_TYPE (in_type
);
3045 /* GNU C allows cv-qualified function types. 'const'
3046 means the function is very pure, 'volatile' means it
3047 can't return. We need to warn when such qualifiers
3048 are added, not when they're taken away. */
3049 if (TREE_CODE (in_otype
) == FUNCTION_TYPE
3050 && TREE_CODE (in_type
) == FUNCTION_TYPE
)
3051 added
|= (TYPE_QUALS (in_type
) & ~TYPE_QUALS (in_otype
));
3053 discarded
|= (TYPE_QUALS (in_otype
) & ~TYPE_QUALS (in_type
));
3055 while (TREE_CODE (in_type
) == POINTER_TYPE
3056 && TREE_CODE (in_otype
) == POINTER_TYPE
);
3059 warning ("cast adds new qualifiers to function type");
3062 /* There are qualifiers present in IN_OTYPE that are not
3063 present in IN_TYPE. */
3064 warning ("cast discards qualifiers from pointer target type");
3067 /* Warn about possible alignment problems. */
3068 if (STRICT_ALIGNMENT
&& warn_cast_align
3069 && TREE_CODE (type
) == POINTER_TYPE
3070 && TREE_CODE (otype
) == POINTER_TYPE
3071 && TREE_CODE (TREE_TYPE (otype
)) != VOID_TYPE
3072 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
3073 /* Don't warn about opaque types, where the actual alignment
3074 restriction is unknown. */
3075 && !((TREE_CODE (TREE_TYPE (otype
)) == UNION_TYPE
3076 || TREE_CODE (TREE_TYPE (otype
)) == RECORD_TYPE
)
3077 && TYPE_MODE (TREE_TYPE (otype
)) == VOIDmode
)
3078 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (otype
)))
3079 warning ("cast increases required alignment of target type");
3081 if (TREE_CODE (type
) == INTEGER_TYPE
3082 && TREE_CODE (otype
) == POINTER_TYPE
3083 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
3084 && !TREE_CONSTANT (value
))
3085 warning ("cast from pointer to integer of different size");
3087 if (warn_bad_function_cast
3088 && TREE_CODE (value
) == CALL_EXPR
3089 && TREE_CODE (type
) != TREE_CODE (otype
))
3090 warning ("cast does not match function type");
3092 if (TREE_CODE (type
) == POINTER_TYPE
3093 && TREE_CODE (otype
) == INTEGER_TYPE
3094 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
3095 /* Don't warn about converting any constant. */
3096 && !TREE_CONSTANT (value
))
3097 warning ("cast to pointer from integer of different size");
3099 if (TREE_CODE (type
) == POINTER_TYPE
3100 && TREE_CODE (otype
) == POINTER_TYPE
3101 && TREE_CODE (expr
) == ADDR_EXPR
3102 && DECL_P (TREE_OPERAND (expr
, 0))
3103 && flag_strict_aliasing
&& warn_strict_aliasing
3104 && !VOID_TYPE_P (TREE_TYPE (type
)))
3106 /* Casting the address of a decl to non void pointer. Warn
3107 if the cast breaks type based aliasing. */
3108 if (!COMPLETE_TYPE_P (TREE_TYPE (type
)))
3109 warning ("type-punning to incomplete type might break strict-aliasing rules");
3112 HOST_WIDE_INT set1
= get_alias_set (TREE_TYPE (TREE_OPERAND (expr
, 0)));
3113 HOST_WIDE_INT set2
= get_alias_set (TREE_TYPE (type
));
3115 if (!alias_sets_conflict_p (set1
, set2
))
3116 warning ("dereferencing type-punned pointer will break strict-aliasing rules");
3117 else if (warn_strict_aliasing
> 1
3118 && !alias_sets_might_conflict_p (set1
, set2
))
3119 warning ("dereferencing type-punned pointer might break strict-aliasing rules");
3123 /* If pedantic, warn for conversions between function and object
3124 pointer types, except for converting a null pointer constant
3125 to function pointer type. */
3127 && TREE_CODE (type
) == POINTER_TYPE
3128 && TREE_CODE (otype
) == POINTER_TYPE
3129 && TREE_CODE (TREE_TYPE (otype
)) == FUNCTION_TYPE
3130 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
3131 pedwarn ("ISO C forbids conversion of function pointer to object pointer type");
3134 && TREE_CODE (type
) == POINTER_TYPE
3135 && TREE_CODE (otype
) == POINTER_TYPE
3136 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
3137 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
3138 && !(integer_zerop (value
) && TREE_TYPE (otype
) == void_type_node
3139 && TREE_CODE (expr
) != NOP_EXPR
))
3140 pedwarn ("ISO C forbids conversion of object pointer to function pointer type");
3143 /* Replace a nonvolatile const static variable with its value. */
3144 if (optimize
&& TREE_CODE (value
) == VAR_DECL
)
3145 value
= decl_constant_value (value
);
3146 value
= convert (type
, value
);
3148 /* Ignore any integer overflow caused by the cast. */
3149 if (TREE_CODE (value
) == INTEGER_CST
)
3151 TREE_OVERFLOW (value
) = TREE_OVERFLOW (ovalue
);
3153 if (TREE_CODE_CLASS (TREE_CODE (ovalue
)) == 'c')
3154 TREE_CONSTANT_OVERFLOW (value
) = TREE_CONSTANT_OVERFLOW (ovalue
);
3158 /* Don't let (void *) (FOO *) 0 be a null pointer constant. */
3159 if (TREE_CODE (value
) == INTEGER_CST
3160 && TREE_CODE (expr
) == INTEGER_CST
3161 && TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
)
3162 value
= non_lvalue (value
);
3164 /* Don't let a cast be an lvalue. */
3166 value
= non_lvalue (value
);
3171 /* Interpret a cast of expression EXPR to type TYPE. */
3173 c_cast_expr (tree type
, tree expr
)
3175 int saved_wsp
= warn_strict_prototypes
;
3177 /* This avoids warnings about unprototyped casts on
3178 integers. E.g. "#define SIG_DFL (void(*)())0". */
3179 if (TREE_CODE (expr
) == INTEGER_CST
)
3180 warn_strict_prototypes
= 0;
3181 type
= groktypename (type
);
3182 warn_strict_prototypes
= saved_wsp
;
3184 return build_c_cast (type
, expr
);
3188 /* Build an assignment expression of lvalue LHS from value RHS.
3189 MODIFYCODE is the code for a binary operator that we use
3190 to combine the old value of LHS with RHS to get the new value.
3191 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3194 build_modify_expr (tree lhs
, enum tree_code modifycode
, tree rhs
)
3198 tree lhstype
= TREE_TYPE (lhs
);
3199 tree olhstype
= lhstype
;
3201 /* Types that aren't fully specified cannot be used in assignments. */
3202 lhs
= require_complete_type (lhs
);
3204 /* Avoid duplicate error messages from operands that had errors. */
3205 if (TREE_CODE (lhs
) == ERROR_MARK
|| TREE_CODE (rhs
) == ERROR_MARK
)
3206 return error_mark_node
;
3208 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3209 /* Do not use STRIP_NOPS here. We do not want an enumerator
3210 whose value is 0 to count as a null pointer constant. */
3211 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
3212 rhs
= TREE_OPERAND (rhs
, 0);
3216 /* If a binary op has been requested, combine the old LHS value with the RHS
3217 producing the value we should actually store into the LHS. */
3219 if (modifycode
!= NOP_EXPR
)
3221 lhs
= stabilize_reference (lhs
);
3222 newrhs
= build_binary_op (modifycode
, lhs
, rhs
, 1);
3225 if (!lvalue_or_else (lhs
, "invalid lvalue in assignment"))
3226 return error_mark_node
;
3228 /* Warn about storing in something that is `const'. */
3230 if (TREE_READONLY (lhs
) || TYPE_READONLY (lhstype
)
3231 || ((TREE_CODE (lhstype
) == RECORD_TYPE
3232 || TREE_CODE (lhstype
) == UNION_TYPE
)
3233 && C_TYPE_FIELDS_READONLY (lhstype
)))
3234 readonly_error (lhs
, "assignment");
3236 /* If storing into a structure or union member,
3237 it has probably been given type `int'.
3238 Compute the type that would go with
3239 the actual amount of storage the member occupies. */
3241 if (TREE_CODE (lhs
) == COMPONENT_REF
3242 && (TREE_CODE (lhstype
) == INTEGER_TYPE
3243 || TREE_CODE (lhstype
) == BOOLEAN_TYPE
3244 || TREE_CODE (lhstype
) == REAL_TYPE
3245 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
3246 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
3248 /* If storing in a field that is in actuality a short or narrower than one,
3249 we must store in the field in its actual type. */
3251 if (lhstype
!= TREE_TYPE (lhs
))
3253 lhs
= copy_node (lhs
);
3254 TREE_TYPE (lhs
) = lhstype
;
3257 /* Convert new value to destination type. */
3259 newrhs
= convert_for_assignment (lhstype
, newrhs
, _("assignment"),
3260 NULL_TREE
, NULL_TREE
, 0);
3261 if (TREE_CODE (newrhs
) == ERROR_MARK
)
3262 return error_mark_node
;
3266 result
= build (MODIFY_EXPR
, lhstype
, lhs
, newrhs
);
3267 TREE_SIDE_EFFECTS (result
) = 1;
3269 /* If we got the LHS in a different type for storing in,
3270 convert the result back to the nominal type of LHS
3271 so that the value we return always has the same type
3272 as the LHS argument. */
3274 if (olhstype
== TREE_TYPE (result
))
3276 return convert_for_assignment (olhstype
, result
, _("assignment"),
3277 NULL_TREE
, NULL_TREE
, 0);
3280 /* Convert value RHS to type TYPE as preparation for an assignment
3281 to an lvalue of type TYPE.
3282 The real work of conversion is done by `convert'.
3283 The purpose of this function is to generate error messages
3284 for assignments that are not allowed in C.
3285 ERRTYPE is a string to use in error messages:
3286 "assignment", "return", etc. If it is null, this is parameter passing
3287 for a function call (and different error messages are output).
3289 FUNNAME is the name of the function being called,
3290 as an IDENTIFIER_NODE, or null.
3291 PARMNUM is the number of the argument, for printing in error messages. */
3294 convert_for_assignment (tree type
, tree rhs
, const char *errtype
,
3295 tree fundecl
, tree funname
, int parmnum
)
3297 enum tree_code codel
= TREE_CODE (type
);
3299 enum tree_code coder
;
3301 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3302 /* Do not use STRIP_NOPS here. We do not want an enumerator
3303 whose value is 0 to count as a null pointer constant. */
3304 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
3305 rhs
= TREE_OPERAND (rhs
, 0);
3307 if (TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
3308 || TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
)
3309 rhs
= default_conversion (rhs
);
3310 else if (optimize
&& TREE_CODE (rhs
) == VAR_DECL
)
3311 rhs
= decl_constant_value_for_broken_optimization (rhs
);
3313 rhstype
= TREE_TYPE (rhs
);
3314 coder
= TREE_CODE (rhstype
);
3316 if (coder
== ERROR_MARK
)
3317 return error_mark_node
;
3319 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (rhstype
))
3321 overflow_warning (rhs
);
3322 /* Check for Objective-C protocols. This will automatically
3323 issue a warning if there are protocol violations. No need to
3324 use the return value. */
3325 if (c_dialect_objc ())
3326 objc_comptypes (type
, rhstype
, 0);
3330 if (coder
== VOID_TYPE
)
3332 error ("void value not ignored as it ought to be");
3333 return error_mark_node
;
3335 /* A type converts to a reference to it.
3336 This code doesn't fully support references, it's just for the
3337 special case of va_start and va_copy. */
3338 if (codel
== REFERENCE_TYPE
3339 && comptypes (TREE_TYPE (type
), TREE_TYPE (rhs
)) == 1)
3341 if (!lvalue_p (rhs
))
3343 error ("cannot pass rvalue to reference parameter");
3344 return error_mark_node
;
3346 if (!c_mark_addressable (rhs
))
3347 return error_mark_node
;
3348 rhs
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (rhs
)), rhs
);
3350 /* We already know that these two types are compatible, but they
3351 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3352 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3353 likely to be va_list, a typedef to __builtin_va_list, which
3354 is different enough that it will cause problems later. */
3355 if (TREE_TYPE (TREE_TYPE (rhs
)) != TREE_TYPE (type
))
3356 rhs
= build1 (NOP_EXPR
, build_pointer_type (TREE_TYPE (type
)), rhs
);
3358 rhs
= build1 (NOP_EXPR
, type
, rhs
);
3361 /* Some types can interconvert without explicit casts. */
3362 else if (codel
== VECTOR_TYPE
3363 && vector_types_convertible_p (type
, TREE_TYPE (rhs
)))
3364 return convert (type
, rhs
);
3365 /* Arithmetic types all interconvert, and enum is treated like int. */
3366 else if ((codel
== INTEGER_TYPE
|| codel
== REAL_TYPE
3367 || codel
== ENUMERAL_TYPE
|| codel
== COMPLEX_TYPE
3368 || codel
== BOOLEAN_TYPE
)
3369 && (coder
== INTEGER_TYPE
|| coder
== REAL_TYPE
3370 || coder
== ENUMERAL_TYPE
|| coder
== COMPLEX_TYPE
3371 || coder
== BOOLEAN_TYPE
))
3372 return convert_and_check (type
, rhs
);
3374 /* Conversion to a transparent union from its member types.
3375 This applies only to function arguments. */
3376 else if (codel
== UNION_TYPE
&& TYPE_TRANSPARENT_UNION (type
) && ! errtype
)
3379 tree marginal_memb_type
= 0;
3381 for (memb_types
= TYPE_FIELDS (type
); memb_types
;
3382 memb_types
= TREE_CHAIN (memb_types
))
3384 tree memb_type
= TREE_TYPE (memb_types
);
3386 if (comptypes (TYPE_MAIN_VARIANT (memb_type
),
3387 TYPE_MAIN_VARIANT (rhstype
)))
3390 if (TREE_CODE (memb_type
) != POINTER_TYPE
)
3393 if (coder
== POINTER_TYPE
)
3395 tree ttl
= TREE_TYPE (memb_type
);
3396 tree ttr
= TREE_TYPE (rhstype
);
3398 /* Any non-function converts to a [const][volatile] void *
3399 and vice versa; otherwise, targets must be the same.
3400 Meanwhile, the lhs target must have all the qualifiers of
3402 if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
3403 || comp_target_types (memb_type
, rhstype
, 0))
3405 /* If this type won't generate any warnings, use it. */
3406 if (TYPE_QUALS (ttl
) == TYPE_QUALS (ttr
)
3407 || ((TREE_CODE (ttr
) == FUNCTION_TYPE
3408 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
3409 ? ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
3410 == TYPE_QUALS (ttr
))
3411 : ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
3412 == TYPE_QUALS (ttl
))))
3415 /* Keep looking for a better type, but remember this one. */
3416 if (! marginal_memb_type
)
3417 marginal_memb_type
= memb_type
;
3421 /* Can convert integer zero to any pointer type. */
3422 if (integer_zerop (rhs
)
3423 || (TREE_CODE (rhs
) == NOP_EXPR
3424 && integer_zerop (TREE_OPERAND (rhs
, 0))))
3426 rhs
= null_pointer_node
;
3431 if (memb_types
|| marginal_memb_type
)
3435 /* We have only a marginally acceptable member type;
3436 it needs a warning. */
3437 tree ttl
= TREE_TYPE (marginal_memb_type
);
3438 tree ttr
= TREE_TYPE (rhstype
);
3440 /* Const and volatile mean something different for function
3441 types, so the usual warnings are not appropriate. */
3442 if (TREE_CODE (ttr
) == FUNCTION_TYPE
3443 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
3445 /* Because const and volatile on functions are
3446 restrictions that say the function will not do
3447 certain things, it is okay to use a const or volatile
3448 function where an ordinary one is wanted, but not
3450 if (TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
))
3451 warn_for_assignment ("%s makes qualified function pointer from unqualified",
3452 errtype
, funname
, parmnum
);
3454 else if (TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
))
3455 warn_for_assignment ("%s discards qualifiers from pointer target type",
3460 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (fundecl
))
3461 pedwarn ("ISO C prohibits argument conversion to union type");
3463 return build1 (NOP_EXPR
, type
, rhs
);
3467 /* Conversions among pointers */
3468 else if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
3469 && (coder
== codel
))
3471 tree ttl
= TREE_TYPE (type
);
3472 tree ttr
= TREE_TYPE (rhstype
);
3473 bool is_opaque_pointer
;
3474 int target_cmp
= 0; /* Cache comp_target_types () result. */
3476 /* Opaque pointers are treated like void pointers. */
3477 is_opaque_pointer
= (targetm
.vector_opaque_p (type
)
3478 || targetm
.vector_opaque_p (rhstype
))
3479 && TREE_CODE (ttl
) == VECTOR_TYPE
3480 && TREE_CODE (ttr
) == VECTOR_TYPE
;
3482 /* Any non-function converts to a [const][volatile] void *
3483 and vice versa; otherwise, targets must be the same.
3484 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
3485 if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
3486 || (target_cmp
= comp_target_types (type
, rhstype
, 0))
3487 || is_opaque_pointer
3488 || (c_common_unsigned_type (TYPE_MAIN_VARIANT (ttl
))
3489 == c_common_unsigned_type (TYPE_MAIN_VARIANT (ttr
))))
3492 && ((VOID_TYPE_P (ttl
) && TREE_CODE (ttr
) == FUNCTION_TYPE
)
3495 /* Check TREE_CODE to catch cases like (void *) (char *) 0
3496 which are not ANSI null ptr constants. */
3497 && (!integer_zerop (rhs
) || TREE_CODE (rhs
) == NOP_EXPR
)
3498 && TREE_CODE (ttl
) == FUNCTION_TYPE
)))
3499 warn_for_assignment ("ISO C forbids %s between function pointer and `void *'",
3500 errtype
, funname
, parmnum
);
3501 /* Const and volatile mean something different for function types,
3502 so the usual warnings are not appropriate. */
3503 else if (TREE_CODE (ttr
) != FUNCTION_TYPE
3504 && TREE_CODE (ttl
) != FUNCTION_TYPE
)
3506 if (TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
))
3507 warn_for_assignment ("%s discards qualifiers from pointer target type",
3508 errtype
, funname
, parmnum
);
3509 /* If this is not a case of ignoring a mismatch in signedness,
3511 else if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
3514 /* If there is a mismatch, do warn. */
3516 warn_for_assignment ("pointer targets in %s differ in signedness",
3517 errtype
, funname
, parmnum
);
3519 else if (TREE_CODE (ttl
) == FUNCTION_TYPE
3520 && TREE_CODE (ttr
) == FUNCTION_TYPE
)
3522 /* Because const and volatile on functions are restrictions
3523 that say the function will not do certain things,
3524 it is okay to use a const or volatile function
3525 where an ordinary one is wanted, but not vice-versa. */
3526 if (TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
))
3527 warn_for_assignment ("%s makes qualified function pointer from unqualified",
3528 errtype
, funname
, parmnum
);
3532 warn_for_assignment ("%s from incompatible pointer type",
3533 errtype
, funname
, parmnum
);
3534 return convert (type
, rhs
);
3536 else if (codel
== POINTER_TYPE
&& coder
== ARRAY_TYPE
)
3538 error ("invalid use of non-lvalue array");
3539 return error_mark_node
;
3541 else if (codel
== POINTER_TYPE
&& coder
== INTEGER_TYPE
)
3543 /* An explicit constant 0 can convert to a pointer,
3544 or one that results from arithmetic, even including
3545 a cast to integer type. */
3546 if (! (TREE_CODE (rhs
) == INTEGER_CST
&& integer_zerop (rhs
))
3548 ! (TREE_CODE (rhs
) == NOP_EXPR
3549 && TREE_CODE (TREE_TYPE (rhs
)) == INTEGER_TYPE
3550 && TREE_CODE (TREE_OPERAND (rhs
, 0)) == INTEGER_CST
3551 && integer_zerop (TREE_OPERAND (rhs
, 0))))
3552 warn_for_assignment ("%s makes pointer from integer without a cast",
3553 errtype
, funname
, parmnum
);
3555 return convert (type
, rhs
);
3557 else if (codel
== INTEGER_TYPE
&& coder
== POINTER_TYPE
)
3559 warn_for_assignment ("%s makes integer from pointer without a cast",
3560 errtype
, funname
, parmnum
);
3561 return convert (type
, rhs
);
3563 else if (codel
== BOOLEAN_TYPE
&& coder
== POINTER_TYPE
)
3564 return convert (type
, rhs
);
3570 tree selector
= objc_message_selector ();
3572 if (selector
&& parmnum
> 2)
3573 error ("incompatible type for argument %d of `%s'",
3574 parmnum
- 2, IDENTIFIER_POINTER (selector
));
3576 error ("incompatible type for argument %d of `%s'",
3577 parmnum
, IDENTIFIER_POINTER (funname
));
3580 error ("incompatible type for argument %d of indirect function call",
3584 error ("incompatible types in %s", errtype
);
3586 return error_mark_node
;
3589 /* Convert VALUE for assignment into inlined parameter PARM. ARGNUM
3590 is used for error and waring reporting and indicates which argument
3591 is being processed. */
3594 c_convert_parm_for_inlining (tree parm
, tree value
, tree fn
, int argnum
)
3598 /* If FN was prototyped, the value has been converted already
3599 in convert_arguments. */
3600 if (! value
|| TYPE_ARG_TYPES (TREE_TYPE (fn
)))
3603 type
= TREE_TYPE (parm
);
3604 ret
= convert_for_assignment (type
, value
,
3605 (char *) 0 /* arg passing */, fn
,
3606 DECL_NAME (fn
), argnum
);
3607 if (targetm
.calls
.promote_prototypes (TREE_TYPE (fn
))
3608 && INTEGRAL_TYPE_P (type
)
3609 && (TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)))
3610 ret
= default_conversion (ret
);
3614 /* Print a warning using MSGID.
3615 It gets OPNAME as its one parameter.
3616 if OPNAME is null and ARGNUM is 0, it is replaced by "passing arg of `FUNCTION'".
3617 Otherwise if OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
3618 FUNCTION and ARGNUM are handled specially if we are building an
3619 Objective-C selector. */
3622 warn_for_assignment (const char *msgid
, const char *opname
, tree function
,
3627 tree selector
= objc_message_selector ();
3630 if (selector
&& argnum
> 2)
3632 function
= selector
;
3639 /* Function name is known; supply it. */
3640 const char *const argstring
= _("passing arg of `%s'");
3641 new_opname
= alloca (IDENTIFIER_LENGTH (function
)
3642 + strlen (argstring
) + 1 + 1);
3643 sprintf (new_opname
, argstring
,
3644 IDENTIFIER_POINTER (function
));
3648 /* Function name unknown (call through ptr). */
3649 const char *const argnofun
= _("passing arg of pointer to function");
3650 new_opname
= alloca (strlen (argnofun
) + 1 + 1);
3651 sprintf (new_opname
, argnofun
);
3656 /* Function name is known; supply it. */
3657 const char *const argstring
= _("passing arg %d of `%s'");
3658 new_opname
= alloca (IDENTIFIER_LENGTH (function
)
3659 + strlen (argstring
) + 1 + 25 /*%d*/ + 1);
3660 sprintf (new_opname
, argstring
, argnum
,
3661 IDENTIFIER_POINTER (function
));
3665 /* Function name unknown (call through ptr); just give arg number. */
3666 const char *const argnofun
= _("passing arg %d of pointer to function");
3667 new_opname
= alloca (strlen (argnofun
) + 1 + 25 /*%d*/ + 1);
3668 sprintf (new_opname
, argnofun
, argnum
);
3670 opname
= new_opname
;
3672 pedwarn (msgid
, opname
);
3675 /* If VALUE is a compound expr all of whose expressions are constant, then
3676 return its value. Otherwise, return error_mark_node.
3678 This is for handling COMPOUND_EXPRs as initializer elements
3679 which is allowed with a warning when -pedantic is specified. */
3682 valid_compound_expr_initializer (tree value
, tree endtype
)
3684 if (TREE_CODE (value
) == COMPOUND_EXPR
)
3686 if (valid_compound_expr_initializer (TREE_OPERAND (value
, 0), endtype
)
3688 return error_mark_node
;
3689 return valid_compound_expr_initializer (TREE_OPERAND (value
, 1),
3692 else if (! TREE_CONSTANT (value
)
3693 && ! initializer_constant_valid_p (value
, endtype
))
3694 return error_mark_node
;
3699 /* Perform appropriate conversions on the initial value of a variable,
3700 store it in the declaration DECL,
3701 and print any error messages that are appropriate.
3702 If the init is invalid, store an ERROR_MARK. */
3705 store_init_value (tree decl
, tree init
)
3709 /* If variable's type was invalidly declared, just ignore it. */
3711 type
= TREE_TYPE (decl
);
3712 if (TREE_CODE (type
) == ERROR_MARK
)
3715 /* Digest the specified initializer into an expression. */
3717 value
= digest_init (type
, init
, TREE_STATIC (decl
));
3719 /* Store the expression if valid; else report error. */
3721 if (warn_traditional
&& !in_system_header
3722 && AGGREGATE_TYPE_P (TREE_TYPE (decl
)) && ! TREE_STATIC (decl
))
3723 warning ("traditional C rejects automatic aggregate initialization");
3725 DECL_INITIAL (decl
) = value
;
3727 /* ANSI wants warnings about out-of-range constant initializers. */
3728 STRIP_TYPE_NOPS (value
);
3729 constant_expression_warning (value
);
3731 /* Check if we need to set array size from compound literal size. */
3732 if (TREE_CODE (type
) == ARRAY_TYPE
3733 && TYPE_DOMAIN (type
) == 0
3734 && value
!= error_mark_node
)
3736 tree inside_init
= init
;
3738 if (TREE_CODE (init
) == NON_LVALUE_EXPR
)
3739 inside_init
= TREE_OPERAND (init
, 0);
3740 inside_init
= fold (inside_init
);
3742 if (TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
3744 tree decl
= COMPOUND_LITERAL_EXPR_DECL (inside_init
);
3746 if (TYPE_DOMAIN (TREE_TYPE (decl
)))
3748 /* For int foo[] = (int [3]){1}; we need to set array size
3749 now since later on array initializer will be just the
3750 brace enclosed list of the compound literal. */
3751 TYPE_DOMAIN (type
) = TYPE_DOMAIN (TREE_TYPE (decl
));
3753 layout_decl (decl
, 0);
3759 /* Methods for storing and printing names for error messages. */
3761 /* Implement a spelling stack that allows components of a name to be pushed
3762 and popped. Each element on the stack is this structure. */
3774 #define SPELLING_STRING 1
3775 #define SPELLING_MEMBER 2
3776 #define SPELLING_BOUNDS 3
3778 static struct spelling
*spelling
; /* Next stack element (unused). */
3779 static struct spelling
*spelling_base
; /* Spelling stack base. */
3780 static int spelling_size
; /* Size of the spelling stack. */
3782 /* Macros to save and restore the spelling stack around push_... functions.
3783 Alternative to SAVE_SPELLING_STACK. */
3785 #define SPELLING_DEPTH() (spelling - spelling_base)
3786 #define RESTORE_SPELLING_DEPTH(DEPTH) (spelling = spelling_base + (DEPTH))
3788 /* Push an element on the spelling stack with type KIND and assign VALUE
3791 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
3793 int depth = SPELLING_DEPTH (); \
3795 if (depth >= spelling_size) \
3797 spelling_size += 10; \
3798 if (spelling_base == 0) \
3799 spelling_base = xmalloc (spelling_size * sizeof (struct spelling)); \
3801 spelling_base = xrealloc (spelling_base, \
3802 spelling_size * sizeof (struct spelling)); \
3803 RESTORE_SPELLING_DEPTH (depth); \
3806 spelling->kind = (KIND); \
3807 spelling->MEMBER = (VALUE); \
3811 /* Push STRING on the stack. Printed literally. */
3814 push_string (const char *string
)
3816 PUSH_SPELLING (SPELLING_STRING
, string
, u
.s
);
3819 /* Push a member name on the stack. Printed as '.' STRING. */
3822 push_member_name (tree decl
)
3824 const char *const string
3825 = DECL_NAME (decl
) ? IDENTIFIER_POINTER (DECL_NAME (decl
)) : "<anonymous>";
3826 PUSH_SPELLING (SPELLING_MEMBER
, string
, u
.s
);
3829 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
3832 push_array_bounds (int bounds
)
3834 PUSH_SPELLING (SPELLING_BOUNDS
, bounds
, u
.i
);
3837 /* Compute the maximum size in bytes of the printed spelling. */
3840 spelling_length (void)
3845 for (p
= spelling_base
; p
< spelling
; p
++)
3847 if (p
->kind
== SPELLING_BOUNDS
)
3850 size
+= strlen (p
->u
.s
) + 1;
3856 /* Print the spelling to BUFFER and return it. */
3859 print_spelling (char *buffer
)
3864 for (p
= spelling_base
; p
< spelling
; p
++)
3865 if (p
->kind
== SPELLING_BOUNDS
)
3867 sprintf (d
, "[%d]", p
->u
.i
);
3873 if (p
->kind
== SPELLING_MEMBER
)
3875 for (s
= p
->u
.s
; (*d
= *s
++); d
++)
3882 /* Issue an error message for a bad initializer component.
3883 MSGID identifies the message.
3884 The component name is taken from the spelling stack. */
3887 error_init (const char *msgid
)
3891 error ("%s", _(msgid
));
3892 ofwhat
= print_spelling (alloca (spelling_length () + 1));
3894 error ("(near initialization for `%s')", ofwhat
);
3897 /* Issue a pedantic warning for a bad initializer component.
3898 MSGID identifies the message.
3899 The component name is taken from the spelling stack. */
3902 pedwarn_init (const char *msgid
)
3906 pedwarn ("%s", _(msgid
));
3907 ofwhat
= print_spelling (alloca (spelling_length () + 1));
3909 pedwarn ("(near initialization for `%s')", ofwhat
);
3912 /* Issue a warning for a bad initializer component.
3913 MSGID identifies the message.
3914 The component name is taken from the spelling stack. */
3917 warning_init (const char *msgid
)
3921 warning ("%s", _(msgid
));
3922 ofwhat
= print_spelling (alloca (spelling_length () + 1));
3924 warning ("(near initialization for `%s')", ofwhat
);
3927 /* Digest the parser output INIT as an initializer for type TYPE.
3928 Return a C expression of type TYPE to represent the initial value.
3930 REQUIRE_CONSTANT requests an error if non-constant initializers or
3931 elements are seen. */
3934 digest_init (tree type
, tree init
, int require_constant
)
3936 enum tree_code code
= TREE_CODE (type
);
3937 tree inside_init
= init
;
3939 if (type
== error_mark_node
3940 || init
== error_mark_node
3941 || TREE_TYPE (init
) == error_mark_node
)
3942 return error_mark_node
;
3944 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3945 /* Do not use STRIP_NOPS here. We do not want an enumerator
3946 whose value is 0 to count as a null pointer constant. */
3947 if (TREE_CODE (init
) == NON_LVALUE_EXPR
)
3948 inside_init
= TREE_OPERAND (init
, 0);
3950 inside_init
= fold (inside_init
);
3952 /* Initialization of an array of chars from a string constant
3953 optionally enclosed in braces. */
3955 if (code
== ARRAY_TYPE
)
3957 tree typ1
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
3958 if ((typ1
== char_type_node
3959 || typ1
== signed_char_type_node
3960 || typ1
== unsigned_char_type_node
3961 || typ1
== unsigned_wchar_type_node
3962 || typ1
== signed_wchar_type_node
)
3963 && ((inside_init
&& TREE_CODE (inside_init
) == STRING_CST
)))
3965 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
3966 TYPE_MAIN_VARIANT (type
)))
3969 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init
)))
3971 && TYPE_PRECISION (typ1
) == TYPE_PRECISION (char_type_node
))
3973 error_init ("char-array initialized from wide string");
3974 return error_mark_node
;
3976 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init
)))
3978 && TYPE_PRECISION (typ1
) != TYPE_PRECISION (char_type_node
))
3980 error_init ("int-array initialized from non-wide string");
3981 return error_mark_node
;
3984 TREE_TYPE (inside_init
) = type
;
3985 if (TYPE_DOMAIN (type
) != 0
3986 && TYPE_SIZE (type
) != 0
3987 && TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
3988 /* Subtract 1 (or sizeof (wchar_t))
3989 because it's ok to ignore the terminating null char
3990 that is counted in the length of the constant. */
3991 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type
),
3992 TREE_STRING_LENGTH (inside_init
)
3993 - ((TYPE_PRECISION (typ1
)
3994 != TYPE_PRECISION (char_type_node
))
3995 ? (TYPE_PRECISION (wchar_type_node
)
3998 pedwarn_init ("initializer-string for array of chars is too long");
4004 /* Build a VECTOR_CST from a *constant* vector constructor. If the
4005 vector constructor is not constant (e.g. {1,2,3,foo()}) then punt
4006 below and handle as a constructor. */
4007 if (code
== VECTOR_TYPE
4008 && vector_types_convertible_p (TREE_TYPE (inside_init
), type
)
4009 && TREE_CONSTANT (inside_init
))
4011 if (TREE_CODE (inside_init
) == VECTOR_CST
4012 && comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4013 TYPE_MAIN_VARIANT (type
)))
4016 return build_vector (type
, CONSTRUCTOR_ELTS (inside_init
));
4019 /* Any type can be initialized
4020 from an expression of the same type, optionally with braces. */
4022 if (inside_init
&& TREE_TYPE (inside_init
) != 0
4023 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4024 TYPE_MAIN_VARIANT (type
))
4025 || (code
== ARRAY_TYPE
4026 && comptypes (TREE_TYPE (inside_init
), type
))
4027 || (code
== VECTOR_TYPE
4028 && comptypes (TREE_TYPE (inside_init
), type
))
4029 || (code
== POINTER_TYPE
4030 && TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
4031 && comptypes (TREE_TYPE (TREE_TYPE (inside_init
)),
4033 || (code
== POINTER_TYPE
4034 && TREE_CODE (TREE_TYPE (inside_init
)) == FUNCTION_TYPE
4035 && comptypes (TREE_TYPE (inside_init
),
4036 TREE_TYPE (type
)))))
4038 if (code
== POINTER_TYPE
)
4040 inside_init
= default_function_array_conversion (inside_init
);
4042 if (TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
)
4044 error_init ("invalid use of non-lvalue array");
4045 return error_mark_node
;
4049 if (code
== VECTOR_TYPE
)
4050 /* Although the types are compatible, we may require a
4052 inside_init
= convert (type
, inside_init
);
4054 if (require_constant
&& !flag_isoc99
4055 && TREE_CODE (inside_init
) == COMPOUND_LITERAL_EXPR
)
4057 /* As an extension, allow initializing objects with static storage
4058 duration with compound literals (which are then treated just as
4059 the brace enclosed list they contain). */
4060 tree decl
= COMPOUND_LITERAL_EXPR_DECL (inside_init
);
4061 inside_init
= DECL_INITIAL (decl
);
4064 if (code
== ARRAY_TYPE
&& TREE_CODE (inside_init
) != STRING_CST
4065 && TREE_CODE (inside_init
) != CONSTRUCTOR
)
4067 error_init ("array initialized from non-constant array expression");
4068 return error_mark_node
;
4071 if (optimize
&& TREE_CODE (inside_init
) == VAR_DECL
)
4072 inside_init
= decl_constant_value_for_broken_optimization (inside_init
);
4074 /* Compound expressions can only occur here if -pedantic or
4075 -pedantic-errors is specified. In the later case, we always want
4076 an error. In the former case, we simply want a warning. */
4077 if (require_constant
&& pedantic
4078 && TREE_CODE (inside_init
) == COMPOUND_EXPR
)
4081 = valid_compound_expr_initializer (inside_init
,
4082 TREE_TYPE (inside_init
));
4083 if (inside_init
== error_mark_node
)
4084 error_init ("initializer element is not constant");
4086 pedwarn_init ("initializer element is not constant");
4087 if (flag_pedantic_errors
)
4088 inside_init
= error_mark_node
;
4090 else if (require_constant
4091 && (!TREE_CONSTANT (inside_init
)
4092 /* This test catches things like `7 / 0' which
4093 result in an expression for which TREE_CONSTANT
4094 is true, but which is not actually something
4095 that is a legal constant. We really should not
4096 be using this function, because it is a part of
4097 the back-end. Instead, the expression should
4098 already have been turned into ERROR_MARK_NODE. */
4099 || !initializer_constant_valid_p (inside_init
,
4100 TREE_TYPE (inside_init
))))
4102 error_init ("initializer element is not constant");
4103 inside_init
= error_mark_node
;
4109 /* Handle scalar types, including conversions. */
4111 if (code
== INTEGER_TYPE
|| code
== REAL_TYPE
|| code
== POINTER_TYPE
4112 || code
== ENUMERAL_TYPE
|| code
== BOOLEAN_TYPE
|| code
== COMPLEX_TYPE
4113 || code
== VECTOR_TYPE
)
4115 /* Note that convert_for_assignment calls default_conversion
4116 for arrays and functions. We must not call it in the
4117 case where inside_init is a null pointer constant. */
4119 = convert_for_assignment (type
, init
, _("initialization"),
4120 NULL_TREE
, NULL_TREE
, 0);
4122 if (require_constant
&& ! TREE_CONSTANT (inside_init
))
4124 error_init ("initializer element is not constant");
4125 inside_init
= error_mark_node
;
4127 else if (require_constant
4128 && initializer_constant_valid_p (inside_init
, TREE_TYPE (inside_init
)) == 0)
4130 error_init ("initializer element is not computable at load time");
4131 inside_init
= error_mark_node
;
4137 /* Come here only for records and arrays. */
4139 if (COMPLETE_TYPE_P (type
) && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4141 error_init ("variable-sized object may not be initialized");
4142 return error_mark_node
;
4145 error_init ("invalid initializer");
4146 return error_mark_node
;
4149 /* Handle initializers that use braces. */
4151 /* Type of object we are accumulating a constructor for.
4152 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4153 static tree constructor_type
;
4155 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4157 static tree constructor_fields
;
4159 /* For an ARRAY_TYPE, this is the specified index
4160 at which to store the next element we get. */
4161 static tree constructor_index
;
4163 /* For an ARRAY_TYPE, this is the maximum index. */
4164 static tree constructor_max_index
;
4166 /* For a RECORD_TYPE, this is the first field not yet written out. */
4167 static tree constructor_unfilled_fields
;
4169 /* For an ARRAY_TYPE, this is the index of the first element
4170 not yet written out. */
4171 static tree constructor_unfilled_index
;
4173 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4174 This is so we can generate gaps between fields, when appropriate. */
4175 static tree constructor_bit_index
;
4177 /* If we are saving up the elements rather than allocating them,
4178 this is the list of elements so far (in reverse order,
4179 most recent first). */
4180 static tree constructor_elements
;
4182 /* 1 if constructor should be incrementally stored into a constructor chain,
4183 0 if all the elements should be kept in AVL tree. */
4184 static int constructor_incremental
;
4186 /* 1 if so far this constructor's elements are all compile-time constants. */
4187 static int constructor_constant
;
4189 /* 1 if so far this constructor's elements are all valid address constants. */
4190 static int constructor_simple
;
4192 /* 1 if this constructor is erroneous so far. */
4193 static int constructor_erroneous
;
4195 /* Structure for managing pending initializer elements, organized as an
4200 struct init_node
*left
, *right
;
4201 struct init_node
*parent
;
4207 /* Tree of pending elements at this constructor level.
4208 These are elements encountered out of order
4209 which belong at places we haven't reached yet in actually
4211 Will never hold tree nodes across GC runs. */
4212 static struct init_node
*constructor_pending_elts
;
4214 /* The SPELLING_DEPTH of this constructor. */
4215 static int constructor_depth
;
4217 /* 0 if implicitly pushing constructor levels is allowed. */
4218 int constructor_no_implicit
= 0; /* 0 for C; 1 for some other languages. */
4220 /* DECL node for which an initializer is being read.
4221 0 means we are reading a constructor expression
4222 such as (struct foo) {...}. */
4223 static tree constructor_decl
;
4225 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4226 static const char *constructor_asmspec
;
4228 /* Nonzero if this is an initializer for a top-level decl. */
4229 static int constructor_top_level
;
4231 /* Nonzero if there were any member designators in this initializer. */
4232 static int constructor_designated
;
4234 /* Nesting depth of designator list. */
4235 static int designator_depth
;
4237 /* Nonzero if there were diagnosed errors in this designator list. */
4238 static int designator_errorneous
;
4241 /* This stack has a level for each implicit or explicit level of
4242 structuring in the initializer, including the outermost one. It
4243 saves the values of most of the variables above. */
4245 struct constructor_range_stack
;
4247 struct constructor_stack
4249 struct constructor_stack
*next
;
4254 tree unfilled_index
;
4255 tree unfilled_fields
;
4258 struct init_node
*pending_elts
;
4261 /* If nonzero, this value should replace the entire
4262 constructor at this level. */
4263 tree replacement_value
;
4264 struct constructor_range_stack
*range_stack
;
4274 struct constructor_stack
*constructor_stack
;
4276 /* This stack represents designators from some range designator up to
4277 the last designator in the list. */
4279 struct constructor_range_stack
4281 struct constructor_range_stack
*next
, *prev
;
4282 struct constructor_stack
*stack
;
4289 struct constructor_range_stack
*constructor_range_stack
;
4291 /* This stack records separate initializers that are nested.
4292 Nested initializers can't happen in ANSI C, but GNU C allows them
4293 in cases like { ... (struct foo) { ... } ... }. */
4295 struct initializer_stack
4297 struct initializer_stack
*next
;
4299 const char *asmspec
;
4300 struct constructor_stack
*constructor_stack
;
4301 struct constructor_range_stack
*constructor_range_stack
;
4303 struct spelling
*spelling
;
4304 struct spelling
*spelling_base
;
4307 char require_constant_value
;
4308 char require_constant_elements
;
4311 struct initializer_stack
*initializer_stack
;
4313 /* Prepare to parse and output the initializer for variable DECL. */
4316 start_init (tree decl
, tree asmspec_tree
, int top_level
)
4319 struct initializer_stack
*p
= xmalloc (sizeof (struct initializer_stack
));
4320 const char *asmspec
= 0;
4323 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
4325 p
->decl
= constructor_decl
;
4326 p
->asmspec
= constructor_asmspec
;
4327 p
->require_constant_value
= require_constant_value
;
4328 p
->require_constant_elements
= require_constant_elements
;
4329 p
->constructor_stack
= constructor_stack
;
4330 p
->constructor_range_stack
= constructor_range_stack
;
4331 p
->elements
= constructor_elements
;
4332 p
->spelling
= spelling
;
4333 p
->spelling_base
= spelling_base
;
4334 p
->spelling_size
= spelling_size
;
4335 p
->top_level
= constructor_top_level
;
4336 p
->next
= initializer_stack
;
4337 initializer_stack
= p
;
4339 constructor_decl
= decl
;
4340 constructor_asmspec
= asmspec
;
4341 constructor_designated
= 0;
4342 constructor_top_level
= top_level
;
4346 require_constant_value
= TREE_STATIC (decl
);
4347 require_constant_elements
4348 = ((TREE_STATIC (decl
) || (pedantic
&& !flag_isoc99
))
4349 /* For a scalar, you can always use any value to initialize,
4350 even within braces. */
4351 && (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
4352 || TREE_CODE (TREE_TYPE (decl
)) == RECORD_TYPE
4353 || TREE_CODE (TREE_TYPE (decl
)) == UNION_TYPE
4354 || TREE_CODE (TREE_TYPE (decl
)) == QUAL_UNION_TYPE
));
4355 locus
= IDENTIFIER_POINTER (DECL_NAME (decl
));
4359 require_constant_value
= 0;
4360 require_constant_elements
= 0;
4361 locus
= "(anonymous)";
4364 constructor_stack
= 0;
4365 constructor_range_stack
= 0;
4367 missing_braces_mentioned
= 0;
4371 RESTORE_SPELLING_DEPTH (0);
4374 push_string (locus
);
4380 struct initializer_stack
*p
= initializer_stack
;
4382 /* Free the whole constructor stack of this initializer. */
4383 while (constructor_stack
)
4385 struct constructor_stack
*q
= constructor_stack
;
4386 constructor_stack
= q
->next
;
4390 if (constructor_range_stack
)
4393 /* Pop back to the data of the outer initializer (if any). */
4394 free (spelling_base
);
4396 constructor_decl
= p
->decl
;
4397 constructor_asmspec
= p
->asmspec
;
4398 require_constant_value
= p
->require_constant_value
;
4399 require_constant_elements
= p
->require_constant_elements
;
4400 constructor_stack
= p
->constructor_stack
;
4401 constructor_range_stack
= p
->constructor_range_stack
;
4402 constructor_elements
= p
->elements
;
4403 spelling
= p
->spelling
;
4404 spelling_base
= p
->spelling_base
;
4405 spelling_size
= p
->spelling_size
;
4406 constructor_top_level
= p
->top_level
;
4407 initializer_stack
= p
->next
;
4411 /* Call here when we see the initializer is surrounded by braces.
4412 This is instead of a call to push_init_level;
4413 it is matched by a call to pop_init_level.
4415 TYPE is the type to initialize, for a constructor expression.
4416 For an initializer for a decl, TYPE is zero. */
4419 really_start_incremental_init (tree type
)
4421 struct constructor_stack
*p
= xmalloc (sizeof (struct constructor_stack
));
4424 type
= TREE_TYPE (constructor_decl
);
4426 if (targetm
.vector_opaque_p (type
))
4427 error ("opaque vector types cannot be initialized");
4429 p
->type
= constructor_type
;
4430 p
->fields
= constructor_fields
;
4431 p
->index
= constructor_index
;
4432 p
->max_index
= constructor_max_index
;
4433 p
->unfilled_index
= constructor_unfilled_index
;
4434 p
->unfilled_fields
= constructor_unfilled_fields
;
4435 p
->bit_index
= constructor_bit_index
;
4436 p
->elements
= constructor_elements
;
4437 p
->constant
= constructor_constant
;
4438 p
->simple
= constructor_simple
;
4439 p
->erroneous
= constructor_erroneous
;
4440 p
->pending_elts
= constructor_pending_elts
;
4441 p
->depth
= constructor_depth
;
4442 p
->replacement_value
= 0;
4446 p
->incremental
= constructor_incremental
;
4447 p
->designated
= constructor_designated
;
4449 constructor_stack
= p
;
4451 constructor_constant
= 1;
4452 constructor_simple
= 1;
4453 constructor_depth
= SPELLING_DEPTH ();
4454 constructor_elements
= 0;
4455 constructor_pending_elts
= 0;
4456 constructor_type
= type
;
4457 constructor_incremental
= 1;
4458 constructor_designated
= 0;
4459 designator_depth
= 0;
4460 designator_errorneous
= 0;
4462 if (TREE_CODE (constructor_type
) == RECORD_TYPE
4463 || TREE_CODE (constructor_type
) == UNION_TYPE
)
4465 constructor_fields
= TYPE_FIELDS (constructor_type
);
4466 /* Skip any nameless bit fields at the beginning. */
4467 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
4468 && DECL_NAME (constructor_fields
) == 0)
4469 constructor_fields
= TREE_CHAIN (constructor_fields
);
4471 constructor_unfilled_fields
= constructor_fields
;
4472 constructor_bit_index
= bitsize_zero_node
;
4474 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
4476 if (TYPE_DOMAIN (constructor_type
))
4478 constructor_max_index
4479 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
4481 /* Detect non-empty initializations of zero-length arrays. */
4482 if (constructor_max_index
== NULL_TREE
4483 && TYPE_SIZE (constructor_type
))
4484 constructor_max_index
= build_int_2 (-1, -1);
4486 /* constructor_max_index needs to be an INTEGER_CST. Attempts
4487 to initialize VLAs will cause a proper error; avoid tree
4488 checking errors as well by setting a safe value. */
4489 if (constructor_max_index
4490 && TREE_CODE (constructor_max_index
) != INTEGER_CST
)
4491 constructor_max_index
= build_int_2 (-1, -1);
4494 = convert (bitsizetype
,
4495 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
4498 constructor_index
= bitsize_zero_node
;
4500 constructor_unfilled_index
= constructor_index
;
4502 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
4504 /* Vectors are like simple fixed-size arrays. */
4505 constructor_max_index
=
4506 build_int_2 (TYPE_VECTOR_SUBPARTS (constructor_type
) - 1, 0);
4507 constructor_index
= convert (bitsizetype
, bitsize_zero_node
);
4508 constructor_unfilled_index
= constructor_index
;
4512 /* Handle the case of int x = {5}; */
4513 constructor_fields
= constructor_type
;
4514 constructor_unfilled_fields
= constructor_type
;
4518 /* Push down into a subobject, for initialization.
4519 If this is for an explicit set of braces, IMPLICIT is 0.
4520 If it is because the next element belongs at a lower level,
4521 IMPLICIT is 1 (or 2 if the push is because of designator list). */
4524 push_init_level (int implicit
)
4526 struct constructor_stack
*p
;
4527 tree value
= NULL_TREE
;
4529 /* If we've exhausted any levels that didn't have braces,
4531 while (constructor_stack
->implicit
)
4533 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
4534 || TREE_CODE (constructor_type
) == UNION_TYPE
)
4535 && constructor_fields
== 0)
4536 process_init_element (pop_init_level (1));
4537 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
4538 && constructor_max_index
4539 && tree_int_cst_lt (constructor_max_index
, constructor_index
))
4540 process_init_element (pop_init_level (1));
4545 /* Unless this is an explicit brace, we need to preserve previous
4549 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
4550 || TREE_CODE (constructor_type
) == UNION_TYPE
)
4551 && constructor_fields
)
4552 value
= find_init_member (constructor_fields
);
4553 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
4554 value
= find_init_member (constructor_index
);
4557 p
= xmalloc (sizeof (struct constructor_stack
));
4558 p
->type
= constructor_type
;
4559 p
->fields
= constructor_fields
;
4560 p
->index
= constructor_index
;
4561 p
->max_index
= constructor_max_index
;
4562 p
->unfilled_index
= constructor_unfilled_index
;
4563 p
->unfilled_fields
= constructor_unfilled_fields
;
4564 p
->bit_index
= constructor_bit_index
;
4565 p
->elements
= constructor_elements
;
4566 p
->constant
= constructor_constant
;
4567 p
->simple
= constructor_simple
;
4568 p
->erroneous
= constructor_erroneous
;
4569 p
->pending_elts
= constructor_pending_elts
;
4570 p
->depth
= constructor_depth
;
4571 p
->replacement_value
= 0;
4572 p
->implicit
= implicit
;
4574 p
->incremental
= constructor_incremental
;
4575 p
->designated
= constructor_designated
;
4576 p
->next
= constructor_stack
;
4578 constructor_stack
= p
;
4580 constructor_constant
= 1;
4581 constructor_simple
= 1;
4582 constructor_depth
= SPELLING_DEPTH ();
4583 constructor_elements
= 0;
4584 constructor_incremental
= 1;
4585 constructor_designated
= 0;
4586 constructor_pending_elts
= 0;
4589 p
->range_stack
= constructor_range_stack
;
4590 constructor_range_stack
= 0;
4591 designator_depth
= 0;
4592 designator_errorneous
= 0;
4595 /* Don't die if an entire brace-pair level is superfluous
4596 in the containing level. */
4597 if (constructor_type
== 0)
4599 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
4600 || TREE_CODE (constructor_type
) == UNION_TYPE
)
4602 /* Don't die if there are extra init elts at the end. */
4603 if (constructor_fields
== 0)
4604 constructor_type
= 0;
4607 constructor_type
= TREE_TYPE (constructor_fields
);
4608 push_member_name (constructor_fields
);
4609 constructor_depth
++;
4612 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
4614 constructor_type
= TREE_TYPE (constructor_type
);
4615 push_array_bounds (tree_low_cst (constructor_index
, 0));
4616 constructor_depth
++;
4619 if (constructor_type
== 0)
4621 error_init ("extra brace group at end of initializer");
4622 constructor_fields
= 0;
4623 constructor_unfilled_fields
= 0;
4627 if (value
&& TREE_CODE (value
) == CONSTRUCTOR
)
4629 constructor_constant
= TREE_CONSTANT (value
);
4630 constructor_simple
= TREE_STATIC (value
);
4631 constructor_elements
= CONSTRUCTOR_ELTS (value
);
4632 if (constructor_elements
4633 && (TREE_CODE (constructor_type
) == RECORD_TYPE
4634 || TREE_CODE (constructor_type
) == ARRAY_TYPE
))
4635 set_nonincremental_init ();
4638 if (implicit
== 1 && warn_missing_braces
&& !missing_braces_mentioned
)
4640 missing_braces_mentioned
= 1;
4641 warning_init ("missing braces around initializer");
4644 if (TREE_CODE (constructor_type
) == RECORD_TYPE
4645 || TREE_CODE (constructor_type
) == UNION_TYPE
)
4647 constructor_fields
= TYPE_FIELDS (constructor_type
);
4648 /* Skip any nameless bit fields at the beginning. */
4649 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
4650 && DECL_NAME (constructor_fields
) == 0)
4651 constructor_fields
= TREE_CHAIN (constructor_fields
);
4653 constructor_unfilled_fields
= constructor_fields
;
4654 constructor_bit_index
= bitsize_zero_node
;
4656 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
4658 /* Vectors are like simple fixed-size arrays. */
4659 constructor_max_index
=
4660 build_int_2 (TYPE_VECTOR_SUBPARTS (constructor_type
) - 1, 0);
4661 constructor_index
= convert (bitsizetype
, integer_zero_node
);
4662 constructor_unfilled_index
= constructor_index
;
4664 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
4666 if (TYPE_DOMAIN (constructor_type
))
4668 constructor_max_index
4669 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
4671 /* Detect non-empty initializations of zero-length arrays. */
4672 if (constructor_max_index
== NULL_TREE
4673 && TYPE_SIZE (constructor_type
))
4674 constructor_max_index
= build_int_2 (-1, -1);
4676 /* constructor_max_index needs to be an INTEGER_CST. Attempts
4677 to initialize VLAs will cause a proper error; avoid tree
4678 checking errors as well by setting a safe value. */
4679 if (constructor_max_index
4680 && TREE_CODE (constructor_max_index
) != INTEGER_CST
)
4681 constructor_max_index
= build_int_2 (-1, -1);
4684 = convert (bitsizetype
,
4685 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
4688 constructor_index
= bitsize_zero_node
;
4690 constructor_unfilled_index
= constructor_index
;
4691 if (value
&& TREE_CODE (value
) == STRING_CST
)
4693 /* We need to split the char/wchar array into individual
4694 characters, so that we don't have to special case it
4696 set_nonincremental_init_from_string (value
);
4701 warning_init ("braces around scalar initializer");
4702 constructor_fields
= constructor_type
;
4703 constructor_unfilled_fields
= constructor_type
;
4707 /* At the end of an implicit or explicit brace level,
4708 finish up that level of constructor.
4709 If we were outputting the elements as they are read, return 0
4710 from inner levels (process_init_element ignores that),
4711 but return error_mark_node from the outermost level
4712 (that's what we want to put in DECL_INITIAL).
4713 Otherwise, return a CONSTRUCTOR expression. */
4716 pop_init_level (int implicit
)
4718 struct constructor_stack
*p
;
4719 tree constructor
= 0;
4723 /* When we come to an explicit close brace,
4724 pop any inner levels that didn't have explicit braces. */
4725 while (constructor_stack
->implicit
)
4726 process_init_element (pop_init_level (1));
4728 if (constructor_range_stack
)
4732 /* Now output all pending elements. */
4733 constructor_incremental
= 1;
4734 output_pending_init_elements (1);
4736 p
= constructor_stack
;
4738 /* Error for initializing a flexible array member, or a zero-length
4739 array member in an inappropriate context. */
4740 if (constructor_type
&& constructor_fields
4741 && TREE_CODE (constructor_type
) == ARRAY_TYPE
4742 && TYPE_DOMAIN (constructor_type
)
4743 && ! TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
)))
4745 /* Silently discard empty initializations. The parser will
4746 already have pedwarned for empty brackets. */
4747 if (integer_zerop (constructor_unfilled_index
))
4748 constructor_type
= NULL_TREE
;
4749 else if (! TYPE_SIZE (constructor_type
))
4751 if (constructor_depth
> 2)
4752 error_init ("initialization of flexible array member in a nested context");
4754 pedwarn_init ("initialization of a flexible array member");
4756 /* We have already issued an error message for the existence
4757 of a flexible array member not at the end of the structure.
4758 Discard the initializer so that we do not abort later. */
4759 if (TREE_CHAIN (constructor_fields
) != NULL_TREE
)
4760 constructor_type
= NULL_TREE
;
4763 /* Zero-length arrays are no longer special, so we should no longer
4768 /* Warn when some struct elements are implicitly initialized to zero. */
4771 && TREE_CODE (constructor_type
) == RECORD_TYPE
4772 && constructor_unfilled_fields
)
4774 /* Do not warn for flexible array members or zero-length arrays. */
4775 while (constructor_unfilled_fields
4776 && (! DECL_SIZE (constructor_unfilled_fields
)
4777 || integer_zerop (DECL_SIZE (constructor_unfilled_fields
))))
4778 constructor_unfilled_fields
= TREE_CHAIN (constructor_unfilled_fields
);
4780 /* Do not warn if this level of the initializer uses member
4781 designators; it is likely to be deliberate. */
4782 if (constructor_unfilled_fields
&& !constructor_designated
)
4784 push_member_name (constructor_unfilled_fields
);
4785 warning_init ("missing initializer");
4786 RESTORE_SPELLING_DEPTH (constructor_depth
);
4790 /* Pad out the end of the structure. */
4791 if (p
->replacement_value
)
4792 /* If this closes a superfluous brace pair,
4793 just pass out the element between them. */
4794 constructor
= p
->replacement_value
;
4795 else if (constructor_type
== 0)
4797 else if (TREE_CODE (constructor_type
) != RECORD_TYPE
4798 && TREE_CODE (constructor_type
) != UNION_TYPE
4799 && TREE_CODE (constructor_type
) != ARRAY_TYPE
4800 && TREE_CODE (constructor_type
) != VECTOR_TYPE
)
4802 /* A nonincremental scalar initializer--just return
4803 the element, after verifying there is just one. */
4804 if (constructor_elements
== 0)
4806 if (!constructor_erroneous
)
4807 error_init ("empty scalar initializer");
4808 constructor
= error_mark_node
;
4810 else if (TREE_CHAIN (constructor_elements
) != 0)
4812 error_init ("extra elements in scalar initializer");
4813 constructor
= TREE_VALUE (constructor_elements
);
4816 constructor
= TREE_VALUE (constructor_elements
);
4820 if (constructor_erroneous
)
4821 constructor
= error_mark_node
;
4824 constructor
= build_constructor (constructor_type
,
4825 nreverse (constructor_elements
));
4826 if (constructor_constant
)
4827 TREE_CONSTANT (constructor
) = TREE_INVARIANT (constructor
) = 1;
4828 if (constructor_constant
&& constructor_simple
)
4829 TREE_STATIC (constructor
) = 1;
4833 constructor_type
= p
->type
;
4834 constructor_fields
= p
->fields
;
4835 constructor_index
= p
->index
;
4836 constructor_max_index
= p
->max_index
;
4837 constructor_unfilled_index
= p
->unfilled_index
;
4838 constructor_unfilled_fields
= p
->unfilled_fields
;
4839 constructor_bit_index
= p
->bit_index
;
4840 constructor_elements
= p
->elements
;
4841 constructor_constant
= p
->constant
;
4842 constructor_simple
= p
->simple
;
4843 constructor_erroneous
= p
->erroneous
;
4844 constructor_incremental
= p
->incremental
;
4845 constructor_designated
= p
->designated
;
4846 constructor_pending_elts
= p
->pending_elts
;
4847 constructor_depth
= p
->depth
;
4849 constructor_range_stack
= p
->range_stack
;
4850 RESTORE_SPELLING_DEPTH (constructor_depth
);
4852 constructor_stack
= p
->next
;
4855 if (constructor
== 0)
4857 if (constructor_stack
== 0)
4858 return error_mark_node
;
4864 /* Common handling for both array range and field name designators.
4865 ARRAY argument is nonzero for array ranges. Returns zero for success. */
4868 set_designator (int array
)
4871 enum tree_code subcode
;
4873 /* Don't die if an entire brace-pair level is superfluous
4874 in the containing level. */
4875 if (constructor_type
== 0)
4878 /* If there were errors in this designator list already, bail out silently. */
4879 if (designator_errorneous
)
4882 if (!designator_depth
)
4884 if (constructor_range_stack
)
4887 /* Designator list starts at the level of closest explicit
4889 while (constructor_stack
->implicit
)
4890 process_init_element (pop_init_level (1));
4891 constructor_designated
= 1;
4895 if (constructor_no_implicit
)
4897 error_init ("initialization designators may not nest");
4901 if (TREE_CODE (constructor_type
) == RECORD_TYPE
4902 || TREE_CODE (constructor_type
) == UNION_TYPE
)
4904 subtype
= TREE_TYPE (constructor_fields
);
4905 if (subtype
!= error_mark_node
)
4906 subtype
= TYPE_MAIN_VARIANT (subtype
);
4908 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
4910 subtype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
4915 subcode
= TREE_CODE (subtype
);
4916 if (array
&& subcode
!= ARRAY_TYPE
)
4918 error_init ("array index in non-array initializer");
4921 else if (!array
&& subcode
!= RECORD_TYPE
&& subcode
!= UNION_TYPE
)
4923 error_init ("field name not in record or union initializer");
4927 constructor_designated
= 1;
4928 push_init_level (2);
4932 /* If there are range designators in designator list, push a new designator
4933 to constructor_range_stack. RANGE_END is end of such stack range or
4934 NULL_TREE if there is no range designator at this level. */
4937 push_range_stack (tree range_end
)
4939 struct constructor_range_stack
*p
;
4941 p
= ggc_alloc (sizeof (struct constructor_range_stack
));
4942 p
->prev
= constructor_range_stack
;
4944 p
->fields
= constructor_fields
;
4945 p
->range_start
= constructor_index
;
4946 p
->index
= constructor_index
;
4947 p
->stack
= constructor_stack
;
4948 p
->range_end
= range_end
;
4949 if (constructor_range_stack
)
4950 constructor_range_stack
->next
= p
;
4951 constructor_range_stack
= p
;
4954 /* Within an array initializer, specify the next index to be initialized.
4955 FIRST is that index. If LAST is nonzero, then initialize a range
4956 of indices, running from FIRST through LAST. */
4959 set_init_index (tree first
, tree last
)
4961 if (set_designator (1))
4964 designator_errorneous
= 1;
4966 while ((TREE_CODE (first
) == NOP_EXPR
4967 || TREE_CODE (first
) == CONVERT_EXPR
4968 || TREE_CODE (first
) == NON_LVALUE_EXPR
)
4969 && (TYPE_MODE (TREE_TYPE (first
))
4970 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (first
, 0)))))
4971 first
= TREE_OPERAND (first
, 0);
4974 while ((TREE_CODE (last
) == NOP_EXPR
4975 || TREE_CODE (last
) == CONVERT_EXPR
4976 || TREE_CODE (last
) == NON_LVALUE_EXPR
)
4977 && (TYPE_MODE (TREE_TYPE (last
))
4978 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (last
, 0)))))
4979 last
= TREE_OPERAND (last
, 0);
4981 if (TREE_CODE (first
) != INTEGER_CST
)
4982 error_init ("nonconstant array index in initializer");
4983 else if (last
!= 0 && TREE_CODE (last
) != INTEGER_CST
)
4984 error_init ("nonconstant array index in initializer");
4985 else if (TREE_CODE (constructor_type
) != ARRAY_TYPE
)
4986 error_init ("array index in non-array initializer");
4987 else if (tree_int_cst_sgn (first
) == -1)
4988 error_init ("array index in initializer exceeds array bounds");
4989 else if (constructor_max_index
4990 && tree_int_cst_lt (constructor_max_index
, first
))
4991 error_init ("array index in initializer exceeds array bounds");
4994 constructor_index
= convert (bitsizetype
, first
);
4998 if (tree_int_cst_equal (first
, last
))
5000 else if (tree_int_cst_lt (last
, first
))
5002 error_init ("empty index range in initializer");
5007 last
= convert (bitsizetype
, last
);
5008 if (constructor_max_index
!= 0
5009 && tree_int_cst_lt (constructor_max_index
, last
))
5011 error_init ("array index range in initializer exceeds array bounds");
5018 designator_errorneous
= 0;
5019 if (constructor_range_stack
|| last
)
5020 push_range_stack (last
);
5024 /* Within a struct initializer, specify the next field to be initialized. */
5027 set_init_label (tree fieldname
)
5031 if (set_designator (0))
5034 designator_errorneous
= 1;
5036 if (TREE_CODE (constructor_type
) != RECORD_TYPE
5037 && TREE_CODE (constructor_type
) != UNION_TYPE
)
5039 error_init ("field name not in record or union initializer");
5043 for (tail
= TYPE_FIELDS (constructor_type
); tail
;
5044 tail
= TREE_CHAIN (tail
))
5046 if (DECL_NAME (tail
) == fieldname
)
5051 error ("unknown field `%s' specified in initializer",
5052 IDENTIFIER_POINTER (fieldname
));
5055 constructor_fields
= tail
;
5057 designator_errorneous
= 0;
5058 if (constructor_range_stack
)
5059 push_range_stack (NULL_TREE
);
5063 /* Add a new initializer to the tree of pending initializers. PURPOSE
5064 identifies the initializer, either array index or field in a structure.
5065 VALUE is the value of that index or field. */
5068 add_pending_init (tree purpose
, tree value
)
5070 struct init_node
*p
, **q
, *r
;
5072 q
= &constructor_pending_elts
;
5075 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5080 if (tree_int_cst_lt (purpose
, p
->purpose
))
5082 else if (tree_int_cst_lt (p
->purpose
, purpose
))
5086 if (TREE_SIDE_EFFECTS (p
->value
))
5087 warning_init ("initialized field with side-effects overwritten");
5097 bitpos
= bit_position (purpose
);
5101 if (tree_int_cst_lt (bitpos
, bit_position (p
->purpose
)))
5103 else if (p
->purpose
!= purpose
)
5107 if (TREE_SIDE_EFFECTS (p
->value
))
5108 warning_init ("initialized field with side-effects overwritten");
5115 r
= ggc_alloc (sizeof (struct init_node
));
5116 r
->purpose
= purpose
;
5127 struct init_node
*s
;
5131 if (p
->balance
== 0)
5133 else if (p
->balance
< 0)
5140 p
->left
->parent
= p
;
5157 constructor_pending_elts
= r
;
5162 struct init_node
*t
= r
->right
;
5166 r
->right
->parent
= r
;
5171 p
->left
->parent
= p
;
5174 p
->balance
= t
->balance
< 0;
5175 r
->balance
= -(t
->balance
> 0);
5190 constructor_pending_elts
= t
;
5196 /* p->balance == +1; growth of left side balances the node. */
5201 else /* r == p->right */
5203 if (p
->balance
== 0)
5204 /* Growth propagation from right side. */
5206 else if (p
->balance
> 0)
5213 p
->right
->parent
= p
;
5230 constructor_pending_elts
= r
;
5232 else /* r->balance == -1 */
5235 struct init_node
*t
= r
->left
;
5239 r
->left
->parent
= r
;
5244 p
->right
->parent
= p
;
5247 r
->balance
= (t
->balance
< 0);
5248 p
->balance
= -(t
->balance
> 0);
5263 constructor_pending_elts
= t
;
5269 /* p->balance == -1; growth of right side balances the node. */
5280 /* Build AVL tree from a sorted chain. */
5283 set_nonincremental_init (void)
5287 if (TREE_CODE (constructor_type
) != RECORD_TYPE
5288 && TREE_CODE (constructor_type
) != ARRAY_TYPE
)
5291 for (chain
= constructor_elements
; chain
; chain
= TREE_CHAIN (chain
))
5292 add_pending_init (TREE_PURPOSE (chain
), TREE_VALUE (chain
));
5293 constructor_elements
= 0;
5294 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
5296 constructor_unfilled_fields
= TYPE_FIELDS (constructor_type
);
5297 /* Skip any nameless bit fields at the beginning. */
5298 while (constructor_unfilled_fields
!= 0
5299 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
5300 && DECL_NAME (constructor_unfilled_fields
) == 0)
5301 constructor_unfilled_fields
= TREE_CHAIN (constructor_unfilled_fields
);
5304 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5306 if (TYPE_DOMAIN (constructor_type
))
5307 constructor_unfilled_index
5308 = convert (bitsizetype
,
5309 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
5311 constructor_unfilled_index
= bitsize_zero_node
;
5313 constructor_incremental
= 0;
5316 /* Build AVL tree from a string constant. */
5319 set_nonincremental_init_from_string (tree str
)
5321 tree value
, purpose
, type
;
5322 HOST_WIDE_INT val
[2];
5323 const char *p
, *end
;
5324 int byte
, wchar_bytes
, charwidth
, bitpos
;
5326 if (TREE_CODE (constructor_type
) != ARRAY_TYPE
)
5329 if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str
)))
5330 == TYPE_PRECISION (char_type_node
))
5332 else if (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (str
)))
5333 == TYPE_PRECISION (wchar_type_node
))
5334 wchar_bytes
= TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
;
5338 charwidth
= TYPE_PRECISION (char_type_node
);
5339 type
= TREE_TYPE (constructor_type
);
5340 p
= TREE_STRING_POINTER (str
);
5341 end
= p
+ TREE_STRING_LENGTH (str
);
5343 for (purpose
= bitsize_zero_node
;
5344 p
< end
&& !tree_int_cst_lt (constructor_max_index
, purpose
);
5345 purpose
= size_binop (PLUS_EXPR
, purpose
, bitsize_one_node
))
5347 if (wchar_bytes
== 1)
5349 val
[1] = (unsigned char) *p
++;
5356 for (byte
= 0; byte
< wchar_bytes
; byte
++)
5358 if (BYTES_BIG_ENDIAN
)
5359 bitpos
= (wchar_bytes
- byte
- 1) * charwidth
;
5361 bitpos
= byte
* charwidth
;
5362 val
[bitpos
< HOST_BITS_PER_WIDE_INT
]
5363 |= ((unsigned HOST_WIDE_INT
) ((unsigned char) *p
++))
5364 << (bitpos
% HOST_BITS_PER_WIDE_INT
);
5368 if (!TYPE_UNSIGNED (type
))
5370 bitpos
= ((wchar_bytes
- 1) * charwidth
) + HOST_BITS_PER_CHAR
;
5371 if (bitpos
< HOST_BITS_PER_WIDE_INT
)
5373 if (val
[1] & (((HOST_WIDE_INT
) 1) << (bitpos
- 1)))
5375 val
[1] |= ((HOST_WIDE_INT
) -1) << bitpos
;
5379 else if (bitpos
== HOST_BITS_PER_WIDE_INT
)
5384 else if (val
[0] & (((HOST_WIDE_INT
) 1)
5385 << (bitpos
- 1 - HOST_BITS_PER_WIDE_INT
)))
5386 val
[0] |= ((HOST_WIDE_INT
) -1)
5387 << (bitpos
- HOST_BITS_PER_WIDE_INT
);
5390 value
= build_int_2 (val
[1], val
[0]);
5391 TREE_TYPE (value
) = type
;
5392 add_pending_init (purpose
, value
);
5395 constructor_incremental
= 0;
5398 /* Return value of FIELD in pending initializer or zero if the field was
5399 not initialized yet. */
5402 find_init_member (tree field
)
5404 struct init_node
*p
;
5406 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5408 if (constructor_incremental
5409 && tree_int_cst_lt (field
, constructor_unfilled_index
))
5410 set_nonincremental_init ();
5412 p
= constructor_pending_elts
;
5415 if (tree_int_cst_lt (field
, p
->purpose
))
5417 else if (tree_int_cst_lt (p
->purpose
, field
))
5423 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
5425 tree bitpos
= bit_position (field
);
5427 if (constructor_incremental
5428 && (!constructor_unfilled_fields
5429 || tree_int_cst_lt (bitpos
,
5430 bit_position (constructor_unfilled_fields
))))
5431 set_nonincremental_init ();
5433 p
= constructor_pending_elts
;
5436 if (field
== p
->purpose
)
5438 else if (tree_int_cst_lt (bitpos
, bit_position (p
->purpose
)))
5444 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
5446 if (constructor_elements
5447 && TREE_PURPOSE (constructor_elements
) == field
)
5448 return TREE_VALUE (constructor_elements
);
5453 /* "Output" the next constructor element.
5454 At top level, really output it to assembler code now.
5455 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
5456 TYPE is the data type that the containing data type wants here.
5457 FIELD is the field (a FIELD_DECL) or the index that this element fills.
5459 PENDING if non-nil means output pending elements that belong
5460 right after this element. (PENDING is normally 1;
5461 it is 0 while outputting pending elements, to avoid recursion.) */
5464 output_init_element (tree value
, tree type
, tree field
, int pending
)
5466 if (type
== error_mark_node
)
5468 constructor_erroneous
= 1;
5471 if (TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
5472 || (TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
5473 && !(TREE_CODE (value
) == STRING_CST
5474 && TREE_CODE (type
) == ARRAY_TYPE
5475 && TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
)
5476 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value
)),
5477 TYPE_MAIN_VARIANT (type
))))
5478 value
= default_conversion (value
);
5480 if (TREE_CODE (value
) == COMPOUND_LITERAL_EXPR
5481 && require_constant_value
&& !flag_isoc99
&& pending
)
5483 /* As an extension, allow initializing objects with static storage
5484 duration with compound literals (which are then treated just as
5485 the brace enclosed list they contain). */
5486 tree decl
= COMPOUND_LITERAL_EXPR_DECL (value
);
5487 value
= DECL_INITIAL (decl
);
5490 if (value
== error_mark_node
)
5491 constructor_erroneous
= 1;
5492 else if (!TREE_CONSTANT (value
))
5493 constructor_constant
= 0;
5494 else if (initializer_constant_valid_p (value
, TREE_TYPE (value
)) == 0
5495 || ((TREE_CODE (constructor_type
) == RECORD_TYPE
5496 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5497 && DECL_C_BIT_FIELD (field
)
5498 && TREE_CODE (value
) != INTEGER_CST
))
5499 constructor_simple
= 0;
5501 if (require_constant_value
&& ! TREE_CONSTANT (value
))
5503 error_init ("initializer element is not constant");
5504 value
= error_mark_node
;
5506 else if (require_constant_elements
5507 && initializer_constant_valid_p (value
, TREE_TYPE (value
)) == 0)
5508 pedwarn ("initializer element is not computable at load time");
5510 /* If this field is empty (and not at the end of structure),
5511 don't do anything other than checking the initializer. */
5513 && (TREE_TYPE (field
) == error_mark_node
5514 || (COMPLETE_TYPE_P (TREE_TYPE (field
))
5515 && integer_zerop (TYPE_SIZE (TREE_TYPE (field
)))
5516 && (TREE_CODE (constructor_type
) == ARRAY_TYPE
5517 || TREE_CHAIN (field
)))))
5520 value
= digest_init (type
, value
, require_constant_value
);
5521 if (value
== error_mark_node
)
5523 constructor_erroneous
= 1;
5527 /* If this element doesn't come next in sequence,
5528 put it on constructor_pending_elts. */
5529 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5530 && (!constructor_incremental
5531 || !tree_int_cst_equal (field
, constructor_unfilled_index
)))
5533 if (constructor_incremental
5534 && tree_int_cst_lt (field
, constructor_unfilled_index
))
5535 set_nonincremental_init ();
5537 add_pending_init (field
, value
);
5540 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
5541 && (!constructor_incremental
5542 || field
!= constructor_unfilled_fields
))
5544 /* We do this for records but not for unions. In a union,
5545 no matter which field is specified, it can be initialized
5546 right away since it starts at the beginning of the union. */
5547 if (constructor_incremental
)
5549 if (!constructor_unfilled_fields
)
5550 set_nonincremental_init ();
5553 tree bitpos
, unfillpos
;
5555 bitpos
= bit_position (field
);
5556 unfillpos
= bit_position (constructor_unfilled_fields
);
5558 if (tree_int_cst_lt (bitpos
, unfillpos
))
5559 set_nonincremental_init ();
5563 add_pending_init (field
, value
);
5566 else if (TREE_CODE (constructor_type
) == UNION_TYPE
5567 && constructor_elements
)
5569 if (TREE_SIDE_EFFECTS (TREE_VALUE (constructor_elements
)))
5570 warning_init ("initialized field with side-effects overwritten");
5572 /* We can have just one union field set. */
5573 constructor_elements
= 0;
5576 /* Otherwise, output this element either to
5577 constructor_elements or to the assembler file. */
5579 if (field
&& TREE_CODE (field
) == INTEGER_CST
)
5580 field
= copy_node (field
);
5581 constructor_elements
5582 = tree_cons (field
, value
, constructor_elements
);
5584 /* Advance the variable that indicates sequential elements output. */
5585 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5586 constructor_unfilled_index
5587 = size_binop (PLUS_EXPR
, constructor_unfilled_index
,
5589 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
5591 constructor_unfilled_fields
5592 = TREE_CHAIN (constructor_unfilled_fields
);
5594 /* Skip any nameless bit fields. */
5595 while (constructor_unfilled_fields
!= 0
5596 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
5597 && DECL_NAME (constructor_unfilled_fields
) == 0)
5598 constructor_unfilled_fields
=
5599 TREE_CHAIN (constructor_unfilled_fields
);
5601 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
5602 constructor_unfilled_fields
= 0;
5604 /* Now output any pending elements which have become next. */
5606 output_pending_init_elements (0);
5609 /* Output any pending elements which have become next.
5610 As we output elements, constructor_unfilled_{fields,index}
5611 advances, which may cause other elements to become next;
5612 if so, they too are output.
5614 If ALL is 0, we return when there are
5615 no more pending elements to output now.
5617 If ALL is 1, we output space as necessary so that
5618 we can output all the pending elements. */
5621 output_pending_init_elements (int all
)
5623 struct init_node
*elt
= constructor_pending_elts
;
5628 /* Look through the whole pending tree.
5629 If we find an element that should be output now,
5630 output it. Otherwise, set NEXT to the element
5631 that comes first among those still pending. */
5636 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5638 if (tree_int_cst_equal (elt
->purpose
,
5639 constructor_unfilled_index
))
5640 output_init_element (elt
->value
,
5641 TREE_TYPE (constructor_type
),
5642 constructor_unfilled_index
, 0);
5643 else if (tree_int_cst_lt (constructor_unfilled_index
,
5646 /* Advance to the next smaller node. */
5651 /* We have reached the smallest node bigger than the
5652 current unfilled index. Fill the space first. */
5653 next
= elt
->purpose
;
5659 /* Advance to the next bigger node. */
5664 /* We have reached the biggest node in a subtree. Find
5665 the parent of it, which is the next bigger node. */
5666 while (elt
->parent
&& elt
->parent
->right
== elt
)
5669 if (elt
&& tree_int_cst_lt (constructor_unfilled_index
,
5672 next
= elt
->purpose
;
5678 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
5679 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5681 tree ctor_unfilled_bitpos
, elt_bitpos
;
5683 /* If the current record is complete we are done. */
5684 if (constructor_unfilled_fields
== 0)
5687 ctor_unfilled_bitpos
= bit_position (constructor_unfilled_fields
);
5688 elt_bitpos
= bit_position (elt
->purpose
);
5689 /* We can't compare fields here because there might be empty
5690 fields in between. */
5691 if (tree_int_cst_equal (elt_bitpos
, ctor_unfilled_bitpos
))
5693 constructor_unfilled_fields
= elt
->purpose
;
5694 output_init_element (elt
->value
, TREE_TYPE (elt
->purpose
),
5697 else if (tree_int_cst_lt (ctor_unfilled_bitpos
, elt_bitpos
))
5699 /* Advance to the next smaller node. */
5704 /* We have reached the smallest node bigger than the
5705 current unfilled field. Fill the space first. */
5706 next
= elt
->purpose
;
5712 /* Advance to the next bigger node. */
5717 /* We have reached the biggest node in a subtree. Find
5718 the parent of it, which is the next bigger node. */
5719 while (elt
->parent
&& elt
->parent
->right
== elt
)
5723 && (tree_int_cst_lt (ctor_unfilled_bitpos
,
5724 bit_position (elt
->purpose
))))
5726 next
= elt
->purpose
;
5734 /* Ordinarily return, but not if we want to output all
5735 and there are elements left. */
5736 if (! (all
&& next
!= 0))
5739 /* If it's not incremental, just skip over the gap, so that after
5740 jumping to retry we will output the next successive element. */
5741 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5742 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5743 constructor_unfilled_fields
= next
;
5744 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5745 constructor_unfilled_index
= next
;
5747 /* ELT now points to the node in the pending tree with the next
5748 initializer to output. */
5752 /* Add one non-braced element to the current constructor level.
5753 This adjusts the current position within the constructor's type.
5754 This may also start or terminate implicit levels
5755 to handle a partly-braced initializer.
5757 Once this has found the correct level for the new element,
5758 it calls output_init_element. */
5761 process_init_element (tree value
)
5763 tree orig_value
= value
;
5764 int string_flag
= value
!= 0 && TREE_CODE (value
) == STRING_CST
;
5766 designator_depth
= 0;
5767 designator_errorneous
= 0;
5769 /* Handle superfluous braces around string cst as in
5770 char x[] = {"foo"}; */
5773 && TREE_CODE (constructor_type
) == ARRAY_TYPE
5774 && TREE_CODE (TREE_TYPE (constructor_type
)) == INTEGER_TYPE
5775 && integer_zerop (constructor_unfilled_index
))
5777 if (constructor_stack
->replacement_value
)
5778 error_init ("excess elements in char array initializer");
5779 constructor_stack
->replacement_value
= value
;
5783 if (constructor_stack
->replacement_value
!= 0)
5785 error_init ("excess elements in struct initializer");
5789 /* Ignore elements of a brace group if it is entirely superfluous
5790 and has already been diagnosed. */
5791 if (constructor_type
== 0)
5794 /* If we've exhausted any levels that didn't have braces,
5796 while (constructor_stack
->implicit
)
5798 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
5799 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5800 && constructor_fields
== 0)
5801 process_init_element (pop_init_level (1));
5802 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5803 && (constructor_max_index
== 0
5804 || tree_int_cst_lt (constructor_max_index
,
5805 constructor_index
)))
5806 process_init_element (pop_init_level (1));
5811 /* In the case of [LO ... HI] = VALUE, only evaluate VALUE once. */
5812 if (constructor_range_stack
)
5814 /* If value is a compound literal and we'll be just using its
5815 content, don't put it into a SAVE_EXPR. */
5816 if (TREE_CODE (value
) != COMPOUND_LITERAL_EXPR
5817 || !require_constant_value
5819 value
= save_expr (value
);
5824 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
5827 enum tree_code fieldcode
;
5829 if (constructor_fields
== 0)
5831 pedwarn_init ("excess elements in struct initializer");
5835 fieldtype
= TREE_TYPE (constructor_fields
);
5836 if (fieldtype
!= error_mark_node
)
5837 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
5838 fieldcode
= TREE_CODE (fieldtype
);
5840 /* Error for non-static initialization of a flexible array member. */
5841 if (fieldcode
== ARRAY_TYPE
5842 && !require_constant_value
5843 && TYPE_SIZE (fieldtype
) == NULL_TREE
5844 && TREE_CHAIN (constructor_fields
) == NULL_TREE
)
5846 error_init ("non-static initialization of a flexible array member");
5850 /* Accept a string constant to initialize a subarray. */
5852 && fieldcode
== ARRAY_TYPE
5853 && TREE_CODE (TREE_TYPE (fieldtype
)) == INTEGER_TYPE
5856 /* Otherwise, if we have come to a subaggregate,
5857 and we don't have an element of its type, push into it. */
5858 else if (value
!= 0 && !constructor_no_implicit
5859 && value
!= error_mark_node
5860 && TYPE_MAIN_VARIANT (TREE_TYPE (value
)) != fieldtype
5861 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
5862 || fieldcode
== UNION_TYPE
))
5864 push_init_level (1);
5870 push_member_name (constructor_fields
);
5871 output_init_element (value
, fieldtype
, constructor_fields
, 1);
5872 RESTORE_SPELLING_DEPTH (constructor_depth
);
5875 /* Do the bookkeeping for an element that was
5876 directly output as a constructor. */
5878 /* For a record, keep track of end position of last field. */
5879 if (DECL_SIZE (constructor_fields
))
5880 constructor_bit_index
5881 = size_binop (PLUS_EXPR
,
5882 bit_position (constructor_fields
),
5883 DECL_SIZE (constructor_fields
));
5885 /* If the current field was the first one not yet written out,
5886 it isn't now, so update. */
5887 if (constructor_unfilled_fields
== constructor_fields
)
5889 constructor_unfilled_fields
= TREE_CHAIN (constructor_fields
);
5890 /* Skip any nameless bit fields. */
5891 while (constructor_unfilled_fields
!= 0
5892 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
5893 && DECL_NAME (constructor_unfilled_fields
) == 0)
5894 constructor_unfilled_fields
=
5895 TREE_CHAIN (constructor_unfilled_fields
);
5899 constructor_fields
= TREE_CHAIN (constructor_fields
);
5900 /* Skip any nameless bit fields at the beginning. */
5901 while (constructor_fields
!= 0
5902 && DECL_C_BIT_FIELD (constructor_fields
)
5903 && DECL_NAME (constructor_fields
) == 0)
5904 constructor_fields
= TREE_CHAIN (constructor_fields
);
5906 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
5909 enum tree_code fieldcode
;
5911 if (constructor_fields
== 0)
5913 pedwarn_init ("excess elements in union initializer");
5917 fieldtype
= TREE_TYPE (constructor_fields
);
5918 if (fieldtype
!= error_mark_node
)
5919 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
5920 fieldcode
= TREE_CODE (fieldtype
);
5922 /* Warn that traditional C rejects initialization of unions.
5923 We skip the warning if the value is zero. This is done
5924 under the assumption that the zero initializer in user
5925 code appears conditioned on e.g. __STDC__ to avoid
5926 "missing initializer" warnings and relies on default
5927 initialization to zero in the traditional C case.
5928 We also skip the warning if the initializer is designated,
5929 again on the assumption that this must be conditional on
5930 __STDC__ anyway (and we've already complained about the
5931 member-designator already). */
5932 if (warn_traditional
&& !in_system_header
&& !constructor_designated
5933 && !(value
&& (integer_zerop (value
) || real_zerop (value
))))
5934 warning ("traditional C rejects initialization of unions");
5936 /* Accept a string constant to initialize a subarray. */
5938 && fieldcode
== ARRAY_TYPE
5939 && TREE_CODE (TREE_TYPE (fieldtype
)) == INTEGER_TYPE
5942 /* Otherwise, if we have come to a subaggregate,
5943 and we don't have an element of its type, push into it. */
5944 else if (value
!= 0 && !constructor_no_implicit
5945 && value
!= error_mark_node
5946 && TYPE_MAIN_VARIANT (TREE_TYPE (value
)) != fieldtype
5947 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
5948 || fieldcode
== UNION_TYPE
))
5950 push_init_level (1);
5956 push_member_name (constructor_fields
);
5957 output_init_element (value
, fieldtype
, constructor_fields
, 1);
5958 RESTORE_SPELLING_DEPTH (constructor_depth
);
5961 /* Do the bookkeeping for an element that was
5962 directly output as a constructor. */
5964 constructor_bit_index
= DECL_SIZE (constructor_fields
);
5965 constructor_unfilled_fields
= TREE_CHAIN (constructor_fields
);
5968 constructor_fields
= 0;
5970 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5972 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
5973 enum tree_code eltcode
= TREE_CODE (elttype
);
5975 /* Accept a string constant to initialize a subarray. */
5977 && eltcode
== ARRAY_TYPE
5978 && TREE_CODE (TREE_TYPE (elttype
)) == INTEGER_TYPE
5981 /* Otherwise, if we have come to a subaggregate,
5982 and we don't have an element of its type, push into it. */
5983 else if (value
!= 0 && !constructor_no_implicit
5984 && value
!= error_mark_node
5985 && TYPE_MAIN_VARIANT (TREE_TYPE (value
)) != elttype
5986 && (eltcode
== RECORD_TYPE
|| eltcode
== ARRAY_TYPE
5987 || eltcode
== UNION_TYPE
))
5989 push_init_level (1);
5993 if (constructor_max_index
!= 0
5994 && (tree_int_cst_lt (constructor_max_index
, constructor_index
)
5995 || integer_all_onesp (constructor_max_index
)))
5997 pedwarn_init ("excess elements in array initializer");
6001 /* Now output the actual element. */
6004 push_array_bounds (tree_low_cst (constructor_index
, 0));
6005 output_init_element (value
, elttype
, constructor_index
, 1);
6006 RESTORE_SPELLING_DEPTH (constructor_depth
);
6010 = size_binop (PLUS_EXPR
, constructor_index
, bitsize_one_node
);
6013 /* If we are doing the bookkeeping for an element that was
6014 directly output as a constructor, we must update
6015 constructor_unfilled_index. */
6016 constructor_unfilled_index
= constructor_index
;
6018 else if (TREE_CODE (constructor_type
) == VECTOR_TYPE
)
6020 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
6022 /* Do a basic check of initializer size. Note that vectors
6023 always have a fixed size derived from their type. */
6024 if (tree_int_cst_lt (constructor_max_index
, constructor_index
))
6026 pedwarn_init ("excess elements in vector initializer");
6030 /* Now output the actual element. */
6032 output_init_element (value
, elttype
, constructor_index
, 1);
6035 = size_binop (PLUS_EXPR
, constructor_index
, bitsize_one_node
);
6038 /* If we are doing the bookkeeping for an element that was
6039 directly output as a constructor, we must update
6040 constructor_unfilled_index. */
6041 constructor_unfilled_index
= constructor_index
;
6044 /* Handle the sole element allowed in a braced initializer
6045 for a scalar variable. */
6046 else if (constructor_fields
== 0)
6048 pedwarn_init ("excess elements in scalar initializer");
6054 output_init_element (value
, constructor_type
, NULL_TREE
, 1);
6055 constructor_fields
= 0;
6058 /* Handle range initializers either at this level or anywhere higher
6059 in the designator stack. */
6060 if (constructor_range_stack
)
6062 struct constructor_range_stack
*p
, *range_stack
;
6065 range_stack
= constructor_range_stack
;
6066 constructor_range_stack
= 0;
6067 while (constructor_stack
!= range_stack
->stack
)
6069 if (!constructor_stack
->implicit
)
6071 process_init_element (pop_init_level (1));
6073 for (p
= range_stack
;
6074 !p
->range_end
|| tree_int_cst_equal (p
->index
, p
->range_end
);
6077 if (!constructor_stack
->implicit
)
6079 process_init_element (pop_init_level (1));
6082 p
->index
= size_binop (PLUS_EXPR
, p
->index
, bitsize_one_node
);
6083 if (tree_int_cst_equal (p
->index
, p
->range_end
) && !p
->prev
)
6088 constructor_index
= p
->index
;
6089 constructor_fields
= p
->fields
;
6090 if (finish
&& p
->range_end
&& p
->index
== p
->range_start
)
6098 push_init_level (2);
6099 p
->stack
= constructor_stack
;
6100 if (p
->range_end
&& tree_int_cst_equal (p
->index
, p
->range_end
))
6101 p
->index
= p
->range_start
;
6105 constructor_range_stack
= range_stack
;
6112 constructor_range_stack
= 0;
6115 /* Build a complete asm-statement, whose components are a CV_QUALIFIER
6116 (guaranteed to be 'volatile' or null) and ARGS (represented using
6117 an ASM_EXPR node). */
6119 build_asm_stmt (tree cv_qualifier
, tree args
)
6121 if (!ASM_VOLATILE_P (args
) && cv_qualifier
)
6122 ASM_VOLATILE_P (args
) = 1;
6123 return add_stmt (args
);
6126 /* Build an asm-expr, whose components are a STRING, some OUTPUTS,
6127 some INPUTS, and some CLOBBERS. The latter three may be NULL.
6128 SIMPLE indicates whether there was anything at all after the
6129 string in the asm expression -- asm("blah") and asm("blah" : )
6130 are subtly different. We use a ASM_EXPR node to represent this. */
6132 build_asm_expr (tree string
, tree outputs
, tree inputs
, tree clobbers
,
6138 const char *constraint
;
6139 bool allows_mem
, allows_reg
, is_inout
;
6143 ninputs
= list_length (inputs
);
6144 noutputs
= list_length (outputs
);
6146 /* Remove output conversions that change the type but not the mode. */
6147 for (i
= 0, tail
= outputs
; tail
; ++i
, tail
= TREE_CHAIN (tail
))
6149 tree output
= TREE_VALUE (tail
);
6150 STRIP_NOPS (output
);
6151 TREE_VALUE (tail
) = output
;
6152 lvalue_or_else (output
, "invalid lvalue in asm statement");
6154 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (tail
)));
6156 if (!parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
6157 &allows_mem
, &allows_reg
, &is_inout
))
6159 /* By marking this operand as erroneous, we will not try
6160 to process this operand again in expand_asm_operands. */
6161 TREE_VALUE (tail
) = error_mark_node
;
6165 /* If the operand is a DECL that is going to end up in
6166 memory, assume it is addressable. This is a bit more
6167 conservative than it would ideally be; the exact test is
6168 buried deep in expand_asm_operands and depends on the
6169 DECL_RTL for the OPERAND -- which we don't have at this
6171 if (!allows_reg
&& DECL_P (output
))
6172 c_mark_addressable (output
);
6175 /* Perform default conversions on array and function inputs.
6176 Don't do this for other types as it would screw up operands
6177 expected to be in memory. */
6178 for (tail
= inputs
; tail
; tail
= TREE_CHAIN (tail
))
6179 TREE_VALUE (tail
) = default_function_array_conversion (TREE_VALUE (tail
));
6181 args
= build_stmt (ASM_EXPR
, string
, outputs
, inputs
, clobbers
);
6183 /* Simple asm statements are treated as volatile. */
6186 ASM_VOLATILE_P (args
) = 1;
6187 ASM_INPUT_P (args
) = 1;
6192 /* Expand an ASM statement with operands, handling output operands
6193 that are not variables or INDIRECT_REFS by transforming such
6194 cases into cases that expand_asm_operands can handle.
6196 Arguments are same as for expand_asm_operands. */
6199 c_expand_asm_operands (tree string
, tree outputs
, tree inputs
,
6200 tree clobbers
, int vol
, location_t locus
)
6202 int noutputs
= list_length (outputs
);
6204 /* o[I] is the place that output number I should be written. */
6205 tree
*o
= alloca (noutputs
* sizeof (tree
));
6208 /* Record the contents of OUTPUTS before it is modified. */
6209 for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
6211 o
[i
] = TREE_VALUE (tail
);
6212 if (o
[i
] == error_mark_node
)
6216 /* Generate the ASM_OPERANDS insn; store into the TREE_VALUEs of
6217 OUTPUTS some trees for where the values were actually stored. */
6218 expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, locus
);
6220 /* Copy all the intermediate outputs into the specified outputs. */
6221 for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
6223 if (o
[i
] != TREE_VALUE (tail
))
6225 expand_expr (build_modify_expr (o
[i
], NOP_EXPR
, TREE_VALUE (tail
)),
6226 NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
6229 /* Restore the original value so that it's correct the next
6230 time we expand this function. */
6231 TREE_VALUE (tail
) = o
[i
];
6233 /* Detect modification of read-only values.
6234 (Otherwise done by build_modify_expr.) */
6237 tree type
= TREE_TYPE (o
[i
]);
6238 if (TREE_READONLY (o
[i
])
6239 || TYPE_READONLY (type
)
6240 || ((TREE_CODE (type
) == RECORD_TYPE
6241 || TREE_CODE (type
) == UNION_TYPE
)
6242 && C_TYPE_FIELDS_READONLY (type
)))
6243 readonly_error (o
[i
], "modification by `asm'");
6247 /* Those MODIFY_EXPRs could do autoincrements. */
6251 /* Expand a C `return' statement.
6252 RETVAL is the expression for what to return,
6253 or a null pointer for `return;' with no value. */
6256 c_expand_return (tree retval
)
6258 tree valtype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
6260 if (TREE_THIS_VOLATILE (current_function_decl
))
6261 warning ("function declared `noreturn' has a `return' statement");
6265 current_function_returns_null
= 1;
6266 if ((warn_return_type
|| flag_isoc99
)
6267 && valtype
!= 0 && TREE_CODE (valtype
) != VOID_TYPE
)
6268 pedwarn_c99 ("`return' with no value, in function returning non-void");
6270 else if (valtype
== 0 || TREE_CODE (valtype
) == VOID_TYPE
)
6272 current_function_returns_null
= 1;
6273 if (pedantic
|| TREE_CODE (TREE_TYPE (retval
)) != VOID_TYPE
)
6274 pedwarn ("`return' with a value, in function returning void");
6278 tree t
= convert_for_assignment (valtype
, retval
, _("return"),
6279 NULL_TREE
, NULL_TREE
, 0);
6280 tree res
= DECL_RESULT (current_function_decl
);
6283 current_function_returns_value
= 1;
6284 if (t
== error_mark_node
)
6287 inner
= t
= convert (TREE_TYPE (res
), t
);
6289 /* Strip any conversions, additions, and subtractions, and see if
6290 we are returning the address of a local variable. Warn if so. */
6293 switch (TREE_CODE (inner
))
6295 case NOP_EXPR
: case NON_LVALUE_EXPR
: case CONVERT_EXPR
:
6297 inner
= TREE_OPERAND (inner
, 0);
6301 /* If the second operand of the MINUS_EXPR has a pointer
6302 type (or is converted from it), this may be valid, so
6303 don't give a warning. */
6305 tree op1
= TREE_OPERAND (inner
, 1);
6307 while (! POINTER_TYPE_P (TREE_TYPE (op1
))
6308 && (TREE_CODE (op1
) == NOP_EXPR
6309 || TREE_CODE (op1
) == NON_LVALUE_EXPR
6310 || TREE_CODE (op1
) == CONVERT_EXPR
))
6311 op1
= TREE_OPERAND (op1
, 0);
6313 if (POINTER_TYPE_P (TREE_TYPE (op1
)))
6316 inner
= TREE_OPERAND (inner
, 0);
6321 inner
= TREE_OPERAND (inner
, 0);
6323 while (TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r')
6324 inner
= TREE_OPERAND (inner
, 0);
6327 && ! DECL_EXTERNAL (inner
)
6328 && ! TREE_STATIC (inner
)
6329 && DECL_CONTEXT (inner
) == current_function_decl
)
6330 warning ("function returns address of local variable");
6340 retval
= build (MODIFY_EXPR
, TREE_TYPE (res
), res
, t
);
6343 return add_stmt (build_return_stmt (retval
));
6347 /* The SWITCH_STMT being built. */
6349 /* A splay-tree mapping the low element of a case range to the high
6350 element, or NULL_TREE if there is no high element. Used to
6351 determine whether or not a new case label duplicates an old case
6352 label. We need a tree, rather than simply a hash table, because
6353 of the GNU case range extension. */
6355 /* The next node on the stack. */
6356 struct c_switch
*next
;
6359 /* A stack of the currently active switch statements. The innermost
6360 switch statement is on the top of the stack. There is no need to
6361 mark the stack for garbage collection because it is only active
6362 during the processing of the body of a function, and we never
6363 collect at that point. */
6365 static struct c_switch
*switch_stack
;
6367 /* Start a C switch statement, testing expression EXP. Return the new
6371 c_start_case (tree exp
)
6373 enum tree_code code
;
6374 tree type
, orig_type
= error_mark_node
;
6375 struct c_switch
*cs
;
6377 if (exp
!= error_mark_node
)
6379 code
= TREE_CODE (TREE_TYPE (exp
));
6380 orig_type
= TREE_TYPE (exp
);
6382 if (! INTEGRAL_TYPE_P (orig_type
)
6383 && code
!= ERROR_MARK
)
6385 error ("switch quantity not an integer");
6386 exp
= integer_zero_node
;
6390 type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
6392 if (warn_traditional
&& !in_system_header
6393 && (type
== long_integer_type_node
6394 || type
== long_unsigned_type_node
))
6395 warning ("`long' switch expression not converted to `int' in ISO C");
6397 exp
= default_conversion (exp
);
6398 type
= TREE_TYPE (exp
);
6402 /* Add this new SWITCH_STMT to the stack. */
6403 cs
= xmalloc (sizeof (*cs
));
6404 cs
->switch_stmt
= build_stmt (SWITCH_STMT
, exp
, NULL_TREE
, orig_type
);
6405 cs
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
6406 cs
->next
= switch_stack
;
6409 return add_stmt (switch_stack
->switch_stmt
);
6412 /* Process a case label. */
6415 do_case (tree low_value
, tree high_value
)
6417 tree label
= NULL_TREE
;
6421 label
= c_add_case_label (switch_stack
->cases
,
6422 SWITCH_COND (switch_stack
->switch_stmt
),
6423 low_value
, high_value
);
6424 if (label
== error_mark_node
)
6428 error ("case label not within a switch statement");
6430 error ("`default' label not within a switch statement");
6435 /* Finish the switch statement. */
6438 c_finish_case (tree body
)
6440 struct c_switch
*cs
= switch_stack
;
6442 SWITCH_BODY (cs
->switch_stmt
) = body
;
6444 /* Emit warnings as needed. */
6445 c_do_switch_warnings (cs
->cases
, cs
->switch_stmt
);
6447 /* Pop the stack. */
6448 switch_stack
= switch_stack
->next
;
6449 splay_tree_delete (cs
->cases
);
6453 /* Keep a stack of if statements. We record the number of compound
6454 statements seen up to the if keyword, as well as the line number
6455 and file of the if. If a potentially ambiguous else is seen, that
6456 fact is recorded; the warning is issued when we can be sure that
6457 the enclosing if statement does not have an else branch. */
6461 location_t empty_locus
;
6464 unsigned int needs_warning
: 1;
6465 unsigned int saw_else
: 1;
6468 static if_elt
*if_stack
;
6470 /* Amount of space in the if statement stack. */
6471 static int if_stack_space
= 0;
6473 /* Stack pointer. */
6474 static int if_stack_pointer
= 0;
6476 /* Begin an if-statement. */
6479 c_begin_if_stmt (void)
6484 /* Make sure there is enough space on the stack. */
6485 if (if_stack_space
== 0)
6487 if_stack_space
= 10;
6488 if_stack
= xmalloc (10 * sizeof (if_elt
));
6490 else if (if_stack_space
== if_stack_pointer
)
6492 if_stack_space
+= 10;
6493 if_stack
= xrealloc (if_stack
, if_stack_space
* sizeof (if_elt
));
6496 r
= add_stmt (build_stmt (COND_EXPR
, NULL_TREE
, NULL_TREE
, NULL_TREE
));
6498 /* Record this if statement. */
6499 elt
= &if_stack
[if_stack_pointer
++];
6500 memset (elt
, 0, sizeof (*elt
));
6504 /* Record the start of an if-then, and record the start of it
6505 for ambiguous else detection.
6507 COND is the condition for the if-then statement.
6509 IF_STMT is the statement node that has already been created for
6510 this if-then statement. It is created before parsing the
6511 condition to keep line number information accurate. */
6514 c_finish_if_cond (tree cond
, int compstmt_count
, int stmt_count
)
6516 if_elt
*elt
= &if_stack
[if_stack_pointer
- 1];
6517 elt
->compstmt_count
= compstmt_count
;
6518 elt
->stmt_count
= stmt_count
;
6519 COND_EXPR_COND (elt
->if_stmt
) = lang_hooks
.truthvalue_conversion (cond
);
6522 /* Called after the then-clause for an if-statement is processed. */
6525 c_finish_then (tree then_stmt
)
6527 if_elt
*elt
= &if_stack
[if_stack_pointer
- 1];
6528 COND_EXPR_THEN (elt
->if_stmt
) = then_stmt
;
6529 elt
->empty_locus
= input_location
;
6532 /* Called between the then-clause and the else-clause
6533 of an if-then-else. */
6536 c_begin_else (int stmt_count
)
6538 if_elt
*elt
= &if_stack
[if_stack_pointer
- 1];
6540 /* An ambiguous else warning must be generated for the enclosing if
6541 statement, unless we see an else branch for that one, too. */
6542 if (warn_parentheses
6543 && if_stack_pointer
> 1
6544 && (elt
[0].compstmt_count
== elt
[-1].compstmt_count
))
6545 elt
[-1].needs_warning
= 1;
6547 /* Even if a nested if statement had an else branch, it can't be
6548 ambiguous if this one also has an else. So don't warn in that
6549 case. Also don't warn for any if statements nested in this else. */
6550 elt
->needs_warning
= 0;
6551 elt
->compstmt_count
--;
6553 elt
->stmt_count
= stmt_count
;
6556 /* Called after the else-clause for an if-statement is processed. */
6559 c_finish_else (tree else_stmt
)
6561 if_elt
*elt
= &if_stack
[if_stack_pointer
- 1];
6562 COND_EXPR_ELSE (elt
->if_stmt
) = else_stmt
;
6563 elt
->empty_locus
= input_location
;
6566 /* Record the end of an if-then. Optionally warn if a nested
6567 if statement had an ambiguous else clause. */
6570 c_finish_if_stmt (int stmt_count
)
6572 if_elt
*elt
= &if_stack
[--if_stack_pointer
];
6574 if (COND_EXPR_ELSE (elt
->if_stmt
) == NULL
)
6575 COND_EXPR_ELSE (elt
->if_stmt
) = build_empty_stmt ();
6577 if (elt
->needs_warning
)
6578 warning ("%Hsuggest explicit braces to avoid ambiguous `else'",
6579 EXPR_LOCUS (elt
->if_stmt
));
6581 if (extra_warnings
&& stmt_count
== elt
->stmt_count
)
6584 warning ("%Hempty body in an else-statement", &elt
->empty_locus
);
6586 warning ("%Hempty body in an if-statement", &elt
->empty_locus
);
6590 /* Begin a while statement. Returns a newly created WHILE_STMT if
6594 c_begin_while_stmt (void)
6597 r
= add_stmt (build_stmt (WHILE_STMT
, NULL_TREE
, NULL_TREE
));
6602 c_finish_while_stmt_cond (tree cond
, tree while_stmt
)
6604 WHILE_COND (while_stmt
) = (*lang_hooks
.truthvalue_conversion
) (cond
);
6608 c_finish_while_stmt (tree body
, tree while_stmt
)
6610 WHILE_BODY (while_stmt
) = body
;
6613 /* Create a for statement. */
6616 c_begin_for_stmt (void)
6619 r
= add_stmt (build_stmt (FOR_STMT
, NULL_TREE
, NULL_TREE
,
6620 NULL_TREE
, NULL_TREE
));
6621 FOR_INIT_STMT (r
) = push_stmt_list ();
6626 c_finish_for_stmt_init (tree for_stmt
)
6628 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
6632 c_finish_for_stmt_cond (tree cond
, tree for_stmt
)
6635 FOR_COND (for_stmt
) = lang_hooks
.truthvalue_conversion (cond
);
6639 c_finish_for_stmt_incr (tree expr
, tree for_stmt
)
6641 FOR_EXPR (for_stmt
) = expr
;
6645 c_finish_for_stmt (tree body
, tree for_stmt
)
6647 FOR_BODY (for_stmt
) = body
;
6650 /* A helper routine for c_finish_expr_stmt and c_finish_stmt_expr. */
6653 emit_side_effect_warnings (tree expr
)
6655 if (!TREE_SIDE_EFFECTS (expr
))
6657 if (!VOID_TYPE_P (TREE_TYPE (expr
)) && !TREE_NO_WARNING (expr
))
6658 warning ("%Hstatement with no effect",
6659 EXPR_LOCUS (expr
) ? EXPR_LOCUS (expr
) : &input_location
);
6661 else if (warn_unused_value
)
6662 warn_if_unused_value (expr
, input_location
);
6665 /* Emit an expression as a statement. */
6668 c_finish_expr_stmt (tree expr
)
6673 /* Do default conversion if safe and possibly important,
6674 in case within ({...}). */
6675 if ((TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
6676 && (flag_isoc99
|| lvalue_p (expr
)))
6677 || TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
)
6678 expr
= default_conversion (expr
);
6680 if (warn_sequence_point
)
6681 verify_sequence_points (expr
);
6683 if (TREE_TYPE (expr
) != error_mark_node
6684 && !COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (expr
))
6685 && TREE_CODE (TREE_TYPE (expr
)) != ARRAY_TYPE
)
6686 error ("expression statement has incomplete type");
6688 /* If we're not processing a statement expression, warn about unused values.
6689 Warnings for statement expressions will be emitted later, once we figure
6690 out which is the result. */
6691 if (!STATEMENT_LIST_STMT_EXPR (cur_stmt_list
)
6692 && (extra_warnings
|| warn_unused_value
))
6693 emit_side_effect_warnings (expr
);
6695 /* If the expression is not of a type to which we cannot assign a line
6696 number, wrap the thing in a no-op NOP_EXPR. */
6697 if (DECL_P (expr
) || TREE_CODE_CLASS (TREE_CODE (expr
)) == 'c')
6698 expr
= build1 (NOP_EXPR
, TREE_TYPE (expr
), expr
);
6703 /* Do the opposite and emit a statement as an expression. To begin,
6704 create a new binding level and return it. */
6707 c_begin_stmt_expr (void)
6711 /* We must force a BLOCK for this level so that, if it is not expanded
6712 later, there is a way to turn off the entire subtree of blocks that
6713 are contained in it. */
6715 ret
= c_begin_compound_stmt (true);
6717 /* Mark the current statement list as belonging to a statement list. */
6718 STATEMENT_LIST_STMT_EXPR (ret
) = 1;
6724 c_finish_stmt_expr (tree body
)
6726 tree last
, type
, tmp
, val
;
6729 body
= c_end_compound_stmt (body
, true);
6731 /* Locate the last statement in BODY. See c_end_compound_stmt
6732 about always returning a BIND_EXPR. */
6733 last_p
= &BIND_EXPR_BODY (body
);
6734 last
= BIND_EXPR_BODY (body
);
6737 if (TREE_CODE (last
) == STATEMENT_LIST
)
6739 tree_stmt_iterator i
;
6741 /* This can happen with degenerate cases like ({ }). No value. */
6742 if (!TREE_SIDE_EFFECTS (last
))
6745 /* If we're supposed to generate side effects warnings, process
6746 all of the statements except the last. */
6747 if (extra_warnings
|| warn_unused_value
)
6749 for (i
= tsi_start (last
); !tsi_one_before_end_p (i
); tsi_next (&i
))
6750 emit_side_effect_warnings (tsi_stmt (i
));
6753 i
= tsi_last (last
);
6754 last_p
= tsi_stmt_ptr (i
);
6758 /* If the end of the list is exception related, then the list was split
6759 by a call to push_cleanup. Continue searching. */
6760 if (TREE_CODE (last
) == TRY_FINALLY_EXPR
6761 || TREE_CODE (last
) == TRY_CATCH_EXPR
)
6763 last_p
= &TREE_OPERAND (last
, 0);
6765 goto continue_searching
;
6768 /* In the case that the BIND_EXPR is not necessary, return the
6769 expression out from inside it. */
6770 if (last
== BIND_EXPR_BODY (body
) && BIND_EXPR_VARS (body
) == NULL
)
6773 /* Extract the type of said expression. */
6774 type
= TREE_TYPE (last
);
6776 /* If we're not returning a value at all, then the BIND_EXPR that
6777 we already have is a fine expression to return. */
6778 if (!type
|| VOID_TYPE_P (type
))
6781 /* Now that we've located the expression containing the value, it seems
6782 silly to make voidify_wrapper_expr repeat the process. Create a
6783 temporary of the appropriate type and stick it in a TARGET_EXPR. */
6784 tmp
= create_tmp_var_raw (type
, NULL
);
6786 /* Unwrap a no-op NOP_EXPR as added by c_finish_expr_stmt. This avoids
6787 tree_expr_nonnegative_p giving up immediately. */
6789 if (TREE_CODE (val
) == NOP_EXPR
6790 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0)))
6791 val
= TREE_OPERAND (val
, 0);
6793 *last_p
= build (MODIFY_EXPR
, void_type_node
, tmp
, val
);
6794 SET_EXPR_LOCUS (*last_p
, EXPR_LOCUS (last
));
6796 return build (TARGET_EXPR
, type
, tmp
, body
, NULL_TREE
, NULL_TREE
);
6799 /* Begin and end compound statements. This is as simple as pushing
6800 and popping new statement lists from the tree. */
6803 c_begin_compound_stmt (bool do_scope
)
6805 tree stmt
= push_stmt_list ();
6815 c_end_compound_stmt (tree stmt
, bool do_scope
)
6821 if (c_dialect_objc ())
6822 objc_clear_super_receiver ();
6823 block
= pop_scope ();
6826 stmt
= pop_stmt_list (stmt
);
6827 stmt
= c_build_bind_expr (block
, stmt
);
6829 /* If this compound statement is nested immediately inside a statement
6830 expression, then force a BIND_EXPR to be created. Otherwise we'll
6831 do the wrong thing for ({ { 1; } }) or ({ 1; { } }). In particular,
6832 STATEMENT_LISTs merge, and thus we can lose track of what statement
6835 && STATEMENT_LIST_STMT_EXPR (cur_stmt_list
)
6836 && TREE_CODE (stmt
) != BIND_EXPR
)
6838 stmt
= build (BIND_EXPR
, void_type_node
, NULL
, stmt
, NULL
);
6839 TREE_SIDE_EFFECTS (stmt
) = 1;
6845 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
6846 when the current scope is exited. EH_ONLY is true when this is not
6847 meant to apply to normal control flow transfer. */
6850 push_cleanup (tree decl ATTRIBUTE_UNUSED
, tree cleanup
, bool eh_only
)
6852 enum tree_code code
;
6856 code
= eh_only
? TRY_CATCH_EXPR
: TRY_FINALLY_EXPR
;
6857 stmt
= build_stmt (code
, NULL
, cleanup
);
6859 stmt_expr
= STATEMENT_LIST_STMT_EXPR (cur_stmt_list
);
6860 list
= push_stmt_list ();
6861 TREE_OPERAND (stmt
, 0) = list
;
6862 STATEMENT_LIST_STMT_EXPR (list
) = stmt_expr
;
6865 /* Build a binary-operation expression without default conversions.
6866 CODE is the kind of expression to build.
6867 This function differs from `build' in several ways:
6868 the data type of the result is computed and recorded in it,
6869 warnings are generated if arg data types are invalid,
6870 special handling for addition and subtraction of pointers is known,
6871 and some optimization is done (operations on narrow ints
6872 are done in the narrower type when that gives the same result).
6873 Constant folding is also done before the result is returned.
6875 Note that the operands will never have enumeral types, or function
6876 or array types, because either they will have the default conversions
6877 performed or they have both just been converted to some other type in which
6878 the arithmetic is to be done. */
6881 build_binary_op (enum tree_code code
, tree orig_op0
, tree orig_op1
,
6885 enum tree_code code0
, code1
;
6888 /* Expression code to give to the expression when it is built.
6889 Normally this is CODE, which is what the caller asked for,
6890 but in some special cases we change it. */
6891 enum tree_code resultcode
= code
;
6893 /* Data type in which the computation is to be performed.
6894 In the simplest cases this is the common type of the arguments. */
6895 tree result_type
= NULL
;
6897 /* Nonzero means operands have already been type-converted
6898 in whatever way is necessary.
6899 Zero means they need to be converted to RESULT_TYPE. */
6902 /* Nonzero means create the expression with this type, rather than
6904 tree build_type
= 0;
6906 /* Nonzero means after finally constructing the expression
6907 convert it to this type. */
6908 tree final_type
= 0;
6910 /* Nonzero if this is an operation like MIN or MAX which can
6911 safely be computed in short if both args are promoted shorts.
6912 Also implies COMMON.
6913 -1 indicates a bitwise operation; this makes a difference
6914 in the exact conditions for when it is safe to do the operation
6915 in a narrower mode. */
6918 /* Nonzero if this is a comparison operation;
6919 if both args are promoted shorts, compare the original shorts.
6920 Also implies COMMON. */
6921 int short_compare
= 0;
6923 /* Nonzero if this is a right-shift operation, which can be computed on the
6924 original short and then promoted if the operand is a promoted short. */
6925 int short_shift
= 0;
6927 /* Nonzero means set RESULT_TYPE to the common type of the args. */
6932 op0
= default_conversion (orig_op0
);
6933 op1
= default_conversion (orig_op1
);
6941 type0
= TREE_TYPE (op0
);
6942 type1
= TREE_TYPE (op1
);
6944 /* The expression codes of the data types of the arguments tell us
6945 whether the arguments are integers, floating, pointers, etc. */
6946 code0
= TREE_CODE (type0
);
6947 code1
= TREE_CODE (type1
);
6949 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
6950 STRIP_TYPE_NOPS (op0
);
6951 STRIP_TYPE_NOPS (op1
);
6953 /* If an error was already reported for one of the arguments,
6954 avoid reporting another error. */
6956 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
6957 return error_mark_node
;
6962 /* Handle the pointer + int case. */
6963 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
6964 return pointer_int_sum (PLUS_EXPR
, op0
, op1
);
6965 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
6966 return pointer_int_sum (PLUS_EXPR
, op1
, op0
);
6972 /* Subtraction of two similar pointers.
6973 We must subtract them as integers, then divide by object size. */
6974 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
6975 && comp_target_types (type0
, type1
, 1))
6976 return pointer_diff (op0
, op1
);
6977 /* Handle pointer minus int. Just like pointer plus int. */
6978 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
6979 return pointer_int_sum (MINUS_EXPR
, op0
, op1
);
6988 case TRUNC_DIV_EXPR
:
6990 case FLOOR_DIV_EXPR
:
6991 case ROUND_DIV_EXPR
:
6992 case EXACT_DIV_EXPR
:
6993 /* Floating point division by zero is a legitimate way to obtain
6994 infinities and NaNs. */
6995 if (warn_div_by_zero
&& skip_evaluation
== 0 && integer_zerop (op1
))
6996 warning ("division by zero");
6998 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
6999 || code0
== COMPLEX_TYPE
|| code0
== VECTOR_TYPE
)
7000 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
7001 || code1
== COMPLEX_TYPE
|| code1
== VECTOR_TYPE
))
7003 if (!(code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
))
7004 resultcode
= RDIV_EXPR
;
7006 /* Although it would be tempting to shorten always here, that
7007 loses on some targets, since the modulo instruction is
7008 undefined if the quotient can't be represented in the
7009 computation mode. We shorten only if unsigned or if
7010 dividing by something we know != -1. */
7011 shorten
= (TYPE_UNSIGNED (TREE_TYPE (orig_op0
))
7012 || (TREE_CODE (op1
) == INTEGER_CST
7013 && ! integer_all_onesp (op1
)));
7021 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
7023 else if (code0
== VECTOR_TYPE
&& code1
== VECTOR_TYPE
)
7027 case TRUNC_MOD_EXPR
:
7028 case FLOOR_MOD_EXPR
:
7029 if (warn_div_by_zero
&& skip_evaluation
== 0 && integer_zerop (op1
))
7030 warning ("division by zero");
7032 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
7034 /* Although it would be tempting to shorten always here, that loses
7035 on some targets, since the modulo instruction is undefined if the
7036 quotient can't be represented in the computation mode. We shorten
7037 only if unsigned or if dividing by something we know != -1. */
7038 shorten
= (TYPE_UNSIGNED (TREE_TYPE (orig_op0
))
7039 || (TREE_CODE (op1
) == INTEGER_CST
7040 && ! integer_all_onesp (op1
)));
7045 case TRUTH_ANDIF_EXPR
:
7046 case TRUTH_ORIF_EXPR
:
7047 case TRUTH_AND_EXPR
:
7049 case TRUTH_XOR_EXPR
:
7050 if ((code0
== INTEGER_TYPE
|| code0
== POINTER_TYPE
7051 || code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
7052 && (code1
== INTEGER_TYPE
|| code1
== POINTER_TYPE
7053 || code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
))
7055 /* Result of these operations is always an int,
7056 but that does not mean the operands should be
7057 converted to ints! */
7058 result_type
= integer_type_node
;
7059 op0
= lang_hooks
.truthvalue_conversion (op0
);
7060 op1
= lang_hooks
.truthvalue_conversion (op1
);
7065 /* Shift operations: result has same type as first operand;
7066 always convert second operand to int.
7067 Also set SHORT_SHIFT if shifting rightward. */
7070 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
7072 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
7074 if (tree_int_cst_sgn (op1
) < 0)
7075 warning ("right shift count is negative");
7078 if (! integer_zerop (op1
))
7081 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
7082 warning ("right shift count >= width of type");
7086 /* Use the type of the value to be shifted. */
7087 result_type
= type0
;
7088 /* Convert the shift-count to an integer, regardless of size
7089 of value being shifted. */
7090 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
7091 op1
= convert (integer_type_node
, op1
);
7092 /* Avoid converting op1 to result_type later. */
7098 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
7100 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
7102 if (tree_int_cst_sgn (op1
) < 0)
7103 warning ("left shift count is negative");
7105 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
7106 warning ("left shift count >= width of type");
7109 /* Use the type of the value to be shifted. */
7110 result_type
= type0
;
7111 /* Convert the shift-count to an integer, regardless of size
7112 of value being shifted. */
7113 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
7114 op1
= convert (integer_type_node
, op1
);
7115 /* Avoid converting op1 to result_type later. */
7122 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
7124 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
7126 if (tree_int_cst_sgn (op1
) < 0)
7127 warning ("shift count is negative");
7128 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
7129 warning ("shift count >= width of type");
7132 /* Use the type of the value to be shifted. */
7133 result_type
= type0
;
7134 /* Convert the shift-count to an integer, regardless of size
7135 of value being shifted. */
7136 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
7137 op1
= convert (integer_type_node
, op1
);
7138 /* Avoid converting op1 to result_type later. */
7145 if (warn_float_equal
&& (code0
== REAL_TYPE
|| code1
== REAL_TYPE
))
7146 warning ("comparing floating point with == or != is unsafe");
7147 /* Result of comparison is always int,
7148 but don't convert the args to int! */
7149 build_type
= integer_type_node
;
7150 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
7151 || code0
== COMPLEX_TYPE
)
7152 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
7153 || code1
== COMPLEX_TYPE
))
7155 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
7157 tree tt0
= TREE_TYPE (type0
);
7158 tree tt1
= TREE_TYPE (type1
);
7159 /* Anything compares with void *. void * compares with anything.
7160 Otherwise, the targets must be compatible
7161 and both must be object or both incomplete. */
7162 if (comp_target_types (type0
, type1
, 1))
7163 result_type
= common_pointer_type (type0
, type1
);
7164 else if (VOID_TYPE_P (tt0
))
7166 /* op0 != orig_op0 detects the case of something
7167 whose value is 0 but which isn't a valid null ptr const. */
7168 if (pedantic
&& (!integer_zerop (op0
) || op0
!= orig_op0
)
7169 && TREE_CODE (tt1
) == FUNCTION_TYPE
)
7170 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
7172 else if (VOID_TYPE_P (tt1
))
7174 if (pedantic
&& (!integer_zerop (op1
) || op1
!= orig_op1
)
7175 && TREE_CODE (tt0
) == FUNCTION_TYPE
)
7176 pedwarn ("ISO C forbids comparison of `void *' with function pointer");
7179 pedwarn ("comparison of distinct pointer types lacks a cast");
7181 if (result_type
== NULL_TREE
)
7182 result_type
= ptr_type_node
;
7184 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
7185 && integer_zerop (op1
))
7186 result_type
= type0
;
7187 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
7188 && integer_zerop (op0
))
7189 result_type
= type1
;
7190 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
7192 result_type
= type0
;
7193 pedwarn ("comparison between pointer and integer");
7195 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
7197 result_type
= type1
;
7198 pedwarn ("comparison between pointer and integer");
7204 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
7205 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
7207 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
7209 if (comp_target_types (type0
, type1
, 1))
7211 result_type
= common_pointer_type (type0
, type1
);
7213 && TREE_CODE (TREE_TYPE (type0
)) == FUNCTION_TYPE
)
7214 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
7218 result_type
= ptr_type_node
;
7219 pedwarn ("comparison of distinct pointer types lacks a cast");
7228 build_type
= integer_type_node
;
7229 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
7230 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
7232 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
7234 if (comp_target_types (type0
, type1
, 1))
7236 result_type
= common_pointer_type (type0
, type1
);
7237 if (!COMPLETE_TYPE_P (TREE_TYPE (type0
))
7238 != !COMPLETE_TYPE_P (TREE_TYPE (type1
)))
7239 pedwarn ("comparison of complete and incomplete pointers");
7241 && TREE_CODE (TREE_TYPE (type0
)) == FUNCTION_TYPE
)
7242 pedwarn ("ISO C forbids ordered comparisons of pointers to functions");
7246 result_type
= ptr_type_node
;
7247 pedwarn ("comparison of distinct pointer types lacks a cast");
7250 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
7251 && integer_zerop (op1
))
7253 result_type
= type0
;
7254 if (pedantic
|| extra_warnings
)
7255 pedwarn ("ordered comparison of pointer with integer zero");
7257 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
7258 && integer_zerop (op0
))
7260 result_type
= type1
;
7262 pedwarn ("ordered comparison of pointer with integer zero");
7264 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
7266 result_type
= type0
;
7267 pedwarn ("comparison between pointer and integer");
7269 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
7271 result_type
= type1
;
7272 pedwarn ("comparison between pointer and integer");
7276 case UNORDERED_EXPR
:
7284 build_type
= integer_type_node
;
7285 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
7287 error ("unordered comparison on non-floating point argument");
7288 return error_mark_node
;
7297 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
7298 return error_mark_node
;
7300 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
7301 || code0
== VECTOR_TYPE
)
7303 (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
7304 || code1
== VECTOR_TYPE
))
7306 int none_complex
= (code0
!= COMPLEX_TYPE
&& code1
!= COMPLEX_TYPE
);
7308 if (shorten
|| common
|| short_compare
)
7309 result_type
= common_type (type0
, type1
);
7311 /* For certain operations (which identify themselves by shorten != 0)
7312 if both args were extended from the same smaller type,
7313 do the arithmetic in that type and then extend.
7315 shorten !=0 and !=1 indicates a bitwise operation.
7316 For them, this optimization is safe only if
7317 both args are zero-extended or both are sign-extended.
7318 Otherwise, we might change the result.
7319 Eg, (short)-1 | (unsigned short)-1 is (int)-1
7320 but calculated in (unsigned short) it would be (unsigned short)-1. */
7322 if (shorten
&& none_complex
)
7324 int unsigned0
, unsigned1
;
7325 tree arg0
= get_narrower (op0
, &unsigned0
);
7326 tree arg1
= get_narrower (op1
, &unsigned1
);
7327 /* UNS is 1 if the operation to be done is an unsigned one. */
7328 int uns
= TYPE_UNSIGNED (result_type
);
7331 final_type
= result_type
;
7333 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
7334 but it *requires* conversion to FINAL_TYPE. */
7336 if ((TYPE_PRECISION (TREE_TYPE (op0
))
7337 == TYPE_PRECISION (TREE_TYPE (arg0
)))
7338 && TREE_TYPE (op0
) != final_type
)
7339 unsigned0
= TYPE_UNSIGNED (TREE_TYPE (op0
));
7340 if ((TYPE_PRECISION (TREE_TYPE (op1
))
7341 == TYPE_PRECISION (TREE_TYPE (arg1
)))
7342 && TREE_TYPE (op1
) != final_type
)
7343 unsigned1
= TYPE_UNSIGNED (TREE_TYPE (op1
));
7345 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
7347 /* For bitwise operations, signedness of nominal type
7348 does not matter. Consider only how operands were extended. */
7352 /* Note that in all three cases below we refrain from optimizing
7353 an unsigned operation on sign-extended args.
7354 That would not be valid. */
7356 /* Both args variable: if both extended in same way
7357 from same width, do it in that width.
7358 Do it unsigned if args were zero-extended. */
7359 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
7360 < TYPE_PRECISION (result_type
))
7361 && (TYPE_PRECISION (TREE_TYPE (arg1
))
7362 == TYPE_PRECISION (TREE_TYPE (arg0
)))
7363 && unsigned0
== unsigned1
7364 && (unsigned0
|| !uns
))
7366 = c_common_signed_or_unsigned_type
7367 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
7368 else if (TREE_CODE (arg0
) == INTEGER_CST
7369 && (unsigned1
|| !uns
)
7370 && (TYPE_PRECISION (TREE_TYPE (arg1
))
7371 < TYPE_PRECISION (result_type
))
7373 = c_common_signed_or_unsigned_type (unsigned1
,
7375 int_fits_type_p (arg0
, type
)))
7377 else if (TREE_CODE (arg1
) == INTEGER_CST
7378 && (unsigned0
|| !uns
)
7379 && (TYPE_PRECISION (TREE_TYPE (arg0
))
7380 < TYPE_PRECISION (result_type
))
7382 = c_common_signed_or_unsigned_type (unsigned0
,
7384 int_fits_type_p (arg1
, type
)))
7388 /* Shifts can be shortened if shifting right. */
7393 tree arg0
= get_narrower (op0
, &unsigned_arg
);
7395 final_type
= result_type
;
7397 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
7398 unsigned_arg
= TYPE_UNSIGNED (TREE_TYPE (op0
));
7400 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
7401 /* We can shorten only if the shift count is less than the
7402 number of bits in the smaller type size. */
7403 && compare_tree_int (op1
, TYPE_PRECISION (TREE_TYPE (arg0
))) < 0
7404 /* We cannot drop an unsigned shift after sign-extension. */
7405 && (!TYPE_UNSIGNED (final_type
) || unsigned_arg
))
7407 /* Do an unsigned shift if the operand was zero-extended. */
7409 = c_common_signed_or_unsigned_type (unsigned_arg
,
7411 /* Convert value-to-be-shifted to that type. */
7412 if (TREE_TYPE (op0
) != result_type
)
7413 op0
= convert (result_type
, op0
);
7418 /* Comparison operations are shortened too but differently.
7419 They identify themselves by setting short_compare = 1. */
7423 /* Don't write &op0, etc., because that would prevent op0
7424 from being kept in a register.
7425 Instead, make copies of the our local variables and
7426 pass the copies by reference, then copy them back afterward. */
7427 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
7428 enum tree_code xresultcode
= resultcode
;
7430 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
7435 op0
= xop0
, op1
= xop1
;
7437 resultcode
= xresultcode
;
7439 if (warn_sign_compare
&& skip_evaluation
== 0)
7441 int op0_signed
= ! TYPE_UNSIGNED (TREE_TYPE (orig_op0
));
7442 int op1_signed
= ! TYPE_UNSIGNED (TREE_TYPE (orig_op1
));
7443 int unsignedp0
, unsignedp1
;
7444 tree primop0
= get_narrower (op0
, &unsignedp0
);
7445 tree primop1
= get_narrower (op1
, &unsignedp1
);
7449 STRIP_TYPE_NOPS (xop0
);
7450 STRIP_TYPE_NOPS (xop1
);
7452 /* Give warnings for comparisons between signed and unsigned
7453 quantities that may fail.
7455 Do the checking based on the original operand trees, so that
7456 casts will be considered, but default promotions won't be.
7458 Do not warn if the comparison is being done in a signed type,
7459 since the signed type will only be chosen if it can represent
7460 all the values of the unsigned type. */
7461 if (! TYPE_UNSIGNED (result_type
))
7463 /* Do not warn if both operands are the same signedness. */
7464 else if (op0_signed
== op1_signed
)
7471 sop
= xop0
, uop
= xop1
;
7473 sop
= xop1
, uop
= xop0
;
7475 /* Do not warn if the signed quantity is an
7476 unsuffixed integer literal (or some static
7477 constant expression involving such literals or a
7478 conditional expression involving such literals)
7479 and it is non-negative. */
7480 if (tree_expr_nonnegative_p (sop
))
7482 /* Do not warn if the comparison is an equality operation,
7483 the unsigned quantity is an integral constant, and it
7484 would fit in the result if the result were signed. */
7485 else if (TREE_CODE (uop
) == INTEGER_CST
7486 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
7488 (uop
, c_common_signed_type (result_type
)))
7490 /* Do not warn if the unsigned quantity is an enumeration
7491 constant and its maximum value would fit in the result
7492 if the result were signed. */
7493 else if (TREE_CODE (uop
) == INTEGER_CST
7494 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
7496 (TYPE_MAX_VALUE (TREE_TYPE(uop
)),
7497 c_common_signed_type (result_type
)))
7500 warning ("comparison between signed and unsigned");
7503 /* Warn if two unsigned values are being compared in a size
7504 larger than their original size, and one (and only one) is the
7505 result of a `~' operator. This comparison will always fail.
7507 Also warn if one operand is a constant, and the constant
7508 does not have all bits set that are set in the ~ operand
7509 when it is extended. */
7511 if ((TREE_CODE (primop0
) == BIT_NOT_EXPR
)
7512 != (TREE_CODE (primop1
) == BIT_NOT_EXPR
))
7514 if (TREE_CODE (primop0
) == BIT_NOT_EXPR
)
7515 primop0
= get_narrower (TREE_OPERAND (primop0
, 0),
7518 primop1
= get_narrower (TREE_OPERAND (primop1
, 0),
7521 if (host_integerp (primop0
, 0) || host_integerp (primop1
, 0))
7524 HOST_WIDE_INT constant
, mask
;
7525 int unsignedp
, bits
;
7527 if (host_integerp (primop0
, 0))
7530 unsignedp
= unsignedp1
;
7531 constant
= tree_low_cst (primop0
, 0);
7536 unsignedp
= unsignedp0
;
7537 constant
= tree_low_cst (primop1
, 0);
7540 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
7541 if (bits
< TYPE_PRECISION (result_type
)
7542 && bits
< HOST_BITS_PER_WIDE_INT
&& unsignedp
)
7544 mask
= (~ (HOST_WIDE_INT
) 0) << bits
;
7545 if ((mask
& constant
) != mask
)
7546 warning ("comparison of promoted ~unsigned with constant");
7549 else if (unsignedp0
&& unsignedp1
7550 && (TYPE_PRECISION (TREE_TYPE (primop0
))
7551 < TYPE_PRECISION (result_type
))
7552 && (TYPE_PRECISION (TREE_TYPE (primop1
))
7553 < TYPE_PRECISION (result_type
)))
7554 warning ("comparison of promoted ~unsigned with unsigned");
7560 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
7561 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
7562 Then the expression will be built.
7563 It will be given type FINAL_TYPE if that is nonzero;
7564 otherwise, it will be given type RESULT_TYPE. */
7568 binary_op_error (code
);
7569 return error_mark_node
;
7574 if (TREE_TYPE (op0
) != result_type
)
7575 op0
= convert (result_type
, op0
);
7576 if (TREE_TYPE (op1
) != result_type
)
7577 op1
= convert (result_type
, op1
);
7580 if (build_type
== NULL_TREE
)
7581 build_type
= result_type
;
7584 tree result
= build (resultcode
, build_type
, op0
, op1
);
7586 /* Treat expressions in initializers specially as they can't trap. */
7587 result
= require_constant_value
? fold_initializer (result
)
7590 if (final_type
!= 0)
7591 result
= convert (final_type
, result
);
7596 /* Build the result of __builtin_offsetof. TYPE is the first argument to
7597 offsetof, i.e. a type. LIST is a tree_list that encodes component and
7598 array references; PURPOSE is set for the former and VALUE is set for
7602 build_offsetof (tree type
, tree list
)
7606 /* Build "*(type *)0". */
7607 t
= convert (build_pointer_type (type
), null_pointer_node
);
7608 t
= build_indirect_ref (t
, "");
7610 /* Build COMPONENT and ARRAY_REF expressions as needed. */
7611 for (list
= nreverse (list
); list
; list
= TREE_CHAIN (list
))
7612 if (TREE_PURPOSE (list
))
7613 t
= build_component_ref (t
, TREE_PURPOSE (list
));
7615 t
= build_array_ref (t
, TREE_VALUE (list
));
7617 /* Finalize the offsetof expression. For now all we need to do is take
7618 the address of the expression we created, and cast that to an integer
7619 type; this mirrors the traditional macro implementation of offsetof. */
7620 t
= build_unary_op (ADDR_EXPR
, t
, 0);
7621 return convert (size_type_node
, t
);