1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 88, 91-97, 1998 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This file is part of the C front end.
23 It contains routines to build C expressions given their operands,
24 including computing the types of the result, C-specific error checks,
25 and some optimization.
27 There are also routines to build RETURN_STMT nodes and CASE_STMT nodes,
28 and to process initializations in declarations (since they work
29 like a strange sort of assignment). */
44 /* Nonzero if we've already printed a "missing braces around initializer"
45 message within this initializer. */
46 static int missing_braces_mentioned
;
48 static tree qualify_type
PROTO((tree
, tree
));
49 static int comp_target_types
PROTO((tree
, tree
));
50 static int function_types_compatible_p
PROTO((tree
, tree
));
51 static int type_lists_compatible_p
PROTO((tree
, tree
));
52 static tree decl_constant_value
PROTO((tree
));
53 static tree lookup_field
PROTO((tree
, tree
, tree
*));
54 static tree convert_arguments
PROTO((tree
, tree
, tree
, tree
));
55 static tree pointer_int_sum
PROTO((enum tree_code
, tree
, tree
));
56 static tree pointer_diff
PROTO((tree
, tree
));
57 static tree unary_complex_lvalue
PROTO((enum tree_code
, tree
));
58 static void pedantic_lvalue_warning
PROTO((enum tree_code
));
59 static tree internal_build_compound_expr
PROTO((tree
, int));
60 static tree convert_for_assignment
PROTO((tree
, tree
, const char *, tree
,
62 static void warn_for_assignment
PROTO((const char *, const char *,
64 static tree valid_compound_expr_initializer
PROTO((tree
, tree
));
65 static void push_string
PROTO((const char *));
66 static void push_member_name
PROTO((tree
));
67 static void push_array_bounds
PROTO((int));
68 static int spelling_length
PROTO((void));
69 static char *print_spelling
PROTO((char *));
70 static void warning_init
PROTO((const char *));
71 static tree digest_init
PROTO((tree
, tree
, int, int));
72 static void check_init_type_bitfields
PROTO((tree
));
73 static void output_init_element
PROTO((tree
, tree
, tree
, int));
74 static void output_pending_init_elements
PROTO((int));
75 static void add_pending_init
PROTO((tree
, tree
));
76 static int pending_init_member
PROTO((tree
));
78 /* Do `exp = require_complete_type (exp);' to make sure exp
79 does not have an incomplete type. (That includes void types.) */
82 require_complete_type (value
)
85 tree type
= TREE_TYPE (value
);
87 if (TREE_CODE (value
) == ERROR_MARK
)
88 return error_mark_node
;
90 /* First, detect a valid value with a complete type. */
91 if (TYPE_SIZE (type
) != 0
92 && type
!= void_type_node
)
95 incomplete_type_error (value
, type
);
96 return error_mark_node
;
99 /* Print an error message for invalid use of an incomplete type.
100 VALUE is the expression that was used (or 0 if that isn't known)
101 and TYPE is the type that was invalid. */
104 incomplete_type_error (value
, type
)
108 const char *type_code_string
;
110 /* Avoid duplicate error message. */
111 if (TREE_CODE (type
) == ERROR_MARK
)
114 if (value
!= 0 && (TREE_CODE (value
) == VAR_DECL
115 || TREE_CODE (value
) == PARM_DECL
))
116 error ("`%s' has an incomplete type",
117 IDENTIFIER_POINTER (DECL_NAME (value
)));
121 /* We must print an error message. Be clever about what it says. */
123 switch (TREE_CODE (type
))
126 type_code_string
= "struct";
130 type_code_string
= "union";
134 type_code_string
= "enum";
138 error ("invalid use of void expression");
142 if (TYPE_DOMAIN (type
))
144 type
= TREE_TYPE (type
);
147 error ("invalid use of array with unspecified bounds");
154 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
155 error ("invalid use of undefined type `%s %s'",
156 type_code_string
, IDENTIFIER_POINTER (TYPE_NAME (type
)));
158 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
159 error ("invalid use of incomplete typedef `%s'",
160 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
))));
164 /* Return a variant of TYPE which has all the type qualifiers of LIKE
165 as well as those of TYPE. */
168 qualify_type (type
, like
)
171 return c_build_qualified_type (type
,
172 TYPE_QUALS (type
) | TYPE_QUALS (like
));
175 /* Return the common type of two types.
176 We assume that comptypes has already been done and returned 1;
177 if that isn't so, this may crash. In particular, we assume that qualifiers
180 This is the type for the result of most arithmetic operations
181 if the operands have the given two types. */
187 register enum tree_code code1
;
188 register enum tree_code code2
;
191 /* Save time if the two types are the same. */
193 if (t1
== t2
) return t1
;
195 /* If one type is nonsense, use the other. */
196 if (t1
== error_mark_node
)
198 if (t2
== error_mark_node
)
201 /* Merge the attributes. */
202 attributes
= merge_machine_type_attributes (t1
, t2
);
204 /* Treat an enum type as the unsigned integer type of the same width. */
206 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
207 t1
= type_for_size (TYPE_PRECISION (t1
), 1);
208 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
209 t2
= type_for_size (TYPE_PRECISION (t2
), 1);
211 code1
= TREE_CODE (t1
);
212 code2
= TREE_CODE (t2
);
214 /* If one type is complex, form the common type of the non-complex
215 components, then make that complex. Use T1 or T2 if it is the
217 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
219 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
220 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
221 tree subtype
= common_type (subtype1
, subtype2
);
223 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
224 return build_type_attribute_variant (t1
, attributes
);
225 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
226 return build_type_attribute_variant (t2
, attributes
);
228 return build_type_attribute_variant (build_complex_type (subtype
),
236 /* If only one is real, use it as the result. */
238 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
239 return build_type_attribute_variant (t1
, attributes
);
241 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
242 return build_type_attribute_variant (t2
, attributes
);
244 /* Both real or both integers; use the one with greater precision. */
246 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
247 return build_type_attribute_variant (t1
, attributes
);
248 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
249 return build_type_attribute_variant (t2
, attributes
);
251 /* Same precision. Prefer longs to ints even when same size. */
253 if (TYPE_MAIN_VARIANT (t1
) == long_unsigned_type_node
254 || TYPE_MAIN_VARIANT (t2
) == long_unsigned_type_node
)
255 return build_type_attribute_variant (long_unsigned_type_node
,
258 if (TYPE_MAIN_VARIANT (t1
) == long_integer_type_node
259 || TYPE_MAIN_VARIANT (t2
) == long_integer_type_node
)
261 /* But preserve unsignedness from the other type,
262 since long cannot hold all the values of an unsigned int. */
263 if (TREE_UNSIGNED (t1
) || TREE_UNSIGNED (t2
))
264 t1
= long_unsigned_type_node
;
266 t1
= long_integer_type_node
;
267 return build_type_attribute_variant (t1
, attributes
);
270 /* Likewise, prefer long double to double even if same size. */
271 if (TYPE_MAIN_VARIANT (t1
) == long_double_type_node
272 || TYPE_MAIN_VARIANT (t2
) == long_double_type_node
)
273 return build_type_attribute_variant (long_double_type_node
,
276 /* Otherwise prefer the unsigned one. */
278 if (TREE_UNSIGNED (t1
))
279 return build_type_attribute_variant (t1
, attributes
);
281 return build_type_attribute_variant (t2
, attributes
);
284 /* For two pointers, do this recursively on the target type,
285 and combine the qualifiers of the two types' targets. */
286 /* This code was turned off; I don't know why.
287 But ANSI C specifies doing this with the qualifiers.
288 So I turned it on again. */
290 tree pointed_to_1
= TREE_TYPE (t1
);
291 tree pointed_to_2
= TREE_TYPE (t2
);
292 tree target
= common_type (TYPE_MAIN_VARIANT (pointed_to_1
),
293 TYPE_MAIN_VARIANT (pointed_to_2
));
294 t1
= build_pointer_type (c_build_qualified_type
296 TYPE_QUALS (pointed_to_1
) |
297 TYPE_QUALS (pointed_to_2
)));
298 return build_type_attribute_variant (t1
, attributes
);
301 t1
= build_pointer_type (common_type (TREE_TYPE (t1
), TREE_TYPE (t2
)));
302 return build_type_attribute_variant (t1
, attributes
);
307 tree elt
= common_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
308 /* Save space: see if the result is identical to one of the args. */
309 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
310 return build_type_attribute_variant (t1
, attributes
);
311 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
312 return build_type_attribute_variant (t2
, attributes
);
313 /* Merge the element types, and have a size if either arg has one. */
314 t1
= build_array_type (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
315 return build_type_attribute_variant (t1
, attributes
);
319 /* Function types: prefer the one that specified arg types.
320 If both do, merge the arg types. Also merge the return types. */
322 tree valtype
= common_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
323 tree p1
= TYPE_ARG_TYPES (t1
);
324 tree p2
= TYPE_ARG_TYPES (t2
);
329 /* Save space: see if the result is identical to one of the args. */
330 if (valtype
== TREE_TYPE (t1
) && ! TYPE_ARG_TYPES (t2
))
331 return build_type_attribute_variant (t1
, attributes
);
332 if (valtype
== TREE_TYPE (t2
) && ! TYPE_ARG_TYPES (t1
))
333 return build_type_attribute_variant (t2
, attributes
);
335 /* Simple way if one arg fails to specify argument types. */
336 if (TYPE_ARG_TYPES (t1
) == 0)
338 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t2
));
339 return build_type_attribute_variant (t1
, attributes
);
341 if (TYPE_ARG_TYPES (t2
) == 0)
343 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t1
));
344 return build_type_attribute_variant (t1
, attributes
);
347 /* If both args specify argument types, we must merge the two
348 lists, argument by argument. */
350 len
= list_length (p1
);
353 for (i
= 0; i
< len
; i
++)
354 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
359 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
))
361 /* A null type means arg type is not specified.
362 Take whatever the other function type has. */
363 if (TREE_VALUE (p1
) == 0)
365 TREE_VALUE (n
) = TREE_VALUE (p2
);
368 if (TREE_VALUE (p2
) == 0)
370 TREE_VALUE (n
) = TREE_VALUE (p1
);
374 /* Given wait (union {union wait *u; int *i} *)
375 and wait (union wait *),
376 prefer union wait * as type of parm. */
377 if (TREE_CODE (TREE_VALUE (p1
)) == UNION_TYPE
378 && TREE_VALUE (p1
) != TREE_VALUE (p2
))
381 for (memb
= TYPE_FIELDS (TREE_VALUE (p1
));
382 memb
; memb
= TREE_CHAIN (memb
))
383 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (p2
)))
385 TREE_VALUE (n
) = TREE_VALUE (p2
);
387 pedwarn ("function types not truly compatible in ANSI C");
391 if (TREE_CODE (TREE_VALUE (p2
)) == UNION_TYPE
392 && TREE_VALUE (p2
) != TREE_VALUE (p1
))
395 for (memb
= TYPE_FIELDS (TREE_VALUE (p2
));
396 memb
; memb
= TREE_CHAIN (memb
))
397 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (p1
)))
399 TREE_VALUE (n
) = TREE_VALUE (p1
);
401 pedwarn ("function types not truly compatible in ANSI C");
405 TREE_VALUE (n
) = common_type (TREE_VALUE (p1
), TREE_VALUE (p2
));
409 t1
= build_function_type (valtype
, newargs
);
410 /* ... falls through ... */
414 return build_type_attribute_variant (t1
, attributes
);
419 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
420 or various other operations. Return 2 if they are compatible
421 but a warning may be needed if you use them together. */
424 comptypes (type1
, type2
)
427 register tree t1
= type1
;
428 register tree t2
= type2
;
431 /* Suppress errors caused by previously reported errors. */
433 if (t1
== t2
|| !t1
|| !t2
434 || TREE_CODE (t1
) == ERROR_MARK
|| TREE_CODE (t2
) == ERROR_MARK
)
437 /* Treat an enum type as the integer type of the same width and
440 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
441 t1
= type_for_size (TYPE_PRECISION (t1
), TREE_UNSIGNED (t1
));
442 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
443 t2
= type_for_size (TYPE_PRECISION (t2
), TREE_UNSIGNED (t2
));
448 /* Different classes of types can't be compatible. */
450 if (TREE_CODE (t1
) != TREE_CODE (t2
)) return 0;
452 /* Qualifiers must match. */
454 if (TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
457 /* Allow for two different type nodes which have essentially the same
458 definition. Note that we already checked for equality of the type
459 qualifiers (just above). */
461 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
464 #ifndef COMP_TYPE_ATTRIBUTES
465 #define COMP_TYPE_ATTRIBUTES(t1,t2) 1
468 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
469 if (! (attrval
= COMP_TYPE_ATTRIBUTES (t1
, t2
)))
472 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
475 switch (TREE_CODE (t1
))
478 val
= (TREE_TYPE (t1
) == TREE_TYPE (t2
)
479 ? 1 : comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
)));
483 val
= function_types_compatible_p (t1
, t2
);
488 tree d1
= TYPE_DOMAIN (t1
);
489 tree d2
= TYPE_DOMAIN (t2
);
492 /* Target types must match incl. qualifiers. */
493 if (TREE_TYPE (t1
) != TREE_TYPE (t2
)
494 && 0 == (val
= comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
))))
497 /* Sizes must match unless one is missing or variable. */
498 if (d1
== 0 || d2
== 0 || d1
== d2
499 || TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
500 || TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
501 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
502 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
)
505 if (! ((TREE_INT_CST_LOW (TYPE_MIN_VALUE (d1
))
506 == TREE_INT_CST_LOW (TYPE_MIN_VALUE (d2
)))
507 && (TREE_INT_CST_HIGH (TYPE_MIN_VALUE (d1
))
508 == TREE_INT_CST_HIGH (TYPE_MIN_VALUE (d2
)))
509 && (TREE_INT_CST_LOW (TYPE_MAX_VALUE (d1
))
510 == TREE_INT_CST_LOW (TYPE_MAX_VALUE (d2
)))
511 && (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (d1
))
512 == TREE_INT_CST_HIGH (TYPE_MAX_VALUE (d2
)))))
518 if (maybe_objc_comptypes (t1
, t2
, 0) == 1)
525 return attrval
== 2 && val
== 1 ? 2 : val
;
528 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
529 ignoring their qualifiers. */
532 comp_target_types (ttl
, ttr
)
537 /* Give maybe_objc_comptypes a crack at letting these types through. */
538 if ((val
= maybe_objc_comptypes (ttl
, ttr
, 1)) >= 0)
541 val
= comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ttl
)),
542 TYPE_MAIN_VARIANT (TREE_TYPE (ttr
)));
544 if (val
== 2 && pedantic
)
545 pedwarn ("types are not quite compatible");
549 /* Subroutines of `comptypes'. */
551 /* Return 1 if two function types F1 and F2 are compatible.
552 If either type specifies no argument types,
553 the other must specify a fixed number of self-promoting arg types.
554 Otherwise, if one type specifies only the number of arguments,
555 the other must specify that number of self-promoting arg types.
556 Otherwise, the argument types must match. */
559 function_types_compatible_p (f1
, f2
)
563 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
567 if (!(TREE_TYPE (f1
) == TREE_TYPE (f2
)
568 || (val
= comptypes (TREE_TYPE (f1
), TREE_TYPE (f2
)))))
571 args1
= TYPE_ARG_TYPES (f1
);
572 args2
= TYPE_ARG_TYPES (f2
);
574 /* An unspecified parmlist matches any specified parmlist
575 whose argument types don't need default promotions. */
579 if (!self_promoting_args_p (args2
))
581 /* If one of these types comes from a non-prototype fn definition,
582 compare that with the other type's arglist.
583 If they don't match, ask for a warning (but no error). */
584 if (TYPE_ACTUAL_ARG_TYPES (f1
)
585 && 1 != type_lists_compatible_p (args2
, TYPE_ACTUAL_ARG_TYPES (f1
)))
591 if (!self_promoting_args_p (args1
))
593 if (TYPE_ACTUAL_ARG_TYPES (f2
)
594 && 1 != type_lists_compatible_p (args1
, TYPE_ACTUAL_ARG_TYPES (f2
)))
599 /* Both types have argument lists: compare them and propagate results. */
600 val1
= type_lists_compatible_p (args1
, args2
);
601 return val1
!= 1 ? val1
: val
;
604 /* Check two lists of types for compatibility,
605 returning 0 for incompatible, 1 for compatible,
606 or 2 for compatible with warning. */
609 type_lists_compatible_p (args1
, args2
)
612 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
618 if (args1
== 0 && args2
== 0)
620 /* If one list is shorter than the other,
621 they fail to match. */
622 if (args1
== 0 || args2
== 0)
624 /* A null pointer instead of a type
625 means there is supposed to be an argument
626 but nothing is specified about what type it has.
627 So match anything that self-promotes. */
628 if (TREE_VALUE (args1
) == 0)
630 if (simple_type_promotes_to (TREE_VALUE (args2
)) != NULL_TREE
)
633 else if (TREE_VALUE (args2
) == 0)
635 if (simple_type_promotes_to (TREE_VALUE (args1
)) != NULL_TREE
)
638 else if (! (newval
= comptypes (TREE_VALUE (args1
), TREE_VALUE (args2
))))
640 /* Allow wait (union {union wait *u; int *i} *)
641 and wait (union wait *) to be compatible. */
642 if (TREE_CODE (TREE_VALUE (args1
)) == UNION_TYPE
643 && (TYPE_NAME (TREE_VALUE (args1
)) == 0
644 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args1
)))
645 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args1
))) == INTEGER_CST
646 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args1
)),
647 TYPE_SIZE (TREE_VALUE (args2
))))
650 for (memb
= TYPE_FIELDS (TREE_VALUE (args1
));
651 memb
; memb
= TREE_CHAIN (memb
))
652 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (args2
)))
657 else if (TREE_CODE (TREE_VALUE (args2
)) == UNION_TYPE
658 && (TYPE_NAME (TREE_VALUE (args2
)) == 0
659 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args2
)))
660 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args2
))) == INTEGER_CST
661 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args2
)),
662 TYPE_SIZE (TREE_VALUE (args1
))))
665 for (memb
= TYPE_FIELDS (TREE_VALUE (args2
));
666 memb
; memb
= TREE_CHAIN (memb
))
667 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (args1
)))
676 /* comptypes said ok, but record if it said to warn. */
680 args1
= TREE_CHAIN (args1
);
681 args2
= TREE_CHAIN (args2
);
685 /* Compute the value of the `sizeof' operator. */
691 enum tree_code code
= TREE_CODE (type
);
694 if (code
== FUNCTION_TYPE
)
696 if (pedantic
|| warn_pointer_arith
)
697 pedwarn ("sizeof applied to a function type");
700 if (code
== VOID_TYPE
)
702 if (pedantic
|| warn_pointer_arith
)
703 pedwarn ("sizeof applied to a void type");
706 if (code
== ERROR_MARK
)
708 if (TYPE_SIZE (type
) == 0)
710 error ("sizeof applied to an incomplete type");
714 /* Convert in case a char is more than one unit. */
715 t
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE (type
),
716 size_int (TYPE_PRECISION (char_type_node
)));
717 t
= convert (sizetype
, t
);
718 /* size_binop does not put the constant in range, so do it now. */
719 if (TREE_CODE (t
) == INTEGER_CST
&& force_fit_type (t
, 0))
720 TREE_CONSTANT_OVERFLOW (t
) = TREE_OVERFLOW (t
) = 1;
725 c_sizeof_nowarn (type
)
728 enum tree_code code
= TREE_CODE (type
);
731 if (code
== FUNCTION_TYPE
733 || code
== ERROR_MARK
)
735 if (TYPE_SIZE (type
) == 0)
738 /* Convert in case a char is more than one unit. */
739 t
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE (type
),
740 size_int (TYPE_PRECISION (char_type_node
)));
741 t
= convert (sizetype
, t
);
742 force_fit_type (t
, 0);
746 /* Compute the size to increment a pointer by. */
749 c_size_in_bytes (type
)
752 enum tree_code code
= TREE_CODE (type
);
755 if (code
== FUNCTION_TYPE
)
757 if (code
== VOID_TYPE
)
759 if (code
== ERROR_MARK
)
761 if (TYPE_SIZE (type
) == 0)
763 error ("arithmetic on pointer to an incomplete type");
767 /* Convert in case a char is more than one unit. */
768 t
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE (type
),
769 size_int (BITS_PER_UNIT
));
770 t
= convert (sizetype
, t
);
771 force_fit_type (t
, 0);
775 /* Implement the __alignof keyword: Return the minimum required
776 alignment of TYPE, measured in bytes. */
782 enum tree_code code
= TREE_CODE (type
);
784 if (code
== FUNCTION_TYPE
)
785 return size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
787 if (code
== VOID_TYPE
|| code
== ERROR_MARK
)
790 return size_int (TYPE_ALIGN (type
) / BITS_PER_UNIT
);
793 /* Implement the __alignof keyword: Return the minimum required
794 alignment of EXPR, measured in bytes. For VAR_DECL's and
795 FIELD_DECL's return DECL_ALIGN (which can be set from an
796 "aligned" __attribute__ specification). */
799 c_alignof_expr (expr
)
802 if (TREE_CODE (expr
) == VAR_DECL
)
803 return size_int (DECL_ALIGN (expr
) / BITS_PER_UNIT
);
805 if (TREE_CODE (expr
) == COMPONENT_REF
806 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
808 error ("`__alignof' applied to a bit-field");
811 else if (TREE_CODE (expr
) == COMPONENT_REF
812 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
813 return size_int (DECL_ALIGN (TREE_OPERAND (expr
, 1)) / BITS_PER_UNIT
);
815 if (TREE_CODE (expr
) == INDIRECT_REF
)
817 tree t
= TREE_OPERAND (expr
, 0);
819 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
821 while (TREE_CODE (t
) == NOP_EXPR
822 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
826 t
= TREE_OPERAND (t
, 0);
827 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
828 if (thisalign
> bestalign
)
829 best
= t
, bestalign
= thisalign
;
831 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
834 return c_alignof (TREE_TYPE (expr
));
837 /* Return either DECL or its known constant value (if it has one). */
840 decl_constant_value (decl
)
843 if (/* Don't change a variable array bound or initial value to a constant
844 in a place where a variable is invalid. */
845 current_function_decl
!= 0
847 && ! TREE_THIS_VOLATILE (decl
)
848 && TREE_READONLY (decl
) && ! ITERATOR_P (decl
)
849 && DECL_INITIAL (decl
) != 0
850 && TREE_CODE (DECL_INITIAL (decl
)) != ERROR_MARK
851 /* This is invalid if initial value is not constant.
852 If it has either a function call, a memory reference,
853 or a variable, then re-evaluating it could give different results. */
854 && TREE_CONSTANT (DECL_INITIAL (decl
))
855 /* Check for cases where this is sub-optimal, even though valid. */
856 && TREE_CODE (DECL_INITIAL (decl
)) != CONSTRUCTOR
857 && DECL_MODE (decl
) != BLKmode
)
858 return DECL_INITIAL (decl
);
862 /* Perform default promotions for C data used in expressions.
863 Arrays and functions are converted to pointers;
864 enumeral types or short or char, to int.
865 In addition, manifest constants symbols are replaced by their values. */
868 default_conversion (exp
)
871 register tree type
= TREE_TYPE (exp
);
872 register enum tree_code code
= TREE_CODE (type
);
874 /* Constants can be used directly unless they're not loadable. */
875 if (TREE_CODE (exp
) == CONST_DECL
)
876 exp
= DECL_INITIAL (exp
);
878 /* Replace a nonvolatile const static variable with its value unless
879 it is an array, in which case we must be sure that taking the
880 address of the array produces consistent results. */
881 else if (optimize
&& TREE_CODE (exp
) == VAR_DECL
&& code
!= ARRAY_TYPE
)
883 exp
= decl_constant_value (exp
);
884 type
= TREE_TYPE (exp
);
887 /* 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
)));
906 return convert (type
, exp
);
909 if (TREE_CODE (exp
) == COMPONENT_REF
910 && DECL_C_BIT_FIELD (TREE_OPERAND (exp
, 1)))
912 tree width
= DECL_SIZE (TREE_OPERAND (exp
, 1));
913 HOST_WIDE_INT low
= TREE_INT_CST_LOW (width
);
915 /* If it's thinner than an int, promote it like a
916 C_PROMOTING_INTEGER_TYPE_P, otherwise leave it alone. */
918 if (low
< TYPE_PRECISION (integer_type_node
))
920 if (flag_traditional
&& TREE_UNSIGNED (type
))
921 return convert (unsigned_type_node
, exp
);
923 return convert (integer_type_node
, exp
);
927 if (C_PROMOTING_INTEGER_TYPE_P (type
))
929 /* Traditionally, unsignedness is preserved in default promotions.
930 Also preserve unsignedness if not really getting any wider. */
931 if (TREE_UNSIGNED (type
)
933 || TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
)))
934 return convert (unsigned_type_node
, exp
);
935 return convert (integer_type_node
, exp
);
937 if (flag_traditional
&& !flag_allow_single_precision
938 && TYPE_MAIN_VARIANT (type
) == float_type_node
)
939 return convert (double_type_node
, exp
);
940 if (code
== VOID_TYPE
)
942 error ("void value not ignored as it ought to be");
943 return error_mark_node
;
945 if (code
== FUNCTION_TYPE
)
947 return build_unary_op (ADDR_EXPR
, exp
, 0);
949 if (code
== ARRAY_TYPE
)
952 tree restype
= TREE_TYPE (type
);
957 if (TREE_CODE_CLASS (TREE_CODE (exp
)) == 'r'
958 || TREE_CODE_CLASS (TREE_CODE (exp
)) == 'd')
960 constp
= TREE_READONLY (exp
);
961 volatilep
= TREE_THIS_VOLATILE (exp
);
964 if (TYPE_QUALS (type
) || constp
|| volatilep
)
966 = c_build_qualified_type (restype
,
968 | (constp
* TYPE_QUAL_CONST
)
969 | (volatilep
* TYPE_QUAL_VOLATILE
));
971 if (TREE_CODE (exp
) == INDIRECT_REF
)
972 return convert (TYPE_POINTER_TO (restype
),
973 TREE_OPERAND (exp
, 0));
975 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
977 tree op1
= default_conversion (TREE_OPERAND (exp
, 1));
978 return build (COMPOUND_EXPR
, TREE_TYPE (op1
),
979 TREE_OPERAND (exp
, 0), op1
);
983 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
985 error ("invalid use of non-lvalue array");
986 return error_mark_node
;
989 ptrtype
= build_pointer_type (restype
);
991 if (TREE_CODE (exp
) == VAR_DECL
)
993 /* ??? This is not really quite correct
994 in that the type of the operand of ADDR_EXPR
995 is not the target type of the type of the ADDR_EXPR itself.
996 Question is, can this lossage be avoided? */
997 adr
= build1 (ADDR_EXPR
, ptrtype
, exp
);
998 if (mark_addressable (exp
) == 0)
999 return error_mark_node
;
1000 TREE_CONSTANT (adr
) = staticp (exp
);
1001 TREE_SIDE_EFFECTS (adr
) = 0; /* Default would be, same as EXP. */
1004 /* This way is better for a COMPONENT_REF since it can
1005 simplify the offset for a component. */
1006 adr
= build_unary_op (ADDR_EXPR
, exp
, 1);
1007 return convert (ptrtype
, adr
);
1012 /* Look up component name in the structure type definition.
1014 If this component name is found indirectly within an anonymous union,
1015 store in *INDIRECT the component which directly contains
1016 that anonymous union. Otherwise, set *INDIRECT to 0. */
1019 lookup_field (type
, component
, indirect
)
1020 tree type
, component
;
1025 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1026 to the field elements. Use a binary search on this array to quickly
1027 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1028 will always be set for structures which have many elements. */
1030 if (TYPE_LANG_SPECIFIC (type
))
1033 tree
*field_array
= &TYPE_LANG_SPECIFIC (type
)->elts
[0];
1035 field
= TYPE_FIELDS (type
);
1037 top
= TYPE_LANG_SPECIFIC (type
)->len
;
1038 while (top
- bot
> 1)
1040 half
= (top
- bot
+ 1) >> 1;
1041 field
= field_array
[bot
+half
];
1043 if (DECL_NAME (field
) == NULL_TREE
)
1045 /* Step through all anon unions in linear fashion. */
1046 while (DECL_NAME (field_array
[bot
]) == NULL_TREE
)
1048 tree anon
= 0, junk
;
1050 field
= field_array
[bot
++];
1051 if (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
1052 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
1053 anon
= lookup_field (TREE_TYPE (field
), component
, &junk
);
1055 if (anon
!= NULL_TREE
)
1062 /* Entire record is only anon unions. */
1066 /* Restart the binary search, with new lower bound. */
1070 if (DECL_NAME (field
) == component
)
1072 if (DECL_NAME (field
) < component
)
1078 if (DECL_NAME (field_array
[bot
]) == component
)
1079 field
= field_array
[bot
];
1080 else if (DECL_NAME (field
) != component
)
1085 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1087 if (DECL_NAME (field
) == NULL_TREE
)
1092 if (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
1093 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
1094 anon
= lookup_field (TREE_TYPE (field
), component
, &junk
);
1096 if (anon
!= NULL_TREE
)
1103 if (DECL_NAME (field
) == component
)
1108 *indirect
= NULL_TREE
;
1112 /* Make an expression to refer to the COMPONENT field of
1113 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1116 build_component_ref (datum
, component
)
1117 tree datum
, component
;
1119 register tree type
= TREE_TYPE (datum
);
1120 register enum tree_code code
= TREE_CODE (type
);
1121 register tree field
= NULL
;
1124 /* If DATUM is a COMPOUND_EXPR or COND_EXPR, move our reference inside it
1125 unless we are not to support things not strictly ANSI. */
1126 switch (TREE_CODE (datum
))
1130 tree value
= build_component_ref (TREE_OPERAND (datum
, 1), component
);
1131 return build (COMPOUND_EXPR
, TREE_TYPE (value
),
1132 TREE_OPERAND (datum
, 0), value
);
1135 return build_conditional_expr
1136 (TREE_OPERAND (datum
, 0),
1137 build_component_ref (TREE_OPERAND (datum
, 1), component
),
1138 build_component_ref (TREE_OPERAND (datum
, 2), component
));
1144 /* See if there is a field or component with name COMPONENT. */
1146 if (code
== RECORD_TYPE
|| code
== UNION_TYPE
)
1150 if (TYPE_SIZE (type
) == 0)
1152 incomplete_type_error (NULL_TREE
, type
);
1153 return error_mark_node
;
1156 field
= lookup_field (type
, component
, &indirect
);
1160 error (code
== RECORD_TYPE
1161 ? "structure has no member named `%s'"
1162 : "union has no member named `%s'",
1163 IDENTIFIER_POINTER (component
));
1164 return error_mark_node
;
1166 if (TREE_TYPE (field
) == error_mark_node
)
1167 return error_mark_node
;
1169 /* If FIELD was found buried within an anonymous union,
1170 make one COMPONENT_REF to get that anonymous union,
1171 then fall thru to make a second COMPONENT_REF to get FIELD. */
1174 ref
= build (COMPONENT_REF
, TREE_TYPE (indirect
), datum
, indirect
);
1175 if (TREE_READONLY (datum
) || TREE_READONLY (indirect
))
1176 TREE_READONLY (ref
) = 1;
1177 if (TREE_THIS_VOLATILE (datum
) || TREE_THIS_VOLATILE (indirect
))
1178 TREE_THIS_VOLATILE (ref
) = 1;
1182 ref
= build (COMPONENT_REF
, TREE_TYPE (field
), datum
, field
);
1184 if (TREE_READONLY (datum
) || TREE_READONLY (field
))
1185 TREE_READONLY (ref
) = 1;
1186 if (TREE_THIS_VOLATILE (datum
) || TREE_THIS_VOLATILE (field
))
1187 TREE_THIS_VOLATILE (ref
) = 1;
1191 else if (code
!= ERROR_MARK
)
1192 error ("request for member `%s' in something not a structure or union",
1193 IDENTIFIER_POINTER (component
));
1195 return error_mark_node
;
1198 /* Given an expression PTR for a pointer, return an expression
1199 for the value pointed to.
1200 ERRORSTRING is the name of the operator to appear in error messages. */
1203 build_indirect_ref (ptr
, errorstring
)
1205 const char *errorstring
;
1207 register tree pointer
= default_conversion (ptr
);
1208 register tree type
= TREE_TYPE (pointer
);
1210 if (TREE_CODE (type
) == POINTER_TYPE
)
1212 if (TREE_CODE (pointer
) == ADDR_EXPR
1214 && (TREE_TYPE (TREE_OPERAND (pointer
, 0))
1215 == TREE_TYPE (type
)))
1216 return TREE_OPERAND (pointer
, 0);
1219 tree t
= TREE_TYPE (type
);
1220 register tree ref
= build1 (INDIRECT_REF
,
1221 TYPE_MAIN_VARIANT (t
), pointer
);
1223 if (TYPE_SIZE (t
) == 0 && TREE_CODE (t
) != ARRAY_TYPE
)
1225 error ("dereferencing pointer to incomplete type");
1226 return error_mark_node
;
1228 if (TREE_CODE (t
) == VOID_TYPE
&& skip_evaluation
== 0)
1229 warning ("dereferencing `void *' pointer");
1231 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1232 so that we get the proper error message if the result is used
1233 to assign to. Also, &* is supposed to be a no-op.
1234 And ANSI C seems to specify that the type of the result
1235 should be the const type. */
1236 /* A de-reference of a pointer to const is not a const. It is valid
1237 to change it via some other pointer. */
1238 TREE_READONLY (ref
) = TYPE_READONLY (t
);
1239 TREE_SIDE_EFFECTS (ref
)
1240 = TYPE_VOLATILE (t
) || TREE_SIDE_EFFECTS (pointer
) || flag_volatile
;
1241 TREE_THIS_VOLATILE (ref
) = TYPE_VOLATILE (t
);
1245 else if (TREE_CODE (pointer
) != ERROR_MARK
)
1246 error ("invalid type argument of `%s'", errorstring
);
1247 return error_mark_node
;
1250 /* This handles expressions of the form "a[i]", which denotes
1253 This is logically equivalent in C to *(a+i), but we may do it differently.
1254 If A is a variable or a member, we generate a primitive ARRAY_REF.
1255 This avoids forcing the array out of registers, and can work on
1256 arrays that are not lvalues (for example, members of structures returned
1260 build_array_ref (array
, index
)
1265 error ("subscript missing in array reference");
1266 return error_mark_node
;
1269 if (TREE_TYPE (array
) == error_mark_node
1270 || TREE_TYPE (index
) == error_mark_node
)
1271 return error_mark_node
;
1273 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
1274 && TREE_CODE (array
) != INDIRECT_REF
)
1278 /* Subscripting with type char is likely to lose
1279 on a machine where chars are signed.
1280 So warn on any machine, but optionally.
1281 Don't warn for unsigned char since that type is safe.
1282 Don't warn for signed char because anyone who uses that
1283 must have done so deliberately. */
1284 if (warn_char_subscripts
1285 && TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
)
1286 warning ("array subscript has type `char'");
1288 /* Apply default promotions *after* noticing character types. */
1289 index
= default_conversion (index
);
1291 /* Require integer *after* promotion, for sake of enums. */
1292 if (TREE_CODE (TREE_TYPE (index
)) != INTEGER_TYPE
)
1294 error ("array subscript is not an integer");
1295 return error_mark_node
;
1298 /* An array that is indexed by a non-constant
1299 cannot be stored in a register; we must be able to do
1300 address arithmetic on its address.
1301 Likewise an array of elements of variable size. */
1302 if (TREE_CODE (index
) != INTEGER_CST
1303 || (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))) != 0
1304 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
)))) != INTEGER_CST
))
1306 if (mark_addressable (array
) == 0)
1307 return error_mark_node
;
1309 /* An array that is indexed by a constant value which is not within
1310 the array bounds cannot be stored in a register either; because we
1311 would get a crash in store_bit_field/extract_bit_field when trying
1312 to access a non-existent part of the register. */
1313 if (TREE_CODE (index
) == INTEGER_CST
1314 && TYPE_VALUES (TREE_TYPE (array
))
1315 && ! int_fits_type_p (index
, TYPE_VALUES (TREE_TYPE (array
))))
1317 if (mark_addressable (array
) == 0)
1318 return error_mark_node
;
1321 if (pedantic
&& !lvalue_p (array
))
1323 if (DECL_REGISTER (array
))
1324 pedwarn ("ANSI C forbids subscripting `register' array");
1326 pedwarn ("ANSI C forbids subscripting non-lvalue array");
1332 while (TREE_CODE (foo
) == COMPONENT_REF
)
1333 foo
= TREE_OPERAND (foo
, 0);
1334 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
))
1335 pedwarn ("ANSI C forbids subscripting non-lvalue array");
1338 type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array
)));
1339 rval
= build (ARRAY_REF
, type
, array
, index
);
1340 /* Array ref is const/volatile if the array elements are
1341 or if the array is. */
1342 TREE_READONLY (rval
)
1343 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array
)))
1344 | TREE_READONLY (array
));
1345 TREE_SIDE_EFFECTS (rval
)
1346 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
1347 | TREE_SIDE_EFFECTS (array
));
1348 TREE_THIS_VOLATILE (rval
)
1349 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
1350 /* This was added by rms on 16 Nov 91.
1351 It fixes vol struct foo *a; a->elts[1]
1352 in an inline function.
1353 Hope it doesn't break something else. */
1354 | TREE_THIS_VOLATILE (array
));
1355 return require_complete_type (fold (rval
));
1359 tree ar
= default_conversion (array
);
1360 tree ind
= default_conversion (index
);
1362 /* Do the same warning check as above, but only on the part that's
1363 syntactically the index and only if it is also semantically
1365 if (warn_char_subscripts
1366 && TREE_CODE (TREE_TYPE (index
)) == INTEGER_TYPE
1367 && TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
)
1368 warning ("subscript has type `char'");
1370 /* Put the integer in IND to simplify error checking. */
1371 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
1378 if (ar
== error_mark_node
)
1381 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
1382 || TREE_CODE (TREE_TYPE (TREE_TYPE (ar
))) == FUNCTION_TYPE
)
1384 error ("subscripted value is neither array nor pointer");
1385 return error_mark_node
;
1387 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
1389 error ("array subscript is not an integer");
1390 return error_mark_node
;
1393 return build_indirect_ref (build_binary_op (PLUS_EXPR
, ar
, ind
, 0),
1398 /* Build a function call to function FUNCTION with parameters PARAMS.
1399 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1400 TREE_VALUE of each node is a parameter-expression.
1401 FUNCTION's data type may be a function type or a pointer-to-function. */
1404 build_function_call (function
, params
)
1405 tree function
, params
;
1407 register tree fntype
, fundecl
= 0;
1408 register tree coerced_params
;
1409 tree name
= NULL_TREE
, assembler_name
= NULL_TREE
;
1411 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1412 STRIP_TYPE_NOPS (function
);
1414 /* Convert anything with function type to a pointer-to-function. */
1415 if (TREE_CODE (function
) == FUNCTION_DECL
)
1417 name
= DECL_NAME (function
);
1418 assembler_name
= DECL_ASSEMBLER_NAME (function
);
1420 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1421 (because calling an inline function does not mean the function
1422 needs to be separately compiled). */
1423 fntype
= build_type_variant (TREE_TYPE (function
),
1424 TREE_READONLY (function
),
1425 TREE_THIS_VOLATILE (function
));
1427 function
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), function
);
1430 function
= default_conversion (function
);
1432 fntype
= TREE_TYPE (function
);
1434 if (TREE_CODE (fntype
) == ERROR_MARK
)
1435 return error_mark_node
;
1437 if (!(TREE_CODE (fntype
) == POINTER_TYPE
1438 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
))
1440 error ("called object is not a function");
1441 return error_mark_node
;
1444 /* fntype now gets the type of function pointed to. */
1445 fntype
= TREE_TYPE (fntype
);
1447 /* Convert the parameters to the types declared in the
1448 function prototype, or apply default promotions. */
1451 = convert_arguments (TYPE_ARG_TYPES (fntype
), params
, name
, fundecl
);
1453 /* Check for errors in format strings. */
1455 if (warn_format
&& (name
|| assembler_name
))
1456 check_function_format (name
, assembler_name
, coerced_params
);
1458 /* Recognize certain built-in functions so we can make tree-codes
1459 other than CALL_EXPR. We do this when it enables fold-const.c
1460 to do something useful. */
1462 if (TREE_CODE (function
) == ADDR_EXPR
1463 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
1464 && DECL_BUILT_IN (TREE_OPERAND (function
, 0)))
1465 switch (DECL_FUNCTION_CODE (TREE_OPERAND (function
, 0)))
1470 if (coerced_params
== 0)
1471 return integer_zero_node
;
1472 return build_unary_op (ABS_EXPR
, TREE_VALUE (coerced_params
), 0);
1478 register tree result
1479 = build (CALL_EXPR
, TREE_TYPE (fntype
),
1480 function
, coerced_params
, NULL_TREE
);
1482 TREE_SIDE_EFFECTS (result
) = 1;
1483 if (TREE_TYPE (result
) == void_type_node
)
1485 return require_complete_type (result
);
1489 /* Convert the argument expressions in the list VALUES
1490 to the types in the list TYPELIST. The result is a list of converted
1491 argument expressions.
1493 If TYPELIST is exhausted, or when an element has NULL as its type,
1494 perform the default conversions.
1496 PARMLIST is the chain of parm decls for the function being called.
1497 It may be 0, if that info is not available.
1498 It is used only for generating error messages.
1500 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1502 This is also where warnings about wrong number of args are generated.
1504 Both VALUES and the returned value are chains of TREE_LIST nodes
1505 with the elements of the list in the TREE_VALUE slots of those nodes. */
1508 convert_arguments (typelist
, values
, name
, fundecl
)
1509 tree typelist
, values
, name
, fundecl
;
1511 register tree typetail
, valtail
;
1512 register tree result
= NULL
;
1515 /* Scan the given expressions and types, producing individual
1516 converted arguments and pushing them on RESULT in reverse order. */
1518 for (valtail
= values
, typetail
= typelist
, parmnum
= 0;
1520 valtail
= TREE_CHAIN (valtail
), parmnum
++)
1522 register tree type
= typetail
? TREE_VALUE (typetail
) : 0;
1523 register tree val
= TREE_VALUE (valtail
);
1525 if (type
== void_type_node
)
1528 error ("too many arguments to function `%s'",
1529 IDENTIFIER_POINTER (name
));
1531 error ("too many arguments to function");
1535 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1536 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1537 to convert automatically to a pointer. */
1538 if (TREE_CODE (val
) == NON_LVALUE_EXPR
)
1539 val
= TREE_OPERAND (val
, 0);
1541 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
1542 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
)
1543 val
= default_conversion (val
);
1545 val
= require_complete_type (val
);
1549 /* Formal parm type is specified by a function prototype. */
1552 if (TYPE_SIZE (type
) == 0)
1554 error ("type of formal parameter %d is incomplete", parmnum
+ 1);
1559 /* Optionally warn about conversions that
1560 differ from the default conversions. */
1561 if (warn_conversion
)
1563 int formal_prec
= TYPE_PRECISION (type
);
1565 if (INTEGRAL_TYPE_P (type
)
1566 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
1567 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name
, parmnum
+ 1);
1568 else if (TREE_CODE (type
) == COMPLEX_TYPE
1569 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
1570 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name
, parmnum
+ 1);
1571 else if (TREE_CODE (type
) == REAL_TYPE
1572 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
1573 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name
, parmnum
+ 1);
1574 else if (TREE_CODE (type
) == REAL_TYPE
1575 && TREE_CODE (TREE_TYPE (val
)) == COMPLEX_TYPE
)
1576 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name
, parmnum
+ 1);
1577 /* ??? At some point, messages should be written about
1578 conversions between complex types, but that's too messy
1580 else if (TREE_CODE (type
) == REAL_TYPE
1581 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
1583 /* Warn if any argument is passed as `float',
1584 since without a prototype it would be `double'. */
1585 if (formal_prec
== TYPE_PRECISION (float_type_node
))
1586 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name
, parmnum
+ 1);
1588 /* Detect integer changing in width or signedness. */
1589 else if (INTEGRAL_TYPE_P (type
)
1590 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
1592 tree would_have_been
= default_conversion (val
);
1593 tree type1
= TREE_TYPE (would_have_been
);
1595 if (TREE_CODE (type
) == ENUMERAL_TYPE
1596 && type
== TREE_TYPE (val
))
1597 /* No warning if function asks for enum
1598 and the actual arg is that enum type. */
1600 else if (formal_prec
!= TYPE_PRECISION (type1
))
1601 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name
, parmnum
+ 1);
1602 else if (TREE_UNSIGNED (type
) == TREE_UNSIGNED (type1
))
1604 /* Don't complain if the formal parameter type
1605 is an enum, because we can't tell now whether
1606 the value was an enum--even the same enum. */
1607 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
1609 else if (TREE_CODE (val
) == INTEGER_CST
1610 && int_fits_type_p (val
, type
))
1611 /* Change in signedness doesn't matter
1612 if a constant value is unaffected. */
1614 /* Likewise for a constant in a NOP_EXPR. */
1615 else if (TREE_CODE (val
) == NOP_EXPR
1616 && TREE_CODE (TREE_OPERAND (val
, 0)) == INTEGER_CST
1617 && int_fits_type_p (TREE_OPERAND (val
, 0), type
))
1619 #if 0 /* We never get such tree structure here. */
1620 else if (TREE_CODE (TREE_TYPE (val
)) == ENUMERAL_TYPE
1621 && int_fits_type_p (TYPE_MIN_VALUE (TREE_TYPE (val
)), type
)
1622 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (val
)), type
))
1623 /* Change in signedness doesn't matter
1624 if an enum value is unaffected. */
1627 /* If the value is extended from a narrower
1628 unsigned type, it doesn't matter whether we
1629 pass it as signed or unsigned; the value
1630 certainly is the same either way. */
1631 else if (TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
)
1632 && TREE_UNSIGNED (TREE_TYPE (val
)))
1634 else if (TREE_UNSIGNED (type
))
1635 warn_for_assignment ("%s as unsigned due to prototype", (char *) 0, name
, parmnum
+ 1);
1637 warn_for_assignment ("%s as signed due to prototype", (char *) 0, name
, parmnum
+ 1);
1641 parmval
= convert_for_assignment (type
, val
,
1642 (char *) 0, /* arg passing */
1643 fundecl
, name
, parmnum
+ 1);
1645 if (PROMOTE_PROTOTYPES
1646 && (TREE_CODE (type
) == INTEGER_TYPE
1647 || TREE_CODE (type
) == ENUMERAL_TYPE
)
1648 && (TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)))
1649 parmval
= default_conversion (parmval
);
1651 result
= tree_cons (NULL_TREE
, parmval
, result
);
1653 else if (TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
1654 && (TYPE_PRECISION (TREE_TYPE (val
))
1655 < TYPE_PRECISION (double_type_node
)))
1656 /* Convert `float' to `double'. */
1657 result
= tree_cons (NULL_TREE
, convert (double_type_node
, val
), result
);
1659 /* Convert `short' and `char' to full-size `int'. */
1660 result
= tree_cons (NULL_TREE
, default_conversion (val
), result
);
1663 typetail
= TREE_CHAIN (typetail
);
1666 if (typetail
!= 0 && TREE_VALUE (typetail
) != void_type_node
)
1669 error ("too few arguments to function `%s'",
1670 IDENTIFIER_POINTER (name
));
1672 error ("too few arguments to function");
1675 return nreverse (result
);
1678 /* This is the entry point used by the parser
1679 for binary operators in the input.
1680 In addition to constructing the expression,
1681 we check for operands that were written with other binary operators
1682 in a way that is likely to confuse the user. */
1685 parser_build_binary_op (code
, arg1
, arg2
)
1686 enum tree_code code
;
1689 tree result
= build_binary_op (code
, arg1
, arg2
, 1);
1692 char class1
= TREE_CODE_CLASS (TREE_CODE (arg1
));
1693 char class2
= TREE_CODE_CLASS (TREE_CODE (arg2
));
1694 enum tree_code code1
= ERROR_MARK
;
1695 enum tree_code code2
= ERROR_MARK
;
1697 if (class1
== 'e' || class1
== '1'
1698 || class1
== '2' || class1
== '<')
1699 code1
= C_EXP_ORIGINAL_CODE (arg1
);
1700 if (class2
== 'e' || class2
== '1'
1701 || class2
== '2' || class2
== '<')
1702 code2
= C_EXP_ORIGINAL_CODE (arg2
);
1704 /* Check for cases such as x+y<<z which users are likely
1705 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
1706 is cleared to prevent these warnings. */
1707 if (warn_parentheses
)
1709 if (code
== LSHIFT_EXPR
|| code
== RSHIFT_EXPR
)
1711 if (code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
1712 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
1713 warning ("suggest parentheses around + or - inside shift");
1716 if (code
== TRUTH_ORIF_EXPR
)
1718 if (code1
== TRUTH_ANDIF_EXPR
1719 || code2
== TRUTH_ANDIF_EXPR
)
1720 warning ("suggest parentheses around && within ||");
1723 if (code
== BIT_IOR_EXPR
)
1725 if (code1
== BIT_AND_EXPR
|| code1
== BIT_XOR_EXPR
1726 || code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
1727 || code2
== BIT_AND_EXPR
|| code2
== BIT_XOR_EXPR
1728 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
1729 warning ("suggest parentheses around arithmetic in operand of |");
1730 /* Check cases like x|y==z */
1731 if (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<')
1732 warning ("suggest parentheses around comparison in operand of |");
1735 if (code
== BIT_XOR_EXPR
)
1737 if (code1
== BIT_AND_EXPR
1738 || code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
1739 || code2
== BIT_AND_EXPR
1740 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
1741 warning ("suggest parentheses around arithmetic in operand of ^");
1742 /* Check cases like x^y==z */
1743 if (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<')
1744 warning ("suggest parentheses around comparison in operand of ^");
1747 if (code
== BIT_AND_EXPR
)
1749 if (code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
1750 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
1751 warning ("suggest parentheses around + or - in operand of &");
1752 /* Check cases like x&y==z */
1753 if (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<')
1754 warning ("suggest parentheses around comparison in operand of &");
1758 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
1759 if (TREE_CODE_CLASS (code
) == '<' && extra_warnings
1760 && (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<'))
1761 warning ("comparisons like X<=Y<=Z do not have their mathematical meaning");
1763 unsigned_conversion_warning (result
, arg1
);
1764 unsigned_conversion_warning (result
, arg2
);
1765 overflow_warning (result
);
1767 class = TREE_CODE_CLASS (TREE_CODE (result
));
1769 /* Record the code that was specified in the source,
1770 for the sake of warnings about confusing nesting. */
1771 if (class == 'e' || class == '1'
1772 || class == '2' || class == '<')
1773 C_SET_EXP_ORIGINAL_CODE (result
, code
);
1776 int flag
= TREE_CONSTANT (result
);
1777 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
1778 so that convert_for_assignment wouldn't strip it.
1779 That way, we got warnings for things like p = (1 - 1).
1780 But it turns out we should not get those warnings. */
1781 result
= build1 (NON_LVALUE_EXPR
, TREE_TYPE (result
), result
);
1782 C_SET_EXP_ORIGINAL_CODE (result
, code
);
1783 TREE_CONSTANT (result
) = flag
;
1789 /* Build a binary-operation expression without default conversions.
1790 CODE is the kind of expression to build.
1791 This function differs from `build' in several ways:
1792 the data type of the result is computed and recorded in it,
1793 warnings are generated if arg data types are invalid,
1794 special handling for addition and subtraction of pointers is known,
1795 and some optimization is done (operations on narrow ints
1796 are done in the narrower type when that gives the same result).
1797 Constant folding is also done before the result is returned.
1799 Note that the operands will never have enumeral types, or function
1800 or array types, because either they will have the default conversions
1801 performed or they have both just been converted to some other type in which
1802 the arithmetic is to be done. */
1805 build_binary_op (code
, orig_op0
, orig_op1
, convert_p
)
1806 enum tree_code code
;
1807 tree orig_op0
, orig_op1
;
1811 register enum tree_code code0
, code1
;
1814 /* Expression code to give to the expression when it is built.
1815 Normally this is CODE, which is what the caller asked for,
1816 but in some special cases we change it. */
1817 register enum tree_code resultcode
= code
;
1819 /* Data type in which the computation is to be performed.
1820 In the simplest cases this is the common type of the arguments. */
1821 register tree result_type
= NULL
;
1823 /* Nonzero means operands have already been type-converted
1824 in whatever way is necessary.
1825 Zero means they need to be converted to RESULT_TYPE. */
1828 /* Nonzero means create the expression with this type, rather than
1830 tree build_type
= 0;
1832 /* Nonzero means after finally constructing the expression
1833 convert it to this type. */
1834 tree final_type
= 0;
1836 /* Nonzero if this is an operation like MIN or MAX which can
1837 safely be computed in short if both args are promoted shorts.
1838 Also implies COMMON.
1839 -1 indicates a bitwise operation; this makes a difference
1840 in the exact conditions for when it is safe to do the operation
1841 in a narrower mode. */
1844 /* Nonzero if this is a comparison operation;
1845 if both args are promoted shorts, compare the original shorts.
1846 Also implies COMMON. */
1847 int short_compare
= 0;
1849 /* Nonzero if this is a right-shift operation, which can be computed on the
1850 original short and then promoted if the operand is a promoted short. */
1851 int short_shift
= 0;
1853 /* Nonzero means set RESULT_TYPE to the common type of the args. */
1858 op0
= default_conversion (orig_op0
);
1859 op1
= default_conversion (orig_op1
);
1867 type0
= TREE_TYPE (op0
);
1868 type1
= TREE_TYPE (op1
);
1870 /* The expression codes of the data types of the arguments tell us
1871 whether the arguments are integers, floating, pointers, etc. */
1872 code0
= TREE_CODE (type0
);
1873 code1
= TREE_CODE (type1
);
1875 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1876 STRIP_TYPE_NOPS (op0
);
1877 STRIP_TYPE_NOPS (op1
);
1879 /* If an error was already reported for one of the arguments,
1880 avoid reporting another error. */
1882 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
1883 return error_mark_node
;
1888 /* Handle the pointer + int case. */
1889 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
1890 return pointer_int_sum (PLUS_EXPR
, op0
, op1
);
1891 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
1892 return pointer_int_sum (PLUS_EXPR
, op1
, op0
);
1898 /* Subtraction of two similar pointers.
1899 We must subtract them as integers, then divide by object size. */
1900 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
1901 && comp_target_types (type0
, type1
))
1902 return pointer_diff (op0
, op1
);
1903 /* Handle pointer minus int. Just like pointer plus int. */
1904 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
1905 return pointer_int_sum (MINUS_EXPR
, op0
, op1
);
1914 case TRUNC_DIV_EXPR
:
1916 case FLOOR_DIV_EXPR
:
1917 case ROUND_DIV_EXPR
:
1918 case EXACT_DIV_EXPR
:
1919 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
1920 || code0
== COMPLEX_TYPE
)
1921 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
1922 || code1
== COMPLEX_TYPE
))
1924 if (!(code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
))
1925 resultcode
= RDIV_EXPR
;
1928 /* Although it would be tempting to shorten always here, that
1929 loses on some targets, since the modulo instruction is
1930 undefined if the quotient can't be represented in the
1931 computation mode. We shorten only if unsigned or if
1932 dividing by something we know != -1. */
1933 shorten
= (TREE_UNSIGNED (TREE_TYPE (orig_op0
))
1934 || (TREE_CODE (op1
) == INTEGER_CST
1935 && (TREE_INT_CST_LOW (op1
) != -1
1936 || TREE_INT_CST_HIGH (op1
) != -1)));
1943 case BIT_ANDTC_EXPR
:
1946 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
1948 /* If one operand is a constant, and the other is a short type
1949 that has been converted to an int,
1950 really do the work in the short type and then convert the
1951 result to int. If we are lucky, the constant will be 0 or 1
1952 in the short type, making the entire operation go away. */
1953 if (TREE_CODE (op0
) == INTEGER_CST
1954 && TREE_CODE (op1
) == NOP_EXPR
1955 && TYPE_PRECISION (type1
) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1
, 0)))
1956 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op1
, 0))))
1958 final_type
= result_type
;
1959 op1
= TREE_OPERAND (op1
, 0);
1960 result_type
= TREE_TYPE (op1
);
1962 if (TREE_CODE (op1
) == INTEGER_CST
1963 && TREE_CODE (op0
) == NOP_EXPR
1964 && TYPE_PRECISION (type0
) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0
, 0)))
1965 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
1967 final_type
= result_type
;
1968 op0
= TREE_OPERAND (op0
, 0);
1969 result_type
= TREE_TYPE (op0
);
1973 case TRUNC_MOD_EXPR
:
1974 case FLOOR_MOD_EXPR
:
1975 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
1977 /* Although it would be tempting to shorten always here, that loses
1978 on some targets, since the modulo instruction is undefined if the
1979 quotient can't be represented in the computation mode. We shorten
1980 only if unsigned or if dividing by something we know != -1. */
1981 shorten
= (TREE_UNSIGNED (TREE_TYPE (orig_op0
))
1982 || (TREE_CODE (op1
) == INTEGER_CST
1983 && (TREE_INT_CST_LOW (op1
) != -1
1984 || TREE_INT_CST_HIGH (op1
) != -1)));
1989 case TRUTH_ANDIF_EXPR
:
1990 case TRUTH_ORIF_EXPR
:
1991 case TRUTH_AND_EXPR
:
1993 case TRUTH_XOR_EXPR
:
1994 if ((code0
== INTEGER_TYPE
|| code0
== POINTER_TYPE
1995 || code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
1996 && (code1
== INTEGER_TYPE
|| code1
== POINTER_TYPE
1997 || code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
))
1999 /* Result of these operations is always an int,
2000 but that does not mean the operands should be
2001 converted to ints! */
2002 result_type
= integer_type_node
;
2003 op0
= truthvalue_conversion (op0
);
2004 op1
= truthvalue_conversion (op1
);
2009 /* Shift operations: result has same type as first operand;
2010 always convert second operand to int.
2011 Also set SHORT_SHIFT if shifting rightward. */
2014 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2016 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
2018 if (tree_int_cst_sgn (op1
) < 0)
2019 warning ("right shift count is negative");
2022 if (TREE_INT_CST_LOW (op1
) | TREE_INT_CST_HIGH (op1
))
2024 if (TREE_INT_CST_HIGH (op1
) != 0
2025 || ((unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (op1
)
2026 >= TYPE_PRECISION (type0
)))
2027 warning ("right shift count >= width of type");
2030 /* Use the type of the value to be shifted.
2031 This is what most traditional C compilers do. */
2032 result_type
= type0
;
2033 /* Unless traditional, convert the shift-count to an integer,
2034 regardless of size of value being shifted. */
2035 if (! flag_traditional
)
2037 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
2038 op1
= convert (integer_type_node
, op1
);
2039 /* Avoid converting op1 to result_type later. */
2046 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2048 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
2050 if (tree_int_cst_sgn (op1
) < 0)
2051 warning ("left shift count is negative");
2052 else if (TREE_INT_CST_HIGH (op1
) != 0
2053 || ((unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (op1
)
2054 >= TYPE_PRECISION (type0
)))
2055 warning ("left shift count >= width of type");
2057 /* Use the type of the value to be shifted.
2058 This is what most traditional C compilers do. */
2059 result_type
= type0
;
2060 /* Unless traditional, convert the shift-count to an integer,
2061 regardless of size of value being shifted. */
2062 if (! flag_traditional
)
2064 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
2065 op1
= convert (integer_type_node
, op1
);
2066 /* Avoid converting op1 to result_type later. */
2074 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2076 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
2078 if (tree_int_cst_sgn (op1
) < 0)
2079 warning ("shift count is negative");
2080 else if (TREE_INT_CST_HIGH (op1
) != 0
2081 || ((unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (op1
)
2082 >= TYPE_PRECISION (type0
)))
2083 warning ("shift count >= width of type");
2085 /* Use the type of the value to be shifted.
2086 This is what most traditional C compilers do. */
2087 result_type
= type0
;
2088 /* Unless traditional, convert the shift-count to an integer,
2089 regardless of size of value being shifted. */
2090 if (! flag_traditional
)
2092 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
2093 op1
= convert (integer_type_node
, op1
);
2094 /* Avoid converting op1 to result_type later. */
2102 if (warn_float_equal
&& (code0
== REAL_TYPE
|| code1
== REAL_TYPE
))
2103 warning ("comparing floating point with == or != is unsafe");
2104 /* Result of comparison is always int,
2105 but don't convert the args to int! */
2106 build_type
= integer_type_node
;
2107 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
2108 || code0
== COMPLEX_TYPE
)
2109 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
2110 || code1
== COMPLEX_TYPE
))
2112 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
2114 register tree tt0
= TREE_TYPE (type0
);
2115 register tree tt1
= TREE_TYPE (type1
);
2116 /* Anything compares with void *. void * compares with anything.
2117 Otherwise, the targets must be compatible
2118 and both must be object or both incomplete. */
2119 if (comp_target_types (type0
, type1
))
2120 result_type
= common_type (type0
, type1
);
2121 else if (TYPE_MAIN_VARIANT (tt0
) == void_type_node
)
2123 /* op0 != orig_op0 detects the case of something
2124 whose value is 0 but which isn't a valid null ptr const. */
2125 if (pedantic
&& (!integer_zerop (op0
) || op0
!= orig_op0
)
2126 && TREE_CODE (tt1
) == FUNCTION_TYPE
)
2127 pedwarn ("ANSI C forbids comparison of `void *' with function pointer");
2129 else if (TYPE_MAIN_VARIANT (tt1
) == void_type_node
)
2131 if (pedantic
&& (!integer_zerop (op1
) || op1
!= orig_op1
)
2132 && TREE_CODE (tt0
) == FUNCTION_TYPE
)
2133 pedwarn ("ANSI C forbids comparison of `void *' with function pointer");
2136 pedwarn ("comparison of distinct pointer types lacks a cast");
2138 if (result_type
== NULL_TREE
)
2139 result_type
= ptr_type_node
;
2141 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
2142 && integer_zerop (op1
))
2143 result_type
= type0
;
2144 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
2145 && integer_zerop (op0
))
2146 result_type
= type1
;
2147 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
2149 result_type
= type0
;
2150 if (! flag_traditional
)
2151 pedwarn ("comparison between pointer and integer");
2153 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
2155 result_type
= type1
;
2156 if (! flag_traditional
)
2157 pedwarn ("comparison between pointer and integer");
2163 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
2164 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
2166 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
2168 if (comp_target_types (type0
, type1
))
2170 result_type
= common_type (type0
, type1
);
2172 && TREE_CODE (TREE_TYPE (type0
)) == FUNCTION_TYPE
)
2173 pedwarn ("ANSI C forbids ordered comparisons of pointers to functions");
2177 result_type
= ptr_type_node
;
2178 pedwarn ("comparison of distinct pointer types lacks a cast");
2187 build_type
= integer_type_node
;
2188 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
2189 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
2191 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
2193 if (comp_target_types (type0
, type1
))
2195 result_type
= common_type (type0
, type1
);
2196 if ((TYPE_SIZE (TREE_TYPE (type0
)) != 0)
2197 != (TYPE_SIZE (TREE_TYPE (type1
)) != 0))
2198 pedwarn ("comparison of complete and incomplete pointers");
2200 && TREE_CODE (TREE_TYPE (type0
)) == FUNCTION_TYPE
)
2201 pedwarn ("ANSI C forbids ordered comparisons of pointers to functions");
2205 result_type
= ptr_type_node
;
2206 pedwarn ("comparison of distinct pointer types lacks a cast");
2209 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
2210 && integer_zerop (op1
))
2212 result_type
= type0
;
2213 if (pedantic
|| extra_warnings
)
2214 pedwarn ("ordered comparison of pointer with integer zero");
2216 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
2217 && integer_zerop (op0
))
2219 result_type
= type1
;
2221 pedwarn ("ordered comparison of pointer with integer zero");
2223 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
2225 result_type
= type0
;
2226 if (! flag_traditional
)
2227 pedwarn ("comparison between pointer and integer");
2229 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
2231 result_type
= type1
;
2232 if (! flag_traditional
)
2233 pedwarn ("comparison between pointer and integer");
2241 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
2243 (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
))
2245 int none_complex
= (code0
!= COMPLEX_TYPE
&& code1
!= COMPLEX_TYPE
);
2247 if (shorten
|| common
|| short_compare
)
2248 result_type
= common_type (type0
, type1
);
2250 /* For certain operations (which identify themselves by shorten != 0)
2251 if both args were extended from the same smaller type,
2252 do the arithmetic in that type and then extend.
2254 shorten !=0 and !=1 indicates a bitwise operation.
2255 For them, this optimization is safe only if
2256 both args are zero-extended or both are sign-extended.
2257 Otherwise, we might change the result.
2258 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2259 but calculated in (unsigned short) it would be (unsigned short)-1. */
2261 if (shorten
&& none_complex
)
2263 int unsigned0
, unsigned1
;
2264 tree arg0
= get_narrower (op0
, &unsigned0
);
2265 tree arg1
= get_narrower (op1
, &unsigned1
);
2266 /* UNS is 1 if the operation to be done is an unsigned one. */
2267 int uns
= TREE_UNSIGNED (result_type
);
2270 final_type
= result_type
;
2272 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2273 but it *requires* conversion to FINAL_TYPE. */
2275 if ((TYPE_PRECISION (TREE_TYPE (op0
))
2276 == TYPE_PRECISION (TREE_TYPE (arg0
)))
2277 && TREE_TYPE (op0
) != final_type
)
2278 unsigned0
= TREE_UNSIGNED (TREE_TYPE (op0
));
2279 if ((TYPE_PRECISION (TREE_TYPE (op1
))
2280 == TYPE_PRECISION (TREE_TYPE (arg1
)))
2281 && TREE_TYPE (op1
) != final_type
)
2282 unsigned1
= TREE_UNSIGNED (TREE_TYPE (op1
));
2284 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2286 /* For bitwise operations, signedness of nominal type
2287 does not matter. Consider only how operands were extended. */
2291 /* Note that in all three cases below we refrain from optimizing
2292 an unsigned operation on sign-extended args.
2293 That would not be valid. */
2295 /* Both args variable: if both extended in same way
2296 from same width, do it in that width.
2297 Do it unsigned if args were zero-extended. */
2298 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
2299 < TYPE_PRECISION (result_type
))
2300 && (TYPE_PRECISION (TREE_TYPE (arg1
))
2301 == TYPE_PRECISION (TREE_TYPE (arg0
)))
2302 && unsigned0
== unsigned1
2303 && (unsigned0
|| !uns
))
2305 = signed_or_unsigned_type (unsigned0
,
2306 common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
2307 else if (TREE_CODE (arg0
) == INTEGER_CST
2308 && (unsigned1
|| !uns
)
2309 && (TYPE_PRECISION (TREE_TYPE (arg1
))
2310 < TYPE_PRECISION (result_type
))
2311 && (type
= signed_or_unsigned_type (unsigned1
,
2313 int_fits_type_p (arg0
, type
)))
2315 else if (TREE_CODE (arg1
) == INTEGER_CST
2316 && (unsigned0
|| !uns
)
2317 && (TYPE_PRECISION (TREE_TYPE (arg0
))
2318 < TYPE_PRECISION (result_type
))
2319 && (type
= signed_or_unsigned_type (unsigned0
,
2321 int_fits_type_p (arg1
, type
)))
2325 /* Shifts can be shortened if shifting right. */
2330 tree arg0
= get_narrower (op0
, &unsigned_arg
);
2332 final_type
= result_type
;
2334 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
2335 unsigned_arg
= TREE_UNSIGNED (TREE_TYPE (op0
));
2337 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
2338 /* We can shorten only if the shift count is less than the
2339 number of bits in the smaller type size. */
2340 && TREE_INT_CST_HIGH (op1
) == 0
2341 && TYPE_PRECISION (TREE_TYPE (arg0
)) > TREE_INT_CST_LOW (op1
)
2342 /* If arg is sign-extended and then unsigned-shifted,
2343 we can simulate this with a signed shift in arg's type
2344 only if the extended result is at least twice as wide
2345 as the arg. Otherwise, the shift could use up all the
2346 ones made by sign-extension and bring in zeros.
2347 We can't optimize that case at all, but in most machines
2348 it never happens because available widths are 2**N. */
2349 && (!TREE_UNSIGNED (final_type
)
2351 || 2 * TYPE_PRECISION (TREE_TYPE (arg0
)) <= TYPE_PRECISION (result_type
)))
2353 /* Do an unsigned shift if the operand was zero-extended. */
2355 = signed_or_unsigned_type (unsigned_arg
,
2357 /* Convert value-to-be-shifted to that type. */
2358 if (TREE_TYPE (op0
) != result_type
)
2359 op0
= convert (result_type
, op0
);
2364 /* Comparison operations are shortened too but differently.
2365 They identify themselves by setting short_compare = 1. */
2369 /* Don't write &op0, etc., because that would prevent op0
2370 from being kept in a register.
2371 Instead, make copies of the our local variables and
2372 pass the copies by reference, then copy them back afterward. */
2373 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
2374 enum tree_code xresultcode
= resultcode
;
2376 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
2379 op0
= xop0
, op1
= xop1
;
2381 resultcode
= xresultcode
;
2383 if ((warn_sign_compare
< 0 ? extra_warnings
: warn_sign_compare
!= 0)
2384 && skip_evaluation
== 0)
2386 int op0_signed
= ! TREE_UNSIGNED (TREE_TYPE (orig_op0
));
2387 int op1_signed
= ! TREE_UNSIGNED (TREE_TYPE (orig_op1
));
2389 int unsignedp0
, unsignedp1
;
2390 tree primop0
= get_narrower (op0
, &unsignedp0
);
2391 tree primop1
= get_narrower (op1
, &unsignedp1
);
2393 /* Avoid spurious warnings for comparison with enumerators. */
2397 STRIP_TYPE_NOPS (xop0
);
2398 STRIP_TYPE_NOPS (xop1
);
2400 /* Give warnings for comparisons between signed and unsigned
2401 quantities that may fail. */
2402 /* Do the checking based on the original operand trees, so that
2403 casts will be considered, but default promotions won't be. */
2405 /* Do not warn if the comparison is being done in a signed type,
2406 since the signed type will only be chosen if it can represent
2407 all the values of the unsigned type. */
2408 if (! TREE_UNSIGNED (result_type
))
2410 /* Do not warn if both operands are unsigned. */
2411 else if (op0_signed
== op1_signed
)
2413 /* Do not warn if the signed quantity is an unsuffixed
2414 integer literal (or some static constant expression
2415 involving such literals) and it is non-negative. */
2416 else if ((op0_signed
&& TREE_CODE (xop0
) == INTEGER_CST
2417 && tree_int_cst_sgn (xop0
) >= 0)
2418 || (op1_signed
&& TREE_CODE (xop1
) == INTEGER_CST
2419 && tree_int_cst_sgn (xop1
) >= 0))
2421 /* Do not warn if the comparison is an equality operation,
2422 the unsigned quantity is an integral constant and it does
2423 not use the most significant bit of result_type. */
2424 else if ((resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
2425 && ((op0_signed
&& TREE_CODE (xop1
) == INTEGER_CST
2426 && int_fits_type_p (xop1
, signed_type (result_type
)))
2427 || (op1_signed
&& TREE_CODE (xop0
) == INTEGER_CST
2428 && int_fits_type_p (xop0
, signed_type (result_type
)))))
2431 warning ("comparison between signed and unsigned");
2433 /* Warn if two unsigned values are being compared in a size
2434 larger than their original size, and one (and only one) is the
2435 result of a `~' operator. This comparison will always fail.
2437 Also warn if one operand is a constant, and the constant
2438 does not have all bits set that are set in the ~ operand
2439 when it is extended. */
2441 if ((TREE_CODE (primop0
) == BIT_NOT_EXPR
)
2442 != (TREE_CODE (primop1
) == BIT_NOT_EXPR
))
2444 if (TREE_CODE (primop0
) == BIT_NOT_EXPR
)
2445 primop0
= get_narrower (TREE_OPERAND (primop0
, 0),
2448 primop1
= get_narrower (TREE_OPERAND (primop1
, 0),
2451 if (TREE_CODE (primop0
) == INTEGER_CST
2452 || TREE_CODE (primop1
) == INTEGER_CST
)
2455 long constant
, mask
;
2456 int unsignedp
, bits
;
2458 if (TREE_CODE (primop0
) == INTEGER_CST
)
2461 unsignedp
= unsignedp1
;
2462 constant
= TREE_INT_CST_LOW (primop0
);
2467 unsignedp
= unsignedp0
;
2468 constant
= TREE_INT_CST_LOW (primop1
);
2471 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
2472 if (bits
< TYPE_PRECISION (result_type
)
2473 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
2475 mask
= (~0L) << bits
;
2476 if ((mask
& constant
) != mask
)
2477 warning ("comparison of promoted ~unsigned with constant");
2480 else if (unsignedp0
&& unsignedp1
2481 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2482 < TYPE_PRECISION (result_type
))
2483 && (TYPE_PRECISION (TREE_TYPE (primop1
))
2484 < TYPE_PRECISION (result_type
)))
2485 warning ("comparison of promoted ~unsigned with unsigned");
2491 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
2492 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
2493 Then the expression will be built.
2494 It will be given type FINAL_TYPE if that is nonzero;
2495 otherwise, it will be given type RESULT_TYPE. */
2499 binary_op_error (code
);
2500 return error_mark_node
;
2505 if (TREE_TYPE (op0
) != result_type
)
2506 op0
= convert (result_type
, op0
);
2507 if (TREE_TYPE (op1
) != result_type
)
2508 op1
= convert (result_type
, op1
);
2511 if (build_type
== NULL_TREE
)
2512 build_type
= result_type
;
2515 register tree result
= build (resultcode
, build_type
, op0
, op1
);
2516 register tree folded
;
2518 folded
= fold (result
);
2519 if (folded
== result
)
2520 TREE_CONSTANT (folded
) = TREE_CONSTANT (op0
) & TREE_CONSTANT (op1
);
2521 if (final_type
!= 0)
2522 return convert (final_type
, folded
);
2527 /* Return a tree for the sum or difference (RESULTCODE says which)
2528 of pointer PTROP and integer INTOP. */
2531 pointer_int_sum (resultcode
, ptrop
, intop
)
2532 enum tree_code resultcode
;
2533 register tree ptrop
, intop
;
2537 register tree result
;
2538 register tree folded
;
2540 /* The result is a pointer of the same type that is being added. */
2542 register tree result_type
= TREE_TYPE (ptrop
);
2544 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
2546 if (pedantic
|| warn_pointer_arith
)
2547 pedwarn ("pointer of type `void *' used in arithmetic");
2548 size_exp
= integer_one_node
;
2550 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
2552 if (pedantic
|| warn_pointer_arith
)
2553 pedwarn ("pointer to a function used in arithmetic");
2554 size_exp
= integer_one_node
;
2557 size_exp
= c_size_in_bytes (TREE_TYPE (result_type
));
2559 /* If what we are about to multiply by the size of the elements
2560 contains a constant term, apply distributive law
2561 and multiply that constant term separately.
2562 This helps produce common subexpressions. */
2564 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
2565 && ! TREE_CONSTANT (intop
)
2566 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
2567 && TREE_CONSTANT (size_exp
)
2568 /* If the constant comes from pointer subtraction,
2569 skip this optimization--it would cause an error. */
2570 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
2571 /* If the constant is unsigned, and smaller than the pointer size,
2572 then we must skip this optimization. This is because it could cause
2573 an overflow error if the constant is negative but INTOP is not. */
2574 && (! TREE_UNSIGNED (TREE_TYPE (intop
))
2575 || (TYPE_PRECISION (TREE_TYPE (intop
))
2576 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
2578 enum tree_code subcode
= resultcode
;
2579 tree int_type
= TREE_TYPE (intop
);
2580 if (TREE_CODE (intop
) == MINUS_EXPR
)
2581 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
2582 /* Convert both subexpression types to the type of intop,
2583 because weird cases involving pointer arithmetic
2584 can result in a sum or difference with different type args. */
2585 ptrop
= build_binary_op (subcode
, ptrop
,
2586 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
2587 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
2590 /* Convert the integer argument to a type the same size as sizetype
2591 so the multiply won't overflow spuriously. */
2593 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
2594 || TREE_UNSIGNED (TREE_TYPE (intop
)) != TREE_UNSIGNED (sizetype
))
2595 intop
= convert (type_for_size (TYPE_PRECISION (sizetype
),
2596 TREE_UNSIGNED (sizetype
)), intop
);
2598 /* Replace the integer argument with a suitable product by the object size.
2599 Do this multiplication as signed, then convert to the appropriate
2600 pointer type (actually unsigned integral). */
2602 intop
= convert (result_type
,
2603 build_binary_op (MULT_EXPR
, intop
,
2604 convert (TREE_TYPE (intop
), size_exp
), 1));
2606 /* Create the sum or difference. */
2608 result
= build (resultcode
, result_type
, ptrop
, intop
);
2610 folded
= fold (result
);
2611 if (folded
== result
)
2612 TREE_CONSTANT (folded
) = TREE_CONSTANT (ptrop
) & TREE_CONSTANT (intop
);
2616 /* Return a tree for the difference of pointers OP0 and OP1.
2617 The resulting tree has type int. */
2620 pointer_diff (op0
, op1
)
2621 register tree op0
, op1
;
2623 register tree result
, folded
;
2624 tree restype
= ptrdiff_type_node
;
2626 tree target_type
= TREE_TYPE (TREE_TYPE (op0
));
2628 if (pedantic
|| warn_pointer_arith
)
2630 if (TREE_CODE (target_type
) == VOID_TYPE
)
2631 pedwarn ("pointer of type `void *' used in subtraction");
2632 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
2633 pedwarn ("pointer to a function used in subtraction");
2636 /* First do the subtraction as integers;
2637 then drop through to build the divide operator.
2638 Do not do default conversions on the minus operator
2639 in case restype is a short type. */
2641 op0
= build_binary_op (MINUS_EXPR
, convert (restype
, op0
),
2642 convert (restype
, op1
), 0);
2643 /* This generates an error if op1 is pointer to incomplete type. */
2644 if (TYPE_SIZE (TREE_TYPE (TREE_TYPE (op1
))) == 0)
2645 error ("arithmetic on pointer to an incomplete type");
2647 /* This generates an error if op0 is pointer to incomplete type. */
2648 op1
= c_size_in_bytes (target_type
);
2650 /* Divide by the size, in easiest possible way. */
2652 result
= build (EXACT_DIV_EXPR
, restype
, op0
, convert (restype
, op1
));
2654 folded
= fold (result
);
2655 if (folded
== result
)
2656 TREE_CONSTANT (folded
) = TREE_CONSTANT (op0
) & TREE_CONSTANT (op1
);
2660 /* Construct and perhaps optimize a tree representation
2661 for a unary operation. CODE, a tree_code, specifies the operation
2662 and XARG is the operand. NOCONVERT nonzero suppresses
2663 the default promotions (such as from short to int). */
2666 build_unary_op (code
, xarg
, noconvert
)
2667 enum tree_code code
;
2671 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2672 register tree arg
= xarg
;
2673 register tree argtype
= 0;
2674 register enum tree_code typecode
= TREE_CODE (TREE_TYPE (arg
));
2677 if (typecode
== ERROR_MARK
)
2678 return error_mark_node
;
2679 if (typecode
== ENUMERAL_TYPE
)
2680 typecode
= INTEGER_TYPE
;
2685 /* This is used for unary plus, because a CONVERT_EXPR
2686 is enough to prevent anybody from looking inside for
2687 associativity, but won't generate any code. */
2688 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2689 || typecode
== COMPLEX_TYPE
))
2691 error ("wrong type argument to unary plus");
2692 return error_mark_node
;
2694 else if (!noconvert
)
2695 arg
= default_conversion (arg
);
2699 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2700 || typecode
== COMPLEX_TYPE
))
2702 error ("wrong type argument to unary minus");
2703 return error_mark_node
;
2705 else if (!noconvert
)
2706 arg
= default_conversion (arg
);
2710 if (typecode
== COMPLEX_TYPE
)
2714 arg
= default_conversion (arg
);
2716 else if (typecode
!= INTEGER_TYPE
)
2718 error ("wrong type argument to bit-complement");
2719 return error_mark_node
;
2721 else if (!noconvert
)
2722 arg
= default_conversion (arg
);
2726 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2727 || typecode
== COMPLEX_TYPE
))
2729 error ("wrong type argument to abs");
2730 return error_mark_node
;
2732 else if (!noconvert
)
2733 arg
= default_conversion (arg
);
2737 /* Conjugating a real value is a no-op, but allow it anyway. */
2738 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2739 || typecode
== COMPLEX_TYPE
))
2741 error ("wrong type argument to conjugation");
2742 return error_mark_node
;
2744 else if (!noconvert
)
2745 arg
= default_conversion (arg
);
2748 case TRUTH_NOT_EXPR
:
2749 if (typecode
!= INTEGER_TYPE
2750 && typecode
!= REAL_TYPE
&& typecode
!= POINTER_TYPE
2751 && typecode
!= COMPLEX_TYPE
2752 /* These will convert to a pointer. */
2753 && typecode
!= ARRAY_TYPE
&& typecode
!= FUNCTION_TYPE
)
2755 error ("wrong type argument to unary exclamation mark");
2756 return error_mark_node
;
2758 arg
= truthvalue_conversion (arg
);
2759 return invert_truthvalue (arg
);
2765 if (TREE_CODE (arg
) == COMPLEX_CST
)
2766 return TREE_REALPART (arg
);
2767 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
2768 return fold (build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
2773 if (TREE_CODE (arg
) == COMPLEX_CST
)
2774 return TREE_IMAGPART (arg
);
2775 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
2776 return fold (build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
2778 return convert (TREE_TYPE (arg
), integer_zero_node
);
2780 case PREINCREMENT_EXPR
:
2781 case POSTINCREMENT_EXPR
:
2782 case PREDECREMENT_EXPR
:
2783 case POSTDECREMENT_EXPR
:
2784 /* Handle complex lvalues (when permitted)
2785 by reduction to simpler cases. */
2787 val
= unary_complex_lvalue (code
, arg
);
2791 /* Increment or decrement the real part of the value,
2792 and don't change the imaginary part. */
2793 if (typecode
== COMPLEX_TYPE
)
2797 arg
= stabilize_reference (arg
);
2798 real
= build_unary_op (REALPART_EXPR
, arg
, 1);
2799 imag
= build_unary_op (IMAGPART_EXPR
, arg
, 1);
2800 return build (COMPLEX_EXPR
, TREE_TYPE (arg
),
2801 build_unary_op (code
, real
, 1), imag
);
2804 /* Report invalid types. */
2806 if (typecode
!= POINTER_TYPE
2807 && typecode
!= INTEGER_TYPE
&& typecode
!= REAL_TYPE
)
2809 error (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
2810 ? "wrong type argument to increment"
2811 : "wrong type argument to decrement");
2812 return error_mark_node
;
2817 tree result_type
= TREE_TYPE (arg
);
2819 arg
= get_unwidened (arg
, 0);
2820 argtype
= TREE_TYPE (arg
);
2822 /* Compute the increment. */
2824 if (typecode
== POINTER_TYPE
)
2826 /* If pointer target is an undefined struct,
2827 we just cannot know how to do the arithmetic. */
2828 if (TYPE_SIZE (TREE_TYPE (result_type
)) == 0)
2829 error (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
2830 ? "increment of pointer to unknown structure"
2831 : "decrement of pointer to unknown structure");
2832 else if ((pedantic
|| warn_pointer_arith
)
2833 && (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
2834 || TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
))
2835 pedwarn (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
2836 ? "wrong type argument to increment"
2837 : "wrong type argument to decrement");
2838 inc
= c_size_in_bytes (TREE_TYPE (result_type
));
2841 inc
= integer_one_node
;
2843 inc
= convert (argtype
, inc
);
2845 /* Handle incrementing a cast-expression. */
2848 switch (TREE_CODE (arg
))
2853 case FIX_TRUNC_EXPR
:
2854 case FIX_FLOOR_EXPR
:
2855 case FIX_ROUND_EXPR
:
2857 pedantic_lvalue_warning (CONVERT_EXPR
);
2858 /* If the real type has the same machine representation
2859 as the type it is cast to, we can make better output
2860 by adding directly to the inside of the cast. */
2861 if ((TREE_CODE (TREE_TYPE (arg
))
2862 == TREE_CODE (TREE_TYPE (TREE_OPERAND (arg
, 0))))
2863 && (TYPE_MODE (TREE_TYPE (arg
))
2864 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (arg
, 0)))))
2865 arg
= TREE_OPERAND (arg
, 0);
2868 tree incremented
, modify
, value
;
2869 arg
= stabilize_reference (arg
);
2870 if (code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
2873 value
= save_expr (arg
);
2874 incremented
= build (((code
== PREINCREMENT_EXPR
2875 || code
== POSTINCREMENT_EXPR
)
2876 ? PLUS_EXPR
: MINUS_EXPR
),
2877 argtype
, value
, inc
);
2878 TREE_SIDE_EFFECTS (incremented
) = 1;
2879 modify
= build_modify_expr (arg
, NOP_EXPR
, incremented
);
2880 value
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), modify
, value
);
2881 TREE_USED (value
) = 1;
2891 /* Complain about anything else that is not a true lvalue. */
2892 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
2893 || code
== POSTINCREMENT_EXPR
)
2894 ? "invalid lvalue in increment"
2895 : "invalid lvalue in decrement")))
2896 return error_mark_node
;
2898 /* Report a read-only lvalue. */
2899 if (TREE_READONLY (arg
))
2900 readonly_warning (arg
,
2901 ((code
== PREINCREMENT_EXPR
2902 || code
== POSTINCREMENT_EXPR
)
2903 ? "increment" : "decrement"));
2905 val
= build (code
, TREE_TYPE (arg
), arg
, inc
);
2906 TREE_SIDE_EFFECTS (val
) = 1;
2907 val
= convert (result_type
, val
);
2908 if (TREE_CODE (val
) != code
)
2909 TREE_NO_UNUSED_WARNING (val
) = 1;
2914 /* Note that this operation never does default_conversion
2915 regardless of NOCONVERT. */
2917 /* Let &* cancel out to simplify resulting code. */
2918 if (TREE_CODE (arg
) == INDIRECT_REF
)
2920 /* Don't let this be an lvalue. */
2921 if (lvalue_p (TREE_OPERAND (arg
, 0)))
2922 return non_lvalue (TREE_OPERAND (arg
, 0));
2923 return TREE_OPERAND (arg
, 0);
2926 /* For &x[y], return x+y */
2927 if (TREE_CODE (arg
) == ARRAY_REF
)
2929 if (mark_addressable (TREE_OPERAND (arg
, 0)) == 0)
2930 return error_mark_node
;
2931 return build_binary_op (PLUS_EXPR
, TREE_OPERAND (arg
, 0),
2932 TREE_OPERAND (arg
, 1), 1);
2935 /* Handle complex lvalues (when permitted)
2936 by reduction to simpler cases. */
2937 val
= unary_complex_lvalue (code
, arg
);
2941 #if 0 /* Turned off because inconsistent;
2942 float f; *&(int)f = 3.4 stores in int format
2943 whereas (int)f = 3.4 stores in float format. */
2944 /* Address of a cast is just a cast of the address
2945 of the operand of the cast. */
2946 switch (TREE_CODE (arg
))
2951 case FIX_TRUNC_EXPR
:
2952 case FIX_FLOOR_EXPR
:
2953 case FIX_ROUND_EXPR
:
2956 pedwarn ("ANSI C forbids the address of a cast expression");
2957 return convert (build_pointer_type (TREE_TYPE (arg
)),
2958 build_unary_op (ADDR_EXPR
, TREE_OPERAND (arg
, 0),
2963 /* Allow the address of a constructor if all the elements
2965 if (TREE_CODE (arg
) == CONSTRUCTOR
&& TREE_CONSTANT (arg
))
2967 /* Anything not already handled and not a true memory reference
2969 else if (typecode
!= FUNCTION_TYPE
2970 && !lvalue_or_else (arg
, "invalid lvalue in unary `&'"))
2971 return error_mark_node
;
2973 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
2974 argtype
= TREE_TYPE (arg
);
2975 /* If the lvalue is const or volatile, merge that into the type
2976 to which the address will point. Note that you can't get a
2977 restricted pointer by taking the address of something, so we
2978 only have to deal with `const' and `volatile' here. */
2979 if (TREE_CODE_CLASS (TREE_CODE (arg
)) == 'd'
2980 || TREE_CODE_CLASS (TREE_CODE (arg
)) == 'r')
2982 if (TREE_READONLY (arg
) || TREE_THIS_VOLATILE (arg
))
2983 argtype
= c_build_type_variant (argtype
,
2984 TREE_READONLY (arg
),
2985 TREE_THIS_VOLATILE (arg
));
2988 argtype
= build_pointer_type (argtype
);
2990 if (mark_addressable (arg
) == 0)
2991 return error_mark_node
;
2996 if (TREE_CODE (arg
) == COMPONENT_REF
)
2998 tree field
= TREE_OPERAND (arg
, 1);
3000 addr
= build_unary_op (ADDR_EXPR
, TREE_OPERAND (arg
, 0), 0);
3002 if (DECL_C_BIT_FIELD (field
))
3004 error ("attempt to take address of bit-field structure member `%s'",
3005 IDENTIFIER_POINTER (DECL_NAME (field
)));
3006 return error_mark_node
;
3009 addr
= convert (argtype
, addr
);
3011 if (! integer_zerop (DECL_FIELD_BITPOS (field
)))
3014 = size_binop (EASY_DIV_EXPR
, DECL_FIELD_BITPOS (field
),
3015 size_int (BITS_PER_UNIT
));
3016 int flag
= TREE_CONSTANT (addr
);
3017 addr
= fold (build (PLUS_EXPR
, argtype
,
3018 addr
, convert (argtype
, offset
)));
3019 TREE_CONSTANT (addr
) = flag
;
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
);
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
;
3175 pedwarn (code
== COND_EXPR
3176 ? "ANSI C forbids use of conditional expressions as lvalues"
3177 : code
== COMPOUND_EXPR
3178 ? "ANSI C forbids use of compound expressions as lvalues"
3179 : "ANSI C forbids use of cast expressions as lvalues");
3182 /* Warn about storing in something that is `const'. */
3185 readonly_warning (arg
, msgid
)
3189 /* Forbid assignments to iterators. */
3190 if (TREE_CODE (arg
) == VAR_DECL
&& ITERATOR_P (arg
))
3191 pedwarn ("%s of iterator `%s'", _(msgid
),
3192 IDENTIFIER_POINTER (DECL_NAME (arg
)));
3194 if (TREE_CODE (arg
) == COMPONENT_REF
)
3196 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg
, 0))))
3197 readonly_warning (TREE_OPERAND (arg
, 0), msgid
);
3199 pedwarn ("%s of read-only member `%s'", _(msgid
),
3200 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (arg
, 1))));
3202 else if (TREE_CODE (arg
) == VAR_DECL
)
3203 pedwarn ("%s of read-only variable `%s'", _(msgid
),
3204 IDENTIFIER_POINTER (DECL_NAME (arg
)));
3206 pedwarn ("%s of read-only location", _(msgid
));
3209 /* Mark EXP saying that we need to be able to take the
3210 address of it; it should not be allocated in a register.
3211 Value is 1 if successful. */
3214 mark_addressable (exp
)
3217 register tree x
= exp
;
3219 switch (TREE_CODE (x
))
3222 if (DECL_C_BIT_FIELD (TREE_OPERAND (x
, 1)))
3224 error ("cannot take address of bitfield `%s'",
3225 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (x
, 1))));
3229 /* ... fall through ... */
3235 x
= TREE_OPERAND (x
, 0);
3239 TREE_ADDRESSABLE (x
) = 1;
3246 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
3247 && DECL_NONLOCAL (x
))
3249 if (TREE_PUBLIC (x
))
3251 error ("global register variable `%s' used in nested function",
3252 IDENTIFIER_POINTER (DECL_NAME (x
)));
3255 pedwarn ("register variable `%s' used in nested function",
3256 IDENTIFIER_POINTER (DECL_NAME (x
)));
3258 else if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
))
3260 if (TREE_PUBLIC (x
))
3262 error ("address of global register variable `%s' requested",
3263 IDENTIFIER_POINTER (DECL_NAME (x
)));
3267 /* If we are making this addressable due to its having
3268 volatile components, give a different error message. Also
3269 handle the case of an unnamed parameter by not trying
3270 to give the name. */
3272 else if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (x
)))
3274 error ("cannot put object with volatile field into register");
3278 pedwarn ("address of register variable `%s' requested",
3279 IDENTIFIER_POINTER (DECL_NAME (x
)));
3281 put_var_into_stack (x
);
3285 TREE_ADDRESSABLE (x
) = 1;
3286 #if 0 /* poplevel deals with this now. */
3287 if (DECL_CONTEXT (x
) == 0)
3288 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x
)) = 1;
3296 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3299 build_conditional_expr (ifexp
, op1
, op2
)
3300 tree ifexp
, op1
, op2
;
3302 register tree type1
;
3303 register tree type2
;
3304 register enum tree_code code1
;
3305 register enum tree_code code2
;
3306 register tree result_type
= NULL
;
3307 tree orig_op1
= op1
, orig_op2
= op2
;
3309 ifexp
= truthvalue_conversion (default_conversion (ifexp
));
3311 #if 0 /* Produces wrong result if within sizeof. */
3312 /* Don't promote the operands separately if they promote
3313 the same way. Return the unpromoted type and let the combined
3314 value get promoted if necessary. */
3316 if (TREE_TYPE (op1
) == TREE_TYPE (op2
)
3317 && TREE_CODE (TREE_TYPE (op1
)) != ARRAY_TYPE
3318 && TREE_CODE (TREE_TYPE (op1
)) != ENUMERAL_TYPE
3319 && TREE_CODE (TREE_TYPE (op1
)) != FUNCTION_TYPE
)
3321 if (TREE_CODE (ifexp
) == INTEGER_CST
)
3322 return pedantic_non_lvalue (integer_zerop (ifexp
) ? op2
: op1
);
3324 return fold (build (COND_EXPR
, TREE_TYPE (op1
), ifexp
, op1
, op2
));
3328 /* Promote both alternatives. */
3330 if (TREE_CODE (TREE_TYPE (op1
)) != VOID_TYPE
)
3331 op1
= default_conversion (op1
);
3332 if (TREE_CODE (TREE_TYPE (op2
)) != VOID_TYPE
)
3333 op2
= default_conversion (op2
);
3335 if (TREE_CODE (ifexp
) == ERROR_MARK
3336 || TREE_CODE (TREE_TYPE (op1
)) == ERROR_MARK
3337 || TREE_CODE (TREE_TYPE (op2
)) == ERROR_MARK
)
3338 return error_mark_node
;
3340 type1
= TREE_TYPE (op1
);
3341 code1
= TREE_CODE (type1
);
3342 type2
= TREE_TYPE (op2
);
3343 code2
= TREE_CODE (type2
);
3345 /* Quickly detect the usual case where op1 and op2 have the same type
3347 if (TYPE_MAIN_VARIANT (type1
) == TYPE_MAIN_VARIANT (type2
))
3350 result_type
= type1
;
3352 result_type
= TYPE_MAIN_VARIANT (type1
);
3354 else if ((code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
)
3355 && (code2
== INTEGER_TYPE
|| code2
== REAL_TYPE
))
3357 result_type
= common_type (type1
, type2
);
3359 else if (code1
== VOID_TYPE
|| code2
== VOID_TYPE
)
3361 if (pedantic
&& (code1
!= VOID_TYPE
|| code2
!= VOID_TYPE
))
3362 pedwarn ("ANSI C forbids conditional expr with only one void side");
3363 result_type
= void_type_node
;
3365 else if (code1
== POINTER_TYPE
&& code2
== POINTER_TYPE
)
3367 if (comp_target_types (type1
, type2
))
3368 result_type
= common_type (type1
, type2
);
3369 else if (integer_zerop (op1
) && TREE_TYPE (type1
) == void_type_node
3370 && TREE_CODE (orig_op1
) != NOP_EXPR
)
3371 result_type
= qualify_type (type2
, type1
);
3372 else if (integer_zerop (op2
) && TREE_TYPE (type2
) == void_type_node
3373 && TREE_CODE (orig_op2
) != NOP_EXPR
)
3374 result_type
= qualify_type (type1
, type2
);
3375 else if (TYPE_MAIN_VARIANT (TREE_TYPE (type1
)) == void_type_node
)
3377 if (pedantic
&& TREE_CODE (TREE_TYPE (type2
)) == FUNCTION_TYPE
)
3378 pedwarn ("ANSI C forbids conditional expr between `void *' and function pointer");
3379 result_type
= qualify_type (type1
, type2
);
3381 else if (TYPE_MAIN_VARIANT (TREE_TYPE (type2
)) == void_type_node
)
3383 if (pedantic
&& TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
)
3384 pedwarn ("ANSI C forbids conditional expr between `void *' and function pointer");
3385 result_type
= qualify_type (type2
, type1
);
3389 pedwarn ("pointer type mismatch in conditional expression");
3390 result_type
= build_pointer_type (void_type_node
);
3393 else if (code1
== POINTER_TYPE
&& code2
== INTEGER_TYPE
)
3395 if (! integer_zerop (op2
))
3396 pedwarn ("pointer/integer type mismatch in conditional expression");
3399 op2
= null_pointer_node
;
3400 #if 0 /* The spec seems to say this is permitted. */
3401 if (pedantic
&& TREE_CODE (type1
) == FUNCTION_TYPE
)
3402 pedwarn ("ANSI C forbids conditional expr between 0 and function pointer");
3405 result_type
= type1
;
3407 else if (code2
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3409 if (!integer_zerop (op1
))
3410 pedwarn ("pointer/integer type mismatch in conditional expression");
3413 op1
= null_pointer_node
;
3414 #if 0 /* The spec seems to say this is permitted. */
3415 if (pedantic
&& TREE_CODE (type2
) == FUNCTION_TYPE
)
3416 pedwarn ("ANSI C forbids conditional expr between 0 and function pointer");
3419 result_type
= type2
;
3424 if (flag_cond_mismatch
)
3425 result_type
= void_type_node
;
3428 error ("type mismatch in conditional expression");
3429 return error_mark_node
;
3433 /* Merge const and volatile flags of the incoming types. */
3435 = build_type_variant (result_type
,
3436 TREE_READONLY (op1
) || TREE_READONLY (op2
),
3437 TREE_THIS_VOLATILE (op1
) || TREE_THIS_VOLATILE (op2
));
3439 if (result_type
!= TREE_TYPE (op1
))
3440 op1
= convert_and_check (result_type
, op1
);
3441 if (result_type
!= TREE_TYPE (op2
))
3442 op2
= convert_and_check (result_type
, op2
);
3445 if (code1
== RECORD_TYPE
|| code1
== UNION_TYPE
)
3447 result_type
= TREE_TYPE (op1
);
3448 if (TREE_CONSTANT (ifexp
))
3449 return pedantic_non_lvalue (integer_zerop (ifexp
) ? op2
: op1
);
3451 if (TYPE_MODE (result_type
) == BLKmode
)
3453 register tree tempvar
3454 = build_decl (VAR_DECL
, NULL_TREE
, result_type
);
3455 register tree xop1
= build_modify_expr (tempvar
, op1
);
3456 register tree xop2
= build_modify_expr (tempvar
, op2
);
3457 register tree result
= fold (build (COND_EXPR
, result_type
,
3458 ifexp
, xop1
, xop2
));
3460 layout_decl (tempvar
, TYPE_ALIGN (result_type
));
3461 /* No way to handle variable-sized objects here.
3462 I fear that the entire handling of BLKmode conditional exprs
3463 needs to be redone. */
3464 if (TREE_CODE (DECL_SIZE (tempvar
)) != INTEGER_CST
)
3467 = assign_stack_local (DECL_MODE (tempvar
),
3468 (TREE_INT_CST_LOW (DECL_SIZE (tempvar
))
3469 + BITS_PER_UNIT
- 1)
3473 TREE_SIDE_EFFECTS (result
)
3474 = TREE_SIDE_EFFECTS (ifexp
) | TREE_SIDE_EFFECTS (op1
)
3475 | TREE_SIDE_EFFECTS (op2
);
3476 return build (COMPOUND_EXPR
, result_type
, result
, tempvar
);
3481 if (TREE_CODE (ifexp
) == INTEGER_CST
)
3482 return pedantic_non_lvalue (integer_zerop (ifexp
) ? op2
: op1
);
3484 return fold (build (COND_EXPR
, result_type
, ifexp
, op1
, op2
));
3487 /* Given a list of expressions, return a compound expression
3488 that performs them all and returns the value of the last of them. */
3491 build_compound_expr (list
)
3494 return internal_build_compound_expr (list
, TRUE
);
3498 internal_build_compound_expr (list
, first_p
)
3504 if (TREE_CHAIN (list
) == 0)
3506 #if 0 /* If something inside inhibited lvalueness, we should not override. */
3507 /* Consider (x, y+0), which is not an lvalue since y+0 is not. */
3509 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3510 if (TREE_CODE (list
) == NON_LVALUE_EXPR
)
3511 list
= TREE_OPERAND (list
, 0);
3514 /* Don't let (0, 0) be null pointer constant. */
3515 if (!first_p
&& integer_zerop (TREE_VALUE (list
)))
3516 return non_lvalue (TREE_VALUE (list
));
3517 return TREE_VALUE (list
);
3520 if (TREE_CHAIN (list
) != 0 && TREE_CHAIN (TREE_CHAIN (list
)) == 0)
3522 /* Convert arrays to pointers when there really is a comma operator. */
3523 if (TREE_CODE (TREE_TYPE (TREE_VALUE (TREE_CHAIN (list
)))) == ARRAY_TYPE
)
3524 TREE_VALUE (TREE_CHAIN (list
))
3525 = default_conversion (TREE_VALUE (TREE_CHAIN (list
)));
3528 rest
= internal_build_compound_expr (TREE_CHAIN (list
), FALSE
);
3530 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list
)))
3532 /* The left-hand operand of a comma expression is like an expression
3533 statement: with -W or -Wunused, we should warn if it doesn't have
3534 any side-effects, unless it was explicitly cast to (void). */
3535 if ((extra_warnings
|| warn_unused
)
3536 && ! (TREE_CODE (TREE_VALUE (list
)) == CONVERT_EXPR
3537 && TREE_TYPE (TREE_VALUE (list
)) == void_type_node
))
3538 warning ("left-hand operand of comma expression has no effect");
3540 /* When pedantic, a compound expression can be neither an lvalue
3541 nor an integer constant expression. */
3546 /* With -Wunused, we should also warn if the left-hand operand does have
3547 side-effects, but computes a value which is not used. For example, in
3548 `foo() + bar(), baz()' the result of the `+' operator is not used,
3549 so we should issue a warning. */
3550 else if (warn_unused
)
3551 warn_if_unused_value (TREE_VALUE (list
));
3553 return build (COMPOUND_EXPR
, TREE_TYPE (rest
), TREE_VALUE (list
), rest
);
3556 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3559 build_c_cast (type
, expr
)
3563 register tree value
= expr
;
3565 if (type
== error_mark_node
|| expr
== error_mark_node
)
3566 return error_mark_node
;
3567 type
= TYPE_MAIN_VARIANT (type
);
3570 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3571 if (TREE_CODE (value
) == NON_LVALUE_EXPR
)
3572 value
= TREE_OPERAND (value
, 0);
3575 if (TREE_CODE (type
) == ARRAY_TYPE
)
3577 error ("cast specifies array type");
3578 return error_mark_node
;
3581 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3583 error ("cast specifies function type");
3584 return error_mark_node
;
3587 if (type
== TREE_TYPE (value
))
3591 if (TREE_CODE (type
) == RECORD_TYPE
3592 || TREE_CODE (type
) == UNION_TYPE
)
3593 pedwarn ("ANSI C forbids casting nonscalar to the same type");
3596 else if (TREE_CODE (type
) == UNION_TYPE
)
3599 if (TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
3600 || TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
)
3601 value
= default_conversion (value
);
3603 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
3604 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field
)),
3605 TYPE_MAIN_VARIANT (TREE_TYPE (value
))))
3614 pedwarn ("ANSI C forbids casts to union type");
3615 if (TYPE_NAME (type
) != 0)
3617 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
3618 name
= IDENTIFIER_POINTER (TYPE_NAME (type
));
3620 name
= IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
)));
3624 t
= digest_init (type
, build (CONSTRUCTOR
, type
, NULL_TREE
,
3625 build_tree_list (field
, value
)),
3627 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
3630 error ("cast to union type from type not present in union");
3631 return error_mark_node
;
3637 /* If casting to void, avoid the error that would come
3638 from default_conversion in the case of a non-lvalue array. */
3639 if (type
== void_type_node
)
3640 return build1 (CONVERT_EXPR
, type
, value
);
3642 /* Convert functions and arrays to pointers,
3643 but don't convert any other types. */
3644 if (TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
3645 || TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
)
3646 value
= default_conversion (value
);
3647 otype
= TREE_TYPE (value
);
3649 /* Optionally warn about potentially worrisome casts. */
3652 && TREE_CODE (type
) == POINTER_TYPE
3653 && TREE_CODE (otype
) == POINTER_TYPE
)
3655 /* Go to the innermost object being pointed to. */
3656 tree in_type
= type
;
3657 tree in_otype
= otype
;
3659 while (TREE_CODE (in_type
) == POINTER_TYPE
)
3660 in_type
= TREE_TYPE (in_type
);
3661 while (TREE_CODE (in_otype
) == POINTER_TYPE
)
3662 in_otype
= TREE_TYPE (in_otype
);
3664 if (TYPE_QUALS (in_otype
) & ~TYPE_QUALS (in_type
))
3665 /* There are qualifiers present in IN_OTYPE that are not
3666 present in IN_TYPE. */
3667 pedwarn ("cast discards qualifiers from pointer target type");
3670 /* Warn about possible alignment problems. */
3671 if (STRICT_ALIGNMENT
&& warn_cast_align
3672 && TREE_CODE (type
) == POINTER_TYPE
3673 && TREE_CODE (otype
) == POINTER_TYPE
3674 && TREE_CODE (TREE_TYPE (otype
)) != VOID_TYPE
3675 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
3676 /* Don't warn about opaque types, where the actual alignment
3677 restriction is unknown. */
3678 && !((TREE_CODE (TREE_TYPE (otype
)) == UNION_TYPE
3679 || TREE_CODE (TREE_TYPE (otype
)) == RECORD_TYPE
)
3680 && TYPE_MODE (TREE_TYPE (otype
)) == VOIDmode
)
3681 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (otype
)))
3682 warning ("cast increases required alignment of target type");
3684 if (TREE_CODE (type
) == INTEGER_TYPE
3685 && TREE_CODE (otype
) == POINTER_TYPE
3686 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
3687 && !TREE_CONSTANT (value
))
3688 warning ("cast from pointer to integer of different size");
3690 if (warn_bad_function_cast
3691 && TREE_CODE (value
) == CALL_EXPR
3692 && TREE_CODE (type
) != TREE_CODE (otype
))
3693 warning ("cast does not match function type");
3695 if (TREE_CODE (type
) == POINTER_TYPE
3696 && TREE_CODE (otype
) == INTEGER_TYPE
3697 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
3699 /* Don't warn about converting 0 to pointer,
3700 provided the 0 was explicit--not cast or made by folding. */
3701 && !(TREE_CODE (value
) == INTEGER_CST
&& integer_zerop (value
))
3703 /* Don't warn about converting any constant. */
3704 && !TREE_CONSTANT (value
))
3705 warning ("cast to pointer from integer of different size");
3708 value
= convert (type
, value
);
3710 /* Ignore any integer overflow caused by the cast. */
3711 if (TREE_CODE (value
) == INTEGER_CST
)
3713 TREE_OVERFLOW (value
) = TREE_OVERFLOW (ovalue
);
3714 TREE_CONSTANT_OVERFLOW (value
) = TREE_CONSTANT_OVERFLOW (ovalue
);
3718 /* Pedantically, don't ley (void *) (FOO *) 0 be a null pointer constant. */
3719 if (pedantic
&& TREE_CODE (value
) == INTEGER_CST
3720 && TREE_CODE (expr
) == INTEGER_CST
3721 && TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
)
3722 value
= non_lvalue (value
);
3724 /* If pedantic, don't let a cast be an lvalue. */
3725 if (value
== expr
&& pedantic
)
3726 value
= non_lvalue (value
);
3731 /* Build an assignment expression of lvalue LHS from value RHS.
3732 MODIFYCODE is the code for a binary operator that we use
3733 to combine the old value of LHS with RHS to get the new value.
3734 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3737 build_modify_expr (lhs
, modifycode
, rhs
)
3739 enum tree_code modifycode
;
3741 register tree result
;
3743 tree lhstype
= TREE_TYPE (lhs
);
3744 tree olhstype
= lhstype
;
3746 /* Types that aren't fully specified cannot be used in assignments. */
3747 lhs
= require_complete_type (lhs
);
3749 /* Avoid duplicate error messages from operands that had errors. */
3750 if (TREE_CODE (lhs
) == ERROR_MARK
|| TREE_CODE (rhs
) == ERROR_MARK
)
3751 return error_mark_node
;
3753 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3754 /* Do not use STRIP_NOPS here. We do not want an enumerator
3755 whose value is 0 to count as a null pointer constant. */
3756 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
3757 rhs
= TREE_OPERAND (rhs
, 0);
3761 /* Handle control structure constructs used as "lvalues". */
3763 switch (TREE_CODE (lhs
))
3765 /* Handle (a, b) used as an "lvalue". */
3767 pedantic_lvalue_warning (COMPOUND_EXPR
);
3768 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 1), modifycode
, rhs
);
3769 if (TREE_CODE (newrhs
) == ERROR_MARK
)
3770 return error_mark_node
;
3771 return build (COMPOUND_EXPR
, lhstype
,
3772 TREE_OPERAND (lhs
, 0), newrhs
);
3774 /* Handle (a ? b : c) used as an "lvalue". */
3776 pedantic_lvalue_warning (COND_EXPR
);
3777 rhs
= save_expr (rhs
);
3779 /* Produce (a ? (b = rhs) : (c = rhs))
3780 except that the RHS goes through a save-expr
3781 so the code to compute it is only emitted once. */
3783 = build_conditional_expr (TREE_OPERAND (lhs
, 0),
3784 build_modify_expr (TREE_OPERAND (lhs
, 1),
3786 build_modify_expr (TREE_OPERAND (lhs
, 2),
3788 if (TREE_CODE (cond
) == ERROR_MARK
)
3790 /* Make sure the code to compute the rhs comes out
3791 before the split. */
3792 return build (COMPOUND_EXPR
, TREE_TYPE (lhs
),
3793 /* But cast it to void to avoid an "unused" error. */
3794 convert (void_type_node
, rhs
), cond
);
3800 /* If a binary op has been requested, combine the old LHS value with the RHS
3801 producing the value we should actually store into the LHS. */
3803 if (modifycode
!= NOP_EXPR
)
3805 lhs
= stabilize_reference (lhs
);
3806 newrhs
= build_binary_op (modifycode
, lhs
, rhs
, 1);
3809 /* Handle a cast used as an "lvalue".
3810 We have already performed any binary operator using the value as cast.
3811 Now convert the result to the cast type of the lhs,
3812 and then true type of the lhs and store it there;
3813 then convert result back to the cast type to be the value
3814 of the assignment. */
3816 switch (TREE_CODE (lhs
))
3821 case FIX_TRUNC_EXPR
:
3822 case FIX_FLOOR_EXPR
:
3823 case FIX_ROUND_EXPR
:
3825 if (TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
3826 || TREE_CODE (TREE_TYPE (newrhs
)) == FUNCTION_TYPE
)
3827 newrhs
= default_conversion (newrhs
);
3829 tree inner_lhs
= TREE_OPERAND (lhs
, 0);
3831 result
= build_modify_expr (inner_lhs
, NOP_EXPR
,
3832 convert (TREE_TYPE (inner_lhs
),
3833 convert (lhstype
, newrhs
)));
3834 if (TREE_CODE (result
) == ERROR_MARK
)
3836 pedantic_lvalue_warning (CONVERT_EXPR
);
3837 return convert (TREE_TYPE (lhs
), result
);
3844 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
3845 Reject anything strange now. */
3847 if (!lvalue_or_else (lhs
, "invalid lvalue in assignment"))
3848 return error_mark_node
;
3850 /* Warn about storing in something that is `const'. */
3852 if (TREE_READONLY (lhs
) || TYPE_READONLY (lhstype
)
3853 || ((TREE_CODE (lhstype
) == RECORD_TYPE
3854 || TREE_CODE (lhstype
) == UNION_TYPE
)
3855 && C_TYPE_FIELDS_READONLY (lhstype
)))
3856 readonly_warning (lhs
, "assignment");
3858 /* If storing into a structure or union member,
3859 it has probably been given type `int'.
3860 Compute the type that would go with
3861 the actual amount of storage the member occupies. */
3863 if (TREE_CODE (lhs
) == COMPONENT_REF
3864 && (TREE_CODE (lhstype
) == INTEGER_TYPE
3865 || TREE_CODE (lhstype
) == REAL_TYPE
3866 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
3867 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
3869 /* If storing in a field that is in actuality a short or narrower than one,
3870 we must store in the field in its actual type. */
3872 if (lhstype
!= TREE_TYPE (lhs
))
3874 lhs
= copy_node (lhs
);
3875 TREE_TYPE (lhs
) = lhstype
;
3878 /* Convert new value to destination type. */
3880 newrhs
= convert_for_assignment (lhstype
, newrhs
, _("assignment"),
3881 NULL_TREE
, NULL_TREE
, 0);
3882 if (TREE_CODE (newrhs
) == ERROR_MARK
)
3883 return error_mark_node
;
3885 result
= build (MODIFY_EXPR
, lhstype
, lhs
, newrhs
);
3886 TREE_SIDE_EFFECTS (result
) = 1;
3888 /* If we got the LHS in a different type for storing in,
3889 convert the result back to the nominal type of LHS
3890 so that the value we return always has the same type
3891 as the LHS argument. */
3893 if (olhstype
== TREE_TYPE (result
))
3895 return convert_for_assignment (olhstype
, result
, _("assignment"),
3896 NULL_TREE
, NULL_TREE
, 0);
3899 /* Convert value RHS to type TYPE as preparation for an assignment
3900 to an lvalue of type TYPE.
3901 The real work of conversion is done by `convert'.
3902 The purpose of this function is to generate error messages
3903 for assignments that are not allowed in C.
3904 ERRTYPE is a string to use in error messages:
3905 "assignment", "return", etc. If it is null, this is parameter passing
3906 for a function call (and different error messages are output).
3908 FUNNAME is the name of the function being called,
3909 as an IDENTIFIER_NODE, or null.
3910 PARMNUM is the number of the argument, for printing in error messages. */
3913 convert_for_assignment (type
, rhs
, errtype
, fundecl
, funname
, parmnum
)
3915 const char *errtype
;
3916 tree fundecl
, funname
;
3919 register enum tree_code codel
= TREE_CODE (type
);
3920 register tree rhstype
;
3921 register enum tree_code coder
;
3923 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3924 /* Do not use STRIP_NOPS here. We do not want an enumerator
3925 whose value is 0 to count as a null pointer constant. */
3926 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
3927 rhs
= TREE_OPERAND (rhs
, 0);
3929 if (TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
3930 || TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
)
3931 rhs
= default_conversion (rhs
);
3932 else if (optimize
&& TREE_CODE (rhs
) == VAR_DECL
)
3933 rhs
= decl_constant_value (rhs
);
3935 rhstype
= TREE_TYPE (rhs
);
3936 coder
= TREE_CODE (rhstype
);
3938 if (coder
== ERROR_MARK
)
3939 return error_mark_node
;
3941 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (rhstype
))
3943 overflow_warning (rhs
);
3944 /* Check for Objective-C protocols. This will issue a warning if
3945 there are protocol violations. No need to use the return value. */
3946 maybe_objc_comptypes (type
, rhstype
, 0);
3950 if (coder
== VOID_TYPE
)
3952 error ("void value not ignored as it ought to be");
3953 return error_mark_node
;
3955 /* Arithmetic types all interconvert, and enum is treated like int. */
3956 if ((codel
== INTEGER_TYPE
|| codel
== REAL_TYPE
|| codel
== ENUMERAL_TYPE
3957 || codel
== COMPLEX_TYPE
)
3958 && (coder
== INTEGER_TYPE
|| coder
== REAL_TYPE
|| coder
== ENUMERAL_TYPE
3959 || coder
== COMPLEX_TYPE
))
3960 return convert_and_check (type
, rhs
);
3962 /* Conversion to a transparent union from its member types.
3963 This applies only to function arguments. */
3964 else if (codel
== UNION_TYPE
&& TYPE_TRANSPARENT_UNION (type
) && ! errtype
)
3967 tree marginal_memb_type
= 0;
3969 for (memb_types
= TYPE_FIELDS (type
); memb_types
;
3970 memb_types
= TREE_CHAIN (memb_types
))
3972 tree memb_type
= TREE_TYPE (memb_types
);
3974 if (comptypes (TYPE_MAIN_VARIANT (memb_type
),
3975 TYPE_MAIN_VARIANT (rhstype
)))
3978 if (TREE_CODE (memb_type
) != POINTER_TYPE
)
3981 if (coder
== POINTER_TYPE
)
3983 register tree ttl
= TREE_TYPE (memb_type
);
3984 register tree ttr
= TREE_TYPE (rhstype
);
3986 /* Any non-function converts to a [const][volatile] void *
3987 and vice versa; otherwise, targets must be the same.
3988 Meanwhile, the lhs target must have all the qualifiers of
3990 if (TYPE_MAIN_VARIANT (ttl
) == void_type_node
3991 || TYPE_MAIN_VARIANT (ttr
) == void_type_node
3992 || comp_target_types (memb_type
, rhstype
))
3994 /* If this type won't generate any warnings, use it. */
3995 if (TYPE_QUALS (ttl
) == TYPE_QUALS (ttr
)
3996 || ((TREE_CODE (ttr
) == FUNCTION_TYPE
3997 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
3998 ? ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
3999 == TYPE_QUALS (ttr
))
4000 : ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
4001 == TYPE_QUALS (ttl
))))
4004 /* Keep looking for a better type, but remember this one. */
4005 if (! marginal_memb_type
)
4006 marginal_memb_type
= memb_type
;
4010 /* Can convert integer zero to any pointer type. */
4011 if (integer_zerop (rhs
)
4012 || (TREE_CODE (rhs
) == NOP_EXPR
4013 && integer_zerop (TREE_OPERAND (rhs
, 0))))
4015 rhs
= null_pointer_node
;
4020 if (memb_types
|| marginal_memb_type
)
4024 /* We have only a marginally acceptable member type;
4025 it needs a warning. */
4026 register tree ttl
= TREE_TYPE (marginal_memb_type
);
4027 register tree ttr
= TREE_TYPE (rhstype
);
4029 /* Const and volatile mean something different for function
4030 types, so the usual warnings are not appropriate. */
4031 if (TREE_CODE (ttr
) == FUNCTION_TYPE
4032 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
4034 /* Because const and volatile on functions are
4035 restrictions that say the function will not do
4036 certain things, it is okay to use a const or volatile
4037 function where an ordinary one is wanted, but not
4039 if (TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
))
4040 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4041 errtype
, funname
, parmnum
);
4043 else if (TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
))
4044 warn_for_assignment ("%s discards qualifiers from pointer target type",
4049 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (fundecl
))
4050 pedwarn ("ANSI C prohibits argument conversion to union type");
4052 return build1 (NOP_EXPR
, type
, rhs
);
4056 /* Conversions among pointers */
4057 else if (codel
== POINTER_TYPE
&& coder
== POINTER_TYPE
)
4059 register tree ttl
= TREE_TYPE (type
);
4060 register tree ttr
= TREE_TYPE (rhstype
);
4062 /* Any non-function converts to a [const][volatile] void *
4063 and vice versa; otherwise, targets must be the same.
4064 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4065 if (TYPE_MAIN_VARIANT (ttl
) == void_type_node
4066 || TYPE_MAIN_VARIANT (ttr
) == void_type_node
4067 || comp_target_types (type
, rhstype
)
4068 || (unsigned_type (TYPE_MAIN_VARIANT (ttl
))
4069 == unsigned_type (TYPE_MAIN_VARIANT (ttr
))))
4072 && ((TYPE_MAIN_VARIANT (ttl
) == void_type_node
4073 && TREE_CODE (ttr
) == FUNCTION_TYPE
)
4075 (TYPE_MAIN_VARIANT (ttr
) == void_type_node
4076 /* Check TREE_CODE to catch cases like (void *) (char *) 0
4077 which are not ANSI null ptr constants. */
4078 && (!integer_zerop (rhs
) || TREE_CODE (rhs
) == NOP_EXPR
)
4079 && TREE_CODE (ttl
) == FUNCTION_TYPE
)))
4080 warn_for_assignment ("ANSI forbids %s between function pointer and `void *'",
4081 errtype
, funname
, parmnum
);
4082 /* Const and volatile mean something different for function types,
4083 so the usual warnings are not appropriate. */
4084 else if (TREE_CODE (ttr
) != FUNCTION_TYPE
4085 && TREE_CODE (ttl
) != FUNCTION_TYPE
)
4087 if (TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
))
4088 warn_for_assignment ("%s discards qualifiers from pointer target type",
4089 errtype
, funname
, parmnum
);
4090 /* If this is not a case of ignoring a mismatch in signedness,
4092 else if (TYPE_MAIN_VARIANT (ttl
) == void_type_node
4093 || TYPE_MAIN_VARIANT (ttr
) == void_type_node
4094 || comp_target_types (type
, rhstype
))
4096 /* If there is a mismatch, do warn. */
4098 warn_for_assignment ("pointer targets in %s differ in signedness",
4099 errtype
, funname
, parmnum
);
4101 else if (TREE_CODE (ttl
) == FUNCTION_TYPE
4102 && TREE_CODE (ttr
) == FUNCTION_TYPE
)
4104 /* Because const and volatile on functions are restrictions
4105 that say the function will not do certain things,
4106 it is okay to use a const or volatile function
4107 where an ordinary one is wanted, but not vice-versa. */
4108 if (TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
))
4109 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4110 errtype
, funname
, parmnum
);
4114 warn_for_assignment ("%s from incompatible pointer type",
4115 errtype
, funname
, parmnum
);
4116 return convert (type
, rhs
);
4118 else if (codel
== POINTER_TYPE
&& coder
== INTEGER_TYPE
)
4120 /* An explicit constant 0 can convert to a pointer,
4121 or one that results from arithmetic, even including
4122 a cast to integer type. */
4123 if (! (TREE_CODE (rhs
) == INTEGER_CST
&& integer_zerop (rhs
))
4125 ! (TREE_CODE (rhs
) == NOP_EXPR
4126 && TREE_CODE (TREE_TYPE (rhs
)) == INTEGER_TYPE
4127 && TREE_CODE (TREE_OPERAND (rhs
, 0)) == INTEGER_CST
4128 && integer_zerop (TREE_OPERAND (rhs
, 0))))
4130 warn_for_assignment ("%s makes pointer from integer without a cast",
4131 errtype
, funname
, parmnum
);
4132 return convert (type
, rhs
);
4134 return null_pointer_node
;
4136 else if (codel
== INTEGER_TYPE
&& coder
== POINTER_TYPE
)
4138 warn_for_assignment ("%s makes integer from pointer without a cast",
4139 errtype
, funname
, parmnum
);
4140 return convert (type
, rhs
);
4147 tree selector
= maybe_building_objc_message_expr ();
4149 if (selector
&& parmnum
> 2)
4150 error ("incompatible type for argument %d of `%s'",
4151 parmnum
- 2, IDENTIFIER_POINTER (selector
));
4153 error ("incompatible type for argument %d of `%s'",
4154 parmnum
, IDENTIFIER_POINTER (funname
));
4157 error ("incompatible type for argument %d of indirect function call",
4161 error ("incompatible types in %s", errtype
);
4163 return error_mark_node
;
4166 /* Print a warning using MSGID.
4167 It gets OPNAME as its one parameter.
4168 If OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
4169 FUNCTION and ARGNUM are handled specially if we are building an
4170 Objective-C selector. */
4173 warn_for_assignment (msgid
, opname
, function
, argnum
)
4181 tree selector
= maybe_building_objc_message_expr ();
4184 if (selector
&& argnum
> 2)
4186 function
= selector
;
4191 /* Function name is known; supply it. */
4192 const char *argstring
= _("passing arg %d of `%s'");
4193 new_opname
= (char *) alloca (IDENTIFIER_LENGTH (function
)
4194 + strlen (argstring
) + 1 + 25
4196 sprintf (new_opname
, argstring
, argnum
,
4197 IDENTIFIER_POINTER (function
));
4201 /* Function name unknown (call through ptr); just give arg number.*/
4202 const char *argnofun
= _("passing arg %d of pointer to function");
4203 new_opname
= (char *) alloca (strlen (argnofun
) + 1 + 25 /*%d*/ + 1);
4204 sprintf (new_opname
, argnofun
, argnum
);
4206 opname
= new_opname
;
4208 pedwarn (msgid
, opname
);
4211 /* If VALUE is a compound expr all of whose expressions are constant, then
4212 return its value. Otherwise, return error_mark_node.
4214 This is for handling COMPOUND_EXPRs as initializer elements
4215 which is allowed with a warning when -pedantic is specified. */
4218 valid_compound_expr_initializer (value
, endtype
)
4222 if (TREE_CODE (value
) == COMPOUND_EXPR
)
4224 if (valid_compound_expr_initializer (TREE_OPERAND (value
, 0), endtype
)
4226 return error_mark_node
;
4227 return valid_compound_expr_initializer (TREE_OPERAND (value
, 1),
4230 else if (! TREE_CONSTANT (value
)
4231 && ! initializer_constant_valid_p (value
, endtype
))
4232 return error_mark_node
;
4237 /* Perform appropriate conversions on the initial value of a variable,
4238 store it in the declaration DECL,
4239 and print any error messages that are appropriate.
4240 If the init is invalid, store an ERROR_MARK. */
4243 store_init_value (decl
, init
)
4246 register tree value
, type
;
4248 /* If variable's type was invalidly declared, just ignore it. */
4250 type
= TREE_TYPE (decl
);
4251 if (TREE_CODE (type
) == ERROR_MARK
)
4254 /* Digest the specified initializer into an expression. */
4256 value
= digest_init (type
, init
, TREE_STATIC (decl
),
4257 TREE_STATIC (decl
) || pedantic
);
4259 /* Store the expression if valid; else report error. */
4262 /* Note that this is the only place we can detect the error
4263 in a case such as struct foo bar = (struct foo) { x, y };
4264 where there is one initial value which is a constructor expression. */
4265 if (value
== error_mark_node
)
4267 else if (TREE_STATIC (decl
) && ! TREE_CONSTANT (value
))
4269 error ("initializer for static variable is not constant");
4270 value
= error_mark_node
;
4272 else if (TREE_STATIC (decl
)
4273 && initializer_constant_valid_p (value
, TREE_TYPE (value
)) == 0)
4275 error ("initializer for static variable uses complicated arithmetic");
4276 value
= error_mark_node
;
4280 if (pedantic
&& TREE_CODE (value
) == CONSTRUCTOR
)
4282 if (! TREE_CONSTANT (value
))
4283 pedwarn ("aggregate initializer is not constant");
4284 else if (! TREE_STATIC (value
))
4285 pedwarn ("aggregate initializer uses complicated arithmetic");
4290 DECL_INITIAL (decl
) = value
;
4292 /* ANSI wants warnings about out-of-range constant initializers. */
4293 STRIP_TYPE_NOPS (value
);
4294 constant_expression_warning (value
);
4297 /* Methods for storing and printing names for error messages. */
4299 /* Implement a spelling stack that allows components of a name to be pushed
4300 and popped. Each element on the stack is this structure. */
4312 #define SPELLING_STRING 1
4313 #define SPELLING_MEMBER 2
4314 #define SPELLING_BOUNDS 3
4316 static struct spelling
*spelling
; /* Next stack element (unused). */
4317 static struct spelling
*spelling_base
; /* Spelling stack base. */
4318 static int spelling_size
; /* Size of the spelling stack. */
4320 /* Macros to save and restore the spelling stack around push_... functions.
4321 Alternative to SAVE_SPELLING_STACK. */
4323 #define SPELLING_DEPTH() (spelling - spelling_base)
4324 #define RESTORE_SPELLING_DEPTH(depth) (spelling = spelling_base + depth)
4326 /* Save and restore the spelling stack around arbitrary C code. */
4328 #define SAVE_SPELLING_DEPTH(code) \
4330 int __depth = SPELLING_DEPTH (); \
4332 RESTORE_SPELLING_DEPTH (__depth); \
4335 /* Push an element on the spelling stack with type KIND and assign VALUE
4338 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4340 int depth = SPELLING_DEPTH (); \
4342 if (depth >= spelling_size) \
4344 spelling_size += 10; \
4345 if (spelling_base == 0) \
4347 = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \
4350 = (struct spelling *) xrealloc (spelling_base, \
4351 spelling_size * sizeof (struct spelling)); \
4352 RESTORE_SPELLING_DEPTH (depth); \
4355 spelling->kind = (KIND); \
4356 spelling->MEMBER = (VALUE); \
4360 /* Push STRING on the stack. Printed literally. */
4363 push_string (string
)
4366 PUSH_SPELLING (SPELLING_STRING
, string
, u
.s
);
4369 /* Push a member name on the stack. Printed as '.' STRING. */
4372 push_member_name (decl
)
4377 = DECL_NAME (decl
) ? IDENTIFIER_POINTER (DECL_NAME (decl
)) : "<anonymous>";
4378 PUSH_SPELLING (SPELLING_MEMBER
, string
, u
.s
);
4381 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4384 push_array_bounds (bounds
)
4387 PUSH_SPELLING (SPELLING_BOUNDS
, bounds
, u
.i
);
4390 /* Compute the maximum size in bytes of the printed spelling. */
4395 register int size
= 0;
4396 register struct spelling
*p
;
4398 for (p
= spelling_base
; p
< spelling
; p
++)
4400 if (p
->kind
== SPELLING_BOUNDS
)
4403 size
+= strlen (p
->u
.s
) + 1;
4409 /* Print the spelling to BUFFER and return it. */
4412 print_spelling (buffer
)
4413 register char *buffer
;
4415 register char *d
= buffer
;
4416 register struct spelling
*p
;
4418 for (p
= spelling_base
; p
< spelling
; p
++)
4419 if (p
->kind
== SPELLING_BOUNDS
)
4421 sprintf (d
, "[%d]", p
->u
.i
);
4426 register const char *s
;
4427 if (p
->kind
== SPELLING_MEMBER
)
4429 for (s
= p
->u
.s
; (*d
= *s
++); d
++)
4436 /* Issue an error message for a bad initializer component.
4437 MSGID identifies the message.
4438 The component name is taken from the spelling stack. */
4447 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4449 error ("(near initialization for `%s')", ofwhat
);
4452 /* Issue a pedantic warning for a bad initializer component.
4453 MSGID identifies the message.
4454 The component name is taken from the spelling stack. */
4457 pedwarn_init (msgid
)
4463 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4465 pedwarn ("(near initialization for `%s')", ofwhat
);
4468 /* Issue a warning for a bad initializer component.
4469 MSGID identifies the message.
4470 The component name is taken from the spelling stack. */
4473 warning_init (msgid
)
4479 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4481 warning ("(near initialization for `%s')", ofwhat
);
4484 /* Digest the parser output INIT as an initializer for type TYPE.
4485 Return a C expression of type TYPE to represent the initial value.
4487 The arguments REQUIRE_CONSTANT and CONSTRUCTOR_CONSTANT request errors
4488 if non-constant initializers or elements are seen. CONSTRUCTOR_CONSTANT
4489 applies only to elements of constructors. */
4492 digest_init (type
, init
, require_constant
, constructor_constant
)
4494 int require_constant
, constructor_constant
;
4496 enum tree_code code
= TREE_CODE (type
);
4497 tree inside_init
= init
;
4499 if (type
== error_mark_node
|| init
== error_mark_node
)
4500 return error_mark_node
;
4502 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4503 /* Do not use STRIP_NOPS here. We do not want an enumerator
4504 whose value is 0 to count as a null pointer constant. */
4505 if (TREE_CODE (init
) == NON_LVALUE_EXPR
)
4506 inside_init
= TREE_OPERAND (init
, 0);
4508 /* Initialization of an array of chars from a string constant
4509 optionally enclosed in braces. */
4511 if (code
== ARRAY_TYPE
)
4513 tree typ1
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
4514 if ((typ1
== char_type_node
4515 || typ1
== signed_char_type_node
4516 || typ1
== unsigned_char_type_node
4517 || typ1
== unsigned_wchar_type_node
4518 || typ1
== signed_wchar_type_node
)
4519 && ((inside_init
&& TREE_CODE (inside_init
) == STRING_CST
)))
4521 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4522 TYPE_MAIN_VARIANT (type
)))
4525 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init
)))
4527 && TYPE_PRECISION (typ1
) == TYPE_PRECISION (char_type_node
))
4529 error_init ("char-array initialized from wide string");
4530 return error_mark_node
;
4532 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init
)))
4534 && TYPE_PRECISION (typ1
) != TYPE_PRECISION (char_type_node
))
4536 error_init ("int-array initialized from non-wide string");
4537 return error_mark_node
;
4540 TREE_TYPE (inside_init
) = type
;
4541 if (TYPE_DOMAIN (type
) != 0
4542 && TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
)
4544 register int size
= TREE_INT_CST_LOW (TYPE_SIZE (type
));
4545 size
= (size
+ BITS_PER_UNIT
- 1) / BITS_PER_UNIT
;
4546 /* Subtract 1 (or sizeof (wchar_t))
4547 because it's ok to ignore the terminating null char
4548 that is counted in the length of the constant. */
4549 if (size
< TREE_STRING_LENGTH (inside_init
)
4550 - (TYPE_PRECISION (typ1
) != TYPE_PRECISION (char_type_node
)
4551 ? TYPE_PRECISION (wchar_type_node
) / BITS_PER_UNIT
4553 pedwarn_init ("initializer-string for array of chars is too long");
4559 /* Any type can be initialized
4560 from an expression of the same type, optionally with braces. */
4562 if (inside_init
&& TREE_TYPE (inside_init
) != 0
4563 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4564 TYPE_MAIN_VARIANT (type
))
4565 || (code
== ARRAY_TYPE
4566 && comptypes (TREE_TYPE (inside_init
), type
))
4567 || (code
== POINTER_TYPE
4568 && (TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
4569 || TREE_CODE (TREE_TYPE (inside_init
)) == FUNCTION_TYPE
)
4570 && comptypes (TREE_TYPE (TREE_TYPE (inside_init
)),
4571 TREE_TYPE (type
)))))
4573 if (code
== POINTER_TYPE
4574 && (TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
4575 || TREE_CODE (TREE_TYPE (inside_init
)) == FUNCTION_TYPE
))
4576 inside_init
= default_conversion (inside_init
);
4577 else if (code
== ARRAY_TYPE
&& TREE_CODE (inside_init
) != STRING_CST
4578 && TREE_CODE (inside_init
) != CONSTRUCTOR
)
4580 error_init ("array initialized from non-constant array expression");
4581 return error_mark_node
;
4584 if (optimize
&& TREE_CODE (inside_init
) == VAR_DECL
)
4585 inside_init
= decl_constant_value (inside_init
);
4587 /* Compound expressions can only occur here if -pedantic or
4588 -pedantic-errors is specified. In the later case, we always want
4589 an error. In the former case, we simply want a warning. */
4590 if (require_constant
&& pedantic
4591 && TREE_CODE (inside_init
) == COMPOUND_EXPR
)
4594 = valid_compound_expr_initializer (inside_init
,
4595 TREE_TYPE (inside_init
));
4596 if (inside_init
== error_mark_node
)
4597 error_init ("initializer element is not constant");
4599 pedwarn_init ("initializer element is not constant");
4600 if (flag_pedantic_errors
)
4601 inside_init
= error_mark_node
;
4603 else if (require_constant
&& ! TREE_CONSTANT (inside_init
))
4605 error_init ("initializer element is not constant");
4606 inside_init
= error_mark_node
;
4608 else if (require_constant
4609 && initializer_constant_valid_p (inside_init
, TREE_TYPE (inside_init
)) == 0)
4611 error_init ("initializer element is not computable at load time");
4612 inside_init
= error_mark_node
;
4618 /* Handle scalar types, including conversions. */
4620 if (code
== INTEGER_TYPE
|| code
== REAL_TYPE
|| code
== POINTER_TYPE
4621 || code
== ENUMERAL_TYPE
|| code
== COMPLEX_TYPE
)
4623 /* Note that convert_for_assignment calls default_conversion
4624 for arrays and functions. We must not call it in the
4625 case where inside_init is a null pointer constant. */
4627 = convert_for_assignment (type
, init
, _("initialization"),
4628 NULL_TREE
, NULL_TREE
, 0);
4630 if (require_constant
&& ! TREE_CONSTANT (inside_init
))
4632 error_init ("initializer element is not constant");
4633 inside_init
= error_mark_node
;
4635 else if (require_constant
4636 && initializer_constant_valid_p (inside_init
, TREE_TYPE (inside_init
)) == 0)
4638 error_init ("initializer element is not computable at load time");
4639 inside_init
= error_mark_node
;
4645 /* Come here only for records and arrays. */
4647 if (TYPE_SIZE (type
) && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4649 error_init ("variable-sized object may not be initialized");
4650 return error_mark_node
;
4653 /* Traditionally, you can write struct foo x = 0;
4654 and it initializes the first element of x to 0. */
4655 if (flag_traditional
)
4657 tree top
= 0, prev
= 0, otype
= type
;
4658 while (TREE_CODE (type
) == RECORD_TYPE
4659 || TREE_CODE (type
) == ARRAY_TYPE
4660 || TREE_CODE (type
) == QUAL_UNION_TYPE
4661 || TREE_CODE (type
) == UNION_TYPE
)
4663 tree temp
= build (CONSTRUCTOR
, type
, NULL_TREE
, NULL_TREE
);
4667 TREE_OPERAND (prev
, 1) = build_tree_list (NULL_TREE
, temp
);
4669 if (TREE_CODE (type
) == ARRAY_TYPE
)
4670 type
= TREE_TYPE (type
);
4671 else if (TYPE_FIELDS (type
))
4672 type
= TREE_TYPE (TYPE_FIELDS (type
));
4675 error_init ("invalid initializer");
4676 return error_mark_node
;
4682 TREE_OPERAND (prev
, 1)
4683 = build_tree_list (NULL_TREE
,
4684 digest_init (type
, init
, require_constant
,
4685 constructor_constant
));
4689 return error_mark_node
;
4691 error_init ("invalid initializer");
4692 return error_mark_node
;
4695 /* Handle initializers that use braces. */
4697 /* Type of object we are accumulating a constructor for.
4698 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4699 static tree constructor_type
;
4701 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4703 static tree constructor_fields
;
4705 /* For an ARRAY_TYPE, this is the specified index
4706 at which to store the next element we get.
4707 This is a special INTEGER_CST node that we modify in place. */
4708 static tree constructor_index
;
4710 /* For an ARRAY_TYPE, this is the end index of the range
4711 to initialize with the next element, or NULL in the ordinary case
4712 where the element is used just once. */
4713 static tree constructor_range_end
;
4715 /* For an ARRAY_TYPE, this is the maximum index. */
4716 static tree constructor_max_index
;
4718 /* For a RECORD_TYPE, this is the first field not yet written out. */
4719 static tree constructor_unfilled_fields
;
4721 /* For an ARRAY_TYPE, this is the index of the first element
4722 not yet written out.
4723 This is a special INTEGER_CST node that we modify in place. */
4724 static tree constructor_unfilled_index
;
4726 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4727 This is so we can generate gaps between fields, when appropriate.
4728 This is a special INTEGER_CST node that we modify in place. */
4729 static tree constructor_bit_index
;
4731 /* If we are saving up the elements rather than allocating them,
4732 this is the list of elements so far (in reverse order,
4733 most recent first). */
4734 static tree constructor_elements
;
4736 /* 1 if so far this constructor's elements are all compile-time constants. */
4737 static int constructor_constant
;
4739 /* 1 if so far this constructor's elements are all valid address constants. */
4740 static int constructor_simple
;
4742 /* 1 if this constructor is erroneous so far. */
4743 static int constructor_erroneous
;
4745 /* 1 if have called defer_addressed_constants. */
4746 static int constructor_subconstants_deferred
;
4748 /* Structure for managing pending initializer elements, organized as an
4753 struct init_node
*left
, *right
;
4754 struct init_node
*parent
;
4760 /* Tree of pending elements at this constructor level.
4761 These are elements encountered out of order
4762 which belong at places we haven't reached yet in actually
4763 writing the output. */
4764 static struct init_node
*constructor_pending_elts
;
4766 /* The SPELLING_DEPTH of this constructor. */
4767 static int constructor_depth
;
4769 /* 0 if implicitly pushing constructor levels is allowed. */
4770 int constructor_no_implicit
= 0; /* 0 for C; 1 for some other languages. */
4772 static int require_constant_value
;
4773 static int require_constant_elements
;
4775 /* 1 if it is ok to output this constructor as we read it.
4776 0 means must accumulate a CONSTRUCTOR expression. */
4777 static int constructor_incremental
;
4779 /* DECL node for which an initializer is being read.
4780 0 means we are reading a constructor expression
4781 such as (struct foo) {...}. */
4782 static tree constructor_decl
;
4784 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4785 static char *constructor_asmspec
;
4787 /* Nonzero if this is an initializer for a top-level decl. */
4788 static int constructor_top_level
;
4791 /* This stack has a level for each implicit or explicit level of
4792 structuring in the initializer, including the outermost one. It
4793 saves the values of most of the variables above. */
4795 struct constructor_stack
4797 struct constructor_stack
*next
;
4803 tree unfilled_index
;
4804 tree unfilled_fields
;
4808 struct init_node
*pending_elts
;
4810 /* If nonzero, this value should replace the entire
4811 constructor at this level. */
4812 tree replacement_value
;
4821 struct constructor_stack
*constructor_stack
;
4823 /* This stack records separate initializers that are nested.
4824 Nested initializers can't happen in ANSI C, but GNU C allows them
4825 in cases like { ... (struct foo) { ... } ... }. */
4827 struct initializer_stack
4829 struct initializer_stack
*next
;
4832 struct constructor_stack
*constructor_stack
;
4834 struct spelling
*spelling
;
4835 struct spelling
*spelling_base
;
4839 char require_constant_value
;
4840 char require_constant_elements
;
4844 struct initializer_stack
*initializer_stack
;
4846 /* Prepare to parse and output the initializer for variable DECL. */
4849 start_init (decl
, asmspec_tree
, top_level
)
4855 struct initializer_stack
*p
4856 = (struct initializer_stack
*) xmalloc (sizeof (struct initializer_stack
));
4860 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
4862 p
->decl
= constructor_decl
;
4863 p
->asmspec
= constructor_asmspec
;
4864 p
->incremental
= constructor_incremental
;
4865 p
->require_constant_value
= require_constant_value
;
4866 p
->require_constant_elements
= require_constant_elements
;
4867 p
->constructor_stack
= constructor_stack
;
4868 p
->elements
= constructor_elements
;
4869 p
->spelling
= spelling
;
4870 p
->spelling_base
= spelling_base
;
4871 p
->spelling_size
= spelling_size
;
4872 p
->deferred
= constructor_subconstants_deferred
;
4873 p
->top_level
= constructor_top_level
;
4874 p
->next
= initializer_stack
;
4875 initializer_stack
= p
;
4877 constructor_decl
= decl
;
4878 constructor_incremental
= top_level
;
4879 constructor_asmspec
= asmspec
;
4880 constructor_subconstants_deferred
= 0;
4881 constructor_top_level
= top_level
;
4885 require_constant_value
= TREE_STATIC (decl
);
4886 require_constant_elements
4887 = ((TREE_STATIC (decl
) || pedantic
)
4888 /* For a scalar, you can always use any value to initialize,
4889 even within braces. */
4890 && (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
4891 || TREE_CODE (TREE_TYPE (decl
)) == RECORD_TYPE
4892 || TREE_CODE (TREE_TYPE (decl
)) == UNION_TYPE
4893 || TREE_CODE (TREE_TYPE (decl
)) == QUAL_UNION_TYPE
));
4894 locus
= IDENTIFIER_POINTER (DECL_NAME (decl
));
4895 constructor_incremental
|= TREE_STATIC (decl
);
4899 require_constant_value
= 0;
4900 require_constant_elements
= 0;
4901 locus
= "(anonymous)";
4904 constructor_stack
= 0;
4906 missing_braces_mentioned
= 0;
4910 RESTORE_SPELLING_DEPTH (0);
4913 push_string (locus
);
4919 struct initializer_stack
*p
= initializer_stack
;
4921 /* Output subconstants (string constants, usually)
4922 that were referenced within this initializer and saved up.
4923 Must do this if and only if we called defer_addressed_constants. */
4924 if (constructor_subconstants_deferred
)
4925 output_deferred_addressed_constants ();
4927 /* Free the whole constructor stack of this initializer. */
4928 while (constructor_stack
)
4930 struct constructor_stack
*q
= constructor_stack
;
4931 constructor_stack
= q
->next
;
4935 /* Pop back to the data of the outer initializer (if any). */
4936 constructor_decl
= p
->decl
;
4937 constructor_asmspec
= p
->asmspec
;
4938 constructor_incremental
= p
->incremental
;
4939 require_constant_value
= p
->require_constant_value
;
4940 require_constant_elements
= p
->require_constant_elements
;
4941 constructor_stack
= p
->constructor_stack
;
4942 constructor_elements
= p
->elements
;
4943 spelling
= p
->spelling
;
4944 spelling_base
= p
->spelling_base
;
4945 spelling_size
= p
->spelling_size
;
4946 constructor_subconstants_deferred
= p
->deferred
;
4947 constructor_top_level
= p
->top_level
;
4948 initializer_stack
= p
->next
;
4952 /* Call here when we see the initializer is surrounded by braces.
4953 This is instead of a call to push_init_level;
4954 it is matched by a call to pop_init_level.
4956 TYPE is the type to initialize, for a constructor expression.
4957 For an initializer for a decl, TYPE is zero. */
4960 really_start_incremental_init (type
)
4963 struct constructor_stack
*p
4964 = (struct constructor_stack
*) xmalloc (sizeof (struct constructor_stack
));
4967 type
= TREE_TYPE (constructor_decl
);
4969 /* Turn off constructor_incremental if type is a struct with bitfields.
4970 Do this before the first push, so that the corrected value
4971 is available in finish_init. */
4972 check_init_type_bitfields (type
);
4974 p
->type
= constructor_type
;
4975 p
->fields
= constructor_fields
;
4976 p
->index
= constructor_index
;
4977 p
->range_end
= constructor_range_end
;
4978 p
->max_index
= constructor_max_index
;
4979 p
->unfilled_index
= constructor_unfilled_index
;
4980 p
->unfilled_fields
= constructor_unfilled_fields
;
4981 p
->bit_index
= constructor_bit_index
;
4982 p
->elements
= constructor_elements
;
4983 p
->constant
= constructor_constant
;
4984 p
->simple
= constructor_simple
;
4985 p
->erroneous
= constructor_erroneous
;
4986 p
->pending_elts
= constructor_pending_elts
;
4987 p
->depth
= constructor_depth
;
4988 p
->replacement_value
= 0;
4990 p
->incremental
= constructor_incremental
;
4993 constructor_stack
= p
;
4995 constructor_constant
= 1;
4996 constructor_simple
= 1;
4997 constructor_depth
= SPELLING_DEPTH ();
4998 constructor_elements
= 0;
4999 constructor_pending_elts
= 0;
5000 constructor_type
= type
;
5002 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5003 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5005 constructor_fields
= TYPE_FIELDS (constructor_type
);
5006 /* Skip any nameless bit fields at the beginning. */
5007 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
5008 && DECL_NAME (constructor_fields
) == 0)
5009 constructor_fields
= TREE_CHAIN (constructor_fields
);
5010 constructor_unfilled_fields
= constructor_fields
;
5011 constructor_bit_index
= copy_node (integer_zero_node
);
5012 TREE_TYPE (constructor_bit_index
) = sbitsizetype
;
5014 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5016 constructor_range_end
= 0;
5017 if (TYPE_DOMAIN (constructor_type
))
5019 constructor_max_index
5020 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
5022 = copy_node (TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
5025 constructor_index
= copy_node (integer_zero_node
);
5026 constructor_unfilled_index
= copy_node (constructor_index
);
5030 /* Handle the case of int x = {5}; */
5031 constructor_fields
= constructor_type
;
5032 constructor_unfilled_fields
= constructor_type
;
5035 if (constructor_incremental
)
5037 int momentary
= suspend_momentary ();
5038 push_obstacks_nochange ();
5039 if (TREE_PERMANENT (constructor_decl
))
5040 end_temporary_allocation ();
5041 make_decl_rtl (constructor_decl
, constructor_asmspec
,
5042 constructor_top_level
);
5043 assemble_variable (constructor_decl
, constructor_top_level
, 0, 1);
5045 resume_momentary (momentary
);
5048 if (constructor_incremental
)
5050 defer_addressed_constants ();
5051 constructor_subconstants_deferred
= 1;
5055 /* Push down into a subobject, for initialization.
5056 If this is for an explicit set of braces, IMPLICIT is 0.
5057 If it is because the next element belongs at a lower level,
5061 push_init_level (implicit
)
5064 struct constructor_stack
*p
;
5066 /* If we've exhausted any levels that didn't have braces,
5068 while (constructor_stack
->implicit
)
5070 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
5071 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5072 && constructor_fields
== 0)
5073 process_init_element (pop_init_level (1));
5074 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5075 && tree_int_cst_lt (constructor_max_index
, constructor_index
))
5076 process_init_element (pop_init_level (1));
5081 /* Structure elements may require alignment. Do this now if necessary
5082 for the subaggregate, and if it comes next in sequence. Don't do
5083 this for subaggregates that will go on the pending list. */
5084 if (constructor_incremental
&& constructor_type
!= 0
5085 && TREE_CODE (constructor_type
) == RECORD_TYPE
&& constructor_fields
5086 && constructor_fields
== constructor_unfilled_fields
)
5088 /* Advance to offset of this element. */
5089 if (! tree_int_cst_equal (constructor_bit_index
,
5090 DECL_FIELD_BITPOS (constructor_fields
)))
5092 /* By using unsigned arithmetic, the result will be correct even
5093 in case of overflows, if BITS_PER_UNIT is a power of two. */
5094 unsigned next
= (TREE_INT_CST_LOW
5095 (DECL_FIELD_BITPOS (constructor_fields
))
5096 / (unsigned)BITS_PER_UNIT
);
5097 unsigned here
= (TREE_INT_CST_LOW (constructor_bit_index
)
5098 / (unsigned)BITS_PER_UNIT
);
5100 assemble_zeros ((next
- here
)
5101 * (unsigned)BITS_PER_UNIT
5102 / (unsigned)BITS_PER_UNIT
);
5104 /* Indicate that we have now filled the structure up to the current
5106 constructor_unfilled_fields
= constructor_fields
;
5109 p
= (struct constructor_stack
*) xmalloc (sizeof (struct constructor_stack
));
5110 p
->type
= constructor_type
;
5111 p
->fields
= constructor_fields
;
5112 p
->index
= constructor_index
;
5113 p
->range_end
= constructor_range_end
;
5114 p
->max_index
= constructor_max_index
;
5115 p
->unfilled_index
= constructor_unfilled_index
;
5116 p
->unfilled_fields
= constructor_unfilled_fields
;
5117 p
->bit_index
= constructor_bit_index
;
5118 p
->elements
= constructor_elements
;
5119 p
->constant
= constructor_constant
;
5120 p
->simple
= constructor_simple
;
5121 p
->erroneous
= constructor_erroneous
;
5122 p
->pending_elts
= constructor_pending_elts
;
5123 p
->depth
= constructor_depth
;
5124 p
->replacement_value
= 0;
5125 p
->implicit
= implicit
;
5126 p
->incremental
= constructor_incremental
;
5128 p
->next
= constructor_stack
;
5129 constructor_stack
= p
;
5131 constructor_constant
= 1;
5132 constructor_simple
= 1;
5133 constructor_depth
= SPELLING_DEPTH ();
5134 constructor_elements
= 0;
5135 constructor_pending_elts
= 0;
5137 /* Don't die if an entire brace-pair level is superfluous
5138 in the containing level. */
5139 if (constructor_type
== 0)
5141 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
5142 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5144 /* Don't die if there are extra init elts at the end. */
5145 if (constructor_fields
== 0)
5146 constructor_type
= 0;
5149 constructor_type
= TREE_TYPE (constructor_fields
);
5150 push_member_name (constructor_fields
);
5151 constructor_depth
++;
5152 if (constructor_fields
!= constructor_unfilled_fields
)
5153 constructor_incremental
= 0;
5156 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5158 constructor_type
= TREE_TYPE (constructor_type
);
5159 push_array_bounds (TREE_INT_CST_LOW (constructor_index
));
5160 constructor_depth
++;
5161 if (! tree_int_cst_equal (constructor_index
, constructor_unfilled_index
)
5162 || constructor_range_end
!= 0)
5163 constructor_incremental
= 0;
5166 if (constructor_type
== 0)
5168 error_init ("extra brace group at end of initializer");
5169 constructor_fields
= 0;
5170 constructor_unfilled_fields
= 0;
5174 /* Turn off constructor_incremental if type is a struct with bitfields. */
5175 check_init_type_bitfields (constructor_type
);
5177 if (implicit
&& warn_missing_braces
&& !missing_braces_mentioned
)
5179 missing_braces_mentioned
= 1;
5180 warning_init ("missing braces around initializer");
5183 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5184 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5186 constructor_fields
= TYPE_FIELDS (constructor_type
);
5187 /* Skip any nameless bit fields at the beginning. */
5188 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
5189 && DECL_NAME (constructor_fields
) == 0)
5190 constructor_fields
= TREE_CHAIN (constructor_fields
);
5191 constructor_unfilled_fields
= constructor_fields
;
5192 constructor_bit_index
= copy_node (integer_zero_node
);
5193 TREE_TYPE (constructor_bit_index
) = sbitsizetype
;
5195 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5197 constructor_range_end
= 0;
5198 if (TYPE_DOMAIN (constructor_type
))
5200 constructor_max_index
5201 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
5203 = copy_node (TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
5206 constructor_index
= copy_node (integer_zero_node
);
5207 constructor_unfilled_index
= copy_node (constructor_index
);
5211 warning_init ("braces around scalar initializer");
5212 constructor_fields
= constructor_type
;
5213 constructor_unfilled_fields
= constructor_type
;
5217 /* Don't read a struct incrementally if it has any bitfields,
5218 because the incremental reading code doesn't know how to
5219 handle bitfields yet. */
5222 check_init_type_bitfields (type
)
5225 if (TREE_CODE (type
) == RECORD_TYPE
)
5228 for (tail
= TYPE_FIELDS (type
); tail
;
5229 tail
= TREE_CHAIN (tail
))
5231 if (DECL_C_BIT_FIELD (tail
))
5233 constructor_incremental
= 0;
5237 check_init_type_bitfields (TREE_TYPE (tail
));
5241 else if (TREE_CODE (type
) == UNION_TYPE
)
5243 tree tail
= TYPE_FIELDS (type
);
5244 if (tail
&& DECL_C_BIT_FIELD (tail
))
5245 /* We also use the nonincremental algorithm for initiliazation
5246 of unions whose first member is a bitfield, becuase the
5247 incremental algorithm has no code for dealing with
5249 constructor_incremental
= 0;
5252 else if (TREE_CODE (type
) == ARRAY_TYPE
)
5253 check_init_type_bitfields (TREE_TYPE (type
));
5256 /* At the end of an implicit or explicit brace level,
5257 finish up that level of constructor.
5258 If we were outputting the elements as they are read, return 0
5259 from inner levels (process_init_element ignores that),
5260 but return error_mark_node from the outermost level
5261 (that's what we want to put in DECL_INITIAL).
5262 Otherwise, return a CONSTRUCTOR expression. */
5265 pop_init_level (implicit
)
5268 struct constructor_stack
*p
;
5270 tree constructor
= 0;
5274 /* When we come to an explicit close brace,
5275 pop any inner levels that didn't have explicit braces. */
5276 while (constructor_stack
->implicit
)
5277 process_init_element (pop_init_level (1));
5280 p
= constructor_stack
;
5282 if (constructor_type
!= 0)
5283 size
= int_size_in_bytes (constructor_type
);
5285 /* Warn when some struct elements are implicitly initialized to zero. */
5288 && TREE_CODE (constructor_type
) == RECORD_TYPE
5289 && constructor_unfilled_fields
)
5291 push_member_name (constructor_unfilled_fields
);
5292 warning_init ("missing initializer");
5293 RESTORE_SPELLING_DEPTH (constructor_depth
);
5296 /* Now output all pending elements. */
5297 output_pending_init_elements (1);
5299 #if 0 /* c-parse.in warns about {}. */
5300 /* In ANSI, each brace level must have at least one element. */
5301 if (! implicit
&& pedantic
5302 && (TREE_CODE (constructor_type
) == ARRAY_TYPE
5303 ? integer_zerop (constructor_unfilled_index
)
5304 : constructor_unfilled_fields
== TYPE_FIELDS (constructor_type
)))
5305 pedwarn_init ("empty braces in initializer");
5308 /* Pad out the end of the structure. */
5310 if (p
->replacement_value
)
5312 /* If this closes a superfluous brace pair,
5313 just pass out the element between them. */
5314 constructor
= p
->replacement_value
;
5315 /* If this is the top level thing within the initializer,
5316 and it's for a variable, then since we already called
5317 assemble_variable, we must output the value now. */
5318 if (p
->next
== 0 && constructor_decl
!= 0
5319 && constructor_incremental
)
5321 constructor
= digest_init (constructor_type
, constructor
,
5322 require_constant_value
,
5323 require_constant_elements
);
5325 /* If initializing an array of unknown size,
5326 determine the size now. */
5327 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5328 && TYPE_DOMAIN (constructor_type
) == 0)
5333 push_obstacks_nochange ();
5334 if (TREE_PERMANENT (constructor_type
))
5335 end_temporary_allocation ();
5337 momentary_p
= suspend_momentary ();
5339 /* We shouldn't have an incomplete array type within
5341 if (constructor_stack
->next
)
5345 = complete_array_type (constructor_type
,
5350 size
= int_size_in_bytes (constructor_type
);
5351 resume_momentary (momentary_p
);
5355 output_constant (constructor
, size
);
5358 else if (constructor_type
== 0)
5360 else if (TREE_CODE (constructor_type
) != RECORD_TYPE
5361 && TREE_CODE (constructor_type
) != UNION_TYPE
5362 && TREE_CODE (constructor_type
) != ARRAY_TYPE
5363 && ! constructor_incremental
)
5365 /* A nonincremental scalar initializer--just return
5366 the element, after verifying there is just one. */
5367 if (constructor_elements
== 0)
5369 error_init ("empty scalar initializer");
5370 constructor
= error_mark_node
;
5372 else if (TREE_CHAIN (constructor_elements
) != 0)
5374 error_init ("extra elements in scalar initializer");
5375 constructor
= TREE_VALUE (constructor_elements
);
5378 constructor
= TREE_VALUE (constructor_elements
);
5380 else if (! constructor_incremental
)
5382 if (constructor_erroneous
)
5383 constructor
= error_mark_node
;
5386 int momentary
= suspend_momentary ();
5388 constructor
= build (CONSTRUCTOR
, constructor_type
, NULL_TREE
,
5389 nreverse (constructor_elements
));
5390 if (constructor_constant
)
5391 TREE_CONSTANT (constructor
) = 1;
5392 if (constructor_constant
&& constructor_simple
)
5393 TREE_STATIC (constructor
) = 1;
5395 resume_momentary (momentary
);
5401 int momentary
= suspend_momentary ();
5403 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5404 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5406 /* Find the offset of the end of that field. */
5407 filled
= size_binop (CEIL_DIV_EXPR
,
5408 constructor_bit_index
,
5409 size_int (BITS_PER_UNIT
));
5411 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5413 /* If initializing an array of unknown size,
5414 determine the size now. */
5415 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5416 && TYPE_DOMAIN (constructor_type
) == 0)
5419 = size_binop (MINUS_EXPR
,
5420 constructor_unfilled_index
,
5423 push_obstacks_nochange ();
5424 if (TREE_PERMANENT (constructor_type
))
5425 end_temporary_allocation ();
5426 maxindex
= copy_node (maxindex
);
5427 TYPE_DOMAIN (constructor_type
) = build_index_type (maxindex
);
5428 TREE_TYPE (maxindex
) = TYPE_DOMAIN (constructor_type
);
5430 /* TYPE_MAX_VALUE is always one less than the number of elements
5431 in the array, because we start counting at zero. Therefore,
5432 warn only if the value is less than zero. */
5434 && (tree_int_cst_sgn (TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
)))
5436 error_with_decl (constructor_decl
,
5437 "zero or negative array size `%s'");
5438 layout_type (constructor_type
);
5439 size
= int_size_in_bytes (constructor_type
);
5443 filled
= size_binop (MULT_EXPR
, constructor_unfilled_index
,
5444 size_in_bytes (TREE_TYPE (constructor_type
)));
5450 assemble_zeros (size
- TREE_INT_CST_LOW (filled
));
5452 resume_momentary (momentary
);
5456 constructor_type
= p
->type
;
5457 constructor_fields
= p
->fields
;
5458 constructor_index
= p
->index
;
5459 constructor_range_end
= p
->range_end
;
5460 constructor_max_index
= p
->max_index
;
5461 constructor_unfilled_index
= p
->unfilled_index
;
5462 constructor_unfilled_fields
= p
->unfilled_fields
;
5463 constructor_bit_index
= p
->bit_index
;
5464 constructor_elements
= p
->elements
;
5465 constructor_constant
= p
->constant
;
5466 constructor_simple
= p
->simple
;
5467 constructor_erroneous
= p
->erroneous
;
5468 constructor_pending_elts
= p
->pending_elts
;
5469 constructor_depth
= p
->depth
;
5470 constructor_incremental
= p
->incremental
;
5471 RESTORE_SPELLING_DEPTH (constructor_depth
);
5473 constructor_stack
= p
->next
;
5476 if (constructor
== 0)
5478 if (constructor_stack
== 0)
5479 return error_mark_node
;
5485 /* Within an array initializer, specify the next index to be initialized.
5486 FIRST is that index. If LAST is nonzero, then initialize a range
5487 of indices, running from FIRST through LAST. */
5490 set_init_index (first
, last
)
5493 while ((TREE_CODE (first
) == NOP_EXPR
5494 || TREE_CODE (first
) == CONVERT_EXPR
5495 || TREE_CODE (first
) == NON_LVALUE_EXPR
)
5496 && (TYPE_MODE (TREE_TYPE (first
))
5497 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (first
, 0)))))
5498 (first
) = TREE_OPERAND (first
, 0);
5500 while ((TREE_CODE (last
) == NOP_EXPR
5501 || TREE_CODE (last
) == CONVERT_EXPR
5502 || TREE_CODE (last
) == NON_LVALUE_EXPR
)
5503 && (TYPE_MODE (TREE_TYPE (last
))
5504 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (last
, 0)))))
5505 (last
) = TREE_OPERAND (last
, 0);
5507 if (TREE_CODE (first
) != INTEGER_CST
)
5508 error_init ("nonconstant array index in initializer");
5509 else if (last
!= 0 && TREE_CODE (last
) != INTEGER_CST
)
5510 error_init ("nonconstant array index in initializer");
5511 else if (! constructor_unfilled_index
)
5512 error_init ("array index in non-array initializer");
5513 else if (tree_int_cst_lt (first
, constructor_unfilled_index
))
5514 error_init ("duplicate array index in initializer");
5517 TREE_INT_CST_LOW (constructor_index
) = TREE_INT_CST_LOW (first
);
5518 TREE_INT_CST_HIGH (constructor_index
) = TREE_INT_CST_HIGH (first
);
5520 if (last
!= 0 && tree_int_cst_lt (last
, first
))
5521 error_init ("empty index range in initializer");
5525 pedwarn ("ANSI C forbids specifying element to initialize");
5526 constructor_range_end
= last
;
5531 /* Within a struct initializer, specify the next field to be initialized. */
5534 set_init_label (fieldname
)
5540 /* Don't die if an entire brace-pair level is superfluous
5541 in the containing level. */
5542 if (constructor_type
== 0)
5545 for (tail
= TYPE_FIELDS (constructor_type
); tail
;
5546 tail
= TREE_CHAIN (tail
))
5548 if (tail
== constructor_unfilled_fields
)
5550 if (DECL_NAME (tail
) == fieldname
)
5555 error ("unknown field `%s' specified in initializer",
5556 IDENTIFIER_POINTER (fieldname
));
5558 error ("field `%s' already initialized",
5559 IDENTIFIER_POINTER (fieldname
));
5562 constructor_fields
= tail
;
5564 pedwarn ("ANSI C forbids specifying structure member to initialize");
5568 /* Add a new initializer to the tree of pending initializers. PURPOSE
5569 indentifies the initializer, either array index or field in a structure.
5570 VALUE is the value of that index or field. */
5573 add_pending_init (purpose
, value
)
5574 tree purpose
, value
;
5576 struct init_node
*p
, **q
, *r
;
5578 q
= &constructor_pending_elts
;
5581 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5586 if (tree_int_cst_lt (purpose
, p
->purpose
))
5588 else if (tree_int_cst_lt (p
->purpose
, purpose
))
5599 if (tree_int_cst_lt (DECL_FIELD_BITPOS (purpose
),
5600 DECL_FIELD_BITPOS (p
->purpose
)))
5602 else if (tree_int_cst_lt (DECL_FIELD_BITPOS (p
->purpose
),
5603 DECL_FIELD_BITPOS (purpose
)))
5610 r
= (struct init_node
*) oballoc (sizeof (struct init_node
));
5611 r
->purpose
= purpose
;
5622 struct init_node
*s
;
5626 if (p
->balance
== 0)
5628 else if (p
->balance
< 0)
5635 p
->left
->parent
= p
;
5652 constructor_pending_elts
= r
;
5657 struct init_node
*t
= r
->right
;
5661 r
->right
->parent
= r
;
5666 p
->left
->parent
= p
;
5669 p
->balance
= t
->balance
< 0;
5670 r
->balance
= -(t
->balance
> 0);
5685 constructor_pending_elts
= t
;
5691 /* p->balance == +1; growth of left side balances the node. */
5696 else /* r == p->right */
5698 if (p
->balance
== 0)
5699 /* Growth propagation from right side. */
5701 else if (p
->balance
> 0)
5708 p
->right
->parent
= p
;
5725 constructor_pending_elts
= r
;
5727 else /* r->balance == -1 */
5730 struct init_node
*t
= r
->left
;
5734 r
->left
->parent
= r
;
5739 p
->right
->parent
= p
;
5742 r
->balance
= (t
->balance
< 0);
5743 p
->balance
= -(t
->balance
> 0);
5758 constructor_pending_elts
= t
;
5764 /* p->balance == -1; growth of right side balances the node. */
5775 /* Return nonzero if FIELD is equal to the index of a pending initializer. */
5778 pending_init_member (field
)
5781 struct init_node
*p
;
5783 p
= constructor_pending_elts
;
5784 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5788 if (tree_int_cst_equal (field
, p
->purpose
))
5790 else if (tree_int_cst_lt (field
, p
->purpose
))
5800 if (field
== p
->purpose
)
5802 else if (tree_int_cst_lt (DECL_FIELD_BITPOS (field
),
5803 DECL_FIELD_BITPOS (p
->purpose
)))
5813 /* "Output" the next constructor element.
5814 At top level, really output it to assembler code now.
5815 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
5816 TYPE is the data type that the containing data type wants here.
5817 FIELD is the field (a FIELD_DECL) or the index that this element fills.
5819 PENDING if non-nil means output pending elements that belong
5820 right after this element. (PENDING is normally 1;
5821 it is 0 while outputting pending elements, to avoid recursion.) */
5824 output_init_element (value
, type
, field
, pending
)
5825 tree value
, type
, field
;
5830 if (TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
5831 || (TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
5832 && !(TREE_CODE (value
) == STRING_CST
5833 && TREE_CODE (type
) == ARRAY_TYPE
5834 && TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
)
5835 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value
)),
5836 TYPE_MAIN_VARIANT (type
))))
5837 value
= default_conversion (value
);
5839 if (value
== error_mark_node
)
5840 constructor_erroneous
= 1;
5841 else if (!TREE_CONSTANT (value
))
5842 constructor_constant
= 0;
5843 else if (initializer_constant_valid_p (value
, TREE_TYPE (value
)) == 0
5844 || ((TREE_CODE (constructor_type
) == RECORD_TYPE
5845 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5846 && DECL_C_BIT_FIELD (field
)
5847 && TREE_CODE (value
) != INTEGER_CST
))
5848 constructor_simple
= 0;
5850 if (require_constant_value
&& ! TREE_CONSTANT (value
))
5852 error_init ("initializer element is not constant");
5853 value
= error_mark_node
;
5855 else if (require_constant_elements
5856 && initializer_constant_valid_p (value
, TREE_TYPE (value
)) == 0)
5858 error_init ("initializer element is not computable at load time");
5859 value
= error_mark_node
;
5862 /* If this element duplicates one on constructor_pending_elts,
5863 print a message and ignore it. Don't do this when we're
5864 processing elements taken off constructor_pending_elts,
5865 because we'd always get spurious errors. */
5868 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5869 || TREE_CODE (constructor_type
) == UNION_TYPE
5870 || TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5872 if (pending_init_member (field
))
5874 error_init ("duplicate initializer");
5880 /* If this element doesn't come next in sequence,
5881 put it on constructor_pending_elts. */
5882 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5883 && !tree_int_cst_equal (field
, constructor_unfilled_index
))
5886 /* The copy_node is needed in case field is actually
5887 constructor_index, which is modified in place. */
5888 add_pending_init (copy_node (field
),
5889 digest_init (type
, value
, require_constant_value
,
5890 require_constant_elements
));
5892 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
5893 && field
!= constructor_unfilled_fields
)
5895 /* We do this for records but not for unions. In a union,
5896 no matter which field is specified, it can be initialized
5897 right away since it starts at the beginning of the union. */
5899 add_pending_init (field
,
5900 digest_init (type
, value
, require_constant_value
,
5901 require_constant_elements
));
5905 /* Otherwise, output this element either to
5906 constructor_elements or to the assembler file. */
5910 if (! constructor_incremental
)
5912 if (field
&& TREE_CODE (field
) == INTEGER_CST
)
5913 field
= copy_node (field
);
5914 constructor_elements
5915 = tree_cons (field
, digest_init (type
, value
,
5916 require_constant_value
,
5917 require_constant_elements
),
5918 constructor_elements
);
5922 /* Structure elements may require alignment.
5923 Do this, if necessary. */
5924 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
5926 /* Advance to offset of this element. */
5927 if (! tree_int_cst_equal (constructor_bit_index
,
5928 DECL_FIELD_BITPOS (field
)))
5930 /* By using unsigned arithmetic, the result will be
5931 correct even in case of overflows, if BITS_PER_UNIT
5932 is a power of two. */
5933 unsigned next
= (TREE_INT_CST_LOW
5934 (DECL_FIELD_BITPOS (field
))
5935 / (unsigned)BITS_PER_UNIT
);
5936 unsigned here
= (TREE_INT_CST_LOW
5937 (constructor_bit_index
)
5938 / (unsigned)BITS_PER_UNIT
);
5940 assemble_zeros ((next
- here
)
5941 * (unsigned)BITS_PER_UNIT
5942 / (unsigned)BITS_PER_UNIT
);
5945 output_constant (digest_init (type
, value
,
5946 require_constant_value
,
5947 require_constant_elements
),
5948 int_size_in_bytes (type
));
5950 /* For a record or union,
5951 keep track of end position of last field. */
5952 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5953 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5955 tree temp
= size_binop (PLUS_EXPR
, DECL_FIELD_BITPOS (field
),
5957 TREE_INT_CST_LOW (constructor_bit_index
)
5958 = TREE_INT_CST_LOW (temp
);
5959 TREE_INT_CST_HIGH (constructor_bit_index
)
5960 = TREE_INT_CST_HIGH (temp
);
5965 /* Advance the variable that indicates sequential elements output. */
5966 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5968 tree tem
= size_binop (PLUS_EXPR
, constructor_unfilled_index
,
5970 TREE_INT_CST_LOW (constructor_unfilled_index
)
5971 = TREE_INT_CST_LOW (tem
);
5972 TREE_INT_CST_HIGH (constructor_unfilled_index
)
5973 = TREE_INT_CST_HIGH (tem
);
5975 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
5977 constructor_unfilled_fields
=
5978 TREE_CHAIN (constructor_unfilled_fields
);
5979 /* Skip any nameless bit fields. */
5980 while (constructor_unfilled_fields
!= 0
5981 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
5982 && DECL_NAME (constructor_unfilled_fields
) == 0)
5983 constructor_unfilled_fields
=
5984 TREE_CHAIN (constructor_unfilled_fields
);
5986 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
5987 constructor_unfilled_fields
= 0;
5989 /* Now output any pending elements which have become next. */
5991 output_pending_init_elements (0);
5995 /* Output any pending elements which have become next.
5996 As we output elements, constructor_unfilled_{fields,index}
5997 advances, which may cause other elements to become next;
5998 if so, they too are output.
6000 If ALL is 0, we return when there are
6001 no more pending elements to output now.
6003 If ALL is 1, we output space as necessary so that
6004 we can output all the pending elements. */
6007 output_pending_init_elements (all
)
6010 struct init_node
*elt
= constructor_pending_elts
;
6015 /* Look thru the whole pending tree.
6016 If we find an element that should be output now,
6017 output it. Otherwise, set NEXT to the element
6018 that comes first among those still pending. */
6023 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6025 if (tree_int_cst_equal (elt
->purpose
,
6026 constructor_unfilled_index
))
6027 output_init_element (elt
->value
,
6028 TREE_TYPE (constructor_type
),
6029 constructor_unfilled_index
, 0);
6030 else if (tree_int_cst_lt (constructor_unfilled_index
,
6033 /* Advance to the next smaller node. */
6038 /* We have reached the smallest node bigger than the
6039 current unfilled index. Fill the space first. */
6040 next
= elt
->purpose
;
6046 /* Advance to the next bigger node. */
6051 /* We have reached the biggest node in a subtree. Find
6052 the parent of it, which is the next bigger node. */
6053 while (elt
->parent
&& elt
->parent
->right
== elt
)
6056 if (elt
&& tree_int_cst_lt (constructor_unfilled_index
,
6059 next
= elt
->purpose
;
6065 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
6066 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6068 /* If the current record is complete we are done. */
6069 if (constructor_unfilled_fields
== 0)
6071 if (elt
->purpose
== constructor_unfilled_fields
)
6073 output_init_element (elt
->value
,
6074 TREE_TYPE (constructor_unfilled_fields
),
6075 constructor_unfilled_fields
,
6078 else if (tree_int_cst_lt (DECL_FIELD_BITPOS (constructor_unfilled_fields
),
6079 DECL_FIELD_BITPOS (elt
->purpose
)))
6081 /* Advance to the next smaller node. */
6086 /* We have reached the smallest node bigger than the
6087 current unfilled field. Fill the space first. */
6088 next
= elt
->purpose
;
6094 /* Advance to the next bigger node. */
6099 /* We have reached the biggest node in a subtree. Find
6100 the parent of it, which is the next bigger node. */
6101 while (elt
->parent
&& elt
->parent
->right
== elt
)
6105 && tree_int_cst_lt (DECL_FIELD_BITPOS (constructor_unfilled_fields
),
6106 DECL_FIELD_BITPOS (elt
->purpose
)))
6108 next
= elt
->purpose
;
6116 /* Ordinarily return, but not if we want to output all
6117 and there are elements left. */
6118 if (! (all
&& next
!= 0))
6121 /* Generate space up to the position of NEXT. */
6122 if (constructor_incremental
)
6125 tree nextpos_tree
= size_int (0);
6127 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6128 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6131 /* Find the last field written out, if any. */
6132 for (tail
= TYPE_FIELDS (constructor_type
); tail
;
6133 tail
= TREE_CHAIN (tail
))
6134 if (TREE_CHAIN (tail
) == constructor_unfilled_fields
)
6138 /* Find the offset of the end of that field. */
6139 filled
= size_binop (CEIL_DIV_EXPR
,
6140 size_binop (PLUS_EXPR
,
6141 DECL_FIELD_BITPOS (tail
),
6143 size_int (BITS_PER_UNIT
));
6145 filled
= size_int (0);
6147 nextpos_tree
= size_binop (CEIL_DIV_EXPR
,
6148 DECL_FIELD_BITPOS (next
),
6149 size_int (BITS_PER_UNIT
));
6151 TREE_INT_CST_HIGH (constructor_bit_index
)
6152 = TREE_INT_CST_HIGH (DECL_FIELD_BITPOS (next
));
6153 TREE_INT_CST_LOW (constructor_bit_index
)
6154 = TREE_INT_CST_LOW (DECL_FIELD_BITPOS (next
));
6155 constructor_unfilled_fields
= next
;
6157 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6159 filled
= size_binop (MULT_EXPR
, constructor_unfilled_index
,
6160 size_in_bytes (TREE_TYPE (constructor_type
)));
6162 = size_binop (MULT_EXPR
, next
,
6163 size_in_bytes (TREE_TYPE (constructor_type
)));
6164 TREE_INT_CST_LOW (constructor_unfilled_index
)
6165 = TREE_INT_CST_LOW (next
);
6166 TREE_INT_CST_HIGH (constructor_unfilled_index
)
6167 = TREE_INT_CST_HIGH (next
);
6174 int nextpos
= TREE_INT_CST_LOW (nextpos_tree
);
6176 assemble_zeros (nextpos
- TREE_INT_CST_LOW (filled
));
6181 /* If it's not incremental, just skip over the gap,
6182 so that after jumping to retry we will output the next
6183 successive element. */
6184 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6185 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6186 constructor_unfilled_fields
= next
;
6187 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6189 TREE_INT_CST_LOW (constructor_unfilled_index
)
6190 = TREE_INT_CST_LOW (next
);
6191 TREE_INT_CST_HIGH (constructor_unfilled_index
)
6192 = TREE_INT_CST_HIGH (next
);
6196 /* ELT now points to the node in the pending tree with the next
6197 initializer to output. */
6201 /* Add one non-braced element to the current constructor level.
6202 This adjusts the current position within the constructor's type.
6203 This may also start or terminate implicit levels
6204 to handle a partly-braced initializer.
6206 Once this has found the correct level for the new element,
6207 it calls output_init_element.
6209 Note: if we are incrementally outputting this constructor,
6210 this function may be called with a null argument
6211 representing a sub-constructor that was already incrementally output.
6212 When that happens, we output nothing, but we do the bookkeeping
6213 to skip past that element of the current constructor. */
6216 process_init_element (value
)
6219 tree orig_value
= value
;
6220 int string_flag
= value
!= 0 && TREE_CODE (value
) == STRING_CST
;
6222 /* Handle superfluous braces around string cst as in
6223 char x[] = {"foo"}; */
6226 && TREE_CODE (constructor_type
) == ARRAY_TYPE
6227 && TREE_CODE (TREE_TYPE (constructor_type
)) == INTEGER_TYPE
6228 && integer_zerop (constructor_unfilled_index
))
6230 if (constructor_stack
->replacement_value
)
6231 error_init ("excess elements in char array initializer");
6232 constructor_stack
->replacement_value
= value
;
6236 if (constructor_stack
->replacement_value
!= 0)
6238 error_init ("excess elements in struct initializer");
6242 /* Ignore elements of a brace group if it is entirely superfluous
6243 and has already been diagnosed. */
6244 if (constructor_type
== 0)
6247 /* If we've exhausted any levels that didn't have braces,
6249 while (constructor_stack
->implicit
)
6251 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
6252 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6253 && constructor_fields
== 0)
6254 process_init_element (pop_init_level (1));
6255 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
6256 && (constructor_max_index
== 0
6257 || tree_int_cst_lt (constructor_max_index
,
6258 constructor_index
)))
6259 process_init_element (pop_init_level (1));
6266 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
6269 enum tree_code fieldcode
;
6271 if (constructor_fields
== 0)
6273 pedwarn_init ("excess elements in struct initializer");
6277 fieldtype
= TREE_TYPE (constructor_fields
);
6278 if (fieldtype
!= error_mark_node
)
6279 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
6280 fieldcode
= TREE_CODE (fieldtype
);
6282 /* Accept a string constant to initialize a subarray. */
6284 && fieldcode
== ARRAY_TYPE
6285 && TREE_CODE (TREE_TYPE (fieldtype
)) == INTEGER_TYPE
6288 /* Otherwise, if we have come to a subaggregate,
6289 and we don't have an element of its type, push into it. */
6290 else if (value
!= 0 && !constructor_no_implicit
6291 && value
!= error_mark_node
6292 && TYPE_MAIN_VARIANT (TREE_TYPE (value
)) != fieldtype
6293 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
6294 || fieldcode
== UNION_TYPE
))
6296 push_init_level (1);
6302 push_member_name (constructor_fields
);
6303 output_init_element (value
, fieldtype
, constructor_fields
, 1);
6304 RESTORE_SPELLING_DEPTH (constructor_depth
);
6307 /* Do the bookkeeping for an element that was
6308 directly output as a constructor. */
6310 /* For a record, keep track of end position of last field. */
6311 tree temp
= size_binop (PLUS_EXPR
,
6312 DECL_FIELD_BITPOS (constructor_fields
),
6313 DECL_SIZE (constructor_fields
));
6314 TREE_INT_CST_LOW (constructor_bit_index
)
6315 = TREE_INT_CST_LOW (temp
);
6316 TREE_INT_CST_HIGH (constructor_bit_index
)
6317 = TREE_INT_CST_HIGH (temp
);
6319 constructor_unfilled_fields
= TREE_CHAIN (constructor_fields
);
6320 /* Skip any nameless bit fields. */
6321 while (constructor_unfilled_fields
!= 0
6322 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
6323 && DECL_NAME (constructor_unfilled_fields
) == 0)
6324 constructor_unfilled_fields
=
6325 TREE_CHAIN (constructor_unfilled_fields
);
6328 constructor_fields
= TREE_CHAIN (constructor_fields
);
6329 /* Skip any nameless bit fields at the beginning. */
6330 while (constructor_fields
!= 0
6331 && DECL_C_BIT_FIELD (constructor_fields
)
6332 && DECL_NAME (constructor_fields
) == 0)
6333 constructor_fields
= TREE_CHAIN (constructor_fields
);
6336 if (TREE_CODE (constructor_type
) == UNION_TYPE
)
6339 enum tree_code fieldcode
;
6341 if (constructor_fields
== 0)
6343 pedwarn_init ("excess elements in union initializer");
6347 fieldtype
= TREE_TYPE (constructor_fields
);
6348 if (fieldtype
!= error_mark_node
)
6349 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
6350 fieldcode
= TREE_CODE (fieldtype
);
6352 /* Accept a string constant to initialize a subarray. */
6354 && fieldcode
== ARRAY_TYPE
6355 && TREE_CODE (TREE_TYPE (fieldtype
)) == INTEGER_TYPE
6358 /* Otherwise, if we have come to a subaggregate,
6359 and we don't have an element of its type, push into it. */
6360 else if (value
!= 0 && !constructor_no_implicit
6361 && value
!= error_mark_node
6362 && TYPE_MAIN_VARIANT (TREE_TYPE (value
)) != fieldtype
6363 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
6364 || fieldcode
== UNION_TYPE
))
6366 push_init_level (1);
6372 push_member_name (constructor_fields
);
6373 output_init_element (value
, fieldtype
, constructor_fields
, 1);
6374 RESTORE_SPELLING_DEPTH (constructor_depth
);
6377 /* Do the bookkeeping for an element that was
6378 directly output as a constructor. */
6380 TREE_INT_CST_LOW (constructor_bit_index
)
6381 = TREE_INT_CST_LOW (DECL_SIZE (constructor_fields
));
6382 TREE_INT_CST_HIGH (constructor_bit_index
)
6383 = TREE_INT_CST_HIGH (DECL_SIZE (constructor_fields
));
6385 constructor_unfilled_fields
= TREE_CHAIN (constructor_fields
);
6388 constructor_fields
= 0;
6391 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6393 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
6394 enum tree_code eltcode
= TREE_CODE (elttype
);
6396 /* Accept a string constant to initialize a subarray. */
6398 && eltcode
== ARRAY_TYPE
6399 && TREE_CODE (TREE_TYPE (elttype
)) == INTEGER_TYPE
6402 /* Otherwise, if we have come to a subaggregate,
6403 and we don't have an element of its type, push into it. */
6404 else if (value
!= 0 && !constructor_no_implicit
6405 && value
!= error_mark_node
6406 && TYPE_MAIN_VARIANT (TREE_TYPE (value
)) != elttype
6407 && (eltcode
== RECORD_TYPE
|| eltcode
== ARRAY_TYPE
6408 || eltcode
== UNION_TYPE
))
6410 push_init_level (1);
6414 if (constructor_max_index
!= 0
6415 && tree_int_cst_lt (constructor_max_index
, constructor_index
))
6417 pedwarn_init ("excess elements in array initializer");
6421 /* In the case of [LO .. HI] = VALUE, only evaluate VALUE once. */
6422 if (constructor_range_end
)
6424 if (constructor_max_index
!= 0
6425 && tree_int_cst_lt (constructor_max_index
,
6426 constructor_range_end
))
6428 pedwarn_init ("excess elements in array initializer");
6429 TREE_INT_CST_HIGH (constructor_range_end
)
6430 = TREE_INT_CST_HIGH (constructor_max_index
);
6431 TREE_INT_CST_LOW (constructor_range_end
)
6432 = TREE_INT_CST_LOW (constructor_max_index
);
6435 value
= save_expr (value
);
6438 /* Now output the actual element.
6439 Ordinarily, output once.
6440 If there is a range, repeat it till we advance past the range. */
6447 push_array_bounds (TREE_INT_CST_LOW (constructor_index
));
6448 output_init_element (value
, elttype
, constructor_index
, 1);
6449 RESTORE_SPELLING_DEPTH (constructor_depth
);
6452 tem
= size_binop (PLUS_EXPR
, constructor_index
,
6454 TREE_INT_CST_LOW (constructor_index
) = TREE_INT_CST_LOW (tem
);
6455 TREE_INT_CST_HIGH (constructor_index
) = TREE_INT_CST_HIGH (tem
);
6458 /* If we are doing the bookkeeping for an element that was
6459 directly output as a constructor,
6460 we must update constructor_unfilled_index. */
6462 TREE_INT_CST_LOW (constructor_unfilled_index
)
6463 = TREE_INT_CST_LOW (constructor_index
);
6464 TREE_INT_CST_HIGH (constructor_unfilled_index
)
6465 = TREE_INT_CST_HIGH (constructor_index
);
6468 while (! (constructor_range_end
== 0
6469 || tree_int_cst_lt (constructor_range_end
,
6470 constructor_index
)));
6475 /* Handle the sole element allowed in a braced initializer
6476 for a scalar variable. */
6477 if (constructor_fields
== 0)
6479 pedwarn_init ("excess elements in scalar initializer");
6484 output_init_element (value
, constructor_type
, NULL_TREE
, 1);
6485 constructor_fields
= 0;
6489 /* If the (lexically) previous elments are not now saved,
6490 we can discard the storage for them. */
6491 if (constructor_incremental
&& constructor_pending_elts
== 0 && value
!= 0
6492 && constructor_stack
== 0)
6496 /* Expand an ASM statement with operands, handling output operands
6497 that are not variables or INDIRECT_REFS by transforming such
6498 cases into cases that expand_asm_operands can handle.
6500 Arguments are same as for expand_asm_operands. */
6503 c_expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, filename
, line
)
6504 tree string
, outputs
, inputs
, clobbers
;
6509 int noutputs
= list_length (outputs
);
6511 /* o[I] is the place that output number I should be written. */
6512 register tree
*o
= (tree
*) alloca (noutputs
* sizeof (tree
));
6515 if (TREE_CODE (string
) == ADDR_EXPR
)
6516 string
= TREE_OPERAND (string
, 0);
6517 if (TREE_CODE (string
) != STRING_CST
)
6519 error ("asm template is not a string constant");
6523 /* Record the contents of OUTPUTS before it is modified. */
6524 for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
6526 tree output
= TREE_VALUE (tail
);
6528 /* We can remove conversions that just change the type, not the mode. */
6529 STRIP_NOPS (output
);
6532 /* Allow conversions as LHS here. build_modify_expr as called below
6533 will do the right thing with them. */
6534 while (TREE_CODE (output
) == NOP_EXPR
6535 || TREE_CODE (output
) == CONVERT_EXPR
6536 || TREE_CODE (output
) == FLOAT_EXPR
6537 || TREE_CODE (output
) == FIX_TRUNC_EXPR
6538 || TREE_CODE (output
) == FIX_FLOOR_EXPR
6539 || TREE_CODE (output
) == FIX_ROUND_EXPR
6540 || TREE_CODE (output
) == FIX_CEIL_EXPR
)
6541 output
= TREE_OPERAND (output
, 0);
6543 lvalue_or_else (o
[i
], "invalid lvalue in asm statement");
6546 /* Perform default conversions on array and function inputs. */
6547 /* Don't do this for other types--
6548 it would screw up operands expected to be in memory. */
6549 for (i
= 0, tail
= inputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
6550 if (TREE_CODE (TREE_TYPE (TREE_VALUE (tail
))) == ARRAY_TYPE
6551 || TREE_CODE (TREE_TYPE (TREE_VALUE (tail
))) == FUNCTION_TYPE
)
6552 TREE_VALUE (tail
) = default_conversion (TREE_VALUE (tail
));
6554 /* Generate the ASM_OPERANDS insn;
6555 store into the TREE_VALUEs of OUTPUTS some trees for
6556 where the values were actually stored. */
6557 expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, filename
, line
);
6559 /* Copy all the intermediate outputs into the specified outputs. */
6560 for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
6562 if (o
[i
] != TREE_VALUE (tail
))
6564 expand_expr (build_modify_expr (o
[i
], NOP_EXPR
, TREE_VALUE (tail
)),
6565 NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
6568 /* Detect modification of read-only values.
6569 (Otherwise done by build_modify_expr.) */
6572 tree type
= TREE_TYPE (o
[i
]);
6573 if (TREE_READONLY (o
[i
])
6574 || TYPE_READONLY (type
)
6575 || ((TREE_CODE (type
) == RECORD_TYPE
6576 || TREE_CODE (type
) == UNION_TYPE
)
6577 && C_TYPE_FIELDS_READONLY (type
)))
6578 readonly_warning (o
[i
], "modification by `asm'");
6582 /* Those MODIFY_EXPRs could do autoincrements. */
6586 /* Expand a C `return' statement.
6587 RETVAL is the expression for what to return,
6588 or a null pointer for `return;' with no value. */
6591 c_expand_return (retval
)
6594 tree valtype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
6596 if (TREE_THIS_VOLATILE (current_function_decl
))
6597 warning ("function declared `noreturn' has a `return' statement");
6601 current_function_returns_null
= 1;
6602 if (warn_return_type
&& valtype
!= 0 && TREE_CODE (valtype
) != VOID_TYPE
)
6603 warning ("`return' with no value, in function returning non-void");
6604 expand_null_return ();
6606 else if (valtype
== 0 || TREE_CODE (valtype
) == VOID_TYPE
)
6608 current_function_returns_null
= 1;
6609 if (pedantic
|| TREE_CODE (TREE_TYPE (retval
)) != VOID_TYPE
)
6610 pedwarn ("`return' with a value, in function returning void");
6611 expand_return (retval
);
6615 tree t
= convert_for_assignment (valtype
, retval
, _("return"),
6616 NULL_TREE
, NULL_TREE
, 0);
6617 tree res
= DECL_RESULT (current_function_decl
);
6620 if (t
== error_mark_node
)
6623 inner
= t
= convert (TREE_TYPE (res
), t
);
6625 /* Strip any conversions, additions, and subtractions, and see if
6626 we are returning the address of a local variable. Warn if so. */
6629 switch (TREE_CODE (inner
))
6631 case NOP_EXPR
: case NON_LVALUE_EXPR
: case CONVERT_EXPR
:
6633 inner
= TREE_OPERAND (inner
, 0);
6637 /* If the second operand of the MINUS_EXPR has a pointer
6638 type (or is converted from it), this may be valid, so
6639 don't give a warning. */
6641 tree op1
= TREE_OPERAND (inner
, 1);
6643 while (! POINTER_TYPE_P (TREE_TYPE (op1
))
6644 && (TREE_CODE (op1
) == NOP_EXPR
6645 || TREE_CODE (op1
) == NON_LVALUE_EXPR
6646 || TREE_CODE (op1
) == CONVERT_EXPR
))
6647 op1
= TREE_OPERAND (op1
, 0);
6649 if (POINTER_TYPE_P (TREE_TYPE (op1
)))
6652 inner
= TREE_OPERAND (inner
, 0);
6657 inner
= TREE_OPERAND (inner
, 0);
6659 while (TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r')
6660 inner
= TREE_OPERAND (inner
, 0);
6662 if (TREE_CODE (inner
) == VAR_DECL
6663 && ! DECL_EXTERNAL (inner
)
6664 && ! TREE_STATIC (inner
)
6665 && DECL_CONTEXT (inner
) == current_function_decl
)
6666 warning ("function returns address of local variable");
6676 t
= build (MODIFY_EXPR
, TREE_TYPE (res
), res
, t
);
6677 TREE_SIDE_EFFECTS (t
) = 1;
6679 current_function_returns_value
= 1;
6683 /* Start a C switch statement, testing expression EXP.
6684 Return EXP if it is valid, an error node otherwise. */
6687 c_expand_start_case (exp
)
6690 register enum tree_code code
;
6693 if (TREE_CODE (exp
) == ERROR_MARK
)
6696 code
= TREE_CODE (TREE_TYPE (exp
));
6697 type
= TREE_TYPE (exp
);
6699 if (code
!= INTEGER_TYPE
&& code
!= ENUMERAL_TYPE
&& code
!= ERROR_MARK
)
6701 error ("switch quantity not an integer");
6702 exp
= error_mark_node
;
6707 type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
6709 if (warn_traditional
6710 && (type
== long_integer_type_node
6711 || type
== long_unsigned_type_node
))
6712 pedwarn ("`long' switch expression not converted to `int' in ANSI C");
6714 exp
= default_conversion (exp
);
6715 type
= TREE_TYPE (exp
);
6716 index
= get_unwidened (exp
, NULL_TREE
);
6717 /* We can't strip a conversion from a signed type to an unsigned,
6718 because if we did, int_fits_type_p would do the wrong thing
6719 when checking case values for being in range,
6720 and it's too hard to do the right thing. */
6721 if (TREE_UNSIGNED (TREE_TYPE (exp
))
6722 == TREE_UNSIGNED (TREE_TYPE (index
)))
6726 expand_start_case (1, exp
, type
, "switch statement");