1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 88, 89, 92-97, 1998 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
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 and C++ specific error
26 checks, 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). */
42 extern void compiler_error ();
44 static tree convert_for_assignment
PROTO((tree
, tree
, char*, tree
,
46 static tree pointer_int_sum
PROTO((enum tree_code
, tree
, tree
));
47 static tree rationalize_conditional_expr
PROTO((enum tree_code
, tree
));
48 static int comp_target_parms
PROTO((tree
, tree
, int));
49 static int comp_ptr_ttypes_real
PROTO((tree
, tree
, int));
50 static int comp_ptr_ttypes_const
PROTO((tree
, tree
));
51 static int comp_ptr_ttypes_reinterpret
PROTO((tree
, tree
));
52 static int comp_array_types
PROTO((int (*) (tree
, tree
, int), tree
,
54 static tree build_ptrmemfunc1
PROTO((tree
, tree
, tree
, tree
, tree
));
55 static tree common_base_type
PROTO((tree
, tree
));
57 static tree convert_sequence
PROTO((tree
, tree
));
59 static tree lookup_anon_field
PROTO((tree
, tree
));
60 static tree pointer_diff
PROTO((tree
, tree
, tree
));
61 static tree qualify_type
PROTO((tree
, tree
));
62 static tree get_delta_difference
PROTO((tree
, tree
, int));
64 /* Return the target type of TYPE, which meas return T for:
65 T*, T&, T[], T (...), and otherwise, just T. */
71 if (TREE_CODE (type
) == REFERENCE_TYPE
)
72 type
= TREE_TYPE (type
);
73 while (TREE_CODE (type
) == POINTER_TYPE
74 || TREE_CODE (type
) == ARRAY_TYPE
75 || TREE_CODE (type
) == FUNCTION_TYPE
76 || TREE_CODE (type
) == METHOD_TYPE
77 || TREE_CODE (type
) == OFFSET_TYPE
)
78 type
= TREE_TYPE (type
);
82 /* Do `exp = require_complete_type (exp);' to make sure exp
83 does not have an incomplete type. (That includes void types.)
84 Returns the error_mark_node if the VALUE does not have
85 complete type when this function returns. */
88 require_complete_type (value
)
93 if (processing_template_decl
)
96 if (TREE_CODE (value
) == OVERLOAD
)
97 type
= unknown_type_node
;
99 type
= TREE_TYPE (value
);
101 /* First, detect a valid value with a complete type. */
102 if (TYPE_SIZE (type
) != 0
103 && type
!= void_type_node
104 && ! (TYPE_LANG_SPECIFIC (type
)
105 && (IS_SIGNATURE_POINTER (type
) || IS_SIGNATURE_REFERENCE (type
))
106 && TYPE_SIZE (SIGNATURE_TYPE (type
)) == 0))
109 /* If we see X::Y, we build an OFFSET_TYPE which has
110 not been laid out. Try to avoid an error by interpreting
111 it as this->X::Y, if reasonable. */
112 if (TREE_CODE (value
) == OFFSET_REF
113 && current_class_ref
!= 0
114 && TREE_OPERAND (value
, 0) == current_class_ref
)
116 tree base
, member
= TREE_OPERAND (value
, 1);
117 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
118 my_friendly_assert (TREE_CODE (member
) == FIELD_DECL
, 305);
119 base
= convert_pointer_to (basetype
, current_class_ptr
);
120 value
= build (COMPONENT_REF
, TREE_TYPE (member
),
121 build_indirect_ref (base
, NULL_PTR
), member
);
122 return require_complete_type (value
);
125 if (complete_type_or_else (type
))
128 return error_mark_node
;
131 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
132 a template instantiation, do the instantiation. Returns TYPE,
133 whether or not it could be completed, unless something goes
134 horribly wrong, in which case the error_mark_node is returned. */
140 if (type
== NULL_TREE
)
141 /* Rather than crash, we return something sure to cause an error
143 return error_mark_node
;
145 if (type
== error_mark_node
|| TYPE_SIZE (type
) != NULL_TREE
)
147 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
149 tree t
= complete_type (TREE_TYPE (type
));
150 if (TYPE_SIZE (t
) != NULL_TREE
&& ! processing_template_decl
)
152 TYPE_NEEDS_CONSTRUCTING (type
)
153 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
154 TYPE_NEEDS_DESTRUCTOR (type
)
155 = TYPE_NEEDS_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
157 else if (IS_AGGR_TYPE (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
158 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
163 /* Like complete_type, but issue an error if the TYPE cannot be
164 completed. Returns NULL_TREE if the type cannot be made
168 complete_type_or_else (type
)
171 type
= complete_type (type
);
172 if (type
== error_mark_node
)
173 /* We already issued an error. */
175 else if (!TYPE_SIZE (type
))
177 incomplete_type_error (NULL_TREE
, type
);
184 /* Return truthvalue of whether type of EXP is instantiated. */
190 return (TREE_CODE (exp
) == OVERLOAD
191 || TREE_CODE (exp
) == TREE_LIST
192 || TREE_TYPE (exp
) == unknown_type_node
193 || (TREE_CODE (TREE_TYPE (exp
)) == OFFSET_TYPE
194 && TREE_TYPE (TREE_TYPE (exp
)) == unknown_type_node
));
197 /* Return truthvalue of whether T is function (or pfn) type. */
203 return (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
204 || (TREE_CODE (t
) == POINTER_TYPE
205 && (TREE_CODE (TREE_TYPE (t
)) == FUNCTION_TYPE
206 || TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
)));
209 /* Do `exp = require_instantiated_type (type, exp);' to make sure EXP
210 does not have an uninstantiated type.
211 TYPE is type to instantiate with, if uninstantiated. */
214 require_instantiated_type (type
, exp
, errval
)
215 tree type
, exp
, errval
;
217 if (TREE_TYPE (exp
) == NULL_TREE
)
219 error ("argument list may not have an initializer list");
223 if (TREE_CODE (exp
) == OVERLOAD
224 || TREE_TYPE (exp
) == unknown_type_node
225 || (TREE_CODE (TREE_TYPE (exp
)) == OFFSET_TYPE
226 && TREE_TYPE (TREE_TYPE (exp
)) == unknown_type_node
))
228 exp
= instantiate_type (type
, exp
, 1);
229 if (TREE_TYPE (exp
) == error_mark_node
)
235 /* Return a variant of TYPE which has all the type qualifiers of LIKE
236 as well as those of TYPE. */
239 qualify_type (type
, like
)
242 int constflag
= TYPE_READONLY (type
) || TYPE_READONLY (like
);
243 int volflag
= TYPE_VOLATILE (type
) || TYPE_VOLATILE (like
);
244 /* @@ Must do member pointers here. */
245 return cp_build_type_variant (type
, constflag
, volflag
);
248 /* Return the common type of two parameter lists.
249 We assume that comptypes has already been done and returned 1;
250 if that isn't so, this may crash.
252 As an optimization, free the space we allocate if the parameter
253 lists are already common. */
259 tree oldargs
= p1
, newargs
, n
;
262 char *first_obj
= (char *) oballoc (0);
264 len
= list_length (p1
);
265 newargs
= tree_last (p1
);
267 if (newargs
== void_list_node
)
276 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
281 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
283 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
285 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
288 else if (! TREE_PURPOSE (p1
))
290 if (TREE_PURPOSE (p2
))
292 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
298 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
300 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
302 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
305 TREE_VALUE (n
) = common_type (TREE_VALUE (p1
), TREE_VALUE (p2
));
308 TREE_VALUE (n
) = TREE_VALUE (p1
);
319 /* Given a type, perhaps copied for a typedef,
320 find the "original" version of it. */
325 while (TYPE_NAME (t
) != NULL_TREE
)
327 tree x
= TYPE_NAME (t
);
328 if (TREE_CODE (x
) != TYPE_DECL
)
330 x
= DECL_ORIGINAL_TYPE (x
);
338 /* Return the common type of two types.
339 We assume that comptypes has already been done and returned 1;
340 if that isn't so, this may crash.
342 This is the type for the result of most arithmetic operations
343 if the operands have the given two types.
345 We do not deal with enumeral types here because they have already been
346 converted to integer types. */
352 register enum tree_code code1
;
353 register enum tree_code code2
;
356 /* Save time if the two types are the same. */
359 t1
= original_type (t1
);
360 t2
= original_type (t2
);
364 /* If one type is nonsense, use the other. */
365 if (t1
== error_mark_node
)
367 if (t2
== error_mark_node
)
370 /* Merge the attributes. */
371 attributes
= merge_machine_type_attributes (t1
, t2
);
373 { register tree a1
, a2
;
374 a1
= TYPE_ATTRIBUTES (t1
);
375 a2
= TYPE_ATTRIBUTES (t2
);
377 /* Either one unset? Take the set one. */
379 if (!(attributes
= a1
))
382 /* One that completely contains the other? Take it. */
384 else if (a2
&& !attribute_list_contained (a1
, a2
))
386 if (attribute_list_contained (a2
, a1
))
390 /* Pick the longest list, and hang on the other list. */
391 /* ??? For the moment we punt on the issue of attrs with args. */
393 if (list_length (a1
) < list_length (a2
))
394 attributes
= a2
, a2
= a1
;
396 for (; a2
; a2
= TREE_CHAIN (a2
))
397 if (lookup_attribute (IDENTIFIER_POINTER (TREE_PURPOSE (a2
)),
398 attributes
) == NULL_TREE
)
401 TREE_CHAIN (a1
) = attributes
;
408 /* Treat an enum type as the unsigned integer type of the same width. */
410 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
411 t1
= type_for_size (TYPE_PRECISION (t1
), 1);
412 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
413 t2
= type_for_size (TYPE_PRECISION (t2
), 1);
415 if (TYPE_PTRMEMFUNC_P (t1
))
416 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
417 if (TYPE_PTRMEMFUNC_P (t2
))
418 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
420 code1
= TREE_CODE (t1
);
421 code2
= TREE_CODE (t2
);
423 /* If one type is complex, form the common type of the non-complex
424 components, then make that complex. Use T1 or T2 if it is the
426 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
428 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
429 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
430 tree subtype
= common_type (subtype1
, subtype2
);
432 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
433 return build_type_attribute_variant (t1
, attributes
);
434 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
435 return build_type_attribute_variant (t2
, attributes
);
437 return build_type_attribute_variant (build_complex_type (subtype
),
445 /* If only one is real, use it as the result. */
447 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
448 return build_type_attribute_variant (t1
, attributes
);
450 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
451 return build_type_attribute_variant (t2
, attributes
);
453 /* Both real or both integers; use the one with greater precision. */
455 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
456 return build_type_attribute_variant (t1
, attributes
);
457 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
458 return build_type_attribute_variant (t2
, attributes
);
460 /* Same precision. Prefer longs to ints even when same size. */
462 if (TYPE_MAIN_VARIANT (t1
) == long_unsigned_type_node
463 || TYPE_MAIN_VARIANT (t2
) == long_unsigned_type_node
)
464 return build_type_attribute_variant (long_unsigned_type_node
,
467 if (TYPE_MAIN_VARIANT (t1
) == long_integer_type_node
468 || TYPE_MAIN_VARIANT (t2
) == long_integer_type_node
)
470 /* But preserve unsignedness from the other type,
471 since long cannot hold all the values of an unsigned int. */
472 if (TREE_UNSIGNED (t1
) || TREE_UNSIGNED (t2
))
473 t1
= long_unsigned_type_node
;
475 t1
= long_integer_type_node
;
476 return build_type_attribute_variant (t1
, attributes
);
479 if (TYPE_MAIN_VARIANT (t1
) == long_double_type_node
480 || TYPE_MAIN_VARIANT (t2
) == long_double_type_node
)
481 return build_type_attribute_variant (long_double_type_node
,
484 /* Otherwise prefer the unsigned one. */
486 if (TREE_UNSIGNED (t1
))
487 return build_type_attribute_variant (t1
, attributes
);
489 return build_type_attribute_variant (t2
, attributes
);
493 /* For two pointers, do this recursively on the target type,
494 and combine the qualifiers of the two types' targets. */
495 /* This code was turned off; I don't know why.
496 But ANSI C++ specifies doing this with the qualifiers.
497 So I turned it on again. */
499 tree tt1
= TYPE_MAIN_VARIANT (TREE_TYPE (t1
));
500 tree tt2
= TYPE_MAIN_VARIANT (TREE_TYPE (t2
));
502 = TYPE_READONLY (TREE_TYPE (t1
)) || TYPE_READONLY (TREE_TYPE (t2
));
504 = TYPE_VOLATILE (TREE_TYPE (t1
)) || TYPE_VOLATILE (TREE_TYPE (t2
));
509 else if (tt1
== void_type_node
|| tt2
== void_type_node
)
510 target
= void_type_node
;
511 else if (tt1
== unknown_type_node
)
513 else if (tt2
== unknown_type_node
)
516 target
= common_type (tt1
, tt2
);
518 target
= cp_build_type_variant (target
, constp
, volatilep
);
519 if (code1
== POINTER_TYPE
)
520 t1
= build_pointer_type (target
);
522 t1
= build_reference_type (target
);
523 t1
= build_type_attribute_variant (t1
, attributes
);
525 if (TREE_CODE (target
) == METHOD_TYPE
)
526 t1
= build_ptrmemfunc_type (t1
);
533 tree elt
= common_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
534 /* Save space: see if the result is identical to one of the args. */
535 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
536 return build_type_attribute_variant (t1
, attributes
);
537 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
538 return build_type_attribute_variant (t2
, attributes
);
539 /* Merge the element types, and have a size if either arg has one. */
540 t1
= build_cplus_array_type
541 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
542 return build_type_attribute_variant (t1
, attributes
);
546 /* Function types: prefer the one that specified arg types.
547 If both do, merge the arg types. Also merge the return types. */
549 tree valtype
= common_type (TREE_TYPE (t1
), TREE_TYPE (t2
));
550 tree p1
= TYPE_ARG_TYPES (t1
);
551 tree p2
= TYPE_ARG_TYPES (t2
);
554 /* Save space: see if the result is identical to one of the args. */
555 if (valtype
== TREE_TYPE (t1
) && ! p2
)
556 return build_type_attribute_variant (t1
, attributes
);
557 if (valtype
== TREE_TYPE (t2
) && ! p1
)
558 return build_type_attribute_variant (t2
, attributes
);
560 /* Simple way if one arg fails to specify argument types. */
561 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
563 rval
= build_function_type (valtype
, p2
);
564 if ((raises
= TYPE_RAISES_EXCEPTIONS (t2
)))
565 rval
= build_exception_variant (rval
, raises
);
566 return build_type_attribute_variant (rval
, attributes
);
568 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
569 if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
571 rval
= build_function_type (valtype
, p1
);
573 rval
= build_exception_variant (rval
, raises
);
574 return build_type_attribute_variant (rval
, attributes
);
577 rval
= build_function_type (valtype
, commonparms (p1
, p2
));
578 rval
= build_exception_variant (rval
, raises
);
579 return build_type_attribute_variant (rval
, attributes
);
584 t1
= TYPE_MAIN_VARIANT (t1
);
585 t2
= TYPE_MAIN_VARIANT (t2
);
587 if (DERIVED_FROM_P (t1
, t2
) && binfo_or_else (t1
, t2
))
588 return build_type_attribute_variant (t1
, attributes
);
589 else if (binfo_or_else (t2
, t1
))
590 return build_type_attribute_variant (t2
, attributes
);
593 compiler_error ("common_type called with uncommon aggregate types");
594 return error_mark_node
;
598 if (TREE_CODE (TREE_TYPE (t1
)) == TREE_CODE (TREE_TYPE (t2
)))
600 /* Get this value the long way, since TYPE_METHOD_BASETYPE
601 is just the main variant of this. */
605 tree b1
= TYPE_OFFSET_BASETYPE (t1
);
606 tree b2
= TYPE_OFFSET_BASETYPE (t2
);
608 if (comptypes (b1
, b2
, 1)
609 || (DERIVED_FROM_P (b1
, b2
) && binfo_or_else (b1
, b2
)))
610 basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
613 if (binfo_or_else (b2
, b1
) == NULL_TREE
)
614 compiler_error ("common_type called with uncommon method types");
615 basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t1
)));
618 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
620 /* If this was a member function type, get back to the
621 original type of type member function (i.e., without
622 the class instance variable up front. */
623 t1
= build_function_type (TREE_TYPE (t1
),
624 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
625 t2
= build_function_type (TREE_TYPE (t2
),
626 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
627 t3
= common_type (t1
, t2
);
628 t3
= build_cplus_method_type (basetype
, TREE_TYPE (t3
),
629 TYPE_ARG_TYPES (t3
));
630 t1
= build_exception_variant (t3
, raises
);
633 compiler_error ("common_type called with uncommon method types");
635 return build_type_attribute_variant (t1
, attributes
);
638 if (TREE_TYPE (t1
) == TREE_TYPE (t2
))
640 tree b1
= TYPE_OFFSET_BASETYPE (t1
);
641 tree b2
= TYPE_OFFSET_BASETYPE (t2
);
643 if (comptypes (b1
, b2
, 1)
644 || (DERIVED_FROM_P (b1
, b2
) && binfo_or_else (b1
, b2
)))
645 return build_type_attribute_variant (t2
, attributes
);
646 else if (binfo_or_else (b2
, b1
))
647 return build_type_attribute_variant (t1
, attributes
);
649 compiler_error ("common_type called with uncommon member types");
652 return build_type_attribute_variant (t1
, attributes
);
656 /* Return 1 if TYPE1 and TYPE2 raise the same exceptions. */
659 compexcepttypes (t1
, t2
)
662 return TYPE_RAISES_EXCEPTIONS (t1
) == TYPE_RAISES_EXCEPTIONS (t2
);
666 comp_array_types (cmp
, t1
, t2
, strict
)
667 register int (*cmp
) PROTO((tree
, tree
, int));
671 tree d1
= TYPE_DOMAIN (t1
);
672 tree d2
= TYPE_DOMAIN (t2
);
674 /* Target types must match incl. qualifiers. */
675 if (!(TREE_TYPE (t1
) == TREE_TYPE (t2
)
676 || (*cmp
) (TREE_TYPE (t1
), TREE_TYPE (t2
), strict
)))
679 /* Sizes must match unless one is missing or variable. */
680 if (d1
== 0 || d2
== 0 || d1
== d2
681 || TREE_CODE (TYPE_MIN_VALUE (d1
)) != INTEGER_CST
682 || TREE_CODE (TYPE_MIN_VALUE (d2
)) != INTEGER_CST
683 || TREE_CODE (TYPE_MAX_VALUE (d1
)) != INTEGER_CST
684 || TREE_CODE (TYPE_MAX_VALUE (d2
)) != INTEGER_CST
)
687 return ((TREE_INT_CST_LOW (TYPE_MIN_VALUE (d1
))
688 == TREE_INT_CST_LOW (TYPE_MIN_VALUE (d2
)))
689 && (TREE_INT_CST_HIGH (TYPE_MIN_VALUE (d1
))
690 == TREE_INT_CST_HIGH (TYPE_MIN_VALUE (d2
)))
691 && (TREE_INT_CST_LOW (TYPE_MAX_VALUE (d1
))
692 == TREE_INT_CST_LOW (TYPE_MAX_VALUE (d2
)))
693 && (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (d1
))
694 == TREE_INT_CST_HIGH (TYPE_MAX_VALUE (d2
))));
697 /* Return 1 if TYPE1 and TYPE2 are compatible types for assignment
698 or various other operations. This is what ANSI C++ speaks of as
701 For C++: argument STRICT says we should be strict about this
704 2 : strict, except that if one type is a reference and
705 the other is not, compare the target type of the
706 reference to the type that's not a reference (ARM, p308).
707 This is used for checking for invalid overloading.
708 1 : strict (compared according to ANSI C)
709 This is used for checking whether two function decls match.
710 0 : <= (compared according to C++)
711 -1: <= or >= (relaxed)
713 Otherwise, pointers involving base classes and derived classes can
714 be mixed as valid: i.e. a pointer to a derived class may be converted
715 to a pointer to one of its base classes, as per C++. A pointer to
716 a derived class may be passed as a parameter to a function expecting a
717 pointer to a base classes. These allowances do not commute. In this
718 case, TYPE1 is assumed to be the base class, and TYPE2 is assumed to
719 be the derived class. */
722 comptypes (type1
, type2
, strict
)
726 register tree t1
= type1
;
727 register tree t2
= type2
;
730 /* Suppress errors caused by previously reported errors */
735 /* This should never happen. */
736 my_friendly_assert (t1
!= error_mark_node
, 307);
738 if (t2
== error_mark_node
)
743 /* Treat an enum type as the unsigned integer type of the same width. */
745 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
746 t1
= type_for_size (TYPE_PRECISION (t1
), 1);
747 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
748 t2
= type_for_size (TYPE_PRECISION (t2
), 1);
754 if (TYPE_PTRMEMFUNC_P (t1
))
755 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
756 if (TYPE_PTRMEMFUNC_P (t2
))
757 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
759 /* Different classes of types can't be compatible. */
761 if (TREE_CODE (t1
) != TREE_CODE (t2
))
764 && ((TREE_CODE (t1
) == REFERENCE_TYPE
)
765 ^ (TREE_CODE (t2
) == REFERENCE_TYPE
)))
767 if (TREE_CODE (t1
) == REFERENCE_TYPE
)
768 return comptypes (TREE_TYPE (t1
), t2
, 1);
769 return comptypes (t1
, TREE_TYPE (t2
), 1);
777 /* Qualifiers must match. */
779 if (TYPE_READONLY (t1
) != TYPE_READONLY (t2
))
781 if (TYPE_VOLATILE (t1
) != TYPE_VOLATILE (t2
))
783 if (strict
> 0 && TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
786 /* Allow for two different type nodes which have essentially the same
787 definition. Note that we already checked for equality of the type
788 qualifiers (just above). */
790 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
793 /* ??? COMP_TYPE_ATTRIBUTES is currently useless for variables as each
794 attribute is its own main variant (`val' will remain 0). */
795 #ifndef COMP_TYPE_ATTRIBUTES
796 #define COMP_TYPE_ATTRIBUTES(t1,t2) 1
799 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
800 if (! (attrval
= COMP_TYPE_ATTRIBUTES (t1
, t2
)))
803 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
806 switch (TREE_CODE (t1
))
808 case TEMPLATE_TEMPLATE_PARM
:
809 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
810 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
))
812 if (! comp_template_parms (DECL_TEMPLATE_PARMS (TYPE_NAME (t1
)),
813 DECL_TEMPLATE_PARMS (TYPE_NAME (t2
))))
815 if (! CLASSTYPE_TEMPLATE_INFO (t1
) && ! CLASSTYPE_TEMPLATE_INFO (t2
))
817 /* Don't check inheritance. */
823 if (CLASSTYPE_TEMPLATE_INFO (t1
) && CLASSTYPE_TEMPLATE_INFO (t2
)
824 && (CLASSTYPE_TI_TEMPLATE (t1
) == CLASSTYPE_TI_TEMPLATE (t2
)
825 || TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
))
826 return comp_template_args (CLASSTYPE_TI_ARGS (t1
),
827 CLASSTYPE_TI_ARGS (t2
));
833 val
= (comptypes (build_pointer_type (TYPE_OFFSET_BASETYPE (t1
)),
834 build_pointer_type (TYPE_OFFSET_BASETYPE (t2
)), strict
)
835 && comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
), strict
));
839 if (! compexcepttypes (t1
, t2
))
842 /* This case is anti-symmetrical!
843 One can pass a base member (or member function)
844 to something expecting a derived member (or member function),
845 but not vice-versa! */
847 val
= (comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
), strict
)
848 && compparms (TYPE_ARG_TYPES (t1
),
849 TYPE_ARG_TYPES (t2
), strict
));
863 if (TREE_CODE (t1
) == RECORD_TYPE
&& TREE_CODE (t2
) == RECORD_TYPE
)
867 rval
= t1
== t2
|| DERIVED_FROM_P (t1
, t2
);
876 val
= DERIVED_FROM_P (t2
, t1
);
883 val
= comptypes (t1
, t2
, strict
);
887 if (! compexcepttypes (t1
, t2
))
890 val
= ((TREE_TYPE (t1
) == TREE_TYPE (t2
)
891 || comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
), strict
))
892 && compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
), strict
));
896 /* Target types must match incl. qualifiers. */
897 val
= comp_array_types (comptypes
, t1
, t2
, strict
);
900 case TEMPLATE_TYPE_PARM
:
901 return TEMPLATE_TYPE_IDX (t1
) == TEMPLATE_TYPE_IDX (t2
)
902 && TEMPLATE_TYPE_LEVEL (t1
) == TEMPLATE_TYPE_LEVEL (t2
);
905 if (TYPE_IDENTIFIER (t1
) != TYPE_IDENTIFIER (t2
))
907 return comptypes (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
), 1);
912 return attrval
== 2 && val
== 1 ? 2 : val
;
915 /* Return 1 or -1 if TTL and TTR are pointers to types that are equivalent,
916 ignoring their qualifiers, 0 if not. Return 1 means that TTR can be
917 converted to TTL. Return -1 means that TTL can be converted to TTR but
920 NPTRS is the number of pointers we can strip off and keep cool.
921 This is used to permit (for aggr A, aggr B) A, B* to convert to A*,
922 but to not permit B** to convert to A**.
924 This should go away. Callers should use can_convert or something
925 similar instead. (jason 17 Apr 1997) */
928 comp_target_types (ttl
, ttr
, nptrs
)
932 ttl
= TYPE_MAIN_VARIANT (ttl
);
933 ttr
= TYPE_MAIN_VARIANT (ttr
);
937 if (TREE_CODE (ttr
) != TREE_CODE (ttl
))
940 if (TREE_CODE (ttr
) == POINTER_TYPE
941 || (TREE_CODE (ttr
) == REFERENCE_TYPE
))
943 int is_ptr
= TREE_CODE (ttr
) == POINTER_TYPE
;
945 ttl
= TREE_TYPE (ttl
);
946 ttr
= TREE_TYPE (ttr
);
948 if (nptrs
> 0 && is_ptr
)
950 if (TREE_CODE (ttl
) == UNKNOWN_TYPE
951 || TREE_CODE (ttr
) == UNKNOWN_TYPE
)
953 else if (TREE_CODE (ttl
) == VOID_TYPE
954 && TREE_CODE (ttr
) != FUNCTION_TYPE
955 && TREE_CODE (ttr
) != METHOD_TYPE
956 && TREE_CODE (ttr
) != OFFSET_TYPE
)
958 else if (TREE_CODE (ttr
) == VOID_TYPE
959 && TREE_CODE (ttl
) != FUNCTION_TYPE
960 && TREE_CODE (ttl
) != METHOD_TYPE
961 && TREE_CODE (ttl
) != OFFSET_TYPE
)
963 else if (TREE_CODE (ttl
) == POINTER_TYPE
964 || TREE_CODE (ttl
) == ARRAY_TYPE
)
966 if (comp_ptr_ttypes (ttl
, ttr
))
968 else if (comp_ptr_ttypes (ttr
, ttl
))
974 /* Const and volatile mean something different for function types,
975 so the usual checks are not appropriate. */
976 if (TREE_CODE (ttl
) == FUNCTION_TYPE
|| TREE_CODE (ttl
) == METHOD_TYPE
)
977 return comp_target_types (ttl
, ttr
, nptrs
- 1);
979 /* Make sure that the cv-quals change only in the same direction as
983 int c
= TYPE_READONLY (ttl
) - TYPE_READONLY (ttr
);
984 int v
= TYPE_VOLATILE (ttl
) - TYPE_VOLATILE (ttr
);
986 if ((c
> 0 && v
< 0) || (c
< 0 && v
> 0))
989 if (TYPE_MAIN_VARIANT (ttl
) == TYPE_MAIN_VARIANT (ttr
))
990 return (c
+ v
< 0) ? -1 : 1;
992 t
= comp_target_types (ttl
, ttr
, nptrs
- 1);
993 if ((t
== 1 && c
+ v
>= 0) || (t
== -1 && c
+ v
<= 0))
1000 if (TREE_CODE (ttr
) == ARRAY_TYPE
)
1001 return comp_array_types (comp_target_types
, ttl
, ttr
, 0);
1002 else if (TREE_CODE (ttr
) == FUNCTION_TYPE
|| TREE_CODE (ttr
) == METHOD_TYPE
)
1009 if (comptypes (TREE_TYPE (ttl
), TREE_TYPE (ttr
), 1) == 0)
1014 switch (comp_target_types (TREE_TYPE (ttl
), TREE_TYPE (ttr
), -1))
1023 argsl
= TYPE_ARG_TYPES (ttl
);
1024 argsr
= TYPE_ARG_TYPES (ttr
);
1026 /* Compare 'this' here, not in comp_target_parms. */
1027 if (TREE_CODE (ttr
) == METHOD_TYPE
)
1029 tree tl
= TYPE_METHOD_BASETYPE (ttl
);
1030 tree tr
= TYPE_METHOD_BASETYPE (ttr
);
1032 if (comptypes (tr
, tl
, 0) == 0)
1034 if (comptypes (tl
, tr
, 0))
1040 argsl
= TREE_CHAIN (argsl
);
1041 argsr
= TREE_CHAIN (argsr
);
1044 switch (comp_target_parms (argsl
, argsr
, 1))
1052 return saw_contra
? -1 : 1;
1055 else if (TREE_CODE (ttr
) == OFFSET_TYPE
)
1057 /* Contravariance: we can assign a pointer to base member to a pointer
1058 to derived member. Note difference from simple pointer case, where
1059 we can pass a pointer to derived to a pointer to base. */
1060 if (comptypes (TYPE_OFFSET_BASETYPE (ttr
),
1061 TYPE_OFFSET_BASETYPE (ttl
), 0))
1062 return comp_target_types (TREE_TYPE (ttl
), TREE_TYPE (ttr
), nptrs
);
1063 else if (comptypes (TYPE_OFFSET_BASETYPE (ttl
),
1064 TYPE_OFFSET_BASETYPE (ttr
), 0)
1065 && comp_target_types (TREE_TYPE (ttl
), TREE_TYPE (ttr
), nptrs
))
1068 else if (IS_AGGR_TYPE (ttl
))
1072 if (comptypes (build_pointer_type (ttl
), build_pointer_type (ttr
), 0))
1074 if (comptypes (build_pointer_type (ttr
), build_pointer_type (ttl
), 0))
1082 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1083 more cv-qualified that TYPE1, and 0 otherwise. */
1086 comp_cv_qualification (type1
, type2
)
1090 if (TYPE_READONLY (type1
) == TYPE_READONLY (type2
)
1091 && TYPE_VOLATILE (type1
) == TYPE_VOLATILE (type2
))
1094 if (TYPE_READONLY (type1
) >= TYPE_READONLY (type2
)
1095 && TYPE_VOLATILE (type1
) >= TYPE_VOLATILE (type2
))
1098 if (TYPE_READONLY (type2
) >= TYPE_READONLY (type1
)
1099 && TYPE_VOLATILE (type2
) >= TYPE_VOLATILE (type1
))
1105 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1106 subset of the cv-qualification signature of TYPE2, and the types
1107 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1110 comp_cv_qual_signature (type1
, type2
)
1114 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1116 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1122 /* If two types share a common base type, return that basetype.
1123 If there is not a unique most-derived base type, this function
1124 returns ERROR_MARK_NODE. */
1127 common_base_type (tt1
, tt2
)
1130 tree best
= NULL_TREE
;
1133 /* If one is a baseclass of another, that's good enough. */
1134 if (UNIQUELY_DERIVED_FROM_P (tt1
, tt2
))
1136 if (UNIQUELY_DERIVED_FROM_P (tt2
, tt1
))
1139 /* Otherwise, try to find a unique baseclass of TT1
1140 that is shared by TT2, and follow that down. */
1141 for (i
= CLASSTYPE_N_BASECLASSES (tt1
)-1; i
>= 0; i
--)
1143 tree basetype
= TYPE_BINFO_BASETYPE (tt1
, i
);
1144 tree trial
= common_base_type (basetype
, tt2
);
1147 if (trial
== error_mark_node
)
1149 if (best
== NULL_TREE
)
1151 else if (best
!= trial
)
1152 return error_mark_node
;
1157 for (i
= CLASSTYPE_N_BASECLASSES (tt2
)-1; i
>= 0; i
--)
1159 tree basetype
= TYPE_BINFO_BASETYPE (tt2
, i
);
1160 tree trial
= common_base_type (tt1
, basetype
);
1163 if (trial
== error_mark_node
)
1165 if (best
== NULL_TREE
)
1167 else if (best
!= trial
)
1168 return error_mark_node
;
1174 /* Subroutines of `comptypes'. */
1176 /* Return 1 if two parameter type lists PARMS1 and PARMS2
1177 are equivalent in the sense that functions with those parameter types
1178 can have equivalent types.
1179 If either list is empty, we win.
1180 Otherwise, the two lists must be equivalent, element by element.
1182 C++: See comment above about TYPE1, TYPE2.
1184 STRICT is no longer used. */
1187 compparms (parms1
, parms2
, strict
)
1188 tree parms1
, parms2
;
1191 register tree t1
= parms1
, t2
= parms2
;
1193 /* An unspecified parmlist matches any specified parmlist
1194 whose argument types don't need default promotions. */
1198 if (t1
== 0 && t2
== 0)
1200 /* If one parmlist is shorter than the other,
1201 they fail to match. */
1202 if (t1
== 0 || t2
== 0)
1204 if (! comptypes (TREE_VALUE (t2
), TREE_VALUE (t1
), 1))
1207 t1
= TREE_CHAIN (t1
);
1208 t2
= TREE_CHAIN (t2
);
1212 /* This really wants return whether or not parameter type lists
1213 would make their owning functions assignment compatible or not.
1215 The return value is like for comp_target_types.
1217 This should go away, possibly with the exception of the empty parmlist
1218 conversion; there are no conversions between function types in C++.
1219 (jason 17 Apr 1997) */
1222 comp_target_parms (parms1
, parms2
, strict
)
1223 tree parms1
, parms2
;
1226 register tree t1
= parms1
, t2
= parms2
;
1227 int warn_contravariance
= 0;
1229 /* In C, an unspecified parmlist matches any specified parmlist
1230 whose argument types don't need default promotions. This is not
1231 true for C++, but let's do it anyway for unfixed headers. */
1233 if (t1
== 0 && t2
!= 0)
1235 cp_pedwarn ("ANSI C++ prohibits conversion from `(%#T)' to `(...)'",
1237 return self_promoting_args_p (t2
);
1240 return self_promoting_args_p (t1
);
1242 for (; t1
|| t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1246 /* If one parmlist is shorter than the other,
1247 they fail to match, unless STRICT is <= 0. */
1248 if (t1
== 0 || t2
== 0)
1253 return 1 + warn_contravariance
;
1254 return ((t1
&& TREE_PURPOSE (t1
)) + warn_contravariance
);
1256 p1
= TREE_VALUE (t1
);
1257 p2
= TREE_VALUE (t2
);
1258 if (comptypes (p1
, p2
, 1))
1264 if ((TREE_CODE (p1
) == POINTER_TYPE
&& TREE_CODE (p2
) == POINTER_TYPE
)
1265 || (TREE_CODE (p1
) == REFERENCE_TYPE
1266 && TREE_CODE (p2
) == REFERENCE_TYPE
))
1269 && (TYPE_MAIN_VARIANT (TREE_TYPE (p1
))
1270 == TYPE_MAIN_VARIANT (TREE_TYPE (p2
))))
1273 /* The following is wrong for contravariance,
1274 but many programs depend on it. */
1275 if (TREE_TYPE (p1
) == void_type_node
)
1277 if (TREE_TYPE (p2
) == void_type_node
)
1279 warn_contravariance
= 1;
1282 if (IS_AGGR_TYPE (TREE_TYPE (p1
)))
1284 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (p1
)),
1285 TYPE_MAIN_VARIANT (TREE_TYPE (p2
)), 1) == 0)
1289 /* Note backwards order due to contravariance. */
1290 if (comp_target_types (p2
, p1
, 1) <= 0)
1292 if (comp_target_types (p1
, p2
, 1) > 0)
1294 warn_contravariance
= 1;
1301 return warn_contravariance
? -1 : 1;
1304 /* Return 1 if PARMS specifies a fixed number of parameters
1305 and none of their types is affected by default promotions. */
1308 self_promoting_args_p (parms
)
1312 for (t
= parms
; t
; t
= TREE_CHAIN (t
))
1314 register tree type
= TREE_VALUE (t
);
1316 if (TREE_CHAIN (t
) == 0 && type
!= void_type_node
)
1322 if (TYPE_MAIN_VARIANT (type
) == float_type_node
)
1325 if (C_PROMOTING_INTEGER_TYPE_P (type
))
1331 /* Return an unsigned type the same as TYPE in other respects.
1333 C++: must make these work for type variants as well. */
1336 unsigned_type (type
)
1339 tree type1
= TYPE_MAIN_VARIANT (type
);
1340 if (type1
== signed_char_type_node
|| type1
== char_type_node
)
1341 return unsigned_char_type_node
;
1342 if (type1
== integer_type_node
)
1343 return unsigned_type_node
;
1344 if (type1
== short_integer_type_node
)
1345 return short_unsigned_type_node
;
1346 if (type1
== long_integer_type_node
)
1347 return long_unsigned_type_node
;
1348 if (type1
== long_long_integer_type_node
)
1349 return long_long_unsigned_type_node
;
1350 if (type1
== intTI_type_node
)
1351 return unsigned_intTI_type_node
;
1352 if (type1
== intDI_type_node
)
1353 return unsigned_intDI_type_node
;
1354 if (type1
== intSI_type_node
)
1355 return unsigned_intSI_type_node
;
1356 if (type1
== intHI_type_node
)
1357 return unsigned_intHI_type_node
;
1358 if (type1
== intQI_type_node
)
1359 return unsigned_intQI_type_node
;
1361 return signed_or_unsigned_type (1, type
);
1364 /* Return a signed type the same as TYPE in other respects. */
1370 tree type1
= TYPE_MAIN_VARIANT (type
);
1371 if (type1
== unsigned_char_type_node
|| type1
== char_type_node
)
1372 return signed_char_type_node
;
1373 if (type1
== unsigned_type_node
)
1374 return integer_type_node
;
1375 if (type1
== short_unsigned_type_node
)
1376 return short_integer_type_node
;
1377 if (type1
== long_unsigned_type_node
)
1378 return long_integer_type_node
;
1379 if (type1
== long_long_unsigned_type_node
)
1380 return long_long_integer_type_node
;
1381 if (type1
== unsigned_intTI_type_node
)
1382 return intTI_type_node
;
1383 if (type1
== unsigned_intDI_type_node
)
1384 return intDI_type_node
;
1385 if (type1
== unsigned_intSI_type_node
)
1386 return intSI_type_node
;
1387 if (type1
== unsigned_intHI_type_node
)
1388 return intHI_type_node
;
1389 if (type1
== unsigned_intQI_type_node
)
1390 return intQI_type_node
;
1392 return signed_or_unsigned_type (0, type
);
1395 /* Return a type the same as TYPE except unsigned or
1396 signed according to UNSIGNEDP. */
1399 signed_or_unsigned_type (unsignedp
, type
)
1403 if (! INTEGRAL_TYPE_P (type
)
1404 || TREE_UNSIGNED (type
) == unsignedp
)
1407 if (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
))
1408 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
1409 if (TYPE_PRECISION (type
) == TYPE_PRECISION (integer_type_node
))
1410 return unsignedp
? unsigned_type_node
: integer_type_node
;
1411 if (TYPE_PRECISION (type
) == TYPE_PRECISION (short_integer_type_node
))
1412 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
1413 if (TYPE_PRECISION (type
) == TYPE_PRECISION (long_integer_type_node
))
1414 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
1415 if (TYPE_PRECISION (type
) == TYPE_PRECISION (long_long_integer_type_node
))
1416 return (unsignedp
? long_long_unsigned_type_node
1417 : long_long_integer_type_node
);
1421 /* Compute the value of the `sizeof' operator. */
1427 enum tree_code code
= TREE_CODE (type
);
1430 if (processing_template_decl
)
1431 return build_min (SIZEOF_EXPR
, sizetype
, type
);
1433 if (code
== FUNCTION_TYPE
)
1435 if (pedantic
|| warn_pointer_arith
)
1436 pedwarn ("ANSI C++ forbids taking the sizeof a function type");
1437 return size_int (1);
1439 if (code
== METHOD_TYPE
)
1441 if (pedantic
|| warn_pointer_arith
)
1442 pedwarn ("ANSI C++ forbids taking the sizeof a method type");
1443 return size_int (1);
1445 if (code
== VOID_TYPE
)
1447 if (pedantic
|| warn_pointer_arith
)
1448 pedwarn ("ANSI C++ forbids taking the sizeof a void type");
1449 return size_int (1);
1451 if (code
== ERROR_MARK
)
1452 return size_int (1);
1454 /* ARM $5.3.2: ``When applied to a reference, the result is the size of the
1455 referenced object.'' */
1456 if (code
== REFERENCE_TYPE
)
1457 type
= TREE_TYPE (type
);
1459 /* We couldn't find anything in the ARM or the draft standard that says,
1460 one way or the other, if doing sizeof on something that doesn't have
1461 an object associated with it is correct or incorrect. For example, if
1462 you declare `struct S { char str[16]; };', and in your program do
1463 a `sizeof (S::str)', should we flag that as an error or should we give
1464 the size of it? Since it seems like a reasonable thing to do, we'll go
1465 with giving the value. */
1466 if (code
== OFFSET_TYPE
)
1467 type
= TREE_TYPE (type
);
1469 /* @@ This also produces an error for a signature ref.
1470 In that case we should be able to do better. */
1471 if (IS_SIGNATURE (type
))
1473 error ("`sizeof' applied to a signature type");
1474 return size_int (0);
1477 if (TYPE_SIZE (complete_type (type
)) == 0)
1479 cp_error ("`sizeof' applied to incomplete type `%T'", type
);
1480 return size_int (0);
1483 /* Convert in case a char is more than one unit. */
1484 t
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE (type
),
1485 size_int (TYPE_PRECISION (char_type_node
)));
1486 t
= convert (sizetype
, t
);
1487 /* size_binop does not put the constant in range, so do it now. */
1488 if (TREE_CODE (t
) == INTEGER_CST
&& force_fit_type (t
, 0))
1489 TREE_CONSTANT_OVERFLOW (t
) = TREE_OVERFLOW (t
) = 1;
1497 if (processing_template_decl
)
1498 return build_min (SIZEOF_EXPR
, sizetype
, e
);
1500 if (TREE_CODE (e
) == COMPONENT_REF
1501 && DECL_BIT_FIELD (TREE_OPERAND (e
, 1)))
1502 error ("sizeof applied to a bit-field");
1503 /* ANSI says arrays and functions are converted inside comma.
1504 But we can't really convert them in build_compound_expr
1505 because that would break commas in lvalues.
1506 So do the conversion here if operand was a comma. */
1507 if (TREE_CODE (e
) == COMPOUND_EXPR
1508 && (TREE_CODE (TREE_TYPE (e
)) == ARRAY_TYPE
1509 || TREE_CODE (TREE_TYPE (e
)) == FUNCTION_TYPE
))
1510 e
= default_conversion (e
);
1511 else if (TREE_CODE (e
) == TREE_LIST
)
1513 tree t
= TREE_VALUE (e
);
1516 && TREE_CODE (TREE_TYPE (t
)) == FUNCTION_TYPE
)
1517 || is_overloaded_fn (t
)))
1518 pedwarn ("ANSI C++ forbids taking the sizeof a function type");
1520 return c_sizeof (TREE_TYPE (e
));
1524 c_sizeof_nowarn (type
)
1527 enum tree_code code
= TREE_CODE (type
);
1530 if (code
== FUNCTION_TYPE
1531 || code
== METHOD_TYPE
1532 || code
== VOID_TYPE
1533 || code
== ERROR_MARK
)
1534 return size_int (1);
1535 if (code
== REFERENCE_TYPE
)
1536 type
= TREE_TYPE (type
);
1538 if (TYPE_SIZE (type
) == 0)
1539 return size_int (0);
1541 /* Convert in case a char is more than one unit. */
1542 t
= size_binop (CEIL_DIV_EXPR
, TYPE_SIZE (type
),
1543 size_int (TYPE_PRECISION (char_type_node
)));
1544 t
= convert (sizetype
, t
);
1545 force_fit_type (t
, 0);
1549 /* Implement the __alignof keyword: Return the minimum required
1550 alignment of TYPE, measured in bytes. */
1556 enum tree_code code
= TREE_CODE (type
);
1559 if (processing_template_decl
)
1560 return build_min (ALIGNOF_EXPR
, sizetype
, type
);
1562 if (code
== FUNCTION_TYPE
|| code
== METHOD_TYPE
)
1563 return size_int (FUNCTION_BOUNDARY
/ BITS_PER_UNIT
);
1565 if (code
== VOID_TYPE
|| code
== ERROR_MARK
)
1566 return size_int (1);
1568 /* C++: this is really correct! */
1569 if (code
== REFERENCE_TYPE
)
1570 type
= TREE_TYPE (type
);
1572 /* @@ This also produces an error for a signature ref.
1573 In that case we should be able to do better. */
1574 if (IS_SIGNATURE (type
))
1576 error ("`__alignof' applied to a signature type");
1577 return size_int (1);
1580 t
= size_int (TYPE_ALIGN (type
) / BITS_PER_UNIT
);
1581 force_fit_type (t
, 0);
1585 /* Perform default promotions for C data used in expressions.
1586 Arrays and functions are converted to pointers;
1587 enumeral types or short or char, to int.
1588 In addition, manifest constants symbols are replaced by their values.
1590 C++: this will automatically bash references to their target type. */
1593 decay_conversion (exp
)
1596 register tree type
= TREE_TYPE (exp
);
1597 register enum tree_code code
= TREE_CODE (type
);
1599 if (code
== OFFSET_TYPE
)
1601 if (TREE_CODE (exp
) == OFFSET_REF
)
1602 return decay_conversion (resolve_offset_ref (exp
));
1604 type
= TREE_TYPE (type
);
1605 code
= TREE_CODE (type
);
1607 if (type
== unknown_type_node
)
1609 cp_pedwarn ("assuming & on overloaded member function");
1610 return build_unary_op (ADDR_EXPR
, exp
, 0);
1614 if (code
== REFERENCE_TYPE
)
1616 exp
= convert_from_reference (exp
);
1617 type
= TREE_TYPE (exp
);
1618 code
= TREE_CODE (type
);
1621 /* Constants can be used directly unless they're not loadable. */
1622 if (TREE_CODE (exp
) == CONST_DECL
)
1623 exp
= DECL_INITIAL (exp
);
1624 /* Replace a nonvolatile const static variable with its value. */
1625 else if (TREE_READONLY_DECL_P (exp
))
1627 exp
= decl_constant_value (exp
);
1628 type
= TREE_TYPE (exp
);
1631 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1632 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1634 if (code
== VOID_TYPE
)
1636 error ("void value not ignored as it ought to be");
1637 return error_mark_node
;
1639 if (code
== FUNCTION_TYPE
)
1641 return build_unary_op (ADDR_EXPR
, exp
, 0);
1643 if (code
== METHOD_TYPE
)
1645 cp_pedwarn ("assuming & on `%E'", exp
);
1646 return build_unary_op (ADDR_EXPR
, exp
, 0);
1648 if (code
== ARRAY_TYPE
)
1653 int constp
, volatilep
;
1655 if (TREE_CODE (exp
) == INDIRECT_REF
)
1657 /* Stripping away the INDIRECT_REF is not the right
1658 thing to do for references... */
1659 tree inner
= TREE_OPERAND (exp
, 0);
1660 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
)
1662 inner
= build1 (CONVERT_EXPR
,
1663 build_pointer_type (TREE_TYPE
1664 (TREE_TYPE (inner
))),
1666 TREE_CONSTANT (inner
) = TREE_CONSTANT (TREE_OPERAND (inner
, 0));
1668 return cp_convert (build_pointer_type (TREE_TYPE (type
)), inner
);
1671 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1673 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1674 return build (COMPOUND_EXPR
, TREE_TYPE (op1
),
1675 TREE_OPERAND (exp
, 0), op1
);
1679 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1681 error ("invalid use of non-lvalue array");
1682 return error_mark_node
;
1685 constp
= volatilep
= 0;
1686 if (TREE_CODE_CLASS (TREE_CODE (exp
)) == 'r'
1687 || TREE_CODE_CLASS (TREE_CODE (exp
)) == 'd')
1689 constp
= TREE_READONLY (exp
);
1690 volatilep
= TREE_THIS_VOLATILE (exp
);
1693 restype
= TREE_TYPE (type
);
1694 if (TYPE_READONLY (type
) || TYPE_VOLATILE (type
)
1695 || constp
|| volatilep
)
1696 restype
= cp_build_type_variant (restype
,
1697 TYPE_READONLY (type
) || constp
,
1698 TYPE_VOLATILE (type
) || volatilep
);
1699 ptrtype
= build_pointer_type (restype
);
1701 if (TREE_CODE (exp
) == VAR_DECL
)
1703 /* ??? This is not really quite correct
1704 in that the type of the operand of ADDR_EXPR
1705 is not the target type of the type of the ADDR_EXPR itself.
1706 Question is, can this lossage be avoided? */
1707 adr
= build1 (ADDR_EXPR
, ptrtype
, exp
);
1708 if (mark_addressable (exp
) == 0)
1709 return error_mark_node
;
1710 TREE_CONSTANT (adr
) = staticp (exp
);
1711 TREE_SIDE_EFFECTS (adr
) = 0; /* Default would be, same as EXP. */
1714 /* This way is better for a COMPONENT_REF since it can
1715 simplify the offset for a component. */
1716 adr
= build_unary_op (ADDR_EXPR
, exp
, 1);
1717 return cp_convert (ptrtype
, adr
);
1724 default_conversion (exp
)
1728 enum tree_code code
;
1730 exp
= decay_conversion (exp
);
1732 type
= TREE_TYPE (exp
);
1733 code
= TREE_CODE (type
);
1735 if (INTEGRAL_CODE_P (code
))
1737 tree t
= type_promotes_to (type
);
1739 return cp_convert (t
, exp
);
1745 /* Take the address of an inline function without setting TREE_ADDRESSABLE
1749 inline_conversion (exp
)
1752 if (TREE_CODE (exp
) == FUNCTION_DECL
)
1754 tree type
= build_type_variant
1755 (TREE_TYPE (exp
), TREE_READONLY (exp
), TREE_THIS_VOLATILE (exp
));
1756 exp
= build1 (ADDR_EXPR
, build_pointer_type (type
), exp
);
1762 build_object_ref (datum
, basetype
, field
)
1763 tree datum
, basetype
, field
;
1766 if (datum
== error_mark_node
)
1767 return error_mark_node
;
1769 dtype
= TREE_TYPE (datum
);
1770 if (TREE_CODE (dtype
) == REFERENCE_TYPE
)
1771 dtype
= TREE_TYPE (dtype
);
1772 if (! IS_AGGR_TYPE_CODE (TREE_CODE (dtype
)))
1774 cp_error ("request for member `%T::%D' in expression of non-aggregate type `%T'",
1775 basetype
, field
, dtype
);
1776 return error_mark_node
;
1778 else if (IS_SIGNATURE (basetype
))
1780 warning ("signature name in scope resolution ignored");
1781 return build_component_ref (datum
, field
, NULL_TREE
, 1);
1783 else if (is_aggr_type (basetype
, 1))
1785 tree binfo
= binfo_or_else (basetype
, dtype
);
1787 return build_x_component_ref (build_scoped_ref (datum
, basetype
),
1790 return error_mark_node
;
1793 /* Like `build_component_ref, but uses an already found field, and converts
1794 from a reference. Must compute access for current_class_ref.
1798 build_component_ref_1 (datum
, field
, protect
)
1802 return convert_from_reference
1803 (build_component_ref (datum
, field
, NULL_TREE
, protect
));
1806 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1807 can, for example, use as an lvalue. This code used to be in
1808 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1809 expressions, where we're dealing with aggregates. But now it's again only
1810 called from unary_complex_lvalue. The case (in particular) that led to
1811 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
1815 rationalize_conditional_expr (code
, t
)
1816 enum tree_code code
;
1819 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
1820 the first operand is always the one to be used if both operands
1821 are equal, so we know what conditional expression this used to be. */
1822 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
1825 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
1826 ? LE_EXPR
: GE_EXPR
),
1827 TREE_OPERAND (t
, 0),
1828 TREE_OPERAND (t
, 1)),
1829 build_unary_op (code
, TREE_OPERAND (t
, 0), 0),
1830 build_unary_op (code
, TREE_OPERAND (t
, 1), 0));
1834 build_conditional_expr (TREE_OPERAND (t
, 0),
1835 build_unary_op (code
, TREE_OPERAND (t
, 1), 0),
1836 build_unary_op (code
, TREE_OPERAND (t
, 2), 0));
1839 /* Given the TYPE of an anonymous union field inside T, return the
1840 FIELD_DECL for the field. If not found return NULL_TREE. Because
1841 anonymous unions can nest, we must also search all anonymous unions
1842 that are directly reachable. */
1845 lookup_anon_field (t
, type
)
1850 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
1852 if (TREE_STATIC (field
))
1854 if (TREE_CODE (field
) != FIELD_DECL
)
1857 /* If we find it directly, return the field. */
1858 if (DECL_NAME (field
) == NULL_TREE
1859 && type
== TREE_TYPE (field
))
1864 /* Otherwise, it could be nested, search harder. */
1865 if (DECL_NAME (field
) == NULL_TREE
1866 && TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
1868 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
1876 /* Build a COMPONENT_REF for a given DATUM, and it's member COMPONENT.
1877 COMPONENT can be an IDENTIFIER_NODE that is the name of the member
1878 that we are interested in, or it can be a FIELD_DECL. */
1881 build_component_ref (datum
, component
, basetype_path
, protect
)
1882 tree datum
, component
, basetype_path
;
1885 register tree basetype
= TREE_TYPE (datum
);
1886 register enum tree_code code
;
1887 register tree field
= NULL
;
1890 if (processing_template_decl
)
1891 return build_min_nt (COMPONENT_REF
, datum
, component
);
1893 /* If DATUM is a COMPOUND_EXPR or COND_EXPR, move our reference
1895 switch (TREE_CODE (datum
))
1899 tree value
= build_component_ref (TREE_OPERAND (datum
, 1), component
,
1900 basetype_path
, protect
);
1901 return build (COMPOUND_EXPR
, TREE_TYPE (value
),
1902 TREE_OPERAND (datum
, 0), value
);
1905 return build_conditional_expr
1906 (TREE_OPERAND (datum
, 0),
1907 build_component_ref (TREE_OPERAND (datum
, 1), component
,
1908 basetype_path
, protect
),
1909 build_component_ref (TREE_OPERAND (datum
, 2), component
,
1910 basetype_path
, protect
));
1913 cp_error ("invalid use of %D", datum
);
1914 datum
= error_mark_node
;
1921 code
= TREE_CODE (basetype
);
1923 if (code
== REFERENCE_TYPE
)
1925 datum
= convert_from_reference (datum
);
1926 basetype
= TREE_TYPE (datum
);
1927 code
= TREE_CODE (basetype
);
1929 if (TREE_CODE (datum
) == OFFSET_REF
)
1931 datum
= resolve_offset_ref (datum
);
1932 basetype
= TREE_TYPE (datum
);
1933 code
= TREE_CODE (basetype
);
1936 /* First, see if there is a field or component with name COMPONENT. */
1937 if (TREE_CODE (component
) == TREE_LIST
)
1939 /* I could not trigger this code. MvL */
1940 my_friendly_abort (980326);
1942 my_friendly_assert (!(TREE_CHAIN (component
) == NULL_TREE
1943 && DECL_CHAIN (TREE_VALUE (component
)) == NULL_TREE
), 309);
1945 return build (COMPONENT_REF
, TREE_TYPE (component
), datum
, component
);
1948 if (! IS_AGGR_TYPE_CODE (code
))
1950 if (code
!= ERROR_MARK
)
1951 cp_error ("request for member `%D' in `%E', which is of non-aggregate type `%T'",
1952 component
, datum
, basetype
);
1953 return error_mark_node
;
1956 if (!complete_type_or_else (basetype
))
1957 return error_mark_node
;
1959 if (TREE_CODE (component
) == BIT_NOT_EXPR
)
1961 if (TYPE_IDENTIFIER (basetype
) != TREE_OPERAND (component
, 0))
1963 cp_error ("destructor specifier `%T::~%T' must have matching names",
1964 basetype
, TREE_OPERAND (component
, 0));
1965 return error_mark_node
;
1967 if (! TYPE_HAS_DESTRUCTOR (basetype
))
1969 cp_error ("type `%T' has no destructor", basetype
);
1970 return error_mark_node
;
1972 return TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (basetype
), 1);
1975 /* Look up component name in the structure type definition. */
1976 if (CLASSTYPE_VFIELD (basetype
)
1977 && DECL_NAME (CLASSTYPE_VFIELD (basetype
)) == component
)
1978 /* Special-case this because if we use normal lookups in an ambiguous
1979 hierarchy, the compiler will abort (because vptr lookups are
1980 not supposed to be ambiguous. */
1981 field
= CLASSTYPE_VFIELD (basetype
);
1982 else if (TREE_CODE (component
) == FIELD_DECL
)
1984 else if (TREE_CODE (component
) == TYPE_DECL
)
1986 cp_pedwarn ("invalid use of type decl `%#D' as expression", component
);
1991 tree name
= component
;
1992 if (TREE_CODE (component
) == VAR_DECL
)
1993 name
= DECL_NAME (component
);
1994 if (basetype_path
== NULL_TREE
)
1995 basetype_path
= TYPE_BINFO (basetype
);
1996 field
= lookup_field (basetype_path
, name
,
1997 protect
&& !VFIELD_NAME_P (name
), 0);
1998 if (field
== error_mark_node
)
1999 return error_mark_node
;
2001 if (field
== NULL_TREE
)
2003 /* Not found as a data field, look for it as a method. If found,
2004 then if this is the only possible one, return it, else
2005 report ambiguity error. */
2006 tree fndecls
= lookup_fnfields (basetype_path
, name
, 1);
2007 if (fndecls
== error_mark_node
)
2008 return error_mark_node
;
2011 if (TREE_CHAIN (fndecls
) == NULL_TREE
2012 && TREE_CODE (TREE_VALUE (fndecls
)) != OVERLOAD
)
2014 tree access
, fndecl
;
2016 /* Unique, so use this one now. */
2017 basetype
= TREE_PURPOSE (fndecls
);
2018 fndecl
= TREE_VALUE (fndecls
);
2019 access
= compute_access (TREE_PURPOSE (fndecls
), fndecl
);
2020 if (access
== access_public_node
)
2022 if (DECL_VINDEX (fndecl
)
2023 && ! resolves_to_fixed_type_p (datum
, 0))
2025 tree addr
= build_unary_op (ADDR_EXPR
, datum
, 0);
2026 tree fntype
= TREE_TYPE (fndecl
);
2028 addr
= convert_pointer_to (DECL_CONTEXT (fndecl
),
2030 datum
= build_indirect_ref (addr
, NULL_PTR
);
2031 my_friendly_assert (datum
!= error_mark_node
, 310);
2032 fndecl
= build_vfn_ref (&addr
, datum
,
2033 DECL_VINDEX (fndecl
));
2034 /* The type of fndecl is a function type,
2035 not a pointer-to-function type, since
2036 build_vfn_ref returns not the correct
2037 vtable slot, but the indirection of the
2038 correct vtable slot. */
2039 TREE_TYPE (fndecl
) = fntype
;
2043 return build (OFFSET_REF
, TREE_TYPE (fndecl
),
2046 if (access
== access_protected_node
)
2047 cp_error ("member function `%D' is protected", fndecl
);
2049 cp_error ("member function `%D' is private", fndecl
);
2050 return error_mark_node
;
2054 /* Just act like build_offset_ref, since the object does
2055 not matter unless we're actually calling the function. */
2058 t
= build_tree_list (error_mark_node
, fndecls
);
2059 TREE_TYPE (t
) = build_offset_type (basetype
,
2065 cp_error ("`%#T' has no member named `%D'", basetype
, name
);
2066 return error_mark_node
;
2068 else if (TREE_TYPE (field
) == error_mark_node
)
2069 return error_mark_node
;
2071 if (TREE_CODE (field
) != FIELD_DECL
)
2073 if (TREE_CODE (field
) == TYPE_DECL
)
2074 cp_pedwarn ("invalid use of type decl `%#D' as expression", field
);
2075 else if (DECL_RTL (field
) != 0)
2078 TREE_USED (field
) = 1;
2083 /* See if we have to do any conversions so that we pick up the field from the
2085 if (DECL_FIELD_CONTEXT (field
) != basetype
)
2087 tree context
= DECL_FIELD_CONTEXT (field
);
2088 tree base
= context
;
2089 while (!comptypes (base
, basetype
,1) && TYPE_NAME (base
)
2090 && ANON_UNION_TYPE_P (base
))
2092 base
= TYPE_CONTEXT (base
);
2095 /* Handle base classes here... */
2096 if (base
!= basetype
&& TYPE_USES_COMPLEX_INHERITANCE (basetype
))
2098 tree addr
= build_unary_op (ADDR_EXPR
, datum
, 0);
2099 if (integer_zerop (addr
))
2101 error ("invalid reference to NULL ptr, use ptr-to-member instead");
2102 return error_mark_node
;
2104 if (VBASE_NAME_P (DECL_NAME (field
)))
2106 /* It doesn't matter which vbase pointer we grab, just
2107 find one of them. */
2108 tree binfo
= get_binfo (base
,
2109 TREE_TYPE (TREE_TYPE (addr
)), 0);
2110 addr
= convert_pointer_to_real (binfo
, addr
);
2113 addr
= convert_pointer_to (base
, addr
);
2114 datum
= build_indirect_ref (addr
, NULL_PTR
);
2115 my_friendly_assert (datum
!= error_mark_node
, 311);
2119 /* Handle things from anon unions here... */
2120 if (TYPE_NAME (context
) && ANON_UNION_TYPE_P (context
))
2122 tree subfield
= lookup_anon_field (basetype
, context
);
2123 tree subdatum
= build_component_ref (datum
, subfield
,
2124 basetype_path
, protect
);
2125 return build_component_ref (subdatum
, field
, basetype_path
, protect
);
2129 ref
= fold (build (COMPONENT_REF
, TREE_TYPE (field
),
2130 break_out_cleanups (datum
), field
));
2132 if (TREE_READONLY (datum
) || TREE_READONLY (field
))
2133 TREE_READONLY (ref
) = 1;
2134 if (TREE_THIS_VOLATILE (datum
) || TREE_THIS_VOLATILE (field
))
2135 TREE_THIS_VOLATILE (ref
) = 1;
2136 if (DECL_LANG_SPECIFIC (field
) && DECL_MUTABLE_P (field
))
2137 TREE_READONLY (ref
) = 0;
2142 /* Variant of build_component_ref for use in expressions, which should
2143 never have REFERENCE_TYPE. */
2146 build_x_component_ref (datum
, component
, basetype_path
, protect
)
2147 tree datum
, component
, basetype_path
;
2150 tree t
= build_component_ref (datum
, component
, basetype_path
, protect
);
2152 if (! processing_template_decl
)
2153 t
= convert_from_reference (t
);
2158 /* Given an expression PTR for a pointer, return an expression
2159 for the value pointed to.
2160 ERRORSTRING is the name of the operator to appear in error messages.
2162 This function may need to overload OPERATOR_FNNAME.
2163 Must also handle REFERENCE_TYPEs for C++. */
2166 build_x_indirect_ref (ptr
, errorstring
)
2172 if (processing_template_decl
)
2173 return build_min_nt (INDIRECT_REF
, ptr
);
2175 rval
= build_opfncall (INDIRECT_REF
, LOOKUP_NORMAL
, ptr
, NULL_TREE
,
2179 return build_indirect_ref (ptr
, errorstring
);
2183 build_indirect_ref (ptr
, errorstring
)
2187 register tree pointer
, type
;
2189 if (ptr
== error_mark_node
)
2190 return error_mark_node
;
2192 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2193 ? ptr
: default_conversion (ptr
));
2194 type
= TREE_TYPE (pointer
);
2196 if (ptr
== current_class_ptr
)
2197 return current_class_ref
;
2199 if (TREE_CODE (type
) == POINTER_TYPE
|| TREE_CODE (type
) == REFERENCE_TYPE
)
2201 if (TREE_CODE (pointer
) == ADDR_EXPR
2203 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (pointer
, 0)))
2204 == TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
2205 && (TREE_READONLY (TREE_OPERAND (pointer
, 0))
2206 == TYPE_READONLY (TREE_TYPE (type
)))
2207 && (TREE_THIS_VOLATILE (TREE_OPERAND (pointer
, 0))
2208 == TYPE_VOLATILE (TREE_TYPE (type
))))
2209 return TREE_OPERAND (pointer
, 0);
2212 tree t
= TREE_TYPE (type
);
2213 register tree ref
= build1 (INDIRECT_REF
,
2214 TYPE_MAIN_VARIANT (t
), pointer
);
2216 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2217 so that we get the proper error message if the result is used
2218 to assign to. Also, &* is supposed to be a no-op. */
2219 TREE_READONLY (ref
) = TYPE_READONLY (t
);
2220 TREE_SIDE_EFFECTS (ref
)
2221 = (TYPE_VOLATILE (t
) || TREE_SIDE_EFFECTS (pointer
)
2223 TREE_THIS_VOLATILE (ref
) = TYPE_VOLATILE (t
);
2227 /* `pointer' won't be an error_mark_node if we were given a
2228 pointer to member, so it's cool to check for this here. */
2229 else if (TYPE_PTRMEMFUNC_P (type
))
2230 error ("invalid use of `%s' on pointer to member function", errorstring
);
2231 else if (TREE_CODE (type
) == RECORD_TYPE
2232 && (IS_SIGNATURE_POINTER (type
) || IS_SIGNATURE_REFERENCE (type
)))
2233 error ("cannot dereference signature pointer/reference");
2234 else if (pointer
!= error_mark_node
)
2237 error ("invalid type argument of `%s'", errorstring
);
2239 error ("invalid type argument");
2241 return error_mark_node
;
2244 /* This handles expressions of the form "a[i]", which denotes
2247 This is logically equivalent in C to *(a+i), but we may do it differently.
2248 If A is a variable or a member, we generate a primitive ARRAY_REF.
2249 This avoids forcing the array out of registers, and can work on
2250 arrays that are not lvalues (for example, members of structures returned
2253 If INDEX is of some user-defined type, it must be converted to
2254 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2255 will inherit the type of the array, which will be some pointer type. */
2258 build_array_ref (array
, idx
)
2263 error ("subscript missing in array reference");
2264 return error_mark_node
;
2267 if (TREE_TYPE (array
) == error_mark_node
2268 || TREE_TYPE (idx
) == error_mark_node
)
2269 return error_mark_node
;
2271 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
2272 && TREE_CODE (array
) != INDIRECT_REF
)
2276 /* Subscripting with type char is likely to lose
2277 on a machine where chars are signed.
2278 So warn on any machine, but optionally.
2279 Don't warn for unsigned char since that type is safe.
2280 Don't warn for signed char because anyone who uses that
2281 must have done so deliberately. */
2282 if (warn_char_subscripts
2283 && TYPE_MAIN_VARIANT (TREE_TYPE (idx
)) == char_type_node
)
2284 warning ("array subscript has type `char'");
2286 /* Apply default promotions *after* noticing character types. */
2287 idx
= default_conversion (idx
);
2289 if (TREE_CODE (TREE_TYPE (idx
)) != INTEGER_TYPE
)
2291 error ("array subscript is not an integer");
2292 return error_mark_node
;
2295 /* An array that is indexed by a non-constant
2296 cannot be stored in a register; we must be able to do
2297 address arithmetic on its address.
2298 Likewise an array of elements of variable size. */
2299 if (TREE_CODE (idx
) != INTEGER_CST
2300 || (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))) != 0
2301 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2304 if (mark_addressable (array
) == 0)
2305 return error_mark_node
;
2307 /* An array that is indexed by a constant value which is not within
2308 the array bounds cannot be stored in a register either; because we
2309 would get a crash in store_bit_field/extract_bit_field when trying
2310 to access a non-existent part of the register. */
2311 if (TREE_CODE (idx
) == INTEGER_CST
2312 && TYPE_VALUES (TREE_TYPE (array
))
2313 && ! int_fits_type_p (idx
, TYPE_VALUES (TREE_TYPE (array
))))
2315 if (mark_addressable (array
) == 0)
2316 return error_mark_node
;
2319 if (pedantic
&& !lvalue_p (array
))
2320 pedwarn ("ANSI C++ forbids subscripting non-lvalue array");
2322 /* Note in C++ it is valid to subscript a `register' array, since
2323 it is valid to take the address of something with that
2324 storage specification. */
2328 while (TREE_CODE (foo
) == COMPONENT_REF
)
2329 foo
= TREE_OPERAND (foo
, 0);
2330 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
))
2331 warning ("subscripting array declared `register'");
2334 type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (array
)));
2335 rval
= build (ARRAY_REF
, type
, array
, idx
);
2336 /* Array ref is const/volatile if the array elements are
2337 or if the array is.. */
2338 TREE_READONLY (rval
)
2339 |= (TYPE_READONLY (TREE_TYPE (TREE_TYPE (array
)))
2340 | TREE_READONLY (array
));
2341 TREE_SIDE_EFFECTS (rval
)
2342 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
2343 | TREE_SIDE_EFFECTS (array
));
2344 TREE_THIS_VOLATILE (rval
)
2345 |= (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (array
)))
2346 /* This was added by rms on 16 Nov 91.
2347 It fixes vol struct foo *a; a->elts[1]
2348 in an inline function.
2349 Hope it doesn't break something else. */
2350 | TREE_THIS_VOLATILE (array
));
2351 return require_complete_type (fold (rval
));
2355 tree ar
= default_conversion (array
);
2356 tree ind
= default_conversion (idx
);
2358 /* Put the integer in IND to simplify error checking. */
2359 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2366 if (ar
== error_mark_node
)
2369 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2371 error ("subscripted value is neither array nor pointer");
2372 return error_mark_node
;
2374 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2376 error ("array subscript is not an integer");
2377 return error_mark_node
;
2380 return build_indirect_ref (build_binary_op_nodefault (PLUS_EXPR
, ar
,
2386 /* Build a function call to function FUNCTION with parameters PARAMS.
2387 PARAMS is a list--a chain of TREE_LIST nodes--in which the
2388 TREE_VALUE of each node is a parameter-expression. The PARAMS do
2389 not include any object pointer that may be required. FUNCTION's
2390 data type may be a function type or a pointer-to-function.
2392 For C++: If FUNCTION's data type is a TREE_LIST, then the tree list
2393 is the list of possible methods that FUNCTION could conceivably
2394 be. If the list of methods comes from a class, then it will be
2395 a list of lists (where each element is associated with the class
2396 that produced it), otherwise it will be a simple list (for
2397 functions overloaded in global scope).
2399 In the first case, TREE_VALUE (function) is the head of one of those
2400 lists, and TREE_PURPOSE is the name of the function.
2402 In the second case, TREE_PURPOSE (function) is the function's
2405 DECL is the class instance variable, usually CURRENT_CLASS_REF.
2407 When calling a TEMPLATE_DECL, we don't require a complete return
2411 build_x_function_call (function
, params
, decl
)
2412 tree function
, params
, decl
;
2415 tree template_id
= NULL_TREE
;
2418 if (function
== error_mark_node
)
2419 return error_mark_node
;
2421 if (processing_template_decl
)
2422 return build_min_nt (CALL_EXPR
, function
, params
, NULL_TREE
);
2424 /* Save explicit template arguments if found */
2425 if (TREE_CODE (function
) == TEMPLATE_ID_EXPR
)
2427 template_id
= function
;
2428 function
= TREE_OPERAND (function
, 0);
2431 type
= TREE_TYPE (function
);
2433 if (TREE_CODE (type
) == OFFSET_TYPE
2434 && TREE_TYPE (type
) == unknown_type_node
2435 && TREE_CODE (function
) == TREE_LIST
2436 && TREE_CHAIN (function
) == NULL_TREE
)
2438 /* Undo (Foo:bar)()... */
2439 type
= TYPE_OFFSET_BASETYPE (type
);
2440 function
= TREE_VALUE (function
);
2441 my_friendly_assert (TREE_CODE (function
) == TREE_LIST
, 999);
2442 my_friendly_assert (TREE_CHAIN (function
) == NULL_TREE
, 999);
2443 function
= TREE_VALUE (function
);
2444 if (TREE_CODE (function
) == OVERLOAD
)
2445 function
= OVL_FUNCTION (function
);
2446 my_friendly_assert (TREE_CODE (function
) == FUNCTION_DECL
, 999);
2447 function
= DECL_NAME (function
);
2448 return build_method_call (decl
, function
, params
,
2449 TYPE_BINFO (type
), LOOKUP_NORMAL
);
2452 is_method
= ((TREE_CODE (function
) == TREE_LIST
2453 && current_class_type
!= NULL_TREE
2454 && (IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (function
))
2456 || TREE_CODE (function
) == IDENTIFIER_NODE
2457 || TREE_CODE (type
) == METHOD_TYPE
2458 || TYPE_PTRMEMFUNC_P (type
));
2460 if ((TREE_CODE (function
) == FUNCTION_DECL
2461 && DECL_STATIC_FUNCTION_P (function
))
2462 || (TREE_CODE (function
) == TEMPLATE_DECL
2463 && DECL_STATIC_FUNCTION_P (DECL_RESULT (function
))))
2464 return build_member_call
2465 (DECL_CONTEXT (function
), DECL_NAME (function
), params
);
2467 /* A friend template. Make it look like a toplevel declaration. */
2468 if (! is_method
&& TREE_CODE (function
) == TEMPLATE_DECL
)
2469 function
= scratch_ovl_cons (function
, NULL_TREE
);
2471 /* Handle methods, friends, and overloaded functions, respectively. */
2474 tree basetype
= NULL_TREE
;
2476 if (TREE_CODE (function
) == FUNCTION_DECL
2477 || DECL_FUNCTION_TEMPLATE_P (function
))
2479 basetype
= DECL_CLASS_CONTEXT (function
);
2481 if (DECL_NAME (function
))
2482 function
= DECL_NAME (function
);
2484 function
= TYPE_IDENTIFIER (DECL_CLASS_CONTEXT (function
));
2486 else if (TREE_CODE (function
) == TREE_LIST
)
2488 my_friendly_assert (TREE_CODE (TREE_VALUE (function
))
2489 == FUNCTION_DECL
, 312);
2490 basetype
= DECL_CLASS_CONTEXT (TREE_VALUE (function
));
2491 function
= TREE_PURPOSE (function
);
2493 else if (TREE_CODE (function
) != IDENTIFIER_NODE
)
2495 if (TREE_CODE (function
) == OFFSET_REF
)
2497 if (TREE_OPERAND (function
, 0))
2498 decl
= TREE_OPERAND (function
, 0);
2500 /* Call via a pointer to member function. */
2501 if (decl
== NULL_TREE
)
2503 error ("pointer to member function called, but not in class scope");
2504 return error_mark_node
;
2506 /* What other type of POINTER_TYPE could this be? */
2507 if (TREE_CODE (TREE_TYPE (function
)) != POINTER_TYPE
2508 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (function
))
2509 && TREE_CODE (function
) != OFFSET_REF
)
2510 function
= build (OFFSET_REF
, TREE_TYPE (type
), NULL_TREE
,
2515 /* this is an abbreviated method call.
2516 must go through here in case it is a virtual function.
2517 @@ Perhaps this could be optimized. */
2519 if (basetype
&& (! current_class_type
2520 || ! DERIVED_FROM_P (basetype
, current_class_type
)))
2521 return build_member_call (basetype
, function
, params
);
2523 if (decl
== NULL_TREE
)
2525 if (current_class_type
== NULL_TREE
)
2527 error ("object missing in call to method `%s'",
2528 IDENTIFIER_POINTER (function
));
2529 return error_mark_node
;
2531 /* Yow: call from a static member function. */
2532 decl
= build1 (NOP_EXPR
, build_pointer_type (current_class_type
),
2534 decl
= build_indirect_ref (decl
, NULL_PTR
);
2537 /* Put back explicit template arguments, if any. */
2539 function
= template_id
;
2540 return build_method_call (decl
, function
, params
,
2541 NULL_TREE
, LOOKUP_NORMAL
);
2543 else if (TREE_CODE (function
) == COMPONENT_REF
2544 && type
== unknown_type_node
)
2546 /* Should we undo what was done in build_component_ref? */
2547 if (TREE_CODE (TREE_PURPOSE (TREE_OPERAND (function
, 1))) == TREE_VEC
)
2548 /* Get the name that build_component_ref hid. */
2549 function
= DECL_NAME (TREE_VALUE (TREE_OPERAND (function
, 1)));
2551 function
= TREE_PURPOSE (TREE_OPERAND (function
, 1));
2552 return build_method_call (decl
, function
, params
,
2553 NULL_TREE
, LOOKUP_NORMAL
);
2555 else if (really_overloaded_fn (function
))
2557 if (OVL_FUNCTION (function
) == NULL_TREE
)
2559 cp_error ("function `%D' declared overloaded, but no definitions appear with which to resolve it?!?",
2560 TREE_PURPOSE (function
));
2561 return error_mark_node
;
2565 /* Put back explicit template arguments, if any. */
2567 function
= template_id
;
2568 return build_new_function_call (function
, params
);
2572 /* Remove a potential OVERLOAD around it */
2573 function
= OVL_CURRENT (function
);
2576 if (TREE_CODE (function
) == OFFSET_REF
)
2578 /* If the component is a data element (or a virtual function), we play
2579 games here to make things work. */
2582 if (TREE_OPERAND (function
, 0))
2583 decl
= TREE_OPERAND (function
, 0);
2585 decl
= current_class_ref
;
2587 decl_addr
= build_unary_op (ADDR_EXPR
, decl
, 0);
2589 /* Sigh. OFFSET_REFs are being used for too many things.
2590 They're being used both for -> and ->*, and we want to resolve
2591 the -> cases here, but leave the ->*. We could use
2592 resolve_offset_ref for those, too, but it would call
2593 get_member_function_from_ptrfunc and decl_addr wouldn't get
2594 updated properly. Nasty. */
2595 if (TREE_CODE (TREE_OPERAND (function
, 1)) == FIELD_DECL
)
2596 function
= resolve_offset_ref (function
);
2598 function
= TREE_OPERAND (function
, 1);
2600 function
= get_member_function_from_ptrfunc (&decl_addr
, function
);
2601 params
= expr_tree_cons (NULL_TREE
, decl_addr
, params
);
2602 return build_function_call (function
, params
);
2605 type
= TREE_TYPE (function
);
2606 if (type
!= error_mark_node
)
2608 if (TREE_CODE (type
) == REFERENCE_TYPE
)
2609 type
= TREE_TYPE (type
);
2611 if (IS_AGGR_TYPE (type
))
2612 return build_opfncall (CALL_EXPR
, LOOKUP_NORMAL
, function
, params
, NULL_TREE
);
2617 tree fntype
= TREE_TYPE (function
);
2618 tree ctypeptr
= NULL_TREE
;
2620 /* Explicitly named method? */
2621 if (TREE_CODE (function
) == FUNCTION_DECL
)
2622 ctypeptr
= build_pointer_type (DECL_CLASS_CONTEXT (function
));
2623 /* Expression with ptr-to-method type? It could either be a plain
2624 usage, or it might be a case where the ptr-to-method is being
2625 passed in as an argument. */
2626 else if (TYPE_PTRMEMFUNC_P (fntype
))
2628 tree rec
= TYPE_METHOD_BASETYPE (TREE_TYPE
2629 (TYPE_PTRMEMFUNC_FN_TYPE (fntype
)));
2630 ctypeptr
= build_pointer_type (rec
);
2632 /* Unexpected node type? */
2634 my_friendly_abort (116);
2635 if (decl
== NULL_TREE
)
2637 if (current_function_decl
2638 && DECL_STATIC_FUNCTION_P (current_function_decl
))
2639 error ("invalid call to member function needing `this' in static member function scope");
2641 error ("pointer to member function called, but not in class scope");
2642 return error_mark_node
;
2644 if (TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
2645 && ! TYPE_PTRMEMFUNC_P (TREE_TYPE (decl
)))
2647 decl
= build_unary_op (ADDR_EXPR
, decl
, 0);
2648 decl
= convert_pointer_to (TREE_TYPE (ctypeptr
), decl
);
2651 decl
= build_c_cast (ctypeptr
, decl
);
2652 params
= expr_tree_cons (NULL_TREE
, decl
, params
);
2655 return build_function_call (function
, params
);
2658 /* Resolve a pointer to member function. INSTANCE is the object
2659 instance to use, if the member points to a virtual member. */
2662 get_member_function_from_ptrfunc (instance_ptrptr
, function
)
2663 tree
*instance_ptrptr
;
2666 if (TREE_CODE (function
) == OFFSET_REF
)
2668 function
= TREE_OPERAND (function
, 1);
2671 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
2673 tree fntype
, idx
, e1
, delta
, delta2
, e2
, e3
, aref
, vtbl
;
2674 tree instance
, basetype
;
2676 tree instance_ptr
= *instance_ptrptr
;
2678 if (TREE_SIDE_EFFECTS (instance_ptr
))
2679 instance_ptr
= save_expr (instance_ptr
);
2681 if (TREE_SIDE_EFFECTS (function
))
2682 function
= save_expr (function
);
2684 fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
2685 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
2687 delta
= cp_convert (ptrdiff_type_node
,
2688 build_component_ref (function
, delta_identifier
,
2690 e3
= PFN_FROM_PTRMEMFUNC (function
);
2692 if (TYPE_SIZE (basetype
) != NULL_TREE
2693 && ! TYPE_VIRTUAL_P (basetype
))
2694 /* If basetype doesn't have virtual functions, don't emit code to
2695 handle that case. */
2699 /* Promoting idx before saving it improves performance on RISC
2700 targets. Without promoting, the first compare used
2701 load-with-sign-extend, while the second used normal load then
2702 shift to sign-extend. An optimizer flaw, perhaps, but it's
2703 easier to make this change. */
2704 idx
= save_expr (default_conversion
2705 (build_component_ref (function
,
2708 e1
= build_binary_op (GT_EXPR
, idx
, integer_zero_node
, 1);
2710 /* Convert down to the right base, before using the instance. */
2711 instance
= convert_pointer_to_real (basetype
, instance_ptr
);
2712 if (instance
== error_mark_node
&& instance_ptr
!= error_mark_node
)
2715 vtbl
= convert_pointer_to (ptr_type_node
, instance
);
2716 delta2
= DELTA2_FROM_PTRMEMFUNC (function
);
2719 build_pointer_type (build_pointer_type (vtable_entry_type
)),
2720 vtbl
, cp_convert (ptrdiff_type_node
, delta2
));
2721 vtbl
= build_indirect_ref (vtbl
, NULL_PTR
);
2722 aref
= build_array_ref (vtbl
, build_binary_op (MINUS_EXPR
,
2724 integer_one_node
, 1));
2725 if (! flag_vtable_thunks
)
2727 aref
= save_expr (aref
);
2729 delta
= build_binary_op
2731 build_conditional_expr (e1
,
2732 build_component_ref (aref
,
2739 if (flag_vtable_thunks
)
2742 e2
= build_component_ref (aref
, pfn_identifier
, NULL_TREE
, 0);
2743 TREE_TYPE (e2
) = TREE_TYPE (e3
);
2744 e1
= build_conditional_expr (e1
, e2
, e3
);
2746 /* Make sure this doesn't get evaluated first inside one of the
2747 branches of the COND_EXPR. */
2748 if (TREE_CODE (instance_ptr
) == SAVE_EXPR
)
2749 e1
= build (COMPOUND_EXPR
, TREE_TYPE (e1
),
2753 *instance_ptrptr
= build (PLUS_EXPR
, TREE_TYPE (instance_ptr
),
2754 instance_ptr
, delta
);
2756 if (instance_ptr
== error_mark_node
2757 && TREE_CODE (e1
) != ADDR_EXPR
2758 && TREE_CODE (TREE_OPERAND (e1
, 0)) != FUNCTION_DECL
)
2759 cp_error ("object missing in `%E'", function
);
2767 build_function_call_real (function
, params
, require_complete
, flags
)
2768 tree function
, params
;
2769 int require_complete
, flags
;
2771 register tree fntype
, fndecl
;
2772 register tree value_type
;
2773 register tree coerced_params
;
2774 tree name
= NULL_TREE
, assembler_name
= NULL_TREE
;
2777 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2778 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
2779 if (TREE_CODE (function
) == NOP_EXPR
2780 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
2781 function
= TREE_OPERAND (function
, 0);
2783 if (TREE_CODE (function
) == FUNCTION_DECL
)
2785 name
= DECL_NAME (function
);
2786 assembler_name
= DECL_ASSEMBLER_NAME (function
);
2788 GNU_xref_call (current_function_decl
,
2789 IDENTIFIER_POINTER (name
? name
2790 : TYPE_IDENTIFIER (DECL_CLASS_CONTEXT
2792 mark_used (function
);
2795 /* Convert anything with function type to a pointer-to-function. */
2796 if (pedantic
&& DECL_MAIN_P (function
))
2797 pedwarn ("ANSI C++ forbids calling `main' from within program");
2799 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
2800 (because calling an inline function does not mean the function
2801 needs to be separately compiled). */
2803 if (DECL_INLINE (function
))
2804 function
= inline_conversion (function
);
2806 function
= build_addr_func (function
);
2812 function
= build_addr_func (function
);
2815 if (function
== error_mark_node
)
2816 return error_mark_node
;
2818 fntype
= TREE_TYPE (function
);
2820 if (TYPE_PTRMEMFUNC_P (fntype
))
2822 cp_error ("must use .* or ->* to call pointer-to-member function in `%E (...)'",
2824 return error_mark_node
;
2827 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
2828 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
2830 if (!((TREE_CODE (fntype
) == POINTER_TYPE
2831 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
2833 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
2835 cp_error ("`%E' cannot be used as a function", function
);
2836 return error_mark_node
;
2839 /* fntype now gets the type of function pointed to. */
2840 fntype
= TREE_TYPE (fntype
);
2842 /* Convert the parameters to the types declared in the
2843 function prototype, or apply default promotions. */
2845 if (flags
& LOOKUP_COMPLAIN
)
2846 coerced_params
= convert_arguments (NULL_TREE
, TYPE_ARG_TYPES (fntype
),
2847 params
, fndecl
, LOOKUP_NORMAL
);
2849 coerced_params
= convert_arguments (NULL_TREE
, TYPE_ARG_TYPES (fntype
),
2852 if (coerced_params
== error_mark_node
)
2854 if (flags
& LOOKUP_SPECULATIVELY
)
2857 return error_mark_node
;
2860 /* Check for errors in format strings. */
2862 if (warn_format
&& (name
|| assembler_name
))
2863 check_function_format (name
, assembler_name
, coerced_params
);
2865 /* Recognize certain built-in functions so we can make tree-codes
2866 other than CALL_EXPR. We do this when it enables fold-const.c
2867 to do something useful. */
2869 if (TREE_CODE (function
) == ADDR_EXPR
2870 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
2871 && DECL_BUILT_IN (TREE_OPERAND (function
, 0)))
2872 switch (DECL_FUNCTION_CODE (TREE_OPERAND (function
, 0)))
2877 if (coerced_params
== 0)
2878 return integer_zero_node
;
2879 return build_unary_op (ABS_EXPR
, TREE_VALUE (coerced_params
), 0);
2886 value_type
= TREE_TYPE (fntype
) ? TREE_TYPE (fntype
) : void_type_node
;
2888 register tree result
2889 = build_call (function
, value_type
, coerced_params
);
2891 if (require_complete
)
2893 if (value_type
== void_type_node
)
2895 result
= require_complete_type (result
);
2897 if (IS_AGGR_TYPE (value_type
))
2898 result
= build_cplus_new (value_type
, result
);
2899 return convert_from_reference (result
);
2904 build_function_call (function
, params
)
2905 tree function
, params
;
2907 return build_function_call_real (function
, params
, 1, LOOKUP_NORMAL
);
2910 /* Convert the actual parameter expressions in the list VALUES
2911 to the types in the list TYPELIST.
2912 If parmdecls is exhausted, or when an element has NULL as its type,
2913 perform the default conversions.
2915 RETURN_LOC is the location of the return value, if known, NULL_TREE
2916 otherwise. This is useful in the case where we can avoid creating
2917 a temporary variable in the case where we can initialize the return
2918 value directly. If we are not eliding constructors, then we set this
2919 to NULL_TREE to avoid this avoidance.
2921 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
2923 This is also where warnings about wrong number of args are generated.
2925 Return a list of expressions for the parameters as converted.
2927 Both VALUES and the returned value are chains of TREE_LIST nodes
2928 with the elements of the list in the TREE_VALUE slots of those nodes.
2930 In C++, unspecified trailing parameters can be filled in with their
2931 default arguments, if such were specified. Do so here. */
2934 convert_arguments (return_loc
, typelist
, values
, fndecl
, flags
)
2935 tree return_loc
, typelist
, values
, fndecl
;
2938 register tree typetail
, valtail
;
2939 register tree result
= NULL_TREE
;
2940 char *called_thing
= 0;
2943 if (! flag_elide_constructors
)
2946 /* Argument passing is always copy-initialization. */
2947 flags
|= LOOKUP_ONLYCONVERTING
;
2951 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
2953 if (DECL_NAME (fndecl
) == NULL_TREE
2954 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
2955 called_thing
= "constructor";
2957 called_thing
= "member function";
2960 called_thing
= "function";
2963 for (valtail
= values
, typetail
= typelist
;
2965 valtail
= TREE_CHAIN (valtail
), i
++)
2967 register tree type
= typetail
? TREE_VALUE (typetail
) : 0;
2968 register tree val
= TREE_VALUE (valtail
);
2970 if (val
== error_mark_node
)
2971 return error_mark_node
;
2973 if (type
== void_type_node
)
2977 cp_error_at ("too many arguments to %s `%+D'", called_thing
,
2979 error ("at this point in file");
2982 error ("too many arguments to function");
2983 /* In case anybody wants to know if this argument
2986 TREE_TYPE (tree_last (result
)) = error_mark_node
;
2990 /* The tree type of the parameter being passed may not yet be
2991 known. In this case, its type is TYPE_UNKNOWN, and will
2992 be instantiated by the type given by TYPE. If TYPE
2993 is also NULL, the tree type of VAL is ERROR_MARK_NODE. */
2994 if (type
&& type_unknown_p (val
))
2995 val
= require_instantiated_type (type
, val
, integer_zero_node
);
2996 else if (type_unknown_p (val
))
2998 /* Strip the `&' from an overloaded FUNCTION_DECL. */
2999 if (TREE_CODE (val
) == ADDR_EXPR
)
3000 val
= TREE_OPERAND (val
, 0);
3001 if (really_overloaded_fn (val
))
3002 cp_error ("insufficient type information to resolve address of overloaded function `%D'",
3003 DECL_NAME (get_first_fn (val
)));
3005 error ("insufficient type information in parameter list");
3006 val
= integer_zero_node
;
3008 else if (TREE_CODE (val
) == OFFSET_REF
3009 && TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3011 /* This is unclean. Should be handled elsewhere. */
3012 val
= build_unary_op (ADDR_EXPR
, val
, 0);
3014 else if (TREE_CODE (val
) == OFFSET_REF
)
3015 val
= resolve_offset_ref (val
);
3017 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
3018 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
3019 if (TREE_CODE (val
) == NOP_EXPR
3020 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
3021 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
3022 val
= TREE_OPERAND (val
, 0);
3024 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
3026 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
3027 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
3028 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
3029 val
= default_conversion (val
);
3031 val
= require_complete_type (val
);
3034 if (val
== error_mark_node
)
3035 return error_mark_node
;
3039 /* Formal parm type is specified by a function prototype. */
3042 if (TYPE_SIZE (complete_type (type
)) == 0)
3044 error ("parameter type of called function is incomplete");
3049 parmval
= convert_for_initialization
3050 (return_loc
, type
, val
, flags
,
3051 "argument passing", fndecl
, i
);
3052 #ifdef PROMOTE_PROTOTYPES
3053 if ((TREE_CODE (type
) == INTEGER_TYPE
3054 || TREE_CODE (type
) == ENUMERAL_TYPE
)
3055 && (TYPE_PRECISION (type
)
3056 < TYPE_PRECISION (integer_type_node
)))
3057 parmval
= default_conversion (parmval
);
3061 if (parmval
== error_mark_node
)
3062 return error_mark_node
;
3064 result
= expr_tree_cons (NULL_TREE
, parmval
, result
);
3068 if (TREE_CODE (TREE_TYPE (val
)) == REFERENCE_TYPE
)
3069 val
= convert_from_reference (val
);
3071 result
= expr_tree_cons (NULL_TREE
,
3072 convert_arg_to_ellipsis (val
),
3077 typetail
= TREE_CHAIN (typetail
);
3080 if (typetail
!= 0 && typetail
!= void_list_node
)
3082 /* See if there are default arguments that can be used */
3083 if (TREE_PURPOSE (typetail
))
3085 for (; typetail
!= void_list_node
; ++i
)
3087 tree type
= TREE_VALUE (typetail
);
3088 tree val
= TREE_PURPOSE (typetail
);
3089 tree parmval
= convert_default_arg (type
, val
);
3091 if (parmval
== error_mark_node
)
3092 return error_mark_node
;
3094 result
= expr_tree_cons (0, parmval
, result
);
3095 typetail
= TREE_CHAIN (typetail
);
3096 /* ends with `...'. */
3097 if (typetail
== NULL_TREE
)
3105 char *buf
= (char *)alloca (32 + strlen (called_thing
));
3106 sprintf (buf
, "too few arguments to %s `%%#D'", called_thing
);
3107 cp_error_at (buf
, fndecl
);
3108 error ("at this point in file");
3111 error ("too few arguments to function");
3112 return error_mark_list
;
3116 return nreverse (result
);
3119 /* Build a binary-operation expression, after performing default
3120 conversions on the operands. CODE is the kind of expression to build. */
3123 build_x_binary_op (code
, arg1
, arg2
)
3124 enum tree_code code
;
3127 if (processing_template_decl
)
3128 return build_min_nt (code
, arg1
, arg2
);
3130 return build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
);
3134 build_binary_op (code
, arg1
, arg2
, convert_p
)
3135 enum tree_code code
;
3147 args
[0] = decay_conversion (args
[0]);
3148 args
[1] = decay_conversion (args
[1]);
3150 if (args
[0] == error_mark_node
|| args
[1] == error_mark_node
)
3151 return error_mark_node
;
3153 type0
= TREE_TYPE (args
[0]);
3154 type1
= TREE_TYPE (args
[1]);
3156 if (type_unknown_p (args
[0]))
3158 args
[0] = instantiate_type (type1
, args
[0], 1);
3159 args
[0] = decay_conversion (args
[0]);
3161 else if (type_unknown_p (args
[1]))
3163 args
[1] = require_instantiated_type (type0
, args
[1],
3165 args
[1] = decay_conversion (args
[1]);
3168 if (IS_AGGR_TYPE (type0
) || IS_AGGR_TYPE (type1
))
3169 my_friendly_abort (754867);
3171 return build_binary_op_nodefault (code
, args
[0], args
[1], code
);
3174 /* Build a binary-operation expression without default conversions.
3175 CODE is the kind of expression to build.
3176 This function differs from `build' in several ways:
3177 the data type of the result is computed and recorded in it,
3178 warnings are generated if arg data types are invalid,
3179 special handling for addition and subtraction of pointers is known,
3180 and some optimization is done (operations on narrow ints
3181 are done in the narrower type when that gives the same result).
3182 Constant folding is also done before the result is returned.
3184 ERROR_CODE is the code that determines what to say in error messages.
3185 It is usually, but not always, the same as CODE.
3187 Note that the operands will never have enumeral types
3188 because either they have just had the default conversions performed
3189 or they have both just been converted to some other type in which
3190 the arithmetic is to be done.
3192 C++: must do special pointer arithmetic when implementing
3193 multiple inheritance, and deal with pointer to member functions. */
3196 build_binary_op_nodefault (code
, orig_op0
, orig_op1
, error_code
)
3197 enum tree_code code
;
3198 tree orig_op0
, orig_op1
;
3199 enum tree_code error_code
;
3202 register enum tree_code code0
, code1
;
3205 /* Expression code to give to the expression when it is built.
3206 Normally this is CODE, which is what the caller asked for,
3207 but in some special cases we change it. */
3208 register enum tree_code resultcode
= code
;
3210 /* Data type in which the computation is to be performed.
3211 In the simplest cases this is the common type of the arguments. */
3212 register tree result_type
= NULL
;
3214 /* Nonzero means operands have already been type-converted
3215 in whatever way is necessary.
3216 Zero means they need to be converted to RESULT_TYPE. */
3219 /* Nonzero means create the expression with this type, rather than
3221 tree build_type
= 0;
3223 /* Nonzero means after finally constructing the expression
3224 convert it to this type. */
3225 tree final_type
= 0;
3227 /* Nonzero if this is an operation like MIN or MAX which can
3228 safely be computed in short if both args are promoted shorts.
3229 Also implies COMMON.
3230 -1 indicates a bitwise operation; this makes a difference
3231 in the exact conditions for when it is safe to do the operation
3232 in a narrower mode. */
3235 /* Nonzero if this is a comparison operation;
3236 if both args are promoted shorts, compare the original shorts.
3237 Also implies COMMON. */
3238 int short_compare
= 0;
3240 /* Nonzero if this is a right-shift operation, which can be computed on the
3241 original short and then promoted if the operand is a promoted short. */
3242 int short_shift
= 0;
3244 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3247 /* Apply default conversions. */
3248 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3249 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3250 || code
== TRUTH_XOR_EXPR
)
3252 op0
= decay_conversion (orig_op0
);
3253 op1
= decay_conversion (orig_op1
);
3257 op0
= default_conversion (orig_op0
);
3258 op1
= default_conversion (orig_op1
);
3261 type0
= TREE_TYPE (op0
);
3262 type1
= TREE_TYPE (op1
);
3264 /* The expression codes of the data types of the arguments tell us
3265 whether the arguments are integers, floating, pointers, etc. */
3266 code0
= TREE_CODE (type0
);
3267 code1
= TREE_CODE (type1
);
3269 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3270 STRIP_TYPE_NOPS (op0
);
3271 STRIP_TYPE_NOPS (op1
);
3273 /* If an error was already reported for one of the arguments,
3274 avoid reporting another error. */
3276 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3277 return error_mark_node
;
3282 /* Handle the pointer + int case. */
3283 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3284 return pointer_int_sum (PLUS_EXPR
, op0
, op1
);
3285 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
3286 return pointer_int_sum (PLUS_EXPR
, op1
, op0
);
3292 /* Subtraction of two similar pointers.
3293 We must subtract them as integers, then divide by object size. */
3294 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3295 && comp_target_types (type0
, type1
, 1))
3296 return pointer_diff (op0
, op1
, common_type (type0
, type1
));
3297 /* Handle pointer minus int. Just like pointer plus int. */
3298 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3299 return pointer_int_sum (MINUS_EXPR
, op0
, op1
);
3308 case TRUNC_DIV_EXPR
:
3310 case FLOOR_DIV_EXPR
:
3311 case ROUND_DIV_EXPR
:
3312 case EXACT_DIV_EXPR
:
3313 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3314 || code0
== COMPLEX_TYPE
)
3315 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3316 || code1
== COMPLEX_TYPE
))
3318 if (TREE_CODE (op1
) == INTEGER_CST
&& integer_zerop (op1
))
3319 cp_warning ("division by zero in `%E / 0'", op0
);
3320 else if (TREE_CODE (op1
) == REAL_CST
&& real_zerop (op1
))
3321 cp_warning ("division by zero in `%E / 0.'", op0
);
3323 if (!(code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
))
3324 resultcode
= RDIV_EXPR
;
3326 /* When dividing two signed integers, we have to promote to int.
3327 unless we divide by a constant != -1. Note that default
3328 conversion will have been performed on the operands at this
3329 point, so we have to dig out the original type to find out if
3331 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3332 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3333 || (TREE_CODE (op1
) == INTEGER_CST
3334 && (TREE_INT_CST_LOW (op1
) != -1
3335 || TREE_INT_CST_HIGH (op1
) != -1)));
3341 case BIT_ANDTC_EXPR
:
3344 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3346 /* If one operand is a constant, and the other is a short type
3347 that has been converted to an int,
3348 really do the work in the short type and then convert the
3349 result to int. If we are lucky, the constant will be 0 or 1
3350 in the short type, making the entire operation go away. */
3351 if (TREE_CODE (op0
) == INTEGER_CST
3352 && TREE_CODE (op1
) == NOP_EXPR
3353 && (TYPE_PRECISION (type1
)
3354 > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op1
, 0))))
3355 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op1
, 0))))
3357 final_type
= result_type
;
3358 op1
= TREE_OPERAND (op1
, 0);
3359 result_type
= TREE_TYPE (op1
);
3361 if (TREE_CODE (op1
) == INTEGER_CST
3362 && TREE_CODE (op0
) == NOP_EXPR
3363 && (TYPE_PRECISION (type0
)
3364 > TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3365 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3367 final_type
= result_type
;
3368 op0
= TREE_OPERAND (op0
, 0);
3369 result_type
= TREE_TYPE (op0
);
3373 case TRUNC_MOD_EXPR
:
3374 case FLOOR_MOD_EXPR
:
3375 if (code1
== INTEGER_TYPE
&& integer_zerop (op1
))
3376 cp_warning ("division by zero in `%E %% 0'", op0
);
3377 else if (code1
== REAL_TYPE
&& real_zerop (op1
))
3378 cp_warning ("division by zero in `%E %% 0.'", op0
);
3380 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3382 /* Although it would be tempting to shorten always here, that loses
3383 on some targets, since the modulo instruction is undefined if the
3384 quotient can't be represented in the computation mode. We shorten
3385 only if unsigned or if dividing by something we know != -1. */
3386 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3387 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3388 || (TREE_CODE (op1
) == INTEGER_CST
3389 && (TREE_INT_CST_LOW (op1
) != -1
3390 || TREE_INT_CST_HIGH (op1
) != -1)));
3395 case TRUTH_ANDIF_EXPR
:
3396 case TRUTH_ORIF_EXPR
:
3397 case TRUTH_AND_EXPR
:
3399 result_type
= boolean_type_node
;
3402 /* Shift operations: result has same type as first operand;
3403 always convert second operand to int.
3404 Also set SHORT_SHIFT if shifting rightward. */
3407 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3409 result_type
= type0
;
3410 if (TREE_CODE (op1
) == INTEGER_CST
)
3412 if (tree_int_cst_lt (op1
, integer_zero_node
))
3413 warning ("right shift count is negative");
3416 if (TREE_INT_CST_LOW (op1
) | TREE_INT_CST_HIGH (op1
))
3418 if (TREE_INT_CST_HIGH (op1
) != 0
3419 || ((unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (op1
)
3420 >= TYPE_PRECISION (type0
)))
3421 warning ("right shift count >= width of type");
3424 /* Convert the shift-count to an integer, regardless of
3425 size of value being shifted. */
3426 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3427 op1
= cp_convert (integer_type_node
, op1
);
3428 /* Avoid converting op1 to result_type later. */
3434 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3436 result_type
= type0
;
3437 if (TREE_CODE (op1
) == INTEGER_CST
)
3439 if (tree_int_cst_lt (op1
, integer_zero_node
))
3440 warning ("left shift count is negative");
3441 else if (TREE_INT_CST_HIGH (op1
) != 0
3442 || ((unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (op1
)
3443 >= TYPE_PRECISION (type0
)))
3444 warning ("left shift count >= width of type");
3446 /* Convert the shift-count to an integer, regardless of
3447 size of value being shifted. */
3448 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3449 op1
= cp_convert (integer_type_node
, op1
);
3450 /* Avoid converting op1 to result_type later. */
3457 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3459 result_type
= type0
;
3460 if (TREE_CODE (op1
) == INTEGER_CST
)
3462 if (tree_int_cst_lt (op1
, integer_zero_node
))
3463 warning ("%s rotate count is negative",
3464 (code
== LROTATE_EXPR
) ? "left" : "right");
3465 else if (TREE_INT_CST_HIGH (op1
) != 0
3466 || ((unsigned HOST_WIDE_INT
) TREE_INT_CST_LOW (op1
)
3467 >= TYPE_PRECISION (type0
)))
3468 warning ("%s rotate count >= width of type",
3469 (code
== LROTATE_EXPR
) ? "left" : "right");
3471 /* Convert the shift-count to an integer, regardless of
3472 size of value being shifted. */
3473 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3474 op1
= cp_convert (integer_type_node
, op1
);
3480 build_type
= boolean_type_node
;
3481 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3482 || code0
== COMPLEX_TYPE
)
3483 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3484 || code1
== COMPLEX_TYPE
))
3486 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3488 register tree tt0
= TYPE_MAIN_VARIANT (TREE_TYPE (type0
));
3489 register tree tt1
= TYPE_MAIN_VARIANT (TREE_TYPE (type1
));
3491 if (comp_target_types (type0
, type1
, 1))
3492 result_type
= common_type (type0
, type1
);
3493 else if (tt0
== void_type_node
)
3495 if (pedantic
&& TREE_CODE (tt1
) == FUNCTION_TYPE
3496 && tree_int_cst_lt (TYPE_SIZE (type0
), TYPE_SIZE (type1
)))
3497 pedwarn ("ANSI C++ forbids comparison of `void *' with function pointer");
3498 else if (TREE_CODE (tt1
) == OFFSET_TYPE
)
3499 pedwarn ("ANSI C++ forbids conversion of a pointer to member to `void *'");
3501 else if (tt1
== void_type_node
)
3503 if (pedantic
&& TREE_CODE (tt0
) == FUNCTION_TYPE
3504 && tree_int_cst_lt (TYPE_SIZE (type1
), TYPE_SIZE (type0
)))
3505 pedwarn ("ANSI C++ forbids comparison of `void *' with function pointer");
3508 cp_pedwarn ("comparison of distinct pointer types `%T' and `%T' lacks a cast",
3511 if (result_type
== NULL_TREE
)
3512 result_type
= ptr_type_node
;
3514 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
3515 && integer_zerop (op1
))
3516 result_type
= type0
;
3517 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
3518 && integer_zerop (op0
))
3519 result_type
= type1
;
3520 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3522 result_type
= type0
;
3523 error ("ANSI C++ forbids comparison between pointer and integer");
3525 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3527 result_type
= type1
;
3528 error ("ANSI C++ forbids comparison between pointer and integer");
3530 else if (TYPE_PTRMEMFUNC_P (type0
) && TREE_CODE (op1
) == INTEGER_CST
3531 && integer_zerop (op1
))
3533 op0
= build_component_ref (op0
, index_identifier
, NULL_TREE
, 0);
3534 op1
= integer_zero_node
;
3535 result_type
= TREE_TYPE (op0
);
3537 else if (TYPE_PTRMEMFUNC_P (type1
) && TREE_CODE (op0
) == INTEGER_CST
3538 && integer_zerop (op0
))
3540 op0
= build_component_ref (op1
, index_identifier
, NULL_TREE
, 0);
3541 op1
= integer_zero_node
;
3542 result_type
= TREE_TYPE (op0
);
3544 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
)
3545 && (TYPE_PTRMEMFUNC_FN_TYPE (type0
)
3546 == TYPE_PTRMEMFUNC_FN_TYPE (type1
)))
3548 /* The code we generate for the test is:
3550 (op0.index == op1.index
3551 && ((op1.index != -1 && op0.delta2 == op1.delta2)
3552 || op0.pfn == op1.pfn)) */
3554 tree index0
= build_component_ref (op0
, index_identifier
,
3556 tree index1
= save_expr (build_component_ref (op1
, index_identifier
,
3558 tree pfn0
= PFN_FROM_PTRMEMFUNC (op0
);
3559 tree pfn1
= PFN_FROM_PTRMEMFUNC (op1
);
3560 tree delta20
= DELTA2_FROM_PTRMEMFUNC (op0
);
3561 tree delta21
= DELTA2_FROM_PTRMEMFUNC (op1
);
3563 tree integer_neg_one_node
3564 = build_binary_op (MINUS_EXPR
, integer_zero_node
,
3565 integer_one_node
, 1);
3566 e1
= build_binary_op (EQ_EXPR
, index0
, index1
, 1);
3567 e2
= build_binary_op (NE_EXPR
, index1
, integer_neg_one_node
, 1);
3568 e2
= build_binary_op (TRUTH_ANDIF_EXPR
, e2
,
3569 build_binary_op (EQ_EXPR
, delta20
, delta21
, 1),
3571 e3
= build_binary_op (EQ_EXPR
, pfn0
, pfn1
, 1);
3572 e2
= build_binary_op (TRUTH_ORIF_EXPR
, e2
, e3
, 1);
3573 e2
= build_binary_op (TRUTH_ANDIF_EXPR
, e1
, e2
, 1);
3574 if (code
== EQ_EXPR
)
3576 return build_binary_op (EQ_EXPR
, e2
, integer_zero_node
, 1);
3578 else if (TYPE_PTRMEMFUNC_P (type0
)
3579 && TYPE_PTRMEMFUNC_FN_TYPE (type0
) == type1
)
3581 tree index0
= build_component_ref (op0
, index_identifier
,
3584 tree pfn0
= PFN_FROM_PTRMEMFUNC (op0
);
3585 tree delta20
= DELTA2_FROM_PTRMEMFUNC (op0
);
3586 tree delta21
= integer_zero_node
;
3588 tree integer_neg_one_node
3589 = build_binary_op (MINUS_EXPR
, integer_zero_node
, integer_one_node
, 1);
3590 if (TREE_CODE (TREE_OPERAND (op1
, 0)) == FUNCTION_DECL
3591 && DECL_VINDEX (TREE_OPERAND (op1
, 0)))
3593 /* Map everything down one to make room for
3594 the null pointer to member. */
3595 index1
= size_binop (PLUS_EXPR
,
3596 DECL_VINDEX (TREE_OPERAND (op1
, 0)),
3598 op1
= integer_zero_node
;
3599 delta21
= CLASSTYPE_VFIELD (TYPE_METHOD_BASETYPE
3600 (TREE_TYPE (type1
)));
3601 delta21
= DECL_FIELD_BITPOS (delta21
);
3602 delta21
= size_binop (FLOOR_DIV_EXPR
, delta21
,
3603 size_int (BITS_PER_UNIT
));
3604 delta21
= convert (sizetype
, delta21
);
3607 index1
= integer_neg_one_node
;
3609 tree nop1
= build1 (NOP_EXPR
, TYPE_PTRMEMFUNC_FN_TYPE (type0
),
3611 TREE_CONSTANT (nop1
) = TREE_CONSTANT (op1
);
3614 e1
= build_binary_op (EQ_EXPR
, index0
, index1
, 1);
3615 e2
= build_binary_op (NE_EXPR
, index1
, integer_neg_one_node
, 1);
3616 e2
= build_binary_op (TRUTH_ANDIF_EXPR
, e2
,
3617 build_binary_op (EQ_EXPR
, delta20
, delta21
, 1),
3619 e3
= build_binary_op (EQ_EXPR
, pfn0
, op1
, 1);
3620 e2
= build_binary_op (TRUTH_ORIF_EXPR
, e2
, e3
, 1);
3621 e2
= build_binary_op (TRUTH_ANDIF_EXPR
, e1
, e2
, 1);
3622 if (code
== EQ_EXPR
)
3624 return build_binary_op (EQ_EXPR
, e2
, integer_zero_node
, 1);
3626 else if (TYPE_PTRMEMFUNC_P (type1
)
3627 && TYPE_PTRMEMFUNC_FN_TYPE (type1
) == type0
)
3629 return build_binary_op (code
, op1
, op0
, 1);
3635 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3636 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3638 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3640 if (comp_target_types (type0
, type1
, 1))
3641 result_type
= common_type (type0
, type1
);
3644 cp_pedwarn ("comparison of distinct pointer types `%T' and `%T' lacks a cast",
3646 result_type
= ptr_type_node
;
3655 build_type
= boolean_type_node
;
3656 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3657 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3659 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3661 if (comp_target_types (type0
, type1
, 1))
3662 result_type
= common_type (type0
, type1
);
3665 cp_pedwarn ("comparison of distinct pointer types `%T' and `%T' lacks a cast",
3667 result_type
= ptr_type_node
;
3670 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
3671 && integer_zerop (op1
))
3672 result_type
= type0
;
3673 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
3674 && integer_zerop (op0
))
3675 result_type
= type1
;
3676 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3678 result_type
= type0
;
3679 pedwarn ("ANSI C++ forbids comparison between pointer and integer");
3681 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3683 result_type
= type1
;
3684 pedwarn ("ANSI C++ forbids comparison between pointer and integer");
3692 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
3694 (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
))
3696 int none_complex
= (code0
!= COMPLEX_TYPE
&& code1
!= COMPLEX_TYPE
);
3698 if (shorten
|| common
|| short_compare
)
3699 result_type
= common_type (type0
, type1
);
3701 /* For certain operations (which identify themselves by shorten != 0)
3702 if both args were extended from the same smaller type,
3703 do the arithmetic in that type and then extend.
3705 shorten !=0 and !=1 indicates a bitwise operation.
3706 For them, this optimization is safe only if
3707 both args are zero-extended or both are sign-extended.
3708 Otherwise, we might change the result.
3709 Eg, (short)-1 | (unsigned short)-1 is (int)-1
3710 but calculated in (unsigned short) it would be (unsigned short)-1. */
3712 if (shorten
&& none_complex
)
3714 int unsigned0
, unsigned1
;
3715 tree arg0
= get_narrower (op0
, &unsigned0
);
3716 tree arg1
= get_narrower (op1
, &unsigned1
);
3717 /* UNS is 1 if the operation to be done is an unsigned one. */
3718 int uns
= TREE_UNSIGNED (result_type
);
3721 final_type
= result_type
;
3723 /* Handle the case that OP0 does not *contain* a conversion
3724 but it *requires* conversion to FINAL_TYPE. */
3726 if (op0
== arg0
&& TREE_TYPE (op0
) != final_type
)
3727 unsigned0
= TREE_UNSIGNED (TREE_TYPE (op0
));
3728 if (op1
== arg1
&& TREE_TYPE (op1
) != final_type
)
3729 unsigned1
= TREE_UNSIGNED (TREE_TYPE (op1
));
3731 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
3733 /* For bitwise operations, signedness of nominal type
3734 does not matter. Consider only how operands were extended. */
3738 /* Note that in all three cases below we refrain from optimizing
3739 an unsigned operation on sign-extended args.
3740 That would not be valid. */
3742 /* Both args variable: if both extended in same way
3743 from same width, do it in that width.
3744 Do it unsigned if args were zero-extended. */
3745 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
3746 < TYPE_PRECISION (result_type
))
3747 && (TYPE_PRECISION (TREE_TYPE (arg1
))
3748 == TYPE_PRECISION (TREE_TYPE (arg0
)))
3749 && unsigned0
== unsigned1
3750 && (unsigned0
|| !uns
))
3752 = signed_or_unsigned_type (unsigned0
,
3753 common_type (TREE_TYPE (arg0
),
3755 else if (TREE_CODE (arg0
) == INTEGER_CST
3756 && (unsigned1
|| !uns
)
3757 && (TYPE_PRECISION (TREE_TYPE (arg1
))
3758 < TYPE_PRECISION (result_type
))
3759 && (type
= signed_or_unsigned_type (unsigned1
,
3761 int_fits_type_p (arg0
, type
)))
3763 else if (TREE_CODE (arg1
) == INTEGER_CST
3764 && (unsigned0
|| !uns
)
3765 && (TYPE_PRECISION (TREE_TYPE (arg0
))
3766 < TYPE_PRECISION (result_type
))
3767 && (type
= signed_or_unsigned_type (unsigned0
,
3769 int_fits_type_p (arg1
, type
)))
3773 /* Shifts can be shortened if shifting right. */
3778 tree arg0
= get_narrower (op0
, &unsigned_arg
);
3780 final_type
= result_type
;
3782 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
3783 unsigned_arg
= TREE_UNSIGNED (TREE_TYPE (op0
));
3785 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
3786 /* We can shorten only if the shift count is less than the
3787 number of bits in the smaller type size. */
3788 && TREE_INT_CST_HIGH (op1
) == 0
3789 && TYPE_PRECISION (TREE_TYPE (arg0
)) > TREE_INT_CST_LOW (op1
)
3790 /* If arg is sign-extended and then unsigned-shifted,
3791 we can simulate this with a signed shift in arg's type
3792 only if the extended result is at least twice as wide
3793 as the arg. Otherwise, the shift could use up all the
3794 ones made by sign-extension and bring in zeros.
3795 We can't optimize that case at all, but in most machines
3796 it never happens because available widths are 2**N. */
3797 && (!TREE_UNSIGNED (final_type
)
3799 || (((unsigned) 2 * TYPE_PRECISION (TREE_TYPE (arg0
)))
3800 <= TYPE_PRECISION (result_type
))))
3802 /* Do an unsigned shift if the operand was zero-extended. */
3804 = signed_or_unsigned_type (unsigned_arg
,
3806 /* Convert value-to-be-shifted to that type. */
3807 if (TREE_TYPE (op0
) != result_type
)
3808 op0
= cp_convert (result_type
, op0
);
3813 /* Comparison operations are shortened too but differently.
3814 They identify themselves by setting short_compare = 1. */
3818 /* Don't write &op0, etc., because that would prevent op0
3819 from being kept in a register.
3820 Instead, make copies of the our local variables and
3821 pass the copies by reference, then copy them back afterward. */
3822 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
3823 enum tree_code xresultcode
= resultcode
;
3825 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
3827 return cp_convert (boolean_type_node
, val
);
3828 op0
= xop0
, op1
= xop1
;
3830 resultcode
= xresultcode
;
3833 if (short_compare
&& warn_sign_compare
)
3835 int op0_signed
= ! TREE_UNSIGNED (TREE_TYPE (orig_op0
));
3836 int op1_signed
= ! TREE_UNSIGNED (TREE_TYPE (orig_op1
));
3838 int unsignedp0
, unsignedp1
;
3839 tree primop0
= get_narrower (op0
, &unsignedp0
);
3840 tree primop1
= get_narrower (op1
, &unsignedp1
);
3842 /* Check for comparison of different enum types. */
3843 if (flag_int_enum_equivalence
== 0
3844 && TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
3845 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
3846 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
3847 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
3849 cp_warning ("comparison between `%#T' and `%#T'",
3850 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
3853 /* Give warnings for comparisons between signed and unsigned
3854 quantities that may fail. */
3855 /* Do the checking based on the original operand trees, so that
3856 casts will be considered, but default promotions won't be. */
3858 /* Do not warn if the comparison is being done in a signed type,
3859 since the signed type will only be chosen if it can represent
3860 all the values of the unsigned type. */
3861 if (! TREE_UNSIGNED (result_type
))
3863 /* Do not warn if both operands are unsigned. */
3864 else if (op0_signed
== op1_signed
)
3866 /* Do not warn if the signed quantity is an unsuffixed
3867 integer literal (or some static constant expression
3868 involving such literals) and it is non-negative. */
3869 else if ((op0_signed
&& TREE_CODE (orig_op0
) == INTEGER_CST
3870 && tree_int_cst_sgn (orig_op0
) >= 0)
3871 || (op1_signed
&& TREE_CODE (orig_op1
) == INTEGER_CST
3872 && tree_int_cst_sgn (orig_op1
) >= 0))
3874 /* Do not warn if the comparison is an equality operation,
3875 the unsigned quantity is an integral constant and it does
3876 not use the most significant bit of result_type. */
3877 else if ((resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
3878 && ((op0_signed
&& TREE_CODE (orig_op1
) == INTEGER_CST
3879 && int_fits_type_p (orig_op1
,
3880 signed_type (result_type
)))
3881 || (op1_signed
&& TREE_CODE (orig_op0
) == INTEGER_CST
3882 && int_fits_type_p (orig_op0
,
3883 signed_type (result_type
)))))
3886 warning ("comparison between signed and unsigned");
3888 /* Warn if two unsigned values are being compared in a size
3889 larger than their original size, and one (and only one) is the
3890 result of a `~' operator. This comparison will always fail.
3892 Also warn if one operand is a constant, and the constant does not
3893 have all bits set that are set in the ~ operand when it is
3896 if ((TREE_CODE (primop0
) == BIT_NOT_EXPR
)
3897 ^ (TREE_CODE (primop1
) == BIT_NOT_EXPR
))
3899 if (TREE_CODE (primop0
) == BIT_NOT_EXPR
)
3900 primop0
= get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
3901 if (TREE_CODE (primop1
) == BIT_NOT_EXPR
)
3902 primop1
= get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
3904 if (TREE_CODE (primop0
) == INTEGER_CST
3905 || TREE_CODE (primop1
) == INTEGER_CST
)
3908 HOST_WIDE_INT constant
, mask
;
3912 if (TREE_CODE (primop0
) == INTEGER_CST
)
3915 unsignedp
= unsignedp1
;
3916 constant
= TREE_INT_CST_LOW (primop0
);
3921 unsignedp
= unsignedp0
;
3922 constant
= TREE_INT_CST_LOW (primop1
);
3925 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
3926 if (bits
< TYPE_PRECISION (result_type
)
3927 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
3929 mask
= (~ (HOST_WIDE_INT
) 0) << bits
;
3930 if ((mask
& constant
) != mask
)
3931 warning ("comparison of promoted ~unsigned with constant");
3934 else if (unsignedp0
&& unsignedp1
3935 && (TYPE_PRECISION (TREE_TYPE (primop0
))
3936 < TYPE_PRECISION (result_type
))
3937 && (TYPE_PRECISION (TREE_TYPE (primop1
))
3938 < TYPE_PRECISION (result_type
)))
3939 warning ("comparison of promoted ~unsigned with unsigned");
3944 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
3945 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
3946 Then the expression will be built.
3947 It will be given type FINAL_TYPE if that is nonzero;
3948 otherwise, it will be given type RESULT_TYPE. */
3952 cp_error ("invalid operands `%T' and `%T' to binary `%O'",
3953 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), error_code
);
3954 return error_mark_node
;
3959 if (TREE_TYPE (op0
) != result_type
)
3960 op0
= cp_convert (result_type
, op0
);
3961 if (TREE_TYPE (op1
) != result_type
)
3962 op1
= cp_convert (result_type
, op1
);
3965 if (build_type
== NULL_TREE
)
3966 build_type
= result_type
;
3969 register tree result
= build (resultcode
, build_type
, op0
, op1
);
3970 register tree folded
;
3972 folded
= fold (result
);
3973 if (folded
== result
)
3974 TREE_CONSTANT (folded
) = TREE_CONSTANT (op0
) & TREE_CONSTANT (op1
);
3975 if (final_type
!= 0)
3976 return cp_convert (final_type
, folded
);
3981 /* Return a tree for the sum or difference (RESULTCODE says which)
3982 of pointer PTROP and integer INTOP. */
3985 pointer_int_sum (resultcode
, ptrop
, intop
)
3986 enum tree_code resultcode
;
3987 register tree ptrop
, intop
;
3991 register tree result
;
3992 register tree folded
= fold (intop
);
3994 /* The result is a pointer of the same type that is being added. */
3996 register tree result_type
= TREE_TYPE (ptrop
);
3998 if (!complete_type_or_else (result_type
))
3999 return error_mark_node
;
4001 if (TREE_CODE (TREE_TYPE (result_type
)) == VOID_TYPE
)
4003 if (pedantic
|| warn_pointer_arith
)
4004 pedwarn ("ANSI C++ forbids using pointer of type `void *' in arithmetic");
4005 size_exp
= integer_one_node
;
4007 else if (TREE_CODE (TREE_TYPE (result_type
)) == FUNCTION_TYPE
)
4009 if (pedantic
|| warn_pointer_arith
)
4010 pedwarn ("ANSI C++ forbids using pointer to a function in arithmetic");
4011 size_exp
= integer_one_node
;
4013 else if (TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
4015 if (pedantic
|| warn_pointer_arith
)
4016 pedwarn ("ANSI C++ forbids using pointer to a method in arithmetic");
4017 size_exp
= integer_one_node
;
4019 else if (TREE_CODE (TREE_TYPE (result_type
)) == OFFSET_TYPE
)
4021 if (pedantic
|| warn_pointer_arith
)
4022 pedwarn ("ANSI C++ forbids using pointer to a member in arithmetic");
4023 size_exp
= integer_one_node
;
4026 size_exp
= size_in_bytes (complete_type (TREE_TYPE (result_type
)));
4028 /* Needed to make OOPS V2R3 work. */
4030 if (TREE_CODE (intop
) == INTEGER_CST
4031 && TREE_INT_CST_LOW (intop
) == 0
4032 && TREE_INT_CST_HIGH (intop
) == 0)
4035 /* If what we are about to multiply by the size of the elements
4036 contains a constant term, apply distributive law
4037 and multiply that constant term separately.
4038 This helps produce common subexpressions. */
4040 if ((TREE_CODE (intop
) == PLUS_EXPR
|| TREE_CODE (intop
) == MINUS_EXPR
)
4041 && ! TREE_CONSTANT (intop
)
4042 && TREE_CONSTANT (TREE_OPERAND (intop
, 1))
4043 && TREE_CONSTANT (size_exp
))
4045 enum tree_code subcode
= resultcode
;
4046 if (TREE_CODE (intop
) == MINUS_EXPR
)
4047 subcode
= (subcode
== PLUS_EXPR
? MINUS_EXPR
: PLUS_EXPR
);
4048 ptrop
= build_binary_op (subcode
, ptrop
, TREE_OPERAND (intop
, 1), 1);
4049 intop
= TREE_OPERAND (intop
, 0);
4052 /* Convert the integer argument to a type the same size as sizetype
4053 so the multiply won't overflow spuriously. */
4055 if (TYPE_PRECISION (TREE_TYPE (intop
)) != TYPE_PRECISION (sizetype
))
4056 intop
= cp_convert (type_for_size (TYPE_PRECISION (sizetype
), 0), intop
);
4058 /* Replace the integer argument with a suitable product by the object size.
4059 Do this multiplication as signed, then convert to the appropriate
4060 pointer type (actually unsigned integral). */
4062 intop
= cp_convert (result_type
,
4063 build_binary_op (MULT_EXPR
, intop
,
4064 cp_convert (TREE_TYPE (intop
),
4068 /* Create the sum or difference. */
4070 result
= build (resultcode
, result_type
, ptrop
, intop
);
4072 folded
= fold (result
);
4073 if (folded
== result
)
4074 TREE_CONSTANT (folded
) = TREE_CONSTANT (ptrop
) & TREE_CONSTANT (intop
);
4078 /* Return a tree for the difference of pointers OP0 and OP1.
4079 The resulting tree has type int. */
4082 pointer_diff (op0
, op1
, ptrtype
)
4083 register tree op0
, op1
;
4084 register tree ptrtype
;
4086 register tree result
, folded
;
4087 tree restype
= ptrdiff_type_node
;
4088 tree target_type
= TREE_TYPE (ptrtype
);
4090 if (!complete_type_or_else (target_type
))
4091 return error_mark_node
;
4093 if (pedantic
|| warn_pointer_arith
)
4095 if (TREE_CODE (target_type
) == VOID_TYPE
)
4096 pedwarn ("ANSI C++ forbids using pointer of type `void *' in subtraction");
4097 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
4098 pedwarn ("ANSI C++ forbids using pointer to a function in subtraction");
4099 if (TREE_CODE (target_type
) == METHOD_TYPE
)
4100 pedwarn ("ANSI C++ forbids using pointer to a method in subtraction");
4101 if (TREE_CODE (target_type
) == OFFSET_TYPE
)
4102 pedwarn ("ANSI C++ forbids using pointer to a member in subtraction");
4105 /* First do the subtraction as integers;
4106 then drop through to build the divide operator. */
4108 op0
= build_binary_op (MINUS_EXPR
, cp_convert (restype
, op0
),
4109 cp_convert (restype
, op1
), 1);
4111 /* This generates an error if op1 is a pointer to an incomplete type. */
4112 if (TYPE_SIZE (TREE_TYPE (TREE_TYPE (op1
))) == 0)
4113 error ("arithmetic on pointer to an incomplete type");
4115 op1
= ((TREE_CODE (target_type
) == VOID_TYPE
4116 || TREE_CODE (target_type
) == FUNCTION_TYPE
4117 || TREE_CODE (target_type
) == METHOD_TYPE
4118 || TREE_CODE (target_type
) == OFFSET_TYPE
)
4120 : size_in_bytes (target_type
));
4122 /* Do the division. */
4124 result
= build (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
4126 folded
= fold (result
);
4127 if (folded
== result
)
4128 TREE_CONSTANT (folded
) = TREE_CONSTANT (op0
) & TREE_CONSTANT (op1
);
4132 /* Handle the case of taking the address of a COMPONENT_REF.
4133 Called by `build_unary_op' and `build_up_reference'.
4135 ARG is the COMPONENT_REF whose address we want.
4136 ARGTYPE is the pointer type that this address should have.
4137 MSG is an error message to print if this COMPONENT_REF is not
4138 addressable (such as a bitfield). */
4141 build_component_addr (arg
, argtype
, msg
)
4145 tree field
= TREE_OPERAND (arg
, 1);
4146 tree basetype
= decl_type_context (field
);
4147 tree rval
= build_unary_op (ADDR_EXPR
, TREE_OPERAND (arg
, 0), 0);
4149 if (DECL_BIT_FIELD (field
))
4151 error (msg
, IDENTIFIER_POINTER (DECL_NAME (field
)));
4152 return error_mark_node
;
4155 if (TREE_CODE (field
) == FIELD_DECL
4156 && TYPE_USES_COMPLEX_INHERITANCE (basetype
))
4158 /* Can't convert directly to ARGTYPE, since that
4159 may have the same pointer type as one of our
4161 rval
= build1 (NOP_EXPR
, argtype
,
4162 convert_pointer_to (basetype
, rval
));
4163 TREE_CONSTANT (rval
) = TREE_CONSTANT (TREE_OPERAND (rval
, 0));
4166 /* This conversion is harmless. */
4167 rval
= convert_force (argtype
, rval
, 0);
4169 if (! integer_zerop (DECL_FIELD_BITPOS (field
)))
4171 tree offset
= size_binop (EASY_DIV_EXPR
, DECL_FIELD_BITPOS (field
),
4172 size_int (BITS_PER_UNIT
));
4173 int flag
= TREE_CONSTANT (rval
);
4174 offset
= convert (sizetype
, offset
);
4175 rval
= fold (build (PLUS_EXPR
, argtype
,
4176 rval
, cp_convert (argtype
, offset
)));
4177 TREE_CONSTANT (rval
) = flag
;
4182 /* Construct and perhaps optimize a tree representation
4183 for a unary operation. CODE, a tree_code, specifies the operation
4184 and XARG is the operand. */
4187 build_x_unary_op (code
, xarg
)
4188 enum tree_code code
;
4191 if (processing_template_decl
)
4192 return build_min_nt (code
, xarg
, NULL_TREE
);
4194 /* & rec, on incomplete RECORD_TYPEs is the simple opr &, not an
4196 if (code
== ADDR_EXPR
4197 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
4198 && ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (xarg
)))
4199 && TYPE_SIZE (TREE_TYPE (xarg
)) == NULL_TREE
)
4200 || (TREE_CODE (xarg
) == OFFSET_REF
)))
4201 /* don't look for a function */;
4206 rval
= build_new_op (code
, LOOKUP_NORMAL
, xarg
,
4207 NULL_TREE
, NULL_TREE
);
4208 if (rval
|| code
!= ADDR_EXPR
)
4212 if (code
== ADDR_EXPR
)
4214 if (TREE_CODE (xarg
) == TARGET_EXPR
)
4215 warning ("taking address of temporary");
4218 return build_unary_op (code
, xarg
, 0);
4221 /* Just like truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4224 condition_conversion (expr
)
4228 if (processing_template_decl
)
4230 t
= cp_convert (boolean_type_node
, expr
);
4231 t
= fold (build1 (CLEANUP_POINT_EXPR
, boolean_type_node
, t
));
4235 /* C++: Must handle pointers to members.
4237 Perhaps type instantiation should be extended to handle conversion
4238 from aggregates to types we don't yet know we want? (Or are those
4239 cases typically errors which should be reported?)
4241 NOCONVERT nonzero suppresses the default promotions
4242 (such as from short to int). */
4245 build_unary_op (code
, xarg
, noconvert
)
4246 enum tree_code code
;
4250 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4251 register tree arg
= xarg
;
4252 register tree argtype
= 0;
4253 char *errstring
= NULL
;
4256 if (arg
== error_mark_node
)
4257 return error_mark_node
;
4262 /* This is used for unary plus, because a CONVERT_EXPR
4263 is enough to prevent anybody from looking inside for
4264 associativity, but won't generate any code. */
4265 if (!(arg
= build_expr_type_conversion
4266 (WANT_ARITH
| WANT_ENUM
| WANT_POINTER
, arg
, 1)))
4267 errstring
= "wrong type argument to unary plus";
4271 arg
= default_conversion (arg
);
4272 arg
= build1 (NON_LVALUE_EXPR
, TREE_TYPE (arg
), arg
);
4273 TREE_CONSTANT (arg
) = TREE_CONSTANT (TREE_OPERAND (arg
, 0));
4278 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, 1)))
4279 errstring
= "wrong type argument to unary minus";
4280 else if (!noconvert
)
4281 arg
= default_conversion (arg
);
4285 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4289 arg
= default_conversion (arg
);
4291 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
,
4293 errstring
= "wrong type argument to bit-complement";
4294 else if (!noconvert
)
4295 arg
= default_conversion (arg
);
4299 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, 1)))
4300 errstring
= "wrong type argument to abs";
4301 else if (!noconvert
)
4302 arg
= default_conversion (arg
);
4306 /* Conjugating a real value is a no-op, but allow it anyway. */
4307 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, 1)))
4308 errstring
= "wrong type argument to conjugation";
4309 else if (!noconvert
)
4310 arg
= default_conversion (arg
);
4313 case TRUTH_NOT_EXPR
:
4314 arg
= cp_convert (boolean_type_node
, arg
);
4315 val
= invert_truthvalue (arg
);
4316 if (arg
!= error_mark_node
)
4318 errstring
= "in argument to unary !";
4325 if (TREE_CODE (arg
) == COMPLEX_CST
)
4326 return TREE_REALPART (arg
);
4327 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4328 return fold (build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
4333 if (TREE_CODE (arg
) == COMPLEX_CST
)
4334 return TREE_IMAGPART (arg
);
4335 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4336 return fold (build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
4338 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4340 case PREINCREMENT_EXPR
:
4341 case POSTINCREMENT_EXPR
:
4342 case PREDECREMENT_EXPR
:
4343 case POSTDECREMENT_EXPR
:
4344 /* Handle complex lvalues (when permitted)
4345 by reduction to simpler cases. */
4347 val
= unary_complex_lvalue (code
, arg
);
4351 /* Increment or decrement the real part of the value,
4352 and don't change the imaginary part. */
4353 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4357 arg
= stabilize_reference (arg
);
4358 real
= build_unary_op (REALPART_EXPR
, arg
, 1);
4359 imag
= build_unary_op (IMAGPART_EXPR
, arg
, 1);
4360 return build (COMPLEX_EXPR
, TREE_TYPE (arg
),
4361 build_unary_op (code
, real
, 1), imag
);
4364 /* Report invalid types. */
4366 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4369 if (code
== PREINCREMENT_EXPR
)
4370 errstring
="no pre-increment operator for type";
4371 else if (code
== POSTINCREMENT_EXPR
)
4372 errstring
="no post-increment operator for type";
4373 else if (code
== PREDECREMENT_EXPR
)
4374 errstring
="no pre-decrement operator for type";
4376 errstring
="no post-decrement operator for type";
4380 /* Report something read-only. */
4382 if (TYPE_READONLY (TREE_TYPE (arg
))
4383 || TREE_READONLY (arg
))
4384 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4385 || code
== POSTINCREMENT_EXPR
)
4386 ? "increment" : "decrement"),
4391 tree result_type
= TREE_TYPE (arg
);
4393 arg
= get_unwidened (arg
, 0);
4394 argtype
= TREE_TYPE (arg
);
4396 /* ARM $5.2.5 last annotation says this should be forbidden. */
4397 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4398 pedwarn ("ANSI C++ forbids %sing an enum",
4399 (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4400 ? "increment" : "decrement");
4402 /* Compute the increment. */
4404 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4406 enum tree_code tmp
= TREE_CODE (TREE_TYPE (argtype
));
4407 if (TYPE_SIZE (complete_type (TREE_TYPE (argtype
))) == 0)
4408 cp_error ("cannot %s a pointer to incomplete type `%T'",
4409 ((code
== PREINCREMENT_EXPR
4410 || code
== POSTINCREMENT_EXPR
)
4411 ? "increment" : "decrement"), TREE_TYPE (argtype
));
4412 else if ((pedantic
|| warn_pointer_arith
)
4413 && (tmp
== FUNCTION_TYPE
|| tmp
== METHOD_TYPE
4414 || tmp
== VOID_TYPE
|| tmp
== OFFSET_TYPE
))
4415 cp_pedwarn ("ANSI C++ forbids %sing a pointer of type `%T'",
4416 ((code
== PREINCREMENT_EXPR
4417 || code
== POSTINCREMENT_EXPR
)
4418 ? "increment" : "decrement"), argtype
);
4419 inc
= c_sizeof_nowarn (TREE_TYPE (argtype
));
4422 inc
= integer_one_node
;
4424 inc
= cp_convert (argtype
, inc
);
4426 /* Handle incrementing a cast-expression. */
4428 switch (TREE_CODE (arg
))
4433 case FIX_TRUNC_EXPR
:
4434 case FIX_FLOOR_EXPR
:
4435 case FIX_ROUND_EXPR
:
4438 tree incremented
, modify
, value
, compound
;
4439 if (! lvalue_p (arg
) && pedantic
)
4440 pedwarn ("cast to non-reference type used as lvalue");
4441 arg
= stabilize_reference (arg
);
4442 if (code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4445 value
= save_expr (arg
);
4446 incremented
= build (((code
== PREINCREMENT_EXPR
4447 || code
== POSTINCREMENT_EXPR
)
4448 ? PLUS_EXPR
: MINUS_EXPR
),
4449 argtype
, value
, inc
);
4450 TREE_SIDE_EFFECTS (incremented
) = 1;
4452 modify
= build_modify_expr (arg
, NOP_EXPR
, incremented
);
4453 compound
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), modify
, value
);
4455 /* Eliminate warning about unused result of + or -. */
4456 TREE_NO_UNUSED_WARNING (compound
) = 1;
4464 /* Complain about anything else that is not a true lvalue. */
4465 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
4466 || code
== POSTINCREMENT_EXPR
)
4467 ? "increment" : "decrement")))
4468 return error_mark_node
;
4470 /* Forbid using -- on `bool'. */
4471 if (TREE_TYPE (arg
) == boolean_type_node
)
4473 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4475 cp_error ("invalid use of `--' on bool variable `%D'", arg
);
4476 return error_mark_node
;
4479 /* This will only work if someone can convince Kenner to accept
4480 my patch to expand_increment. (jason) */
4481 val
= build (code
, TREE_TYPE (arg
), arg
, inc
);
4483 if (code
== POSTINCREMENT_EXPR
)
4485 arg
= stabilize_reference (arg
);
4486 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4488 TREE_SIDE_EFFECTS (val
) = 1;
4489 arg
= save_expr (arg
);
4490 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), val
, arg
);
4491 val
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), arg
, val
);
4494 val
= build (MODIFY_EXPR
, TREE_TYPE (arg
), arg
,
4499 val
= build (code
, TREE_TYPE (arg
), arg
, inc
);
4501 TREE_SIDE_EFFECTS (val
) = 1;
4502 return cp_convert (result_type
, val
);
4506 /* Note that this operation never does default_conversion
4507 regardless of NOCONVERT. */
4509 argtype
= lvalue_type (arg
);
4510 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4514 build_pointer_type (TREE_TYPE (argtype
)), arg
);
4515 TREE_CONSTANT (arg
) = TREE_CONSTANT (TREE_OPERAND (arg
, 0));
4518 else if (pedantic
&& DECL_MAIN_P (arg
))
4520 pedwarn ("taking address of function `main'");
4522 /* Let &* cancel out to simplify resulting code. */
4523 if (TREE_CODE (arg
) == INDIRECT_REF
)
4525 /* We don't need to have `current_class_ptr' wrapped in a
4526 NON_LVALUE_EXPR node. */
4527 if (arg
== current_class_ref
)
4528 return current_class_ptr
;
4530 arg
= TREE_OPERAND (arg
, 0);
4531 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4535 build_pointer_type (TREE_TYPE (TREE_TYPE (arg
))), arg
);
4536 TREE_CONSTANT (arg
) = TREE_CONSTANT (TREE_OPERAND (arg
, 0));
4538 else if (lvalue_p (arg
))
4539 /* Don't let this be an lvalue. */
4540 return non_lvalue (arg
);
4544 /* For &x[y], return x+y */
4545 if (TREE_CODE (arg
) == ARRAY_REF
)
4547 if (mark_addressable (TREE_OPERAND (arg
, 0)) == 0)
4548 return error_mark_node
;
4549 return build_binary_op (PLUS_EXPR
, TREE_OPERAND (arg
, 0),
4550 TREE_OPERAND (arg
, 1), 1);
4553 /* Uninstantiated types are all functions. Taking the
4554 address of a function is a no-op, so just return the
4557 if (TREE_CODE (arg
) == IDENTIFIER_NODE
4558 && IDENTIFIER_OPNAME_P (arg
))
4560 my_friendly_abort (117);
4561 /* We don't know the type yet, so just work around the problem.
4562 We know that this will resolve to an lvalue. */
4563 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4566 if (TREE_CODE (arg
) == OVERLOAD
4567 || (TREE_CODE (arg
) == OFFSET_REF
4568 && TREE_CODE (TREE_OPERAND (arg
, 1)) == TEMPLATE_ID_EXPR
))
4569 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4570 else if (TREE_CODE (arg
) == TREE_LIST
)
4572 if (TREE_CODE (TREE_VALUE (arg
)) == FUNCTION_DECL
)
4573 /* Unique overloaded non-member function. */
4574 return build_unary_op (ADDR_EXPR
, TREE_VALUE (arg
), 0);
4575 if (TREE_CHAIN (arg
) == NULL_TREE
4576 && TREE_CODE (TREE_VALUE (arg
)) == TREE_LIST
4577 && TREE_CODE (TREE_VALUE (TREE_VALUE (arg
))) != OVERLOAD
)
4578 /* Unique overloaded member function. */
4579 return build_unary_op (ADDR_EXPR
, TREE_VALUE (TREE_VALUE (arg
)),
4581 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4583 else if (TREE_CODE (arg
) == TEMPLATE_ID_EXPR
)
4588 /* We don't require a match here; it's possible that the
4589 context (like a cast to a particular type) will resolve
4590 the particular choice of template. */
4591 fn
= determine_specialization (arg
,
4599 fn
= instantiate_template (fn
, targs
);
4600 mark_addressable (fn
);
4601 return build_unary_op (ADDR_EXPR
, fn
, 0);
4604 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4607 /* Handle complex lvalues (when permitted)
4608 by reduction to simpler cases. */
4609 val
= unary_complex_lvalue (code
, arg
);
4613 switch (TREE_CODE (arg
))
4618 case FIX_TRUNC_EXPR
:
4619 case FIX_FLOOR_EXPR
:
4620 case FIX_ROUND_EXPR
:
4622 if (! lvalue_p (arg
) && pedantic
)
4623 pedwarn ("taking the address of a cast to non-reference type");
4630 /* Allow the address of a constructor if all the elements
4632 if (TREE_CODE (arg
) == CONSTRUCTOR
&& TREE_HAS_CONSTRUCTOR (arg
)
4633 && TREE_CONSTANT (arg
))
4635 /* Anything not already handled and not a true memory reference
4637 else if (TREE_CODE (argtype
) != FUNCTION_TYPE
4638 && TREE_CODE (argtype
) != METHOD_TYPE
4639 && !lvalue_or_else (arg
, "unary `&'"))
4640 return error_mark_node
;
4642 argtype
= build_pointer_type (argtype
);
4644 if (mark_addressable (arg
) == 0)
4645 return error_mark_node
;
4650 if (TREE_CODE (arg
) == COMPONENT_REF
)
4651 addr
= build_component_addr
4653 "attempt to take address of bit-field structure member `%s'");
4655 addr
= build1 (code
, argtype
, arg
);
4657 /* Address of a static or external variable or
4658 function counts as a constant */
4660 TREE_CONSTANT (addr
) = 1;
4662 if (TREE_CODE (argtype
) == POINTER_TYPE
4663 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4665 build_ptrmemfunc_type (argtype
);
4666 addr
= build_ptrmemfunc (argtype
, addr
, 0);
4679 argtype
= TREE_TYPE (arg
);
4680 return fold (build1 (code
, argtype
, arg
));
4684 return error_mark_node
;
4688 /* If CONVERSIONS is a conversion expression or a nested sequence of such,
4689 convert ARG with the same conversions in the same order
4690 and return the result. */
4693 convert_sequence (conversions
, arg
)
4697 switch (TREE_CODE (conversions
))
4702 case FIX_TRUNC_EXPR
:
4703 case FIX_FLOOR_EXPR
:
4704 case FIX_ROUND_EXPR
:
4706 return cp_convert (TREE_TYPE (conversions
),
4707 convert_sequence (TREE_OPERAND (conversions
, 0),
4716 /* Apply unary lvalue-demanding operator CODE to the expression ARG
4717 for certain kinds of expressions which are not really lvalues
4718 but which we can accept as lvalues.
4720 If ARG is not a kind of expression we can handle, return zero. */
4723 unary_complex_lvalue (code
, arg
)
4724 enum tree_code code
;
4727 /* Handle (a, b) used as an "lvalue". */
4728 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
4730 tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 1), 0);
4731 return build (COMPOUND_EXPR
, TREE_TYPE (real_result
),
4732 TREE_OPERAND (arg
, 0), real_result
);
4735 /* Handle (a ? b : c) used as an "lvalue". */
4736 if (TREE_CODE (arg
) == COND_EXPR
4737 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
4738 return rationalize_conditional_expr (code
, arg
);
4740 if (TREE_CODE (arg
) == MODIFY_EXPR
4741 || TREE_CODE (arg
) == PREINCREMENT_EXPR
4742 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
4743 return unary_complex_lvalue
4744 (code
, build (COMPOUND_EXPR
, TREE_TYPE (TREE_OPERAND (arg
, 0)),
4745 arg
, TREE_OPERAND (arg
, 0)));
4747 if (code
!= ADDR_EXPR
)
4750 /* Handle (a = b) used as an "lvalue" for `&'. */
4751 if (TREE_CODE (arg
) == MODIFY_EXPR
4752 || TREE_CODE (arg
) == INIT_EXPR
)
4754 tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 0), 0);
4755 arg
= build (COMPOUND_EXPR
, TREE_TYPE (real_result
), arg
, real_result
);
4756 TREE_NO_UNUSED_WARNING (arg
) = 1;
4760 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
4761 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
4762 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
4764 /* The representation of something of type OFFSET_TYPE
4765 is really the representation of a pointer to it.
4766 Here give the representation its true type. */
4769 my_friendly_assert (TREE_CODE (arg
) != SCOPE_REF
, 313);
4771 if (TREE_CODE (arg
) != OFFSET_REF
)
4774 t
= TREE_OPERAND (arg
, 1);
4776 /* Check all this code for right semantics. */
4777 if (TREE_CODE (t
) == FUNCTION_DECL
)
4779 if (DECL_DESTRUCTOR_P (t
))
4780 cp_error ("taking address of destructor");
4781 return build_unary_op (ADDR_EXPR
, t
, 0);
4783 if (TREE_CODE (t
) == VAR_DECL
)
4784 return build_unary_op (ADDR_EXPR
, t
, 0);
4790 if (TREE_OPERAND (arg
, 0)
4791 && (TREE_CODE (TREE_OPERAND (arg
, 0)) != NOP_EXPR
4792 || (TREE_OPERAND (TREE_OPERAND (arg
, 0), 0)
4793 != error_mark_node
)))
4794 if (TREE_CODE (t
) != FIELD_DECL
)
4796 /* Don't know if this should return address to just
4797 _DECL, or actual address resolved in this expression. */
4798 sorry ("address of bound pointer-to-member expression");
4799 return error_mark_node
;
4802 /* Add in the offset to the field. */
4803 offset
= convert (sizetype
,
4804 size_binop (EASY_DIV_EXPR
,
4805 DECL_FIELD_BITPOS (t
),
4806 size_int (BITS_PER_UNIT
)));
4808 /* We offset all pointer to data members by 1 so that we can
4809 distinguish between a null pointer to data member and the first
4810 data member of a structure. */
4811 offset
= size_binop (PLUS_EXPR
, offset
, size_int (1));
4813 type
= build_offset_type (DECL_FIELD_CONTEXT (t
), TREE_TYPE (t
));
4814 type
= build_pointer_type (type
);
4816 return cp_convert (type
, offset
);
4821 /* We permit compiler to make function calls returning
4822 objects of aggregate type look like lvalues. */
4826 if (TREE_CODE (targ
) == SAVE_EXPR
)
4827 targ
= TREE_OPERAND (targ
, 0);
4829 if (TREE_CODE (targ
) == CALL_EXPR
&& IS_AGGR_TYPE (TREE_TYPE (targ
)))
4831 if (TREE_CODE (arg
) == SAVE_EXPR
)
4834 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
4835 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
4838 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
4839 return build (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
4840 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
4843 /* Don't let anything else be handled specially. */
4847 /* Mark EXP saying that we need to be able to take the
4848 address of it; it should not be allocated in a register.
4849 Value is 1 if successful.
4851 C++: we do not allow `current_class_ptr' to be addressable. */
4854 mark_addressable (exp
)
4857 register tree x
= exp
;
4859 if (TREE_ADDRESSABLE (x
) == 1)
4863 switch (TREE_CODE (x
))
4870 x
= TREE_OPERAND (x
, 0);
4874 if (x
== current_class_ptr
)
4876 if (! flag_this_is_variable
)
4877 error ("address of `this' not available");
4878 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later */
4879 put_var_into_stack (x
);
4883 if (TREE_STATIC (x
) && TREE_READONLY (x
)
4884 && DECL_RTL (x
) != 0
4885 && ! DECL_IN_MEMORY_P (x
))
4887 /* We thought this would make a good constant variable,
4888 but we were wrong. */
4889 push_obstacks_nochange ();
4890 end_temporary_allocation ();
4892 TREE_ASM_WRITTEN (x
) = 0;
4894 rest_of_decl_compilation (x
, 0, IDENTIFIER_LOCAL_VALUE (x
) == 0,
4896 TREE_ADDRESSABLE (x
) = 1;
4902 /* Caller should not be trying to mark initialized
4903 constant fields addressable. */
4904 my_friendly_assert (DECL_LANG_SPECIFIC (x
) == 0
4905 || DECL_IN_AGGR_P (x
) == 0
4907 || DECL_EXTERNAL (x
), 314);
4911 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
4912 && !DECL_ARTIFICIAL (x
) && extra_warnings
)
4913 cp_warning ("address requested for `%D', which is declared `register'",
4915 put_var_into_stack (x
);
4916 TREE_ADDRESSABLE (x
) = 1;
4920 if (DECL_LANG_SPECIFIC (x
) != 0)
4922 x
= DECL_MAIN_VARIANT (x
);
4923 /* We have to test both conditions here. The first may be
4924 non-zero in the case of processing a default function. The
4925 second may be non-zero in the case of a template function. */
4926 if (DECL_TEMPLATE_INFO (x
) && !DECL_TEMPLATE_SPECIALIZATION (x
))
4929 TREE_ADDRESSABLE (x
) = 1;
4931 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x
)) = 1;
4935 TREE_ADDRESSABLE (x
) = 1;
4939 TREE_ADDRESSABLE (x
) = 1;
4940 mark_addressable (TREE_OPERAND (x
, 0));
4948 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
4951 build_x_conditional_expr (ifexp
, op1
, op2
)
4952 tree ifexp
, op1
, op2
;
4954 if (processing_template_decl
)
4955 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
4957 return build_new_op (COND_EXPR
, LOOKUP_NORMAL
, ifexp
, op1
, op2
);
4961 build_conditional_expr (ifexp
, op1
, op2
)
4962 tree ifexp
, op1
, op2
;
4964 register tree type1
;
4965 register tree type2
;
4966 register enum tree_code code1
;
4967 register enum tree_code code2
;
4968 register tree result_type
= NULL_TREE
;
4970 /* If second operand is omitted, it is the same as the first one;
4971 make sure it is calculated only once. */
4975 pedwarn ("ANSI C++ forbids omitting the middle term of a ?: expression");
4976 ifexp
= op1
= save_expr (ifexp
);
4979 ifexp
= cp_convert (boolean_type_node
, ifexp
);
4981 if (TREE_CODE (ifexp
) == ERROR_MARK
)
4982 return error_mark_node
;
4984 op1
= require_instantiated_type (TREE_TYPE (op2
), op1
, error_mark_node
);
4985 if (op1
== error_mark_node
)
4986 return error_mark_node
;
4987 op2
= require_instantiated_type (TREE_TYPE (op1
), op2
, error_mark_node
);
4988 if (op2
== error_mark_node
)
4989 return error_mark_node
;
4991 /* C++: REFERENCE_TYPES must be dereferenced. */
4992 type1
= TREE_TYPE (op1
);
4993 code1
= TREE_CODE (type1
);
4994 type2
= TREE_TYPE (op2
);
4995 code2
= TREE_CODE (type2
);
4997 if (code1
== REFERENCE_TYPE
)
4999 op1
= convert_from_reference (op1
);
5000 type1
= TREE_TYPE (op1
);
5001 code1
= TREE_CODE (type1
);
5003 if (code2
== REFERENCE_TYPE
)
5005 op2
= convert_from_reference (op2
);
5006 type2
= TREE_TYPE (op2
);
5007 code2
= TREE_CODE (type2
);
5010 /* Don't promote the operands separately if they promote
5011 the same way. Return the unpromoted type and let the combined
5012 value get promoted if necessary. */
5014 if (TYPE_MAIN_VARIANT (type1
) == TYPE_MAIN_VARIANT (type2
)
5015 && code2
!= ARRAY_TYPE
5016 && code2
!= FUNCTION_TYPE
5017 && code2
!= METHOD_TYPE
)
5021 if (TREE_CONSTANT (ifexp
)
5022 && (TREE_CODE (ifexp
) == INTEGER_CST
5023 || TREE_CODE (ifexp
) == ADDR_EXPR
))
5024 return (integer_zerop (ifexp
) ? op2
: op1
);
5026 if (TREE_CODE (op1
) == CONST_DECL
)
5027 op1
= DECL_INITIAL (op1
);
5028 else if (TREE_READONLY_DECL_P (op1
))
5029 op1
= decl_constant_value (op1
);
5030 if (TREE_CODE (op2
) == CONST_DECL
)
5031 op2
= DECL_INITIAL (op2
);
5032 else if (TREE_READONLY_DECL_P (op2
))
5033 op2
= decl_constant_value (op2
);
5035 type1
= cp_build_type_variant
5037 TREE_READONLY (op1
) || TREE_READONLY (op2
),
5038 TREE_THIS_VOLATILE (op1
) || TREE_THIS_VOLATILE (op2
));
5039 /* ??? This is a kludge to deal with the fact that
5040 we don't sort out integers and enums properly, yet. */
5041 result
= fold (build (COND_EXPR
, type1
, ifexp
, op1
, op2
));
5042 if (TREE_TYPE (result
) != type1
)
5043 result
= build1 (NOP_EXPR
, type1
, result
);
5044 /* Expand both sides into the same slot,
5045 hopefully the target of the ?: expression. */
5046 if (TREE_CODE (op1
) == TARGET_EXPR
&& TREE_CODE (op2
) == TARGET_EXPR
)
5048 tree slot
= build (VAR_DECL
, TREE_TYPE (result
));
5049 layout_decl (slot
, 0);
5050 result
= build (TARGET_EXPR
, TREE_TYPE (result
),
5051 slot
, result
, NULL_TREE
, NULL_TREE
);
5056 /* They don't match; promote them both and then try to reconcile them.
5057 But don't permit mismatching enum types. */
5058 if (code1
== ENUMERAL_TYPE
)
5060 if (code2
== ENUMERAL_TYPE
)
5062 cp_error ("enumeral mismatch in conditional expression: `%T' vs `%T'",
5064 return error_mark_node
;
5066 else if (extra_warnings
&& ! IS_AGGR_TYPE_CODE (code2
)
5067 && type2
!= type_promotes_to (type1
))
5068 warning ("enumeral and non-enumeral type in conditional expression");
5070 else if (extra_warnings
5071 && code2
== ENUMERAL_TYPE
&& ! IS_AGGR_TYPE_CODE (code1
)
5072 && type1
!= type_promotes_to (type2
))
5073 warning ("enumeral and non-enumeral type in conditional expression");
5075 if (code1
!= VOID_TYPE
)
5077 op1
= default_conversion (op1
);
5078 type1
= TREE_TYPE (op1
);
5079 if (TYPE_PTRMEMFUNC_P (type1
))
5080 type1
= TYPE_PTRMEMFUNC_FN_TYPE (type1
);
5081 code1
= TREE_CODE (type1
);
5083 if (code2
!= VOID_TYPE
)
5085 op2
= default_conversion (op2
);
5086 type2
= TREE_TYPE (op2
);
5087 if (TYPE_PTRMEMFUNC_P (type2
))
5088 type2
= TYPE_PTRMEMFUNC_FN_TYPE (type2
);
5089 code2
= TREE_CODE (type2
);
5092 if (code1
== RECORD_TYPE
&& code2
== RECORD_TYPE
5093 && real_lvalue_p (op1
) && real_lvalue_p (op2
)
5094 && comptypes (type1
, type2
, -1))
5096 type1
= build_reference_type (type1
);
5097 type2
= build_reference_type (type2
);
5098 result_type
= common_type (type1
, type2
);
5099 op1
= convert_to_reference (result_type
, op1
, CONV_IMPLICIT
,
5100 LOOKUP_NORMAL
, NULL_TREE
);
5101 op2
= convert_to_reference (result_type
, op2
, CONV_IMPLICIT
,
5102 LOOKUP_NORMAL
, NULL_TREE
);
5104 /* Quickly detect the usual case where op1 and op2 have the same type
5106 else if (TYPE_MAIN_VARIANT (type1
) == TYPE_MAIN_VARIANT (type2
))
5109 result_type
= type1
;
5111 result_type
= cp_build_type_variant
5113 TREE_READONLY (op1
) || TREE_READONLY (op2
),
5114 TREE_THIS_VOLATILE (op1
) || TREE_THIS_VOLATILE (op2
));
5116 else if ((code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
)
5117 && (code2
== INTEGER_TYPE
|| code2
== REAL_TYPE
))
5119 result_type
= common_type (type1
, type2
);
5121 else if (code1
== VOID_TYPE
|| code2
== VOID_TYPE
)
5123 if (pedantic
&& (code1
!= VOID_TYPE
|| code2
!= VOID_TYPE
))
5124 pedwarn ("ANSI C++ forbids conditional expr with only one void side");
5125 result_type
= void_type_node
;
5127 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op2
))
5128 result_type
= qualify_type (type1
, type2
);
5129 else if (code2
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
5130 result_type
= qualify_type (type2
, type1
);
5131 else if (code1
== POINTER_TYPE
&& code2
== POINTER_TYPE
)
5133 if (comp_target_types (type1
, type2
, 1))
5134 result_type
= common_type (type1
, type2
);
5135 else if (TYPE_MAIN_VARIANT (TREE_TYPE (type1
)) == void_type_node
)
5137 if (pedantic
&& TREE_CODE (type2
) == FUNCTION_TYPE
)
5138 pedwarn ("ANSI C++ forbids conditional expr between `void *' and function pointer");
5139 result_type
= qualify_type (type1
, type2
);
5141 else if (TYPE_MAIN_VARIANT (TREE_TYPE (type2
)) == void_type_node
)
5143 if (pedantic
&& TREE_CODE (type1
) == FUNCTION_TYPE
)
5144 pedwarn ("ANSI C++ forbids conditional expr between `void *' and function pointer");
5145 result_type
= qualify_type (type2
, type1
);
5148 else if (comptypes (type2
, type1
, 0))
5149 result_type
= type2
;
5150 else if (IS_AGGR_TYPE (TREE_TYPE (type1
))
5151 && IS_AGGR_TYPE (TREE_TYPE (type2
))
5152 && (result_type
= common_base_type (TREE_TYPE (type1
),
5153 TREE_TYPE (type2
))))
5155 if (result_type
== error_mark_node
)
5157 cp_error ("common base type of types `%T' and `%T' is ambiguous",
5158 TREE_TYPE (type1
), TREE_TYPE (type2
));
5159 result_type
= ptr_type_node
;
5164 && result_type
!= TREE_TYPE (type1
)
5165 && result_type
!= TREE_TYPE (type2
))
5166 cp_pedwarn ("`%T' and `%T' converted to `%T *' in conditional expression",
5167 type1
, type2
, result_type
);
5169 result_type
= build_pointer_type (result_type
);
5174 pedwarn ("pointer type mismatch in conditional expression");
5175 result_type
= ptr_type_node
;
5178 else if (code1
== POINTER_TYPE
&& code2
== INTEGER_TYPE
)
5180 pedwarn ("pointer/integer type mismatch in conditional expression");
5181 result_type
= type1
;
5183 else if (code2
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
5185 pedwarn ("pointer/integer type mismatch in conditional expression");
5186 result_type
= type2
;
5191 /* The match does not look good. If either is
5192 an aggregate value, try converting to a scalar type. */
5193 if (code1
== RECORD_TYPE
&& code2
== RECORD_TYPE
)
5195 cp_error ("aggregate mismatch in conditional expression: `%T' vs `%T'",
5197 return error_mark_node
;
5199 /* Warning: this code assumes that conversion between cv-variants of
5200 a type is done using NOP_EXPRs. */
5201 if (code1
== RECORD_TYPE
&& TYPE_HAS_CONVERSION (type1
))
5203 /* There are other types besides pointers and records. */
5205 if (code2
== POINTER_TYPE
)
5206 tmp
= build_pointer_type
5207 (build_type_variant (TREE_TYPE (type2
), 1, 1));
5210 tmp
= build_type_conversion (CONVERT_EXPR
, tmp
, op1
, 0);
5211 if (tmp
== NULL_TREE
)
5213 cp_error ("incompatible types `%T' and `%T' in `?:'",
5215 return error_mark_node
;
5217 if (tmp
== error_mark_node
)
5218 error ("ambiguous pointer conversion");
5221 result_type
= common_type (type2
, TREE_TYPE (tmp
));
5224 else if (code2
== RECORD_TYPE
&& TYPE_HAS_CONVERSION (type2
))
5227 if (code1
== POINTER_TYPE
)
5228 tmp
= build_pointer_type
5229 (build_type_variant (TREE_TYPE (type1
), 1, 1));
5233 tmp
= build_type_conversion (CONVERT_EXPR
, tmp
, op2
, 0);
5234 if (tmp
== NULL_TREE
)
5236 cp_error ("incompatible types `%T' and `%T' in `?:'",
5238 return error_mark_node
;
5240 if (tmp
== error_mark_node
)
5241 error ("ambiguous pointer conversion");
5244 result_type
= common_type (type1
, TREE_TYPE (tmp
));
5247 else if (flag_cond_mismatch
)
5248 result_type
= void_type_node
;
5251 error ("type mismatch in conditional expression");
5252 return error_mark_node
;
5256 if (TREE_CODE (result_type
) == POINTER_TYPE
5257 && TREE_CODE (TREE_TYPE (result_type
)) == METHOD_TYPE
)
5258 result_type
= build_ptrmemfunc_type (result_type
);
5260 if (result_type
!= TREE_TYPE (op1
))
5261 op1
= convert_for_initialization
5262 (NULL_TREE
, result_type
, op1
, LOOKUP_NORMAL
, "converting", NULL_TREE
, 0);
5263 if (result_type
!= TREE_TYPE (op2
))
5264 op2
= convert_for_initialization
5265 (NULL_TREE
, result_type
, op2
, LOOKUP_NORMAL
, "converting", NULL_TREE
, 0);
5267 if (TREE_CONSTANT (ifexp
))
5268 return integer_zerop (ifexp
) ? op2
: op1
;
5270 return convert_from_reference
5271 (fold (build (COND_EXPR
, result_type
, ifexp
, op1
, op2
)));
5274 /* Handle overloading of the ',' operator when needed. Otherwise,
5275 this function just builds an expression list. */
5278 build_x_compound_expr (list
)
5281 tree rest
= TREE_CHAIN (list
);
5284 if (processing_template_decl
)
5285 return build_min_nt (COMPOUND_EXPR
, list
, NULL_TREE
);
5287 if (rest
== NULL_TREE
)
5288 return build_compound_expr (list
);
5290 result
= build_opfncall (COMPOUND_EXPR
, LOOKUP_NORMAL
,
5291 TREE_VALUE (list
), TREE_VALUE (rest
), NULL_TREE
);
5293 return build_x_compound_expr (expr_tree_cons (NULL_TREE
, result
,
5294 TREE_CHAIN (rest
)));
5296 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list
)))
5298 /* the left-hand operand of a comma expression is like an expression
5299 statement: we should warn if it doesn't have any side-effects,
5300 unless it was explicitly cast to (void). */
5301 if ((extra_warnings
|| warn_unused
)
5302 && !(TREE_CODE (TREE_VALUE(list
)) == CONVERT_EXPR
5303 && TREE_TYPE (TREE_VALUE(list
)) == void_type_node
))
5304 warning("left-hand operand of comma expression has no effect");
5306 #if 0 /* this requires a gcc backend patch to export warn_if_unused_value */
5307 else if (warn_unused
)
5308 warn_if_unused_value (TREE_VALUE(list
));
5311 return build_compound_expr
5312 (expr_tree_cons (NULL_TREE
, TREE_VALUE (list
),
5313 build_expr_list (NULL_TREE
,
5314 build_x_compound_expr (rest
))));
5317 /* Given a list of expressions, return a compound expression
5318 that performs them all and returns the value of the last of them. */
5321 build_compound_expr (list
)
5326 if (TREE_READONLY_DECL_P (TREE_VALUE (list
)))
5327 TREE_VALUE (list
) = decl_constant_value (TREE_VALUE (list
));
5329 if (TREE_CHAIN (list
) == 0)
5331 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5332 Strip such NOP_EXPRs, since LIST is used in non-lvalue context. */
5333 if (TREE_CODE (list
) == NOP_EXPR
5334 && TREE_TYPE (list
) == TREE_TYPE (TREE_OPERAND (list
, 0)))
5335 list
= TREE_OPERAND (list
, 0);
5337 /* Convert arrays to pointers. */
5338 if (TREE_CODE (TREE_TYPE (TREE_VALUE (list
))) == ARRAY_TYPE
)
5339 return default_conversion (TREE_VALUE (list
));
5341 return TREE_VALUE (list
);
5344 rest
= build_compound_expr (TREE_CHAIN (list
));
5346 /* When pedantic, a compound expression cannot be a constant expression. */
5347 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list
)) && ! pedantic
)
5350 return build (COMPOUND_EXPR
, TREE_TYPE (rest
),
5351 break_out_cleanups (TREE_VALUE (list
)), rest
);
5355 build_static_cast (type
, expr
)
5361 if (type
== error_mark_node
|| expr
== error_mark_node
)
5362 return error_mark_node
;
5364 if (TREE_CODE (expr
) == OFFSET_REF
)
5365 expr
= resolve_offset_ref (expr
);
5367 if (processing_template_decl
)
5369 tree t
= build_min (STATIC_CAST_EXPR
, copy_to_permanent (type
),
5374 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5375 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5376 if (TREE_CODE (type
) != REFERENCE_TYPE
5377 && TREE_CODE (expr
) == NOP_EXPR
5378 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5379 expr
= TREE_OPERAND (expr
, 0);
5381 if (TREE_CODE (type
) == VOID_TYPE
)
5382 return build1 (CONVERT_EXPR
, type
, expr
);
5384 if (type_unknown_p (expr
))
5386 expr
= instantiate_type (type
, expr
, 1);
5387 if (expr
== error_mark_node
)
5388 return error_mark_node
;
5391 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5392 return (convert_from_reference
5393 (convert_to_reference (type
, expr
, CONV_STATIC
|CONV_IMPLICIT
,
5394 LOOKUP_COMPLAIN
, NULL_TREE
)));
5396 if (IS_AGGR_TYPE (type
))
5397 return build_cplus_new
5398 (type
, (build_method_call
5399 (NULL_TREE
, ctor_identifier
, build_expr_list (NULL_TREE
, expr
),
5400 TYPE_BINFO (type
), LOOKUP_NORMAL
)));
5402 expr
= decay_conversion (expr
);
5403 intype
= TREE_TYPE (expr
);
5405 /* FIXME handle casting to array type. */
5408 if (can_convert_arg (type
, intype
, expr
))
5410 else if (TYPE_PTROB_P (type
) && TYPE_PTROB_P (intype
))
5413 if (IS_AGGR_TYPE (TREE_TYPE (type
)) && IS_AGGR_TYPE (TREE_TYPE (intype
))
5414 && (TYPE_READONLY (TREE_TYPE (type
))
5415 >= TYPE_READONLY (TREE_TYPE (intype
)))
5416 && (TYPE_VOLATILE (TREE_TYPE (type
))
5417 >= TYPE_VOLATILE (TREE_TYPE (intype
)))
5418 && (binfo
= get_binfo (TREE_TYPE (intype
), TREE_TYPE (type
), 0))
5419 && ! TREE_VIA_VIRTUAL (binfo
))
5422 else if (TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5424 if (comptypes (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (type
))),
5425 TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (intype
))), 1)
5426 && (TYPE_READONLY (TREE_TYPE (TREE_TYPE (type
)))
5427 >= TYPE_READONLY (TREE_TYPE (TREE_TYPE (intype
))))
5428 && (TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (type
)))
5429 >= TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (intype
))))
5430 && (binfo
= get_binfo (TYPE_OFFSET_BASETYPE (TREE_TYPE (type
)),
5431 TYPE_OFFSET_BASETYPE (TREE_TYPE (intype
)), 0))
5432 && ! TREE_VIA_VIRTUAL (binfo
))
5435 else if (TREE_CODE (intype
) != BOOLEAN_TYPE
5436 && TREE_CODE (type
) != ARRAY_TYPE
5437 && TREE_CODE (type
) != FUNCTION_TYPE
5438 && can_convert (intype
, type
))
5442 return build_c_cast (type
, expr
);
5444 cp_error ("static_cast from `%T' to `%T'", intype
, type
);
5445 return error_mark_node
;
5449 build_reinterpret_cast (type
, expr
)
5454 if (type
== error_mark_node
|| expr
== error_mark_node
)
5455 return error_mark_node
;
5457 if (TREE_CODE (expr
) == OFFSET_REF
)
5458 expr
= resolve_offset_ref (expr
);
5460 if (processing_template_decl
)
5462 tree t
= build_min (REINTERPRET_CAST_EXPR
,
5463 copy_to_permanent (type
), expr
);
5467 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5469 expr
= decay_conversion (expr
);
5471 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5472 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5473 if (TREE_CODE (expr
) == NOP_EXPR
5474 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5475 expr
= TREE_OPERAND (expr
, 0);
5478 if (type_unknown_p (expr
))
5480 expr
= instantiate_type (type
, expr
, 1);
5481 if (expr
== error_mark_node
)
5482 return error_mark_node
;
5485 intype
= TREE_TYPE (expr
);
5487 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5489 if (! real_lvalue_p (expr
))
5491 cp_error ("reinterpret_cast from `%T' rvalue to `%T'", intype
, type
);
5492 return error_mark_node
;
5494 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
5495 if (expr
!= error_mark_node
)
5496 expr
= build_reinterpret_cast
5497 (build_pointer_type (TREE_TYPE (type
)), expr
);
5498 if (expr
!= error_mark_node
)
5499 expr
= build_indirect_ref (expr
, 0);
5502 else if (comptypes (TYPE_MAIN_VARIANT (intype
), TYPE_MAIN_VARIANT (type
), 1))
5503 return build_static_cast (type
, expr
);
5505 if (TYPE_PTR_P (type
) && (TREE_CODE (intype
) == INTEGER_TYPE
5506 || TREE_CODE (intype
) == ENUMERAL_TYPE
))
5508 else if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_PTR_P (intype
))
5510 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
5511 cp_pedwarn ("reinterpret_cast from `%T' to `%T' loses precision",
5514 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
5515 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5517 if (TREE_READONLY_DECL_P (expr
))
5518 expr
= decl_constant_value (expr
);
5519 return fold (build1 (NOP_EXPR
, type
, expr
));
5521 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5522 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
5524 if (! comp_ptr_ttypes_reinterpret (TREE_TYPE (type
), TREE_TYPE (intype
)))
5525 cp_pedwarn ("reinterpret_cast from `%T' to `%T' casts away const (or volatile)",
5528 if (TREE_READONLY_DECL_P (expr
))
5529 expr
= decl_constant_value (expr
);
5530 return fold (build1 (NOP_EXPR
, type
, expr
));
5532 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
5533 || (TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
)))
5535 pedwarn ("ANSI C++ forbids casting between pointers to functions and objects");
5536 if (TREE_READONLY_DECL_P (expr
))
5537 expr
= decl_constant_value (expr
);
5538 return fold (build1 (NOP_EXPR
, type
, expr
));
5542 cp_error ("reinterpret_cast from `%T' to `%T'", intype
, type
);
5543 return error_mark_node
;
5546 return cp_convert (type
, expr
);
5550 build_const_cast (type
, expr
)
5555 if (type
== error_mark_node
|| expr
== error_mark_node
)
5556 return error_mark_node
;
5558 if (TREE_CODE (expr
) == OFFSET_REF
)
5559 expr
= resolve_offset_ref (expr
);
5561 if (processing_template_decl
)
5563 tree t
= build_min (CONST_CAST_EXPR
, copy_to_permanent (type
),
5568 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5570 expr
= decay_conversion (expr
);
5572 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5573 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5574 if (TREE_CODE (expr
) == NOP_EXPR
5575 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5576 expr
= TREE_OPERAND (expr
, 0);
5579 if (type_unknown_p (expr
))
5581 expr
= instantiate_type (type
, expr
, 1);
5582 if (expr
== error_mark_node
)
5583 return error_mark_node
;
5586 intype
= TREE_TYPE (expr
);
5588 if (comptypes (TYPE_MAIN_VARIANT (intype
), TYPE_MAIN_VARIANT (type
), 1))
5589 return build_static_cast (type
, expr
);
5590 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
5592 if (! real_lvalue_p (expr
))
5594 cp_error ("const_cast from `%T' rvalue to `%T'", intype
, type
);
5595 return error_mark_node
;
5598 if (comp_ptr_ttypes_const (TREE_TYPE (type
), intype
))
5600 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
5601 expr
= build1 (NOP_EXPR
, type
, expr
);
5602 return convert_from_reference (expr
);
5605 else if (TREE_CODE (type
) == POINTER_TYPE
5606 && TREE_CODE (intype
) == POINTER_TYPE
5607 && comp_ptr_ttypes_const (TREE_TYPE (type
), TREE_TYPE (intype
)))
5608 return cp_convert (type
, expr
);
5610 cp_error ("const_cast from `%T' to `%T'", intype
, type
);
5611 return error_mark_node
;
5614 /* Build an expression representing a cast to type TYPE of expression EXPR.
5616 ALLOW_NONCONVERTING is true if we should allow non-converting constructors
5617 when doing the cast. */
5620 build_c_cast (type
, expr
)
5623 register tree value
= expr
;
5625 if (type
== error_mark_node
|| expr
== error_mark_node
)
5626 return error_mark_node
;
5628 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5629 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5630 if (TREE_CODE (type
) != REFERENCE_TYPE
5631 && TREE_CODE (value
) == NOP_EXPR
5632 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
5633 value
= TREE_OPERAND (value
, 0);
5635 if (TREE_TYPE (expr
)
5636 && TREE_CODE (TREE_TYPE (expr
)) == OFFSET_TYPE
5637 && TREE_CODE (type
) != OFFSET_TYPE
)
5638 value
= resolve_offset_ref (value
);
5640 if (TREE_CODE (type
) == ARRAY_TYPE
)
5642 /* Allow casting from T1* to T2[] because Cfront allows it.
5643 NIHCL uses it. It is not valid ANSI C however, and hence, not
5645 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
5648 pedwarn ("ANSI C++ forbids casting to an array type");
5649 type
= build_pointer_type (TREE_TYPE (type
));
5653 error ("ANSI C++ forbids casting to an array type");
5654 return error_mark_node
;
5658 if (TREE_CODE (type
) == FUNCTION_TYPE
5659 || TREE_CODE (type
) == METHOD_TYPE
)
5661 cp_error ("casting to function type `%T'", type
);
5662 return error_mark_node
;
5665 if (IS_SIGNATURE (type
))
5667 error ("cast specifies signature type");
5668 return error_mark_node
;
5671 if (processing_template_decl
)
5673 tree t
= build_min (CAST_EXPR
, type
,
5674 min_tree_cons (NULL_TREE
, value
, NULL_TREE
));
5678 if (TREE_CODE (type
) == VOID_TYPE
)
5679 value
= build1 (CONVERT_EXPR
, type
, value
);
5680 else if (TREE_TYPE (value
) == NULL_TREE
5681 || type_unknown_p (value
))
5683 value
= instantiate_type (type
, value
, 1);
5685 if (value
== error_mark_node
)
5686 return error_mark_node
;
5692 /* Convert functions and arrays to pointers and
5693 convert references to their expanded types,
5694 but don't convert any other types. If, however, we are
5695 casting to a class type, there's no reason to do this: the
5696 cast will only succeed if there is a converting constructor,
5697 and the default conversions will be done at that point. In
5698 fact, doing the default conversion here is actually harmful
5702 struct S { S(const A&); };
5704 since we don't want the array-to-pointer conversion done. */
5705 if (!IS_AGGR_TYPE (type
))
5707 if (TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
5708 || (TREE_CODE (TREE_TYPE (value
)) == METHOD_TYPE
5709 /* Don't do the default conversion if we want a
5710 pointer to a function. */
5711 && ! (TREE_CODE (type
) == POINTER_TYPE
5712 && TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
))
5713 || TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
5714 || TREE_CODE (TREE_TYPE (value
)) == REFERENCE_TYPE
)
5715 value
= default_conversion (value
);
5717 else if (TREE_CODE (TREE_TYPE (value
)) == REFERENCE_TYPE
)
5718 /* However, even for class types, we still need to strip away
5719 the reference type, since the call to convert_force below
5720 does not expect the input expression to be of reference
5722 value
= convert_from_reference (value
);
5724 otype
= TREE_TYPE (value
);
5726 /* Optionally warn about potentially worrisome casts. */
5729 && TREE_CODE (type
) == POINTER_TYPE
5730 && TREE_CODE (otype
) == POINTER_TYPE
)
5732 /* For C++ we make these regular warnings, rather than
5733 softening them into pedwarns. */
5734 if (TYPE_VOLATILE (TREE_TYPE (otype
))
5735 && ! TYPE_VOLATILE (TREE_TYPE (type
)))
5736 warning ("cast discards `volatile' from pointer target type");
5737 if (TYPE_READONLY (TREE_TYPE (otype
))
5738 && ! TYPE_READONLY (TREE_TYPE (type
)))
5739 warning ("cast discards `const' from pointer target type");
5742 /* Warn about possible alignment problems. */
5743 if (STRICT_ALIGNMENT
&& warn_cast_align
5744 && TREE_CODE (type
) == POINTER_TYPE
5745 && TREE_CODE (otype
) == POINTER_TYPE
5746 && TREE_CODE (TREE_TYPE (otype
)) != VOID_TYPE
5747 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
5748 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (otype
)))
5749 warning ("cast increases required alignment of target type");
5752 /* We should see about re-enabling these, they seem useful to
5754 if (TREE_CODE (type
) == INTEGER_TYPE
5755 && TREE_CODE (otype
) == POINTER_TYPE
5756 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
))
5757 warning ("cast from pointer to integer of different size");
5759 if (TREE_CODE (type
) == POINTER_TYPE
5760 && TREE_CODE (otype
) == INTEGER_TYPE
5761 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
5762 /* Don't warn about converting 0 to pointer,
5763 provided the 0 was explicit--not cast or made by folding. */
5764 && !(TREE_CODE (value
) == INTEGER_CST
&& integer_zerop (value
)))
5765 warning ("cast to pointer from integer of different size");
5768 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5769 value
= (convert_from_reference
5770 (convert_to_reference (type
, value
, CONV_C_CAST
,
5771 LOOKUP_COMPLAIN
, NULL_TREE
)));
5776 if (TREE_READONLY_DECL_P (value
))
5777 value
= decl_constant_value (value
);
5780 value
= convert_force (type
, value
, CONV_C_CAST
);
5782 /* Ignore any integer overflow caused by the cast. */
5783 if (TREE_CODE (value
) == INTEGER_CST
)
5785 TREE_OVERFLOW (value
) = TREE_OVERFLOW (ovalue
);
5786 TREE_CONSTANT_OVERFLOW (value
) = TREE_CONSTANT_OVERFLOW (ovalue
);
5791 /* Always produce some operator for an explicit cast,
5792 so we can tell (for -pedantic) that the cast is no lvalue. */
5793 if (TREE_CODE (type
) != REFERENCE_TYPE
&& value
== expr
5794 && real_lvalue_p (value
))
5795 value
= non_lvalue (value
);
5800 /* Build an assignment expression of lvalue LHS from value RHS.
5801 MODIFYCODE is the code for a binary operator that we use
5802 to combine the old value of LHS with RHS to get the new value.
5803 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
5805 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
5808 build_modify_expr (lhs
, modifycode
, rhs
)
5810 enum tree_code modifycode
;
5813 register tree result
;
5815 tree lhstype
= TREE_TYPE (lhs
);
5816 tree olhstype
= lhstype
;
5819 /* Avoid duplicate error messages from operands that had errors. */
5820 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5821 return error_mark_node
;
5823 /* Types that aren't fully specified cannot be used in assignments. */
5824 lhs
= require_complete_type (lhs
);
5828 /* Handle assignment to signature pointers/refs. */
5830 if (TYPE_LANG_SPECIFIC (lhstype
)
5831 && (IS_SIGNATURE_POINTER (lhstype
) || IS_SIGNATURE_REFERENCE (lhstype
)))
5833 return build_signature_pointer_constructor (lhs
, rhs
);
5836 /* Handle control structure constructs used as "lvalues". */
5838 switch (TREE_CODE (lhs
))
5840 /* Handle --foo = 5; as these are valid constructs in C++ */
5841 case PREDECREMENT_EXPR
:
5842 case PREINCREMENT_EXPR
:
5843 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
5844 lhs
= build (TREE_CODE (lhs
), TREE_TYPE (lhs
),
5845 stabilize_reference (TREE_OPERAND (lhs
, 0)),
5846 TREE_OPERAND (lhs
, 1));
5847 return build (COMPOUND_EXPR
, lhstype
,
5849 build_modify_expr (TREE_OPERAND (lhs
, 0),
5852 /* Handle (a, b) used as an "lvalue". */
5854 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 1),
5856 if (newrhs
== error_mark_node
)
5857 return error_mark_node
;
5858 return build (COMPOUND_EXPR
, lhstype
,
5859 TREE_OPERAND (lhs
, 0), newrhs
);
5862 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
);
5863 if (newrhs
== error_mark_node
)
5864 return error_mark_node
;
5865 return build (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
5867 /* Handle (a ? b : c) used as an "lvalue". */
5869 rhs
= save_expr (rhs
);
5871 /* Produce (a ? (b = rhs) : (c = rhs))
5872 except that the RHS goes through a save-expr
5873 so the code to compute it is only emitted once. */
5875 = build_conditional_expr (TREE_OPERAND (lhs
, 0),
5876 build_modify_expr (cp_convert (TREE_TYPE (lhs
), TREE_OPERAND (lhs
, 1)),
5878 build_modify_expr (cp_convert (TREE_TYPE (lhs
), TREE_OPERAND (lhs
, 2)),
5880 if (cond
== error_mark_node
)
5882 /* Make sure the code to compute the rhs comes out
5883 before the split. */
5884 return build (COMPOUND_EXPR
, TREE_TYPE (lhs
),
5885 /* Case to void to suppress warning
5886 from warn_if_unused_value. */
5887 cp_convert (void_type_node
, rhs
), cond
);
5894 if (TREE_CODE (lhs
) == OFFSET_REF
)
5896 if (TREE_OPERAND (lhs
, 0) == NULL_TREE
)
5898 /* Static class member? */
5899 tree member
= TREE_OPERAND (lhs
, 1);
5900 if (TREE_CODE (member
) == VAR_DECL
)
5904 compiler_error ("invalid static class member");
5905 return error_mark_node
;
5909 lhs
= resolve_offset_ref (lhs
);
5911 olhstype
= lhstype
= TREE_TYPE (lhs
);
5914 if (TREE_CODE (lhstype
) == REFERENCE_TYPE
5915 && modifycode
!= INIT_EXPR
)
5917 lhs
= convert_from_reference (lhs
);
5918 olhstype
= lhstype
= TREE_TYPE (lhs
);
5921 /* If a binary op has been requested, combine the old LHS value with the RHS
5922 producing the value we should actually store into the LHS. */
5924 if (modifycode
== INIT_EXPR
)
5926 if (! IS_AGGR_TYPE (lhstype
))
5927 /* Do the default thing */;
5930 result
= build_method_call (lhs
, ctor_identifier
,
5931 build_expr_list (NULL_TREE
, rhs
),
5932 TYPE_BINFO (lhstype
), LOOKUP_NORMAL
);
5933 if (result
== NULL_TREE
)
5934 return error_mark_node
;
5938 else if (modifycode
== NOP_EXPR
)
5940 /* `operator=' is not an inheritable operator. */
5941 if (! IS_AGGR_TYPE (lhstype
))
5942 /* Do the default thing */;
5945 result
= build_opfncall (MODIFY_EXPR
, LOOKUP_NORMAL
,
5946 lhs
, rhs
, make_node (NOP_EXPR
));
5947 if (result
== NULL_TREE
)
5948 return error_mark_node
;
5953 else if (PROMOTES_TO_AGGR_TYPE (lhstype
, REFERENCE_TYPE
))
5955 my_friendly_abort (978652);
5959 lhs
= stabilize_reference (lhs
);
5960 newrhs
= build_binary_op (modifycode
, lhs
, rhs
, 1);
5961 if (newrhs
== error_mark_node
)
5963 cp_error (" in evaluation of `%Q(%#T, %#T)'", modifycode
,
5964 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
5965 return error_mark_node
;
5969 /* Handle a cast used as an "lvalue".
5970 We have already performed any binary operator using the value as cast.
5971 Now convert the result to the cast type of the lhs,
5972 and then true type of the lhs and store it there;
5973 then convert result back to the cast type to be the value
5974 of the assignment. */
5976 switch (TREE_CODE (lhs
))
5981 case FIX_TRUNC_EXPR
:
5982 case FIX_FLOOR_EXPR
:
5983 case FIX_ROUND_EXPR
:
5985 if (TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
5986 || TREE_CODE (TREE_TYPE (newrhs
)) == FUNCTION_TYPE
5987 || TREE_CODE (TREE_TYPE (newrhs
)) == METHOD_TYPE
5988 || TREE_CODE (TREE_TYPE (newrhs
)) == OFFSET_TYPE
)
5989 newrhs
= default_conversion (newrhs
);
5991 tree inner_lhs
= TREE_OPERAND (lhs
, 0);
5994 /* WP 5.4.1: The result is an lvalue if T is a reference type,
5995 otherwise the result is an rvalue. */
5996 if (! lvalue_p (lhs
))
5997 pedwarn ("ANSI C++ forbids cast to non-reference type used as lvalue");
5999 result
= build_modify_expr (inner_lhs
, NOP_EXPR
,
6000 cp_convert (TREE_TYPE (inner_lhs
),
6001 cp_convert (lhstype
, newrhs
)));
6002 if (result
== error_mark_node
)
6004 return cp_convert (TREE_TYPE (lhs
), result
);
6011 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
6012 Reject anything strange now. */
6014 if (!lvalue_or_else (lhs
, "assignment"))
6015 return error_mark_node
;
6017 GNU_xref_assign (lhs
);
6019 /* Warn about storing in something that is `const'. */
6020 /* For C++, don't warn if this is initialization. */
6021 if (modifycode
!= INIT_EXPR
6022 /* For assignment to `const' signature pointer/reference fields,
6023 don't warn either, we already printed a better message before. */
6024 && ! (TREE_CODE (lhs
) == COMPONENT_REF
6025 && (IS_SIGNATURE_POINTER (TREE_TYPE (TREE_OPERAND (lhs
, 0)))
6026 || IS_SIGNATURE_REFERENCE (TREE_TYPE (TREE_OPERAND (lhs
, 0)))))
6027 && (TREE_READONLY (lhs
) || TYPE_READONLY (lhstype
)
6028 || ((TREE_CODE (lhstype
) == RECORD_TYPE
6029 || TREE_CODE (lhstype
) == UNION_TYPE
)
6030 && C_TYPE_FIELDS_READONLY (lhstype
))
6031 || (TREE_CODE (lhstype
) == REFERENCE_TYPE
6032 && TYPE_READONLY (TREE_TYPE (lhstype
)))))
6033 readonly_error (lhs
, "assignment", 0);
6035 /* If storing into a structure or union member,
6036 it has probably been given type `int'.
6037 Compute the type that would go with
6038 the actual amount of storage the member occupies. */
6040 if (TREE_CODE (lhs
) == COMPONENT_REF
6041 && (TREE_CODE (lhstype
) == INTEGER_TYPE
6042 || TREE_CODE (lhstype
) == REAL_TYPE
6043 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
6045 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
6047 /* If storing in a field that is in actuality a short or narrower
6048 than one, we must store in the field in its actual type. */
6050 if (lhstype
!= TREE_TYPE (lhs
))
6052 lhs
= copy_node (lhs
);
6053 TREE_TYPE (lhs
) = lhstype
;
6057 /* check to see if there is an assignment to `this' */
6058 if (lhs
== current_class_ptr
)
6060 if (flag_this_is_variable
> 0
6061 && DECL_NAME (current_function_decl
) != NULL_TREE
6062 && (DECL_NAME (current_function_decl
)
6063 != constructor_name (current_class_type
)))
6064 warning ("assignment to `this' not in constructor or destructor");
6065 current_function_just_assigned_this
= 1;
6068 /* The TREE_TYPE of RHS may be TYPE_UNKNOWN. This can happen
6069 when the type of RHS is not yet known, i.e. its type
6070 is inherited from LHS. */
6071 rhs
= require_instantiated_type (lhstype
, newrhs
, error_mark_node
);
6072 if (rhs
== error_mark_node
)
6073 return error_mark_node
;
6076 if (modifycode
!= INIT_EXPR
)
6078 /* Make modifycode now either a NOP_EXPR or an INIT_EXPR. */
6079 modifycode
= NOP_EXPR
;
6080 /* Reference-bashing */
6081 if (TREE_CODE (lhstype
) == REFERENCE_TYPE
)
6083 tree tmp
= convert_from_reference (lhs
);
6084 lhstype
= TREE_TYPE (tmp
);
6085 if (TYPE_SIZE (lhstype
) == 0)
6087 incomplete_type_error (lhs
, lhstype
);
6088 return error_mark_node
;
6093 if (TREE_CODE (TREE_TYPE (newrhs
)) == REFERENCE_TYPE
)
6095 tree tmp
= convert_from_reference (newrhs
);
6096 if (TYPE_SIZE (TREE_TYPE (tmp
)) == 0)
6098 incomplete_type_error (newrhs
, TREE_TYPE (tmp
));
6099 return error_mark_node
;
6105 if (TREE_SIDE_EFFECTS (lhs
))
6106 lhs
= stabilize_reference (lhs
);
6107 if (TREE_SIDE_EFFECTS (newrhs
))
6108 newrhs
= stabilize_reference (newrhs
);
6110 /* Convert new value to destination type. */
6112 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
6116 if (! comptypes (lhstype
, TREE_TYPE (rhs
), 0))
6118 cp_error ("incompatible types in assignment of `%T' to `%T'",
6119 TREE_TYPE (rhs
), lhstype
);
6120 return error_mark_node
;
6123 /* Allow array assignment in compiler-generated code. */
6124 if (pedantic
&& ! DECL_ARTIFICIAL (current_function_decl
))
6125 pedwarn ("ANSI C++ forbids assignment of arrays");
6127 /* Have to wrap this in RTL_EXPR for two cases:
6128 in base or member initialization and if we
6129 are a branch of a ?: operator. Since we
6130 can't easily know the latter, just do it always. */
6132 result
= make_node (RTL_EXPR
);
6134 TREE_TYPE (result
) = void_type_node
;
6135 do_pending_stack_adjust ();
6136 start_sequence_for_rtl_expr (result
);
6138 /* As a matter of principle, `start_sequence' should do this. */
6141 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
6142 ? 1 + (modifycode
!= INIT_EXPR
): 0;
6143 expand_vec_init (lhs
, lhs
, array_type_nelts (lhstype
), newrhs
,
6146 do_pending_stack_adjust ();
6148 TREE_SIDE_EFFECTS (result
) = 1;
6149 RTL_EXPR_SEQUENCE (result
) = get_insns ();
6150 RTL_EXPR_RTL (result
) = const0_rtx
;
6155 if (modifycode
== INIT_EXPR
)
6157 newrhs
= convert_for_initialization (lhs
, lhstype
, newrhs
, LOOKUP_NORMAL
,
6158 "assignment", NULL_TREE
, 0);
6159 if (lhs
== DECL_RESULT (current_function_decl
))
6161 if (DECL_INITIAL (lhs
))
6162 warning ("return value from function receives multiple initializations");
6163 DECL_INITIAL (lhs
) = newrhs
;
6168 /* Avoid warnings on enum bit fields. */
6169 if (TREE_CODE (olhstype
) == ENUMERAL_TYPE
6170 && TREE_CODE (lhstype
) == INTEGER_TYPE
)
6172 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
6174 newrhs
= convert_force (lhstype
, newrhs
, 0);
6177 newrhs
= convert_for_assignment (lhstype
, newrhs
, "assignment",
6179 if (TREE_CODE (newrhs
) == CALL_EXPR
6180 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
6181 newrhs
= build_cplus_new (lhstype
, newrhs
);
6183 /* Can't initialize directly from a TARGET_EXPR, since that would
6184 cause the lhs to be constructed twice, and possibly result in
6185 accidental self-initialization. So we force the TARGET_EXPR to be
6186 expanded without a target. */
6187 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
6188 newrhs
= build (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
6189 TREE_OPERAND (newrhs
, 0));
6192 if (newrhs
== error_mark_node
)
6193 return error_mark_node
;
6195 if (TREE_CODE (newrhs
) == COND_EXPR
)
6198 tree cond
= TREE_OPERAND (newrhs
, 0);
6200 if (TREE_SIDE_EFFECTS (lhs
))
6201 cond
= build_compound_expr (tree_cons
6203 build_expr_list (NULL_TREE
, cond
)));
6205 /* Cannot have two identical lhs on this one tree (result) as preexpand
6206 calls will rip them out and fill in RTL for them, but when the
6207 rtl is generated, the calls will only be in the first side of the
6208 condition, not on both, or before the conditional jump! (mrs) */
6209 lhs1
= break_out_calls (lhs
);
6212 /* If there's no change, the COND_EXPR behaves like any other rhs. */
6213 result
= build (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6214 lhstype
, lhs
, newrhs
);
6217 tree result_type
= TREE_TYPE (newrhs
);
6218 /* We have to convert each arm to the proper type because the
6219 types may have been munged by constant folding. */
6221 = build (COND_EXPR
, result_type
, cond
,
6222 build_modify_expr (lhs
, modifycode
,
6223 cp_convert (result_type
,
6224 TREE_OPERAND (newrhs
, 1))),
6225 build_modify_expr (lhs1
, modifycode
,
6226 cp_convert (result_type
,
6227 TREE_OPERAND (newrhs
, 2))));
6231 result
= build (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
6232 lhstype
, lhs
, newrhs
);
6234 TREE_SIDE_EFFECTS (result
) = 1;
6236 /* If we got the LHS in a different type for storing in,
6237 convert the result back to the nominal type of LHS
6238 so that the value we return always has the same type
6239 as the LHS argument. */
6241 if (olhstype
== TREE_TYPE (result
))
6243 /* Avoid warnings converting integral types back into enums
6244 for enum bit fields. */
6245 if (TREE_CODE (TREE_TYPE (result
)) == INTEGER_TYPE
6246 && TREE_CODE (olhstype
) == ENUMERAL_TYPE
)
6248 result
= build (COMPOUND_EXPR
, olhstype
, result
, olhs
);
6249 TREE_NO_UNUSED_WARNING (result
) = 1;
6252 return convert_for_assignment (olhstype
, result
, "assignment",
6257 build_x_modify_expr (lhs
, modifycode
, rhs
)
6259 enum tree_code modifycode
;
6262 if (processing_template_decl
)
6263 return build_min_nt (MODOP_EXPR
, lhs
,
6264 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
6266 if (modifycode
!= NOP_EXPR
)
6268 tree rval
= build_opfncall (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
6269 make_node (modifycode
));
6273 return build_modify_expr (lhs
, modifycode
, rhs
);
6276 /* Return 0 if EXP is not a valid lvalue in this language
6277 even though `lvalue_or_else' would accept it. */
6280 language_lvalue_valid (exp
)
6281 tree exp ATTRIBUTE_UNUSED
;
6286 /* Get difference in deltas for different pointer to member function
6287 types. Return integer_zero_node, if FROM cannot be converted to a
6288 TO type. If FORCE is true, then allow reverse conversions as well. */
6291 get_delta_difference (from
, to
, force
)
6295 tree delta
= integer_zero_node
;
6301 /* Should get_base_distance here, so we can check if any thing along the
6302 path is virtual, and we need to make sure we stay
6303 inside the real binfos when going through virtual bases.
6304 Maybe we should replace virtual bases with
6305 binfo_member (...CLASSTYPE_VBASECLASSES...)... (mrs) */
6306 binfo
= get_binfo (from
, to
, 1);
6307 if (binfo
== error_mark_node
)
6309 error (" in pointer to member function conversion");
6316 error_not_base_type (from
, to
);
6317 error (" in pointer to member conversion");
6320 binfo
= get_binfo (to
, from
, 1);
6321 if (binfo
== 0 || binfo
== error_mark_node
)
6323 if (TREE_VIA_VIRTUAL (binfo
))
6325 binfo
= binfo_member (BINFO_TYPE (binfo
),
6326 CLASSTYPE_VBASECLASSES (from
));
6327 cp_warning ("pointer to member cast to virtual base `%T'",
6328 BINFO_TYPE (binfo
));
6329 warning (" will only work if you are very careful");
6331 delta
= BINFO_OFFSET (binfo
);
6332 delta
= cp_convert (ptrdiff_type_node
, delta
);
6334 return build_binary_op (MINUS_EXPR
,
6339 if (TREE_VIA_VIRTUAL (binfo
))
6343 cp_warning ("pointer to member cast from virtual base `%T'",
6344 BINFO_TYPE (binfo
));
6345 warning (" will only work if you are very careful");
6348 cp_error ("pointer to member conversion from virtual base `%T'",
6349 BINFO_TYPE (binfo
));
6352 return BINFO_OFFSET (binfo
);
6356 build_ptrmemfunc1 (type
, delta
, idx
, pfn
, delta2
)
6357 tree type
, delta
, idx
, pfn
, delta2
;
6362 /* This is the old way we did it. We want to avoid calling
6363 digest_init, so that it can give an error if we use { } when
6364 initializing a pointer to member function. */
6368 u
= build_nt (CONSTRUCTOR
, NULL_TREE
,
6369 expr_tree_cons (pfn_identifier
, pfn
, NULL_TREE
));
6373 u
= build_nt (CONSTRUCTOR
, NULL_TREE
,
6374 expr_tree_cons (delta2_identifier
, delta2
, NULL_TREE
));
6377 u
= build_nt (CONSTRUCTOR
, NULL_TREE
,
6378 expr_tree_cons (NULL_TREE
, delta
,
6379 expr_tree_cons (NULL_TREE
, idx
,
6380 expr_tree_cons (NULL_TREE
, u
, NULL_TREE
))));
6382 return digest_init (type
, u
, (tree
*)0);
6384 tree delta_field
, idx_field
, pfn_or_delta2_field
, pfn_field
, delta2_field
;
6386 int allconstant
, allsimple
;
6388 delta_field
= TYPE_FIELDS (type
);
6389 idx_field
= TREE_CHAIN (delta_field
);
6390 pfn_or_delta2_field
= TREE_CHAIN (idx_field
);
6391 subtype
= TREE_TYPE (pfn_or_delta2_field
);
6392 pfn_field
= TYPE_FIELDS (subtype
);
6393 delta2_field
= TREE_CHAIN (pfn_field
);
6397 allconstant
= TREE_CONSTANT (pfn
);
6398 allsimple
= !! initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
));
6399 u
= expr_tree_cons (pfn_field
, pfn
, NULL_TREE
);
6403 delta2
= convert_and_check (delta_type_node
, delta2
);
6404 allconstant
= TREE_CONSTANT (delta2
);
6405 allsimple
= !! initializer_constant_valid_p (delta2
, TREE_TYPE (delta2
));
6406 u
= expr_tree_cons (delta2_field
, delta2
, NULL_TREE
);
6409 delta
= convert_and_check (delta_type_node
, delta
);
6410 idx
= convert_and_check (delta_type_node
, idx
);
6412 allconstant
= allconstant
&& TREE_CONSTANT (delta
) && TREE_CONSTANT (idx
);
6413 allsimple
= allsimple
6414 && initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
6415 && initializer_constant_valid_p (idx
, TREE_TYPE (idx
));
6417 u
= build (CONSTRUCTOR
, subtype
, NULL_TREE
, u
);
6418 u
= expr_tree_cons (delta_field
, delta
,
6419 expr_tree_cons (idx_field
, idx
,
6420 expr_tree_cons (pfn_or_delta2_field
, u
, NULL_TREE
)));
6421 u
= build (CONSTRUCTOR
, type
, NULL_TREE
, u
);
6422 TREE_CONSTANT (u
) = allconstant
;
6423 TREE_STATIC (u
) = allconstant
&& allsimple
;
6428 /* Build a constructor for a pointer to member function. It can be
6429 used to initialize global variables, local variable, or used
6430 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
6433 If FORCE is non-zero, then force this conversion, even if
6434 we would rather not do it. Usually set when using an explicit
6437 Return error_mark_node, if something goes wrong. */
6440 build_ptrmemfunc (type
, pfn
, force
)
6444 tree idx
= integer_zero_node
;
6445 tree delta
= integer_zero_node
;
6446 tree delta2
= integer_zero_node
;
6448 tree npfn
= NULL_TREE
;
6450 /* Handle multiple conversions of pointer to member functions. */
6451 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (pfn
)))
6453 tree ndelta
, ndelta2
;
6457 /* Is is already the right type? */
6458 if (type
== TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (pfn
)))
6461 pfn_type
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (pfn
));
6463 && comp_target_types (type
, pfn_type
, 0) != 1)
6464 cp_error ("conversion to `%T' from `%T'", type
, pfn_type
);
6466 ndelta
= cp_convert (ptrdiff_type_node
, build_component_ref (pfn
, delta_identifier
, NULL_TREE
, 0));
6467 ndelta2
= cp_convert (ptrdiff_type_node
, DELTA2_FROM_PTRMEMFUNC (pfn
));
6468 idx
= build_component_ref (pfn
, index_identifier
, NULL_TREE
, 0);
6470 n
= get_delta_difference (TYPE_METHOD_BASETYPE (TREE_TYPE (pfn_type
)),
6471 TYPE_METHOD_BASETYPE (TREE_TYPE (type
)),
6474 delta
= build_binary_op (PLUS_EXPR
, ndelta
, n
, 1);
6475 delta2
= build_binary_op (PLUS_EXPR
, ndelta2
, n
, 1);
6476 e1
= fold (build (GT_EXPR
, boolean_type_node
, idx
, integer_zero_node
));
6478 e2
= build_ptrmemfunc1 (TYPE_GET_PTRMEMFUNC_TYPE (type
), delta
, idx
,
6481 pfn
= PFN_FROM_PTRMEMFUNC (pfn
);
6482 npfn
= build1 (NOP_EXPR
, type
, pfn
);
6483 TREE_CONSTANT (npfn
) = TREE_CONSTANT (pfn
);
6485 e3
= build_ptrmemfunc1 (TYPE_GET_PTRMEMFUNC_TYPE (type
), delta
, idx
, npfn
,
6487 return build_conditional_expr (e1
, e2
, e3
);
6490 /* Handle null pointer to member function conversions. */
6491 if (integer_zerop (pfn
))
6493 pfn
= build_c_cast (type
, integer_zero_node
);
6494 return build_ptrmemfunc1 (TYPE_GET_PTRMEMFUNC_TYPE (type
),
6495 integer_zero_node
, integer_zero_node
,
6499 if (TREE_CODE (pfn
) == TREE_LIST
6500 || (TREE_CODE (pfn
) == ADDR_EXPR
6501 && TREE_CODE (TREE_OPERAND (pfn
, 0)) == TREE_LIST
))
6502 return instantiate_type (type
, pfn
, 1);
6505 && comp_target_types (type
, TREE_TYPE (pfn
), 0) != 1)
6506 cp_error ("conversion to `%T' from `%T'", type
, TREE_TYPE (pfn
));
6508 /* Allow pointer to member conversions here. */
6509 delta
= get_delta_difference (TYPE_METHOD_BASETYPE (TREE_TYPE (TREE_TYPE (pfn
))),
6510 TYPE_METHOD_BASETYPE (TREE_TYPE (type
)),
6512 delta2
= build_binary_op (PLUS_EXPR
, delta2
, delta
, 1);
6514 if (TREE_CODE (TREE_OPERAND (pfn
, 0)) != FUNCTION_DECL
)
6515 warning ("assuming pointer to member function is non-virtual");
6517 if (TREE_CODE (TREE_OPERAND (pfn
, 0)) == FUNCTION_DECL
6518 && DECL_VINDEX (TREE_OPERAND (pfn
, 0)))
6520 /* Find the offset to the vfield pointer in the object. */
6521 vfield_offset
= get_binfo (DECL_CONTEXT (TREE_OPERAND (pfn
, 0)),
6522 DECL_CLASS_CONTEXT (TREE_OPERAND (pfn
, 0)),
6524 vfield_offset
= get_vfield_offset (vfield_offset
);
6525 delta2
= size_binop (PLUS_EXPR
, vfield_offset
, delta2
);
6527 /* Map everything down one to make room for the null pointer to member. */
6528 idx
= size_binop (PLUS_EXPR
,
6529 DECL_VINDEX (TREE_OPERAND (pfn
, 0)),
6534 idx
= size_binop (MINUS_EXPR
, integer_zero_node
, integer_one_node
);
6536 if (type
== TREE_TYPE (pfn
))
6542 npfn
= build1 (NOP_EXPR
, type
, pfn
);
6543 TREE_CONSTANT (npfn
) = TREE_CONSTANT (pfn
);
6547 return build_ptrmemfunc1 (TYPE_GET_PTRMEMFUNC_TYPE (type
), delta
, idx
, npfn
, delta2
);
6550 /* Convert value RHS to type TYPE as preparation for an assignment
6551 to an lvalue of type TYPE.
6552 The real work of conversion is done by `convert'.
6553 The purpose of this function is to generate error messages
6554 for assignments that are not allowed in C.
6555 ERRTYPE is a string to use in error messages:
6556 "assignment", "return", etc.
6558 C++: attempts to allow `convert' to find conversions involving
6559 implicit type conversion between aggregate and scalar types
6560 as per 8.5.6 of C++ manual. Does not randomly dereference
6561 pointers to aggregates! */
6564 convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
)
6570 register enum tree_code codel
= TREE_CODE (type
);
6571 register tree rhstype
;
6572 register enum tree_code coder
= TREE_CODE (TREE_TYPE (rhs
));
6574 if (coder
== UNKNOWN_TYPE
)
6575 rhs
= instantiate_type (type
, rhs
, 1);
6577 if (coder
== ERROR_MARK
)
6578 return error_mark_node
;
6580 if (codel
== OFFSET_TYPE
)
6582 type
= TREE_TYPE (type
);
6583 codel
= TREE_CODE (type
);
6586 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
6587 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
6588 rhs
= TREE_OPERAND (rhs
, 0);
6590 if (rhs
== error_mark_node
)
6591 return error_mark_node
;
6593 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
6594 return error_mark_node
;
6596 if (TREE_CODE (TREE_TYPE (rhs
)) == OFFSET_TYPE
)
6598 rhs
= resolve_offset_ref (rhs
);
6599 if (rhs
== error_mark_node
)
6600 return error_mark_node
;
6601 rhstype
= TREE_TYPE (rhs
);
6602 coder
= TREE_CODE (rhstype
);
6605 if (TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
6606 || TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
6607 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
6608 rhs
= default_conversion (rhs
);
6609 else if (TREE_CODE (TREE_TYPE (rhs
)) == REFERENCE_TYPE
)
6610 rhs
= convert_from_reference (rhs
);
6612 rhstype
= TREE_TYPE (rhs
);
6613 coder
= TREE_CODE (rhstype
);
6615 /* This should no longer change types on us. */
6616 if (TREE_CODE (rhs
) == CONST_DECL
)
6617 rhs
= DECL_INITIAL (rhs
);
6618 else if (TREE_READONLY_DECL_P (rhs
))
6619 rhs
= decl_constant_value (rhs
);
6621 if (comptypes (type
, rhstype
, 1))
6623 overflow_warning (rhs
);
6627 if (coder
== VOID_TYPE
)
6629 error ("void value not ignored as it ought to be");
6630 return error_mark_node
;
6632 /* Arithmetic types all interconvert. */
6633 if ((codel
== INTEGER_TYPE
|| codel
== REAL_TYPE
|| codel
== BOOLEAN_TYPE
6634 || codel
== COMPLEX_TYPE
)
6635 && (coder
== INTEGER_TYPE
|| coder
== REAL_TYPE
|| coder
== BOOLEAN_TYPE
6636 || coder
== COMPLEX_TYPE
))
6638 /* But we should warn if assigning REAL_TYPE to INTEGER_TYPE. */
6639 if (coder
== REAL_TYPE
&& codel
== INTEGER_TYPE
)
6642 cp_warning ("`%T' used for argument %P of `%D'",
6643 rhstype
, parmnum
, fndecl
);
6645 cp_warning ("%s to `%T' from `%T'", errtype
, type
, rhstype
);
6647 /* And we should warn if assigning a negative value to
6648 an unsigned variable. */
6649 else if (TREE_UNSIGNED (type
) && codel
!= BOOLEAN_TYPE
)
6651 if (TREE_CODE (rhs
) == INTEGER_CST
6652 && TREE_NEGATED_INT (rhs
))
6655 cp_warning ("negative value `%E' passed as argument %P of `%D'",
6656 rhs
, parmnum
, fndecl
);
6658 cp_warning ("%s of negative value `%E' to `%T'",
6659 errtype
, rhs
, type
);
6661 overflow_warning (rhs
);
6662 if (TREE_CONSTANT (rhs
))
6666 return convert_and_check (type
, rhs
);
6668 /* Conversions involving enums. */
6669 else if ((codel
== ENUMERAL_TYPE
6670 && (INTEGRAL_CODE_P (coder
) || coder
== REAL_TYPE
))
6671 || (coder
== ENUMERAL_TYPE
6672 && (INTEGRAL_CODE_P (codel
) || codel
== REAL_TYPE
)))
6674 return ocp_convert (type
, rhs
, CONV_IMPLICIT
, LOOKUP_NORMAL
);
6676 /* Conversions among pointers */
6677 else if (codel
== POINTER_TYPE
6678 && (coder
== POINTER_TYPE
6679 || (coder
== RECORD_TYPE
6680 && (IS_SIGNATURE_POINTER (rhstype
)
6681 || IS_SIGNATURE_REFERENCE (rhstype
)))))
6683 register tree ttl
= TREE_TYPE (type
);
6687 if (coder
== RECORD_TYPE
)
6689 rhs
= build_optr_ref (rhs
);
6690 rhstype
= TREE_TYPE (rhs
);
6692 ttr
= TREE_TYPE (rhstype
);
6694 /* If both pointers are of aggregate type, then we
6695 can give better error messages, and save some work
6697 if (TREE_CODE (ttl
) == RECORD_TYPE
&& TREE_CODE (ttr
) == RECORD_TYPE
)
6701 if (TYPE_MAIN_VARIANT (ttl
) == TYPE_MAIN_VARIANT (ttr
)
6702 || type
== class_star_type_node
6703 || rhstype
== class_star_type_node
)
6704 binfo
= TYPE_BINFO (ttl
);
6706 binfo
= get_binfo (ttl
, ttr
, 1);
6708 if (binfo
== error_mark_node
)
6709 return error_mark_node
;
6711 return error_not_base_type (ttl
, ttr
);
6713 if (! TYPE_READONLY (ttl
) && TYPE_READONLY (ttr
))
6716 cp_pedwarn ("passing `%T' as argument %P of `%D' discards const",
6717 rhstype
, parmnum
, fndecl
);
6719 cp_pedwarn ("%s to `%T' from `%T' discards const",
6720 errtype
, type
, rhstype
);
6722 if (! TYPE_VOLATILE (ttl
) && TYPE_VOLATILE (ttr
))
6725 cp_pedwarn ("passing `%T' as argument %P of `%D' discards volatile",
6726 rhstype
, parmnum
, fndecl
);
6728 cp_pedwarn ("%s to `%T' from `%T' discards volatile",
6729 errtype
, type
, rhstype
);
6733 /* Any non-function converts to a [const][volatile] void *
6734 and vice versa; otherwise, targets must be the same.
6735 Meanwhile, the lhs target must have all the qualifiers of the rhs. */
6736 else if (TYPE_MAIN_VARIANT (ttl
) == void_type_node
6737 || TYPE_MAIN_VARIANT (ttr
) == void_type_node
6738 || (ctt
= comp_target_types (type
, rhstype
, 1))
6739 || (unsigned_type (TYPE_MAIN_VARIANT (ttl
))
6740 == unsigned_type (TYPE_MAIN_VARIANT (ttr
))))
6742 /* ARM $4.8, commentary on p39. */
6743 if (TYPE_MAIN_VARIANT (ttl
) == void_type_node
6744 && TREE_CODE (ttr
) == OFFSET_TYPE
)
6746 cp_error ("no standard conversion from `%T' to `void *'", ttr
);
6747 return error_mark_node
;
6750 if (ctt
< 0 && TYPE_MAIN_VARIANT (ttl
) != TYPE_MAIN_VARIANT (ttr
))
6751 cp_pedwarn ("converting `%T' to `%T' is a contravariance violation",
6754 if (TYPE_MAIN_VARIANT (ttl
) != void_type_node
6755 && TYPE_MAIN_VARIANT (ttr
) == void_type_node
6756 && ! null_ptr_cst_p (rhs
))
6758 if (coder
== RECORD_TYPE
)
6759 cp_pedwarn ("implicit conversion of signature pointer to type `%T'",
6762 pedwarn ("ANSI C++ forbids implicit conversion from `void *' in %s",
6765 /* Const and volatile mean something different for function types,
6766 so the usual warnings are not appropriate. */
6767 else if ((TREE_CODE (ttr
) != FUNCTION_TYPE
&& TREE_CODE (ttr
) != METHOD_TYPE
)
6768 || (TREE_CODE (ttl
) != FUNCTION_TYPE
&& TREE_CODE (ttl
) != METHOD_TYPE
))
6770 if (TREE_CODE (ttl
) == OFFSET_TYPE
6771 && binfo_member (TYPE_OFFSET_BASETYPE (ttr
),
6772 CLASSTYPE_VBASECLASSES (TYPE_OFFSET_BASETYPE (ttl
))))
6774 sorry ("%s between pointer to members converting across virtual baseclasses", errtype
);
6775 return error_mark_node
;
6777 else if (! TYPE_READONLY (ttl
) && TYPE_READONLY (ttr
))
6780 cp_pedwarn ("passing `%T' as argument %P of `%D' discards const",
6781 rhstype
, parmnum
, fndecl
);
6783 cp_pedwarn ("%s to `%T' from `%T' discards const",
6784 errtype
, type
, rhstype
);
6786 else if (! TYPE_VOLATILE (ttl
) && TYPE_VOLATILE (ttr
))
6789 cp_pedwarn ("passing `%T' as argument %P of `%D' discards volatile",
6790 rhstype
, parmnum
, fndecl
);
6792 cp_pedwarn ("%s to `%T' from `%T' discards volatile",
6793 errtype
, type
, rhstype
);
6795 else if (TREE_CODE (ttl
) == TREE_CODE (ttr
)
6796 && ! comp_target_types (type
, rhstype
, 1))
6799 cp_pedwarn ("passing `%T' as argument %P of `%D' changes signedness",
6800 rhstype
, parmnum
, fndecl
);
6802 cp_pedwarn ("%s to `%T' from `%T' changes signedness",
6803 errtype
, type
, rhstype
);
6809 int add_quals
= 0, const_parity
= 0, volatile_parity
= 0;
6811 int unsigned_parity
;
6814 /* This code is basically a duplicate of comp_ptr_ttypes_real. */
6815 for (; ; ttl
= TREE_TYPE (ttl
), ttr
= TREE_TYPE (ttr
))
6818 const_parity
|= (TYPE_READONLY (ttl
) < TYPE_READONLY (ttr
));
6819 volatile_parity
|= (TYPE_VOLATILE (ttl
) < TYPE_VOLATILE (ttr
));
6822 && (TYPE_READONLY (ttl
) > TYPE_READONLY (ttr
)
6823 || TYPE_VOLATILE (ttl
) > TYPE_VOLATILE (ttr
)))
6825 left_const
&= TYPE_READONLY (ttl
);
6827 if (TREE_CODE (ttl
) != POINTER_TYPE
6828 || TREE_CODE (ttr
) != POINTER_TYPE
)
6831 unsigned_parity
= TREE_UNSIGNED (ttl
) - TREE_UNSIGNED (ttr
);
6832 if (unsigned_parity
)
6834 if (TREE_UNSIGNED (ttl
))
6835 ttr
= unsigned_type (ttr
);
6837 ttl
= unsigned_type (ttl
);
6840 if (comp_target_types (ttl
, ttr
, nptrs
) > 0)
6845 cp_pedwarn ("passing `%T' as argument %P of `%D' adds cv-quals without intervening `const'",
6846 rhstype
, parmnum
, fndecl
);
6848 cp_pedwarn ("%s to `%T' from `%T' adds cv-quals without intervening `const'",
6849 errtype
, type
, rhstype
);
6854 cp_pedwarn ("passing `%T' as argument %P of `%D' discards const",
6855 rhstype
, parmnum
, fndecl
);
6857 cp_pedwarn ("%s to `%T' from `%T' discards const",
6858 errtype
, type
, rhstype
);
6860 if (volatile_parity
)
6863 cp_pedwarn ("passing `%T' as argument %P of `%D' discards volatile",
6864 rhstype
, parmnum
, fndecl
);
6866 cp_pedwarn ("%s to `%T' from `%T' discards volatile",
6867 errtype
, type
, rhstype
);
6869 if (unsigned_parity
> 0)
6872 cp_pedwarn ("passing `%T' as argument %P of `%D' changes signed to unsigned",
6873 rhstype
, parmnum
, fndecl
);
6875 cp_pedwarn ("%s to `%T' from `%T' changes signed to unsigned",
6876 errtype
, type
, rhstype
);
6878 else if (unsigned_parity
< 0)
6881 cp_pedwarn ("passing `%T' as argument %P of `%D' changes unsigned to signed",
6882 rhstype
, parmnum
, fndecl
);
6884 cp_pedwarn ("%s to `%T' from `%T' changes unsigned to signed",
6885 errtype
, type
, rhstype
);
6888 /* C++ is not so friendly about converting function and
6889 member function pointers as C. Emit warnings here. */
6890 if (TREE_CODE (ttl
) == FUNCTION_TYPE
6891 || TREE_CODE (ttl
) == METHOD_TYPE
)
6892 if (! comptypes (ttl
, ttr
, 0))
6894 warning ("conflicting function types in %s:", errtype
);
6895 cp_warning ("\t`%T' != `%T'", type
, rhstype
);
6901 cp_error ("passing `%T' as argument %P of `%D'",
6902 rhstype
, parmnum
, fndecl
);
6904 cp_error ("%s to `%T' from `%T'", errtype
, type
, rhstype
);
6905 return error_mark_node
;
6908 return cp_convert (type
, rhs
);
6910 else if (codel
== POINTER_TYPE
&& coder
== INTEGER_TYPE
)
6912 /* An explicit constant 0 can convert to a pointer,
6913 but not a 0 that results from casting or folding. */
6914 if (! (TREE_CODE (rhs
) == INTEGER_CST
&& integer_zerop (rhs
)))
6917 cp_pedwarn ("passing `%T' to argument %P of `%D' lacks a cast",
6918 rhstype
, parmnum
, fndecl
);
6920 cp_pedwarn ("%s to `%T' from `%T' lacks a cast",
6921 errtype
, type
, rhstype
);
6923 return cp_convert (type
, rhs
);
6925 else if (codel
== INTEGER_TYPE
6926 && (coder
== POINTER_TYPE
6927 || (coder
== RECORD_TYPE
6928 && (IS_SIGNATURE_POINTER (rhstype
)
6929 || TYPE_PTRMEMFUNC_FLAG (rhstype
)
6930 || IS_SIGNATURE_REFERENCE (rhstype
)))))
6933 cp_pedwarn ("passing `%T' to argument %P of `%D' lacks a cast",
6934 rhstype
, parmnum
, fndecl
);
6936 cp_pedwarn ("%s to `%T' from `%T' lacks a cast",
6937 errtype
, type
, rhstype
);
6938 return cp_convert (type
, rhs
);
6940 else if (codel
== BOOLEAN_TYPE
6941 && (coder
== POINTER_TYPE
6942 || (coder
== RECORD_TYPE
6943 && (IS_SIGNATURE_POINTER (rhstype
)
6944 || TYPE_PTRMEMFUNC_FLAG (rhstype
)
6945 || IS_SIGNATURE_REFERENCE (rhstype
)))))
6946 return cp_convert (type
, rhs
);
6949 else if (((coder
== POINTER_TYPE
6950 && TREE_CODE (TREE_TYPE (rhstype
)) == METHOD_TYPE
)
6951 || integer_zerop (rhs
)
6952 || TYPE_PTRMEMFUNC_P (rhstype
))
6953 && TYPE_PTRMEMFUNC_P (type
))
6955 tree ttl
= TYPE_PTRMEMFUNC_FN_TYPE (type
);
6956 tree ttr
= (TYPE_PTRMEMFUNC_P (rhstype
)
6957 ? TYPE_PTRMEMFUNC_FN_TYPE (rhstype
)
6959 int ctt
= (TREE_CODE (rhstype
) == INTEGER_TYPE
? 1
6960 : comp_target_types (ttl
, ttr
, 1));
6963 cp_pedwarn ("converting `%T' to `%T' is a contravariance violation",
6966 cp_error ("%s to `%T' from `%T'", errtype
, ttl
, ttr
);
6968 /* compatible pointer to member functions. */
6969 return build_ptrmemfunc (ttl
, rhs
, 0);
6971 else if (codel
== ERROR_MARK
|| coder
== ERROR_MARK
)
6972 return error_mark_node
;
6974 /* This should no longer happen. References are initialized via
6975 `convert_for_initialization'. They should otherwise be
6976 bashed before coming here. */
6977 else if (codel
== REFERENCE_TYPE
)
6978 my_friendly_abort (317);
6979 else if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (TREE_TYPE (rhs
)))
6981 tree nrhs
= build1 (NOP_EXPR
, type
, rhs
);
6982 TREE_CONSTANT (nrhs
) = TREE_CONSTANT (rhs
);
6985 else if (TYPE_HAS_CONSTRUCTOR (type
) || IS_AGGR_TYPE (TREE_TYPE (rhs
)))
6986 return cp_convert (type
, rhs
);
6987 /* Handle anachronistic conversions from (::*)() to cv void* or (*)(). */
6988 else if (TREE_CODE (type
) == POINTER_TYPE
6989 && (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
6990 || TYPE_MAIN_VARIANT (TREE_TYPE (type
)) == void_type_node
)
6992 && TYPE_PTRMEMFUNC_P (TREE_TYPE (rhs
)))
6993 return cp_convert (type
, rhs
);
6995 cp_error ("%s to `%T' from `%T'", errtype
, type
, rhstype
);
6996 return error_mark_node
;
6999 /* Convert RHS to be of type TYPE. If EXP is non-zero,
7000 it is the target of the initialization.
7001 ERRTYPE is a string to use in error messages.
7003 Two major differences between the behavior of
7004 `convert_for_assignment' and `convert_for_initialization'
7005 are that references are bashed in the former, while
7006 copied in the latter, and aggregates are assigned in
7007 the former (operator=) while initialized in the
7010 If using constructor make sure no conversion operator exists, if one does
7011 exist, an ambiguity exists.
7013 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
7016 convert_for_initialization (exp
, type
, rhs
, flags
, errtype
, fndecl
, parmnum
)
7017 tree exp
, type
, rhs
;
7023 register enum tree_code codel
= TREE_CODE (type
);
7024 register tree rhstype
;
7025 register enum tree_code coder
;
7027 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
7028 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
7029 if (TREE_CODE (rhs
) == NOP_EXPR
7030 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
7031 && codel
!= REFERENCE_TYPE
)
7032 rhs
= TREE_OPERAND (rhs
, 0);
7034 if (rhs
== error_mark_node
7035 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
7036 return error_mark_node
;
7038 if (TREE_CODE (TREE_TYPE (rhs
)) == OFFSET_TYPE
)
7040 rhs
= resolve_offset_ref (rhs
);
7041 if (rhs
== error_mark_node
)
7042 return error_mark_node
;
7045 if (TREE_CODE (TREE_TYPE (rhs
)) == REFERENCE_TYPE
)
7046 rhs
= convert_from_reference (rhs
);
7048 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
7049 && TREE_CODE (type
) != ARRAY_TYPE
7050 && (TREE_CODE (type
) != REFERENCE_TYPE
7051 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
7052 || TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
7053 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
7054 rhs
= default_conversion (rhs
);
7056 rhstype
= TREE_TYPE (rhs
);
7057 coder
= TREE_CODE (rhstype
);
7059 if (coder
== UNKNOWN_TYPE
)
7061 rhs
= instantiate_type (type
, rhs
, 1);
7062 rhstype
= TREE_TYPE (rhs
);
7063 coder
= TREE_CODE (rhstype
);
7066 if (coder
== ERROR_MARK
)
7067 return error_mark_node
;
7069 /* We accept references to incomplete types, so we can
7070 return here before checking if RHS is of complete type. */
7072 if (codel
== REFERENCE_TYPE
)
7074 /* This should eventually happen in convert_arguments. */
7075 extern int warningcount
, errorcount
;
7076 int savew
= 0, savee
= 0;
7079 savew
= warningcount
, savee
= errorcount
;
7080 rhs
= convert_to_reference (type
, rhs
, CONV_IMPLICIT
, flags
,
7081 exp
? exp
: error_mark_node
);
7084 if (warningcount
> savew
)
7085 cp_warning_at ("in passing argument %P of `%+D'", parmnum
, fndecl
);
7086 else if (errorcount
> savee
)
7087 cp_error_at ("in passing argument %P of `%+D'", parmnum
, fndecl
);
7092 rhs
= require_complete_type (rhs
);
7093 if (rhs
== error_mark_node
)
7094 return error_mark_node
;
7096 if (exp
!= 0) exp
= require_complete_type (exp
);
7097 if (exp
== error_mark_node
)
7098 return error_mark_node
;
7100 if (TREE_CODE (rhstype
) == REFERENCE_TYPE
)
7101 rhstype
= TREE_TYPE (rhstype
);
7103 type
= complete_type (type
);
7105 if (TYPE_LANG_SPECIFIC (type
)
7106 && (IS_SIGNATURE_POINTER (type
) || IS_SIGNATURE_REFERENCE (type
)))
7107 return build_signature_pointer_constructor (type
, rhs
);
7109 if (IS_AGGR_TYPE (type
))
7110 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
7112 if (type
== TREE_TYPE (rhs
))
7114 if (TREE_READONLY_DECL_P (rhs
))
7115 rhs
= decl_constant_value (rhs
);
7119 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
);
7122 /* Expand an ASM statement with operands, handling output operands
7123 that are not variables or INDIRECT_REFS by transforming such
7124 cases into cases that expand_asm_operands can handle.
7126 Arguments are same as for expand_asm_operands.
7128 We don't do default conversions on all inputs, because it can screw
7129 up operands that are expected to be in memory. */
7132 c_expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, filename
, line
)
7133 tree string
, outputs
, inputs
, clobbers
;
7138 int noutputs
= list_length (outputs
);
7140 /* o[I] is the place that output number I should be written. */
7141 register tree
*o
= (tree
*) alloca (noutputs
* sizeof (tree
));
7144 /* Record the contents of OUTPUTS before it is modified. */
7145 for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
7146 o
[i
] = TREE_VALUE (tail
);
7148 /* Generate the ASM_OPERANDS insn;
7149 store into the TREE_VALUEs of OUTPUTS some trees for
7150 where the values were actually stored. */
7151 expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, filename
, line
);
7153 /* Copy all the intermediate outputs into the specified outputs. */
7154 for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
7156 if (o
[i
] != TREE_VALUE (tail
))
7158 expand_expr (build_modify_expr (o
[i
], NOP_EXPR
, TREE_VALUE (tail
)),
7159 const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
7162 /* Detect modification of read-only values.
7163 (Otherwise done by build_modify_expr.) */
7166 tree type
= TREE_TYPE (o
[i
]);
7167 if (TYPE_READONLY (type
)
7168 || ((TREE_CODE (type
) == RECORD_TYPE
7169 || TREE_CODE (type
) == UNION_TYPE
)
7170 && C_TYPE_FIELDS_READONLY (type
)))
7171 readonly_error (o
[i
], "modification by `asm'", 1);
7175 /* Those MODIFY_EXPRs could do autoincrements. */
7179 /* Expand a C `return' statement.
7180 RETVAL is the expression for what to return,
7181 or a null pointer for `return;' with no value.
7183 C++: upon seeing a `return', we must call destructors on all
7184 variables in scope which had constructors called on them.
7185 This means that if in a destructor, the base class destructors
7186 must be called before returning.
7188 The RETURN statement in C++ has initialization semantics. */
7191 c_expand_return (retval
)
7194 extern struct nesting
*cond_stack
, *loop_stack
, *case_stack
;
7195 extern tree dtor_label
, ctor_label
;
7196 tree result
= DECL_RESULT (current_function_decl
);
7197 tree valtype
= TREE_TYPE (result
);
7199 if (TREE_THIS_VOLATILE (current_function_decl
))
7200 warning ("function declared `noreturn' has a `return' statement");
7202 if (retval
== error_mark_node
)
7204 current_function_returns_null
= 1;
7208 if (processing_template_decl
)
7210 add_tree (build_min_nt (RETURN_STMT
, retval
));
7217 error ("returning a value from a destructor");
7219 /* Can't just return from a destructor. */
7220 expand_goto (dtor_label
);
7224 if (retval
== NULL_TREE
)
7226 /* A non-named return value does not count. */
7228 if (DECL_CONSTRUCTOR_P (current_function_decl
))
7229 retval
= current_class_ptr
;
7230 else if (DECL_NAME (result
) != NULL_TREE
7231 && TREE_CODE (valtype
) != VOID_TYPE
)
7235 current_function_returns_null
= 1;
7237 if (valtype
!= NULL_TREE
&& TREE_CODE (valtype
) != VOID_TYPE
)
7239 if (DECL_NAME (DECL_RESULT (current_function_decl
)) == NULL_TREE
)
7241 pedwarn ("`return' with no value, in function returning non-void");
7242 /* Clear this, so finish_function won't say that we
7243 reach the end of a non-void function (which we don't,
7244 we gave a return!). */
7245 current_function_returns_null
= 0;
7249 expand_null_return ();
7253 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
7255 if (flag_this_is_variable
)
7256 error ("return from a constructor: use `this = ...' instead");
7258 error ("returning a value from a constructor");
7259 retval
= current_class_ptr
;
7262 /* Effective C++ rule 15. See also start_function. */
7264 && DECL_NAME (current_function_decl
) == ansi_opname
[(int) MODIFY_EXPR
]
7265 && retval
!= current_class_ref
)
7266 cp_warning ("`operator=' should return a reference to `*this'");
7268 if (valtype
== NULL_TREE
|| TREE_CODE (valtype
) == VOID_TYPE
)
7270 current_function_returns_null
= 1;
7271 if (TREE_CODE (TREE_TYPE (retval
)) != VOID_TYPE
)
7272 pedwarn ("`return' with a value, in function returning void");
7273 expand_return (retval
);
7277 /* Now deal with possible C++ hair:
7278 (1) Compute the return value.
7279 (2) If there are aggregate values with destructors which
7280 must be cleaned up, clean them (taking care
7281 not to clobber the return value).
7282 (3) If an X(X&) constructor is defined, the return
7283 value must be returned via that. */
7285 if (retval
== result
7286 || DECL_CONSTRUCTOR_P (current_function_decl
))
7287 /* It's already done for us. */;
7288 else if (TREE_TYPE (retval
) == void_type_node
)
7290 pedwarn ("return of void value in function returning non-void");
7291 expand_expr_stmt (retval
);
7296 retval
= convert_for_initialization
7297 (NULL_TREE
, valtype
, retval
, LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
,
7298 "return", NULL_TREE
, 0);
7300 if (retval
== error_mark_node
)
7302 /* Avoid warning about control reaching end of function. */
7303 expand_null_return ();
7307 /* We can't initialize a register from a AGGR_INIT_EXPR. */
7308 else if (! current_function_returns_struct
7309 && TREE_CODE (retval
) == TARGET_EXPR
7310 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
7311 retval
= build (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
7312 TREE_OPERAND (retval
, 0));
7314 /* Add some useful error checking for C++. */
7315 else if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
7317 tree whats_returned
;
7319 /* Sort through common things to see what it is
7320 we are returning. */
7321 whats_returned
= retval
;
7322 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
7324 whats_returned
= TREE_OPERAND (whats_returned
, 1);
7325 if (TREE_CODE (whats_returned
) == ADDR_EXPR
)
7326 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7328 while (TREE_CODE (whats_returned
) == CONVERT_EXPR
7329 || TREE_CODE (whats_returned
) == NOP_EXPR
)
7330 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7331 if (TREE_CODE (whats_returned
) == ADDR_EXPR
)
7333 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7334 while (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
7335 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
7337 /* Get the target. */
7338 whats_returned
= TREE_OPERAND (whats_returned
, 0);
7339 warning ("returning reference to temporary");
7343 if (TREE_CODE (whats_returned
) == VAR_DECL
&& DECL_NAME (whats_returned
))
7345 if (TEMP_NAME_P (DECL_NAME (whats_returned
)))
7346 warning ("reference to non-lvalue returned");
7347 else if (TREE_CODE (TREE_TYPE (whats_returned
)) != REFERENCE_TYPE
7348 && ! TREE_STATIC (whats_returned
)
7349 && IDENTIFIER_LOCAL_VALUE (DECL_NAME (whats_returned
))
7350 && !TREE_PUBLIC (whats_returned
))
7351 cp_warning_at ("reference to local variable `%D' returned", whats_returned
);
7354 else if (TREE_CODE (retval
) == ADDR_EXPR
)
7356 tree whats_returned
= TREE_OPERAND (retval
, 0);
7358 if (TREE_CODE (whats_returned
) == VAR_DECL
7359 && DECL_NAME (whats_returned
)
7360 && IDENTIFIER_LOCAL_VALUE (DECL_NAME (whats_returned
))
7361 && !TREE_STATIC (whats_returned
)
7362 && !TREE_PUBLIC (whats_returned
))
7363 cp_warning_at ("address of local variable `%D' returned", whats_returned
);
7367 if (retval
!= NULL_TREE
7368 && TREE_CODE_CLASS (TREE_CODE (retval
)) == 'd'
7369 && cond_stack
== 0 && loop_stack
== 0 && case_stack
== 0)
7370 current_function_return_value
= retval
;
7372 if (ctor_label
&& TREE_CODE (ctor_label
) != ERROR_MARK
)
7374 /* Here RETVAL is CURRENT_CLASS_PTR, so there's nothing to do. */
7375 expand_goto (ctor_label
);
7378 if (retval
&& retval
!= result
)
7380 result
= build (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
7381 TREE_SIDE_EFFECTS (result
) = 1;
7384 expand_start_target_temps ();
7386 expand_return (result
);
7388 expand_end_target_temps ();
7390 current_function_returns_value
= 1;
7393 /* Start a C switch statement, testing expression EXP.
7394 Return EXP if it is valid, an error node otherwise. */
7397 c_expand_start_case (exp
)
7401 register enum tree_code code
;
7403 /* Convert from references, etc. */
7404 exp
= default_conversion (exp
);
7405 type
= TREE_TYPE (exp
);
7406 code
= TREE_CODE (type
);
7408 if (IS_AGGR_TYPE_CODE (code
))
7409 exp
= build_type_conversion (CONVERT_EXPR
, integer_type_node
, exp
, 1);
7411 if (exp
== NULL_TREE
)
7413 error ("switch quantity not an integer");
7414 exp
= error_mark_node
;
7416 type
= TREE_TYPE (exp
);
7417 code
= TREE_CODE (type
);
7419 if (code
!= INTEGER_TYPE
&& code
!= ENUMERAL_TYPE
&& code
!= ERROR_MARK
)
7421 error ("switch quantity not an integer");
7422 exp
= error_mark_node
;
7428 exp
= default_conversion (exp
);
7429 type
= TREE_TYPE (exp
);
7430 idx
= get_unwidened (exp
, 0);
7431 /* We can't strip a conversion from a signed type to an unsigned,
7432 because if we did, int_fits_type_p would do the wrong thing
7433 when checking case values for being in range,
7434 and it's too hard to do the right thing. */
7435 if (TREE_UNSIGNED (TREE_TYPE (exp
))
7436 == TREE_UNSIGNED (TREE_TYPE (idx
)))
7441 (1, fold (build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
)),
7442 type
, "switch statement");
7447 /* Returns non-zero if the pointer-type FROM can be converted to the
7448 pointer-type TO via a qualification conversion. If CONSTP is -1,
7449 then we return non-zero if the pointers are similar, and the
7450 cv-qualification signature of FROM is a proper subset of that of TO.
7452 If CONSTP is positive, then all outer pointers have been
7456 comp_ptr_ttypes_real (to
, from
, constp
)
7460 int to_more_cv_qualified
= 0;
7462 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7464 if (TREE_CODE (to
) != TREE_CODE (from
))
7467 if (TREE_CODE (from
) == OFFSET_TYPE
7468 && comptypes (TYPE_OFFSET_BASETYPE (from
),
7469 TYPE_OFFSET_BASETYPE (to
), 1))
7472 /* Const and volatile mean something different for function types,
7473 so the usual checks are not appropriate. */
7474 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7476 if (TYPE_READONLY (from
) > TYPE_READONLY (to
)
7477 || TYPE_VOLATILE (from
) > TYPE_VOLATILE (to
))
7480 if (TYPE_READONLY (to
) > TYPE_READONLY (from
)
7481 || TYPE_VOLATILE (to
) > TYPE_VOLATILE (from
))
7486 ++to_more_cv_qualified
;
7490 constp
&= TYPE_READONLY (to
);
7493 if (TREE_CODE (to
) != POINTER_TYPE
)
7495 comptypes (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
), 1)
7496 && (constp
>= 0 || to_more_cv_qualified
);
7500 /* When comparing, say, char ** to char const **, this function takes the
7501 'char *' and 'char const *'. Do not pass non-pointer types to this
7505 comp_ptr_ttypes (to
, from
)
7508 return comp_ptr_ttypes_real (to
, from
, 1);
7511 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
7512 type or inheritance-related types, regardless of cv-quals. */
7515 ptr_reasonably_similar (to
, from
)
7518 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7520 if (TREE_CODE (to
) != TREE_CODE (from
))
7523 if (TREE_CODE (from
) == OFFSET_TYPE
7524 && comptypes (TYPE_OFFSET_BASETYPE (to
),
7525 TYPE_OFFSET_BASETYPE (from
), -1))
7528 if (TREE_CODE (to
) != POINTER_TYPE
)
7530 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
), -1);
7534 /* Like comp_ptr_ttypes, for const_cast. */
7537 comp_ptr_ttypes_const (to
, from
)
7540 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7542 if (TREE_CODE (to
) != TREE_CODE (from
))
7545 if (TREE_CODE (from
) == OFFSET_TYPE
7546 && comptypes (TYPE_OFFSET_BASETYPE (from
),
7547 TYPE_OFFSET_BASETYPE (to
), 1))
7550 if (TREE_CODE (to
) != POINTER_TYPE
)
7551 return comptypes (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
), 1);
7555 /* Like comp_ptr_ttypes, for reinterpret_cast. */
7558 comp_ptr_ttypes_reinterpret (to
, from
)
7563 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
7565 if (TREE_CODE (from
) == OFFSET_TYPE
)
7566 from
= TREE_TYPE (from
);
7567 if (TREE_CODE (to
) == OFFSET_TYPE
)
7568 to
= TREE_TYPE (to
);
7570 if (TREE_CODE (to
) != TREE_CODE (from
))
7573 /* Const and volatile mean something different for function types,
7574 so the usual checks are not appropriate. */
7575 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
7577 if (TYPE_READONLY (from
) > TYPE_READONLY (to
)
7578 || TYPE_VOLATILE (from
) > TYPE_VOLATILE (to
))
7582 && (TYPE_READONLY (to
) > TYPE_READONLY (from
)
7583 || TYPE_VOLATILE (to
) > TYPE_READONLY (from
)))
7585 constp
&= TYPE_READONLY (to
);
7588 if (TREE_CODE (to
) != POINTER_TYPE
)