1 /* Functions related to invoking methods and overloaded functions.
2 Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com) and
5 modified by Brendan Kehoe (brendan@cygnus.com).
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2, or (at your option)
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING. If not, write to
21 the Free Software Foundation, 59 Temple Place - Suite 330,
22 Boston, MA 02111-1307, USA. */
25 /* High-level class interface. */
29 #include "coretypes.h"
38 #include "diagnostic.h"
43 /* The various kinds of conversion. */
45 typedef enum conversion_kind
{
59 /* The rank of the conversion. Order of the enumerals matters; better
60 conversions should come earlier in the list. */
62 typedef enum conversion_rank
{
73 /* An implicit conversion sequence, in the sense of [over.best.ics].
74 The first conversion to be performed is at the end of the chain.
75 That conversion is always an cr_identity conversion. */
77 typedef struct conversion conversion
;
79 /* The kind of conversion represented by this step. */
81 /* The rank of this conversion. */
83 BOOL_BITFIELD user_conv_p
: 1;
84 BOOL_BITFIELD ellipsis_p
: 1;
85 BOOL_BITFIELD this_p
: 1;
86 BOOL_BITFIELD bad_p
: 1;
87 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
88 temporary should be created to hold the result of the
90 BOOL_BITFIELD need_temporary_p
: 1;
91 /* If KIND is ck_identity or ck_base_conv, true to indicate that the
92 copy constructor must be accessible, even though it is not being
94 BOOL_BITFIELD check_copy_constructor_p
: 1;
95 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
96 from a pointer-to-derived to pointer-to-base is being performed. */
97 BOOL_BITFIELD base_p
: 1;
98 /* The type of the expression resulting from the conversion. */
101 /* The next conversion in the chain. Since the conversions are
102 arranged from outermost to innermost, the NEXT conversion will
103 actually be performed before this conversion. This variant is
104 used only when KIND is neither ck_identity nor ck_ambig. */
106 /* The expression at the beginning of the conversion chain. This
107 variant is used only if KIND is ck_identity or ck_ambig. */
110 /* The function candidate corresponding to this conversion
111 sequence. This field is only used if KIND is ck_user. */
112 struct z_candidate
*cand
;
115 #define CONVERSION_RANK(NODE) \
116 ((NODE)->bad_p ? cr_bad \
117 : (NODE)->ellipsis_p ? cr_ellipsis \
118 : (NODE)->user_conv_p ? cr_user \
121 static struct obstack conversion_obstack
;
122 static bool conversion_obstack_initialized
;
124 static struct z_candidate
* tourney (struct z_candidate
*);
125 static int equal_functions (tree
, tree
);
126 static int joust (struct z_candidate
*, struct z_candidate
*, bool);
127 static int compare_ics (conversion
*, conversion
*);
128 static tree
build_over_call (struct z_candidate
*, int);
129 static tree
build_java_interface_fn_ref (tree
, tree
);
130 #define convert_like(CONV, EXPR) \
131 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
132 /*issue_conversion_warnings=*/true, \
134 #define convert_like_with_context(CONV, EXPR, FN, ARGNO) \
135 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
136 /*issue_conversion_warnings=*/true, \
138 static tree
convert_like_real (conversion
*, tree
, tree
, int, int, bool,
140 static void op_error (enum tree_code
, enum tree_code
, tree
, tree
,
142 static tree
build_object_call (tree
, tree
);
143 static tree
resolve_args (tree
);
144 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int);
145 static void print_z_candidate (const char *, struct z_candidate
*);
146 static void print_z_candidates (struct z_candidate
*);
147 static tree
build_this (tree
);
148 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
149 static bool any_strictly_viable (struct z_candidate
*);
150 static struct z_candidate
*add_template_candidate
151 (struct z_candidate
**, tree
, tree
, tree
, tree
, tree
,
152 tree
, tree
, int, unification_kind_t
);
153 static struct z_candidate
*add_template_candidate_real
154 (struct z_candidate
**, tree
, tree
, tree
, tree
, tree
,
155 tree
, tree
, int, tree
, unification_kind_t
);
156 static struct z_candidate
*add_template_conv_candidate
157 (struct z_candidate
**, tree
, tree
, tree
, tree
, tree
, tree
);
158 static void add_builtin_candidates
159 (struct z_candidate
**, enum tree_code
, enum tree_code
,
161 static void add_builtin_candidate
162 (struct z_candidate
**, enum tree_code
, enum tree_code
,
163 tree
, tree
, tree
, tree
*, tree
*, int);
164 static bool is_complete (tree
);
165 static void build_builtin_candidate
166 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
168 static struct z_candidate
*add_conv_candidate
169 (struct z_candidate
**, tree
, tree
, tree
, tree
, tree
);
170 static struct z_candidate
*add_function_candidate
171 (struct z_candidate
**, tree
, tree
, tree
, tree
, tree
, int);
172 static conversion
*implicit_conversion (tree
, tree
, tree
, int);
173 static conversion
*standard_conversion (tree
, tree
, tree
);
174 static conversion
*reference_binding (tree
, tree
, tree
, int);
175 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
176 static bool is_subseq (conversion
*, conversion
*);
177 static tree
maybe_handle_ref_bind (conversion
**);
178 static void maybe_handle_implicit_object (conversion
**);
179 static struct z_candidate
*add_candidate
180 (struct z_candidate
**, tree
, tree
, size_t,
181 conversion
**, tree
, tree
, int);
182 static tree
source_type (conversion
*);
183 static void add_warning (struct z_candidate
*, struct z_candidate
*);
184 static bool reference_related_p (tree
, tree
);
185 static bool reference_compatible_p (tree
, tree
);
186 static conversion
*convert_class_to_reference (tree
, tree
, tree
);
187 static conversion
*direct_reference_binding (tree
, conversion
*);
188 static bool promoted_arithmetic_type_p (tree
);
189 static conversion
*conditional_conversion (tree
, tree
);
190 static char *name_as_c_string (tree
, tree
, bool *);
191 static tree
call_builtin_trap (void);
192 static tree
prep_operand (tree
);
193 static void add_candidates (tree
, tree
, tree
, bool, tree
, tree
,
194 int, struct z_candidate
**);
195 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
196 static bool magic_varargs_p (tree
);
197 static tree
build_temp (tree
, tree
, int, void (**)(const char *, ...));
198 static void check_constructor_callable (tree
, tree
);
200 /* Returns nonzero iff the destructor name specified in NAME
201 (a BIT_NOT_EXPR) matches BASETYPE. The operand of NAME can take many
205 check_dtor_name (tree basetype
, tree name
)
207 name
= TREE_OPERAND (name
, 0);
209 /* Just accept something we've already complained about. */
210 if (name
== error_mark_node
)
213 if (TREE_CODE (name
) == TYPE_DECL
)
214 name
= TREE_TYPE (name
);
215 else if (TYPE_P (name
))
217 else if (TREE_CODE (name
) == IDENTIFIER_NODE
)
219 if ((IS_AGGR_TYPE (basetype
) && name
== constructor_name (basetype
))
220 || (TREE_CODE (basetype
) == ENUMERAL_TYPE
221 && name
== TYPE_IDENTIFIER (basetype
)))
224 name
= get_type_value (name
);
230 template <class T> struct S { ~S(); };
234 NAME will be a class template. */
235 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
239 if (name
&& TYPE_MAIN_VARIANT (basetype
) == TYPE_MAIN_VARIANT (name
))
244 /* We want the address of a function or method. We avoid creating a
245 pointer-to-member function. */
248 build_addr_func (tree function
)
250 tree type
= TREE_TYPE (function
);
252 /* We have to do these by hand to avoid real pointer to member
254 if (TREE_CODE (type
) == METHOD_TYPE
)
256 if (TREE_CODE (function
) == OFFSET_REF
)
258 tree object
= build_address (TREE_OPERAND (function
, 0));
259 return get_member_function_from_ptrfunc (&object
,
260 TREE_OPERAND (function
, 1));
262 function
= build_address (function
);
265 function
= decay_conversion (function
);
270 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
271 POINTER_TYPE to those. Note, pointer to member function types
272 (TYPE_PTRMEMFUNC_P) must be handled by our callers. */
275 build_call (tree function
, tree parms
)
277 int is_constructor
= 0;
284 function
= build_addr_func (function
);
286 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (function
)))
288 sorry ("unable to call pointer to member function here");
289 return error_mark_node
;
292 fntype
= TREE_TYPE (TREE_TYPE (function
));
293 result_type
= TREE_TYPE (fntype
);
295 if (TREE_CODE (function
) == ADDR_EXPR
296 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
297 decl
= TREE_OPERAND (function
, 0);
301 /* We check both the decl and the type; a function may be known not to
302 throw without being declared throw(). */
303 nothrow
= ((decl
&& TREE_NOTHROW (decl
))
304 || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (function
))));
306 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
)
307 current_function_returns_abnormally
= 1;
309 if (decl
&& TREE_DEPRECATED (decl
))
310 warn_deprecated_use (decl
);
311 require_complete_eh_spec_types (fntype
, decl
);
313 if (decl
&& DECL_CONSTRUCTOR_P (decl
))
316 if (decl
&& ! TREE_USED (decl
))
318 /* We invoke build_call directly for several library functions.
319 These may have been declared normally if we're building libgcc,
320 so we can't just check DECL_ARTIFICIAL. */
321 gcc_assert (DECL_ARTIFICIAL (decl
)
322 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
327 /* Don't pass empty class objects by value. This is useful
328 for tags in STL, which are used to control overload resolution.
329 We don't need to handle other cases of copying empty classes. */
330 if (! decl
|| ! DECL_BUILT_IN (decl
))
331 for (tmp
= parms
; tmp
; tmp
= TREE_CHAIN (tmp
))
332 if (is_empty_class (TREE_TYPE (TREE_VALUE (tmp
)))
333 && ! TREE_ADDRESSABLE (TREE_TYPE (TREE_VALUE (tmp
))))
335 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (TREE_VALUE (tmp
)));
336 TREE_VALUE (tmp
) = build2 (COMPOUND_EXPR
, TREE_TYPE (t
),
337 TREE_VALUE (tmp
), t
);
340 function
= build3 (CALL_EXPR
, result_type
, function
, parms
, NULL_TREE
);
341 TREE_HAS_CONSTRUCTOR (function
) = is_constructor
;
342 TREE_NOTHROW (function
) = nothrow
;
347 /* Build something of the form ptr->method (args)
348 or object.method (args). This can also build
349 calls to constructors, and find friends.
351 Member functions always take their class variable
354 INSTANCE is a class instance.
356 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
358 PARMS help to figure out what that NAME really refers to.
360 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
361 down to the real instance type to use for access checking. We need this
362 information to get protected accesses correct.
364 FLAGS is the logical disjunction of zero or more LOOKUP_
365 flags. See cp-tree.h for more info.
367 If this is all OK, calls build_function_call with the resolved
370 This function must also handle being called to perform
371 initialization, promotion/coercion of arguments, and
372 instantiation of default parameters.
374 Note that NAME may refer to an instance variable name. If
375 `operator()()' is defined for the type of that field, then we return
378 /* New overloading code. */
380 typedef struct z_candidate z_candidate
;
382 typedef struct candidate_warning candidate_warning
;
383 struct candidate_warning
{
385 candidate_warning
*next
;
389 /* The FUNCTION_DECL that will be called if this candidate is
390 selected by overload resolution. */
392 /* The arguments to use when calling this function. */
394 /* The implicit conversion sequences for each of the arguments to
397 /* The number of implicit conversion sequences. */
399 /* If FN is a user-defined conversion, the standard conversion
400 sequence from the type returned by FN to the desired destination
402 conversion
*second_conv
;
404 /* If FN is a member function, the binfo indicating the path used to
405 qualify the name of FN at the call site. This path is used to
406 determine whether or not FN is accessible if it is selected by
407 overload resolution. The DECL_CONTEXT of FN will always be a
408 (possibly improper) base of this binfo. */
410 /* If FN is a non-static member function, the binfo indicating the
411 subobject to which the `this' pointer should be converted if FN
412 is selected by overload resolution. The type pointed to the by
413 the `this' pointer must correspond to the most derived class
414 indicated by the CONVERSION_PATH. */
415 tree conversion_path
;
417 candidate_warning
*warnings
;
421 /* Returns true iff T is a null pointer constant in the sense of
425 null_ptr_cst_p (tree t
)
429 A null pointer constant is an integral constant expression
430 (_expr.const_) rvalue of integer type that evaluates to zero. */
431 if (DECL_INTEGRAL_CONSTANT_VAR_P (t
))
432 t
= decl_constant_value (t
);
434 || (CP_INTEGRAL_TYPE_P (TREE_TYPE (t
)) && integer_zerop (t
)))
439 /* Returns nonzero if PARMLIST consists of only default parms and/or
443 sufficient_parms_p (tree parmlist
)
445 for (; parmlist
&& parmlist
!= void_list_node
;
446 parmlist
= TREE_CHAIN (parmlist
))
447 if (!TREE_PURPOSE (parmlist
))
452 /* Allocate N bytes of memory from the conversion obstack. The memory
453 is zeroed before being returned. */
456 conversion_obstack_alloc (size_t n
)
459 if (!conversion_obstack_initialized
)
461 gcc_obstack_init (&conversion_obstack
);
462 conversion_obstack_initialized
= true;
464 p
= obstack_alloc (&conversion_obstack
, n
);
469 /* Dynamically allocate a conversion. */
472 alloc_conversion (conversion_kind kind
)
475 c
= conversion_obstack_alloc (sizeof (conversion
));
480 #ifdef ENABLE_CHECKING
482 /* Make sure that all memory on the conversion obstack has been
486 validate_conversion_obstack (void)
488 if (conversion_obstack_initialized
)
489 gcc_assert ((obstack_next_free (&conversion_obstack
)
490 == obstack_base (&conversion_obstack
)));
493 #endif /* ENABLE_CHECKING */
495 /* Dynamically allocate an array of N conversions. */
498 alloc_conversions (size_t n
)
500 return conversion_obstack_alloc (n
* sizeof (conversion
*));
504 build_conv (conversion_kind code
, tree type
, conversion
*from
)
507 conversion_rank rank
= CONVERSION_RANK (from
);
509 /* We can't use buildl1 here because CODE could be USER_CONV, which
510 takes two arguments. In that case, the caller is responsible for
511 filling in the second argument. */
512 t
= alloc_conversion (code
);
535 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
536 t
->bad_p
= from
->bad_p
;
541 /* Build a representation of the identity conversion from EXPR to
542 itself. The TYPE should match the the type of EXPR, if EXPR is
546 build_identity_conv (tree type
, tree expr
)
550 c
= alloc_conversion (ck_identity
);
557 /* Converting from EXPR to TYPE was ambiguous in the sense that there
558 were multiple user-defined conversions to accomplish the job.
559 Build a conversion that indicates that ambiguity. */
562 build_ambiguous_conv (tree type
, tree expr
)
566 c
= alloc_conversion (ck_ambig
);
574 strip_top_quals (tree t
)
576 if (TREE_CODE (t
) == ARRAY_TYPE
)
578 return cp_build_qualified_type (t
, 0);
581 /* Returns the standard conversion path (see [conv]) from type FROM to type
582 TO, if any. For proper handling of null pointer constants, you must
583 also pass the expression EXPR to convert from. */
586 standard_conversion (tree to
, tree from
, tree expr
)
588 enum tree_code fcode
, tcode
;
590 bool fromref
= false;
592 to
= non_reference (to
);
593 if (TREE_CODE (from
) == REFERENCE_TYPE
)
596 from
= TREE_TYPE (from
);
598 to
= strip_top_quals (to
);
599 from
= strip_top_quals (from
);
601 if ((TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
602 && expr
&& type_unknown_p (expr
))
604 expr
= instantiate_type (to
, expr
, tf_conv
);
605 if (expr
== error_mark_node
)
607 from
= TREE_TYPE (expr
);
610 fcode
= TREE_CODE (from
);
611 tcode
= TREE_CODE (to
);
613 conv
= build_identity_conv (from
, expr
);
614 if (fcode
== FUNCTION_TYPE
)
616 from
= build_pointer_type (from
);
617 fcode
= TREE_CODE (from
);
618 conv
= build_conv (ck_lvalue
, from
, conv
);
620 else if (fcode
== ARRAY_TYPE
)
622 from
= build_pointer_type (TREE_TYPE (from
));
623 fcode
= TREE_CODE (from
);
624 conv
= build_conv (ck_lvalue
, from
, conv
);
626 else if (fromref
|| (expr
&& lvalue_p (expr
)))
627 conv
= build_conv (ck_rvalue
, from
, conv
);
629 /* Allow conversion between `__complex__' data types. */
630 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
632 /* The standard conversion sequence to convert FROM to TO is
633 the standard conversion sequence to perform componentwise
635 conversion
*part_conv
= standard_conversion
636 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
);
640 conv
= build_conv (part_conv
->kind
, to
, conv
);
641 conv
->rank
= part_conv
->rank
;
649 if (same_type_p (from
, to
))
652 if ((tcode
== POINTER_TYPE
|| TYPE_PTR_TO_MEMBER_P (to
))
653 && expr
&& null_ptr_cst_p (expr
))
654 conv
= build_conv (ck_std
, to
, conv
);
655 else if (tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
656 && TREE_CODE (TREE_TYPE (to
)) == VECTOR_TYPE
657 && TREE_CODE (TREE_TYPE (from
)) == VECTOR_TYPE
658 && vector_types_convertible_p (TREE_TYPE (to
), TREE_TYPE (from
)))
659 conv
= build_conv (ck_std
, to
, conv
);
660 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
661 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
663 /* For backwards brain damage compatibility, allow interconversion of
664 pointers and integers with a pedwarn. */
665 conv
= build_conv (ck_std
, to
, conv
);
668 else if (tcode
== ENUMERAL_TYPE
&& fcode
== INTEGER_TYPE
)
670 /* For backwards brain damage compatibility, allow interconversion of
671 enums and integers with a pedwarn. */
672 conv
= build_conv (ck_std
, to
, conv
);
675 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
676 || (TYPE_PTRMEM_P (to
) && TYPE_PTRMEM_P (from
)))
681 if (tcode
== POINTER_TYPE
682 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from
),
685 else if (VOID_TYPE_P (TREE_TYPE (to
))
686 && !TYPE_PTRMEM_P (from
)
687 && TREE_CODE (TREE_TYPE (from
)) != FUNCTION_TYPE
)
689 from
= build_pointer_type
690 (cp_build_qualified_type (void_type_node
,
691 cp_type_quals (TREE_TYPE (from
))));
692 conv
= build_conv (ck_ptr
, from
, conv
);
694 else if (TYPE_PTRMEM_P (from
))
696 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
697 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
699 if (DERIVED_FROM_P (fbase
, tbase
)
700 && (same_type_ignoring_top_level_qualifiers_p
701 (TYPE_PTRMEM_POINTED_TO_TYPE (from
),
702 TYPE_PTRMEM_POINTED_TO_TYPE (to
))))
704 from
= build_ptrmem_type (tbase
,
705 TYPE_PTRMEM_POINTED_TO_TYPE (from
));
706 conv
= build_conv (ck_pmem
, from
, conv
);
708 else if (!same_type_p (fbase
, tbase
))
711 else if (IS_AGGR_TYPE (TREE_TYPE (from
))
712 && IS_AGGR_TYPE (TREE_TYPE (to
))
715 An rvalue of type "pointer to cv D," where D is a
716 class type, can be converted to an rvalue of type
717 "pointer to cv B," where B is a base class (clause
718 _class.derived_) of D. If B is an inaccessible
719 (clause _class.access_) or ambiguous
720 (_class.member.lookup_) base class of D, a program
721 that necessitates this conversion is ill-formed.
722 Therefore, we use DERIVED_FROM_P, and do not check
723 access or uniqueness. */
724 && DERIVED_FROM_P (TREE_TYPE (to
), TREE_TYPE (from
)))
727 cp_build_qualified_type (TREE_TYPE (to
),
728 cp_type_quals (TREE_TYPE (from
)));
729 from
= build_pointer_type (from
);
730 conv
= build_conv (ck_ptr
, from
, conv
);
734 if (tcode
== POINTER_TYPE
)
736 to_pointee
= TREE_TYPE (to
);
737 from_pointee
= TREE_TYPE (from
);
741 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
742 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
745 if (same_type_p (from
, to
))
747 else if (comp_ptr_ttypes (to_pointee
, from_pointee
))
748 conv
= build_conv (ck_qual
, to
, conv
);
749 else if (expr
&& string_conv_p (to
, expr
, 0))
750 /* converting from string constant to char *. */
751 conv
= build_conv (ck_qual
, to
, conv
);
752 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
754 conv
= build_conv (ck_ptr
, to
, conv
);
762 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
764 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
765 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
766 tree fbase
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fromfn
)));
767 tree tbase
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (tofn
)));
769 if (!DERIVED_FROM_P (fbase
, tbase
)
770 || !same_type_p (TREE_TYPE (fromfn
), TREE_TYPE (tofn
))
771 || !compparms (TREE_CHAIN (TYPE_ARG_TYPES (fromfn
)),
772 TREE_CHAIN (TYPE_ARG_TYPES (tofn
)))
773 || cp_type_quals (fbase
) != cp_type_quals (tbase
))
776 from
= cp_build_qualified_type (tbase
, cp_type_quals (fbase
));
777 from
= build_method_type_directly (from
,
779 TREE_CHAIN (TYPE_ARG_TYPES (fromfn
)));
780 from
= build_ptrmemfunc_type (build_pointer_type (from
));
781 conv
= build_conv (ck_pmem
, from
, conv
);
784 else if (tcode
== BOOLEAN_TYPE
)
788 An rvalue of arithmetic, enumeration, pointer, or pointer to
789 member type can be converted to an rvalue of type bool. */
790 if (ARITHMETIC_TYPE_P (from
)
791 || fcode
== ENUMERAL_TYPE
792 || fcode
== POINTER_TYPE
793 || TYPE_PTR_TO_MEMBER_P (from
))
795 conv
= build_conv (ck_std
, to
, conv
);
796 if (fcode
== POINTER_TYPE
797 || TYPE_PTRMEM_P (from
)
798 || (TYPE_PTRMEMFUNC_P (from
)
799 && conv
->rank
< cr_pbool
))
800 conv
->rank
= cr_pbool
;
806 /* We don't check for ENUMERAL_TYPE here because there are no standard
807 conversions to enum type. */
808 else if (tcode
== INTEGER_TYPE
|| tcode
== BOOLEAN_TYPE
809 || tcode
== REAL_TYPE
)
811 if (! (INTEGRAL_CODE_P (fcode
) || fcode
== REAL_TYPE
))
813 conv
= build_conv (ck_std
, to
, conv
);
815 /* Give this a better rank if it's a promotion. */
816 if (same_type_p (to
, type_promotes_to (from
))
817 && conv
->u
.next
->rank
<= cr_promotion
)
818 conv
->rank
= cr_promotion
;
820 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
821 && vector_types_convertible_p (from
, to
))
822 return build_conv (ck_std
, to
, conv
);
823 else if (IS_AGGR_TYPE (to
) && IS_AGGR_TYPE (from
)
824 && is_properly_derived_from (from
, to
))
826 if (conv
->kind
== ck_rvalue
)
828 conv
= build_conv (ck_base
, to
, conv
);
829 /* The derived-to-base conversion indicates the initialization
830 of a parameter with base type from an object of a derived
831 type. A temporary object is created to hold the result of
833 conv
->need_temporary_p
= true;
841 /* Returns nonzero if T1 is reference-related to T2. */
844 reference_related_p (tree t1
, tree t2
)
846 t1
= TYPE_MAIN_VARIANT (t1
);
847 t2
= TYPE_MAIN_VARIANT (t2
);
851 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
852 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
854 return (same_type_p (t1
, t2
)
855 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
856 && DERIVED_FROM_P (t1
, t2
)));
859 /* Returns nonzero if T1 is reference-compatible with T2. */
862 reference_compatible_p (tree t1
, tree t2
)
866 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
867 reference-related to T2 and cv1 is the same cv-qualification as,
868 or greater cv-qualification than, cv2. */
869 return (reference_related_p (t1
, t2
)
870 && at_least_as_qualified_p (t1
, t2
));
873 /* Determine whether or not the EXPR (of class type S) can be
874 converted to T as in [over.match.ref]. */
877 convert_class_to_reference (tree t
, tree s
, tree expr
)
883 struct z_candidate
*candidates
;
884 struct z_candidate
*cand
;
887 conversions
= lookup_conversions (s
);
893 Assuming that "cv1 T" is the underlying type of the reference
894 being initialized, and "cv S" is the type of the initializer
895 expression, with S a class type, the candidate functions are
898 --The conversion functions of S and its base classes are
899 considered. Those that are not hidden within S and yield type
900 "reference to cv2 T2", where "cv1 T" is reference-compatible
901 (_dcl.init.ref_) with "cv2 T2", are candidate functions.
903 The argument list has one argument, which is the initializer
908 /* Conceptually, we should take the address of EXPR and put it in
909 the argument list. Unfortunately, however, that can result in
910 error messages, which we should not issue now because we are just
911 trying to find a conversion operator. Therefore, we use NULL,
912 cast to the appropriate type. */
913 arglist
= build_int_cst (build_pointer_type (s
), 0);
914 arglist
= build_tree_list (NULL_TREE
, arglist
);
916 reference_type
= build_reference_type (t
);
920 tree fns
= TREE_VALUE (conversions
);
922 for (; fns
; fns
= OVL_NEXT (fns
))
924 tree f
= OVL_CURRENT (fns
);
925 tree t2
= TREE_TYPE (TREE_TYPE (f
));
929 /* If this is a template function, try to get an exact
931 if (TREE_CODE (f
) == TEMPLATE_DECL
)
933 cand
= add_template_candidate (&candidates
,
939 TREE_PURPOSE (conversions
),
945 /* Now, see if the conversion function really returns
946 an lvalue of the appropriate type. From the
947 point of view of unification, simply returning an
948 rvalue of the right type is good enough. */
950 t2
= TREE_TYPE (TREE_TYPE (f
));
951 if (TREE_CODE (t2
) != REFERENCE_TYPE
952 || !reference_compatible_p (t
, TREE_TYPE (t2
)))
954 candidates
= candidates
->next
;
959 else if (TREE_CODE (t2
) == REFERENCE_TYPE
960 && reference_compatible_p (t
, TREE_TYPE (t2
)))
961 cand
= add_function_candidate (&candidates
, f
, s
, arglist
,
963 TREE_PURPOSE (conversions
),
968 conversion
*identity_conv
;
969 /* Build a standard conversion sequence indicating the
970 binding from the reference type returned by the
971 function to the desired REFERENCE_TYPE. */
973 = build_identity_conv (TREE_TYPE (TREE_TYPE
974 (TREE_TYPE (cand
->fn
))),
977 = (direct_reference_binding
978 (reference_type
, identity_conv
));
979 cand
->second_conv
->bad_p
|= cand
->convs
[0]->bad_p
;
982 conversions
= TREE_CHAIN (conversions
);
985 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
986 /* If none of the conversion functions worked out, let our caller
991 cand
= tourney (candidates
);
995 /* Now that we know that this is the function we're going to use fix
996 the dummy first argument. */
997 cand
->args
= tree_cons (NULL_TREE
,
999 TREE_CHAIN (cand
->args
));
1001 /* Build a user-defined conversion sequence representing the
1003 conv
= build_conv (ck_user
,
1004 TREE_TYPE (TREE_TYPE (cand
->fn
)),
1005 build_identity_conv (TREE_TYPE (expr
), expr
));
1008 /* Merge it with the standard conversion sequence from the
1009 conversion function's return type to the desired type. */
1010 cand
->second_conv
= merge_conversion_sequences (conv
, cand
->second_conv
);
1012 if (cand
->viable
== -1)
1015 return cand
->second_conv
;
1018 /* A reference of the indicated TYPE is being bound directly to the
1019 expression represented by the implicit conversion sequence CONV.
1020 Return a conversion sequence for this binding. */
1023 direct_reference_binding (tree type
, conversion
*conv
)
1027 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1028 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1030 t
= TREE_TYPE (type
);
1034 When a parameter of reference type binds directly
1035 (_dcl.init.ref_) to an argument expression, the implicit
1036 conversion sequence is the identity conversion, unless the
1037 argument expression has a type that is a derived class of the
1038 parameter type, in which case the implicit conversion sequence is
1039 a derived-to-base Conversion.
1041 If the parameter binds directly to the result of applying a
1042 conversion function to the argument expression, the implicit
1043 conversion sequence is a user-defined conversion sequence
1044 (_over.ics.user_), with the second standard conversion sequence
1045 either an identity conversion or, if the conversion function
1046 returns an entity of a type that is a derived class of the
1047 parameter type, a derived-to-base conversion. */
1048 if (!same_type_ignoring_top_level_qualifiers_p (t
, conv
->type
))
1050 /* Represent the derived-to-base conversion. */
1051 conv
= build_conv (ck_base
, t
, conv
);
1052 /* We will actually be binding to the base-class subobject in
1053 the derived class, so we mark this conversion appropriately.
1054 That way, convert_like knows not to generate a temporary. */
1055 conv
->need_temporary_p
= false;
1057 return build_conv (ck_ref_bind
, type
, conv
);
1060 /* Returns the conversion path from type FROM to reference type TO for
1061 purposes of reference binding. For lvalue binding, either pass a
1062 reference type to FROM or an lvalue expression to EXPR. If the
1063 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1064 the conversion returned. */
1067 reference_binding (tree rto
, tree rfrom
, tree expr
, int flags
)
1069 conversion
*conv
= NULL
;
1070 tree to
= TREE_TYPE (rto
);
1074 cp_lvalue_kind lvalue_p
= clk_none
;
1076 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1078 expr
= instantiate_type (to
, expr
, tf_none
);
1079 if (expr
== error_mark_node
)
1081 from
= TREE_TYPE (expr
);
1084 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1086 /* Anything with reference type is an lvalue. */
1087 lvalue_p
= clk_ordinary
;
1088 from
= TREE_TYPE (from
);
1091 lvalue_p
= real_lvalue_p (expr
);
1093 /* Figure out whether or not the types are reference-related and
1094 reference compatible. We have do do this after stripping
1095 references from FROM. */
1096 related_p
= reference_related_p (to
, from
);
1097 compatible_p
= reference_compatible_p (to
, from
);
1099 if (lvalue_p
&& compatible_p
)
1103 If the initializer expression
1105 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1106 is reference-compatible with "cv2 T2,"
1108 the reference is bound directly to the initializer expression
1110 conv
= build_identity_conv (from
, expr
);
1111 conv
= direct_reference_binding (rto
, conv
);
1112 if ((lvalue_p
& clk_bitfield
) != 0
1113 || ((lvalue_p
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1114 /* For the purposes of overload resolution, we ignore the fact
1115 this expression is a bitfield or packed field. (In particular,
1116 [over.ics.ref] says specifically that a function with a
1117 non-const reference parameter is viable even if the
1118 argument is a bitfield.)
1120 However, when we actually call the function we must create
1121 a temporary to which to bind the reference. If the
1122 reference is volatile, or isn't const, then we cannot make
1123 a temporary, so we just issue an error when the conversion
1125 conv
->need_temporary_p
= true;
1129 else if (CLASS_TYPE_P (from
) && !(flags
& LOOKUP_NO_CONVERSION
))
1133 If the initializer expression
1135 -- has a class type (i.e., T2 is a class type) can be
1136 implicitly converted to an lvalue of type "cv3 T3," where
1137 "cv1 T1" is reference-compatible with "cv3 T3". (this
1138 conversion is selected by enumerating the applicable
1139 conversion functions (_over.match.ref_) and choosing the
1140 best one through overload resolution. (_over.match_).
1142 the reference is bound to the lvalue result of the conversion
1143 in the second case. */
1144 conv
= convert_class_to_reference (to
, from
, expr
);
1149 /* From this point on, we conceptually need temporaries, even if we
1150 elide them. Only the cases above are "direct bindings". */
1151 if (flags
& LOOKUP_NO_TEMP_BIND
)
1156 When a parameter of reference type is not bound directly to an
1157 argument expression, the conversion sequence is the one required
1158 to convert the argument expression to the underlying type of the
1159 reference according to _over.best.ics_. Conceptually, this
1160 conversion sequence corresponds to copy-initializing a temporary
1161 of the underlying type with the argument expression. Any
1162 difference in top-level cv-qualification is subsumed by the
1163 initialization itself and does not constitute a conversion. */
1167 Otherwise, the reference shall be to a non-volatile const type. */
1168 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
))
1173 If the initializer expression is an rvalue, with T2 a class type,
1174 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1175 is bound in one of the following ways:
1177 -- The reference is bound to the object represented by the rvalue
1178 or to a sub-object within that object.
1182 We use the first alternative. The implicit conversion sequence
1183 is supposed to be same as we would obtain by generating a
1184 temporary. Fortunately, if the types are reference compatible,
1185 then this is either an identity conversion or the derived-to-base
1186 conversion, just as for direct binding. */
1187 if (CLASS_TYPE_P (from
) && compatible_p
)
1189 conv
= build_identity_conv (from
, expr
);
1190 conv
= direct_reference_binding (rto
, conv
);
1191 if (!(flags
& LOOKUP_CONSTRUCTOR_CALLABLE
))
1192 conv
->u
.next
->check_copy_constructor_p
= true;
1198 Otherwise, a temporary of type "cv1 T1" is created and
1199 initialized from the initializer expression using the rules for a
1200 non-reference copy initialization. If T1 is reference-related to
1201 T2, cv1 must be the same cv-qualification as, or greater
1202 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1203 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1206 conv
= implicit_conversion (to
, from
, expr
, flags
);
1210 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1211 /* This reference binding, unlike those above, requires the
1212 creation of a temporary. */
1213 conv
->need_temporary_p
= true;
1218 /* Returns the implicit conversion sequence (see [over.ics]) from type FROM
1219 to type TO. The optional expression EXPR may affect the conversion.
1220 FLAGS are the usual overloading flags. Only LOOKUP_NO_CONVERSION is
1224 implicit_conversion (tree to
, tree from
, tree expr
, int flags
)
1228 if (from
== error_mark_node
|| to
== error_mark_node
1229 || expr
== error_mark_node
)
1232 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1233 conv
= reference_binding (to
, from
, expr
, flags
);
1235 conv
= standard_conversion (to
, from
, expr
);
1240 if (expr
!= NULL_TREE
1241 && (IS_AGGR_TYPE (from
)
1242 || IS_AGGR_TYPE (to
))
1243 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1245 struct z_candidate
*cand
;
1247 cand
= build_user_type_conversion_1
1248 (to
, expr
, LOOKUP_ONLYCONVERTING
);
1250 conv
= cand
->second_conv
;
1252 /* We used to try to bind a reference to a temporary here, but that
1253 is now handled by the recursive call to this function at the end
1254 of reference_binding. */
1261 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1264 static struct z_candidate
*
1265 add_candidate (struct z_candidate
**candidates
,
1267 size_t num_convs
, conversion
**convs
,
1268 tree access_path
, tree conversion_path
,
1271 struct z_candidate
*cand
1272 = conversion_obstack_alloc (sizeof (struct z_candidate
));
1276 cand
->convs
= convs
;
1277 cand
->num_convs
= num_convs
;
1278 cand
->access_path
= access_path
;
1279 cand
->conversion_path
= conversion_path
;
1280 cand
->viable
= viable
;
1281 cand
->next
= *candidates
;
1287 /* Create an overload candidate for the function or method FN called with
1288 the argument list ARGLIST and add it to CANDIDATES. FLAGS is passed on
1289 to implicit_conversion.
1291 CTYPE, if non-NULL, is the type we want to pretend this function
1292 comes from for purposes of overload resolution. */
1294 static struct z_candidate
*
1295 add_function_candidate (struct z_candidate
**candidates
,
1296 tree fn
, tree ctype
, tree arglist
,
1297 tree access_path
, tree conversion_path
,
1300 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1303 tree parmnode
, argnode
;
1307 /* Built-in functions that haven't been declared don't really
1309 if (DECL_ANTICIPATED (fn
))
1312 /* The `this', `in_chrg' and VTT arguments to constructors are not
1313 considered in overload resolution. */
1314 if (DECL_CONSTRUCTOR_P (fn
))
1316 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
1317 orig_arglist
= arglist
;
1318 arglist
= skip_artificial_parms_for (fn
, arglist
);
1321 orig_arglist
= arglist
;
1323 len
= list_length (arglist
);
1324 convs
= alloc_conversions (len
);
1326 /* 13.3.2 - Viable functions [over.match.viable]
1327 First, to be a viable function, a candidate function shall have enough
1328 parameters to agree in number with the arguments in the list.
1330 We need to check this first; otherwise, checking the ICSes might cause
1331 us to produce an ill-formed template instantiation. */
1333 parmnode
= parmlist
;
1334 for (i
= 0; i
< len
; ++i
)
1336 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
1338 parmnode
= TREE_CHAIN (parmnode
);
1341 if (i
< len
&& parmnode
)
1344 /* Make sure there are default args for the rest of the parms. */
1345 else if (!sufficient_parms_p (parmnode
))
1351 /* Second, for F to be a viable function, there shall exist for each
1352 argument an implicit conversion sequence that converts that argument
1353 to the corresponding parameter of F. */
1355 parmnode
= parmlist
;
1358 for (i
= 0; i
< len
; ++i
)
1360 tree arg
= TREE_VALUE (argnode
);
1361 tree argtype
= lvalue_type (arg
);
1365 if (parmnode
== void_list_node
)
1368 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1369 && ! DECL_CONSTRUCTOR_P (fn
));
1373 tree parmtype
= TREE_VALUE (parmnode
);
1375 /* The type of the implicit object parameter ('this') for
1376 overload resolution is not always the same as for the
1377 function itself; conversion functions are considered to
1378 be members of the class being converted, and functions
1379 introduced by a using-declaration are considered to be
1380 members of the class that uses them.
1382 Since build_over_call ignores the ICS for the `this'
1383 parameter, we can just change the parm type. */
1384 if (ctype
&& is_this
)
1387 = build_qualified_type (ctype
,
1388 TYPE_QUALS (TREE_TYPE (parmtype
)));
1389 parmtype
= build_pointer_type (parmtype
);
1392 t
= implicit_conversion (parmtype
, argtype
, arg
, flags
);
1396 t
= build_identity_conv (argtype
, arg
);
1397 t
->ellipsis_p
= true;
1414 parmnode
= TREE_CHAIN (parmnode
);
1415 argnode
= TREE_CHAIN (argnode
);
1419 return add_candidate (candidates
, fn
, orig_arglist
, len
, convs
,
1420 access_path
, conversion_path
, viable
);
1423 /* Create an overload candidate for the conversion function FN which will
1424 be invoked for expression OBJ, producing a pointer-to-function which
1425 will in turn be called with the argument list ARGLIST, and add it to
1426 CANDIDATES. FLAGS is passed on to implicit_conversion.
1428 Actually, we don't really care about FN; we care about the type it
1429 converts to. There may be multiple conversion functions that will
1430 convert to that type, and we rely on build_user_type_conversion_1 to
1431 choose the best one; so when we create our candidate, we record the type
1432 instead of the function. */
1434 static struct z_candidate
*
1435 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
1436 tree arglist
, tree access_path
, tree conversion_path
)
1438 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
1439 int i
, len
, viable
, flags
;
1440 tree parmlist
, parmnode
, argnode
;
1443 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
1444 parmlist
= TREE_TYPE (parmlist
);
1445 parmlist
= TYPE_ARG_TYPES (parmlist
);
1447 len
= list_length (arglist
) + 1;
1448 convs
= alloc_conversions (len
);
1449 parmnode
= parmlist
;
1452 flags
= LOOKUP_NORMAL
;
1454 /* Don't bother looking up the same type twice. */
1455 if (*candidates
&& (*candidates
)->fn
== totype
)
1458 for (i
= 0; i
< len
; ++i
)
1460 tree arg
= i
== 0 ? obj
: TREE_VALUE (argnode
);
1461 tree argtype
= lvalue_type (arg
);
1465 t
= implicit_conversion (totype
, argtype
, arg
, flags
);
1466 else if (parmnode
== void_list_node
)
1469 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
, flags
);
1472 t
= build_identity_conv (argtype
, arg
);
1473 t
->ellipsis_p
= true;
1487 parmnode
= TREE_CHAIN (parmnode
);
1488 argnode
= TREE_CHAIN (argnode
);
1494 if (!sufficient_parms_p (parmnode
))
1497 return add_candidate (candidates
, totype
, arglist
, len
, convs
,
1498 access_path
, conversion_path
, viable
);
1502 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
1503 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
1515 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
1516 convs
= alloc_conversions (num_convs
);
1518 for (i
= 0; i
< 2; ++i
)
1523 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
], flags
);
1527 /* We need something for printing the candidate. */
1528 t
= build_identity_conv (types
[i
], NULL_TREE
);
1535 /* For COND_EXPR we rearranged the arguments; undo that now. */
1538 convs
[2] = convs
[1];
1539 convs
[1] = convs
[0];
1540 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2], flags
);
1547 add_candidate (candidates
, fnname
, /*args=*/NULL_TREE
,
1549 /*access_path=*/NULL_TREE
,
1550 /*conversion_path=*/NULL_TREE
,
1555 is_complete (tree t
)
1557 return COMPLETE_TYPE_P (complete_type (t
));
1560 /* Returns nonzero if TYPE is a promoted arithmetic type. */
1563 promoted_arithmetic_type_p (tree type
)
1567 In this section, the term promoted integral type is used to refer
1568 to those integral types which are preserved by integral promotion
1569 (including e.g. int and long but excluding e.g. char).
1570 Similarly, the term promoted arithmetic type refers to promoted
1571 integral types plus floating types. */
1572 return ((INTEGRAL_TYPE_P (type
)
1573 && same_type_p (type_promotes_to (type
), type
))
1574 || TREE_CODE (type
) == REAL_TYPE
);
1577 /* Create any builtin operator overload candidates for the operator in
1578 question given the converted operand types TYPE1 and TYPE2. The other
1579 args are passed through from add_builtin_candidates to
1580 build_builtin_candidate.
1582 TYPE1 and TYPE2 may not be permissible, and we must filter them.
1583 If CODE is requires candidates operands of the same type of the kind
1584 of which TYPE1 and TYPE2 are, we add both candidates
1585 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
1588 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
1589 enum tree_code code2
, tree fnname
, tree type1
,
1590 tree type2
, tree
*args
, tree
*argtypes
, int flags
)
1594 case POSTINCREMENT_EXPR
:
1595 case POSTDECREMENT_EXPR
:
1596 args
[1] = integer_zero_node
;
1597 type2
= integer_type_node
;
1606 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
1607 and VQ is either volatile or empty, there exist candidate operator
1608 functions of the form
1609 VQ T& operator++(VQ T&);
1610 T operator++(VQ T&, int);
1611 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
1612 type other than bool, and VQ is either volatile or empty, there exist
1613 candidate operator functions of the form
1614 VQ T& operator--(VQ T&);
1615 T operator--(VQ T&, int);
1616 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
1617 complete object type, and VQ is either volatile or empty, there exist
1618 candidate operator functions of the form
1619 T*VQ& operator++(T*VQ&);
1620 T*VQ& operator--(T*VQ&);
1621 T* operator++(T*VQ&, int);
1622 T* operator--(T*VQ&, int); */
1624 case POSTDECREMENT_EXPR
:
1625 case PREDECREMENT_EXPR
:
1626 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
1628 case POSTINCREMENT_EXPR
:
1629 case PREINCREMENT_EXPR
:
1630 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
1632 type1
= build_reference_type (type1
);
1637 /* 7 For every cv-qualified or cv-unqualified complete object type T, there
1638 exist candidate operator functions of the form
1642 8 For every function type T, there exist candidate operator functions of
1644 T& operator*(T*); */
1647 if (TREE_CODE (type1
) == POINTER_TYPE
1648 && (TYPE_PTROB_P (type1
)
1649 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
1653 /* 9 For every type T, there exist candidate operator functions of the form
1656 10For every promoted arithmetic type T, there exist candidate operator
1657 functions of the form
1661 case CONVERT_EXPR
: /* unary + */
1662 if (TREE_CODE (type1
) == POINTER_TYPE
)
1665 if (ARITHMETIC_TYPE_P (type1
))
1669 /* 11For every promoted integral type T, there exist candidate operator
1670 functions of the form
1674 if (INTEGRAL_TYPE_P (type1
))
1678 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
1679 is the same type as C2 or is a derived class of C2, T is a complete
1680 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
1681 there exist candidate operator functions of the form
1682 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
1683 where CV12 is the union of CV1 and CV2. */
1686 if (TREE_CODE (type1
) == POINTER_TYPE
1687 && TYPE_PTR_TO_MEMBER_P (type2
))
1689 tree c1
= TREE_TYPE (type1
);
1690 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
1692 if (IS_AGGR_TYPE (c1
) && DERIVED_FROM_P (c2
, c1
)
1693 && (TYPE_PTRMEMFUNC_P (type2
)
1694 || is_complete (TREE_TYPE (TREE_TYPE (type2
)))))
1699 /* 13For every pair of promoted arithmetic types L and R, there exist can-
1700 didate operator functions of the form
1705 bool operator<(L, R);
1706 bool operator>(L, R);
1707 bool operator<=(L, R);
1708 bool operator>=(L, R);
1709 bool operator==(L, R);
1710 bool operator!=(L, R);
1711 where LR is the result of the usual arithmetic conversions between
1714 14For every pair of types T and I, where T is a cv-qualified or cv-
1715 unqualified complete object type and I is a promoted integral type,
1716 there exist candidate operator functions of the form
1717 T* operator+(T*, I);
1718 T& operator[](T*, I);
1719 T* operator-(T*, I);
1720 T* operator+(I, T*);
1721 T& operator[](I, T*);
1723 15For every T, where T is a pointer to complete object type, there exist
1724 candidate operator functions of the form112)
1725 ptrdiff_t operator-(T, T);
1727 16For every pointer or enumeration type T, there exist candidate operator
1728 functions of the form
1729 bool operator<(T, T);
1730 bool operator>(T, T);
1731 bool operator<=(T, T);
1732 bool operator>=(T, T);
1733 bool operator==(T, T);
1734 bool operator!=(T, T);
1736 17For every pointer to member type T, there exist candidate operator
1737 functions of the form
1738 bool operator==(T, T);
1739 bool operator!=(T, T); */
1742 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
1744 if (TYPE_PTROB_P (type1
) && INTEGRAL_TYPE_P (type2
))
1746 type2
= ptrdiff_type_node
;
1750 case TRUNC_DIV_EXPR
:
1751 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
1757 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
1758 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
)))
1760 if (TYPE_PTR_TO_MEMBER_P (type1
) && null_ptr_cst_p (args
[1]))
1765 if (TYPE_PTR_TO_MEMBER_P (type2
) && null_ptr_cst_p (args
[0]))
1777 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
1779 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
1781 if (TREE_CODE (type1
) == ENUMERAL_TYPE
&& TREE_CODE (type2
) == ENUMERAL_TYPE
)
1783 if (TYPE_PTR_P (type1
) && null_ptr_cst_p (args
[1]))
1788 if (null_ptr_cst_p (args
[0]) && TYPE_PTR_P (type2
))
1796 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
1799 if (INTEGRAL_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
1801 type1
= ptrdiff_type_node
;
1804 if (TYPE_PTROB_P (type1
) && INTEGRAL_TYPE_P (type2
))
1806 type2
= ptrdiff_type_node
;
1811 /* 18For every pair of promoted integral types L and R, there exist candi-
1812 date operator functions of the form
1819 where LR is the result of the usual arithmetic conversions between
1822 case TRUNC_MOD_EXPR
:
1828 if (INTEGRAL_TYPE_P (type1
) && INTEGRAL_TYPE_P (type2
))
1832 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
1833 type, VQ is either volatile or empty, and R is a promoted arithmetic
1834 type, there exist candidate operator functions of the form
1835 VQ L& operator=(VQ L&, R);
1836 VQ L& operator*=(VQ L&, R);
1837 VQ L& operator/=(VQ L&, R);
1838 VQ L& operator+=(VQ L&, R);
1839 VQ L& operator-=(VQ L&, R);
1841 20For every pair T, VQ), where T is any type and VQ is either volatile
1842 or empty, there exist candidate operator functions of the form
1843 T*VQ& operator=(T*VQ&, T*);
1845 21For every pair T, VQ), where T is a pointer to member type and VQ is
1846 either volatile or empty, there exist candidate operator functions of
1848 VQ T& operator=(VQ T&, T);
1850 22For every triple T, VQ, I), where T is a cv-qualified or cv-
1851 unqualified complete object type, VQ is either volatile or empty, and
1852 I is a promoted integral type, there exist candidate operator func-
1854 T*VQ& operator+=(T*VQ&, I);
1855 T*VQ& operator-=(T*VQ&, I);
1857 23For every triple L, VQ, R), where L is an integral or enumeration
1858 type, VQ is either volatile or empty, and R is a promoted integral
1859 type, there exist candidate operator functions of the form
1861 VQ L& operator%=(VQ L&, R);
1862 VQ L& operator<<=(VQ L&, R);
1863 VQ L& operator>>=(VQ L&, R);
1864 VQ L& operator&=(VQ L&, R);
1865 VQ L& operator^=(VQ L&, R);
1866 VQ L& operator|=(VQ L&, R); */
1873 if (TYPE_PTROB_P (type1
) && INTEGRAL_TYPE_P (type2
))
1875 type2
= ptrdiff_type_node
;
1879 case TRUNC_DIV_EXPR
:
1880 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
1884 case TRUNC_MOD_EXPR
:
1890 if (INTEGRAL_TYPE_P (type1
) && INTEGRAL_TYPE_P (type2
))
1895 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
1897 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
1898 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
1899 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
))
1900 || ((TYPE_PTRMEMFUNC_P (type1
)
1901 || TREE_CODE (type1
) == POINTER_TYPE
)
1902 && null_ptr_cst_p (args
[1])))
1912 type1
= build_reference_type (type1
);
1918 For every pair of promoted arithmetic types L and R, there
1919 exist candidate operator functions of the form
1921 LR operator?(bool, L, R);
1923 where LR is the result of the usual arithmetic conversions
1924 between types L and R.
1926 For every type T, where T is a pointer or pointer-to-member
1927 type, there exist candidate operator functions of the form T
1928 operator?(bool, T, T); */
1930 if (promoted_arithmetic_type_p (type1
)
1931 && promoted_arithmetic_type_p (type2
))
1935 /* Otherwise, the types should be pointers. */
1936 if (!(TYPE_PTR_P (type1
) || TYPE_PTR_TO_MEMBER_P (type1
))
1937 || !(TYPE_PTR_P (type2
) || TYPE_PTR_TO_MEMBER_P (type2
)))
1940 /* We don't check that the two types are the same; the logic
1941 below will actually create two candidates; one in which both
1942 parameter types are TYPE1, and one in which both parameter
1950 /* If we're dealing with two pointer types or two enumeral types,
1951 we need candidates for both of them. */
1952 if (type2
&& !same_type_p (type1
, type2
)
1953 && TREE_CODE (type1
) == TREE_CODE (type2
)
1954 && (TREE_CODE (type1
) == REFERENCE_TYPE
1955 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
1956 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
))
1957 || TYPE_PTRMEMFUNC_P (type1
)
1958 || IS_AGGR_TYPE (type1
)
1959 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
1961 build_builtin_candidate
1962 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
);
1963 build_builtin_candidate
1964 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
);
1968 build_builtin_candidate
1969 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
);
1973 type_decays_to (tree type
)
1975 if (TREE_CODE (type
) == ARRAY_TYPE
)
1976 return build_pointer_type (TREE_TYPE (type
));
1977 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1978 return build_pointer_type (type
);
1982 /* There are three conditions of builtin candidates:
1984 1) bool-taking candidates. These are the same regardless of the input.
1985 2) pointer-pair taking candidates. These are generated for each type
1986 one of the input types converts to.
1987 3) arithmetic candidates. According to the standard, we should generate
1988 all of these, but I'm trying not to...
1990 Here we generate a superset of the possible candidates for this particular
1991 case. That is a subset of the full set the standard defines, plus some
1992 other cases which the standard disallows. add_builtin_candidate will
1993 filter out the invalid set. */
1996 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
1997 enum tree_code code2
, tree fnname
, tree
*args
,
2002 tree type
, argtypes
[3];
2003 /* TYPES[i] is the set of possible builtin-operator parameter types
2004 we will consider for the Ith argument. These are represented as
2005 a TREE_LIST; the TREE_VALUE of each node is the potential
2009 for (i
= 0; i
< 3; ++i
)
2012 argtypes
[i
] = lvalue_type (args
[i
]);
2014 argtypes
[i
] = NULL_TREE
;
2019 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2020 and VQ is either volatile or empty, there exist candidate operator
2021 functions of the form
2022 VQ T& operator++(VQ T&); */
2024 case POSTINCREMENT_EXPR
:
2025 case PREINCREMENT_EXPR
:
2026 case POSTDECREMENT_EXPR
:
2027 case PREDECREMENT_EXPR
:
2032 /* 24There also exist candidate operator functions of the form
2033 bool operator!(bool);
2034 bool operator&&(bool, bool);
2035 bool operator||(bool, bool); */
2037 case TRUTH_NOT_EXPR
:
2038 build_builtin_candidate
2039 (candidates
, fnname
, boolean_type_node
,
2040 NULL_TREE
, args
, argtypes
, flags
);
2043 case TRUTH_ORIF_EXPR
:
2044 case TRUTH_ANDIF_EXPR
:
2045 build_builtin_candidate
2046 (candidates
, fnname
, boolean_type_node
,
2047 boolean_type_node
, args
, argtypes
, flags
);
2069 types
[0] = types
[1] = NULL_TREE
;
2071 for (i
= 0; i
< 2; ++i
)
2075 else if (IS_AGGR_TYPE (argtypes
[i
]))
2079 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2082 convs
= lookup_conversions (argtypes
[i
]);
2084 if (code
== COND_EXPR
)
2086 if (real_lvalue_p (args
[i
]))
2087 types
[i
] = tree_cons
2088 (NULL_TREE
, build_reference_type (argtypes
[i
]), types
[i
]);
2090 types
[i
] = tree_cons
2091 (NULL_TREE
, TYPE_MAIN_VARIANT (argtypes
[i
]), types
[i
]);
2097 for (; convs
; convs
= TREE_CHAIN (convs
))
2099 type
= TREE_TYPE (TREE_TYPE (OVL_CURRENT (TREE_VALUE (convs
))));
2102 && (TREE_CODE (type
) != REFERENCE_TYPE
2103 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
2106 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
2107 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2109 type
= non_reference (type
);
2110 if (i
!= 0 || ! ref1
)
2112 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
2113 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2114 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2115 if (INTEGRAL_TYPE_P (type
))
2116 type
= type_promotes_to (type
);
2119 if (! value_member (type
, types
[i
]))
2120 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2125 if (code
== COND_EXPR
&& real_lvalue_p (args
[i
]))
2126 types
[i
] = tree_cons
2127 (NULL_TREE
, build_reference_type (argtypes
[i
]), types
[i
]);
2128 type
= non_reference (argtypes
[i
]);
2129 if (i
!= 0 || ! ref1
)
2131 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
2132 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2133 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2134 if (INTEGRAL_TYPE_P (type
))
2135 type
= type_promotes_to (type
);
2137 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2141 /* Run through the possible parameter types of both arguments,
2142 creating candidates with those parameter types. */
2143 for (; types
[0]; types
[0] = TREE_CHAIN (types
[0]))
2146 for (type
= types
[1]; type
; type
= TREE_CHAIN (type
))
2147 add_builtin_candidate
2148 (candidates
, code
, code2
, fnname
, TREE_VALUE (types
[0]),
2149 TREE_VALUE (type
), args
, argtypes
, flags
);
2151 add_builtin_candidate
2152 (candidates
, code
, code2
, fnname
, TREE_VALUE (types
[0]),
2153 NULL_TREE
, args
, argtypes
, flags
);
2160 /* If TMPL can be successfully instantiated as indicated by
2161 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2163 TMPL is the template. EXPLICIT_TARGS are any explicit template
2164 arguments. ARGLIST is the arguments provided at the call-site.
2165 The RETURN_TYPE is the desired type for conversion operators. If
2166 OBJ is NULL_TREE, FLAGS and CTYPE are as for add_function_candidate.
2167 If an OBJ is supplied, FLAGS and CTYPE are ignored, and OBJ is as for
2168 add_conv_candidate. */
2170 static struct z_candidate
*
2171 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
2172 tree ctype
, tree explicit_targs
, tree arglist
,
2173 tree return_type
, tree access_path
,
2174 tree conversion_path
, int flags
, tree obj
,
2175 unification_kind_t strict
)
2177 int ntparms
= DECL_NTPARMS (tmpl
);
2178 tree targs
= make_tree_vec (ntparms
);
2179 tree args_without_in_chrg
= arglist
;
2180 struct z_candidate
*cand
;
2184 /* We don't do deduction on the in-charge parameter, the VTT
2185 parameter or 'this'. */
2186 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
2187 args_without_in_chrg
= TREE_CHAIN (args_without_in_chrg
);
2189 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
2190 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
2191 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
2192 args_without_in_chrg
= TREE_CHAIN (args_without_in_chrg
);
2194 i
= fn_type_unification (tmpl
, explicit_targs
, targs
,
2195 args_without_in_chrg
,
2196 return_type
, strict
, -1);
2201 fn
= instantiate_template (tmpl
, targs
, tf_none
);
2202 if (fn
== error_mark_node
)
2207 A member function template is never instantiated to perform the
2208 copy of a class object to an object of its class type.
2210 It's a little unclear what this means; the standard explicitly
2211 does allow a template to be used to copy a class. For example,
2216 template <class T> A(const T&);
2219 void g () { A a (f ()); }
2221 the member template will be used to make the copy. The section
2222 quoted above appears in the paragraph that forbids constructors
2223 whose only parameter is (a possibly cv-qualified variant of) the
2224 class type, and a logical interpretation is that the intent was
2225 to forbid the instantiation of member templates which would then
2227 if (DECL_CONSTRUCTOR_P (fn
) && list_length (arglist
) == 2)
2229 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
2230 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
2235 if (obj
!= NULL_TREE
)
2236 /* Aha, this is a conversion function. */
2237 cand
= add_conv_candidate (candidates
, fn
, obj
, access_path
,
2238 conversion_path
, arglist
);
2240 cand
= add_function_candidate (candidates
, fn
, ctype
,
2241 arglist
, access_path
,
2242 conversion_path
, flags
);
2243 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
2244 /* This situation can occur if a member template of a template
2245 class is specialized. Then, instantiate_template might return
2246 an instantiation of the specialization, in which case the
2247 DECL_TI_TEMPLATE field will point at the original
2248 specialization. For example:
2250 template <class T> struct S { template <class U> void f(U);
2251 template <> void f(int) {}; };
2255 Here, TMPL will be template <class U> S<double>::f(U).
2256 And, instantiate template will give us the specialization
2257 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2258 for this will point at template <class T> template <> S<T>::f(int),
2259 so that we can find the definition. For the purposes of
2260 overload resolution, however, we want the original TMPL. */
2261 cand
->template_decl
= tree_cons (tmpl
, targs
, NULL_TREE
);
2263 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
2269 static struct z_candidate
*
2270 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
2271 tree explicit_targs
, tree arglist
, tree return_type
,
2272 tree access_path
, tree conversion_path
, int flags
,
2273 unification_kind_t strict
)
2276 add_template_candidate_real (candidates
, tmpl
, ctype
,
2277 explicit_targs
, arglist
, return_type
,
2278 access_path
, conversion_path
,
2279 flags
, NULL_TREE
, strict
);
2283 static struct z_candidate
*
2284 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
2285 tree obj
, tree arglist
, tree return_type
,
2286 tree access_path
, tree conversion_path
)
2289 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
2290 arglist
, return_type
, access_path
,
2291 conversion_path
, 0, obj
, DEDUCE_CONV
);
2294 /* The CANDS are the set of candidates that were considered for
2295 overload resolution. Return the set of viable candidates. If none
2296 of the candidates were viable, set *ANY_VIABLE_P to true. STRICT_P
2297 is true if a candidate should be considered viable only if it is
2300 static struct z_candidate
*
2301 splice_viable (struct z_candidate
*cands
,
2305 struct z_candidate
*viable
;
2306 struct z_candidate
**last_viable
;
2307 struct z_candidate
**cand
;
2310 last_viable
= &viable
;
2311 *any_viable_p
= false;
2316 struct z_candidate
*c
= *cand
;
2317 if (strict_p
? c
->viable
== 1 : c
->viable
)
2322 last_viable
= &c
->next
;
2323 *any_viable_p
= true;
2329 return viable
? viable
: cands
;
2333 any_strictly_viable (struct z_candidate
*cands
)
2335 for (; cands
; cands
= cands
->next
)
2336 if (cands
->viable
== 1)
2342 build_this (tree obj
)
2344 /* Fix this to work on non-lvalues. */
2345 return build_unary_op (ADDR_EXPR
, obj
, 0);
2348 /* Returns true iff functions are equivalent. Equivalent functions are
2349 not '==' only if one is a function-local extern function or if
2350 both are extern "C". */
2353 equal_functions (tree fn1
, tree fn2
)
2355 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
2356 || DECL_EXTERN_C_FUNCTION_P (fn1
))
2357 return decls_match (fn1
, fn2
);
2361 /* Print information about one overload candidate CANDIDATE. MSGSTR
2362 is the text to print before the candidate itself.
2364 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
2365 to have been run through gettext by the caller. This wart makes
2366 life simpler in print_z_candidates and for the translators. */
2369 print_z_candidate (const char *msgstr
, struct z_candidate
*candidate
)
2371 if (TREE_CODE (candidate
->fn
) == IDENTIFIER_NODE
)
2373 if (candidate
->num_convs
== 3)
2374 inform ("%s %D(%T, %T, %T) <built-in>", msgstr
, candidate
->fn
,
2375 candidate
->convs
[0]->type
,
2376 candidate
->convs
[1]->type
,
2377 candidate
->convs
[2]->type
);
2378 else if (candidate
->num_convs
== 2)
2379 inform ("%s %D(%T, %T) <built-in>", msgstr
, candidate
->fn
,
2380 candidate
->convs
[0]->type
,
2381 candidate
->convs
[1]->type
);
2383 inform ("%s %D(%T) <built-in>", msgstr
, candidate
->fn
,
2384 candidate
->convs
[0]->type
);
2386 else if (TYPE_P (candidate
->fn
))
2387 inform ("%s %T <conversion>", msgstr
, candidate
->fn
);
2388 else if (candidate
->viable
== -1)
2389 inform ("%J%s %+#D <near match>", candidate
->fn
, msgstr
, candidate
->fn
);
2391 inform ("%J%s %+#D", candidate
->fn
, msgstr
, candidate
->fn
);
2395 print_z_candidates (struct z_candidate
*candidates
)
2398 struct z_candidate
*cand1
;
2399 struct z_candidate
**cand2
;
2401 /* There may be duplicates in the set of candidates. We put off
2402 checking this condition as long as possible, since we have no way
2403 to eliminate duplicates from a set of functions in less than n^2
2404 time. Now we are about to emit an error message, so it is more
2405 permissible to go slowly. */
2406 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
2408 tree fn
= cand1
->fn
;
2409 /* Skip builtin candidates and conversion functions. */
2410 if (TREE_CODE (fn
) != FUNCTION_DECL
)
2412 cand2
= &cand1
->next
;
2415 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
2416 && equal_functions (fn
, (*cand2
)->fn
))
2417 *cand2
= (*cand2
)->next
;
2419 cand2
= &(*cand2
)->next
;
2426 str
= _("candidates are:");
2427 print_z_candidate (str
, candidates
);
2428 if (candidates
->next
)
2430 /* Indent successive candidates by the width of the translation
2431 of the above string. */
2432 size_t len
= gcc_gettext_width (str
) + 1;
2433 char *spaces
= alloca (len
);
2434 memset (spaces
, ' ', len
-1);
2435 spaces
[len
- 1] = '\0';
2437 candidates
= candidates
->next
;
2440 print_z_candidate (spaces
, candidates
);
2441 candidates
= candidates
->next
;
2447 /* USER_SEQ is a user-defined conversion sequence, beginning with a
2448 USER_CONV. STD_SEQ is the standard conversion sequence applied to
2449 the result of the conversion function to convert it to the final
2450 desired type. Merge the the two sequences into a single sequence,
2451 and return the merged sequence. */
2454 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
2458 gcc_assert (user_seq
->kind
== ck_user
);
2460 /* Find the end of the second conversion sequence. */
2462 while ((*t
)->kind
!= ck_identity
)
2463 t
= &((*t
)->u
.next
);
2465 /* Replace the identity conversion with the user conversion
2469 /* The entire sequence is a user-conversion sequence. */
2470 std_seq
->user_conv_p
= true;
2475 /* Returns the best overload candidate to perform the requested
2476 conversion. This function is used for three the overloading situations
2477 described in [over.match.copy], [over.match.conv], and [over.match.ref].
2478 If TOTYPE is a REFERENCE_TYPE, we're trying to find an lvalue binding as
2479 per [dcl.init.ref], so we ignore temporary bindings. */
2481 static struct z_candidate
*
2482 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
)
2484 struct z_candidate
*candidates
, *cand
;
2485 tree fromtype
= TREE_TYPE (expr
);
2486 tree ctors
= NULL_TREE
;
2487 tree conv_fns
= NULL_TREE
;
2488 conversion
*conv
= NULL
;
2489 tree args
= NULL_TREE
;
2492 /* We represent conversion within a hierarchy using RVALUE_CONV and
2493 BASE_CONV, as specified by [over.best.ics]; these become plain
2494 constructor calls, as specified in [dcl.init]. */
2495 gcc_assert (!IS_AGGR_TYPE (fromtype
) || !IS_AGGR_TYPE (totype
)
2496 || !DERIVED_FROM_P (totype
, fromtype
));
2498 if (IS_AGGR_TYPE (totype
))
2499 ctors
= lookup_fnfields (totype
, complete_ctor_identifier
, 0);
2501 if (IS_AGGR_TYPE (fromtype
))
2502 conv_fns
= lookup_conversions (fromtype
);
2505 flags
|= LOOKUP_NO_CONVERSION
;
2511 ctors
= BASELINK_FUNCTIONS (ctors
);
2513 t
= build_int_cst (build_pointer_type (totype
), 0);
2514 args
= build_tree_list (NULL_TREE
, expr
);
2515 /* We should never try to call the abstract or base constructor
2517 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors
))
2518 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors
)));
2519 args
= tree_cons (NULL_TREE
, t
, args
);
2521 for (; ctors
; ctors
= OVL_NEXT (ctors
))
2523 tree ctor
= OVL_CURRENT (ctors
);
2524 if (DECL_NONCONVERTING_P (ctor
))
2527 if (TREE_CODE (ctor
) == TEMPLATE_DECL
)
2528 cand
= add_template_candidate (&candidates
, ctor
, totype
,
2529 NULL_TREE
, args
, NULL_TREE
,
2530 TYPE_BINFO (totype
),
2531 TYPE_BINFO (totype
),
2535 cand
= add_function_candidate (&candidates
, ctor
, totype
,
2536 args
, TYPE_BINFO (totype
),
2537 TYPE_BINFO (totype
),
2541 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
2545 args
= build_tree_list (NULL_TREE
, build_this (expr
));
2547 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
2550 tree conversion_path
= TREE_PURPOSE (conv_fns
);
2551 int convflags
= LOOKUP_NO_CONVERSION
;
2553 /* If we are called to convert to a reference type, we are trying to
2554 find an lvalue binding, so don't even consider temporaries. If
2555 we don't find an lvalue binding, the caller will try again to
2556 look for a temporary binding. */
2557 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
2558 convflags
|= LOOKUP_NO_TEMP_BIND
;
2560 for (fns
= TREE_VALUE (conv_fns
); fns
; fns
= OVL_NEXT (fns
))
2562 tree fn
= OVL_CURRENT (fns
);
2564 /* [over.match.funcs] For conversion functions, the function
2565 is considered to be a member of the class of the implicit
2566 object argument for the purpose of defining the type of
2567 the implicit object parameter.
2569 So we pass fromtype as CTYPE to add_*_candidate. */
2571 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2572 cand
= add_template_candidate (&candidates
, fn
, fromtype
,
2575 TYPE_BINFO (fromtype
),
2580 cand
= add_function_candidate (&candidates
, fn
, fromtype
,
2582 TYPE_BINFO (fromtype
),
2589 = implicit_conversion (totype
,
2590 TREE_TYPE (TREE_TYPE (cand
->fn
)),
2593 cand
->second_conv
= ics
;
2597 else if (candidates
->viable
== 1 && ics
->bad_p
)
2603 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
2607 cand
= tourney (candidates
);
2610 if (flags
& LOOKUP_COMPLAIN
)
2612 error ("conversion from %qT to %qT is ambiguous",
2614 print_z_candidates (candidates
);
2617 cand
= candidates
; /* any one will do */
2618 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
2619 cand
->second_conv
->user_conv_p
= true;
2620 if (!any_strictly_viable (candidates
))
2621 cand
->second_conv
->bad_p
= true;
2622 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
2623 ambiguous conversion is no worse than another user-defined
2629 /* Build the user conversion sequence. */
2632 (DECL_CONSTRUCTOR_P (cand
->fn
)
2633 ? totype
: non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)))),
2634 build_identity_conv (TREE_TYPE (expr
), expr
));
2637 /* Combine it with the second conversion sequence. */
2638 cand
->second_conv
= merge_conversion_sequences (conv
,
2641 if (cand
->viable
== -1)
2642 cand
->second_conv
->bad_p
= true;
2648 build_user_type_conversion (tree totype
, tree expr
, int flags
)
2650 struct z_candidate
*cand
2651 = build_user_type_conversion_1 (totype
, expr
, flags
);
2655 if (cand
->second_conv
->kind
== ck_ambig
)
2656 return error_mark_node
;
2657 return convert_from_reference (convert_like (cand
->second_conv
, expr
));
2662 /* Do any initial processing on the arguments to a function call. */
2665 resolve_args (tree args
)
2668 for (t
= args
; t
; t
= TREE_CHAIN (t
))
2670 tree arg
= TREE_VALUE (t
);
2672 if (arg
== error_mark_node
)
2673 return error_mark_node
;
2674 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
2676 error ("invalid use of void expression");
2677 return error_mark_node
;
2679 arg
= convert_from_reference (arg
);
2680 TREE_VALUE (t
) = arg
;
2685 /* Perform overload resolution on FN, which is called with the ARGS.
2687 Return the candidate function selected by overload resolution, or
2688 NULL if the event that overload resolution failed. In the case
2689 that overload resolution fails, *CANDIDATES will be the set of
2690 candidates considered, and ANY_VIABLE_P will be set to true or
2691 false to indicate whether or not any of the candidates were
2694 The ARGS should already have gone through RESOLVE_ARGS before this
2695 function is called. */
2697 static struct z_candidate
*
2698 perform_overload_resolution (tree fn
,
2700 struct z_candidate
**candidates
,
2703 struct z_candidate
*cand
;
2704 tree explicit_targs
= NULL_TREE
;
2705 int template_only
= 0;
2708 *any_viable_p
= true;
2710 /* Check FN and ARGS. */
2711 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
2712 || TREE_CODE (fn
) == TEMPLATE_DECL
2713 || TREE_CODE (fn
) == OVERLOAD
2714 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
2715 gcc_assert (!args
|| TREE_CODE (args
) == TREE_LIST
);
2717 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2719 explicit_targs
= TREE_OPERAND (fn
, 1);
2720 fn
= TREE_OPERAND (fn
, 0);
2724 /* Add the various candidate functions. */
2725 add_candidates (fn
, args
, explicit_targs
, template_only
,
2726 /*conversion_path=*/NULL_TREE
,
2727 /*access_path=*/NULL_TREE
,
2731 *candidates
= splice_viable (*candidates
, pedantic
, any_viable_p
);
2735 cand
= tourney (*candidates
);
2739 /* Return an expression for a call to FN (a namespace-scope function,
2740 or a static member function) with the ARGS. */
2743 build_new_function_call (tree fn
, tree args
)
2745 struct z_candidate
*candidates
, *cand
;
2750 args
= resolve_args (args
);
2751 if (args
== error_mark_node
)
2752 return error_mark_node
;
2754 /* Get the high-water mark for the CONVERSION_OBSTACK. */
2755 p
= conversion_obstack_alloc (0);
2757 cand
= perform_overload_resolution (fn
, args
, &candidates
, &any_viable_p
);
2761 if (!any_viable_p
&& candidates
&& ! candidates
->next
)
2762 return build_function_call (candidates
->fn
, args
);
2763 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2764 fn
= TREE_OPERAND (fn
, 0);
2766 error ("no matching function for call to %<%D(%A)%>",
2767 DECL_NAME (OVL_CURRENT (fn
)), args
);
2769 error ("call of overloaded %<%D(%A)%> is ambiguous",
2770 DECL_NAME (OVL_CURRENT (fn
)), args
);
2772 print_z_candidates (candidates
);
2773 result
= error_mark_node
;
2776 result
= build_over_call (cand
, LOOKUP_NORMAL
);
2778 /* Free all the conversions we allocated. */
2779 obstack_free (&conversion_obstack
, p
);
2784 /* Build a call to a global operator new. FNNAME is the name of the
2785 operator (either "operator new" or "operator new[]") and ARGS are
2786 the arguments provided. *SIZE points to the total number of bytes
2787 required by the allocation, and is updated if that is changed here.
2788 *COOKIE_SIZE is non-NULL if a cookie should be used. If this
2789 function determines that no cookie should be used, after all,
2790 *COOKIE_SIZE is set to NULL_TREE. */
2793 build_operator_new_call (tree fnname
, tree args
, tree
*size
, tree
*cookie_size
)
2796 struct z_candidate
*candidates
;
2797 struct z_candidate
*cand
;
2800 args
= tree_cons (NULL_TREE
, *size
, args
);
2801 args
= resolve_args (args
);
2802 if (args
== error_mark_node
)
2809 If this lookup fails to find the name, or if the allocated type
2810 is not a class type, the allocation function's name is looked
2811 up in the global scope.
2813 we disregard block-scope declarations of "operator new". */
2814 fns
= lookup_function_nonclass (fnname
, args
, /*block_p=*/false);
2816 /* Figure out what function is being called. */
2817 cand
= perform_overload_resolution (fns
, args
, &candidates
, &any_viable_p
);
2819 /* If no suitable function could be found, issue an error message
2824 error ("no matching function for call to %<%D(%A)%>",
2825 DECL_NAME (OVL_CURRENT (fns
)), args
);
2827 error ("call of overloaded %<%D(%A)%> is ambiguous",
2828 DECL_NAME (OVL_CURRENT (fns
)), args
);
2830 print_z_candidates (candidates
);
2831 return error_mark_node
;
2834 /* If a cookie is required, add some extra space. Whether
2835 or not a cookie is required cannot be determined until
2836 after we know which function was called. */
2839 bool use_cookie
= true;
2840 if (!abi_version_at_least (2))
2842 tree placement
= TREE_CHAIN (args
);
2843 /* In G++ 3.2, the check was implemented incorrectly; it
2844 looked at the placement expression, rather than the
2845 type of the function. */
2846 if (placement
&& !TREE_CHAIN (placement
)
2847 && same_type_p (TREE_TYPE (TREE_VALUE (placement
)),
2855 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
2856 /* Skip the size_t parameter. */
2857 arg_types
= TREE_CHAIN (arg_types
);
2858 /* Check the remaining parameters (if any). */
2860 && TREE_CHAIN (arg_types
) == void_list_node
2861 && same_type_p (TREE_VALUE (arg_types
),
2865 /* If we need a cookie, adjust the number of bytes allocated. */
2868 /* Update the total size. */
2869 *size
= size_binop (PLUS_EXPR
, *size
, *cookie_size
);
2870 /* Update the argument list to reflect the adjusted size. */
2871 TREE_VALUE (args
) = *size
;
2874 *cookie_size
= NULL_TREE
;
2877 /* Build the CALL_EXPR. */
2878 return build_over_call (cand
, LOOKUP_NORMAL
);
2882 build_object_call (tree obj
, tree args
)
2884 struct z_candidate
*candidates
= 0, *cand
;
2885 tree fns
, convs
, mem_args
= NULL_TREE
;
2886 tree type
= TREE_TYPE (obj
);
2888 tree result
= NULL_TREE
;
2891 if (TYPE_PTRMEMFUNC_P (type
))
2893 /* It's no good looking for an overloaded operator() on a
2894 pointer-to-member-function. */
2895 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj
);
2896 return error_mark_node
;
2899 fns
= lookup_fnfields (TYPE_BINFO (type
), ansi_opname (CALL_EXPR
), 1);
2900 if (fns
== error_mark_node
)
2901 return error_mark_node
;
2903 args
= resolve_args (args
);
2905 if (args
== error_mark_node
)
2906 return error_mark_node
;
2908 /* Get the high-water mark for the CONVERSION_OBSTACK. */
2909 p
= conversion_obstack_alloc (0);
2913 tree base
= BINFO_TYPE (BASELINK_BINFO (fns
));
2914 mem_args
= tree_cons (NULL_TREE
, build_this (obj
), args
);
2916 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
2918 tree fn
= OVL_CURRENT (fns
);
2919 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2920 add_template_candidate (&candidates
, fn
, base
, NULL_TREE
,
2921 mem_args
, NULL_TREE
,
2924 LOOKUP_NORMAL
, DEDUCE_CALL
);
2926 add_function_candidate
2927 (&candidates
, fn
, base
, mem_args
, TYPE_BINFO (type
),
2928 TYPE_BINFO (type
), LOOKUP_NORMAL
);
2932 convs
= lookup_conversions (type
);
2934 for (; convs
; convs
= TREE_CHAIN (convs
))
2936 tree fns
= TREE_VALUE (convs
);
2937 tree totype
= TREE_TYPE (TREE_TYPE (OVL_CURRENT (fns
)));
2939 if ((TREE_CODE (totype
) == POINTER_TYPE
2940 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
2941 || (TREE_CODE (totype
) == REFERENCE_TYPE
2942 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
2943 || (TREE_CODE (totype
) == REFERENCE_TYPE
2944 && TREE_CODE (TREE_TYPE (totype
)) == POINTER_TYPE
2945 && TREE_CODE (TREE_TYPE (TREE_TYPE (totype
))) == FUNCTION_TYPE
))
2946 for (; fns
; fns
= OVL_NEXT (fns
))
2948 tree fn
= OVL_CURRENT (fns
);
2949 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2950 add_template_conv_candidate
2951 (&candidates
, fn
, obj
, args
, totype
,
2952 /*access_path=*/NULL_TREE
,
2953 /*conversion_path=*/NULL_TREE
);
2955 add_conv_candidate (&candidates
, fn
, obj
, args
,
2956 /*conversion_path=*/NULL_TREE
,
2957 /*access_path=*/NULL_TREE
);
2961 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
2964 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
), args
);
2965 print_z_candidates (candidates
);
2966 result
= error_mark_node
;
2970 cand
= tourney (candidates
);
2973 error ("call of %<(%T) (%A)%> is ambiguous", TREE_TYPE (obj
), args
);
2974 print_z_candidates (candidates
);
2975 result
= error_mark_node
;
2977 /* Since cand->fn will be a type, not a function, for a conversion
2978 function, we must be careful not to unconditionally look at
2980 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
2981 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
2982 result
= build_over_call (cand
, LOOKUP_NORMAL
);
2985 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
, -1);
2986 result
= build_function_call (obj
, args
);
2990 /* Free all the conversions we allocated. */
2991 obstack_free (&conversion_obstack
, p
);
2997 op_error (enum tree_code code
, enum tree_code code2
,
2998 tree arg1
, tree arg2
, tree arg3
, const char *problem
)
3002 if (code
== MODIFY_EXPR
)
3003 opname
= assignment_operator_name_info
[code2
].name
;
3005 opname
= operator_name_info
[code
].name
;
3010 error ("%s for ternary %<operator?:%> in %<%E ? %E : %E%>",
3011 problem
, arg1
, arg2
, arg3
);
3014 case POSTINCREMENT_EXPR
:
3015 case POSTDECREMENT_EXPR
:
3016 error ("%s for %<operator%s%> in %<%E%s%>", problem
, opname
, arg1
, opname
);
3020 error ("%s for %<operator[]%> in %<%E[%E]%>", problem
, arg1
, arg2
);
3025 error ("%s for %qs in %<%s %E%>", problem
, opname
, opname
, arg1
);
3030 error ("%s for %<operator%s%> in %<%E %s %E%>",
3031 problem
, opname
, arg1
, opname
, arg2
);
3033 error ("%s for %<operator%s%> in %<%s%E%>",
3034 problem
, opname
, opname
, arg1
);
3039 /* Return the implicit conversion sequence that could be used to
3040 convert E1 to E2 in [expr.cond]. */
3043 conditional_conversion (tree e1
, tree e2
)
3045 tree t1
= non_reference (TREE_TYPE (e1
));
3046 tree t2
= non_reference (TREE_TYPE (e2
));
3052 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
3053 implicitly converted (clause _conv_) to the type "reference to
3054 T2", subject to the constraint that in the conversion the
3055 reference must bind directly (_dcl.init.ref_) to E1. */
3056 if (real_lvalue_p (e2
))
3058 conv
= implicit_conversion (build_reference_type (t2
),
3061 LOOKUP_NO_TEMP_BIND
);
3068 If E1 and E2 have class type, and the underlying class types are
3069 the same or one is a base class of the other: E1 can be converted
3070 to match E2 if the class of T2 is the same type as, or a base
3071 class of, the class of T1, and the cv-qualification of T2 is the
3072 same cv-qualification as, or a greater cv-qualification than, the
3073 cv-qualification of T1. If the conversion is applied, E1 is
3074 changed to an rvalue of type T2 that still refers to the original
3075 source class object (or the appropriate subobject thereof). */
3076 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
3077 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
3079 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
3081 conv
= build_identity_conv (t1
, e1
);
3082 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
3083 TYPE_MAIN_VARIANT (t2
)))
3084 conv
= build_conv (ck_base
, t2
, conv
);
3086 conv
= build_conv (ck_rvalue
, t2
, conv
);
3095 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
3096 converted to the type that expression E2 would have if E2 were
3097 converted to an rvalue (or the type it has, if E2 is an rvalue). */
3098 return implicit_conversion (t2
, t1
, e1
, LOOKUP_NORMAL
);
3101 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
3102 arguments to the conditional expression. */
3105 build_conditional_expr (tree arg1
, tree arg2
, tree arg3
)
3109 tree result
= NULL_TREE
;
3110 tree result_type
= NULL_TREE
;
3111 bool lvalue_p
= true;
3112 struct z_candidate
*candidates
= 0;
3113 struct z_candidate
*cand
;
3116 /* As a G++ extension, the second argument to the conditional can be
3117 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
3118 c'.) If the second operand is omitted, make sure it is
3119 calculated only once. */
3123 pedwarn ("ISO C++ forbids omitting the middle term of a ?: expression");
3125 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
3126 if (real_lvalue_p (arg1
))
3127 arg2
= arg1
= stabilize_reference (arg1
);
3129 arg2
= arg1
= save_expr (arg1
);
3134 The first expr ession is implicitly converted to bool (clause
3136 arg1
= perform_implicit_conversion (boolean_type_node
, arg1
);
3138 /* If something has already gone wrong, just pass that fact up the
3140 if (error_operand_p (arg1
)
3141 || error_operand_p (arg2
)
3142 || error_operand_p (arg3
))
3143 return error_mark_node
;
3147 If either the second or the third operand has type (possibly
3148 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
3149 array-to-pointer (_conv.array_), and function-to-pointer
3150 (_conv.func_) standard conversions are performed on the second
3151 and third operands. */
3152 arg2_type
= TREE_TYPE (arg2
);
3153 arg3_type
= TREE_TYPE (arg3
);
3154 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
3156 /* Do the conversions. We don't these for `void' type arguments
3157 since it can't have any effect and since decay_conversion
3158 does not handle that case gracefully. */
3159 if (!VOID_TYPE_P (arg2_type
))
3160 arg2
= decay_conversion (arg2
);
3161 if (!VOID_TYPE_P (arg3_type
))
3162 arg3
= decay_conversion (arg3
);
3163 arg2_type
= TREE_TYPE (arg2
);
3164 arg3_type
= TREE_TYPE (arg3
);
3168 One of the following shall hold:
3170 --The second or the third operand (but not both) is a
3171 throw-expression (_except.throw_); the result is of the
3172 type of the other and is an rvalue.
3174 --Both the second and the third operands have type void; the
3175 result is of type void and is an rvalue.
3177 We must avoid calling force_rvalue for expressions of type
3178 "void" because it will complain that their value is being
3180 if (TREE_CODE (arg2
) == THROW_EXPR
3181 && TREE_CODE (arg3
) != THROW_EXPR
)
3183 if (!VOID_TYPE_P (arg3_type
))
3184 arg3
= force_rvalue (arg3
);
3185 arg3_type
= TREE_TYPE (arg3
);
3186 result_type
= arg3_type
;
3188 else if (TREE_CODE (arg2
) != THROW_EXPR
3189 && TREE_CODE (arg3
) == THROW_EXPR
)
3191 if (!VOID_TYPE_P (arg2_type
))
3192 arg2
= force_rvalue (arg2
);
3193 arg2_type
= TREE_TYPE (arg2
);
3194 result_type
= arg2_type
;
3196 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
3197 result_type
= void_type_node
;
3200 error ("%qE has type %<void%> and is not a throw-expression",
3201 VOID_TYPE_P (arg2_type
) ? arg2
: arg3
);
3202 return error_mark_node
;
3206 goto valid_operands
;
3210 Otherwise, if the second and third operand have different types,
3211 and either has (possibly cv-qualified) class type, an attempt is
3212 made to convert each of those operands to the type of the other. */
3213 else if (!same_type_p (arg2_type
, arg3_type
)
3214 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
3219 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3220 p
= conversion_obstack_alloc (0);
3222 conv2
= conditional_conversion (arg2
, arg3
);
3223 conv3
= conditional_conversion (arg3
, arg2
);
3227 If both can be converted, or one can be converted but the
3228 conversion is ambiguous, the program is ill-formed. If
3229 neither can be converted, the operands are left unchanged and
3230 further checking is performed as described below. If exactly
3231 one conversion is possible, that conversion is applied to the
3232 chosen operand and the converted operand is used in place of
3233 the original operand for the remainder of this section. */
3234 if ((conv2
&& !conv2
->bad_p
3235 && conv3
&& !conv3
->bad_p
)
3236 || (conv2
&& conv2
->kind
== ck_ambig
)
3237 || (conv3
&& conv3
->kind
== ck_ambig
))
3239 error ("operands to ?: have different types");
3240 result
= error_mark_node
;
3242 else if (conv2
&& !conv2
->bad_p
)
3244 arg2
= convert_like (conv2
, arg2
);
3245 arg2
= convert_from_reference (arg2
);
3246 arg2_type
= TREE_TYPE (arg2
);
3248 else if (conv3
&& !conv3
->bad_p
)
3250 arg3
= convert_like (conv3
, arg3
);
3251 arg3
= convert_from_reference (arg3
);
3252 arg3_type
= TREE_TYPE (arg3
);
3255 /* Free all the conversions we allocated. */
3256 obstack_free (&conversion_obstack
, p
);
3261 /* If, after the conversion, both operands have class type,
3262 treat the cv-qualification of both operands as if it were the
3263 union of the cv-qualification of the operands.
3265 The standard is not clear about what to do in this
3266 circumstance. For example, if the first operand has type
3267 "const X" and the second operand has a user-defined
3268 conversion to "volatile X", what is the type of the second
3269 operand after this step? Making it be "const X" (matching
3270 the first operand) seems wrong, as that discards the
3271 qualification without actually performing a copy. Leaving it
3272 as "volatile X" seems wrong as that will result in the
3273 conditional expression failing altogether, even though,
3274 according to this step, the one operand could be converted to
3275 the type of the other. */
3276 if ((conv2
|| conv3
)
3277 && CLASS_TYPE_P (arg2_type
)
3278 && TYPE_QUALS (arg2_type
) != TYPE_QUALS (arg3_type
))
3279 arg2_type
= arg3_type
=
3280 cp_build_qualified_type (arg2_type
,
3281 TYPE_QUALS (arg2_type
)
3282 | TYPE_QUALS (arg3_type
));
3287 If the second and third operands are lvalues and have the same
3288 type, the result is of that type and is an lvalue. */
3289 if (real_lvalue_p (arg2
)
3290 && real_lvalue_p (arg3
)
3291 && same_type_p (arg2_type
, arg3_type
))
3293 result_type
= arg2_type
;
3294 goto valid_operands
;
3299 Otherwise, the result is an rvalue. If the second and third
3300 operand do not have the same type, and either has (possibly
3301 cv-qualified) class type, overload resolution is used to
3302 determine the conversions (if any) to be applied to the operands
3303 (_over.match.oper_, _over.built_). */
3305 if (!same_type_p (arg2_type
, arg3_type
)
3306 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
3312 /* Rearrange the arguments so that add_builtin_candidate only has
3313 to know about two args. In build_builtin_candidates, the
3314 arguments are unscrambled. */
3318 add_builtin_candidates (&candidates
,
3321 ansi_opname (COND_EXPR
),
3327 If the overload resolution fails, the program is
3329 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3332 op_error (COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, "no match");
3333 print_z_candidates (candidates
);
3334 return error_mark_node
;
3336 cand
= tourney (candidates
);
3339 op_error (COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, "no match");
3340 print_z_candidates (candidates
);
3341 return error_mark_node
;
3346 Otherwise, the conversions thus determined are applied, and
3347 the converted operands are used in place of the original
3348 operands for the remainder of this section. */
3349 conv
= cand
->convs
[0];
3350 arg1
= convert_like (conv
, arg1
);
3351 conv
= cand
->convs
[1];
3352 arg2
= convert_like (conv
, arg2
);
3353 conv
= cand
->convs
[2];
3354 arg3
= convert_like (conv
, arg3
);
3359 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
3360 and function-to-pointer (_conv.func_) standard conversions are
3361 performed on the second and third operands.
3363 We need to force the lvalue-to-rvalue conversion here for class types,
3364 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
3365 that isn't wrapped with a TARGET_EXPR plays havoc with exception
3368 arg2
= force_rvalue (arg2
);
3369 if (!CLASS_TYPE_P (arg2_type
))
3370 arg2_type
= TREE_TYPE (arg2
);
3372 arg3
= force_rvalue (arg3
);
3373 if (!CLASS_TYPE_P (arg2_type
))
3374 arg3_type
= TREE_TYPE (arg3
);
3376 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
3377 return error_mark_node
;
3381 After those conversions, one of the following shall hold:
3383 --The second and third operands have the same type; the result is of
3385 if (same_type_p (arg2_type
, arg3_type
))
3386 result_type
= arg2_type
;
3389 --The second and third operands have arithmetic or enumeration
3390 type; the usual arithmetic conversions are performed to bring
3391 them to a common type, and the result is of that type. */
3392 else if ((ARITHMETIC_TYPE_P (arg2_type
)
3393 || TREE_CODE (arg2_type
) == ENUMERAL_TYPE
)
3394 && (ARITHMETIC_TYPE_P (arg3_type
)
3395 || TREE_CODE (arg3_type
) == ENUMERAL_TYPE
))
3397 /* In this case, there is always a common type. */
3398 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
3401 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
3402 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
3403 warning ("enumeral mismatch in conditional expression: %qT vs %qT",
3404 arg2_type
, arg3_type
);
3405 else if (extra_warnings
3406 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
3407 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
3408 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
3409 && !same_type_p (arg2_type
, type_promotes_to (arg3_type
)))))
3410 warning ("enumeral and non-enumeral type in conditional expression");
3412 arg2
= perform_implicit_conversion (result_type
, arg2
);
3413 arg3
= perform_implicit_conversion (result_type
, arg3
);
3417 --The second and third operands have pointer type, or one has
3418 pointer type and the other is a null pointer constant; pointer
3419 conversions (_conv.ptr_) and qualification conversions
3420 (_conv.qual_) are performed to bring them to their composite
3421 pointer type (_expr.rel_). The result is of the composite
3424 --The second and third operands have pointer to member type, or
3425 one has pointer to member type and the other is a null pointer
3426 constant; pointer to member conversions (_conv.mem_) and
3427 qualification conversions (_conv.qual_) are performed to bring
3428 them to a common type, whose cv-qualification shall match the
3429 cv-qualification of either the second or the third operand.
3430 The result is of the common type. */
3431 else if ((null_ptr_cst_p (arg2
)
3432 && (TYPE_PTR_P (arg3_type
) || TYPE_PTR_TO_MEMBER_P (arg3_type
)))
3433 || (null_ptr_cst_p (arg3
)
3434 && (TYPE_PTR_P (arg2_type
) || TYPE_PTR_TO_MEMBER_P (arg2_type
)))
3435 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
3436 || (TYPE_PTRMEM_P (arg2_type
) && TYPE_PTRMEM_P (arg3_type
))
3437 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
3439 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
3440 arg3
, "conditional expression");
3441 if (result_type
== error_mark_node
)
3442 return error_mark_node
;
3443 arg2
= perform_implicit_conversion (result_type
, arg2
);
3444 arg3
= perform_implicit_conversion (result_type
, arg3
);
3449 error ("operands to ?: have different types");
3450 return error_mark_node
;
3454 result
= fold_if_not_in_template (build3 (COND_EXPR
, result_type
, arg1
,
3456 /* We can't use result_type below, as fold might have returned a
3459 /* Expand both sides into the same slot, hopefully the target of the
3460 ?: expression. We used to check for TARGET_EXPRs here, but now we
3461 sometimes wrap them in NOP_EXPRs so the test would fail. */
3462 if (!lvalue_p
&& CLASS_TYPE_P (TREE_TYPE (result
)))
3463 result
= get_target_expr (result
);
3465 /* If this expression is an rvalue, but might be mistaken for an
3466 lvalue, we must add a NON_LVALUE_EXPR. */
3467 if (!lvalue_p
&& real_lvalue_p (result
))
3468 result
= build1 (NON_LVALUE_EXPR
, TREE_TYPE (result
), result
);
3473 /* OPERAND is an operand to an expression. Perform necessary steps
3474 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
3478 prep_operand (tree operand
)
3482 operand
= convert_from_reference (operand
);
3483 if (CLASS_TYPE_P (TREE_TYPE (operand
))
3484 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
3485 /* Make sure the template type is instantiated now. */
3486 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
3492 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
3493 OVERLOAD) to the CANDIDATES, returning an updated list of
3494 CANDIDATES. The ARGS are the arguments provided to the call,
3495 without any implicit object parameter. The EXPLICIT_TARGS are
3496 explicit template arguments provided. TEMPLATE_ONLY is true if
3497 only template functions should be considered. CONVERSION_PATH,
3498 ACCESS_PATH, and FLAGS are as for add_function_candidate. */
3501 add_candidates (tree fns
, tree args
,
3502 tree explicit_targs
, bool template_only
,
3503 tree conversion_path
, tree access_path
,
3505 struct z_candidate
**candidates
)
3508 tree non_static_args
;
3510 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
3511 /* Delay creating the implicit this parameter until it is needed. */
3512 non_static_args
= NULL_TREE
;
3519 fn
= OVL_CURRENT (fns
);
3520 /* Figure out which set of arguments to use. */
3521 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
3523 /* If this function is a non-static member, prepend the implicit
3524 object parameter. */
3525 if (!non_static_args
)
3526 non_static_args
= tree_cons (NULL_TREE
,
3527 build_this (TREE_VALUE (args
)),
3529 fn_args
= non_static_args
;
3532 /* Otherwise, just use the list of arguments provided. */
3535 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
3536 add_template_candidate (candidates
,
3546 else if (!template_only
)
3547 add_function_candidate (candidates
,
3554 fns
= OVL_NEXT (fns
);
3559 build_new_op (enum tree_code code
, int flags
, tree arg1
, tree arg2
, tree arg3
,
3562 struct z_candidate
*candidates
= 0, *cand
;
3563 tree arglist
, fnname
;
3565 tree result
= NULL_TREE
;
3566 bool result_valid_p
= false;
3567 enum tree_code code2
= NOP_EXPR
;
3573 if (error_operand_p (arg1
)
3574 || error_operand_p (arg2
)
3575 || error_operand_p (arg3
))
3576 return error_mark_node
;
3578 if (code
== MODIFY_EXPR
)
3580 code2
= TREE_CODE (arg3
);
3582 fnname
= ansi_assopname (code2
);
3585 fnname
= ansi_opname (code
);
3587 arg1
= prep_operand (arg1
);
3593 case VEC_DELETE_EXPR
:
3595 /* Use build_op_new_call and build_op_delete_call instead. */
3599 return build_object_call (arg1
, arg2
);
3605 arg2
= prep_operand (arg2
);
3606 arg3
= prep_operand (arg3
);
3608 if (code
== COND_EXPR
)
3610 if (arg2
== NULL_TREE
3611 || TREE_CODE (TREE_TYPE (arg2
)) == VOID_TYPE
3612 || TREE_CODE (TREE_TYPE (arg3
)) == VOID_TYPE
3613 || (! IS_OVERLOAD_TYPE (TREE_TYPE (arg2
))
3614 && ! IS_OVERLOAD_TYPE (TREE_TYPE (arg3
))))
3617 else if (! IS_OVERLOAD_TYPE (TREE_TYPE (arg1
))
3618 && (! arg2
|| ! IS_OVERLOAD_TYPE (TREE_TYPE (arg2
))))
3621 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
3622 arg2
= integer_zero_node
;
3624 arglist
= NULL_TREE
;
3626 arglist
= tree_cons (NULL_TREE
, arg3
, arglist
);
3628 arglist
= tree_cons (NULL_TREE
, arg2
, arglist
);
3629 arglist
= tree_cons (NULL_TREE
, arg1
, arglist
);
3631 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3632 p
= conversion_obstack_alloc (0);
3634 /* Add namespace-scope operators to the list of functions to
3636 add_candidates (lookup_function_nonclass (fnname
, arglist
, /*block_p=*/true),
3637 arglist
, NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
3638 flags
, &candidates
);
3639 /* Add class-member operators to the candidate set. */
3640 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
3644 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
3645 if (fns
== error_mark_node
)
3647 result
= error_mark_node
;
3648 goto user_defined_result_ready
;
3651 add_candidates (BASELINK_FUNCTIONS (fns
), arglist
,
3653 BASELINK_BINFO (fns
),
3654 TYPE_BINFO (TREE_TYPE (arg1
)),
3655 flags
, &candidates
);
3658 /* Rearrange the arguments for ?: so that add_builtin_candidate only has
3659 to know about two args; a builtin candidate will always have a first
3660 parameter of type bool. We'll handle that in
3661 build_builtin_candidate. */
3662 if (code
== COND_EXPR
)
3672 args
[2] = NULL_TREE
;
3675 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
, flags
);
3681 /* For these, the built-in candidates set is empty
3682 [over.match.oper]/3. We don't want non-strict matches
3683 because exact matches are always possible with built-in
3684 operators. The built-in candidate set for COMPONENT_REF
3685 would be empty too, but since there are no such built-in
3686 operators, we accept non-strict matches for them. */
3691 strict_p
= pedantic
;
3695 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
3700 case POSTINCREMENT_EXPR
:
3701 case POSTDECREMENT_EXPR
:
3702 /* Look for an `operator++ (int)'. If they didn't have
3703 one, then we fall back to the old way of doing things. */
3704 if (flags
& LOOKUP_COMPLAIN
)
3705 pedwarn ("no %<%D(int)%> declared for postfix %qs, "
3706 "trying prefix operator instead",
3708 operator_name_info
[code
].name
);
3709 if (code
== POSTINCREMENT_EXPR
)
3710 code
= PREINCREMENT_EXPR
;
3712 code
= PREDECREMENT_EXPR
;
3713 result
= build_new_op (code
, flags
, arg1
, NULL_TREE
, NULL_TREE
,
3717 /* The caller will deal with these. */
3722 result_valid_p
= true;
3726 if (flags
& LOOKUP_COMPLAIN
)
3728 op_error (code
, code2
, arg1
, arg2
, arg3
, "no match");
3729 print_z_candidates (candidates
);
3731 result
= error_mark_node
;
3737 cand
= tourney (candidates
);
3740 if (flags
& LOOKUP_COMPLAIN
)
3742 op_error (code
, code2
, arg1
, arg2
, arg3
, "ambiguous overload");
3743 print_z_candidates (candidates
);
3745 result
= error_mark_node
;
3747 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
3750 *overloaded_p
= true;
3753 && fnname
== ansi_assopname (NOP_EXPR
)
3754 && DECL_ARTIFICIAL (cand
->fn
)
3756 && ! candidates
->next
->next
)
3758 warning ("using synthesized %q#D for copy assignment",
3760 cp_warning_at (" where cfront would use %q#D",
3762 ? candidates
->next
->fn
3766 result
= build_over_call (cand
, LOOKUP_NORMAL
);
3770 /* Give any warnings we noticed during overload resolution. */
3773 struct candidate_warning
*w
;
3774 for (w
= cand
->warnings
; w
; w
= w
->next
)
3775 joust (cand
, w
->loser
, 1);
3778 /* Check for comparison of different enum types. */
3787 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
3788 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
3789 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
3790 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
))))
3792 warning ("comparison between %q#T and %q#T",
3793 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
3800 /* We need to strip any leading REF_BIND so that bitfields
3801 don't cause errors. This should not remove any important
3802 conversions, because builtins don't apply to class
3803 objects directly. */
3804 conv
= cand
->convs
[0];
3805 if (conv
->kind
== ck_ref_bind
)
3806 conv
= conv
->u
.next
;
3807 arg1
= convert_like (conv
, arg1
);
3810 conv
= cand
->convs
[1];
3811 if (conv
->kind
== ck_ref_bind
)
3812 conv
= conv
->u
.next
;
3813 arg2
= convert_like (conv
, arg2
);
3817 conv
= cand
->convs
[2];
3818 if (conv
->kind
== ck_ref_bind
)
3819 conv
= conv
->u
.next
;
3820 arg3
= convert_like (conv
, arg3
);
3825 user_defined_result_ready
:
3827 /* Free all the conversions we allocated. */
3828 obstack_free (&conversion_obstack
, p
);
3830 if (result
|| result_valid_p
)
3837 return build_modify_expr (arg1
, code2
, arg2
);
3840 return build_indirect_ref (arg1
, "unary *");
3845 case TRUNC_DIV_EXPR
:
3856 case TRUNC_MOD_EXPR
:
3860 case TRUTH_ANDIF_EXPR
:
3861 case TRUTH_ORIF_EXPR
:
3862 return cp_build_binary_op (code
, arg1
, arg2
);
3867 case TRUTH_NOT_EXPR
:
3868 case PREINCREMENT_EXPR
:
3869 case POSTINCREMENT_EXPR
:
3870 case PREDECREMENT_EXPR
:
3871 case POSTDECREMENT_EXPR
:
3874 return build_unary_op (code
, arg1
, candidates
!= 0);
3877 return build_array_ref (arg1
, arg2
);
3880 return build_conditional_expr (arg1
, arg2
, arg3
);
3883 return build_m_component_ref (build_indirect_ref (arg1
, NULL
), arg2
);
3885 /* The caller will deal with these. */
3897 /* Build a call to operator delete. This has to be handled very specially,
3898 because the restrictions on what signatures match are different from all
3899 other call instances. For a normal delete, only a delete taking (void *)
3900 or (void *, size_t) is accepted. For a placement delete, only an exact
3901 match with the placement new is accepted.
3903 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
3904 ADDR is the pointer to be deleted.
3905 SIZE is the size of the memory block to be deleted.
3906 GLOBAL_P is true if the delete-expression should not consider
3907 class-specific delete operators.
3908 PLACEMENT is the corresponding placement new call, or NULL_TREE. */
3911 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
3912 bool global_p
, tree placement
)
3914 tree fn
= NULL_TREE
;
3915 tree fns
, fnname
, argtypes
, args
, type
;
3918 if (addr
== error_mark_node
)
3919 return error_mark_node
;
3921 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
3923 fnname
= ansi_opname (code
);
3925 if (IS_AGGR_TYPE (type
) && !global_p
)
3928 If the result of the lookup is ambiguous or inaccessible, or if
3929 the lookup selects a placement deallocation function, the
3930 program is ill-formed.
3932 Therefore, we ask lookup_fnfields to complain about ambiguity. */
3934 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
3935 if (fns
== error_mark_node
)
3936 return error_mark_node
;
3941 if (fns
== NULL_TREE
)
3942 fns
= lookup_name_nonclass (fnname
);
3949 /* Find the allocation function that is being called. */
3950 call_expr
= placement
;
3951 /* Extract the function. */
3952 alloc_fn
= get_callee_fndecl (call_expr
);
3953 gcc_assert (alloc_fn
!= NULL_TREE
);
3954 /* Then the second parm type. */
3955 argtypes
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (alloc_fn
)));
3956 /* Also the second argument. */
3957 args
= TREE_CHAIN (TREE_OPERAND (call_expr
, 1));
3961 /* First try it without the size argument. */
3962 argtypes
= void_list_node
;
3966 /* Strip const and volatile from addr. */
3967 addr
= cp_convert (ptr_type_node
, addr
);
3969 /* We make two tries at finding a matching `operator delete'. On
3970 the first pass, we look for a one-operator (or placement)
3971 operator delete. If we're not doing placement delete, then on
3972 the second pass we look for a two-argument delete. */
3973 for (pass
= 0; pass
< (placement
? 1 : 2); ++pass
)
3975 /* Go through the `operator delete' functions looking for one
3976 with a matching type. */
3977 for (fn
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
3983 /* The first argument must be "void *". */
3984 t
= TYPE_ARG_TYPES (TREE_TYPE (OVL_CURRENT (fn
)));
3985 if (!same_type_p (TREE_VALUE (t
), ptr_type_node
))
3988 /* On the first pass, check the rest of the arguments. */
3994 if (!same_type_p (TREE_VALUE (a
), TREE_VALUE (t
)))
4002 /* On the second pass, the second argument must be
4005 && same_type_p (TREE_VALUE (t
), sizetype
)
4006 && TREE_CHAIN (t
) == void_list_node
)
4010 /* If we found a match, we're done. */
4015 /* If we have a matching function, call it. */
4018 /* Make sure we have the actual function, and not an
4020 fn
= OVL_CURRENT (fn
);
4022 /* If the FN is a member function, make sure that it is
4024 if (DECL_CLASS_SCOPE_P (fn
))
4025 perform_or_defer_access_check (TYPE_BINFO (type
), fn
);
4028 args
= tree_cons (NULL_TREE
, addr
, args
);
4030 args
= tree_cons (NULL_TREE
, addr
,
4031 build_tree_list (NULL_TREE
, size
));
4035 /* The placement args might not be suitable for overload
4036 resolution at this point, so build the call directly. */
4038 return build_cxx_call (fn
, args
);
4041 return build_function_call (fn
, args
);
4044 /* If we are doing placement delete we do nothing if we don't find a
4045 matching op delete. */
4049 error ("no suitable %<operator %s> for %qT",
4050 operator_name_info
[(int)code
].name
, type
);
4051 return error_mark_node
;
4054 /* If the current scope isn't allowed to access DECL along
4055 BASETYPE_PATH, give an error. The most derived class in
4056 BASETYPE_PATH is the one used to qualify DECL. */
4059 enforce_access (tree basetype_path
, tree decl
)
4061 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
4063 if (!accessible_p (basetype_path
, decl
, true))
4065 if (TREE_PRIVATE (decl
))
4066 cp_error_at ("%q+#D is private", decl
);
4067 else if (TREE_PROTECTED (decl
))
4068 cp_error_at ("%q+#D is protected", decl
);
4070 cp_error_at ("%q+#D is inaccessible", decl
);
4071 error ("within this context");
4078 /* Check that a callable constructor to initialize a temporary of
4079 TYPE from an EXPR exists. */
4082 check_constructor_callable (tree type
, tree expr
)
4084 build_special_member_call (NULL_TREE
,
4085 complete_ctor_identifier
,
4086 build_tree_list (NULL_TREE
, expr
),
4088 LOOKUP_NORMAL
| LOOKUP_ONLYCONVERTING
4089 | LOOKUP_CONSTRUCTOR_CALLABLE
);
4092 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
4093 bitwise or of LOOKUP_* values. If any errors are warnings are
4094 generated, set *DIAGNOSTIC_FN to "error" or "warning",
4095 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
4099 build_temp (tree expr
, tree type
, int flags
,
4100 void (**diagnostic_fn
)(const char *, ...))
4104 savew
= warningcount
, savee
= errorcount
;
4105 expr
= build_special_member_call (NULL_TREE
,
4106 complete_ctor_identifier
,
4107 build_tree_list (NULL_TREE
, expr
),
4109 if (warningcount
> savew
)
4110 *diagnostic_fn
= warning
;
4111 else if (errorcount
> savee
)
4112 *diagnostic_fn
= error
;
4114 *diagnostic_fn
= NULL
;
4119 /* Perform the conversions in CONVS on the expression EXPR. FN and
4120 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
4121 indicates the `this' argument of a method. INNER is nonzero when
4122 being called to continue a conversion chain. It is negative when a
4123 reference binding will be applied, positive otherwise. If
4124 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
4125 conversions will be emitted if appropriate. If C_CAST_P is true,
4126 this conversion is coming from a C-style cast; in that case,
4127 conversions to inaccessible bases are permitted. */
4130 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
4131 int inner
, bool issue_conversion_warnings
,
4134 tree totype
= convs
->type
;
4135 void (*diagnostic_fn
)(const char *, ...);
4138 && convs
->kind
!= ck_user
4139 && convs
->kind
!= ck_ambig
4140 && convs
->kind
!= ck_ref_bind
)
4142 conversion
*t
= convs
;
4143 for (; t
; t
= convs
->u
.next
)
4145 if (t
->kind
== ck_user
|| !t
->bad_p
)
4147 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
4148 /*issue_conversion_warnings=*/false,
4149 /*c_cast_p=*/false);
4152 else if (t
->kind
== ck_ambig
)
4153 return convert_like_real (t
, expr
, fn
, argnum
, 1,
4154 /*issue_conversion_warnings=*/false,
4155 /*c_cast_p=*/false);
4156 else if (t
->kind
== ck_identity
)
4159 pedwarn ("invalid conversion from %qT to %qT", TREE_TYPE (expr
), totype
);
4161 pedwarn (" initializing argument %P of %qD", argnum
, fn
);
4162 return cp_convert (totype
, expr
);
4165 if (issue_conversion_warnings
)
4166 expr
= dubious_conversion_warnings
4167 (totype
, expr
, "converting", fn
, argnum
);
4168 switch (convs
->kind
)
4172 struct z_candidate
*cand
= convs
->cand
;
4173 tree convfn
= cand
->fn
;
4176 if (DECL_CONSTRUCTOR_P (convfn
))
4178 tree t
= build_int_cst (build_pointer_type (DECL_CONTEXT (convfn
)),
4181 args
= build_tree_list (NULL_TREE
, expr
);
4182 /* We should never try to call the abstract or base constructor
4184 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (convfn
)
4185 && !DECL_HAS_VTT_PARM_P (convfn
));
4186 args
= tree_cons (NULL_TREE
, t
, args
);
4189 args
= build_this (expr
);
4190 expr
= build_over_call (cand
, LOOKUP_NORMAL
);
4192 /* If this is a constructor or a function returning an aggr type,
4193 we need to build up a TARGET_EXPR. */
4194 if (DECL_CONSTRUCTOR_P (convfn
))
4195 expr
= build_cplus_new (totype
, expr
);
4197 /* The result of the call is then used to direct-initialize the object
4198 that is the destination of the copy-initialization. [dcl.init]
4200 Note that this step is not reflected in the conversion sequence;
4201 it affects the semantics when we actually perform the
4202 conversion, but is not considered during overload resolution.
4204 If the target is a class, that means call a ctor. */
4205 if (IS_AGGR_TYPE (totype
)
4206 && (inner
>= 0 || !lvalue_p (expr
)))
4210 /* Core issue 84, now a DR, says that we don't
4211 allow UDCs for these args (which deliberately
4212 breaks copy-init of an auto_ptr<Base> from an
4213 auto_ptr<Derived>). */
4214 LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
,
4221 (" initializing argument %P of %qD from result of %qD",
4222 argnum
, fn
, convfn
);
4225 (" initializing temporary from result of %qD", convfn
);
4227 expr
= build_cplus_new (totype
, expr
);
4232 if (type_unknown_p (expr
))
4233 expr
= instantiate_type (totype
, expr
, tf_error
| tf_warning
);
4234 /* Convert a non-array constant variable to its underlying value, unless we
4235 are about to bind it to a reference, in which case we need to
4236 leave it as an lvalue. */
4238 && TREE_CODE (TREE_TYPE (expr
)) != ARRAY_TYPE
)
4239 expr
= decl_constant_value (expr
);
4240 if (convs
->check_copy_constructor_p
)
4241 check_constructor_callable (totype
, expr
);
4244 /* Call build_user_type_conversion again for the error. */
4245 return build_user_type_conversion
4246 (totype
, convs
->u
.expr
, LOOKUP_NORMAL
);
4252 expr
= convert_like_real (convs
->u
.next
, expr
, fn
, argnum
,
4253 convs
->kind
== ck_ref_bind
? -1 : 1,
4254 /*issue_conversion_warnings=*/false,
4256 if (expr
== error_mark_node
)
4257 return error_mark_node
;
4259 switch (convs
->kind
)
4262 if (! IS_AGGR_TYPE (totype
))
4264 /* Else fall through. */
4266 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
4268 /* We are going to bind a reference directly to a base-class
4269 subobject of EXPR. */
4270 if (convs
->check_copy_constructor_p
)
4271 check_constructor_callable (TREE_TYPE (expr
), expr
);
4272 /* Build an expression for `*((base*) &expr)'. */
4273 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
4274 expr
= convert_to_base (expr
, build_pointer_type (totype
),
4275 !c_cast_p
, /*nonnull=*/true);
4276 expr
= build_indirect_ref (expr
, "implicit conversion");
4280 /* Copy-initialization where the cv-unqualified version of the source
4281 type is the same class as, or a derived class of, the class of the
4282 destination [is treated as direct-initialization]. [dcl.init] */
4283 expr
= build_temp (expr
, totype
, LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
,
4285 if (diagnostic_fn
&& fn
)
4286 diagnostic_fn (" initializing argument %P of %qD", argnum
, fn
);
4287 return build_cplus_new (totype
, expr
);
4291 tree ref_type
= totype
;
4293 /* If necessary, create a temporary. */
4294 if (convs
->need_temporary_p
|| !lvalue_p (expr
))
4296 tree type
= convs
->u
.next
->type
;
4298 if (!CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
4300 /* If the reference is volatile or non-const, we
4301 cannot create a temporary. */
4302 cp_lvalue_kind lvalue
= real_lvalue_p (expr
);
4304 if (lvalue
& clk_bitfield
)
4305 error ("cannot bind bitfield %qE to %qT",
4307 else if (lvalue
& clk_packed
)
4308 error ("cannot bind packed field %qE to %qT",
4311 error ("cannot bind rvalue %qE to %qT", expr
, ref_type
);
4312 return error_mark_node
;
4314 expr
= build_target_expr_with_type (expr
, type
);
4317 /* Take the address of the thing to which we will bind the
4319 expr
= build_unary_op (ADDR_EXPR
, expr
, 1);
4320 if (expr
== error_mark_node
)
4321 return error_mark_node
;
4323 /* Convert it to a pointer to the type referred to by the
4324 reference. This will adjust the pointer if a derived to
4325 base conversion is being performed. */
4326 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
4328 /* Convert the pointer to the desired reference type. */
4329 return build_nop (ref_type
, expr
);
4333 return decay_conversion (expr
);
4336 /* Warn about deprecated conversion if appropriate. */
4337 string_conv_p (totype
, expr
, 1);
4342 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
4344 return build_nop (totype
, expr
);
4347 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
4353 return ocp_convert (totype
, expr
, CONV_IMPLICIT
,
4354 LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
);
4357 /* Build a call to __builtin_trap. */
4360 call_builtin_trap (void)
4362 tree fn
= implicit_built_in_decls
[BUILT_IN_TRAP
];
4364 gcc_assert (fn
!= NULL
);
4365 fn
= build_call (fn
, NULL_TREE
);
4369 /* ARG is being passed to a varargs function. Perform any conversions
4370 required. Return the converted value. */
4373 convert_arg_to_ellipsis (tree arg
)
4377 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
4378 standard conversions are performed. */
4379 arg
= decay_conversion (arg
);
4382 If the argument has integral or enumeration type that is subject
4383 to the integral promotions (_conv.prom_), or a floating point
4384 type that is subject to the floating point promotion
4385 (_conv.fpprom_), the value of the argument is converted to the
4386 promoted type before the call. */
4387 if (TREE_CODE (TREE_TYPE (arg
)) == REAL_TYPE
4388 && (TYPE_PRECISION (TREE_TYPE (arg
))
4389 < TYPE_PRECISION (double_type_node
)))
4390 arg
= convert_to_real (double_type_node
, arg
);
4391 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (arg
)))
4392 arg
= perform_integral_promotions (arg
);
4394 arg
= require_complete_type (arg
);
4396 if (arg
!= error_mark_node
4397 && !pod_type_p (TREE_TYPE (arg
)))
4399 /* Undefined behavior [expr.call] 5.2.2/7. We used to just warn
4400 here and do a bitwise copy, but now cp_expr_size will abort if we
4402 If the call appears in the context of a sizeof expression,
4403 there is no need to emit a warning, since the expression won't be
4404 evaluated. We keep the builtin_trap just as a safety check. */
4405 if (!skip_evaluation
)
4406 warning ("cannot pass objects of non-POD type %q#T through %<...%>; "
4407 "call will abort at runtime", TREE_TYPE (arg
));
4408 arg
= call_builtin_trap ();
4409 arg
= build2 (COMPOUND_EXPR
, integer_type_node
, arg
,
4416 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
4419 build_x_va_arg (tree expr
, tree type
)
4421 if (processing_template_decl
)
4422 return build_min (VA_ARG_EXPR
, type
, expr
);
4424 type
= complete_type_or_else (type
, NULL_TREE
);
4426 if (expr
== error_mark_node
|| !type
)
4427 return error_mark_node
;
4429 if (! pod_type_p (type
))
4431 /* Undefined behavior [expr.call] 5.2.2/7. */
4432 warning ("cannot receive objects of non-POD type %q#T through %<...%>; "
4433 "call will abort at runtime", type
);
4434 expr
= convert (build_pointer_type (type
), null_node
);
4435 expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
),
4436 call_builtin_trap (), expr
);
4437 expr
= build_indirect_ref (expr
, NULL
);
4441 return build_va_arg (expr
, type
);
4444 /* TYPE has been given to va_arg. Apply the default conversions which
4445 would have happened when passed via ellipsis. Return the promoted
4446 type, or the passed type if there is no change. */
4449 cxx_type_promotes_to (tree type
)
4453 /* Perform the array-to-pointer and function-to-pointer
4455 type
= type_decays_to (type
);
4457 promote
= type_promotes_to (type
);
4458 if (same_type_p (type
, promote
))
4464 /* ARG is a default argument expression being passed to a parameter of
4465 the indicated TYPE, which is a parameter to FN. Do any required
4466 conversions. Return the converted value. */
4469 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
)
4471 /* If the ARG is an unparsed default argument expression, the
4472 conversion cannot be performed. */
4473 if (TREE_CODE (arg
) == DEFAULT_ARG
)
4475 error ("the default argument for parameter %d of %qD has "
4476 "not yet been parsed",
4478 return error_mark_node
;
4481 if (fn
&& DECL_TEMPLATE_INFO (fn
))
4482 arg
= tsubst_default_argument (fn
, type
, arg
);
4484 arg
= break_out_target_exprs (arg
);
4486 if (TREE_CODE (arg
) == CONSTRUCTOR
)
4488 arg
= digest_init (type
, arg
, 0);
4489 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_NORMAL
,
4490 "default argument", fn
, parmnum
);
4494 /* This could get clobbered by the following call. */
4495 if (TREE_HAS_CONSTRUCTOR (arg
))
4496 arg
= copy_node (arg
);
4498 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_NORMAL
,
4499 "default argument", fn
, parmnum
);
4500 arg
= convert_for_arg_passing (type
, arg
);
4506 /* Returns the type which will really be used for passing an argument of
4510 type_passed_as (tree type
)
4512 /* Pass classes with copy ctors by invisible reference. */
4513 if (TREE_ADDRESSABLE (type
))
4515 type
= build_reference_type (type
);
4516 /* There are no other pointers to this temporary. */
4517 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
4519 else if (targetm
.calls
.promote_prototypes (type
)
4520 && INTEGRAL_TYPE_P (type
)
4521 && COMPLETE_TYPE_P (type
)
4522 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
4523 TYPE_SIZE (integer_type_node
)))
4524 type
= integer_type_node
;
4529 /* Actually perform the appropriate conversion. */
4532 convert_for_arg_passing (tree type
, tree val
)
4534 if (val
== error_mark_node
)
4536 /* Pass classes with copy ctors by invisible reference. */
4537 else if (TREE_ADDRESSABLE (type
))
4538 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
4539 else if (targetm
.calls
.promote_prototypes (type
)
4540 && INTEGRAL_TYPE_P (type
)
4541 && COMPLETE_TYPE_P (type
)
4542 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
4543 TYPE_SIZE (integer_type_node
)))
4544 val
= perform_integral_promotions (val
);
4548 /* Returns true iff FN is a function with magic varargs, i.e. ones for
4549 which no conversions at all should be done. This is true for some
4550 builtins which don't act like normal functions. */
4553 magic_varargs_p (tree fn
)
4555 if (DECL_BUILT_IN (fn
))
4556 switch (DECL_FUNCTION_CODE (fn
))
4558 case BUILT_IN_CLASSIFY_TYPE
:
4559 case BUILT_IN_CONSTANT_P
:
4560 case BUILT_IN_NEXT_ARG
:
4561 case BUILT_IN_STDARG_START
:
4562 case BUILT_IN_VA_START
:
4571 /* Subroutine of the various build_*_call functions. Overload resolution
4572 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
4573 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
4574 bitmask of various LOOKUP_* flags which apply to the call itself. */
4577 build_over_call (struct z_candidate
*cand
, int flags
)
4580 tree args
= cand
->args
;
4581 conversion
**convs
= cand
->convs
;
4583 tree converted_args
= NULL_TREE
;
4584 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
4589 /* In a template, there is no need to perform all of the work that
4590 is normally done. We are only interested in the type of the call
4591 expression, i.e., the return type of the function. Any semantic
4592 errors will be deferred until the template is instantiated. */
4593 if (processing_template_decl
)
4597 return_type
= TREE_TYPE (TREE_TYPE (fn
));
4598 expr
= build3 (CALL_EXPR
, return_type
, fn
, args
, NULL_TREE
);
4599 if (TREE_THIS_VOLATILE (fn
) && cfun
)
4600 current_function_returns_abnormally
= 1;
4601 if (!VOID_TYPE_P (return_type
))
4602 require_complete_type (return_type
);
4603 return convert_from_reference (expr
);
4606 /* Give any warnings we noticed during overload resolution. */
4609 struct candidate_warning
*w
;
4610 for (w
= cand
->warnings
; w
; w
= w
->next
)
4611 joust (cand
, w
->loser
, 1);
4614 if (DECL_FUNCTION_MEMBER_P (fn
))
4616 /* If FN is a template function, two cases must be considered.
4621 template <class T> void f();
4623 template <class T> struct B {
4627 struct C : A, B<int> {
4629 using B<int>::g; // #2
4632 In case #1 where `A::f' is a member template, DECL_ACCESS is
4633 recorded in the primary template but not in its specialization.
4634 We check access of FN using its primary template.
4636 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
4637 because it is a member of class template B, DECL_ACCESS is
4638 recorded in the specialization `B<int>::g'. We cannot use its
4639 primary template because `B<T>::g' and `B<int>::g' may have
4640 different access. */
4641 if (DECL_TEMPLATE_INFO (fn
)
4642 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
4643 perform_or_defer_access_check (cand
->access_path
,
4644 DECL_TI_TEMPLATE (fn
));
4646 perform_or_defer_access_check (cand
->access_path
, fn
);
4649 if (args
&& TREE_CODE (args
) != TREE_LIST
)
4650 args
= build_tree_list (NULL_TREE
, args
);
4653 /* The implicit parameters to a constructor are not considered by overload
4654 resolution, and must be of the proper type. */
4655 if (DECL_CONSTRUCTOR_P (fn
))
4657 converted_args
= tree_cons (NULL_TREE
, TREE_VALUE (arg
), converted_args
);
4658 arg
= TREE_CHAIN (arg
);
4659 parm
= TREE_CHAIN (parm
);
4660 /* We should never try to call the abstract constructor. */
4661 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
4663 if (DECL_HAS_VTT_PARM_P (fn
))
4665 converted_args
= tree_cons
4666 (NULL_TREE
, TREE_VALUE (arg
), converted_args
);
4667 arg
= TREE_CHAIN (arg
);
4668 parm
= TREE_CHAIN (parm
);
4671 /* Bypass access control for 'this' parameter. */
4672 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
4674 tree parmtype
= TREE_VALUE (parm
);
4675 tree argtype
= TREE_TYPE (TREE_VALUE (arg
));
4679 if (convs
[i
]->bad_p
)
4680 pedwarn ("passing %qT as %<this%> argument of %q#D discards qualifiers",
4681 TREE_TYPE (argtype
), fn
);
4683 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
4684 X is called for an object that is not of type X, or of a type
4685 derived from X, the behavior is undefined.
4687 So we can assume that anything passed as 'this' is non-null, and
4688 optimize accordingly. */
4689 gcc_assert (TREE_CODE (parmtype
) == POINTER_TYPE
);
4690 /* Convert to the base in which the function was declared. */
4691 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
4692 converted_arg
= build_base_path (PLUS_EXPR
,
4694 cand
->conversion_path
,
4696 /* Check that the base class is accessible. */
4697 if (!accessible_base_p (TREE_TYPE (argtype
),
4698 BINFO_TYPE (cand
->conversion_path
), true))
4699 error ("%qT is not an accessible base of %qT",
4700 BINFO_TYPE (cand
->conversion_path
),
4701 TREE_TYPE (argtype
));
4702 /* If fn was found by a using declaration, the conversion path
4703 will be to the derived class, not the base declaring fn. We
4704 must convert from derived to base. */
4705 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
4706 TREE_TYPE (parmtype
), ba_unique
, NULL
);
4707 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
4710 converted_args
= tree_cons (NULL_TREE
, converted_arg
, converted_args
);
4711 parm
= TREE_CHAIN (parm
);
4712 arg
= TREE_CHAIN (arg
);
4718 parm
= TREE_CHAIN (parm
), arg
= TREE_CHAIN (arg
), ++i
)
4720 tree type
= TREE_VALUE (parm
);
4723 val
= convert_like_with_context
4724 (conv
, TREE_VALUE (arg
), fn
, i
- is_method
);
4726 val
= convert_for_arg_passing (type
, val
);
4727 converted_args
= tree_cons (NULL_TREE
, val
, converted_args
);
4730 /* Default arguments */
4731 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
4733 = tree_cons (NULL_TREE
,
4734 convert_default_arg (TREE_VALUE (parm
),
4735 TREE_PURPOSE (parm
),
4740 for (; arg
; arg
= TREE_CHAIN (arg
))
4742 tree a
= TREE_VALUE (arg
);
4743 if (magic_varargs_p (fn
))
4744 /* Do no conversions for magic varargs. */;
4746 a
= convert_arg_to_ellipsis (a
);
4747 converted_args
= tree_cons (NULL_TREE
, a
, converted_args
);
4750 converted_args
= nreverse (converted_args
);
4752 check_function_arguments (TYPE_ATTRIBUTES (TREE_TYPE (fn
)),
4755 /* Avoid actually calling copy constructors and copy assignment operators,
4758 if (! flag_elide_constructors
)
4759 /* Do things the hard way. */;
4760 else if (cand
->num_convs
== 1 && DECL_COPY_CONSTRUCTOR_P (fn
))
4763 arg
= skip_artificial_parms_for (fn
, converted_args
);
4764 arg
= TREE_VALUE (arg
);
4766 /* Pull out the real argument, disregarding const-correctness. */
4768 while (TREE_CODE (targ
) == NOP_EXPR
4769 || TREE_CODE (targ
) == NON_LVALUE_EXPR
4770 || TREE_CODE (targ
) == CONVERT_EXPR
)
4771 targ
= TREE_OPERAND (targ
, 0);
4772 if (TREE_CODE (targ
) == ADDR_EXPR
)
4774 targ
= TREE_OPERAND (targ
, 0);
4775 if (!same_type_ignoring_top_level_qualifiers_p
4776 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
4785 arg
= build_indirect_ref (arg
, 0);
4787 /* [class.copy]: the copy constructor is implicitly defined even if
4788 the implementation elided its use. */
4789 if (TYPE_HAS_COMPLEX_INIT_REF (DECL_CONTEXT (fn
)))
4792 /* If we're creating a temp and we already have one, don't create a
4793 new one. If we're not creating a temp but we get one, use
4794 INIT_EXPR to collapse the temp into our target. Otherwise, if the
4795 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
4796 temp or an INIT_EXPR otherwise. */
4797 if (integer_zerop (TREE_VALUE (args
)))
4799 if (TREE_CODE (arg
) == TARGET_EXPR
)
4801 else if (TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn
)))
4802 return build_target_expr_with_type (arg
, DECL_CONTEXT (fn
));
4804 else if (TREE_CODE (arg
) == TARGET_EXPR
4805 || TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn
)))
4807 tree to
= stabilize_reference
4808 (build_indirect_ref (TREE_VALUE (args
), 0));
4810 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
4814 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
4816 && TYPE_HAS_TRIVIAL_ASSIGN_REF (DECL_CONTEXT (fn
)))
4818 tree to
= stabilize_reference
4819 (build_indirect_ref (TREE_VALUE (converted_args
), 0));
4820 tree type
= TREE_TYPE (to
);
4821 tree as_base
= CLASSTYPE_AS_BASE (type
);
4823 arg
= TREE_VALUE (TREE_CHAIN (converted_args
));
4824 if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
4826 arg
= build_indirect_ref (arg
, 0);
4827 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
4831 /* We must only copy the non-tail padding parts.
4832 Use __builtin_memcpy for the bitwise copy. */
4836 args
= tree_cons (NULL
, TYPE_SIZE_UNIT (as_base
), NULL
);
4837 args
= tree_cons (NULL
, arg
, args
);
4838 t
= build_unary_op (ADDR_EXPR
, to
, 0);
4839 args
= tree_cons (NULL
, t
, args
);
4840 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
4841 t
= build_call (t
, args
);
4843 t
= convert (TREE_TYPE (TREE_VALUE (args
)), t
);
4844 val
= build_indirect_ref (t
, 0);
4852 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
4854 tree t
, *p
= &TREE_VALUE (converted_args
);
4855 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (*p
)),
4858 gcc_assert (binfo
&& binfo
!= error_mark_node
);
4860 *p
= build_base_path (PLUS_EXPR
, *p
, binfo
, 1);
4861 if (TREE_SIDE_EFFECTS (*p
))
4862 *p
= save_expr (*p
);
4863 t
= build_pointer_type (TREE_TYPE (fn
));
4864 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
4865 fn
= build_java_interface_fn_ref (fn
, *p
);
4867 fn
= build_vfn_ref (*p
, DECL_VINDEX (fn
));
4870 else if (DECL_INLINE (fn
))
4871 fn
= inline_conversion (fn
);
4873 fn
= build_addr_func (fn
);
4875 return build_cxx_call (fn
, converted_args
);
4878 /* Build and return a call to FN, using ARGS. This function performs
4879 no overload resolution, conversion, or other high-level
4883 build_cxx_call (tree fn
, tree args
)
4887 fn
= build_call (fn
, args
);
4889 /* If this call might throw an exception, note that fact. */
4890 fndecl
= get_callee_fndecl (fn
);
4891 if ((!fndecl
|| !TREE_NOTHROW (fndecl
))
4892 && at_function_scope_p ()
4894 cp_function_chain
->can_throw
= 1;
4896 /* Some built-in function calls will be evaluated at compile-time in
4898 fn
= fold_if_not_in_template (fn
);
4900 if (VOID_TYPE_P (TREE_TYPE (fn
)))
4903 fn
= require_complete_type (fn
);
4904 if (fn
== error_mark_node
)
4905 return error_mark_node
;
4907 if (IS_AGGR_TYPE (TREE_TYPE (fn
)))
4908 fn
= build_cplus_new (TREE_TYPE (fn
), fn
);
4909 return convert_from_reference (fn
);
4912 static GTY(()) tree java_iface_lookup_fn
;
4914 /* Make an expression which yields the address of the Java interface
4915 method FN. This is achieved by generating a call to libjava's
4916 _Jv_LookupInterfaceMethodIdx(). */
4919 build_java_interface_fn_ref (tree fn
, tree instance
)
4921 tree lookup_args
, lookup_fn
, method
, idx
;
4922 tree klass_ref
, iface
, iface_ref
;
4925 if (!java_iface_lookup_fn
)
4927 tree endlink
= build_void_list_node ();
4928 tree t
= tree_cons (NULL_TREE
, ptr_type_node
,
4929 tree_cons (NULL_TREE
, ptr_type_node
,
4930 tree_cons (NULL_TREE
, java_int_type_node
,
4932 java_iface_lookup_fn
4933 = builtin_function ("_Jv_LookupInterfaceMethodIdx",
4934 build_function_type (ptr_type_node
, t
),
4935 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
4938 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
4939 This is the first entry in the vtable. */
4940 klass_ref
= build_vtbl_ref (build_indirect_ref (instance
, 0),
4943 /* Get the java.lang.Class pointer for the interface being called. */
4944 iface
= DECL_CONTEXT (fn
);
4945 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
4946 if (!iface_ref
|| TREE_CODE (iface_ref
) != VAR_DECL
4947 || DECL_CONTEXT (iface_ref
) != iface
)
4949 error ("could not find class$ field in java interface type %qT",
4951 return error_mark_node
;
4953 iface_ref
= build_address (iface_ref
);
4954 iface_ref
= convert (build_pointer_type (iface
), iface_ref
);
4956 /* Determine the itable index of FN. */
4958 for (method
= TYPE_METHODS (iface
); method
; method
= TREE_CHAIN (method
))
4960 if (!DECL_VIRTUAL_P (method
))
4966 idx
= build_int_cst (NULL_TREE
, i
);
4968 lookup_args
= tree_cons (NULL_TREE
, klass_ref
,
4969 tree_cons (NULL_TREE
, iface_ref
,
4970 build_tree_list (NULL_TREE
, idx
)));
4971 lookup_fn
= build1 (ADDR_EXPR
,
4972 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
4973 java_iface_lookup_fn
);
4974 return build3 (CALL_EXPR
, ptr_type_node
, lookup_fn
, lookup_args
, NULL_TREE
);
4977 /* Returns the value to use for the in-charge parameter when making a
4978 call to a function with the indicated NAME.
4980 FIXME:Can't we find a neater way to do this mapping? */
4983 in_charge_arg_for_name (tree name
)
4985 if (name
== base_ctor_identifier
4986 || name
== base_dtor_identifier
)
4987 return integer_zero_node
;
4988 else if (name
== complete_ctor_identifier
)
4989 return integer_one_node
;
4990 else if (name
== complete_dtor_identifier
)
4991 return integer_two_node
;
4992 else if (name
== deleting_dtor_identifier
)
4993 return integer_three_node
;
4995 /* This function should only be called with one of the names listed
5001 /* Build a call to a constructor, destructor, or an assignment
5002 operator for INSTANCE, an expression with class type. NAME
5003 indicates the special member function to call; ARGS are the
5004 arguments. BINFO indicates the base of INSTANCE that is to be
5005 passed as the `this' parameter to the member function called.
5007 FLAGS are the LOOKUP_* flags to use when processing the call.
5009 If NAME indicates a complete object constructor, INSTANCE may be
5010 NULL_TREE. In this case, the caller will call build_cplus_new to
5011 store the newly constructed object into a VAR_DECL. */
5014 build_special_member_call (tree instance
, tree name
, tree args
,
5015 tree binfo
, int flags
)
5018 /* The type of the subobject to be constructed or destroyed. */
5021 gcc_assert (name
== complete_ctor_identifier
5022 || name
== base_ctor_identifier
5023 || name
== complete_dtor_identifier
5024 || name
== base_dtor_identifier
5025 || name
== deleting_dtor_identifier
5026 || name
== ansi_assopname (NOP_EXPR
));
5029 /* Resolve the name. */
5030 if (!complete_type_or_else (binfo
, NULL_TREE
))
5031 return error_mark_node
;
5033 binfo
= TYPE_BINFO (binfo
);
5036 gcc_assert (binfo
!= NULL_TREE
);
5038 class_type
= BINFO_TYPE (binfo
);
5040 /* Handle the special case where INSTANCE is NULL_TREE. */
5041 if (name
== complete_ctor_identifier
&& !instance
)
5043 instance
= build_int_cst (build_pointer_type (class_type
), 0);
5044 instance
= build1 (INDIRECT_REF
, class_type
, instance
);
5048 if (name
== complete_dtor_identifier
5049 || name
== base_dtor_identifier
5050 || name
== deleting_dtor_identifier
)
5051 gcc_assert (args
== NULL_TREE
);
5053 /* Convert to the base class, if necessary. */
5054 if (!same_type_ignoring_top_level_qualifiers_p
5055 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
5057 if (name
!= ansi_assopname (NOP_EXPR
))
5058 /* For constructors and destructors, either the base is
5059 non-virtual, or it is virtual but we are doing the
5060 conversion from a constructor or destructor for the
5061 complete object. In either case, we can convert
5063 instance
= convert_to_base_statically (instance
, binfo
);
5065 /* However, for assignment operators, we must convert
5066 dynamically if the base is virtual. */
5067 instance
= build_base_path (PLUS_EXPR
, instance
,
5068 binfo
, /*nonnull=*/1);
5072 gcc_assert (instance
!= NULL_TREE
);
5074 fns
= lookup_fnfields (binfo
, name
, 1);
5076 /* When making a call to a constructor or destructor for a subobject
5077 that uses virtual base classes, pass down a pointer to a VTT for
5079 if ((name
== base_ctor_identifier
5080 || name
== base_dtor_identifier
)
5081 && CLASSTYPE_VBASECLASSES (class_type
))
5086 /* If the current function is a complete object constructor
5087 or destructor, then we fetch the VTT directly.
5088 Otherwise, we look it up using the VTT we were given. */
5089 vtt
= TREE_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
5090 vtt
= decay_conversion (vtt
);
5091 vtt
= build3 (COND_EXPR
, TREE_TYPE (vtt
),
5092 build2 (EQ_EXPR
, boolean_type_node
,
5093 current_in_charge_parm
, integer_zero_node
),
5096 gcc_assert (BINFO_SUBVTT_INDEX (binfo
));
5097 sub_vtt
= build2 (PLUS_EXPR
, TREE_TYPE (vtt
), vtt
,
5098 BINFO_SUBVTT_INDEX (binfo
));
5100 args
= tree_cons (NULL_TREE
, sub_vtt
, args
);
5103 return build_new_method_call (instance
, fns
, args
,
5104 TYPE_BINFO (BINFO_TYPE (binfo
)),
5108 /* Return the NAME, as a C string. The NAME indicates a function that
5109 is a member of TYPE. *FREE_P is set to true if the caller must
5110 free the memory returned.
5112 Rather than go through all of this, we should simply set the names
5113 of constructors and destructors appropriately, and dispense with
5114 ctor_identifier, dtor_identifier, etc. */
5117 name_as_c_string (tree name
, tree type
, bool *free_p
)
5121 /* Assume that we will not allocate memory. */
5123 /* Constructors and destructors are special. */
5124 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
5127 = (char *) IDENTIFIER_POINTER (constructor_name (type
));
5128 /* For a destructor, add the '~'. */
5129 if (name
== complete_dtor_identifier
5130 || name
== base_dtor_identifier
5131 || name
== deleting_dtor_identifier
)
5133 pretty_name
= concat ("~", pretty_name
, NULL
);
5134 /* Remember that we need to free the memory allocated. */
5138 else if (IDENTIFIER_TYPENAME_P (name
))
5140 pretty_name
= concat ("operator ",
5141 type_as_string (TREE_TYPE (name
),
5142 TFF_PLAIN_IDENTIFIER
),
5144 /* Remember that we need to free the memory allocated. */
5148 pretty_name
= (char *) IDENTIFIER_POINTER (name
);
5153 /* Build a call to "INSTANCE.FN (ARGS)". */
5156 build_new_method_call (tree instance
, tree fns
, tree args
,
5157 tree conversion_path
, int flags
)
5159 struct z_candidate
*candidates
= 0, *cand
;
5160 tree explicit_targs
= NULL_TREE
;
5161 tree basetype
= NULL_TREE
;
5164 tree mem_args
= NULL_TREE
, instance_ptr
;
5170 int template_only
= 0;
5177 gcc_assert (instance
!= NULL_TREE
);
5179 if (error_operand_p (instance
)
5180 || error_operand_p (fns
)
5181 || args
== error_mark_node
)
5182 return error_mark_node
;
5184 orig_instance
= instance
;
5188 if (processing_template_decl
)
5190 instance
= build_non_dependent_expr (instance
);
5191 if (!BASELINK_P (fns
)
5192 && TREE_CODE (fns
) != PSEUDO_DTOR_EXPR
5193 && TREE_TYPE (fns
) != unknown_type_node
)
5194 fns
= build_non_dependent_expr (fns
);
5195 args
= build_non_dependent_args (orig_args
);
5198 /* Process the argument list. */
5200 args
= resolve_args (args
);
5201 if (args
== error_mark_node
)
5202 return error_mark_node
;
5204 if (TREE_CODE (TREE_TYPE (instance
)) == REFERENCE_TYPE
)
5205 instance
= convert_from_reference (instance
);
5206 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
5207 instance_ptr
= build_this (instance
);
5209 if (!BASELINK_P (fns
))
5211 error ("call to non-function %qD", fns
);
5212 return error_mark_node
;
5215 if (!conversion_path
)
5216 conversion_path
= BASELINK_BINFO (fns
);
5217 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
5218 optype
= BASELINK_OPTYPE (fns
);
5219 fns
= BASELINK_FUNCTIONS (fns
);
5221 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
5223 explicit_targs
= TREE_OPERAND (fns
, 1);
5224 fns
= TREE_OPERAND (fns
, 0);
5228 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
5229 || TREE_CODE (fns
) == TEMPLATE_DECL
5230 || TREE_CODE (fns
) == OVERLOAD
);
5232 /* XXX this should be handled before we get here. */
5233 if (! IS_AGGR_TYPE (basetype
))
5235 if ((flags
& LOOKUP_COMPLAIN
) && basetype
!= error_mark_node
)
5236 error ("request for member %qD in %qE, which is of non-aggregate "
5238 fns
, instance
, basetype
);
5240 return error_mark_node
;
5243 fn
= get_first_fn (fns
);
5244 name
= DECL_NAME (fn
);
5246 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
5248 /* Callers should explicitly indicate whether they want to construct
5249 the complete object or just the part without virtual bases. */
5250 gcc_assert (name
!= ctor_identifier
);
5251 /* Similarly for destructors. */
5252 gcc_assert (name
!= dtor_identifier
);
5255 /* It's OK to call destructors on cv-qualified objects. Therefore,
5256 convert the INSTANCE_PTR to the unqualified type, if necessary. */
5257 if (DECL_DESTRUCTOR_P (fn
))
5259 tree type
= build_pointer_type (basetype
);
5260 if (!same_type_p (type
, TREE_TYPE (instance_ptr
)))
5261 instance_ptr
= build_nop (type
, instance_ptr
);
5264 class_type
= (conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
);
5265 mem_args
= tree_cons (NULL_TREE
, instance_ptr
, args
);
5267 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5268 p
= conversion_obstack_alloc (0);
5270 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
5272 tree t
= OVL_CURRENT (fn
);
5275 /* We can end up here for copy-init of same or base class. */
5276 if ((flags
& LOOKUP_ONLYCONVERTING
)
5277 && DECL_NONCONVERTING_P (t
))
5280 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (t
))
5281 this_arglist
= mem_args
;
5283 this_arglist
= args
;
5285 if (TREE_CODE (t
) == TEMPLATE_DECL
)
5286 /* A member template. */
5287 add_template_candidate (&candidates
, t
,
5290 this_arglist
, optype
,
5295 else if (! template_only
)
5296 add_function_candidate (&candidates
, t
,
5304 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
5307 if (!COMPLETE_TYPE_P (basetype
))
5308 cxx_incomplete_type_error (instance_ptr
, basetype
);
5314 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
5315 error ("no matching function for call to %<%T::%s(%A)%#V%>",
5316 basetype
, pretty_name
, user_args
,
5317 TREE_TYPE (TREE_TYPE (instance_ptr
)));
5321 print_z_candidates (candidates
);
5322 call
= error_mark_node
;
5326 cand
= tourney (candidates
);
5332 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
5333 error ("call of overloaded %<%s(%A)%> is ambiguous", pretty_name
,
5335 print_z_candidates (candidates
);
5338 call
= error_mark_node
;
5342 if (!(flags
& LOOKUP_NONVIRTUAL
)
5343 && DECL_PURE_VIRTUAL_P (cand
->fn
)
5344 && instance
== current_class_ref
5345 && (DECL_CONSTRUCTOR_P (current_function_decl
)
5346 || DECL_DESTRUCTOR_P (current_function_decl
)))
5347 /* This is not an error, it is runtime undefined
5349 warning ((DECL_CONSTRUCTOR_P (current_function_decl
) ?
5350 "abstract virtual %q#D called from constructor"
5351 : "abstract virtual %q#D called from destructor"),
5354 if (TREE_CODE (TREE_TYPE (cand
->fn
)) == METHOD_TYPE
5355 && is_dummy_object (instance_ptr
))
5357 error ("cannot call member function %qD without object",
5359 call
= error_mark_node
;
5363 if (DECL_VINDEX (cand
->fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
5364 && resolves_to_fixed_type_p (instance
, 0))
5365 flags
|= LOOKUP_NONVIRTUAL
;
5367 call
= build_over_call (cand
, flags
);
5369 /* In an expression of the form `a->f()' where `f' turns
5370 out to be a static member function, `a' is
5371 none-the-less evaluated. */
5372 if (TREE_CODE (TREE_TYPE (cand
->fn
)) != METHOD_TYPE
5373 && !is_dummy_object (instance_ptr
)
5374 && TREE_SIDE_EFFECTS (instance
))
5375 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
5381 if (processing_template_decl
&& call
!= error_mark_node
)
5382 call
= (build_min_non_dep
5384 build_min_nt (COMPONENT_REF
, orig_instance
, orig_fns
, NULL_TREE
),
5385 orig_args
, NULL_TREE
));
5387 /* Free all the conversions we allocated. */
5388 obstack_free (&conversion_obstack
, p
);
5393 /* Returns true iff standard conversion sequence ICS1 is a proper
5394 subsequence of ICS2. */
5397 is_subseq (conversion
*ics1
, conversion
*ics2
)
5399 /* We can assume that a conversion of the same code
5400 between the same types indicates a subsequence since we only get
5401 here if the types we are converting from are the same. */
5403 while (ics1
->kind
== ck_rvalue
5404 || ics1
->kind
== ck_lvalue
)
5405 ics1
= ics1
->u
.next
;
5409 while (ics2
->kind
== ck_rvalue
5410 || ics2
->kind
== ck_lvalue
)
5411 ics2
= ics2
->u
.next
;
5413 if (ics2
->kind
== ck_user
5414 || ics2
->kind
== ck_ambig
5415 || ics2
->kind
== ck_identity
)
5416 /* At this point, ICS1 cannot be a proper subsequence of
5417 ICS2. We can get a USER_CONV when we are comparing the
5418 second standard conversion sequence of two user conversion
5422 ics2
= ics2
->u
.next
;
5424 if (ics2
->kind
== ics1
->kind
5425 && same_type_p (ics2
->type
, ics1
->type
)
5426 && same_type_p (ics2
->u
.next
->type
,
5427 ics1
->u
.next
->type
))
5432 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
5433 be any _TYPE nodes. */
5436 is_properly_derived_from (tree derived
, tree base
)
5438 if (!IS_AGGR_TYPE_CODE (TREE_CODE (derived
))
5439 || !IS_AGGR_TYPE_CODE (TREE_CODE (base
)))
5442 /* We only allow proper derivation here. The DERIVED_FROM_P macro
5443 considers every class derived from itself. */
5444 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
5445 && DERIVED_FROM_P (base
, derived
));
5448 /* We build the ICS for an implicit object parameter as a pointer
5449 conversion sequence. However, such a sequence should be compared
5450 as if it were a reference conversion sequence. If ICS is the
5451 implicit conversion sequence for an implicit object parameter,
5452 modify it accordingly. */
5455 maybe_handle_implicit_object (conversion
**ics
)
5459 /* [over.match.funcs]
5461 For non-static member functions, the type of the
5462 implicit object parameter is "reference to cv X"
5463 where X is the class of which the function is a
5464 member and cv is the cv-qualification on the member
5465 function declaration. */
5466 conversion
*t
= *ics
;
5467 tree reference_type
;
5469 /* The `this' parameter is a pointer to a class type. Make the
5470 implicit conversion talk about a reference to that same class
5472 reference_type
= TREE_TYPE (t
->type
);
5473 reference_type
= build_reference_type (reference_type
);
5475 if (t
->kind
== ck_qual
)
5477 if (t
->kind
== ck_ptr
)
5479 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
5480 t
= direct_reference_binding (reference_type
, t
);
5485 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
5486 and return the type to which the reference refers. Otherwise,
5487 leave *ICS unchanged and return NULL_TREE. */
5490 maybe_handle_ref_bind (conversion
**ics
)
5492 if ((*ics
)->kind
== ck_ref_bind
)
5494 conversion
*old_ics
= *ics
;
5495 tree type
= TREE_TYPE (old_ics
->type
);
5496 *ics
= old_ics
->u
.next
;
5497 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
5498 (*ics
)->bad_p
= old_ics
->bad_p
;
5505 /* Compare two implicit conversion sequences according to the rules set out in
5506 [over.ics.rank]. Return values:
5508 1: ics1 is better than ics2
5509 -1: ics2 is better than ics1
5510 0: ics1 and ics2 are indistinguishable */
5513 compare_ics (conversion
*ics1
, conversion
*ics2
)
5519 tree deref_from_type1
= NULL_TREE
;
5520 tree deref_from_type2
= NULL_TREE
;
5521 tree deref_to_type1
= NULL_TREE
;
5522 tree deref_to_type2
= NULL_TREE
;
5523 conversion_rank rank1
, rank2
;
5525 /* REF_BINDING is nonzero if the result of the conversion sequence
5526 is a reference type. In that case TARGET_TYPE is the
5527 type referred to by the reference. */
5531 /* Handle implicit object parameters. */
5532 maybe_handle_implicit_object (&ics1
);
5533 maybe_handle_implicit_object (&ics2
);
5535 /* Handle reference parameters. */
5536 target_type1
= maybe_handle_ref_bind (&ics1
);
5537 target_type2
= maybe_handle_ref_bind (&ics2
);
5541 When comparing the basic forms of implicit conversion sequences (as
5542 defined in _over.best.ics_)
5544 --a standard conversion sequence (_over.ics.scs_) is a better
5545 conversion sequence than a user-defined conversion sequence
5546 or an ellipsis conversion sequence, and
5548 --a user-defined conversion sequence (_over.ics.user_) is a
5549 better conversion sequence than an ellipsis conversion sequence
5550 (_over.ics.ellipsis_). */
5551 rank1
= CONVERSION_RANK (ics1
);
5552 rank2
= CONVERSION_RANK (ics2
);
5556 else if (rank1
< rank2
)
5559 if (rank1
== cr_bad
)
5561 /* XXX Isn't this an extension? */
5562 /* Both ICS are bad. We try to make a decision based on what
5563 would have happened if they'd been good. */
5564 if (ics1
->user_conv_p
> ics2
->user_conv_p
5565 || ics1
->rank
> ics2
->rank
)
5567 else if (ics1
->user_conv_p
< ics2
->user_conv_p
5568 || ics1
->rank
< ics2
->rank
)
5571 /* We couldn't make up our minds; try to figure it out below. */
5574 if (ics1
->ellipsis_p
)
5575 /* Both conversions are ellipsis conversions. */
5578 /* User-defined conversion sequence U1 is a better conversion sequence
5579 than another user-defined conversion sequence U2 if they contain the
5580 same user-defined conversion operator or constructor and if the sec-
5581 ond standard conversion sequence of U1 is better than the second
5582 standard conversion sequence of U2. */
5584 if (ics1
->user_conv_p
)
5589 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= t1
->u
.next
)
5590 if (t1
->kind
== ck_ambig
)
5592 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= t2
->u
.next
)
5593 if (t2
->kind
== ck_ambig
)
5596 if (t1
->cand
->fn
!= t2
->cand
->fn
)
5599 /* We can just fall through here, after setting up
5600 FROM_TYPE1 and FROM_TYPE2. */
5601 from_type1
= t1
->type
;
5602 from_type2
= t2
->type
;
5609 /* We're dealing with two standard conversion sequences.
5613 Standard conversion sequence S1 is a better conversion
5614 sequence than standard conversion sequence S2 if
5616 --S1 is a proper subsequence of S2 (comparing the conversion
5617 sequences in the canonical form defined by _over.ics.scs_,
5618 excluding any Lvalue Transformation; the identity
5619 conversion sequence is considered to be a subsequence of
5620 any non-identity conversion sequence */
5623 while (t1
->kind
!= ck_identity
)
5625 from_type1
= t1
->type
;
5628 while (t2
->kind
!= ck_identity
)
5630 from_type2
= t2
->type
;
5633 if (same_type_p (from_type1
, from_type2
))
5635 if (is_subseq (ics1
, ics2
))
5637 if (is_subseq (ics2
, ics1
))
5640 /* Otherwise, one sequence cannot be a subsequence of the other; they
5641 don't start with the same type. This can happen when comparing the
5642 second standard conversion sequence in two user-defined conversion
5649 --the rank of S1 is better than the rank of S2 (by the rules
5652 Standard conversion sequences are ordered by their ranks: an Exact
5653 Match is a better conversion than a Promotion, which is a better
5654 conversion than a Conversion.
5656 Two conversion sequences with the same rank are indistinguishable
5657 unless one of the following rules applies:
5659 --A conversion that is not a conversion of a pointer, or pointer
5660 to member, to bool is better than another conversion that is such
5663 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
5664 so that we do not have to check it explicitly. */
5665 if (ics1
->rank
< ics2
->rank
)
5667 else if (ics2
->rank
< ics1
->rank
)
5670 to_type1
= ics1
->type
;
5671 to_type2
= ics2
->type
;
5673 if (TYPE_PTR_P (from_type1
)
5674 && TYPE_PTR_P (from_type2
)
5675 && TYPE_PTR_P (to_type1
)
5676 && TYPE_PTR_P (to_type2
))
5678 deref_from_type1
= TREE_TYPE (from_type1
);
5679 deref_from_type2
= TREE_TYPE (from_type2
);
5680 deref_to_type1
= TREE_TYPE (to_type1
);
5681 deref_to_type2
= TREE_TYPE (to_type2
);
5683 /* The rules for pointers to members A::* are just like the rules
5684 for pointers A*, except opposite: if B is derived from A then
5685 A::* converts to B::*, not vice versa. For that reason, we
5686 switch the from_ and to_ variables here. */
5687 else if ((TYPE_PTRMEM_P (from_type1
) && TYPE_PTRMEM_P (from_type2
)
5688 && TYPE_PTRMEM_P (to_type1
) && TYPE_PTRMEM_P (to_type2
))
5689 || (TYPE_PTRMEMFUNC_P (from_type1
)
5690 && TYPE_PTRMEMFUNC_P (from_type2
)
5691 && TYPE_PTRMEMFUNC_P (to_type1
)
5692 && TYPE_PTRMEMFUNC_P (to_type2
)))
5694 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
5695 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
5696 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
5697 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
5700 if (deref_from_type1
!= NULL_TREE
5701 && IS_AGGR_TYPE_CODE (TREE_CODE (deref_from_type1
))
5702 && IS_AGGR_TYPE_CODE (TREE_CODE (deref_from_type2
)))
5704 /* This was one of the pointer or pointer-like conversions.
5708 --If class B is derived directly or indirectly from class A,
5709 conversion of B* to A* is better than conversion of B* to
5710 void*, and conversion of A* to void* is better than
5711 conversion of B* to void*. */
5712 if (TREE_CODE (deref_to_type1
) == VOID_TYPE
5713 && TREE_CODE (deref_to_type2
) == VOID_TYPE
)
5715 if (is_properly_derived_from (deref_from_type1
,
5718 else if (is_properly_derived_from (deref_from_type2
,
5722 else if (TREE_CODE (deref_to_type1
) == VOID_TYPE
5723 || TREE_CODE (deref_to_type2
) == VOID_TYPE
)
5725 if (same_type_p (deref_from_type1
, deref_from_type2
))
5727 if (TREE_CODE (deref_to_type2
) == VOID_TYPE
)
5729 if (is_properly_derived_from (deref_from_type1
,
5733 /* We know that DEREF_TO_TYPE1 is `void' here. */
5734 else if (is_properly_derived_from (deref_from_type1
,
5739 else if (IS_AGGR_TYPE_CODE (TREE_CODE (deref_to_type1
))
5740 && IS_AGGR_TYPE_CODE (TREE_CODE (deref_to_type2
)))
5744 --If class B is derived directly or indirectly from class A
5745 and class C is derived directly or indirectly from B,
5747 --conversion of C* to B* is better than conversion of C* to
5750 --conversion of B* to A* is better than conversion of C* to
5752 if (same_type_p (deref_from_type1
, deref_from_type2
))
5754 if (is_properly_derived_from (deref_to_type1
,
5757 else if (is_properly_derived_from (deref_to_type2
,
5761 else if (same_type_p (deref_to_type1
, deref_to_type2
))
5763 if (is_properly_derived_from (deref_from_type2
,
5766 else if (is_properly_derived_from (deref_from_type1
,
5772 else if (CLASS_TYPE_P (non_reference (from_type1
))
5773 && same_type_p (from_type1
, from_type2
))
5775 tree from
= non_reference (from_type1
);
5779 --binding of an expression of type C to a reference of type
5780 B& is better than binding an expression of type C to a
5781 reference of type A&
5783 --conversion of C to B is better than conversion of C to A, */
5784 if (is_properly_derived_from (from
, to_type1
)
5785 && is_properly_derived_from (from
, to_type2
))
5787 if (is_properly_derived_from (to_type1
, to_type2
))
5789 else if (is_properly_derived_from (to_type2
, to_type1
))
5793 else if (CLASS_TYPE_P (non_reference (to_type1
))
5794 && same_type_p (to_type1
, to_type2
))
5796 tree to
= non_reference (to_type1
);
5800 --binding of an expression of type B to a reference of type
5801 A& is better than binding an expression of type C to a
5802 reference of type A&,
5804 --conversion of B to A is better than conversion of C to A */
5805 if (is_properly_derived_from (from_type1
, to
)
5806 && is_properly_derived_from (from_type2
, to
))
5808 if (is_properly_derived_from (from_type2
, from_type1
))
5810 else if (is_properly_derived_from (from_type1
, from_type2
))
5817 --S1 and S2 differ only in their qualification conversion and yield
5818 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
5819 qualification signature of type T1 is a proper subset of the cv-
5820 qualification signature of type T2 */
5821 if (ics1
->kind
== ck_qual
5822 && ics2
->kind
== ck_qual
5823 && same_type_p (from_type1
, from_type2
))
5824 return comp_cv_qual_signature (to_type1
, to_type2
);
5828 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
5829 types to which the references refer are the same type except for
5830 top-level cv-qualifiers, and the type to which the reference
5831 initialized by S2 refers is more cv-qualified than the type to
5832 which the reference initialized by S1 refers */
5834 if (target_type1
&& target_type2
5835 && same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
5836 return comp_cv_qualification (target_type2
, target_type1
);
5838 /* Neither conversion sequence is better than the other. */
5842 /* The source type for this standard conversion sequence. */
5845 source_type (conversion
*t
)
5847 for (;; t
= t
->u
.next
)
5849 if (t
->kind
== ck_user
5850 || t
->kind
== ck_ambig
5851 || t
->kind
== ck_identity
)
5857 /* Note a warning about preferring WINNER to LOSER. We do this by storing
5858 a pointer to LOSER and re-running joust to produce the warning if WINNER
5859 is actually used. */
5862 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
5864 candidate_warning
*cw
;
5866 cw
= conversion_obstack_alloc (sizeof (candidate_warning
));
5868 cw
->next
= winner
->warnings
;
5869 winner
->warnings
= cw
;
5872 /* Compare two candidates for overloading as described in
5873 [over.match.best]. Return values:
5875 1: cand1 is better than cand2
5876 -1: cand2 is better than cand1
5877 0: cand1 and cand2 are indistinguishable */
5880 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
)
5883 int off1
= 0, off2
= 0;
5887 /* Candidates that involve bad conversions are always worse than those
5889 if (cand1
->viable
> cand2
->viable
)
5891 if (cand1
->viable
< cand2
->viable
)
5894 /* If we have two pseudo-candidates for conversions to the same type,
5895 or two candidates for the same function, arbitrarily pick one. */
5896 if (cand1
->fn
== cand2
->fn
5897 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
5900 /* a viable function F1
5901 is defined to be a better function than another viable function F2 if
5902 for all arguments i, ICSi(F1) is not a worse conversion sequence than
5903 ICSi(F2), and then */
5905 /* for some argument j, ICSj(F1) is a better conversion sequence than
5908 /* For comparing static and non-static member functions, we ignore
5909 the implicit object parameter of the non-static function. The
5910 standard says to pretend that the static function has an object
5911 parm, but that won't work with operator overloading. */
5912 len
= cand1
->num_convs
;
5913 if (len
!= cand2
->num_convs
)
5915 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
5916 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
5918 gcc_assert (static_1
!= static_2
);
5929 for (i
= 0; i
< len
; ++i
)
5931 conversion
*t1
= cand1
->convs
[i
+ off1
];
5932 conversion
*t2
= cand2
->convs
[i
+ off2
];
5933 int comp
= compare_ics (t1
, t2
);
5938 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
5939 == cr_std
+ cr_promotion
)
5940 && t1
->kind
== ck_std
5941 && t2
->kind
== ck_std
5942 && TREE_CODE (t1
->type
) == INTEGER_TYPE
5943 && TREE_CODE (t2
->type
) == INTEGER_TYPE
5944 && (TYPE_PRECISION (t1
->type
)
5945 == TYPE_PRECISION (t2
->type
))
5946 && (TYPE_UNSIGNED (t1
->u
.next
->type
)
5947 || (TREE_CODE (t1
->u
.next
->type
)
5950 tree type
= t1
->u
.next
->type
;
5952 struct z_candidate
*w
, *l
;
5954 type1
= t1
->type
, type2
= t2
->type
,
5955 w
= cand1
, l
= cand2
;
5957 type1
= t2
->type
, type2
= t1
->type
,
5958 w
= cand2
, l
= cand1
;
5962 warning ("passing %qT chooses %qT over %qT",
5963 type
, type1
, type2
);
5964 warning (" in call to %qD", w
->fn
);
5970 if (winner
&& comp
!= winner
)
5979 /* warn about confusing overload resolution for user-defined conversions,
5980 either between a constructor and a conversion op, or between two
5982 if (winner
&& warn_conversion
&& cand1
->second_conv
5983 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
5984 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
5986 struct z_candidate
*w
, *l
;
5987 bool give_warning
= false;
5990 w
= cand1
, l
= cand2
;
5992 w
= cand2
, l
= cand1
;
5994 /* We don't want to complain about `X::operator T1 ()'
5995 beating `X::operator T2 () const', when T2 is a no less
5996 cv-qualified version of T1. */
5997 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
5998 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
6000 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
6001 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
6003 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
6008 if (!comp_ptr_ttypes (t
, f
))
6009 give_warning
= true;
6012 give_warning
= true;
6018 tree source
= source_type (w
->convs
[0]);
6019 if (! DECL_CONSTRUCTOR_P (w
->fn
))
6020 source
= TREE_TYPE (source
);
6021 warning ("choosing %qD over %qD", w
->fn
, l
->fn
);
6022 warning (" for conversion from %qT to %qT",
6023 source
, w
->second_conv
->type
);
6024 warning (" because conversion sequence for the argument is better");
6034 F1 is a non-template function and F2 is a template function
6037 if (!cand1
->template_decl
&& cand2
->template_decl
)
6039 else if (cand1
->template_decl
&& !cand2
->template_decl
)
6043 F1 and F2 are template functions and the function template for F1 is
6044 more specialized than the template for F2 according to the partial
6047 if (cand1
->template_decl
&& cand2
->template_decl
)
6049 winner
= more_specialized
6050 (TI_TEMPLATE (cand1
->template_decl
),
6051 TI_TEMPLATE (cand2
->template_decl
),
6053 /* Tell the deduction code how many real function arguments
6054 we saw, not counting the implicit 'this' argument. But,
6055 add_function_candidate() suppresses the "this" argument
6058 [temp.func.order]: The presence of unused ellipsis and default
6059 arguments has no effect on the partial ordering of function
6062 - (DECL_NONSTATIC_MEMBER_FUNCTION_P (cand1
->fn
)
6063 - DECL_CONSTRUCTOR_P (cand1
->fn
)));
6069 the context is an initialization by user-defined conversion (see
6070 _dcl.init_ and _over.match.user_) and the standard conversion
6071 sequence from the return type of F1 to the destination type (i.e.,
6072 the type of the entity being initialized) is a better conversion
6073 sequence than the standard conversion sequence from the return type
6074 of F2 to the destination type. */
6076 if (cand1
->second_conv
)
6078 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
6083 /* Check whether we can discard a builtin candidate, either because we
6084 have two identical ones or matching builtin and non-builtin candidates.
6086 (Pedantically in the latter case the builtin which matched the user
6087 function should not be added to the overload set, but we spot it here.
6090 ... the builtin candidates include ...
6091 - do not have the same parameter type list as any non-template
6092 non-member candidate. */
6094 if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
6095 || TREE_CODE (cand2
->fn
) == IDENTIFIER_NODE
)
6097 for (i
= 0; i
< len
; ++i
)
6098 if (!same_type_p (cand1
->convs
[i
]->type
,
6099 cand2
->convs
[i
]->type
))
6101 if (i
== cand1
->num_convs
)
6103 if (cand1
->fn
== cand2
->fn
)
6104 /* Two built-in candidates; arbitrarily pick one. */
6106 else if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
)
6107 /* cand1 is built-in; prefer cand2. */
6110 /* cand2 is built-in; prefer cand1. */
6115 /* If the two functions are the same (this can happen with declarations
6116 in multiple scopes and arg-dependent lookup), arbitrarily choose one. */
6117 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
6118 && equal_functions (cand1
->fn
, cand2
->fn
))
6123 /* Extension: If the worst conversion for one candidate is worse than the
6124 worst conversion for the other, take the first. */
6127 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
6128 struct z_candidate
*w
= 0, *l
= 0;
6130 for (i
= 0; i
< len
; ++i
)
6132 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
6133 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
6134 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
6135 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
6138 winner
= 1, w
= cand1
, l
= cand2
;
6140 winner
= -1, w
= cand2
, l
= cand1
;
6146 ISO C++ says that these are ambiguous, even \
6147 though the worst conversion for the first is better than \
6148 the worst conversion for the second:");
6149 print_z_candidate (_("candidate 1:"), w
);
6150 print_z_candidate (_("candidate 2:"), l
);
6158 gcc_assert (!winner
);
6162 /* Given a list of candidates for overloading, find the best one, if any.
6163 This algorithm has a worst case of O(2n) (winner is last), and a best
6164 case of O(n/2) (totally ambiguous); much better than a sorting
6167 static struct z_candidate
*
6168 tourney (struct z_candidate
*candidates
)
6170 struct z_candidate
*champ
= candidates
, *challenger
;
6172 int champ_compared_to_predecessor
= 0;
6174 /* Walk through the list once, comparing each current champ to the next
6175 candidate, knocking out a candidate or two with each comparison. */
6177 for (challenger
= champ
->next
; challenger
; )
6179 fate
= joust (champ
, challenger
, 0);
6181 challenger
= challenger
->next
;
6186 champ
= challenger
->next
;
6189 champ_compared_to_predecessor
= 0;
6194 champ_compared_to_predecessor
= 1;
6197 challenger
= champ
->next
;
6201 /* Make sure the champ is better than all the candidates it hasn't yet
6202 been compared to. */
6204 for (challenger
= candidates
;
6206 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
6207 challenger
= challenger
->next
)
6209 fate
= joust (champ
, challenger
, 0);
6217 /* Returns nonzero if things of type FROM can be converted to TO. */
6220 can_convert (tree to
, tree from
)
6222 return can_convert_arg (to
, from
, NULL_TREE
);
6225 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
6228 can_convert_arg (tree to
, tree from
, tree arg
)
6234 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6235 p
= conversion_obstack_alloc (0);
6237 t
= implicit_conversion (to
, from
, arg
, LOOKUP_NORMAL
);
6238 ok_p
= (t
&& !t
->bad_p
);
6240 /* Free all the conversions we allocated. */
6241 obstack_free (&conversion_obstack
, p
);
6246 /* Like can_convert_arg, but allows dubious conversions as well. */
6249 can_convert_arg_bad (tree to
, tree from
, tree arg
)
6254 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6255 p
= conversion_obstack_alloc (0);
6256 /* Try to perform the conversion. */
6257 t
= implicit_conversion (to
, from
, arg
, LOOKUP_NORMAL
);
6258 /* Free all the conversions we allocated. */
6259 obstack_free (&conversion_obstack
, p
);
6264 /* Convert EXPR to TYPE. Return the converted expression.
6266 Note that we allow bad conversions here because by the time we get to
6267 this point we are committed to doing the conversion. If we end up
6268 doing a bad conversion, convert_like will complain. */
6271 perform_implicit_conversion (tree type
, tree expr
)
6276 if (error_operand_p (expr
))
6277 return error_mark_node
;
6279 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6280 p
= conversion_obstack_alloc (0);
6282 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
6286 error ("could not convert %qE to %qT", expr
, type
);
6287 expr
= error_mark_node
;
6290 expr
= convert_like (conv
, expr
);
6292 /* Free all the conversions we allocated. */
6293 obstack_free (&conversion_obstack
, p
);
6298 /* Convert EXPR to TYPE (as a direct-initialization) if that is
6299 permitted. If the conversion is valid, the converted expression is
6300 returned. Otherwise, NULL_TREE is returned, except in the case
6301 that TYPE is a class type; in that case, an error is issued. If
6302 C_CAST_P is true, then this direction initialization is taking
6303 place as part of a static_cast being attempted as part of a C-style
6307 perform_direct_initialization_if_possible (tree type
,
6314 if (type
== error_mark_node
|| error_operand_p (expr
))
6315 return error_mark_node
;
6318 If the destination type is a (possibly cv-qualified) class type:
6320 -- If the initialization is direct-initialization ...,
6321 constructors are considered. ... If no constructor applies, or
6322 the overload resolution is ambiguous, the initialization is
6324 if (CLASS_TYPE_P (type
))
6326 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6327 build_tree_list (NULL_TREE
, expr
),
6328 type
, LOOKUP_NORMAL
);
6329 return build_cplus_new (type
, expr
);
6332 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6333 p
= conversion_obstack_alloc (0);
6335 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
6337 if (!conv
|| conv
->bad_p
)
6340 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0, 0,
6341 /*issue_conversion_warnings=*/false,
6344 /* Free all the conversions we allocated. */
6345 obstack_free (&conversion_obstack
, p
);
6350 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
6351 is being bound to a temporary. Create and return a new VAR_DECL
6352 with the indicated TYPE; this variable will store the value to
6353 which the reference is bound. */
6356 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
6360 /* Create the variable. */
6361 var
= build_decl (VAR_DECL
, NULL_TREE
, type
);
6362 DECL_ARTIFICIAL (var
) = 1;
6363 TREE_USED (var
) = 1;
6365 /* Register the variable. */
6366 if (TREE_STATIC (decl
))
6368 /* Namespace-scope or local static; give it a mangled name. */
6371 TREE_STATIC (var
) = 1;
6372 name
= mangle_ref_init_variable (decl
);
6373 DECL_NAME (var
) = name
;
6374 SET_DECL_ASSEMBLER_NAME (var
, name
);
6375 var
= pushdecl_top_level (var
);
6379 /* Create a new cleanup level if necessary. */
6380 maybe_push_cleanup_level (type
);
6381 /* Don't push unnamed temps. Do set DECL_CONTEXT, though. */
6382 DECL_CONTEXT (var
) = current_function_decl
;
6388 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
6389 initializing a variable of that TYPE. If DECL is non-NULL, it is
6390 the VAR_DECL being initialized with the EXPR. (In that case, the
6391 type of DECL will be TYPE.) If DECL is non-NULL, then CLEANUP must
6392 also be non-NULL, and with *CLEANUP initialized to NULL. Upon
6393 return, if *CLEANUP is no longer NULL, it will be an expression
6394 that should be pushed as a cleanup after the returned expression
6395 is used to initialize DECL.
6397 Return the converted expression. */
6400 initialize_reference (tree type
, tree expr
, tree decl
, tree
*cleanup
)
6405 if (type
== error_mark_node
|| error_operand_p (expr
))
6406 return error_mark_node
;
6408 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6409 p
= conversion_obstack_alloc (0);
6411 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, LOOKUP_NORMAL
);
6412 if (!conv
|| conv
->bad_p
)
6414 if (!(TYPE_QUALS (TREE_TYPE (type
)) & TYPE_QUAL_CONST
)
6415 && !real_lvalue_p (expr
))
6416 error ("invalid initialization of non-const reference of "
6417 "type %qT from a temporary of type %qT",
6418 type
, TREE_TYPE (expr
));
6420 error ("invalid initialization of reference of type "
6421 "%qT from expression of type %qT", type
,
6423 return error_mark_node
;
6426 /* If DECL is non-NULL, then this special rule applies:
6430 The temporary to which the reference is bound or the temporary
6431 that is the complete object to which the reference is bound
6432 persists for the lifetime of the reference.
6434 The temporaries created during the evaluation of the expression
6435 initializing the reference, except the temporary to which the
6436 reference is bound, are destroyed at the end of the
6437 full-expression in which they are created.
6439 In that case, we store the converted expression into a new
6440 VAR_DECL in a new scope.
6442 However, we want to be careful not to create temporaries when
6443 they are not required. For example, given:
6446 struct D : public B {};
6450 there is no need to copy the return value from "f"; we can just
6451 extend its lifetime. Similarly, given:
6454 struct T { operator S(); };
6458 we can extend the lifetime of the return value of the conversion
6460 gcc_assert (conv
->kind
== ck_ref_bind
);
6464 tree base_conv_type
;
6466 /* Skip over the REF_BIND. */
6467 conv
= conv
->u
.next
;
6468 /* If the next conversion is a BASE_CONV, skip that too -- but
6469 remember that the conversion was required. */
6470 if (conv
->kind
== ck_base
)
6472 if (conv
->check_copy_constructor_p
)
6473 check_constructor_callable (TREE_TYPE (expr
), expr
);
6474 base_conv_type
= conv
->type
;
6475 conv
= conv
->u
.next
;
6478 base_conv_type
= NULL_TREE
;
6479 /* Perform the remainder of the conversion. */
6480 expr
= convert_like_real (conv
, expr
,
6481 /*fn=*/NULL_TREE
, /*argnum=*/0,
6483 /*issue_conversion_warnings=*/true,
6484 /*c_cast_p=*/false);
6485 if (!real_lvalue_p (expr
))
6490 /* Create the temporary variable. */
6491 type
= TREE_TYPE (expr
);
6492 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
6493 layout_decl (var
, 0);
6494 /* If the rvalue is the result of a function call it will be
6495 a TARGET_EXPR. If it is some other construct (such as a
6496 member access expression where the underlying object is
6497 itself the result of a function call), turn it into a
6498 TARGET_EXPR here. It is important that EXPR be a
6499 TARGET_EXPR below since otherwise the INIT_EXPR will
6500 attempt to make a bitwise copy of EXPR to initialize
6502 if (TREE_CODE (expr
) != TARGET_EXPR
)
6503 expr
= get_target_expr (expr
);
6504 /* Create the INIT_EXPR that will initialize the temporary
6506 init
= build2 (INIT_EXPR
, type
, var
, expr
);
6507 if (at_function_scope_p ())
6509 add_decl_expr (var
);
6510 *cleanup
= cxx_maybe_build_cleanup (var
);
6512 /* We must be careful to destroy the temporary only
6513 after its initialization has taken place. If the
6514 initialization throws an exception, then the
6515 destructor should not be run. We cannot simply
6516 transform INIT into something like:
6518 (INIT, ({ CLEANUP_STMT; }))
6520 because emit_local_var always treats the
6521 initializer as a full-expression. Thus, the
6522 destructor would run too early; it would run at the
6523 end of initializing the reference variable, rather
6524 than at the end of the block enclosing the
6527 The solution is to pass back a cleanup expression
6528 which the caller is responsible for attaching to
6529 the statement tree. */
6533 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
6534 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
6535 static_aggregates
= tree_cons (NULL_TREE
, var
,
6538 /* Use its address to initialize the reference variable. */
6539 expr
= build_address (var
);
6541 expr
= convert_to_base (expr
,
6542 build_pointer_type (base_conv_type
),
6543 /*check_access=*/true,
6545 expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), init
, expr
);
6548 /* Take the address of EXPR. */
6549 expr
= build_unary_op (ADDR_EXPR
, expr
, 0);
6550 /* If a BASE_CONV was required, perform it now. */
6552 expr
= (perform_implicit_conversion
6553 (build_pointer_type (base_conv_type
), expr
));
6554 expr
= build_nop (type
, expr
);
6557 /* Perform the conversion. */
6558 expr
= convert_like (conv
, expr
);
6560 /* Free all the conversions we allocated. */
6561 obstack_free (&conversion_obstack
, p
);
6566 #include "gt-cp-call.h"