1 /* Build expressions with type checking for C++ compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* This file is part of the C++ front end.
25 It contains routines to build C++ expressions given their operands,
26 including computing the types of the result, C and C++ specific error
27 checks, and some optimization.
29 There are also routines to build RETURN_STMT nodes and CASE_STMT nodes,
30 and to process initializations in declarations (since they work
31 like a strange sort of assignment). */
35 #include "coretypes.h"
45 #include "diagnostic.h"
48 static tree convert_for_assignment
PARAMS ((tree
, tree
, const char *, tree
,
50 static tree cp_pointer_int_sum
PARAMS ((enum tree_code
, tree
, tree
));
51 static tree rationalize_conditional_expr
PARAMS ((enum tree_code
, tree
));
52 static int comp_target_parms
PARAMS ((tree
, tree
));
53 static int comp_ptr_ttypes_real
PARAMS ((tree
, tree
, int));
54 static int comp_ptr_ttypes_const
PARAMS ((tree
, tree
));
55 static int comp_ptr_ttypes_reinterpret
PARAMS ((tree
, tree
));
56 static int comp_except_types
PARAMS ((tree
, tree
, int));
57 static int comp_array_types
PARAMS ((int (*) (tree
, tree
, int), tree
,
59 static tree common_base_type
PARAMS ((tree
, tree
));
60 static tree lookup_anon_field
PARAMS ((tree
, tree
));
61 static tree pointer_diff
PARAMS ((tree
, tree
, tree
));
62 static tree qualify_type_recursive
PARAMS ((tree
, tree
));
63 static tree get_delta_difference
PARAMS ((tree
, tree
, int));
64 static int comp_cv_target_types
PARAMS ((tree
, tree
, int));
65 static void casts_away_constness_r
PARAMS ((tree
*, tree
*));
66 static int casts_away_constness
PARAMS ((tree
, tree
));
67 static void maybe_warn_about_returning_address_of_local
PARAMS ((tree
));
68 static tree strip_all_pointer_quals
PARAMS ((tree
));
69 static tree
lookup_destructor (tree
, tree
, tree
);
71 /* Return the target type of TYPE, which means return T for:
72 T*, T&, T[], T (...), and otherwise, just T. */
78 if (TREE_CODE (type
) == REFERENCE_TYPE
)
79 type
= TREE_TYPE (type
);
80 while (TREE_CODE (type
) == POINTER_TYPE
81 || TREE_CODE (type
) == ARRAY_TYPE
82 || TREE_CODE (type
) == FUNCTION_TYPE
83 || TREE_CODE (type
) == METHOD_TYPE
84 || TREE_CODE (type
) == OFFSET_TYPE
)
85 type
= TREE_TYPE (type
);
89 /* Do `exp = require_complete_type (exp);' to make sure exp
90 does not have an incomplete type. (That includes void types.)
91 Returns the error_mark_node if the VALUE does not have
92 complete type when this function returns. */
95 require_complete_type (value
)
100 if (processing_template_decl
|| value
== error_mark_node
)
103 if (TREE_CODE (value
) == OVERLOAD
)
104 type
= unknown_type_node
;
106 type
= TREE_TYPE (value
);
108 /* First, detect a valid value with a complete type. */
109 if (COMPLETE_TYPE_P (type
))
112 /* If we see X::Y, we build an OFFSET_TYPE which has
113 not been laid out. Try to avoid an error by interpreting
114 it as this->X::Y, if reasonable. */
115 if (TREE_CODE (value
) == OFFSET_REF
116 && current_class_ref
!= 0
117 && TREE_OPERAND (value
, 0) == current_class_ref
)
119 value
= resolve_offset_ref (value
);
120 return require_complete_type (value
);
123 if (complete_type_or_else (type
, value
))
126 return error_mark_node
;
129 /* Try to complete TYPE, if it is incomplete. For example, if TYPE is
130 a template instantiation, do the instantiation. Returns TYPE,
131 whether or not it could be completed, unless something goes
132 horribly wrong, in which case the error_mark_node is returned. */
138 if (type
== NULL_TREE
)
139 /* Rather than crash, we return something sure to cause an error
141 return error_mark_node
;
143 if (type
== error_mark_node
|| COMPLETE_TYPE_P (type
))
145 else if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
147 tree t
= complete_type (TREE_TYPE (type
));
148 if (COMPLETE_TYPE_P (t
) && ! processing_template_decl
)
150 TYPE_NEEDS_CONSTRUCTING (type
)
151 = TYPE_NEEDS_CONSTRUCTING (TYPE_MAIN_VARIANT (t
));
152 TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
153 = TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TYPE_MAIN_VARIANT (t
));
155 else if (CLASS_TYPE_P (type
) && CLASSTYPE_TEMPLATE_INSTANTIATION (type
))
156 instantiate_class_template (TYPE_MAIN_VARIANT (type
));
161 /* Like complete_type, but issue an error if the TYPE cannot be completed.
162 VALUE is used for informative diagnostics. DIAG_TYPE indicates the type
163 of diagnostic: 0 for an error, 1 for a warning, 2 for a pedwarn.
164 Returns NULL_TREE if the type cannot be made complete. */
167 complete_type_or_diagnostic (type
, value
, diag_type
)
172 type
= complete_type (type
);
173 if (type
== error_mark_node
)
174 /* We already issued an error. */
176 else if (!COMPLETE_TYPE_P (type
))
178 cxx_incomplete_type_diagnostic (value
, type
, diag_type
);
185 /* Return truthvalue of whether type of EXP is instantiated. */
191 return (TREE_CODE (exp
) == OVERLOAD
192 || TREE_CODE (exp
) == TREE_LIST
193 || TREE_TYPE (exp
) == unknown_type_node
194 || (TREE_CODE (TREE_TYPE (exp
)) == OFFSET_TYPE
195 && TREE_TYPE (TREE_TYPE (exp
)) == unknown_type_node
));
198 /* Return a pointer or pointer to member type similar to T1, with a
199 cv-qualification signature that is the union of the cv-qualification
200 signatures of T1 and T2: [expr.rel], [expr.eq]. */
203 qualify_type_recursive (t1
, t2
)
206 if ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
207 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
)))
214 tree attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
216 if (TYPE_PTRMEM_P (t1
))
218 b1
= TYPE_PTRMEM_CLASS_TYPE (t1
);
219 tt1
= TYPE_PTRMEM_POINTED_TO_TYPE (t1
);
220 tt2
= TYPE_PTRMEM_POINTED_TO_TYPE (t2
);
225 tt1
= TREE_TYPE (t1
);
226 tt2
= TREE_TYPE (t2
);
229 type_quals
= (cp_type_quals (tt1
) | cp_type_quals (tt2
));
230 tgt
= qualify_type_recursive (tt1
, tt2
);
231 tgt
= cp_build_qualified_type (tgt
, type_quals
);
233 t1
= build_ptrmem_type (b1
, tgt
);
235 t1
= build_pointer_type (tgt
);
236 t1
= build_type_attribute_variant (t1
, attributes
);
241 /* Return the common type of two parameter lists.
242 We assume that comptypes has already been done and returned 1;
243 if that isn't so, this may crash.
245 As an optimization, free the space we allocate if the parameter
246 lists are already common. */
252 tree oldargs
= p1
, newargs
, n
;
256 len
= list_length (p1
);
257 newargs
= tree_last (p1
);
259 if (newargs
== void_list_node
)
268 newargs
= tree_cons (NULL_TREE
, NULL_TREE
, newargs
);
273 p1
= TREE_CHAIN (p1
), p2
= TREE_CHAIN (p2
), n
= TREE_CHAIN (n
), i
++)
275 if (TREE_PURPOSE (p1
) && !TREE_PURPOSE (p2
))
277 TREE_PURPOSE (n
) = TREE_PURPOSE (p1
);
280 else if (! TREE_PURPOSE (p1
))
282 if (TREE_PURPOSE (p2
))
284 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
290 if (1 != simple_cst_equal (TREE_PURPOSE (p1
), TREE_PURPOSE (p2
)))
292 TREE_PURPOSE (n
) = TREE_PURPOSE (p2
);
294 if (TREE_VALUE (p1
) != TREE_VALUE (p2
))
297 TREE_VALUE (n
) = merge_types (TREE_VALUE (p1
), TREE_VALUE (p2
));
300 TREE_VALUE (n
) = TREE_VALUE (p1
);
308 /* Given a type, perhaps copied for a typedef,
309 find the "original" version of it. */
314 while (TYPE_NAME (t
) != NULL_TREE
)
316 tree x
= TYPE_NAME (t
);
317 if (TREE_CODE (x
) != TYPE_DECL
)
319 x
= DECL_ORIGINAL_TYPE (x
);
327 /* T1 and T2 are arithmetic or enumeration types. Return the type
328 that will result from the "usual arithmetic conversions" on T1 and
329 T2 as described in [expr]. */
332 type_after_usual_arithmetic_conversions (t1
, t2
)
336 enum tree_code code1
= TREE_CODE (t1
);
337 enum tree_code code2
= TREE_CODE (t2
);
340 /* FIXME: Attributes. */
341 my_friendly_assert (ARITHMETIC_TYPE_P (t1
)
342 || TREE_CODE (t1
) == COMPLEX_TYPE
343 || TREE_CODE (t1
) == ENUMERAL_TYPE
,
345 my_friendly_assert (ARITHMETIC_TYPE_P (t2
)
346 || TREE_CODE (t2
) == COMPLEX_TYPE
347 || TREE_CODE (t2
) == ENUMERAL_TYPE
,
350 /* In what follows, we slightly generalize the rules given in [expr] so
351 as to deal with `long long' and `complex'. First, merge the
353 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
355 /* If one type is complex, form the common type of the non-complex
356 components, then make that complex. Use T1 or T2 if it is the
358 if (code1
== COMPLEX_TYPE
|| code2
== COMPLEX_TYPE
)
360 tree subtype1
= code1
== COMPLEX_TYPE
? TREE_TYPE (t1
) : t1
;
361 tree subtype2
= code2
== COMPLEX_TYPE
? TREE_TYPE (t2
) : t2
;
363 = type_after_usual_arithmetic_conversions (subtype1
, subtype2
);
365 if (code1
== COMPLEX_TYPE
&& TREE_TYPE (t1
) == subtype
)
366 return build_type_attribute_variant (t1
, attributes
);
367 else if (code2
== COMPLEX_TYPE
&& TREE_TYPE (t2
) == subtype
)
368 return build_type_attribute_variant (t2
, attributes
);
370 return build_type_attribute_variant (build_complex_type (subtype
),
374 /* If only one is real, use it as the result. */
375 if (code1
== REAL_TYPE
&& code2
!= REAL_TYPE
)
376 return build_type_attribute_variant (t1
, attributes
);
377 if (code2
== REAL_TYPE
&& code1
!= REAL_TYPE
)
378 return build_type_attribute_variant (t2
, attributes
);
380 /* Perform the integral promotions. */
381 if (code1
!= REAL_TYPE
)
383 t1
= type_promotes_to (t1
);
384 t2
= type_promotes_to (t2
);
387 /* Both real or both integers; use the one with greater precision. */
388 if (TYPE_PRECISION (t1
) > TYPE_PRECISION (t2
))
389 return build_type_attribute_variant (t1
, attributes
);
390 else if (TYPE_PRECISION (t2
) > TYPE_PRECISION (t1
))
391 return build_type_attribute_variant (t2
, attributes
);
393 /* The types are the same; no need to do anything fancy. */
394 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
395 return build_type_attribute_variant (t1
, attributes
);
397 if (code1
!= REAL_TYPE
)
399 /* If one is a sizetype, use it so size_binop doesn't blow up. */
400 if (TYPE_IS_SIZETYPE (t1
) > TYPE_IS_SIZETYPE (t2
))
401 return build_type_attribute_variant (t1
, attributes
);
402 if (TYPE_IS_SIZETYPE (t2
) > TYPE_IS_SIZETYPE (t1
))
403 return build_type_attribute_variant (t2
, attributes
);
405 /* If one is unsigned long long, then convert the other to unsigned
407 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_unsigned_type_node
)
408 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_unsigned_type_node
))
409 return build_type_attribute_variant (long_long_unsigned_type_node
,
411 /* If one is a long long, and the other is an unsigned long, and
412 long long can represent all the values of an unsigned long, then
413 convert to a long long. Otherwise, convert to an unsigned long
414 long. Otherwise, if either operand is long long, convert the
417 Since we're here, we know the TYPE_PRECISION is the same;
418 therefore converting to long long cannot represent all the values
419 of an unsigned long, so we choose unsigned long long in that
421 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_long_integer_type_node
)
422 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_long_integer_type_node
))
424 tree t
= ((TREE_UNSIGNED (t1
) || TREE_UNSIGNED (t2
))
425 ? long_long_unsigned_type_node
426 : long_long_integer_type_node
);
427 return build_type_attribute_variant (t
, attributes
);
430 /* Go through the same procedure, but for longs. */
431 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_unsigned_type_node
)
432 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_unsigned_type_node
))
433 return build_type_attribute_variant (long_unsigned_type_node
,
435 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_integer_type_node
)
436 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_integer_type_node
))
438 tree t
= ((TREE_UNSIGNED (t1
) || TREE_UNSIGNED (t2
))
439 ? long_unsigned_type_node
: long_integer_type_node
);
440 return build_type_attribute_variant (t
, attributes
);
442 /* Otherwise prefer the unsigned one. */
443 if (TREE_UNSIGNED (t1
))
444 return build_type_attribute_variant (t1
, attributes
);
446 return build_type_attribute_variant (t2
, attributes
);
450 if (same_type_p (TYPE_MAIN_VARIANT (t1
), long_double_type_node
)
451 || same_type_p (TYPE_MAIN_VARIANT (t2
), long_double_type_node
))
452 return build_type_attribute_variant (long_double_type_node
,
454 if (same_type_p (TYPE_MAIN_VARIANT (t1
), double_type_node
)
455 || same_type_p (TYPE_MAIN_VARIANT (t2
), double_type_node
))
456 return build_type_attribute_variant (double_type_node
,
458 if (same_type_p (TYPE_MAIN_VARIANT (t1
), float_type_node
)
459 || same_type_p (TYPE_MAIN_VARIANT (t2
), float_type_node
))
460 return build_type_attribute_variant (float_type_node
,
463 /* Two floating-point types whose TYPE_MAIN_VARIANTs are none of
464 the standard C++ floating-point types. Logic earlier in this
465 function has already eliminated the possibility that
466 TYPE_PRECISION (t2) != TYPE_PRECISION (t1), so there's no
467 compelling reason to choose one or the other. */
468 return build_type_attribute_variant (t1
, attributes
);
472 /* Return the composite pointer type (see [expr.rel]) for T1 and T2.
473 ARG1 and ARG2 are the values with those types. The LOCATION is a
474 string describing the current location, in case an error occurs. */
477 composite_pointer_type (t1
, t2
, arg1
, arg2
, location
)
482 const char* location
;
489 If one operand is a null pointer constant, the composite pointer
490 type is the type of the other operand. */
491 if (null_ptr_cst_p (arg1
))
493 if (null_ptr_cst_p (arg2
))
496 /* Deal with pointer-to-member functions in the same way as we deal
497 with pointers to functions. */
498 if (TYPE_PTRMEMFUNC_P (t1
))
499 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
500 if (TYPE_PTRMEMFUNC_P (t2
))
501 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
503 /* Merge the attributes. */
504 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
510 If one of the operands has type "pointer to cv1 void*", then
511 the other has type "pointer to cv2T", and the composite pointer
512 type is "pointer to cv12 void", where cv12 is the union of cv1
515 If either type is a pointer to void, make sure it is T1. */
516 if (VOID_TYPE_P (TREE_TYPE (t2
)))
523 /* Now, if T1 is a pointer to void, merge the qualifiers. */
524 if (VOID_TYPE_P (TREE_TYPE (t1
)))
526 if (pedantic
&& TYPE_PTRFN_P (t2
))
527 pedwarn ("ISO C++ forbids %s between pointer of type `void *' and pointer-to-function", location
);
530 result_type
= cp_build_qualified_type (void_type_node
,
532 | cp_type_quals (t2
)));
533 result_type
= build_pointer_type (result_type
);
537 tree full1
= qualify_type_recursive (t1
, t2
);
538 tree full2
= qualify_type_recursive (t2
, t1
);
540 int val
= comp_target_types (full1
, full2
, 1);
548 pedwarn ("%s between distinct pointer types `%T' and `%T' lacks a cast",
550 result_type
= ptr_type_node
;
554 return build_type_attribute_variant (result_type
, attributes
);
557 /* Return the merged type of two types.
558 We assume that comptypes has already been done and returned 1;
559 if that isn't so, this may crash.
561 This just combines attributes and default arguments; any other
562 differences would cause the two types to compare unalike. */
568 register enum tree_code code1
;
569 register enum tree_code code2
;
572 /* Save time if the two types are the same. */
575 if (original_type (t1
) == original_type (t2
))
578 /* If one type is nonsense, use the other. */
579 if (t1
== error_mark_node
)
581 if (t2
== error_mark_node
)
584 /* Merge the attributes. */
585 attributes
= (*targetm
.merge_type_attributes
) (t1
, t2
);
587 /* Treat an enum type as the unsigned integer type of the same width. */
589 if (TYPE_PTRMEMFUNC_P (t1
))
590 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
591 if (TYPE_PTRMEMFUNC_P (t2
))
592 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
594 code1
= TREE_CODE (t1
);
595 code2
= TREE_CODE (t2
);
601 /* For two pointers, do this recursively on the target type. */
603 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
604 int quals
= cp_type_quals (t1
);
606 if (code1
== POINTER_TYPE
)
607 t1
= build_pointer_type (target
);
609 t1
= build_reference_type (target
);
610 t1
= build_type_attribute_variant (t1
, attributes
);
611 t1
= cp_build_qualified_type (t1
, quals
);
613 if (TREE_CODE (target
) == METHOD_TYPE
)
614 t1
= build_ptrmemfunc_type (t1
);
621 tree base
= TYPE_OFFSET_BASETYPE (t1
);
622 tree target
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
623 t1
= build_offset_type (base
, target
);
629 tree elt
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
630 /* Save space: see if the result is identical to one of the args. */
631 if (elt
== TREE_TYPE (t1
) && TYPE_DOMAIN (t1
))
632 return build_type_attribute_variant (t1
, attributes
);
633 if (elt
== TREE_TYPE (t2
) && TYPE_DOMAIN (t2
))
634 return build_type_attribute_variant (t2
, attributes
);
635 /* Merge the element types, and have a size if either arg has one. */
636 t1
= build_cplus_array_type
637 (elt
, TYPE_DOMAIN (TYPE_DOMAIN (t1
) ? t1
: t2
));
642 /* Function types: prefer the one that specified arg types.
643 If both do, merge the arg types. Also merge the return types. */
645 tree valtype
= merge_types (TREE_TYPE (t1
), TREE_TYPE (t2
));
646 tree p1
= TYPE_ARG_TYPES (t1
);
647 tree p2
= TYPE_ARG_TYPES (t2
);
650 /* Save space: see if the result is identical to one of the args. */
651 if (valtype
== TREE_TYPE (t1
) && ! p2
)
652 return build_type_attribute_variant (t1
, attributes
);
653 if (valtype
== TREE_TYPE (t2
) && ! p1
)
654 return build_type_attribute_variant (t2
, attributes
);
656 /* Simple way if one arg fails to specify argument types. */
657 if (p1
== NULL_TREE
|| TREE_VALUE (p1
) == void_type_node
)
659 rval
= build_function_type (valtype
, p2
);
660 if ((raises
= TYPE_RAISES_EXCEPTIONS (t2
)))
661 rval
= build_exception_variant (rval
, raises
);
662 return build_type_attribute_variant (rval
, attributes
);
664 raises
= TYPE_RAISES_EXCEPTIONS (t1
);
665 if (p2
== NULL_TREE
|| TREE_VALUE (p2
) == void_type_node
)
667 rval
= build_function_type (valtype
, p1
);
669 rval
= build_exception_variant (rval
, raises
);
670 return build_type_attribute_variant (rval
, attributes
);
673 rval
= build_function_type (valtype
, commonparms (p1
, p2
));
674 t1
= build_exception_variant (rval
, raises
);
680 /* Get this value the long way, since TYPE_METHOD_BASETYPE
681 is just the main variant of this. */
682 tree basetype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (t2
)));
683 tree raises
= TYPE_RAISES_EXCEPTIONS (t1
);
686 /* If this was a member function type, get back to the
687 original type of type member function (i.e., without
688 the class instance variable up front. */
689 t1
= build_function_type (TREE_TYPE (t1
),
690 TREE_CHAIN (TYPE_ARG_TYPES (t1
)));
691 t2
= build_function_type (TREE_TYPE (t2
),
692 TREE_CHAIN (TYPE_ARG_TYPES (t2
)));
693 t3
= merge_types (t1
, t2
);
694 t3
= build_cplus_method_type (basetype
, TREE_TYPE (t3
),
695 TYPE_ARG_TYPES (t3
));
696 t1
= build_exception_variant (t3
, raises
);
702 return build_type_attribute_variant (t1
, attributes
);
705 /* Return the common type of two types.
706 We assume that comptypes has already been done and returned 1;
707 if that isn't so, this may crash.
709 This is the type for the result of most arithmetic operations
710 if the operands have the given two types. */
716 enum tree_code code1
;
717 enum tree_code code2
;
719 /* If one type is nonsense, bail. */
720 if (t1
== error_mark_node
|| t2
== error_mark_node
)
721 return error_mark_node
;
723 code1
= TREE_CODE (t1
);
724 code2
= TREE_CODE (t2
);
726 if ((ARITHMETIC_TYPE_P (t1
) || code1
== ENUMERAL_TYPE
727 || code1
== COMPLEX_TYPE
)
728 && (ARITHMETIC_TYPE_P (t2
) || code2
== ENUMERAL_TYPE
729 || code2
== COMPLEX_TYPE
))
730 return type_after_usual_arithmetic_conversions (t1
, t2
);
732 else if ((TYPE_PTR_P (t1
) && TYPE_PTR_P (t2
))
733 || (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
734 || (TYPE_PTRMEMFUNC_P (t1
) && TYPE_PTRMEMFUNC_P (t2
)))
735 return composite_pointer_type (t1
, t2
, error_mark_node
, error_mark_node
,
742 /* Compare two exception specifier types for exactness or subsetness, if
743 allowed. Returns 0 for mismatch, 1 for same, 2 if B is allowed by A.
745 [except.spec] "If a class X ... objects of class X or any class publicly
746 and unambigously derrived from X. Similarly, if a pointer type Y * ...
747 exceptions of type Y * or that are pointers to any type publicly and
748 unambigously derrived from Y. Otherwise a function only allows exceptions
749 that have the same type ..."
750 This does not mention cv qualifiers and is different to what throw
751 [except.throw] and catch [except.catch] will do. They will ignore the
752 top level cv qualifiers, and allow qualifiers in the pointer to class
755 We implement the letter of the standard. */
758 comp_except_types (a
, b
, exact
)
762 if (same_type_p (a
, b
))
766 if (cp_type_quals (a
) || cp_type_quals (b
))
769 if (TREE_CODE (a
) == POINTER_TYPE
770 && TREE_CODE (b
) == POINTER_TYPE
)
774 if (cp_type_quals (a
) || cp_type_quals (b
))
778 if (TREE_CODE (a
) != RECORD_TYPE
779 || TREE_CODE (b
) != RECORD_TYPE
)
782 if (ACCESSIBLY_UNIQUELY_DERIVED_P (a
, b
))
788 /* Return 1 if TYPE1 and TYPE2 are equivalent exception specifiers.
789 If EXACT is 0, T2 can be stricter than T1 (according to 15.4/7),
790 otherwise it must be exact. Exception lists are unordered, but
791 we've already filtered out duplicates. Most lists will be in order,
792 we should try to make use of that. */
795 comp_except_specs (t1
, t2
, exact
)
806 if (t1
== NULL_TREE
) /* T1 is ... */
807 return t2
== NULL_TREE
|| !exact
;
808 if (!TREE_VALUE (t1
)) /* t1 is EMPTY */
809 return t2
!= NULL_TREE
&& !TREE_VALUE (t2
);
810 if (t2
== NULL_TREE
) /* T2 is ... */
812 if (TREE_VALUE (t1
) && !TREE_VALUE (t2
)) /* T2 is EMPTY, T1 is not */
815 /* Neither set is ... or EMPTY, make sure each part of T2 is in T1.
816 Count how many we find, to determine exactness. For exact matching and
817 ordered T1, T2, this is an O(n) operation, otherwise its worst case is
819 for (base
= t1
; t2
!= NULL_TREE
; t2
= TREE_CHAIN (t2
))
821 for (probe
= base
; probe
!= NULL_TREE
; probe
= TREE_CHAIN (probe
))
823 tree a
= TREE_VALUE (probe
);
824 tree b
= TREE_VALUE (t2
);
826 if (comp_except_types (a
, b
, exact
))
828 if (probe
== base
&& exact
)
829 base
= TREE_CHAIN (probe
);
834 if (probe
== NULL_TREE
)
837 return !exact
|| base
== NULL_TREE
|| length
== list_length (t1
);
840 /* Compare the array types T1 and T2, using CMP as the type comparison
841 function for the element types. STRICT is as for comptypes. */
844 comp_array_types (cmp
, t1
, t2
, strict
)
845 register int (*cmp
) PARAMS ((tree
, tree
, int));
855 /* The type of the array elements must be the same. */
856 if (!(TREE_TYPE (t1
) == TREE_TYPE (t2
)
857 || (*cmp
) (TREE_TYPE (t1
), TREE_TYPE (t2
),
858 strict
& ~COMPARE_REDECLARATION
)))
861 d1
= TYPE_DOMAIN (t1
);
862 d2
= TYPE_DOMAIN (t2
);
867 /* If one of the arrays is dimensionless, and the other has a
868 dimension, they are of different types. However, it is valid to
876 declarations for an array object can specify
877 array types that differ by the presence or absence of a major
878 array bound (_dcl.array_). */
880 return strict
& COMPARE_REDECLARATION
;
882 /* Check that the dimensions are the same. */
883 return (cp_tree_equal (TYPE_MIN_VALUE (d1
),
885 && cp_tree_equal (TYPE_MAX_VALUE (d1
),
886 TYPE_MAX_VALUE (d2
)));
889 /* Return 1 if T1 and T2 are compatible types for assignment or
890 various other operations. STRICT is a bitwise-or of the COMPARE_*
894 comptypes (t1
, t2
, strict
)
900 int orig_strict
= strict
;
902 /* The special exemption for redeclaring array types without an
903 array bound only applies at the top level:
908 is invalid, for example. */
909 strict
&= ~COMPARE_REDECLARATION
;
911 /* Suppress errors caused by previously reported errors */
915 /* This should never happen. */
916 my_friendly_assert (t1
!= error_mark_node
, 307);
918 if (t2
== error_mark_node
)
921 /* If either type is the internal version of sizetype, return the
923 if (TREE_CODE (t1
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t1
)
924 && TYPE_DOMAIN (t1
) != 0)
925 t1
= TYPE_DOMAIN (t1
);
927 if (TREE_CODE (t2
) == INTEGER_TYPE
&& TYPE_IS_SIZETYPE (t2
)
928 && TYPE_DOMAIN (t2
) != 0)
929 t2
= TYPE_DOMAIN (t2
);
931 if (strict
& COMPARE_RELAXED
)
933 /* Treat an enum type as the unsigned integer type of the same width. */
935 if (TREE_CODE (t1
) == ENUMERAL_TYPE
)
936 t1
= c_common_type_for_size (TYPE_PRECISION (t1
), 1);
937 if (TREE_CODE (t2
) == ENUMERAL_TYPE
)
938 t2
= c_common_type_for_size (TYPE_PRECISION (t2
), 1);
944 if (TYPE_PTRMEMFUNC_P (t1
))
945 t1
= TYPE_PTRMEMFUNC_FN_TYPE (t1
);
946 if (TYPE_PTRMEMFUNC_P (t2
))
947 t2
= TYPE_PTRMEMFUNC_FN_TYPE (t2
);
949 /* TYPENAME_TYPEs should be resolved if the qualifying scope is the
950 current instantiation. */
951 if (TREE_CODE (t1
) == TYPENAME_TYPE
)
952 t1
= resolve_typename_type_in_current_instantiation (t1
);
953 if (TREE_CODE (t2
) == TYPENAME_TYPE
)
954 t2
= resolve_typename_type_in_current_instantiation (t2
);
956 /* Different classes of types can't be compatible. */
957 if (TREE_CODE (t1
) != TREE_CODE (t2
))
960 /* Qualifiers must match. */
961 if (cp_type_quals (t1
) != cp_type_quals (t2
))
963 if (strict
== COMPARE_STRICT
964 && TYPE_FOR_JAVA (t1
) != TYPE_FOR_JAVA (t2
))
967 /* Allow for two different type nodes which have essentially the same
968 definition. Note that we already checked for equality of the type
969 qualifiers (just above). */
971 if (TYPE_MAIN_VARIANT (t1
) == TYPE_MAIN_VARIANT (t2
))
974 if (strict
& COMPARE_NO_ATTRIBUTES
)
976 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
977 else if (! (attrval
= (*targetm
.comp_type_attributes
) (t1
, t2
)))
980 /* 1 if no need for warning yet, 2 if warning cause has been seen. */
983 switch (TREE_CODE (t1
))
985 case TEMPLATE_TEMPLATE_PARM
:
986 case BOUND_TEMPLATE_TEMPLATE_PARM
:
987 if (TEMPLATE_TYPE_IDX (t1
) != TEMPLATE_TYPE_IDX (t2
)
988 || TEMPLATE_TYPE_LEVEL (t1
) != TEMPLATE_TYPE_LEVEL (t2
))
990 if (! comp_template_parms
991 (DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t1
)),
992 DECL_TEMPLATE_PARMS (TEMPLATE_TEMPLATE_PARM_TEMPLATE_DECL (t2
))))
994 if (TREE_CODE (t1
) == TEMPLATE_TEMPLATE_PARM
)
996 /* Don't check inheritance. */
997 strict
= COMPARE_STRICT
;
1002 if (TYPE_TEMPLATE_INFO (t1
) && TYPE_TEMPLATE_INFO (t2
)
1003 && (TYPE_TI_TEMPLATE (t1
) == TYPE_TI_TEMPLATE (t2
)
1004 || TREE_CODE (t1
) == BOUND_TEMPLATE_TEMPLATE_PARM
))
1005 val
= comp_template_args (TYPE_TI_ARGS (t1
),
1008 if ((strict
& COMPARE_BASE
) && DERIVED_FROM_P (t1
, t2
))
1010 else if ((strict
& COMPARE_RELAXED
) && DERIVED_FROM_P (t2
, t1
))
1015 val
= (comptypes (build_pointer_type (TYPE_OFFSET_BASETYPE (t1
)),
1016 build_pointer_type (TYPE_OFFSET_BASETYPE (t2
)), strict
)
1017 && comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
), strict
));
1021 case REFERENCE_TYPE
:
1022 t1
= TREE_TYPE (t1
);
1023 t2
= TREE_TYPE (t2
);
1024 /* first, check whether the referred types match with the
1025 required level of strictness */
1026 val
= comptypes (t1
, t2
, strict
);
1029 if (TREE_CODE (t1
) == RECORD_TYPE
1030 && TREE_CODE (t2
) == RECORD_TYPE
)
1036 val
= ((TREE_TYPE (t1
) == TREE_TYPE (t2
)
1037 || comptypes (TREE_TYPE (t1
), TREE_TYPE (t2
), strict
))
1038 && compparms (TYPE_ARG_TYPES (t1
), TYPE_ARG_TYPES (t2
)));
1042 /* Target types must match incl. qualifiers. We use ORIG_STRICT
1043 here since this is the one place where
1044 COMPARE_REDECLARATION should be used. */
1045 val
= comp_array_types (comptypes
, t1
, t2
, orig_strict
);
1048 case TEMPLATE_TYPE_PARM
:
1049 return TEMPLATE_TYPE_IDX (t1
) == TEMPLATE_TYPE_IDX (t2
)
1050 && TEMPLATE_TYPE_LEVEL (t1
) == TEMPLATE_TYPE_LEVEL (t2
);
1053 if (cp_tree_equal (TYPENAME_TYPE_FULLNAME (t1
),
1054 TYPENAME_TYPE_FULLNAME (t2
)) < 1)
1056 return same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
));
1058 case UNBOUND_CLASS_TEMPLATE
:
1059 if (cp_tree_equal (TYPE_IDENTIFIER (t1
),
1060 TYPE_IDENTIFIER (t2
)) < 1)
1062 return same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
));
1065 return same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
));
1070 return attrval
== 2 && val
== 1 ? 2 : val
;
1073 /* Subroutine of comp_target-types. Make sure that the cv-quals change
1074 only in the same direction as the target type. */
1077 comp_cv_target_types (ttl
, ttr
, nptrs
)
1083 if (!at_least_as_qualified_p (ttl
, ttr
)
1084 && !at_least_as_qualified_p (ttr
, ttl
))
1085 /* The qualifications are incomparable. */
1088 if (TYPE_MAIN_VARIANT (ttl
) == TYPE_MAIN_VARIANT (ttr
))
1089 return more_qualified_p (ttr
, ttl
) ? -1 : 1;
1091 t
= comp_target_types (ttl
, ttr
, nptrs
);
1092 if ((t
== 1 && at_least_as_qualified_p (ttl
, ttr
))
1093 || (t
== -1 && at_least_as_qualified_p (ttr
, ttl
)))
1099 /* Return 1 or -1 if TTL and TTR are pointers to types that are equivalent,
1100 ignoring their qualifiers, 0 if not. Return 1 means that TTR can be
1101 converted to TTL. Return -1 means that TTL can be converted to TTR but
1104 NPTRS is the number of pointers we can strip off and keep cool.
1105 This is used to permit (for aggr A, aggr B) A, B* to convert to A*,
1106 but to not permit B** to convert to A**.
1108 This should go away. Callers should use can_convert or something
1109 similar instead. (jason 17 Apr 1997) */
1112 comp_target_types (ttl
, ttr
, nptrs
)
1116 ttl
= TYPE_MAIN_VARIANT (ttl
);
1117 ttr
= TYPE_MAIN_VARIANT (ttr
);
1118 if (same_type_p (ttl
, ttr
))
1121 if (TREE_CODE (ttr
) != TREE_CODE (ttl
))
1124 if ((TREE_CODE (ttr
) == POINTER_TYPE
1125 || TREE_CODE (ttr
) == REFERENCE_TYPE
)
1126 /* If we get a pointer with nptrs == 0, we don't allow any tweaking
1127 of the type pointed to. This is necessary for reference init
1128 semantics. We won't get here from a previous call with nptrs == 1;
1129 for multi-level pointers we end up in comp_ptr_ttypes. */
1132 int is_ptr
= TREE_CODE (ttr
) == POINTER_TYPE
;
1134 ttl
= TREE_TYPE (ttl
);
1135 ttr
= TREE_TYPE (ttr
);
1139 if (TREE_CODE (ttl
) == UNKNOWN_TYPE
1140 || TREE_CODE (ttr
) == UNKNOWN_TYPE
)
1142 else if (TREE_CODE (ttl
) == VOID_TYPE
1143 && TREE_CODE (ttr
) != FUNCTION_TYPE
1144 && TREE_CODE (ttr
) != METHOD_TYPE
1145 && TREE_CODE (ttr
) != OFFSET_TYPE
)
1147 else if (TREE_CODE (ttr
) == VOID_TYPE
1148 && TREE_CODE (ttl
) != FUNCTION_TYPE
1149 && TREE_CODE (ttl
) != METHOD_TYPE
1150 && TREE_CODE (ttl
) != OFFSET_TYPE
)
1152 else if (TREE_CODE (ttl
) == POINTER_TYPE
1153 || TREE_CODE (ttl
) == ARRAY_TYPE
)
1155 if (comp_ptr_ttypes (ttl
, ttr
))
1157 else if (comp_ptr_ttypes (ttr
, ttl
))
1163 /* Const and volatile mean something different for function types,
1164 so the usual checks are not appropriate. */
1165 if (TREE_CODE (ttl
) == FUNCTION_TYPE
|| TREE_CODE (ttl
) == METHOD_TYPE
)
1166 return comp_target_types (ttl
, ttr
, nptrs
- 1);
1168 return comp_cv_target_types (ttl
, ttr
, nptrs
- 1);
1171 if (TREE_CODE (ttr
) == ARRAY_TYPE
)
1172 return comp_array_types (comp_target_types
, ttl
, ttr
, COMPARE_STRICT
);
1173 else if (TREE_CODE (ttr
) == FUNCTION_TYPE
|| TREE_CODE (ttr
) == METHOD_TYPE
)
1180 if (!same_type_p (TREE_TYPE (ttl
), TREE_TYPE (ttr
)))
1185 switch (comp_target_types (TREE_TYPE (ttl
), TREE_TYPE (ttr
), -1))
1194 argsl
= TYPE_ARG_TYPES (ttl
);
1195 argsr
= TYPE_ARG_TYPES (ttr
);
1197 /* Compare 'this' here, not in comp_target_parms. */
1198 if (TREE_CODE (ttr
) == METHOD_TYPE
)
1200 tree tl
= TYPE_METHOD_BASETYPE (ttl
);
1201 tree tr
= TYPE_METHOD_BASETYPE (ttr
);
1203 if (!same_or_base_type_p (tr
, tl
))
1205 if (same_or_base_type_p (tl
, tr
))
1211 argsl
= TREE_CHAIN (argsl
);
1212 argsr
= TREE_CHAIN (argsr
);
1215 switch (comp_target_parms (argsl
, argsr
))
1223 return saw_contra
? -1 : 1;
1226 else if (TREE_CODE (ttr
) == OFFSET_TYPE
)
1230 /* Contravariance: we can assign a pointer to base member to a pointer
1231 to derived member. Note difference from simple pointer case, where
1232 we can pass a pointer to derived to a pointer to base. */
1233 if (same_or_base_type_p (TYPE_OFFSET_BASETYPE (ttr
),
1234 TYPE_OFFSET_BASETYPE (ttl
)))
1236 else if (same_or_base_type_p (TYPE_OFFSET_BASETYPE (ttl
),
1237 TYPE_OFFSET_BASETYPE (ttr
)))
1247 ttl
= TREE_TYPE (ttl
);
1248 ttr
= TREE_TYPE (ttr
);
1250 if (TREE_CODE (ttl
) == POINTER_TYPE
1251 || TREE_CODE (ttl
) == ARRAY_TYPE
)
1253 if (comp_ptr_ttypes (ttl
, ttr
))
1259 if (comp_cv_target_types (ttl
, ttr
, nptrs
) == 1)
1264 else if (IS_AGGR_TYPE (ttl
))
1268 if (same_or_base_type_p (build_pointer_type (ttl
),
1269 build_pointer_type (ttr
)))
1271 if (same_or_base_type_p (build_pointer_type (ttr
),
1272 build_pointer_type (ttl
)))
1280 /* Returns 1 if TYPE1 is at least as qualified as TYPE2. */
1283 at_least_as_qualified_p (type1
, type2
)
1287 /* All qualifiers for TYPE2 must also appear in TYPE1. */
1288 return ((cp_type_quals (type1
) & cp_type_quals (type2
))
1289 == cp_type_quals (type2
));
1292 /* Returns 1 if TYPE1 is more qualified than TYPE2. */
1295 more_qualified_p (type1
, type2
)
1299 return (cp_type_quals (type1
) != cp_type_quals (type2
)
1300 && at_least_as_qualified_p (type1
, type2
));
1303 /* Returns 1 if TYPE1 is more cv-qualified than TYPE2, -1 if TYPE2 is
1304 more cv-qualified that TYPE1, and 0 otherwise. */
1307 comp_cv_qualification (type1
, type2
)
1311 if (cp_type_quals (type1
) == cp_type_quals (type2
))
1314 if (at_least_as_qualified_p (type1
, type2
))
1317 else if (at_least_as_qualified_p (type2
, type1
))
1323 /* Returns 1 if the cv-qualification signature of TYPE1 is a proper
1324 subset of the cv-qualification signature of TYPE2, and the types
1325 are similar. Returns -1 if the other way 'round, and 0 otherwise. */
1328 comp_cv_qual_signature (type1
, type2
)
1332 if (comp_ptr_ttypes_real (type2
, type1
, -1))
1334 else if (comp_ptr_ttypes_real (type1
, type2
, -1))
1340 /* If two types share a common base type, return that basetype.
1341 If there is not a unique most-derived base type, this function
1342 returns ERROR_MARK_NODE. */
1345 common_base_type (tt1
, tt2
)
1348 tree best
= NULL_TREE
;
1351 /* If one is a baseclass of another, that's good enough. */
1352 if (UNIQUELY_DERIVED_FROM_P (tt1
, tt2
))
1354 if (UNIQUELY_DERIVED_FROM_P (tt2
, tt1
))
1357 /* Otherwise, try to find a unique baseclass of TT1
1358 that is shared by TT2, and follow that down. */
1359 for (i
= CLASSTYPE_N_BASECLASSES (tt1
)-1; i
>= 0; i
--)
1361 tree basetype
= TYPE_BINFO_BASETYPE (tt1
, i
);
1362 tree trial
= common_base_type (basetype
, tt2
);
1365 if (trial
== error_mark_node
)
1367 if (best
== NULL_TREE
)
1369 else if (best
!= trial
)
1370 return error_mark_node
;
1375 for (i
= CLASSTYPE_N_BASECLASSES (tt2
)-1; i
>= 0; i
--)
1377 tree basetype
= TYPE_BINFO_BASETYPE (tt2
, i
);
1378 tree trial
= common_base_type (tt1
, basetype
);
1381 if (trial
== error_mark_node
)
1383 if (best
== NULL_TREE
)
1385 else if (best
!= trial
)
1386 return error_mark_node
;
1392 /* Subroutines of `comptypes'. */
1394 /* Return 1 if two parameter type lists PARMS1 and PARMS2 are
1395 equivalent in the sense that functions with those parameter types
1396 can have equivalent types. The two lists must be equivalent,
1399 C++: See comment above about TYPE1, TYPE2. */
1402 compparms (parms1
, parms2
)
1403 tree parms1
, parms2
;
1405 register tree t1
= parms1
, t2
= parms2
;
1407 /* An unspecified parmlist matches any specified parmlist
1408 whose argument types don't need default promotions. */
1412 if (t1
== 0 && t2
== 0)
1414 /* If one parmlist is shorter than the other,
1415 they fail to match. */
1416 if (t1
== 0 || t2
== 0)
1418 if (!same_type_p (TREE_VALUE (t2
), TREE_VALUE (t1
)))
1421 t1
= TREE_CHAIN (t1
);
1422 t2
= TREE_CHAIN (t2
);
1426 /* This really wants return whether or not parameter type lists
1427 would make their owning functions assignment compatible or not.
1429 The return value is like for comp_target_types.
1431 This should go away, possibly with the exception of the empty parmlist
1432 conversion; there are no conversions between function types in C++.
1433 (jason 17 Apr 1997) */
1436 comp_target_parms (parms1
, parms2
)
1437 tree parms1
, parms2
;
1439 register tree t1
= parms1
, t2
= parms2
;
1440 int warn_contravariance
= 0;
1442 /* In C, an unspecified parmlist matches any specified parmlist
1443 whose argument types don't need default promotions. This is not
1444 true for C++, but let's do it anyway for unfixed headers. */
1446 if (t1
== 0 && t2
!= 0)
1448 pedwarn ("ISO C++ prohibits conversion from `%#T' to `(...)'",
1450 return self_promoting_args_p (t2
);
1453 return self_promoting_args_p (t1
);
1455 for (; t1
|| t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
1459 /* If one parmlist is shorter than the other,
1460 they fail to match, unless STRICT is <= 0. */
1461 if (t1
== 0 || t2
== 0)
1463 p1
= TREE_VALUE (t1
);
1464 p2
= TREE_VALUE (t2
);
1465 if (same_type_p (p1
, p2
))
1471 if ((TREE_CODE (p1
) == POINTER_TYPE
&& TREE_CODE (p2
) == POINTER_TYPE
)
1472 || (TREE_CODE (p1
) == REFERENCE_TYPE
1473 && TREE_CODE (p2
) == REFERENCE_TYPE
))
1475 /* The following is wrong for contravariance,
1476 but many programs depend on it. */
1477 if (TREE_TYPE (p1
) == void_type_node
)
1479 if (TREE_TYPE (p2
) == void_type_node
)
1481 warn_contravariance
= 1;
1484 if (IS_AGGR_TYPE (TREE_TYPE (p1
))
1485 && !same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (p1
),
1489 /* Note backwards order due to contravariance. */
1490 if (comp_target_types (p2
, p1
, 1) <= 0)
1492 if (comp_target_types (p1
, p2
, 1) > 0)
1494 warn_contravariance
= 1;
1500 return warn_contravariance
? -1 : 1;
1504 cxx_sizeof_or_alignof_type (type
, op
, complain
)
1509 enum tree_code type_code
;
1511 const char *op_name
;
1513 my_friendly_assert (op
== SIZEOF_EXPR
|| op
== ALIGNOF_EXPR
, 20020720);
1514 if (processing_template_decl
)
1515 return build_min_nt (op
, type
);
1517 op_name
= operator_name_info
[(int) op
].name
;
1519 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1520 type
= TREE_TYPE (type
);
1521 type_code
= TREE_CODE (type
);
1523 if (type_code
== METHOD_TYPE
)
1525 if (complain
&& (pedantic
|| warn_pointer_arith
))
1526 pedwarn ("invalid application of `%s' to a member function", op_name
);
1527 value
= size_one_node
;
1529 else if (type_code
== OFFSET_TYPE
)
1532 error ("invalid application of `%s' to non-static member", op_name
);
1533 value
= size_zero_node
;
1536 value
= c_sizeof_or_alignof_type (complete_type (type
), op
, complain
);
1545 if (processing_template_decl
)
1546 return build_min_nt (SIZEOF_EXPR
, e
);
1548 if (TREE_CODE (e
) == COMPONENT_REF
1549 && DECL_C_BIT_FIELD (TREE_OPERAND (e
, 1)))
1550 error ("sizeof applied to a bit-field");
1551 if (is_overloaded_fn (e
))
1553 pedwarn ("ISO C++ forbids applying `sizeof' to an expression of function type");
1554 return c_sizeof (char_type_node
);
1556 else if (type_unknown_p (e
))
1558 cxx_incomplete_type_error (e
, TREE_TYPE (e
));
1559 return c_sizeof (char_type_node
);
1561 /* It's invalid to say `sizeof (X::i)' for `i' a non-static data
1562 member unless you're in a non-static member of X. So hand off to
1563 resolve_offset_ref. [expr.prim] */
1564 else if (TREE_CODE (e
) == OFFSET_REF
)
1565 e
= resolve_offset_ref (e
);
1567 if (e
== error_mark_node
)
1570 return cxx_sizeof (TREE_TYPE (e
));
1574 /* Perform the array-to-pointer and function-to-pointer conversions
1577 In addition, references are converted to lvalues and manifest
1578 constants are replaced by their values. */
1581 decay_conversion (exp
)
1585 register enum tree_code code
;
1587 if (TREE_CODE (exp
) == OFFSET_REF
)
1588 exp
= resolve_offset_ref (exp
);
1590 type
= TREE_TYPE (exp
);
1591 code
= TREE_CODE (type
);
1593 if (code
== REFERENCE_TYPE
)
1595 exp
= convert_from_reference (exp
);
1596 type
= TREE_TYPE (exp
);
1597 code
= TREE_CODE (type
);
1600 if (type
== error_mark_node
)
1601 return error_mark_node
;
1603 if (type_unknown_p (exp
))
1605 cxx_incomplete_type_error (exp
, TREE_TYPE (exp
));
1606 return error_mark_node
;
1609 /* Constants can be used directly unless they're not loadable. */
1610 if (TREE_CODE (exp
) == CONST_DECL
)
1611 exp
= DECL_INITIAL (exp
);
1612 /* Replace a nonvolatile const static variable with its value. We
1613 don't do this for arrays, though; we want the address of the
1614 first element of the array, not the address of the first element
1615 of its initializing constant. */
1616 else if (code
!= ARRAY_TYPE
)
1618 exp
= decl_constant_value (exp
);
1619 type
= TREE_TYPE (exp
);
1622 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
1623 Leave such NOP_EXPRs, since RHS is being used in non-lvalue context. */
1625 if (code
== VOID_TYPE
)
1627 error ("void value not ignored as it ought to be");
1628 return error_mark_node
;
1630 if (code
== METHOD_TYPE
)
1632 if (code
== FUNCTION_TYPE
|| is_overloaded_fn (exp
))
1633 return build_unary_op (ADDR_EXPR
, exp
, 0);
1634 if (code
== ARRAY_TYPE
)
1639 if (TREE_CODE (exp
) == INDIRECT_REF
)
1641 /* Stripping away the INDIRECT_REF is not the right
1642 thing to do for references... */
1643 tree inner
= TREE_OPERAND (exp
, 0);
1644 if (TREE_CODE (TREE_TYPE (inner
)) == REFERENCE_TYPE
)
1646 inner
= build1 (CONVERT_EXPR
,
1647 build_pointer_type (TREE_TYPE
1648 (TREE_TYPE (inner
))),
1650 TREE_CONSTANT (inner
) = TREE_CONSTANT (TREE_OPERAND (inner
, 0));
1652 return cp_convert (build_pointer_type (TREE_TYPE (type
)), inner
);
1655 if (TREE_CODE (exp
) == COMPOUND_EXPR
)
1657 tree op1
= decay_conversion (TREE_OPERAND (exp
, 1));
1658 return build (COMPOUND_EXPR
, TREE_TYPE (op1
),
1659 TREE_OPERAND (exp
, 0), op1
);
1663 && ! (TREE_CODE (exp
) == CONSTRUCTOR
&& TREE_STATIC (exp
)))
1665 error ("invalid use of non-lvalue array");
1666 return error_mark_node
;
1669 ptrtype
= build_pointer_type (TREE_TYPE (type
));
1671 if (TREE_CODE (exp
) == VAR_DECL
)
1673 /* ??? This is not really quite correct
1674 in that the type of the operand of ADDR_EXPR
1675 is not the target type of the type of the ADDR_EXPR itself.
1676 Question is, can this lossage be avoided? */
1677 adr
= build1 (ADDR_EXPR
, ptrtype
, exp
);
1678 if (!cxx_mark_addressable (exp
))
1679 return error_mark_node
;
1680 TREE_CONSTANT (adr
) = staticp (exp
);
1681 TREE_SIDE_EFFECTS (adr
) = 0; /* Default would be, same as EXP. */
1684 /* This way is better for a COMPONENT_REF since it can
1685 simplify the offset for a component. */
1686 adr
= build_unary_op (ADDR_EXPR
, exp
, 1);
1687 return cp_convert (ptrtype
, adr
);
1690 /* [basic.lval]: Class rvalues can have cv-qualified types; non-class
1691 rvalues always have cv-unqualified types. */
1692 if (! CLASS_TYPE_P (type
))
1693 exp
= cp_convert (TYPE_MAIN_VARIANT (type
), exp
);
1699 default_conversion (exp
)
1703 enum tree_code code
;
1705 exp
= decay_conversion (exp
);
1707 type
= TREE_TYPE (exp
);
1708 code
= TREE_CODE (type
);
1710 if (INTEGRAL_CODE_P (code
))
1712 tree t
= type_promotes_to (type
);
1714 return cp_convert (t
, exp
);
1720 /* Take the address of an inline function without setting TREE_ADDRESSABLE
1724 inline_conversion (exp
)
1727 if (TREE_CODE (exp
) == FUNCTION_DECL
)
1728 exp
= build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (exp
)), exp
);
1733 /* Returns nonzero iff exp is a STRING_CST or the result of applying
1734 decay_conversion to one. */
1737 string_conv_p (totype
, exp
, warn
)
1743 if (! flag_const_strings
|| TREE_CODE (totype
) != POINTER_TYPE
)
1746 t
= TREE_TYPE (totype
);
1747 if (!same_type_p (t
, char_type_node
)
1748 && !same_type_p (t
, wchar_type_node
))
1751 if (TREE_CODE (exp
) == STRING_CST
)
1753 /* Make sure that we don't try to convert between char and wchar_t. */
1754 if (!same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (exp
))), t
))
1759 /* Is this a string constant which has decayed to 'const char *'? */
1760 t
= build_pointer_type (build_qualified_type (t
, TYPE_QUAL_CONST
));
1761 if (!same_type_p (TREE_TYPE (exp
), t
))
1764 if (TREE_CODE (exp
) != ADDR_EXPR
1765 || TREE_CODE (TREE_OPERAND (exp
, 0)) != STRING_CST
)
1769 /* This warning is not very useful, as it complains about printf. */
1770 if (warn
&& warn_write_strings
)
1771 warning ("deprecated conversion from string constant to `%T'", totype
);
1776 /* Given a COND_EXPR, MIN_EXPR, or MAX_EXPR in T, return it in a form that we
1777 can, for example, use as an lvalue. This code used to be in
1778 unary_complex_lvalue, but we needed it to deal with `a = (d == c) ? b : c'
1779 expressions, where we're dealing with aggregates. But now it's again only
1780 called from unary_complex_lvalue. The case (in particular) that led to
1781 this was with CODE == ADDR_EXPR, since it's not an lvalue when we'd
1785 rationalize_conditional_expr (code
, t
)
1786 enum tree_code code
;
1789 /* For MIN_EXPR or MAX_EXPR, fold-const.c has arranged things so that
1790 the first operand is always the one to be used if both operands
1791 are equal, so we know what conditional expression this used to be. */
1792 if (TREE_CODE (t
) == MIN_EXPR
|| TREE_CODE (t
) == MAX_EXPR
)
1795 build_conditional_expr (build_x_binary_op ((TREE_CODE (t
) == MIN_EXPR
1796 ? LE_EXPR
: GE_EXPR
),
1797 TREE_OPERAND (t
, 0),
1798 TREE_OPERAND (t
, 1)),
1799 build_unary_op (code
, TREE_OPERAND (t
, 0), 0),
1800 build_unary_op (code
, TREE_OPERAND (t
, 1), 0));
1804 build_conditional_expr (TREE_OPERAND (t
, 0),
1805 build_unary_op (code
, TREE_OPERAND (t
, 1), 0),
1806 build_unary_op (code
, TREE_OPERAND (t
, 2), 0));
1809 /* Given the TYPE of an anonymous union field inside T, return the
1810 FIELD_DECL for the field. If not found return NULL_TREE. Because
1811 anonymous unions can nest, we must also search all anonymous unions
1812 that are directly reachable. */
1815 lookup_anon_field (t
, type
)
1820 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
1822 if (TREE_STATIC (field
))
1824 if (TREE_CODE (field
) != FIELD_DECL
|| DECL_ARTIFICIAL (field
))
1827 /* If we find it directly, return the field. */
1828 if (DECL_NAME (field
) == NULL_TREE
1829 && type
== TYPE_MAIN_VARIANT (TREE_TYPE (field
)))
1834 /* Otherwise, it could be nested, search harder. */
1835 if (DECL_NAME (field
) == NULL_TREE
1836 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
1838 tree subfield
= lookup_anon_field (TREE_TYPE (field
), type
);
1846 /* Build an expression representing OBJECT.MEMBER. OBJECT is an
1847 expression; MEMBER is a DECL or baselink. If ACCESS_PATH is
1848 non-NULL, it indicates the path to the base used to name MEMBER.
1849 If PRESERVE_REFERENCE is true, the expression returned will have
1850 REFERENCE_TYPE if the MEMBER does. Otherwise, the expression
1851 returned will have the type referred to by the reference.
1853 This function does not perform access control; that is either done
1854 earlier by the parser when the name of MEMBER is resolved to MEMBER
1855 itself, or later when overload resolution selects one of the
1856 functions indicated by MEMBER. */
1859 build_class_member_access_expr (tree object
, tree member
,
1860 tree access_path
, bool preserve_reference
)
1864 tree result
= NULL_TREE
;
1866 if (object
== error_mark_node
|| member
== error_mark_node
)
1867 return error_mark_node
;
1869 if (TREE_CODE (member
) == PSEUDO_DTOR_EXPR
)
1872 my_friendly_assert (DECL_P (member
) || BASELINK_P (member
),
1877 The type of the first expression shall be "class object" (of a
1879 object_type
= TREE_TYPE (object
);
1880 if (!complete_type_or_else (object_type
, object
))
1881 return error_mark_node
;
1882 if (!CLASS_TYPE_P (object_type
))
1884 error ("request for member `%D' in `%E', which is of non-class type `%T'",
1885 member
, object
, object_type
);
1886 return error_mark_node
;
1889 /* The standard does not seem to actually say that MEMBER must be a
1890 member of OBJECT_TYPE. However, that is clearly what is
1892 if (DECL_P (member
))
1894 member_scope
= DECL_CLASS_CONTEXT (member
);
1896 if (TREE_DEPRECATED (member
))
1897 warn_deprecated_use (member
);
1900 member_scope
= BINFO_TYPE (BASELINK_BINFO (member
));
1901 /* If MEMBER is from an anonymous aggregate, MEMBER_SCOPE will
1902 presently be the anonymous union. Go outwards until we find a
1903 type related to OBJECT_TYPE. */
1904 while (ANON_AGGR_TYPE_P (member_scope
)
1905 && !same_type_ignoring_top_level_qualifiers_p (member_scope
,
1907 member_scope
= TYPE_CONTEXT (member_scope
);
1908 if (!member_scope
|| !DERIVED_FROM_P (member_scope
, object_type
))
1910 error ("`%D' is not a member of `%T'", member
, object_type
);
1911 return error_mark_node
;
1914 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x' into
1915 `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only an lvalue
1916 in the frontend; only _DECLs and _REFs are lvalues in the backend. */
1918 tree temp
= unary_complex_lvalue (ADDR_EXPR
, object
);
1920 object
= build_indirect_ref (temp
, NULL
);
1923 /* In [expr.ref], there is an explicit list of the valid choices for
1924 MEMBER. We check for each of those cases here. */
1925 if (TREE_CODE (member
) == VAR_DECL
)
1927 /* A static data member. */
1929 /* If OBJECT has side-effects, they are supposed to occur. */
1930 if (TREE_SIDE_EFFECTS (object
))
1931 result
= build (COMPOUND_EXPR
, TREE_TYPE (result
), object
, result
);
1933 else if (TREE_CODE (member
) == FIELD_DECL
)
1935 /* A non-static data member. */
1940 null_object_p
= (TREE_CODE (object
) == INDIRECT_REF
1941 && integer_zerop (TREE_OPERAND (object
, 0)));
1943 /* Convert OBJECT to the type of MEMBER. */
1944 if (!same_type_p (TYPE_MAIN_VARIANT (object_type
),
1945 TYPE_MAIN_VARIANT (member_scope
)))
1950 binfo
= lookup_base (access_path
? access_path
: object_type
,
1951 member_scope
, ba_ignore
, &kind
);
1952 if (binfo
== error_mark_node
)
1953 return error_mark_node
;
1955 /* It is invalid to try to get to a virtual base of a
1956 NULL object. The most common cause is invalid use of
1958 if (null_object_p
&& kind
== bk_via_virtual
)
1960 error ("invalid access to non-static data member `%D' of NULL object",
1962 error ("(perhaps the `offsetof' macro was used incorrectly)");
1963 return error_mark_node
;
1966 /* Convert to the base. */
1967 object
= build_base_path (PLUS_EXPR
, object
, binfo
,
1969 /* If we found the base successfully then we should be able
1970 to convert to it successfully. */
1971 my_friendly_assert (object
!= error_mark_node
,
1975 /* Complain about other invalid uses of offsetof, even though they will
1976 give the right answer. Note that we complain whether or not they
1977 actually used the offsetof macro, since there's no way to know at this
1978 point. So we just give a warning, instead of a pedwarn. */
1979 if (null_object_p
&& CLASSTYPE_NON_POD_P (object_type
))
1981 warning ("invalid access to non-static data member `%D' of NULL object",
1983 warning ("(perhaps the `offsetof' macro was used incorrectly)");
1986 /* If MEMBER is from an anonymous aggregate, we have converted
1987 OBJECT so that it refers to the class containing the
1988 anonymous union. Generate a reference to the anonymous union
1989 itself, and recur to find MEMBER. */
1990 if (ANON_AGGR_TYPE_P (DECL_CONTEXT (member
))
1991 /* When this code is called from build_field_call, the
1992 object already has the type of the anonymous union.
1993 That is because the COMPONENT_REF was already
1994 constructed, and was then disassembled before calling
1995 build_field_call. After the function-call code is
1996 cleaned up, this waste can be eliminated. */
1997 && (!same_type_ignoring_top_level_qualifiers_p
1998 (TREE_TYPE (object
), DECL_CONTEXT (member
))))
2000 tree anonymous_union
;
2002 anonymous_union
= lookup_anon_field (TREE_TYPE (object
),
2003 DECL_CONTEXT (member
));
2004 object
= build_class_member_access_expr (object
,
2006 /*access_path=*/NULL_TREE
,
2007 preserve_reference
);
2010 /* Compute the type of the field, as described in [expr.ref]. */
2011 type_quals
= TYPE_UNQUALIFIED
;
2012 member_type
= TREE_TYPE (member
);
2013 if (TREE_CODE (member_type
) != REFERENCE_TYPE
)
2015 type_quals
= (cp_type_quals (member_type
)
2016 | cp_type_quals (object_type
));
2018 /* A field is const (volatile) if the enclosing object, or the
2019 field itself, is const (volatile). But, a mutable field is
2020 not const, even within a const object. */
2021 if (DECL_MUTABLE_P (member
))
2022 type_quals
&= ~TYPE_QUAL_CONST
;
2023 member_type
= cp_build_qualified_type (member_type
, type_quals
);
2026 result
= fold (build (COMPONENT_REF
, member_type
, object
, member
));
2028 /* Mark the expression const or volatile, as appropriate. Even
2029 though we've dealt with the type above, we still have to mark the
2030 expression itself. */
2031 if (type_quals
& TYPE_QUAL_CONST
)
2032 TREE_READONLY (result
) = 1;
2033 else if (type_quals
& TYPE_QUAL_VOLATILE
)
2034 TREE_THIS_VOLATILE (result
) = 1;
2036 else if (BASELINK_P (member
))
2038 /* The member is a (possibly overloaded) member function. */
2042 /* If the MEMBER is exactly one static member function, then we
2043 know the type of the expression. Otherwise, we must wait
2044 until overload resolution has been performed. */
2045 functions
= BASELINK_FUNCTIONS (member
);
2046 if (TREE_CODE (functions
) == FUNCTION_DECL
2047 && DECL_STATIC_FUNCTION_P (functions
))
2048 type
= TREE_TYPE (functions
);
2050 type
= unknown_type_node
;
2051 /* Note that we do not convert OBJECT to the BASELINK_BINFO
2052 base. That will happen when the function is called. */
2053 result
= build (COMPONENT_REF
, type
, object
, member
);
2055 else if (TREE_CODE (member
) == CONST_DECL
)
2057 /* The member is an enumerator. */
2059 /* If OBJECT has side-effects, they are supposed to occur. */
2060 if (TREE_SIDE_EFFECTS (object
))
2061 result
= build (COMPOUND_EXPR
, TREE_TYPE (result
),
2066 error ("invalid use of `%D'", member
);
2067 return error_mark_node
;
2070 if (!preserve_reference
)
2073 If E2 is declared to have type "reference to T", then ... the
2074 type of E1.E2 is T. */
2075 result
= convert_from_reference (result
);
2080 /* Return the destructor denoted by OBJECT.SCOPE::~DTOR_NAME, or, if
2081 SCOPE is NULL, by OBJECT.~DTOR_NAME. */
2084 lookup_destructor (tree object
, tree scope
, tree dtor_name
)
2086 tree object_type
= TREE_TYPE (object
);
2087 tree dtor_type
= TREE_OPERAND (dtor_name
, 0);
2089 if (scope
&& !check_dtor_name (scope
, dtor_name
))
2091 error ("qualified type `%T' does not match destructor name `~%T'",
2093 return error_mark_node
;
2095 if (!same_type_p (dtor_type
, TYPE_MAIN_VARIANT (object_type
)))
2097 error ("destructor name `%T' does not match type `%T' of expression",
2098 dtor_type
, object_type
);
2099 return error_mark_node
;
2101 if (!TYPE_HAS_DESTRUCTOR (object_type
))
2102 return build (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
,
2104 return lookup_member (object_type
, complete_dtor_identifier
,
2105 /*protect=*/1, /*want_type=*/false);
2108 /* This function is called by the parser to process a class member
2109 access expression of the form OBJECT.NAME. NAME is a node used by
2110 the parser to represent a name; it is not yet a DECL. It may,
2111 however, be a BASELINK where the BASELINK_FUNCTIONS is a
2112 TEMPLATE_ID_EXPR. Templates must be looked up by the parser, and
2113 there is no reason to do the lookup twice, so the parser keeps the
2117 finish_class_member_access_expr (tree object
, tree name
)
2121 tree access_path
= NULL_TREE
;
2123 if (object
== error_mark_node
|| name
== error_mark_node
)
2124 return error_mark_node
;
2126 if (processing_template_decl
)
2127 return build_min_nt (COMPONENT_REF
, object
, name
);
2129 if (TREE_CODE (object
) == OFFSET_REF
)
2130 object
= resolve_offset_ref (object
);
2132 object_type
= TREE_TYPE (object
);
2133 if (TREE_CODE (object_type
) == REFERENCE_TYPE
)
2135 object
= convert_from_reference (object
);
2136 object_type
= TREE_TYPE (object
);
2141 The type of the first expression shall be "class object" (of a
2143 if (!complete_type_or_else (object_type
, object
))
2144 return error_mark_node
;
2145 if (!CLASS_TYPE_P (object_type
))
2147 error ("request for member `%D' in `%E', which is of non-class type `%T'",
2148 name
, object
, object_type
);
2149 return error_mark_node
;
2152 if (BASELINK_P (name
))
2154 /* A member function that has already been looked up. */
2155 my_friendly_assert ((TREE_CODE (BASELINK_FUNCTIONS (name
))
2156 == TEMPLATE_ID_EXPR
),
2162 bool is_template_id
= false;
2163 tree template_args
= NULL_TREE
;
2165 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
2167 is_template_id
= true;
2168 template_args
= TREE_OPERAND (name
, 1);
2169 name
= TREE_OPERAND (name
, 0);
2172 if (TREE_CODE (name
) == SCOPE_REF
)
2176 /* A qualified name. The qualifying class or namespace `S' has
2177 already been looked up; it is either a TYPE or a
2178 NAMESPACE_DECL. The member name is either an IDENTIFIER_NODE
2179 or a BIT_NOT_EXPR. */
2180 scope
= TREE_OPERAND (name
, 0);
2181 name
= TREE_OPERAND (name
, 1);
2182 my_friendly_assert ((CLASS_TYPE_P (scope
)
2183 || TREE_CODE (scope
) == NAMESPACE_DECL
),
2185 my_friendly_assert ((TREE_CODE (name
) == IDENTIFIER_NODE
2186 || TREE_CODE (name
) == BIT_NOT_EXPR
),
2189 /* If SCOPE is a namespace, then the qualified name does not
2190 name a member of OBJECT_TYPE. */
2191 if (TREE_CODE (scope
) == NAMESPACE_DECL
)
2193 error ("`%D::%D' is not a member of `%T'",
2194 scope
, name
, object_type
);
2195 return error_mark_node
;
2198 /* Find the base of OBJECT_TYPE corresponding to SCOPE. */
2199 access_path
= lookup_base (object_type
, scope
, ba_check
, NULL
);
2200 if (!access_path
|| access_path
== error_mark_node
)
2201 return error_mark_node
;
2203 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2204 member
= lookup_destructor (object
, scope
, name
);
2207 /* Look up the member. */
2208 member
= lookup_member (access_path
, name
, /*protect=*/1,
2209 /*want_type=*/false);
2210 if (member
== NULL_TREE
)
2212 error ("'%D' has no member named '%E'", object_type
, name
);
2213 return error_mark_node
;
2215 if (member
== error_mark_node
)
2216 return error_mark_node
;
2219 else if (TREE_CODE (name
) == BIT_NOT_EXPR
)
2220 member
= lookup_destructor (object
, /*scope=*/NULL_TREE
, name
);
2221 else if (TREE_CODE (name
) == IDENTIFIER_NODE
)
2223 /* An unqualified name. */
2224 member
= lookup_member (object_type
, name
, /*protect=*/1,
2225 /*want_type=*/false);
2226 if (member
== NULL_TREE
)
2228 error ("'%D' has no member named '%E'", object_type
, name
);
2229 return error_mark_node
;
2231 else if (member
== error_mark_node
)
2232 return error_mark_node
;
2236 /* The YACC parser sometimes gives us things that are not names.
2237 These always indicate errors. The recursive-descent parser
2238 does not do this, so this code can go away once that parser
2239 replaces the YACC parser. */
2240 error ("invalid use of `%D'", name
);
2241 return error_mark_node
;
2246 tree
template = member
;
2248 if (BASELINK_P (template))
2249 BASELINK_FUNCTIONS (template)
2250 = build_nt (TEMPLATE_ID_EXPR
,
2251 BASELINK_FUNCTIONS (template),
2255 error ("`%D' is not a member template function", name
);
2256 return error_mark_node
;
2261 if (TREE_DEPRECATED (member
))
2262 warn_deprecated_use (member
);
2264 return build_class_member_access_expr (object
, member
, access_path
,
2265 /*preserve_reference=*/false);
2268 /* Return an expression for the MEMBER_NAME field in the internal
2269 representation of PTRMEM, a pointer-to-member function. (Each
2270 pointer-to-member function type gets its own RECORD_TYPE so it is
2271 more convenient to access the fields by name than by FIELD_DECL.)
2272 This routine converts the NAME to a FIELD_DECL and then creates the
2273 node for the complete expression. */
2276 build_ptrmemfunc_access_expr (tree ptrmem
, tree member_name
)
2282 /* This code is a stripped down version of
2283 build_class_member_access_expr. It does not work to use that
2284 routine directly because it expects the object to be of class
2286 ptrmem_type
= TREE_TYPE (ptrmem
);
2287 my_friendly_assert (TYPE_PTRMEMFUNC_P (ptrmem_type
), 20020804);
2288 member
= lookup_member (ptrmem_type
, member_name
, /*protect=*/0,
2289 /*want_type=*/false);
2290 member_type
= cp_build_qualified_type (TREE_TYPE (member
),
2291 cp_type_quals (ptrmem_type
));
2292 return fold (build (COMPONENT_REF
, member_type
, ptrmem
, member
));
2295 /* Given an expression PTR for a pointer, return an expression
2296 for the value pointed to.
2297 ERRORSTRING is the name of the operator to appear in error messages.
2299 This function may need to overload OPERATOR_FNNAME.
2300 Must also handle REFERENCE_TYPEs for C++. */
2303 build_x_indirect_ref (ptr
, errorstring
)
2305 const char *errorstring
;
2309 if (processing_template_decl
)
2310 return build_min_nt (INDIRECT_REF
, ptr
);
2312 rval
= build_new_op (INDIRECT_REF
, LOOKUP_NORMAL
, ptr
, NULL_TREE
,
2316 return build_indirect_ref (ptr
, errorstring
);
2320 build_indirect_ref (ptr
, errorstring
)
2322 const char *errorstring
;
2324 register tree pointer
, type
;
2326 if (ptr
== error_mark_node
)
2327 return error_mark_node
;
2329 if (ptr
== current_class_ptr
)
2330 return current_class_ref
;
2332 pointer
= (TREE_CODE (TREE_TYPE (ptr
)) == REFERENCE_TYPE
2333 ? ptr
: default_conversion (ptr
));
2334 type
= TREE_TYPE (pointer
);
2336 if (TYPE_PTR_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
2340 If the type of the expression is "pointer to T," the type
2341 of the result is "T."
2343 We must use the canonical variant because certain parts of
2344 the back end, like fold, do pointer comparisons between
2346 tree t
= canonical_type_variant (TREE_TYPE (type
));
2348 if (VOID_TYPE_P (t
))
2350 /* A pointer to incomplete type (other than cv void) can be
2351 dereferenced [expr.unary.op]/1 */
2352 error ("`%T' is not a pointer-to-object type", type
);
2353 return error_mark_node
;
2355 else if (TREE_CODE (pointer
) == ADDR_EXPR
2356 && same_type_p (t
, TREE_TYPE (TREE_OPERAND (pointer
, 0))))
2357 /* The POINTER was something like `&x'. We simplify `*&x' to
2359 return TREE_OPERAND (pointer
, 0);
2362 tree ref
= build1 (INDIRECT_REF
, t
, pointer
);
2364 /* We *must* set TREE_READONLY when dereferencing a pointer to const,
2365 so that we get the proper error message if the result is used
2366 to assign to. Also, &* is supposed to be a no-op. */
2367 TREE_READONLY (ref
) = CP_TYPE_CONST_P (t
);
2368 TREE_THIS_VOLATILE (ref
) = CP_TYPE_VOLATILE_P (t
);
2369 TREE_SIDE_EFFECTS (ref
)
2370 = (TREE_THIS_VOLATILE (ref
) || TREE_SIDE_EFFECTS (pointer
));
2374 /* `pointer' won't be an error_mark_node if we were given a
2375 pointer to member, so it's cool to check for this here. */
2376 else if (TYPE_PTRMEM_P (type
) || TYPE_PTRMEMFUNC_P (type
))
2377 error ("invalid use of `%s' on pointer to member", errorstring
);
2378 else if (pointer
!= error_mark_node
)
2381 error ("invalid type argument of `%s'", errorstring
);
2383 error ("invalid type argument");
2385 return error_mark_node
;
2388 /* This handles expressions of the form "a[i]", which denotes
2391 This is logically equivalent in C to *(a+i), but we may do it differently.
2392 If A is a variable or a member, we generate a primitive ARRAY_REF.
2393 This avoids forcing the array out of registers, and can work on
2394 arrays that are not lvalues (for example, members of structures returned
2397 If INDEX is of some user-defined type, it must be converted to
2398 integer type. Otherwise, to make a compatible PLUS_EXPR, it
2399 will inherit the type of the array, which will be some pointer type. */
2402 build_array_ref (array
, idx
)
2407 error ("subscript missing in array reference");
2408 return error_mark_node
;
2411 if (TREE_TYPE (array
) == error_mark_node
2412 || TREE_TYPE (idx
) == error_mark_node
)
2413 return error_mark_node
;
2415 /* If ARRAY is a COMPOUND_EXPR or COND_EXPR, move our reference
2417 switch (TREE_CODE (array
))
2421 tree value
= build_array_ref (TREE_OPERAND (array
, 1), idx
);
2422 return build (COMPOUND_EXPR
, TREE_TYPE (value
),
2423 TREE_OPERAND (array
, 0), value
);
2427 return build_conditional_expr
2428 (TREE_OPERAND (array
, 0),
2429 build_array_ref (TREE_OPERAND (array
, 1), idx
),
2430 build_array_ref (TREE_OPERAND (array
, 2), idx
));
2436 if (TREE_CODE (TREE_TYPE (array
)) == ARRAY_TYPE
2437 && TREE_CODE (array
) != INDIRECT_REF
)
2441 /* Subscripting with type char is likely to lose
2442 on a machine where chars are signed.
2443 So warn on any machine, but optionally.
2444 Don't warn for unsigned char since that type is safe.
2445 Don't warn for signed char because anyone who uses that
2446 must have done so deliberately. */
2447 if (warn_char_subscripts
2448 && TYPE_MAIN_VARIANT (TREE_TYPE (idx
)) == char_type_node
)
2449 warning ("array subscript has type `char'");
2451 /* Apply default promotions *after* noticing character types. */
2452 idx
= default_conversion (idx
);
2454 if (TREE_CODE (TREE_TYPE (idx
)) != INTEGER_TYPE
)
2456 error ("array subscript is not an integer");
2457 return error_mark_node
;
2460 /* An array that is indexed by a non-constant
2461 cannot be stored in a register; we must be able to do
2462 address arithmetic on its address.
2463 Likewise an array of elements of variable size. */
2464 if (TREE_CODE (idx
) != INTEGER_CST
2465 || (COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (array
)))
2466 && (TREE_CODE (TYPE_SIZE (TREE_TYPE (TREE_TYPE (array
))))
2469 if (!cxx_mark_addressable (array
))
2470 return error_mark_node
;
2473 /* An array that is indexed by a constant value which is not within
2474 the array bounds cannot be stored in a register either; because we
2475 would get a crash in store_bit_field/extract_bit_field when trying
2476 to access a non-existent part of the register. */
2477 if (TREE_CODE (idx
) == INTEGER_CST
2478 && TYPE_VALUES (TREE_TYPE (array
))
2479 && ! int_fits_type_p (idx
, TYPE_VALUES (TREE_TYPE (array
))))
2481 if (!cxx_mark_addressable (array
))
2482 return error_mark_node
;
2485 if (pedantic
&& !lvalue_p (array
))
2486 pedwarn ("ISO C++ forbids subscripting non-lvalue array");
2488 /* Note in C++ it is valid to subscript a `register' array, since
2489 it is valid to take the address of something with that
2490 storage specification. */
2494 while (TREE_CODE (foo
) == COMPONENT_REF
)
2495 foo
= TREE_OPERAND (foo
, 0);
2496 if (TREE_CODE (foo
) == VAR_DECL
&& DECL_REGISTER (foo
))
2497 warning ("subscripting array declared `register'");
2500 type
= TREE_TYPE (TREE_TYPE (array
));
2501 rval
= build (ARRAY_REF
, type
, array
, idx
);
2502 /* Array ref is const/volatile if the array elements are
2503 or if the array is.. */
2504 TREE_READONLY (rval
)
2505 |= (CP_TYPE_CONST_P (type
) | TREE_READONLY (array
));
2506 TREE_SIDE_EFFECTS (rval
)
2507 |= (CP_TYPE_VOLATILE_P (type
) | TREE_SIDE_EFFECTS (array
));
2508 TREE_THIS_VOLATILE (rval
)
2509 |= (CP_TYPE_VOLATILE_P (type
) | TREE_THIS_VOLATILE (array
));
2510 return require_complete_type (fold (rval
));
2514 tree ar
= default_conversion (array
);
2515 tree ind
= default_conversion (idx
);
2517 /* Put the integer in IND to simplify error checking. */
2518 if (TREE_CODE (TREE_TYPE (ar
)) == INTEGER_TYPE
)
2525 if (ar
== error_mark_node
)
2528 if (TREE_CODE (TREE_TYPE (ar
)) != POINTER_TYPE
)
2530 error ("subscripted value is neither array nor pointer");
2531 return error_mark_node
;
2533 if (TREE_CODE (TREE_TYPE (ind
)) != INTEGER_TYPE
)
2535 error ("array subscript is not an integer");
2536 return error_mark_node
;
2539 return build_indirect_ref (cp_build_binary_op (PLUS_EXPR
, ar
, ind
),
2544 /* Resolve a pointer to member function. INSTANCE is the object
2545 instance to use, if the member points to a virtual member.
2547 This used to avoid checking for virtual functions if basetype
2548 has no virtual functions, according to an earlier ANSI draft.
2549 With the final ISO C++ rules, such an optimization is
2550 incorrect: A pointer to a derived member can be static_cast
2551 to pointer-to-base-member, as long as the dynamic object
2552 later has the right member. */
2555 get_member_function_from_ptrfunc (instance_ptrptr
, function
)
2556 tree
*instance_ptrptr
;
2559 if (TREE_CODE (function
) == OFFSET_REF
)
2560 function
= TREE_OPERAND (function
, 1);
2562 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
2564 tree idx
, delta
, e1
, e2
, e3
, vtbl
, basetype
;
2565 tree fntype
= TYPE_PTRMEMFUNC_FN_TYPE (TREE_TYPE (function
));
2567 tree instance_ptr
= *instance_ptrptr
;
2568 tree instance_save_expr
= 0;
2569 if (instance_ptr
== error_mark_node
)
2571 if (TREE_CODE (function
) == PTRMEM_CST
)
2573 /* Extracting the function address from a pmf is only
2574 allowed with -Wno-pmf-conversions. It only works for
2576 e1
= build_addr_func (PTRMEM_CST_MEMBER (function
));
2577 e1
= convert (fntype
, e1
);
2582 error ("object missing in use of `%E'", function
);
2583 return error_mark_node
;
2587 if (TREE_SIDE_EFFECTS (instance_ptr
))
2588 instance_ptr
= instance_save_expr
= save_expr (instance_ptr
);
2590 if (TREE_SIDE_EFFECTS (function
))
2591 function
= save_expr (function
);
2593 /* Start by extracting all the information from the PMF itself. */
2594 e3
= PFN_FROM_PTRMEMFUNC (function
);
2595 delta
= build_ptrmemfunc_access_expr (function
, delta_identifier
);
2596 idx
= build1 (NOP_EXPR
, vtable_index_type
, e3
);
2597 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
2599 case ptrmemfunc_vbit_in_pfn
:
2600 e1
= cp_build_binary_op (BIT_AND_EXPR
, idx
, integer_one_node
);
2601 idx
= cp_build_binary_op (MINUS_EXPR
, idx
, integer_one_node
);
2604 case ptrmemfunc_vbit_in_delta
:
2605 e1
= cp_build_binary_op (BIT_AND_EXPR
, delta
, integer_one_node
);
2606 delta
= cp_build_binary_op (RSHIFT_EXPR
, delta
, integer_one_node
);
2613 /* Convert down to the right base before using the instance. First
2615 basetype
= TYPE_METHOD_BASETYPE (TREE_TYPE (fntype
));
2616 basetype
= lookup_base (TREE_TYPE (TREE_TYPE (instance_ptr
)),
2617 basetype
, ba_check
, NULL
);
2618 instance_ptr
= build_base_path (PLUS_EXPR
, instance_ptr
, basetype
, 1);
2619 if (instance_ptr
== error_mark_node
)
2620 return error_mark_node
;
2621 /* ...and then the delta in the PMF. */
2622 instance_ptr
= build (PLUS_EXPR
, TREE_TYPE (instance_ptr
),
2623 instance_ptr
, delta
);
2625 /* Hand back the adjusted 'this' argument to our caller. */
2626 *instance_ptrptr
= instance_ptr
;
2628 /* Next extract the vtable pointer from the object. */
2629 vtbl
= build1 (NOP_EXPR
, build_pointer_type (vtbl_ptr_type_node
),
2631 vtbl
= build_indirect_ref (vtbl
, NULL
);
2633 /* Finally, extract the function pointer from the vtable. */
2634 e2
= fold (build (PLUS_EXPR
, TREE_TYPE (vtbl
), vtbl
, idx
));
2635 e2
= build_indirect_ref (e2
, NULL
);
2636 TREE_CONSTANT (e2
) = 1;
2638 /* When using function descriptors, the address of the
2639 vtable entry is treated as a function pointer. */
2640 if (TARGET_VTABLE_USES_DESCRIPTORS
)
2641 e2
= build1 (NOP_EXPR
, TREE_TYPE (e2
),
2642 build_unary_op (ADDR_EXPR
, e2
, /*noconvert=*/1));
2644 TREE_TYPE (e2
) = TREE_TYPE (e3
);
2645 e1
= build_conditional_expr (e1
, e2
, e3
);
2647 /* Make sure this doesn't get evaluated first inside one of the
2648 branches of the COND_EXPR. */
2649 if (instance_save_expr
)
2650 e1
= build (COMPOUND_EXPR
, TREE_TYPE (e1
),
2651 instance_save_expr
, e1
);
2659 build_function_call (function
, params
)
2660 tree function
, params
;
2662 register tree fntype
, fndecl
;
2663 register tree coerced_params
;
2665 tree name
= NULL_TREE
, assembler_name
= NULL_TREE
;
2667 tree original
= function
;
2669 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2670 Strip such NOP_EXPRs, since FUNCTION is used in non-lvalue context. */
2671 if (TREE_CODE (function
) == NOP_EXPR
2672 && TREE_TYPE (function
) == TREE_TYPE (TREE_OPERAND (function
, 0)))
2673 function
= TREE_OPERAND (function
, 0);
2675 if (TREE_CODE (function
) == FUNCTION_DECL
)
2677 name
= DECL_NAME (function
);
2678 assembler_name
= DECL_ASSEMBLER_NAME (function
);
2680 mark_used (function
);
2683 /* Convert anything with function type to a pointer-to-function. */
2684 if (pedantic
&& DECL_MAIN_P (function
))
2685 pedwarn ("ISO C++ forbids calling `::main' from within program");
2687 /* Differs from default_conversion by not setting TREE_ADDRESSABLE
2688 (because calling an inline function does not mean the function
2689 needs to be separately compiled). */
2691 if (DECL_INLINE (function
))
2692 function
= inline_conversion (function
);
2694 function
= build_addr_func (function
);
2700 function
= build_addr_func (function
);
2703 if (function
== error_mark_node
)
2704 return error_mark_node
;
2706 fntype
= TREE_TYPE (function
);
2708 if (TYPE_PTRMEMFUNC_P (fntype
))
2710 error ("must use .* or ->* to call pointer-to-member function in `%E (...)'",
2712 return error_mark_node
;
2715 is_method
= (TREE_CODE (fntype
) == POINTER_TYPE
2716 && TREE_CODE (TREE_TYPE (fntype
)) == METHOD_TYPE
);
2718 if (!((TREE_CODE (fntype
) == POINTER_TYPE
2719 && TREE_CODE (TREE_TYPE (fntype
)) == FUNCTION_TYPE
)
2721 || TREE_CODE (function
) == TEMPLATE_ID_EXPR
))
2723 error ("`%E' cannot be used as a function", original
);
2724 return error_mark_node
;
2727 /* fntype now gets the type of function pointed to. */
2728 fntype
= TREE_TYPE (fntype
);
2730 /* Convert the parameters to the types declared in the
2731 function prototype, or apply default promotions. */
2733 coerced_params
= convert_arguments (TYPE_ARG_TYPES (fntype
),
2734 params
, fndecl
, LOOKUP_NORMAL
);
2735 if (coerced_params
== error_mark_node
)
2736 return error_mark_node
;
2738 /* Check for errors in format strings. */
2741 check_function_format (NULL
, TYPE_ATTRIBUTES (fntype
), coerced_params
);
2743 /* Recognize certain built-in functions so we can make tree-codes
2744 other than CALL_EXPR. We do this when it enables fold-const.c
2745 to do something useful. */
2747 if (TREE_CODE (function
) == ADDR_EXPR
2748 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
2749 && DECL_BUILT_IN (TREE_OPERAND (function
, 0)))
2751 result
= expand_tree_builtin (TREE_OPERAND (function
, 0),
2752 params
, coerced_params
);
2757 return build_cxx_call (function
, params
, coerced_params
);
2760 /* Convert the actual parameter expressions in the list VALUES
2761 to the types in the list TYPELIST.
2762 If parmdecls is exhausted, or when an element has NULL as its type,
2763 perform the default conversions.
2765 NAME is an IDENTIFIER_NODE or 0. It is used only for error messages.
2767 This is also where warnings about wrong number of args are generated.
2769 Return a list of expressions for the parameters as converted.
2771 Both VALUES and the returned value are chains of TREE_LIST nodes
2772 with the elements of the list in the TREE_VALUE slots of those nodes.
2774 In C++, unspecified trailing parameters can be filled in with their
2775 default arguments, if such were specified. Do so here. */
2778 convert_arguments (typelist
, values
, fndecl
, flags
)
2779 tree typelist
, values
, fndecl
;
2782 register tree typetail
, valtail
;
2783 register tree result
= NULL_TREE
;
2784 const char *called_thing
= 0;
2787 /* Argument passing is always copy-initialization. */
2788 flags
|= LOOKUP_ONLYCONVERTING
;
2792 if (TREE_CODE (TREE_TYPE (fndecl
)) == METHOD_TYPE
)
2794 if (DECL_NAME (fndecl
) == NULL_TREE
2795 || IDENTIFIER_HAS_TYPE_VALUE (DECL_NAME (fndecl
)))
2796 called_thing
= "constructor";
2798 called_thing
= "member function";
2801 called_thing
= "function";
2804 for (valtail
= values
, typetail
= typelist
;
2806 valtail
= TREE_CHAIN (valtail
), i
++)
2808 register tree type
= typetail
? TREE_VALUE (typetail
) : 0;
2809 register tree val
= TREE_VALUE (valtail
);
2811 if (val
== error_mark_node
)
2812 return error_mark_node
;
2814 if (type
== void_type_node
)
2818 cp_error_at ("too many arguments to %s `%+#D'", called_thing
,
2820 error ("at this point in file");
2823 error ("too many arguments to function");
2824 /* In case anybody wants to know if this argument
2827 TREE_TYPE (tree_last (result
)) = error_mark_node
;
2831 if (TREE_CODE (val
) == OFFSET_REF
)
2832 val
= resolve_offset_ref (val
);
2834 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
2835 Strip such NOP_EXPRs, since VAL is used in non-lvalue context. */
2836 if (TREE_CODE (val
) == NOP_EXPR
2837 && TREE_TYPE (val
) == TREE_TYPE (TREE_OPERAND (val
, 0))
2838 && (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
))
2839 val
= TREE_OPERAND (val
, 0);
2841 if (type
== 0 || TREE_CODE (type
) != REFERENCE_TYPE
)
2843 if (TREE_CODE (TREE_TYPE (val
)) == ARRAY_TYPE
2844 || TREE_CODE (TREE_TYPE (val
)) == FUNCTION_TYPE
2845 || TREE_CODE (TREE_TYPE (val
)) == METHOD_TYPE
)
2846 val
= default_conversion (val
);
2849 if (val
== error_mark_node
)
2850 return error_mark_node
;
2854 /* Formal parm type is specified by a function prototype. */
2857 if (!COMPLETE_TYPE_P (complete_type (type
)))
2859 error ("parameter type of called function is incomplete");
2864 parmval
= convert_for_initialization
2865 (NULL_TREE
, type
, val
, flags
,
2866 "argument passing", fndecl
, i
);
2867 parmval
= convert_for_arg_passing (type
, parmval
);
2870 if (parmval
== error_mark_node
)
2871 return error_mark_node
;
2873 result
= tree_cons (NULL_TREE
, parmval
, result
);
2877 if (TREE_CODE (TREE_TYPE (val
)) == REFERENCE_TYPE
)
2878 val
= convert_from_reference (val
);
2880 if (fndecl
&& DECL_BUILT_IN (fndecl
)
2881 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_CONSTANT_P
)
2882 /* Don't do ellipsis conversion for __built_in_constant_p
2883 as this will result in spurious warnings for non-POD
2885 val
= require_complete_type (val
);
2887 val
= convert_arg_to_ellipsis (val
);
2889 result
= tree_cons (NULL_TREE
, val
, result
);
2893 typetail
= TREE_CHAIN (typetail
);
2896 if (typetail
!= 0 && typetail
!= void_list_node
)
2898 /* See if there are default arguments that can be used */
2899 if (TREE_PURPOSE (typetail
)
2900 && TREE_CODE (TREE_PURPOSE (typetail
)) != DEFAULT_ARG
)
2902 for (; typetail
!= void_list_node
; ++i
)
2905 = convert_default_arg (TREE_VALUE (typetail
),
2906 TREE_PURPOSE (typetail
),
2909 if (parmval
== error_mark_node
)
2910 return error_mark_node
;
2912 result
= tree_cons (0, parmval
, result
);
2913 typetail
= TREE_CHAIN (typetail
);
2914 /* ends with `...'. */
2915 if (typetail
== NULL_TREE
)
2923 cp_error_at ("too few arguments to %s `%+#D'",
2924 called_thing
, fndecl
);
2925 error ("at this point in file");
2928 error ("too few arguments to function");
2929 return error_mark_list
;
2933 return nreverse (result
);
2936 /* Build a binary-operation expression, after performing default
2937 conversions on the operands. CODE is the kind of expression to build. */
2940 build_x_binary_op (code
, arg1
, arg2
)
2941 enum tree_code code
;
2944 if (processing_template_decl
)
2945 return build_min_nt (code
, arg1
, arg2
);
2947 return build_new_op (code
, LOOKUP_NORMAL
, arg1
, arg2
, NULL_TREE
);
2953 build_template_expr (enum tree_code code
, tree op0
, tree op1
, tree op2
)
2957 /* If any of the operands is erroneous the result is erroneous too. */
2958 if (error_operand_p (op0
)
2959 || (op1
&& error_operand_p (op1
))
2960 || (op2
&& error_operand_p (op2
)))
2961 return error_mark_node
;
2963 if (dependent_type_p (TREE_TYPE (op0
))
2964 || (op1
&& dependent_type_p (TREE_TYPE (op1
)))
2965 || (op2
&& dependent_type_p (TREE_TYPE (op2
))))
2966 /* If at least one operand has a dependent type, we cannot
2967 determine the type of the expression until instantiation time. */
2971 struct z_candidate
*cand
;
2976 /* None of the operands is dependent, so we can compute the type
2977 of the expression at this point. We must compute the type so
2978 that in things like:
2981 void f() { S<sizeof(I + 3)> s; ... }
2983 we can tell that the type of "s" is non-dependent.
2985 If we're processing a template argument, we do not want to
2986 actually change the operands in any way. Adding conversions,
2987 performing constant folding, etc., would all change mangled
2988 names. For example, in:
2991 void f(S<sizeof(3 + 4 + I)>);
2993 we need to determine that "3 + 4 + I" has type "int", without
2994 actually turning the expression into "7 + I". */
2995 cand
= find_overloaded_op (code
, op0
, op1
, op2
);
2997 /* If an overloaded operator was found, the expression will
2998 have the type returned by the function. */
2999 type
= non_reference (TREE_TYPE (cand
->fn
));
3002 /* There is no overloaded operator so we can just use the
3003 default rules for determining the type of the operand. */
3004 op0_type
= TREE_TYPE (op0
);
3005 op1_type
= op1
? TREE_TYPE (op1
) : NULL_TREE
;
3006 op2_type
= op2
? TREE_TYPE (op2
) : NULL_TREE
;
3014 The result of the assignment operation is the value
3015 stored in the left operand. */
3019 /* Implement this case. */
3021 case POSTINCREMENT_EXPR
:
3022 case POSTDECREMENT_EXPR
:
3025 The type of the result is the cv-unqualified version
3026 of the type of the operand. */
3027 type
= TYPE_MAIN_VARIANT (op0_type
);
3029 case PREINCREMENT_EXPR
:
3030 case PREDECREMENT_EXPR
:
3033 The value is the new value of the operand. */
3039 If the type of the expression is "pointer to T", the
3040 type of the result is "T". */
3041 type
= TREE_TYPE (op0_type
);
3046 If the type of the expression is "T", the type of the
3047 result is "pointer to T". */
3048 /* FIXME: Handle the pointer-to-member case. */
3051 /* FIXME: Implement this case. */
3057 The type of the result is that of the promoted left
3062 /* FIXME: Be careful of special pointer-arithmetic
3067 /* These are GNU extensions; the result type is computed
3068 as it would be for other arithmetic operators. */
3074 case TRUNC_DIV_EXPR
:
3075 case TRUNC_MOD_EXPR
:
3076 /* [expr.bit.and], [expr.xor], [expr.or], [expr.mul]
3078 The usual arithmetic conversions are performed on the
3079 operands and determine the type of the result. */
3080 /* FIXME: Check that this is possible. */
3081 type
= type_after_usual_arithmetic_conversions (t1
, t2
);
3091 The type of the result is bool. */
3092 type
= boolean_type_node
;
3094 case TRUTH_ANDIF_EXPR
:
3095 case TRUTH_ORIF_EXPR
:
3096 /* [expr.log.and], [expr.log.org]
3098 The result is a bool. */
3099 type
= boolean_type_node
;
3102 /* FIXME: Handle special rules for conditioanl
3111 /* If the type of the expression could not be determined,
3112 something is wrong. */
3115 /* If the type is erroneous, the expression is erroneous
3117 if (type
== error_mark_node
)
3118 return error_mark_node
;
3122 return build_min (code
, type
, op0
, op1
, op2
, NULL_TREE
);
3127 /* Build a binary-operation expression without default conversions.
3128 CODE is the kind of expression to build.
3129 This function differs from `build' in several ways:
3130 the data type of the result is computed and recorded in it,
3131 warnings are generated if arg data types are invalid,
3132 special handling for addition and subtraction of pointers is known,
3133 and some optimization is done (operations on narrow ints
3134 are done in the narrower type when that gives the same result).
3135 Constant folding is also done before the result is returned.
3137 Note that the operands will never have enumeral types
3138 because either they have just had the default conversions performed
3139 or they have both just been converted to some other type in which
3140 the arithmetic is to be done.
3142 C++: must do special pointer arithmetic when implementing
3143 multiple inheritance, and deal with pointer to member functions. */
3146 build_binary_op (code
, orig_op0
, orig_op1
, convert_p
)
3147 enum tree_code code
;
3148 tree orig_op0
, orig_op1
;
3149 int convert_p ATTRIBUTE_UNUSED
;
3152 register enum tree_code code0
, code1
;
3155 /* Expression code to give to the expression when it is built.
3156 Normally this is CODE, which is what the caller asked for,
3157 but in some special cases we change it. */
3158 register enum tree_code resultcode
= code
;
3160 /* Data type in which the computation is to be performed.
3161 In the simplest cases this is the common type of the arguments. */
3162 register tree result_type
= NULL
;
3164 /* Nonzero means operands have already been type-converted
3165 in whatever way is necessary.
3166 Zero means they need to be converted to RESULT_TYPE. */
3169 /* Nonzero means create the expression with this type, rather than
3171 tree build_type
= 0;
3173 /* Nonzero means after finally constructing the expression
3174 convert it to this type. */
3175 tree final_type
= 0;
3177 /* Nonzero if this is an operation like MIN or MAX which can
3178 safely be computed in short if both args are promoted shorts.
3179 Also implies COMMON.
3180 -1 indicates a bitwise operation; this makes a difference
3181 in the exact conditions for when it is safe to do the operation
3182 in a narrower mode. */
3185 /* Nonzero if this is a comparison operation;
3186 if both args are promoted shorts, compare the original shorts.
3187 Also implies COMMON. */
3188 int short_compare
= 0;
3190 /* Nonzero if this is a right-shift operation, which can be computed on the
3191 original short and then promoted if the operand is a promoted short. */
3192 int short_shift
= 0;
3194 /* Nonzero means set RESULT_TYPE to the common type of the args. */
3197 /* Apply default conversions. */
3201 if (code
== TRUTH_AND_EXPR
|| code
== TRUTH_ANDIF_EXPR
3202 || code
== TRUTH_OR_EXPR
|| code
== TRUTH_ORIF_EXPR
3203 || code
== TRUTH_XOR_EXPR
)
3205 if (!really_overloaded_fn (op0
))
3206 op0
= decay_conversion (op0
);
3207 if (!really_overloaded_fn (op1
))
3208 op1
= decay_conversion (op1
);
3212 if (!really_overloaded_fn (op0
))
3213 op0
= default_conversion (op0
);
3214 if (!really_overloaded_fn (op1
))
3215 op1
= default_conversion (op1
);
3218 /* Strip NON_LVALUE_EXPRs, etc., since we aren't using as an lvalue. */
3219 STRIP_TYPE_NOPS (op0
);
3220 STRIP_TYPE_NOPS (op1
);
3222 /* DTRT if one side is an overloaded function, but complain about it. */
3223 if (type_unknown_p (op0
))
3225 tree t
= instantiate_type (TREE_TYPE (op1
), op0
, tf_none
);
3226 if (t
!= error_mark_node
)
3228 pedwarn ("assuming cast to type `%T' from overloaded function",
3233 if (type_unknown_p (op1
))
3235 tree t
= instantiate_type (TREE_TYPE (op0
), op1
, tf_none
);
3236 if (t
!= error_mark_node
)
3238 pedwarn ("assuming cast to type `%T' from overloaded function",
3244 type0
= TREE_TYPE (op0
);
3245 type1
= TREE_TYPE (op1
);
3247 /* The expression codes of the data types of the arguments tell us
3248 whether the arguments are integers, floating, pointers, etc. */
3249 code0
= TREE_CODE (type0
);
3250 code1
= TREE_CODE (type1
);
3252 /* If an error was already reported for one of the arguments,
3253 avoid reporting another error. */
3255 if (code0
== ERROR_MARK
|| code1
== ERROR_MARK
)
3256 return error_mark_node
;
3261 /* Handle the pointer + int case. */
3262 if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3263 return cp_pointer_int_sum (PLUS_EXPR
, op0
, op1
);
3264 else if (code1
== POINTER_TYPE
&& code0
== INTEGER_TYPE
)
3265 return cp_pointer_int_sum (PLUS_EXPR
, op1
, op0
);
3271 /* Subtraction of two similar pointers.
3272 We must subtract them as integers, then divide by object size. */
3273 if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
3274 && comp_target_types (type0
, type1
, 1))
3275 return pointer_diff (op0
, op1
, common_type (type0
, type1
));
3276 /* Handle pointer minus int. Just like pointer plus int. */
3277 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3278 return cp_pointer_int_sum (MINUS_EXPR
, op0
, op1
);
3287 case TRUNC_DIV_EXPR
:
3289 case FLOOR_DIV_EXPR
:
3290 case ROUND_DIV_EXPR
:
3291 case EXACT_DIV_EXPR
:
3292 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3293 || code0
== COMPLEX_TYPE
)
3294 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3295 || code1
== COMPLEX_TYPE
))
3297 if (TREE_CODE (op1
) == INTEGER_CST
&& integer_zerop (op1
))
3298 warning ("division by zero in `%E / 0'", op0
);
3299 else if (TREE_CODE (op1
) == REAL_CST
&& real_zerop (op1
))
3300 warning ("division by zero in `%E / 0.'", op0
);
3302 if (!(code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
))
3303 resultcode
= RDIV_EXPR
;
3305 /* When dividing two signed integers, we have to promote to int.
3306 unless we divide by a constant != -1. Note that default
3307 conversion will have been performed on the operands at this
3308 point, so we have to dig out the original type to find out if
3310 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3311 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3312 || (TREE_CODE (op1
) == INTEGER_CST
3313 && ! integer_all_onesp (op1
)));
3320 case BIT_ANDTC_EXPR
:
3323 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3327 case TRUNC_MOD_EXPR
:
3328 case FLOOR_MOD_EXPR
:
3329 if (code1
== INTEGER_TYPE
&& integer_zerop (op1
))
3330 warning ("division by zero in `%E %% 0'", op0
);
3331 else if (code1
== REAL_TYPE
&& real_zerop (op1
))
3332 warning ("division by zero in `%E %% 0.'", op0
);
3334 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3336 /* Although it would be tempting to shorten always here, that loses
3337 on some targets, since the modulo instruction is undefined if the
3338 quotient can't be represented in the computation mode. We shorten
3339 only if unsigned or if dividing by something we know != -1. */
3340 shorten
= ((TREE_CODE (op0
) == NOP_EXPR
3341 && TREE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op0
, 0))))
3342 || (TREE_CODE (op1
) == INTEGER_CST
3343 && ! integer_all_onesp (op1
)));
3348 case TRUTH_ANDIF_EXPR
:
3349 case TRUTH_ORIF_EXPR
:
3350 case TRUTH_AND_EXPR
:
3352 result_type
= boolean_type_node
;
3355 /* Shift operations: result has same type as first operand;
3356 always convert second operand to int.
3357 Also set SHORT_SHIFT if shifting rightward. */
3360 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3362 result_type
= type0
;
3363 if (TREE_CODE (op1
) == INTEGER_CST
)
3365 if (tree_int_cst_lt (op1
, integer_zero_node
))
3366 warning ("right shift count is negative");
3369 if (! integer_zerop (op1
))
3371 if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3372 warning ("right shift count >= width of type");
3375 /* Convert the shift-count to an integer, regardless of
3376 size of value being shifted. */
3377 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3378 op1
= cp_convert (integer_type_node
, op1
);
3379 /* Avoid converting op1 to result_type later. */
3385 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3387 result_type
= type0
;
3388 if (TREE_CODE (op1
) == INTEGER_CST
)
3390 if (tree_int_cst_lt (op1
, integer_zero_node
))
3391 warning ("left shift count is negative");
3392 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3393 warning ("left shift count >= width of type");
3395 /* Convert the shift-count to an integer, regardless of
3396 size of value being shifted. */
3397 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3398 op1
= cp_convert (integer_type_node
, op1
);
3399 /* Avoid converting op1 to result_type later. */
3406 if (code0
== INTEGER_TYPE
&& code1
== INTEGER_TYPE
)
3408 result_type
= type0
;
3409 if (TREE_CODE (op1
) == INTEGER_CST
)
3411 if (tree_int_cst_lt (op1
, integer_zero_node
))
3412 warning ("%s rotate count is negative",
3413 (code
== LROTATE_EXPR
) ? "left" : "right");
3414 else if (compare_tree_int (op1
, TYPE_PRECISION (type0
)) >= 0)
3415 warning ("%s rotate count >= width of type",
3416 (code
== LROTATE_EXPR
) ? "left" : "right");
3418 /* Convert the shift-count to an integer, regardless of
3419 size of value being shifted. */
3420 if (TYPE_MAIN_VARIANT (TREE_TYPE (op1
)) != integer_type_node
)
3421 op1
= cp_convert (integer_type_node
, op1
);
3427 if (warn_float_equal
&& (code0
== REAL_TYPE
|| code1
== REAL_TYPE
))
3428 warning ("comparing floating point with == or != is unsafe");
3430 build_type
= boolean_type_node
;
3431 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
3432 || code0
== COMPLEX_TYPE
)
3433 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
3434 || code1
== COMPLEX_TYPE
))
3436 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3437 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3439 else if (code0
== POINTER_TYPE
&& null_ptr_cst_p (op1
))
3440 result_type
= type0
;
3441 else if (code1
== POINTER_TYPE
&& null_ptr_cst_p (op0
))
3442 result_type
= type1
;
3443 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3445 result_type
= type0
;
3446 error ("ISO C++ forbids comparison between pointer and integer");
3448 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3450 result_type
= type1
;
3451 error ("ISO C++ forbids comparison between pointer and integer");
3453 else if (TYPE_PTRMEMFUNC_P (type0
) && null_ptr_cst_p (op1
))
3455 op0
= build_ptrmemfunc_access_expr (op0
, pfn_identifier
);
3456 op1
= cp_convert (TREE_TYPE (op0
), integer_zero_node
);
3457 result_type
= TREE_TYPE (op0
);
3459 else if (TYPE_PTRMEMFUNC_P (type1
) && null_ptr_cst_p (op0
))
3460 return cp_build_binary_op (code
, op1
, op0
);
3461 else if (TYPE_PTRMEMFUNC_P (type0
) && TYPE_PTRMEMFUNC_P (type1
)
3462 && same_type_p (type0
, type1
))
3464 /* E will be the final comparison. */
3466 /* E1 and E2 are for scratch. */
3474 if (TREE_SIDE_EFFECTS (op0
))
3475 op0
= save_expr (op0
);
3476 if (TREE_SIDE_EFFECTS (op1
))
3477 op1
= save_expr (op1
);
3482 && (!op0.pfn || op0.delta == op1.delta))
3484 The reason for the `!op0.pfn' bit is that a NULL
3485 pointer-to-member is any member with a zero PFN; the
3486 DELTA field is unspecified. */
3487 pfn0
= pfn_from_ptrmemfunc (op0
);
3488 pfn1
= pfn_from_ptrmemfunc (op1
);
3489 delta0
= build_ptrmemfunc_access_expr (op0
,
3491 delta1
= build_ptrmemfunc_access_expr (op1
,
3493 e1
= cp_build_binary_op (EQ_EXPR
, delta0
, delta1
);
3494 e2
= cp_build_binary_op (EQ_EXPR
,
3496 cp_convert (TREE_TYPE (pfn0
),
3497 integer_zero_node
));
3498 e1
= cp_build_binary_op (TRUTH_ORIF_EXPR
, e1
, e2
);
3499 e2
= build (EQ_EXPR
, boolean_type_node
, pfn0
, pfn1
);
3500 e
= cp_build_binary_op (TRUTH_ANDIF_EXPR
, e2
, e1
);
3501 if (code
== EQ_EXPR
)
3503 return cp_build_binary_op (EQ_EXPR
, e
, integer_zero_node
);
3505 else if ((TYPE_PTRMEMFUNC_P (type0
)
3506 && same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type0
), type1
))
3507 || (TYPE_PTRMEMFUNC_P (type1
)
3508 && same_type_p (TYPE_PTRMEMFUNC_FN_TYPE (type1
), type0
)))
3514 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3515 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3517 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3518 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3526 build_type
= boolean_type_node
;
3527 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
)
3528 && (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
))
3530 else if (code0
== POINTER_TYPE
&& code1
== POINTER_TYPE
)
3531 result_type
= composite_pointer_type (type0
, type1
, op0
, op1
,
3533 else if (code0
== POINTER_TYPE
&& TREE_CODE (op1
) == INTEGER_CST
3534 && integer_zerop (op1
))
3535 result_type
= type0
;
3536 else if (code1
== POINTER_TYPE
&& TREE_CODE (op0
) == INTEGER_CST
3537 && integer_zerop (op0
))
3538 result_type
= type1
;
3539 else if (code0
== POINTER_TYPE
&& code1
== INTEGER_TYPE
)
3541 result_type
= type0
;
3542 pedwarn ("ISO C++ forbids comparison between pointer and integer");
3544 else if (code0
== INTEGER_TYPE
&& code1
== POINTER_TYPE
)
3546 result_type
= type1
;
3547 pedwarn ("ISO C++ forbids comparison between pointer and integer");
3551 case UNORDERED_EXPR
:
3558 build_type
= integer_type_node
;
3559 if (code0
!= REAL_TYPE
|| code1
!= REAL_TYPE
)
3561 error ("unordered comparison on non-floating point argument");
3562 return error_mark_node
;
3571 if ((code0
== INTEGER_TYPE
|| code0
== REAL_TYPE
|| code0
== COMPLEX_TYPE
)
3573 (code1
== INTEGER_TYPE
|| code1
== REAL_TYPE
|| code1
== COMPLEX_TYPE
))
3575 int none_complex
= (code0
!= COMPLEX_TYPE
&& code1
!= COMPLEX_TYPE
);
3577 if (shorten
|| common
|| short_compare
)
3578 result_type
= common_type (type0
, type1
);
3580 /* For certain operations (which identify themselves by shorten != 0)
3581 if both args were extended from the same smaller type,
3582 do the arithmetic in that type and then extend.
3584 shorten !=0 and !=1 indicates a bitwise operation.
3585 For them, this optimization is safe only if
3586 both args are zero-extended or both are sign-extended.
3587 Otherwise, we might change the result.
3588 Eg, (short)-1 | (unsigned short)-1 is (int)-1
3589 but calculated in (unsigned short) it would be (unsigned short)-1. */
3591 if (shorten
&& none_complex
)
3593 int unsigned0
, unsigned1
;
3594 tree arg0
= get_narrower (op0
, &unsigned0
);
3595 tree arg1
= get_narrower (op1
, &unsigned1
);
3596 /* UNS is 1 if the operation to be done is an unsigned one. */
3597 int uns
= TREE_UNSIGNED (result_type
);
3600 final_type
= result_type
;
3602 /* Handle the case that OP0 does not *contain* a conversion
3603 but it *requires* conversion to FINAL_TYPE. */
3605 if (op0
== arg0
&& TREE_TYPE (op0
) != final_type
)
3606 unsigned0
= TREE_UNSIGNED (TREE_TYPE (op0
));
3607 if (op1
== arg1
&& TREE_TYPE (op1
) != final_type
)
3608 unsigned1
= TREE_UNSIGNED (TREE_TYPE (op1
));
3610 /* Now UNSIGNED0 is 1 if ARG0 zero-extends to FINAL_TYPE. */
3612 /* For bitwise operations, signedness of nominal type
3613 does not matter. Consider only how operands were extended. */
3617 /* Note that in all three cases below we refrain from optimizing
3618 an unsigned operation on sign-extended args.
3619 That would not be valid. */
3621 /* Both args variable: if both extended in same way
3622 from same width, do it in that width.
3623 Do it unsigned if args were zero-extended. */
3624 if ((TYPE_PRECISION (TREE_TYPE (arg0
))
3625 < TYPE_PRECISION (result_type
))
3626 && (TYPE_PRECISION (TREE_TYPE (arg1
))
3627 == TYPE_PRECISION (TREE_TYPE (arg0
)))
3628 && unsigned0
== unsigned1
3629 && (unsigned0
|| !uns
))
3630 result_type
= c_common_signed_or_unsigned_type
3631 (unsigned0
, common_type (TREE_TYPE (arg0
), TREE_TYPE (arg1
)));
3632 else if (TREE_CODE (arg0
) == INTEGER_CST
3633 && (unsigned1
|| !uns
)
3634 && (TYPE_PRECISION (TREE_TYPE (arg1
))
3635 < TYPE_PRECISION (result_type
))
3636 && (type
= c_common_signed_or_unsigned_type
3637 (unsigned1
, TREE_TYPE (arg1
)),
3638 int_fits_type_p (arg0
, type
)))
3640 else if (TREE_CODE (arg1
) == INTEGER_CST
3641 && (unsigned0
|| !uns
)
3642 && (TYPE_PRECISION (TREE_TYPE (arg0
))
3643 < TYPE_PRECISION (result_type
))
3644 && (type
= c_common_signed_or_unsigned_type
3645 (unsigned0
, TREE_TYPE (arg0
)),
3646 int_fits_type_p (arg1
, type
)))
3650 /* Shifts can be shortened if shifting right. */
3655 tree arg0
= get_narrower (op0
, &unsigned_arg
);
3657 final_type
= result_type
;
3659 if (arg0
== op0
&& final_type
== TREE_TYPE (op0
))
3660 unsigned_arg
= TREE_UNSIGNED (TREE_TYPE (op0
));
3662 if (TYPE_PRECISION (TREE_TYPE (arg0
)) < TYPE_PRECISION (result_type
)
3663 /* We can shorten only if the shift count is less than the
3664 number of bits in the smaller type size. */
3665 && compare_tree_int (op1
, TYPE_PRECISION (TREE_TYPE (arg0
))) < 0
3666 /* If arg is sign-extended and then unsigned-shifted,
3667 we can simulate this with a signed shift in arg's type
3668 only if the extended result is at least twice as wide
3669 as the arg. Otherwise, the shift could use up all the
3670 ones made by sign-extension and bring in zeros.
3671 We can't optimize that case at all, but in most machines
3672 it never happens because available widths are 2**N. */
3673 && (!TREE_UNSIGNED (final_type
)
3675 || (((unsigned) 2 * TYPE_PRECISION (TREE_TYPE (arg0
)))
3676 <= TYPE_PRECISION (result_type
))))
3678 /* Do an unsigned shift if the operand was zero-extended. */
3680 = c_common_signed_or_unsigned_type (unsigned_arg
,
3682 /* Convert value-to-be-shifted to that type. */
3683 if (TREE_TYPE (op0
) != result_type
)
3684 op0
= cp_convert (result_type
, op0
);
3689 /* Comparison operations are shortened too but differently.
3690 They identify themselves by setting short_compare = 1. */
3694 /* Don't write &op0, etc., because that would prevent op0
3695 from being kept in a register.
3696 Instead, make copies of the our local variables and
3697 pass the copies by reference, then copy them back afterward. */
3698 tree xop0
= op0
, xop1
= op1
, xresult_type
= result_type
;
3699 enum tree_code xresultcode
= resultcode
;
3701 = shorten_compare (&xop0
, &xop1
, &xresult_type
, &xresultcode
);
3703 return cp_convert (boolean_type_node
, val
);
3704 op0
= xop0
, op1
= xop1
;
3706 resultcode
= xresultcode
;
3709 if ((short_compare
|| code
== MIN_EXPR
|| code
== MAX_EXPR
)
3710 && warn_sign_compare
)
3712 int op0_signed
= ! TREE_UNSIGNED (TREE_TYPE (orig_op0
));
3713 int op1_signed
= ! TREE_UNSIGNED (TREE_TYPE (orig_op1
));
3715 int unsignedp0
, unsignedp1
;
3716 tree primop0
= get_narrower (op0
, &unsignedp0
);
3717 tree primop1
= get_narrower (op1
, &unsignedp1
);
3719 /* Check for comparison of different enum types. */
3720 if (TREE_CODE (TREE_TYPE (orig_op0
)) == ENUMERAL_TYPE
3721 && TREE_CODE (TREE_TYPE (orig_op1
)) == ENUMERAL_TYPE
3722 && TYPE_MAIN_VARIANT (TREE_TYPE (orig_op0
))
3723 != TYPE_MAIN_VARIANT (TREE_TYPE (orig_op1
)))
3725 warning ("comparison between types `%#T' and `%#T'",
3726 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
));
3729 /* Give warnings for comparisons between signed and unsigned
3730 quantities that may fail. */
3731 /* Do the checking based on the original operand trees, so that
3732 casts will be considered, but default promotions won't be. */
3734 /* Do not warn if the comparison is being done in a signed type,
3735 since the signed type will only be chosen if it can represent
3736 all the values of the unsigned type. */
3737 if (! TREE_UNSIGNED (result_type
))
3739 /* Do not warn if both operands are unsigned. */
3740 else if (op0_signed
== op1_signed
)
3742 /* Do not warn if the signed quantity is an unsuffixed
3743 integer literal (or some static constant expression
3744 involving such literals or a conditional expression
3745 involving such literals) and it is non-negative. */
3746 else if ((op0_signed
&& tree_expr_nonnegative_p (orig_op0
))
3747 || (op1_signed
&& tree_expr_nonnegative_p (orig_op1
)))
3749 /* Do not warn if the comparison is an equality operation,
3750 the unsigned quantity is an integral constant and it does
3751 not use the most significant bit of result_type. */
3752 else if ((resultcode
== EQ_EXPR
|| resultcode
== NE_EXPR
)
3753 && ((op0_signed
&& TREE_CODE (orig_op1
) == INTEGER_CST
3754 && int_fits_type_p (orig_op1
, c_common_signed_type
3756 || (op1_signed
&& TREE_CODE (orig_op0
) == INTEGER_CST
3757 && int_fits_type_p (orig_op0
, c_common_signed_type
3761 warning ("comparison between signed and unsigned integer expressions");
3763 /* Warn if two unsigned values are being compared in a size
3764 larger than their original size, and one (and only one) is the
3765 result of a `~' operator. This comparison will always fail.
3767 Also warn if one operand is a constant, and the constant does not
3768 have all bits set that are set in the ~ operand when it is
3771 if ((TREE_CODE (primop0
) == BIT_NOT_EXPR
)
3772 ^ (TREE_CODE (primop1
) == BIT_NOT_EXPR
))
3774 if (TREE_CODE (primop0
) == BIT_NOT_EXPR
)
3775 primop0
= get_narrower (TREE_OPERAND (op0
, 0), &unsignedp0
);
3776 if (TREE_CODE (primop1
) == BIT_NOT_EXPR
)
3777 primop1
= get_narrower (TREE_OPERAND (op1
, 0), &unsignedp1
);
3779 if (host_integerp (primop0
, 0) || host_integerp (primop1
, 0))
3782 HOST_WIDE_INT constant
, mask
;
3786 if (host_integerp (primop0
, 0))
3789 unsignedp
= unsignedp1
;
3790 constant
= tree_low_cst (primop0
, 0);
3795 unsignedp
= unsignedp0
;
3796 constant
= tree_low_cst (primop1
, 0);
3799 bits
= TYPE_PRECISION (TREE_TYPE (primop
));
3800 if (bits
< TYPE_PRECISION (result_type
)
3801 && bits
< HOST_BITS_PER_LONG
&& unsignedp
)
3803 mask
= (~ (HOST_WIDE_INT
) 0) << bits
;
3804 if ((mask
& constant
) != mask
)
3805 warning ("comparison of promoted ~unsigned with constant");
3808 else if (unsignedp0
&& unsignedp1
3809 && (TYPE_PRECISION (TREE_TYPE (primop0
))
3810 < TYPE_PRECISION (result_type
))
3811 && (TYPE_PRECISION (TREE_TYPE (primop1
))
3812 < TYPE_PRECISION (result_type
)))
3813 warning ("comparison of promoted ~unsigned with unsigned");
3818 /* At this point, RESULT_TYPE must be nonzero to avoid an error message.
3819 If CONVERTED is zero, both args will be converted to type RESULT_TYPE.
3820 Then the expression will be built.
3821 It will be given type FINAL_TYPE if that is nonzero;
3822 otherwise, it will be given type RESULT_TYPE. */
3826 error ("invalid operands of types `%T' and `%T' to binary `%O'",
3827 TREE_TYPE (orig_op0
), TREE_TYPE (orig_op1
), code
);
3828 return error_mark_node
;
3831 /* Issue warnings about peculiar, but valid, uses of NULL. */
3832 if (/* It's reasonable to use pointer values as operands of &&
3833 and ||, so NULL is no exception. */
3834 !(code
== TRUTH_ANDIF_EXPR
|| code
== TRUTH_ORIF_EXPR
)
3835 && (/* If OP0 is NULL and OP1 is not a pointer, or vice versa. */
3836 (orig_op0
== null_node
3837 && TREE_CODE (TREE_TYPE (op1
)) != POINTER_TYPE
)
3838 /* Or vice versa. */
3839 || (orig_op1
== null_node
3840 && TREE_CODE (TREE_TYPE (op0
)) != POINTER_TYPE
)
3841 /* Or, both are NULL and the operation was not a comparison. */
3842 || (orig_op0
== null_node
&& orig_op1
== null_node
3843 && code
!= EQ_EXPR
&& code
!= NE_EXPR
)))
3844 /* Some sort of arithmetic operation involving NULL was
3845 performed. Note that pointer-difference and pointer-addition
3846 have already been handled above, and so we don't end up here in
3848 warning ("NULL used in arithmetic");
3852 if (TREE_TYPE (op0
) != result_type
)
3853 op0
= cp_convert (result_type
, op0
);
3854 if (TREE_TYPE (op1
) != result_type
)
3855 op1
= cp_convert (result_type
, op1
);
3857 if (op0
== error_mark_node
|| op1
== error_mark_node
)
3858 return error_mark_node
;
3861 if (build_type
== NULL_TREE
)
3862 build_type
= result_type
;
3865 register tree result
= build (resultcode
, build_type
, op0
, op1
);
3866 register tree folded
;
3868 folded
= fold (result
);
3869 if (folded
== result
)
3870 TREE_CONSTANT (folded
) = TREE_CONSTANT (op0
) & TREE_CONSTANT (op1
);
3871 if (final_type
!= 0)
3872 return cp_convert (final_type
, folded
);
3877 /* Return a tree for the sum or difference (RESULTCODE says which)
3878 of pointer PTROP and integer INTOP. */
3881 cp_pointer_int_sum (resultcode
, ptrop
, intop
)
3882 enum tree_code resultcode
;
3883 register tree ptrop
, intop
;
3885 tree res_type
= TREE_TYPE (ptrop
);
3887 /* pointer_int_sum() uses size_in_bytes() on the TREE_TYPE(res_type)
3888 in certain circumstance (when it's valid to do so). So we need
3889 to make sure it's complete. We don't need to check here, if we
3890 can actually complete it at all, as those checks will be done in
3891 pointer_int_sum() anyway. */
3892 complete_type (TREE_TYPE (res_type
));
3894 return pointer_int_sum (resultcode
, ptrop
, fold (intop
));
3897 /* Return a tree for the difference of pointers OP0 and OP1.
3898 The resulting tree has type int. */
3901 pointer_diff (op0
, op1
, ptrtype
)
3902 register tree op0
, op1
;
3903 register tree ptrtype
;
3905 register tree result
, folded
;
3906 tree restype
= ptrdiff_type_node
;
3907 tree target_type
= TREE_TYPE (ptrtype
);
3909 if (!complete_type_or_else (target_type
, NULL_TREE
))
3910 return error_mark_node
;
3912 if (pedantic
|| warn_pointer_arith
)
3914 if (TREE_CODE (target_type
) == VOID_TYPE
)
3915 pedwarn ("ISO C++ forbids using pointer of type `void *' in subtraction");
3916 if (TREE_CODE (target_type
) == FUNCTION_TYPE
)
3917 pedwarn ("ISO C++ forbids using pointer to a function in subtraction");
3918 if (TREE_CODE (target_type
) == METHOD_TYPE
)
3919 pedwarn ("ISO C++ forbids using pointer to a method in subtraction");
3920 if (TREE_CODE (target_type
) == OFFSET_TYPE
)
3921 pedwarn ("ISO C++ forbids using pointer to a member in subtraction");
3924 /* First do the subtraction as integers;
3925 then drop through to build the divide operator. */
3927 op0
= cp_build_binary_op (MINUS_EXPR
,
3928 cp_convert (restype
, op0
),
3929 cp_convert (restype
, op1
));
3931 /* This generates an error if op1 is a pointer to an incomplete type. */
3932 if (!COMPLETE_TYPE_P (TREE_TYPE (TREE_TYPE (op1
))))
3933 error ("invalid use of a pointer to an incomplete type in pointer arithmetic");
3935 op1
= ((TREE_CODE (target_type
) == VOID_TYPE
3936 || TREE_CODE (target_type
) == FUNCTION_TYPE
3937 || TREE_CODE (target_type
) == METHOD_TYPE
3938 || TREE_CODE (target_type
) == OFFSET_TYPE
)
3940 : size_in_bytes (target_type
));
3942 /* Do the division. */
3944 result
= build (EXACT_DIV_EXPR
, restype
, op0
, cp_convert (restype
, op1
));
3946 folded
= fold (result
);
3947 if (folded
== result
)
3948 TREE_CONSTANT (folded
) = TREE_CONSTANT (op0
) & TREE_CONSTANT (op1
);
3952 /* Construct and perhaps optimize a tree representation
3953 for a unary operation. CODE, a tree_code, specifies the operation
3954 and XARG is the operand. */
3957 build_x_unary_op (code
, xarg
)
3958 enum tree_code code
;
3964 if (processing_template_decl
)
3965 return build_min_nt (code
, xarg
, NULL_TREE
);
3967 /* & rec, on incomplete RECORD_TYPEs is the simple opr &, not an
3969 if (code
== ADDR_EXPR
3970 && TREE_CODE (xarg
) != TEMPLATE_ID_EXPR
3971 && ((IS_AGGR_TYPE_CODE (TREE_CODE (TREE_TYPE (xarg
)))
3972 && !COMPLETE_TYPE_P (TREE_TYPE (xarg
)))
3973 || (TREE_CODE (xarg
) == OFFSET_REF
)))
3974 /* don't look for a function */;
3979 rval
= build_new_op (code
, LOOKUP_NORMAL
, xarg
,
3980 NULL_TREE
, NULL_TREE
);
3981 if (rval
|| code
!= ADDR_EXPR
)
3984 if (code
== ADDR_EXPR
)
3986 /* A pointer to member-function can be formed only by saying
3988 if (!flag_ms_extensions
&& TREE_CODE (TREE_TYPE (xarg
)) == METHOD_TYPE
3989 && (TREE_CODE (xarg
) != OFFSET_REF
|| !PTRMEM_OK_P (xarg
)))
3991 if (TREE_CODE (xarg
) != OFFSET_REF
)
3993 error ("invalid use of '%E' to form a pointer-to-member-function. Use a qualified-id.",
3995 return error_mark_node
;
3999 error ("parenthesis around '%E' cannot be used to form a pointer-to-member-function",
4001 PTRMEM_OK_P (xarg
) = 1;
4005 if (TREE_CODE (xarg
) == OFFSET_REF
)
4007 ptrmem
= PTRMEM_OK_P (xarg
);
4009 if (!ptrmem
&& !flag_ms_extensions
4010 && TREE_CODE (TREE_TYPE (TREE_OPERAND (xarg
, 1))) == METHOD_TYPE
)
4012 /* A single non-static member, make sure we don't allow a
4013 pointer-to-member. */
4014 xarg
= build (OFFSET_REF
, TREE_TYPE (xarg
),
4015 TREE_OPERAND (xarg
, 0),
4016 ovl_cons (TREE_OPERAND (xarg
, 1), NULL_TREE
));
4017 PTRMEM_OK_P (xarg
) = ptrmem
;
4021 else if (TREE_CODE (xarg
) == TARGET_EXPR
)
4022 warning ("taking address of temporary");
4024 exp
= build_unary_op (code
, xarg
, 0);
4025 if (TREE_CODE (exp
) == ADDR_EXPR
)
4026 PTRMEM_OK_P (exp
) = ptrmem
;
4031 /* Like c_common_truthvalue_conversion, but handle pointer-to-member
4032 constants, where a null value is represented by an INTEGER_CST of
4036 cp_truthvalue_conversion (expr
)
4039 tree type
= TREE_TYPE (expr
);
4040 if (TYPE_PTRMEM_P (type
))
4041 return build_binary_op (NE_EXPR
, expr
, integer_zero_node
, 1);
4043 return c_common_truthvalue_conversion (expr
);
4046 /* Just like cp_truthvalue_conversion, but we want a CLEANUP_POINT_EXPR. */
4049 condition_conversion (expr
)
4053 if (processing_template_decl
)
4055 if (TREE_CODE (expr
) == OFFSET_REF
)
4056 expr
= resolve_offset_ref (expr
);
4057 t
= perform_implicit_conversion (boolean_type_node
, expr
);
4058 t
= fold (build1 (CLEANUP_POINT_EXPR
, boolean_type_node
, t
));
4062 /* Return an ADDR_EXPR giving the address of T. This function
4063 attempts no optimizations or simplifications; it is a low-level
4067 build_address (tree t
)
4071 if (error_operand_p (t
) || !cxx_mark_addressable (t
))
4072 return error_mark_node
;
4074 addr
= build1 (ADDR_EXPR
,
4075 build_pointer_type (TREE_TYPE (t
)),
4078 TREE_CONSTANT (addr
) = 1;
4083 /* Return a NOP_EXPR converting EXPR to TYPE. */
4086 build_nop (tree type
, tree expr
)
4090 if (type
== error_mark_node
|| error_operand_p (expr
))
4093 nop
= build1 (NOP_EXPR
, type
, expr
);
4094 if (TREE_CONSTANT (expr
))
4095 TREE_CONSTANT (nop
) = 1;
4100 /* C++: Must handle pointers to members.
4102 Perhaps type instantiation should be extended to handle conversion
4103 from aggregates to types we don't yet know we want? (Or are those
4104 cases typically errors which should be reported?)
4106 NOCONVERT nonzero suppresses the default promotions
4107 (such as from short to int). */
4110 build_unary_op (code
, xarg
, noconvert
)
4111 enum tree_code code
;
4115 /* No default_conversion here. It causes trouble for ADDR_EXPR. */
4116 register tree arg
= xarg
;
4117 register tree argtype
= 0;
4118 const char *errstring
= NULL
;
4121 if (arg
== error_mark_node
)
4122 return error_mark_node
;
4127 /* This is used for unary plus, because a CONVERT_EXPR
4128 is enough to prevent anybody from looking inside for
4129 associativity, but won't generate any code. */
4130 if (!(arg
= build_expr_type_conversion
4131 (WANT_ARITH
| WANT_ENUM
| WANT_POINTER
, arg
, true)))
4132 errstring
= "wrong type argument to unary plus";
4136 arg
= default_conversion (arg
);
4137 arg
= build1 (NON_LVALUE_EXPR
, TREE_TYPE (arg
), arg
);
4138 TREE_CONSTANT (arg
) = TREE_CONSTANT (TREE_OPERAND (arg
, 0));
4143 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4144 errstring
= "wrong type argument to unary minus";
4145 else if (!noconvert
)
4146 arg
= default_conversion (arg
);
4150 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4154 arg
= default_conversion (arg
);
4156 else if (!(arg
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
,
4158 errstring
= "wrong type argument to bit-complement";
4159 else if (!noconvert
)
4160 arg
= default_conversion (arg
);
4164 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4165 errstring
= "wrong type argument to abs";
4166 else if (!noconvert
)
4167 arg
= default_conversion (arg
);
4171 /* Conjugating a real value is a no-op, but allow it anyway. */
4172 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_ENUM
, arg
, true)))
4173 errstring
= "wrong type argument to conjugation";
4174 else if (!noconvert
)
4175 arg
= default_conversion (arg
);
4178 case TRUTH_NOT_EXPR
:
4179 arg
= cp_convert (boolean_type_node
, arg
);
4180 val
= invert_truthvalue (arg
);
4181 if (arg
!= error_mark_node
)
4183 errstring
= "in argument to unary !";
4190 if (TREE_CODE (arg
) == COMPLEX_CST
)
4191 return TREE_REALPART (arg
);
4192 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4193 return fold (build1 (REALPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
4198 if (TREE_CODE (arg
) == COMPLEX_CST
)
4199 return TREE_IMAGPART (arg
);
4200 else if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4201 return fold (build1 (IMAGPART_EXPR
, TREE_TYPE (TREE_TYPE (arg
)), arg
));
4203 return cp_convert (TREE_TYPE (arg
), integer_zero_node
);
4205 case PREINCREMENT_EXPR
:
4206 case POSTINCREMENT_EXPR
:
4207 case PREDECREMENT_EXPR
:
4208 case POSTDECREMENT_EXPR
:
4209 /* Handle complex lvalues (when permitted)
4210 by reduction to simpler cases. */
4212 val
= unary_complex_lvalue (code
, arg
);
4216 /* Increment or decrement the real part of the value,
4217 and don't change the imaginary part. */
4218 if (TREE_CODE (TREE_TYPE (arg
)) == COMPLEX_TYPE
)
4222 arg
= stabilize_reference (arg
);
4223 real
= build_unary_op (REALPART_EXPR
, arg
, 1);
4224 imag
= build_unary_op (IMAGPART_EXPR
, arg
, 1);
4225 return build (COMPLEX_EXPR
, TREE_TYPE (arg
),
4226 build_unary_op (code
, real
, 1), imag
);
4229 /* Report invalid types. */
4231 if (!(arg
= build_expr_type_conversion (WANT_ARITH
| WANT_POINTER
,
4234 if (code
== PREINCREMENT_EXPR
)
4235 errstring
="no pre-increment operator for type";
4236 else if (code
== POSTINCREMENT_EXPR
)
4237 errstring
="no post-increment operator for type";
4238 else if (code
== PREDECREMENT_EXPR
)
4239 errstring
="no pre-decrement operator for type";
4241 errstring
="no post-decrement operator for type";
4245 /* Report something read-only. */
4247 if (CP_TYPE_CONST_P (TREE_TYPE (arg
))
4248 || TREE_READONLY (arg
))
4249 readonly_error (arg
, ((code
== PREINCREMENT_EXPR
4250 || code
== POSTINCREMENT_EXPR
)
4251 ? "increment" : "decrement"),
4256 tree result_type
= TREE_TYPE (arg
);
4258 arg
= get_unwidened (arg
, 0);
4259 argtype
= TREE_TYPE (arg
);
4261 /* ARM $5.2.5 last annotation says this should be forbidden. */
4262 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
)
4263 pedwarn ("ISO C++ forbids %sing an enum",
4264 (code
== PREINCREMENT_EXPR
|| code
== POSTINCREMENT_EXPR
)
4265 ? "increment" : "decrement");
4267 /* Compute the increment. */
4269 if (TREE_CODE (argtype
) == POINTER_TYPE
)
4271 enum tree_code tmp
= TREE_CODE (TREE_TYPE (argtype
));
4272 tree type
= complete_type (TREE_TYPE (argtype
));
4274 if (!COMPLETE_OR_VOID_TYPE_P (type
))
4275 error ("cannot %s a pointer to incomplete type `%T'",
4276 ((code
== PREINCREMENT_EXPR
4277 || code
== POSTINCREMENT_EXPR
)
4278 ? "increment" : "decrement"), TREE_TYPE (argtype
));
4279 else if ((pedantic
|| warn_pointer_arith
)
4280 && (tmp
== FUNCTION_TYPE
|| tmp
== METHOD_TYPE
4281 || tmp
== VOID_TYPE
|| tmp
== OFFSET_TYPE
))
4282 pedwarn ("ISO C++ forbids %sing a pointer of type `%T'",
4283 ((code
== PREINCREMENT_EXPR
4284 || code
== POSTINCREMENT_EXPR
)
4285 ? "increment" : "decrement"), argtype
);
4286 inc
= cxx_sizeof_nowarn (TREE_TYPE (argtype
));
4289 inc
= integer_one_node
;
4291 inc
= cp_convert (argtype
, inc
);
4293 /* Handle incrementing a cast-expression. */
4295 switch (TREE_CODE (arg
))
4300 case FIX_TRUNC_EXPR
:
4301 case FIX_FLOOR_EXPR
:
4302 case FIX_ROUND_EXPR
:
4305 tree incremented
, modify
, value
, compound
;
4306 if (! lvalue_p (arg
) && pedantic
)
4307 pedwarn ("cast to non-reference type used as lvalue");
4308 arg
= stabilize_reference (arg
);
4309 if (code
== PREINCREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4312 value
= save_expr (arg
);
4313 incremented
= build (((code
== PREINCREMENT_EXPR
4314 || code
== POSTINCREMENT_EXPR
)
4315 ? PLUS_EXPR
: MINUS_EXPR
),
4316 argtype
, value
, inc
);
4318 modify
= build_modify_expr (arg
, NOP_EXPR
, incremented
);
4319 compound
= build (COMPOUND_EXPR
, TREE_TYPE (arg
), modify
, value
);
4321 /* Eliminate warning about unused result of + or -. */
4322 TREE_NO_UNUSED_WARNING (compound
) = 1;
4330 /* Complain about anything else that is not a true lvalue. */
4331 if (!lvalue_or_else (arg
, ((code
== PREINCREMENT_EXPR
4332 || code
== POSTINCREMENT_EXPR
)
4333 ? "increment" : "decrement")))
4334 return error_mark_node
;
4336 /* Forbid using -- on `bool'. */
4337 if (TREE_TYPE (arg
) == boolean_type_node
)
4339 if (code
== POSTDECREMENT_EXPR
|| code
== PREDECREMENT_EXPR
)
4341 error ("invalid use of `--' on bool variable `%D'", arg
);
4342 return error_mark_node
;
4345 /* This will only work if someone can convince Kenner to accept
4346 my patch to expand_increment. (jason) */
4347 val
= build (code
, TREE_TYPE (arg
), arg
, inc
);
4349 val
= boolean_increment (code
, arg
);
4353 val
= build (code
, TREE_TYPE (arg
), arg
, inc
);
4355 TREE_SIDE_EFFECTS (val
) = 1;
4356 return cp_convert (result_type
, val
);
4360 /* Note that this operation never does default_conversion
4361 regardless of NOCONVERT. */
4363 argtype
= lvalue_type (arg
);
4364 if (TREE_CODE (argtype
) == REFERENCE_TYPE
)
4368 build_pointer_type (TREE_TYPE (argtype
)), arg
);
4369 TREE_CONSTANT (arg
) = TREE_CONSTANT (TREE_OPERAND (arg
, 0));
4372 else if (pedantic
&& DECL_MAIN_P (arg
))
4374 pedwarn ("ISO C++ forbids taking address of function `::main'");
4376 /* Let &* cancel out to simplify resulting code. */
4377 if (TREE_CODE (arg
) == INDIRECT_REF
)
4379 /* We don't need to have `current_class_ptr' wrapped in a
4380 NON_LVALUE_EXPR node. */
4381 if (arg
== current_class_ref
)
4382 return current_class_ptr
;
4384 arg
= TREE_OPERAND (arg
, 0);
4385 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
)
4389 build_pointer_type (TREE_TYPE (TREE_TYPE (arg
))), arg
);
4390 TREE_CONSTANT (arg
) = TREE_CONSTANT (TREE_OPERAND (arg
, 0));
4392 else if (lvalue_p (arg
))
4393 /* Don't let this be an lvalue. */
4394 return non_lvalue (arg
);
4398 /* For &x[y], return x+y */
4399 if (TREE_CODE (arg
) == ARRAY_REF
)
4401 if (!cxx_mark_addressable (TREE_OPERAND (arg
, 0)))
4402 return error_mark_node
;
4403 return cp_build_binary_op (PLUS_EXPR
, TREE_OPERAND (arg
, 0),
4404 TREE_OPERAND (arg
, 1));
4407 /* Uninstantiated types are all functions. Taking the
4408 address of a function is a no-op, so just return the
4411 if (TREE_CODE (arg
) == IDENTIFIER_NODE
4412 && IDENTIFIER_OPNAME_P (arg
))
4415 /* We don't know the type yet, so just work around the problem.
4416 We know that this will resolve to an lvalue. */
4417 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4420 if (TREE_CODE (arg
) == COMPONENT_REF
&& type_unknown_p (arg
)
4421 && !really_overloaded_fn (TREE_OPERAND (arg
, 1)))
4423 /* They're trying to take the address of a unique non-static
4424 member function. This is ill-formed (except in MS-land),
4425 but let's try to DTRT.
4426 Note: We only handle unique functions here because we don't
4427 want to complain if there's a static overload; non-unique
4428 cases will be handled by instantiate_type. But we need to
4429 handle this case here to allow casts on the resulting PMF.
4430 We could defer this in non-MS mode, but it's easier to give
4431 a useful error here. */
4433 /* Inside constant member functions, the `this' pointer
4434 contains an extra const qualifier. TYPE_MAIN_VARIANT
4435 is used here to remove this const from the diagnostics
4436 and the created OFFSET_REF. */
4437 tree base
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (arg
, 0)));
4438 tree name
= DECL_NAME (get_first_fn (TREE_OPERAND (arg
, 1)));
4440 if (! flag_ms_extensions
)
4442 if (current_class_type
4443 && TREE_OPERAND (arg
, 0) == current_class_ref
)
4444 /* An expression like &memfn. */
4445 pedwarn ("ISO C++ forbids taking the address of an unqualified"
4446 " or parenthesized non-static member function to form"
4447 " a pointer to member function. Say `&%T::%D'",
4450 pedwarn ("ISO C++ forbids taking the address of a bound member"
4451 " function to form a pointer to member function."
4455 arg
= build_offset_ref (base
, name
);
4458 if (type_unknown_p (arg
))
4459 return build1 (ADDR_EXPR
, unknown_type_node
, arg
);
4461 /* Handle complex lvalues (when permitted)
4462 by reduction to simpler cases. */
4463 val
= unary_complex_lvalue (code
, arg
);
4467 switch (TREE_CODE (arg
))
4472 case FIX_TRUNC_EXPR
:
4473 case FIX_FLOOR_EXPR
:
4474 case FIX_ROUND_EXPR
:
4476 if (! lvalue_p (arg
) && pedantic
)
4477 pedwarn ("ISO C++ forbids taking the address of a cast to a non-lvalue expression");
4484 /* Allow the address of a constructor if all the elements
4486 if (TREE_CODE (arg
) == CONSTRUCTOR
&& TREE_HAS_CONSTRUCTOR (arg
)
4487 && TREE_CONSTANT (arg
))
4489 /* Anything not already handled and not a true memory reference
4491 else if (TREE_CODE (argtype
) != FUNCTION_TYPE
4492 && TREE_CODE (argtype
) != METHOD_TYPE
4493 && !non_cast_lvalue_or_else (arg
, "unary `&'"))
4494 return error_mark_node
;
4496 if (argtype
!= error_mark_node
)
4497 argtype
= build_pointer_type (argtype
);
4502 if (TREE_CODE (arg
) == COMPONENT_REF
4503 && TREE_CODE (TREE_OPERAND (arg
, 1)) == BASELINK
)
4504 arg
= BASELINK_FUNCTIONS (TREE_OPERAND (arg
, 1));
4506 if (TREE_CODE (arg
) != COMPONENT_REF
)
4507 addr
= build_address (arg
);
4508 else if (DECL_C_BIT_FIELD (TREE_OPERAND (arg
, 1)))
4510 error ("attempt to take address of bit-field structure member `%D'",
4511 TREE_OPERAND (arg
, 1));
4512 return error_mark_node
;
4516 /* Unfortunately we cannot just build an address
4517 expression here, because we would not handle
4518 address-constant-expressions or offsetof correctly. */
4519 tree field
= TREE_OPERAND (arg
, 1);
4520 tree rval
= build_unary_op (ADDR_EXPR
, TREE_OPERAND (arg
, 0), 0);
4521 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (rval
)),
4522 decl_type_context (field
),
4525 rval
= build_base_path (PLUS_EXPR
, rval
, binfo
, 1);
4526 rval
= build1 (NOP_EXPR
, argtype
, rval
);
4527 TREE_CONSTANT (rval
) = TREE_CONSTANT (TREE_OPERAND (rval
, 0));
4528 addr
= fold (build (PLUS_EXPR
, argtype
, rval
,
4529 cp_convert (argtype
, byte_position (field
))));
4532 if (TREE_CODE (argtype
) == POINTER_TYPE
4533 && TREE_CODE (TREE_TYPE (argtype
)) == METHOD_TYPE
)
4535 build_ptrmemfunc_type (argtype
);
4536 addr
= build_ptrmemfunc (argtype
, addr
, 0);
4549 argtype
= TREE_TYPE (arg
);
4550 return fold (build1 (code
, argtype
, arg
));
4553 error ("%s", errstring
);
4554 return error_mark_node
;
4557 /* Apply unary lvalue-demanding operator CODE to the expression ARG
4558 for certain kinds of expressions which are not really lvalues
4559 but which we can accept as lvalues.
4561 If ARG is not a kind of expression we can handle, return zero. */
4564 unary_complex_lvalue (code
, arg
)
4565 enum tree_code code
;
4568 /* Handle (a, b) used as an "lvalue". */
4569 if (TREE_CODE (arg
) == COMPOUND_EXPR
)
4571 tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 1), 0);
4572 return build (COMPOUND_EXPR
, TREE_TYPE (real_result
),
4573 TREE_OPERAND (arg
, 0), real_result
);
4576 /* Handle (a ? b : c) used as an "lvalue". */
4577 if (TREE_CODE (arg
) == COND_EXPR
4578 || TREE_CODE (arg
) == MIN_EXPR
|| TREE_CODE (arg
) == MAX_EXPR
)
4579 return rationalize_conditional_expr (code
, arg
);
4581 /* Handle (a = b), (++a), and (--a) used as an "lvalue". */
4582 if (TREE_CODE (arg
) == MODIFY_EXPR
4583 || TREE_CODE (arg
) == PREINCREMENT_EXPR
4584 || TREE_CODE (arg
) == PREDECREMENT_EXPR
)
4586 tree lvalue
= TREE_OPERAND (arg
, 0);
4587 if (TREE_SIDE_EFFECTS (lvalue
))
4589 lvalue
= stabilize_reference (lvalue
);
4590 arg
= build (TREE_CODE (arg
), TREE_TYPE (arg
),
4591 lvalue
, TREE_OPERAND (arg
, 1));
4593 return unary_complex_lvalue
4594 (code
, build (COMPOUND_EXPR
, TREE_TYPE (lvalue
), arg
, lvalue
));
4597 if (code
!= ADDR_EXPR
)
4600 /* Handle (a = b) used as an "lvalue" for `&'. */
4601 if (TREE_CODE (arg
) == MODIFY_EXPR
4602 || TREE_CODE (arg
) == INIT_EXPR
)
4604 tree real_result
= build_unary_op (code
, TREE_OPERAND (arg
, 0), 0);
4605 arg
= build (COMPOUND_EXPR
, TREE_TYPE (real_result
), arg
, real_result
);
4606 TREE_NO_UNUSED_WARNING (arg
) = 1;
4610 if (TREE_CODE (TREE_TYPE (arg
)) == FUNCTION_TYPE
4611 || TREE_CODE (TREE_TYPE (arg
)) == METHOD_TYPE
4612 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
)
4614 /* The representation of something of type OFFSET_TYPE
4615 is really the representation of a pointer to it.
4616 Here give the representation its true type. */
4619 my_friendly_assert (TREE_CODE (arg
) != SCOPE_REF
, 313);
4621 if (TREE_CODE (arg
) != OFFSET_REF
)
4624 t
= TREE_OPERAND (arg
, 1);
4626 /* Check all this code for right semantics. */
4627 if (TREE_CODE (t
) == FUNCTION_DECL
)
4629 if (DECL_DESTRUCTOR_P (t
))
4630 error ("taking address of destructor");
4631 return build_unary_op (ADDR_EXPR
, t
, 0);
4633 if (TREE_CODE (t
) == VAR_DECL
)
4634 return build_unary_op (ADDR_EXPR
, t
, 0);
4639 if (TREE_OPERAND (arg
, 0)
4640 && ! is_dummy_object (TREE_OPERAND (arg
, 0))
4641 && TREE_CODE (t
) != FIELD_DECL
)
4643 error ("taking address of bound pointer-to-member expression");
4644 return error_mark_node
;
4646 if (!PTRMEM_OK_P (arg
))
4648 /* This cannot form a pointer to method, so we must
4649 resolve the offset ref, and take the address of the
4650 result. For instance,
4652 arg
= resolve_offset_ref (arg
);
4654 return build_unary_op (code
, arg
, 0);
4657 if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
4659 error ("cannot create pointer to reference member `%D'", t
);
4660 return error_mark_node
;
4663 type
= build_ptrmem_type (DECL_FIELD_CONTEXT (t
), TREE_TYPE (t
));
4664 t
= make_ptrmem_cst (type
, TREE_OPERAND (arg
, 1));
4670 /* We permit compiler to make function calls returning
4671 objects of aggregate type look like lvalues. */
4675 if (TREE_CODE (targ
) == SAVE_EXPR
)
4676 targ
= TREE_OPERAND (targ
, 0);
4678 if (TREE_CODE (targ
) == CALL_EXPR
&& IS_AGGR_TYPE (TREE_TYPE (targ
)))
4680 if (TREE_CODE (arg
) == SAVE_EXPR
)
4683 targ
= build_cplus_new (TREE_TYPE (arg
), arg
);
4684 return build1 (ADDR_EXPR
, build_pointer_type (TREE_TYPE (arg
)), targ
);
4687 if (TREE_CODE (arg
) == SAVE_EXPR
&& TREE_CODE (targ
) == INDIRECT_REF
)
4688 return build (SAVE_EXPR
, build_pointer_type (TREE_TYPE (arg
)),
4689 TREE_OPERAND (targ
, 0), current_function_decl
, NULL
);
4692 /* Don't let anything else be handled specially. */
4696 /* Mark EXP saying that we need to be able to take the
4697 address of it; it should not be allocated in a register.
4698 Value is true if successful.
4700 C++: we do not allow `current_class_ptr' to be addressable. */
4703 cxx_mark_addressable (exp
)
4706 register tree x
= exp
;
4709 switch (TREE_CODE (x
))
4716 x
= TREE_OPERAND (x
, 0);
4720 if (x
== current_class_ptr
)
4722 error ("cannot take the address of `this', which is an rvalue expression");
4723 TREE_ADDRESSABLE (x
) = 1; /* so compiler doesn't die later */
4729 /* Caller should not be trying to mark initialized
4730 constant fields addressable. */
4731 my_friendly_assert (DECL_LANG_SPECIFIC (x
) == 0
4732 || DECL_IN_AGGR_P (x
) == 0
4734 || DECL_EXTERNAL (x
), 314);
4739 if (DECL_REGISTER (x
) && !TREE_ADDRESSABLE (x
)
4740 && !DECL_ARTIFICIAL (x
) && extra_warnings
)
4741 warning ("address requested for `%D', which is declared `register'",
4743 TREE_ADDRESSABLE (x
) = 1;
4744 put_var_into_stack (x
, /*rescan=*/true);
4748 TREE_ADDRESSABLE (x
) = 1;
4749 TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x
)) = 1;
4753 TREE_ADDRESSABLE (x
) = 1;
4757 TREE_ADDRESSABLE (x
) = 1;
4758 cxx_mark_addressable (TREE_OPERAND (x
, 0));
4766 /* Build and return a conditional expression IFEXP ? OP1 : OP2. */
4769 build_x_conditional_expr (ifexp
, op1
, op2
)
4770 tree ifexp
, op1
, op2
;
4772 if (processing_template_decl
)
4773 return build_min_nt (COND_EXPR
, ifexp
, op1
, op2
);
4775 return build_conditional_expr (ifexp
, op1
, op2
);
4778 /* Handle overloading of the ',' operator when needed. Otherwise,
4779 this function just builds an expression list. */
4782 build_x_compound_expr (list
)
4785 tree rest
= TREE_CHAIN (list
);
4788 if (processing_template_decl
)
4789 return build_min_nt (COMPOUND_EXPR
, list
, NULL_TREE
);
4791 if (rest
== NULL_TREE
)
4792 return build_compound_expr (list
);
4794 result
= build_new_op (COMPOUND_EXPR
, LOOKUP_NORMAL
,
4795 TREE_VALUE (list
), TREE_VALUE (rest
), NULL_TREE
);
4797 return build_x_compound_expr (tree_cons (NULL_TREE
, result
,
4798 TREE_CHAIN (rest
)));
4800 if (! TREE_SIDE_EFFECTS (TREE_VALUE (list
)))
4802 /* FIXME: This test should be in the implicit cast to void of the LHS. */
4803 /* the left-hand operand of a comma expression is like an expression
4804 statement: we should warn if it doesn't have any side-effects,
4805 unless it was explicitly cast to (void). */
4806 if (warn_unused_value
4807 && !(TREE_CODE (TREE_VALUE(list
)) == CONVERT_EXPR
4808 && VOID_TYPE_P (TREE_TYPE (TREE_VALUE(list
)))))
4809 warning("left-hand operand of comma expression has no effect");
4811 #if 0 /* this requires a gcc backend patch to export warn_if_unused_value */
4812 else if (warn_unused_value
)
4813 warn_if_unused_value (TREE_VALUE(list
));
4816 return build_compound_expr
4817 (tree_cons (NULL_TREE
, TREE_VALUE (list
),
4818 build_tree_list (NULL_TREE
,
4819 build_x_compound_expr (rest
))));
4822 /* Given a list of expressions, return a compound expression
4823 that performs them all and returns the value of the last of them. */
4826 build_compound_expr (list
)
4832 TREE_VALUE (list
) = decl_constant_value (TREE_VALUE (list
));
4834 if (TREE_CHAIN (list
) == 0)
4836 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
4837 Strip such NOP_EXPRs, since LIST is used in non-lvalue context. */
4838 if (TREE_CODE (list
) == NOP_EXPR
4839 && TREE_TYPE (list
) == TREE_TYPE (TREE_OPERAND (list
, 0)))
4840 list
= TREE_OPERAND (list
, 0);
4842 return TREE_VALUE (list
);
4845 first
= TREE_VALUE (list
);
4846 first
= convert_to_void (first
, "left-hand operand of comma");
4847 if (first
== error_mark_node
)
4848 return error_mark_node
;
4850 rest
= build_compound_expr (TREE_CHAIN (list
));
4851 if (rest
== error_mark_node
)
4852 return error_mark_node
;
4854 /* When pedantic, a compound expression cannot be a constant expression. */
4855 if (! TREE_SIDE_EFFECTS (first
) && ! pedantic
)
4858 return build (COMPOUND_EXPR
, TREE_TYPE (rest
), first
, rest
);
4862 build_static_cast (type
, expr
)
4868 if (type
== error_mark_node
|| expr
== error_mark_node
)
4869 return error_mark_node
;
4871 if (TREE_CODE (expr
) == OFFSET_REF
)
4872 expr
= resolve_offset_ref (expr
);
4874 if (processing_template_decl
)
4876 tree t
= build_min (STATIC_CAST_EXPR
, type
, expr
);
4880 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
4881 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
4882 if (TREE_CODE (type
) != REFERENCE_TYPE
4883 && TREE_CODE (expr
) == NOP_EXPR
4884 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
4885 expr
= TREE_OPERAND (expr
, 0);
4887 if (TREE_CODE (type
) == VOID_TYPE
)
4889 expr
= convert_to_void (expr
, /*implicit=*/NULL
);
4893 if (TREE_CODE (type
) == REFERENCE_TYPE
)
4894 return (convert_from_reference
4895 (convert_to_reference (type
, expr
, CONV_STATIC
|CONV_IMPLICIT
,
4896 LOOKUP_COMPLAIN
, NULL_TREE
)));
4898 if (IS_AGGR_TYPE (type
))
4899 return build_cplus_new (type
, (build_special_member_call
4900 (NULL_TREE
, complete_ctor_identifier
,
4901 build_tree_list (NULL_TREE
, expr
),
4902 TYPE_BINFO (type
), LOOKUP_NORMAL
)));
4904 intype
= TREE_TYPE (expr
);
4906 /* FIXME handle casting to array type. */
4909 if (IS_AGGR_TYPE (intype
)
4910 ? can_convert_arg (type
, intype
, expr
)
4911 : can_convert_arg (strip_all_pointer_quals (type
),
4912 strip_all_pointer_quals (intype
), expr
))
4913 /* This is a standard conversion. */
4915 else if (TYPE_PTROB_P (type
) && TYPE_PTROB_P (intype
))
4917 /* They're pointers to objects. They must be aggregates that
4918 are related non-virtually. */
4921 if (IS_AGGR_TYPE (TREE_TYPE (type
)) && IS_AGGR_TYPE (TREE_TYPE (intype
))
4922 && lookup_base (TREE_TYPE (type
), TREE_TYPE (intype
),
4923 ba_ignore
| ba_quiet
, &kind
)
4924 && kind
!= bk_via_virtual
)
4927 else if (TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
4929 /* They're pointers to members. The pointed to objects must be
4930 the same (ignoring CV qualifiers), and the containing classes
4931 must be related non-virtually. */
4935 (strip_all_pointer_quals (TREE_TYPE (TREE_TYPE (type
))),
4936 strip_all_pointer_quals (TREE_TYPE (TREE_TYPE (intype
))))
4937 && (lookup_base (TYPE_OFFSET_BASETYPE (TREE_TYPE (intype
)),
4938 TYPE_OFFSET_BASETYPE (TREE_TYPE (type
)),
4939 ba_ignore
| ba_quiet
, &kind
))
4940 && kind
!= bk_via_virtual
)
4943 else if (TREE_CODE (intype
) != BOOLEAN_TYPE
4944 && TREE_CODE (type
) != ARRAY_TYPE
4945 && TREE_CODE (type
) != FUNCTION_TYPE
4946 && can_convert (intype
, strip_all_pointer_quals (type
)))
4948 else if (TREE_CODE (intype
) == ENUMERAL_TYPE
4949 && TREE_CODE (type
) == ENUMERAL_TYPE
)
4950 /* DR 128: "A value of integral _or enumeration_ type can be explicitly
4951 converted to an enumeration type."
4952 The integral to enumeration will be accepted by the previous clause.
4953 We need to explicitly check for enumeration to enumeration. */
4956 /* [expr.static.cast]
4958 The static_cast operator shall not be used to cast away
4960 if (ok
&& casts_away_constness (intype
, type
))
4962 error ("static_cast from type `%T' to type `%T' casts away constness",
4964 return error_mark_node
;
4968 return build_c_cast (type
, expr
);
4970 error ("invalid static_cast from type `%T' to type `%T'", intype
, type
);
4971 return error_mark_node
;
4975 build_reinterpret_cast (type
, expr
)
4980 if (type
== error_mark_node
|| expr
== error_mark_node
)
4981 return error_mark_node
;
4983 if (TREE_CODE (expr
) == OFFSET_REF
)
4984 expr
= resolve_offset_ref (expr
);
4986 if (processing_template_decl
)
4988 tree t
= build_min (REINTERPRET_CAST_EXPR
, type
, expr
);
4992 if (TREE_CODE (type
) != REFERENCE_TYPE
)
4994 expr
= decay_conversion (expr
);
4996 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
4997 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
4998 if (TREE_CODE (expr
) == NOP_EXPR
4999 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5000 expr
= TREE_OPERAND (expr
, 0);
5003 intype
= TREE_TYPE (expr
);
5005 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5007 if (! real_lvalue_p (expr
))
5009 error ("invalid reinterpret_cast of an rvalue expression of type `%T' to type `%T'", intype
, type
);
5010 return error_mark_node
;
5012 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
5013 if (expr
!= error_mark_node
)
5014 expr
= build_reinterpret_cast
5015 (build_pointer_type (TREE_TYPE (type
)), expr
);
5016 if (expr
!= error_mark_node
)
5017 expr
= build_indirect_ref (expr
, 0);
5020 else if (same_type_ignoring_top_level_qualifiers_p (intype
, type
))
5021 return build_static_cast (type
, expr
);
5023 if (TYPE_PTR_P (type
) && (TREE_CODE (intype
) == INTEGER_TYPE
5024 || TREE_CODE (intype
) == ENUMERAL_TYPE
))
5026 else if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_PTR_P (intype
))
5028 if (TYPE_PRECISION (type
) < TYPE_PRECISION (intype
))
5029 pedwarn ("reinterpret_cast from `%T' to `%T' loses precision",
5032 else if ((TYPE_PTRFN_P (type
) && TYPE_PTRFN_P (intype
))
5033 || (TYPE_PTRMEMFUNC_P (type
) && TYPE_PTRMEMFUNC_P (intype
)))
5035 expr
= decl_constant_value (expr
);
5036 return fold (build1 (NOP_EXPR
, type
, expr
));
5038 else if ((TYPE_PTRMEM_P (type
) && TYPE_PTRMEM_P (intype
))
5039 || (TYPE_PTROBV_P (type
) && TYPE_PTROBV_P (intype
)))
5041 if (! comp_ptr_ttypes_reinterpret (TREE_TYPE (type
), TREE_TYPE (intype
)))
5042 pedwarn ("reinterpret_cast from `%T' to `%T' casts away const (or volatile)",
5045 expr
= decl_constant_value (expr
);
5046 return fold (build1 (NOP_EXPR
, type
, expr
));
5048 else if ((TYPE_PTRFN_P (type
) && TYPE_PTROBV_P (intype
))
5049 || (TYPE_PTRFN_P (intype
) && TYPE_PTROBV_P (type
)))
5051 pedwarn ("ISO C++ forbids casting between pointer-to-function and pointer-to-object");
5052 expr
= decl_constant_value (expr
);
5053 return fold (build1 (NOP_EXPR
, type
, expr
));
5057 error ("invalid reinterpret_cast from type `%T' to type `%T'",
5059 return error_mark_node
;
5062 return cp_convert (type
, expr
);
5066 build_const_cast (type
, expr
)
5071 if (type
== error_mark_node
|| expr
== error_mark_node
)
5072 return error_mark_node
;
5074 if (TREE_CODE (expr
) == OFFSET_REF
)
5075 expr
= resolve_offset_ref (expr
);
5077 if (processing_template_decl
)
5079 tree t
= build_min (CONST_CAST_EXPR
, type
, expr
);
5083 if (!POINTER_TYPE_P (type
))
5084 error ("invalid use of const_cast with type `%T', which is not a pointer, reference, nor a pointer-to-data-member type", type
);
5085 else if (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
5087 error ("invalid use of const_cast with type `%T', which is a pointer or reference to a function type", type
);
5088 return error_mark_node
;
5091 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5093 expr
= decay_conversion (expr
);
5095 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5096 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5097 if (TREE_CODE (expr
) == NOP_EXPR
5098 && TREE_TYPE (expr
) == TREE_TYPE (TREE_OPERAND (expr
, 0)))
5099 expr
= TREE_OPERAND (expr
, 0);
5102 intype
= TREE_TYPE (expr
);
5104 if (same_type_ignoring_top_level_qualifiers_p (intype
, type
))
5105 return build_static_cast (type
, expr
);
5106 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
5108 if (! real_lvalue_p (expr
))
5110 error ("invalid const_cast of an rvalue of type `%T' to type `%T'", intype
, type
);
5111 return error_mark_node
;
5114 if (comp_ptr_ttypes_const (TREE_TYPE (type
), intype
))
5116 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
5117 expr
= build1 (NOP_EXPR
, type
, expr
);
5118 return convert_from_reference (expr
);
5121 else if (TREE_CODE (type
) == POINTER_TYPE
5122 && TREE_CODE (intype
) == POINTER_TYPE
5123 && comp_ptr_ttypes_const (TREE_TYPE (type
), TREE_TYPE (intype
)))
5124 return cp_convert (type
, expr
);
5126 error ("invalid const_cast from type `%T' to type `%T'", intype
, type
);
5127 return error_mark_node
;
5130 /* Build an expression representing a cast to type TYPE of expression EXPR.
5132 ALLOW_NONCONVERTING is true if we should allow non-converting constructors
5133 when doing the cast. */
5136 build_c_cast (type
, expr
)
5139 register tree value
= expr
;
5142 if (type
== error_mark_node
|| expr
== error_mark_node
)
5143 return error_mark_node
;
5145 if (processing_template_decl
)
5147 tree t
= build_min (CAST_EXPR
, type
,
5148 tree_cons (NULL_TREE
, value
, NULL_TREE
));
5152 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
5153 Strip such NOP_EXPRs if VALUE is being used in non-lvalue context. */
5154 if (TREE_CODE (type
) != REFERENCE_TYPE
5155 && TREE_CODE (value
) == NOP_EXPR
5156 && TREE_TYPE (value
) == TREE_TYPE (TREE_OPERAND (value
, 0)))
5157 value
= TREE_OPERAND (value
, 0);
5159 if (TREE_CODE (value
) == OFFSET_REF
)
5160 value
= resolve_offset_ref (value
);
5162 if (TREE_CODE (type
) == ARRAY_TYPE
)
5164 /* Allow casting from T1* to T2[] because Cfront allows it.
5165 NIHCL uses it. It is not valid ISO C++ however. */
5166 if (TREE_CODE (TREE_TYPE (expr
)) == POINTER_TYPE
)
5168 pedwarn ("ISO C++ forbids casting to an array type `%T'", type
);
5169 type
= build_pointer_type (TREE_TYPE (type
));
5173 error ("ISO C++ forbids casting to an array type `%T'", type
);
5174 return error_mark_node
;
5178 if (TREE_CODE (type
) == FUNCTION_TYPE
5179 || TREE_CODE (type
) == METHOD_TYPE
)
5181 error ("invalid cast to function type `%T'", type
);
5182 return error_mark_node
;
5185 if (TREE_CODE (type
) == VOID_TYPE
)
5187 /* Conversion to void does not cause any of the normal function to
5188 * pointer, array to pointer and lvalue to rvalue decays. */
5190 value
= convert_to_void (value
, /*implicit=*/NULL
);
5193 /* Convert functions and arrays to pointers and
5194 convert references to their expanded types,
5195 but don't convert any other types. If, however, we are
5196 casting to a class type, there's no reason to do this: the
5197 cast will only succeed if there is a converting constructor,
5198 and the default conversions will be done at that point. In
5199 fact, doing the default conversion here is actually harmful
5203 struct S { S(const A&); };
5205 since we don't want the array-to-pointer conversion done. */
5206 if (!IS_AGGR_TYPE (type
))
5208 if (TREE_CODE (TREE_TYPE (value
)) == FUNCTION_TYPE
5209 || (TREE_CODE (TREE_TYPE (value
)) == METHOD_TYPE
5210 /* Don't do the default conversion on a ->* expression. */
5211 && ! (TREE_CODE (type
) == POINTER_TYPE
5212 && bound_pmf_p (value
)))
5213 || TREE_CODE (TREE_TYPE (value
)) == ARRAY_TYPE
5214 || TREE_CODE (TREE_TYPE (value
)) == REFERENCE_TYPE
)
5215 value
= default_conversion (value
);
5217 else if (TREE_CODE (TREE_TYPE (value
)) == REFERENCE_TYPE
)
5218 /* However, even for class types, we still need to strip away
5219 the reference type, since the call to convert_force below
5220 does not expect the input expression to be of reference
5222 value
= convert_from_reference (value
);
5224 otype
= TREE_TYPE (value
);
5226 /* Optionally warn about potentially worrisome casts. */
5229 && TREE_CODE (type
) == POINTER_TYPE
5230 && TREE_CODE (otype
) == POINTER_TYPE
5231 && !at_least_as_qualified_p (TREE_TYPE (type
),
5233 warning ("cast from `%T' to `%T' discards qualifiers from pointer target type",
5236 if (TREE_CODE (type
) == INTEGER_TYPE
5237 && TREE_CODE (otype
) == POINTER_TYPE
5238 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
))
5239 warning ("cast from pointer to integer of different size");
5241 if (TREE_CODE (type
) == POINTER_TYPE
5242 && TREE_CODE (otype
) == INTEGER_TYPE
5243 && TYPE_PRECISION (type
) != TYPE_PRECISION (otype
)
5244 /* Don't warn about converting any constant. */
5245 && !TREE_CONSTANT (value
))
5246 warning ("cast to pointer from integer of different size");
5248 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5249 value
= (convert_from_reference
5250 (convert_to_reference (type
, value
, CONV_C_CAST
,
5251 LOOKUP_COMPLAIN
, NULL_TREE
)));
5256 value
= decl_constant_value (value
);
5259 value
= convert_force (type
, value
, CONV_C_CAST
);
5261 /* Ignore any integer overflow caused by the cast. */
5262 if (TREE_CODE (value
) == INTEGER_CST
)
5264 TREE_OVERFLOW (value
) = TREE_OVERFLOW (ovalue
);
5265 TREE_CONSTANT_OVERFLOW (value
) = TREE_CONSTANT_OVERFLOW (ovalue
);
5269 /* Warn about possible alignment problems. Do this here when we will have
5270 instantiated any necessary template types. */
5271 if (STRICT_ALIGNMENT
&& warn_cast_align
5272 && TREE_CODE (type
) == POINTER_TYPE
5273 && TREE_CODE (otype
) == POINTER_TYPE
5274 && TREE_CODE (TREE_TYPE (otype
)) != VOID_TYPE
5275 && TREE_CODE (TREE_TYPE (otype
)) != FUNCTION_TYPE
5276 && COMPLETE_TYPE_P (TREE_TYPE (otype
))
5277 && COMPLETE_TYPE_P (TREE_TYPE (type
))
5278 && TYPE_ALIGN (TREE_TYPE (type
)) > TYPE_ALIGN (TREE_TYPE (otype
)))
5279 warning ("cast from `%T' to `%T' increases required alignment of target type",
5282 /* Always produce some operator for an explicit cast,
5283 so we can tell (for -pedantic) that the cast is no lvalue. */
5284 if (TREE_CODE (type
) != REFERENCE_TYPE
&& value
== expr
5285 && real_lvalue_p (value
))
5286 value
= non_lvalue (value
);
5291 /* Build an assignment expression of lvalue LHS from value RHS.
5292 MODIFYCODE is the code for a binary operator that we use
5293 to combine the old value of LHS with RHS to get the new value.
5294 Or else MODIFYCODE is NOP_EXPR meaning do a simple assignment.
5296 C++: If MODIFYCODE is INIT_EXPR, then leave references unbashed. */
5299 build_modify_expr (lhs
, modifycode
, rhs
)
5301 enum tree_code modifycode
;
5304 register tree result
;
5306 tree lhstype
= TREE_TYPE (lhs
);
5307 tree olhstype
= lhstype
;
5310 /* Avoid duplicate error messages from operands that had errors. */
5311 if (lhs
== error_mark_node
|| rhs
== error_mark_node
)
5312 return error_mark_node
;
5314 /* Handle control structure constructs used as "lvalues". */
5315 switch (TREE_CODE (lhs
))
5317 /* Handle --foo = 5; as these are valid constructs in C++ */
5318 case PREDECREMENT_EXPR
:
5319 case PREINCREMENT_EXPR
:
5320 if (TREE_SIDE_EFFECTS (TREE_OPERAND (lhs
, 0)))
5321 lhs
= build (TREE_CODE (lhs
), TREE_TYPE (lhs
),
5322 stabilize_reference (TREE_OPERAND (lhs
, 0)),
5323 TREE_OPERAND (lhs
, 1));
5324 return build (COMPOUND_EXPR
, lhstype
,
5326 build_modify_expr (TREE_OPERAND (lhs
, 0),
5329 /* Handle (a, b) used as an "lvalue". */
5331 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 1),
5333 if (newrhs
== error_mark_node
)
5334 return error_mark_node
;
5335 return build (COMPOUND_EXPR
, lhstype
,
5336 TREE_OPERAND (lhs
, 0), newrhs
);
5339 newrhs
= build_modify_expr (TREE_OPERAND (lhs
, 0), modifycode
, rhs
);
5340 if (newrhs
== error_mark_node
)
5341 return error_mark_node
;
5342 return build (COMPOUND_EXPR
, lhstype
, lhs
, newrhs
);
5344 /* Handle (a ? b : c) used as an "lvalue". */
5347 /* Produce (a ? (b = rhs) : (c = rhs))
5348 except that the RHS goes through a save-expr
5349 so the code to compute it is only emitted once. */
5351 tree preeval
= NULL_TREE
;
5353 rhs
= stabilize_expr (rhs
, &preeval
);
5355 /* Check this here to avoid odd errors when trying to convert
5356 a throw to the type of the COND_EXPR. */
5357 if (!lvalue_or_else (lhs
, "assignment"))
5358 return error_mark_node
;
5360 cond
= build_conditional_expr
5361 (TREE_OPERAND (lhs
, 0),
5362 build_modify_expr (cp_convert (TREE_TYPE (lhs
),
5363 TREE_OPERAND (lhs
, 1)),
5365 build_modify_expr (cp_convert (TREE_TYPE (lhs
),
5366 TREE_OPERAND (lhs
, 2)),
5369 if (cond
== error_mark_node
)
5371 /* Make sure the code to compute the rhs comes out
5372 before the split. */
5373 return build (COMPOUND_EXPR
, TREE_TYPE (lhs
), preeval
, cond
);
5377 lhs
= resolve_offset_ref (lhs
);
5378 if (lhs
== error_mark_node
)
5379 return error_mark_node
;
5380 olhstype
= lhstype
= TREE_TYPE (lhs
);
5386 if (modifycode
== INIT_EXPR
)
5388 if (TREE_CODE (rhs
) == CONSTRUCTOR
)
5390 my_friendly_assert (same_type_p (TREE_TYPE (rhs
), lhstype
),
5392 result
= build (INIT_EXPR
, lhstype
, lhs
, rhs
);
5393 TREE_SIDE_EFFECTS (result
) = 1;
5396 else if (! IS_AGGR_TYPE (lhstype
))
5397 /* Do the default thing */;
5400 result
= build_special_member_call (lhs
, complete_ctor_identifier
,
5401 build_tree_list (NULL_TREE
, rhs
),
5402 TYPE_BINFO (lhstype
),
5404 if (result
== NULL_TREE
)
5405 return error_mark_node
;
5411 if (TREE_CODE (lhstype
) == REFERENCE_TYPE
)
5413 lhs
= convert_from_reference (lhs
);
5414 olhstype
= lhstype
= TREE_TYPE (lhs
);
5416 lhs
= require_complete_type (lhs
);
5417 if (lhs
== error_mark_node
)
5418 return error_mark_node
;
5420 if (modifycode
== NOP_EXPR
)
5422 /* `operator=' is not an inheritable operator. */
5423 if (! IS_AGGR_TYPE (lhstype
))
5424 /* Do the default thing */;
5427 result
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
,
5428 lhs
, rhs
, make_node (NOP_EXPR
));
5429 if (result
== NULL_TREE
)
5430 return error_mark_node
;
5437 /* A binary op has been requested. Combine the old LHS
5438 value with the RHS producing the value we should actually
5439 store into the LHS. */
5441 my_friendly_assert (!PROMOTES_TO_AGGR_TYPE (lhstype
, REFERENCE_TYPE
),
5443 lhs
= stabilize_reference (lhs
);
5444 newrhs
= cp_build_binary_op (modifycode
, lhs
, rhs
);
5445 if (newrhs
== error_mark_node
)
5447 error (" in evaluation of `%Q(%#T, %#T)'", modifycode
,
5448 TREE_TYPE (lhs
), TREE_TYPE (rhs
));
5449 return error_mark_node
;
5452 /* Now it looks like a plain assignment. */
5453 modifycode
= NOP_EXPR
;
5455 my_friendly_assert (TREE_CODE (lhstype
) != REFERENCE_TYPE
, 20011220);
5456 my_friendly_assert (TREE_CODE (TREE_TYPE (newrhs
)) != REFERENCE_TYPE
,
5460 /* Handle a cast used as an "lvalue".
5461 We have already performed any binary operator using the value as cast.
5462 Now convert the result to the cast type of the lhs,
5463 and then true type of the lhs and store it there;
5464 then convert result back to the cast type to be the value
5465 of the assignment. */
5467 switch (TREE_CODE (lhs
))
5472 case FIX_TRUNC_EXPR
:
5473 case FIX_FLOOR_EXPR
:
5474 case FIX_ROUND_EXPR
:
5477 tree inner_lhs
= TREE_OPERAND (lhs
, 0);
5480 if (TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
5481 || TREE_CODE (TREE_TYPE (newrhs
)) == FUNCTION_TYPE
5482 || TREE_CODE (TREE_TYPE (newrhs
)) == METHOD_TYPE
5483 || TREE_CODE (TREE_TYPE (newrhs
)) == OFFSET_TYPE
)
5484 newrhs
= default_conversion (newrhs
);
5486 /* ISO C++ 5.4/1: The result is an lvalue if T is a reference
5487 type, otherwise the result is an rvalue. */
5488 if (! lvalue_p (lhs
))
5489 pedwarn ("ISO C++ forbids cast to non-reference type used as lvalue");
5491 result
= build_modify_expr (inner_lhs
, NOP_EXPR
,
5492 cp_convert (TREE_TYPE (inner_lhs
),
5493 cp_convert (lhstype
, newrhs
)));
5494 if (result
== error_mark_node
)
5496 return cp_convert (TREE_TYPE (lhs
), result
);
5503 /* Now we have handled acceptable kinds of LHS that are not truly lvalues.
5504 Reject anything strange now. */
5506 if (!lvalue_or_else (lhs
, "assignment"))
5507 return error_mark_node
;
5509 /* Warn about modifying something that is `const'. Don't warn if
5510 this is initialization. */
5511 if (modifycode
!= INIT_EXPR
5512 && (TREE_READONLY (lhs
) || CP_TYPE_CONST_P (lhstype
)
5513 /* Functions are not modifiable, even though they are
5515 || TREE_CODE (TREE_TYPE (lhs
)) == FUNCTION_TYPE
5516 || TREE_CODE (TREE_TYPE (lhs
)) == METHOD_TYPE
5517 /* If it's an aggregate and any field is const, then it is
5518 effectively const. */
5519 || (CLASS_TYPE_P (lhstype
)
5520 && C_TYPE_FIELDS_READONLY (lhstype
))))
5521 readonly_error (lhs
, "assignment", 0);
5523 /* If storing into a structure or union member, it has probably been
5524 given type `int'. Compute the type that would go with the actual
5525 amount of storage the member occupies. */
5527 if (TREE_CODE (lhs
) == COMPONENT_REF
5528 && (TREE_CODE (lhstype
) == INTEGER_TYPE
5529 || TREE_CODE (lhstype
) == REAL_TYPE
5530 || TREE_CODE (lhstype
) == ENUMERAL_TYPE
))
5532 lhstype
= TREE_TYPE (get_unwidened (lhs
, 0));
5534 /* If storing in a field that is in actuality a short or narrower
5535 than one, we must store in the field in its actual type. */
5537 if (lhstype
!= TREE_TYPE (lhs
))
5539 lhs
= copy_node (lhs
);
5540 TREE_TYPE (lhs
) = lhstype
;
5544 if (TREE_CODE (lhstype
) != REFERENCE_TYPE
)
5546 if (TREE_SIDE_EFFECTS (lhs
))
5547 lhs
= stabilize_reference (lhs
);
5548 if (TREE_SIDE_EFFECTS (newrhs
))
5549 newrhs
= stabilize_reference (newrhs
);
5552 /* Convert new value to destination type. */
5554 if (TREE_CODE (lhstype
) == ARRAY_TYPE
)
5558 if (!same_or_base_type_p (TYPE_MAIN_VARIANT (lhstype
),
5559 TYPE_MAIN_VARIANT (TREE_TYPE (rhs
))))
5561 error ("incompatible types in assignment of `%T' to `%T'",
5562 TREE_TYPE (rhs
), lhstype
);
5563 return error_mark_node
;
5566 /* Allow array assignment in compiler-generated code. */
5567 if (! DECL_ARTIFICIAL (current_function_decl
))
5568 pedwarn ("ISO C++ forbids assignment of arrays");
5570 from_array
= TREE_CODE (TREE_TYPE (newrhs
)) == ARRAY_TYPE
5571 ? 1 + (modifycode
!= INIT_EXPR
): 0;
5572 return build_vec_init (lhs
, NULL_TREE
, newrhs
, from_array
);
5575 if (modifycode
== INIT_EXPR
)
5576 newrhs
= convert_for_initialization (lhs
, lhstype
, newrhs
, LOOKUP_NORMAL
,
5577 "initialization", NULL_TREE
, 0);
5580 /* Avoid warnings on enum bit fields. */
5581 if (TREE_CODE (olhstype
) == ENUMERAL_TYPE
5582 && TREE_CODE (lhstype
) == INTEGER_TYPE
)
5584 newrhs
= convert_for_assignment (olhstype
, newrhs
, "assignment",
5586 newrhs
= convert_force (lhstype
, newrhs
, 0);
5589 newrhs
= convert_for_assignment (lhstype
, newrhs
, "assignment",
5591 if (TREE_CODE (newrhs
) == CALL_EXPR
5592 && TYPE_NEEDS_CONSTRUCTING (lhstype
))
5593 newrhs
= build_cplus_new (lhstype
, newrhs
);
5595 /* Can't initialize directly from a TARGET_EXPR, since that would
5596 cause the lhs to be constructed twice, and possibly result in
5597 accidental self-initialization. So we force the TARGET_EXPR to be
5598 expanded without a target. */
5599 if (TREE_CODE (newrhs
) == TARGET_EXPR
)
5600 newrhs
= build (COMPOUND_EXPR
, TREE_TYPE (newrhs
), newrhs
,
5601 TREE_OPERAND (newrhs
, 0));
5604 if (newrhs
== error_mark_node
)
5605 return error_mark_node
;
5607 if (TREE_CODE (newrhs
) == COND_EXPR
)
5610 tree cond
= TREE_OPERAND (newrhs
, 0);
5612 if (TREE_SIDE_EFFECTS (lhs
))
5613 cond
= build_compound_expr (tree_cons
5615 build_tree_list (NULL_TREE
, cond
)));
5617 /* Cannot have two identical lhs on this one tree (result) as preexpand
5618 calls will rip them out and fill in RTL for them, but when the
5619 rtl is generated, the calls will only be in the first side of the
5620 condition, not on both, or before the conditional jump! (mrs) */
5621 lhs1
= break_out_calls (lhs
);
5624 /* If there's no change, the COND_EXPR behaves like any other rhs. */
5625 result
= build (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
5626 lhstype
, lhs
, newrhs
);
5629 tree result_type
= TREE_TYPE (newrhs
);
5630 /* We have to convert each arm to the proper type because the
5631 types may have been munged by constant folding. */
5633 = build (COND_EXPR
, result_type
, cond
,
5634 build_modify_expr (lhs
, modifycode
,
5635 cp_convert (result_type
,
5636 TREE_OPERAND (newrhs
, 1))),
5637 build_modify_expr (lhs1
, modifycode
,
5638 cp_convert (result_type
,
5639 TREE_OPERAND (newrhs
, 2))));
5643 result
= build (modifycode
== NOP_EXPR
? MODIFY_EXPR
: INIT_EXPR
,
5644 lhstype
, lhs
, newrhs
);
5646 TREE_SIDE_EFFECTS (result
) = 1;
5648 /* If we got the LHS in a different type for storing in,
5649 convert the result back to the nominal type of LHS
5650 so that the value we return always has the same type
5651 as the LHS argument. */
5653 if (olhstype
== TREE_TYPE (result
))
5655 /* Avoid warnings converting integral types back into enums
5656 for enum bit fields. */
5657 if (TREE_CODE (TREE_TYPE (result
)) == INTEGER_TYPE
5658 && TREE_CODE (olhstype
) == ENUMERAL_TYPE
)
5660 result
= build (COMPOUND_EXPR
, olhstype
, result
, olhs
);
5661 TREE_NO_UNUSED_WARNING (result
) = 1;
5664 return convert_for_assignment (olhstype
, result
, "assignment",
5669 build_x_modify_expr (lhs
, modifycode
, rhs
)
5671 enum tree_code modifycode
;
5674 if (processing_template_decl
)
5675 return build_min_nt (MODOP_EXPR
, lhs
,
5676 build_min_nt (modifycode
, NULL_TREE
, NULL_TREE
), rhs
);
5678 if (modifycode
!= NOP_EXPR
)
5680 tree rval
= build_new_op (MODIFY_EXPR
, LOOKUP_NORMAL
, lhs
, rhs
,
5681 make_node (modifycode
));
5685 return build_modify_expr (lhs
, modifycode
, rhs
);
5689 /* Get difference in deltas for different pointer to member function
5690 types. Return integer_zero_node, if FROM cannot be converted to a
5691 TO type. If FORCE is true, then allow reverse conversions as well.
5693 Note that the naming of FROM and TO is kind of backwards; the return
5694 value is what we add to a TO in order to get a FROM. They are named
5695 this way because we call this function to find out how to convert from
5696 a pointer to member of FROM to a pointer to member of TO. */
5699 get_delta_difference (from
, to
, force
)
5703 tree delta
= integer_zero_node
;
5708 binfo
= lookup_base (to
, from
, ba_check
, &kind
);
5709 if (kind
== bk_inaccessible
|| kind
== bk_ambig
)
5711 error (" in pointer to member function conversion");
5718 error_not_base_type (from
, to
);
5719 error (" in pointer to member conversion");
5722 binfo
= lookup_base (from
, to
, ba_check
, &kind
);
5725 virt_binfo
= binfo_from_vbase (binfo
);
5729 /* This is a reinterpret cast, we choose to do nothing. */
5730 warning ("pointer to member cast via virtual base `%T'",
5731 BINFO_TYPE (virt_binfo
));
5734 delta
= BINFO_OFFSET (binfo
);
5735 delta
= cp_convert (ptrdiff_type_node
, delta
);
5736 delta
= cp_build_binary_op (MINUS_EXPR
,
5743 virt_binfo
= binfo_from_vbase (binfo
);
5746 /* This is a reinterpret cast, we choose to do nothing. */
5748 warning ("pointer to member cast via virtual base `%T'",
5749 BINFO_TYPE (virt_binfo
));
5751 error ("pointer to member conversion via virtual base `%T'",
5752 BINFO_TYPE (virt_binfo
));
5755 delta
= BINFO_OFFSET (binfo
);
5757 return cp_convert (ptrdiff_type_node
, delta
);
5760 /* Return a constructor for the pointer-to-member-function TYPE using
5761 the other components as specified. */
5764 build_ptrmemfunc1 (type
, delta
, pfn
)
5765 tree type
, delta
, pfn
;
5771 /* Pull the FIELD_DECLs out of the type. */
5772 pfn_field
= TYPE_FIELDS (type
);
5773 delta_field
= TREE_CHAIN (pfn_field
);
5775 /* Make sure DELTA has the type we want. */
5776 delta
= convert_and_check (delta_type_node
, delta
);
5778 /* Finish creating the initializer. */
5779 u
= tree_cons (pfn_field
, pfn
,
5780 build_tree_list (delta_field
, delta
));
5781 u
= build_constructor (type
, u
);
5782 TREE_CONSTANT (u
) = TREE_CONSTANT (pfn
) && TREE_CONSTANT (delta
);
5783 TREE_STATIC (u
) = (TREE_CONSTANT (u
)
5784 && (initializer_constant_valid_p (pfn
, TREE_TYPE (pfn
))
5786 && (initializer_constant_valid_p (delta
, TREE_TYPE (delta
))
5791 /* Build a constructor for a pointer to member function. It can be
5792 used to initialize global variables, local variable, or used
5793 as a value in expressions. TYPE is the POINTER to METHOD_TYPE we
5796 If FORCE is nonzero, then force this conversion, even if
5797 we would rather not do it. Usually set when using an explicit
5800 Return error_mark_node, if something goes wrong. */
5803 build_ptrmemfunc (type
, pfn
, force
)
5811 if (error_operand_p (pfn
))
5812 return error_mark_node
;
5814 pfn_type
= TREE_TYPE (pfn
);
5815 to_type
= build_ptrmemfunc_type (type
);
5817 /* Handle multiple conversions of pointer to member functions. */
5818 if (TYPE_PTRMEMFUNC_P (pfn_type
))
5820 tree delta
= NULL_TREE
;
5821 tree npfn
= NULL_TREE
;
5825 && !can_convert_arg (to_type
, TREE_TYPE (pfn
), pfn
))
5826 error ("invalid conversion to type `%T' from type `%T'",
5829 n
= get_delta_difference (TYPE_PTRMEMFUNC_OBJECT_TYPE (pfn_type
),
5830 TYPE_PTRMEMFUNC_OBJECT_TYPE (to_type
),
5833 /* We don't have to do any conversion to convert a
5834 pointer-to-member to its own type. But, we don't want to
5835 just return a PTRMEM_CST if there's an explicit cast; that
5836 cast should make the expression an invalid template argument. */
5837 if (TREE_CODE (pfn
) != PTRMEM_CST
)
5839 if (same_type_p (to_type
, pfn_type
))
5841 else if (integer_zerop (n
))
5842 return build_reinterpret_cast (to_type
, pfn
);
5845 if (TREE_SIDE_EFFECTS (pfn
))
5846 pfn
= save_expr (pfn
);
5848 /* Obtain the function pointer and the current DELTA. */
5849 if (TREE_CODE (pfn
) == PTRMEM_CST
)
5850 expand_ptrmemfunc_cst (pfn
, &delta
, &npfn
);
5853 npfn
= build_ptrmemfunc_access_expr (pfn
, pfn_identifier
);
5854 delta
= build_ptrmemfunc_access_expr (pfn
, delta_identifier
);
5857 /* Just adjust the DELTA field. */
5858 delta
= cp_convert (ptrdiff_type_node
, delta
);
5859 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_delta
)
5860 n
= cp_build_binary_op (LSHIFT_EXPR
, n
, integer_one_node
);
5861 delta
= cp_build_binary_op (PLUS_EXPR
, delta
, n
);
5862 return build_ptrmemfunc1 (to_type
, delta
, npfn
);
5865 /* Handle null pointer to member function conversions. */
5866 if (integer_zerop (pfn
))
5868 pfn
= build_c_cast (type
, integer_zero_node
);
5869 return build_ptrmemfunc1 (to_type
,
5874 if (type_unknown_p (pfn
))
5875 return instantiate_type (type
, pfn
, tf_error
| tf_warning
);
5877 fn
= TREE_OPERAND (pfn
, 0);
5878 my_friendly_assert (TREE_CODE (fn
) == FUNCTION_DECL
, 0);
5879 return make_ptrmem_cst (to_type
, fn
);
5882 /* Return the DELTA, IDX, PFN, and DELTA2 values for the PTRMEM_CST
5885 ??? There is no consistency as to the types returned for the above
5886 values. Some code acts as if its a sizetype and some as if its
5887 integer_type_node. */
5890 expand_ptrmemfunc_cst (cst
, delta
, pfn
)
5895 tree type
= TREE_TYPE (cst
);
5896 tree fn
= PTRMEM_CST_MEMBER (cst
);
5897 tree ptr_class
, fn_class
;
5899 my_friendly_assert (TREE_CODE (fn
) == FUNCTION_DECL
, 0);
5901 /* The class that the function belongs to. */
5902 fn_class
= DECL_CONTEXT (fn
);
5904 /* The class that we're creating a pointer to member of. */
5905 ptr_class
= TYPE_PTRMEMFUNC_OBJECT_TYPE (type
);
5907 /* First, calculate the adjustment to the function's class. */
5908 *delta
= get_delta_difference (fn_class
, ptr_class
, /*force=*/0);
5910 if (!DECL_VIRTUAL_P (fn
))
5911 *pfn
= convert (TYPE_PTRMEMFUNC_FN_TYPE (type
), build_addr_func (fn
));
5914 /* If we're dealing with a virtual function, we have to adjust 'this'
5915 again, to point to the base which provides the vtable entry for
5916 fn; the call will do the opposite adjustment. */
5917 tree orig_class
= DECL_CONTEXT (fn
);
5918 tree binfo
= binfo_or_else (orig_class
, fn_class
);
5919 *delta
= fold (build (PLUS_EXPR
, TREE_TYPE (*delta
),
5920 *delta
, BINFO_OFFSET (binfo
)));
5922 /* We set PFN to the vtable offset at which the function can be
5923 found, plus one (unless ptrmemfunc_vbit_in_delta, in which
5924 case delta is shifted left, and then incremented). */
5925 *pfn
= DECL_VINDEX (fn
);
5926 *pfn
= fold (build (MULT_EXPR
, integer_type_node
, *pfn
,
5927 TYPE_SIZE_UNIT (vtable_entry_type
)));
5929 switch (TARGET_PTRMEMFUNC_VBIT_LOCATION
)
5931 case ptrmemfunc_vbit_in_pfn
:
5932 *pfn
= fold (build (PLUS_EXPR
, integer_type_node
, *pfn
,
5936 case ptrmemfunc_vbit_in_delta
:
5937 *delta
= fold (build (LSHIFT_EXPR
, TREE_TYPE (*delta
),
5938 *delta
, integer_one_node
));
5939 *delta
= fold (build (PLUS_EXPR
, TREE_TYPE (*delta
),
5940 *delta
, integer_one_node
));
5947 *pfn
= fold (build1 (NOP_EXPR
, TYPE_PTRMEMFUNC_FN_TYPE (type
),
5952 /* Return an expression for PFN from the pointer-to-member function
5956 pfn_from_ptrmemfunc (t
)
5959 if (TREE_CODE (t
) == PTRMEM_CST
)
5964 expand_ptrmemfunc_cst (t
, &delta
, &pfn
);
5969 return build_ptrmemfunc_access_expr (t
, pfn_identifier
);
5972 /* Expression EXPR is about to be implicitly converted to TYPE. Warn
5973 if this is a potentially dangerous thing to do. Returns a possibly
5977 dubious_conversion_warnings (type
, expr
, errtype
, fndecl
, parmnum
)
5980 const char *errtype
;
5984 if (TREE_CODE (type
) == REFERENCE_TYPE
)
5985 type
= TREE_TYPE (type
);
5987 /* Issue warnings about peculiar, but valid, uses of NULL. */
5988 if (ARITHMETIC_TYPE_P (type
) && expr
== null_node
)
5991 warning ("passing NULL used for non-pointer %s %P of `%D'",
5992 errtype
, parmnum
, fndecl
);
5994 warning ("%s to non-pointer type `%T' from NULL", errtype
, type
);
5997 /* Warn about assigning a floating-point type to an integer type. */
5998 if (TREE_CODE (TREE_TYPE (expr
)) == REAL_TYPE
5999 && TREE_CODE (type
) == INTEGER_TYPE
)
6002 warning ("passing `%T' for %s %P of `%D'",
6003 TREE_TYPE (expr
), errtype
, parmnum
, fndecl
);
6005 warning ("%s to `%T' from `%T'", errtype
, type
, TREE_TYPE (expr
));
6007 /* And warn about assigning a negative value to an unsigned
6009 else if (TREE_UNSIGNED (type
) && TREE_CODE (type
) != BOOLEAN_TYPE
)
6011 if (TREE_CODE (expr
) == INTEGER_CST
6012 && TREE_NEGATED_INT (expr
))
6015 warning ("passing negative value `%E' for %s %P of `%D'",
6016 expr
, errtype
, parmnum
, fndecl
);
6018 warning ("%s of negative value `%E' to `%T'",
6019 errtype
, expr
, type
);
6022 overflow_warning (expr
);
6024 if (TREE_CONSTANT (expr
))
6030 /* Convert value RHS to type TYPE as preparation for an assignment to
6031 an lvalue of type TYPE. ERRTYPE is a string to use in error
6032 messages: "assignment", "return", etc. If FNDECL is non-NULL, we
6033 are doing the conversion in order to pass the PARMNUMth argument of
6037 convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
)
6039 const char *errtype
;
6043 register enum tree_code codel
= TREE_CODE (type
);
6044 register tree rhstype
;
6045 register enum tree_code coder
;
6047 if (codel
== OFFSET_TYPE
)
6050 if (TREE_CODE (rhs
) == OFFSET_REF
)
6051 rhs
= resolve_offset_ref (rhs
);
6053 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
6054 if (TREE_CODE (rhs
) == NON_LVALUE_EXPR
)
6055 rhs
= TREE_OPERAND (rhs
, 0);
6057 rhstype
= TREE_TYPE (rhs
);
6058 coder
= TREE_CODE (rhstype
);
6060 if (rhs
== error_mark_node
|| rhstype
== error_mark_node
)
6061 return error_mark_node
;
6062 if (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
)
6063 return error_mark_node
;
6065 rhs
= dubious_conversion_warnings (type
, rhs
, errtype
, fndecl
, parmnum
);
6067 /* The RHS of an assignment cannot have void type. */
6068 if (coder
== VOID_TYPE
)
6070 error ("void value not ignored as it ought to be");
6071 return error_mark_node
;
6074 /* Simplify the RHS if possible. */
6075 if (TREE_CODE (rhs
) == CONST_DECL
)
6076 rhs
= DECL_INITIAL (rhs
);
6078 /* We do not use decl_constant_value here because of this case:
6080 const char* const s = "s";
6082 The conversion rules for a string literal are more lax than for a
6083 variable; in particular, a string literal can be converted to a
6084 "char *" but the variable "s" cannot be converted in the same
6085 way. If the conversion is allowed, the optimization should be
6086 performed while creating the converted expression. */
6090 The expression is implicitly converted (clause _conv_) to the
6091 cv-unqualified type of the left operand.
6093 We allow bad conversions here because by the time we get to this point
6094 we are committed to doing the conversion. If we end up doing a bad
6095 conversion, convert_like will complain. */
6096 if (!can_convert_arg_bad (type
, rhstype
, rhs
))
6098 /* When -Wno-pmf-conversions is use, we just silently allow
6099 conversions from pointers-to-members to plain pointers. If
6100 the conversion doesn't work, cp_convert will complain. */
6102 && TYPE_PTR_P (type
)
6103 && TYPE_PTRMEMFUNC_P (rhstype
))
6104 rhs
= cp_convert (strip_top_quals (type
), rhs
);
6107 /* If the right-hand side has unknown type, then it is an
6108 overloaded function. Call instantiate_type to get error
6110 if (rhstype
== unknown_type_node
)
6111 instantiate_type (type
, rhs
, tf_error
| tf_warning
);
6113 error ("cannot convert `%T' to `%T' for argument `%P' to `%D'",
6114 rhstype
, type
, parmnum
, fndecl
);
6116 error ("cannot convert `%T' to `%T' in %s", rhstype
, type
,
6118 return error_mark_node
;
6121 return perform_implicit_conversion (strip_top_quals (type
), rhs
);
6124 /* Convert RHS to be of type TYPE.
6125 If EXP is nonzero, it is the target of the initialization.
6126 ERRTYPE is a string to use in error messages.
6128 Two major differences between the behavior of
6129 `convert_for_assignment' and `convert_for_initialization'
6130 are that references are bashed in the former, while
6131 copied in the latter, and aggregates are assigned in
6132 the former (operator=) while initialized in the
6135 If using constructor make sure no conversion operator exists, if one does
6136 exist, an ambiguity exists.
6138 If flags doesn't include LOOKUP_COMPLAIN, don't complain about anything. */
6141 convert_for_initialization (exp
, type
, rhs
, flags
, errtype
, fndecl
, parmnum
)
6142 tree exp
, type
, rhs
;
6144 const char *errtype
;
6148 register enum tree_code codel
= TREE_CODE (type
);
6149 register tree rhstype
;
6150 register enum tree_code coder
;
6152 /* build_c_cast puts on a NOP_EXPR to make the result not an lvalue.
6153 Strip such NOP_EXPRs, since RHS is used in non-lvalue context. */
6154 if (TREE_CODE (rhs
) == NOP_EXPR
6155 && TREE_TYPE (rhs
) == TREE_TYPE (TREE_OPERAND (rhs
, 0))
6156 && codel
!= REFERENCE_TYPE
)
6157 rhs
= TREE_OPERAND (rhs
, 0);
6159 if (rhs
== error_mark_node
6160 || (TREE_CODE (rhs
) == TREE_LIST
&& TREE_VALUE (rhs
) == error_mark_node
))
6161 return error_mark_node
;
6163 if (TREE_CODE (rhs
) == OFFSET_REF
)
6165 rhs
= resolve_offset_ref (rhs
);
6166 if (rhs
== error_mark_node
)
6167 return error_mark_node
;
6170 if (TREE_CODE (TREE_TYPE (rhs
)) == REFERENCE_TYPE
)
6171 rhs
= convert_from_reference (rhs
);
6173 if ((TREE_CODE (TREE_TYPE (rhs
)) == ARRAY_TYPE
6174 && TREE_CODE (type
) != ARRAY_TYPE
6175 && (TREE_CODE (type
) != REFERENCE_TYPE
6176 || TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
))
6177 || (TREE_CODE (TREE_TYPE (rhs
)) == FUNCTION_TYPE
6178 && (TREE_CODE (type
) != REFERENCE_TYPE
6179 || TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
))
6180 || TREE_CODE (TREE_TYPE (rhs
)) == METHOD_TYPE
)
6181 rhs
= default_conversion (rhs
);
6183 rhstype
= TREE_TYPE (rhs
);
6184 coder
= TREE_CODE (rhstype
);
6186 if (coder
== ERROR_MARK
)
6187 return error_mark_node
;
6189 /* We accept references to incomplete types, so we can
6190 return here before checking if RHS is of complete type. */
6192 if (codel
== REFERENCE_TYPE
)
6194 /* This should eventually happen in convert_arguments. */
6195 int savew
= 0, savee
= 0;
6198 savew
= warningcount
, savee
= errorcount
;
6199 rhs
= initialize_reference (type
, rhs
, /*decl=*/NULL_TREE
);
6202 if (warningcount
> savew
)
6203 cp_warning_at ("in passing argument %P of `%+D'", parmnum
, fndecl
);
6204 else if (errorcount
> savee
)
6205 cp_error_at ("in passing argument %P of `%+D'", parmnum
, fndecl
);
6211 exp
= require_complete_type (exp
);
6212 if (exp
== error_mark_node
)
6213 return error_mark_node
;
6215 if (TREE_CODE (rhstype
) == REFERENCE_TYPE
)
6216 rhstype
= TREE_TYPE (rhstype
);
6218 type
= complete_type (type
);
6220 if (IS_AGGR_TYPE (type
))
6221 return ocp_convert (type
, rhs
, CONV_IMPLICIT
|CONV_FORCE_TEMP
, flags
);
6223 return convert_for_assignment (type
, rhs
, errtype
, fndecl
, parmnum
);
6226 /* Expand an ASM statement with operands, handling output operands
6227 that are not variables or INDIRECT_REFS by transforming such
6228 cases into cases that expand_asm_operands can handle.
6230 Arguments are same as for expand_asm_operands.
6232 We don't do default conversions on all inputs, because it can screw
6233 up operands that are expected to be in memory. */
6236 c_expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, filename
, line
)
6237 tree string
, outputs
, inputs
, clobbers
;
6239 const char *filename
;
6242 int noutputs
= list_length (outputs
);
6244 /* o[I] is the place that output number I should be written. */
6245 register tree
*o
= (tree
*) alloca (noutputs
* sizeof (tree
));
6248 /* Record the contents of OUTPUTS before it is modified. */
6249 for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
6250 o
[i
] = TREE_VALUE (tail
);
6252 /* Generate the ASM_OPERANDS insn;
6253 store into the TREE_VALUEs of OUTPUTS some trees for
6254 where the values were actually stored. */
6255 expand_asm_operands (string
, outputs
, inputs
, clobbers
, vol
, filename
, line
);
6257 /* Copy all the intermediate outputs into the specified outputs. */
6258 for (i
= 0, tail
= outputs
; tail
; tail
= TREE_CHAIN (tail
), i
++)
6260 if (o
[i
] != TREE_VALUE (tail
))
6262 expand_expr (build_modify_expr (o
[i
], NOP_EXPR
, TREE_VALUE (tail
)),
6263 const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
6266 /* Restore the original value so that it's correct the next
6267 time we expand this function. */
6268 TREE_VALUE (tail
) = o
[i
];
6270 /* Detect modification of read-only values.
6271 (Otherwise done by build_modify_expr.) */
6274 tree type
= TREE_TYPE (o
[i
]);
6275 if (type
!= error_mark_node
6276 && (CP_TYPE_CONST_P (type
)
6277 || (CLASS_TYPE_P (type
) && C_TYPE_FIELDS_READONLY (type
))))
6278 readonly_error (o
[i
], "modification by `asm'", 1);
6282 /* Those MODIFY_EXPRs could do autoincrements. */
6286 /* If RETVAL is the address of, or a reference to, a local variable or
6287 temporary give an appropraite warning. */
6290 maybe_warn_about_returning_address_of_local (retval
)
6293 tree valtype
= TREE_TYPE (DECL_RESULT (current_function_decl
));
6294 tree whats_returned
= retval
;
6298 if (TREE_CODE (whats_returned
) == COMPOUND_EXPR
)
6299 whats_returned
= TREE_OPERAND (whats_returned
, 1);
6300 else if (TREE_CODE (whats_returned
) == CONVERT_EXPR
6301 || TREE_CODE (whats_returned
) == NON_LVALUE_EXPR
6302 || TREE_CODE (whats_returned
) == NOP_EXPR
)
6303 whats_returned
= TREE_OPERAND (whats_returned
, 0);
6308 if (TREE_CODE (whats_returned
) != ADDR_EXPR
)
6310 whats_returned
= TREE_OPERAND (whats_returned
, 0);
6312 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
6314 if (TREE_CODE (whats_returned
) == AGGR_INIT_EXPR
6315 || TREE_CODE (whats_returned
) == TARGET_EXPR
)
6317 /* Get the target. */
6318 whats_returned
= TREE_OPERAND (whats_returned
, 0);
6319 warning ("returning reference to temporary");
6322 if (TREE_CODE (whats_returned
) == VAR_DECL
6323 && DECL_NAME (whats_returned
)
6324 && TEMP_NAME_P (DECL_NAME (whats_returned
)))
6326 warning ("reference to non-lvalue returned");
6331 if (TREE_CODE (whats_returned
) == VAR_DECL
6332 && DECL_NAME (whats_returned
)
6333 && DECL_FUNCTION_SCOPE_P (whats_returned
)
6334 && !(TREE_STATIC (whats_returned
)
6335 || TREE_PUBLIC (whats_returned
)))
6337 if (TREE_CODE (valtype
) == REFERENCE_TYPE
)
6338 cp_warning_at ("reference to local variable `%D' returned",
6341 cp_warning_at ("address of local variable `%D' returned",
6347 /* Check that returning RETVAL from the current function is valid.
6348 Return an expression explicitly showing all conversions required to
6349 change RETVAL into the function return type, and to assign it to
6350 the DECL_RESULT for the function. */
6353 check_return_expr (retval
)
6357 /* The type actually returned by the function, after any
6360 int fn_returns_value_p
;
6362 /* A `volatile' function is one that isn't supposed to return, ever.
6363 (This is a G++ extension, used to get better code for functions
6364 that call the `volatile' function.) */
6365 if (TREE_THIS_VOLATILE (current_function_decl
))
6366 warning ("function declared `noreturn' has a `return' statement");
6368 /* Check for various simple errors. */
6369 if (DECL_DESTRUCTOR_P (current_function_decl
))
6372 error ("returning a value from a destructor");
6375 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
6377 if (in_function_try_handler
)
6378 /* If a return statement appears in a handler of the
6379 function-try-block of a constructor, the program is ill-formed. */
6380 error ("cannot return from a handler of a function-try-block of a constructor");
6382 /* You can't return a value from a constructor. */
6383 error ("returning a value from a constructor");
6387 if (processing_template_decl
)
6389 current_function_returns_value
= 1;
6393 /* When no explicit return-value is given in a function with a named
6394 return value, the named return value is used. */
6395 result
= DECL_RESULT (current_function_decl
);
6396 valtype
= TREE_TYPE (result
);
6397 my_friendly_assert (valtype
!= NULL_TREE
, 19990924);
6398 fn_returns_value_p
= !VOID_TYPE_P (valtype
);
6399 if (!retval
&& DECL_NAME (result
) && fn_returns_value_p
)
6402 /* Check for a return statement with no return value in a function
6403 that's supposed to return a value. */
6404 if (!retval
&& fn_returns_value_p
)
6406 pedwarn ("return-statement with no value, in function declared with a non-void return type");
6407 /* Clear this, so finish_function won't say that we reach the
6408 end of a non-void function (which we don't, we gave a
6410 current_function_returns_null
= 0;
6412 /* Check for a return statement with a value in a function that
6413 isn't supposed to return a value. */
6414 else if (retval
&& !fn_returns_value_p
)
6416 if (VOID_TYPE_P (TREE_TYPE (retval
)))
6417 /* You can return a `void' value from a function of `void'
6418 type. In that case, we have to evaluate the expression for
6419 its side-effects. */
6420 finish_expr_stmt (retval
);
6422 pedwarn ("return-statement with a value, in function declared with a void return type");
6424 current_function_returns_null
= 1;
6426 /* There's really no value to return, after all. */
6430 /* Remember that this function can sometimes return without a
6432 current_function_returns_null
= 1;
6434 /* Remember that this function did return a value. */
6435 current_function_returns_value
= 1;
6437 /* Only operator new(...) throw(), can return NULL [expr.new/13]. */
6438 if ((DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == NEW_EXPR
6439 || DECL_OVERLOADED_OPERATOR_P (current_function_decl
) == VEC_NEW_EXPR
)
6440 && !TYPE_NOTHROW_P (TREE_TYPE (current_function_decl
))
6442 && null_ptr_cst_p (retval
))
6443 warning ("`operator new' must not return NULL unless it is declared `throw()' (or -fcheck-new is in effect)");
6445 /* Effective C++ rule 15. See also start_function. */
6447 && DECL_NAME (current_function_decl
) == ansi_assopname(NOP_EXPR
)
6448 && retval
!= current_class_ref
)
6449 warning ("`operator=' should return a reference to `*this'");
6451 /* The fabled Named Return Value optimization, as per [class.copy]/15:
6453 [...] For a function with a class return type, if the expression
6454 in the return statement is the name of a local object, and the cv-
6455 unqualified type of the local object is the same as the function
6456 return type, an implementation is permitted to omit creating the tem-
6457 porary object to hold the function return value [...]
6459 So, if this is a value-returning function that always returns the same
6460 local variable, remember it.
6462 It might be nice to be more flexible, and choose the first suitable
6463 variable even if the function sometimes returns something else, but
6464 then we run the risk of clobbering the variable we chose if the other
6465 returned expression uses the chosen variable somehow. And people expect
6466 this restriction, anyway. (jason 2000-11-19)
6468 See finish_function, genrtl_start_function, and declare_return_variable
6469 for other pieces of this optimization. */
6471 if (fn_returns_value_p
&& flag_elide_constructors
)
6473 if (retval
!= NULL_TREE
6474 && (current_function_return_value
== NULL_TREE
6475 || current_function_return_value
== retval
)
6476 && TREE_CODE (retval
) == VAR_DECL
6477 && DECL_CONTEXT (retval
) == current_function_decl
6478 && ! TREE_STATIC (retval
)
6479 && (DECL_ALIGN (retval
)
6480 >= DECL_ALIGN (DECL_RESULT (current_function_decl
)))
6481 && same_type_p ((TYPE_MAIN_VARIANT
6482 (TREE_TYPE (retval
))),
6484 (TREE_TYPE (TREE_TYPE (current_function_decl
))))))
6485 current_function_return_value
= retval
;
6487 current_function_return_value
= error_mark_node
;
6490 /* We don't need to do any conversions when there's nothing being
6492 if (!retval
|| retval
== error_mark_node
)
6495 /* Do any required conversions. */
6496 if (retval
== result
|| DECL_CONSTRUCTOR_P (current_function_decl
))
6497 /* No conversions are required. */
6501 /* The type the function is declared to return. */
6502 tree functype
= TREE_TYPE (TREE_TYPE (current_function_decl
));
6504 /* First convert the value to the function's return type, then
6505 to the type of return value's location to handle the
6506 case that functype is smaller than the valtype. */
6507 retval
= convert_for_initialization
6508 (NULL_TREE
, functype
, retval
, LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
,
6509 "return", NULL_TREE
, 0);
6510 retval
= convert (valtype
, retval
);
6512 /* If the conversion failed, treat this just like `return;'. */
6513 if (retval
== error_mark_node
)
6515 /* We can't initialize a register from a AGGR_INIT_EXPR. */
6516 else if (! current_function_returns_struct
6517 && TREE_CODE (retval
) == TARGET_EXPR
6518 && TREE_CODE (TREE_OPERAND (retval
, 1)) == AGGR_INIT_EXPR
)
6519 retval
= build (COMPOUND_EXPR
, TREE_TYPE (retval
), retval
,
6520 TREE_OPERAND (retval
, 0));
6522 maybe_warn_about_returning_address_of_local (retval
);
6525 /* Actually copy the value returned into the appropriate location. */
6526 if (retval
&& retval
!= result
)
6527 retval
= build (INIT_EXPR
, TREE_TYPE (result
), result
, retval
);
6533 /* Returns nonzero if the pointer-type FROM can be converted to the
6534 pointer-type TO via a qualification conversion. If CONSTP is -1,
6535 then we return nonzero if the pointers are similar, and the
6536 cv-qualification signature of FROM is a proper subset of that of TO.
6538 If CONSTP is positive, then all outer pointers have been
6542 comp_ptr_ttypes_real (to
, from
, constp
)
6546 int to_more_cv_qualified
= 0;
6548 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
6550 if (TREE_CODE (to
) != TREE_CODE (from
))
6553 if (TREE_CODE (from
) == OFFSET_TYPE
6554 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
6555 TYPE_OFFSET_BASETYPE (to
)))
6558 /* Const and volatile mean something different for function types,
6559 so the usual checks are not appropriate. */
6560 if (TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
6562 if (!at_least_as_qualified_p (to
, from
))
6565 if (!at_least_as_qualified_p (from
, to
))
6570 ++to_more_cv_qualified
;
6574 constp
&= TYPE_READONLY (to
);
6577 if (TREE_CODE (to
) != POINTER_TYPE
)
6578 return ((constp
>= 0 || to_more_cv_qualified
)
6579 && same_type_ignoring_top_level_qualifiers_p (to
, from
));
6583 /* When comparing, say, char ** to char const **, this function takes
6584 the 'char *' and 'char const *'. Do not pass non-pointer/reference
6585 types to this function. */
6588 comp_ptr_ttypes (to
, from
)
6591 return comp_ptr_ttypes_real (to
, from
, 1);
6594 /* Returns 1 if to and from are (possibly multi-level) pointers to the same
6595 type or inheritance-related types, regardless of cv-quals. */
6598 ptr_reasonably_similar (to
, from
)
6601 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
6603 /* Any target type is similar enough to void. */
6604 if (TREE_CODE (to
) == VOID_TYPE
6605 || TREE_CODE (from
) == VOID_TYPE
)
6608 if (TREE_CODE (to
) != TREE_CODE (from
))
6611 if (TREE_CODE (from
) == OFFSET_TYPE
6612 && comptypes (TYPE_OFFSET_BASETYPE (to
),
6613 TYPE_OFFSET_BASETYPE (from
),
6614 COMPARE_BASE
| COMPARE_RELAXED
))
6617 if (TREE_CODE (to
) == INTEGER_TYPE
6618 && TYPE_PRECISION (to
) == TYPE_PRECISION (from
))
6621 if (TREE_CODE (to
) == FUNCTION_TYPE
)
6624 if (TREE_CODE (to
) != POINTER_TYPE
)
6626 (TYPE_MAIN_VARIANT (to
), TYPE_MAIN_VARIANT (from
),
6627 COMPARE_BASE
| COMPARE_RELAXED
);
6631 /* Like comp_ptr_ttypes, for const_cast. */
6634 comp_ptr_ttypes_const (to
, from
)
6637 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
6639 if (TREE_CODE (to
) != TREE_CODE (from
))
6642 if (TREE_CODE (from
) == OFFSET_TYPE
6643 && same_type_p (TYPE_OFFSET_BASETYPE (from
),
6644 TYPE_OFFSET_BASETYPE (to
)))
6647 if (TREE_CODE (to
) != POINTER_TYPE
)
6648 return same_type_ignoring_top_level_qualifiers_p (to
, from
);
6652 /* Like comp_ptr_ttypes, for reinterpret_cast. */
6655 comp_ptr_ttypes_reinterpret (to
, from
)
6660 for (; ; to
= TREE_TYPE (to
), from
= TREE_TYPE (from
))
6662 if (TREE_CODE (from
) == OFFSET_TYPE
)
6663 from
= TREE_TYPE (from
);
6664 if (TREE_CODE (to
) == OFFSET_TYPE
)
6665 to
= TREE_TYPE (to
);
6667 /* Const and volatile mean something different for function types,
6668 so the usual checks are not appropriate. */
6669 if (TREE_CODE (from
) != FUNCTION_TYPE
&& TREE_CODE (from
) != METHOD_TYPE
6670 && TREE_CODE (to
) != FUNCTION_TYPE
&& TREE_CODE (to
) != METHOD_TYPE
)
6672 if (!at_least_as_qualified_p (to
, from
))
6676 && !at_least_as_qualified_p (from
, to
))
6678 constp
&= TYPE_READONLY (to
);
6681 if (TREE_CODE (from
) != POINTER_TYPE
6682 || TREE_CODE (to
) != POINTER_TYPE
)
6687 /* Returns the type qualifiers for this type, including the qualifiers on the
6688 elements for an array type. */
6691 cp_type_quals (type
)
6694 type
= strip_array_types (type
);
6695 if (type
== error_mark_node
)
6696 return TYPE_UNQUALIFIED
;
6697 return TYPE_QUALS (type
);
6700 /* Returns nonzero if the TYPE contains a mutable member */
6703 cp_has_mutable_p (type
)
6706 type
= strip_array_types (type
);
6708 return CLASS_TYPE_P (type
) && CLASSTYPE_HAS_MUTABLE (type
);
6711 /* Subroutine of casts_away_constness. Make T1 and T2 point at
6712 exemplar types such that casting T1 to T2 is casting away castness
6713 if and only if there is no implicit conversion from T1 to T2. */
6716 casts_away_constness_r (t1
, t2
)
6723 /* [expr.const.cast]
6725 For multi-level pointer to members and multi-level mixed pointers
6726 and pointers to members (conv.qual), the "member" aspect of a
6727 pointer to member level is ignored when determining if a const
6728 cv-qualifier has been cast away. */
6729 if (TYPE_PTRMEM_P (*t1
))
6730 *t1
= build_pointer_type (TREE_TYPE (TREE_TYPE (*t1
)));
6731 if (TYPE_PTRMEM_P (*t2
))
6732 *t2
= build_pointer_type (TREE_TYPE (TREE_TYPE (*t2
)));
6734 /* [expr.const.cast]
6736 For two pointer types:
6738 X1 is T1cv1,1 * ... cv1,N * where T1 is not a pointer type
6739 X2 is T2cv2,1 * ... cv2,M * where T2 is not a pointer type
6742 casting from X1 to X2 casts away constness if, for a non-pointer
6743 type T there does not exist an implicit conversion (clause
6746 Tcv1,(N-K+1) * cv1,(N-K+2) * ... cv1,N *
6750 Tcv2,(M-K+1) * cv2,(M-K+2) * ... cv2,M *. */
6752 if (TREE_CODE (*t1
) != POINTER_TYPE
6753 || TREE_CODE (*t2
) != POINTER_TYPE
)
6755 *t1
= cp_build_qualified_type (void_type_node
,
6756 cp_type_quals (*t1
));
6757 *t2
= cp_build_qualified_type (void_type_node
,
6758 cp_type_quals (*t2
));
6762 quals1
= cp_type_quals (*t1
);
6763 quals2
= cp_type_quals (*t2
);
6764 *t1
= TREE_TYPE (*t1
);
6765 *t2
= TREE_TYPE (*t2
);
6766 casts_away_constness_r (t1
, t2
);
6767 *t1
= build_pointer_type (*t1
);
6768 *t2
= build_pointer_type (*t2
);
6769 *t1
= cp_build_qualified_type (*t1
, quals1
);
6770 *t2
= cp_build_qualified_type (*t2
, quals2
);
6773 /* Returns nonzero if casting from TYPE1 to TYPE2 casts away
6777 casts_away_constness (t1
, t2
)
6781 if (TREE_CODE (t2
) == REFERENCE_TYPE
)
6783 /* [expr.const.cast]
6785 Casting from an lvalue of type T1 to an lvalue of type T2
6786 using a reference cast casts away constness if a cast from an
6787 rvalue of type "pointer to T1" to the type "pointer to T2"
6788 casts away constness. */
6789 t1
= (TREE_CODE (t1
) == REFERENCE_TYPE
6790 ? TREE_TYPE (t1
) : t1
);
6791 return casts_away_constness (build_pointer_type (t1
),
6792 build_pointer_type (TREE_TYPE (t2
)));
6795 if (TYPE_PTRMEM_P (t1
) && TYPE_PTRMEM_P (t2
))
6796 /* [expr.const.cast]
6798 Casting from an rvalue of type "pointer to data member of X
6799 of type T1" to the type "pointer to data member of Y of type
6800 T2" casts away constness if a cast from an rvalue of type
6801 "pointer to T1" to the type "pointer to T2" casts away
6803 return casts_away_constness
6804 (build_pointer_type (TREE_TYPE (TREE_TYPE (t1
))),
6805 build_pointer_type (TREE_TYPE (TREE_TYPE (t2
))));
6807 /* Casting away constness is only something that makes sense for
6808 pointer or reference types. */
6809 if (TREE_CODE (t1
) != POINTER_TYPE
6810 || TREE_CODE (t2
) != POINTER_TYPE
)
6813 /* Top-level qualifiers don't matter. */
6814 t1
= TYPE_MAIN_VARIANT (t1
);
6815 t2
= TYPE_MAIN_VARIANT (t2
);
6816 casts_away_constness_r (&t1
, &t2
);
6817 if (!can_convert (t2
, t1
))
6823 /* Returns TYPE with its cv qualifiers removed
6824 TYPE is T cv* .. *cv where T is not a pointer type,
6825 returns T * .. *. (If T is an array type, then the cv qualifiers
6826 above are those of the array members.) */
6829 strip_all_pointer_quals (type
)
6832 if (TREE_CODE (type
) == POINTER_TYPE
)
6833 return build_pointer_type (strip_all_pointer_quals (TREE_TYPE (type
)));
6834 else if (TREE_CODE (type
) == OFFSET_TYPE
)
6835 return build_offset_type (TYPE_OFFSET_BASETYPE (type
),
6836 strip_all_pointer_quals (TREE_TYPE (type
)));
6838 return TYPE_MAIN_VARIANT (type
);