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 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
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). */
46 /* Nonzero if we've already printed a "missing braces around initializer"
47 message within this initializer. */
48 static int missing_braces_mentioned
;
50 static tree qualify_type
PARAMS ((tree
, tree
));
51 static int comp_target_types
PARAMS ((tree
, tree
));
52 static int function_types_compatible_p
PARAMS ((tree
, tree
));
53 static int type_lists_compatible_p
PARAMS ((tree
, tree
));
54 static tree decl_constant_value
PARAMS ((tree
));
55 static tree lookup_field
PARAMS ((tree
, tree
, tree
*));
56 static tree convert_arguments
PARAMS ((tree
, tree
, tree
, tree
));
57 static tree pointer_int_sum
PARAMS ((enum tree_code
, tree
, tree
));
58 static tree pointer_diff
PARAMS ((tree
, tree
));
59 static tree unary_complex_lvalue
PARAMS ((enum tree_code
, tree
));
60 static void pedantic_lvalue_warning
PARAMS ((enum tree_code
));
61 static tree internal_build_compound_expr
PARAMS ((tree
, int));
62 static tree convert_for_assignment
PARAMS ((tree
, tree
, const char *,
64 static void warn_for_assignment
PARAMS ((const char *, const char *,
66 static tree valid_compound_expr_initializer
PARAMS ((tree
, tree
));
67 static void push_string
PARAMS ((const char *));
68 static void push_member_name
PARAMS ((tree
));
69 static void push_array_bounds
PARAMS ((int));
70 static int spelling_length
PARAMS ((void));
71 static char *print_spelling
PARAMS ((char *));
72 static void warning_init
PARAMS ((const char *));
73 static tree digest_init
PARAMS ((tree
, tree
, int, int));
74 static void check_init_type_bitfields
PARAMS ((tree
));
75 static void output_init_element
PARAMS ((tree
, tree
, tree
, int));
76 static void output_pending_init_elements
PARAMS ((int));
77 static void add_pending_init
PARAMS ((tree
, tree
));
78 static int pending_init_member
PARAMS ((tree
));
80 /* Do `exp = require_complete_type (exp);' to make sure exp
81 does not have an incomplete type. (That includes void types.) */
84 require_complete_type (value
)
87 tree type
= TREE_TYPE (value
);
89 if (TREE_CODE (value
) == ERROR_MARK
)
90 return error_mark_node
;
92 /* First, detect a valid value with a complete type. */
93 if (COMPLETE_TYPE_P (type
))
96 incomplete_type_error (value
, type
);
97 return error_mark_node
;
100 /* Print an error message for invalid use of an incomplete type.
101 VALUE is the expression that was used (or 0 if that isn't known)
102 and TYPE is the type that was invalid. */
105 incomplete_type_error (value
, type
)
109 const char *type_code_string
;
111 /* Avoid duplicate error message. */
112 if (TREE_CODE (type
) == ERROR_MARK
)
115 if (value
!= 0 && (TREE_CODE (value
) == VAR_DECL
116 || TREE_CODE (value
) == PARM_DECL
))
117 error ("`%s' has an incomplete type",
118 IDENTIFIER_POINTER (DECL_NAME (value
)));
122 /* We must print an error message. Be clever about what it says. */
124 switch (TREE_CODE (type
))
127 type_code_string
= "struct";
131 type_code_string
= "union";
135 type_code_string
= "enum";
139 error ("invalid use of void expression");
143 if (TYPE_DOMAIN (type
))
145 type
= TREE_TYPE (type
);
148 error ("invalid use of array with unspecified bounds");
155 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
156 error ("invalid use of undefined type `%s %s'",
157 type_code_string
, IDENTIFIER_POINTER (TYPE_NAME (type
)));
159 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
160 error ("invalid use of incomplete typedef `%s'",
161 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
))));
165 /* Return a variant of TYPE which has all the type qualifiers of LIKE
166 as well as those of TYPE. */
169 qualify_type (type
, like
)
172 return c_build_qualified_type (type
,
173 TYPE_QUALS (type
) | TYPE_QUALS (like
));
176 /* Return the common type of two types.
177 We assume that comptypes has already been done and returned 1;
178 if that isn't so, this may crash. In particular, we assume that qualifiers
181 This is the type for the result of most arithmetic operations
182 if the operands have the given two types. */
188 register enum tree_code code1
;
189 register enum tree_code code2
;
192 /* Save time if the two types are the same. */
194 if (t1
== t2
) return t1
;
196 /* If one type is nonsense, use the other. */
197 if (t1
== error_mark_node
)
199 if (t2
== error_mark_node
)
202 /* Merge the attributes. */
203 attributes
= merge_machine_type_attributes (t1
, t2
);
205 /* Treat an enum type as the unsigned integer type of the same width. */
207 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
208 t1
= type_for_size (TYPE_PRECISION (t1
), 1);
209 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
210 t2
= type_for_size (TYPE_PRECISION (t2
), 1);
212 code1
= TREE_CODE (t1
);
213 code2
= TREE_CODE (t2
);
215 /* If one type is complex, form the common type of the non-complex
216 components, then make that complex. Use T1 or T2 if it is the
218 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
220 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
221 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
222 tree subtype
= common_type (subtype1
, subtype2
);
224 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
225 return build_type_attribute_variant (t1
, attributes
);
226 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
227 return build_type_attribute_variant (t2
, attributes
);
229 return build_type_attribute_variant (build_complex_type (subtype
),
237 /* If only one is real, use it as the result. */
239 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
240 return build_type_attribute_variant (t1
, attributes
);
242 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
243 return build_type_attribute_variant (t2
, attributes
);
245 /* Both real or both integers; use the one with greater precision. */
247 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
248 return build_type_attribute_variant (t1
, attributes
);
249 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
250 return build_type_attribute_variant (t2
, attributes
);
252 /* Same precision. Prefer longs to ints even when same size. */
254 if (TYPE_MAIN_VARIANT (t1
) == long_unsigned_type_node
255 || TYPE_MAIN_VARIANT (t2
) == long_unsigned_type_node
)
256 return build_type_attribute_variant (long_unsigned_type_node
,
259 if (TYPE_MAIN_VARIANT (t1
) == long_integer_type_node
260 || TYPE_MAIN_VARIANT (t2
) == long_integer_type_node
)
262 /* But preserve unsignedness from the other type,
263 since long cannot hold all the values of an unsigned int. */
264 if (TREE_UNSIGNED (t1
) || TREE_UNSIGNED (t2
))
265 t1
= long_unsigned_type_node
;
267 t1
= long_integer_type_node
;
268 return build_type_attribute_variant (t1
, attributes
);
271 /* Likewise, prefer long double to double even if same size. */
272 if (TYPE_MAIN_VARIANT (t1
) == long_double_type_node
273 || TYPE_MAIN_VARIANT (t2
) == long_double_type_node
)
274 return build_type_attribute_variant (long_double_type_node
,
277 /* Otherwise prefer the unsigned one. */
279 if (TREE_UNSIGNED (t1
))
280 return build_type_attribute_variant (t1
, attributes
);
282 return build_type_attribute_variant (t2
, attributes
);
285 /* For two pointers, do this recursively on the target type,
286 and combine the qualifiers of the two types' targets. */
287 /* This code was turned off; I don't know why.
288 But ANSI C specifies doing this with the qualifiers.
289 So I turned it on again. */
291 tree pointed_to_1
= TREE_TYPE (t1
);
292 tree pointed_to_2
= TREE_TYPE (t2
);
293 tree target
= common_type (TYPE_MAIN_VARIANT (pointed_to_1
),
294 TYPE_MAIN_VARIANT (pointed_to_2
));
295 t1
= build_pointer_type (c_build_qualified_type
297 TYPE_QUALS (pointed_to_1
) |
298 TYPE_QUALS (pointed_to_2
)));
299 return build_type_attribute_variant (t1
, attributes
);
302 t1
= build_pointer_type (common_type (TREE_TYPE (t1
), TREE_TYPE (t2
)));
303 return build_type_attribute_variant (t1
, attributes
);
308 tree elt
= common_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
309 /* Save space: see if the result is identical to one of the args. */
310 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
311 return build_type_attribute_variant (t1
, attributes
);
312 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
313 return build_type_attribute_variant (t2
, attributes
);
314 /* Merge the element types, and have a size if either arg has one. */
315 t1
= build_array_type (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
316 return build_type_attribute_variant (t1
, attributes
);
320 /* Function types: prefer the one that specified arg types.
321 If both do, merge the arg types. Also merge the return types. */
323 tree valtype
= common_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
324 tree p1
= TYPE_ARG_TYPES (t1
);
325 tree p2
= TYPE_ARG_TYPES (t2
);
330 /* Save space: see if the result is identical to one of the args. */
331 if (valtype
== TREE_TYPE (t1
) && ! TYPE_ARG_TYPES (t2
))
332 return build_type_attribute_variant (t1
, attributes
);
333 if (valtype
== TREE_TYPE (t2
) && ! TYPE_ARG_TYPES (t1
))
334 return build_type_attribute_variant (t2
, attributes
);
336 /* Simple way if one arg fails to specify argument types. */
337 if (TYPE_ARG_TYPES (t1
) == 0)
339 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t2
));
340 return build_type_attribute_variant (t1
, attributes
);
342 if (TYPE_ARG_TYPES (t2
) == 0)
344 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t1
));
345 return build_type_attribute_variant (t1
, attributes
);
348 /* If both args specify argument types, we must merge the two
349 lists, argument by argument. */
351 len
= list_length (p1
);
354 for (i
= 0; i
< len
; i
++)
355 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
360 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
))
362 /* A null type means arg type is not specified.
363 Take whatever the other function type has. */
364 if (TREE_VALUE (p1
) == 0)
366 TREE_VALUE (n
) = TREE_VALUE (p2
);
369 if (TREE_VALUE (p2
) == 0)
371 TREE_VALUE (n
) = TREE_VALUE (p1
);
375 /* Given wait (union {union wait *u; int *i} *)
376 and wait (union wait *),
377 prefer union wait * as type of parm. */
378 if (TREE_CODE (TREE_VALUE (p1
)) == UNION_TYPE
379 && TREE_VALUE (p1
) != TREE_VALUE (p2
))
382 for (memb
= TYPE_FIELDS (TREE_VALUE (p1
));
383 memb
; memb
= TREE_CHAIN (memb
))
384 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (p2
)))
386 TREE_VALUE (n
) = TREE_VALUE (p2
);
388 pedwarn ("function types not truly compatible in ANSI C");
392 if (TREE_CODE (TREE_VALUE (p2
)) == UNION_TYPE
393 && TREE_VALUE (p2
) != TREE_VALUE (p1
))
396 for (memb
= TYPE_FIELDS (TREE_VALUE (p2
));
397 memb
; memb
= TREE_CHAIN (memb
))
398 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (p1
)))
400 TREE_VALUE (n
) = TREE_VALUE (p1
);
402 pedwarn ("function types not truly compatible in ANSI C");
406 TREE_VALUE (n
) = common_type (TREE_VALUE (p1
), TREE_VALUE (p2
));
410 t1
= build_function_type (valtype
, newargs
);
411 /* ... falls through ... */
415 return build_type_attribute_variant (t1
, attributes
);
420 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
421 or various other operations. Return 2 if they are compatible
422 but a warning may be needed if you use them together. */
425 comptypes (type1
, type2
)
428 register tree t1
= type1
;
429 register tree t2
= type2
;
432 /* Suppress errors caused by previously reported errors. */
434 if (t1
== t2
|| !t1
|| !t2
435 || TREE_CODE (t1
) == ERROR_MARK
|| TREE_CODE (t2
) == ERROR_MARK
)
438 /* If either type is the internal version of sizetype, return the
440 if (TREE_CODE (t1
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t1
)
441 && TYPE_DOMAIN (t1
) != 0)
442 t1
= TYPE_DOMAIN (t1
);
444 if (TREE_CODE (t2
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t2
)
445 && TYPE_DOMAIN (t2
) != 0)
446 t2
= TYPE_DOMAIN (t2
);
448 /* Treat an enum type as the integer type of the same width and
451 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
452 t1
= type_for_size (TYPE_PRECISION (t1
), TREE_UNSIGNED (t1
));
453 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
454 t2
= type_for_size (TYPE_PRECISION (t2
), TREE_UNSIGNED (t2
));
459 /* Different classes of types can't be compatible. */
461 if (TREE_CODE (t1
) != TREE_CODE (t2
)) return 0;
463 /* Qualifiers must match. */
465 if (TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
468 /* Allow for two different type nodes which have essentially the same
469 definition. Note that we already checked for equality of the type
470 qualifiers (just above). */
472 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
475 #ifndef COMP_TYPE_ATTRIBUTES
476 #define COMP_TYPE_ATTRIBUTES(t1,t2) 1
479 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
480 if (! (attrval
= COMP_TYPE_ATTRIBUTES (t1
, t2
)))
483 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
486 switch (TREE_CODE (t1
))
489 val
= (TREE_TYPE (t1
) == TREE_TYPE (t2
)
490 ? 1 : comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
)));
494 val
= function_types_compatible_p (t1
, t2
);
499 tree d1
= TYPE_DOMAIN (t1
);
500 tree d2
= TYPE_DOMAIN (t2
);
503 /* Target types must match incl. qualifiers. */
504 if (TREE_TYPE (t1
) != TREE_TYPE (t2
)
505 && 0 == (val
= comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
))))
508 /* Sizes must match unless one is missing or variable. */
509 if (d1
== 0 || d2
== 0 || d1
== d2
510 || TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
511 || TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
512 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
513 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
)
516 if (! tree_int_cst_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
))
517 || ! tree_int_cst_equal (TYPE_MAX_VALUE (d1
), TYPE_MAX_VALUE (d2
)))
524 if (maybe_objc_comptypes (t1
, t2
, 0) == 1)
531 return attrval
== 2 && val
== 1 ? 2 : val
;
534 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
535 ignoring their qualifiers. */
538 comp_target_types (ttl
, ttr
)
543 /* Give maybe_objc_comptypes a crack at letting these types through. */
544 if ((val
= maybe_objc_comptypes (ttl
, ttr
, 1)) >= 0)
547 val
= comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ttl
)),
548 TYPE_MAIN_VARIANT (TREE_TYPE (ttr
)));
550 if (val
== 2 && pedantic
)
551 pedwarn ("types are not quite compatible");
555 /* Subroutines of `comptypes'. */
557 /* Return 1 if two function types F1 and F2 are compatible.
558 If either type specifies no argument types,
559 the other must specify a fixed number of self-promoting arg types.
560 Otherwise, if one type specifies only the number of arguments,
561 the other must specify that number of self-promoting arg types.
562 Otherwise, the argument types must match. */
565 function_types_compatible_p (f1
, f2
)
569 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
573 if (!(TREE_TYPE (f1
) == TREE_TYPE (f2
)
574 || (val
= comptypes (TREE_TYPE (f1
), TREE_TYPE (f2
)))))
577 args1
= TYPE_ARG_TYPES (f1
);
578 args2
= TYPE_ARG_TYPES (f2
);
580 /* An unspecified parmlist matches any specified parmlist
581 whose argument types don't need default promotions. */
585 if (!self_promoting_args_p (args2
))
587 /* If one of these types comes from a non-prototype fn definition,
588 compare that with the other type's arglist.
589 If they don't match, ask for a warning (but no error). */
590 if (TYPE_ACTUAL_ARG_TYPES (f1
)
591 && 1 != type_lists_compatible_p (args2
, TYPE_ACTUAL_ARG_TYPES (f1
)))
597 if (!self_promoting_args_p (args1
))
599 if (TYPE_ACTUAL_ARG_TYPES (f2
)
600 && 1 != type_lists_compatible_p (args1
, TYPE_ACTUAL_ARG_TYPES (f2
)))
605 /* Both types have argument lists: compare them and propagate results. */
606 val1
= type_lists_compatible_p (args1
, args2
);
607 return val1
!= 1 ? val1
: val
;
610 /* Check two lists of types for compatibility,
611 returning 0 for incompatible, 1 for compatible,
612 or 2 for compatible with warning. */
615 type_lists_compatible_p (args1
, args2
)
618 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
624 if (args1
== 0 && args2
== 0)
626 /* If one list is shorter than the other,
627 they fail to match. */
628 if (args1
== 0 || args2
== 0)
630 /* A null pointer instead of a type
631 means there is supposed to be an argument
632 but nothing is specified about what type it has.
633 So match anything that self-promotes. */
634 if (TREE_VALUE (args1
) == 0)
636 if (simple_type_promotes_to (TREE_VALUE (args2
)) != NULL_TREE
)
639 else if (TREE_VALUE (args2
) == 0)
641 if (simple_type_promotes_to (TREE_VALUE (args1
)) != NULL_TREE
)
644 else if (! (newval
= comptypes (TREE_VALUE (args1
), TREE_VALUE (args2
))))
646 /* Allow wait (union {union wait *u; int *i} *)
647 and wait (union wait *) to be compatible. */
648 if (TREE_CODE (TREE_VALUE (args1
)) == UNION_TYPE
649 && (TYPE_NAME (TREE_VALUE (args1
)) == 0
650 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args1
)))
651 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args1
))) == INTEGER_CST
652 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args1
)),
653 TYPE_SIZE (TREE_VALUE (args2
))))
656 for (memb
= TYPE_FIELDS (TREE_VALUE (args1
));
657 memb
; memb
= TREE_CHAIN (memb
))
658 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (args2
)))
663 else if (TREE_CODE (TREE_VALUE (args2
)) == UNION_TYPE
664 && (TYPE_NAME (TREE_VALUE (args2
)) == 0
665 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args2
)))
666 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args2
))) == INTEGER_CST
667 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args2
)),
668 TYPE_SIZE (TREE_VALUE (args1
))))
671 for (memb
= TYPE_FIELDS (TREE_VALUE (args2
));
672 memb
; memb
= TREE_CHAIN (memb
))
673 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (args1
)))
682 /* comptypes said ok, but record if it said to warn. */
686 args1
= TREE_CHAIN (args1
);
687 args2
= TREE_CHAIN (args2
);
691 /* Compute the value of the `sizeof' operator. */
697 enum tree_code code
= TREE_CODE (type
);
699 if (code
== FUNCTION_TYPE
)
701 if (pedantic
|| warn_pointer_arith
)
702 pedwarn ("sizeof applied to a function type");
703 return size_one_node
;
705 if (code
== VOID_TYPE
)
707 if (pedantic
|| warn_pointer_arith
)
708 pedwarn ("sizeof applied to a void type");
709 return size_one_node
;
712 if (code
== ERROR_MARK
)
713 return size_one_node
;
715 if (!COMPLETE_TYPE_P (type
))
717 error ("sizeof applied to an incomplete type");
718 return size_zero_node
;
721 /* Convert in case a char is more than one unit. */
722 return size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
723 size_int (TYPE_PRECISION (char_type_node
)
728 c_sizeof_nowarn (type
)
731 enum tree_code code
= TREE_CODE (type
);
733 if (code
== FUNCTION_TYPE
|| code
== VOID_TYPE
|| code
== ERROR_MARK
)
734 return size_one_node
;
736 if (!COMPLETE_TYPE_P (type
))
737 return size_zero_node
;
739 /* Convert in case a char is more than one unit. */
740 return size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
741 size_int (TYPE_PRECISION (char_type_node
)
745 /* Compute the size to increment a pointer by. */
748 c_size_in_bytes (type
)
751 enum tree_code code
= TREE_CODE (type
);
753 if (code
== FUNCTION_TYPE
|| code
== VOID_TYPE
|| code
== ERROR_MARK
)
754 return size_one_node
;
756 if (!COMPLETE_OR_VOID_TYPE_P (type
))
758 error ("arithmetic on pointer to an incomplete type");
759 return size_one_node
;
762 /* Convert in case a char is more than one unit. */
763 return size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
764 size_int (TYPE_PRECISION (char_type_node
)
768 /* Implement the __alignof keyword: Return the minimum required
769 alignment of TYPE, measured in bytes. */
775 enum tree_code code
= TREE_CODE (type
);
777 if (code
== FUNCTION_TYPE
)
778 return size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
780 if (code
== VOID_TYPE
|| code
== ERROR_MARK
)
781 return size_one_node
;
783 if (!COMPLETE_TYPE_P (type
))
785 error ("__alignof__ applied to an incomplete type");
786 return size_zero_node
;
789 return size_int (TYPE_ALIGN (type
) / BITS_PER_UNIT
);
792 /* Implement the __alignof keyword: Return the minimum required
793 alignment of EXPR, measured in bytes. For VAR_DECL's and
794 FIELD_DECL's return DECL_ALIGN (which can be set from an
795 "aligned" __attribute__ specification). */
798 c_alignof_expr (expr
)
801 if (TREE_CODE (expr
) == VAR_DECL
)
802 return size_int (DECL_ALIGN (expr
) / BITS_PER_UNIT
);
804 if (TREE_CODE (expr
) == COMPONENT_REF
805 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
807 error ("`__alignof' applied to a bit-field");
808 return size_one_node
;
810 else if (TREE_CODE (expr
) == COMPONENT_REF
811 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
812 return size_int (DECL_ALIGN (TREE_OPERAND (expr
, 1)) / BITS_PER_UNIT
);
814 if (TREE_CODE (expr
) == INDIRECT_REF
)
816 tree t
= TREE_OPERAND (expr
, 0);
818 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
820 while (TREE_CODE (t
) == NOP_EXPR
821 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
825 t
= TREE_OPERAND (t
, 0);
826 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
827 if (thisalign
> bestalign
)
828 best
= t
, bestalign
= thisalign
;
830 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
833 return c_alignof (TREE_TYPE (expr
));
836 /* Return either DECL or its known constant value (if it has one). */
839 decl_constant_value (decl
)
842 if (/* Don't change a variable array bound or initial value to a constant
843 in a place where a variable is invalid. */
844 current_function_decl
!= 0
846 && ! TREE_THIS_VOLATILE (decl
)
847 && TREE_READONLY (decl
) && ! ITERATOR_P (decl
)
848 && DECL_INITIAL (decl
) != 0
849 && TREE_CODE (DECL_INITIAL (decl
)) != ERROR_MARK
850 /* This is invalid if initial value is not constant.
851 If it has either a function call, a memory reference,
852 or a variable, then re-evaluating it could give different results. */
853 && TREE_CONSTANT (DECL_INITIAL (decl
))
854 /* Check for cases where this is sub-optimal, even though valid. */
855 && TREE_CODE (DECL_INITIAL (decl
)) != CONSTRUCTOR
856 && DECL_MODE (decl
) != BLKmode
)
857 return DECL_INITIAL (decl
);
861 /* Perform default promotions for C data used in expressions.
862 Arrays and functions are converted to pointers;
863 enumeral types or short or char, to int.
864 In addition, manifest constants symbols are replaced by their values. */
867 default_conversion (exp
)
870 register tree type
= TREE_TYPE (exp
);
871 register enum tree_code code
= TREE_CODE (type
);
873 /* Constants can be used directly unless they're not loadable. */
874 if (TREE_CODE (exp
) == CONST_DECL
)
875 exp
= DECL_INITIAL (exp
);
877 /* Replace a nonvolatile const static variable with its value unless
878 it is an array, in which case we must be sure that taking the
879 address of the array produces consistent results. */
880 else if (optimize
&& TREE_CODE (exp
) == VAR_DECL
&& code
!= ARRAY_TYPE
)
882 exp
= decl_constant_value (exp
);
883 type
= TREE_TYPE (exp
);
886 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
889 Do not use STRIP_NOPS here! It will remove conversions from pointer
890 to integer and cause infinite recursion. */
891 while (TREE_CODE (exp
) == NON_LVALUE_EXPR
892 || (TREE_CODE (exp
) == NOP_EXPR
893 && TREE_TYPE (TREE_OPERAND (exp
, 0)) == TREE_TYPE (exp
)))
894 exp
= TREE_OPERAND (exp
, 0);
896 /* Normally convert enums to int,
897 but convert wide enums to something wider. */
898 if (code
== ENUMERAL_TYPE
)
900 type
= type_for_size (MAX (TYPE_PRECISION (type
),
901 TYPE_PRECISION (integer_type_node
)),
903 || (TYPE_PRECISION (type
)
904 >= TYPE_PRECISION (integer_type_node
)))
905 && TREE_UNSIGNED (type
)));
907 return convert (type
, exp
);
910 if (TREE_CODE (exp
) == COMPONENT_REF
911 && DECL_C_BIT_FIELD (TREE_OPERAND (exp
, 1))
912 /* If it's thinner than an int, promote it like a
913 C_PROMOTING_INTEGER_TYPE_P, otherwise leave it alone. */
914 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp
, 1)),
915 TYPE_PRECISION (integer_type_node
)))
916 return convert (flag_traditional
&& TREE_UNSIGNED (type
)
917 ? unsigned_type_node
: integer_type_node
,
920 if (C_PROMOTING_INTEGER_TYPE_P (type
))
922 /* Traditionally, unsignedness is preserved in default promotions.
923 Also preserve unsignedness if not really getting any wider. */
924 if (TREE_UNSIGNED (type
)
926 || TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
)))
927 return convert (unsigned_type_node
, exp
);
929 return convert (integer_type_node
, exp
);
932 if (flag_traditional
&& !flag_allow_single_precision
933 && TYPE_MAIN_VARIANT (type
) == float_type_node
)
934 return convert (double_type_node
, exp
);
936 if (code
== VOID_TYPE
)
938 error ("void value not ignored as it ought to be");
939 return error_mark_node
;
941 if (code
== FUNCTION_TYPE
)
943 return build_unary_op (ADDR_EXPR
, exp
, 0);
945 if (code
== ARRAY_TYPE
)
948 tree restype
= TREE_TYPE (type
);
953 if (TREE_CODE_CLASS (TREE_CODE (exp
)) == 'r' || DECL_P (exp
))
955 constp
= TREE_READONLY (exp
);
956 volatilep
= TREE_THIS_VOLATILE (exp
);
959 if (TYPE_QUALS (type
) || constp
|| volatilep
)
961 = c_build_qualified_type (restype
,
963 | (constp
* TYPE_QUAL_CONST
)
964 | (volatilep
* TYPE_QUAL_VOLATILE
));
966 if (TREE_CODE (exp
) == INDIRECT_REF
)
967 return convert (TYPE_POINTER_TO (restype
),
968 TREE_OPERAND (exp
, 0));
970 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
972 tree op1
= default_conversion (TREE_OPERAND (exp
, 1));
973 return build (COMPOUND_EXPR
, TREE_TYPE (op1
),
974 TREE_OPERAND (exp
, 0), op1
);
978 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
980 error ("invalid use of non-lvalue array");
981 return error_mark_node
;
984 ptrtype
= build_pointer_type (restype
);
986 if (TREE_CODE (exp
) == VAR_DECL
)
988 /* ??? This is not really quite correct
989 in that the type of the operand of ADDR_EXPR
990 is not the target type of the type of the ADDR_EXPR itself.
991 Question is, can this lossage be avoided? */
992 adr
= build1 (ADDR_EXPR
, ptrtype
, exp
);
993 if (mark_addressable (exp
) == 0)
994 return error_mark_node
;
995 TREE_CONSTANT (adr
) = staticp (exp
);
996 TREE_SIDE_EFFECTS (adr
) = 0; /* Default would be, same as EXP. */
999 /* This way is better for a COMPONENT_REF since it can
1000 simplify the offset for a component. */
1001 adr
= build_unary_op (ADDR_EXPR
, exp
, 1);
1002 return convert (ptrtype
, adr
);
1007 /* Look up component name in the structure type definition.
1009 If this component name is found indirectly within an anonymous union,
1010 store in *INDIRECT the component which directly contains
1011 that anonymous union. Otherwise, set *INDIRECT to 0. */
1014 lookup_field (type
, component
, indirect
)
1015 tree type
, component
;
1020 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1021 to the field elements. Use a binary search on this array to quickly
1022 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1023 will always be set for structures which have many elements. */
1025 if (TYPE_LANG_SPECIFIC (type
))
1028 tree
*field_array
= &TYPE_LANG_SPECIFIC (type
)->elts
[0];
1030 field
= TYPE_FIELDS (type
);
1032 top
= TYPE_LANG_SPECIFIC (type
)->len
;
1033 while (top
- bot
> 1)
1035 half
= (top
- bot
+ 1) >> 1;
1036 field
= field_array
[bot
+half
];
1038 if (DECL_NAME (field
) == NULL_TREE
)
1040 /* Step through all anon unions in linear fashion. */
1041 while (DECL_NAME (field_array
[bot
]) == NULL_TREE
)
1043 tree anon
= 0, junk
;
1045 field
= field_array
[bot
++];
1046 if (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
1047 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
1048 anon
= lookup_field (TREE_TYPE (field
), component
, &junk
);
1050 if (anon
!= NULL_TREE
)
1057 /* Entire record is only anon unions. */
1061 /* Restart the binary search, with new lower bound. */
1065 if (DECL_NAME (field
) == component
)
1067 if (DECL_NAME (field
) < component
)
1073 if (DECL_NAME (field_array
[bot
]) == component
)
1074 field
= field_array
[bot
];
1075 else if (DECL_NAME (field
) != component
)
1080 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1082 if (DECL_NAME (field
) == NULL_TREE
)
1087 if (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
1088 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
1089 anon
= lookup_field (TREE_TYPE (field
), component
, &junk
);
1091 if (anon
!= NULL_TREE
)
1098 if (DECL_NAME (field
) == component
)
1103 *indirect
= NULL_TREE
;
1107 /* Make an expression to refer to the COMPONENT field of
1108 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1111 build_component_ref (datum
, component
)
1112 tree datum
, component
;
1114 register tree type
= TREE_TYPE (datum
);
1115 register enum tree_code code
= TREE_CODE (type
);
1116 register tree field
= NULL
;
1119 /* If DATUM is a COMPOUND_EXPR or COND_EXPR, move our reference inside it
1120 unless we are not to support things not strictly ANSI. */
1121 switch (TREE_CODE (datum
))
1125 tree value
= build_component_ref (TREE_OPERAND (datum
, 1), component
);
1126 return build (COMPOUND_EXPR
, TREE_TYPE (value
),
1127 TREE_OPERAND (datum
, 0), value
);
1130 return build_conditional_expr
1131 (TREE_OPERAND (datum
, 0),
1132 build_component_ref (TREE_OPERAND (datum
, 1), component
),
1133 build_component_ref (TREE_OPERAND (datum
, 2), component
));
1139 /* See if there is a field or component with name COMPONENT. */
1141 if (code
== RECORD_TYPE
|| code
== UNION_TYPE
)
1145 if (!COMPLETE_TYPE_P (type
))
1147 incomplete_type_error (NULL_TREE
, type
);
1148 return error_mark_node
;
1151 field
= lookup_field (type
, component
, &indirect
);
1155 error ("%s has no member named `%s'",
1156 code
== RECORD_TYPE
? "structure" : "union",
1157 IDENTIFIER_POINTER (component
));
1158 return error_mark_node
;
1160 if (TREE_TYPE (field
) == error_mark_node
)
1161 return error_mark_node
;
1163 /* If FIELD was found buried within an anonymous union,
1164 make one COMPONENT_REF to get that anonymous union,
1165 then fall thru to make a second COMPONENT_REF to get FIELD. */
1168 ref
= build (COMPONENT_REF
, TREE_TYPE (indirect
), datum
, indirect
);
1169 if (TREE_READONLY (datum
) || TREE_READONLY (indirect
))
1170 TREE_READONLY (ref
) = 1;
1171 if (TREE_THIS_VOLATILE (datum
) || TREE_THIS_VOLATILE (indirect
))
1172 TREE_THIS_VOLATILE (ref
) = 1;
1176 ref
= build (COMPONENT_REF
, TREE_TYPE (field
), datum
, field
);
1178 if (TREE_READONLY (datum
) || TREE_READONLY (field
))
1179 TREE_READONLY (ref
) = 1;
1180 if (TREE_THIS_VOLATILE (datum
) || TREE_THIS_VOLATILE (field
))
1181 TREE_THIS_VOLATILE (ref
) = 1;
1185 else if (code
!= ERROR_MARK
)
1186 error ("request for member `%s' in something not a structure or union",
1187 IDENTIFIER_POINTER (component
));
1189 return error_mark_node
;
1192 /* Given an expression PTR for a pointer, return an expression
1193 for the value pointed to.
1194 ERRORSTRING is the name of the operator to appear in error messages. */
1197 build_indirect_ref (ptr
, errorstring
)
1199 const char *errorstring
;
1201 register tree pointer
= default_conversion (ptr
);
1202 register tree type
= TREE_TYPE (pointer
);
1204 if (TREE_CODE (type
) == POINTER_TYPE
)
1206 if (TREE_CODE (pointer
) == ADDR_EXPR
1208 && (TREE_TYPE (TREE_OPERAND (pointer
, 0))
1209 == TREE_TYPE (type
)))
1210 return TREE_OPERAND (pointer
, 0);
1213 tree t
= TREE_TYPE (type
);
1214 register tree ref
= build1 (INDIRECT_REF
,
1215 TYPE_MAIN_VARIANT (t
), pointer
);
1217 if (!COMPLETE_TYPE_P (t
) && TREE_CODE (t
) != ARRAY_TYPE
)
1219 error ("dereferencing pointer to incomplete type");
1220 return error_mark_node
;
1222 if (TREE_CODE (t
) == VOID_TYPE
&& skip_evaluation
== 0)
1223 warning ("dereferencing `void *' pointer");
1225 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1226 so that we get the proper error message if the result is used
1227 to assign to. Also, &* is supposed to be a no-op.
1228 And ANSI C seems to specify that the type of the result
1229 should be the const type. */
1230 /* A de-reference of a pointer to const is not a const. It is valid
1231 to change it via some other pointer. */
1232 TREE_READONLY (ref
) = TYPE_READONLY (t
);
1233 TREE_SIDE_EFFECTS (ref
)
1234 = TYPE_VOLATILE (t
) || TREE_SIDE_EFFECTS (pointer
) || flag_volatile
;
1235 TREE_THIS_VOLATILE (ref
) = TYPE_VOLATILE (t
);
1239 else if (TREE_CODE (pointer
) != ERROR_MARK
)
1240 error ("invalid type argument of `%s'", errorstring
);
1241 return error_mark_node
;
1244 /* This handles expressions of the form "a[i]", which denotes
1247 This is logically equivalent in C to *(a+i), but we may do it differently.
1248 If A is a variable or a member, we generate a primitive ARRAY_REF.
1249 This avoids forcing the array out of registers, and can work on
1250 arrays that are not lvalues (for example, members of structures returned
1254 build_array_ref (array
, index
)
1259 error ("subscript missing in array reference");
1260 return error_mark_node
;
1263 if (TREE_TYPE (array
) == error_mark_node
1264 || TREE_TYPE (index
) == error_mark_node
)
1265 return error_mark_node
;
1267 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
1268 && TREE_CODE (array
) != INDIRECT_REF
)
1272 /* Subscripting with type char is likely to lose
1273 on a machine where chars are signed.
1274 So warn on any machine, but optionally.
1275 Don't warn for unsigned char since that type is safe.
1276 Don't warn for signed char because anyone who uses that
1277 must have done so deliberately. */
1278 if (warn_char_subscripts
1279 && TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
)
1280 warning ("array subscript has type `char'");
1282 /* Apply default promotions *after* noticing character types. */
1283 index
= default_conversion (index
);
1285 /* Require integer *after* promotion, for sake of enums. */
1286 if (TREE_CODE (TREE_TYPE (index
)) != INTEGER_TYPE
)
1288 error ("array subscript is not an integer");
1289 return error_mark_node
;
1292 /* An array that is indexed by a non-constant
1293 cannot be stored in a register; we must be able to do
1294 address arithmetic on its address.
1295 Likewise an array of elements of variable size. */
1296 if (TREE_CODE (index
) != INTEGER_CST
1297 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
1298 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
)))) != INTEGER_CST
))
1300 if (mark_addressable (array
) == 0)
1301 return error_mark_node
;
1303 /* An array that is indexed by a constant value which is not within
1304 the array bounds cannot be stored in a register either; because we
1305 would get a crash in store_bit_field/extract_bit_field when trying
1306 to access a non-existent part of the register. */
1307 if (TREE_CODE (index
) == INTEGER_CST
1308 && TYPE_VALUES (TREE_TYPE (array
))
1309 && ! int_fits_type_p (index
, TYPE_VALUES (TREE_TYPE (array
))))
1311 if (mark_addressable (array
) == 0)
1312 return error_mark_node
;
1315 if (pedantic
&& !lvalue_p (array
))
1317 if (DECL_REGISTER (array
))
1318 pedwarn ("ANSI C forbids subscripting `register' array");
1320 pedwarn ("ANSI C forbids subscripting non-lvalue array");
1326 while (TREE_CODE (foo
) == COMPONENT_REF
)
1327 foo
= TREE_OPERAND (foo
, 0);
1328 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
))
1329 pedwarn ("ANSI C forbids subscripting non-lvalue array");
1332 type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array
)));
1333 rval
= build (ARRAY_REF
, type
, array
, index
);
1334 /* Array ref is const/volatile if the array elements are
1335 or if the array is. */
1336 TREE_READONLY (rval
)
1337 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array
)))
1338 | TREE_READONLY (array
));
1339 TREE_SIDE_EFFECTS (rval
)
1340 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
1341 | TREE_SIDE_EFFECTS (array
));
1342 TREE_THIS_VOLATILE (rval
)
1343 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
1344 /* This was added by rms on 16 Nov 91.
1345 It fixes vol struct foo *a; a->elts[1]
1346 in an inline function.
1347 Hope it doesn't break something else. */
1348 | TREE_THIS_VOLATILE (array
));
1349 return require_complete_type (fold (rval
));
1353 tree ar
= default_conversion (array
);
1354 tree ind
= default_conversion (index
);
1356 /* Do the same warning check as above, but only on the part that's
1357 syntactically the index and only if it is also semantically
1359 if (warn_char_subscripts
1360 && TREE_CODE (TREE_TYPE (index
)) == INTEGER_TYPE
1361 && TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
)
1362 warning ("subscript has type `char'");
1364 /* Put the integer in IND to simplify error checking. */
1365 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
1372 if (ar
== error_mark_node
)
1375 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
1376 || TREE_CODE (TREE_TYPE (TREE_TYPE (ar
))) == FUNCTION_TYPE
)
1378 error ("subscripted value is neither array nor pointer");
1379 return error_mark_node
;
1381 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
1383 error ("array subscript is not an integer");
1384 return error_mark_node
;
1387 return build_indirect_ref (build_binary_op (PLUS_EXPR
, ar
, ind
, 0),
1392 /* Build a function call to function FUNCTION with parameters PARAMS.
1393 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1394 TREE_VALUE of each node is a parameter-expression.
1395 FUNCTION's data type may be a function type or a pointer-to-function. */
1398 build_function_call (function
, params
)
1399 tree function
, params
;
1401 register tree fntype
, fundecl
= 0;
1402 register tree coerced_params
;
1403 tree name
= NULL_TREE
, assembler_name
= NULL_TREE
, result
;
1405 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1406 STRIP_TYPE_NOPS (function
);
1408 /* Convert anything with function type to a pointer-to-function. */
1409 if (TREE_CODE (function
) == FUNCTION_DECL
)
1411 name
= DECL_NAME (function
);
1412 assembler_name
= DECL_ASSEMBLER_NAME (function
);
1414 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1415 (because calling an inline function does not mean the function
1416 needs to be separately compiled). */
1417 fntype
= build_type_variant (TREE_TYPE (function
),
1418 TREE_READONLY (function
),
1419 TREE_THIS_VOLATILE (function
));
1421 function
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), function
);
1424 function
= default_conversion (function
);
1426 fntype
= TREE_TYPE (function
);
1428 if (TREE_CODE (fntype
) == ERROR_MARK
)
1429 return error_mark_node
;
1431 if (!(TREE_CODE (fntype
) == POINTER_TYPE
1432 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
))
1434 error ("called object is not a function");
1435 return error_mark_node
;
1438 /* fntype now gets the type of function pointed to. */
1439 fntype
= TREE_TYPE (fntype
);
1441 /* Convert the parameters to the types declared in the
1442 function prototype, or apply default promotions. */
1445 = convert_arguments (TYPE_ARG_TYPES (fntype
), params
, name
, fundecl
);
1447 /* Check for errors in format strings. */
1449 if (warn_format
&& (name
|| assembler_name
))
1450 check_function_format (name
, assembler_name
, coerced_params
);
1452 /* Recognize certain built-in functions so we can make tree-codes
1453 other than CALL_EXPR. We do this when it enables fold-const.c
1454 to do something useful. */
1456 if (TREE_CODE (function
) == ADDR_EXPR
1457 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
1458 && DECL_BUILT_IN (TREE_OPERAND (function
, 0)))
1460 result
= expand_tree_builtin (TREE_OPERAND (function
, 0),
1461 params
, coerced_params
);
1466 result
= build (CALL_EXPR
, TREE_TYPE (fntype
),
1467 function
, coerced_params
, NULL_TREE
);
1469 TREE_SIDE_EFFECTS (result
) = 1;
1470 if (TREE_TYPE (result
) == void_type_node
)
1472 return require_complete_type (result
);
1475 /* Convert the argument expressions in the list VALUES
1476 to the types in the list TYPELIST. The result is a list of converted
1477 argument expressions.
1479 If TYPELIST is exhausted, or when an element has NULL as its type,
1480 perform the default conversions.
1482 PARMLIST is the chain of parm decls for the function being called.
1483 It may be 0, if that info is not available.
1484 It is used only for generating error messages.
1486 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1488 This is also where warnings about wrong number of args are generated.
1490 Both VALUES and the returned value are chains of TREE_LIST nodes
1491 with the elements of the list in the TREE_VALUE slots of those nodes. */
1494 convert_arguments (typelist
, values
, name
, fundecl
)
1495 tree typelist
, values
, name
, fundecl
;
1497 register tree typetail
, valtail
;
1498 register tree result
= NULL
;
1501 /* Scan the given expressions and types, producing individual
1502 converted arguments and pushing them on RESULT in reverse order. */
1504 for (valtail
= values
, typetail
= typelist
, parmnum
= 0;
1506 valtail
= TREE_CHAIN (valtail
), parmnum
++)
1508 register tree type
= typetail
? TREE_VALUE (typetail
) : 0;
1509 register tree val
= TREE_VALUE (valtail
);
1511 if (type
== void_type_node
)
1514 error ("too many arguments to function `%s'",
1515 IDENTIFIER_POINTER (name
));
1517 error ("too many arguments to function");
1521 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1522 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1523 to convert automatically to a pointer. */
1524 if (TREE_CODE (val
) == NON_LVALUE_EXPR
)
1525 val
= TREE_OPERAND (val
, 0);
1527 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
1528 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
)
1529 val
= default_conversion (val
);
1531 val
= require_complete_type (val
);
1535 /* Formal parm type is specified by a function prototype. */
1538 if (!COMPLETE_TYPE_P (type
))
1540 error ("type of formal parameter %d is incomplete", parmnum
+ 1);
1545 /* Optionally warn about conversions that
1546 differ from the default conversions. */
1547 if (warn_conversion
)
1549 int formal_prec
= TYPE_PRECISION (type
);
1551 if (INTEGRAL_TYPE_P (type
)
1552 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
1553 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name
, parmnum
+ 1);
1554 else if (TREE_CODE (type
) == COMPLEX_TYPE
1555 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
1556 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name
, parmnum
+ 1);
1557 else if (TREE_CODE (type
) == REAL_TYPE
1558 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
1559 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name
, parmnum
+ 1);
1560 else if (TREE_CODE (type
) == REAL_TYPE
1561 && TREE_CODE (TREE_TYPE (val
)) == COMPLEX_TYPE
)
1562 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name
, parmnum
+ 1);
1563 /* ??? At some point, messages should be written about
1564 conversions between complex types, but that's too messy
1566 else if (TREE_CODE (type
) == REAL_TYPE
1567 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
1569 /* Warn if any argument is passed as `float',
1570 since without a prototype it would be `double'. */
1571 if (formal_prec
== TYPE_PRECISION (float_type_node
))
1572 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name
, parmnum
+ 1);
1574 /* Detect integer changing in width or signedness. */
1575 else if (INTEGRAL_TYPE_P (type
)
1576 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
1578 tree would_have_been
= default_conversion (val
);
1579 tree type1
= TREE_TYPE (would_have_been
);
1581 if (TREE_CODE (type
) == ENUMERAL_TYPE
1582 && type
== TREE_TYPE (val
))
1583 /* No warning if function asks for enum
1584 and the actual arg is that enum type. */
1586 else if (formal_prec
!= TYPE_PRECISION (type1
))
1587 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name
, parmnum
+ 1);
1588 else if (TREE_UNSIGNED (type
) == TREE_UNSIGNED (type1
))
1590 /* Don't complain if the formal parameter type
1591 is an enum, because we can't tell now whether
1592 the value was an enum--even the same enum. */
1593 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
1595 else if (TREE_CODE (val
) == INTEGER_CST
1596 && int_fits_type_p (val
, type
))
1597 /* Change in signedness doesn't matter
1598 if a constant value is unaffected. */
1600 /* Likewise for a constant in a NOP_EXPR. */
1601 else if (TREE_CODE (val
) == NOP_EXPR
1602 && TREE_CODE (TREE_OPERAND (val
, 0)) == INTEGER_CST
1603 && int_fits_type_p (TREE_OPERAND (val
, 0), type
))
1605 #if 0 /* We never get such tree structure here. */
1606 else if (TREE_CODE (TREE_TYPE (val
)) == ENUMERAL_TYPE
1607 && int_fits_type_p (TYPE_MIN_VALUE (TREE_TYPE (val
)), type
)
1608 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (val
)), type
))
1609 /* Change in signedness doesn't matter
1610 if an enum value is unaffected. */
1613 /* If the value is extended from a narrower
1614 unsigned type, it doesn't matter whether we
1615 pass it as signed or unsigned; the value
1616 certainly is the same either way. */
1617 else if (TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
)
1618 && TREE_UNSIGNED (TREE_TYPE (val
)))
1620 else if (TREE_UNSIGNED (type
))
1621 warn_for_assignment ("%s as unsigned due to prototype", (char *) 0, name
, parmnum
+ 1);
1623 warn_for_assignment ("%s as signed due to prototype", (char *) 0, name
, parmnum
+ 1);
1627 parmval
= convert_for_assignment (type
, val
,
1628 (char *) 0, /* arg passing */
1629 fundecl
, name
, parmnum
+ 1);
1631 if (PROMOTE_PROTOTYPES
1632 && (TREE_CODE (type
) == INTEGER_TYPE
1633 || TREE_CODE (type
) == ENUMERAL_TYPE
)
1634 && (TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)))
1635 parmval
= default_conversion (parmval
);
1637 result
= tree_cons (NULL_TREE
, parmval
, result
);
1639 else if (TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
1640 && (TYPE_PRECISION (TREE_TYPE (val
))
1641 < TYPE_PRECISION (double_type_node
)))
1642 /* Convert `float' to `double'. */
1643 result
= tree_cons (NULL_TREE
, convert (double_type_node
, val
), result
);
1645 /* Convert `short' and `char' to full-size `int'. */
1646 result
= tree_cons (NULL_TREE
, default_conversion (val
), result
);
1649 typetail
= TREE_CHAIN (typetail
);
1652 if (typetail
!= 0 && TREE_VALUE (typetail
) != void_type_node
)
1655 error ("too few arguments to function `%s'",
1656 IDENTIFIER_POINTER (name
));
1658 error ("too few arguments to function");
1661 return nreverse (result
);
1664 /* This is the entry point used by the parser
1665 for binary operators in the input.
1666 In addition to constructing the expression,
1667 we check for operands that were written with other binary operators
1668 in a way that is likely to confuse the user. */
1671 parser_build_binary_op (code
, arg1
, arg2
)
1672 enum tree_code code
;
1675 tree result
= build_binary_op (code
, arg1
, arg2
, 1);
1678 char class1
= TREE_CODE_CLASS (TREE_CODE (arg1
));
1679 char class2
= TREE_CODE_CLASS (TREE_CODE (arg2
));
1680 enum tree_code code1
= ERROR_MARK
;
1681 enum tree_code code2
= ERROR_MARK
;
1683 if (class1
== 'e' || class1
== '1'
1684 || class1
== '2' || class1
== '<')
1685 code1
= C_EXP_ORIGINAL_CODE (arg1
);
1686 if (class2
== 'e' || class2
== '1'
1687 || class2
== '2' || class2
== '<')
1688 code2
= C_EXP_ORIGINAL_CODE (arg2
);
1690 /* Check for cases such as x+y<<z which users are likely
1691 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
1692 is cleared to prevent these warnings. */
1693 if (warn_parentheses
)
1695 if (code
== LSHIFT_EXPR
|| code
== RSHIFT_EXPR
)
1697 if (code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
1698 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
1699 warning ("suggest parentheses around + or - inside shift");
1702 if (code
== TRUTH_ORIF_EXPR
)
1704 if (code1
== TRUTH_ANDIF_EXPR
1705 || code2
== TRUTH_ANDIF_EXPR
)
1706 warning ("suggest parentheses around && within ||");
1709 if (code
== BIT_IOR_EXPR
)
1711 if (code1
== BIT_AND_EXPR
|| code1
== BIT_XOR_EXPR
1712 || code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
1713 || code2
== BIT_AND_EXPR
|| code2
== BIT_XOR_EXPR
1714 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
1715 warning ("suggest parentheses around arithmetic in operand of |");
1716 /* Check cases like x|y==z */
1717 if (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<')
1718 warning ("suggest parentheses around comparison in operand of |");
1721 if (code
== BIT_XOR_EXPR
)
1723 if (code1
== BIT_AND_EXPR
1724 || code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
1725 || code2
== BIT_AND_EXPR
1726 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
1727 warning ("suggest parentheses around arithmetic in operand of ^");
1728 /* Check cases like x^y==z */
1729 if (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<')
1730 warning ("suggest parentheses around comparison in operand of ^");
1733 if (code
== BIT_AND_EXPR
)
1735 if (code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
1736 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
1737 warning ("suggest parentheses around + or - in operand of &");
1738 /* Check cases like x&y==z */
1739 if (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<')
1740 warning ("suggest parentheses around comparison in operand of &");
1744 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
1745 if (TREE_CODE_CLASS (code
) == '<' && extra_warnings
1746 && (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<'))
1747 warning ("comparisons like X<=Y<=Z do not have their mathematical meaning");
1749 unsigned_conversion_warning (result
, arg1
);
1750 unsigned_conversion_warning (result
, arg2
);
1751 overflow_warning (result
);
1753 class = TREE_CODE_CLASS (TREE_CODE (result
));
1755 /* Record the code that was specified in the source,
1756 for the sake of warnings about confusing nesting. */
1757 if (class == 'e' || class == '1'
1758 || class == '2' || class == '<')
1759 C_SET_EXP_ORIGINAL_CODE (result
, code
);
1762 int flag
= TREE_CONSTANT (result
);
1763 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
1764 so that convert_for_assignment wouldn't strip it.
1765 That way, we got warnings for things like p = (1 - 1).
1766 But it turns out we should not get those warnings. */
1767 result
= build1 (NON_LVALUE_EXPR
, TREE_TYPE (result
), result
);
1768 C_SET_EXP_ORIGINAL_CODE (result
, code
);
1769 TREE_CONSTANT (result
) = flag
;
1775 /* Build a binary-operation expression without default conversions.
1776 CODE is the kind of expression to build.
1777 This function differs from `build' in several ways:
1778 the data type of the result is computed and recorded in it,
1779 warnings are generated if arg data types are invalid,
1780 special handling for addition and subtraction of pointers is known,
1781 and some optimization is done (operations on narrow ints
1782 are done in the narrower type when that gives the same result).
1783 Constant folding is also done before the result is returned.
1785 Note that the operands will never have enumeral types, or function
1786 or array types, because either they will have the default conversions
1787 performed or they have both just been converted to some other type in which
1788 the arithmetic is to be done. */
1791 build_binary_op (code
, orig_op0
, orig_op1
, convert_p
)
1792 enum tree_code code
;
1793 tree orig_op0
, orig_op1
;
1797 register enum tree_code code0
, code1
;
1800 /* Expression code to give to the expression when it is built.
1801 Normally this is CODE, which is what the caller asked for,
1802 but in some special cases we change it. */
1803 register enum tree_code resultcode
= code
;
1805 /* Data type in which the computation is to be performed.
1806 In the simplest cases this is the common type of the arguments. */
1807 register tree result_type
= NULL
;
1809 /* Nonzero means operands have already been type-converted
1810 in whatever way is necessary.
1811 Zero means they need to be converted to RESULT_TYPE. */
1814 /* Nonzero means create the expression with this type, rather than
1816 tree build_type
= 0;
1818 /* Nonzero means after finally constructing the expression
1819 convert it to this type. */
1820 tree final_type
= 0;
1822 /* Nonzero if this is an operation like MIN or MAX which can
1823 safely be computed in short if both args are promoted shorts.
1824 Also implies COMMON.
1825 -1 indicates a bitwise operation; this makes a difference
1826 in the exact conditions for when it is safe to do the operation
1827 in a narrower mode. */
1830 /* Nonzero if this is a comparison operation;
1831 if both args are promoted shorts, compare the original shorts.
1832 Also implies COMMON. */
1833 int short_compare
= 0;
1835 /* Nonzero if this is a right-shift operation, which can be computed on the
1836 original short and then promoted if the operand is a promoted short. */
1837 int short_shift
= 0;
1839 /* Nonzero means set RESULT_TYPE to the common type of the args. */
1844 op0
= default_conversion (orig_op0
);
1845 op1
= default_conversion (orig_op1
);
1853 type0
= TREE_TYPE (op0
);
1854 type1
= TREE_TYPE (op1
);
1856 /* The expression codes of the data types of the arguments tell us
1857 whether the arguments are integers, floating, pointers, etc. */
1858 code0
= TREE_CODE (type0
);
1859 code1
= TREE_CODE (type1
);
1861 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1862 STRIP_TYPE_NOPS (op0
);
1863 STRIP_TYPE_NOPS (op1
);
1865 /* If an error was already reported for one of the arguments,
1866 avoid reporting another error. */
1868 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
1869 return error_mark_node
;
1874 /* Handle the pointer + int case. */
1875 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
1876 return pointer_int_sum (PLUS_EXPR
, op0
, op1
);
1877 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
1878 return pointer_int_sum (PLUS_EXPR
, op1
, op0
);
1884 /* Subtraction of two similar pointers.
1885 We must subtract them as integers, then divide by object size. */
1886 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
1887 && comp_target_types (type0
, type1
))
1888 return pointer_diff (op0
, op1
);
1889 /* Handle pointer minus int. Just like pointer plus int. */
1890 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
1891 return pointer_int_sum (MINUS_EXPR
, op0
, op1
);
1900 case TRUNC_DIV_EXPR
:
1902 case FLOOR_DIV_EXPR
:
1903 case ROUND_DIV_EXPR
:
1904 case EXACT_DIV_EXPR
:
1905 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
1906 || code0
== COMPLEX_TYPE
)
1907 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
1908 || code1
== COMPLEX_TYPE
))
1910 if (!(code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
))
1911 resultcode
= RDIV_EXPR
;
1913 /* Although it would be tempting to shorten always here, that
1914 loses on some targets, since the modulo instruction is
1915 undefined if the quotient can't be represented in the
1916 computation mode. We shorten only if unsigned or if
1917 dividing by something we know != -1. */
1918 shorten
= (TREE_UNSIGNED (TREE_TYPE (orig_op0
))
1919 || (TREE_CODE (op1
) == INTEGER_CST
1920 && ! integer_all_onesp (op1
)));
1926 case BIT_ANDTC_EXPR
:
1929 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
1931 /* If one operand is a constant, and the other is a short type
1932 that has been converted to an int,
1933 really do the work in the short type and then convert the
1934 result to int. If we are lucky, the constant will be 0 or 1
1935 in the short type, making the entire operation go away. */
1936 if (TREE_CODE (op0
) == INTEGER_CST
1937 && TREE_CODE (op1
) == NOP_EXPR
1938 && TYPE_PRECISION (type1
) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1
, 0)))
1939 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op1
, 0))))
1941 final_type
= result_type
;
1942 op1
= TREE_OPERAND (op1
, 0);
1943 result_type
= TREE_TYPE (op1
);
1945 if (TREE_CODE (op1
) == INTEGER_CST
1946 && TREE_CODE (op0
) == NOP_EXPR
1947 && TYPE_PRECISION (type0
) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0
, 0)))
1948 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
1950 final_type
= result_type
;
1951 op0
= TREE_OPERAND (op0
, 0);
1952 result_type
= TREE_TYPE (op0
);
1956 case TRUNC_MOD_EXPR
:
1957 case FLOOR_MOD_EXPR
:
1958 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
1960 /* Although it would be tempting to shorten always here, that loses
1961 on some targets, since the modulo instruction is undefined if the
1962 quotient can't be represented in the computation mode. We shorten
1963 only if unsigned or if dividing by something we know != -1. */
1964 shorten
= (TREE_UNSIGNED (TREE_TYPE (orig_op0
))
1965 || (TREE_CODE (op1
) == INTEGER_CST
1966 && ! integer_all_onesp (op1
)));
1971 case TRUTH_ANDIF_EXPR
:
1972 case TRUTH_ORIF_EXPR
:
1973 case TRUTH_AND_EXPR
:
1975 case TRUTH_XOR_EXPR
:
1976 if ((code0
== INTEGER_TYPE
|| code0
== POINTER_TYPE
1977 || code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
1978 && (code1
== INTEGER_TYPE
|| code1
== POINTER_TYPE
1979 || code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
))
1981 /* Result of these operations is always an int,
1982 but that does not mean the operands should be
1983 converted to ints! */
1984 result_type
= integer_type_node
;
1985 op0
= truthvalue_conversion (op0
);
1986 op1
= truthvalue_conversion (op1
);
1991 /* Shift operations: result has same type as first operand;
1992 always convert second operand to int.
1993 Also set SHORT_SHIFT if shifting rightward. */
1996 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
1998 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
2000 if (tree_int_cst_sgn (op1
) < 0)
2001 warning ("right shift count is negative");
2004 if (! integer_zerop (op1
))
2007 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
2008 warning ("right shift count >= width of type");
2012 /* Use the type of the value to be shifted.
2013 This is what most traditional C compilers do. */
2014 result_type
= type0
;
2015 /* Unless traditional, convert the shift-count to an integer,
2016 regardless of size of value being shifted. */
2017 if (! flag_traditional
)
2019 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
2020 op1
= convert (integer_type_node
, op1
);
2021 /* Avoid converting op1 to result_type later. */
2028 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2030 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
2032 if (tree_int_cst_sgn (op1
) < 0)
2033 warning ("left shift count is negative");
2035 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
2036 warning ("left shift count >= width of type");
2039 /* Use the type of the value to be shifted.
2040 This is what most traditional C compilers do. */
2041 result_type
= type0
;
2042 /* Unless traditional, convert the shift-count to an integer,
2043 regardless of size of value being shifted. */
2044 if (! flag_traditional
)
2046 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
2047 op1
= convert (integer_type_node
, op1
);
2048 /* Avoid converting op1 to result_type later. */
2056 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2058 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
2060 if (tree_int_cst_sgn (op1
) < 0)
2061 warning ("shift count is negative");
2062 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
2063 warning ("shift count >= width of type");
2066 /* Use the type of the value to be shifted.
2067 This is what most traditional C compilers do. */
2068 result_type
= type0
;
2069 /* Unless traditional, convert the shift-count to an integer,
2070 regardless of size of value being shifted. */
2071 if (! flag_traditional
)
2073 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
2074 op1
= convert (integer_type_node
, op1
);
2075 /* Avoid converting op1 to result_type later. */
2083 if (warn_float_equal
&& (code0
== REAL_TYPE
|| code1
== REAL_TYPE
))
2084 warning ("comparing floating point with == or != is unsafe");
2085 /* Result of comparison is always int,
2086 but don't convert the args to int! */
2087 build_type
= integer_type_node
;
2088 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
2089 || code0
== COMPLEX_TYPE
)
2090 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
2091 || code1
== COMPLEX_TYPE
))
2093 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
2095 register tree tt0
= TREE_TYPE (type0
);
2096 register tree tt1
= TREE_TYPE (type1
);
2097 /* Anything compares with void *. void * compares with anything.
2098 Otherwise, the targets must be compatible
2099 and both must be object or both incomplete. */
2100 if (comp_target_types (type0
, type1
))
2101 result_type
= common_type (type0
, type1
);
2102 else if (TYPE_MAIN_VARIANT (tt0
) == void_type_node
)
2104 /* op0 != orig_op0 detects the case of something
2105 whose value is 0 but which isn't a valid null ptr const. */
2106 if (pedantic
&& (!integer_zerop (op0
) || op0
!= orig_op0
)
2107 && TREE_CODE (tt1
) == FUNCTION_TYPE
)
2108 pedwarn ("ANSI C forbids comparison of `void *' with function pointer");
2110 else if (TYPE_MAIN_VARIANT (tt1
) == void_type_node
)
2112 if (pedantic
&& (!integer_zerop (op1
) || op1
!= orig_op1
)
2113 && TREE_CODE (tt0
) == FUNCTION_TYPE
)
2114 pedwarn ("ANSI C forbids comparison of `void *' with function pointer");
2117 pedwarn ("comparison of distinct pointer types lacks a cast");
2119 if (result_type
== NULL_TREE
)
2120 result_type
= ptr_type_node
;
2122 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
2123 && integer_zerop (op1
))
2124 result_type
= type0
;
2125 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
2126 && integer_zerop (op0
))
2127 result_type
= type1
;
2128 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
2130 result_type
= type0
;
2131 if (! flag_traditional
)
2132 pedwarn ("comparison between pointer and integer");
2134 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
2136 result_type
= type1
;
2137 if (! flag_traditional
)
2138 pedwarn ("comparison between pointer and integer");
2144 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
2145 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
2147 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
2149 if (comp_target_types (type0
, type1
))
2151 result_type
= common_type (type0
, type1
);
2153 && TREE_CODE (TREE_TYPE (type0
)) == FUNCTION_TYPE
)
2154 pedwarn ("ANSI C forbids ordered comparisons of pointers to functions");
2158 result_type
= ptr_type_node
;
2159 pedwarn ("comparison of distinct pointer types lacks a cast");
2168 build_type
= integer_type_node
;
2169 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
2170 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
2172 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
2174 if (comp_target_types (type0
, type1
))
2176 result_type
= common_type (type0
, type1
);
2177 if (!COMPLETE_TYPE_P (TREE_TYPE (type0
))
2178 != !COMPLETE_TYPE_P (TREE_TYPE (type1
)))
2179 pedwarn ("comparison of complete and incomplete pointers");
2181 && TREE_CODE (TREE_TYPE (type0
)) == FUNCTION_TYPE
)
2182 pedwarn ("ANSI C forbids ordered comparisons of pointers to functions");
2186 result_type
= ptr_type_node
;
2187 pedwarn ("comparison of distinct pointer types lacks a cast");
2190 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
2191 && integer_zerop (op1
))
2193 result_type
= type0
;
2194 if (pedantic
|| extra_warnings
)
2195 pedwarn ("ordered comparison of pointer with integer zero");
2197 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
2198 && integer_zerop (op0
))
2200 result_type
= type1
;
2202 pedwarn ("ordered comparison of pointer with integer zero");
2204 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
2206 result_type
= type0
;
2207 if (! flag_traditional
)
2208 pedwarn ("comparison between pointer and integer");
2210 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
2212 result_type
= type1
;
2213 if (! flag_traditional
)
2214 pedwarn ("comparison between pointer and integer");
2218 case UNORDERED_EXPR
:
2225 build_type
= integer_type_node
;
2226 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
2228 error ("unordered comparison on non-floating point argument");
2229 return error_mark_node
;
2238 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
2240 (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
))
2242 int none_complex
= (code0
!= COMPLEX_TYPE
&& code1
!= COMPLEX_TYPE
);
2244 if (shorten
|| common
|| short_compare
)
2245 result_type
= common_type (type0
, type1
);
2247 /* For certain operations (which identify themselves by shorten != 0)
2248 if both args were extended from the same smaller type,
2249 do the arithmetic in that type and then extend.
2251 shorten !=0 and !=1 indicates a bitwise operation.
2252 For them, this optimization is safe only if
2253 both args are zero-extended or both are sign-extended.
2254 Otherwise, we might change the result.
2255 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2256 but calculated in (unsigned short) it would be (unsigned short)-1. */
2258 if (shorten
&& none_complex
)
2260 int unsigned0
, unsigned1
;
2261 tree arg0
= get_narrower (op0
, &unsigned0
);
2262 tree arg1
= get_narrower (op1
, &unsigned1
);
2263 /* UNS is 1 if the operation to be done is an unsigned one. */
2264 int uns
= TREE_UNSIGNED (result_type
);
2267 final_type
= result_type
;
2269 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2270 but it *requires* conversion to FINAL_TYPE. */
2272 if ((TYPE_PRECISION (TREE_TYPE (op0
))
2273 == TYPE_PRECISION (TREE_TYPE (arg0
)))
2274 && TREE_TYPE (op0
) != final_type
)
2275 unsigned0
= TREE_UNSIGNED (TREE_TYPE (op0
));
2276 if ((TYPE_PRECISION (TREE_TYPE (op1
))
2277 == TYPE_PRECISION (TREE_TYPE (arg1
)))
2278 && TREE_TYPE (op1
) != final_type
)
2279 unsigned1
= TREE_UNSIGNED (TREE_TYPE (op1
));
2281 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2283 /* For bitwise operations, signedness of nominal type
2284 does not matter. Consider only how operands were extended. */
2288 /* Note that in all three cases below we refrain from optimizing
2289 an unsigned operation on sign-extended args.
2290 That would not be valid. */
2292 /* Both args variable: if both extended in same way
2293 from same width, do it in that width.
2294 Do it unsigned if args were zero-extended. */
2295 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
2296 < TYPE_PRECISION (result_type
))
2297 && (TYPE_PRECISION (TREE_TYPE (arg1
))
2298 == TYPE_PRECISION (TREE_TYPE (arg0
)))
2299 && unsigned0
== unsigned1
2300 && (unsigned0
|| !uns
))
2302 = signed_or_unsigned_type (unsigned0
,
2303 common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
2304 else if (TREE_CODE (arg0
) == INTEGER_CST
2305 && (unsigned1
|| !uns
)
2306 && (TYPE_PRECISION (TREE_TYPE (arg1
))
2307 < TYPE_PRECISION (result_type
))
2308 && (type
= signed_or_unsigned_type (unsigned1
,
2310 int_fits_type_p (arg0
, type
)))
2312 else if (TREE_CODE (arg1
) == INTEGER_CST
2313 && (unsigned0
|| !uns
)
2314 && (TYPE_PRECISION (TREE_TYPE (arg0
))
2315 < TYPE_PRECISION (result_type
))
2316 && (type
= signed_or_unsigned_type (unsigned0
,
2318 int_fits_type_p (arg1
, type
)))
2322 /* Shifts can be shortened if shifting right. */
2327 tree arg0
= get_narrower (op0
, &unsigned_arg
);
2329 final_type
= result_type
;
2331 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
2332 unsigned_arg
= TREE_UNSIGNED (TREE_TYPE (op0
));
2334 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
2335 /* We can shorten only if the shift count is less than the
2336 number of bits in the smaller type size. */
2337 && compare_tree_int (op1
, TYPE_PRECISION (TREE_TYPE (arg0
))) < 0
2338 /* If arg is sign-extended and then unsigned-shifted,
2339 we can simulate this with a signed shift in arg's type
2340 only if the extended result is at least twice as wide
2341 as the arg. Otherwise, the shift could use up all the
2342 ones made by sign-extension and bring in zeros.
2343 We can't optimize that case at all, but in most machines
2344 it never happens because available widths are 2**N. */
2345 && (!TREE_UNSIGNED (final_type
)
2347 || (2 * TYPE_PRECISION (TREE_TYPE (arg0
))
2348 <= TYPE_PRECISION (result_type
))))
2350 /* Do an unsigned shift if the operand was zero-extended. */
2352 = signed_or_unsigned_type (unsigned_arg
,
2354 /* Convert value-to-be-shifted to that type. */
2355 if (TREE_TYPE (op0
) != result_type
)
2356 op0
= convert (result_type
, op0
);
2361 /* Comparison operations are shortened too but differently.
2362 They identify themselves by setting short_compare = 1. */
2366 /* Don't write &op0, etc., because that would prevent op0
2367 from being kept in a register.
2368 Instead, make copies of the our local variables and
2369 pass the copies by reference, then copy them back afterward. */
2370 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
2371 enum tree_code xresultcode
= resultcode
;
2373 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
2378 op0
= xop0
, op1
= xop1
;
2380 resultcode
= xresultcode
;
2382 if ((warn_sign_compare
< 0 ? extra_warnings
: warn_sign_compare
!= 0)
2383 && skip_evaluation
== 0)
2385 int op0_signed
= ! TREE_UNSIGNED (TREE_TYPE (orig_op0
));
2386 int op1_signed
= ! TREE_UNSIGNED (TREE_TYPE (orig_op1
));
2387 int unsignedp0
, unsignedp1
;
2388 tree primop0
= get_narrower (op0
, &unsignedp0
);
2389 tree primop1
= get_narrower (op1
, &unsignedp1
);
2393 STRIP_TYPE_NOPS (xop0
);
2394 STRIP_TYPE_NOPS (xop1
);
2396 /* Give warnings for comparisons between signed and unsigned
2397 quantities that may fail.
2399 Do the checking based on the original operand trees, so that
2400 casts will be considered, but default promotions won't be.
2402 Do not warn if the comparison is being done in a signed type,
2403 since the signed type will only be chosen if it can represent
2404 all the values of the unsigned type. */
2405 if (! TREE_UNSIGNED (result_type
))
2407 /* Do not warn if both operands are the same signedness. */
2408 else if (op0_signed
== op1_signed
)
2415 sop
= xop0
, uop
= xop1
;
2417 sop
= xop1
, uop
= xop0
;
2419 /* Do not warn if the signed quantity is an
2420 unsuffixed integer literal (or some static
2421 constant expression involving such literals or a
2422 conditional expression involving such literals)
2423 and it is non-negative. */
2424 if (tree_expr_nonnegative_p (sop
))
2426 /* Do not warn if the comparison is an equality operation,
2427 the unsigned quantity is an integral constant, and it
2428 would fit in the result if the result were signed. */
2429 else if (TREE_CODE (uop
) == INTEGER_CST
2430 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
2431 && int_fits_type_p (uop
, signed_type (result_type
)))
2433 /* Do not warn if the unsigned quantity is an enumeration
2434 constant and its maximum value would fit in the result
2435 if the result were signed. */
2436 else if (TREE_CODE (uop
) == INTEGER_CST
2437 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
2438 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE(uop
)),
2439 signed_type (result_type
)))
2442 warning ("comparison between signed and unsigned");
2445 /* Warn if two unsigned values are being compared in a size
2446 larger than their original size, and one (and only one) is the
2447 result of a `~' operator. This comparison will always fail.
2449 Also warn if one operand is a constant, and the constant
2450 does not have all bits set that are set in the ~ operand
2451 when it is extended. */
2453 if ((TREE_CODE (primop0
) == BIT_NOT_EXPR
)
2454 != (TREE_CODE (primop1
) == BIT_NOT_EXPR
))
2456 if (TREE_CODE (primop0
) == BIT_NOT_EXPR
)
2457 primop0
= get_narrower (TREE_OPERAND (primop0
, 0),
2460 primop1
= get_narrower (TREE_OPERAND (primop1
, 0),
2463 if (host_integerp (primop0
, 0) || host_integerp (primop1
, 0))
2466 HOST_WIDE_INT constant
, mask
;
2467 int unsignedp
, bits
;
2469 if (host_integerp (primop0
, 0))
2472 unsignedp
= unsignedp1
;
2473 constant
= tree_low_cst (primop0
, 0);
2478 unsignedp
= unsignedp0
;
2479 constant
= tree_low_cst (primop1
, 0);
2482 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
2483 if (bits
< TYPE_PRECISION (result_type
)
2484 && bits
< HOST_BITS_PER_WIDE_INT
&& unsignedp
)
2486 mask
= (~ (HOST_WIDE_INT
) 0) << bits
;
2487 if ((mask
& constant
) != mask
)
2488 warning ("comparison of promoted ~unsigned with constant");
2491 else if (unsignedp0
&& unsignedp1
2492 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2493 < TYPE_PRECISION (result_type
))
2494 && (TYPE_PRECISION (TREE_TYPE (primop1
))
2495 < TYPE_PRECISION (result_type
)))
2496 warning ("comparison of promoted ~unsigned with unsigned");
2502 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
2503 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
2504 Then the expression will be built.
2505 It will be given type FINAL_TYPE if that is nonzero;
2506 otherwise, it will be given type RESULT_TYPE. */
2510 binary_op_error (code
);
2511 return error_mark_node
;
2516 if (TREE_TYPE (op0
) != result_type
)
2517 op0
= convert (result_type
, op0
);
2518 if (TREE_TYPE (op1
) != result_type
)
2519 op1
= convert (result_type
, op1
);
2522 if (build_type
== NULL_TREE
)
2523 build_type
= result_type
;
2526 register tree result
= build (resultcode
, build_type
, op0
, op1
);
2527 register tree folded
;
2529 folded
= fold (result
);
2530 if (folded
== result
)
2531 TREE_CONSTANT (folded
) = TREE_CONSTANT (op0
) & TREE_CONSTANT (op1
);
2532 if (final_type
!= 0)
2533 return convert (final_type
, folded
);
2538 /* Return a tree for the sum or difference (RESULTCODE says which)
2539 of pointer PTROP and integer INTOP. */
2542 pointer_int_sum (resultcode
, ptrop
, intop
)
2543 enum tree_code resultcode
;
2544 register tree ptrop
, intop
;
2548 register tree result
;
2549 register tree folded
;
2551 /* The result is a pointer of the same type that is being added. */
2553 register tree result_type
= TREE_TYPE (ptrop
);
2555 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
2557 if (pedantic
|| warn_pointer_arith
)
2558 pedwarn ("pointer of type `void *' used in arithmetic");
2559 size_exp
= integer_one_node
;
2561 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
2563 if (pedantic
|| warn_pointer_arith
)
2564 pedwarn ("pointer to a function used in arithmetic");
2565 size_exp
= integer_one_node
;
2568 size_exp
= c_size_in_bytes (TREE_TYPE (result_type
));
2570 /* If what we are about to multiply by the size of the elements
2571 contains a constant term, apply distributive law
2572 and multiply that constant term separately.
2573 This helps produce common subexpressions. */
2575 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
2576 && ! TREE_CONSTANT (intop
)
2577 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
2578 && TREE_CONSTANT (size_exp
)
2579 /* If the constant comes from pointer subtraction,
2580 skip this optimization--it would cause an error. */
2581 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
2582 /* If the constant is unsigned, and smaller than the pointer size,
2583 then we must skip this optimization. This is because it could cause
2584 an overflow error if the constant is negative but INTOP is not. */
2585 && (! TREE_UNSIGNED (TREE_TYPE (intop
))
2586 || (TYPE_PRECISION (TREE_TYPE (intop
))
2587 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
2589 enum tree_code subcode
= resultcode
;
2590 tree int_type
= TREE_TYPE (intop
);
2591 if (TREE_CODE (intop
) == MINUS_EXPR
)
2592 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
2593 /* Convert both subexpression types to the type of intop,
2594 because weird cases involving pointer arithmetic
2595 can result in a sum or difference with different type args. */
2596 ptrop
= build_binary_op (subcode
, ptrop
,
2597 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
2598 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
2601 /* Convert the integer argument to a type the same size as sizetype
2602 so the multiply won't overflow spuriously. */
2604 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
2605 || TREE_UNSIGNED (TREE_TYPE (intop
)) != TREE_UNSIGNED (sizetype
))
2606 intop
= convert (type_for_size (TYPE_PRECISION (sizetype
),
2607 TREE_UNSIGNED (sizetype
)), intop
);
2609 /* Replace the integer argument with a suitable product by the object size.
2610 Do this multiplication as signed, then convert to the appropriate
2611 pointer type (actually unsigned integral). */
2613 intop
= convert (result_type
,
2614 build_binary_op (MULT_EXPR
, intop
,
2615 convert (TREE_TYPE (intop
), size_exp
), 1));
2617 /* Create the sum or difference. */
2619 result
= build (resultcode
, result_type
, ptrop
, intop
);
2621 folded
= fold (result
);
2622 if (folded
== result
)
2623 TREE_CONSTANT (folded
) = TREE_CONSTANT (ptrop
) & TREE_CONSTANT (intop
);
2627 /* Return a tree for the difference of pointers OP0 and OP1.
2628 The resulting tree has type int. */
2631 pointer_diff (op0
, op1
)
2632 register tree op0
, op1
;
2634 register tree result
, folded
;
2635 tree restype
= ptrdiff_type_node
;
2637 tree target_type
= TREE_TYPE (TREE_TYPE (op0
));
2639 if (pedantic
|| warn_pointer_arith
)
2641 if (TREE_CODE (target_type
) == VOID_TYPE
)
2642 pedwarn ("pointer of type `void *' used in subtraction");
2643 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
2644 pedwarn ("pointer to a function used in subtraction");
2647 /* First do the subtraction as integers;
2648 then drop through to build the divide operator.
2649 Do not do default conversions on the minus operator
2650 in case restype is a short type. */
2652 op0
= build_binary_op (MINUS_EXPR
, convert (restype
, op0
),
2653 convert (restype
, op1
), 0);
2654 /* This generates an error if op1 is pointer to incomplete type. */
2655 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
2656 error ("arithmetic on pointer to an incomplete type");
2658 /* This generates an error if op0 is pointer to incomplete type. */
2659 op1
= c_size_in_bytes (target_type
);
2661 /* Divide by the size, in easiest possible way. */
2663 result
= build (EXACT_DIV_EXPR
, restype
, op0
, convert (restype
, op1
));
2665 folded
= fold (result
);
2666 if (folded
== result
)
2667 TREE_CONSTANT (folded
) = TREE_CONSTANT (op0
) & TREE_CONSTANT (op1
);
2671 /* Construct and perhaps optimize a tree representation
2672 for a unary operation. CODE, a tree_code, specifies the operation
2673 and XARG is the operand. NOCONVERT nonzero suppresses
2674 the default promotions (such as from short to int). */
2677 build_unary_op (code
, xarg
, noconvert
)
2678 enum tree_code code
;
2682 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2683 register tree arg
= xarg
;
2684 register tree argtype
= 0;
2685 register enum tree_code typecode
= TREE_CODE (TREE_TYPE (arg
));
2688 if (typecode
== ERROR_MARK
)
2689 return error_mark_node
;
2690 if (typecode
== ENUMERAL_TYPE
)
2691 typecode
= INTEGER_TYPE
;
2696 /* This is used for unary plus, because a CONVERT_EXPR
2697 is enough to prevent anybody from looking inside for
2698 associativity, but won't generate any code. */
2699 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2700 || typecode
== COMPLEX_TYPE
))
2702 error ("wrong type argument to unary plus");
2703 return error_mark_node
;
2705 else if (!noconvert
)
2706 arg
= default_conversion (arg
);
2710 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2711 || typecode
== COMPLEX_TYPE
))
2713 error ("wrong type argument to unary minus");
2714 return error_mark_node
;
2716 else if (!noconvert
)
2717 arg
= default_conversion (arg
);
2721 if (typecode
== COMPLEX_TYPE
)
2725 arg
= default_conversion (arg
);
2727 else if (typecode
!= INTEGER_TYPE
)
2729 error ("wrong type argument to bit-complement");
2730 return error_mark_node
;
2732 else if (!noconvert
)
2733 arg
= default_conversion (arg
);
2737 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2738 || typecode
== COMPLEX_TYPE
))
2740 error ("wrong type argument to abs");
2741 return error_mark_node
;
2743 else if (!noconvert
)
2744 arg
= default_conversion (arg
);
2748 /* Conjugating a real value is a no-op, but allow it anyway. */
2749 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2750 || typecode
== COMPLEX_TYPE
))
2752 error ("wrong type argument to conjugation");
2753 return error_mark_node
;
2755 else if (!noconvert
)
2756 arg
= default_conversion (arg
);
2759 case TRUTH_NOT_EXPR
:
2760 if (typecode
!= INTEGER_TYPE
2761 && typecode
!= REAL_TYPE
&& typecode
!= POINTER_TYPE
2762 && typecode
!= COMPLEX_TYPE
2763 /* These will convert to a pointer. */
2764 && typecode
!= ARRAY_TYPE
&& typecode
!= FUNCTION_TYPE
)
2766 error ("wrong type argument to unary exclamation mark");
2767 return error_mark_node
;
2769 arg
= truthvalue_conversion (arg
);
2770 return invert_truthvalue (arg
);
2776 if (TREE_CODE (arg
) == COMPLEX_CST
)
2777 return TREE_REALPART (arg
);
2778 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
2779 return fold (build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
2784 if (TREE_CODE (arg
) == COMPLEX_CST
)
2785 return TREE_IMAGPART (arg
);
2786 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
2787 return fold (build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
2789 return convert (TREE_TYPE (arg
), integer_zero_node
);
2791 case PREINCREMENT_EXPR
:
2792 case POSTINCREMENT_EXPR
:
2793 case PREDECREMENT_EXPR
:
2794 case POSTDECREMENT_EXPR
:
2795 /* Handle complex lvalues (when permitted)
2796 by reduction to simpler cases. */
2798 val
= unary_complex_lvalue (code
, arg
);
2802 /* Increment or decrement the real part of the value,
2803 and don't change the imaginary part. */
2804 if (typecode
== COMPLEX_TYPE
)
2808 arg
= stabilize_reference (arg
);
2809 real
= build_unary_op (REALPART_EXPR
, arg
, 1);
2810 imag
= build_unary_op (IMAGPART_EXPR
, arg
, 1);
2811 return build (COMPLEX_EXPR
, TREE_TYPE (arg
),
2812 build_unary_op (code
, real
, 1), imag
);
2815 /* Report invalid types. */
2817 if (typecode
!= POINTER_TYPE
2818 && typecode
!= INTEGER_TYPE
&& typecode
!= REAL_TYPE
)
2820 error ("wrong type argument to %s",
2821 code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
2822 ? "increment" : "decrement");
2823 return error_mark_node
;
2828 tree result_type
= TREE_TYPE (arg
);
2830 arg
= get_unwidened (arg
, 0);
2831 argtype
= TREE_TYPE (arg
);
2833 /* Compute the increment. */
2835 if (typecode
== POINTER_TYPE
)
2837 /* If pointer target is an undefined struct,
2838 we just cannot know how to do the arithmetic. */
2839 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type
)))
2840 error ("%s of pointer to unknown structure",
2841 code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
2842 ? "increment" : "decrement");
2843 else if ((pedantic
|| warn_pointer_arith
)
2844 && (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
2845 || TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
))
2846 pedwarn ("wrong type argument to %s",
2847 code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
2848 ? "increment" : "decrement");
2849 inc
= c_size_in_bytes (TREE_TYPE (result_type
));
2852 inc
= integer_one_node
;
2854 inc
= convert (argtype
, inc
);
2856 /* Handle incrementing a cast-expression. */
2859 switch (TREE_CODE (arg
))
2864 case FIX_TRUNC_EXPR
:
2865 case FIX_FLOOR_EXPR
:
2866 case FIX_ROUND_EXPR
:
2868 pedantic_lvalue_warning (CONVERT_EXPR
);
2869 /* If the real type has the same machine representation
2870 as the type it is cast to, we can make better output
2871 by adding directly to the inside of the cast. */
2872 if ((TREE_CODE (TREE_TYPE (arg
))
2873 == TREE_CODE (TREE_TYPE (TREE_OPERAND (arg
, 0))))
2874 && (TYPE_MODE (TREE_TYPE (arg
))
2875 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (arg
, 0)))))
2876 arg
= TREE_OPERAND (arg
, 0);
2879 tree incremented
, modify
, value
;
2880 arg
= stabilize_reference (arg
);
2881 if (code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
2884 value
= save_expr (arg
);
2885 incremented
= build (((code
== PREINCREMENT_EXPR
2886 || code
== POSTINCREMENT_EXPR
)
2887 ? PLUS_EXPR
: MINUS_EXPR
),
2888 argtype
, value
, inc
);
2889 TREE_SIDE_EFFECTS (incremented
) = 1;
2890 modify
= build_modify_expr (arg
, NOP_EXPR
, incremented
);
2891 value
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), modify
, value
);
2892 TREE_USED (value
) = 1;
2902 /* Complain about anything else that is not a true lvalue. */
2903 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
2904 || code
== POSTINCREMENT_EXPR
)
2905 ? "invalid lvalue in increment"
2906 : "invalid lvalue in decrement")))
2907 return error_mark_node
;
2909 /* Report a read-only lvalue. */
2910 if (TREE_READONLY (arg
))
2911 readonly_warning (arg
,
2912 ((code
== PREINCREMENT_EXPR
2913 || code
== POSTINCREMENT_EXPR
)
2914 ? "increment" : "decrement"));
2916 val
= build (code
, TREE_TYPE (arg
), arg
, inc
);
2917 TREE_SIDE_EFFECTS (val
) = 1;
2918 val
= convert (result_type
, val
);
2919 if (TREE_CODE (val
) != code
)
2920 TREE_NO_UNUSED_WARNING (val
) = 1;
2925 /* Note that this operation never does default_conversion
2926 regardless of NOCONVERT. */
2928 /* Let &* cancel out to simplify resulting code. */
2929 if (TREE_CODE (arg
) == INDIRECT_REF
)
2931 /* Don't let this be an lvalue. */
2932 if (lvalue_p (TREE_OPERAND (arg
, 0)))
2933 return non_lvalue (TREE_OPERAND (arg
, 0));
2934 return TREE_OPERAND (arg
, 0);
2937 /* For &x[y], return x+y */
2938 if (TREE_CODE (arg
) == ARRAY_REF
)
2940 if (mark_addressable (TREE_OPERAND (arg
, 0)) == 0)
2941 return error_mark_node
;
2942 return build_binary_op (PLUS_EXPR
, TREE_OPERAND (arg
, 0),
2943 TREE_OPERAND (arg
, 1), 1);
2946 /* Handle complex lvalues (when permitted)
2947 by reduction to simpler cases. */
2948 val
= unary_complex_lvalue (code
, arg
);
2952 #if 0 /* Turned off because inconsistent;
2953 float f; *&(int)f = 3.4 stores in int format
2954 whereas (int)f = 3.4 stores in float format. */
2955 /* Address of a cast is just a cast of the address
2956 of the operand of the cast. */
2957 switch (TREE_CODE (arg
))
2962 case FIX_TRUNC_EXPR
:
2963 case FIX_FLOOR_EXPR
:
2964 case FIX_ROUND_EXPR
:
2967 pedwarn ("ANSI C forbids the address of a cast expression");
2968 return convert (build_pointer_type (TREE_TYPE (arg
)),
2969 build_unary_op (ADDR_EXPR
, TREE_OPERAND (arg
, 0),
2974 /* Allow the address of a constructor if all the elements
2976 if (TREE_CODE (arg
) == CONSTRUCTOR
&& TREE_CONSTANT (arg
))
2978 /* Anything not already handled and not a true memory reference
2980 else if (typecode
!= FUNCTION_TYPE
2981 && !lvalue_or_else (arg
, "invalid lvalue in unary `&'"))
2982 return error_mark_node
;
2984 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
2985 argtype
= TREE_TYPE (arg
);
2987 /* If the lvalue is const or volatile, merge that into the type
2988 to which the address will point. Note that you can't get a
2989 restricted pointer by taking the address of something, so we
2990 only have to deal with `const' and `volatile' here. */
2991 if ((DECL_P (arg
) || TREE_CODE_CLASS (TREE_CODE (arg
)) == 'r')
2992 && (TREE_READONLY (arg
) || TREE_THIS_VOLATILE (arg
)))
2993 argtype
= c_build_type_variant (argtype
,
2994 TREE_READONLY (arg
),
2995 TREE_THIS_VOLATILE (arg
));
2997 argtype
= build_pointer_type (argtype
);
2999 if (mark_addressable (arg
) == 0)
3000 return error_mark_node
;
3005 if (TREE_CODE (arg
) == COMPONENT_REF
)
3007 tree field
= TREE_OPERAND (arg
, 1);
3009 addr
= build_unary_op (ADDR_EXPR
, TREE_OPERAND (arg
, 0), 0);
3011 if (DECL_C_BIT_FIELD (field
))
3013 error ("attempt to take address of bit-field structure member `%s'",
3014 IDENTIFIER_POINTER (DECL_NAME (field
)));
3015 return error_mark_node
;
3018 addr
= fold (build (PLUS_EXPR
, argtype
,
3019 convert (argtype
, addr
),
3020 convert (argtype
, byte_position (field
))));
3023 addr
= build1 (code
, argtype
, arg
);
3025 /* Address of a static or external variable or
3026 file-scope function counts as a constant. */
3028 && ! (TREE_CODE (arg
) == FUNCTION_DECL
3029 && DECL_CONTEXT (arg
) != 0))
3030 TREE_CONSTANT (addr
) = 1;
3039 argtype
= TREE_TYPE (arg
);
3040 return fold (build1 (code
, argtype
, arg
));
3044 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
3045 convert ARG with the same conversions in the same order
3046 and return the result. */
3049 convert_sequence (conversions
, arg
)
3053 switch (TREE_CODE (conversions
))
3058 case FIX_TRUNC_EXPR
:
3059 case FIX_FLOOR_EXPR
:
3060 case FIX_ROUND_EXPR
:
3062 return convert (TREE_TYPE (conversions
),
3063 convert_sequence (TREE_OPERAND (conversions
, 0),
3072 /* Return nonzero if REF is an lvalue valid for this language.
3073 Lvalues can be assigned, unless their type has TYPE_READONLY.
3074 Lvalues can have their address taken, unless they have DECL_REGISTER. */
3080 register enum tree_code code
= TREE_CODE (ref
);
3087 return lvalue_p (TREE_OPERAND (ref
, 0));
3098 return (TREE_CODE (TREE_TYPE (ref
)) != FUNCTION_TYPE
3099 && TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
);
3103 return TREE_CODE (TREE_TYPE (ref
)) == ARRAY_TYPE
;
3110 /* Return nonzero if REF is an lvalue valid for this language;
3111 otherwise, print an error message and return zero. */
3114 lvalue_or_else (ref
, msgid
)
3118 int win
= lvalue_p (ref
);
3121 error ("%s", msgid
);
3126 /* Apply unary lvalue-demanding operator CODE to the expression ARG
3127 for certain kinds of expressions which are not really lvalues
3128 but which we can accept as lvalues.
3130 If ARG is not a kind of expression we can handle, return zero. */
3133 unary_complex_lvalue (code
, arg
)
3134 enum tree_code code
;
3137 /* Handle (a, b) used as an "lvalue". */
3138 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
3140 tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 1), 0);
3142 /* If this returns a function type, it isn't really being used as
3143 an lvalue, so don't issue a warning about it. */
3144 if (TREE_CODE (TREE_TYPE (arg
)) != FUNCTION_TYPE
)
3145 pedantic_lvalue_warning (COMPOUND_EXPR
);
3147 return build (COMPOUND_EXPR
, TREE_TYPE (real_result
),
3148 TREE_OPERAND (arg
, 0), real_result
);
3151 /* Handle (a ? b : c) used as an "lvalue". */
3152 if (TREE_CODE (arg
) == COND_EXPR
)
3154 pedantic_lvalue_warning (COND_EXPR
);
3155 if (TREE_CODE (TREE_TYPE (arg
)) != FUNCTION_TYPE
)
3156 pedantic_lvalue_warning (COMPOUND_EXPR
);
3158 return (build_conditional_expr
3159 (TREE_OPERAND (arg
, 0),
3160 build_unary_op (code
, TREE_OPERAND (arg
, 1), 0),
3161 build_unary_op (code
, TREE_OPERAND (arg
, 2), 0)));
3167 /* If pedantic, warn about improper lvalue. CODE is either COND_EXPR
3168 COMPOUND_EXPR, or CONVERT_EXPR (for casts). */
3171 pedantic_lvalue_warning (code
)
3172 enum tree_code code
;
3178 pedwarn ("ANSI C forbids use of conditional expressions as lvalues");
3181 pedwarn ("ANSI C forbids use of compound expressions as lvalues");
3184 pedwarn ("ANSI C forbids use of cast expressions as lvalues");
3189 /* Warn about storing in something that is `const'. */
3192 readonly_warning (arg
, msgid
)
3196 /* Forbid assignments to iterators. */
3197 if (TREE_CODE (arg
) == VAR_DECL
&& ITERATOR_P (arg
))
3198 pedwarn ("%s of iterator `%s'", _(msgid
),
3199 IDENTIFIER_POINTER (DECL_NAME (arg
)));
3201 if (TREE_CODE (arg
) == COMPONENT_REF
)
3203 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg
, 0))))
3204 readonly_warning (TREE_OPERAND (arg
, 0), msgid
);
3206 pedwarn ("%s of read-only member `%s'", _(msgid
),
3207 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (arg
, 1))));
3209 else if (TREE_CODE (arg
) == VAR_DECL
)
3210 pedwarn ("%s of read-only variable `%s'", _(msgid
),
3211 IDENTIFIER_POINTER (DECL_NAME (arg
)));
3213 pedwarn ("%s of read-only location", _(msgid
));
3216 /* Mark EXP saying that we need to be able to take the
3217 address of it; it should not be allocated in a register.
3218 Value is 1 if successful. */
3221 mark_addressable (exp
)
3224 register tree x
= exp
;
3226 switch (TREE_CODE (x
))
3229 if (DECL_C_BIT_FIELD (TREE_OPERAND (x
, 1)))
3231 error ("cannot take address of bitfield `%s'",
3232 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (x
, 1))));
3236 /* ... fall through ... */
3242 x
= TREE_OPERAND (x
, 0);
3246 TREE_ADDRESSABLE (x
) = 1;
3253 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
3254 && DECL_NONLOCAL (x
))
3256 if (TREE_PUBLIC (x
))
3258 error ("global register variable `%s' used in nested function",
3259 IDENTIFIER_POINTER (DECL_NAME (x
)));
3262 pedwarn ("register variable `%s' used in nested function",
3263 IDENTIFIER_POINTER (DECL_NAME (x
)));
3265 else if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
))
3267 if (TREE_PUBLIC (x
))
3269 error ("address of global register variable `%s' requested",
3270 IDENTIFIER_POINTER (DECL_NAME (x
)));
3274 /* If we are making this addressable due to its having
3275 volatile components, give a different error message. Also
3276 handle the case of an unnamed parameter by not trying
3277 to give the name. */
3279 else if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (x
)))
3281 error ("cannot put object with volatile field into register");
3285 pedwarn ("address of register variable `%s' requested",
3286 IDENTIFIER_POINTER (DECL_NAME (x
)));
3288 put_var_into_stack (x
);
3292 TREE_ADDRESSABLE (x
) = 1;
3293 #if 0 /* poplevel deals with this now. */
3294 if (DECL_CONTEXT (x
) == 0)
3295 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x
)) = 1;
3303 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3306 build_conditional_expr (ifexp
, op1
, op2
)
3307 tree ifexp
, op1
, op2
;
3309 register tree type1
;
3310 register tree type2
;
3311 register enum tree_code code1
;
3312 register enum tree_code code2
;
3313 register tree result_type
= NULL
;
3314 tree orig_op1
= op1
, orig_op2
= op2
;
3316 ifexp
= truthvalue_conversion (default_conversion (ifexp
));
3318 #if 0 /* Produces wrong result if within sizeof. */
3319 /* Don't promote the operands separately if they promote
3320 the same way. Return the unpromoted type and let the combined
3321 value get promoted if necessary. */
3323 if (TREE_TYPE (op1
) == TREE_TYPE (op2
)
3324 && TREE_CODE (TREE_TYPE (op1
)) != ARRAY_TYPE
3325 && TREE_CODE (TREE_TYPE (op1
)) != ENUMERAL_TYPE
3326 && TREE_CODE (TREE_TYPE (op1
)) != FUNCTION_TYPE
)
3328 if (TREE_CODE (ifexp
) == INTEGER_CST
)
3329 return pedantic_non_lvalue (integer_zerop (ifexp
) ? op2
: op1
);
3331 return fold (build (COND_EXPR
, TREE_TYPE (op1
), ifexp
, op1
, op2
));
3335 /* Promote both alternatives. */
3337 if (TREE_CODE (TREE_TYPE (op1
)) != VOID_TYPE
)
3338 op1
= default_conversion (op1
);
3339 if (TREE_CODE (TREE_TYPE (op2
)) != VOID_TYPE
)
3340 op2
= default_conversion (op2
);
3342 if (TREE_CODE (ifexp
) == ERROR_MARK
3343 || TREE_CODE (TREE_TYPE (op1
)) == ERROR_MARK
3344 || TREE_CODE (TREE_TYPE (op2
)) == ERROR_MARK
)
3345 return error_mark_node
;
3347 type1
= TREE_TYPE (op1
);
3348 code1
= TREE_CODE (type1
);
3349 type2
= TREE_TYPE (op2
);
3350 code2
= TREE_CODE (type2
);
3352 /* Quickly detect the usual case where op1 and op2 have the same type
3354 if (TYPE_MAIN_VARIANT (type1
) == TYPE_MAIN_VARIANT (type2
))
3357 result_type
= type1
;
3359 result_type
= TYPE_MAIN_VARIANT (type1
);
3361 else if ((code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
)
3362 && (code2
== INTEGER_TYPE
|| code2
== REAL_TYPE
))
3364 result_type
= common_type (type1
, type2
);
3366 /* If -Wsign-compare, warn here if type1 and type2 have
3367 different signedness. We'll promote the signed to unsigned
3368 and later code won't know it used to be different.
3369 Do this check on the original types, so that explicit casts
3370 will be considered, but default promotions won't. */
3371 if ((warn_sign_compare
< 0 ? extra_warnings
: warn_sign_compare
)
3372 && !skip_evaluation
)
3374 int unsigned_op1
= TREE_UNSIGNED (TREE_TYPE (orig_op1
));
3375 int unsigned_op2
= TREE_UNSIGNED (TREE_TYPE (orig_op2
));
3377 if (unsigned_op1
^ unsigned_op2
)
3379 /* Do not warn if the result type is signed, since the
3380 signed type will only be chosen if it can represent
3381 all the values of the unsigned type. */
3382 if (! TREE_UNSIGNED (result_type
))
3384 /* Do not warn if the signed quantity is an unsuffixed
3385 integer literal (or some static constant expression
3386 involving such literals) and it is non-negative. */
3387 else if ((unsigned_op2
&& tree_expr_nonnegative_p (op1
))
3388 || (unsigned_op1
&& tree_expr_nonnegative_p (op2
)))
3391 warning ("signed and unsigned type in conditional expression");
3395 else if (code1
== VOID_TYPE
|| code2
== VOID_TYPE
)
3397 if (pedantic
&& (code1
!= VOID_TYPE
|| code2
!= VOID_TYPE
))
3398 pedwarn ("ANSI C forbids conditional expr with only one void side");
3399 result_type
= void_type_node
;
3401 else if (code1
== POINTER_TYPE
&& code2
== POINTER_TYPE
)
3403 if (comp_target_types (type1
, type2
))
3404 result_type
= common_type (type1
, type2
);
3405 else if (integer_zerop (op1
) && TREE_TYPE (type1
) == void_type_node
3406 && TREE_CODE (orig_op1
) != NOP_EXPR
)
3407 result_type
= qualify_type (type2
, type1
);
3408 else if (integer_zerop (op2
) && TREE_TYPE (type2
) == void_type_node
3409 && TREE_CODE (orig_op2
) != NOP_EXPR
)
3410 result_type
= qualify_type (type1
, type2
);
3411 else if (TYPE_MAIN_VARIANT (TREE_TYPE (type1
)) == void_type_node
)
3413 if (pedantic
&& TREE_CODE (TREE_TYPE (type2
)) == FUNCTION_TYPE
)
3414 pedwarn ("ANSI C forbids conditional expr between `void *' and function pointer");
3415 result_type
= qualify_type (type1
, type2
);
3417 else if (TYPE_MAIN_VARIANT (TREE_TYPE (type2
)) == void_type_node
)
3419 if (pedantic
&& TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
)
3420 pedwarn ("ANSI C forbids conditional expr between `void *' and function pointer");
3421 result_type
= qualify_type (type2
, type1
);
3425 pedwarn ("pointer type mismatch in conditional expression");
3426 result_type
= build_pointer_type (void_type_node
);
3429 else if (code1
== POINTER_TYPE
&& code2
== INTEGER_TYPE
)
3431 if (! integer_zerop (op2
))
3432 pedwarn ("pointer/integer type mismatch in conditional expression");
3435 op2
= null_pointer_node
;
3436 #if 0 /* The spec seems to say this is permitted. */
3437 if (pedantic
&& TREE_CODE (type1
) == FUNCTION_TYPE
)
3438 pedwarn ("ANSI C forbids conditional expr between 0 and function pointer");
3441 result_type
= type1
;
3443 else if (code2
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3445 if (!integer_zerop (op1
))
3446 pedwarn ("pointer/integer type mismatch in conditional expression");
3449 op1
= null_pointer_node
;
3450 #if 0 /* The spec seems to say this is permitted. */
3451 if (pedantic
&& TREE_CODE (type2
) == FUNCTION_TYPE
)
3452 pedwarn ("ANSI C forbids conditional expr between 0 and function pointer");
3455 result_type
= type2
;
3460 if (flag_cond_mismatch
)
3461 result_type
= void_type_node
;
3464 error ("type mismatch in conditional expression");
3465 return error_mark_node
;
3469 /* Merge const and volatile flags of the incoming types. */
3471 = build_type_variant (result_type
,
3472 TREE_READONLY (op1
) || TREE_READONLY (op2
),
3473 TREE_THIS_VOLATILE (op1
) || TREE_THIS_VOLATILE (op2
));
3475 if (result_type
!= TREE_TYPE (op1
))
3476 op1
= convert_and_check (result_type
, op1
);
3477 if (result_type
!= TREE_TYPE (op2
))
3478 op2
= convert_and_check (result_type
, op2
);
3480 if (TREE_CODE (ifexp
) == INTEGER_CST
)
3481 return pedantic_non_lvalue (integer_zerop (ifexp
) ? op2
: op1
);
3483 return fold (build (COND_EXPR
, result_type
, ifexp
, op1
, op2
));
3486 /* Given a list of expressions, return a compound expression
3487 that performs them all and returns the value of the last of them. */
3490 build_compound_expr (list
)
3493 return internal_build_compound_expr (list
, TRUE
);
3497 internal_build_compound_expr (list
, first_p
)
3503 if (TREE_CHAIN (list
) == 0)
3505 #if 0 /* If something inside inhibited lvalueness, we should not override. */
3506 /* Consider (x, y+0), which is not an lvalue since y+0 is not. */
3508 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3509 if (TREE_CODE (list
) == NON_LVALUE_EXPR
)
3510 list
= TREE_OPERAND (list
, 0);
3513 /* Don't let (0, 0) be null pointer constant. */
3514 if (!first_p
&& integer_zerop (TREE_VALUE (list
)))
3515 return non_lvalue (TREE_VALUE (list
));
3516 return TREE_VALUE (list
);
3519 if (TREE_CHAIN (list
) != 0 && TREE_CHAIN (TREE_CHAIN (list
)) == 0)
3521 /* Convert arrays to pointers when there really is a comma operator. */
3522 if (TREE_CODE (TREE_TYPE (TREE_VALUE (TREE_CHAIN (list
)))) == ARRAY_TYPE
)
3523 TREE_VALUE (TREE_CHAIN (list
))
3524 = default_conversion (TREE_VALUE (TREE_CHAIN (list
)));
3527 rest
= internal_build_compound_expr (TREE_CHAIN (list
), FALSE
);
3529 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list
)))
3531 /* The left-hand operand of a comma expression is like an expression
3532 statement: with -W or -Wunused, we should warn if it doesn't have
3533 any side-effects, unless it was explicitly cast to (void). */
3534 if ((extra_warnings
|| warn_unused
)
3535 && ! (TREE_CODE (TREE_VALUE (list
)) == CONVERT_EXPR
3536 && TREE_TYPE (TREE_VALUE (list
)) == void_type_node
))
3537 warning ("left-hand operand of comma expression has no effect");
3539 /* When pedantic, a compound expression can be neither an lvalue
3540 nor an integer constant expression. */
3545 /* With -Wunused, we should also warn if the left-hand operand does have
3546 side-effects, but computes a value which is not used. For example, in
3547 `foo() + bar(), baz()' the result of the `+' operator is not used,
3548 so we should issue a warning. */
3549 else if (warn_unused
)
3550 warn_if_unused_value (TREE_VALUE (list
));
3552 return build (COMPOUND_EXPR
, TREE_TYPE (rest
), TREE_VALUE (list
), rest
);
3555 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3558 build_c_cast (type
, expr
)
3562 register tree value
= expr
;
3564 if (type
== error_mark_node
|| expr
== error_mark_node
)
3565 return error_mark_node
;
3566 type
= TYPE_MAIN_VARIANT (type
);
3569 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3570 if (TREE_CODE (value
) == NON_LVALUE_EXPR
)
3571 value
= TREE_OPERAND (value
, 0);
3574 if (TREE_CODE (type
) == ARRAY_TYPE
)
3576 error ("cast specifies array type");
3577 return error_mark_node
;
3580 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3582 error ("cast specifies function type");
3583 return error_mark_node
;
3586 if (type
== TREE_TYPE (value
))
3590 if (TREE_CODE (type
) == RECORD_TYPE
3591 || TREE_CODE (type
) == UNION_TYPE
)
3592 pedwarn ("ANSI C forbids casting nonscalar to the same type");
3595 else if (TREE_CODE (type
) == UNION_TYPE
)
3598 if (TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
3599 || TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
)
3600 value
= default_conversion (value
);
3602 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
3603 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field
)),
3604 TYPE_MAIN_VARIANT (TREE_TYPE (value
))))
3613 pedwarn ("ANSI C forbids casts to union type");
3614 if (TYPE_NAME (type
) != 0)
3616 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
3617 name
= IDENTIFIER_POINTER (TYPE_NAME (type
));
3619 name
= IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
)));
3623 t
= digest_init (type
, build (CONSTRUCTOR
, type
, NULL_TREE
,
3624 build_tree_list (field
, value
)),
3626 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
3629 error ("cast to union type from type not present in union");
3630 return error_mark_node
;
3636 /* If casting to void, avoid the error that would come
3637 from default_conversion in the case of a non-lvalue array. */
3638 if (type
== void_type_node
)
3639 return build1 (CONVERT_EXPR
, type
, value
);
3641 /* Convert functions and arrays to pointers,
3642 but don't convert any other types. */
3643 if (TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
3644 || TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
)
3645 value
= default_conversion (value
);
3646 otype
= TREE_TYPE (value
);
3648 /* Optionally warn about potentially worrisome casts. */
3651 && TREE_CODE (type
) == POINTER_TYPE
3652 && TREE_CODE (otype
) == POINTER_TYPE
)
3654 tree in_type
= type
;
3655 tree in_otype
= otype
;
3658 /* Check that the qualifiers on IN_TYPE are a superset of
3659 the qualifiers of IN_OTYPE. The outermost level of
3660 POINTER_TYPE nodes is uninteresting and we stop as soon
3661 as we hit a non-POINTER_TYPE node on either type. */
3664 in_otype
= TREE_TYPE (in_otype
);
3665 in_type
= TREE_TYPE (in_type
);
3666 warn
|= (TYPE_QUALS (in_otype
) & ~TYPE_QUALS (in_type
));
3668 while (TREE_CODE (in_type
) == POINTER_TYPE
3669 && TREE_CODE (in_otype
) == POINTER_TYPE
);
3672 /* There are qualifiers present in IN_OTYPE that are not
3673 present in IN_TYPE. */
3674 pedwarn ("cast discards qualifiers from pointer target type");
3677 /* Warn about possible alignment problems. */
3678 if (STRICT_ALIGNMENT
&& warn_cast_align
3679 && TREE_CODE (type
) == POINTER_TYPE
3680 && TREE_CODE (otype
) == POINTER_TYPE
3681 && TREE_CODE (TREE_TYPE (otype
)) != VOID_TYPE
3682 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
3683 /* Don't warn about opaque types, where the actual alignment
3684 restriction is unknown. */
3685 && !((TREE_CODE (TREE_TYPE (otype
)) == UNION_TYPE
3686 || TREE_CODE (TREE_TYPE (otype
)) == RECORD_TYPE
)
3687 && TYPE_MODE (TREE_TYPE (otype
)) == VOIDmode
)
3688 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (otype
)))
3689 warning ("cast increases required alignment of target type");
3691 if (TREE_CODE (type
) == INTEGER_TYPE
3692 && TREE_CODE (otype
) == POINTER_TYPE
3693 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
3694 && !TREE_CONSTANT (value
))
3695 warning ("cast from pointer to integer of different size");
3697 if (warn_bad_function_cast
3698 && TREE_CODE (value
) == CALL_EXPR
3699 && TREE_CODE (type
) != TREE_CODE (otype
))
3700 warning ("cast does not match function type");
3702 if (TREE_CODE (type
) == POINTER_TYPE
3703 && TREE_CODE (otype
) == INTEGER_TYPE
3704 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
3706 /* Don't warn about converting 0 to pointer,
3707 provided the 0 was explicit--not cast or made by folding. */
3708 && !(TREE_CODE (value
) == INTEGER_CST
&& integer_zerop (value
))
3710 /* Don't warn about converting any constant. */
3711 && !TREE_CONSTANT (value
))
3712 warning ("cast to pointer from integer of different size");
3715 value
= convert (type
, value
);
3717 /* Ignore any integer overflow caused by the cast. */
3718 if (TREE_CODE (value
) == INTEGER_CST
)
3720 TREE_OVERFLOW (value
) = TREE_OVERFLOW (ovalue
);
3721 TREE_CONSTANT_OVERFLOW (value
) = TREE_CONSTANT_OVERFLOW (ovalue
);
3725 /* Pedantically, don't ley (void *) (FOO *) 0 be a null pointer constant. */
3726 if (pedantic
&& TREE_CODE (value
) == INTEGER_CST
3727 && TREE_CODE (expr
) == INTEGER_CST
3728 && TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
)
3729 value
= non_lvalue (value
);
3731 /* If pedantic, don't let a cast be an lvalue. */
3732 if (value
== expr
&& pedantic
)
3733 value
= non_lvalue (value
);
3738 /* Build an assignment expression of lvalue LHS from value RHS.
3739 MODIFYCODE is the code for a binary operator that we use
3740 to combine the old value of LHS with RHS to get the new value.
3741 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3744 build_modify_expr (lhs
, modifycode
, rhs
)
3746 enum tree_code modifycode
;
3748 register tree result
;
3750 tree lhstype
= TREE_TYPE (lhs
);
3751 tree olhstype
= lhstype
;
3753 /* Types that aren't fully specified cannot be used in assignments. */
3754 lhs
= require_complete_type (lhs
);
3756 /* Avoid duplicate error messages from operands that had errors. */
3757 if (TREE_CODE (lhs
) == ERROR_MARK
|| TREE_CODE (rhs
) == ERROR_MARK
)
3758 return error_mark_node
;
3760 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3761 /* Do not use STRIP_NOPS here. We do not want an enumerator
3762 whose value is 0 to count as a null pointer constant. */
3763 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
3764 rhs
= TREE_OPERAND (rhs
, 0);
3768 /* Handle control structure constructs used as "lvalues". */
3770 switch (TREE_CODE (lhs
))
3772 /* Handle (a, b) used as an "lvalue". */
3774 pedantic_lvalue_warning (COMPOUND_EXPR
);
3775 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 1), modifycode
, rhs
);
3776 if (TREE_CODE (newrhs
) == ERROR_MARK
)
3777 return error_mark_node
;
3778 return build (COMPOUND_EXPR
, lhstype
,
3779 TREE_OPERAND (lhs
, 0), newrhs
);
3781 /* Handle (a ? b : c) used as an "lvalue". */
3783 pedantic_lvalue_warning (COND_EXPR
);
3784 rhs
= save_expr (rhs
);
3786 /* Produce (a ? (b = rhs) : (c = rhs))
3787 except that the RHS goes through a save-expr
3788 so the code to compute it is only emitted once. */
3790 = build_conditional_expr (TREE_OPERAND (lhs
, 0),
3791 build_modify_expr (TREE_OPERAND (lhs
, 1),
3793 build_modify_expr (TREE_OPERAND (lhs
, 2),
3795 if (TREE_CODE (cond
) == ERROR_MARK
)
3797 /* Make sure the code to compute the rhs comes out
3798 before the split. */
3799 return build (COMPOUND_EXPR
, TREE_TYPE (lhs
),
3800 /* But cast it to void to avoid an "unused" error. */
3801 convert (void_type_node
, rhs
), cond
);
3807 /* If a binary op has been requested, combine the old LHS value with the RHS
3808 producing the value we should actually store into the LHS. */
3810 if (modifycode
!= NOP_EXPR
)
3812 lhs
= stabilize_reference (lhs
);
3813 newrhs
= build_binary_op (modifycode
, lhs
, rhs
, 1);
3816 /* Handle a cast used as an "lvalue".
3817 We have already performed any binary operator using the value as cast.
3818 Now convert the result to the cast type of the lhs,
3819 and then true type of the lhs and store it there;
3820 then convert result back to the cast type to be the value
3821 of the assignment. */
3823 switch (TREE_CODE (lhs
))
3828 case FIX_TRUNC_EXPR
:
3829 case FIX_FLOOR_EXPR
:
3830 case FIX_ROUND_EXPR
:
3832 if (TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
3833 || TREE_CODE (TREE_TYPE (newrhs
)) == FUNCTION_TYPE
)
3834 newrhs
= default_conversion (newrhs
);
3836 tree inner_lhs
= TREE_OPERAND (lhs
, 0);
3838 result
= build_modify_expr (inner_lhs
, NOP_EXPR
,
3839 convert (TREE_TYPE (inner_lhs
),
3840 convert (lhstype
, newrhs
)));
3841 if (TREE_CODE (result
) == ERROR_MARK
)
3843 pedantic_lvalue_warning (CONVERT_EXPR
);
3844 return convert (TREE_TYPE (lhs
), result
);
3851 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
3852 Reject anything strange now. */
3854 if (!lvalue_or_else (lhs
, "invalid lvalue in assignment"))
3855 return error_mark_node
;
3857 /* Warn about storing in something that is `const'. */
3859 if (TREE_READONLY (lhs
) || TYPE_READONLY (lhstype
)
3860 || ((TREE_CODE (lhstype
) == RECORD_TYPE
3861 || TREE_CODE (lhstype
) == UNION_TYPE
)
3862 && C_TYPE_FIELDS_READONLY (lhstype
)))
3863 readonly_warning (lhs
, "assignment");
3865 /* If storing into a structure or union member,
3866 it has probably been given type `int'.
3867 Compute the type that would go with
3868 the actual amount of storage the member occupies. */
3870 if (TREE_CODE (lhs
) == COMPONENT_REF
3871 && (TREE_CODE (lhstype
) == INTEGER_TYPE
3872 || TREE_CODE (lhstype
) == REAL_TYPE
3873 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
3874 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
3876 /* If storing in a field that is in actuality a short or narrower than one,
3877 we must store in the field in its actual type. */
3879 if (lhstype
!= TREE_TYPE (lhs
))
3881 lhs
= copy_node (lhs
);
3882 TREE_TYPE (lhs
) = lhstype
;
3885 /* Convert new value to destination type. */
3887 newrhs
= convert_for_assignment (lhstype
, newrhs
, _("assignment"),
3888 NULL_TREE
, NULL_TREE
, 0);
3889 if (TREE_CODE (newrhs
) == ERROR_MARK
)
3890 return error_mark_node
;
3892 result
= build (MODIFY_EXPR
, lhstype
, lhs
, newrhs
);
3893 TREE_SIDE_EFFECTS (result
) = 1;
3895 /* If we got the LHS in a different type for storing in,
3896 convert the result back to the nominal type of LHS
3897 so that the value we return always has the same type
3898 as the LHS argument. */
3900 if (olhstype
== TREE_TYPE (result
))
3902 return convert_for_assignment (olhstype
, result
, _("assignment"),
3903 NULL_TREE
, NULL_TREE
, 0);
3906 /* Convert value RHS to type TYPE as preparation for an assignment
3907 to an lvalue of type TYPE.
3908 The real work of conversion is done by `convert'.
3909 The purpose of this function is to generate error messages
3910 for assignments that are not allowed in C.
3911 ERRTYPE is a string to use in error messages:
3912 "assignment", "return", etc. If it is null, this is parameter passing
3913 for a function call (and different error messages are output).
3915 FUNNAME is the name of the function being called,
3916 as an IDENTIFIER_NODE, or null.
3917 PARMNUM is the number of the argument, for printing in error messages. */
3920 convert_for_assignment (type
, rhs
, errtype
, fundecl
, funname
, parmnum
)
3922 const char *errtype
;
3923 tree fundecl
, funname
;
3926 register enum tree_code codel
= TREE_CODE (type
);
3927 register tree rhstype
;
3928 register enum tree_code coder
;
3930 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3931 /* Do not use STRIP_NOPS here. We do not want an enumerator
3932 whose value is 0 to count as a null pointer constant. */
3933 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
3934 rhs
= TREE_OPERAND (rhs
, 0);
3936 if (TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
3937 || TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
)
3938 rhs
= default_conversion (rhs
);
3939 else if (optimize
&& TREE_CODE (rhs
) == VAR_DECL
)
3940 rhs
= decl_constant_value (rhs
);
3942 rhstype
= TREE_TYPE (rhs
);
3943 coder
= TREE_CODE (rhstype
);
3945 if (coder
== ERROR_MARK
)
3946 return error_mark_node
;
3948 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (rhstype
))
3950 overflow_warning (rhs
);
3951 /* Check for Objective-C protocols. This will issue a warning if
3952 there are protocol violations. No need to use the return value. */
3953 maybe_objc_comptypes (type
, rhstype
, 0);
3957 if (coder
== VOID_TYPE
)
3959 error ("void value not ignored as it ought to be");
3960 return error_mark_node
;
3962 /* A type converts to a reference to it.
3963 This code doesn't fully support references, it's just for the
3964 special case of va_start and va_copy. */
3965 if (codel
== REFERENCE_TYPE
3966 && comptypes (TREE_TYPE (type
), TREE_TYPE (rhs
)) == 1)
3968 if (mark_addressable (rhs
) == 0)
3969 return error_mark_node
;
3970 rhs
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (rhs
)), rhs
);
3972 /* We already know that these two types are compatible, but they
3973 may not be exactly identical. In fact, `TREE_TYPE (type)' is
3974 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
3975 likely to be va_list, a typedef to __builtin_va_list, which
3976 is different enough that it will cause problems later. */
3977 if (TREE_TYPE (TREE_TYPE (rhs
)) != TREE_TYPE (type
))
3978 rhs
= build1 (NOP_EXPR
, build_pointer_type (TREE_TYPE (type
)), rhs
);
3980 rhs
= build1 (NOP_EXPR
, type
, rhs
);
3983 /* Arithmetic types all interconvert, and enum is treated like int. */
3984 else if ((codel
== INTEGER_TYPE
|| codel
== REAL_TYPE
3985 || codel
== ENUMERAL_TYPE
|| codel
== COMPLEX_TYPE
)
3986 && (coder
== INTEGER_TYPE
|| coder
== REAL_TYPE
3987 || coder
== ENUMERAL_TYPE
|| coder
== COMPLEX_TYPE
))
3988 return convert_and_check (type
, rhs
);
3990 /* Conversion to a transparent union from its member types.
3991 This applies only to function arguments. */
3992 else if (codel
== UNION_TYPE
&& TYPE_TRANSPARENT_UNION (type
) && ! errtype
)
3995 tree marginal_memb_type
= 0;
3997 for (memb_types
= TYPE_FIELDS (type
); memb_types
;
3998 memb_types
= TREE_CHAIN (memb_types
))
4000 tree memb_type
= TREE_TYPE (memb_types
);
4002 if (comptypes (TYPE_MAIN_VARIANT (memb_type
),
4003 TYPE_MAIN_VARIANT (rhstype
)))
4006 if (TREE_CODE (memb_type
) != POINTER_TYPE
)
4009 if (coder
== POINTER_TYPE
)
4011 register tree ttl
= TREE_TYPE (memb_type
);
4012 register tree ttr
= TREE_TYPE (rhstype
);
4014 /* Any non-function converts to a [const][volatile] void *
4015 and vice versa; otherwise, targets must be the same.
4016 Meanwhile, the lhs target must have all the qualifiers of
4018 if (TYPE_MAIN_VARIANT (ttl
) == void_type_node
4019 || TYPE_MAIN_VARIANT (ttr
) == void_type_node
4020 || comp_target_types (memb_type
, rhstype
))
4022 /* If this type won't generate any warnings, use it. */
4023 if (TYPE_QUALS (ttl
) == TYPE_QUALS (ttr
)
4024 || ((TREE_CODE (ttr
) == FUNCTION_TYPE
4025 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
4026 ? ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
4027 == TYPE_QUALS (ttr
))
4028 : ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
4029 == TYPE_QUALS (ttl
))))
4032 /* Keep looking for a better type, but remember this one. */
4033 if (! marginal_memb_type
)
4034 marginal_memb_type
= memb_type
;
4038 /* Can convert integer zero to any pointer type. */
4039 if (integer_zerop (rhs
)
4040 || (TREE_CODE (rhs
) == NOP_EXPR
4041 && integer_zerop (TREE_OPERAND (rhs
, 0))))
4043 rhs
= null_pointer_node
;
4048 if (memb_types
|| marginal_memb_type
)
4052 /* We have only a marginally acceptable member type;
4053 it needs a warning. */
4054 register tree ttl
= TREE_TYPE (marginal_memb_type
);
4055 register tree ttr
= TREE_TYPE (rhstype
);
4057 /* Const and volatile mean something different for function
4058 types, so the usual warnings are not appropriate. */
4059 if (TREE_CODE (ttr
) == FUNCTION_TYPE
4060 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
4062 /* Because const and volatile on functions are
4063 restrictions that say the function will not do
4064 certain things, it is okay to use a const or volatile
4065 function where an ordinary one is wanted, but not
4067 if (TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
))
4068 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4069 errtype
, funname
, parmnum
);
4071 else if (TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
))
4072 warn_for_assignment ("%s discards qualifiers from pointer target type",
4077 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (fundecl
))
4078 pedwarn ("ANSI C prohibits argument conversion to union type");
4080 return build1 (NOP_EXPR
, type
, rhs
);
4084 /* Conversions among pointers */
4085 else if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
4086 && (coder
== POINTER_TYPE
|| coder
== REFERENCE_TYPE
))
4088 register tree ttl
= TREE_TYPE (type
);
4089 register tree ttr
= TREE_TYPE (rhstype
);
4091 /* Any non-function converts to a [const][volatile] void *
4092 and vice versa; otherwise, targets must be the same.
4093 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4094 if (TYPE_MAIN_VARIANT (ttl
) == void_type_node
4095 || TYPE_MAIN_VARIANT (ttr
) == void_type_node
4096 || comp_target_types (type
, rhstype
)
4097 || (unsigned_type (TYPE_MAIN_VARIANT (ttl
))
4098 == unsigned_type (TYPE_MAIN_VARIANT (ttr
))))
4101 && ((TYPE_MAIN_VARIANT (ttl
) == void_type_node
4102 && TREE_CODE (ttr
) == FUNCTION_TYPE
)
4104 (TYPE_MAIN_VARIANT (ttr
) == void_type_node
4105 /* Check TREE_CODE to catch cases like (void *) (char *) 0
4106 which are not ANSI null ptr constants. */
4107 && (!integer_zerop (rhs
) || TREE_CODE (rhs
) == NOP_EXPR
)
4108 && TREE_CODE (ttl
) == FUNCTION_TYPE
)))
4109 warn_for_assignment ("ANSI forbids %s between function pointer and `void *'",
4110 errtype
, funname
, parmnum
);
4111 /* Const and volatile mean something different for function types,
4112 so the usual warnings are not appropriate. */
4113 else if (TREE_CODE (ttr
) != FUNCTION_TYPE
4114 && TREE_CODE (ttl
) != FUNCTION_TYPE
)
4116 if (TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
))
4117 warn_for_assignment ("%s discards qualifiers from pointer target type",
4118 errtype
, funname
, parmnum
);
4119 /* If this is not a case of ignoring a mismatch in signedness,
4121 else if (TYPE_MAIN_VARIANT (ttl
) == void_type_node
4122 || TYPE_MAIN_VARIANT (ttr
) == void_type_node
4123 || comp_target_types (type
, rhstype
))
4125 /* If there is a mismatch, do warn. */
4127 warn_for_assignment ("pointer targets in %s differ in signedness",
4128 errtype
, funname
, parmnum
);
4130 else if (TREE_CODE (ttl
) == FUNCTION_TYPE
4131 && TREE_CODE (ttr
) == FUNCTION_TYPE
)
4133 /* Because const and volatile on functions are restrictions
4134 that say the function will not do certain things,
4135 it is okay to use a const or volatile function
4136 where an ordinary one is wanted, but not vice-versa. */
4137 if (TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
))
4138 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4139 errtype
, funname
, parmnum
);
4143 warn_for_assignment ("%s from incompatible pointer type",
4144 errtype
, funname
, parmnum
);
4145 return convert (type
, rhs
);
4147 else if (codel
== POINTER_TYPE
&& coder
== INTEGER_TYPE
)
4149 /* An explicit constant 0 can convert to a pointer,
4150 or one that results from arithmetic, even including
4151 a cast to integer type. */
4152 if (! (TREE_CODE (rhs
) == INTEGER_CST
&& integer_zerop (rhs
))
4154 ! (TREE_CODE (rhs
) == NOP_EXPR
4155 && TREE_CODE (TREE_TYPE (rhs
)) == INTEGER_TYPE
4156 && TREE_CODE (TREE_OPERAND (rhs
, 0)) == INTEGER_CST
4157 && integer_zerop (TREE_OPERAND (rhs
, 0))))
4159 warn_for_assignment ("%s makes pointer from integer without a cast",
4160 errtype
, funname
, parmnum
);
4161 return convert (type
, rhs
);
4163 return null_pointer_node
;
4165 else if (codel
== INTEGER_TYPE
&& coder
== POINTER_TYPE
)
4167 warn_for_assignment ("%s makes integer from pointer without a cast",
4168 errtype
, funname
, parmnum
);
4169 return convert (type
, rhs
);
4176 tree selector
= maybe_building_objc_message_expr ();
4178 if (selector
&& parmnum
> 2)
4179 error ("incompatible type for argument %d of `%s'",
4180 parmnum
- 2, IDENTIFIER_POINTER (selector
));
4182 error ("incompatible type for argument %d of `%s'",
4183 parmnum
, IDENTIFIER_POINTER (funname
));
4186 error ("incompatible type for argument %d of indirect function call",
4190 error ("incompatible types in %s", errtype
);
4192 return error_mark_node
;
4195 /* Print a warning using MSGID.
4196 It gets OPNAME as its one parameter.
4197 If OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
4198 FUNCTION and ARGNUM are handled specially if we are building an
4199 Objective-C selector. */
4202 warn_for_assignment (msgid
, opname
, function
, argnum
)
4210 tree selector
= maybe_building_objc_message_expr ();
4213 if (selector
&& argnum
> 2)
4215 function
= selector
;
4220 /* Function name is known; supply it. */
4221 const char *argstring
= _("passing arg %d of `%s'");
4222 new_opname
= (char *) alloca (IDENTIFIER_LENGTH (function
)
4223 + strlen (argstring
) + 1 + 25
4225 sprintf (new_opname
, argstring
, argnum
,
4226 IDENTIFIER_POINTER (function
));
4230 /* Function name unknown (call through ptr); just give arg number.*/
4231 const char *argnofun
= _("passing arg %d of pointer to function");
4232 new_opname
= (char *) alloca (strlen (argnofun
) + 1 + 25 /*%d*/ + 1);
4233 sprintf (new_opname
, argnofun
, argnum
);
4235 opname
= new_opname
;
4237 pedwarn (msgid
, opname
);
4240 /* If VALUE is a compound expr all of whose expressions are constant, then
4241 return its value. Otherwise, return error_mark_node.
4243 This is for handling COMPOUND_EXPRs as initializer elements
4244 which is allowed with a warning when -pedantic is specified. */
4247 valid_compound_expr_initializer (value
, endtype
)
4251 if (TREE_CODE (value
) == COMPOUND_EXPR
)
4253 if (valid_compound_expr_initializer (TREE_OPERAND (value
, 0), endtype
)
4255 return error_mark_node
;
4256 return valid_compound_expr_initializer (TREE_OPERAND (value
, 1),
4259 else if (! TREE_CONSTANT (value
)
4260 && ! initializer_constant_valid_p (value
, endtype
))
4261 return error_mark_node
;
4266 /* Perform appropriate conversions on the initial value of a variable,
4267 store it in the declaration DECL,
4268 and print any error messages that are appropriate.
4269 If the init is invalid, store an ERROR_MARK. */
4272 store_init_value (decl
, init
)
4275 register tree value
, type
;
4277 /* If variable's type was invalidly declared, just ignore it. */
4279 type
= TREE_TYPE (decl
);
4280 if (TREE_CODE (type
) == ERROR_MARK
)
4283 /* Digest the specified initializer into an expression. */
4285 value
= digest_init (type
, init
, TREE_STATIC (decl
),
4286 TREE_STATIC (decl
) || pedantic
);
4288 /* Store the expression if valid; else report error. */
4291 /* Note that this is the only place we can detect the error
4292 in a case such as struct foo bar = (struct foo) { x, y };
4293 where there is one initial value which is a constructor expression. */
4294 if (value
== error_mark_node
)
4296 else if (TREE_STATIC (decl
) && ! TREE_CONSTANT (value
))
4298 error ("initializer for static variable is not constant");
4299 value
= error_mark_node
;
4301 else if (TREE_STATIC (decl
)
4302 && initializer_constant_valid_p (value
, TREE_TYPE (value
)) == 0)
4304 error ("initializer for static variable uses complicated arithmetic");
4305 value
= error_mark_node
;
4309 if (pedantic
&& TREE_CODE (value
) == CONSTRUCTOR
)
4311 if (! TREE_CONSTANT (value
))
4312 pedwarn ("aggregate initializer is not constant");
4313 else if (! TREE_STATIC (value
))
4314 pedwarn ("aggregate initializer uses complicated arithmetic");
4319 DECL_INITIAL (decl
) = value
;
4321 /* ANSI wants warnings about out-of-range constant initializers. */
4322 STRIP_TYPE_NOPS (value
);
4323 constant_expression_warning (value
);
4326 /* Methods for storing and printing names for error messages. */
4328 /* Implement a spelling stack that allows components of a name to be pushed
4329 and popped. Each element on the stack is this structure. */
4341 #define SPELLING_STRING 1
4342 #define SPELLING_MEMBER 2
4343 #define SPELLING_BOUNDS 3
4345 static struct spelling
*spelling
; /* Next stack element (unused). */
4346 static struct spelling
*spelling_base
; /* Spelling stack base. */
4347 static int spelling_size
; /* Size of the spelling stack. */
4349 /* Macros to save and restore the spelling stack around push_... functions.
4350 Alternative to SAVE_SPELLING_STACK. */
4352 #define SPELLING_DEPTH() (spelling - spelling_base)
4353 #define RESTORE_SPELLING_DEPTH(depth) (spelling = spelling_base + depth)
4355 /* Save and restore the spelling stack around arbitrary C code. */
4357 #define SAVE_SPELLING_DEPTH(code) \
4359 int __depth = SPELLING_DEPTH (); \
4361 RESTORE_SPELLING_DEPTH (__depth); \
4364 /* Push an element on the spelling stack with type KIND and assign VALUE
4367 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4369 int depth = SPELLING_DEPTH (); \
4371 if (depth >= spelling_size) \
4373 spelling_size += 10; \
4374 if (spelling_base == 0) \
4376 = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \
4379 = (struct spelling *) xrealloc (spelling_base, \
4380 spelling_size * sizeof (struct spelling)); \
4381 RESTORE_SPELLING_DEPTH (depth); \
4384 spelling->kind = (KIND); \
4385 spelling->MEMBER = (VALUE); \
4389 /* Push STRING on the stack. Printed literally. */
4392 push_string (string
)
4395 PUSH_SPELLING (SPELLING_STRING
, string
, u
.s
);
4398 /* Push a member name on the stack. Printed as '.' STRING. */
4401 push_member_name (decl
)
4406 = DECL_NAME (decl
) ? IDENTIFIER_POINTER (DECL_NAME (decl
)) : "<anonymous>";
4407 PUSH_SPELLING (SPELLING_MEMBER
, string
, u
.s
);
4410 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4413 push_array_bounds (bounds
)
4416 PUSH_SPELLING (SPELLING_BOUNDS
, bounds
, u
.i
);
4419 /* Compute the maximum size in bytes of the printed spelling. */
4424 register int size
= 0;
4425 register struct spelling
*p
;
4427 for (p
= spelling_base
; p
< spelling
; p
++)
4429 if (p
->kind
== SPELLING_BOUNDS
)
4432 size
+= strlen (p
->u
.s
) + 1;
4438 /* Print the spelling to BUFFER and return it. */
4441 print_spelling (buffer
)
4442 register char *buffer
;
4444 register char *d
= buffer
;
4445 register struct spelling
*p
;
4447 for (p
= spelling_base
; p
< spelling
; p
++)
4448 if (p
->kind
== SPELLING_BOUNDS
)
4450 sprintf (d
, "[%d]", p
->u
.i
);
4455 register const char *s
;
4456 if (p
->kind
== SPELLING_MEMBER
)
4458 for (s
= p
->u
.s
; (*d
= *s
++); d
++)
4465 /* Issue an error message for a bad initializer component.
4466 MSGID identifies the message.
4467 The component name is taken from the spelling stack. */
4475 error ("%s", msgid
);
4476 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4478 error ("(near initialization for `%s')", ofwhat
);
4481 /* Issue a pedantic warning for a bad initializer component.
4482 MSGID identifies the message.
4483 The component name is taken from the spelling stack. */
4486 pedwarn_init (msgid
)
4491 pedwarn ("%s", msgid
);
4492 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4494 pedwarn ("(near initialization for `%s')", ofwhat
);
4497 /* Issue a warning for a bad initializer component.
4498 MSGID identifies the message.
4499 The component name is taken from the spelling stack. */
4502 warning_init (msgid
)
4507 warning ("%s", msgid
);
4508 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4510 warning ("(near initialization for `%s')", ofwhat
);
4513 /* Digest the parser output INIT as an initializer for type TYPE.
4514 Return a C expression of type TYPE to represent the initial value.
4516 The arguments REQUIRE_CONSTANT and CONSTRUCTOR_CONSTANT request errors
4517 if non-constant initializers or elements are seen. CONSTRUCTOR_CONSTANT
4518 applies only to elements of constructors. */
4521 digest_init (type
, init
, require_constant
, constructor_constant
)
4523 int require_constant
, constructor_constant
;
4525 enum tree_code code
= TREE_CODE (type
);
4526 tree inside_init
= init
;
4528 if (type
== error_mark_node
|| init
== error_mark_node
)
4529 return error_mark_node
;
4531 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4532 /* Do not use STRIP_NOPS here. We do not want an enumerator
4533 whose value is 0 to count as a null pointer constant. */
4534 if (TREE_CODE (init
) == NON_LVALUE_EXPR
)
4535 inside_init
= TREE_OPERAND (init
, 0);
4537 /* Initialization of an array of chars from a string constant
4538 optionally enclosed in braces. */
4540 if (code
== ARRAY_TYPE
)
4542 tree typ1
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
4543 if ((typ1
== char_type_node
4544 || typ1
== signed_char_type_node
4545 || typ1
== unsigned_char_type_node
4546 || typ1
== unsigned_wchar_type_node
4547 || typ1
== signed_wchar_type_node
)
4548 && ((inside_init
&& TREE_CODE (inside_init
) == STRING_CST
)))
4550 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4551 TYPE_MAIN_VARIANT (type
)))
4554 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init
)))
4556 && TYPE_PRECISION (typ1
) == TYPE_PRECISION (char_type_node
))
4558 error_init ("char-array initialized from wide string");
4559 return error_mark_node
;
4561 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init
)))
4563 && TYPE_PRECISION (typ1
) != TYPE_PRECISION (char_type_node
))
4565 error_init ("int-array initialized from non-wide string");
4566 return error_mark_node
;
4569 TREE_TYPE (inside_init
) = type
;
4570 if (TYPE_DOMAIN (type
) != 0
4571 && TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
4572 /* Subtract 1 (or sizeof (wchar_t))
4573 because it's ok to ignore the terminating null char
4574 that is counted in the length of the constant. */
4575 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type
),
4576 TREE_STRING_LENGTH (inside_init
)
4577 - ((TYPE_PRECISION (typ1
)
4578 != TYPE_PRECISION (char_type_node
))
4579 ? (TYPE_PRECISION (wchar_type_node
)
4582 pedwarn_init ("initializer-string for array of chars is too long");
4588 /* Any type can be initialized
4589 from an expression of the same type, optionally with braces. */
4591 if (inside_init
&& TREE_TYPE (inside_init
) != 0
4592 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4593 TYPE_MAIN_VARIANT (type
))
4594 || (code
== ARRAY_TYPE
4595 && comptypes (TREE_TYPE (inside_init
), type
))
4596 || (code
== POINTER_TYPE
4597 && (TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
4598 || TREE_CODE (TREE_TYPE (inside_init
)) == FUNCTION_TYPE
)
4599 && comptypes (TREE_TYPE (TREE_TYPE (inside_init
)),
4600 TREE_TYPE (type
)))))
4602 if (code
== POINTER_TYPE
4603 && (TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
4604 || TREE_CODE (TREE_TYPE (inside_init
)) == FUNCTION_TYPE
))
4605 inside_init
= default_conversion (inside_init
);
4606 else if (code
== ARRAY_TYPE
&& TREE_CODE (inside_init
) != STRING_CST
4607 && TREE_CODE (inside_init
) != CONSTRUCTOR
)
4609 error_init ("array initialized from non-constant array expression");
4610 return error_mark_node
;
4613 if (optimize
&& TREE_CODE (inside_init
) == VAR_DECL
)
4614 inside_init
= decl_constant_value (inside_init
);
4616 /* Compound expressions can only occur here if -pedantic or
4617 -pedantic-errors is specified. In the later case, we always want
4618 an error. In the former case, we simply want a warning. */
4619 if (require_constant
&& pedantic
4620 && TREE_CODE (inside_init
) == COMPOUND_EXPR
)
4623 = valid_compound_expr_initializer (inside_init
,
4624 TREE_TYPE (inside_init
));
4625 if (inside_init
== error_mark_node
)
4626 error_init ("initializer element is not constant");
4628 pedwarn_init ("initializer element is not constant");
4629 if (flag_pedantic_errors
)
4630 inside_init
= error_mark_node
;
4632 else if (require_constant
&& ! TREE_CONSTANT (inside_init
))
4634 error_init ("initializer element is not constant");
4635 inside_init
= error_mark_node
;
4637 else if (require_constant
4638 && initializer_constant_valid_p (inside_init
, TREE_TYPE (inside_init
)) == 0)
4640 error_init ("initializer element is not computable at load time");
4641 inside_init
= error_mark_node
;
4647 /* Handle scalar types, including conversions. */
4649 if (code
== INTEGER_TYPE
|| code
== REAL_TYPE
|| code
== POINTER_TYPE
4650 || code
== ENUMERAL_TYPE
|| code
== COMPLEX_TYPE
)
4652 /* Note that convert_for_assignment calls default_conversion
4653 for arrays and functions. We must not call it in the
4654 case where inside_init is a null pointer constant. */
4656 = convert_for_assignment (type
, init
, _("initialization"),
4657 NULL_TREE
, NULL_TREE
, 0);
4659 if (require_constant
&& ! TREE_CONSTANT (inside_init
))
4661 error_init ("initializer element is not constant");
4662 inside_init
= error_mark_node
;
4664 else if (require_constant
4665 && initializer_constant_valid_p (inside_init
, TREE_TYPE (inside_init
)) == 0)
4667 error_init ("initializer element is not computable at load time");
4668 inside_init
= error_mark_node
;
4674 /* Come here only for records and arrays. */
4676 if (COMPLETE_TYPE_P (type
) && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4678 error_init ("variable-sized object may not be initialized");
4679 return error_mark_node
;
4682 /* Traditionally, you can write struct foo x = 0;
4683 and it initializes the first element of x to 0. */
4684 if (flag_traditional
)
4686 tree top
= 0, prev
= 0, otype
= type
;
4687 while (TREE_CODE (type
) == RECORD_TYPE
4688 || TREE_CODE (type
) == ARRAY_TYPE
4689 || TREE_CODE (type
) == QUAL_UNION_TYPE
4690 || TREE_CODE (type
) == UNION_TYPE
)
4692 tree temp
= build (CONSTRUCTOR
, type
, NULL_TREE
, NULL_TREE
);
4696 TREE_OPERAND (prev
, 1) = build_tree_list (NULL_TREE
, temp
);
4698 if (TREE_CODE (type
) == ARRAY_TYPE
)
4699 type
= TREE_TYPE (type
);
4700 else if (TYPE_FIELDS (type
))
4701 type
= TREE_TYPE (TYPE_FIELDS (type
));
4704 error_init ("invalid initializer");
4705 return error_mark_node
;
4711 TREE_OPERAND (prev
, 1)
4712 = build_tree_list (NULL_TREE
,
4713 digest_init (type
, init
, require_constant
,
4714 constructor_constant
));
4718 return error_mark_node
;
4720 error_init ("invalid initializer");
4721 return error_mark_node
;
4724 /* Handle initializers that use braces. */
4726 /* Type of object we are accumulating a constructor for.
4727 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4728 static tree constructor_type
;
4730 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4732 static tree constructor_fields
;
4734 /* For an ARRAY_TYPE, this is the specified index
4735 at which to store the next element we get. */
4736 static tree constructor_index
;
4738 /* For an ARRAY_TYPE, this is the end index of the range
4739 to initialize with the next element, or NULL in the ordinary case
4740 where the element is used just once. */
4741 static tree constructor_range_end
;
4743 /* For an ARRAY_TYPE, this is the maximum index. */
4744 static tree constructor_max_index
;
4746 /* For a RECORD_TYPE, this is the first field not yet written out. */
4747 static tree constructor_unfilled_fields
;
4749 /* For an ARRAY_TYPE, this is the index of the first element
4750 not yet written out. */
4751 static tree constructor_unfilled_index
;
4753 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4754 This is so we can generate gaps between fields, when appropriate. */
4755 static tree constructor_bit_index
;
4757 /* If we are saving up the elements rather than allocating them,
4758 this is the list of elements so far (in reverse order,
4759 most recent first). */
4760 static tree constructor_elements
;
4762 /* 1 if so far this constructor's elements are all compile-time constants. */
4763 static int constructor_constant
;
4765 /* 1 if so far this constructor's elements are all valid address constants. */
4766 static int constructor_simple
;
4768 /* 1 if this constructor is erroneous so far. */
4769 static int constructor_erroneous
;
4771 /* 1 if have called defer_addressed_constants. */
4772 static int constructor_subconstants_deferred
;
4774 /* Structure for managing pending initializer elements, organized as an
4779 struct init_node
*left
, *right
;
4780 struct init_node
*parent
;
4786 /* Tree of pending elements at this constructor level.
4787 These are elements encountered out of order
4788 which belong at places we haven't reached yet in actually
4790 Will never hold tree nodes across GC runs. */
4791 static struct init_node
*constructor_pending_elts
;
4793 /* The SPELLING_DEPTH of this constructor. */
4794 static int constructor_depth
;
4796 /* 0 if implicitly pushing constructor levels is allowed. */
4797 int constructor_no_implicit
= 0; /* 0 for C; 1 for some other languages. */
4799 static int require_constant_value
;
4800 static int require_constant_elements
;
4802 /* 1 if it is ok to output this constructor as we read it.
4803 0 means must accumulate a CONSTRUCTOR expression. */
4804 static int constructor_incremental
;
4806 /* DECL node for which an initializer is being read.
4807 0 means we are reading a constructor expression
4808 such as (struct foo) {...}. */
4809 static tree constructor_decl
;
4811 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4812 static char *constructor_asmspec
;
4814 /* Nonzero if this is an initializer for a top-level decl. */
4815 static int constructor_top_level
;
4818 /* This stack has a level for each implicit or explicit level of
4819 structuring in the initializer, including the outermost one. It
4820 saves the values of most of the variables above. */
4822 struct constructor_stack
4824 struct constructor_stack
*next
;
4830 tree unfilled_index
;
4831 tree unfilled_fields
;
4835 struct init_node
*pending_elts
;
4837 /* If nonzero, this value should replace the entire
4838 constructor at this level. */
4839 tree replacement_value
;
4848 struct constructor_stack
*constructor_stack
;
4850 /* This stack records separate initializers that are nested.
4851 Nested initializers can't happen in ANSI C, but GNU C allows them
4852 in cases like { ... (struct foo) { ... } ... }. */
4854 struct initializer_stack
4856 struct initializer_stack
*next
;
4859 struct constructor_stack
*constructor_stack
;
4861 struct spelling
*spelling
;
4862 struct spelling
*spelling_base
;
4866 char require_constant_value
;
4867 char require_constant_elements
;
4871 struct initializer_stack
*initializer_stack
;
4873 /* Prepare to parse and output the initializer for variable DECL. */
4876 start_init (decl
, asmspec_tree
, top_level
)
4882 struct initializer_stack
*p
4883 = (struct initializer_stack
*) xmalloc (sizeof (struct initializer_stack
));
4887 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
4889 p
->decl
= constructor_decl
;
4890 p
->asmspec
= constructor_asmspec
;
4891 p
->incremental
= constructor_incremental
;
4892 p
->require_constant_value
= require_constant_value
;
4893 p
->require_constant_elements
= require_constant_elements
;
4894 p
->constructor_stack
= constructor_stack
;
4895 p
->elements
= constructor_elements
;
4896 p
->spelling
= spelling
;
4897 p
->spelling_base
= spelling_base
;
4898 p
->spelling_size
= spelling_size
;
4899 p
->deferred
= constructor_subconstants_deferred
;
4900 p
->top_level
= constructor_top_level
;
4901 p
->next
= initializer_stack
;
4902 initializer_stack
= p
;
4904 constructor_decl
= decl
;
4905 constructor_incremental
= top_level
;
4906 constructor_asmspec
= asmspec
;
4907 constructor_subconstants_deferred
= 0;
4908 constructor_top_level
= top_level
;
4912 require_constant_value
= TREE_STATIC (decl
);
4913 require_constant_elements
4914 = ((TREE_STATIC (decl
) || pedantic
)
4915 /* For a scalar, you can always use any value to initialize,
4916 even within braces. */
4917 && (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
4918 || TREE_CODE (TREE_TYPE (decl
)) == RECORD_TYPE
4919 || TREE_CODE (TREE_TYPE (decl
)) == UNION_TYPE
4920 || TREE_CODE (TREE_TYPE (decl
)) == QUAL_UNION_TYPE
));
4921 locus
= IDENTIFIER_POINTER (DECL_NAME (decl
));
4922 constructor_incremental
|= TREE_STATIC (decl
);
4926 require_constant_value
= 0;
4927 require_constant_elements
= 0;
4928 locus
= "(anonymous)";
4931 constructor_stack
= 0;
4933 missing_braces_mentioned
= 0;
4937 RESTORE_SPELLING_DEPTH (0);
4940 push_string (locus
);
4946 struct initializer_stack
*p
= initializer_stack
;
4948 /* Output subconstants (string constants, usually)
4949 that were referenced within this initializer and saved up.
4950 Must do this if and only if we called defer_addressed_constants. */
4951 if (constructor_subconstants_deferred
)
4952 output_deferred_addressed_constants ();
4954 /* Free the whole constructor stack of this initializer. */
4955 while (constructor_stack
)
4957 struct constructor_stack
*q
= constructor_stack
;
4958 constructor_stack
= q
->next
;
4962 /* Pop back to the data of the outer initializer (if any). */
4963 constructor_decl
= p
->decl
;
4964 constructor_asmspec
= p
->asmspec
;
4965 constructor_incremental
= p
->incremental
;
4966 require_constant_value
= p
->require_constant_value
;
4967 require_constant_elements
= p
->require_constant_elements
;
4968 constructor_stack
= p
->constructor_stack
;
4969 constructor_elements
= p
->elements
;
4970 spelling
= p
->spelling
;
4971 spelling_base
= p
->spelling_base
;
4972 spelling_size
= p
->spelling_size
;
4973 constructor_subconstants_deferred
= p
->deferred
;
4974 constructor_top_level
= p
->top_level
;
4975 initializer_stack
= p
->next
;
4979 /* Call here when we see the initializer is surrounded by braces.
4980 This is instead of a call to push_init_level;
4981 it is matched by a call to pop_init_level.
4983 TYPE is the type to initialize, for a constructor expression.
4984 For an initializer for a decl, TYPE is zero. */
4987 really_start_incremental_init (type
)
4990 struct constructor_stack
*p
4991 = (struct constructor_stack
*) xmalloc (sizeof (struct constructor_stack
));
4994 type
= TREE_TYPE (constructor_decl
);
4996 /* Turn off constructor_incremental if type is a struct with bitfields.
4997 Do this before the first push, so that the corrected value
4998 is available in finish_init. */
4999 check_init_type_bitfields (type
);
5001 p
->type
= constructor_type
;
5002 p
->fields
= constructor_fields
;
5003 p
->index
= constructor_index
;
5004 p
->range_end
= constructor_range_end
;
5005 p
->max_index
= constructor_max_index
;
5006 p
->unfilled_index
= constructor_unfilled_index
;
5007 p
->unfilled_fields
= constructor_unfilled_fields
;
5008 p
->bit_index
= constructor_bit_index
;
5009 p
->elements
= constructor_elements
;
5010 p
->constant
= constructor_constant
;
5011 p
->simple
= constructor_simple
;
5012 p
->erroneous
= constructor_erroneous
;
5013 p
->pending_elts
= constructor_pending_elts
;
5014 p
->depth
= constructor_depth
;
5015 p
->replacement_value
= 0;
5017 p
->incremental
= constructor_incremental
;
5020 constructor_stack
= p
;
5022 constructor_constant
= 1;
5023 constructor_simple
= 1;
5024 constructor_depth
= SPELLING_DEPTH ();
5025 constructor_elements
= 0;
5026 constructor_pending_elts
= 0;
5027 constructor_type
= type
;
5029 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5030 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5032 constructor_fields
= TYPE_FIELDS (constructor_type
);
5033 /* Skip any nameless bit fields at the beginning. */
5034 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
5035 && DECL_NAME (constructor_fields
) == 0)
5036 constructor_fields
= TREE_CHAIN (constructor_fields
);
5038 constructor_unfilled_fields
= constructor_fields
;
5039 constructor_bit_index
= bitsize_zero_node
;
5041 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5043 constructor_range_end
= 0;
5044 if (TYPE_DOMAIN (constructor_type
))
5046 constructor_max_index
5047 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
5049 = convert (bitsizetype
,
5050 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
5053 constructor_index
= bitsize_zero_node
;
5055 constructor_unfilled_index
= constructor_index
;
5059 /* Handle the case of int x = {5}; */
5060 constructor_fields
= constructor_type
;
5061 constructor_unfilled_fields
= constructor_type
;
5064 if (constructor_incremental
)
5066 make_decl_rtl (constructor_decl
, constructor_asmspec
,
5067 constructor_top_level
);
5068 assemble_variable (constructor_decl
, constructor_top_level
, 0, 1);
5070 defer_addressed_constants ();
5071 constructor_subconstants_deferred
= 1;
5075 /* Push down into a subobject, for initialization.
5076 If this is for an explicit set of braces, IMPLICIT is 0.
5077 If it is because the next element belongs at a lower level,
5081 push_init_level (implicit
)
5084 struct constructor_stack
*p
;
5086 /* If we've exhausted any levels that didn't have braces,
5088 while (constructor_stack
->implicit
)
5090 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
5091 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5092 && constructor_fields
== 0)
5093 process_init_element (pop_init_level (1));
5094 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5095 && tree_int_cst_lt (constructor_max_index
, constructor_index
))
5096 process_init_element (pop_init_level (1));
5101 /* Structure elements may require alignment. Do this now if necessary
5102 for the subaggregate, and if it comes next in sequence. Don't do
5103 this for subaggregates that will go on the pending list. */
5104 if (constructor_incremental
&& constructor_type
!= 0
5105 && TREE_CODE (constructor_type
) == RECORD_TYPE
&& constructor_fields
5106 && constructor_fields
== constructor_unfilled_fields
)
5108 /* Advance to offset of this element. */
5109 if (! tree_int_cst_equal (constructor_bit_index
,
5110 bit_position (constructor_fields
)))
5113 (size_binop (TRUNC_DIV_EXPR
,
5114 size_binop (MINUS_EXPR
,
5115 bit_position (constructor_fields
),
5116 constructor_bit_index
),
5120 /* Indicate that we have now filled the structure up to the current
5122 constructor_unfilled_fields
= constructor_fields
;
5125 p
= (struct constructor_stack
*) xmalloc (sizeof (struct constructor_stack
));
5126 p
->type
= constructor_type
;
5127 p
->fields
= constructor_fields
;
5128 p
->index
= constructor_index
;
5129 p
->range_end
= constructor_range_end
;
5130 p
->max_index
= constructor_max_index
;
5131 p
->unfilled_index
= constructor_unfilled_index
;
5132 p
->unfilled_fields
= constructor_unfilled_fields
;
5133 p
->bit_index
= constructor_bit_index
;
5134 p
->elements
= constructor_elements
;
5135 p
->constant
= constructor_constant
;
5136 p
->simple
= constructor_simple
;
5137 p
->erroneous
= constructor_erroneous
;
5138 p
->pending_elts
= constructor_pending_elts
;
5139 p
->depth
= constructor_depth
;
5140 p
->replacement_value
= 0;
5141 p
->implicit
= implicit
;
5142 p
->incremental
= constructor_incremental
;
5144 p
->next
= constructor_stack
;
5145 constructor_stack
= p
;
5147 constructor_constant
= 1;
5148 constructor_simple
= 1;
5149 constructor_depth
= SPELLING_DEPTH ();
5150 constructor_elements
= 0;
5151 constructor_pending_elts
= 0;
5153 /* Don't die if an entire brace-pair level is superfluous
5154 in the containing level. */
5155 if (constructor_type
== 0)
5157 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
5158 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5160 /* Don't die if there are extra init elts at the end. */
5161 if (constructor_fields
== 0)
5162 constructor_type
= 0;
5165 constructor_type
= TREE_TYPE (constructor_fields
);
5166 push_member_name (constructor_fields
);
5167 constructor_depth
++;
5168 if (constructor_fields
!= constructor_unfilled_fields
)
5169 constructor_incremental
= 0;
5172 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5174 constructor_type
= TREE_TYPE (constructor_type
);
5175 push_array_bounds (tree_low_cst (constructor_index
, 0));
5176 constructor_depth
++;
5177 if (! tree_int_cst_equal (constructor_index
, constructor_unfilled_index
)
5178 || constructor_range_end
!= 0)
5179 constructor_incremental
= 0;
5182 if (constructor_type
== 0)
5184 error_init ("extra brace group at end of initializer");
5185 constructor_fields
= 0;
5186 constructor_unfilled_fields
= 0;
5190 /* Turn off constructor_incremental if type is a struct with bitfields. */
5191 check_init_type_bitfields (constructor_type
);
5193 if (implicit
&& warn_missing_braces
&& !missing_braces_mentioned
)
5195 missing_braces_mentioned
= 1;
5196 warning_init ("missing braces around initializer");
5199 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5200 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5202 constructor_fields
= TYPE_FIELDS (constructor_type
);
5203 /* Skip any nameless bit fields at the beginning. */
5204 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
5205 && DECL_NAME (constructor_fields
) == 0)
5206 constructor_fields
= TREE_CHAIN (constructor_fields
);
5208 constructor_unfilled_fields
= constructor_fields
;
5209 constructor_bit_index
= bitsize_zero_node
;
5211 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5213 constructor_range_end
= 0;
5214 if (TYPE_DOMAIN (constructor_type
))
5216 constructor_max_index
5217 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
5219 = convert (bitsizetype
,
5221 (TYPE_DOMAIN (constructor_type
)));
5224 constructor_index
= bitsize_zero_node
;
5226 constructor_unfilled_index
= constructor_index
;
5230 warning_init ("braces around scalar initializer");
5231 constructor_fields
= constructor_type
;
5232 constructor_unfilled_fields
= constructor_type
;
5236 /* Don't read a struct incrementally if it has any bitfields,
5237 because the incremental reading code doesn't know how to
5238 handle bitfields yet. */
5241 check_init_type_bitfields (type
)
5244 if (TREE_CODE (type
) == RECORD_TYPE
)
5247 for (tail
= TYPE_FIELDS (type
); tail
;
5248 tail
= TREE_CHAIN (tail
))
5250 if (DECL_C_BIT_FIELD (tail
))
5252 constructor_incremental
= 0;
5256 check_init_type_bitfields (TREE_TYPE (tail
));
5260 else if (TREE_CODE (type
) == UNION_TYPE
)
5262 tree tail
= TYPE_FIELDS (type
);
5263 if (tail
&& DECL_C_BIT_FIELD (tail
))
5264 /* We also use the nonincremental algorithm for initiliazation
5265 of unions whose first member is a bitfield, becuase the
5266 incremental algorithm has no code for dealing with
5268 constructor_incremental
= 0;
5271 else if (TREE_CODE (type
) == ARRAY_TYPE
)
5272 check_init_type_bitfields (TREE_TYPE (type
));
5275 /* At the end of an implicit or explicit brace level,
5276 finish up that level of constructor.
5277 If we were outputting the elements as they are read, return 0
5278 from inner levels (process_init_element ignores that),
5279 but return error_mark_node from the outermost level
5280 (that's what we want to put in DECL_INITIAL).
5281 Otherwise, return a CONSTRUCTOR expression. */
5284 pop_init_level (implicit
)
5287 struct constructor_stack
*p
;
5288 HOST_WIDE_INT size
= 0;
5289 tree constructor
= 0;
5293 /* When we come to an explicit close brace,
5294 pop any inner levels that didn't have explicit braces. */
5295 while (constructor_stack
->implicit
)
5296 process_init_element (pop_init_level (1));
5299 p
= constructor_stack
;
5301 if (constructor_type
!= 0)
5302 size
= int_size_in_bytes (constructor_type
);
5304 /* Warn when some struct elements are implicitly initialized to zero. */
5307 && TREE_CODE (constructor_type
) == RECORD_TYPE
5308 && constructor_unfilled_fields
)
5310 push_member_name (constructor_unfilled_fields
);
5311 warning_init ("missing initializer");
5312 RESTORE_SPELLING_DEPTH (constructor_depth
);
5315 /* Now output all pending elements. */
5316 output_pending_init_elements (1);
5318 #if 0 /* c-parse.in warns about {}. */
5319 /* In ANSI, each brace level must have at least one element. */
5320 if (! implicit
&& pedantic
5321 && (TREE_CODE (constructor_type
) == ARRAY_TYPE
5322 ? integer_zerop (constructor_unfilled_index
)
5323 : constructor_unfilled_fields
== TYPE_FIELDS (constructor_type
)))
5324 pedwarn_init ("empty braces in initializer");
5327 /* Pad out the end of the structure. */
5329 if (p
->replacement_value
)
5331 /* If this closes a superfluous brace pair,
5332 just pass out the element between them. */
5333 constructor
= p
->replacement_value
;
5334 /* If this is the top level thing within the initializer,
5335 and it's for a variable, then since we already called
5336 assemble_variable, we must output the value now. */
5337 if (p
->next
== 0 && constructor_decl
!= 0
5338 && constructor_incremental
)
5340 constructor
= digest_init (constructor_type
, constructor
,
5341 require_constant_value
,
5342 require_constant_elements
);
5344 /* If initializing an array of unknown size,
5345 determine the size now. */
5346 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5347 && TYPE_DOMAIN (constructor_type
) == 0)
5349 /* We shouldn't have an incomplete array type within
5351 if (constructor_stack
->next
)
5354 if (complete_array_type (constructor_type
, constructor
, 0))
5357 size
= int_size_in_bytes (constructor_type
);
5360 output_constant (constructor
, size
);
5363 else if (constructor_type
== 0)
5365 else if (TREE_CODE (constructor_type
) != RECORD_TYPE
5366 && TREE_CODE (constructor_type
) != UNION_TYPE
5367 && TREE_CODE (constructor_type
) != ARRAY_TYPE
5368 && ! constructor_incremental
)
5370 /* A nonincremental scalar initializer--just return
5371 the element, after verifying there is just one. */
5372 if (constructor_elements
== 0)
5374 error_init ("empty scalar initializer");
5375 constructor
= error_mark_node
;
5377 else if (TREE_CHAIN (constructor_elements
) != 0)
5379 error_init ("extra elements in scalar initializer");
5380 constructor
= TREE_VALUE (constructor_elements
);
5383 constructor
= TREE_VALUE (constructor_elements
);
5385 else if (! constructor_incremental
)
5387 if (constructor_erroneous
)
5388 constructor
= error_mark_node
;
5391 constructor
= build (CONSTRUCTOR
, constructor_type
, NULL_TREE
,
5392 nreverse (constructor_elements
));
5393 if (constructor_constant
)
5394 TREE_CONSTANT (constructor
) = 1;
5395 if (constructor_constant
&& constructor_simple
)
5396 TREE_STATIC (constructor
) = 1;
5403 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5404 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5405 /* Find the offset of the end of that field. */
5406 filled
= size_binop (CEIL_DIV_EXPR
, constructor_bit_index
,
5409 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5411 /* If initializing an array of unknown size,
5412 determine the size now. */
5413 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5414 && TYPE_DOMAIN (constructor_type
) == 0)
5417 = copy_node (size_diffop (constructor_unfilled_index
,
5420 TYPE_DOMAIN (constructor_type
) = build_index_type (maxindex
);
5421 TREE_TYPE (maxindex
) = TYPE_DOMAIN (constructor_type
);
5423 /* TYPE_MAX_VALUE is always one less than the number of elements
5424 in the array, because we start counting at zero. Therefore,
5425 warn only if the value is less than zero. */
5427 && (tree_int_cst_sgn
5428 (TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
)))
5430 error_with_decl (constructor_decl
,
5431 "zero or negative array size `%s'");
5433 layout_type (constructor_type
);
5434 size
= int_size_in_bytes (constructor_type
);
5438 = size_binop (MULT_EXPR
, constructor_unfilled_index
,
5439 convert (bitsizetype
,
5441 (TREE_TYPE (constructor_type
))));
5447 assemble_zeros (size
- tree_low_cst (filled
, 1));
5451 constructor_type
= p
->type
;
5452 constructor_fields
= p
->fields
;
5453 constructor_index
= p
->index
;
5454 constructor_range_end
= p
->range_end
;
5455 constructor_max_index
= p
->max_index
;
5456 constructor_unfilled_index
= p
->unfilled_index
;
5457 constructor_unfilled_fields
= p
->unfilled_fields
;
5458 constructor_bit_index
= p
->bit_index
;
5459 constructor_elements
= p
->elements
;
5460 constructor_constant
= p
->constant
;
5461 constructor_simple
= p
->simple
;
5462 constructor_erroneous
= p
->erroneous
;
5463 constructor_pending_elts
= p
->pending_elts
;
5464 constructor_depth
= p
->depth
;
5465 constructor_incremental
= p
->incremental
;
5466 RESTORE_SPELLING_DEPTH (constructor_depth
);
5468 constructor_stack
= p
->next
;
5471 if (constructor
== 0)
5473 if (constructor_stack
== 0)
5474 return error_mark_node
;
5480 /* Within an array initializer, specify the next index to be initialized.
5481 FIRST is that index. If LAST is nonzero, then initialize a range
5482 of indices, running from FIRST through LAST. */
5485 set_init_index (first
, last
)
5488 while ((TREE_CODE (first
) == NOP_EXPR
5489 || TREE_CODE (first
) == CONVERT_EXPR
5490 || TREE_CODE (first
) == NON_LVALUE_EXPR
)
5491 && (TYPE_MODE (TREE_TYPE (first
))
5492 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (first
, 0)))))
5493 first
= TREE_OPERAND (first
, 0);
5496 while ((TREE_CODE (last
) == NOP_EXPR
5497 || TREE_CODE (last
) == CONVERT_EXPR
5498 || TREE_CODE (last
) == NON_LVALUE_EXPR
)
5499 && (TYPE_MODE (TREE_TYPE (last
))
5500 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (last
, 0)))))
5501 last
= TREE_OPERAND (last
, 0);
5503 if (TREE_CODE (first
) != INTEGER_CST
)
5504 error_init ("nonconstant array index in initializer");
5505 else if (last
!= 0 && TREE_CODE (last
) != INTEGER_CST
)
5506 error_init ("nonconstant array index in initializer");
5507 else if (! constructor_unfilled_index
)
5508 error_init ("array index in non-array initializer");
5509 else if (tree_int_cst_lt (first
, constructor_unfilled_index
))
5510 error_init ("duplicate array index in initializer");
5513 constructor_index
= convert (bitsizetype
, first
);
5515 if (last
!= 0 && tree_int_cst_lt (last
, first
))
5516 error_init ("empty index range in initializer");
5520 pedwarn ("ANSI C forbids specifying element to initialize");
5522 constructor_range_end
= last
? convert (bitsizetype
, last
) : 0;
5527 /* Within a struct initializer, specify the next field to be initialized. */
5530 set_init_label (fieldname
)
5536 /* Don't die if an entire brace-pair level is superfluous
5537 in the containing level. */
5538 if (constructor_type
== 0)
5541 for (tail
= TYPE_FIELDS (constructor_type
); tail
;
5542 tail
= TREE_CHAIN (tail
))
5544 if (tail
== constructor_unfilled_fields
)
5546 if (DECL_NAME (tail
) == fieldname
)
5551 error ("unknown field `%s' specified in initializer",
5552 IDENTIFIER_POINTER (fieldname
));
5554 error ("field `%s' already initialized",
5555 IDENTIFIER_POINTER (fieldname
));
5558 constructor_fields
= tail
;
5560 pedwarn ("ANSI C forbids specifying structure member to initialize");
5564 /* Add a new initializer to the tree of pending initializers. PURPOSE
5565 indentifies the initializer, either array index or field in a structure.
5566 VALUE is the value of that index or field. */
5569 add_pending_init (purpose
, value
)
5570 tree purpose
, value
;
5572 struct init_node
*p
, **q
, *r
;
5574 q
= &constructor_pending_elts
;
5577 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5582 if (tree_int_cst_lt (purpose
, p
->purpose
))
5584 else if (p
->purpose
!= purpose
)
5595 if (tree_int_cst_lt (bit_position (purpose
),
5596 bit_position (p
->purpose
)))
5598 else if (p
->purpose
!= purpose
)
5605 r
= (struct init_node
*) ggc_alloc_obj (sizeof (struct init_node
), 0);
5606 r
->purpose
= purpose
;
5617 struct init_node
*s
;
5621 if (p
->balance
== 0)
5623 else if (p
->balance
< 0)
5630 p
->left
->parent
= p
;
5647 constructor_pending_elts
= r
;
5652 struct init_node
*t
= r
->right
;
5656 r
->right
->parent
= r
;
5661 p
->left
->parent
= p
;
5664 p
->balance
= t
->balance
< 0;
5665 r
->balance
= -(t
->balance
> 0);
5680 constructor_pending_elts
= t
;
5686 /* p->balance == +1; growth of left side balances the node. */
5691 else /* r == p->right */
5693 if (p
->balance
== 0)
5694 /* Growth propagation from right side. */
5696 else if (p
->balance
> 0)
5703 p
->right
->parent
= p
;
5720 constructor_pending_elts
= r
;
5722 else /* r->balance == -1 */
5725 struct init_node
*t
= r
->left
;
5729 r
->left
->parent
= r
;
5734 p
->right
->parent
= p
;
5737 r
->balance
= (t
->balance
< 0);
5738 p
->balance
= -(t
->balance
> 0);
5753 constructor_pending_elts
= t
;
5759 /* p->balance == -1; growth of right side balances the node. */
5770 /* Return nonzero if FIELD is equal to the index of a pending initializer. */
5773 pending_init_member (field
)
5776 struct init_node
*p
;
5778 p
= constructor_pending_elts
;
5779 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5783 if (field
== p
->purpose
)
5785 else if (tree_int_cst_lt (field
, p
->purpose
))
5795 if (field
== p
->purpose
)
5797 else if (tree_int_cst_lt (bit_position (field
),
5798 bit_position (p
->purpose
)))
5808 /* "Output" the next constructor element.
5809 At top level, really output it to assembler code now.
5810 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
5811 TYPE is the data type that the containing data type wants here.
5812 FIELD is the field (a FIELD_DECL) or the index that this element fills.
5814 PENDING if non-nil means output pending elements that belong
5815 right after this element. (PENDING is normally 1;
5816 it is 0 while outputting pending elements, to avoid recursion.) */
5819 output_init_element (value
, type
, field
, pending
)
5820 tree value
, type
, field
;
5825 if (TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
5826 || (TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
5827 && !(TREE_CODE (value
) == STRING_CST
5828 && TREE_CODE (type
) == ARRAY_TYPE
5829 && TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
)
5830 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value
)),
5831 TYPE_MAIN_VARIANT (type
))))
5832 value
= default_conversion (value
);
5834 if (value
== error_mark_node
)
5835 constructor_erroneous
= 1;
5836 else if (!TREE_CONSTANT (value
))
5837 constructor_constant
= 0;
5838 else if (initializer_constant_valid_p (value
, TREE_TYPE (value
)) == 0
5839 || ((TREE_CODE (constructor_type
) == RECORD_TYPE
5840 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5841 && DECL_C_BIT_FIELD (field
)
5842 && TREE_CODE (value
) != INTEGER_CST
))
5843 constructor_simple
= 0;
5845 if (require_constant_value
&& ! TREE_CONSTANT (value
))
5847 error_init ("initializer element is not constant");
5848 value
= error_mark_node
;
5850 else if (require_constant_elements
5851 && initializer_constant_valid_p (value
, TREE_TYPE (value
)) == 0)
5853 error_init ("initializer element is not computable at load time");
5854 value
= error_mark_node
;
5857 /* If this element duplicates one on constructor_pending_elts,
5858 print a message and ignore it. Don't do this when we're
5859 processing elements taken off constructor_pending_elts,
5860 because we'd always get spurious errors. */
5863 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5864 || TREE_CODE (constructor_type
) == UNION_TYPE
5865 || TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5867 if (pending_init_member (field
))
5869 error_init ("duplicate initializer");
5875 /* If this element doesn't come next in sequence,
5876 put it on constructor_pending_elts. */
5877 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5878 && ! tree_int_cst_equal (field
, constructor_unfilled_index
))
5881 add_pending_init (field
,
5882 digest_init (type
, value
, require_constant_value
,
5883 require_constant_elements
));
5885 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
5886 && field
!= constructor_unfilled_fields
)
5888 /* We do this for records but not for unions. In a union,
5889 no matter which field is specified, it can be initialized
5890 right away since it starts at the beginning of the union. */
5892 add_pending_init (field
,
5893 digest_init (type
, value
, require_constant_value
,
5894 require_constant_elements
));
5898 /* Otherwise, output this element either to
5899 constructor_elements or to the assembler file. */
5903 if (! constructor_incremental
)
5905 if (field
&& TREE_CODE (field
) == INTEGER_CST
)
5906 field
= copy_node (field
);
5907 constructor_elements
5908 = tree_cons (field
, digest_init (type
, value
,
5909 require_constant_value
,
5910 require_constant_elements
),
5911 constructor_elements
);
5915 /* Structure elements may require alignment.
5916 Do this, if necessary. */
5917 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5918 && ! tree_int_cst_equal (constructor_bit_index
,
5919 bit_position (field
)))
5920 /* Advance to offset of this element. */
5923 (size_binop (TRUNC_DIV_EXPR
,
5924 size_binop (MINUS_EXPR
, bit_position (field
),
5925 constructor_bit_index
),
5929 output_constant (digest_init (type
, value
,
5930 require_constant_value
,
5931 require_constant_elements
),
5932 int_size_in_bytes (type
));
5934 /* For a record or union,
5935 keep track of end position of last field. */
5936 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5937 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5938 constructor_bit_index
5939 = size_binop (PLUS_EXPR
, bit_position (field
),
5944 /* Advance the variable that indicates sequential elements output. */
5945 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5946 constructor_unfilled_index
5947 = size_binop (PLUS_EXPR
, constructor_unfilled_index
,
5949 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
5951 constructor_unfilled_fields
5952 = TREE_CHAIN (constructor_unfilled_fields
);
5954 /* Skip any nameless bit fields. */
5955 while (constructor_unfilled_fields
!= 0
5956 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
5957 && DECL_NAME (constructor_unfilled_fields
) == 0)
5958 constructor_unfilled_fields
=
5959 TREE_CHAIN (constructor_unfilled_fields
);
5961 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
5962 constructor_unfilled_fields
= 0;
5964 /* Now output any pending elements which have become next. */
5966 output_pending_init_elements (0);
5970 /* Output any pending elements which have become next.
5971 As we output elements, constructor_unfilled_{fields,index}
5972 advances, which may cause other elements to become next;
5973 if so, they too are output.
5975 If ALL is 0, we return when there are
5976 no more pending elements to output now.
5978 If ALL is 1, we output space as necessary so that
5979 we can output all the pending elements. */
5982 output_pending_init_elements (all
)
5985 struct init_node
*elt
= constructor_pending_elts
;
5990 /* Look thru the whole pending tree.
5991 If we find an element that should be output now,
5992 output it. Otherwise, set NEXT to the element
5993 that comes first among those still pending. */
5998 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6000 if (tree_int_cst_equal (elt
->purpose
,
6001 constructor_unfilled_index
))
6002 output_init_element (elt
->value
,
6003 TREE_TYPE (constructor_type
),
6004 constructor_unfilled_index
, 0);
6005 else if (tree_int_cst_lt (constructor_unfilled_index
,
6008 /* Advance to the next smaller node. */
6013 /* We have reached the smallest node bigger than the
6014 current unfilled index. Fill the space first. */
6015 next
= elt
->purpose
;
6021 /* Advance to the next bigger node. */
6026 /* We have reached the biggest node in a subtree. Find
6027 the parent of it, which is the next bigger node. */
6028 while (elt
->parent
&& elt
->parent
->right
== elt
)
6031 if (elt
&& tree_int_cst_lt (constructor_unfilled_index
,
6034 next
= elt
->purpose
;
6040 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
6041 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6043 /* If the current record is complete we are done. */
6044 if (constructor_unfilled_fields
== 0)
6046 if (elt
->purpose
== constructor_unfilled_fields
)
6048 output_init_element (elt
->value
,
6049 TREE_TYPE (constructor_unfilled_fields
),
6050 constructor_unfilled_fields
,
6053 else if (tree_int_cst_lt (bit_position (constructor_unfilled_fields
),
6054 bit_position (elt
->purpose
)))
6056 /* Advance to the next smaller node. */
6061 /* We have reached the smallest node bigger than the
6062 current unfilled field. Fill the space first. */
6063 next
= elt
->purpose
;
6069 /* Advance to the next bigger node. */
6074 /* We have reached the biggest node in a subtree. Find
6075 the parent of it, which is the next bigger node. */
6076 while (elt
->parent
&& elt
->parent
->right
== elt
)
6081 (bit_position (constructor_unfilled_fields
),
6082 bit_position (elt
->purpose
))))
6084 next
= elt
->purpose
;
6092 /* Ordinarily return, but not if we want to output all
6093 and there are elements left. */
6094 if (! (all
&& next
!= 0))
6097 /* Generate space up to the position of NEXT. */
6098 if (constructor_incremental
)
6101 tree nextpos_tree
= bitsize_zero_node
;
6103 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6104 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6108 /* Find the last field written out, if any. */
6109 for (tail
= TYPE_FIELDS (constructor_type
); tail
;
6110 tail
= TREE_CHAIN (tail
))
6111 if (TREE_CHAIN (tail
) == constructor_unfilled_fields
)
6115 /* Find the offset of the end of that field. */
6116 filled
= size_binop (CEIL_DIV_EXPR
,
6117 size_binop (PLUS_EXPR
, bit_position (tail
),
6121 filled
= bitsize_zero_node
;
6123 nextpos_tree
= convert (bitsizetype
, byte_position (next
));
6124 constructor_bit_index
= bit_position (next
);
6125 constructor_unfilled_fields
= next
;
6127 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6130 = size_binop (MULT_EXPR
, constructor_unfilled_index
,
6131 convert (bitsizetype
,
6133 (TREE_TYPE (constructor_type
))));
6135 = size_binop (MULT_EXPR
, next
,
6136 convert (bitsizetype
, TYPE_SIZE_UNIT
6137 (TREE_TYPE (constructor_type
))));
6138 constructor_unfilled_index
= next
;
6144 assemble_zeros (tree_low_cst (size_diffop (nextpos_tree
, filled
), 1));
6148 /* If it's not incremental, just skip over the gap,
6149 so that after jumping to retry we will output the next
6150 successive element. */
6151 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6152 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6153 constructor_unfilled_fields
= next
;
6154 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6155 constructor_unfilled_index
= next
;
6158 /* ELT now points to the node in the pending tree with the next
6159 initializer to output. */
6163 /* Add one non-braced element to the current constructor level.
6164 This adjusts the current position within the constructor's type.
6165 This may also start or terminate implicit levels
6166 to handle a partly-braced initializer.
6168 Once this has found the correct level for the new element,
6169 it calls output_init_element.
6171 Note: if we are incrementally outputting this constructor,
6172 this function may be called with a null argument
6173 representing a sub-constructor that was already incrementally output.
6174 When that happens, we output nothing, but we do the bookkeeping
6175 to skip past that element of the current constructor. */
6178 process_init_element (value
)
6181 tree orig_value
= value
;
6182 int string_flag
= value
!= 0 && TREE_CODE (value
) == STRING_CST
;
6184 /* Handle superfluous braces around string cst as in
6185 char x[] = {"foo"}; */
6188 && TREE_CODE (constructor_type
) == ARRAY_TYPE
6189 && TREE_CODE (TREE_TYPE (constructor_type
)) == INTEGER_TYPE
6190 && integer_zerop (constructor_unfilled_index
))
6192 if (constructor_stack
->replacement_value
)
6193 error_init ("excess elements in char array initializer");
6194 constructor_stack
->replacement_value
= value
;
6198 if (constructor_stack
->replacement_value
!= 0)
6200 error_init ("excess elements in struct initializer");
6204 /* Ignore elements of a brace group if it is entirely superfluous
6205 and has already been diagnosed. */
6206 if (constructor_type
== 0)
6209 /* If we've exhausted any levels that didn't have braces,
6211 while (constructor_stack
->implicit
)
6213 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
6214 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6215 && constructor_fields
== 0)
6216 process_init_element (pop_init_level (1));
6217 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
6218 && (constructor_max_index
== 0
6219 || tree_int_cst_lt (constructor_max_index
,
6220 constructor_index
)))
6221 process_init_element (pop_init_level (1));
6228 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
6231 enum tree_code fieldcode
;
6233 if (constructor_fields
== 0)
6235 pedwarn_init ("excess elements in struct initializer");
6239 fieldtype
= TREE_TYPE (constructor_fields
);
6240 if (fieldtype
!= error_mark_node
)
6241 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
6242 fieldcode
= TREE_CODE (fieldtype
);
6244 /* Accept a string constant to initialize a subarray. */
6246 && fieldcode
== ARRAY_TYPE
6247 && TREE_CODE (TREE_TYPE (fieldtype
)) == INTEGER_TYPE
6250 /* Otherwise, if we have come to a subaggregate,
6251 and we don't have an element of its type, push into it. */
6252 else if (value
!= 0 && !constructor_no_implicit
6253 && value
!= error_mark_node
6254 && TYPE_MAIN_VARIANT (TREE_TYPE (value
)) != fieldtype
6255 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
6256 || fieldcode
== UNION_TYPE
))
6258 push_init_level (1);
6264 push_member_name (constructor_fields
);
6265 output_init_element (value
, fieldtype
, constructor_fields
, 1);
6266 RESTORE_SPELLING_DEPTH (constructor_depth
);
6269 /* Do the bookkeeping for an element that was
6270 directly output as a constructor. */
6272 /* For a record, keep track of end position of last field. */
6273 constructor_bit_index
6274 = size_binop (PLUS_EXPR
,
6275 bit_position (constructor_fields
),
6276 DECL_SIZE (constructor_fields
));
6278 constructor_unfilled_fields
= TREE_CHAIN (constructor_fields
);
6279 /* Skip any nameless bit fields. */
6280 while (constructor_unfilled_fields
!= 0
6281 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
6282 && DECL_NAME (constructor_unfilled_fields
) == 0)
6283 constructor_unfilled_fields
=
6284 TREE_CHAIN (constructor_unfilled_fields
);
6287 constructor_fields
= TREE_CHAIN (constructor_fields
);
6288 /* Skip any nameless bit fields at the beginning. */
6289 while (constructor_fields
!= 0
6290 && DECL_C_BIT_FIELD (constructor_fields
)
6291 && DECL_NAME (constructor_fields
) == 0)
6292 constructor_fields
= TREE_CHAIN (constructor_fields
);
6295 if (TREE_CODE (constructor_type
) == UNION_TYPE
)
6298 enum tree_code fieldcode
;
6300 if (constructor_fields
== 0)
6302 pedwarn_init ("excess elements in union initializer");
6306 fieldtype
= TREE_TYPE (constructor_fields
);
6307 if (fieldtype
!= error_mark_node
)
6308 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
6309 fieldcode
= TREE_CODE (fieldtype
);
6311 /* Accept a string constant to initialize a subarray. */
6313 && fieldcode
== ARRAY_TYPE
6314 && TREE_CODE (TREE_TYPE (fieldtype
)) == INTEGER_TYPE
6317 /* Otherwise, if we have come to a subaggregate,
6318 and we don't have an element of its type, push into it. */
6319 else if (value
!= 0 && !constructor_no_implicit
6320 && value
!= error_mark_node
6321 && TYPE_MAIN_VARIANT (TREE_TYPE (value
)) != fieldtype
6322 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
6323 || fieldcode
== UNION_TYPE
))
6325 push_init_level (1);
6331 push_member_name (constructor_fields
);
6332 output_init_element (value
, fieldtype
, constructor_fields
, 1);
6333 RESTORE_SPELLING_DEPTH (constructor_depth
);
6336 /* Do the bookkeeping for an element that was
6337 directly output as a constructor. */
6339 constructor_bit_index
= DECL_SIZE (constructor_fields
);
6340 constructor_unfilled_fields
= TREE_CHAIN (constructor_fields
);
6343 constructor_fields
= 0;
6346 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6348 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
6349 enum tree_code eltcode
= TREE_CODE (elttype
);
6351 /* Accept a string constant to initialize a subarray. */
6353 && eltcode
== ARRAY_TYPE
6354 && TREE_CODE (TREE_TYPE (elttype
)) == INTEGER_TYPE
6357 /* Otherwise, if we have come to a subaggregate,
6358 and we don't have an element of its type, push into it. */
6359 else if (value
!= 0 && !constructor_no_implicit
6360 && value
!= error_mark_node
6361 && TYPE_MAIN_VARIANT (TREE_TYPE (value
)) != elttype
6362 && (eltcode
== RECORD_TYPE
|| eltcode
== ARRAY_TYPE
6363 || eltcode
== UNION_TYPE
))
6365 push_init_level (1);
6369 if (constructor_max_index
!= 0
6370 && tree_int_cst_lt (constructor_max_index
, constructor_index
))
6372 pedwarn_init ("excess elements in array initializer");
6376 /* In the case of [LO .. HI] = VALUE, only evaluate VALUE once. */
6377 if (constructor_range_end
)
6379 if (constructor_max_index
!= 0
6380 && tree_int_cst_lt (constructor_max_index
,
6381 constructor_range_end
))
6383 pedwarn_init ("excess elements in array initializer");
6384 constructor_range_end
= constructor_max_index
;
6387 value
= save_expr (value
);
6390 /* Now output the actual element.
6391 Ordinarily, output once.
6392 If there is a range, repeat it till we advance past the range. */
6397 push_array_bounds (tree_low_cst (constructor_index
, 0));
6398 output_init_element (value
, elttype
, constructor_index
, 1);
6399 RESTORE_SPELLING_DEPTH (constructor_depth
);
6403 = size_binop (PLUS_EXPR
, constructor_index
, bitsize_one_node
);
6406 /* If we are doing the bookkeeping for an element that was
6407 directly output as a constructor, we must update
6408 constructor_unfilled_index. */
6409 constructor_unfilled_index
= constructor_index
;
6411 while (! (constructor_range_end
== 0
6412 || tree_int_cst_lt (constructor_range_end
,
6413 constructor_index
)));
6418 /* Handle the sole element allowed in a braced initializer
6419 for a scalar variable. */
6420 if (constructor_fields
== 0)
6422 pedwarn_init ("excess elements in scalar initializer");
6427 output_init_element (value
, constructor_type
, NULL_TREE
, 1);
6428 constructor_fields
= 0;
6433 /* Expand an ASM statement with operands, handling output operands
6434 that are not variables or INDIRECT_REFS by transforming such
6435 cases into cases that expand_asm_operands can handle.
6437 Arguments are same as for expand_asm_operands. */
6440 c_expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, filename
, line
)
6441 tree string
, outputs
, inputs
, clobbers
;
6446 int noutputs
= list_length (outputs
);
6448 /* o[I] is the place that output number I should be written. */
6449 register tree
*o
= (tree
*) alloca (noutputs
* sizeof (tree
));
6452 if (TREE_CODE (string
) == ADDR_EXPR
)
6453 string
= TREE_OPERAND (string
, 0);
6454 if (TREE_CODE (string
) != STRING_CST
)
6456 error ("asm template is not a string constant");
6460 /* Record the contents of OUTPUTS before it is modified. */
6461 for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
6463 tree output
= TREE_VALUE (tail
);
6465 /* We can remove conversions that just change the type, not the mode. */
6466 STRIP_NOPS (output
);
6469 /* Allow conversions as LHS here. build_modify_expr as called below
6470 will do the right thing with them. */
6471 while (TREE_CODE (output
) == NOP_EXPR
6472 || TREE_CODE (output
) == CONVERT_EXPR
6473 || TREE_CODE (output
) == FLOAT_EXPR
6474 || TREE_CODE (output
) == FIX_TRUNC_EXPR
6475 || TREE_CODE (output
) == FIX_FLOOR_EXPR
6476 || TREE_CODE (output
) == FIX_ROUND_EXPR
6477 || TREE_CODE (output
) == FIX_CEIL_EXPR
)
6478 output
= TREE_OPERAND (output
, 0);
6480 lvalue_or_else (o
[i
], "invalid lvalue in asm statement");
6483 /* Perform default conversions on array and function inputs. */
6484 /* Don't do this for other types--
6485 it would screw up operands expected to be in memory. */
6486 for (i
= 0, tail
= inputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
6487 if (TREE_CODE (TREE_TYPE (TREE_VALUE (tail
))) == ARRAY_TYPE
6488 || TREE_CODE (TREE_TYPE (TREE_VALUE (tail
))) == FUNCTION_TYPE
)
6489 TREE_VALUE (tail
) = default_conversion (TREE_VALUE (tail
));
6491 /* Generate the ASM_OPERANDS insn;
6492 store into the TREE_VALUEs of OUTPUTS some trees for
6493 where the values were actually stored. */
6494 expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, filename
, line
);
6496 /* Copy all the intermediate outputs into the specified outputs. */
6497 for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
6499 if (o
[i
] != TREE_VALUE (tail
))
6501 expand_expr (build_modify_expr (o
[i
], NOP_EXPR
, TREE_VALUE (tail
)),
6502 NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
6505 /* Detect modification of read-only values.
6506 (Otherwise done by build_modify_expr.) */
6509 tree type
= TREE_TYPE (o
[i
]);
6510 if (TREE_READONLY (o
[i
])
6511 || TYPE_READONLY (type
)
6512 || ((TREE_CODE (type
) == RECORD_TYPE
6513 || TREE_CODE (type
) == UNION_TYPE
)
6514 && C_TYPE_FIELDS_READONLY (type
)))
6515 readonly_warning (o
[i
], "modification by `asm'");
6519 /* Those MODIFY_EXPRs could do autoincrements. */
6523 /* Expand a C `return' statement.
6524 RETVAL is the expression for what to return,
6525 or a null pointer for `return;' with no value. */
6528 c_expand_return (retval
)
6531 tree valtype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
6533 if (TREE_THIS_VOLATILE (current_function_decl
))
6534 warning ("function declared `noreturn' has a `return' statement");
6538 current_function_returns_null
= 1;
6539 if (warn_return_type
&& valtype
!= 0 && TREE_CODE (valtype
) != VOID_TYPE
)
6540 warning ("`return' with no value, in function returning non-void");
6541 expand_null_return ();
6543 else if (valtype
== 0 || TREE_CODE (valtype
) == VOID_TYPE
)
6545 current_function_returns_null
= 1;
6546 if (pedantic
|| TREE_CODE (TREE_TYPE (retval
)) != VOID_TYPE
)
6547 pedwarn ("`return' with a value, in function returning void");
6548 expand_return (retval
);
6552 tree t
= convert_for_assignment (valtype
, retval
, _("return"),
6553 NULL_TREE
, NULL_TREE
, 0);
6554 tree res
= DECL_RESULT (current_function_decl
);
6557 if (t
== error_mark_node
)
6560 inner
= t
= convert (TREE_TYPE (res
), t
);
6562 /* Strip any conversions, additions, and subtractions, and see if
6563 we are returning the address of a local variable. Warn if so. */
6566 switch (TREE_CODE (inner
))
6568 case NOP_EXPR
: case NON_LVALUE_EXPR
: case CONVERT_EXPR
:
6570 inner
= TREE_OPERAND (inner
, 0);
6574 /* If the second operand of the MINUS_EXPR has a pointer
6575 type (or is converted from it), this may be valid, so
6576 don't give a warning. */
6578 tree op1
= TREE_OPERAND (inner
, 1);
6580 while (! POINTER_TYPE_P (TREE_TYPE (op1
))
6581 && (TREE_CODE (op1
) == NOP_EXPR
6582 || TREE_CODE (op1
) == NON_LVALUE_EXPR
6583 || TREE_CODE (op1
) == CONVERT_EXPR
))
6584 op1
= TREE_OPERAND (op1
, 0);
6586 if (POINTER_TYPE_P (TREE_TYPE (op1
)))
6589 inner
= TREE_OPERAND (inner
, 0);
6594 inner
= TREE_OPERAND (inner
, 0);
6596 while (TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r')
6597 inner
= TREE_OPERAND (inner
, 0);
6599 if (TREE_CODE (inner
) == VAR_DECL
6600 && ! DECL_EXTERNAL (inner
)
6601 && ! TREE_STATIC (inner
)
6602 && DECL_CONTEXT (inner
) == current_function_decl
)
6603 warning ("function returns address of local variable");
6613 t
= build (MODIFY_EXPR
, TREE_TYPE (res
), res
, t
);
6614 TREE_SIDE_EFFECTS (t
) = 1;
6616 current_function_returns_value
= 1;
6620 /* Start a C switch statement, testing expression EXP.
6621 Return EXP if it is valid, an error node otherwise. */
6624 c_expand_start_case (exp
)
6627 register enum tree_code code
;
6630 if (TREE_CODE (exp
) == ERROR_MARK
)
6633 code
= TREE_CODE (TREE_TYPE (exp
));
6634 type
= TREE_TYPE (exp
);
6636 if (code
!= INTEGER_TYPE
&& code
!= ENUMERAL_TYPE
&& code
!= ERROR_MARK
)
6638 error ("switch quantity not an integer");
6639 exp
= error_mark_node
;
6644 type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
6646 if (warn_traditional
6647 && ! in_system_header
6648 && (type
== long_integer_type_node
6649 || type
== long_unsigned_type_node
))
6650 pedwarn ("`long' switch expression not converted to `int' in ANSI C");
6652 exp
= default_conversion (exp
);
6653 type
= TREE_TYPE (exp
);
6654 index
= get_unwidened (exp
, NULL_TREE
);
6655 /* We can't strip a conversion from a signed type to an unsigned,
6656 because if we did, int_fits_type_p would do the wrong thing
6657 when checking case values for being in range,
6658 and it's too hard to do the right thing. */
6659 if (TREE_UNSIGNED (TREE_TYPE (exp
))
6660 == TREE_UNSIGNED (TREE_TYPE (index
)))
6664 expand_start_case (1, exp
, type
, "switch statement");