1 /* Build expressions with type checking for C compiler.
2 Copyright (C) 1987, 1988, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* This file is part of the C front end.
24 It contains routines to build C expressions given their operands,
25 including computing the types of the result, C-specific error checks,
26 and some optimization.
28 There are also routines to build RETURN_STMT nodes and CASE_STMT nodes,
29 and to process initializations in declarations (since they work
30 like a strange sort of assignment). */
46 /* Nonzero if we've already printed a "missing braces around initializer"
47 message within this initializer. */
48 static int missing_braces_mentioned
;
50 /* 1 if we explained undeclared var errors. */
51 static int undeclared_variable_notice
;
53 static tree qualify_type
PARAMS ((tree
, tree
));
54 static int comp_target_types
PARAMS ((tree
, tree
));
55 static int function_types_compatible_p
PARAMS ((tree
, tree
));
56 static int type_lists_compatible_p
PARAMS ((tree
, tree
));
57 static tree decl_constant_value
PARAMS ((tree
));
58 static tree lookup_field
PARAMS ((tree
, tree
, tree
*));
59 static tree convert_arguments
PARAMS ((tree
, tree
, tree
, tree
));
60 static tree pointer_int_sum
PARAMS ((enum tree_code
, tree
, tree
));
61 static tree pointer_diff
PARAMS ((tree
, tree
));
62 static tree unary_complex_lvalue
PARAMS ((enum tree_code
, tree
));
63 static void pedantic_lvalue_warning
PARAMS ((enum tree_code
));
64 static tree internal_build_compound_expr
PARAMS ((tree
, int));
65 static tree convert_for_assignment
PARAMS ((tree
, tree
, const char *,
67 static void warn_for_assignment
PARAMS ((const char *, const char *,
69 static tree valid_compound_expr_initializer
PARAMS ((tree
, tree
));
70 static void push_string
PARAMS ((const char *));
71 static void push_member_name
PARAMS ((tree
));
72 static void push_array_bounds
PARAMS ((int));
73 static int spelling_length
PARAMS ((void));
74 static char *print_spelling
PARAMS ((char *));
75 static void warning_init
PARAMS ((const char *));
76 static tree digest_init
PARAMS ((tree
, tree
, int, int));
77 static void check_init_type_bitfields
PARAMS ((tree
));
78 static void output_init_element
PARAMS ((tree
, tree
, tree
, int));
79 static void output_pending_init_elements
PARAMS ((int));
80 static void add_pending_init
PARAMS ((tree
, tree
));
81 static int pending_init_member
PARAMS ((tree
));
83 /* Do `exp = require_complete_type (exp);' to make sure exp
84 does not have an incomplete type. (That includes void types.) */
87 require_complete_type (value
)
90 tree type
= TREE_TYPE (value
);
92 if (TREE_CODE (value
) == ERROR_MARK
)
93 return error_mark_node
;
95 /* First, detect a valid value with a complete type. */
96 if (COMPLETE_TYPE_P (type
))
99 incomplete_type_error (value
, type
);
100 return error_mark_node
;
103 /* Print an error message for invalid use of an incomplete type.
104 VALUE is the expression that was used (or 0 if that isn't known)
105 and TYPE is the type that was invalid. */
108 incomplete_type_error (value
, type
)
112 const char *type_code_string
;
114 /* Avoid duplicate error message. */
115 if (TREE_CODE (type
) == ERROR_MARK
)
118 if (value
!= 0 && (TREE_CODE (value
) == VAR_DECL
119 || TREE_CODE (value
) == PARM_DECL
))
120 error ("`%s' has an incomplete type",
121 IDENTIFIER_POINTER (DECL_NAME (value
)));
125 /* We must print an error message. Be clever about what it says. */
127 switch (TREE_CODE (type
))
130 type_code_string
= "struct";
134 type_code_string
= "union";
138 type_code_string
= "enum";
142 error ("invalid use of void expression");
146 if (TYPE_DOMAIN (type
))
148 type
= TREE_TYPE (type
);
151 error ("invalid use of array with unspecified bounds");
158 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
159 error ("invalid use of undefined type `%s %s'",
160 type_code_string
, IDENTIFIER_POINTER (TYPE_NAME (type
)));
162 /* If this type has a typedef-name, the TYPE_NAME is a TYPE_DECL. */
163 error ("invalid use of incomplete typedef `%s'",
164 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
))));
168 /* Return a variant of TYPE which has all the type qualifiers of LIKE
169 as well as those of TYPE. */
172 qualify_type (type
, like
)
175 return c_build_qualified_type (type
,
176 TYPE_QUALS (type
) | TYPE_QUALS (like
));
179 /* Return the common type of two types.
180 We assume that comptypes has already been done and returned 1;
181 if that isn't so, this may crash. In particular, we assume that qualifiers
184 This is the type for the result of most arithmetic operations
185 if the operands have the given two types. */
191 register enum tree_code code1
;
192 register enum tree_code code2
;
195 /* Save time if the two types are the same. */
197 if (t1
== t2
) return t1
;
199 /* If one type is nonsense, use the other. */
200 if (t1
== error_mark_node
)
202 if (t2
== error_mark_node
)
205 /* Merge the attributes. */
206 attributes
= merge_machine_type_attributes (t1
, t2
);
208 /* Treat an enum type as the unsigned integer type of the same width. */
210 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
211 t1
= type_for_size (TYPE_PRECISION (t1
), 1);
212 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
213 t2
= type_for_size (TYPE_PRECISION (t2
), 1);
215 code1
= TREE_CODE (t1
);
216 code2
= TREE_CODE (t2
);
218 /* If one type is complex, form the common type of the non-complex
219 components, then make that complex. Use T1 or T2 if it is the
221 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
223 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
224 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
225 tree subtype
= common_type (subtype1
, subtype2
);
227 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
228 return build_type_attribute_variant (t1
, attributes
);
229 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
230 return build_type_attribute_variant (t2
, attributes
);
232 return build_type_attribute_variant (build_complex_type (subtype
),
240 /* If only one is real, use it as the result. */
242 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
243 return build_type_attribute_variant (t1
, attributes
);
245 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
246 return build_type_attribute_variant (t2
, attributes
);
248 /* Both real or both integers; use the one with greater precision. */
250 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
251 return build_type_attribute_variant (t1
, attributes
);
252 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
253 return build_type_attribute_variant (t2
, attributes
);
255 /* Same precision. Prefer longs to ints even when same size. */
257 if (TYPE_MAIN_VARIANT (t1
) == long_unsigned_type_node
258 || TYPE_MAIN_VARIANT (t2
) == long_unsigned_type_node
)
259 return build_type_attribute_variant (long_unsigned_type_node
,
262 if (TYPE_MAIN_VARIANT (t1
) == long_integer_type_node
263 || TYPE_MAIN_VARIANT (t2
) == long_integer_type_node
)
265 /* But preserve unsignedness from the other type,
266 since long cannot hold all the values of an unsigned int. */
267 if (TREE_UNSIGNED (t1
) || TREE_UNSIGNED (t2
))
268 t1
= long_unsigned_type_node
;
270 t1
= long_integer_type_node
;
271 return build_type_attribute_variant (t1
, attributes
);
274 /* Likewise, prefer long double to double even if same size. */
275 if (TYPE_MAIN_VARIANT (t1
) == long_double_type_node
276 || TYPE_MAIN_VARIANT (t2
) == long_double_type_node
)
277 return build_type_attribute_variant (long_double_type_node
,
280 /* Otherwise prefer the unsigned one. */
282 if (TREE_UNSIGNED (t1
))
283 return build_type_attribute_variant (t1
, attributes
);
285 return build_type_attribute_variant (t2
, attributes
);
288 /* For two pointers, do this recursively on the target type,
289 and combine the qualifiers of the two types' targets. */
290 /* This code was turned off; I don't know why.
291 But ANSI C specifies doing this with the qualifiers.
292 So I turned it on again. */
294 tree pointed_to_1
= TREE_TYPE (t1
);
295 tree pointed_to_2
= TREE_TYPE (t2
);
296 tree target
= common_type (TYPE_MAIN_VARIANT (pointed_to_1
),
297 TYPE_MAIN_VARIANT (pointed_to_2
));
298 t1
= build_pointer_type (c_build_qualified_type
300 TYPE_QUALS (pointed_to_1
) |
301 TYPE_QUALS (pointed_to_2
)));
302 return build_type_attribute_variant (t1
, attributes
);
305 t1
= build_pointer_type (common_type (TREE_TYPE (t1
), TREE_TYPE (t2
)));
306 return build_type_attribute_variant (t1
, attributes
);
311 tree elt
= common_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
312 /* Save space: see if the result is identical to one of the args. */
313 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
314 return build_type_attribute_variant (t1
, attributes
);
315 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
316 return build_type_attribute_variant (t2
, attributes
);
317 /* Merge the element types, and have a size if either arg has one. */
318 t1
= build_array_type (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
319 return build_type_attribute_variant (t1
, attributes
);
323 /* Function types: prefer the one that specified arg types.
324 If both do, merge the arg types. Also merge the return types. */
326 tree valtype
= common_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
327 tree p1
= TYPE_ARG_TYPES (t1
);
328 tree p2
= TYPE_ARG_TYPES (t2
);
333 /* Save space: see if the result is identical to one of the args. */
334 if (valtype
== TREE_TYPE (t1
) && ! TYPE_ARG_TYPES (t2
))
335 return build_type_attribute_variant (t1
, attributes
);
336 if (valtype
== TREE_TYPE (t2
) && ! TYPE_ARG_TYPES (t1
))
337 return build_type_attribute_variant (t2
, attributes
);
339 /* Simple way if one arg fails to specify argument types. */
340 if (TYPE_ARG_TYPES (t1
) == 0)
342 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t2
));
343 return build_type_attribute_variant (t1
, attributes
);
345 if (TYPE_ARG_TYPES (t2
) == 0)
347 t1
= build_function_type (valtype
, TYPE_ARG_TYPES (t1
));
348 return build_type_attribute_variant (t1
, attributes
);
351 /* If both args specify argument types, we must merge the two
352 lists, argument by argument. */
354 len
= list_length (p1
);
357 for (i
= 0; i
< len
; i
++)
358 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
363 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
))
365 /* A null type means arg type is not specified.
366 Take whatever the other function type has. */
367 if (TREE_VALUE (p1
) == 0)
369 TREE_VALUE (n
) = TREE_VALUE (p2
);
372 if (TREE_VALUE (p2
) == 0)
374 TREE_VALUE (n
) = TREE_VALUE (p1
);
378 /* Given wait (union {union wait *u; int *i} *)
379 and wait (union wait *),
380 prefer union wait * as type of parm. */
381 if (TREE_CODE (TREE_VALUE (p1
)) == UNION_TYPE
382 && TREE_VALUE (p1
) != TREE_VALUE (p2
))
385 for (memb
= TYPE_FIELDS (TREE_VALUE (p1
));
386 memb
; memb
= TREE_CHAIN (memb
))
387 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (p2
)))
389 TREE_VALUE (n
) = TREE_VALUE (p2
);
391 pedwarn ("function types not truly compatible in ANSI C");
395 if (TREE_CODE (TREE_VALUE (p2
)) == UNION_TYPE
396 && TREE_VALUE (p2
) != TREE_VALUE (p1
))
399 for (memb
= TYPE_FIELDS (TREE_VALUE (p2
));
400 memb
; memb
= TREE_CHAIN (memb
))
401 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (p1
)))
403 TREE_VALUE (n
) = TREE_VALUE (p1
);
405 pedwarn ("function types not truly compatible in ANSI C");
409 TREE_VALUE (n
) = common_type (TREE_VALUE (p1
), TREE_VALUE (p2
));
413 t1
= build_function_type (valtype
, newargs
);
414 /* ... falls through ... */
418 return build_type_attribute_variant (t1
, attributes
);
423 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
424 or various other operations. Return 2 if they are compatible
425 but a warning may be needed if you use them together. */
428 comptypes (type1
, type2
)
431 register tree t1
= type1
;
432 register tree t2
= type2
;
435 /* Suppress errors caused by previously reported errors. */
437 if (t1
== t2
|| !t1
|| !t2
438 || TREE_CODE (t1
) == ERROR_MARK
|| TREE_CODE (t2
) == ERROR_MARK
)
441 /* If either type is the internal version of sizetype, return the
443 if (TREE_CODE (t1
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t1
)
444 && TYPE_DOMAIN (t1
) != 0)
445 t1
= TYPE_DOMAIN (t1
);
447 if (TREE_CODE (t2
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t2
)
448 && TYPE_DOMAIN (t2
) != 0)
449 t2
= TYPE_DOMAIN (t2
);
451 /* Treat an enum type as the integer type of the same width and
454 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
455 t1
= type_for_size (TYPE_PRECISION (t1
), TREE_UNSIGNED (t1
));
456 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
457 t2
= type_for_size (TYPE_PRECISION (t2
), TREE_UNSIGNED (t2
));
462 /* Different classes of types can't be compatible. */
464 if (TREE_CODE (t1
) != TREE_CODE (t2
)) return 0;
466 /* Qualifiers must match. */
468 if (TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
471 /* Allow for two different type nodes which have essentially the same
472 definition. Note that we already checked for equality of the type
473 qualifiers (just above). */
475 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
478 #ifndef COMP_TYPE_ATTRIBUTES
479 #define COMP_TYPE_ATTRIBUTES(t1,t2) 1
482 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
483 if (! (attrval
= COMP_TYPE_ATTRIBUTES (t1
, t2
)))
486 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
489 switch (TREE_CODE (t1
))
492 val
= (TREE_TYPE (t1
) == TREE_TYPE (t2
)
493 ? 1 : comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
)));
497 val
= function_types_compatible_p (t1
, t2
);
502 tree d1
= TYPE_DOMAIN (t1
);
503 tree d2
= TYPE_DOMAIN (t2
);
506 /* Target types must match incl. qualifiers. */
507 if (TREE_TYPE (t1
) != TREE_TYPE (t2
)
508 && 0 == (val
= comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
))))
511 /* Sizes must match unless one is missing or variable. */
512 if (d1
== 0 || d2
== 0 || d1
== d2
513 || TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
514 || TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
515 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
516 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
)
519 if (! tree_int_cst_equal (TYPE_MIN_VALUE (d1
), TYPE_MIN_VALUE (d2
))
520 || ! tree_int_cst_equal (TYPE_MAX_VALUE (d1
), TYPE_MAX_VALUE (d2
)))
527 if (maybe_objc_comptypes (t1
, t2
, 0) == 1)
534 return attrval
== 2 && val
== 1 ? 2 : val
;
537 /* Return 1 if TTL and TTR are pointers to types that are equivalent,
538 ignoring their qualifiers. */
541 comp_target_types (ttl
, ttr
)
546 /* Give maybe_objc_comptypes a crack at letting these types through. */
547 if ((val
= maybe_objc_comptypes (ttl
, ttr
, 1)) >= 0)
550 val
= comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (ttl
)),
551 TYPE_MAIN_VARIANT (TREE_TYPE (ttr
)));
553 if (val
== 2 && pedantic
)
554 pedwarn ("types are not quite compatible");
558 /* Subroutines of `comptypes'. */
560 /* Return 1 if two function types F1 and F2 are compatible.
561 If either type specifies no argument types,
562 the other must specify a fixed number of self-promoting arg types.
563 Otherwise, if one type specifies only the number of arguments,
564 the other must specify that number of self-promoting arg types.
565 Otherwise, the argument types must match. */
568 function_types_compatible_p (f1
, f2
)
572 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
576 if (!(TREE_TYPE (f1
) == TREE_TYPE (f2
)
577 || (val
= comptypes (TREE_TYPE (f1
), TREE_TYPE (f2
)))))
580 args1
= TYPE_ARG_TYPES (f1
);
581 args2
= TYPE_ARG_TYPES (f2
);
583 /* An unspecified parmlist matches any specified parmlist
584 whose argument types don't need default promotions. */
588 if (!self_promoting_args_p (args2
))
590 /* If one of these types comes from a non-prototype fn definition,
591 compare that with the other type's arglist.
592 If they don't match, ask for a warning (but no error). */
593 if (TYPE_ACTUAL_ARG_TYPES (f1
)
594 && 1 != type_lists_compatible_p (args2
, TYPE_ACTUAL_ARG_TYPES (f1
)))
600 if (!self_promoting_args_p (args1
))
602 if (TYPE_ACTUAL_ARG_TYPES (f2
)
603 && 1 != type_lists_compatible_p (args1
, TYPE_ACTUAL_ARG_TYPES (f2
)))
608 /* Both types have argument lists: compare them and propagate results. */
609 val1
= type_lists_compatible_p (args1
, args2
);
610 return val1
!= 1 ? val1
: val
;
613 /* Check two lists of types for compatibility,
614 returning 0 for incompatible, 1 for compatible,
615 or 2 for compatible with warning. */
618 type_lists_compatible_p (args1
, args2
)
621 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
627 if (args1
== 0 && args2
== 0)
629 /* If one list is shorter than the other,
630 they fail to match. */
631 if (args1
== 0 || args2
== 0)
633 /* A null pointer instead of a type
634 means there is supposed to be an argument
635 but nothing is specified about what type it has.
636 So match anything that self-promotes. */
637 if (TREE_VALUE (args1
) == 0)
639 if (simple_type_promotes_to (TREE_VALUE (args2
)) != NULL_TREE
)
642 else if (TREE_VALUE (args2
) == 0)
644 if (simple_type_promotes_to (TREE_VALUE (args1
)) != NULL_TREE
)
647 else if (! (newval
= comptypes (TREE_VALUE (args1
), TREE_VALUE (args2
))))
649 /* Allow wait (union {union wait *u; int *i} *)
650 and wait (union wait *) to be compatible. */
651 if (TREE_CODE (TREE_VALUE (args1
)) == UNION_TYPE
652 && (TYPE_NAME (TREE_VALUE (args1
)) == 0
653 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args1
)))
654 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args1
))) == INTEGER_CST
655 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args1
)),
656 TYPE_SIZE (TREE_VALUE (args2
))))
659 for (memb
= TYPE_FIELDS (TREE_VALUE (args1
));
660 memb
; memb
= TREE_CHAIN (memb
))
661 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (args2
)))
666 else if (TREE_CODE (TREE_VALUE (args2
)) == UNION_TYPE
667 && (TYPE_NAME (TREE_VALUE (args2
)) == 0
668 || TYPE_TRANSPARENT_UNION (TREE_VALUE (args2
)))
669 && TREE_CODE (TYPE_SIZE (TREE_VALUE (args2
))) == INTEGER_CST
670 && tree_int_cst_equal (TYPE_SIZE (TREE_VALUE (args2
)),
671 TYPE_SIZE (TREE_VALUE (args1
))))
674 for (memb
= TYPE_FIELDS (TREE_VALUE (args2
));
675 memb
; memb
= TREE_CHAIN (memb
))
676 if (comptypes (TREE_TYPE (memb
), TREE_VALUE (args1
)))
685 /* comptypes said ok, but record if it said to warn. */
689 args1
= TREE_CHAIN (args1
);
690 args2
= TREE_CHAIN (args2
);
694 /* Compute the value of the `sizeof' operator. */
700 enum tree_code code
= TREE_CODE (type
);
702 if (code
== FUNCTION_TYPE
)
704 if (pedantic
|| warn_pointer_arith
)
705 pedwarn ("sizeof applied to a function type");
706 return size_one_node
;
708 if (code
== VOID_TYPE
)
710 if (pedantic
|| warn_pointer_arith
)
711 pedwarn ("sizeof applied to a void type");
712 return size_one_node
;
715 if (code
== ERROR_MARK
)
716 return size_one_node
;
718 if (!COMPLETE_TYPE_P (type
))
720 error ("sizeof applied to an incomplete type");
721 return size_zero_node
;
724 /* Convert in case a char is more than one unit. */
725 return size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
726 size_int (TYPE_PRECISION (char_type_node
)
731 c_sizeof_nowarn (type
)
734 enum tree_code code
= TREE_CODE (type
);
736 if (code
== FUNCTION_TYPE
|| code
== VOID_TYPE
|| code
== ERROR_MARK
)
737 return size_one_node
;
739 if (!COMPLETE_TYPE_P (type
))
740 return size_zero_node
;
742 /* Convert in case a char is more than one unit. */
743 return size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
744 size_int (TYPE_PRECISION (char_type_node
)
748 /* Compute the size to increment a pointer by. */
751 c_size_in_bytes (type
)
754 enum tree_code code
= TREE_CODE (type
);
756 if (code
== FUNCTION_TYPE
|| code
== VOID_TYPE
|| code
== ERROR_MARK
)
757 return size_one_node
;
759 if (!COMPLETE_OR_VOID_TYPE_P (type
))
761 error ("arithmetic on pointer to an incomplete type");
762 return size_one_node
;
765 /* Convert in case a char is more than one unit. */
766 return size_binop (CEIL_DIV_EXPR
, TYPE_SIZE_UNIT (type
),
767 size_int (TYPE_PRECISION (char_type_node
)
771 /* Implement the __alignof keyword: Return the minimum required
772 alignment of TYPE, measured in bytes. */
778 enum tree_code code
= TREE_CODE (type
);
780 if (code
== FUNCTION_TYPE
)
781 return size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
783 if (code
== VOID_TYPE
|| code
== ERROR_MARK
)
784 return size_one_node
;
786 if (!COMPLETE_TYPE_P (type
))
788 error ("__alignof__ applied to an incomplete type");
789 return size_zero_node
;
792 return size_int (TYPE_ALIGN (type
) / BITS_PER_UNIT
);
795 /* Implement the __alignof keyword: Return the minimum required
796 alignment of EXPR, measured in bytes. For VAR_DECL's and
797 FIELD_DECL's return DECL_ALIGN (which can be set from an
798 "aligned" __attribute__ specification). */
801 c_alignof_expr (expr
)
804 if (TREE_CODE (expr
) == VAR_DECL
)
805 return size_int (DECL_ALIGN (expr
) / BITS_PER_UNIT
);
807 if (TREE_CODE (expr
) == COMPONENT_REF
808 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
810 error ("`__alignof' applied to a bit-field");
811 return size_one_node
;
813 else if (TREE_CODE (expr
) == COMPONENT_REF
814 && TREE_CODE (TREE_OPERAND (expr
, 1)) == FIELD_DECL
)
815 return size_int (DECL_ALIGN (TREE_OPERAND (expr
, 1)) / BITS_PER_UNIT
);
817 if (TREE_CODE (expr
) == INDIRECT_REF
)
819 tree t
= TREE_OPERAND (expr
, 0);
821 int bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
823 while (TREE_CODE (t
) == NOP_EXPR
824 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
828 t
= TREE_OPERAND (t
, 0);
829 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
830 if (thisalign
> bestalign
)
831 best
= t
, bestalign
= thisalign
;
833 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
836 return c_alignof (TREE_TYPE (expr
));
839 /* Return either DECL or its known constant value (if it has one). */
842 decl_constant_value (decl
)
845 if (/* Don't change a variable array bound or initial value to a constant
846 in a place where a variable is invalid. */
847 current_function_decl
!= 0
849 && ! TREE_THIS_VOLATILE (decl
)
850 && TREE_READONLY (decl
) && ! ITERATOR_P (decl
)
851 && DECL_INITIAL (decl
) != 0
852 && TREE_CODE (DECL_INITIAL (decl
)) != ERROR_MARK
853 /* This is invalid if initial value is not constant.
854 If it has either a function call, a memory reference,
855 or a variable, then re-evaluating it could give different results. */
856 && TREE_CONSTANT (DECL_INITIAL (decl
))
857 /* Check for cases where this is sub-optimal, even though valid. */
858 && TREE_CODE (DECL_INITIAL (decl
)) != CONSTRUCTOR
859 && DECL_MODE (decl
) != BLKmode
)
860 return DECL_INITIAL (decl
);
864 /* Perform default promotions for C data used in expressions.
865 Arrays and functions are converted to pointers;
866 enumeral types or short or char, to int.
867 In addition, manifest constants symbols are replaced by their values. */
870 default_conversion (exp
)
873 register tree type
= TREE_TYPE (exp
);
874 register enum tree_code code
= TREE_CODE (type
);
876 /* Constants can be used directly unless they're not loadable. */
877 if (TREE_CODE (exp
) == CONST_DECL
)
878 exp
= DECL_INITIAL (exp
);
880 /* Replace a nonvolatile const static variable with its value unless
881 it is an array, in which case we must be sure that taking the
882 address of the array produces consistent results. */
883 else if (optimize
&& TREE_CODE (exp
) == VAR_DECL
&& code
!= ARRAY_TYPE
)
885 exp
= decl_constant_value (exp
);
886 type
= TREE_TYPE (exp
);
889 /* Strip NON_LVALUE_EXPRs and no-op conversions, since we aren't using as
892 Do not use STRIP_NOPS here! It will remove conversions from pointer
893 to integer and cause infinite recursion. */
894 while (TREE_CODE (exp
) == NON_LVALUE_EXPR
895 || (TREE_CODE (exp
) == NOP_EXPR
896 && TREE_TYPE (TREE_OPERAND (exp
, 0)) == TREE_TYPE (exp
)))
897 exp
= TREE_OPERAND (exp
, 0);
899 /* Normally convert enums to int,
900 but convert wide enums to something wider. */
901 if (code
== ENUMERAL_TYPE
)
903 type
= type_for_size (MAX (TYPE_PRECISION (type
),
904 TYPE_PRECISION (integer_type_node
)),
906 || (TYPE_PRECISION (type
)
907 >= TYPE_PRECISION (integer_type_node
)))
908 && TREE_UNSIGNED (type
)));
910 return convert (type
, exp
);
913 if (TREE_CODE (exp
) == COMPONENT_REF
914 && DECL_C_BIT_FIELD (TREE_OPERAND (exp
, 1))
915 /* If it's thinner than an int, promote it like a
916 C_PROMOTING_INTEGER_TYPE_P, otherwise leave it alone. */
917 && 0 > compare_tree_int (DECL_SIZE (TREE_OPERAND (exp
, 1)),
918 TYPE_PRECISION (integer_type_node
)))
919 return convert (flag_traditional
&& TREE_UNSIGNED (type
)
920 ? unsigned_type_node
: integer_type_node
,
923 if (C_PROMOTING_INTEGER_TYPE_P (type
))
925 /* Traditionally, unsignedness is preserved in default promotions.
926 Also preserve unsignedness if not really getting any wider. */
927 if (TREE_UNSIGNED (type
)
929 || TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
)))
930 return convert (unsigned_type_node
, exp
);
932 return convert (integer_type_node
, exp
);
935 if (flag_traditional
&& !flag_allow_single_precision
936 && TYPE_MAIN_VARIANT (type
) == float_type_node
)
937 return convert (double_type_node
, exp
);
939 if (code
== VOID_TYPE
)
941 error ("void value not ignored as it ought to be");
942 return error_mark_node
;
944 if (code
== FUNCTION_TYPE
)
946 return build_unary_op (ADDR_EXPR
, exp
, 0);
948 if (code
== ARRAY_TYPE
)
951 tree restype
= TREE_TYPE (type
);
956 if (TREE_CODE_CLASS (TREE_CODE (exp
)) == 'r' || DECL_P (exp
))
958 constp
= TREE_READONLY (exp
);
959 volatilep
= TREE_THIS_VOLATILE (exp
);
962 if (TYPE_QUALS (type
) || constp
|| volatilep
)
964 = c_build_qualified_type (restype
,
966 | (constp
* TYPE_QUAL_CONST
)
967 | (volatilep
* TYPE_QUAL_VOLATILE
));
969 if (TREE_CODE (exp
) == INDIRECT_REF
)
970 return convert (TYPE_POINTER_TO (restype
),
971 TREE_OPERAND (exp
, 0));
973 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
975 tree op1
= default_conversion (TREE_OPERAND (exp
, 1));
976 return build (COMPOUND_EXPR
, TREE_TYPE (op1
),
977 TREE_OPERAND (exp
, 0), op1
);
981 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
983 error ("invalid use of non-lvalue array");
984 return error_mark_node
;
987 ptrtype
= build_pointer_type (restype
);
989 if (TREE_CODE (exp
) == VAR_DECL
)
991 /* ??? This is not really quite correct
992 in that the type of the operand of ADDR_EXPR
993 is not the target type of the type of the ADDR_EXPR itself.
994 Question is, can this lossage be avoided? */
995 adr
= build1 (ADDR_EXPR
, ptrtype
, exp
);
996 if (mark_addressable (exp
) == 0)
997 return error_mark_node
;
998 TREE_CONSTANT (adr
) = staticp (exp
);
999 TREE_SIDE_EFFECTS (adr
) = 0; /* Default would be, same as EXP. */
1002 /* This way is better for a COMPONENT_REF since it can
1003 simplify the offset for a component. */
1004 adr
= build_unary_op (ADDR_EXPR
, exp
, 1);
1005 return convert (ptrtype
, adr
);
1010 /* Look up component name in the structure type definition.
1012 If this component name is found indirectly within an anonymous union,
1013 store in *INDIRECT the component which directly contains
1014 that anonymous union. Otherwise, set *INDIRECT to 0. */
1017 lookup_field (type
, component
, indirect
)
1018 tree type
, component
;
1023 /* If TYPE_LANG_SPECIFIC is set, then it is a sorted array of pointers
1024 to the field elements. Use a binary search on this array to quickly
1025 find the element. Otherwise, do a linear search. TYPE_LANG_SPECIFIC
1026 will always be set for structures which have many elements. */
1028 if (TYPE_LANG_SPECIFIC (type
))
1031 tree
*field_array
= &TYPE_LANG_SPECIFIC (type
)->elts
[0];
1033 field
= TYPE_FIELDS (type
);
1035 top
= TYPE_LANG_SPECIFIC (type
)->len
;
1036 while (top
- bot
> 1)
1038 half
= (top
- bot
+ 1) >> 1;
1039 field
= field_array
[bot
+half
];
1041 if (DECL_NAME (field
) == NULL_TREE
)
1043 /* Step through all anon unions in linear fashion. */
1044 while (DECL_NAME (field_array
[bot
]) == NULL_TREE
)
1046 tree anon
= 0, junk
;
1048 field
= field_array
[bot
++];
1049 if (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
1050 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
1051 anon
= lookup_field (TREE_TYPE (field
), component
, &junk
);
1053 if (anon
!= NULL_TREE
)
1060 /* Entire record is only anon unions. */
1064 /* Restart the binary search, with new lower bound. */
1068 if (DECL_NAME (field
) == component
)
1070 if (DECL_NAME (field
) < component
)
1076 if (DECL_NAME (field_array
[bot
]) == component
)
1077 field
= field_array
[bot
];
1078 else if (DECL_NAME (field
) != component
)
1083 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
1085 if (DECL_NAME (field
) == NULL_TREE
)
1090 if (TREE_CODE (TREE_TYPE (field
)) == RECORD_TYPE
1091 || TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
1092 anon
= lookup_field (TREE_TYPE (field
), component
, &junk
);
1094 if (anon
!= NULL_TREE
)
1101 if (DECL_NAME (field
) == component
)
1106 *indirect
= NULL_TREE
;
1110 /* Make an expression to refer to the COMPONENT field of
1111 structure or union value DATUM. COMPONENT is an IDENTIFIER_NODE. */
1114 build_component_ref (datum
, component
)
1115 tree datum
, component
;
1117 register tree type
= TREE_TYPE (datum
);
1118 register enum tree_code code
= TREE_CODE (type
);
1119 register tree field
= NULL
;
1122 /* If DATUM is a COMPOUND_EXPR or COND_EXPR, move our reference inside it
1123 unless we are not to support things not strictly ANSI. */
1124 switch (TREE_CODE (datum
))
1128 tree value
= build_component_ref (TREE_OPERAND (datum
, 1), component
);
1129 return build (COMPOUND_EXPR
, TREE_TYPE (value
),
1130 TREE_OPERAND (datum
, 0), value
);
1133 return build_conditional_expr
1134 (TREE_OPERAND (datum
, 0),
1135 build_component_ref (TREE_OPERAND (datum
, 1), component
),
1136 build_component_ref (TREE_OPERAND (datum
, 2), component
));
1142 /* See if there is a field or component with name COMPONENT. */
1144 if (code
== RECORD_TYPE
|| code
== UNION_TYPE
)
1148 if (!COMPLETE_TYPE_P (type
))
1150 incomplete_type_error (NULL_TREE
, type
);
1151 return error_mark_node
;
1154 field
= lookup_field (type
, component
, &indirect
);
1158 error ("%s has no member named `%s'",
1159 code
== RECORD_TYPE
? "structure" : "union",
1160 IDENTIFIER_POINTER (component
));
1161 return error_mark_node
;
1163 if (TREE_TYPE (field
) == error_mark_node
)
1164 return error_mark_node
;
1166 /* If FIELD was found buried within an anonymous union,
1167 make one COMPONENT_REF to get that anonymous union,
1168 then fall thru to make a second COMPONENT_REF to get FIELD. */
1171 ref
= build (COMPONENT_REF
, TREE_TYPE (indirect
), datum
, indirect
);
1172 if (TREE_READONLY (datum
) || TREE_READONLY (indirect
))
1173 TREE_READONLY (ref
) = 1;
1174 if (TREE_THIS_VOLATILE (datum
) || TREE_THIS_VOLATILE (indirect
))
1175 TREE_THIS_VOLATILE (ref
) = 1;
1179 ref
= build (COMPONENT_REF
, TREE_TYPE (field
), datum
, field
);
1181 if (TREE_READONLY (datum
) || TREE_READONLY (field
))
1182 TREE_READONLY (ref
) = 1;
1183 if (TREE_THIS_VOLATILE (datum
) || TREE_THIS_VOLATILE (field
))
1184 TREE_THIS_VOLATILE (ref
) = 1;
1188 else if (code
!= ERROR_MARK
)
1189 error ("request for member `%s' in something not a structure or union",
1190 IDENTIFIER_POINTER (component
));
1192 return error_mark_node
;
1195 /* Given an expression PTR for a pointer, return an expression
1196 for the value pointed to.
1197 ERRORSTRING is the name of the operator to appear in error messages. */
1200 build_indirect_ref (ptr
, errorstring
)
1202 const char *errorstring
;
1204 register tree pointer
= default_conversion (ptr
);
1205 register tree type
= TREE_TYPE (pointer
);
1207 if (TREE_CODE (type
) == POINTER_TYPE
)
1209 if (TREE_CODE (pointer
) == ADDR_EXPR
1211 && (TREE_TYPE (TREE_OPERAND (pointer
, 0))
1212 == TREE_TYPE (type
)))
1213 return TREE_OPERAND (pointer
, 0);
1216 tree t
= TREE_TYPE (type
);
1217 register tree ref
= build1 (INDIRECT_REF
,
1218 TYPE_MAIN_VARIANT (t
), pointer
);
1220 if (!COMPLETE_TYPE_P (t
) && TREE_CODE (t
) != ARRAY_TYPE
)
1222 error ("dereferencing pointer to incomplete type");
1223 return error_mark_node
;
1225 if (TREE_CODE (t
) == VOID_TYPE
&& skip_evaluation
== 0)
1226 warning ("dereferencing `void *' pointer");
1228 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
1229 so that we get the proper error message if the result is used
1230 to assign to. Also, &* is supposed to be a no-op.
1231 And ANSI C seems to specify that the type of the result
1232 should be the const type. */
1233 /* A de-reference of a pointer to const is not a const. It is valid
1234 to change it via some other pointer. */
1235 TREE_READONLY (ref
) = TYPE_READONLY (t
);
1236 TREE_SIDE_EFFECTS (ref
)
1237 = TYPE_VOLATILE (t
) || TREE_SIDE_EFFECTS (pointer
) || flag_volatile
;
1238 TREE_THIS_VOLATILE (ref
) = TYPE_VOLATILE (t
);
1242 else if (TREE_CODE (pointer
) != ERROR_MARK
)
1243 error ("invalid type argument of `%s'", errorstring
);
1244 return error_mark_node
;
1247 /* This handles expressions of the form "a[i]", which denotes
1250 This is logically equivalent in C to *(a+i), but we may do it differently.
1251 If A is a variable or a member, we generate a primitive ARRAY_REF.
1252 This avoids forcing the array out of registers, and can work on
1253 arrays that are not lvalues (for example, members of structures returned
1257 build_array_ref (array
, index
)
1262 error ("subscript missing in array reference");
1263 return error_mark_node
;
1266 if (TREE_TYPE (array
) == error_mark_node
1267 || TREE_TYPE (index
) == error_mark_node
)
1268 return error_mark_node
;
1270 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
1271 && TREE_CODE (array
) != INDIRECT_REF
)
1275 /* Subscripting with type char is likely to lose
1276 on a machine where chars are signed.
1277 So warn on any machine, but optionally.
1278 Don't warn for unsigned char since that type is safe.
1279 Don't warn for signed char because anyone who uses that
1280 must have done so deliberately. */
1281 if (warn_char_subscripts
1282 && TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
)
1283 warning ("array subscript has type `char'");
1285 /* Apply default promotions *after* noticing character types. */
1286 index
= default_conversion (index
);
1288 /* Require integer *after* promotion, for sake of enums. */
1289 if (TREE_CODE (TREE_TYPE (index
)) != INTEGER_TYPE
)
1291 error ("array subscript is not an integer");
1292 return error_mark_node
;
1295 /* An array that is indexed by a non-constant
1296 cannot be stored in a register; we must be able to do
1297 address arithmetic on its address.
1298 Likewise an array of elements of variable size. */
1299 if (TREE_CODE (index
) != INTEGER_CST
1300 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
1301 && TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
)))) != INTEGER_CST
))
1303 if (mark_addressable (array
) == 0)
1304 return error_mark_node
;
1306 /* An array that is indexed by a constant value which is not within
1307 the array bounds cannot be stored in a register either; because we
1308 would get a crash in store_bit_field/extract_bit_field when trying
1309 to access a non-existent part of the register. */
1310 if (TREE_CODE (index
) == INTEGER_CST
1311 && TYPE_VALUES (TREE_TYPE (array
))
1312 && ! int_fits_type_p (index
, TYPE_VALUES (TREE_TYPE (array
))))
1314 if (mark_addressable (array
) == 0)
1315 return error_mark_node
;
1318 if (pedantic
&& !lvalue_p (array
))
1320 if (DECL_REGISTER (array
))
1321 pedwarn ("ANSI C forbids subscripting `register' array");
1323 pedwarn ("ANSI C forbids subscripting non-lvalue array");
1329 while (TREE_CODE (foo
) == COMPONENT_REF
)
1330 foo
= TREE_OPERAND (foo
, 0);
1331 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
))
1332 pedwarn ("ANSI C forbids subscripting non-lvalue array");
1335 type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array
)));
1336 rval
= build (ARRAY_REF
, type
, array
, index
);
1337 /* Array ref is const/volatile if the array elements are
1338 or if the array is. */
1339 TREE_READONLY (rval
)
1340 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array
)))
1341 | TREE_READONLY (array
));
1342 TREE_SIDE_EFFECTS (rval
)
1343 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
1344 | TREE_SIDE_EFFECTS (array
));
1345 TREE_THIS_VOLATILE (rval
)
1346 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
1347 /* This was added by rms on 16 Nov 91.
1348 It fixes vol struct foo *a; a->elts[1]
1349 in an inline function.
1350 Hope it doesn't break something else. */
1351 | TREE_THIS_VOLATILE (array
));
1352 return require_complete_type (fold (rval
));
1356 tree ar
= default_conversion (array
);
1357 tree ind
= default_conversion (index
);
1359 /* Do the same warning check as above, but only on the part that's
1360 syntactically the index and only if it is also semantically
1362 if (warn_char_subscripts
1363 && TREE_CODE (TREE_TYPE (index
)) == INTEGER_TYPE
1364 && TYPE_MAIN_VARIANT (TREE_TYPE (index
)) == char_type_node
)
1365 warning ("subscript has type `char'");
1367 /* Put the integer in IND to simplify error checking. */
1368 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
1375 if (ar
== error_mark_node
)
1378 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
1379 || TREE_CODE (TREE_TYPE (TREE_TYPE (ar
))) == FUNCTION_TYPE
)
1381 error ("subscripted value is neither array nor pointer");
1382 return error_mark_node
;
1384 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
1386 error ("array subscript is not an integer");
1387 return error_mark_node
;
1390 return build_indirect_ref (build_binary_op (PLUS_EXPR
, ar
, ind
, 0),
1395 /* Build an external reference to identifier ID. FUN indicates
1396 whether this will be used for a function call. */
1398 build_external_ref (id
, fun
)
1403 tree decl
= lookup_name (id
);
1404 tree objc_ivar
= lookup_objc_ivar (id
);
1406 if (!decl
|| decl
== error_mark_node
|| C_DECL_ANTICIPATED (decl
))
1412 if (!decl
|| decl
== error_mark_node
)
1413 /* Ordinary implicit function declaration. */
1414 ref
= implicitly_declare (id
);
1417 /* Implicit declaration of built-in function. Don't
1418 change the built-in declaration, but don't let this
1419 go by silently, either. */
1420 pedwarn ("implicit declaration of function `%s'",
1421 IDENTIFIER_POINTER (DECL_NAME (decl
)));
1422 C_DECL_ANTICIPATED (decl
) = 0; /* only issue this warning once */
1428 /* Reference to undeclared variable, including reference to
1429 builtin outside of function-call context. */
1430 if (current_function_decl
== 0)
1431 error ("`%s' undeclared here (not in a function)",
1432 IDENTIFIER_POINTER (id
));
1435 if (IDENTIFIER_GLOBAL_VALUE (id
) != error_mark_node
1436 || IDENTIFIER_ERROR_LOCUS (id
) != current_function_decl
)
1438 error ("`%s' undeclared (first use in this function)",
1439 IDENTIFIER_POINTER (id
));
1441 if (! undeclared_variable_notice
)
1443 error ("(Each undeclared identifier is reported only once");
1444 error ("for each function it appears in.)");
1445 undeclared_variable_notice
= 1;
1448 IDENTIFIER_GLOBAL_VALUE (id
) = error_mark_node
;
1449 IDENTIFIER_ERROR_LOCUS (id
) = current_function_decl
;
1451 return error_mark_node
;
1456 /* Properly declared variable or function reference. */
1459 else if (decl
!= objc_ivar
&& IDENTIFIER_LOCAL_VALUE (id
))
1461 warning ("local declaration of `%s' hides instance variable",
1462 IDENTIFIER_POINTER (id
));
1469 if (TREE_TYPE (ref
) == error_mark_node
)
1470 return error_mark_node
;
1472 assemble_external (ref
);
1473 TREE_USED (ref
) = 1;
1475 if (TREE_CODE (ref
) == CONST_DECL
)
1477 ref
= DECL_INITIAL (ref
);
1478 TREE_CONSTANT (ref
) = 1;
1484 /* Build a function call to function FUNCTION with parameters PARAMS.
1485 PARAMS is a list--a chain of TREE_LIST nodes--in which the
1486 TREE_VALUE of each node is a parameter-expression.
1487 FUNCTION's data type may be a function type or a pointer-to-function. */
1490 build_function_call (function
, params
)
1491 tree function
, params
;
1493 register tree fntype
, fundecl
= 0;
1494 register tree coerced_params
;
1495 tree name
= NULL_TREE
, assembler_name
= NULL_TREE
, result
;
1497 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1498 STRIP_TYPE_NOPS (function
);
1500 /* Convert anything with function type to a pointer-to-function. */
1501 if (TREE_CODE (function
) == FUNCTION_DECL
)
1503 name
= DECL_NAME (function
);
1504 assembler_name
= DECL_ASSEMBLER_NAME (function
);
1506 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
1507 (because calling an inline function does not mean the function
1508 needs to be separately compiled). */
1509 fntype
= build_type_variant (TREE_TYPE (function
),
1510 TREE_READONLY (function
),
1511 TREE_THIS_VOLATILE (function
));
1513 function
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), function
);
1516 function
= default_conversion (function
);
1518 fntype
= TREE_TYPE (function
);
1520 if (TREE_CODE (fntype
) == ERROR_MARK
)
1521 return error_mark_node
;
1523 if (!(TREE_CODE (fntype
) == POINTER_TYPE
1524 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
))
1526 error ("called object is not a function");
1527 return error_mark_node
;
1530 /* fntype now gets the type of function pointed to. */
1531 fntype
= TREE_TYPE (fntype
);
1533 /* Convert the parameters to the types declared in the
1534 function prototype, or apply default promotions. */
1537 = convert_arguments (TYPE_ARG_TYPES (fntype
), params
, name
, fundecl
);
1539 /* Check for errors in format strings. */
1541 if (warn_format
&& (name
|| assembler_name
))
1542 check_function_format (name
, assembler_name
, coerced_params
);
1544 /* Recognize certain built-in functions so we can make tree-codes
1545 other than CALL_EXPR. We do this when it enables fold-const.c
1546 to do something useful. */
1548 if (TREE_CODE (function
) == ADDR_EXPR
1549 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
1550 && DECL_BUILT_IN (TREE_OPERAND (function
, 0)))
1552 result
= expand_tree_builtin (TREE_OPERAND (function
, 0),
1553 params
, coerced_params
);
1558 result
= build (CALL_EXPR
, TREE_TYPE (fntype
),
1559 function
, coerced_params
, NULL_TREE
);
1561 TREE_SIDE_EFFECTS (result
) = 1;
1562 if (VOID_TYPE_P (TREE_TYPE (result
)))
1564 return require_complete_type (result
);
1567 /* Convert the argument expressions in the list VALUES
1568 to the types in the list TYPELIST. The result is a list of converted
1569 argument expressions.
1571 If TYPELIST is exhausted, or when an element has NULL as its type,
1572 perform the default conversions.
1574 PARMLIST is the chain of parm decls for the function being called.
1575 It may be 0, if that info is not available.
1576 It is used only for generating error messages.
1578 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
1580 This is also where warnings about wrong number of args are generated.
1582 Both VALUES and the returned value are chains of TREE_LIST nodes
1583 with the elements of the list in the TREE_VALUE slots of those nodes. */
1586 convert_arguments (typelist
, values
, name
, fundecl
)
1587 tree typelist
, values
, name
, fundecl
;
1589 register tree typetail
, valtail
;
1590 register tree result
= NULL
;
1593 /* Scan the given expressions and types, producing individual
1594 converted arguments and pushing them on RESULT in reverse order. */
1596 for (valtail
= values
, typetail
= typelist
, parmnum
= 0;
1598 valtail
= TREE_CHAIN (valtail
), parmnum
++)
1600 register tree type
= typetail
? TREE_VALUE (typetail
) : 0;
1601 register tree val
= TREE_VALUE (valtail
);
1603 if (type
== void_type_node
)
1606 error ("too many arguments to function `%s'",
1607 IDENTIFIER_POINTER (name
));
1609 error ("too many arguments to function");
1613 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
1614 /* Do not use STRIP_NOPS here! We do not want an enumerator with value 0
1615 to convert automatically to a pointer. */
1616 if (TREE_CODE (val
) == NON_LVALUE_EXPR
)
1617 val
= TREE_OPERAND (val
, 0);
1619 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
1620 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
)
1621 val
= default_conversion (val
);
1623 val
= require_complete_type (val
);
1627 /* Formal parm type is specified by a function prototype. */
1630 if (!COMPLETE_TYPE_P (type
))
1632 error ("type of formal parameter %d is incomplete", parmnum
+ 1);
1637 /* Optionally warn about conversions that
1638 differ from the default conversions. */
1639 if (warn_conversion
)
1641 int formal_prec
= TYPE_PRECISION (type
);
1643 if (INTEGRAL_TYPE_P (type
)
1644 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
1645 warn_for_assignment ("%s as integer rather than floating due to prototype", (char *) 0, name
, parmnum
+ 1);
1646 else if (TREE_CODE (type
) == COMPLEX_TYPE
1647 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
1648 warn_for_assignment ("%s as complex rather than floating due to prototype", (char *) 0, name
, parmnum
+ 1);
1649 else if (TREE_CODE (type
) == REAL_TYPE
1650 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
1651 warn_for_assignment ("%s as floating rather than integer due to prototype", (char *) 0, name
, parmnum
+ 1);
1652 else if (TREE_CODE (type
) == REAL_TYPE
1653 && TREE_CODE (TREE_TYPE (val
)) == COMPLEX_TYPE
)
1654 warn_for_assignment ("%s as floating rather than complex due to prototype", (char *) 0, name
, parmnum
+ 1);
1655 /* ??? At some point, messages should be written about
1656 conversions between complex types, but that's too messy
1658 else if (TREE_CODE (type
) == REAL_TYPE
1659 && TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
)
1661 /* Warn if any argument is passed as `float',
1662 since without a prototype it would be `double'. */
1663 if (formal_prec
== TYPE_PRECISION (float_type_node
))
1664 warn_for_assignment ("%s as `float' rather than `double' due to prototype", (char *) 0, name
, parmnum
+ 1);
1666 /* Detect integer changing in width or signedness. */
1667 else if (INTEGRAL_TYPE_P (type
)
1668 && INTEGRAL_TYPE_P (TREE_TYPE (val
)))
1670 tree would_have_been
= default_conversion (val
);
1671 tree type1
= TREE_TYPE (would_have_been
);
1673 if (TREE_CODE (type
) == ENUMERAL_TYPE
1674 && type
== TREE_TYPE (val
))
1675 /* No warning if function asks for enum
1676 and the actual arg is that enum type. */
1678 else if (formal_prec
!= TYPE_PRECISION (type1
))
1679 warn_for_assignment ("%s with different width due to prototype", (char *) 0, name
, parmnum
+ 1);
1680 else if (TREE_UNSIGNED (type
) == TREE_UNSIGNED (type1
))
1682 /* Don't complain if the formal parameter type
1683 is an enum, because we can't tell now whether
1684 the value was an enum--even the same enum. */
1685 else if (TREE_CODE (type
) == ENUMERAL_TYPE
)
1687 else if (TREE_CODE (val
) == INTEGER_CST
1688 && int_fits_type_p (val
, type
))
1689 /* Change in signedness doesn't matter
1690 if a constant value is unaffected. */
1692 /* Likewise for a constant in a NOP_EXPR. */
1693 else if (TREE_CODE (val
) == NOP_EXPR
1694 && TREE_CODE (TREE_OPERAND (val
, 0)) == INTEGER_CST
1695 && int_fits_type_p (TREE_OPERAND (val
, 0), type
))
1697 #if 0 /* We never get such tree structure here. */
1698 else if (TREE_CODE (TREE_TYPE (val
)) == ENUMERAL_TYPE
1699 && int_fits_type_p (TYPE_MIN_VALUE (TREE_TYPE (val
)), type
)
1700 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE (val
)), type
))
1701 /* Change in signedness doesn't matter
1702 if an enum value is unaffected. */
1705 /* If the value is extended from a narrower
1706 unsigned type, it doesn't matter whether we
1707 pass it as signed or unsigned; the value
1708 certainly is the same either way. */
1709 else if (TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
)
1710 && TREE_UNSIGNED (TREE_TYPE (val
)))
1712 else if (TREE_UNSIGNED (type
))
1713 warn_for_assignment ("%s as unsigned due to prototype", (char *) 0, name
, parmnum
+ 1);
1715 warn_for_assignment ("%s as signed due to prototype", (char *) 0, name
, parmnum
+ 1);
1719 parmval
= convert_for_assignment (type
, val
,
1720 (char *) 0, /* arg passing */
1721 fundecl
, name
, parmnum
+ 1);
1723 if (PROMOTE_PROTOTYPES
1724 && (TREE_CODE (type
) == INTEGER_TYPE
1725 || TREE_CODE (type
) == ENUMERAL_TYPE
)
1726 && (TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
)))
1727 parmval
= default_conversion (parmval
);
1729 result
= tree_cons (NULL_TREE
, parmval
, result
);
1731 else if (TREE_CODE (TREE_TYPE (val
)) == REAL_TYPE
1732 && (TYPE_PRECISION (TREE_TYPE (val
))
1733 < TYPE_PRECISION (double_type_node
)))
1734 /* Convert `float' to `double'. */
1735 result
= tree_cons (NULL_TREE
, convert (double_type_node
, val
), result
);
1737 /* Convert `short' and `char' to full-size `int'. */
1738 result
= tree_cons (NULL_TREE
, default_conversion (val
), result
);
1741 typetail
= TREE_CHAIN (typetail
);
1744 if (typetail
!= 0 && TREE_VALUE (typetail
) != void_type_node
)
1747 error ("too few arguments to function `%s'",
1748 IDENTIFIER_POINTER (name
));
1750 error ("too few arguments to function");
1753 return nreverse (result
);
1756 /* This is the entry point used by the parser
1757 for binary operators in the input.
1758 In addition to constructing the expression,
1759 we check for operands that were written with other binary operators
1760 in a way that is likely to confuse the user. */
1763 parser_build_binary_op (code
, arg1
, arg2
)
1764 enum tree_code code
;
1767 tree result
= build_binary_op (code
, arg1
, arg2
, 1);
1770 char class1
= TREE_CODE_CLASS (TREE_CODE (arg1
));
1771 char class2
= TREE_CODE_CLASS (TREE_CODE (arg2
));
1772 enum tree_code code1
= ERROR_MARK
;
1773 enum tree_code code2
= ERROR_MARK
;
1775 if (class1
== 'e' || class1
== '1'
1776 || class1
== '2' || class1
== '<')
1777 code1
= C_EXP_ORIGINAL_CODE (arg1
);
1778 if (class2
== 'e' || class2
== '1'
1779 || class2
== '2' || class2
== '<')
1780 code2
= C_EXP_ORIGINAL_CODE (arg2
);
1782 /* Check for cases such as x+y<<z which users are likely
1783 to misinterpret. If parens are used, C_EXP_ORIGINAL_CODE
1784 is cleared to prevent these warnings. */
1785 if (warn_parentheses
)
1787 if (code
== LSHIFT_EXPR
|| code
== RSHIFT_EXPR
)
1789 if (code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
1790 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
1791 warning ("suggest parentheses around + or - inside shift");
1794 if (code
== TRUTH_ORIF_EXPR
)
1796 if (code1
== TRUTH_ANDIF_EXPR
1797 || code2
== TRUTH_ANDIF_EXPR
)
1798 warning ("suggest parentheses around && within ||");
1801 if (code
== BIT_IOR_EXPR
)
1803 if (code1
== BIT_AND_EXPR
|| code1
== BIT_XOR_EXPR
1804 || code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
1805 || code2
== BIT_AND_EXPR
|| code2
== BIT_XOR_EXPR
1806 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
1807 warning ("suggest parentheses around arithmetic in operand of |");
1808 /* Check cases like x|y==z */
1809 if (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<')
1810 warning ("suggest parentheses around comparison in operand of |");
1813 if (code
== BIT_XOR_EXPR
)
1815 if (code1
== BIT_AND_EXPR
1816 || code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
1817 || code2
== BIT_AND_EXPR
1818 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
1819 warning ("suggest parentheses around arithmetic in operand of ^");
1820 /* Check cases like x^y==z */
1821 if (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<')
1822 warning ("suggest parentheses around comparison in operand of ^");
1825 if (code
== BIT_AND_EXPR
)
1827 if (code1
== PLUS_EXPR
|| code1
== MINUS_EXPR
1828 || code2
== PLUS_EXPR
|| code2
== MINUS_EXPR
)
1829 warning ("suggest parentheses around + or - in operand of &");
1830 /* Check cases like x&y==z */
1831 if (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<')
1832 warning ("suggest parentheses around comparison in operand of &");
1836 /* Similarly, check for cases like 1<=i<=10 that are probably errors. */
1837 if (TREE_CODE_CLASS (code
) == '<' && extra_warnings
1838 && (TREE_CODE_CLASS (code1
) == '<' || TREE_CODE_CLASS (code2
) == '<'))
1839 warning ("comparisons like X<=Y<=Z do not have their mathematical meaning");
1841 unsigned_conversion_warning (result
, arg1
);
1842 unsigned_conversion_warning (result
, arg2
);
1843 overflow_warning (result
);
1845 class = TREE_CODE_CLASS (TREE_CODE (result
));
1847 /* Record the code that was specified in the source,
1848 for the sake of warnings about confusing nesting. */
1849 if (class == 'e' || class == '1'
1850 || class == '2' || class == '<')
1851 C_SET_EXP_ORIGINAL_CODE (result
, code
);
1854 int flag
= TREE_CONSTANT (result
);
1855 /* We used to use NOP_EXPR rather than NON_LVALUE_EXPR
1856 so that convert_for_assignment wouldn't strip it.
1857 That way, we got warnings for things like p = (1 - 1).
1858 But it turns out we should not get those warnings. */
1859 result
= build1 (NON_LVALUE_EXPR
, TREE_TYPE (result
), result
);
1860 C_SET_EXP_ORIGINAL_CODE (result
, code
);
1861 TREE_CONSTANT (result
) = flag
;
1867 /* Build a binary-operation expression without default conversions.
1868 CODE is the kind of expression to build.
1869 This function differs from `build' in several ways:
1870 the data type of the result is computed and recorded in it,
1871 warnings are generated if arg data types are invalid,
1872 special handling for addition and subtraction of pointers is known,
1873 and some optimization is done (operations on narrow ints
1874 are done in the narrower type when that gives the same result).
1875 Constant folding is also done before the result is returned.
1877 Note that the operands will never have enumeral types, or function
1878 or array types, because either they will have the default conversions
1879 performed or they have both just been converted to some other type in which
1880 the arithmetic is to be done. */
1883 build_binary_op (code
, orig_op0
, orig_op1
, convert_p
)
1884 enum tree_code code
;
1885 tree orig_op0
, orig_op1
;
1889 register enum tree_code code0
, code1
;
1892 /* Expression code to give to the expression when it is built.
1893 Normally this is CODE, which is what the caller asked for,
1894 but in some special cases we change it. */
1895 register enum tree_code resultcode
= code
;
1897 /* Data type in which the computation is to be performed.
1898 In the simplest cases this is the common type of the arguments. */
1899 register tree result_type
= NULL
;
1901 /* Nonzero means operands have already been type-converted
1902 in whatever way is necessary.
1903 Zero means they need to be converted to RESULT_TYPE. */
1906 /* Nonzero means create the expression with this type, rather than
1908 tree build_type
= 0;
1910 /* Nonzero means after finally constructing the expression
1911 convert it to this type. */
1912 tree final_type
= 0;
1914 /* Nonzero if this is an operation like MIN or MAX which can
1915 safely be computed in short if both args are promoted shorts.
1916 Also implies COMMON.
1917 -1 indicates a bitwise operation; this makes a difference
1918 in the exact conditions for when it is safe to do the operation
1919 in a narrower mode. */
1922 /* Nonzero if this is a comparison operation;
1923 if both args are promoted shorts, compare the original shorts.
1924 Also implies COMMON. */
1925 int short_compare
= 0;
1927 /* Nonzero if this is a right-shift operation, which can be computed on the
1928 original short and then promoted if the operand is a promoted short. */
1929 int short_shift
= 0;
1931 /* Nonzero means set RESULT_TYPE to the common type of the args. */
1936 op0
= default_conversion (orig_op0
);
1937 op1
= default_conversion (orig_op1
);
1945 type0
= TREE_TYPE (op0
);
1946 type1
= TREE_TYPE (op1
);
1948 /* The expression codes of the data types of the arguments tell us
1949 whether the arguments are integers, floating, pointers, etc. */
1950 code0
= TREE_CODE (type0
);
1951 code1
= TREE_CODE (type1
);
1953 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
1954 STRIP_TYPE_NOPS (op0
);
1955 STRIP_TYPE_NOPS (op1
);
1957 /* If an error was already reported for one of the arguments,
1958 avoid reporting another error. */
1960 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
1961 return error_mark_node
;
1966 /* Handle the pointer + int case. */
1967 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
1968 return pointer_int_sum (PLUS_EXPR
, op0
, op1
);
1969 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
1970 return pointer_int_sum (PLUS_EXPR
, op1
, op0
);
1976 /* Subtraction of two similar pointers.
1977 We must subtract them as integers, then divide by object size. */
1978 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
1979 && comp_target_types (type0
, type1
))
1980 return pointer_diff (op0
, op1
);
1981 /* Handle pointer minus int. Just like pointer plus int. */
1982 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
1983 return pointer_int_sum (MINUS_EXPR
, op0
, op1
);
1992 case TRUNC_DIV_EXPR
:
1994 case FLOOR_DIV_EXPR
:
1995 case ROUND_DIV_EXPR
:
1996 case EXACT_DIV_EXPR
:
1997 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
1998 || code0
== COMPLEX_TYPE
)
1999 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
2000 || code1
== COMPLEX_TYPE
))
2002 if (!(code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
))
2003 resultcode
= RDIV_EXPR
;
2005 /* Although it would be tempting to shorten always here, that
2006 loses on some targets, since the modulo instruction is
2007 undefined if the quotient can't be represented in the
2008 computation mode. We shorten only if unsigned or if
2009 dividing by something we know != -1. */
2010 shorten
= (TREE_UNSIGNED (TREE_TYPE (orig_op0
))
2011 || (TREE_CODE (op1
) == INTEGER_CST
2012 && ! integer_all_onesp (op1
)));
2018 case BIT_ANDTC_EXPR
:
2021 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2023 /* If one operand is a constant, and the other is a short type
2024 that has been converted to an int,
2025 really do the work in the short type and then convert the
2026 result to int. If we are lucky, the constant will be 0 or 1
2027 in the short type, making the entire operation go away. */
2028 if (TREE_CODE (op0
) == INTEGER_CST
2029 && TREE_CODE (op1
) == NOP_EXPR
2030 && TYPE_PRECISION (type1
) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1
, 0)))
2031 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op1
, 0))))
2033 final_type
= result_type
;
2034 op1
= TREE_OPERAND (op1
, 0);
2035 result_type
= TREE_TYPE (op1
);
2037 if (TREE_CODE (op1
) == INTEGER_CST
2038 && TREE_CODE (op0
) == NOP_EXPR
2039 && TYPE_PRECISION (type0
) > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0
, 0)))
2040 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
2042 final_type
= result_type
;
2043 op0
= TREE_OPERAND (op0
, 0);
2044 result_type
= TREE_TYPE (op0
);
2048 case TRUNC_MOD_EXPR
:
2049 case FLOOR_MOD_EXPR
:
2050 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2052 /* Although it would be tempting to shorten always here, that loses
2053 on some targets, since the modulo instruction is undefined if the
2054 quotient can't be represented in the computation mode. We shorten
2055 only if unsigned or if dividing by something we know != -1. */
2056 shorten
= (TREE_UNSIGNED (TREE_TYPE (orig_op0
))
2057 || (TREE_CODE (op1
) == INTEGER_CST
2058 && ! integer_all_onesp (op1
)));
2063 case TRUTH_ANDIF_EXPR
:
2064 case TRUTH_ORIF_EXPR
:
2065 case TRUTH_AND_EXPR
:
2067 case TRUTH_XOR_EXPR
:
2068 if ((code0
== INTEGER_TYPE
|| code0
== POINTER_TYPE
2069 || code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
2070 && (code1
== INTEGER_TYPE
|| code1
== POINTER_TYPE
2071 || code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
))
2073 /* Result of these operations is always an int,
2074 but that does not mean the operands should be
2075 converted to ints! */
2076 result_type
= integer_type_node
;
2077 op0
= truthvalue_conversion (op0
);
2078 op1
= truthvalue_conversion (op1
);
2083 /* Shift operations: result has same type as first operand;
2084 always convert second operand to int.
2085 Also set SHORT_SHIFT if shifting rightward. */
2088 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2090 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
2092 if (tree_int_cst_sgn (op1
) < 0)
2093 warning ("right shift count is negative");
2096 if (! integer_zerop (op1
))
2099 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
2100 warning ("right shift count >= width of type");
2104 /* Use the type of the value to be shifted.
2105 This is what most traditional C compilers do. */
2106 result_type
= type0
;
2107 /* Unless traditional, convert the shift-count to an integer,
2108 regardless of size of value being shifted. */
2109 if (! flag_traditional
)
2111 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
2112 op1
= convert (integer_type_node
, op1
);
2113 /* Avoid converting op1 to result_type later. */
2120 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2122 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
2124 if (tree_int_cst_sgn (op1
) < 0)
2125 warning ("left shift count is negative");
2127 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
2128 warning ("left shift count >= width of type");
2131 /* Use the type of the value to be shifted.
2132 This is what most traditional C compilers do. */
2133 result_type
= type0
;
2134 /* Unless traditional, convert the shift-count to an integer,
2135 regardless of size of value being shifted. */
2136 if (! flag_traditional
)
2138 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
2139 op1
= convert (integer_type_node
, op1
);
2140 /* Avoid converting op1 to result_type later. */
2148 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
2150 if (TREE_CODE (op1
) == INTEGER_CST
&& skip_evaluation
== 0)
2152 if (tree_int_cst_sgn (op1
) < 0)
2153 warning ("shift count is negative");
2154 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
2155 warning ("shift count >= width of type");
2158 /* Use the type of the value to be shifted.
2159 This is what most traditional C compilers do. */
2160 result_type
= type0
;
2161 /* Unless traditional, convert the shift-count to an integer,
2162 regardless of size of value being shifted. */
2163 if (! flag_traditional
)
2165 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
2166 op1
= convert (integer_type_node
, op1
);
2167 /* Avoid converting op1 to result_type later. */
2175 if (warn_float_equal
&& (code0
== REAL_TYPE
|| code1
== REAL_TYPE
))
2176 warning ("comparing floating point with == or != is unsafe");
2177 /* Result of comparison is always int,
2178 but don't convert the args to int! */
2179 build_type
= integer_type_node
;
2180 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
2181 || code0
== COMPLEX_TYPE
)
2182 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
2183 || code1
== COMPLEX_TYPE
))
2185 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
2187 register tree tt0
= TREE_TYPE (type0
);
2188 register tree tt1
= TREE_TYPE (type1
);
2189 /* Anything compares with void *. void * compares with anything.
2190 Otherwise, the targets must be compatible
2191 and both must be object or both incomplete. */
2192 if (comp_target_types (type0
, type1
))
2193 result_type
= common_type (type0
, type1
);
2194 else if (VOID_TYPE_P (tt0
))
2196 /* op0 != orig_op0 detects the case of something
2197 whose value is 0 but which isn't a valid null ptr const. */
2198 if (pedantic
&& (!integer_zerop (op0
) || op0
!= orig_op0
)
2199 && TREE_CODE (tt1
) == FUNCTION_TYPE
)
2200 pedwarn ("ANSI C forbids comparison of `void *' with function pointer");
2202 else if (VOID_TYPE_P (tt1
))
2204 if (pedantic
&& (!integer_zerop (op1
) || op1
!= orig_op1
)
2205 && TREE_CODE (tt0
) == FUNCTION_TYPE
)
2206 pedwarn ("ANSI C forbids comparison of `void *' with function pointer");
2209 pedwarn ("comparison of distinct pointer types lacks a cast");
2211 if (result_type
== NULL_TREE
)
2212 result_type
= ptr_type_node
;
2214 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
2215 && integer_zerop (op1
))
2216 result_type
= type0
;
2217 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
2218 && integer_zerop (op0
))
2219 result_type
= type1
;
2220 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
2222 result_type
= type0
;
2223 if (! flag_traditional
)
2224 pedwarn ("comparison between pointer and integer");
2226 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
2228 result_type
= type1
;
2229 if (! flag_traditional
)
2230 pedwarn ("comparison between pointer and integer");
2236 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
2237 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
2239 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
2241 if (comp_target_types (type0
, type1
))
2243 result_type
= common_type (type0
, type1
);
2245 && TREE_CODE (TREE_TYPE (type0
)) == FUNCTION_TYPE
)
2246 pedwarn ("ANSI C forbids ordered comparisons of pointers to functions");
2250 result_type
= ptr_type_node
;
2251 pedwarn ("comparison of distinct pointer types lacks a cast");
2260 build_type
= integer_type_node
;
2261 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
2262 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
2264 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
2266 if (comp_target_types (type0
, type1
))
2268 result_type
= common_type (type0
, type1
);
2269 if (!COMPLETE_TYPE_P (TREE_TYPE (type0
))
2270 != !COMPLETE_TYPE_P (TREE_TYPE (type1
)))
2271 pedwarn ("comparison of complete and incomplete pointers");
2273 && TREE_CODE (TREE_TYPE (type0
)) == FUNCTION_TYPE
)
2274 pedwarn ("ANSI C forbids ordered comparisons of pointers to functions");
2278 result_type
= ptr_type_node
;
2279 pedwarn ("comparison of distinct pointer types lacks a cast");
2282 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
2283 && integer_zerop (op1
))
2285 result_type
= type0
;
2286 if (pedantic
|| extra_warnings
)
2287 pedwarn ("ordered comparison of pointer with integer zero");
2289 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
2290 && integer_zerop (op0
))
2292 result_type
= type1
;
2294 pedwarn ("ordered comparison of pointer with integer zero");
2296 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
2298 result_type
= type0
;
2299 if (! flag_traditional
)
2300 pedwarn ("comparison between pointer and integer");
2302 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
2304 result_type
= type1
;
2305 if (! flag_traditional
)
2306 pedwarn ("comparison between pointer and integer");
2310 case UNORDERED_EXPR
:
2317 build_type
= integer_type_node
;
2318 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
2320 error ("unordered comparison on non-floating point argument");
2321 return error_mark_node
;
2330 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
2332 (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
))
2334 int none_complex
= (code0
!= COMPLEX_TYPE
&& code1
!= COMPLEX_TYPE
);
2336 if (shorten
|| common
|| short_compare
)
2337 result_type
= common_type (type0
, type1
);
2339 /* For certain operations (which identify themselves by shorten != 0)
2340 if both args were extended from the same smaller type,
2341 do the arithmetic in that type and then extend.
2343 shorten !=0 and !=1 indicates a bitwise operation.
2344 For them, this optimization is safe only if
2345 both args are zero-extended or both are sign-extended.
2346 Otherwise, we might change the result.
2347 Eg, (short)-1 | (unsigned short)-1 is (int)-1
2348 but calculated in (unsigned short) it would be (unsigned short)-1. */
2350 if (shorten
&& none_complex
)
2352 int unsigned0
, unsigned1
;
2353 tree arg0
= get_narrower (op0
, &unsigned0
);
2354 tree arg1
= get_narrower (op1
, &unsigned1
);
2355 /* UNS is 1 if the operation to be done is an unsigned one. */
2356 int uns
= TREE_UNSIGNED (result_type
);
2359 final_type
= result_type
;
2361 /* Handle the case that OP0 (or OP1) does not *contain* a conversion
2362 but it *requires* conversion to FINAL_TYPE. */
2364 if ((TYPE_PRECISION (TREE_TYPE (op0
))
2365 == TYPE_PRECISION (TREE_TYPE (arg0
)))
2366 && TREE_TYPE (op0
) != final_type
)
2367 unsigned0
= TREE_UNSIGNED (TREE_TYPE (op0
));
2368 if ((TYPE_PRECISION (TREE_TYPE (op1
))
2369 == TYPE_PRECISION (TREE_TYPE (arg1
)))
2370 && TREE_TYPE (op1
) != final_type
)
2371 unsigned1
= TREE_UNSIGNED (TREE_TYPE (op1
));
2373 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
2375 /* For bitwise operations, signedness of nominal type
2376 does not matter. Consider only how operands were extended. */
2380 /* Note that in all three cases below we refrain from optimizing
2381 an unsigned operation on sign-extended args.
2382 That would not be valid. */
2384 /* Both args variable: if both extended in same way
2385 from same width, do it in that width.
2386 Do it unsigned if args were zero-extended. */
2387 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
2388 < TYPE_PRECISION (result_type
))
2389 && (TYPE_PRECISION (TREE_TYPE (arg1
))
2390 == TYPE_PRECISION (TREE_TYPE (arg0
)))
2391 && unsigned0
== unsigned1
2392 && (unsigned0
|| !uns
))
2394 = signed_or_unsigned_type (unsigned0
,
2395 common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
2396 else if (TREE_CODE (arg0
) == INTEGER_CST
2397 && (unsigned1
|| !uns
)
2398 && (TYPE_PRECISION (TREE_TYPE (arg1
))
2399 < TYPE_PRECISION (result_type
))
2400 && (type
= signed_or_unsigned_type (unsigned1
,
2402 int_fits_type_p (arg0
, type
)))
2404 else if (TREE_CODE (arg1
) == INTEGER_CST
2405 && (unsigned0
|| !uns
)
2406 && (TYPE_PRECISION (TREE_TYPE (arg0
))
2407 < TYPE_PRECISION (result_type
))
2408 && (type
= signed_or_unsigned_type (unsigned0
,
2410 int_fits_type_p (arg1
, type
)))
2414 /* Shifts can be shortened if shifting right. */
2419 tree arg0
= get_narrower (op0
, &unsigned_arg
);
2421 final_type
= result_type
;
2423 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
2424 unsigned_arg
= TREE_UNSIGNED (TREE_TYPE (op0
));
2426 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
2427 /* We can shorten only if the shift count is less than the
2428 number of bits in the smaller type size. */
2429 && compare_tree_int (op1
, TYPE_PRECISION (TREE_TYPE (arg0
))) < 0
2430 /* If arg is sign-extended and then unsigned-shifted,
2431 we can simulate this with a signed shift in arg's type
2432 only if the extended result is at least twice as wide
2433 as the arg. Otherwise, the shift could use up all the
2434 ones made by sign-extension and bring in zeros.
2435 We can't optimize that case at all, but in most machines
2436 it never happens because available widths are 2**N. */
2437 && (!TREE_UNSIGNED (final_type
)
2439 || (2 * TYPE_PRECISION (TREE_TYPE (arg0
))
2440 <= TYPE_PRECISION (result_type
))))
2442 /* Do an unsigned shift if the operand was zero-extended. */
2444 = signed_or_unsigned_type (unsigned_arg
,
2446 /* Convert value-to-be-shifted to that type. */
2447 if (TREE_TYPE (op0
) != result_type
)
2448 op0
= convert (result_type
, op0
);
2453 /* Comparison operations are shortened too but differently.
2454 They identify themselves by setting short_compare = 1. */
2458 /* Don't write &op0, etc., because that would prevent op0
2459 from being kept in a register.
2460 Instead, make copies of the our local variables and
2461 pass the copies by reference, then copy them back afterward. */
2462 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
2463 enum tree_code xresultcode
= resultcode
;
2465 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
2470 op0
= xop0
, op1
= xop1
;
2472 resultcode
= xresultcode
;
2474 if ((warn_sign_compare
< 0 ? extra_warnings
: warn_sign_compare
!= 0)
2475 && skip_evaluation
== 0)
2477 int op0_signed
= ! TREE_UNSIGNED (TREE_TYPE (orig_op0
));
2478 int op1_signed
= ! TREE_UNSIGNED (TREE_TYPE (orig_op1
));
2479 int unsignedp0
, unsignedp1
;
2480 tree primop0
= get_narrower (op0
, &unsignedp0
);
2481 tree primop1
= get_narrower (op1
, &unsignedp1
);
2485 STRIP_TYPE_NOPS (xop0
);
2486 STRIP_TYPE_NOPS (xop1
);
2488 /* Give warnings for comparisons between signed and unsigned
2489 quantities that may fail.
2491 Do the checking based on the original operand trees, so that
2492 casts will be considered, but default promotions won't be.
2494 Do not warn if the comparison is being done in a signed type,
2495 since the signed type will only be chosen if it can represent
2496 all the values of the unsigned type. */
2497 if (! TREE_UNSIGNED (result_type
))
2499 /* Do not warn if both operands are the same signedness. */
2500 else if (op0_signed
== op1_signed
)
2507 sop
= xop0
, uop
= xop1
;
2509 sop
= xop1
, uop
= xop0
;
2511 /* Do not warn if the signed quantity is an
2512 unsuffixed integer literal (or some static
2513 constant expression involving such literals or a
2514 conditional expression involving such literals)
2515 and it is non-negative. */
2516 if (tree_expr_nonnegative_p (sop
))
2518 /* Do not warn if the comparison is an equality operation,
2519 the unsigned quantity is an integral constant, and it
2520 would fit in the result if the result were signed. */
2521 else if (TREE_CODE (uop
) == INTEGER_CST
2522 && (resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
2523 && int_fits_type_p (uop
, signed_type (result_type
)))
2525 /* Do not warn if the unsigned quantity is an enumeration
2526 constant and its maximum value would fit in the result
2527 if the result were signed. */
2528 else if (TREE_CODE (uop
) == INTEGER_CST
2529 && TREE_CODE (TREE_TYPE (uop
)) == ENUMERAL_TYPE
2530 && int_fits_type_p (TYPE_MAX_VALUE (TREE_TYPE(uop
)),
2531 signed_type (result_type
)))
2534 warning ("comparison between signed and unsigned");
2537 /* Warn if two unsigned values are being compared in a size
2538 larger than their original size, and one (and only one) is the
2539 result of a `~' operator. This comparison will always fail.
2541 Also warn if one operand is a constant, and the constant
2542 does not have all bits set that are set in the ~ operand
2543 when it is extended. */
2545 if ((TREE_CODE (primop0
) == BIT_NOT_EXPR
)
2546 != (TREE_CODE (primop1
) == BIT_NOT_EXPR
))
2548 if (TREE_CODE (primop0
) == BIT_NOT_EXPR
)
2549 primop0
= get_narrower (TREE_OPERAND (primop0
, 0),
2552 primop1
= get_narrower (TREE_OPERAND (primop1
, 0),
2555 if (host_integerp (primop0
, 0) || host_integerp (primop1
, 0))
2558 HOST_WIDE_INT constant
, mask
;
2559 int unsignedp
, bits
;
2561 if (host_integerp (primop0
, 0))
2564 unsignedp
= unsignedp1
;
2565 constant
= tree_low_cst (primop0
, 0);
2570 unsignedp
= unsignedp0
;
2571 constant
= tree_low_cst (primop1
, 0);
2574 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
2575 if (bits
< TYPE_PRECISION (result_type
)
2576 && bits
< HOST_BITS_PER_WIDE_INT
&& unsignedp
)
2578 mask
= (~ (HOST_WIDE_INT
) 0) << bits
;
2579 if ((mask
& constant
) != mask
)
2580 warning ("comparison of promoted ~unsigned with constant");
2583 else if (unsignedp0
&& unsignedp1
2584 && (TYPE_PRECISION (TREE_TYPE (primop0
))
2585 < TYPE_PRECISION (result_type
))
2586 && (TYPE_PRECISION (TREE_TYPE (primop1
))
2587 < TYPE_PRECISION (result_type
)))
2588 warning ("comparison of promoted ~unsigned with unsigned");
2594 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
2595 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
2596 Then the expression will be built.
2597 It will be given type FINAL_TYPE if that is nonzero;
2598 otherwise, it will be given type RESULT_TYPE. */
2602 binary_op_error (code
);
2603 return error_mark_node
;
2608 if (TREE_TYPE (op0
) != result_type
)
2609 op0
= convert (result_type
, op0
);
2610 if (TREE_TYPE (op1
) != result_type
)
2611 op1
= convert (result_type
, op1
);
2614 if (build_type
== NULL_TREE
)
2615 build_type
= result_type
;
2618 register tree result
= build (resultcode
, build_type
, op0
, op1
);
2619 register tree folded
;
2621 folded
= fold (result
);
2622 if (folded
== result
)
2623 TREE_CONSTANT (folded
) = TREE_CONSTANT (op0
) & TREE_CONSTANT (op1
);
2624 if (final_type
!= 0)
2625 return convert (final_type
, folded
);
2630 /* Return a tree for the sum or difference (RESULTCODE says which)
2631 of pointer PTROP and integer INTOP. */
2634 pointer_int_sum (resultcode
, ptrop
, intop
)
2635 enum tree_code resultcode
;
2636 register tree ptrop
, intop
;
2640 register tree result
;
2641 register tree folded
;
2643 /* The result is a pointer of the same type that is being added. */
2645 register tree result_type
= TREE_TYPE (ptrop
);
2647 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
2649 if (pedantic
|| warn_pointer_arith
)
2650 pedwarn ("pointer of type `void *' used in arithmetic");
2651 size_exp
= integer_one_node
;
2653 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
2655 if (pedantic
|| warn_pointer_arith
)
2656 pedwarn ("pointer to a function used in arithmetic");
2657 size_exp
= integer_one_node
;
2660 size_exp
= c_size_in_bytes (TREE_TYPE (result_type
));
2662 /* If what we are about to multiply by the size of the elements
2663 contains a constant term, apply distributive law
2664 and multiply that constant term separately.
2665 This helps produce common subexpressions. */
2667 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
2668 && ! TREE_CONSTANT (intop
)
2669 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
2670 && TREE_CONSTANT (size_exp
)
2671 /* If the constant comes from pointer subtraction,
2672 skip this optimization--it would cause an error. */
2673 && TREE_CODE (TREE_TYPE (TREE_OPERAND (intop
, 0))) == INTEGER_TYPE
2674 /* If the constant is unsigned, and smaller than the pointer size,
2675 then we must skip this optimization. This is because it could cause
2676 an overflow error if the constant is negative but INTOP is not. */
2677 && (! TREE_UNSIGNED (TREE_TYPE (intop
))
2678 || (TYPE_PRECISION (TREE_TYPE (intop
))
2679 == TYPE_PRECISION (TREE_TYPE (ptrop
)))))
2681 enum tree_code subcode
= resultcode
;
2682 tree int_type
= TREE_TYPE (intop
);
2683 if (TREE_CODE (intop
) == MINUS_EXPR
)
2684 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
2685 /* Convert both subexpression types to the type of intop,
2686 because weird cases involving pointer arithmetic
2687 can result in a sum or difference with different type args. */
2688 ptrop
= build_binary_op (subcode
, ptrop
,
2689 convert (int_type
, TREE_OPERAND (intop
, 1)), 1);
2690 intop
= convert (int_type
, TREE_OPERAND (intop
, 0));
2693 /* Convert the integer argument to a type the same size as sizetype
2694 so the multiply won't overflow spuriously. */
2696 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
)
2697 || TREE_UNSIGNED (TREE_TYPE (intop
)) != TREE_UNSIGNED (sizetype
))
2698 intop
= convert (type_for_size (TYPE_PRECISION (sizetype
),
2699 TREE_UNSIGNED (sizetype
)), intop
);
2701 /* Replace the integer argument with a suitable product by the object size.
2702 Do this multiplication as signed, then convert to the appropriate
2703 pointer type (actually unsigned integral). */
2705 intop
= convert (result_type
,
2706 build_binary_op (MULT_EXPR
, intop
,
2707 convert (TREE_TYPE (intop
), size_exp
), 1));
2709 /* Create the sum or difference. */
2711 result
= build (resultcode
, result_type
, ptrop
, intop
);
2713 folded
= fold (result
);
2714 if (folded
== result
)
2715 TREE_CONSTANT (folded
) = TREE_CONSTANT (ptrop
) & TREE_CONSTANT (intop
);
2719 /* Return a tree for the difference of pointers OP0 and OP1.
2720 The resulting tree has type int. */
2723 pointer_diff (op0
, op1
)
2724 register tree op0
, op1
;
2726 register tree result
, folded
;
2727 tree restype
= ptrdiff_type_node
;
2729 tree target_type
= TREE_TYPE (TREE_TYPE (op0
));
2731 if (pedantic
|| warn_pointer_arith
)
2733 if (TREE_CODE (target_type
) == VOID_TYPE
)
2734 pedwarn ("pointer of type `void *' used in subtraction");
2735 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
2736 pedwarn ("pointer to a function used in subtraction");
2739 /* First do the subtraction as integers;
2740 then drop through to build the divide operator.
2741 Do not do default conversions on the minus operator
2742 in case restype is a short type. */
2744 op0
= build_binary_op (MINUS_EXPR
, convert (restype
, op0
),
2745 convert (restype
, op1
), 0);
2746 /* This generates an error if op1 is pointer to incomplete type. */
2747 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
2748 error ("arithmetic on pointer to an incomplete type");
2750 /* This generates an error if op0 is pointer to incomplete type. */
2751 op1
= c_size_in_bytes (target_type
);
2753 /* Divide by the size, in easiest possible way. */
2755 result
= build (EXACT_DIV_EXPR
, restype
, op0
, convert (restype
, op1
));
2757 folded
= fold (result
);
2758 if (folded
== result
)
2759 TREE_CONSTANT (folded
) = TREE_CONSTANT (op0
) & TREE_CONSTANT (op1
);
2763 /* Construct and perhaps optimize a tree representation
2764 for a unary operation. CODE, a tree_code, specifies the operation
2765 and XARG is the operand. NOCONVERT nonzero suppresses
2766 the default promotions (such as from short to int). */
2769 build_unary_op (code
, xarg
, noconvert
)
2770 enum tree_code code
;
2774 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
2775 register tree arg
= xarg
;
2776 register tree argtype
= 0;
2777 register enum tree_code typecode
= TREE_CODE (TREE_TYPE (arg
));
2780 if (typecode
== ERROR_MARK
)
2781 return error_mark_node
;
2782 if (typecode
== ENUMERAL_TYPE
)
2783 typecode
= INTEGER_TYPE
;
2788 /* This is used for unary plus, because a CONVERT_EXPR
2789 is enough to prevent anybody from looking inside for
2790 associativity, but won't generate any code. */
2791 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2792 || typecode
== COMPLEX_TYPE
))
2794 error ("wrong type argument to unary plus");
2795 return error_mark_node
;
2797 else if (!noconvert
)
2798 arg
= default_conversion (arg
);
2802 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2803 || typecode
== COMPLEX_TYPE
))
2805 error ("wrong type argument to unary minus");
2806 return error_mark_node
;
2808 else if (!noconvert
)
2809 arg
= default_conversion (arg
);
2813 if (typecode
== COMPLEX_TYPE
)
2817 arg
= default_conversion (arg
);
2819 else if (typecode
!= INTEGER_TYPE
)
2821 error ("wrong type argument to bit-complement");
2822 return error_mark_node
;
2824 else if (!noconvert
)
2825 arg
= default_conversion (arg
);
2829 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2830 || typecode
== COMPLEX_TYPE
))
2832 error ("wrong type argument to abs");
2833 return error_mark_node
;
2835 else if (!noconvert
)
2836 arg
= default_conversion (arg
);
2840 /* Conjugating a real value is a no-op, but allow it anyway. */
2841 if (!(typecode
== INTEGER_TYPE
|| typecode
== REAL_TYPE
2842 || typecode
== COMPLEX_TYPE
))
2844 error ("wrong type argument to conjugation");
2845 return error_mark_node
;
2847 else if (!noconvert
)
2848 arg
= default_conversion (arg
);
2851 case TRUTH_NOT_EXPR
:
2852 if (typecode
!= INTEGER_TYPE
2853 && typecode
!= REAL_TYPE
&& typecode
!= POINTER_TYPE
2854 && typecode
!= COMPLEX_TYPE
2855 /* These will convert to a pointer. */
2856 && typecode
!= ARRAY_TYPE
&& typecode
!= FUNCTION_TYPE
)
2858 error ("wrong type argument to unary exclamation mark");
2859 return error_mark_node
;
2861 arg
= truthvalue_conversion (arg
);
2862 return invert_truthvalue (arg
);
2868 if (TREE_CODE (arg
) == COMPLEX_CST
)
2869 return TREE_REALPART (arg
);
2870 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
2871 return fold (build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
2876 if (TREE_CODE (arg
) == COMPLEX_CST
)
2877 return TREE_IMAGPART (arg
);
2878 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
2879 return fold (build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
2881 return convert (TREE_TYPE (arg
), integer_zero_node
);
2883 case PREINCREMENT_EXPR
:
2884 case POSTINCREMENT_EXPR
:
2885 case PREDECREMENT_EXPR
:
2886 case POSTDECREMENT_EXPR
:
2887 /* Handle complex lvalues (when permitted)
2888 by reduction to simpler cases. */
2890 val
= unary_complex_lvalue (code
, arg
);
2894 /* Increment or decrement the real part of the value,
2895 and don't change the imaginary part. */
2896 if (typecode
== COMPLEX_TYPE
)
2900 arg
= stabilize_reference (arg
);
2901 real
= build_unary_op (REALPART_EXPR
, arg
, 1);
2902 imag
= build_unary_op (IMAGPART_EXPR
, arg
, 1);
2903 return build (COMPLEX_EXPR
, TREE_TYPE (arg
),
2904 build_unary_op (code
, real
, 1), imag
);
2907 /* Report invalid types. */
2909 if (typecode
!= POINTER_TYPE
2910 && typecode
!= INTEGER_TYPE
&& typecode
!= REAL_TYPE
)
2912 error ("wrong type argument to %s",
2913 code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
2914 ? "increment" : "decrement");
2915 return error_mark_node
;
2920 tree result_type
= TREE_TYPE (arg
);
2922 arg
= get_unwidened (arg
, 0);
2923 argtype
= TREE_TYPE (arg
);
2925 /* Compute the increment. */
2927 if (typecode
== POINTER_TYPE
)
2929 /* If pointer target is an undefined struct,
2930 we just cannot know how to do the arithmetic. */
2931 if (!COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (result_type
)))
2932 error ("%s of pointer to unknown structure",
2933 code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
2934 ? "increment" : "decrement");
2935 else if ((pedantic
|| warn_pointer_arith
)
2936 && (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
2937 || TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
))
2938 pedwarn ("wrong type argument to %s",
2939 code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
2940 ? "increment" : "decrement");
2941 inc
= c_size_in_bytes (TREE_TYPE (result_type
));
2944 inc
= integer_one_node
;
2946 inc
= convert (argtype
, inc
);
2948 /* Handle incrementing a cast-expression. */
2951 switch (TREE_CODE (arg
))
2956 case FIX_TRUNC_EXPR
:
2957 case FIX_FLOOR_EXPR
:
2958 case FIX_ROUND_EXPR
:
2960 pedantic_lvalue_warning (CONVERT_EXPR
);
2961 /* If the real type has the same machine representation
2962 as the type it is cast to, we can make better output
2963 by adding directly to the inside of the cast. */
2964 if ((TREE_CODE (TREE_TYPE (arg
))
2965 == TREE_CODE (TREE_TYPE (TREE_OPERAND (arg
, 0))))
2966 && (TYPE_MODE (TREE_TYPE (arg
))
2967 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (arg
, 0)))))
2968 arg
= TREE_OPERAND (arg
, 0);
2971 tree incremented
, modify
, value
;
2972 arg
= stabilize_reference (arg
);
2973 if (code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
2976 value
= save_expr (arg
);
2977 incremented
= build (((code
== PREINCREMENT_EXPR
2978 || code
== POSTINCREMENT_EXPR
)
2979 ? PLUS_EXPR
: MINUS_EXPR
),
2980 argtype
, value
, inc
);
2981 TREE_SIDE_EFFECTS (incremented
) = 1;
2982 modify
= build_modify_expr (arg
, NOP_EXPR
, incremented
);
2983 value
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), modify
, value
);
2984 TREE_USED (value
) = 1;
2994 /* Complain about anything else that is not a true lvalue. */
2995 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
2996 || code
== POSTINCREMENT_EXPR
)
2997 ? "invalid lvalue in increment"
2998 : "invalid lvalue in decrement")))
2999 return error_mark_node
;
3001 /* Report a read-only lvalue. */
3002 if (TREE_READONLY (arg
))
3003 readonly_warning (arg
,
3004 ((code
== PREINCREMENT_EXPR
3005 || code
== POSTINCREMENT_EXPR
)
3006 ? "increment" : "decrement"));
3008 val
= build (code
, TREE_TYPE (arg
), arg
, inc
);
3009 TREE_SIDE_EFFECTS (val
) = 1;
3010 val
= convert (result_type
, val
);
3011 if (TREE_CODE (val
) != code
)
3012 TREE_NO_UNUSED_WARNING (val
) = 1;
3017 /* Note that this operation never does default_conversion
3018 regardless of NOCONVERT. */
3020 /* Let &* cancel out to simplify resulting code. */
3021 if (TREE_CODE (arg
) == INDIRECT_REF
)
3023 /* Don't let this be an lvalue. */
3024 if (lvalue_p (TREE_OPERAND (arg
, 0)))
3025 return non_lvalue (TREE_OPERAND (arg
, 0));
3026 return TREE_OPERAND (arg
, 0);
3029 /* For &x[y], return x+y */
3030 if (TREE_CODE (arg
) == ARRAY_REF
)
3032 if (mark_addressable (TREE_OPERAND (arg
, 0)) == 0)
3033 return error_mark_node
;
3034 return build_binary_op (PLUS_EXPR
, TREE_OPERAND (arg
, 0),
3035 TREE_OPERAND (arg
, 1), 1);
3038 /* Handle complex lvalues (when permitted)
3039 by reduction to simpler cases. */
3040 val
= unary_complex_lvalue (code
, arg
);
3044 #if 0 /* Turned off because inconsistent;
3045 float f; *&(int)f = 3.4 stores in int format
3046 whereas (int)f = 3.4 stores in float format. */
3047 /* Address of a cast is just a cast of the address
3048 of the operand of the cast. */
3049 switch (TREE_CODE (arg
))
3054 case FIX_TRUNC_EXPR
:
3055 case FIX_FLOOR_EXPR
:
3056 case FIX_ROUND_EXPR
:
3059 pedwarn ("ANSI C forbids the address of a cast expression");
3060 return convert (build_pointer_type (TREE_TYPE (arg
)),
3061 build_unary_op (ADDR_EXPR
, TREE_OPERAND (arg
, 0),
3066 /* Allow the address of a constructor if all the elements
3068 if (TREE_CODE (arg
) == CONSTRUCTOR
&& TREE_CONSTANT (arg
))
3070 /* Anything not already handled and not a true memory reference
3072 else if (typecode
!= FUNCTION_TYPE
3073 && !lvalue_or_else (arg
, "invalid lvalue in unary `&'"))
3074 return error_mark_node
;
3076 /* Ordinary case; arg is a COMPONENT_REF or a decl. */
3077 argtype
= TREE_TYPE (arg
);
3079 /* If the lvalue is const or volatile, merge that into the type
3080 to which the address will point. Note that you can't get a
3081 restricted pointer by taking the address of something, so we
3082 only have to deal with `const' and `volatile' here. */
3083 if ((DECL_P (arg
) || TREE_CODE_CLASS (TREE_CODE (arg
)) == 'r')
3084 && (TREE_READONLY (arg
) || TREE_THIS_VOLATILE (arg
)))
3085 argtype
= c_build_type_variant (argtype
,
3086 TREE_READONLY (arg
),
3087 TREE_THIS_VOLATILE (arg
));
3089 argtype
= build_pointer_type (argtype
);
3091 if (mark_addressable (arg
) == 0)
3092 return error_mark_node
;
3097 if (TREE_CODE (arg
) == COMPONENT_REF
)
3099 tree field
= TREE_OPERAND (arg
, 1);
3101 addr
= build_unary_op (ADDR_EXPR
, TREE_OPERAND (arg
, 0), 0);
3103 if (DECL_C_BIT_FIELD (field
))
3105 error ("attempt to take address of bit-field structure member `%s'",
3106 IDENTIFIER_POINTER (DECL_NAME (field
)));
3107 return error_mark_node
;
3110 addr
= fold (build (PLUS_EXPR
, argtype
,
3111 convert (argtype
, addr
),
3112 convert (argtype
, byte_position (field
))));
3115 addr
= build1 (code
, argtype
, arg
);
3117 /* Address of a static or external variable or
3118 file-scope function counts as a constant. */
3120 && ! (TREE_CODE (arg
) == FUNCTION_DECL
3121 && DECL_CONTEXT (arg
) != 0))
3122 TREE_CONSTANT (addr
) = 1;
3131 argtype
= TREE_TYPE (arg
);
3132 return fold (build1 (code
, argtype
, arg
));
3136 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
3137 convert ARG with the same conversions in the same order
3138 and return the result. */
3141 convert_sequence (conversions
, arg
)
3145 switch (TREE_CODE (conversions
))
3150 case FIX_TRUNC_EXPR
:
3151 case FIX_FLOOR_EXPR
:
3152 case FIX_ROUND_EXPR
:
3154 return convert (TREE_TYPE (conversions
),
3155 convert_sequence (TREE_OPERAND (conversions
, 0),
3164 /* Return nonzero if REF is an lvalue valid for this language.
3165 Lvalues can be assigned, unless their type has TYPE_READONLY.
3166 Lvalues can have their address taken, unless they have DECL_REGISTER. */
3172 register enum tree_code code
= TREE_CODE (ref
);
3179 return lvalue_p (TREE_OPERAND (ref
, 0));
3190 return (TREE_CODE (TREE_TYPE (ref
)) != FUNCTION_TYPE
3191 && TREE_CODE (TREE_TYPE (ref
)) != METHOD_TYPE
);
3195 return TREE_CODE (TREE_TYPE (ref
)) == ARRAY_TYPE
;
3202 /* Return nonzero if REF is an lvalue valid for this language;
3203 otherwise, print an error message and return zero. */
3206 lvalue_or_else (ref
, msgid
)
3210 int win
= lvalue_p (ref
);
3213 error ("%s", msgid
);
3218 /* Apply unary lvalue-demanding operator CODE to the expression ARG
3219 for certain kinds of expressions which are not really lvalues
3220 but which we can accept as lvalues.
3222 If ARG is not a kind of expression we can handle, return zero. */
3225 unary_complex_lvalue (code
, arg
)
3226 enum tree_code code
;
3229 /* Handle (a, b) used as an "lvalue". */
3230 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
3232 tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 1), 0);
3234 /* If this returns a function type, it isn't really being used as
3235 an lvalue, so don't issue a warning about it. */
3236 if (TREE_CODE (TREE_TYPE (arg
)) != FUNCTION_TYPE
)
3237 pedantic_lvalue_warning (COMPOUND_EXPR
);
3239 return build (COMPOUND_EXPR
, TREE_TYPE (real_result
),
3240 TREE_OPERAND (arg
, 0), real_result
);
3243 /* Handle (a ? b : c) used as an "lvalue". */
3244 if (TREE_CODE (arg
) == COND_EXPR
)
3246 pedantic_lvalue_warning (COND_EXPR
);
3247 if (TREE_CODE (TREE_TYPE (arg
)) != FUNCTION_TYPE
)
3248 pedantic_lvalue_warning (COMPOUND_EXPR
);
3250 return (build_conditional_expr
3251 (TREE_OPERAND (arg
, 0),
3252 build_unary_op (code
, TREE_OPERAND (arg
, 1), 0),
3253 build_unary_op (code
, TREE_OPERAND (arg
, 2), 0)));
3259 /* If pedantic, warn about improper lvalue. CODE is either COND_EXPR
3260 COMPOUND_EXPR, or CONVERT_EXPR (for casts). */
3263 pedantic_lvalue_warning (code
)
3264 enum tree_code code
;
3270 pedwarn ("ANSI C forbids use of conditional expressions as lvalues");
3273 pedwarn ("ANSI C forbids use of compound expressions as lvalues");
3276 pedwarn ("ANSI C forbids use of cast expressions as lvalues");
3281 /* Warn about storing in something that is `const'. */
3284 readonly_warning (arg
, msgid
)
3288 /* Forbid assignments to iterators. */
3289 if (TREE_CODE (arg
) == VAR_DECL
&& ITERATOR_P (arg
))
3290 pedwarn ("%s of iterator `%s'", _(msgid
),
3291 IDENTIFIER_POINTER (DECL_NAME (arg
)));
3293 if (TREE_CODE (arg
) == COMPONENT_REF
)
3295 if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg
, 0))))
3296 readonly_warning (TREE_OPERAND (arg
, 0), msgid
);
3298 pedwarn ("%s of read-only member `%s'", _(msgid
),
3299 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (arg
, 1))));
3301 else if (TREE_CODE (arg
) == VAR_DECL
)
3302 pedwarn ("%s of read-only variable `%s'", _(msgid
),
3303 IDENTIFIER_POINTER (DECL_NAME (arg
)));
3305 pedwarn ("%s of read-only location", _(msgid
));
3308 /* Mark EXP saying that we need to be able to take the
3309 address of it; it should not be allocated in a register.
3310 Value is 1 if successful. */
3313 mark_addressable (exp
)
3316 register tree x
= exp
;
3318 switch (TREE_CODE (x
))
3321 if (DECL_C_BIT_FIELD (TREE_OPERAND (x
, 1)))
3323 error ("cannot take address of bitfield `%s'",
3324 IDENTIFIER_POINTER (DECL_NAME (TREE_OPERAND (x
, 1))));
3328 /* ... fall through ... */
3334 x
= TREE_OPERAND (x
, 0);
3338 TREE_ADDRESSABLE (x
) = 1;
3345 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
3346 && DECL_NONLOCAL (x
))
3348 if (TREE_PUBLIC (x
))
3350 error ("global register variable `%s' used in nested function",
3351 IDENTIFIER_POINTER (DECL_NAME (x
)));
3354 pedwarn ("register variable `%s' used in nested function",
3355 IDENTIFIER_POINTER (DECL_NAME (x
)));
3357 else if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
))
3359 if (TREE_PUBLIC (x
))
3361 error ("address of global register variable `%s' requested",
3362 IDENTIFIER_POINTER (DECL_NAME (x
)));
3366 /* If we are making this addressable due to its having
3367 volatile components, give a different error message. Also
3368 handle the case of an unnamed parameter by not trying
3369 to give the name. */
3371 else if (C_TYPE_FIELDS_VOLATILE (TREE_TYPE (x
)))
3373 error ("cannot put object with volatile field into register");
3377 pedwarn ("address of register variable `%s' requested",
3378 IDENTIFIER_POINTER (DECL_NAME (x
)));
3380 put_var_into_stack (x
);
3384 TREE_ADDRESSABLE (x
) = 1;
3385 #if 0 /* poplevel deals with this now. */
3386 if (DECL_CONTEXT (x
) == 0)
3387 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x
)) = 1;
3395 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
3398 build_conditional_expr (ifexp
, op1
, op2
)
3399 tree ifexp
, op1
, op2
;
3401 register tree type1
;
3402 register tree type2
;
3403 register enum tree_code code1
;
3404 register enum tree_code code2
;
3405 register tree result_type
= NULL
;
3406 tree orig_op1
= op1
, orig_op2
= op2
;
3408 ifexp
= truthvalue_conversion (default_conversion (ifexp
));
3410 #if 0 /* Produces wrong result if within sizeof. */
3411 /* Don't promote the operands separately if they promote
3412 the same way. Return the unpromoted type and let the combined
3413 value get promoted if necessary. */
3415 if (TREE_TYPE (op1
) == TREE_TYPE (op2
)
3416 && TREE_CODE (TREE_TYPE (op1
)) != ARRAY_TYPE
3417 && TREE_CODE (TREE_TYPE (op1
)) != ENUMERAL_TYPE
3418 && TREE_CODE (TREE_TYPE (op1
)) != FUNCTION_TYPE
)
3420 if (TREE_CODE (ifexp
) == INTEGER_CST
)
3421 return pedantic_non_lvalue (integer_zerop (ifexp
) ? op2
: op1
);
3423 return fold (build (COND_EXPR
, TREE_TYPE (op1
), ifexp
, op1
, op2
));
3427 /* Promote both alternatives. */
3429 if (TREE_CODE (TREE_TYPE (op1
)) != VOID_TYPE
)
3430 op1
= default_conversion (op1
);
3431 if (TREE_CODE (TREE_TYPE (op2
)) != VOID_TYPE
)
3432 op2
= default_conversion (op2
);
3434 if (TREE_CODE (ifexp
) == ERROR_MARK
3435 || TREE_CODE (TREE_TYPE (op1
)) == ERROR_MARK
3436 || TREE_CODE (TREE_TYPE (op2
)) == ERROR_MARK
)
3437 return error_mark_node
;
3439 type1
= TREE_TYPE (op1
);
3440 code1
= TREE_CODE (type1
);
3441 type2
= TREE_TYPE (op2
);
3442 code2
= TREE_CODE (type2
);
3444 /* Quickly detect the usual case where op1 and op2 have the same type
3446 if (TYPE_MAIN_VARIANT (type1
) == TYPE_MAIN_VARIANT (type2
))
3449 result_type
= type1
;
3451 result_type
= TYPE_MAIN_VARIANT (type1
);
3453 else if ((code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3454 || code1
== COMPLEX_TYPE
)
3455 && (code2
== INTEGER_TYPE
|| code2
== REAL_TYPE
3456 || code2
== COMPLEX_TYPE
))
3458 result_type
= common_type (type1
, type2
);
3460 /* If -Wsign-compare, warn here if type1 and type2 have
3461 different signedness. We'll promote the signed to unsigned
3462 and later code won't know it used to be different.
3463 Do this check on the original types, so that explicit casts
3464 will be considered, but default promotions won't. */
3465 if ((warn_sign_compare
< 0 ? extra_warnings
: warn_sign_compare
)
3466 && !skip_evaluation
)
3468 int unsigned_op1
= TREE_UNSIGNED (TREE_TYPE (orig_op1
));
3469 int unsigned_op2
= TREE_UNSIGNED (TREE_TYPE (orig_op2
));
3471 if (unsigned_op1
^ unsigned_op2
)
3473 /* Do not warn if the result type is signed, since the
3474 signed type will only be chosen if it can represent
3475 all the values of the unsigned type. */
3476 if (! TREE_UNSIGNED (result_type
))
3478 /* Do not warn if the signed quantity is an unsuffixed
3479 integer literal (or some static constant expression
3480 involving such literals) and it is non-negative. */
3481 else if ((unsigned_op2
&& tree_expr_nonnegative_p (op1
))
3482 || (unsigned_op1
&& tree_expr_nonnegative_p (op2
)))
3485 warning ("signed and unsigned type in conditional expression");
3489 else if (code1
== VOID_TYPE
|| code2
== VOID_TYPE
)
3491 if (pedantic
&& (code1
!= VOID_TYPE
|| code2
!= VOID_TYPE
))
3492 pedwarn ("ANSI C forbids conditional expr with only one void side");
3493 result_type
= void_type_node
;
3495 else if (code1
== POINTER_TYPE
&& code2
== POINTER_TYPE
)
3497 if (comp_target_types (type1
, type2
))
3498 result_type
= common_type (type1
, type2
);
3499 else if (integer_zerop (op1
) && TREE_TYPE (type1
) == void_type_node
3500 && TREE_CODE (orig_op1
) != NOP_EXPR
)
3501 result_type
= qualify_type (type2
, type1
);
3502 else if (integer_zerop (op2
) && TREE_TYPE (type2
) == void_type_node
3503 && TREE_CODE (orig_op2
) != NOP_EXPR
)
3504 result_type
= qualify_type (type1
, type2
);
3505 else if (VOID_TYPE_P (TREE_TYPE (type1
)))
3507 if (pedantic
&& TREE_CODE (TREE_TYPE (type2
)) == FUNCTION_TYPE
)
3508 pedwarn ("ANSI C forbids conditional expr between `void *' and function pointer");
3509 result_type
= qualify_type (type1
, type2
);
3511 else if (VOID_TYPE_P (TREE_TYPE (type2
)))
3513 if (pedantic
&& TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
)
3514 pedwarn ("ANSI C forbids conditional expr between `void *' and function pointer");
3515 result_type
= qualify_type (type2
, type1
);
3519 pedwarn ("pointer type mismatch in conditional expression");
3520 result_type
= build_pointer_type (void_type_node
);
3523 else if (code1
== POINTER_TYPE
&& code2
== INTEGER_TYPE
)
3525 if (! integer_zerop (op2
))
3526 pedwarn ("pointer/integer type mismatch in conditional expression");
3529 op2
= null_pointer_node
;
3530 #if 0 /* The spec seems to say this is permitted. */
3531 if (pedantic
&& TREE_CODE (type1
) == FUNCTION_TYPE
)
3532 pedwarn ("ANSI C forbids conditional expr between 0 and function pointer");
3535 result_type
= type1
;
3537 else if (code2
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3539 if (!integer_zerop (op1
))
3540 pedwarn ("pointer/integer type mismatch in conditional expression");
3543 op1
= null_pointer_node
;
3544 #if 0 /* The spec seems to say this is permitted. */
3545 if (pedantic
&& TREE_CODE (type2
) == FUNCTION_TYPE
)
3546 pedwarn ("ANSI C forbids conditional expr between 0 and function pointer");
3549 result_type
= type2
;
3554 if (flag_cond_mismatch
)
3555 result_type
= void_type_node
;
3558 error ("type mismatch in conditional expression");
3559 return error_mark_node
;
3563 /* Merge const and volatile flags of the incoming types. */
3565 = build_type_variant (result_type
,
3566 TREE_READONLY (op1
) || TREE_READONLY (op2
),
3567 TREE_THIS_VOLATILE (op1
) || TREE_THIS_VOLATILE (op2
));
3569 if (result_type
!= TREE_TYPE (op1
))
3570 op1
= convert_and_check (result_type
, op1
);
3571 if (result_type
!= TREE_TYPE (op2
))
3572 op2
= convert_and_check (result_type
, op2
);
3574 if (TREE_CODE (ifexp
) == INTEGER_CST
)
3575 return pedantic_non_lvalue (integer_zerop (ifexp
) ? op2
: op1
);
3577 return fold (build (COND_EXPR
, result_type
, ifexp
, op1
, op2
));
3580 /* Given a list of expressions, return a compound expression
3581 that performs them all and returns the value of the last of them. */
3584 build_compound_expr (list
)
3587 return internal_build_compound_expr (list
, TRUE
);
3591 internal_build_compound_expr (list
, first_p
)
3597 if (TREE_CHAIN (list
) == 0)
3599 #if 0 /* If something inside inhibited lvalueness, we should not override. */
3600 /* Consider (x, y+0), which is not an lvalue since y+0 is not. */
3602 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3603 if (TREE_CODE (list
) == NON_LVALUE_EXPR
)
3604 list
= TREE_OPERAND (list
, 0);
3607 /* Don't let (0, 0) be null pointer constant. */
3608 if (!first_p
&& integer_zerop (TREE_VALUE (list
)))
3609 return non_lvalue (TREE_VALUE (list
));
3610 return TREE_VALUE (list
);
3613 if (TREE_CHAIN (list
) != 0 && TREE_CHAIN (TREE_CHAIN (list
)) == 0)
3615 /* Convert arrays to pointers when there really is a comma operator. */
3616 if (TREE_CODE (TREE_TYPE (TREE_VALUE (TREE_CHAIN (list
)))) == ARRAY_TYPE
)
3617 TREE_VALUE (TREE_CHAIN (list
))
3618 = default_conversion (TREE_VALUE (TREE_CHAIN (list
)));
3621 rest
= internal_build_compound_expr (TREE_CHAIN (list
), FALSE
);
3623 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list
)))
3625 /* The left-hand operand of a comma expression is like an expression
3626 statement: with -W or -Wunused, we should warn if it doesn't have
3627 any side-effects, unless it was explicitly cast to (void). */
3628 if ((extra_warnings
|| warn_unused_value
)
3629 && ! (TREE_CODE (TREE_VALUE (list
)) == CONVERT_EXPR
3630 && VOID_TYPE_P (TREE_TYPE (TREE_VALUE (list
)))))
3631 warning ("left-hand operand of comma expression has no effect");
3633 /* When pedantic, a compound expression can be neither an lvalue
3634 nor an integer constant expression. */
3639 /* With -Wunused, we should also warn if the left-hand operand does have
3640 side-effects, but computes a value which is not used. For example, in
3641 `foo() + bar(), baz()' the result of the `+' operator is not used,
3642 so we should issue a warning. */
3643 else if (warn_unused_value
)
3644 warn_if_unused_value (TREE_VALUE (list
));
3646 return build (COMPOUND_EXPR
, TREE_TYPE (rest
), TREE_VALUE (list
), rest
);
3649 /* Build an expression representing a cast to type TYPE of expression EXPR. */
3652 build_c_cast (type
, expr
)
3656 register tree value
= expr
;
3658 if (type
== error_mark_node
|| expr
== error_mark_node
)
3659 return error_mark_node
;
3660 type
= TYPE_MAIN_VARIANT (type
);
3663 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3664 if (TREE_CODE (value
) == NON_LVALUE_EXPR
)
3665 value
= TREE_OPERAND (value
, 0);
3668 if (TREE_CODE (type
) == ARRAY_TYPE
)
3670 error ("cast specifies array type");
3671 return error_mark_node
;
3674 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3676 error ("cast specifies function type");
3677 return error_mark_node
;
3680 if (type
== TREE_TYPE (value
))
3684 if (TREE_CODE (type
) == RECORD_TYPE
3685 || TREE_CODE (type
) == UNION_TYPE
)
3686 pedwarn ("ANSI C forbids casting nonscalar to the same type");
3689 else if (TREE_CODE (type
) == UNION_TYPE
)
3692 if (TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
3693 || TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
)
3694 value
= default_conversion (value
);
3696 for (field
= TYPE_FIELDS (type
); field
; field
= TREE_CHAIN (field
))
3697 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (field
)),
3698 TYPE_MAIN_VARIANT (TREE_TYPE (value
))))
3707 pedwarn ("ANSI C forbids casts to union type");
3708 if (TYPE_NAME (type
) != 0)
3710 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
)
3711 name
= IDENTIFIER_POINTER (TYPE_NAME (type
));
3713 name
= IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
)));
3717 t
= digest_init (type
, build (CONSTRUCTOR
, type
, NULL_TREE
,
3718 build_tree_list (field
, value
)),
3720 TREE_CONSTANT (t
) = TREE_CONSTANT (value
);
3723 error ("cast to union type from type not present in union");
3724 return error_mark_node
;
3730 /* If casting to void, avoid the error that would come
3731 from default_conversion in the case of a non-lvalue array. */
3732 if (type
== void_type_node
)
3733 return build1 (CONVERT_EXPR
, type
, value
);
3735 /* Convert functions and arrays to pointers,
3736 but don't convert any other types. */
3737 if (TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
3738 || TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
)
3739 value
= default_conversion (value
);
3740 otype
= TREE_TYPE (value
);
3742 /* Optionally warn about potentially worrisome casts. */
3745 && TREE_CODE (type
) == POINTER_TYPE
3746 && TREE_CODE (otype
) == POINTER_TYPE
)
3748 tree in_type
= type
;
3749 tree in_otype
= otype
;
3752 /* Check that the qualifiers on IN_TYPE are a superset of
3753 the qualifiers of IN_OTYPE. The outermost level of
3754 POINTER_TYPE nodes is uninteresting and we stop as soon
3755 as we hit a non-POINTER_TYPE node on either type. */
3758 in_otype
= TREE_TYPE (in_otype
);
3759 in_type
= TREE_TYPE (in_type
);
3760 warn
|= (TYPE_QUALS (in_otype
) & ~TYPE_QUALS (in_type
));
3762 while (TREE_CODE (in_type
) == POINTER_TYPE
3763 && TREE_CODE (in_otype
) == POINTER_TYPE
);
3766 /* There are qualifiers present in IN_OTYPE that are not
3767 present in IN_TYPE. */
3768 pedwarn ("cast discards qualifiers from pointer target type");
3771 /* Warn about possible alignment problems. */
3772 if (STRICT_ALIGNMENT
&& warn_cast_align
3773 && TREE_CODE (type
) == POINTER_TYPE
3774 && TREE_CODE (otype
) == POINTER_TYPE
3775 && TREE_CODE (TREE_TYPE (otype
)) != VOID_TYPE
3776 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
3777 /* Don't warn about opaque types, where the actual alignment
3778 restriction is unknown. */
3779 && !((TREE_CODE (TREE_TYPE (otype
)) == UNION_TYPE
3780 || TREE_CODE (TREE_TYPE (otype
)) == RECORD_TYPE
)
3781 && TYPE_MODE (TREE_TYPE (otype
)) == VOIDmode
)
3782 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (otype
)))
3783 warning ("cast increases required alignment of target type");
3785 if (TREE_CODE (type
) == INTEGER_TYPE
3786 && TREE_CODE (otype
) == POINTER_TYPE
3787 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
3788 && !TREE_CONSTANT (value
))
3789 warning ("cast from pointer to integer of different size");
3791 if (warn_bad_function_cast
3792 && TREE_CODE (value
) == CALL_EXPR
3793 && TREE_CODE (type
) != TREE_CODE (otype
))
3794 warning ("cast does not match function type");
3796 if (TREE_CODE (type
) == POINTER_TYPE
3797 && TREE_CODE (otype
) == INTEGER_TYPE
3798 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
3799 /* Don't warn about converting any constant. */
3800 && !TREE_CONSTANT (value
))
3801 warning ("cast to pointer from integer of different size");
3804 value
= convert (type
, value
);
3806 /* Ignore any integer overflow caused by the cast. */
3807 if (TREE_CODE (value
) == INTEGER_CST
)
3809 TREE_OVERFLOW (value
) = TREE_OVERFLOW (ovalue
);
3810 TREE_CONSTANT_OVERFLOW (value
) = TREE_CONSTANT_OVERFLOW (ovalue
);
3814 /* Pedantically, don't ley (void *) (FOO *) 0 be a null pointer constant. */
3815 if (pedantic
&& TREE_CODE (value
) == INTEGER_CST
3816 && TREE_CODE (expr
) == INTEGER_CST
3817 && TREE_CODE (TREE_TYPE (expr
)) != INTEGER_TYPE
)
3818 value
= non_lvalue (value
);
3820 /* If pedantic, don't let a cast be an lvalue. */
3821 if (value
== expr
&& pedantic
)
3822 value
= non_lvalue (value
);
3827 /* Build an assignment expression of lvalue LHS from value RHS.
3828 MODIFYCODE is the code for a binary operator that we use
3829 to combine the old value of LHS with RHS to get the new value.
3830 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment. */
3833 build_modify_expr (lhs
, modifycode
, rhs
)
3835 enum tree_code modifycode
;
3837 register tree result
;
3839 tree lhstype
= TREE_TYPE (lhs
);
3840 tree olhstype
= lhstype
;
3842 /* Types that aren't fully specified cannot be used in assignments. */
3843 lhs
= require_complete_type (lhs
);
3845 /* Avoid duplicate error messages from operands that had errors. */
3846 if (TREE_CODE (lhs
) == ERROR_MARK
|| TREE_CODE (rhs
) == ERROR_MARK
)
3847 return error_mark_node
;
3849 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3850 /* Do not use STRIP_NOPS here. We do not want an enumerator
3851 whose value is 0 to count as a null pointer constant. */
3852 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
3853 rhs
= TREE_OPERAND (rhs
, 0);
3857 /* Handle control structure constructs used as "lvalues". */
3859 switch (TREE_CODE (lhs
))
3861 /* Handle (a, b) used as an "lvalue". */
3863 pedantic_lvalue_warning (COMPOUND_EXPR
);
3864 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 1), modifycode
, rhs
);
3865 if (TREE_CODE (newrhs
) == ERROR_MARK
)
3866 return error_mark_node
;
3867 return build (COMPOUND_EXPR
, lhstype
,
3868 TREE_OPERAND (lhs
, 0), newrhs
);
3870 /* Handle (a ? b : c) used as an "lvalue". */
3872 pedantic_lvalue_warning (COND_EXPR
);
3873 rhs
= save_expr (rhs
);
3875 /* Produce (a ? (b = rhs) : (c = rhs))
3876 except that the RHS goes through a save-expr
3877 so the code to compute it is only emitted once. */
3879 = build_conditional_expr (TREE_OPERAND (lhs
, 0),
3880 build_modify_expr (TREE_OPERAND (lhs
, 1),
3882 build_modify_expr (TREE_OPERAND (lhs
, 2),
3884 if (TREE_CODE (cond
) == ERROR_MARK
)
3886 /* Make sure the code to compute the rhs comes out
3887 before the split. */
3888 return build (COMPOUND_EXPR
, TREE_TYPE (lhs
),
3889 /* But cast it to void to avoid an "unused" error. */
3890 convert (void_type_node
, rhs
), cond
);
3896 /* If a binary op has been requested, combine the old LHS value with the RHS
3897 producing the value we should actually store into the LHS. */
3899 if (modifycode
!= NOP_EXPR
)
3901 lhs
= stabilize_reference (lhs
);
3902 newrhs
= build_binary_op (modifycode
, lhs
, rhs
, 1);
3905 /* Handle a cast used as an "lvalue".
3906 We have already performed any binary operator using the value as cast.
3907 Now convert the result to the cast type of the lhs,
3908 and then true type of the lhs and store it there;
3909 then convert result back to the cast type to be the value
3910 of the assignment. */
3912 switch (TREE_CODE (lhs
))
3917 case FIX_TRUNC_EXPR
:
3918 case FIX_FLOOR_EXPR
:
3919 case FIX_ROUND_EXPR
:
3921 if (TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
3922 || TREE_CODE (TREE_TYPE (newrhs
)) == FUNCTION_TYPE
)
3923 newrhs
= default_conversion (newrhs
);
3925 tree inner_lhs
= TREE_OPERAND (lhs
, 0);
3927 result
= build_modify_expr (inner_lhs
, NOP_EXPR
,
3928 convert (TREE_TYPE (inner_lhs
),
3929 convert (lhstype
, newrhs
)));
3930 if (TREE_CODE (result
) == ERROR_MARK
)
3932 pedantic_lvalue_warning (CONVERT_EXPR
);
3933 return convert (TREE_TYPE (lhs
), result
);
3940 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
3941 Reject anything strange now. */
3943 if (!lvalue_or_else (lhs
, "invalid lvalue in assignment"))
3944 return error_mark_node
;
3946 /* Warn about storing in something that is `const'. */
3948 if (TREE_READONLY (lhs
) || TYPE_READONLY (lhstype
)
3949 || ((TREE_CODE (lhstype
) == RECORD_TYPE
3950 || TREE_CODE (lhstype
) == UNION_TYPE
)
3951 && C_TYPE_FIELDS_READONLY (lhstype
)))
3952 readonly_warning (lhs
, "assignment");
3954 /* If storing into a structure or union member,
3955 it has probably been given type `int'.
3956 Compute the type that would go with
3957 the actual amount of storage the member occupies. */
3959 if (TREE_CODE (lhs
) == COMPONENT_REF
3960 && (TREE_CODE (lhstype
) == INTEGER_TYPE
3961 || TREE_CODE (lhstype
) == REAL_TYPE
3962 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
3963 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
3965 /* If storing in a field that is in actuality a short or narrower than one,
3966 we must store in the field in its actual type. */
3968 if (lhstype
!= TREE_TYPE (lhs
))
3970 lhs
= copy_node (lhs
);
3971 TREE_TYPE (lhs
) = lhstype
;
3974 /* Convert new value to destination type. */
3976 newrhs
= convert_for_assignment (lhstype
, newrhs
, _("assignment"),
3977 NULL_TREE
, NULL_TREE
, 0);
3978 if (TREE_CODE (newrhs
) == ERROR_MARK
)
3979 return error_mark_node
;
3981 result
= build (MODIFY_EXPR
, lhstype
, lhs
, newrhs
);
3982 TREE_SIDE_EFFECTS (result
) = 1;
3984 /* If we got the LHS in a different type for storing in,
3985 convert the result back to the nominal type of LHS
3986 so that the value we return always has the same type
3987 as the LHS argument. */
3989 if (olhstype
== TREE_TYPE (result
))
3991 return convert_for_assignment (olhstype
, result
, _("assignment"),
3992 NULL_TREE
, NULL_TREE
, 0);
3995 /* Convert value RHS to type TYPE as preparation for an assignment
3996 to an lvalue of type TYPE.
3997 The real work of conversion is done by `convert'.
3998 The purpose of this function is to generate error messages
3999 for assignments that are not allowed in C.
4000 ERRTYPE is a string to use in error messages:
4001 "assignment", "return", etc. If it is null, this is parameter passing
4002 for a function call (and different error messages are output).
4004 FUNNAME is the name of the function being called,
4005 as an IDENTIFIER_NODE, or null.
4006 PARMNUM is the number of the argument, for printing in error messages. */
4009 convert_for_assignment (type
, rhs
, errtype
, fundecl
, funname
, parmnum
)
4011 const char *errtype
;
4012 tree fundecl
, funname
;
4015 register enum tree_code codel
= TREE_CODE (type
);
4016 register tree rhstype
;
4017 register enum tree_code coder
;
4019 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4020 /* Do not use STRIP_NOPS here. We do not want an enumerator
4021 whose value is 0 to count as a null pointer constant. */
4022 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
4023 rhs
= TREE_OPERAND (rhs
, 0);
4025 if (TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
4026 || TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
)
4027 rhs
= default_conversion (rhs
);
4028 else if (optimize
&& TREE_CODE (rhs
) == VAR_DECL
)
4029 rhs
= decl_constant_value (rhs
);
4031 rhstype
= TREE_TYPE (rhs
);
4032 coder
= TREE_CODE (rhstype
);
4034 if (coder
== ERROR_MARK
)
4035 return error_mark_node
;
4037 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (rhstype
))
4039 overflow_warning (rhs
);
4040 /* Check for Objective-C protocols. This will issue a warning if
4041 there are protocol violations. No need to use the return value. */
4042 maybe_objc_comptypes (type
, rhstype
, 0);
4046 if (coder
== VOID_TYPE
)
4048 error ("void value not ignored as it ought to be");
4049 return error_mark_node
;
4051 /* A type converts to a reference to it.
4052 This code doesn't fully support references, it's just for the
4053 special case of va_start and va_copy. */
4054 if (codel
== REFERENCE_TYPE
4055 && comptypes (TREE_TYPE (type
), TREE_TYPE (rhs
)) == 1)
4057 if (mark_addressable (rhs
) == 0)
4058 return error_mark_node
;
4059 rhs
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (rhs
)), rhs
);
4061 /* We already know that these two types are compatible, but they
4062 may not be exactly identical. In fact, `TREE_TYPE (type)' is
4063 likely to be __builtin_va_list and `TREE_TYPE (rhs)' is
4064 likely to be va_list, a typedef to __builtin_va_list, which
4065 is different enough that it will cause problems later. */
4066 if (TREE_TYPE (TREE_TYPE (rhs
)) != TREE_TYPE (type
))
4067 rhs
= build1 (NOP_EXPR
, build_pointer_type (TREE_TYPE (type
)), rhs
);
4069 rhs
= build1 (NOP_EXPR
, type
, rhs
);
4072 /* Arithmetic types all interconvert, and enum is treated like int. */
4073 else if ((codel
== INTEGER_TYPE
|| codel
== REAL_TYPE
4074 || codel
== ENUMERAL_TYPE
|| codel
== COMPLEX_TYPE
)
4075 && (coder
== INTEGER_TYPE
|| coder
== REAL_TYPE
4076 || coder
== ENUMERAL_TYPE
|| coder
== COMPLEX_TYPE
))
4077 return convert_and_check (type
, rhs
);
4079 /* Conversion to a transparent union from its member types.
4080 This applies only to function arguments. */
4081 else if (codel
== UNION_TYPE
&& TYPE_TRANSPARENT_UNION (type
) && ! errtype
)
4084 tree marginal_memb_type
= 0;
4086 for (memb_types
= TYPE_FIELDS (type
); memb_types
;
4087 memb_types
= TREE_CHAIN (memb_types
))
4089 tree memb_type
= TREE_TYPE (memb_types
);
4091 if (comptypes (TYPE_MAIN_VARIANT (memb_type
),
4092 TYPE_MAIN_VARIANT (rhstype
)))
4095 if (TREE_CODE (memb_type
) != POINTER_TYPE
)
4098 if (coder
== POINTER_TYPE
)
4100 register tree ttl
= TREE_TYPE (memb_type
);
4101 register tree ttr
= TREE_TYPE (rhstype
);
4103 /* Any non-function converts to a [const][volatile] void *
4104 and vice versa; otherwise, targets must be the same.
4105 Meanwhile, the lhs target must have all the qualifiers of
4107 if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
4108 || comp_target_types (memb_type
, rhstype
))
4110 /* If this type won't generate any warnings, use it. */
4111 if (TYPE_QUALS (ttl
) == TYPE_QUALS (ttr
)
4112 || ((TREE_CODE (ttr
) == FUNCTION_TYPE
4113 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
4114 ? ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
4115 == TYPE_QUALS (ttr
))
4116 : ((TYPE_QUALS (ttl
) | TYPE_QUALS (ttr
))
4117 == TYPE_QUALS (ttl
))))
4120 /* Keep looking for a better type, but remember this one. */
4121 if (! marginal_memb_type
)
4122 marginal_memb_type
= memb_type
;
4126 /* Can convert integer zero to any pointer type. */
4127 if (integer_zerop (rhs
)
4128 || (TREE_CODE (rhs
) == NOP_EXPR
4129 && integer_zerop (TREE_OPERAND (rhs
, 0))))
4131 rhs
= null_pointer_node
;
4136 if (memb_types
|| marginal_memb_type
)
4140 /* We have only a marginally acceptable member type;
4141 it needs a warning. */
4142 register tree ttl
= TREE_TYPE (marginal_memb_type
);
4143 register tree ttr
= TREE_TYPE (rhstype
);
4145 /* Const and volatile mean something different for function
4146 types, so the usual warnings are not appropriate. */
4147 if (TREE_CODE (ttr
) == FUNCTION_TYPE
4148 && TREE_CODE (ttl
) == FUNCTION_TYPE
)
4150 /* Because const and volatile on functions are
4151 restrictions that say the function will not do
4152 certain things, it is okay to use a const or volatile
4153 function where an ordinary one is wanted, but not
4155 if (TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
))
4156 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4157 errtype
, funname
, parmnum
);
4159 else if (TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
))
4160 warn_for_assignment ("%s discards qualifiers from pointer target type",
4165 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (fundecl
))
4166 pedwarn ("ANSI C prohibits argument conversion to union type");
4168 return build1 (NOP_EXPR
, type
, rhs
);
4172 /* Conversions among pointers */
4173 else if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
4174 && (coder
== POINTER_TYPE
|| coder
== REFERENCE_TYPE
))
4176 register tree ttl
= TREE_TYPE (type
);
4177 register tree ttr
= TREE_TYPE (rhstype
);
4179 /* Any non-function converts to a [const][volatile] void *
4180 and vice versa; otherwise, targets must be the same.
4181 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
4182 if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
4183 || comp_target_types (type
, rhstype
)
4184 || (unsigned_type (TYPE_MAIN_VARIANT (ttl
))
4185 == unsigned_type (TYPE_MAIN_VARIANT (ttr
))))
4188 && ((VOID_TYPE_P (ttl
) && TREE_CODE (ttr
) == FUNCTION_TYPE
)
4191 /* Check TREE_CODE to catch cases like (void *) (char *) 0
4192 which are not ANSI null ptr constants. */
4193 && (!integer_zerop (rhs
) || TREE_CODE (rhs
) == NOP_EXPR
)
4194 && TREE_CODE (ttl
) == FUNCTION_TYPE
)))
4195 warn_for_assignment ("ANSI forbids %s between function pointer and `void *'",
4196 errtype
, funname
, parmnum
);
4197 /* Const and volatile mean something different for function types,
4198 so the usual warnings are not appropriate. */
4199 else if (TREE_CODE (ttr
) != FUNCTION_TYPE
4200 && TREE_CODE (ttl
) != FUNCTION_TYPE
)
4202 if (TYPE_QUALS (ttr
) & ~TYPE_QUALS (ttl
))
4203 warn_for_assignment ("%s discards qualifiers from pointer target type",
4204 errtype
, funname
, parmnum
);
4205 /* If this is not a case of ignoring a mismatch in signedness,
4207 else if (VOID_TYPE_P (ttl
) || VOID_TYPE_P (ttr
)
4208 || comp_target_types (type
, rhstype
))
4210 /* If there is a mismatch, do warn. */
4212 warn_for_assignment ("pointer targets in %s differ in signedness",
4213 errtype
, funname
, parmnum
);
4215 else if (TREE_CODE (ttl
) == FUNCTION_TYPE
4216 && TREE_CODE (ttr
) == FUNCTION_TYPE
)
4218 /* Because const and volatile on functions are restrictions
4219 that say the function will not do certain things,
4220 it is okay to use a const or volatile function
4221 where an ordinary one is wanted, but not vice-versa. */
4222 if (TYPE_QUALS (ttl
) & ~TYPE_QUALS (ttr
))
4223 warn_for_assignment ("%s makes qualified function pointer from unqualified",
4224 errtype
, funname
, parmnum
);
4228 warn_for_assignment ("%s from incompatible pointer type",
4229 errtype
, funname
, parmnum
);
4230 return convert (type
, rhs
);
4232 else if (codel
== POINTER_TYPE
&& coder
== INTEGER_TYPE
)
4234 /* An explicit constant 0 can convert to a pointer,
4235 or one that results from arithmetic, even including
4236 a cast to integer type. */
4237 if (! (TREE_CODE (rhs
) == INTEGER_CST
&& integer_zerop (rhs
))
4239 ! (TREE_CODE (rhs
) == NOP_EXPR
4240 && TREE_CODE (TREE_TYPE (rhs
)) == INTEGER_TYPE
4241 && TREE_CODE (TREE_OPERAND (rhs
, 0)) == INTEGER_CST
4242 && integer_zerop (TREE_OPERAND (rhs
, 0))))
4244 warn_for_assignment ("%s makes pointer from integer without a cast",
4245 errtype
, funname
, parmnum
);
4246 return convert (type
, rhs
);
4248 return null_pointer_node
;
4250 else if (codel
== INTEGER_TYPE
&& coder
== POINTER_TYPE
)
4252 warn_for_assignment ("%s makes integer from pointer without a cast",
4253 errtype
, funname
, parmnum
);
4254 return convert (type
, rhs
);
4261 tree selector
= maybe_building_objc_message_expr ();
4263 if (selector
&& parmnum
> 2)
4264 error ("incompatible type for argument %d of `%s'",
4265 parmnum
- 2, IDENTIFIER_POINTER (selector
));
4267 error ("incompatible type for argument %d of `%s'",
4268 parmnum
, IDENTIFIER_POINTER (funname
));
4271 error ("incompatible type for argument %d of indirect function call",
4275 error ("incompatible types in %s", errtype
);
4277 return error_mark_node
;
4280 /* Print a warning using MSGID.
4281 It gets OPNAME as its one parameter.
4282 If OPNAME is null, it is replaced by "passing arg ARGNUM of `FUNCTION'".
4283 FUNCTION and ARGNUM are handled specially if we are building an
4284 Objective-C selector. */
4287 warn_for_assignment (msgid
, opname
, function
, argnum
)
4295 tree selector
= maybe_building_objc_message_expr ();
4298 if (selector
&& argnum
> 2)
4300 function
= selector
;
4305 /* Function name is known; supply it. */
4306 const char *argstring
= _("passing arg %d of `%s'");
4307 new_opname
= (char *) alloca (IDENTIFIER_LENGTH (function
)
4308 + strlen (argstring
) + 1 + 25
4310 sprintf (new_opname
, argstring
, argnum
,
4311 IDENTIFIER_POINTER (function
));
4315 /* Function name unknown (call through ptr); just give arg number.*/
4316 const char *argnofun
= _("passing arg %d of pointer to function");
4317 new_opname
= (char *) alloca (strlen (argnofun
) + 1 + 25 /*%d*/ + 1);
4318 sprintf (new_opname
, argnofun
, argnum
);
4320 opname
= new_opname
;
4322 pedwarn (msgid
, opname
);
4325 /* If VALUE is a compound expr all of whose expressions are constant, then
4326 return its value. Otherwise, return error_mark_node.
4328 This is for handling COMPOUND_EXPRs as initializer elements
4329 which is allowed with a warning when -pedantic is specified. */
4332 valid_compound_expr_initializer (value
, endtype
)
4336 if (TREE_CODE (value
) == COMPOUND_EXPR
)
4338 if (valid_compound_expr_initializer (TREE_OPERAND (value
, 0), endtype
)
4340 return error_mark_node
;
4341 return valid_compound_expr_initializer (TREE_OPERAND (value
, 1),
4344 else if (! TREE_CONSTANT (value
)
4345 && ! initializer_constant_valid_p (value
, endtype
))
4346 return error_mark_node
;
4351 /* Perform appropriate conversions on the initial value of a variable,
4352 store it in the declaration DECL,
4353 and print any error messages that are appropriate.
4354 If the init is invalid, store an ERROR_MARK. */
4357 store_init_value (decl
, init
)
4360 register tree value
, type
;
4362 /* If variable's type was invalidly declared, just ignore it. */
4364 type
= TREE_TYPE (decl
);
4365 if (TREE_CODE (type
) == ERROR_MARK
)
4368 /* Digest the specified initializer into an expression. */
4370 value
= digest_init (type
, init
, TREE_STATIC (decl
),
4371 TREE_STATIC (decl
) || pedantic
);
4373 /* Store the expression if valid; else report error. */
4376 /* Note that this is the only place we can detect the error
4377 in a case such as struct foo bar = (struct foo) { x, y };
4378 where there is one initial value which is a constructor expression. */
4379 if (value
== error_mark_node
)
4381 else if (TREE_STATIC (decl
) && ! TREE_CONSTANT (value
))
4383 error ("initializer for static variable is not constant");
4384 value
= error_mark_node
;
4386 else if (TREE_STATIC (decl
)
4387 && initializer_constant_valid_p (value
, TREE_TYPE (value
)) == 0)
4389 error ("initializer for static variable uses complicated arithmetic");
4390 value
= error_mark_node
;
4394 if (pedantic
&& TREE_CODE (value
) == CONSTRUCTOR
)
4396 if (! TREE_CONSTANT (value
))
4397 pedwarn ("aggregate initializer is not constant");
4398 else if (! TREE_STATIC (value
))
4399 pedwarn ("aggregate initializer uses complicated arithmetic");
4404 DECL_INITIAL (decl
) = value
;
4406 /* ANSI wants warnings about out-of-range constant initializers. */
4407 STRIP_TYPE_NOPS (value
);
4408 constant_expression_warning (value
);
4411 /* Methods for storing and printing names for error messages. */
4413 /* Implement a spelling stack that allows components of a name to be pushed
4414 and popped. Each element on the stack is this structure. */
4426 #define SPELLING_STRING 1
4427 #define SPELLING_MEMBER 2
4428 #define SPELLING_BOUNDS 3
4430 static struct spelling
*spelling
; /* Next stack element (unused). */
4431 static struct spelling
*spelling_base
; /* Spelling stack base. */
4432 static int spelling_size
; /* Size of the spelling stack. */
4434 /* Macros to save and restore the spelling stack around push_... functions.
4435 Alternative to SAVE_SPELLING_STACK. */
4437 #define SPELLING_DEPTH() (spelling - spelling_base)
4438 #define RESTORE_SPELLING_DEPTH(depth) (spelling = spelling_base + depth)
4440 /* Save and restore the spelling stack around arbitrary C code. */
4442 #define SAVE_SPELLING_DEPTH(code) \
4444 int __depth = SPELLING_DEPTH (); \
4446 RESTORE_SPELLING_DEPTH (__depth); \
4449 /* Push an element on the spelling stack with type KIND and assign VALUE
4452 #define PUSH_SPELLING(KIND, VALUE, MEMBER) \
4454 int depth = SPELLING_DEPTH (); \
4456 if (depth >= spelling_size) \
4458 spelling_size += 10; \
4459 if (spelling_base == 0) \
4461 = (struct spelling *) xmalloc (spelling_size * sizeof (struct spelling)); \
4464 = (struct spelling *) xrealloc (spelling_base, \
4465 spelling_size * sizeof (struct spelling)); \
4466 RESTORE_SPELLING_DEPTH (depth); \
4469 spelling->kind = (KIND); \
4470 spelling->MEMBER = (VALUE); \
4474 /* Push STRING on the stack. Printed literally. */
4477 push_string (string
)
4480 PUSH_SPELLING (SPELLING_STRING
, string
, u
.s
);
4483 /* Push a member name on the stack. Printed as '.' STRING. */
4486 push_member_name (decl
)
4491 = DECL_NAME (decl
) ? IDENTIFIER_POINTER (DECL_NAME (decl
)) : "<anonymous>";
4492 PUSH_SPELLING (SPELLING_MEMBER
, string
, u
.s
);
4495 /* Push an array bounds on the stack. Printed as [BOUNDS]. */
4498 push_array_bounds (bounds
)
4501 PUSH_SPELLING (SPELLING_BOUNDS
, bounds
, u
.i
);
4504 /* Compute the maximum size in bytes of the printed spelling. */
4509 register int size
= 0;
4510 register struct spelling
*p
;
4512 for (p
= spelling_base
; p
< spelling
; p
++)
4514 if (p
->kind
== SPELLING_BOUNDS
)
4517 size
+= strlen (p
->u
.s
) + 1;
4523 /* Print the spelling to BUFFER and return it. */
4526 print_spelling (buffer
)
4527 register char *buffer
;
4529 register char *d
= buffer
;
4530 register struct spelling
*p
;
4532 for (p
= spelling_base
; p
< spelling
; p
++)
4533 if (p
->kind
== SPELLING_BOUNDS
)
4535 sprintf (d
, "[%d]", p
->u
.i
);
4540 register const char *s
;
4541 if (p
->kind
== SPELLING_MEMBER
)
4543 for (s
= p
->u
.s
; (*d
= *s
++); d
++)
4550 /* Issue an error message for a bad initializer component.
4551 MSGID identifies the message.
4552 The component name is taken from the spelling stack. */
4560 error ("%s", msgid
);
4561 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4563 error ("(near initialization for `%s')", ofwhat
);
4566 /* Issue a pedantic warning for a bad initializer component.
4567 MSGID identifies the message.
4568 The component name is taken from the spelling stack. */
4571 pedwarn_init (msgid
)
4576 pedwarn ("%s", msgid
);
4577 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4579 pedwarn ("(near initialization for `%s')", ofwhat
);
4582 /* Issue a warning for a bad initializer component.
4583 MSGID identifies the message.
4584 The component name is taken from the spelling stack. */
4587 warning_init (msgid
)
4592 warning ("%s", msgid
);
4593 ofwhat
= print_spelling ((char *) alloca (spelling_length () + 1));
4595 warning ("(near initialization for `%s')", ofwhat
);
4598 /* Digest the parser output INIT as an initializer for type TYPE.
4599 Return a C expression of type TYPE to represent the initial value.
4601 The arguments REQUIRE_CONSTANT and CONSTRUCTOR_CONSTANT request errors
4602 if non-constant initializers or elements are seen. CONSTRUCTOR_CONSTANT
4603 applies only to elements of constructors. */
4606 digest_init (type
, init
, require_constant
, constructor_constant
)
4608 int require_constant
, constructor_constant
;
4610 enum tree_code code
= TREE_CODE (type
);
4611 tree inside_init
= init
;
4613 if (type
== error_mark_node
4614 || init
== error_mark_node
4615 || TREE_TYPE (init
) == error_mark_node
)
4616 return error_mark_node
;
4618 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4619 /* Do not use STRIP_NOPS here. We do not want an enumerator
4620 whose value is 0 to count as a null pointer constant. */
4621 if (TREE_CODE (init
) == NON_LVALUE_EXPR
)
4622 inside_init
= TREE_OPERAND (init
, 0);
4624 /* Initialization of an array of chars from a string constant
4625 optionally enclosed in braces. */
4627 if (code
== ARRAY_TYPE
)
4629 tree typ1
= TYPE_MAIN_VARIANT (TREE_TYPE (type
));
4630 if ((typ1
== char_type_node
4631 || typ1
== signed_char_type_node
4632 || typ1
== unsigned_char_type_node
4633 || typ1
== unsigned_wchar_type_node
4634 || typ1
== signed_wchar_type_node
)
4635 && ((inside_init
&& TREE_CODE (inside_init
) == STRING_CST
)))
4637 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4638 TYPE_MAIN_VARIANT (type
)))
4641 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init
)))
4643 && TYPE_PRECISION (typ1
) == TYPE_PRECISION (char_type_node
))
4645 error_init ("char-array initialized from wide string");
4646 return error_mark_node
;
4648 if ((TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (inside_init
)))
4650 && TYPE_PRECISION (typ1
) != TYPE_PRECISION (char_type_node
))
4652 error_init ("int-array initialized from non-wide string");
4653 return error_mark_node
;
4656 TREE_TYPE (inside_init
) = type
;
4657 if (TYPE_DOMAIN (type
) != 0
4658 && TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
4659 /* Subtract 1 (or sizeof (wchar_t))
4660 because it's ok to ignore the terminating null char
4661 that is counted in the length of the constant. */
4662 && 0 > compare_tree_int (TYPE_SIZE_UNIT (type
),
4663 TREE_STRING_LENGTH (inside_init
)
4664 - ((TYPE_PRECISION (typ1
)
4665 != TYPE_PRECISION (char_type_node
))
4666 ? (TYPE_PRECISION (wchar_type_node
)
4669 pedwarn_init ("initializer-string for array of chars is too long");
4675 /* Any type can be initialized
4676 from an expression of the same type, optionally with braces. */
4678 if (inside_init
&& TREE_TYPE (inside_init
) != 0
4679 && (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (inside_init
)),
4680 TYPE_MAIN_VARIANT (type
))
4681 || (code
== ARRAY_TYPE
4682 && comptypes (TREE_TYPE (inside_init
), type
))
4683 || (code
== POINTER_TYPE
4684 && (TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
4685 || TREE_CODE (TREE_TYPE (inside_init
)) == FUNCTION_TYPE
)
4686 && comptypes (TREE_TYPE (TREE_TYPE (inside_init
)),
4687 TREE_TYPE (type
)))))
4689 if (code
== POINTER_TYPE
4690 && (TREE_CODE (TREE_TYPE (inside_init
)) == ARRAY_TYPE
4691 || TREE_CODE (TREE_TYPE (inside_init
)) == FUNCTION_TYPE
))
4692 inside_init
= default_conversion (inside_init
);
4693 else if (code
== ARRAY_TYPE
&& TREE_CODE (inside_init
) != STRING_CST
4694 && TREE_CODE (inside_init
) != CONSTRUCTOR
)
4696 error_init ("array initialized from non-constant array expression");
4697 return error_mark_node
;
4700 if (optimize
&& TREE_CODE (inside_init
) == VAR_DECL
)
4701 inside_init
= decl_constant_value (inside_init
);
4703 /* Compound expressions can only occur here if -pedantic or
4704 -pedantic-errors is specified. In the later case, we always want
4705 an error. In the former case, we simply want a warning. */
4706 if (require_constant
&& pedantic
4707 && TREE_CODE (inside_init
) == COMPOUND_EXPR
)
4710 = valid_compound_expr_initializer (inside_init
,
4711 TREE_TYPE (inside_init
));
4712 if (inside_init
== error_mark_node
)
4713 error_init ("initializer element is not constant");
4715 pedwarn_init ("initializer element is not constant");
4716 if (flag_pedantic_errors
)
4717 inside_init
= error_mark_node
;
4719 else if (require_constant
&& ! TREE_CONSTANT (inside_init
))
4721 error_init ("initializer element is not constant");
4722 inside_init
= error_mark_node
;
4724 else if (require_constant
4725 && initializer_constant_valid_p (inside_init
, TREE_TYPE (inside_init
)) == 0)
4727 error_init ("initializer element is not computable at load time");
4728 inside_init
= error_mark_node
;
4734 /* Handle scalar types, including conversions. */
4736 if (code
== INTEGER_TYPE
|| code
== REAL_TYPE
|| code
== POINTER_TYPE
4737 || code
== ENUMERAL_TYPE
|| code
== COMPLEX_TYPE
)
4739 /* Note that convert_for_assignment calls default_conversion
4740 for arrays and functions. We must not call it in the
4741 case where inside_init is a null pointer constant. */
4743 = convert_for_assignment (type
, init
, _("initialization"),
4744 NULL_TREE
, NULL_TREE
, 0);
4746 if (require_constant
&& ! TREE_CONSTANT (inside_init
))
4748 error_init ("initializer element is not constant");
4749 inside_init
= error_mark_node
;
4751 else if (require_constant
4752 && initializer_constant_valid_p (inside_init
, TREE_TYPE (inside_init
)) == 0)
4754 error_init ("initializer element is not computable at load time");
4755 inside_init
= error_mark_node
;
4761 /* Come here only for records and arrays. */
4763 if (COMPLETE_TYPE_P (type
) && TREE_CODE (TYPE_SIZE (type
)) != INTEGER_CST
)
4765 error_init ("variable-sized object may not be initialized");
4766 return error_mark_node
;
4769 /* Traditionally, you can write struct foo x = 0;
4770 and it initializes the first element of x to 0. */
4771 if (flag_traditional
)
4773 tree top
= 0, prev
= 0, otype
= type
;
4774 while (TREE_CODE (type
) == RECORD_TYPE
4775 || TREE_CODE (type
) == ARRAY_TYPE
4776 || TREE_CODE (type
) == QUAL_UNION_TYPE
4777 || TREE_CODE (type
) == UNION_TYPE
)
4779 tree temp
= build (CONSTRUCTOR
, type
, NULL_TREE
, NULL_TREE
);
4783 TREE_OPERAND (prev
, 1) = build_tree_list (NULL_TREE
, temp
);
4785 if (TREE_CODE (type
) == ARRAY_TYPE
)
4786 type
= TREE_TYPE (type
);
4787 else if (TYPE_FIELDS (type
))
4788 type
= TREE_TYPE (TYPE_FIELDS (type
));
4791 error_init ("invalid initializer");
4792 return error_mark_node
;
4798 TREE_OPERAND (prev
, 1)
4799 = build_tree_list (NULL_TREE
,
4800 digest_init (type
, init
, require_constant
,
4801 constructor_constant
));
4805 return error_mark_node
;
4807 error_init ("invalid initializer");
4808 return error_mark_node
;
4811 /* Handle initializers that use braces. */
4813 /* Type of object we are accumulating a constructor for.
4814 This type is always a RECORD_TYPE, UNION_TYPE or ARRAY_TYPE. */
4815 static tree constructor_type
;
4817 /* For a RECORD_TYPE or UNION_TYPE, this is the chain of fields
4819 static tree constructor_fields
;
4821 /* For an ARRAY_TYPE, this is the specified index
4822 at which to store the next element we get. */
4823 static tree constructor_index
;
4825 /* For an ARRAY_TYPE, this is the end index of the range
4826 to initialize with the next element, or NULL in the ordinary case
4827 where the element is used just once. */
4828 static tree constructor_range_end
;
4830 /* For an ARRAY_TYPE, this is the maximum index. */
4831 static tree constructor_max_index
;
4833 /* For a RECORD_TYPE, this is the first field not yet written out. */
4834 static tree constructor_unfilled_fields
;
4836 /* For an ARRAY_TYPE, this is the index of the first element
4837 not yet written out. */
4838 static tree constructor_unfilled_index
;
4840 /* In a RECORD_TYPE, the byte index of the next consecutive field.
4841 This is so we can generate gaps between fields, when appropriate. */
4842 static tree constructor_bit_index
;
4844 /* If we are saving up the elements rather than allocating them,
4845 this is the list of elements so far (in reverse order,
4846 most recent first). */
4847 static tree constructor_elements
;
4849 /* 1 if so far this constructor's elements are all compile-time constants. */
4850 static int constructor_constant
;
4852 /* 1 if so far this constructor's elements are all valid address constants. */
4853 static int constructor_simple
;
4855 /* 1 if this constructor is erroneous so far. */
4856 static int constructor_erroneous
;
4858 /* 1 if have called defer_addressed_constants. */
4859 static int constructor_subconstants_deferred
;
4861 /* Structure for managing pending initializer elements, organized as an
4866 struct init_node
*left
, *right
;
4867 struct init_node
*parent
;
4873 /* Tree of pending elements at this constructor level.
4874 These are elements encountered out of order
4875 which belong at places we haven't reached yet in actually
4877 Will never hold tree nodes across GC runs. */
4878 static struct init_node
*constructor_pending_elts
;
4880 /* The SPELLING_DEPTH of this constructor. */
4881 static int constructor_depth
;
4883 /* 0 if implicitly pushing constructor levels is allowed. */
4884 int constructor_no_implicit
= 0; /* 0 for C; 1 for some other languages. */
4886 static int require_constant_value
;
4887 static int require_constant_elements
;
4889 /* 1 if it is ok to output this constructor as we read it.
4890 0 means must accumulate a CONSTRUCTOR expression. */
4891 static int constructor_incremental
;
4893 /* DECL node for which an initializer is being read.
4894 0 means we are reading a constructor expression
4895 such as (struct foo) {...}. */
4896 static tree constructor_decl
;
4898 /* start_init saves the ASMSPEC arg here for really_start_incremental_init. */
4899 static char *constructor_asmspec
;
4901 /* Nonzero if this is an initializer for a top-level decl. */
4902 static int constructor_top_level
;
4905 /* This stack has a level for each implicit or explicit level of
4906 structuring in the initializer, including the outermost one. It
4907 saves the values of most of the variables above. */
4909 struct constructor_stack
4911 struct constructor_stack
*next
;
4917 tree unfilled_index
;
4918 tree unfilled_fields
;
4922 struct init_node
*pending_elts
;
4924 /* If nonzero, this value should replace the entire
4925 constructor at this level. */
4926 tree replacement_value
;
4935 struct constructor_stack
*constructor_stack
;
4937 /* This stack records separate initializers that are nested.
4938 Nested initializers can't happen in ANSI C, but GNU C allows them
4939 in cases like { ... (struct foo) { ... } ... }. */
4941 struct initializer_stack
4943 struct initializer_stack
*next
;
4946 struct constructor_stack
*constructor_stack
;
4948 struct spelling
*spelling
;
4949 struct spelling
*spelling_base
;
4953 char require_constant_value
;
4954 char require_constant_elements
;
4958 struct initializer_stack
*initializer_stack
;
4960 /* Prepare to parse and output the initializer for variable DECL. */
4963 start_init (decl
, asmspec_tree
, top_level
)
4969 struct initializer_stack
*p
4970 = (struct initializer_stack
*) xmalloc (sizeof (struct initializer_stack
));
4974 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
4976 p
->decl
= constructor_decl
;
4977 p
->asmspec
= constructor_asmspec
;
4978 p
->incremental
= constructor_incremental
;
4979 p
->require_constant_value
= require_constant_value
;
4980 p
->require_constant_elements
= require_constant_elements
;
4981 p
->constructor_stack
= constructor_stack
;
4982 p
->elements
= constructor_elements
;
4983 p
->spelling
= spelling
;
4984 p
->spelling_base
= spelling_base
;
4985 p
->spelling_size
= spelling_size
;
4986 p
->deferred
= constructor_subconstants_deferred
;
4987 p
->top_level
= constructor_top_level
;
4988 p
->next
= initializer_stack
;
4989 initializer_stack
= p
;
4991 constructor_decl
= decl
;
4992 constructor_incremental
= top_level
;
4993 constructor_asmspec
= asmspec
;
4994 constructor_subconstants_deferred
= 0;
4995 constructor_top_level
= top_level
;
4999 require_constant_value
= TREE_STATIC (decl
);
5000 require_constant_elements
5001 = ((TREE_STATIC (decl
) || pedantic
)
5002 /* For a scalar, you can always use any value to initialize,
5003 even within braces. */
5004 && (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
5005 || TREE_CODE (TREE_TYPE (decl
)) == RECORD_TYPE
5006 || TREE_CODE (TREE_TYPE (decl
)) == UNION_TYPE
5007 || TREE_CODE (TREE_TYPE (decl
)) == QUAL_UNION_TYPE
));
5008 locus
= IDENTIFIER_POINTER (DECL_NAME (decl
));
5009 constructor_incremental
|= TREE_STATIC (decl
);
5013 require_constant_value
= 0;
5014 require_constant_elements
= 0;
5015 locus
= "(anonymous)";
5018 constructor_stack
= 0;
5020 missing_braces_mentioned
= 0;
5024 RESTORE_SPELLING_DEPTH (0);
5027 push_string (locus
);
5033 struct initializer_stack
*p
= initializer_stack
;
5035 /* Output subconstants (string constants, usually)
5036 that were referenced within this initializer and saved up.
5037 Must do this if and only if we called defer_addressed_constants. */
5038 if (constructor_subconstants_deferred
)
5039 output_deferred_addressed_constants ();
5041 /* Free the whole constructor stack of this initializer. */
5042 while (constructor_stack
)
5044 struct constructor_stack
*q
= constructor_stack
;
5045 constructor_stack
= q
->next
;
5049 /* Pop back to the data of the outer initializer (if any). */
5050 constructor_decl
= p
->decl
;
5051 constructor_asmspec
= p
->asmspec
;
5052 constructor_incremental
= p
->incremental
;
5053 require_constant_value
= p
->require_constant_value
;
5054 require_constant_elements
= p
->require_constant_elements
;
5055 constructor_stack
= p
->constructor_stack
;
5056 constructor_elements
= p
->elements
;
5057 spelling
= p
->spelling
;
5058 spelling_base
= p
->spelling_base
;
5059 spelling_size
= p
->spelling_size
;
5060 constructor_subconstants_deferred
= p
->deferred
;
5061 constructor_top_level
= p
->top_level
;
5062 initializer_stack
= p
->next
;
5066 /* Call here when we see the initializer is surrounded by braces.
5067 This is instead of a call to push_init_level;
5068 it is matched by a call to pop_init_level.
5070 TYPE is the type to initialize, for a constructor expression.
5071 For an initializer for a decl, TYPE is zero. */
5074 really_start_incremental_init (type
)
5077 struct constructor_stack
*p
5078 = (struct constructor_stack
*) xmalloc (sizeof (struct constructor_stack
));
5081 type
= TREE_TYPE (constructor_decl
);
5083 /* Turn off constructor_incremental if type is a struct with bitfields.
5084 Do this before the first push, so that the corrected value
5085 is available in finish_init. */
5086 check_init_type_bitfields (type
);
5088 p
->type
= constructor_type
;
5089 p
->fields
= constructor_fields
;
5090 p
->index
= constructor_index
;
5091 p
->range_end
= constructor_range_end
;
5092 p
->max_index
= constructor_max_index
;
5093 p
->unfilled_index
= constructor_unfilled_index
;
5094 p
->unfilled_fields
= constructor_unfilled_fields
;
5095 p
->bit_index
= constructor_bit_index
;
5096 p
->elements
= constructor_elements
;
5097 p
->constant
= constructor_constant
;
5098 p
->simple
= constructor_simple
;
5099 p
->erroneous
= constructor_erroneous
;
5100 p
->pending_elts
= constructor_pending_elts
;
5101 p
->depth
= constructor_depth
;
5102 p
->replacement_value
= 0;
5104 p
->incremental
= constructor_incremental
;
5107 constructor_stack
= p
;
5109 constructor_constant
= 1;
5110 constructor_simple
= 1;
5111 constructor_depth
= SPELLING_DEPTH ();
5112 constructor_elements
= 0;
5113 constructor_pending_elts
= 0;
5114 constructor_type
= type
;
5116 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5117 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5119 constructor_fields
= TYPE_FIELDS (constructor_type
);
5120 /* Skip any nameless bit fields at the beginning. */
5121 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
5122 && DECL_NAME (constructor_fields
) == 0)
5123 constructor_fields
= TREE_CHAIN (constructor_fields
);
5125 constructor_unfilled_fields
= constructor_fields
;
5126 constructor_bit_index
= bitsize_zero_node
;
5128 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5130 constructor_range_end
= 0;
5131 if (TYPE_DOMAIN (constructor_type
))
5133 constructor_max_index
5134 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
5136 = convert (bitsizetype
,
5137 TYPE_MIN_VALUE (TYPE_DOMAIN (constructor_type
)));
5140 constructor_index
= bitsize_zero_node
;
5142 constructor_unfilled_index
= constructor_index
;
5146 /* Handle the case of int x = {5}; */
5147 constructor_fields
= constructor_type
;
5148 constructor_unfilled_fields
= constructor_type
;
5151 if (constructor_incremental
)
5153 make_decl_rtl (constructor_decl
, constructor_asmspec
,
5154 constructor_top_level
);
5155 assemble_variable (constructor_decl
, constructor_top_level
, 0, 1);
5157 defer_addressed_constants ();
5158 constructor_subconstants_deferred
= 1;
5162 /* Push down into a subobject, for initialization.
5163 If this is for an explicit set of braces, IMPLICIT is 0.
5164 If it is because the next element belongs at a lower level,
5168 push_init_level (implicit
)
5171 struct constructor_stack
*p
;
5173 /* If we've exhausted any levels that didn't have braces,
5175 while (constructor_stack
->implicit
)
5177 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
5178 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5179 && constructor_fields
== 0)
5180 process_init_element (pop_init_level (1));
5181 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5182 && tree_int_cst_lt (constructor_max_index
, constructor_index
))
5183 process_init_element (pop_init_level (1));
5188 /* Structure elements may require alignment. Do this now if necessary
5189 for the subaggregate, and if it comes next in sequence. Don't do
5190 this for subaggregates that will go on the pending list. */
5191 if (constructor_incremental
&& constructor_type
!= 0
5192 && TREE_CODE (constructor_type
) == RECORD_TYPE
&& constructor_fields
5193 && constructor_fields
== constructor_unfilled_fields
)
5195 /* Advance to offset of this element. */
5196 if (! tree_int_cst_equal (constructor_bit_index
,
5197 bit_position (constructor_fields
)))
5200 (size_binop (TRUNC_DIV_EXPR
,
5201 size_binop (MINUS_EXPR
,
5202 bit_position (constructor_fields
),
5203 constructor_bit_index
),
5207 /* Indicate that we have now filled the structure up to the current
5209 constructor_unfilled_fields
= constructor_fields
;
5212 p
= (struct constructor_stack
*) xmalloc (sizeof (struct constructor_stack
));
5213 p
->type
= constructor_type
;
5214 p
->fields
= constructor_fields
;
5215 p
->index
= constructor_index
;
5216 p
->range_end
= constructor_range_end
;
5217 p
->max_index
= constructor_max_index
;
5218 p
->unfilled_index
= constructor_unfilled_index
;
5219 p
->unfilled_fields
= constructor_unfilled_fields
;
5220 p
->bit_index
= constructor_bit_index
;
5221 p
->elements
= constructor_elements
;
5222 p
->constant
= constructor_constant
;
5223 p
->simple
= constructor_simple
;
5224 p
->erroneous
= constructor_erroneous
;
5225 p
->pending_elts
= constructor_pending_elts
;
5226 p
->depth
= constructor_depth
;
5227 p
->replacement_value
= 0;
5228 p
->implicit
= implicit
;
5229 p
->incremental
= constructor_incremental
;
5231 p
->next
= constructor_stack
;
5232 constructor_stack
= p
;
5234 constructor_constant
= 1;
5235 constructor_simple
= 1;
5236 constructor_depth
= SPELLING_DEPTH ();
5237 constructor_elements
= 0;
5238 constructor_pending_elts
= 0;
5240 /* Don't die if an entire brace-pair level is superfluous
5241 in the containing level. */
5242 if (constructor_type
== 0)
5244 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
5245 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5247 /* Don't die if there are extra init elts at the end. */
5248 if (constructor_fields
== 0)
5249 constructor_type
= 0;
5252 constructor_type
= TREE_TYPE (constructor_fields
);
5253 push_member_name (constructor_fields
);
5254 constructor_depth
++;
5255 if (constructor_fields
!= constructor_unfilled_fields
)
5256 constructor_incremental
= 0;
5259 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5261 constructor_type
= TREE_TYPE (constructor_type
);
5262 push_array_bounds (tree_low_cst (constructor_index
, 0));
5263 constructor_depth
++;
5264 if (! tree_int_cst_equal (constructor_index
, constructor_unfilled_index
)
5265 || constructor_range_end
!= 0)
5266 constructor_incremental
= 0;
5269 if (constructor_type
== 0)
5271 error_init ("extra brace group at end of initializer");
5272 constructor_fields
= 0;
5273 constructor_unfilled_fields
= 0;
5277 /* Turn off constructor_incremental if type is a struct with bitfields. */
5278 check_init_type_bitfields (constructor_type
);
5280 if (implicit
&& warn_missing_braces
&& !missing_braces_mentioned
)
5282 missing_braces_mentioned
= 1;
5283 warning_init ("missing braces around initializer");
5286 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5287 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5289 constructor_fields
= TYPE_FIELDS (constructor_type
);
5290 /* Skip any nameless bit fields at the beginning. */
5291 while (constructor_fields
!= 0 && DECL_C_BIT_FIELD (constructor_fields
)
5292 && DECL_NAME (constructor_fields
) == 0)
5293 constructor_fields
= TREE_CHAIN (constructor_fields
);
5295 constructor_unfilled_fields
= constructor_fields
;
5296 constructor_bit_index
= bitsize_zero_node
;
5298 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5300 constructor_range_end
= 0;
5301 if (TYPE_DOMAIN (constructor_type
))
5303 constructor_max_index
5304 = TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
));
5306 = convert (bitsizetype
,
5308 (TYPE_DOMAIN (constructor_type
)));
5311 constructor_index
= bitsize_zero_node
;
5313 constructor_unfilled_index
= constructor_index
;
5317 warning_init ("braces around scalar initializer");
5318 constructor_fields
= constructor_type
;
5319 constructor_unfilled_fields
= constructor_type
;
5323 /* Don't read a struct incrementally if it has any bitfields,
5324 because the incremental reading code doesn't know how to
5325 handle bitfields yet. */
5328 check_init_type_bitfields (type
)
5331 if (TREE_CODE (type
) == RECORD_TYPE
)
5334 for (tail
= TYPE_FIELDS (type
); tail
;
5335 tail
= TREE_CHAIN (tail
))
5337 if (DECL_C_BIT_FIELD (tail
))
5339 constructor_incremental
= 0;
5343 check_init_type_bitfields (TREE_TYPE (tail
));
5347 else if (TREE_CODE (type
) == UNION_TYPE
)
5349 tree tail
= TYPE_FIELDS (type
);
5350 if (tail
&& DECL_C_BIT_FIELD (tail
))
5351 /* We also use the nonincremental algorithm for initiliazation
5352 of unions whose first member is a bitfield, becuase the
5353 incremental algorithm has no code for dealing with
5355 constructor_incremental
= 0;
5358 else if (TREE_CODE (type
) == ARRAY_TYPE
)
5359 check_init_type_bitfields (TREE_TYPE (type
));
5362 /* At the end of an implicit or explicit brace level,
5363 finish up that level of constructor.
5364 If we were outputting the elements as they are read, return 0
5365 from inner levels (process_init_element ignores that),
5366 but return error_mark_node from the outermost level
5367 (that's what we want to put in DECL_INITIAL).
5368 Otherwise, return a CONSTRUCTOR expression. */
5371 pop_init_level (implicit
)
5374 struct constructor_stack
*p
;
5375 HOST_WIDE_INT size
= 0;
5376 tree constructor
= 0;
5380 /* When we come to an explicit close brace,
5381 pop any inner levels that didn't have explicit braces. */
5382 while (constructor_stack
->implicit
)
5383 process_init_element (pop_init_level (1));
5386 p
= constructor_stack
;
5388 if (constructor_type
!= 0)
5389 size
= int_size_in_bytes (constructor_type
);
5391 /* Warn when some struct elements are implicitly initialized to zero. */
5394 && TREE_CODE (constructor_type
) == RECORD_TYPE
5395 && constructor_unfilled_fields
)
5397 push_member_name (constructor_unfilled_fields
);
5398 warning_init ("missing initializer");
5399 RESTORE_SPELLING_DEPTH (constructor_depth
);
5402 /* Now output all pending elements. */
5403 output_pending_init_elements (1);
5405 #if 0 /* c-parse.in warns about {}. */
5406 /* In ANSI, each brace level must have at least one element. */
5407 if (! implicit
&& pedantic
5408 && (TREE_CODE (constructor_type
) == ARRAY_TYPE
5409 ? integer_zerop (constructor_unfilled_index
)
5410 : constructor_unfilled_fields
== TYPE_FIELDS (constructor_type
)))
5411 pedwarn_init ("empty braces in initializer");
5414 /* Pad out the end of the structure. */
5416 if (p
->replacement_value
)
5418 /* If this closes a superfluous brace pair,
5419 just pass out the element between them. */
5420 constructor
= p
->replacement_value
;
5421 /* If this is the top level thing within the initializer,
5422 and it's for a variable, then since we already called
5423 assemble_variable, we must output the value now. */
5424 if (p
->next
== 0 && constructor_decl
!= 0
5425 && constructor_incremental
)
5427 constructor
= digest_init (constructor_type
, constructor
,
5428 require_constant_value
,
5429 require_constant_elements
);
5431 /* If initializing an array of unknown size,
5432 determine the size now. */
5433 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5434 && TYPE_DOMAIN (constructor_type
) == 0)
5436 /* We shouldn't have an incomplete array type within
5438 if (constructor_stack
->next
)
5441 if (complete_array_type (constructor_type
, constructor
, 0))
5444 size
= int_size_in_bytes (constructor_type
);
5447 output_constant (constructor
, size
);
5450 else if (constructor_type
== 0)
5452 else if (TREE_CODE (constructor_type
) != RECORD_TYPE
5453 && TREE_CODE (constructor_type
) != UNION_TYPE
5454 && TREE_CODE (constructor_type
) != ARRAY_TYPE
5455 && ! constructor_incremental
)
5457 /* A nonincremental scalar initializer--just return
5458 the element, after verifying there is just one. */
5459 if (constructor_elements
== 0)
5461 error_init ("empty scalar initializer");
5462 constructor
= error_mark_node
;
5464 else if (TREE_CHAIN (constructor_elements
) != 0)
5466 error_init ("extra elements in scalar initializer");
5467 constructor
= TREE_VALUE (constructor_elements
);
5470 constructor
= TREE_VALUE (constructor_elements
);
5472 else if (! constructor_incremental
)
5474 if (constructor_erroneous
)
5475 constructor
= error_mark_node
;
5478 constructor
= build (CONSTRUCTOR
, constructor_type
, NULL_TREE
,
5479 nreverse (constructor_elements
));
5480 if (constructor_constant
)
5481 TREE_CONSTANT (constructor
) = 1;
5482 if (constructor_constant
&& constructor_simple
)
5483 TREE_STATIC (constructor
) = 1;
5490 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5491 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5492 /* Find the offset of the end of that field. */
5493 filled
= size_binop (CEIL_DIV_EXPR
, constructor_bit_index
,
5496 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5498 /* If initializing an array of unknown size,
5499 determine the size now. */
5500 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5501 && TYPE_DOMAIN (constructor_type
) == 0)
5504 = copy_node (size_diffop (constructor_unfilled_index
,
5507 TYPE_DOMAIN (constructor_type
) = build_index_type (maxindex
);
5508 TREE_TYPE (maxindex
) = TYPE_DOMAIN (constructor_type
);
5510 /* TYPE_MAX_VALUE is always one less than the number of elements
5511 in the array, because we start counting at zero. Therefore,
5512 warn only if the value is less than zero. */
5514 && (tree_int_cst_sgn
5515 (TYPE_MAX_VALUE (TYPE_DOMAIN (constructor_type
)))
5517 error_with_decl (constructor_decl
,
5518 "zero or negative array size `%s'");
5520 layout_type (constructor_type
);
5521 size
= int_size_in_bytes (constructor_type
);
5525 = size_binop (MULT_EXPR
, constructor_unfilled_index
,
5526 convert (bitsizetype
,
5528 (TREE_TYPE (constructor_type
))));
5534 assemble_zeros (size
- tree_low_cst (filled
, 1));
5538 constructor_type
= p
->type
;
5539 constructor_fields
= p
->fields
;
5540 constructor_index
= p
->index
;
5541 constructor_range_end
= p
->range_end
;
5542 constructor_max_index
= p
->max_index
;
5543 constructor_unfilled_index
= p
->unfilled_index
;
5544 constructor_unfilled_fields
= p
->unfilled_fields
;
5545 constructor_bit_index
= p
->bit_index
;
5546 constructor_elements
= p
->elements
;
5547 constructor_constant
= p
->constant
;
5548 constructor_simple
= p
->simple
;
5549 constructor_erroneous
= p
->erroneous
;
5550 constructor_pending_elts
= p
->pending_elts
;
5551 constructor_depth
= p
->depth
;
5552 constructor_incremental
= p
->incremental
;
5553 RESTORE_SPELLING_DEPTH (constructor_depth
);
5555 constructor_stack
= p
->next
;
5558 if (constructor
== 0)
5560 if (constructor_stack
== 0)
5561 return error_mark_node
;
5567 /* Within an array initializer, specify the next index to be initialized.
5568 FIRST is that index. If LAST is nonzero, then initialize a range
5569 of indices, running from FIRST through LAST. */
5572 set_init_index (first
, last
)
5575 while ((TREE_CODE (first
) == NOP_EXPR
5576 || TREE_CODE (first
) == CONVERT_EXPR
5577 || TREE_CODE (first
) == NON_LVALUE_EXPR
)
5578 && (TYPE_MODE (TREE_TYPE (first
))
5579 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (first
, 0)))))
5580 first
= TREE_OPERAND (first
, 0);
5583 while ((TREE_CODE (last
) == NOP_EXPR
5584 || TREE_CODE (last
) == CONVERT_EXPR
5585 || TREE_CODE (last
) == NON_LVALUE_EXPR
)
5586 && (TYPE_MODE (TREE_TYPE (last
))
5587 == TYPE_MODE (TREE_TYPE (TREE_OPERAND (last
, 0)))))
5588 last
= TREE_OPERAND (last
, 0);
5590 if (TREE_CODE (first
) != INTEGER_CST
)
5591 error_init ("nonconstant array index in initializer");
5592 else if (last
!= 0 && TREE_CODE (last
) != INTEGER_CST
)
5593 error_init ("nonconstant array index in initializer");
5594 else if (! constructor_unfilled_index
)
5595 error_init ("array index in non-array initializer");
5596 else if (tree_int_cst_lt (first
, constructor_unfilled_index
))
5597 error_init ("duplicate array index in initializer");
5600 constructor_index
= convert (bitsizetype
, first
);
5602 if (last
!= 0 && tree_int_cst_lt (last
, first
))
5603 error_init ("empty index range in initializer");
5607 pedwarn ("ANSI C forbids specifying element to initialize");
5609 constructor_range_end
= last
? convert (bitsizetype
, last
) : 0;
5614 /* Within a struct initializer, specify the next field to be initialized. */
5617 set_init_label (fieldname
)
5623 /* Don't die if an entire brace-pair level is superfluous
5624 in the containing level. */
5625 if (constructor_type
== 0)
5628 for (tail
= TYPE_FIELDS (constructor_type
); tail
;
5629 tail
= TREE_CHAIN (tail
))
5631 if (tail
== constructor_unfilled_fields
)
5633 if (DECL_NAME (tail
) == fieldname
)
5638 error ("unknown field `%s' specified in initializer",
5639 IDENTIFIER_POINTER (fieldname
));
5641 error ("field `%s' already initialized",
5642 IDENTIFIER_POINTER (fieldname
));
5645 constructor_fields
= tail
;
5647 pedwarn ("ANSI C forbids specifying structure member to initialize");
5651 /* Add a new initializer to the tree of pending initializers. PURPOSE
5652 indentifies the initializer, either array index or field in a structure.
5653 VALUE is the value of that index or field. */
5656 add_pending_init (purpose
, value
)
5657 tree purpose
, value
;
5659 struct init_node
*p
, **q
, *r
;
5661 q
= &constructor_pending_elts
;
5664 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5669 if (tree_int_cst_lt (purpose
, p
->purpose
))
5671 else if (p
->purpose
!= purpose
)
5682 if (tree_int_cst_lt (bit_position (purpose
),
5683 bit_position (p
->purpose
)))
5685 else if (p
->purpose
!= purpose
)
5692 r
= (struct init_node
*) ggc_alloc (sizeof (struct init_node
));
5693 r
->purpose
= purpose
;
5704 struct init_node
*s
;
5708 if (p
->balance
== 0)
5710 else if (p
->balance
< 0)
5717 p
->left
->parent
= p
;
5734 constructor_pending_elts
= r
;
5739 struct init_node
*t
= r
->right
;
5743 r
->right
->parent
= r
;
5748 p
->left
->parent
= p
;
5751 p
->balance
= t
->balance
< 0;
5752 r
->balance
= -(t
->balance
> 0);
5767 constructor_pending_elts
= t
;
5773 /* p->balance == +1; growth of left side balances the node. */
5778 else /* r == p->right */
5780 if (p
->balance
== 0)
5781 /* Growth propagation from right side. */
5783 else if (p
->balance
> 0)
5790 p
->right
->parent
= p
;
5807 constructor_pending_elts
= r
;
5809 else /* r->balance == -1 */
5812 struct init_node
*t
= r
->left
;
5816 r
->left
->parent
= r
;
5821 p
->right
->parent
= p
;
5824 r
->balance
= (t
->balance
< 0);
5825 p
->balance
= -(t
->balance
> 0);
5840 constructor_pending_elts
= t
;
5846 /* p->balance == -1; growth of right side balances the node. */
5857 /* Return nonzero if FIELD is equal to the index of a pending initializer. */
5860 pending_init_member (field
)
5863 struct init_node
*p
;
5865 p
= constructor_pending_elts
;
5866 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5870 if (field
== p
->purpose
)
5872 else if (tree_int_cst_lt (field
, p
->purpose
))
5882 if (field
== p
->purpose
)
5884 else if (tree_int_cst_lt (bit_position (field
),
5885 bit_position (p
->purpose
)))
5895 /* "Output" the next constructor element.
5896 At top level, really output it to assembler code now.
5897 Otherwise, collect it in a list from which we will make a CONSTRUCTOR.
5898 TYPE is the data type that the containing data type wants here.
5899 FIELD is the field (a FIELD_DECL) or the index that this element fills.
5901 PENDING if non-nil means output pending elements that belong
5902 right after this element. (PENDING is normally 1;
5903 it is 0 while outputting pending elements, to avoid recursion.) */
5906 output_init_element (value
, type
, field
, pending
)
5907 tree value
, type
, field
;
5912 if (TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
5913 || (TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
5914 && !(TREE_CODE (value
) == STRING_CST
5915 && TREE_CODE (type
) == ARRAY_TYPE
5916 && TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
)
5917 && !comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (value
)),
5918 TYPE_MAIN_VARIANT (type
))))
5919 value
= default_conversion (value
);
5921 if (value
== error_mark_node
)
5922 constructor_erroneous
= 1;
5923 else if (!TREE_CONSTANT (value
))
5924 constructor_constant
= 0;
5925 else if (initializer_constant_valid_p (value
, TREE_TYPE (value
)) == 0
5926 || ((TREE_CODE (constructor_type
) == RECORD_TYPE
5927 || TREE_CODE (constructor_type
) == UNION_TYPE
)
5928 && DECL_C_BIT_FIELD (field
)
5929 && TREE_CODE (value
) != INTEGER_CST
))
5930 constructor_simple
= 0;
5932 if (require_constant_value
&& ! TREE_CONSTANT (value
))
5934 error_init ("initializer element is not constant");
5935 value
= error_mark_node
;
5937 else if (require_constant_elements
5938 && initializer_constant_valid_p (value
, TREE_TYPE (value
)) == 0)
5940 error_init ("initializer element is not computable at load time");
5941 value
= error_mark_node
;
5944 /* If this element duplicates one on constructor_pending_elts,
5945 print a message and ignore it. Don't do this when we're
5946 processing elements taken off constructor_pending_elts,
5947 because we'd always get spurious errors. */
5950 if (TREE_CODE (constructor_type
) == RECORD_TYPE
5951 || TREE_CODE (constructor_type
) == UNION_TYPE
5952 || TREE_CODE (constructor_type
) == ARRAY_TYPE
)
5954 if (pending_init_member (field
))
5956 error_init ("duplicate initializer");
5962 /* If this element doesn't come next in sequence,
5963 put it on constructor_pending_elts. */
5964 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
5965 && ! tree_int_cst_equal (field
, constructor_unfilled_index
))
5968 add_pending_init (field
,
5969 digest_init (type
, value
, require_constant_value
,
5970 require_constant_elements
));
5972 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
5973 && field
!= constructor_unfilled_fields
)
5975 /* We do this for records but not for unions. In a union,
5976 no matter which field is specified, it can be initialized
5977 right away since it starts at the beginning of the union. */
5979 add_pending_init (field
,
5980 digest_init (type
, value
, require_constant_value
,
5981 require_constant_elements
));
5985 /* Otherwise, output this element either to
5986 constructor_elements or to the assembler file. */
5990 if (! constructor_incremental
)
5992 if (field
&& TREE_CODE (field
) == INTEGER_CST
)
5993 field
= copy_node (field
);
5994 constructor_elements
5995 = tree_cons (field
, digest_init (type
, value
,
5996 require_constant_value
,
5997 require_constant_elements
),
5998 constructor_elements
);
6002 /* Structure elements may require alignment.
6003 Do this, if necessary. */
6004 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6005 && ! tree_int_cst_equal (constructor_bit_index
,
6006 bit_position (field
)))
6007 /* Advance to offset of this element. */
6010 (size_binop (TRUNC_DIV_EXPR
,
6011 size_binop (MINUS_EXPR
, bit_position (field
),
6012 constructor_bit_index
),
6016 output_constant (digest_init (type
, value
,
6017 require_constant_value
,
6018 require_constant_elements
),
6019 int_size_in_bytes (type
));
6021 /* For a record or union,
6022 keep track of end position of last field. */
6023 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6024 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6025 constructor_bit_index
6026 = size_binop (PLUS_EXPR
, bit_position (field
),
6031 /* Advance the variable that indicates sequential elements output. */
6032 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6033 constructor_unfilled_index
6034 = size_binop (PLUS_EXPR
, constructor_unfilled_index
,
6036 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
6038 constructor_unfilled_fields
6039 = TREE_CHAIN (constructor_unfilled_fields
);
6041 /* Skip any nameless bit fields. */
6042 while (constructor_unfilled_fields
!= 0
6043 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
6044 && DECL_NAME (constructor_unfilled_fields
) == 0)
6045 constructor_unfilled_fields
=
6046 TREE_CHAIN (constructor_unfilled_fields
);
6048 else if (TREE_CODE (constructor_type
) == UNION_TYPE
)
6049 constructor_unfilled_fields
= 0;
6051 /* Now output any pending elements which have become next. */
6053 output_pending_init_elements (0);
6057 /* Output any pending elements which have become next.
6058 As we output elements, constructor_unfilled_{fields,index}
6059 advances, which may cause other elements to become next;
6060 if so, they too are output.
6062 If ALL is 0, we return when there are
6063 no more pending elements to output now.
6065 If ALL is 1, we output space as necessary so that
6066 we can output all the pending elements. */
6069 output_pending_init_elements (all
)
6072 struct init_node
*elt
= constructor_pending_elts
;
6077 /* Look thru the whole pending tree.
6078 If we find an element that should be output now,
6079 output it. Otherwise, set NEXT to the element
6080 that comes first among those still pending. */
6085 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6087 if (tree_int_cst_equal (elt
->purpose
,
6088 constructor_unfilled_index
))
6089 output_init_element (elt
->value
,
6090 TREE_TYPE (constructor_type
),
6091 constructor_unfilled_index
, 0);
6092 else if (tree_int_cst_lt (constructor_unfilled_index
,
6095 /* Advance to the next smaller node. */
6100 /* We have reached the smallest node bigger than the
6101 current unfilled index. Fill the space first. */
6102 next
= elt
->purpose
;
6108 /* Advance to the next bigger node. */
6113 /* We have reached the biggest node in a subtree. Find
6114 the parent of it, which is the next bigger node. */
6115 while (elt
->parent
&& elt
->parent
->right
== elt
)
6118 if (elt
&& tree_int_cst_lt (constructor_unfilled_index
,
6121 next
= elt
->purpose
;
6127 else if (TREE_CODE (constructor_type
) == RECORD_TYPE
6128 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6130 /* If the current record is complete we are done. */
6131 if (constructor_unfilled_fields
== 0)
6133 if (elt
->purpose
== constructor_unfilled_fields
)
6135 output_init_element (elt
->value
,
6136 TREE_TYPE (constructor_unfilled_fields
),
6137 constructor_unfilled_fields
,
6140 else if (tree_int_cst_lt (bit_position (constructor_unfilled_fields
),
6141 bit_position (elt
->purpose
)))
6143 /* Advance to the next smaller node. */
6148 /* We have reached the smallest node bigger than the
6149 current unfilled field. Fill the space first. */
6150 next
= elt
->purpose
;
6156 /* Advance to the next bigger node. */
6161 /* We have reached the biggest node in a subtree. Find
6162 the parent of it, which is the next bigger node. */
6163 while (elt
->parent
&& elt
->parent
->right
== elt
)
6168 (bit_position (constructor_unfilled_fields
),
6169 bit_position (elt
->purpose
))))
6171 next
= elt
->purpose
;
6179 /* Ordinarily return, but not if we want to output all
6180 and there are elements left. */
6181 if (! (all
&& next
!= 0))
6184 /* Generate space up to the position of NEXT. */
6185 if (constructor_incremental
)
6188 tree nextpos_tree
= bitsize_zero_node
;
6190 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6191 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6195 /* Find the last field written out, if any. */
6196 for (tail
= TYPE_FIELDS (constructor_type
); tail
;
6197 tail
= TREE_CHAIN (tail
))
6198 if (TREE_CHAIN (tail
) == constructor_unfilled_fields
)
6202 /* Find the offset of the end of that field. */
6203 filled
= size_binop (CEIL_DIV_EXPR
,
6204 size_binop (PLUS_EXPR
, bit_position (tail
),
6208 filled
= bitsize_zero_node
;
6210 nextpos_tree
= convert (bitsizetype
, byte_position (next
));
6211 constructor_bit_index
= bit_position (next
);
6212 constructor_unfilled_fields
= next
;
6214 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6217 = size_binop (MULT_EXPR
, constructor_unfilled_index
,
6218 convert (bitsizetype
,
6220 (TREE_TYPE (constructor_type
))));
6222 = size_binop (MULT_EXPR
, next
,
6223 convert (bitsizetype
, TYPE_SIZE_UNIT
6224 (TREE_TYPE (constructor_type
))));
6225 constructor_unfilled_index
= next
;
6231 assemble_zeros (tree_low_cst (size_diffop (nextpos_tree
, filled
), 1));
6235 /* If it's not incremental, just skip over the gap,
6236 so that after jumping to retry we will output the next
6237 successive element. */
6238 if (TREE_CODE (constructor_type
) == RECORD_TYPE
6239 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6240 constructor_unfilled_fields
= next
;
6241 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6242 constructor_unfilled_index
= next
;
6245 /* ELT now points to the node in the pending tree with the next
6246 initializer to output. */
6250 /* Add one non-braced element to the current constructor level.
6251 This adjusts the current position within the constructor's type.
6252 This may also start or terminate implicit levels
6253 to handle a partly-braced initializer.
6255 Once this has found the correct level for the new element,
6256 it calls output_init_element.
6258 Note: if we are incrementally outputting this constructor,
6259 this function may be called with a null argument
6260 representing a sub-constructor that was already incrementally output.
6261 When that happens, we output nothing, but we do the bookkeeping
6262 to skip past that element of the current constructor. */
6265 process_init_element (value
)
6268 tree orig_value
= value
;
6269 int string_flag
= value
!= 0 && TREE_CODE (value
) == STRING_CST
;
6271 /* Handle superfluous braces around string cst as in
6272 char x[] = {"foo"}; */
6275 && TREE_CODE (constructor_type
) == ARRAY_TYPE
6276 && TREE_CODE (TREE_TYPE (constructor_type
)) == INTEGER_TYPE
6277 && integer_zerop (constructor_unfilled_index
))
6279 if (constructor_stack
->replacement_value
)
6280 error_init ("excess elements in char array initializer");
6281 constructor_stack
->replacement_value
= value
;
6285 if (constructor_stack
->replacement_value
!= 0)
6287 error_init ("excess elements in struct initializer");
6291 /* Ignore elements of a brace group if it is entirely superfluous
6292 and has already been diagnosed. */
6293 if (constructor_type
== 0)
6296 /* If we've exhausted any levels that didn't have braces,
6298 while (constructor_stack
->implicit
)
6300 if ((TREE_CODE (constructor_type
) == RECORD_TYPE
6301 || TREE_CODE (constructor_type
) == UNION_TYPE
)
6302 && constructor_fields
== 0)
6303 process_init_element (pop_init_level (1));
6304 else if (TREE_CODE (constructor_type
) == ARRAY_TYPE
6305 && (constructor_max_index
== 0
6306 || tree_int_cst_lt (constructor_max_index
,
6307 constructor_index
)))
6308 process_init_element (pop_init_level (1));
6315 if (TREE_CODE (constructor_type
) == RECORD_TYPE
)
6318 enum tree_code fieldcode
;
6320 if (constructor_fields
== 0)
6322 pedwarn_init ("excess elements in struct initializer");
6326 fieldtype
= TREE_TYPE (constructor_fields
);
6327 if (fieldtype
!= error_mark_node
)
6328 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
6329 fieldcode
= TREE_CODE (fieldtype
);
6331 /* Accept a string constant to initialize a subarray. */
6333 && fieldcode
== ARRAY_TYPE
6334 && TREE_CODE (TREE_TYPE (fieldtype
)) == INTEGER_TYPE
6337 /* Otherwise, if we have come to a subaggregate,
6338 and we don't have an element of its type, push into it. */
6339 else if (value
!= 0 && !constructor_no_implicit
6340 && value
!= error_mark_node
6341 && TYPE_MAIN_VARIANT (TREE_TYPE (value
)) != fieldtype
6342 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
6343 || fieldcode
== UNION_TYPE
))
6345 push_init_level (1);
6351 push_member_name (constructor_fields
);
6352 output_init_element (value
, fieldtype
, constructor_fields
, 1);
6353 RESTORE_SPELLING_DEPTH (constructor_depth
);
6356 /* Do the bookkeeping for an element that was
6357 directly output as a constructor. */
6359 /* For a record, keep track of end position of last field. */
6360 constructor_bit_index
6361 = size_binop (PLUS_EXPR
,
6362 bit_position (constructor_fields
),
6363 DECL_SIZE (constructor_fields
));
6365 constructor_unfilled_fields
= TREE_CHAIN (constructor_fields
);
6366 /* Skip any nameless bit fields. */
6367 while (constructor_unfilled_fields
!= 0
6368 && DECL_C_BIT_FIELD (constructor_unfilled_fields
)
6369 && DECL_NAME (constructor_unfilled_fields
) == 0)
6370 constructor_unfilled_fields
=
6371 TREE_CHAIN (constructor_unfilled_fields
);
6374 constructor_fields
= TREE_CHAIN (constructor_fields
);
6375 /* Skip any nameless bit fields at the beginning. */
6376 while (constructor_fields
!= 0
6377 && DECL_C_BIT_FIELD (constructor_fields
)
6378 && DECL_NAME (constructor_fields
) == 0)
6379 constructor_fields
= TREE_CHAIN (constructor_fields
);
6382 if (TREE_CODE (constructor_type
) == UNION_TYPE
)
6385 enum tree_code fieldcode
;
6387 if (constructor_fields
== 0)
6389 pedwarn_init ("excess elements in union initializer");
6393 fieldtype
= TREE_TYPE (constructor_fields
);
6394 if (fieldtype
!= error_mark_node
)
6395 fieldtype
= TYPE_MAIN_VARIANT (fieldtype
);
6396 fieldcode
= TREE_CODE (fieldtype
);
6398 /* Accept a string constant to initialize a subarray. */
6400 && fieldcode
== ARRAY_TYPE
6401 && TREE_CODE (TREE_TYPE (fieldtype
)) == INTEGER_TYPE
6404 /* Otherwise, if we have come to a subaggregate,
6405 and we don't have an element of its type, push into it. */
6406 else if (value
!= 0 && !constructor_no_implicit
6407 && value
!= error_mark_node
6408 && TYPE_MAIN_VARIANT (TREE_TYPE (value
)) != fieldtype
6409 && (fieldcode
== RECORD_TYPE
|| fieldcode
== ARRAY_TYPE
6410 || fieldcode
== UNION_TYPE
))
6412 push_init_level (1);
6418 push_member_name (constructor_fields
);
6419 output_init_element (value
, fieldtype
, constructor_fields
, 1);
6420 RESTORE_SPELLING_DEPTH (constructor_depth
);
6423 /* Do the bookkeeping for an element that was
6424 directly output as a constructor. */
6426 constructor_bit_index
= DECL_SIZE (constructor_fields
);
6427 constructor_unfilled_fields
= TREE_CHAIN (constructor_fields
);
6430 constructor_fields
= 0;
6433 if (TREE_CODE (constructor_type
) == ARRAY_TYPE
)
6435 tree elttype
= TYPE_MAIN_VARIANT (TREE_TYPE (constructor_type
));
6436 enum tree_code eltcode
= TREE_CODE (elttype
);
6438 /* Accept a string constant to initialize a subarray. */
6440 && eltcode
== ARRAY_TYPE
6441 && TREE_CODE (TREE_TYPE (elttype
)) == INTEGER_TYPE
6444 /* Otherwise, if we have come to a subaggregate,
6445 and we don't have an element of its type, push into it. */
6446 else if (value
!= 0 && !constructor_no_implicit
6447 && value
!= error_mark_node
6448 && TYPE_MAIN_VARIANT (TREE_TYPE (value
)) != elttype
6449 && (eltcode
== RECORD_TYPE
|| eltcode
== ARRAY_TYPE
6450 || eltcode
== UNION_TYPE
))
6452 push_init_level (1);
6456 if (constructor_max_index
!= 0
6457 && tree_int_cst_lt (constructor_max_index
, constructor_index
))
6459 pedwarn_init ("excess elements in array initializer");
6463 /* In the case of [LO .. HI] = VALUE, only evaluate VALUE once. */
6464 if (constructor_range_end
)
6466 if (constructor_max_index
!= 0
6467 && tree_int_cst_lt (constructor_max_index
,
6468 constructor_range_end
))
6470 pedwarn_init ("excess elements in array initializer");
6471 constructor_range_end
= constructor_max_index
;
6474 value
= save_expr (value
);
6477 /* Now output the actual element.
6478 Ordinarily, output once.
6479 If there is a range, repeat it till we advance past the range. */
6484 push_array_bounds (tree_low_cst (constructor_index
, 0));
6485 output_init_element (value
, elttype
, constructor_index
, 1);
6486 RESTORE_SPELLING_DEPTH (constructor_depth
);
6490 = size_binop (PLUS_EXPR
, constructor_index
, bitsize_one_node
);
6493 /* If we are doing the bookkeeping for an element that was
6494 directly output as a constructor, we must update
6495 constructor_unfilled_index. */
6496 constructor_unfilled_index
= constructor_index
;
6498 while (! (constructor_range_end
== 0
6499 || tree_int_cst_lt (constructor_range_end
,
6500 constructor_index
)));
6505 /* Handle the sole element allowed in a braced initializer
6506 for a scalar variable. */
6507 if (constructor_fields
== 0)
6509 pedwarn_init ("excess elements in scalar initializer");
6514 output_init_element (value
, constructor_type
, NULL_TREE
, 1);
6515 constructor_fields
= 0;
6520 /* Expand an ASM statement with operands, handling output operands
6521 that are not variables or INDIRECT_REFS by transforming such
6522 cases into cases that expand_asm_operands can handle.
6524 Arguments are same as for expand_asm_operands. */
6527 c_expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, filename
, line
)
6528 tree string
, outputs
, inputs
, clobbers
;
6530 const char *filename
;
6533 int noutputs
= list_length (outputs
);
6535 /* o[I] is the place that output number I should be written. */
6536 register tree
*o
= (tree
*) alloca (noutputs
* sizeof (tree
));
6539 if (TREE_CODE (string
) == ADDR_EXPR
)
6540 string
= TREE_OPERAND (string
, 0);
6541 if (TREE_CODE (string
) != STRING_CST
)
6543 error ("asm template is not a string constant");
6547 /* Record the contents of OUTPUTS before it is modified. */
6548 for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
6550 tree output
= TREE_VALUE (tail
);
6552 /* We can remove conversions that just change the type, not the mode. */
6553 STRIP_NOPS (output
);
6556 /* Allow conversions as LHS here. build_modify_expr as called below
6557 will do the right thing with them. */
6558 while (TREE_CODE (output
) == NOP_EXPR
6559 || TREE_CODE (output
) == CONVERT_EXPR
6560 || TREE_CODE (output
) == FLOAT_EXPR
6561 || TREE_CODE (output
) == FIX_TRUNC_EXPR
6562 || TREE_CODE (output
) == FIX_FLOOR_EXPR
6563 || TREE_CODE (output
) == FIX_ROUND_EXPR
6564 || TREE_CODE (output
) == FIX_CEIL_EXPR
)
6565 output
= TREE_OPERAND (output
, 0);
6567 lvalue_or_else (o
[i
], "invalid lvalue in asm statement");
6570 /* Perform default conversions on array and function inputs. */
6571 /* Don't do this for other types--
6572 it would screw up operands expected to be in memory. */
6573 for (i
= 0, tail
= inputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
6574 if (TREE_CODE (TREE_TYPE (TREE_VALUE (tail
))) == ARRAY_TYPE
6575 || TREE_CODE (TREE_TYPE (TREE_VALUE (tail
))) == FUNCTION_TYPE
)
6576 TREE_VALUE (tail
) = default_conversion (TREE_VALUE (tail
));
6578 /* Generate the ASM_OPERANDS insn;
6579 store into the TREE_VALUEs of OUTPUTS some trees for
6580 where the values were actually stored. */
6581 expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, filename
, line
);
6583 /* Copy all the intermediate outputs into the specified outputs. */
6584 for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
6586 if (o
[i
] != TREE_VALUE (tail
))
6588 expand_expr (build_modify_expr (o
[i
], NOP_EXPR
, TREE_VALUE (tail
)),
6589 NULL_RTX
, VOIDmode
, EXPAND_NORMAL
);
6592 /* Detect modification of read-only values.
6593 (Otherwise done by build_modify_expr.) */
6596 tree type
= TREE_TYPE (o
[i
]);
6597 if (TREE_READONLY (o
[i
])
6598 || TYPE_READONLY (type
)
6599 || ((TREE_CODE (type
) == RECORD_TYPE
6600 || TREE_CODE (type
) == UNION_TYPE
)
6601 && C_TYPE_FIELDS_READONLY (type
)))
6602 readonly_warning (o
[i
], "modification by `asm'");
6606 /* Those MODIFY_EXPRs could do autoincrements. */
6610 /* Expand a C `return' statement.
6611 RETVAL is the expression for what to return,
6612 or a null pointer for `return;' with no value. */
6615 c_expand_return (retval
)
6618 tree valtype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
6620 if (TREE_THIS_VOLATILE (current_function_decl
))
6621 warning ("function declared `noreturn' has a `return' statement");
6625 current_function_returns_null
= 1;
6626 if ((warn_return_type
|| flag_isoc99
)
6627 && valtype
!= 0 && TREE_CODE (valtype
) != VOID_TYPE
)
6628 pedwarn_c99 ("`return' with no value, in function returning non-void");
6629 expand_null_return ();
6631 else if (valtype
== 0 || TREE_CODE (valtype
) == VOID_TYPE
)
6633 current_function_returns_null
= 1;
6634 if (pedantic
|| TREE_CODE (TREE_TYPE (retval
)) != VOID_TYPE
)
6635 pedwarn ("`return' with a value, in function returning void");
6636 expand_return (retval
);
6640 tree t
= convert_for_assignment (valtype
, retval
, _("return"),
6641 NULL_TREE
, NULL_TREE
, 0);
6642 tree res
= DECL_RESULT (current_function_decl
);
6645 if (t
== error_mark_node
)
6648 inner
= t
= convert (TREE_TYPE (res
), t
);
6650 /* Strip any conversions, additions, and subtractions, and see if
6651 we are returning the address of a local variable. Warn if so. */
6654 switch (TREE_CODE (inner
))
6656 case NOP_EXPR
: case NON_LVALUE_EXPR
: case CONVERT_EXPR
:
6658 inner
= TREE_OPERAND (inner
, 0);
6662 /* If the second operand of the MINUS_EXPR has a pointer
6663 type (or is converted from it), this may be valid, so
6664 don't give a warning. */
6666 tree op1
= TREE_OPERAND (inner
, 1);
6668 while (! POINTER_TYPE_P (TREE_TYPE (op1
))
6669 && (TREE_CODE (op1
) == NOP_EXPR
6670 || TREE_CODE (op1
) == NON_LVALUE_EXPR
6671 || TREE_CODE (op1
) == CONVERT_EXPR
))
6672 op1
= TREE_OPERAND (op1
, 0);
6674 if (POINTER_TYPE_P (TREE_TYPE (op1
)))
6677 inner
= TREE_OPERAND (inner
, 0);
6682 inner
= TREE_OPERAND (inner
, 0);
6684 while (TREE_CODE_CLASS (TREE_CODE (inner
)) == 'r')
6685 inner
= TREE_OPERAND (inner
, 0);
6687 if (TREE_CODE (inner
) == VAR_DECL
6688 && ! DECL_EXTERNAL (inner
)
6689 && ! TREE_STATIC (inner
)
6690 && DECL_CONTEXT (inner
) == current_function_decl
)
6691 warning ("function returns address of local variable");
6701 t
= build (MODIFY_EXPR
, TREE_TYPE (res
), res
, t
);
6702 TREE_SIDE_EFFECTS (t
) = 1;
6704 current_function_returns_value
= 1;
6708 /* Start a C switch statement, testing expression EXP.
6709 Return EXP if it is valid, an error node otherwise. */
6712 c_expand_start_case (exp
)
6715 register enum tree_code code
;
6718 if (TREE_CODE (exp
) == ERROR_MARK
)
6721 code
= TREE_CODE (TREE_TYPE (exp
));
6722 type
= TREE_TYPE (exp
);
6724 if (code
!= INTEGER_TYPE
&& code
!= ENUMERAL_TYPE
&& code
!= ERROR_MARK
)
6726 error ("switch quantity not an integer");
6727 exp
= error_mark_node
;
6732 type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
6734 if (warn_traditional
6735 && ! in_system_header
6736 && (type
== long_integer_type_node
6737 || type
== long_unsigned_type_node
))
6738 pedwarn ("`long' switch expression not converted to `int' in ANSI C");
6740 exp
= default_conversion (exp
);
6741 type
= TREE_TYPE (exp
);
6742 index
= get_unwidened (exp
, NULL_TREE
);
6743 /* We can't strip a conversion from a signed type to an unsigned,
6744 because if we did, int_fits_type_p would do the wrong thing
6745 when checking case values for being in range,
6746 and it's too hard to do the right thing. */
6747 if (TREE_UNSIGNED (TREE_TYPE (exp
))
6748 == TREE_UNSIGNED (TREE_TYPE (index
)))
6752 expand_start_case (1, exp
, type
, "switch statement");
6757 /* Issue an ISO C99 pedantic warning MSGID. */
6760 pedwarn_c99
VPARAMS ((const char *msgid
, ...))
6762 #ifndef ANSI_PROTOTYPES
6767 VA_START (ap
, msgid
);
6769 #ifndef ANSI_PROTOTYPES
6770 msgid
= va_arg (ap
, const char *);
6774 vpedwarn (msgid
, ap
);
6776 vwarning (msgid
, ap
);