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, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com) and
6 modified by Brendan Kehoe (brendan@cygnus.com).
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3, or (at your option)
15 GCC is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
25 /* High-level class interface. */
29 #include "coretypes.h"
38 #include "diagnostic.h"
42 #include "langhooks.h"
44 /* The various kinds of conversion. */
46 typedef enum conversion_kind
{
62 /* The rank of the conversion. Order of the enumerals matters; better
63 conversions should come earlier in the list. */
65 typedef enum conversion_rank
{
76 /* An implicit conversion sequence, in the sense of [over.best.ics].
77 The first conversion to be performed is at the end of the chain.
78 That conversion is always a cr_identity conversion. */
80 typedef struct conversion conversion
;
82 /* The kind of conversion represented by this step. */
84 /* The rank of this conversion. */
86 BOOL_BITFIELD user_conv_p
: 1;
87 BOOL_BITFIELD ellipsis_p
: 1;
88 BOOL_BITFIELD this_p
: 1;
89 BOOL_BITFIELD bad_p
: 1;
90 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
91 temporary should be created to hold the result of the
93 BOOL_BITFIELD need_temporary_p
: 1;
94 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
95 from a pointer-to-derived to pointer-to-base is being performed. */
96 BOOL_BITFIELD base_p
: 1;
97 /* If KIND is ck_ref_bind, true when either an lvalue reference is
98 being bound to an lvalue expression or an rvalue reference is
99 being bound to an rvalue expression. */
100 BOOL_BITFIELD rvaluedness_matches_p
: 1;
101 BOOL_BITFIELD check_narrowing
: 1;
102 /* The type of the expression resulting from the conversion. */
105 /* The next conversion in the chain. Since the conversions are
106 arranged from outermost to innermost, the NEXT conversion will
107 actually be performed before this conversion. This variant is
108 used only when KIND is neither ck_identity nor ck_ambig. */
110 /* The expression at the beginning of the conversion chain. This
111 variant is used only if KIND is ck_identity or ck_ambig. */
113 /* The array of conversions for an initializer_list. */
116 /* The function candidate corresponding to this conversion
117 sequence. This field is only used if KIND is ck_user. */
118 struct z_candidate
*cand
;
121 #define CONVERSION_RANK(NODE) \
122 ((NODE)->bad_p ? cr_bad \
123 : (NODE)->ellipsis_p ? cr_ellipsis \
124 : (NODE)->user_conv_p ? cr_user \
127 static struct obstack conversion_obstack
;
128 static bool conversion_obstack_initialized
;
130 static struct z_candidate
* tourney (struct z_candidate
*);
131 static int equal_functions (tree
, tree
);
132 static int joust (struct z_candidate
*, struct z_candidate
*, bool);
133 static int compare_ics (conversion
*, conversion
*);
134 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
135 static tree
build_java_interface_fn_ref (tree
, tree
);
136 #define convert_like(CONV, EXPR, COMPLAIN) \
137 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
138 /*issue_conversion_warnings=*/true, \
139 /*c_cast_p=*/false, (COMPLAIN))
140 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
141 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
142 /*issue_conversion_warnings=*/true, \
143 /*c_cast_p=*/false, (COMPLAIN))
144 static tree
convert_like_real (conversion
*, tree
, tree
, int, int, bool,
145 bool, tsubst_flags_t
);
146 static void op_error (enum tree_code
, enum tree_code
, tree
, tree
,
148 static VEC(tree
,gc
) *resolve_args (VEC(tree
,gc
) *);
149 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int);
150 static void print_z_candidate (const char *, struct z_candidate
*);
151 static void print_z_candidates (struct z_candidate
*);
152 static tree
build_this (tree
);
153 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
154 static bool any_strictly_viable (struct z_candidate
*);
155 static struct z_candidate
*add_template_candidate
156 (struct z_candidate
**, tree
, tree
, tree
, tree
, const VEC(tree
,gc
) *,
157 tree
, tree
, tree
, int, unification_kind_t
);
158 static struct z_candidate
*add_template_candidate_real
159 (struct z_candidate
**, tree
, tree
, tree
, tree
, const VEC(tree
,gc
) *,
160 tree
, tree
, tree
, int, tree
, unification_kind_t
);
161 static struct z_candidate
*add_template_conv_candidate
162 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
164 static void add_builtin_candidates
165 (struct z_candidate
**, enum tree_code
, enum tree_code
,
167 static void add_builtin_candidate
168 (struct z_candidate
**, enum tree_code
, enum tree_code
,
169 tree
, tree
, tree
, tree
*, tree
*, int);
170 static bool is_complete (tree
);
171 static void build_builtin_candidate
172 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
174 static struct z_candidate
*add_conv_candidate
175 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
177 static struct z_candidate
*add_function_candidate
178 (struct z_candidate
**, tree
, tree
, tree
, const VEC(tree
,gc
) *, tree
,
180 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int);
181 static conversion
*standard_conversion (tree
, tree
, tree
, bool, int);
182 static conversion
*reference_binding (tree
, tree
, tree
, bool, int);
183 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
184 static conversion
*build_list_conv (tree
, tree
, int);
185 static bool is_subseq (conversion
*, conversion
*);
186 static conversion
*maybe_handle_ref_bind (conversion
**);
187 static void maybe_handle_implicit_object (conversion
**);
188 static struct z_candidate
*add_candidate
189 (struct z_candidate
**, tree
, tree
, const VEC(tree
,gc
) *, size_t,
190 conversion
**, tree
, tree
, int);
191 static tree
source_type (conversion
*);
192 static void add_warning (struct z_candidate
*, struct z_candidate
*);
193 static bool reference_related_p (tree
, tree
);
194 static bool reference_compatible_p (tree
, tree
);
195 static conversion
*convert_class_to_reference (tree
, tree
, tree
, int);
196 static conversion
*direct_reference_binding (tree
, conversion
*);
197 static bool promoted_arithmetic_type_p (tree
);
198 static conversion
*conditional_conversion (tree
, tree
);
199 static char *name_as_c_string (tree
, tree
, bool *);
200 static tree
call_builtin_trap (void);
201 static tree
prep_operand (tree
);
202 static void add_candidates (tree
, const VEC(tree
,gc
) *, tree
, bool, tree
, tree
,
203 int, struct z_candidate
**);
204 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
205 static bool magic_varargs_p (tree
);
206 static tree
build_temp (tree
, tree
, int, diagnostic_t
*);
208 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
209 NAME can take many forms... */
212 check_dtor_name (tree basetype
, tree name
)
214 /* Just accept something we've already complained about. */
215 if (name
== error_mark_node
)
218 if (TREE_CODE (name
) == TYPE_DECL
)
219 name
= TREE_TYPE (name
);
220 else if (TYPE_P (name
))
222 else if (TREE_CODE (name
) == IDENTIFIER_NODE
)
224 if ((MAYBE_CLASS_TYPE_P (basetype
)
225 && name
== constructor_name (basetype
))
226 || (TREE_CODE (basetype
) == ENUMERAL_TYPE
227 && name
== TYPE_IDENTIFIER (basetype
)))
230 name
= get_type_value (name
);
236 template <class T> struct S { ~S(); };
240 NAME will be a class template. */
241 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
247 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
250 /* We want the address of a function or method. We avoid creating a
251 pointer-to-member function. */
254 build_addr_func (tree function
)
256 tree type
= TREE_TYPE (function
);
258 /* We have to do these by hand to avoid real pointer to member
260 if (TREE_CODE (type
) == METHOD_TYPE
)
262 if (TREE_CODE (function
) == OFFSET_REF
)
264 tree object
= build_address (TREE_OPERAND (function
, 0));
265 return get_member_function_from_ptrfunc (&object
,
266 TREE_OPERAND (function
, 1));
268 function
= build_address (function
);
271 function
= decay_conversion (function
);
276 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
277 POINTER_TYPE to those. Note, pointer to member function types
278 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
279 two variants. build_call_a is the primitive taking an array of
280 arguments, while build_call_n is a wrapper that handles varargs. */
283 build_call_n (tree function
, int n
, ...)
286 return build_call_a (function
, 0, NULL
);
289 tree
*argarray
= (tree
*) alloca (n
* sizeof (tree
));
294 for (i
= 0; i
< n
; i
++)
295 argarray
[i
] = va_arg (ap
, tree
);
297 return build_call_a (function
, n
, argarray
);
302 build_call_a (tree function
, int n
, tree
*argarray
)
304 int is_constructor
= 0;
311 function
= build_addr_func (function
);
313 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
314 fntype
= TREE_TYPE (TREE_TYPE (function
));
315 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
316 || TREE_CODE (fntype
) == METHOD_TYPE
);
317 result_type
= TREE_TYPE (fntype
);
319 if (TREE_CODE (function
) == ADDR_EXPR
320 && TREE_CODE (TREE_OPERAND (function
, 0)) == FUNCTION_DECL
)
322 decl
= TREE_OPERAND (function
, 0);
323 if (!TREE_USED (decl
))
325 /* We invoke build_call directly for several library
326 functions. These may have been declared normally if
327 we're building libgcc, so we can't just check
329 gcc_assert (DECL_ARTIFICIAL (decl
)
330 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
338 /* We check both the decl and the type; a function may be known not to
339 throw without being declared throw(). */
340 nothrow
= ((decl
&& TREE_NOTHROW (decl
))
341 || TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (function
))));
343 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
344 current_function_returns_abnormally
= 1;
346 if (decl
&& TREE_DEPRECATED (decl
))
347 warn_deprecated_use (decl
, NULL_TREE
);
348 require_complete_eh_spec_types (fntype
, decl
);
350 if (decl
&& DECL_CONSTRUCTOR_P (decl
))
353 /* Don't pass empty class objects by value. This is useful
354 for tags in STL, which are used to control overload resolution.
355 We don't need to handle other cases of copying empty classes. */
356 if (! decl
|| ! DECL_BUILT_IN (decl
))
357 for (i
= 0; i
< n
; i
++)
358 if (is_empty_class (TREE_TYPE (argarray
[i
]))
359 && ! TREE_ADDRESSABLE (TREE_TYPE (argarray
[i
])))
361 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (argarray
[i
]));
362 argarray
[i
] = build2 (COMPOUND_EXPR
, TREE_TYPE (t
),
366 function
= build_call_array (result_type
, function
, n
, argarray
);
367 TREE_HAS_CONSTRUCTOR (function
) = is_constructor
;
368 TREE_NOTHROW (function
) = nothrow
;
373 /* Build something of the form ptr->method (args)
374 or object.method (args). This can also build
375 calls to constructors, and find friends.
377 Member functions always take their class variable
380 INSTANCE is a class instance.
382 NAME is the name of the method desired, usually an IDENTIFIER_NODE.
384 PARMS help to figure out what that NAME really refers to.
386 BASETYPE_PATH, if non-NULL, contains a chain from the type of INSTANCE
387 down to the real instance type to use for access checking. We need this
388 information to get protected accesses correct.
390 FLAGS is the logical disjunction of zero or more LOOKUP_
391 flags. See cp-tree.h for more info.
393 If this is all OK, calls build_function_call with the resolved
396 This function must also handle being called to perform
397 initialization, promotion/coercion of arguments, and
398 instantiation of default parameters.
400 Note that NAME may refer to an instance variable name. If
401 `operator()()' is defined for the type of that field, then we return
404 /* New overloading code. */
406 typedef struct z_candidate z_candidate
;
408 typedef struct candidate_warning candidate_warning
;
409 struct candidate_warning
{
411 candidate_warning
*next
;
415 /* The FUNCTION_DECL that will be called if this candidate is
416 selected by overload resolution. */
418 /* If not NULL_TREE, the first argument to use when calling this
421 /* The rest of the arguments to use when calling this function. If
422 there are no further arguments this may be NULL or it may be an
424 const VEC(tree
,gc
) *args
;
425 /* The implicit conversion sequences for each of the arguments to
428 /* The number of implicit conversion sequences. */
430 /* If FN is a user-defined conversion, the standard conversion
431 sequence from the type returned by FN to the desired destination
433 conversion
*second_conv
;
435 /* If FN is a member function, the binfo indicating the path used to
436 qualify the name of FN at the call site. This path is used to
437 determine whether or not FN is accessible if it is selected by
438 overload resolution. The DECL_CONTEXT of FN will always be a
439 (possibly improper) base of this binfo. */
441 /* If FN is a non-static member function, the binfo indicating the
442 subobject to which the `this' pointer should be converted if FN
443 is selected by overload resolution. The type pointed to the by
444 the `this' pointer must correspond to the most derived class
445 indicated by the CONVERSION_PATH. */
446 tree conversion_path
;
448 candidate_warning
*warnings
;
452 /* Returns true iff T is a null pointer constant in the sense of
456 null_ptr_cst_p (tree t
)
460 A null pointer constant is an integral constant expression
461 (_expr.const_) rvalue of integer type that evaluates to zero. */
462 t
= integral_constant_value (t
);
465 if (CP_INTEGRAL_TYPE_P (TREE_TYPE (t
)) && integer_zerop (t
))
468 if (!TREE_OVERFLOW (t
))
474 /* Returns nonzero if PARMLIST consists of only default parms and/or
478 sufficient_parms_p (const_tree parmlist
)
480 for (; parmlist
&& parmlist
!= void_list_node
;
481 parmlist
= TREE_CHAIN (parmlist
))
482 if (!TREE_PURPOSE (parmlist
))
487 /* Allocate N bytes of memory from the conversion obstack. The memory
488 is zeroed before being returned. */
491 conversion_obstack_alloc (size_t n
)
494 if (!conversion_obstack_initialized
)
496 gcc_obstack_init (&conversion_obstack
);
497 conversion_obstack_initialized
= true;
499 p
= obstack_alloc (&conversion_obstack
, n
);
504 /* Dynamically allocate a conversion. */
507 alloc_conversion (conversion_kind kind
)
510 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
515 #ifdef ENABLE_CHECKING
517 /* Make sure that all memory on the conversion obstack has been
521 validate_conversion_obstack (void)
523 if (conversion_obstack_initialized
)
524 gcc_assert ((obstack_next_free (&conversion_obstack
)
525 == obstack_base (&conversion_obstack
)));
528 #endif /* ENABLE_CHECKING */
530 /* Dynamically allocate an array of N conversions. */
533 alloc_conversions (size_t n
)
535 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
539 build_conv (conversion_kind code
, tree type
, conversion
*from
)
542 conversion_rank rank
= CONVERSION_RANK (from
);
544 /* Note that the caller is responsible for filling in t->cand for
545 user-defined conversions. */
546 t
= alloc_conversion (code
);
569 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
570 t
->bad_p
= from
->bad_p
;
575 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
576 specialization of std::initializer_list<T>, if such a conversion is
580 build_list_conv (tree type
, tree ctor
, int flags
)
582 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
583 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
584 conversion
**subconvs
= alloc_conversions (len
);
589 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
592 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
600 t
= alloc_conversion (ck_list
);
602 t
->u
.list
= subconvs
;
605 for (i
= 0; i
< len
; ++i
)
607 conversion
*sub
= subconvs
[i
];
608 if (sub
->rank
> t
->rank
)
610 if (sub
->user_conv_p
)
611 t
->user_conv_p
= true;
619 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
620 aggregate class, if such a conversion is possible. */
623 build_aggr_conv (tree type
, tree ctor
, int flags
)
625 unsigned HOST_WIDE_INT i
= 0;
627 tree field
= TYPE_FIELDS (type
);
629 for (; field
; field
= TREE_CHAIN (field
), ++i
)
631 if (TREE_CODE (field
) != FIELD_DECL
)
633 if (i
< CONSTRUCTOR_NELTS (ctor
))
635 constructor_elt
*ce
= CONSTRUCTOR_ELT (ctor
, i
);
636 if (!can_convert_arg (TREE_TYPE (field
), TREE_TYPE (ce
->value
),
640 else if (build_value_init (TREE_TYPE (field
)) == error_mark_node
)
644 c
= alloc_conversion (ck_aggr
);
647 c
->user_conv_p
= true;
652 /* Build a representation of the identity conversion from EXPR to
653 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
656 build_identity_conv (tree type
, tree expr
)
660 c
= alloc_conversion (ck_identity
);
667 /* Converting from EXPR to TYPE was ambiguous in the sense that there
668 were multiple user-defined conversions to accomplish the job.
669 Build a conversion that indicates that ambiguity. */
672 build_ambiguous_conv (tree type
, tree expr
)
676 c
= alloc_conversion (ck_ambig
);
684 strip_top_quals (tree t
)
686 if (TREE_CODE (t
) == ARRAY_TYPE
)
688 return cp_build_qualified_type (t
, 0);
691 /* Returns the standard conversion path (see [conv]) from type FROM to type
692 TO, if any. For proper handling of null pointer constants, you must
693 also pass the expression EXPR to convert from. If C_CAST_P is true,
694 this conversion is coming from a C-style cast. */
697 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
700 enum tree_code fcode
, tcode
;
702 bool fromref
= false;
704 to
= non_reference (to
);
705 if (TREE_CODE (from
) == REFERENCE_TYPE
)
708 from
= TREE_TYPE (from
);
710 to
= strip_top_quals (to
);
711 from
= strip_top_quals (from
);
713 if ((TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
714 && expr
&& type_unknown_p (expr
))
716 tsubst_flags_t tflags
= tf_conv
;
717 if (!(flags
& LOOKUP_PROTECT
))
718 tflags
|= tf_no_access_control
;
719 expr
= instantiate_type (to
, expr
, tflags
);
720 if (expr
== error_mark_node
)
722 from
= TREE_TYPE (expr
);
725 fcode
= TREE_CODE (from
);
726 tcode
= TREE_CODE (to
);
728 conv
= build_identity_conv (from
, expr
);
729 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
731 from
= type_decays_to (from
);
732 fcode
= TREE_CODE (from
);
733 conv
= build_conv (ck_lvalue
, from
, conv
);
735 else if (fromref
|| (expr
&& lvalue_p (expr
)))
740 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
743 from
= strip_top_quals (bitfield_type
);
744 fcode
= TREE_CODE (from
);
747 conv
= build_conv (ck_rvalue
, from
, conv
);
750 /* Allow conversion between `__complex__' data types. */
751 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
753 /* The standard conversion sequence to convert FROM to TO is
754 the standard conversion sequence to perform componentwise
756 conversion
*part_conv
= standard_conversion
757 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
);
761 conv
= build_conv (part_conv
->kind
, to
, conv
);
762 conv
->rank
= part_conv
->rank
;
770 if (same_type_p (from
, to
))
773 if ((tcode
== POINTER_TYPE
|| TYPE_PTR_TO_MEMBER_P (to
))
774 && expr
&& null_ptr_cst_p (expr
))
775 conv
= build_conv (ck_std
, to
, conv
);
776 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
777 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
779 /* For backwards brain damage compatibility, allow interconversion of
780 pointers and integers with a pedwarn. */
781 conv
= build_conv (ck_std
, to
, conv
);
784 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
786 /* For backwards brain damage compatibility, allow interconversion of
787 enums and integers with a pedwarn. */
788 conv
= build_conv (ck_std
, to
, conv
);
791 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
792 || (TYPE_PTRMEM_P (to
) && TYPE_PTRMEM_P (from
)))
797 if (tcode
== POINTER_TYPE
798 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from
),
801 else if (VOID_TYPE_P (TREE_TYPE (to
))
802 && !TYPE_PTRMEM_P (from
)
803 && TREE_CODE (TREE_TYPE (from
)) != FUNCTION_TYPE
)
805 from
= build_pointer_type
806 (cp_build_qualified_type (void_type_node
,
807 cp_type_quals (TREE_TYPE (from
))));
808 conv
= build_conv (ck_ptr
, from
, conv
);
810 else if (TYPE_PTRMEM_P (from
))
812 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
813 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
815 if (DERIVED_FROM_P (fbase
, tbase
)
816 && (same_type_ignoring_top_level_qualifiers_p
817 (TYPE_PTRMEM_POINTED_TO_TYPE (from
),
818 TYPE_PTRMEM_POINTED_TO_TYPE (to
))))
820 from
= build_ptrmem_type (tbase
,
821 TYPE_PTRMEM_POINTED_TO_TYPE (from
));
822 conv
= build_conv (ck_pmem
, from
, conv
);
824 else if (!same_type_p (fbase
, tbase
))
827 else if (CLASS_TYPE_P (TREE_TYPE (from
))
828 && CLASS_TYPE_P (TREE_TYPE (to
))
831 An rvalue of type "pointer to cv D," where D is a
832 class type, can be converted to an rvalue of type
833 "pointer to cv B," where B is a base class (clause
834 _class.derived_) of D. If B is an inaccessible
835 (clause _class.access_) or ambiguous
836 (_class.member.lookup_) base class of D, a program
837 that necessitates this conversion is ill-formed.
838 Therefore, we use DERIVED_FROM_P, and do not check
839 access or uniqueness. */
840 && DERIVED_FROM_P (TREE_TYPE (to
), TREE_TYPE (from
)))
843 cp_build_qualified_type (TREE_TYPE (to
),
844 cp_type_quals (TREE_TYPE (from
)));
845 from
= build_pointer_type (from
);
846 conv
= build_conv (ck_ptr
, from
, conv
);
850 if (tcode
== POINTER_TYPE
)
852 to_pointee
= TREE_TYPE (to
);
853 from_pointee
= TREE_TYPE (from
);
857 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
858 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
861 if (same_type_p (from
, to
))
863 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
864 /* In a C-style cast, we ignore CV-qualification because we
865 are allowed to perform a static_cast followed by a
867 conv
= build_conv (ck_qual
, to
, conv
);
868 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
869 conv
= build_conv (ck_qual
, to
, conv
);
870 else if (expr
&& string_conv_p (to
, expr
, 0))
871 /* converting from string constant to char *. */
872 conv
= build_conv (ck_qual
, to
, conv
);
873 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
875 conv
= build_conv (ck_ptr
, to
, conv
);
883 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
885 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
886 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
887 tree fbase
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fromfn
)));
888 tree tbase
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (tofn
)));
890 if (!DERIVED_FROM_P (fbase
, tbase
)
891 || !same_type_p (TREE_TYPE (fromfn
), TREE_TYPE (tofn
))
892 || !compparms (TREE_CHAIN (TYPE_ARG_TYPES (fromfn
)),
893 TREE_CHAIN (TYPE_ARG_TYPES (tofn
)))
894 || cp_type_quals (fbase
) != cp_type_quals (tbase
))
897 from
= cp_build_qualified_type (tbase
, cp_type_quals (fbase
));
898 from
= build_method_type_directly (from
,
900 TREE_CHAIN (TYPE_ARG_TYPES (fromfn
)));
901 from
= build_ptrmemfunc_type (build_pointer_type (from
));
902 conv
= build_conv (ck_pmem
, from
, conv
);
905 else if (tcode
== BOOLEAN_TYPE
)
909 An rvalue of arithmetic, unscoped enumeration, pointer, or
910 pointer to member type can be converted to an rvalue of type
912 if (ARITHMETIC_TYPE_P (from
)
913 || UNSCOPED_ENUM_P (from
)
914 || fcode
== POINTER_TYPE
915 || TYPE_PTR_TO_MEMBER_P (from
))
917 conv
= build_conv (ck_std
, to
, conv
);
918 if (fcode
== POINTER_TYPE
919 || TYPE_PTRMEM_P (from
)
920 || (TYPE_PTRMEMFUNC_P (from
)
921 && conv
->rank
< cr_pbool
))
922 conv
->rank
= cr_pbool
;
928 /* We don't check for ENUMERAL_TYPE here because there are no standard
929 conversions to enum type. */
930 /* As an extension, allow conversion to complex type. */
931 else if (ARITHMETIC_TYPE_P (to
))
933 if (! (INTEGRAL_CODE_P (fcode
) || fcode
== REAL_TYPE
)
934 || SCOPED_ENUM_P (from
))
936 conv
= build_conv (ck_std
, to
, conv
);
938 /* Give this a better rank if it's a promotion. */
939 if (same_type_p (to
, type_promotes_to (from
))
940 && conv
->u
.next
->rank
<= cr_promotion
)
941 conv
->rank
= cr_promotion
;
943 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
944 && vector_types_convertible_p (from
, to
, false))
945 return build_conv (ck_std
, to
, conv
);
946 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
947 && is_properly_derived_from (from
, to
))
949 if (conv
->kind
== ck_rvalue
)
951 conv
= build_conv (ck_base
, to
, conv
);
952 /* The derived-to-base conversion indicates the initialization
953 of a parameter with base type from an object of a derived
954 type. A temporary object is created to hold the result of
955 the conversion unless we're binding directly to a reference. */
956 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
961 if (flags
& LOOKUP_NO_NARROWING
)
962 conv
->check_narrowing
= true;
967 /* Returns nonzero if T1 is reference-related to T2. */
970 reference_related_p (tree t1
, tree t2
)
972 t1
= TYPE_MAIN_VARIANT (t1
);
973 t2
= TYPE_MAIN_VARIANT (t2
);
977 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
978 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
980 return (same_type_p (t1
, t2
)
981 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
982 && DERIVED_FROM_P (t1
, t2
)));
985 /* Returns nonzero if T1 is reference-compatible with T2. */
988 reference_compatible_p (tree t1
, tree t2
)
992 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
993 reference-related to T2 and cv1 is the same cv-qualification as,
994 or greater cv-qualification than, cv2. */
995 return (reference_related_p (t1
, t2
)
996 && at_least_as_qualified_p (t1
, t2
));
999 /* Determine whether or not the EXPR (of class type S) can be
1000 converted to T as in [over.match.ref]. */
1003 convert_class_to_reference (tree reference_type
, tree s
, tree expr
, int flags
)
1009 struct z_candidate
*candidates
;
1010 struct z_candidate
*cand
;
1013 conversions
= lookup_conversions (s
);
1019 Assuming that "cv1 T" is the underlying type of the reference
1020 being initialized, and "cv S" is the type of the initializer
1021 expression, with S a class type, the candidate functions are
1022 selected as follows:
1024 --The conversion functions of S and its base classes are
1025 considered. Those that are not hidden within S and yield type
1026 "reference to cv2 T2", where "cv1 T" is reference-compatible
1027 (_dcl.init.ref_) with "cv2 T2", are candidate functions.
1029 The argument list has one argument, which is the initializer
1034 /* Conceptually, we should take the address of EXPR and put it in
1035 the argument list. Unfortunately, however, that can result in
1036 error messages, which we should not issue now because we are just
1037 trying to find a conversion operator. Therefore, we use NULL,
1038 cast to the appropriate type. */
1039 first_arg
= build_int_cst (build_pointer_type (s
), 0);
1041 t
= TREE_TYPE (reference_type
);
1043 for (; conversions
; conversions
= TREE_CHAIN (conversions
))
1045 tree fns
= TREE_VALUE (conversions
);
1047 for (; fns
; fns
= OVL_NEXT (fns
))
1049 tree f
= OVL_CURRENT (fns
);
1050 tree t2
= TREE_TYPE (TREE_TYPE (f
));
1052 if (DECL_NONCONVERTING_P (f
)
1053 && (flags
& LOOKUP_ONLYCONVERTING
))
1058 /* If this is a template function, try to get an exact
1060 if (TREE_CODE (f
) == TEMPLATE_DECL
)
1062 cand
= add_template_candidate (&candidates
,
1069 TREE_PURPOSE (conversions
),
1075 /* Now, see if the conversion function really returns
1076 an lvalue of the appropriate type. From the
1077 point of view of unification, simply returning an
1078 rvalue of the right type is good enough. */
1080 t2
= TREE_TYPE (TREE_TYPE (f
));
1081 if (TREE_CODE (t2
) != REFERENCE_TYPE
1082 || !reference_compatible_p (t
, TREE_TYPE (t2
)))
1084 candidates
= candidates
->next
;
1089 else if (TREE_CODE (t2
) == REFERENCE_TYPE
1090 && reference_compatible_p (t
, TREE_TYPE (t2
)))
1091 cand
= add_function_candidate (&candidates
, f
, s
, first_arg
,
1092 NULL
, TYPE_BINFO (s
),
1093 TREE_PURPOSE (conversions
),
1098 conversion
*identity_conv
;
1099 /* Build a standard conversion sequence indicating the
1100 binding from the reference type returned by the
1101 function to the desired REFERENCE_TYPE. */
1103 = build_identity_conv (TREE_TYPE (TREE_TYPE
1104 (TREE_TYPE (cand
->fn
))),
1107 = (direct_reference_binding
1108 (reference_type
, identity_conv
));
1109 cand
->second_conv
->rvaluedness_matches_p
1110 = TYPE_REF_IS_RVALUE (TREE_TYPE (TREE_TYPE (cand
->fn
)))
1111 == TYPE_REF_IS_RVALUE (reference_type
);
1112 cand
->second_conv
->bad_p
|= cand
->convs
[0]->bad_p
;
1117 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
1118 /* If none of the conversion functions worked out, let our caller
1123 cand
= tourney (candidates
);
1127 /* Now that we know that this is the function we're going to use fix
1128 the dummy first argument. */
1129 gcc_assert (cand
->first_arg
== NULL_TREE
1130 || integer_zerop (cand
->first_arg
));
1131 cand
->first_arg
= build_this (expr
);
1133 /* Build a user-defined conversion sequence representing the
1135 conv
= build_conv (ck_user
,
1136 TREE_TYPE (TREE_TYPE (cand
->fn
)),
1137 build_identity_conv (TREE_TYPE (expr
), expr
));
1140 /* Merge it with the standard conversion sequence from the
1141 conversion function's return type to the desired type. */
1142 cand
->second_conv
= merge_conversion_sequences (conv
, cand
->second_conv
);
1144 if (cand
->viable
== -1)
1147 return cand
->second_conv
;
1150 /* A reference of the indicated TYPE is being bound directly to the
1151 expression represented by the implicit conversion sequence CONV.
1152 Return a conversion sequence for this binding. */
1155 direct_reference_binding (tree type
, conversion
*conv
)
1159 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1160 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1162 t
= TREE_TYPE (type
);
1166 When a parameter of reference type binds directly
1167 (_dcl.init.ref_) to an argument expression, the implicit
1168 conversion sequence is the identity conversion, unless the
1169 argument expression has a type that is a derived class of the
1170 parameter type, in which case the implicit conversion sequence is
1171 a derived-to-base Conversion.
1173 If the parameter binds directly to the result of applying a
1174 conversion function to the argument expression, the implicit
1175 conversion sequence is a user-defined conversion sequence
1176 (_over.ics.user_), with the second standard conversion sequence
1177 either an identity conversion or, if the conversion function
1178 returns an entity of a type that is a derived class of the
1179 parameter type, a derived-to-base conversion. */
1180 if (!same_type_ignoring_top_level_qualifiers_p (t
, conv
->type
))
1182 /* Represent the derived-to-base conversion. */
1183 conv
= build_conv (ck_base
, t
, conv
);
1184 /* We will actually be binding to the base-class subobject in
1185 the derived class, so we mark this conversion appropriately.
1186 That way, convert_like knows not to generate a temporary. */
1187 conv
->need_temporary_p
= false;
1189 return build_conv (ck_ref_bind
, type
, conv
);
1192 /* Returns the conversion path from type FROM to reference type TO for
1193 purposes of reference binding. For lvalue binding, either pass a
1194 reference type to FROM or an lvalue expression to EXPR. If the
1195 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1196 the conversion returned. If C_CAST_P is true, this
1197 conversion is coming from a C-style cast. */
1200 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
)
1202 conversion
*conv
= NULL
;
1203 tree to
= TREE_TYPE (rto
);
1208 cp_lvalue_kind lvalue_p
= clk_none
;
1210 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1212 expr
= instantiate_type (to
, expr
, tf_none
);
1213 if (expr
== error_mark_node
)
1215 from
= TREE_TYPE (expr
);
1218 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1220 /* Anything with reference type is an lvalue. */
1221 lvalue_p
= clk_ordinary
;
1222 from
= TREE_TYPE (from
);
1225 lvalue_p
= real_lvalue_p (expr
);
1228 if ((lvalue_p
& clk_bitfield
) != 0)
1229 tfrom
= unlowered_expr_type (expr
);
1231 /* Figure out whether or not the types are reference-related and
1232 reference compatible. We have do do this after stripping
1233 references from FROM. */
1234 related_p
= reference_related_p (to
, tfrom
);
1235 /* If this is a C cast, first convert to an appropriately qualified
1236 type, so that we can later do a const_cast to the desired type. */
1237 if (related_p
&& c_cast_p
1238 && !at_least_as_qualified_p (to
, tfrom
))
1239 to
= build_qualified_type (to
, cp_type_quals (tfrom
));
1240 compatible_p
= reference_compatible_p (to
, tfrom
);
1242 /* Directly bind reference when target expression's type is compatible with
1243 the reference and expression is an lvalue. In DR391, the wording in
1244 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1245 const and rvalue references to rvalues of compatible class type. */
1248 || (!(flags
& LOOKUP_NO_TEMP_BIND
)
1249 && (CP_TYPE_CONST_NON_VOLATILE_P(to
) || TYPE_REF_IS_RVALUE (rto
))
1250 && CLASS_TYPE_P (from
))))
1254 If the initializer expression
1256 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1257 is reference-compatible with "cv2 T2,"
1259 the reference is bound directly to the initializer expression
1263 If the initializer expression is an rvalue, with T2 a class type,
1264 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1265 is bound to the object represented by the rvalue or to a sub-object
1266 within that object. */
1268 conv
= build_identity_conv (tfrom
, expr
);
1269 conv
= direct_reference_binding (rto
, conv
);
1271 if (flags
& LOOKUP_PREFER_RVALUE
)
1272 /* The top-level caller requested that we pretend that the lvalue
1273 be treated as an rvalue. */
1274 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1276 conv
->rvaluedness_matches_p
1277 = (TYPE_REF_IS_RVALUE (rto
) == !lvalue_p
);
1279 if ((lvalue_p
& clk_bitfield
) != 0
1280 || ((lvalue_p
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1281 /* For the purposes of overload resolution, we ignore the fact
1282 this expression is a bitfield or packed field. (In particular,
1283 [over.ics.ref] says specifically that a function with a
1284 non-const reference parameter is viable even if the
1285 argument is a bitfield.)
1287 However, when we actually call the function we must create
1288 a temporary to which to bind the reference. If the
1289 reference is volatile, or isn't const, then we cannot make
1290 a temporary, so we just issue an error when the conversion
1292 conv
->need_temporary_p
= true;
1296 /* [class.conv.fct] A conversion function is never used to convert a
1297 (possibly cv-qualified) object to the (possibly cv-qualified) same
1298 object type (or a reference to it), to a (possibly cv-qualified) base
1299 class of that type (or a reference to it).... */
1300 else if (CLASS_TYPE_P (from
) && !related_p
1301 && !(flags
& LOOKUP_NO_CONVERSION
))
1305 If the initializer expression
1307 -- has a class type (i.e., T2 is a class type) can be
1308 implicitly converted to an lvalue of type "cv3 T3," where
1309 "cv1 T1" is reference-compatible with "cv3 T3". (this
1310 conversion is selected by enumerating the applicable
1311 conversion functions (_over.match.ref_) and choosing the
1312 best one through overload resolution. (_over.match_).
1314 the reference is bound to the lvalue result of the conversion
1315 in the second case. */
1316 conv
= convert_class_to_reference (rto
, from
, expr
, flags
);
1321 /* From this point on, we conceptually need temporaries, even if we
1322 elide them. Only the cases above are "direct bindings". */
1323 if (flags
& LOOKUP_NO_TEMP_BIND
)
1328 When a parameter of reference type is not bound directly to an
1329 argument expression, the conversion sequence is the one required
1330 to convert the argument expression to the underlying type of the
1331 reference according to _over.best.ics_. Conceptually, this
1332 conversion sequence corresponds to copy-initializing a temporary
1333 of the underlying type with the argument expression. Any
1334 difference in top-level cv-qualification is subsumed by the
1335 initialization itself and does not constitute a conversion. */
1339 Otherwise, the reference shall be to a non-volatile const type.
1341 Under C++0x, [8.5.3/5 dcl.init.ref] it may also be an rvalue reference */
1342 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1347 Otherwise, a temporary of type "cv1 T1" is created and
1348 initialized from the initializer expression using the rules for a
1349 non-reference copy initialization. If T1 is reference-related to
1350 T2, cv1 must be the same cv-qualification as, or greater
1351 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1352 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1355 /* We're generating a temporary now, but don't bind any more in the
1356 conversion (specifically, don't slice the temporary returned by a
1357 conversion operator). */
1358 flags
|= LOOKUP_NO_TEMP_BIND
;
1360 /* Temporaries are copy-initialized, except for this hack to allow
1361 explicit conversion ops to the copy ctor. See also
1362 add_function_candidate. */
1363 if (!(flags
& LOOKUP_COPY_PARM
))
1364 flags
|= LOOKUP_ONLYCONVERTING
;
1366 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1371 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1372 /* This reference binding, unlike those above, requires the
1373 creation of a temporary. */
1374 conv
->need_temporary_p
= true;
1375 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1380 /* Returns the implicit conversion sequence (see [over.ics]) from type
1381 FROM to type TO. The optional expression EXPR may affect the
1382 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1383 true, this conversion is coming from a C-style cast. */
1386 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1391 if (from
== error_mark_node
|| to
== error_mark_node
1392 || expr
== error_mark_node
)
1395 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1396 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
);
1398 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
);
1403 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1405 if (is_std_init_list (to
))
1406 return build_list_conv (to
, expr
, flags
);
1408 /* Allow conversion from an initializer-list with one element to a
1410 if (SCALAR_TYPE_P (to
))
1412 int nelts
= CONSTRUCTOR_NELTS (expr
);
1416 elt
= integer_zero_node
;
1417 else if (nelts
== 1)
1418 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1420 elt
= error_mark_node
;
1422 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1426 conv
->check_narrowing
= true;
1427 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1428 /* Too many levels of braces, i.e. '{{1}}'. */
1435 if (expr
!= NULL_TREE
1436 && (MAYBE_CLASS_TYPE_P (from
)
1437 || MAYBE_CLASS_TYPE_P (to
))
1438 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1440 struct z_candidate
*cand
;
1441 int convflags
= (flags
& (LOOKUP_NO_TEMP_BIND
|LOOKUP_ONLYCONVERTING
));
1443 if (CLASS_TYPE_P (to
)
1444 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
))
1445 && BRACE_ENCLOSED_INITIALIZER_P (expr
))
1446 return build_aggr_conv (to
, expr
, flags
);
1448 cand
= build_user_type_conversion_1 (to
, expr
, convflags
);
1450 conv
= cand
->second_conv
;
1452 /* We used to try to bind a reference to a temporary here, but that
1453 is now handled after the recursive call to this function at the end
1454 of reference_binding. */
1461 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1462 functions. ARGS will not be changed until a single candidate is
1465 static struct z_candidate
*
1466 add_candidate (struct z_candidate
**candidates
,
1467 tree fn
, tree first_arg
, const VEC(tree
,gc
) *args
,
1468 size_t num_convs
, conversion
**convs
,
1469 tree access_path
, tree conversion_path
,
1472 struct z_candidate
*cand
= (struct z_candidate
*)
1473 conversion_obstack_alloc (sizeof (struct z_candidate
));
1476 cand
->first_arg
= first_arg
;
1478 cand
->convs
= convs
;
1479 cand
->num_convs
= num_convs
;
1480 cand
->access_path
= access_path
;
1481 cand
->conversion_path
= conversion_path
;
1482 cand
->viable
= viable
;
1483 cand
->next
= *candidates
;
1489 /* Create an overload candidate for the function or method FN called
1490 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1491 FLAGS is passed on to implicit_conversion.
1493 This does not change ARGS.
1495 CTYPE, if non-NULL, is the type we want to pretend this function
1496 comes from for purposes of overload resolution. */
1498 static struct z_candidate
*
1499 add_function_candidate (struct z_candidate
**candidates
,
1500 tree fn
, tree ctype
, tree first_arg
,
1501 const VEC(tree
,gc
) *args
, tree access_path
,
1502 tree conversion_path
, int flags
)
1504 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1508 tree orig_first_arg
= first_arg
;
1512 /* At this point we should not see any functions which haven't been
1513 explicitly declared, except for friend functions which will have
1514 been found using argument dependent lookup. */
1515 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
1517 /* The `this', `in_chrg' and VTT arguments to constructors are not
1518 considered in overload resolution. */
1519 if (DECL_CONSTRUCTOR_P (fn
))
1521 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
1522 skip
= num_artificial_parms_for (fn
);
1523 if (skip
> 0 && first_arg
!= NULL_TREE
)
1526 first_arg
= NULL_TREE
;
1532 len
= VEC_length (tree
, args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
1533 convs
= alloc_conversions (len
);
1535 /* 13.3.2 - Viable functions [over.match.viable]
1536 First, to be a viable function, a candidate function shall have enough
1537 parameters to agree in number with the arguments in the list.
1539 We need to check this first; otherwise, checking the ICSes might cause
1540 us to produce an ill-formed template instantiation. */
1542 parmnode
= parmlist
;
1543 for (i
= 0; i
< len
; ++i
)
1545 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
1547 parmnode
= TREE_CHAIN (parmnode
);
1550 if (i
< len
&& parmnode
)
1553 /* Make sure there are default args for the rest of the parms. */
1554 else if (!sufficient_parms_p (parmnode
))
1560 /* Second, for F to be a viable function, there shall exist for each
1561 argument an implicit conversion sequence that converts that argument
1562 to the corresponding parameter of F. */
1564 parmnode
= parmlist
;
1566 for (i
= 0; i
< len
; ++i
)
1572 if (parmnode
== void_list_node
)
1575 if (i
== 0 && first_arg
!= NULL_TREE
)
1578 arg
= VEC_index (tree
, args
,
1579 i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0));
1580 argtype
= lvalue_type (arg
);
1582 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
1583 && ! DECL_CONSTRUCTOR_P (fn
));
1587 tree parmtype
= TREE_VALUE (parmnode
);
1590 /* The type of the implicit object parameter ('this') for
1591 overload resolution is not always the same as for the
1592 function itself; conversion functions are considered to
1593 be members of the class being converted, and functions
1594 introduced by a using-declaration are considered to be
1595 members of the class that uses them.
1597 Since build_over_call ignores the ICS for the `this'
1598 parameter, we can just change the parm type. */
1599 if (ctype
&& is_this
)
1602 = build_qualified_type (ctype
,
1603 TYPE_QUALS (TREE_TYPE (parmtype
)));
1604 parmtype
= build_pointer_type (parmtype
);
1607 if (ctype
&& i
== 0 && DECL_COPY_CONSTRUCTOR_P (fn
))
1609 /* Hack: Direct-initialize copy parm (i.e. suppress
1610 LOOKUP_ONLYCONVERTING) to make explicit conversion ops
1611 work. See also reference_binding. */
1612 lflags
|= LOOKUP_COPY_PARM
;
1613 if (flags
& LOOKUP_NO_COPY_CTOR_CONVERSION
)
1614 lflags
|= LOOKUP_NO_CONVERSION
;
1617 lflags
|= LOOKUP_ONLYCONVERTING
;
1619 t
= implicit_conversion (parmtype
, argtype
, arg
,
1620 /*c_cast_p=*/false, lflags
);
1624 t
= build_identity_conv (argtype
, arg
);
1625 t
->ellipsis_p
= true;
1642 parmnode
= TREE_CHAIN (parmnode
);
1646 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
1647 access_path
, conversion_path
, viable
);
1650 /* Create an overload candidate for the conversion function FN which will
1651 be invoked for expression OBJ, producing a pointer-to-function which
1652 will in turn be called with the argument list FIRST_ARG/ARGLIST,
1653 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
1654 passed on to implicit_conversion.
1656 Actually, we don't really care about FN; we care about the type it
1657 converts to. There may be multiple conversion functions that will
1658 convert to that type, and we rely on build_user_type_conversion_1 to
1659 choose the best one; so when we create our candidate, we record the type
1660 instead of the function. */
1662 static struct z_candidate
*
1663 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
1664 tree first_arg
, const VEC(tree
,gc
) *arglist
,
1665 tree access_path
, tree conversion_path
)
1667 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
1668 int i
, len
, viable
, flags
;
1669 tree parmlist
, parmnode
;
1672 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
1673 parmlist
= TREE_TYPE (parmlist
);
1674 parmlist
= TYPE_ARG_TYPES (parmlist
);
1676 len
= VEC_length (tree
, arglist
) + (first_arg
!= NULL_TREE
? 1 : 0) + 1;
1677 convs
= alloc_conversions (len
);
1678 parmnode
= parmlist
;
1680 flags
= LOOKUP_IMPLICIT
;
1682 /* Don't bother looking up the same type twice. */
1683 if (*candidates
&& (*candidates
)->fn
== totype
)
1686 for (i
= 0; i
< len
; ++i
)
1693 else if (i
== 1 && first_arg
!= NULL_TREE
)
1696 arg
= VEC_index (tree
, arglist
,
1697 i
- (first_arg
!= NULL_TREE
? 1 : 0) - 1);
1698 argtype
= lvalue_type (arg
);
1701 t
= implicit_conversion (totype
, argtype
, arg
, /*c_cast_p=*/false,
1703 else if (parmnode
== void_list_node
)
1706 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
1707 /*c_cast_p=*/false, flags
);
1710 t
= build_identity_conv (argtype
, arg
);
1711 t
->ellipsis_p
= true;
1725 parmnode
= TREE_CHAIN (parmnode
);
1731 if (!sufficient_parms_p (parmnode
))
1734 return add_candidate (candidates
, totype
, first_arg
, arglist
, len
, convs
,
1735 access_path
, conversion_path
, viable
);
1739 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
1740 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
1752 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
1753 convs
= alloc_conversions (num_convs
);
1754 flags
|= LOOKUP_ONLYCONVERTING
;
1756 for (i
= 0; i
< 2; ++i
)
1761 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
1762 /*c_cast_p=*/false, flags
);
1766 /* We need something for printing the candidate. */
1767 t
= build_identity_conv (types
[i
], NULL_TREE
);
1774 /* For COND_EXPR we rearranged the arguments; undo that now. */
1777 convs
[2] = convs
[1];
1778 convs
[1] = convs
[0];
1779 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
1780 /*c_cast_p=*/false, flags
);
1787 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
1789 /*access_path=*/NULL_TREE
,
1790 /*conversion_path=*/NULL_TREE
,
1795 is_complete (tree t
)
1797 return COMPLETE_TYPE_P (complete_type (t
));
1800 /* Returns nonzero if TYPE is a promoted arithmetic type. */
1803 promoted_arithmetic_type_p (tree type
)
1807 In this section, the term promoted integral type is used to refer
1808 to those integral types which are preserved by integral promotion
1809 (including e.g. int and long but excluding e.g. char).
1810 Similarly, the term promoted arithmetic type refers to promoted
1811 integral types plus floating types. */
1812 return ((CP_INTEGRAL_TYPE_P (type
)
1813 && same_type_p (type_promotes_to (type
), type
))
1814 || TREE_CODE (type
) == REAL_TYPE
);
1817 /* Create any builtin operator overload candidates for the operator in
1818 question given the converted operand types TYPE1 and TYPE2. The other
1819 args are passed through from add_builtin_candidates to
1820 build_builtin_candidate.
1822 TYPE1 and TYPE2 may not be permissible, and we must filter them.
1823 If CODE is requires candidates operands of the same type of the kind
1824 of which TYPE1 and TYPE2 are, we add both candidates
1825 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
1828 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
1829 enum tree_code code2
, tree fnname
, tree type1
,
1830 tree type2
, tree
*args
, tree
*argtypes
, int flags
)
1834 case POSTINCREMENT_EXPR
:
1835 case POSTDECREMENT_EXPR
:
1836 args
[1] = integer_zero_node
;
1837 type2
= integer_type_node
;
1846 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
1847 and VQ is either volatile or empty, there exist candidate operator
1848 functions of the form
1849 VQ T& operator++(VQ T&);
1850 T operator++(VQ T&, int);
1851 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
1852 type other than bool, and VQ is either volatile or empty, there exist
1853 candidate operator functions of the form
1854 VQ T& operator--(VQ T&);
1855 T operator--(VQ T&, int);
1856 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
1857 complete object type, and VQ is either volatile or empty, there exist
1858 candidate operator functions of the form
1859 T*VQ& operator++(T*VQ&);
1860 T*VQ& operator--(T*VQ&);
1861 T* operator++(T*VQ&, int);
1862 T* operator--(T*VQ&, int); */
1864 case POSTDECREMENT_EXPR
:
1865 case PREDECREMENT_EXPR
:
1866 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
1868 case POSTINCREMENT_EXPR
:
1869 case PREINCREMENT_EXPR
:
1870 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
1872 type1
= build_reference_type (type1
);
1877 /* 7 For every cv-qualified or cv-unqualified complete object type T, there
1878 exist candidate operator functions of the form
1882 8 For every function type T, there exist candidate operator functions of
1884 T& operator*(T*); */
1887 if (TREE_CODE (type1
) == POINTER_TYPE
1888 && (TYPE_PTROB_P (type1
)
1889 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
1893 /* 9 For every type T, there exist candidate operator functions of the form
1896 10For every promoted arithmetic type T, there exist candidate operator
1897 functions of the form
1901 case UNARY_PLUS_EXPR
: /* unary + */
1902 if (TREE_CODE (type1
) == POINTER_TYPE
)
1905 if (ARITHMETIC_TYPE_P (type1
))
1909 /* 11For every promoted integral type T, there exist candidate operator
1910 functions of the form
1914 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
1918 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
1919 is the same type as C2 or is a derived class of C2, T is a complete
1920 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
1921 there exist candidate operator functions of the form
1922 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
1923 where CV12 is the union of CV1 and CV2. */
1926 if (TREE_CODE (type1
) == POINTER_TYPE
1927 && TYPE_PTR_TO_MEMBER_P (type2
))
1929 tree c1
= TREE_TYPE (type1
);
1930 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
1932 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
1933 && (TYPE_PTRMEMFUNC_P (type2
)
1934 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
1939 /* 13For every pair of promoted arithmetic types L and R, there exist can-
1940 didate operator functions of the form
1945 bool operator<(L, R);
1946 bool operator>(L, R);
1947 bool operator<=(L, R);
1948 bool operator>=(L, R);
1949 bool operator==(L, R);
1950 bool operator!=(L, R);
1951 where LR is the result of the usual arithmetic conversions between
1954 14For every pair of types T and I, where T is a cv-qualified or cv-
1955 unqualified complete object type and I is a promoted integral type,
1956 there exist candidate operator functions of the form
1957 T* operator+(T*, I);
1958 T& operator[](T*, I);
1959 T* operator-(T*, I);
1960 T* operator+(I, T*);
1961 T& operator[](I, T*);
1963 15For every T, where T is a pointer to complete object type, there exist
1964 candidate operator functions of the form112)
1965 ptrdiff_t operator-(T, T);
1967 16For every pointer or enumeration type T, there exist candidate operator
1968 functions of the form
1969 bool operator<(T, T);
1970 bool operator>(T, T);
1971 bool operator<=(T, T);
1972 bool operator>=(T, T);
1973 bool operator==(T, T);
1974 bool operator!=(T, T);
1976 17For every pointer to member type T, there exist candidate operator
1977 functions of the form
1978 bool operator==(T, T);
1979 bool operator!=(T, T); */
1982 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
1984 if (TYPE_PTROB_P (type1
)
1985 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
1987 type2
= ptrdiff_type_node
;
1991 case TRUNC_DIV_EXPR
:
1992 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
1998 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
1999 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
)))
2001 if (TYPE_PTR_TO_MEMBER_P (type1
) && null_ptr_cst_p (args
[1]))
2006 if (TYPE_PTR_TO_MEMBER_P (type2
) && null_ptr_cst_p (args
[0]))
2018 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2020 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2022 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2023 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2025 if (TYPE_PTR_P (type1
)
2026 && null_ptr_cst_p (args
[1])
2027 && !uses_template_parms (type1
))
2032 if (null_ptr_cst_p (args
[0])
2033 && TYPE_PTR_P (type2
)
2034 && !uses_template_parms (type2
))
2042 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2045 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2047 type1
= ptrdiff_type_node
;
2050 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2052 type2
= ptrdiff_type_node
;
2057 /* 18For every pair of promoted integral types L and R, there exist candi-
2058 date operator functions of the form
2065 where LR is the result of the usual arithmetic conversions between
2068 case TRUNC_MOD_EXPR
:
2074 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2078 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2079 type, VQ is either volatile or empty, and R is a promoted arithmetic
2080 type, there exist candidate operator functions of the form
2081 VQ L& operator=(VQ L&, R);
2082 VQ L& operator*=(VQ L&, R);
2083 VQ L& operator/=(VQ L&, R);
2084 VQ L& operator+=(VQ L&, R);
2085 VQ L& operator-=(VQ L&, R);
2087 20For every pair T, VQ), where T is any type and VQ is either volatile
2088 or empty, there exist candidate operator functions of the form
2089 T*VQ& operator=(T*VQ&, T*);
2091 21For every pair T, VQ), where T is a pointer to member type and VQ is
2092 either volatile or empty, there exist candidate operator functions of
2094 VQ T& operator=(VQ T&, T);
2096 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2097 unqualified complete object type, VQ is either volatile or empty, and
2098 I is a promoted integral type, there exist candidate operator func-
2100 T*VQ& operator+=(T*VQ&, I);
2101 T*VQ& operator-=(T*VQ&, I);
2103 23For every triple L, VQ, R), where L is an integral or enumeration
2104 type, VQ is either volatile or empty, and R is a promoted integral
2105 type, there exist candidate operator functions of the form
2107 VQ L& operator%=(VQ L&, R);
2108 VQ L& operator<<=(VQ L&, R);
2109 VQ L& operator>>=(VQ L&, R);
2110 VQ L& operator&=(VQ L&, R);
2111 VQ L& operator^=(VQ L&, R);
2112 VQ L& operator|=(VQ L&, R); */
2119 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2121 type2
= ptrdiff_type_node
;
2125 case TRUNC_DIV_EXPR
:
2126 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2130 case TRUNC_MOD_EXPR
:
2136 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2141 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2143 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2144 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2145 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
))
2146 || ((TYPE_PTRMEMFUNC_P (type1
)
2147 || TREE_CODE (type1
) == POINTER_TYPE
)
2148 && null_ptr_cst_p (args
[1])))
2158 type1
= build_reference_type (type1
);
2164 For every pair of promoted arithmetic types L and R, there
2165 exist candidate operator functions of the form
2167 LR operator?(bool, L, R);
2169 where LR is the result of the usual arithmetic conversions
2170 between types L and R.
2172 For every type T, where T is a pointer or pointer-to-member
2173 type, there exist candidate operator functions of the form T
2174 operator?(bool, T, T); */
2176 if (promoted_arithmetic_type_p (type1
)
2177 && promoted_arithmetic_type_p (type2
))
2181 /* Otherwise, the types should be pointers. */
2182 if (!(TYPE_PTR_P (type1
) || TYPE_PTR_TO_MEMBER_P (type1
))
2183 || !(TYPE_PTR_P (type2
) || TYPE_PTR_TO_MEMBER_P (type2
)))
2186 /* We don't check that the two types are the same; the logic
2187 below will actually create two candidates; one in which both
2188 parameter types are TYPE1, and one in which both parameter
2196 /* If we're dealing with two pointer types or two enumeral types,
2197 we need candidates for both of them. */
2198 if (type2
&& !same_type_p (type1
, type2
)
2199 && TREE_CODE (type1
) == TREE_CODE (type2
)
2200 && (TREE_CODE (type1
) == REFERENCE_TYPE
2201 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2202 || (TYPE_PTRMEM_P (type1
) && TYPE_PTRMEM_P (type2
))
2203 || TYPE_PTRMEMFUNC_P (type1
)
2204 || MAYBE_CLASS_TYPE_P (type1
)
2205 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2207 build_builtin_candidate
2208 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
);
2209 build_builtin_candidate
2210 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
);
2214 build_builtin_candidate
2215 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
);
2219 type_decays_to (tree type
)
2221 if (TREE_CODE (type
) == ARRAY_TYPE
)
2222 return build_pointer_type (TREE_TYPE (type
));
2223 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2224 return build_pointer_type (type
);
2228 /* There are three conditions of builtin candidates:
2230 1) bool-taking candidates. These are the same regardless of the input.
2231 2) pointer-pair taking candidates. These are generated for each type
2232 one of the input types converts to.
2233 3) arithmetic candidates. According to the standard, we should generate
2234 all of these, but I'm trying not to...
2236 Here we generate a superset of the possible candidates for this particular
2237 case. That is a subset of the full set the standard defines, plus some
2238 other cases which the standard disallows. add_builtin_candidate will
2239 filter out the invalid set. */
2242 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2243 enum tree_code code2
, tree fnname
, tree
*args
,
2248 tree type
, argtypes
[3];
2249 /* TYPES[i] is the set of possible builtin-operator parameter types
2250 we will consider for the Ith argument. These are represented as
2251 a TREE_LIST; the TREE_VALUE of each node is the potential
2255 for (i
= 0; i
< 3; ++i
)
2258 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2260 argtypes
[i
] = NULL_TREE
;
2265 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2266 and VQ is either volatile or empty, there exist candidate operator
2267 functions of the form
2268 VQ T& operator++(VQ T&); */
2270 case POSTINCREMENT_EXPR
:
2271 case PREINCREMENT_EXPR
:
2272 case POSTDECREMENT_EXPR
:
2273 case PREDECREMENT_EXPR
:
2278 /* 24There also exist candidate operator functions of the form
2279 bool operator!(bool);
2280 bool operator&&(bool, bool);
2281 bool operator||(bool, bool); */
2283 case TRUTH_NOT_EXPR
:
2284 build_builtin_candidate
2285 (candidates
, fnname
, boolean_type_node
,
2286 NULL_TREE
, args
, argtypes
, flags
);
2289 case TRUTH_ORIF_EXPR
:
2290 case TRUTH_ANDIF_EXPR
:
2291 build_builtin_candidate
2292 (candidates
, fnname
, boolean_type_node
,
2293 boolean_type_node
, args
, argtypes
, flags
);
2315 types
[0] = types
[1] = NULL_TREE
;
2317 for (i
= 0; i
< 2; ++i
)
2321 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2325 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2328 convs
= lookup_conversions (argtypes
[i
]);
2330 if (code
== COND_EXPR
)
2332 if (real_lvalue_p (args
[i
]))
2333 types
[i
] = tree_cons
2334 (NULL_TREE
, build_reference_type (argtypes
[i
]), types
[i
]);
2336 types
[i
] = tree_cons
2337 (NULL_TREE
, TYPE_MAIN_VARIANT (argtypes
[i
]), types
[i
]);
2343 for (; convs
; convs
= TREE_CHAIN (convs
))
2345 type
= TREE_TYPE (convs
);
2348 && (TREE_CODE (type
) != REFERENCE_TYPE
2349 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
2352 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
2353 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2355 type
= non_reference (type
);
2356 if (i
!= 0 || ! ref1
)
2358 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
2359 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2360 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2361 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2362 type
= type_promotes_to (type
);
2365 if (! value_member (type
, types
[i
]))
2366 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2371 if (code
== COND_EXPR
&& real_lvalue_p (args
[i
]))
2372 types
[i
] = tree_cons
2373 (NULL_TREE
, build_reference_type (argtypes
[i
]), types
[i
]);
2374 type
= non_reference (argtypes
[i
]);
2375 if (i
!= 0 || ! ref1
)
2377 type
= TYPE_MAIN_VARIANT (type_decays_to (type
));
2378 if (enum_p
&& UNSCOPED_ENUM_P (type
))
2379 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2380 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2381 type
= type_promotes_to (type
);
2383 types
[i
] = tree_cons (NULL_TREE
, type
, types
[i
]);
2387 /* Run through the possible parameter types of both arguments,
2388 creating candidates with those parameter types. */
2389 for (; types
[0]; types
[0] = TREE_CHAIN (types
[0]))
2392 for (type
= types
[1]; type
; type
= TREE_CHAIN (type
))
2393 add_builtin_candidate
2394 (candidates
, code
, code2
, fnname
, TREE_VALUE (types
[0]),
2395 TREE_VALUE (type
), args
, argtypes
, flags
);
2397 add_builtin_candidate
2398 (candidates
, code
, code2
, fnname
, TREE_VALUE (types
[0]),
2399 NULL_TREE
, args
, argtypes
, flags
);
2404 /* If TMPL can be successfully instantiated as indicated by
2405 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
2407 TMPL is the template. EXPLICIT_TARGS are any explicit template
2408 arguments. ARGLIST is the arguments provided at the call-site.
2409 This does not change ARGLIST. The RETURN_TYPE is the desired type
2410 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
2411 as for add_function_candidate. If an OBJ is supplied, FLAGS and
2412 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
2414 static struct z_candidate
*
2415 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
2416 tree ctype
, tree explicit_targs
, tree first_arg
,
2417 const VEC(tree
,gc
) *arglist
, tree return_type
,
2418 tree access_path
, tree conversion_path
,
2419 int flags
, tree obj
, unification_kind_t strict
)
2421 int ntparms
= DECL_NTPARMS (tmpl
);
2422 tree targs
= make_tree_vec (ntparms
);
2424 int skip_without_in_chrg
;
2425 tree first_arg_without_in_chrg
;
2426 tree
*args_without_in_chrg
;
2427 unsigned int nargs_without_in_chrg
;
2428 unsigned int ia
, ix
;
2430 struct z_candidate
*cand
;
2434 nargs
= (first_arg
== NULL_TREE
? 0 : 1) + VEC_length (tree
, arglist
);
2436 skip_without_in_chrg
= 0;
2438 first_arg_without_in_chrg
= first_arg
;
2440 /* We don't do deduction on the in-charge parameter, the VTT
2441 parameter or 'this'. */
2442 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
2444 if (first_arg_without_in_chrg
!= NULL_TREE
)
2445 first_arg_without_in_chrg
= NULL_TREE
;
2447 ++skip_without_in_chrg
;
2450 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
2451 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
2452 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
2454 if (first_arg_without_in_chrg
!= NULL_TREE
)
2455 first_arg_without_in_chrg
= NULL_TREE
;
2457 ++skip_without_in_chrg
;
2460 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
2461 + (VEC_length (tree
, arglist
)
2462 - skip_without_in_chrg
));
2463 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
2465 if (first_arg_without_in_chrg
!= NULL_TREE
)
2467 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
2470 for (ix
= skip_without_in_chrg
;
2471 VEC_iterate (tree
, arglist
, ix
, arg
);
2474 args_without_in_chrg
[ia
] = arg
;
2477 gcc_assert (ia
== nargs_without_in_chrg
);
2479 i
= fn_type_unification (tmpl
, explicit_targs
, targs
,
2480 args_without_in_chrg
,
2481 nargs_without_in_chrg
,
2482 return_type
, strict
, flags
);
2487 fn
= instantiate_template (tmpl
, targs
, tf_none
);
2488 if (fn
== error_mark_node
)
2493 A member function template is never instantiated to perform the
2494 copy of a class object to an object of its class type.
2496 It's a little unclear what this means; the standard explicitly
2497 does allow a template to be used to copy a class. For example,
2502 template <class T> A(const T&);
2505 void g () { A a (f ()); }
2507 the member template will be used to make the copy. The section
2508 quoted above appears in the paragraph that forbids constructors
2509 whose only parameter is (a possibly cv-qualified variant of) the
2510 class type, and a logical interpretation is that the intent was
2511 to forbid the instantiation of member templates which would then
2513 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
2515 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
2516 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
2521 if (obj
!= NULL_TREE
)
2522 /* Aha, this is a conversion function. */
2523 cand
= add_conv_candidate (candidates
, fn
, obj
, first_arg
, arglist
,
2524 access_path
, conversion_path
);
2526 cand
= add_function_candidate (candidates
, fn
, ctype
,
2527 first_arg
, arglist
, access_path
,
2528 conversion_path
, flags
);
2529 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
2530 /* This situation can occur if a member template of a template
2531 class is specialized. Then, instantiate_template might return
2532 an instantiation of the specialization, in which case the
2533 DECL_TI_TEMPLATE field will point at the original
2534 specialization. For example:
2536 template <class T> struct S { template <class U> void f(U);
2537 template <> void f(int) {}; };
2541 Here, TMPL will be template <class U> S<double>::f(U).
2542 And, instantiate template will give us the specialization
2543 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
2544 for this will point at template <class T> template <> S<T>::f(int),
2545 so that we can find the definition. For the purposes of
2546 overload resolution, however, we want the original TMPL. */
2547 cand
->template_decl
= tree_cons (tmpl
, targs
, NULL_TREE
);
2549 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
2555 static struct z_candidate
*
2556 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
2557 tree explicit_targs
, tree first_arg
,
2558 const VEC(tree
,gc
) *arglist
, tree return_type
,
2559 tree access_path
, tree conversion_path
, int flags
,
2560 unification_kind_t strict
)
2563 add_template_candidate_real (candidates
, tmpl
, ctype
,
2564 explicit_targs
, first_arg
, arglist
,
2565 return_type
, access_path
, conversion_path
,
2566 flags
, NULL_TREE
, strict
);
2570 static struct z_candidate
*
2571 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
2572 tree obj
, tree first_arg
,
2573 const VEC(tree
,gc
) *arglist
,
2574 tree return_type
, tree access_path
,
2575 tree conversion_path
)
2578 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
2579 first_arg
, arglist
, return_type
, access_path
,
2580 conversion_path
, 0, obj
, DEDUCE_CONV
);
2583 /* The CANDS are the set of candidates that were considered for
2584 overload resolution. Return the set of viable candidates. If none
2585 of the candidates were viable, set *ANY_VIABLE_P to true. STRICT_P
2586 is true if a candidate should be considered viable only if it is
2589 static struct z_candidate
*
2590 splice_viable (struct z_candidate
*cands
,
2594 struct z_candidate
*viable
;
2595 struct z_candidate
**last_viable
;
2596 struct z_candidate
**cand
;
2599 last_viable
= &viable
;
2600 *any_viable_p
= false;
2605 struct z_candidate
*c
= *cand
;
2606 if (strict_p
? c
->viable
== 1 : c
->viable
)
2611 last_viable
= &c
->next
;
2612 *any_viable_p
= true;
2618 return viable
? viable
: cands
;
2622 any_strictly_viable (struct z_candidate
*cands
)
2624 for (; cands
; cands
= cands
->next
)
2625 if (cands
->viable
== 1)
2630 /* OBJ is being used in an expression like "OBJ.f (...)". In other
2631 words, it is about to become the "this" pointer for a member
2632 function call. Take the address of the object. */
2635 build_this (tree obj
)
2637 /* In a template, we are only concerned about the type of the
2638 expression, so we can take a shortcut. */
2639 if (processing_template_decl
)
2640 return build_address (obj
);
2642 return cp_build_unary_op (ADDR_EXPR
, obj
, 0, tf_warning_or_error
);
2645 /* Returns true iff functions are equivalent. Equivalent functions are
2646 not '==' only if one is a function-local extern function or if
2647 both are extern "C". */
2650 equal_functions (tree fn1
, tree fn2
)
2652 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
2653 || DECL_EXTERN_C_FUNCTION_P (fn1
))
2654 return decls_match (fn1
, fn2
);
2658 /* Print information about one overload candidate CANDIDATE. MSGSTR
2659 is the text to print before the candidate itself.
2661 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
2662 to have been run through gettext by the caller. This wart makes
2663 life simpler in print_z_candidates and for the translators. */
2666 print_z_candidate (const char *msgstr
, struct z_candidate
*candidate
)
2668 if (TREE_CODE (candidate
->fn
) == IDENTIFIER_NODE
)
2670 if (candidate
->num_convs
== 3)
2671 inform (input_location
, "%s %D(%T, %T, %T) <built-in>", msgstr
, candidate
->fn
,
2672 candidate
->convs
[0]->type
,
2673 candidate
->convs
[1]->type
,
2674 candidate
->convs
[2]->type
);
2675 else if (candidate
->num_convs
== 2)
2676 inform (input_location
, "%s %D(%T, %T) <built-in>", msgstr
, candidate
->fn
,
2677 candidate
->convs
[0]->type
,
2678 candidate
->convs
[1]->type
);
2680 inform (input_location
, "%s %D(%T) <built-in>", msgstr
, candidate
->fn
,
2681 candidate
->convs
[0]->type
);
2683 else if (TYPE_P (candidate
->fn
))
2684 inform (input_location
, "%s %T <conversion>", msgstr
, candidate
->fn
);
2685 else if (candidate
->viable
== -1)
2686 inform (input_location
, "%s %+#D <near match>", msgstr
, candidate
->fn
);
2688 inform (input_location
, "%s %+#D", msgstr
, candidate
->fn
);
2692 print_z_candidates (struct z_candidate
*candidates
)
2695 struct z_candidate
*cand1
;
2696 struct z_candidate
**cand2
;
2698 /* There may be duplicates in the set of candidates. We put off
2699 checking this condition as long as possible, since we have no way
2700 to eliminate duplicates from a set of functions in less than n^2
2701 time. Now we are about to emit an error message, so it is more
2702 permissible to go slowly. */
2703 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
2705 tree fn
= cand1
->fn
;
2706 /* Skip builtin candidates and conversion functions. */
2707 if (TREE_CODE (fn
) != FUNCTION_DECL
)
2709 cand2
= &cand1
->next
;
2712 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
2713 && equal_functions (fn
, (*cand2
)->fn
))
2714 *cand2
= (*cand2
)->next
;
2716 cand2
= &(*cand2
)->next
;
2723 str
= _("candidates are:");
2724 print_z_candidate (str
, candidates
);
2725 if (candidates
->next
)
2727 /* Indent successive candidates by the width of the translation
2728 of the above string. */
2729 size_t len
= gcc_gettext_width (str
) + 1;
2730 char *spaces
= (char *) alloca (len
);
2731 memset (spaces
, ' ', len
-1);
2732 spaces
[len
- 1] = '\0';
2734 candidates
= candidates
->next
;
2737 print_z_candidate (spaces
, candidates
);
2738 candidates
= candidates
->next
;
2744 /* USER_SEQ is a user-defined conversion sequence, beginning with a
2745 USER_CONV. STD_SEQ is the standard conversion sequence applied to
2746 the result of the conversion function to convert it to the final
2747 desired type. Merge the two sequences into a single sequence,
2748 and return the merged sequence. */
2751 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
2755 gcc_assert (user_seq
->kind
== ck_user
);
2757 /* Find the end of the second conversion sequence. */
2759 while ((*t
)->kind
!= ck_identity
)
2760 t
= &((*t
)->u
.next
);
2762 /* Replace the identity conversion with the user conversion
2766 /* The entire sequence is a user-conversion sequence. */
2767 std_seq
->user_conv_p
= true;
2772 /* Returns the best overload candidate to perform the requested
2773 conversion. This function is used for three the overloading situations
2774 described in [over.match.copy], [over.match.conv], and [over.match.ref].
2775 If TOTYPE is a REFERENCE_TYPE, we're trying to find an lvalue binding as
2776 per [dcl.init.ref], so we ignore temporary bindings. */
2778 static struct z_candidate
*
2779 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
)
2781 struct z_candidate
*candidates
, *cand
;
2782 tree fromtype
= TREE_TYPE (expr
);
2783 tree ctors
= NULL_TREE
;
2784 tree conv_fns
= NULL_TREE
;
2785 conversion
*conv
= NULL
;
2786 tree first_arg
= NULL_TREE
;
2787 VEC(tree
,gc
) *args
= NULL
;
2791 /* We represent conversion within a hierarchy using RVALUE_CONV and
2792 BASE_CONV, as specified by [over.best.ics]; these become plain
2793 constructor calls, as specified in [dcl.init]. */
2794 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
2795 || !DERIVED_FROM_P (totype
, fromtype
));
2797 if (MAYBE_CLASS_TYPE_P (totype
))
2798 ctors
= lookup_fnfields (totype
, complete_ctor_identifier
, 0);
2800 if (MAYBE_CLASS_TYPE_P (fromtype
))
2802 tree to_nonref
= non_reference (totype
);
2803 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
2804 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
2805 && DERIVED_FROM_P (to_nonref
, fromtype
)))
2807 /* [class.conv.fct] A conversion function is never used to
2808 convert a (possibly cv-qualified) object to the (possibly
2809 cv-qualified) same object type (or a reference to it), to a
2810 (possibly cv-qualified) base class of that type (or a
2811 reference to it)... */
2814 conv_fns
= lookup_conversions (fromtype
);
2818 flags
|= LOOKUP_NO_CONVERSION
;
2820 /* It's OK to bind a temporary for converting constructor arguments, but
2821 not in converting the return value of a conversion operator. */
2822 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
);
2823 flags
&= ~LOOKUP_NO_TEMP_BIND
;
2827 ctors
= BASELINK_FUNCTIONS (ctors
);
2829 first_arg
= build_int_cst (build_pointer_type (totype
), 0);
2830 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
2831 && !TYPE_HAS_LIST_CTOR (totype
))
2833 args
= ctor_to_vec (expr
);
2834 /* We still allow more conversions within an init-list. */
2835 flags
= ((flags
& ~LOOKUP_NO_CONVERSION
)
2836 /* But not for the copy ctor. */
2837 |LOOKUP_NO_COPY_CTOR_CONVERSION
2838 |LOOKUP_NO_NARROWING
);
2841 args
= make_tree_vector_single (expr
);
2843 /* We should never try to call the abstract or base constructor
2845 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors
))
2846 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors
)));
2848 for (; ctors
; ctors
= OVL_NEXT (ctors
))
2850 tree ctor
= OVL_CURRENT (ctors
);
2851 if (DECL_NONCONVERTING_P (ctor
)
2852 && !BRACE_ENCLOSED_INITIALIZER_P (expr
))
2855 if (TREE_CODE (ctor
) == TEMPLATE_DECL
)
2856 cand
= add_template_candidate (&candidates
, ctor
, totype
,
2857 NULL_TREE
, first_arg
, args
, NULL_TREE
,
2858 TYPE_BINFO (totype
),
2859 TYPE_BINFO (totype
),
2863 cand
= add_function_candidate (&candidates
, ctor
, totype
,
2864 first_arg
, args
, TYPE_BINFO (totype
),
2865 TYPE_BINFO (totype
),
2870 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
2872 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
2873 set, then this is copy-initialization. In that case, "The
2874 result of the call is then used to direct-initialize the
2875 object that is the destination of the copy-initialization."
2878 We represent this in the conversion sequence with an
2879 rvalue conversion, which means a constructor call. */
2880 if (TREE_CODE (totype
) != REFERENCE_TYPE
2881 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
2883 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
2888 first_arg
= build_this (expr
);
2890 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
2893 tree conversion_path
= TREE_PURPOSE (conv_fns
);
2895 /* If we are called to convert to a reference type, we are trying to
2896 find an lvalue binding, so don't even consider temporaries. If
2897 we don't find an lvalue binding, the caller will try again to
2898 look for a temporary binding. */
2899 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
2900 convflags
|= LOOKUP_NO_TEMP_BIND
;
2902 for (fns
= TREE_VALUE (conv_fns
); fns
; fns
= OVL_NEXT (fns
))
2904 tree fn
= OVL_CURRENT (fns
);
2906 if (DECL_NONCONVERTING_P (fn
)
2907 && (flags
& LOOKUP_ONLYCONVERTING
))
2910 /* [over.match.funcs] For conversion functions, the function
2911 is considered to be a member of the class of the implicit
2912 object argument for the purpose of defining the type of
2913 the implicit object parameter.
2915 So we pass fromtype as CTYPE to add_*_candidate. */
2917 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
2918 cand
= add_template_candidate (&candidates
, fn
, fromtype
,
2920 first_arg
, NULL
, totype
,
2921 TYPE_BINFO (fromtype
),
2926 cand
= add_function_candidate (&candidates
, fn
, fromtype
,
2928 TYPE_BINFO (fromtype
),
2935 = implicit_conversion (totype
,
2936 TREE_TYPE (TREE_TYPE (cand
->fn
)),
2938 /*c_cast_p=*/false, convflags
);
2940 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
2941 copy-initialization. In that case, "The result of the
2942 call is then used to direct-initialize the object that is
2943 the destination of the copy-initialization." [dcl.init]
2945 We represent this in the conversion sequence with an
2946 rvalue conversion, which means a constructor call. But
2947 don't add a second rvalue conversion if there's already
2948 one there. Which there really shouldn't be, but it's
2949 harmless since we'd add it here anyway. */
2950 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
2951 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
2952 ics
= build_conv (ck_rvalue
, totype
, ics
);
2954 cand
->second_conv
= ics
;
2958 else if (candidates
->viable
== 1 && ics
->bad_p
)
2964 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
2968 cand
= tourney (candidates
);
2971 if (flags
& LOOKUP_COMPLAIN
)
2973 error ("conversion from %qT to %qT is ambiguous",
2975 print_z_candidates (candidates
);
2978 cand
= candidates
; /* any one will do */
2979 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
2980 cand
->second_conv
->user_conv_p
= true;
2981 if (!any_strictly_viable (candidates
))
2982 cand
->second_conv
->bad_p
= true;
2983 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
2984 ambiguous conversion is no worse than another user-defined
2990 /* Build the user conversion sequence. */
2993 (DECL_CONSTRUCTOR_P (cand
->fn
)
2994 ? totype
: non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)))),
2995 build_identity_conv (TREE_TYPE (expr
), expr
));
2998 /* Remember that this was a list-initialization. */
2999 if (flags
& LOOKUP_NO_NARROWING
)
3000 conv
->check_narrowing
= true;
3002 /* Combine it with the second conversion sequence. */
3003 cand
->second_conv
= merge_conversion_sequences (conv
,
3006 if (cand
->viable
== -1)
3007 cand
->second_conv
->bad_p
= true;
3013 build_user_type_conversion (tree totype
, tree expr
, int flags
)
3015 struct z_candidate
*cand
3016 = build_user_type_conversion_1 (totype
, expr
, flags
);
3020 if (cand
->second_conv
->kind
== ck_ambig
)
3021 return error_mark_node
;
3022 expr
= convert_like (cand
->second_conv
, expr
, tf_warning_or_error
);
3023 return convert_from_reference (expr
);
3028 /* Do any initial processing on the arguments to a function call. */
3030 static VEC(tree
,gc
) *
3031 resolve_args (VEC(tree
,gc
) *args
)
3036 for (ix
= 0; VEC_iterate (tree
, args
, ix
, arg
); ++ix
)
3038 if (error_operand_p (arg
))
3040 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
3042 error ("invalid use of void expression");
3045 else if (invalid_nonstatic_memfn_p (arg
, tf_warning_or_error
))
3051 /* Perform overload resolution on FN, which is called with the ARGS.
3053 Return the candidate function selected by overload resolution, or
3054 NULL if the event that overload resolution failed. In the case
3055 that overload resolution fails, *CANDIDATES will be the set of
3056 candidates considered, and ANY_VIABLE_P will be set to true or
3057 false to indicate whether or not any of the candidates were
3060 The ARGS should already have gone through RESOLVE_ARGS before this
3061 function is called. */
3063 static struct z_candidate
*
3064 perform_overload_resolution (tree fn
,
3065 const VEC(tree
,gc
) *args
,
3066 struct z_candidate
**candidates
,
3069 struct z_candidate
*cand
;
3070 tree explicit_targs
= NULL_TREE
;
3071 int template_only
= 0;
3074 *any_viable_p
= true;
3077 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
3078 || TREE_CODE (fn
) == TEMPLATE_DECL
3079 || TREE_CODE (fn
) == OVERLOAD
3080 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
3082 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3084 explicit_targs
= TREE_OPERAND (fn
, 1);
3085 fn
= TREE_OPERAND (fn
, 0);
3089 /* Add the various candidate functions. */
3090 add_candidates (fn
, args
, explicit_targs
, template_only
,
3091 /*conversion_path=*/NULL_TREE
,
3092 /*access_path=*/NULL_TREE
,
3096 *candidates
= splice_viable (*candidates
, pedantic
, any_viable_p
);
3100 cand
= tourney (*candidates
);
3104 /* Return an expression for a call to FN (a namespace-scope function,
3105 or a static member function) with the ARGS. This may change
3109 build_new_function_call (tree fn
, VEC(tree
,gc
) **args
, bool koenig_p
,
3110 tsubst_flags_t complain
)
3112 struct z_candidate
*candidates
, *cand
;
3117 if (args
!= NULL
&& *args
!= NULL
)
3119 *args
= resolve_args (*args
);
3121 return error_mark_node
;
3124 /* If this function was found without using argument dependent
3125 lookup, then we want to ignore any undeclared friend
3131 fn
= remove_hidden_names (fn
);
3134 if (complain
& tf_error
)
3135 error ("no matching function for call to %<%D(%A)%>",
3136 DECL_NAME (OVL_CURRENT (orig_fn
)),
3137 build_tree_list_vec (*args
));
3138 return error_mark_node
;
3142 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3143 p
= conversion_obstack_alloc (0);
3145 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
);
3149 if (complain
& tf_error
)
3151 if (!any_viable_p
&& candidates
&& ! candidates
->next
)
3152 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
3153 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3154 fn
= TREE_OPERAND (fn
, 0);
3156 error ("no matching function for call to %<%D(%A)%>",
3157 DECL_NAME (OVL_CURRENT (fn
)), build_tree_list_vec (*args
));
3159 error ("call of overloaded %<%D(%A)%> is ambiguous",
3160 DECL_NAME (OVL_CURRENT (fn
)), build_tree_list_vec (*args
));
3162 print_z_candidates (candidates
);
3164 result
= error_mark_node
;
3167 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
3169 /* Free all the conversions we allocated. */
3170 obstack_free (&conversion_obstack
, p
);
3175 /* Build a call to a global operator new. FNNAME is the name of the
3176 operator (either "operator new" or "operator new[]") and ARGS are
3177 the arguments provided. This may change ARGS. *SIZE points to the
3178 total number of bytes required by the allocation, and is updated if
3179 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
3180 be used. If this function determines that no cookie should be
3181 used, after all, *COOKIE_SIZE is set to NULL_TREE. If FN is
3182 non-NULL, it will be set, upon return, to the allocation function
3186 build_operator_new_call (tree fnname
, VEC(tree
,gc
) **args
,
3187 tree
*size
, tree
*cookie_size
,
3191 struct z_candidate
*candidates
;
3192 struct z_candidate
*cand
;
3197 VEC_safe_insert (tree
, gc
, *args
, 0, *size
);
3198 *args
= resolve_args (*args
);
3200 return error_mark_node
;
3206 If this lookup fails to find the name, or if the allocated type
3207 is not a class type, the allocation function's name is looked
3208 up in the global scope.
3210 we disregard block-scope declarations of "operator new". */
3211 fns
= lookup_function_nonclass (fnname
, *args
, /*block_p=*/false);
3213 /* Figure out what function is being called. */
3214 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
);
3216 /* If no suitable function could be found, issue an error message
3221 error ("no matching function for call to %<%D(%A)%>",
3222 DECL_NAME (OVL_CURRENT (fns
)), build_tree_list_vec (*args
));
3224 error ("call of overloaded %<%D(%A)%> is ambiguous",
3225 DECL_NAME (OVL_CURRENT (fns
)), build_tree_list_vec (*args
));
3227 print_z_candidates (candidates
);
3228 return error_mark_node
;
3231 /* If a cookie is required, add some extra space. Whether
3232 or not a cookie is required cannot be determined until
3233 after we know which function was called. */
3236 bool use_cookie
= true;
3237 if (!abi_version_at_least (2))
3239 /* In G++ 3.2, the check was implemented incorrectly; it
3240 looked at the placement expression, rather than the
3241 type of the function. */
3242 if (VEC_length (tree
, *args
) == 2
3243 && same_type_p (TREE_TYPE (VEC_index (tree
, *args
, 1)),
3251 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
3252 /* Skip the size_t parameter. */
3253 arg_types
= TREE_CHAIN (arg_types
);
3254 /* Check the remaining parameters (if any). */
3256 && TREE_CHAIN (arg_types
) == void_list_node
3257 && same_type_p (TREE_VALUE (arg_types
),
3261 /* If we need a cookie, adjust the number of bytes allocated. */
3264 /* Update the total size. */
3265 *size
= size_binop (PLUS_EXPR
, *size
, *cookie_size
);
3266 /* Update the argument list to reflect the adjusted size. */
3267 VEC_replace (tree
, *args
, 0, *size
);
3270 *cookie_size
= NULL_TREE
;
3273 /* Tell our caller which function we decided to call. */
3277 /* Build the CALL_EXPR. */
3278 return build_over_call (cand
, LOOKUP_NORMAL
, tf_warning_or_error
);
3281 /* Build a new call to operator(). This may change ARGS. */
3284 build_op_call (tree obj
, VEC(tree
,gc
) **args
, tsubst_flags_t complain
)
3286 struct z_candidate
*candidates
= 0, *cand
;
3287 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
3288 tree type
= TREE_TYPE (obj
);
3290 tree result
= NULL_TREE
;
3293 if (error_operand_p (obj
))
3294 return error_mark_node
;
3296 obj
= prep_operand (obj
);
3298 if (TYPE_PTRMEMFUNC_P (type
))
3300 if (complain
& tf_error
)
3301 /* It's no good looking for an overloaded operator() on a
3302 pointer-to-member-function. */
3303 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj
);
3304 return error_mark_node
;
3307 if (TYPE_BINFO (type
))
3309 fns
= lookup_fnfields (TYPE_BINFO (type
), ansi_opname (CALL_EXPR
), 1);
3310 if (fns
== error_mark_node
)
3311 return error_mark_node
;
3316 if (args
!= NULL
&& *args
!= NULL
)
3318 *args
= resolve_args (*args
);
3320 return error_mark_node
;
3323 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3324 p
= conversion_obstack_alloc (0);
3328 tree base
= BINFO_TYPE (BASELINK_BINFO (fns
));
3329 first_mem_arg
= build_this (obj
);
3331 for (fns
= BASELINK_FUNCTIONS (fns
); fns
; fns
= OVL_NEXT (fns
))
3333 tree fn
= OVL_CURRENT (fns
);
3334 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
3335 add_template_candidate (&candidates
, fn
, base
, NULL_TREE
,
3336 first_mem_arg
, *args
, NULL_TREE
,
3339 LOOKUP_NORMAL
, DEDUCE_CALL
);
3341 add_function_candidate
3342 (&candidates
, fn
, base
, first_mem_arg
, *args
, TYPE_BINFO (type
),
3343 TYPE_BINFO (type
), LOOKUP_NORMAL
);
3347 convs
= lookup_conversions (type
);
3349 for (; convs
; convs
= TREE_CHAIN (convs
))
3351 tree fns
= TREE_VALUE (convs
);
3352 tree totype
= TREE_TYPE (convs
);
3354 if ((TREE_CODE (totype
) == POINTER_TYPE
3355 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
3356 || (TREE_CODE (totype
) == REFERENCE_TYPE
3357 && TREE_CODE (TREE_TYPE (totype
)) == FUNCTION_TYPE
)
3358 || (TREE_CODE (totype
) == REFERENCE_TYPE
3359 && TREE_CODE (TREE_TYPE (totype
)) == POINTER_TYPE
3360 && TREE_CODE (TREE_TYPE (TREE_TYPE (totype
))) == FUNCTION_TYPE
))
3361 for (; fns
; fns
= OVL_NEXT (fns
))
3363 tree fn
= OVL_CURRENT (fns
);
3365 if (DECL_NONCONVERTING_P (fn
))
3368 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
3369 add_template_conv_candidate
3370 (&candidates
, fn
, obj
, NULL_TREE
, *args
, totype
,
3371 /*access_path=*/NULL_TREE
,
3372 /*conversion_path=*/NULL_TREE
);
3374 add_conv_candidate (&candidates
, fn
, obj
, NULL_TREE
,
3375 *args
, /*conversion_path=*/NULL_TREE
,
3376 /*access_path=*/NULL_TREE
);
3380 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3383 if (complain
& tf_error
)
3385 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
3386 build_tree_list_vec (*args
));
3387 print_z_candidates (candidates
);
3389 result
= error_mark_node
;
3393 cand
= tourney (candidates
);
3396 if (complain
& tf_error
)
3398 error ("call of %<(%T) (%A)%> is ambiguous",
3399 TREE_TYPE (obj
), build_tree_list_vec (*args
));
3400 print_z_candidates (candidates
);
3402 result
= error_mark_node
;
3404 /* Since cand->fn will be a type, not a function, for a conversion
3405 function, we must be careful not to unconditionally look at
3407 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
3408 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
3409 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
3412 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
, -1,
3414 obj
= convert_from_reference (obj
);
3415 result
= cp_build_function_call_vec (obj
, args
, complain
);
3419 /* Free all the conversions we allocated. */
3420 obstack_free (&conversion_obstack
, p
);
3426 op_error (enum tree_code code
, enum tree_code code2
,
3427 tree arg1
, tree arg2
, tree arg3
, const char *problem
)
3431 if (code
== MODIFY_EXPR
)
3432 opname
= assignment_operator_name_info
[code2
].name
;
3434 opname
= operator_name_info
[code
].name
;
3439 error ("%s for ternary %<operator?:%> in %<%E ? %E : %E%>",
3440 problem
, arg1
, arg2
, arg3
);
3443 case POSTINCREMENT_EXPR
:
3444 case POSTDECREMENT_EXPR
:
3445 error ("%s for %<operator%s%> in %<%E%s%>", problem
, opname
, arg1
, opname
);
3449 error ("%s for %<operator[]%> in %<%E[%E]%>", problem
, arg1
, arg2
);
3454 error ("%s for %qs in %<%s %E%>", problem
, opname
, opname
, arg1
);
3459 error ("%s for %<operator%s%> in %<%E %s %E%>",
3460 problem
, opname
, arg1
, opname
, arg2
);
3462 error ("%s for %<operator%s%> in %<%s%E%>",
3463 problem
, opname
, opname
, arg1
);
3468 /* Return the implicit conversion sequence that could be used to
3469 convert E1 to E2 in [expr.cond]. */
3472 conditional_conversion (tree e1
, tree e2
)
3474 tree t1
= non_reference (TREE_TYPE (e1
));
3475 tree t2
= non_reference (TREE_TYPE (e2
));
3481 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
3482 implicitly converted (clause _conv_) to the type "reference to
3483 T2", subject to the constraint that in the conversion the
3484 reference must bind directly (_dcl.init.ref_) to E1. */
3485 if (real_lvalue_p (e2
))
3487 conv
= implicit_conversion (build_reference_type (t2
),
3491 LOOKUP_NO_TEMP_BIND
|LOOKUP_ONLYCONVERTING
);
3498 If E1 and E2 have class type, and the underlying class types are
3499 the same or one is a base class of the other: E1 can be converted
3500 to match E2 if the class of T2 is the same type as, or a base
3501 class of, the class of T1, and the cv-qualification of T2 is the
3502 same cv-qualification as, or a greater cv-qualification than, the
3503 cv-qualification of T1. If the conversion is applied, E1 is
3504 changed to an rvalue of type T2 that still refers to the original
3505 source class object (or the appropriate subobject thereof). */
3506 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
3507 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
3509 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
3511 conv
= build_identity_conv (t1
, e1
);
3512 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
3513 TYPE_MAIN_VARIANT (t2
)))
3514 conv
= build_conv (ck_base
, t2
, conv
);
3516 conv
= build_conv (ck_rvalue
, t2
, conv
);
3525 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
3526 converted to the type that expression E2 would have if E2 were
3527 converted to an rvalue (or the type it has, if E2 is an rvalue). */
3528 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
3532 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
3533 arguments to the conditional expression. */
3536 build_conditional_expr (tree arg1
, tree arg2
, tree arg3
,
3537 tsubst_flags_t complain
)
3541 tree result
= NULL_TREE
;
3542 tree result_type
= NULL_TREE
;
3543 bool lvalue_p
= true;
3544 struct z_candidate
*candidates
= 0;
3545 struct z_candidate
*cand
;
3548 /* As a G++ extension, the second argument to the conditional can be
3549 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
3550 c'.) If the second operand is omitted, make sure it is
3551 calculated only once. */
3554 if (complain
& tf_error
)
3555 pedwarn (input_location
, OPT_pedantic
,
3556 "ISO C++ forbids omitting the middle term of a ?: expression");
3558 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
3559 if (real_lvalue_p (arg1
))
3560 arg2
= arg1
= stabilize_reference (arg1
);
3562 arg2
= arg1
= save_expr (arg1
);
3567 The first expression is implicitly converted to bool (clause
3569 arg1
= perform_implicit_conversion (boolean_type_node
, arg1
, complain
);
3571 /* If something has already gone wrong, just pass that fact up the
3573 if (error_operand_p (arg1
)
3574 || error_operand_p (arg2
)
3575 || error_operand_p (arg3
))
3576 return error_mark_node
;
3580 If either the second or the third operand has type (possibly
3581 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
3582 array-to-pointer (_conv.array_), and function-to-pointer
3583 (_conv.func_) standard conversions are performed on the second
3584 and third operands. */
3585 arg2_type
= unlowered_expr_type (arg2
);
3586 arg3_type
= unlowered_expr_type (arg3
);
3587 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
3589 /* Do the conversions. We don't these for `void' type arguments
3590 since it can't have any effect and since decay_conversion
3591 does not handle that case gracefully. */
3592 if (!VOID_TYPE_P (arg2_type
))
3593 arg2
= decay_conversion (arg2
);
3594 if (!VOID_TYPE_P (arg3_type
))
3595 arg3
= decay_conversion (arg3
);
3596 arg2_type
= TREE_TYPE (arg2
);
3597 arg3_type
= TREE_TYPE (arg3
);
3601 One of the following shall hold:
3603 --The second or the third operand (but not both) is a
3604 throw-expression (_except.throw_); the result is of the
3605 type of the other and is an rvalue.
3607 --Both the second and the third operands have type void; the
3608 result is of type void and is an rvalue.
3610 We must avoid calling force_rvalue for expressions of type
3611 "void" because it will complain that their value is being
3613 if (TREE_CODE (arg2
) == THROW_EXPR
3614 && TREE_CODE (arg3
) != THROW_EXPR
)
3616 if (!VOID_TYPE_P (arg3_type
))
3617 arg3
= force_rvalue (arg3
);
3618 arg3_type
= TREE_TYPE (arg3
);
3619 result_type
= arg3_type
;
3621 else if (TREE_CODE (arg2
) != THROW_EXPR
3622 && TREE_CODE (arg3
) == THROW_EXPR
)
3624 if (!VOID_TYPE_P (arg2_type
))
3625 arg2
= force_rvalue (arg2
);
3626 arg2_type
= TREE_TYPE (arg2
);
3627 result_type
= arg2_type
;
3629 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
3630 result_type
= void_type_node
;
3633 if (complain
& tf_error
)
3635 if (VOID_TYPE_P (arg2_type
))
3636 error ("second operand to the conditional operator "
3637 "is of type %<void%>, "
3638 "but the third operand is neither a throw-expression "
3639 "nor of type %<void%>");
3641 error ("third operand to the conditional operator "
3642 "is of type %<void%>, "
3643 "but the second operand is neither a throw-expression "
3644 "nor of type %<void%>");
3646 return error_mark_node
;
3650 goto valid_operands
;
3654 Otherwise, if the second and third operand have different types,
3655 and either has (possibly cv-qualified) class type, an attempt is
3656 made to convert each of those operands to the type of the other. */
3657 else if (!same_type_p (arg2_type
, arg3_type
)
3658 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
3663 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3664 p
= conversion_obstack_alloc (0);
3666 conv2
= conditional_conversion (arg2
, arg3
);
3667 conv3
= conditional_conversion (arg3
, arg2
);
3671 If both can be converted, or one can be converted but the
3672 conversion is ambiguous, the program is ill-formed. If
3673 neither can be converted, the operands are left unchanged and
3674 further checking is performed as described below. If exactly
3675 one conversion is possible, that conversion is applied to the
3676 chosen operand and the converted operand is used in place of
3677 the original operand for the remainder of this section. */
3678 if ((conv2
&& !conv2
->bad_p
3679 && conv3
&& !conv3
->bad_p
)
3680 || (conv2
&& conv2
->kind
== ck_ambig
)
3681 || (conv3
&& conv3
->kind
== ck_ambig
))
3683 error ("operands to ?: have different types %qT and %qT",
3684 arg2_type
, arg3_type
);
3685 result
= error_mark_node
;
3687 else if (conv2
&& (!conv2
->bad_p
|| !conv3
))
3689 arg2
= convert_like (conv2
, arg2
, complain
);
3690 arg2
= convert_from_reference (arg2
);
3691 arg2_type
= TREE_TYPE (arg2
);
3692 /* Even if CONV2 is a valid conversion, the result of the
3693 conversion may be invalid. For example, if ARG3 has type
3694 "volatile X", and X does not have a copy constructor
3695 accepting a "volatile X&", then even if ARG2 can be
3696 converted to X, the conversion will fail. */
3697 if (error_operand_p (arg2
))
3698 result
= error_mark_node
;
3700 else if (conv3
&& (!conv3
->bad_p
|| !conv2
))
3702 arg3
= convert_like (conv3
, arg3
, complain
);
3703 arg3
= convert_from_reference (arg3
);
3704 arg3_type
= TREE_TYPE (arg3
);
3705 if (error_operand_p (arg3
))
3706 result
= error_mark_node
;
3709 /* Free all the conversions we allocated. */
3710 obstack_free (&conversion_obstack
, p
);
3715 /* If, after the conversion, both operands have class type,
3716 treat the cv-qualification of both operands as if it were the
3717 union of the cv-qualification of the operands.
3719 The standard is not clear about what to do in this
3720 circumstance. For example, if the first operand has type
3721 "const X" and the second operand has a user-defined
3722 conversion to "volatile X", what is the type of the second
3723 operand after this step? Making it be "const X" (matching
3724 the first operand) seems wrong, as that discards the
3725 qualification without actually performing a copy. Leaving it
3726 as "volatile X" seems wrong as that will result in the
3727 conditional expression failing altogether, even though,
3728 according to this step, the one operand could be converted to
3729 the type of the other. */
3730 if ((conv2
|| conv3
)
3731 && CLASS_TYPE_P (arg2_type
)
3732 && TYPE_QUALS (arg2_type
) != TYPE_QUALS (arg3_type
))
3733 arg2_type
= arg3_type
=
3734 cp_build_qualified_type (arg2_type
,
3735 TYPE_QUALS (arg2_type
)
3736 | TYPE_QUALS (arg3_type
));
3741 If the second and third operands are lvalues and have the same
3742 type, the result is of that type and is an lvalue. */
3743 if (real_lvalue_p (arg2
)
3744 && real_lvalue_p (arg3
)
3745 && same_type_p (arg2_type
, arg3_type
))
3747 result_type
= arg2_type
;
3748 goto valid_operands
;
3753 Otherwise, the result is an rvalue. If the second and third
3754 operand do not have the same type, and either has (possibly
3755 cv-qualified) class type, overload resolution is used to
3756 determine the conversions (if any) to be applied to the operands
3757 (_over.match.oper_, _over.built_). */
3759 if (!same_type_p (arg2_type
, arg3_type
)
3760 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
3766 /* Rearrange the arguments so that add_builtin_candidate only has
3767 to know about two args. In build_builtin_candidates, the
3768 arguments are unscrambled. */
3772 add_builtin_candidates (&candidates
,
3775 ansi_opname (COND_EXPR
),
3781 If the overload resolution fails, the program is
3783 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
3786 if (complain
& tf_error
)
3788 op_error (COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, "no match");
3789 print_z_candidates (candidates
);
3791 return error_mark_node
;
3793 cand
= tourney (candidates
);
3796 if (complain
& tf_error
)
3798 op_error (COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, "no match");
3799 print_z_candidates (candidates
);
3801 return error_mark_node
;
3806 Otherwise, the conversions thus determined are applied, and
3807 the converted operands are used in place of the original
3808 operands for the remainder of this section. */
3809 conv
= cand
->convs
[0];
3810 arg1
= convert_like (conv
, arg1
, complain
);
3811 conv
= cand
->convs
[1];
3812 arg2
= convert_like (conv
, arg2
, complain
);
3813 conv
= cand
->convs
[2];
3814 arg3
= convert_like (conv
, arg3
, complain
);
3819 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
3820 and function-to-pointer (_conv.func_) standard conversions are
3821 performed on the second and third operands.
3823 We need to force the lvalue-to-rvalue conversion here for class types,
3824 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
3825 that isn't wrapped with a TARGET_EXPR plays havoc with exception
3828 arg2
= force_rvalue (arg2
);
3829 if (!CLASS_TYPE_P (arg2_type
))
3830 arg2_type
= TREE_TYPE (arg2
);
3832 arg3
= force_rvalue (arg3
);
3833 if (!CLASS_TYPE_P (arg2_type
))
3834 arg3_type
= TREE_TYPE (arg3
);
3836 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
3837 return error_mark_node
;
3841 After those conversions, one of the following shall hold:
3843 --The second and third operands have the same type; the result is of
3845 if (same_type_p (arg2_type
, arg3_type
))
3846 result_type
= arg2_type
;
3849 --The second and third operands have arithmetic or enumeration
3850 type; the usual arithmetic conversions are performed to bring
3851 them to a common type, and the result is of that type. */
3852 else if ((ARITHMETIC_TYPE_P (arg2_type
)
3853 || UNSCOPED_ENUM_P (arg2_type
))
3854 && (ARITHMETIC_TYPE_P (arg3_type
)
3855 || UNSCOPED_ENUM_P (arg3_type
)))
3857 /* In this case, there is always a common type. */
3858 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
3861 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
3862 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
3864 if (complain
& tf_warning
)
3866 "enumeral mismatch in conditional expression: %qT vs %qT",
3867 arg2_type
, arg3_type
);
3869 else if (extra_warnings
3870 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
3871 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
3872 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
3873 && !same_type_p (arg2_type
, type_promotes_to (arg3_type
)))))
3875 if (complain
& tf_warning
)
3877 "enumeral and non-enumeral type in conditional expression");
3880 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
3881 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
3885 --The second and third operands have pointer type, or one has
3886 pointer type and the other is a null pointer constant; pointer
3887 conversions (_conv.ptr_) and qualification conversions
3888 (_conv.qual_) are performed to bring them to their composite
3889 pointer type (_expr.rel_). The result is of the composite
3892 --The second and third operands have pointer to member type, or
3893 one has pointer to member type and the other is a null pointer
3894 constant; pointer to member conversions (_conv.mem_) and
3895 qualification conversions (_conv.qual_) are performed to bring
3896 them to a common type, whose cv-qualification shall match the
3897 cv-qualification of either the second or the third operand.
3898 The result is of the common type. */
3899 else if ((null_ptr_cst_p (arg2
)
3900 && (TYPE_PTR_P (arg3_type
) || TYPE_PTR_TO_MEMBER_P (arg3_type
)))
3901 || (null_ptr_cst_p (arg3
)
3902 && (TYPE_PTR_P (arg2_type
) || TYPE_PTR_TO_MEMBER_P (arg2_type
)))
3903 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
3904 || (TYPE_PTRMEM_P (arg2_type
) && TYPE_PTRMEM_P (arg3_type
))
3905 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
3907 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
3908 arg3
, "conditional expression",
3910 if (result_type
== error_mark_node
)
3911 return error_mark_node
;
3912 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
3913 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
3918 if (complain
& tf_error
)
3919 error ("operands to ?: have different types %qT and %qT",
3920 arg2_type
, arg3_type
);
3921 return error_mark_node
;
3925 result
= fold_if_not_in_template (build3 (COND_EXPR
, result_type
, arg1
,
3927 /* We can't use result_type below, as fold might have returned a
3932 /* Expand both sides into the same slot, hopefully the target of
3933 the ?: expression. We used to check for TARGET_EXPRs here,
3934 but now we sometimes wrap them in NOP_EXPRs so the test would
3936 if (CLASS_TYPE_P (TREE_TYPE (result
)))
3937 result
= get_target_expr (result
);
3938 /* If this expression is an rvalue, but might be mistaken for an
3939 lvalue, we must add a NON_LVALUE_EXPR. */
3940 result
= rvalue (result
);
3946 /* OPERAND is an operand to an expression. Perform necessary steps
3947 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
3951 prep_operand (tree operand
)
3955 if (CLASS_TYPE_P (TREE_TYPE (operand
))
3956 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
3957 /* Make sure the template type is instantiated now. */
3958 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
3964 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
3965 OVERLOAD) to the CANDIDATES, returning an updated list of
3966 CANDIDATES. The ARGS are the arguments provided to the call,
3967 without any implicit object parameter. This may change ARGS. The
3968 EXPLICIT_TARGS are explicit template arguments provided.
3969 TEMPLATE_ONLY is true if only template functions should be
3970 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
3971 add_function_candidate. */
3974 add_candidates (tree fns
, const VEC(tree
,gc
) *args
,
3975 tree explicit_targs
, bool template_only
,
3976 tree conversion_path
, tree access_path
,
3978 struct z_candidate
**candidates
)
3981 VEC(tree
,gc
) *non_static_args
;
3984 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
3985 /* Delay creating the implicit this parameter until it is needed. */
3986 non_static_args
= NULL
;
3987 first_arg
= NULL_TREE
;
3993 const VEC(tree
,gc
) *fn_args
;
3995 fn
= OVL_CURRENT (fns
);
3996 /* Figure out which set of arguments to use. */
3997 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
3999 /* If this function is a non-static member, prepend the implicit
4000 object parameter. */
4001 if (non_static_args
== NULL
)
4006 non_static_args
= VEC_alloc (tree
, gc
,
4007 VEC_length (tree
, args
) - 1);
4008 for (ix
= 1; VEC_iterate (tree
, args
, ix
, arg
); ++ix
)
4009 VEC_quick_push (tree
, non_static_args
, arg
);
4011 if (first_arg
== NULL_TREE
)
4012 first_arg
= build_this (VEC_index (tree
, args
, 0));
4013 fn_first_arg
= first_arg
;
4014 fn_args
= non_static_args
;
4018 /* Otherwise, just use the list of arguments provided. */
4019 fn_first_arg
= NULL_TREE
;
4023 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4024 add_template_candidate (candidates
,
4035 else if (!template_only
)
4036 add_function_candidate (candidates
,
4044 fns
= OVL_NEXT (fns
);
4049 build_new_op (enum tree_code code
, int flags
, tree arg1
, tree arg2
, tree arg3
,
4050 bool *overloaded_p
, tsubst_flags_t complain
)
4052 struct z_candidate
*candidates
= 0, *cand
;
4053 VEC(tree
,gc
) *arglist
;
4056 tree result
= NULL_TREE
;
4057 bool result_valid_p
= false;
4058 enum tree_code code2
= NOP_EXPR
;
4059 enum tree_code code_orig_arg1
= ERROR_MARK
;
4060 enum tree_code code_orig_arg2
= ERROR_MARK
;
4066 if (error_operand_p (arg1
)
4067 || error_operand_p (arg2
)
4068 || error_operand_p (arg3
))
4069 return error_mark_node
;
4071 if (code
== MODIFY_EXPR
)
4073 code2
= TREE_CODE (arg3
);
4075 fnname
= ansi_assopname (code2
);
4078 fnname
= ansi_opname (code
);
4080 arg1
= prep_operand (arg1
);
4086 case VEC_DELETE_EXPR
:
4088 /* Use build_op_new_call and build_op_delete_call instead. */
4092 /* Use build_op_call instead. */
4095 case TRUTH_ORIF_EXPR
:
4096 case TRUTH_ANDIF_EXPR
:
4097 case TRUTH_AND_EXPR
:
4099 /* These are saved for the sake of warn_logical_operator. */
4100 code_orig_arg1
= TREE_CODE (arg1
);
4101 code_orig_arg2
= TREE_CODE (arg2
);
4107 arg2
= prep_operand (arg2
);
4108 arg3
= prep_operand (arg3
);
4110 if (code
== COND_EXPR
)
4112 if (arg2
== NULL_TREE
4113 || TREE_CODE (TREE_TYPE (arg2
)) == VOID_TYPE
4114 || TREE_CODE (TREE_TYPE (arg3
)) == VOID_TYPE
4115 || (! IS_OVERLOAD_TYPE (TREE_TYPE (arg2
))
4116 && ! IS_OVERLOAD_TYPE (TREE_TYPE (arg3
))))
4119 else if (! IS_OVERLOAD_TYPE (TREE_TYPE (arg1
))
4120 && (! arg2
|| ! IS_OVERLOAD_TYPE (TREE_TYPE (arg2
))))
4123 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
4124 arg2
= integer_zero_node
;
4126 arglist
= VEC_alloc (tree
, gc
, 3);
4127 VEC_quick_push (tree
, arglist
, arg1
);
4128 if (arg2
!= NULL_TREE
)
4129 VEC_quick_push (tree
, arglist
, arg2
);
4130 if (arg3
!= NULL_TREE
)
4131 VEC_quick_push (tree
, arglist
, arg3
);
4133 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4134 p
= conversion_obstack_alloc (0);
4136 /* Add namespace-scope operators to the list of functions to
4138 add_candidates (lookup_function_nonclass (fnname
, arglist
, /*block_p=*/true),
4139 arglist
, NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
4140 flags
, &candidates
);
4141 /* Add class-member operators to the candidate set. */
4142 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
4146 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
4147 if (fns
== error_mark_node
)
4149 result
= error_mark_node
;
4150 goto user_defined_result_ready
;
4153 add_candidates (BASELINK_FUNCTIONS (fns
), arglist
,
4155 BASELINK_BINFO (fns
),
4156 TYPE_BINFO (TREE_TYPE (arg1
)),
4157 flags
, &candidates
);
4160 /* Rearrange the arguments for ?: so that add_builtin_candidate only has
4161 to know about two args; a builtin candidate will always have a first
4162 parameter of type bool. We'll handle that in
4163 build_builtin_candidate. */
4164 if (code
== COND_EXPR
)
4174 args
[2] = NULL_TREE
;
4177 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
, flags
);
4183 /* For these, the built-in candidates set is empty
4184 [over.match.oper]/3. We don't want non-strict matches
4185 because exact matches are always possible with built-in
4186 operators. The built-in candidate set for COMPONENT_REF
4187 would be empty too, but since there are no such built-in
4188 operators, we accept non-strict matches for them. */
4193 strict_p
= pedantic
;
4197 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
4202 case POSTINCREMENT_EXPR
:
4203 case POSTDECREMENT_EXPR
:
4204 /* Don't try anything fancy if we're not allowed to produce
4206 if (!(complain
& tf_error
))
4207 return error_mark_node
;
4209 /* Look for an `operator++ (int)'. If they didn't have
4210 one, then we fall back to the old way of doing things. */
4211 if (flags
& LOOKUP_COMPLAIN
)
4212 permerror (input_location
, "no %<%D(int)%> declared for postfix %qs, "
4213 "trying prefix operator instead",
4215 operator_name_info
[code
].name
);
4216 if (code
== POSTINCREMENT_EXPR
)
4217 code
= PREINCREMENT_EXPR
;
4219 code
= PREDECREMENT_EXPR
;
4220 result
= build_new_op (code
, flags
, arg1
, NULL_TREE
, NULL_TREE
,
4221 overloaded_p
, complain
);
4224 /* The caller will deal with these. */
4229 result_valid_p
= true;
4233 if ((flags
& LOOKUP_COMPLAIN
) && (complain
& tf_error
))
4235 /* If one of the arguments of the operator represents
4236 an invalid use of member function pointer, try to report
4237 a meaningful error ... */
4238 if (invalid_nonstatic_memfn_p (arg1
, tf_error
)
4239 || invalid_nonstatic_memfn_p (arg2
, tf_error
)
4240 || invalid_nonstatic_memfn_p (arg3
, tf_error
))
4241 /* We displayed the error message. */;
4244 /* ... Otherwise, report the more generic
4245 "no matching operator found" error */
4246 op_error (code
, code2
, arg1
, arg2
, arg3
, "no match");
4247 print_z_candidates (candidates
);
4250 result
= error_mark_node
;
4256 cand
= tourney (candidates
);
4259 if ((flags
& LOOKUP_COMPLAIN
) && (complain
& tf_error
))
4261 op_error (code
, code2
, arg1
, arg2
, arg3
, "ambiguous overload");
4262 print_z_candidates (candidates
);
4264 result
= error_mark_node
;
4266 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4269 *overloaded_p
= true;
4271 if (resolve_args (arglist
) == NULL
)
4272 result
= error_mark_node
;
4274 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4278 /* Give any warnings we noticed during overload resolution. */
4279 if (cand
->warnings
&& (complain
& tf_warning
))
4281 struct candidate_warning
*w
;
4282 for (w
= cand
->warnings
; w
; w
= w
->next
)
4283 joust (cand
, w
->loser
, 1);
4286 /* Check for comparison of different enum types. */
4295 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
4296 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
4297 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
4298 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
4299 && (complain
& tf_warning
))
4301 warning (OPT_Wenum_compare
,
4302 "comparison between %q#T and %q#T",
4303 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4310 /* We need to strip any leading REF_BIND so that bitfields
4311 don't cause errors. This should not remove any important
4312 conversions, because builtins don't apply to class
4313 objects directly. */
4314 conv
= cand
->convs
[0];
4315 if (conv
->kind
== ck_ref_bind
)
4316 conv
= conv
->u
.next
;
4317 arg1
= convert_like (conv
, arg1
, complain
);
4321 /* We need to call warn_logical_operator before
4322 converting arg2 to a boolean_type. */
4323 if (complain
& tf_warning
)
4324 warn_logical_operator (input_location
, code
, boolean_type_node
,
4325 code_orig_arg1
, arg1
,
4326 code_orig_arg2
, arg2
);
4328 conv
= cand
->convs
[1];
4329 if (conv
->kind
== ck_ref_bind
)
4330 conv
= conv
->u
.next
;
4331 arg2
= convert_like (conv
, arg2
, complain
);
4335 conv
= cand
->convs
[2];
4336 if (conv
->kind
== ck_ref_bind
)
4337 conv
= conv
->u
.next
;
4338 arg3
= convert_like (conv
, arg3
, complain
);
4344 user_defined_result_ready
:
4346 /* Free all the conversions we allocated. */
4347 obstack_free (&conversion_obstack
, p
);
4349 if (result
|| result_valid_p
)
4356 return cp_build_modify_expr (arg1
, code2
, arg2
, complain
);
4359 return cp_build_indirect_ref (arg1
, "unary *", complain
);
4361 case TRUTH_ANDIF_EXPR
:
4362 case TRUTH_ORIF_EXPR
:
4363 case TRUTH_AND_EXPR
:
4365 warn_logical_operator (input_location
, code
, boolean_type_node
,
4366 code_orig_arg1
, arg1
, code_orig_arg2
, arg2
);
4371 case TRUNC_DIV_EXPR
:
4382 case TRUNC_MOD_EXPR
:
4386 return cp_build_binary_op (input_location
, code
, arg1
, arg2
, complain
);
4388 case UNARY_PLUS_EXPR
:
4391 case TRUTH_NOT_EXPR
:
4392 case PREINCREMENT_EXPR
:
4393 case POSTINCREMENT_EXPR
:
4394 case PREDECREMENT_EXPR
:
4395 case POSTDECREMENT_EXPR
:
4398 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
4401 return build_array_ref (arg1
, arg2
, input_location
);
4404 return build_conditional_expr (arg1
, arg2
, arg3
, complain
);
4407 return build_m_component_ref (cp_build_indirect_ref (arg1
, NULL
,
4411 /* The caller will deal with these. */
4423 /* Build a call to operator delete. This has to be handled very specially,
4424 because the restrictions on what signatures match are different from all
4425 other call instances. For a normal delete, only a delete taking (void *)
4426 or (void *, size_t) is accepted. For a placement delete, only an exact
4427 match with the placement new is accepted.
4429 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
4430 ADDR is the pointer to be deleted.
4431 SIZE is the size of the memory block to be deleted.
4432 GLOBAL_P is true if the delete-expression should not consider
4433 class-specific delete operators.
4434 PLACEMENT is the corresponding placement new call, or NULL_TREE.
4436 If this call to "operator delete" is being generated as part to
4437 deallocate memory allocated via a new-expression (as per [expr.new]
4438 which requires that if the initialization throws an exception then
4439 we call a deallocation function), then ALLOC_FN is the allocation
4443 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
4444 bool global_p
, tree placement
,
4447 tree fn
= NULL_TREE
;
4448 tree fns
, fnname
, argtypes
, type
;
4451 if (addr
== error_mark_node
)
4452 return error_mark_node
;
4454 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
4456 fnname
= ansi_opname (code
);
4458 if (CLASS_TYPE_P (type
)
4459 && COMPLETE_TYPE_P (complete_type (type
))
4463 If the result of the lookup is ambiguous or inaccessible, or if
4464 the lookup selects a placement deallocation function, the
4465 program is ill-formed.
4467 Therefore, we ask lookup_fnfields to complain about ambiguity. */
4469 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
4470 if (fns
== error_mark_node
)
4471 return error_mark_node
;
4476 if (fns
== NULL_TREE
)
4477 fns
= lookup_name_nonclass (fnname
);
4479 /* Strip const and volatile from addr. */
4480 addr
= cp_convert (ptr_type_node
, addr
);
4484 /* Get the parameter types for the allocation function that is
4486 gcc_assert (alloc_fn
!= NULL_TREE
);
4487 argtypes
= TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (alloc_fn
)));
4491 /* First try it without the size argument. */
4492 argtypes
= void_list_node
;
4495 /* We make two tries at finding a matching `operator delete'. On
4496 the first pass, we look for a one-operator (or placement)
4497 operator delete. If we're not doing placement delete, then on
4498 the second pass we look for a two-argument delete. */
4499 for (pass
= 0; pass
< (placement
? 1 : 2); ++pass
)
4501 /* Go through the `operator delete' functions looking for one
4502 with a matching type. */
4503 for (fn
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
4509 /* The first argument must be "void *". */
4510 t
= TYPE_ARG_TYPES (TREE_TYPE (OVL_CURRENT (fn
)));
4511 if (!same_type_p (TREE_VALUE (t
), ptr_type_node
))
4514 /* On the first pass, check the rest of the arguments. */
4520 if (!same_type_p (TREE_VALUE (a
), TREE_VALUE (t
)))
4528 /* On the second pass, look for a function with exactly two
4529 arguments: "void *" and "size_t". */
4531 /* For "operator delete(void *, ...)" there will be
4532 no second argument, but we will not get an exact
4535 && same_type_p (TREE_VALUE (t
), size_type_node
)
4536 && TREE_CHAIN (t
) == void_list_node
)
4540 /* If we found a match, we're done. */
4545 /* If we have a matching function, call it. */
4548 /* Make sure we have the actual function, and not an
4550 fn
= OVL_CURRENT (fn
);
4552 /* If the FN is a member function, make sure that it is
4554 if (DECL_CLASS_SCOPE_P (fn
))
4555 perform_or_defer_access_check (TYPE_BINFO (type
), fn
, fn
);
4559 /* The placement args might not be suitable for overload
4560 resolution at this point, so build the call directly. */
4561 int nargs
= call_expr_nargs (placement
);
4562 tree
*argarray
= (tree
*) alloca (nargs
* sizeof (tree
));
4565 for (i
= 1; i
< nargs
; i
++)
4566 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
4568 return build_cxx_call (fn
, nargs
, argarray
);
4573 VEC(tree
,gc
) *args
= VEC_alloc (tree
, gc
, 2);
4574 VEC_quick_push (tree
, args
, addr
);
4576 VEC_quick_push (tree
, args
, size
);
4577 ret
= cp_build_function_call_vec (fn
, &args
, tf_warning_or_error
);
4578 VEC_free (tree
, gc
, args
);
4585 If no unambiguous matching deallocation function can be found,
4586 propagating the exception does not cause the object's memory to
4591 warning (0, "no corresponding deallocation function for %qD",
4596 error ("no suitable %<operator %s%> for %qT",
4597 operator_name_info
[(int)code
].name
, type
);
4598 return error_mark_node
;
4601 /* If the current scope isn't allowed to access DECL along
4602 BASETYPE_PATH, give an error. The most derived class in
4603 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
4604 the declaration to use in the error diagnostic. */
4607 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
)
4609 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
4611 if (!accessible_p (basetype_path
, decl
, true))
4613 if (TREE_PRIVATE (decl
))
4614 error ("%q+#D is private", diag_decl
);
4615 else if (TREE_PROTECTED (decl
))
4616 error ("%q+#D is protected", diag_decl
);
4618 error ("%q+#D is inaccessible", diag_decl
);
4619 error ("within this context");
4626 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
4627 bitwise or of LOOKUP_* values. If any errors are warnings are
4628 generated, set *DIAGNOSTIC_FN to "error" or "warning",
4629 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
4633 build_temp (tree expr
, tree type
, int flags
,
4634 diagnostic_t
*diagnostic_kind
)
4639 savew
= warningcount
, savee
= errorcount
;
4640 args
= make_tree_vector_single (expr
);
4641 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
4642 &args
, type
, flags
, tf_warning_or_error
);
4643 release_tree_vector (args
);
4644 if (warningcount
> savew
)
4645 *diagnostic_kind
= DK_WARNING
;
4646 else if (errorcount
> savee
)
4647 *diagnostic_kind
= DK_ERROR
;
4649 *diagnostic_kind
= DK_UNSPECIFIED
;
4653 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
4654 EXPR is implicitly converted to type TOTYPE.
4655 FN and ARGNUM are used for diagnostics. */
4658 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
4660 tree t
= non_reference (totype
);
4662 /* Issue warnings about peculiar, but valid, uses of NULL. */
4663 if (expr
== null_node
&& TREE_CODE (t
) != BOOLEAN_TYPE
&& ARITHMETIC_TYPE_P (t
))
4666 warning (OPT_Wconversion
, "passing NULL to non-pointer argument %P of %qD",
4669 warning (OPT_Wconversion
, "converting to non-pointer type %qT from NULL", t
);
4672 /* Issue warnings if "false" is converted to a NULL pointer */
4673 else if (expr
== boolean_false_node
&& fn
&& POINTER_TYPE_P (t
))
4674 warning (OPT_Wconversion
,
4675 "converting %<false%> to pointer type for argument %P of %qD",
4679 /* Perform the conversions in CONVS on the expression EXPR. FN and
4680 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
4681 indicates the `this' argument of a method. INNER is nonzero when
4682 being called to continue a conversion chain. It is negative when a
4683 reference binding will be applied, positive otherwise. If
4684 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
4685 conversions will be emitted if appropriate. If C_CAST_P is true,
4686 this conversion is coming from a C-style cast; in that case,
4687 conversions to inaccessible bases are permitted. */
4690 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
4691 int inner
, bool issue_conversion_warnings
,
4692 bool c_cast_p
, tsubst_flags_t complain
)
4694 tree totype
= convs
->type
;
4695 diagnostic_t diag_kind
;
4699 && convs
->kind
!= ck_user
4700 && convs
->kind
!= ck_list
4701 && convs
->kind
!= ck_ambig
4702 && convs
->kind
!= ck_ref_bind
4703 && convs
->kind
!= ck_rvalue
4704 && convs
->kind
!= ck_base
)
4706 conversion
*t
= convs
;
4708 /* Give a helpful error if this is bad because of excess braces. */
4709 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
4710 && SCALAR_TYPE_P (totype
)
4711 && CONSTRUCTOR_NELTS (expr
) > 0
4712 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
4713 permerror (input_location
, "too many braces around initializer for %qT", totype
);
4715 for (; t
; t
= convs
->u
.next
)
4717 if (t
->kind
== ck_user
|| !t
->bad_p
)
4719 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
4720 /*issue_conversion_warnings=*/false,
4725 else if (t
->kind
== ck_ambig
)
4726 return convert_like_real (t
, expr
, fn
, argnum
, 1,
4727 /*issue_conversion_warnings=*/false,
4730 else if (t
->kind
== ck_identity
)
4733 if (complain
& tf_error
)
4735 permerror (input_location
, "invalid conversion from %qT to %qT", TREE_TYPE (expr
), totype
);
4737 permerror (input_location
, " initializing argument %P of %qD", argnum
, fn
);
4740 return error_mark_node
;
4742 return cp_convert (totype
, expr
);
4745 if (issue_conversion_warnings
&& (complain
& tf_warning
))
4746 conversion_null_warnings (totype
, expr
, fn
, argnum
);
4748 switch (convs
->kind
)
4752 struct z_candidate
*cand
= convs
->cand
;
4753 tree convfn
= cand
->fn
;
4756 /* When converting from an init list we consider explicit
4757 constructors, but actually trying to call one is an error. */
4758 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
))
4760 if (complain
& tf_error
)
4761 error ("converting to %qT from initializer list would use "
4762 "explicit constructor %qD", totype
, convfn
);
4764 return error_mark_node
;
4767 /* Set user_conv_p on the argument conversions, so rvalue/base
4768 handling knows not to allow any more UDCs. */
4769 for (i
= 0; i
< cand
->num_convs
; ++i
)
4770 cand
->convs
[i
]->user_conv_p
= true;
4772 expr
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4774 /* If this is a constructor or a function returning an aggr type,
4775 we need to build up a TARGET_EXPR. */
4776 if (DECL_CONSTRUCTOR_P (convfn
))
4778 expr
= build_cplus_new (totype
, expr
);
4780 /* Remember that this was list-initialization. */
4781 if (convs
->check_narrowing
)
4782 TARGET_EXPR_LIST_INIT_P (expr
) = true;
4788 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
4790 int nelts
= CONSTRUCTOR_NELTS (expr
);
4792 expr
= integer_zero_node
;
4793 else if (nelts
== 1)
4794 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
4799 if (type_unknown_p (expr
))
4800 expr
= instantiate_type (totype
, expr
, complain
);
4801 /* Convert a constant to its underlying value, unless we are
4802 about to bind it to a reference, in which case we need to
4803 leave it as an lvalue. */
4806 expr
= decl_constant_value (expr
);
4807 if (expr
== null_node
&& INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
4808 /* If __null has been converted to an integer type, we do not
4809 want to warn about uses of EXPR as an integer, rather than
4811 expr
= build_int_cst (totype
, 0);
4815 /* Call build_user_type_conversion again for the error. */
4816 return build_user_type_conversion
4817 (totype
, convs
->u
.expr
, LOOKUP_NORMAL
);
4821 /* Conversion to std::initializer_list<T>. */
4822 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
4823 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
4824 unsigned len
= CONSTRUCTOR_NELTS (expr
);
4826 VEC(tree
,gc
) *parms
;
4829 /* Convert all the elements. */
4830 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
4832 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
4833 1, false, false, complain
);
4834 if (sub
== error_mark_node
)
4836 check_narrowing (TREE_TYPE (sub
), val
);
4837 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
4839 /* Build up the array. */
4840 elttype
= cp_build_qualified_type
4841 (elttype
, TYPE_QUALS (elttype
) | TYPE_QUAL_CONST
);
4842 array
= build_array_of_n_type (elttype
, len
);
4843 array
= finish_compound_literal (array
, new_ctor
);
4845 parms
= make_tree_vector ();
4846 VEC_safe_push (tree
, gc
, parms
, decay_conversion (array
));
4847 VEC_safe_push (tree
, gc
, parms
, size_int (len
));
4848 /* Call the private constructor. */
4849 push_deferring_access_checks (dk_no_check
);
4850 new_ctor
= build_special_member_call
4851 (NULL_TREE
, complete_ctor_identifier
, &parms
, totype
, 0, complain
);
4852 release_tree_vector (parms
);
4853 pop_deferring_access_checks ();
4854 return build_cplus_new (totype
, new_ctor
);
4858 return get_target_expr (digest_init (totype
, expr
));
4864 expr
= convert_like_real (convs
->u
.next
, expr
, fn
, argnum
,
4865 convs
->kind
== ck_ref_bind
? -1 : 1,
4866 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
4869 if (expr
== error_mark_node
)
4870 return error_mark_node
;
4872 switch (convs
->kind
)
4875 expr
= convert_bitfield_to_declared_type (expr
);
4876 if (! MAYBE_CLASS_TYPE_P (totype
))
4878 /* Else fall through. */
4880 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
4882 /* We are going to bind a reference directly to a base-class
4883 subobject of EXPR. */
4884 /* Build an expression for `*((base*) &expr)'. */
4885 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, complain
);
4886 expr
= convert_to_base (expr
, build_pointer_type (totype
),
4887 !c_cast_p
, /*nonnull=*/true);
4888 expr
= cp_build_indirect_ref (expr
, "implicit conversion", complain
);
4892 /* Copy-initialization where the cv-unqualified version of the source
4893 type is the same class as, or a derived class of, the class of the
4894 destination [is treated as direct-initialization]. [dcl.init] */
4895 flags
= LOOKUP_NORMAL
|LOOKUP_ONLYCONVERTING
;
4896 if (convs
->user_conv_p
)
4897 /* This conversion is being done in the context of a user-defined
4898 conversion (i.e. the second step of copy-initialization), so
4899 don't allow any more. */
4900 flags
|= LOOKUP_NO_CONVERSION
;
4901 expr
= build_temp (expr
, totype
, flags
, &diag_kind
);
4902 if (diag_kind
&& fn
)
4904 if ((complain
& tf_error
))
4905 emit_diagnostic (diag_kind
, input_location
, 0,
4906 " initializing argument %P of %qD", argnum
, fn
);
4907 else if (diag_kind
== DK_ERROR
)
4908 return error_mark_node
;
4910 return build_cplus_new (totype
, expr
);
4914 tree ref_type
= totype
;
4916 /* If necessary, create a temporary.
4918 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
4919 that need temporaries, even when their types are reference
4920 compatible with the type of reference being bound, so the
4921 upcoming call to cp_build_unary_op (ADDR_EXPR, expr, ...)
4923 if (convs
->need_temporary_p
4924 || TREE_CODE (expr
) == CONSTRUCTOR
4925 || TREE_CODE (expr
) == VA_ARG_EXPR
)
4927 tree type
= convs
->u
.next
->type
;
4928 cp_lvalue_kind lvalue
= real_lvalue_p (expr
);
4930 if (!CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
))
4931 && !TYPE_REF_IS_RVALUE (ref_type
))
4933 if (complain
& tf_error
)
4935 /* If the reference is volatile or non-const, we
4936 cannot create a temporary. */
4937 if (lvalue
& clk_bitfield
)
4938 error ("cannot bind bitfield %qE to %qT",
4940 else if (lvalue
& clk_packed
)
4941 error ("cannot bind packed field %qE to %qT",
4944 error ("cannot bind rvalue %qE to %qT", expr
, ref_type
);
4946 return error_mark_node
;
4948 /* If the source is a packed field, and we must use a copy
4949 constructor, then building the target expr will require
4950 binding the field to the reference parameter to the
4951 copy constructor, and we'll end up with an infinite
4952 loop. If we can use a bitwise copy, then we'll be
4954 if ((lvalue
& clk_packed
)
4955 && CLASS_TYPE_P (type
)
4956 && !TYPE_HAS_TRIVIAL_INIT_REF (type
))
4958 if (complain
& tf_error
)
4959 error ("cannot bind packed field %qE to %qT",
4961 return error_mark_node
;
4963 if (lvalue
& clk_bitfield
)
4965 expr
= convert_bitfield_to_declared_type (expr
);
4966 expr
= fold_convert (type
, expr
);
4968 expr
= build_target_expr_with_type (expr
, type
);
4971 /* Take the address of the thing to which we will bind the
4973 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 1, complain
);
4974 if (expr
== error_mark_node
)
4975 return error_mark_node
;
4977 /* Convert it to a pointer to the type referred to by the
4978 reference. This will adjust the pointer if a derived to
4979 base conversion is being performed. */
4980 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
4982 /* Convert the pointer to the desired reference type. */
4983 return build_nop (ref_type
, expr
);
4987 return decay_conversion (expr
);
4990 /* Warn about deprecated conversion if appropriate. */
4991 string_conv_p (totype
, expr
, 1);
4996 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
4998 return build_nop (totype
, expr
);
5001 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
5008 if (convs
->check_narrowing
)
5009 check_narrowing (totype
, expr
);
5011 if (issue_conversion_warnings
&& (complain
& tf_warning
))
5012 expr
= convert_and_check (totype
, expr
);
5014 expr
= convert (totype
, expr
);
5019 /* Build a call to __builtin_trap. */
5022 call_builtin_trap (void)
5024 tree fn
= implicit_built_in_decls
[BUILT_IN_TRAP
];
5026 gcc_assert (fn
!= NULL
);
5027 fn
= build_call_n (fn
, 0);
5031 /* ARG is being passed to a varargs function. Perform any conversions
5032 required. Return the converted value. */
5035 convert_arg_to_ellipsis (tree arg
)
5039 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
5040 standard conversions are performed. */
5041 arg
= decay_conversion (arg
);
5044 If the argument has integral or enumeration type that is subject
5045 to the integral promotions (_conv.prom_), or a floating point
5046 type that is subject to the floating point promotion
5047 (_conv.fpprom_), the value of the argument is converted to the
5048 promoted type before the call. */
5049 if (TREE_CODE (TREE_TYPE (arg
)) == REAL_TYPE
5050 && (TYPE_PRECISION (TREE_TYPE (arg
))
5051 < TYPE_PRECISION (double_type_node
)))
5052 arg
= convert_to_real (double_type_node
, arg
);
5053 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (arg
)))
5054 arg
= perform_integral_promotions (arg
);
5056 arg
= require_complete_type (arg
);
5058 if (arg
!= error_mark_node
5059 && !pod_type_p (TREE_TYPE (arg
)))
5061 /* Undefined behavior [expr.call] 5.2.2/7. We used to just warn
5062 here and do a bitwise copy, but now cp_expr_size will abort if we
5064 If the call appears in the context of a sizeof expression,
5065 there is no need to emit a warning, since the expression won't be
5066 evaluated. We keep the builtin_trap just as a safety check. */
5067 if (!skip_evaluation
)
5068 warning (0, "cannot pass objects of non-POD type %q#T through %<...%>; "
5069 "call will abort at runtime", TREE_TYPE (arg
));
5070 arg
= call_builtin_trap ();
5071 arg
= build2 (COMPOUND_EXPR
, integer_type_node
, arg
,
5078 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
5081 build_x_va_arg (tree expr
, tree type
)
5083 if (processing_template_decl
)
5084 return build_min (VA_ARG_EXPR
, type
, expr
);
5086 type
= complete_type_or_else (type
, NULL_TREE
);
5088 if (expr
== error_mark_node
|| !type
)
5089 return error_mark_node
;
5091 if (! pod_type_p (type
))
5093 /* Remove reference types so we don't ICE later on. */
5094 tree type1
= non_reference (type
);
5095 /* Undefined behavior [expr.call] 5.2.2/7. */
5096 warning (0, "cannot receive objects of non-POD type %q#T through %<...%>; "
5097 "call will abort at runtime", type
);
5098 expr
= convert (build_pointer_type (type1
), null_node
);
5099 expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
),
5100 call_builtin_trap (), expr
);
5101 expr
= cp_build_indirect_ref (expr
, NULL
, tf_warning_or_error
);
5105 return build_va_arg (expr
, type
);
5108 /* TYPE has been given to va_arg. Apply the default conversions which
5109 would have happened when passed via ellipsis. Return the promoted
5110 type, or the passed type if there is no change. */
5113 cxx_type_promotes_to (tree type
)
5117 /* Perform the array-to-pointer and function-to-pointer
5119 type
= type_decays_to (type
);
5121 promote
= type_promotes_to (type
);
5122 if (same_type_p (type
, promote
))
5128 /* ARG is a default argument expression being passed to a parameter of
5129 the indicated TYPE, which is a parameter to FN. Do any required
5130 conversions. Return the converted value. */
5132 static GTY(()) VEC(tree
,gc
) *default_arg_context
;
5135 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
)
5140 /* If the ARG is an unparsed default argument expression, the
5141 conversion cannot be performed. */
5142 if (TREE_CODE (arg
) == DEFAULT_ARG
)
5144 error ("the default argument for parameter %d of %qD has "
5145 "not yet been parsed",
5147 return error_mark_node
;
5150 /* Detect recursion. */
5151 for (i
= 0; VEC_iterate (tree
, default_arg_context
, i
, t
); ++i
)
5154 error ("recursive evaluation of default argument for %q#D", fn
);
5155 return error_mark_node
;
5157 VEC_safe_push (tree
, gc
, default_arg_context
, fn
);
5159 if (fn
&& DECL_TEMPLATE_INFO (fn
))
5160 arg
= tsubst_default_argument (fn
, type
, arg
);
5166 The names in the expression are bound, and the semantic
5167 constraints are checked, at the point where the default
5168 expressions appears.
5170 we must not perform access checks here. */
5171 push_deferring_access_checks (dk_no_check
);
5172 arg
= break_out_target_exprs (arg
);
5173 if (TREE_CODE (arg
) == CONSTRUCTOR
)
5175 arg
= digest_init (type
, arg
);
5176 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_NORMAL
,
5177 "default argument", fn
, parmnum
,
5178 tf_warning_or_error
);
5182 /* We must make a copy of ARG, in case subsequent processing
5183 alters any part of it. For example, during gimplification a
5184 cast of the form (T) &X::f (where "f" is a member function)
5185 will lead to replacing the PTRMEM_CST for &X::f with a
5186 VAR_DECL. We can avoid the copy for constants, since they
5187 are never modified in place. */
5188 if (!CONSTANT_CLASS_P (arg
))
5189 arg
= unshare_expr (arg
);
5190 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_NORMAL
,
5191 "default argument", fn
, parmnum
,
5192 tf_warning_or_error
);
5193 arg
= convert_for_arg_passing (type
, arg
);
5195 pop_deferring_access_checks();
5197 VEC_pop (tree
, default_arg_context
);
5202 /* Returns the type which will really be used for passing an argument of
5206 type_passed_as (tree type
)
5208 /* Pass classes with copy ctors by invisible reference. */
5209 if (TREE_ADDRESSABLE (type
))
5211 type
= build_reference_type (type
);
5212 /* There are no other pointers to this temporary. */
5213 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
5215 else if (targetm
.calls
.promote_prototypes (type
)
5216 && INTEGRAL_TYPE_P (type
)
5217 && COMPLETE_TYPE_P (type
)
5218 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
5219 TYPE_SIZE (integer_type_node
)))
5220 type
= integer_type_node
;
5225 /* Actually perform the appropriate conversion. */
5228 convert_for_arg_passing (tree type
, tree val
)
5232 /* If VAL is a bitfield, then -- since it has already been converted
5233 to TYPE -- it cannot have a precision greater than TYPE.
5235 If it has a smaller precision, we must widen it here. For
5236 example, passing "int f:3;" to a function expecting an "int" will
5237 not result in any conversion before this point.
5239 If the precision is the same we must not risk widening. For
5240 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
5241 often have type "int", even though the C++ type for the field is
5242 "long long". If the value is being passed to a function
5243 expecting an "int", then no conversions will be required. But,
5244 if we call convert_bitfield_to_declared_type, the bitfield will
5245 be converted to "long long". */
5246 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
5248 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
5249 val
= convert_to_integer (TYPE_MAIN_VARIANT (bitfield_type
), val
);
5251 if (val
== error_mark_node
)
5253 /* Pass classes with copy ctors by invisible reference. */
5254 else if (TREE_ADDRESSABLE (type
))
5255 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
5256 else if (targetm
.calls
.promote_prototypes (type
)
5257 && INTEGRAL_TYPE_P (type
)
5258 && COMPLETE_TYPE_P (type
)
5259 && INT_CST_LT_UNSIGNED (TYPE_SIZE (type
),
5260 TYPE_SIZE (integer_type_node
)))
5261 val
= perform_integral_promotions (val
);
5262 if (warn_missing_format_attribute
)
5264 tree rhstype
= TREE_TYPE (val
);
5265 const enum tree_code coder
= TREE_CODE (rhstype
);
5266 const enum tree_code codel
= TREE_CODE (type
);
5267 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
5269 && check_missing_format_attribute (type
, rhstype
))
5270 warning (OPT_Wmissing_format_attribute
,
5271 "argument of function call might be a candidate for a format attribute");
5276 /* Returns true iff FN is a function with magic varargs, i.e. ones for
5277 which no conversions at all should be done. This is true for some
5278 builtins which don't act like normal functions. */
5281 magic_varargs_p (tree fn
)
5283 if (DECL_BUILT_IN (fn
))
5284 switch (DECL_FUNCTION_CODE (fn
))
5286 case BUILT_IN_CLASSIFY_TYPE
:
5287 case BUILT_IN_CONSTANT_P
:
5288 case BUILT_IN_NEXT_ARG
:
5289 case BUILT_IN_VA_START
:
5293 return lookup_attribute ("type generic",
5294 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
5300 /* Subroutine of the various build_*_call functions. Overload resolution
5301 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
5302 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
5303 bitmask of various LOOKUP_* flags which apply to the call itself. */
5306 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
5309 const VEC(tree
,gc
) *args
= cand
->args
;
5310 tree first_arg
= cand
->first_arg
;
5311 conversion
**convs
= cand
->convs
;
5313 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5318 unsigned int arg_index
= 0;
5322 bool already_used
= false;
5324 /* In a template, there is no need to perform all of the work that
5325 is normally done. We are only interested in the type of the call
5326 expression, i.e., the return type of the function. Any semantic
5327 errors will be deferred until the template is instantiated. */
5328 if (processing_template_decl
)
5332 const tree
*argarray
;
5335 return_type
= TREE_TYPE (TREE_TYPE (fn
));
5336 nargs
= VEC_length (tree
, args
);
5337 if (first_arg
== NULL_TREE
)
5338 argarray
= VEC_address (tree
, CONST_CAST (VEC(tree
,gc
) *, args
));
5346 alcarray
= XALLOCAVEC (tree
, nargs
);
5347 alcarray
[0] = first_arg
;
5348 for (ix
= 0; VEC_iterate (tree
, args
, ix
, arg
); ++ix
)
5349 alcarray
[ix
+ 1] = arg
;
5350 argarray
= alcarray
;
5352 expr
= build_call_array (return_type
, build_addr_func (fn
), nargs
,
5354 if (TREE_THIS_VOLATILE (fn
) && cfun
)
5355 current_function_returns_abnormally
= 1;
5356 if (!VOID_TYPE_P (return_type
))
5357 require_complete_type (return_type
);
5358 return convert_from_reference (expr
);
5361 /* Give any warnings we noticed during overload resolution. */
5364 struct candidate_warning
*w
;
5365 for (w
= cand
->warnings
; w
; w
= w
->next
)
5366 joust (cand
, w
->loser
, 1);
5369 /* Make =delete work with SFINAE. */
5370 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
5371 return error_mark_node
;
5373 if (DECL_FUNCTION_MEMBER_P (fn
))
5375 /* If FN is a template function, two cases must be considered.
5380 template <class T> void f();
5382 template <class T> struct B {
5386 struct C : A, B<int> {
5388 using B<int>::g; // #2
5391 In case #1 where `A::f' is a member template, DECL_ACCESS is
5392 recorded in the primary template but not in its specialization.
5393 We check access of FN using its primary template.
5395 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
5396 because it is a member of class template B, DECL_ACCESS is
5397 recorded in the specialization `B<int>::g'. We cannot use its
5398 primary template because `B<T>::g' and `B<int>::g' may have
5399 different access. */
5400 if (DECL_TEMPLATE_INFO (fn
)
5401 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
5402 perform_or_defer_access_check (cand
->access_path
,
5403 DECL_TI_TEMPLATE (fn
), fn
);
5405 perform_or_defer_access_check (cand
->access_path
, fn
, fn
);
5408 /* Find maximum size of vector to hold converted arguments. */
5409 parmlen
= list_length (parm
);
5410 nargs
= VEC_length (tree
, args
) + (first_arg
!= NULL_TREE
? 1 : 0);
5411 if (parmlen
> nargs
)
5413 argarray
= (tree
*) alloca (nargs
* sizeof (tree
));
5415 /* The implicit parameters to a constructor are not considered by overload
5416 resolution, and must be of the proper type. */
5417 if (DECL_CONSTRUCTOR_P (fn
))
5419 if (first_arg
!= NULL_TREE
)
5421 argarray
[j
++] = first_arg
;
5422 first_arg
= NULL_TREE
;
5426 argarray
[j
++] = VEC_index (tree
, args
, arg_index
);
5429 parm
= TREE_CHAIN (parm
);
5430 /* We should never try to call the abstract constructor. */
5431 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
5433 if (DECL_HAS_VTT_PARM_P (fn
))
5435 argarray
[j
++] = VEC_index (tree
, args
, arg_index
);
5437 parm
= TREE_CHAIN (parm
);
5440 /* Bypass access control for 'this' parameter. */
5441 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
5443 tree parmtype
= TREE_VALUE (parm
);
5444 tree arg
= (first_arg
!= NULL_TREE
5446 : VEC_index (tree
, args
, arg_index
));
5447 tree argtype
= TREE_TYPE (arg
);
5451 if (convs
[i
]->bad_p
)
5453 if (complain
& tf_error
)
5454 permerror (input_location
, "passing %qT as %<this%> argument of %q#D discards qualifiers",
5455 TREE_TYPE (argtype
), fn
);
5457 return error_mark_node
;
5460 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
5461 X is called for an object that is not of type X, or of a type
5462 derived from X, the behavior is undefined.
5464 So we can assume that anything passed as 'this' is non-null, and
5465 optimize accordingly. */
5466 gcc_assert (TREE_CODE (parmtype
) == POINTER_TYPE
);
5467 /* Convert to the base in which the function was declared. */
5468 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
5469 converted_arg
= build_base_path (PLUS_EXPR
,
5471 cand
->conversion_path
,
5473 /* Check that the base class is accessible. */
5474 if (!accessible_base_p (TREE_TYPE (argtype
),
5475 BINFO_TYPE (cand
->conversion_path
), true))
5476 error ("%qT is not an accessible base of %qT",
5477 BINFO_TYPE (cand
->conversion_path
),
5478 TREE_TYPE (argtype
));
5479 /* If fn was found by a using declaration, the conversion path
5480 will be to the derived class, not the base declaring fn. We
5481 must convert from derived to base. */
5482 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
5483 TREE_TYPE (parmtype
), ba_unique
, NULL
);
5484 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
5487 argarray
[j
++] = converted_arg
;
5488 parm
= TREE_CHAIN (parm
);
5489 if (first_arg
!= NULL_TREE
)
5490 first_arg
= NULL_TREE
;
5497 gcc_assert (first_arg
== NULL_TREE
);
5498 for (; arg_index
< VEC_length (tree
, args
) && parm
;
5499 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
5501 tree type
= TREE_VALUE (parm
);
5505 /* Don't make a copy here if build_call is going to. */
5506 if (conv
->kind
== ck_rvalue
5507 && COMPLETE_TYPE_P (complete_type (type
))
5508 && !TREE_ADDRESSABLE (type
))
5509 conv
= conv
->u
.next
;
5511 val
= convert_like_with_context
5512 (conv
, VEC_index (tree
, args
, arg_index
), fn
, i
- is_method
,
5515 val
= convert_for_arg_passing (type
, val
);
5516 if (val
== error_mark_node
)
5517 return error_mark_node
;
5519 argarray
[j
++] = val
;
5522 /* Default arguments */
5523 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
5524 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
5525 TREE_PURPOSE (parm
),
5528 for (; arg_index
< VEC_length (tree
, args
); ++arg_index
)
5530 tree a
= VEC_index (tree
, args
, arg_index
);
5531 if (magic_varargs_p (fn
))
5532 /* Do no conversions for magic varargs. */;
5534 a
= convert_arg_to_ellipsis (a
);
5538 gcc_assert (j
<= nargs
);
5541 check_function_arguments (TYPE_ATTRIBUTES (TREE_TYPE (fn
)),
5542 nargs
, argarray
, TYPE_ARG_TYPES (TREE_TYPE (fn
)));
5544 /* Avoid actually calling copy constructors and copy assignment operators,
5547 if (! flag_elide_constructors
)
5548 /* Do things the hard way. */;
5549 else if (cand
->num_convs
== 1
5550 && (DECL_COPY_CONSTRUCTOR_P (fn
)
5551 || DECL_MOVE_CONSTRUCTOR_P (fn
)))
5554 tree arg
= argarray
[num_artificial_parms_for (fn
)];
5557 /* Pull out the real argument, disregarding const-correctness. */
5559 while (CONVERT_EXPR_P (targ
)
5560 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
5561 targ
= TREE_OPERAND (targ
, 0);
5562 if (TREE_CODE (targ
) == ADDR_EXPR
)
5564 targ
= TREE_OPERAND (targ
, 0);
5565 if (!same_type_ignoring_top_level_qualifiers_p
5566 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
5575 arg
= cp_build_indirect_ref (arg
, 0, complain
);
5577 if (TREE_CODE (arg
) == TARGET_EXPR
5578 && TARGET_EXPR_LIST_INIT_P (arg
))
5580 /* Copy-list-initialization doesn't require the copy constructor
5583 /* [class.copy]: the copy constructor is implicitly defined even if
5584 the implementation elided its use. */
5585 else if (TYPE_HAS_COMPLEX_INIT_REF (DECL_CONTEXT (fn
)))
5588 already_used
= true;
5591 /* If we're creating a temp and we already have one, don't create a
5592 new one. If we're not creating a temp but we get one, use
5593 INIT_EXPR to collapse the temp into our target. Otherwise, if the
5594 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
5595 temp or an INIT_EXPR otherwise. */
5596 fa
= (cand
->first_arg
!= NULL_TREE
5598 : VEC_index (tree
, args
, 0));
5599 if (integer_zerop (fa
))
5601 if (TREE_CODE (arg
) == TARGET_EXPR
)
5603 else if (TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn
)))
5604 return build_target_expr_with_type (arg
, DECL_CONTEXT (fn
));
5606 else if (TREE_CODE (arg
) == TARGET_EXPR
5607 || (TYPE_HAS_TRIVIAL_INIT_REF (DECL_CONTEXT (fn
))
5608 && !move_fn_p (fn
)))
5610 tree to
= stabilize_reference (cp_build_indirect_ref (fa
, 0,
5613 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
5617 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
5619 && TYPE_HAS_TRIVIAL_ASSIGN_REF (DECL_CONTEXT (fn
)))
5621 tree to
= stabilize_reference
5622 (cp_build_indirect_ref (argarray
[0], 0, complain
));
5623 tree type
= TREE_TYPE (to
);
5624 tree as_base
= CLASSTYPE_AS_BASE (type
);
5625 tree arg
= argarray
[1];
5627 if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
5629 arg
= cp_build_indirect_ref (arg
, 0, complain
);
5630 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
5634 /* We must only copy the non-tail padding parts.
5635 Use __builtin_memcpy for the bitwise copy.
5636 FIXME fix 22488 so we can go back to using MODIFY_EXPR
5637 instead of an explicit call to memcpy. */
5639 tree arg0
, arg1
, arg2
, t
;
5640 tree test
= NULL_TREE
;
5642 arg2
= TYPE_SIZE_UNIT (as_base
);
5644 arg0
= cp_build_unary_op (ADDR_EXPR
, to
, 0, complain
);
5646 if (!(optimize
&& flag_tree_ter
))
5648 /* When TER is off get_pointer_alignment returns 0, so a call
5649 to __builtin_memcpy is expanded as a call to memcpy, which
5650 is invalid with identical args. When TER is on it is
5651 expanded as a block move, which should be safe. */
5652 arg0
= save_expr (arg0
);
5653 arg1
= save_expr (arg1
);
5654 test
= build2 (EQ_EXPR
, boolean_type_node
, arg0
, arg1
);
5656 t
= implicit_built_in_decls
[BUILT_IN_MEMCPY
];
5657 t
= build_call_n (t
, 3, arg0
, arg1
, arg2
);
5659 t
= convert (TREE_TYPE (arg0
), t
);
5661 t
= build3 (COND_EXPR
, TREE_TYPE (t
), test
, arg0
, t
);
5662 val
= cp_build_indirect_ref (t
, 0, complain
);
5663 TREE_NO_WARNING (val
) = 1;
5672 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
5675 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
5678 gcc_assert (binfo
&& binfo
!= error_mark_node
);
5680 /* Warn about deprecated virtual functions now, since we're about
5681 to throw away the decl. */
5682 if (TREE_DEPRECATED (fn
))
5683 warn_deprecated_use (fn
, NULL_TREE
);
5685 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1);
5686 if (TREE_SIDE_EFFECTS (argarray
[0]))
5687 argarray
[0] = save_expr (argarray
[0]);
5688 t
= build_pointer_type (TREE_TYPE (fn
));
5689 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
5690 fn
= build_java_interface_fn_ref (fn
, argarray
[0]);
5692 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
5696 fn
= build_addr_func (fn
);
5698 return build_cxx_call (fn
, nargs
, argarray
);
5701 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
5702 This function performs no overload resolution, conversion, or other
5703 high-level operations. */
5706 build_cxx_call (tree fn
, int nargs
, tree
*argarray
)
5710 fn
= build_call_a (fn
, nargs
, argarray
);
5712 /* If this call might throw an exception, note that fact. */
5713 fndecl
= get_callee_fndecl (fn
);
5714 if ((!fndecl
|| !TREE_NOTHROW (fndecl
))
5715 && at_function_scope_p ()
5717 cp_function_chain
->can_throw
= 1;
5719 /* Check that arguments to builtin functions match the expectations. */
5721 && DECL_BUILT_IN (fndecl
)
5722 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
5723 && !check_builtin_function_arguments (fndecl
, nargs
, argarray
))
5724 return error_mark_node
;
5726 /* Some built-in function calls will be evaluated at compile-time in
5728 fn
= fold_if_not_in_template (fn
);
5730 if (VOID_TYPE_P (TREE_TYPE (fn
)))
5733 fn
= require_complete_type (fn
);
5734 if (fn
== error_mark_node
)
5735 return error_mark_node
;
5737 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
5738 fn
= build_cplus_new (TREE_TYPE (fn
), fn
);
5739 return convert_from_reference (fn
);
5742 static GTY(()) tree java_iface_lookup_fn
;
5744 /* Make an expression which yields the address of the Java interface
5745 method FN. This is achieved by generating a call to libjava's
5746 _Jv_LookupInterfaceMethodIdx(). */
5749 build_java_interface_fn_ref (tree fn
, tree instance
)
5751 tree lookup_fn
, method
, idx
;
5752 tree klass_ref
, iface
, iface_ref
;
5755 if (!java_iface_lookup_fn
)
5757 tree endlink
= build_void_list_node ();
5758 tree t
= tree_cons (NULL_TREE
, ptr_type_node
,
5759 tree_cons (NULL_TREE
, ptr_type_node
,
5760 tree_cons (NULL_TREE
, java_int_type_node
,
5762 java_iface_lookup_fn
5763 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx",
5764 build_function_type (ptr_type_node
, t
),
5765 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
5768 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
5769 This is the first entry in the vtable. */
5770 klass_ref
= build_vtbl_ref (cp_build_indirect_ref (instance
, 0,
5771 tf_warning_or_error
),
5774 /* Get the java.lang.Class pointer for the interface being called. */
5775 iface
= DECL_CONTEXT (fn
);
5776 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
5777 if (!iface_ref
|| TREE_CODE (iface_ref
) != VAR_DECL
5778 || DECL_CONTEXT (iface_ref
) != iface
)
5780 error ("could not find class$ field in java interface type %qT",
5782 return error_mark_node
;
5784 iface_ref
= build_address (iface_ref
);
5785 iface_ref
= convert (build_pointer_type (iface
), iface_ref
);
5787 /* Determine the itable index of FN. */
5789 for (method
= TYPE_METHODS (iface
); method
; method
= TREE_CHAIN (method
))
5791 if (!DECL_VIRTUAL_P (method
))
5797 idx
= build_int_cst (NULL_TREE
, i
);
5799 lookup_fn
= build1 (ADDR_EXPR
,
5800 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
5801 java_iface_lookup_fn
);
5802 return build_call_nary (ptr_type_node
, lookup_fn
,
5803 3, klass_ref
, iface_ref
, idx
);
5806 /* Returns the value to use for the in-charge parameter when making a
5807 call to a function with the indicated NAME.
5809 FIXME:Can't we find a neater way to do this mapping? */
5812 in_charge_arg_for_name (tree name
)
5814 if (name
== base_ctor_identifier
5815 || name
== base_dtor_identifier
)
5816 return integer_zero_node
;
5817 else if (name
== complete_ctor_identifier
)
5818 return integer_one_node
;
5819 else if (name
== complete_dtor_identifier
)
5820 return integer_two_node
;
5821 else if (name
== deleting_dtor_identifier
)
5822 return integer_three_node
;
5824 /* This function should only be called with one of the names listed
5830 /* Build a call to a constructor, destructor, or an assignment
5831 operator for INSTANCE, an expression with class type. NAME
5832 indicates the special member function to call; *ARGS are the
5833 arguments. ARGS may be NULL. This may change ARGS. BINFO
5834 indicates the base of INSTANCE that is to be passed as the `this'
5835 parameter to the member function called.
5837 FLAGS are the LOOKUP_* flags to use when processing the call.
5839 If NAME indicates a complete object constructor, INSTANCE may be
5840 NULL_TREE. In this case, the caller will call build_cplus_new to
5841 store the newly constructed object into a VAR_DECL. */
5844 build_special_member_call (tree instance
, tree name
, VEC(tree
,gc
) **args
,
5845 tree binfo
, int flags
, tsubst_flags_t complain
)
5848 /* The type of the subobject to be constructed or destroyed. */
5850 VEC(tree
,gc
) *allocated
= NULL
;
5853 gcc_assert (name
== complete_ctor_identifier
5854 || name
== base_ctor_identifier
5855 || name
== complete_dtor_identifier
5856 || name
== base_dtor_identifier
5857 || name
== deleting_dtor_identifier
5858 || name
== ansi_assopname (NOP_EXPR
));
5861 /* Resolve the name. */
5862 if (!complete_type_or_else (binfo
, NULL_TREE
))
5863 return error_mark_node
;
5865 binfo
= TYPE_BINFO (binfo
);
5868 gcc_assert (binfo
!= NULL_TREE
);
5870 class_type
= BINFO_TYPE (binfo
);
5872 /* Handle the special case where INSTANCE is NULL_TREE. */
5873 if (name
== complete_ctor_identifier
&& !instance
)
5875 instance
= build_int_cst (build_pointer_type (class_type
), 0);
5876 instance
= build1 (INDIRECT_REF
, class_type
, instance
);
5880 if (name
== complete_dtor_identifier
5881 || name
== base_dtor_identifier
5882 || name
== deleting_dtor_identifier
)
5883 gcc_assert (args
== NULL
|| VEC_empty (tree
, *args
));
5885 /* Convert to the base class, if necessary. */
5886 if (!same_type_ignoring_top_level_qualifiers_p
5887 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
5889 if (name
!= ansi_assopname (NOP_EXPR
))
5890 /* For constructors and destructors, either the base is
5891 non-virtual, or it is virtual but we are doing the
5892 conversion from a constructor or destructor for the
5893 complete object. In either case, we can convert
5895 instance
= convert_to_base_statically (instance
, binfo
);
5897 /* However, for assignment operators, we must convert
5898 dynamically if the base is virtual. */
5899 instance
= build_base_path (PLUS_EXPR
, instance
,
5900 binfo
, /*nonnull=*/1);
5904 gcc_assert (instance
!= NULL_TREE
);
5906 fns
= lookup_fnfields (binfo
, name
, 1);
5908 /* When making a call to a constructor or destructor for a subobject
5909 that uses virtual base classes, pass down a pointer to a VTT for
5911 if ((name
== base_ctor_identifier
5912 || name
== base_dtor_identifier
)
5913 && CLASSTYPE_VBASECLASSES (class_type
))
5918 /* If the current function is a complete object constructor
5919 or destructor, then we fetch the VTT directly.
5920 Otherwise, we look it up using the VTT we were given. */
5921 vtt
= TREE_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
5922 vtt
= decay_conversion (vtt
);
5923 vtt
= build3 (COND_EXPR
, TREE_TYPE (vtt
),
5924 build2 (EQ_EXPR
, boolean_type_node
,
5925 current_in_charge_parm
, integer_zero_node
),
5928 gcc_assert (BINFO_SUBVTT_INDEX (binfo
));
5929 sub_vtt
= build2 (POINTER_PLUS_EXPR
, TREE_TYPE (vtt
), vtt
,
5930 BINFO_SUBVTT_INDEX (binfo
));
5934 allocated
= make_tree_vector ();
5938 VEC_safe_insert (tree
, gc
, *args
, 0, sub_vtt
);
5941 ret
= build_new_method_call (instance
, fns
, args
,
5942 TYPE_BINFO (BINFO_TYPE (binfo
)),
5946 if (allocated
!= NULL
)
5947 release_tree_vector (allocated
);
5952 /* Return the NAME, as a C string. The NAME indicates a function that
5953 is a member of TYPE. *FREE_P is set to true if the caller must
5954 free the memory returned.
5956 Rather than go through all of this, we should simply set the names
5957 of constructors and destructors appropriately, and dispense with
5958 ctor_identifier, dtor_identifier, etc. */
5961 name_as_c_string (tree name
, tree type
, bool *free_p
)
5965 /* Assume that we will not allocate memory. */
5967 /* Constructors and destructors are special. */
5968 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
5971 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
5972 /* For a destructor, add the '~'. */
5973 if (name
== complete_dtor_identifier
5974 || name
== base_dtor_identifier
5975 || name
== deleting_dtor_identifier
)
5977 pretty_name
= concat ("~", pretty_name
, NULL
);
5978 /* Remember that we need to free the memory allocated. */
5982 else if (IDENTIFIER_TYPENAME_P (name
))
5984 pretty_name
= concat ("operator ",
5985 type_as_string_translate (TREE_TYPE (name
),
5986 TFF_PLAIN_IDENTIFIER
),
5988 /* Remember that we need to free the memory allocated. */
5992 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
5997 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
5998 be set, upon return, to the function called. ARGS may be NULL.
5999 This may change ARGS. */
6002 build_new_method_call (tree instance
, tree fns
, VEC(tree
,gc
) **args
,
6003 tree conversion_path
, int flags
,
6004 tree
*fn_p
, tsubst_flags_t complain
)
6006 struct z_candidate
*candidates
= 0, *cand
;
6007 tree explicit_targs
= NULL_TREE
;
6008 tree basetype
= NULL_TREE
;
6011 tree first_mem_arg
= NULL_TREE
;
6014 bool skip_first_for_error
;
6015 VEC(tree
,gc
) *user_args
;
6019 int template_only
= 0;
6023 VEC(tree
,gc
) *orig_args
= NULL
;
6026 gcc_assert (instance
!= NULL_TREE
);
6028 /* We don't know what function we're going to call, yet. */
6032 if (error_operand_p (instance
)
6033 || error_operand_p (fns
))
6034 return error_mark_node
;
6036 if (!BASELINK_P (fns
))
6038 if (complain
& tf_error
)
6039 error ("call to non-function %qD", fns
);
6040 return error_mark_node
;
6043 orig_instance
= instance
;
6046 /* Dismantle the baselink to collect all the information we need. */
6047 if (!conversion_path
)
6048 conversion_path
= BASELINK_BINFO (fns
);
6049 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
6050 optype
= BASELINK_OPTYPE (fns
);
6051 fns
= BASELINK_FUNCTIONS (fns
);
6052 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
6054 explicit_targs
= TREE_OPERAND (fns
, 1);
6055 fns
= TREE_OPERAND (fns
, 0);
6058 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
6059 || TREE_CODE (fns
) == TEMPLATE_DECL
6060 || TREE_CODE (fns
) == OVERLOAD
);
6061 fn
= get_first_fn (fns
);
6062 name
= DECL_NAME (fn
);
6064 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
6065 gcc_assert (CLASS_TYPE_P (basetype
));
6067 if (processing_template_decl
)
6069 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
6070 instance
= build_non_dependent_expr (instance
);
6072 make_args_non_dependent (*args
);
6075 /* Figure out whether to skip the first argument for the error
6076 message we will display to users if an error occurs. We don't
6077 want to display any compiler-generated arguments. The "this"
6078 pointer hasn't been added yet. However, we must remove the VTT
6079 pointer if this is a call to a base-class constructor or
6081 skip_first_for_error
= false;
6082 user_args
= args
== NULL
? NULL
: *args
;
6083 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
6085 /* Callers should explicitly indicate whether they want to construct
6086 the complete object or just the part without virtual bases. */
6087 gcc_assert (name
!= ctor_identifier
);
6088 /* Similarly for destructors. */
6089 gcc_assert (name
!= dtor_identifier
);
6090 /* Remove the VTT pointer, if present. */
6091 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
6092 && CLASSTYPE_VBASECLASSES (basetype
))
6093 skip_first_for_error
= true;
6096 /* Process the argument list. */
6097 if (args
!= NULL
&& *args
!= NULL
)
6099 *args
= resolve_args (*args
);
6101 return error_mark_node
;
6104 instance_ptr
= build_this (instance
);
6106 /* It's OK to call destructors and constructors on cv-qualified objects.
6107 Therefore, convert the INSTANCE_PTR to the unqualified type, if
6109 if (DECL_DESTRUCTOR_P (fn
)
6110 || DECL_CONSTRUCTOR_P (fn
))
6112 tree type
= build_pointer_type (basetype
);
6113 if (!same_type_p (type
, TREE_TYPE (instance_ptr
)))
6114 instance_ptr
= build_nop (type
, instance_ptr
);
6116 if (DECL_DESTRUCTOR_P (fn
))
6117 name
= complete_dtor_identifier
;
6119 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
6120 initializer, not T({ }). If the type doesn't have a list ctor,
6121 break apart the list into separate ctor args. */
6122 if (DECL_CONSTRUCTOR_P (fn
) && args
!= NULL
&& !VEC_empty (tree
, *args
)
6123 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree
, *args
, 0))
6124 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree
, *args
, 0))
6125 && !TYPE_HAS_LIST_CTOR (basetype
))
6127 gcc_assert (VEC_length (tree
, *args
) == 1);
6128 *args
= ctor_to_vec (VEC_index (tree
, *args
, 0));
6131 class_type
= (conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
);
6132 first_mem_arg
= instance_ptr
;
6134 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6135 p
= conversion_obstack_alloc (0);
6137 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
6139 tree t
= OVL_CURRENT (fn
);
6140 tree this_first_arg
;
6142 /* We can end up here for copy-init of same or base class. */
6143 if ((flags
& LOOKUP_ONLYCONVERTING
)
6144 && DECL_NONCONVERTING_P (t
))
6147 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (t
))
6148 this_first_arg
= first_mem_arg
;
6150 this_first_arg
= NULL_TREE
;
6152 if (TREE_CODE (t
) == TEMPLATE_DECL
)
6153 /* A member template. */
6154 add_template_candidate (&candidates
, t
,
6158 args
== NULL
? NULL
: *args
,
6164 else if (! template_only
)
6165 add_function_candidate (&candidates
, t
,
6168 args
== NULL
? NULL
: *args
,
6174 candidates
= splice_viable (candidates
, pedantic
, &any_viable_p
);
6177 if (complain
& tf_error
)
6179 if (!COMPLETE_TYPE_P (basetype
))
6180 cxx_incomplete_type_error (instance_ptr
, basetype
);
6187 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
6188 arglist
= build_tree_list_vec (user_args
);
6189 if (skip_first_for_error
)
6190 arglist
= TREE_CHAIN (arglist
);
6191 error ("no matching function for call to %<%T::%s(%A)%#V%>",
6192 basetype
, pretty_name
, arglist
,
6193 TREE_TYPE (TREE_TYPE (instance_ptr
)));
6197 print_z_candidates (candidates
);
6199 call
= error_mark_node
;
6203 cand
= tourney (candidates
);
6210 if (complain
& tf_error
)
6212 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
6213 arglist
= build_tree_list_vec (user_args
);
6214 if (skip_first_for_error
)
6215 arglist
= TREE_CHAIN (arglist
);
6216 error ("call of overloaded %<%s(%A)%> is ambiguous", pretty_name
,
6218 print_z_candidates (candidates
);
6222 call
= error_mark_node
;
6228 if (!(flags
& LOOKUP_NONVIRTUAL
)
6229 && DECL_PURE_VIRTUAL_P (fn
)
6230 && instance
== current_class_ref
6231 && (DECL_CONSTRUCTOR_P (current_function_decl
)
6232 || DECL_DESTRUCTOR_P (current_function_decl
))
6233 && (complain
& tf_warning
))
6234 /* This is not an error, it is runtime undefined
6236 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
) ?
6237 "abstract virtual %q#D called from constructor"
6238 : "abstract virtual %q#D called from destructor"),
6241 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
6242 && is_dummy_object (instance_ptr
))
6244 if (complain
& tf_error
)
6245 error ("cannot call member function %qD without object",
6247 call
= error_mark_node
;
6251 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
6252 && resolves_to_fixed_type_p (instance
, 0))
6253 flags
|= LOOKUP_NONVIRTUAL
;
6254 /* Now we know what function is being called. */
6257 /* Build the actual CALL_EXPR. */
6258 call
= build_over_call (cand
, flags
, complain
);
6259 /* In an expression of the form `a->f()' where `f' turns
6260 out to be a static member function, `a' is
6261 none-the-less evaluated. */
6262 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
6263 && !is_dummy_object (instance_ptr
)
6264 && TREE_SIDE_EFFECTS (instance_ptr
))
6265 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
6266 instance_ptr
, call
);
6267 else if (call
!= error_mark_node
6268 && DECL_DESTRUCTOR_P (cand
->fn
)
6269 && !VOID_TYPE_P (TREE_TYPE (call
)))
6270 /* An explicit call of the form "x->~X()" has type
6271 "void". However, on platforms where destructors
6272 return "this" (i.e., those where
6273 targetm.cxx.cdtor_returns_this is true), such calls
6274 will appear to have a return value of pointer type
6275 to the low-level call machinery. We do not want to
6276 change the low-level machinery, since we want to be
6277 able to optimize "delete f()" on such platforms as
6278 "operator delete(~X(f()))" (rather than generating
6279 "t = f(), ~X(t), operator delete (t)"). */
6280 call
= build_nop (void_type_node
, call
);
6285 if (processing_template_decl
&& call
!= error_mark_node
)
6287 bool cast_to_void
= false;
6289 if (TREE_CODE (call
) == COMPOUND_EXPR
)
6290 call
= TREE_OPERAND (call
, 1);
6291 else if (TREE_CODE (call
) == NOP_EXPR
)
6293 cast_to_void
= true;
6294 call
= TREE_OPERAND (call
, 0);
6296 if (TREE_CODE (call
) == INDIRECT_REF
)
6297 call
= TREE_OPERAND (call
, 0);
6298 call
= (build_min_non_dep_call_vec
6300 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
6301 orig_instance
, orig_fns
, NULL_TREE
),
6303 call
= convert_from_reference (call
);
6305 call
= build_nop (void_type_node
, call
);
6308 /* Free all the conversions we allocated. */
6309 obstack_free (&conversion_obstack
, p
);
6311 if (orig_args
!= NULL
)
6312 release_tree_vector (orig_args
);
6317 /* Returns true iff standard conversion sequence ICS1 is a proper
6318 subsequence of ICS2. */
6321 is_subseq (conversion
*ics1
, conversion
*ics2
)
6323 /* We can assume that a conversion of the same code
6324 between the same types indicates a subsequence since we only get
6325 here if the types we are converting from are the same. */
6327 while (ics1
->kind
== ck_rvalue
6328 || ics1
->kind
== ck_lvalue
)
6329 ics1
= ics1
->u
.next
;
6333 while (ics2
->kind
== ck_rvalue
6334 || ics2
->kind
== ck_lvalue
)
6335 ics2
= ics2
->u
.next
;
6337 if (ics2
->kind
== ck_user
6338 || ics2
->kind
== ck_ambig
6339 || ics2
->kind
== ck_identity
)
6340 /* At this point, ICS1 cannot be a proper subsequence of
6341 ICS2. We can get a USER_CONV when we are comparing the
6342 second standard conversion sequence of two user conversion
6346 ics2
= ics2
->u
.next
;
6348 if (ics2
->kind
== ics1
->kind
6349 && same_type_p (ics2
->type
, ics1
->type
)
6350 && same_type_p (ics2
->u
.next
->type
,
6351 ics1
->u
.next
->type
))
6356 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
6357 be any _TYPE nodes. */
6360 is_properly_derived_from (tree derived
, tree base
)
6362 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
6365 /* We only allow proper derivation here. The DERIVED_FROM_P macro
6366 considers every class derived from itself. */
6367 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
6368 && DERIVED_FROM_P (base
, derived
));
6371 /* We build the ICS for an implicit object parameter as a pointer
6372 conversion sequence. However, such a sequence should be compared
6373 as if it were a reference conversion sequence. If ICS is the
6374 implicit conversion sequence for an implicit object parameter,
6375 modify it accordingly. */
6378 maybe_handle_implicit_object (conversion
**ics
)
6382 /* [over.match.funcs]
6384 For non-static member functions, the type of the
6385 implicit object parameter is "reference to cv X"
6386 where X is the class of which the function is a
6387 member and cv is the cv-qualification on the member
6388 function declaration. */
6389 conversion
*t
= *ics
;
6390 tree reference_type
;
6392 /* The `this' parameter is a pointer to a class type. Make the
6393 implicit conversion talk about a reference to that same class
6395 reference_type
= TREE_TYPE (t
->type
);
6396 reference_type
= build_reference_type (reference_type
);
6398 if (t
->kind
== ck_qual
)
6400 if (t
->kind
== ck_ptr
)
6402 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
6403 t
= direct_reference_binding (reference_type
, t
);
6405 t
->rvaluedness_matches_p
= 0;
6410 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
6411 and return the initial reference binding conversion. Otherwise,
6412 leave *ICS unchanged and return NULL. */
6415 maybe_handle_ref_bind (conversion
**ics
)
6417 if ((*ics
)->kind
== ck_ref_bind
)
6419 conversion
*old_ics
= *ics
;
6420 *ics
= old_ics
->u
.next
;
6421 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
6422 (*ics
)->bad_p
= old_ics
->bad_p
;
6429 /* Compare two implicit conversion sequences according to the rules set out in
6430 [over.ics.rank]. Return values:
6432 1: ics1 is better than ics2
6433 -1: ics2 is better than ics1
6434 0: ics1 and ics2 are indistinguishable */
6437 compare_ics (conversion
*ics1
, conversion
*ics2
)
6443 tree deref_from_type1
= NULL_TREE
;
6444 tree deref_from_type2
= NULL_TREE
;
6445 tree deref_to_type1
= NULL_TREE
;
6446 tree deref_to_type2
= NULL_TREE
;
6447 conversion_rank rank1
, rank2
;
6449 /* REF_BINDING is nonzero if the result of the conversion sequence
6450 is a reference type. In that case REF_CONV is the reference
6451 binding conversion. */
6452 conversion
*ref_conv1
;
6453 conversion
*ref_conv2
;
6455 /* Handle implicit object parameters. */
6456 maybe_handle_implicit_object (&ics1
);
6457 maybe_handle_implicit_object (&ics2
);
6459 /* Handle reference parameters. */
6460 ref_conv1
= maybe_handle_ref_bind (&ics1
);
6461 ref_conv2
= maybe_handle_ref_bind (&ics2
);
6465 When comparing the basic forms of implicit conversion sequences (as
6466 defined in _over.best.ics_)
6468 --a standard conversion sequence (_over.ics.scs_) is a better
6469 conversion sequence than a user-defined conversion sequence
6470 or an ellipsis conversion sequence, and
6472 --a user-defined conversion sequence (_over.ics.user_) is a
6473 better conversion sequence than an ellipsis conversion sequence
6474 (_over.ics.ellipsis_). */
6475 rank1
= CONVERSION_RANK (ics1
);
6476 rank2
= CONVERSION_RANK (ics2
);
6480 else if (rank1
< rank2
)
6483 if (rank1
== cr_bad
)
6485 /* XXX Isn't this an extension? */
6486 /* Both ICS are bad. We try to make a decision based on what
6487 would have happened if they'd been good. */
6488 if (ics1
->user_conv_p
> ics2
->user_conv_p
6489 || ics1
->rank
> ics2
->rank
)
6491 else if (ics1
->user_conv_p
< ics2
->user_conv_p
6492 || ics1
->rank
< ics2
->rank
)
6495 /* We couldn't make up our minds; try to figure it out below. */
6498 if (ics1
->ellipsis_p
)
6499 /* Both conversions are ellipsis conversions. */
6502 /* User-defined conversion sequence U1 is a better conversion sequence
6503 than another user-defined conversion sequence U2 if they contain the
6504 same user-defined conversion operator or constructor and if the sec-
6505 ond standard conversion sequence of U1 is better than the second
6506 standard conversion sequence of U2. */
6508 if (ics1
->user_conv_p
)
6513 for (t1
= ics1
; t1
->kind
!= ck_user
&& t1
->kind
!= ck_list
; t1
= t1
->u
.next
)
6514 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
)
6516 for (t2
= ics2
; t2
->kind
!= ck_user
&& t2
->kind
!= ck_list
; t2
= t2
->u
.next
)
6517 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
)
6520 /* Conversion to std::initializer_list is better than other
6521 user-defined conversions. */
6522 if (t1
->kind
== ck_list
6523 || t2
->kind
== ck_list
)
6525 if (t2
->kind
!= ck_list
)
6527 else if (t1
->kind
!= ck_list
)
6533 if (t1
->cand
->fn
!= t2
->cand
->fn
)
6536 /* We can just fall through here, after setting up
6537 FROM_TYPE1 and FROM_TYPE2. */
6538 from_type1
= t1
->type
;
6539 from_type2
= t2
->type
;
6546 /* We're dealing with two standard conversion sequences.
6550 Standard conversion sequence S1 is a better conversion
6551 sequence than standard conversion sequence S2 if
6553 --S1 is a proper subsequence of S2 (comparing the conversion
6554 sequences in the canonical form defined by _over.ics.scs_,
6555 excluding any Lvalue Transformation; the identity
6556 conversion sequence is considered to be a subsequence of
6557 any non-identity conversion sequence */
6560 while (t1
->kind
!= ck_identity
)
6562 from_type1
= t1
->type
;
6565 while (t2
->kind
!= ck_identity
)
6567 from_type2
= t2
->type
;
6570 /* One sequence can only be a subsequence of the other if they start with
6571 the same type. They can start with different types when comparing the
6572 second standard conversion sequence in two user-defined conversion
6574 if (same_type_p (from_type1
, from_type2
))
6576 if (is_subseq (ics1
, ics2
))
6578 if (is_subseq (ics2
, ics1
))
6586 --the rank of S1 is better than the rank of S2 (by the rules
6589 Standard conversion sequences are ordered by their ranks: an Exact
6590 Match is a better conversion than a Promotion, which is a better
6591 conversion than a Conversion.
6593 Two conversion sequences with the same rank are indistinguishable
6594 unless one of the following rules applies:
6596 --A conversion that is not a conversion of a pointer, or pointer
6597 to member, to bool is better than another conversion that is such
6600 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
6601 so that we do not have to check it explicitly. */
6602 if (ics1
->rank
< ics2
->rank
)
6604 else if (ics2
->rank
< ics1
->rank
)
6607 to_type1
= ics1
->type
;
6608 to_type2
= ics2
->type
;
6610 /* A conversion from scalar arithmetic type to complex is worse than a
6611 conversion between scalar arithmetic types. */
6612 if (same_type_p (from_type1
, from_type2
)
6613 && ARITHMETIC_TYPE_P (from_type1
)
6614 && ARITHMETIC_TYPE_P (to_type1
)
6615 && ARITHMETIC_TYPE_P (to_type2
)
6616 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
6617 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
6619 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
6625 if (TYPE_PTR_P (from_type1
)
6626 && TYPE_PTR_P (from_type2
)
6627 && TYPE_PTR_P (to_type1
)
6628 && TYPE_PTR_P (to_type2
))
6630 deref_from_type1
= TREE_TYPE (from_type1
);
6631 deref_from_type2
= TREE_TYPE (from_type2
);
6632 deref_to_type1
= TREE_TYPE (to_type1
);
6633 deref_to_type2
= TREE_TYPE (to_type2
);
6635 /* The rules for pointers to members A::* are just like the rules
6636 for pointers A*, except opposite: if B is derived from A then
6637 A::* converts to B::*, not vice versa. For that reason, we
6638 switch the from_ and to_ variables here. */
6639 else if ((TYPE_PTRMEM_P (from_type1
) && TYPE_PTRMEM_P (from_type2
)
6640 && TYPE_PTRMEM_P (to_type1
) && TYPE_PTRMEM_P (to_type2
))
6641 || (TYPE_PTRMEMFUNC_P (from_type1
)
6642 && TYPE_PTRMEMFUNC_P (from_type2
)
6643 && TYPE_PTRMEMFUNC_P (to_type1
)
6644 && TYPE_PTRMEMFUNC_P (to_type2
)))
6646 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
6647 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
6648 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
6649 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
6652 if (deref_from_type1
!= NULL_TREE
6653 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
6654 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
6656 /* This was one of the pointer or pointer-like conversions.
6660 --If class B is derived directly or indirectly from class A,
6661 conversion of B* to A* is better than conversion of B* to
6662 void*, and conversion of A* to void* is better than
6663 conversion of B* to void*. */
6664 if (TREE_CODE (deref_to_type1
) == VOID_TYPE
6665 && TREE_CODE (deref_to_type2
) == VOID_TYPE
)
6667 if (is_properly_derived_from (deref_from_type1
,
6670 else if (is_properly_derived_from (deref_from_type2
,
6674 else if (TREE_CODE (deref_to_type1
) == VOID_TYPE
6675 || TREE_CODE (deref_to_type2
) == VOID_TYPE
)
6677 if (same_type_p (deref_from_type1
, deref_from_type2
))
6679 if (TREE_CODE (deref_to_type2
) == VOID_TYPE
)
6681 if (is_properly_derived_from (deref_from_type1
,
6685 /* We know that DEREF_TO_TYPE1 is `void' here. */
6686 else if (is_properly_derived_from (deref_from_type1
,
6691 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
6692 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
6696 --If class B is derived directly or indirectly from class A
6697 and class C is derived directly or indirectly from B,
6699 --conversion of C* to B* is better than conversion of C* to
6702 --conversion of B* to A* is better than conversion of C* to
6704 if (same_type_p (deref_from_type1
, deref_from_type2
))
6706 if (is_properly_derived_from (deref_to_type1
,
6709 else if (is_properly_derived_from (deref_to_type2
,
6713 else if (same_type_p (deref_to_type1
, deref_to_type2
))
6715 if (is_properly_derived_from (deref_from_type2
,
6718 else if (is_properly_derived_from (deref_from_type1
,
6724 else if (CLASS_TYPE_P (non_reference (from_type1
))
6725 && same_type_p (from_type1
, from_type2
))
6727 tree from
= non_reference (from_type1
);
6731 --binding of an expression of type C to a reference of type
6732 B& is better than binding an expression of type C to a
6733 reference of type A&
6735 --conversion of C to B is better than conversion of C to A, */
6736 if (is_properly_derived_from (from
, to_type1
)
6737 && is_properly_derived_from (from
, to_type2
))
6739 if (is_properly_derived_from (to_type1
, to_type2
))
6741 else if (is_properly_derived_from (to_type2
, to_type1
))
6745 else if (CLASS_TYPE_P (non_reference (to_type1
))
6746 && same_type_p (to_type1
, to_type2
))
6748 tree to
= non_reference (to_type1
);
6752 --binding of an expression of type B to a reference of type
6753 A& is better than binding an expression of type C to a
6754 reference of type A&,
6756 --conversion of B to A is better than conversion of C to A */
6757 if (is_properly_derived_from (from_type1
, to
)
6758 && is_properly_derived_from (from_type2
, to
))
6760 if (is_properly_derived_from (from_type2
, from_type1
))
6762 else if (is_properly_derived_from (from_type1
, from_type2
))
6769 --S1 and S2 differ only in their qualification conversion and yield
6770 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
6771 qualification signature of type T1 is a proper subset of the cv-
6772 qualification signature of type T2 */
6773 if (ics1
->kind
== ck_qual
6774 && ics2
->kind
== ck_qual
6775 && same_type_p (from_type1
, from_type2
))
6777 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
6784 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
6785 to an implicit object parameter, and either S1 binds an lvalue reference
6786 to an lvalue and S2 binds an rvalue reference or S1 binds an rvalue
6787 reference to an rvalue and S2 binds an lvalue reference
6788 (C++0x draft standard, 13.3.3.2)
6790 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
6791 types to which the references refer are the same type except for
6792 top-level cv-qualifiers, and the type to which the reference
6793 initialized by S2 refers is more cv-qualified than the type to
6794 which the reference initialized by S1 refers */
6796 if (ref_conv1
&& ref_conv2
)
6798 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
6799 && (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
6800 != TYPE_REF_IS_RVALUE (ref_conv2
->type
)))
6802 if (ref_conv1
->rvaluedness_matches_p
)
6804 if (ref_conv2
->rvaluedness_matches_p
)
6808 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
6809 return comp_cv_qualification (TREE_TYPE (ref_conv2
->type
),
6810 TREE_TYPE (ref_conv1
->type
));
6813 /* Neither conversion sequence is better than the other. */
6817 /* The source type for this standard conversion sequence. */
6820 source_type (conversion
*t
)
6822 for (;; t
= t
->u
.next
)
6824 if (t
->kind
== ck_user
6825 || t
->kind
== ck_ambig
6826 || t
->kind
== ck_identity
)
6832 /* Note a warning about preferring WINNER to LOSER. We do this by storing
6833 a pointer to LOSER and re-running joust to produce the warning if WINNER
6834 is actually used. */
6837 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
6839 candidate_warning
*cw
= (candidate_warning
*)
6840 conversion_obstack_alloc (sizeof (candidate_warning
));
6842 cw
->next
= winner
->warnings
;
6843 winner
->warnings
= cw
;
6846 /* Compare two candidates for overloading as described in
6847 [over.match.best]. Return values:
6849 1: cand1 is better than cand2
6850 -1: cand2 is better than cand1
6851 0: cand1 and cand2 are indistinguishable */
6854 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
)
6857 int off1
= 0, off2
= 0;
6861 /* Candidates that involve bad conversions are always worse than those
6863 if (cand1
->viable
> cand2
->viable
)
6865 if (cand1
->viable
< cand2
->viable
)
6868 /* If we have two pseudo-candidates for conversions to the same type,
6869 or two candidates for the same function, arbitrarily pick one. */
6870 if (cand1
->fn
== cand2
->fn
6871 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
6874 /* a viable function F1
6875 is defined to be a better function than another viable function F2 if
6876 for all arguments i, ICSi(F1) is not a worse conversion sequence than
6877 ICSi(F2), and then */
6879 /* for some argument j, ICSj(F1) is a better conversion sequence than
6882 /* For comparing static and non-static member functions, we ignore
6883 the implicit object parameter of the non-static function. The
6884 standard says to pretend that the static function has an object
6885 parm, but that won't work with operator overloading. */
6886 len
= cand1
->num_convs
;
6887 if (len
!= cand2
->num_convs
)
6889 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
6890 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
6892 gcc_assert (static_1
!= static_2
);
6903 for (i
= 0; i
< len
; ++i
)
6905 conversion
*t1
= cand1
->convs
[i
+ off1
];
6906 conversion
*t2
= cand2
->convs
[i
+ off2
];
6907 int comp
= compare_ics (t1
, t2
);
6912 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
6913 == cr_std
+ cr_promotion
)
6914 && t1
->kind
== ck_std
6915 && t2
->kind
== ck_std
6916 && TREE_CODE (t1
->type
) == INTEGER_TYPE
6917 && TREE_CODE (t2
->type
) == INTEGER_TYPE
6918 && (TYPE_PRECISION (t1
->type
)
6919 == TYPE_PRECISION (t2
->type
))
6920 && (TYPE_UNSIGNED (t1
->u
.next
->type
)
6921 || (TREE_CODE (t1
->u
.next
->type
)
6924 tree type
= t1
->u
.next
->type
;
6926 struct z_candidate
*w
, *l
;
6928 type1
= t1
->type
, type2
= t2
->type
,
6929 w
= cand1
, l
= cand2
;
6931 type1
= t2
->type
, type2
= t1
->type
,
6932 w
= cand2
, l
= cand1
;
6936 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
6937 type
, type1
, type2
);
6938 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
6944 if (winner
&& comp
!= winner
)
6953 /* warn about confusing overload resolution for user-defined conversions,
6954 either between a constructor and a conversion op, or between two
6956 if (winner
&& warn_conversion
&& cand1
->second_conv
6957 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
6958 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
6960 struct z_candidate
*w
, *l
;
6961 bool give_warning
= false;
6964 w
= cand1
, l
= cand2
;
6966 w
= cand2
, l
= cand1
;
6968 /* We don't want to complain about `X::operator T1 ()'
6969 beating `X::operator T2 () const', when T2 is a no less
6970 cv-qualified version of T1. */
6971 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
6972 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
6974 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
6975 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
6977 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
6982 if (!comp_ptr_ttypes (t
, f
))
6983 give_warning
= true;
6986 give_warning
= true;
6992 tree source
= source_type (w
->convs
[0]);
6993 if (! DECL_CONSTRUCTOR_P (w
->fn
))
6994 source
= TREE_TYPE (source
);
6995 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
6996 && warning (OPT_Wconversion
, " for conversion from %qT to %qT",
6997 source
, w
->second_conv
->type
))
6999 inform (input_location
, " because conversion sequence for the argument is better");
7010 F1 is a non-template function and F2 is a template function
7013 if (!cand1
->template_decl
&& cand2
->template_decl
)
7015 else if (cand1
->template_decl
&& !cand2
->template_decl
)
7019 F1 and F2 are template functions and the function template for F1 is
7020 more specialized than the template for F2 according to the partial
7023 if (cand1
->template_decl
&& cand2
->template_decl
)
7025 winner
= more_specialized_fn
7026 (TI_TEMPLATE (cand1
->template_decl
),
7027 TI_TEMPLATE (cand2
->template_decl
),
7028 /* [temp.func.order]: The presence of unused ellipsis and default
7029 arguments has no effect on the partial ordering of function
7030 templates. add_function_candidate() will not have
7031 counted the "this" argument for constructors. */
7032 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
7038 the context is an initialization by user-defined conversion (see
7039 _dcl.init_ and _over.match.user_) and the standard conversion
7040 sequence from the return type of F1 to the destination type (i.e.,
7041 the type of the entity being initialized) is a better conversion
7042 sequence than the standard conversion sequence from the return type
7043 of F2 to the destination type. */
7045 if (cand1
->second_conv
)
7047 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
7052 /* Check whether we can discard a builtin candidate, either because we
7053 have two identical ones or matching builtin and non-builtin candidates.
7055 (Pedantically in the latter case the builtin which matched the user
7056 function should not be added to the overload set, but we spot it here.
7059 ... the builtin candidates include ...
7060 - do not have the same parameter type list as any non-template
7061 non-member candidate. */
7063 if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
7064 || TREE_CODE (cand2
->fn
) == IDENTIFIER_NODE
)
7066 for (i
= 0; i
< len
; ++i
)
7067 if (!same_type_p (cand1
->convs
[i
]->type
,
7068 cand2
->convs
[i
]->type
))
7070 if (i
== cand1
->num_convs
)
7072 if (cand1
->fn
== cand2
->fn
)
7073 /* Two built-in candidates; arbitrarily pick one. */
7075 else if (TREE_CODE (cand1
->fn
) == IDENTIFIER_NODE
)
7076 /* cand1 is built-in; prefer cand2. */
7079 /* cand2 is built-in; prefer cand1. */
7084 /* If the two function declarations represent the same function (this can
7085 happen with declarations in multiple scopes and arg-dependent lookup),
7086 arbitrarily choose one. But first make sure the default args we're
7088 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
7089 && equal_functions (cand1
->fn
, cand2
->fn
))
7091 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
7092 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
7094 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
7096 for (i
= 0; i
< len
; ++i
)
7098 /* Don't crash if the fn is variadic. */
7101 parms1
= TREE_CHAIN (parms1
);
7102 parms2
= TREE_CHAIN (parms2
);
7106 parms1
= TREE_CHAIN (parms1
);
7108 parms2
= TREE_CHAIN (parms2
);
7112 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
7113 TREE_PURPOSE (parms2
)))
7117 permerror (input_location
, "default argument mismatch in "
7118 "overload resolution");
7119 inform (input_location
,
7120 " candidate 1: %q+#F", cand1
->fn
);
7121 inform (input_location
,
7122 " candidate 2: %q+#F", cand2
->fn
);
7125 add_warning (cand1
, cand2
);
7128 parms1
= TREE_CHAIN (parms1
);
7129 parms2
= TREE_CHAIN (parms2
);
7137 /* Extension: If the worst conversion for one candidate is worse than the
7138 worst conversion for the other, take the first. */
7141 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
7142 struct z_candidate
*w
= 0, *l
= 0;
7144 for (i
= 0; i
< len
; ++i
)
7146 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
7147 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
7148 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
7149 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
7152 winner
= 1, w
= cand1
, l
= cand2
;
7154 winner
= -1, w
= cand2
, l
= cand1
;
7159 pedwarn (input_location
, 0,
7160 "ISO C++ says that these are ambiguous, even "
7161 "though the worst conversion for the first is better than "
7162 "the worst conversion for the second:");
7163 print_z_candidate (_("candidate 1:"), w
);
7164 print_z_candidate (_("candidate 2:"), l
);
7172 gcc_assert (!winner
);
7176 /* Given a list of candidates for overloading, find the best one, if any.
7177 This algorithm has a worst case of O(2n) (winner is last), and a best
7178 case of O(n/2) (totally ambiguous); much better than a sorting
7181 static struct z_candidate
*
7182 tourney (struct z_candidate
*candidates
)
7184 struct z_candidate
*champ
= candidates
, *challenger
;
7186 int champ_compared_to_predecessor
= 0;
7188 /* Walk through the list once, comparing each current champ to the next
7189 candidate, knocking out a candidate or two with each comparison. */
7191 for (challenger
= champ
->next
; challenger
; )
7193 fate
= joust (champ
, challenger
, 0);
7195 challenger
= challenger
->next
;
7200 champ
= challenger
->next
;
7203 champ_compared_to_predecessor
= 0;
7208 champ_compared_to_predecessor
= 1;
7211 challenger
= champ
->next
;
7215 /* Make sure the champ is better than all the candidates it hasn't yet
7216 been compared to. */
7218 for (challenger
= candidates
;
7220 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
7221 challenger
= challenger
->next
)
7223 fate
= joust (champ
, challenger
, 0);
7231 /* Returns nonzero if things of type FROM can be converted to TO. */
7234 can_convert (tree to
, tree from
)
7236 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
);
7239 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
7242 can_convert_arg (tree to
, tree from
, tree arg
, int flags
)
7248 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7249 p
= conversion_obstack_alloc (0);
7251 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
7253 ok_p
= (t
&& !t
->bad_p
);
7255 /* Free all the conversions we allocated. */
7256 obstack_free (&conversion_obstack
, p
);
7261 /* Like can_convert_arg, but allows dubious conversions as well. */
7264 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
)
7269 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7270 p
= conversion_obstack_alloc (0);
7271 /* Try to perform the conversion. */
7272 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
7274 /* Free all the conversions we allocated. */
7275 obstack_free (&conversion_obstack
, p
);
7280 /* Convert EXPR to TYPE. Return the converted expression.
7282 Note that we allow bad conversions here because by the time we get to
7283 this point we are committed to doing the conversion. If we end up
7284 doing a bad conversion, convert_like will complain. */
7287 perform_implicit_conversion_flags (tree type
, tree expr
, tsubst_flags_t complain
, int flags
)
7292 if (error_operand_p (expr
))
7293 return error_mark_node
;
7295 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7296 p
= conversion_obstack_alloc (0);
7298 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
7304 if (complain
& tf_error
)
7306 /* If expr has unknown type, then it is an overloaded function.
7307 Call instantiate_type to get good error messages. */
7308 if (TREE_TYPE (expr
) == unknown_type_node
)
7309 instantiate_type (type
, expr
, complain
);
7310 else if (invalid_nonstatic_memfn_p (expr
, complain
))
7311 /* We gave an error. */;
7313 error ("could not convert %qE to %qT", expr
, type
);
7315 expr
= error_mark_node
;
7317 else if (processing_template_decl
)
7319 /* In a template, we are only concerned about determining the
7320 type of non-dependent expressions, so we do not have to
7321 perform the actual conversion. */
7322 if (TREE_TYPE (expr
) != type
)
7323 expr
= build_nop (type
, expr
);
7326 expr
= convert_like (conv
, expr
, complain
);
7328 /* Free all the conversions we allocated. */
7329 obstack_free (&conversion_obstack
, p
);
7335 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
7337 return perform_implicit_conversion_flags (type
, expr
, complain
, LOOKUP_IMPLICIT
);
7340 /* Convert EXPR to TYPE (as a direct-initialization) if that is
7341 permitted. If the conversion is valid, the converted expression is
7342 returned. Otherwise, NULL_TREE is returned, except in the case
7343 that TYPE is a class type; in that case, an error is issued. If
7344 C_CAST_P is true, then this direction initialization is taking
7345 place as part of a static_cast being attempted as part of a C-style
7349 perform_direct_initialization_if_possible (tree type
,
7352 tsubst_flags_t complain
)
7357 if (type
== error_mark_node
|| error_operand_p (expr
))
7358 return error_mark_node
;
7361 If the destination type is a (possibly cv-qualified) class type:
7363 -- If the initialization is direct-initialization ...,
7364 constructors are considered. ... If no constructor applies, or
7365 the overload resolution is ambiguous, the initialization is
7367 if (CLASS_TYPE_P (type
))
7369 VEC(tree
,gc
) *args
= make_tree_vector_single (expr
);
7370 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
7371 &args
, type
, LOOKUP_NORMAL
, complain
);
7372 release_tree_vector (args
);
7373 return build_cplus_new (type
, expr
);
7376 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7377 p
= conversion_obstack_alloc (0);
7379 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
7382 if (!conv
|| conv
->bad_p
)
7385 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0, 0,
7386 /*issue_conversion_warnings=*/false,
7388 tf_warning_or_error
);
7390 /* Free all the conversions we allocated. */
7391 obstack_free (&conversion_obstack
, p
);
7396 /* DECL is a VAR_DECL whose type is a REFERENCE_TYPE. The reference
7397 is being bound to a temporary. Create and return a new VAR_DECL
7398 with the indicated TYPE; this variable will store the value to
7399 which the reference is bound. */
7402 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
7406 /* Create the variable. */
7407 var
= create_temporary_var (type
);
7409 /* Register the variable. */
7410 if (TREE_STATIC (decl
))
7412 /* Namespace-scope or local static; give it a mangled name. */
7415 TREE_STATIC (var
) = 1;
7416 name
= mangle_ref_init_variable (decl
);
7417 DECL_NAME (var
) = name
;
7418 SET_DECL_ASSEMBLER_NAME (var
, name
);
7419 var
= pushdecl_top_level (var
);
7422 /* Create a new cleanup level if necessary. */
7423 maybe_push_cleanup_level (type
);
7428 /* EXPR is the initializer for a variable DECL of reference or
7429 std::initializer_list type. Create, push and return a new VAR_DECL
7430 for the initializer so that it will live as long as DECL. Any
7431 cleanup for the new variable is returned through CLEANUP, and the
7432 code to initialize the new variable is returned through INITP. */
7435 set_up_extended_ref_temp (tree decl
, tree expr
, tree
*cleanup
, tree
*initp
)
7441 /* Create the temporary variable. */
7442 type
= TREE_TYPE (expr
);
7443 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
7444 layout_decl (var
, 0);
7445 /* If the rvalue is the result of a function call it will be
7446 a TARGET_EXPR. If it is some other construct (such as a
7447 member access expression where the underlying object is
7448 itself the result of a function call), turn it into a
7449 TARGET_EXPR here. It is important that EXPR be a
7450 TARGET_EXPR below since otherwise the INIT_EXPR will
7451 attempt to make a bitwise copy of EXPR to initialize
7453 if (TREE_CODE (expr
) != TARGET_EXPR
)
7454 expr
= get_target_expr (expr
);
7455 /* Create the INIT_EXPR that will initialize the temporary
7457 init
= build2 (INIT_EXPR
, type
, var
, expr
);
7458 if (at_function_scope_p ())
7460 add_decl_expr (var
);
7462 if (TREE_STATIC (var
))
7463 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
7465 *cleanup
= cxx_maybe_build_cleanup (var
);
7467 /* We must be careful to destroy the temporary only
7468 after its initialization has taken place. If the
7469 initialization throws an exception, then the
7470 destructor should not be run. We cannot simply
7471 transform INIT into something like:
7473 (INIT, ({ CLEANUP_STMT; }))
7475 because emit_local_var always treats the
7476 initializer as a full-expression. Thus, the
7477 destructor would run too early; it would run at the
7478 end of initializing the reference variable, rather
7479 than at the end of the block enclosing the
7482 The solution is to pass back a cleanup expression
7483 which the caller is responsible for attaching to
7484 the statement tree. */
7488 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
7489 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7490 static_aggregates
= tree_cons (NULL_TREE
, var
,
7498 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
7499 initializing a variable of that TYPE. If DECL is non-NULL, it is
7500 the VAR_DECL being initialized with the EXPR. (In that case, the
7501 type of DECL will be TYPE.) If DECL is non-NULL, then CLEANUP must
7502 also be non-NULL, and with *CLEANUP initialized to NULL. Upon
7503 return, if *CLEANUP is no longer NULL, it will be an expression
7504 that should be pushed as a cleanup after the returned expression
7505 is used to initialize DECL.
7507 Return the converted expression. */
7510 initialize_reference (tree type
, tree expr
, tree decl
, tree
*cleanup
)
7515 if (type
== error_mark_node
|| error_operand_p (expr
))
7516 return error_mark_node
;
7518 /* Get the high-water mark for the CONVERSION_OBSTACK. */
7519 p
= conversion_obstack_alloc (0);
7521 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
7523 if (!conv
|| conv
->bad_p
)
7525 if (!(TYPE_QUALS (TREE_TYPE (type
)) & TYPE_QUAL_CONST
)
7526 && !real_lvalue_p (expr
))
7527 error ("invalid initialization of non-const reference of "
7528 "type %qT from a temporary of type %qT",
7529 type
, TREE_TYPE (expr
));
7531 error ("invalid initialization of reference of type "
7532 "%qT from expression of type %qT", type
,
7534 return error_mark_node
;
7537 /* If DECL is non-NULL, then this special rule applies:
7541 The temporary to which the reference is bound or the temporary
7542 that is the complete object to which the reference is bound
7543 persists for the lifetime of the reference.
7545 The temporaries created during the evaluation of the expression
7546 initializing the reference, except the temporary to which the
7547 reference is bound, are destroyed at the end of the
7548 full-expression in which they are created.
7550 In that case, we store the converted expression into a new
7551 VAR_DECL in a new scope.
7553 However, we want to be careful not to create temporaries when
7554 they are not required. For example, given:
7557 struct D : public B {};
7561 there is no need to copy the return value from "f"; we can just
7562 extend its lifetime. Similarly, given:
7565 struct T { operator S(); };
7569 we can extend the lifetime of the return value of the conversion
7571 gcc_assert (conv
->kind
== ck_ref_bind
);
7575 tree base_conv_type
;
7577 /* Skip over the REF_BIND. */
7578 conv
= conv
->u
.next
;
7579 /* If the next conversion is a BASE_CONV, skip that too -- but
7580 remember that the conversion was required. */
7581 if (conv
->kind
== ck_base
)
7583 base_conv_type
= conv
->type
;
7584 conv
= conv
->u
.next
;
7587 base_conv_type
= NULL_TREE
;
7588 /* Perform the remainder of the conversion. */
7589 expr
= convert_like_real (conv
, expr
,
7590 /*fn=*/NULL_TREE
, /*argnum=*/0,
7592 /*issue_conversion_warnings=*/true,
7594 tf_warning_or_error
);
7595 if (error_operand_p (expr
))
7596 expr
= error_mark_node
;
7599 if (!real_lvalue_p (expr
))
7602 var
= set_up_extended_ref_temp (decl
, expr
, cleanup
, &init
);
7603 /* Use its address to initialize the reference variable. */
7604 expr
= build_address (var
);
7606 expr
= convert_to_base (expr
,
7607 build_pointer_type (base_conv_type
),
7608 /*check_access=*/true,
7610 expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (expr
), init
, expr
);
7613 /* Take the address of EXPR. */
7614 expr
= cp_build_unary_op (ADDR_EXPR
, expr
, 0, tf_warning_or_error
);
7615 /* If a BASE_CONV was required, perform it now. */
7617 expr
= (perform_implicit_conversion
7618 (build_pointer_type (base_conv_type
), expr
,
7619 tf_warning_or_error
));
7620 expr
= build_nop (type
, expr
);
7624 /* Perform the conversion. */
7625 expr
= convert_like (conv
, expr
, tf_warning_or_error
);
7627 /* Free all the conversions we allocated. */
7628 obstack_free (&conversion_obstack
, p
);
7633 /* Returns true iff TYPE is some variant of std::initializer_list. */
7636 is_std_init_list (tree type
)
7638 return (CLASS_TYPE_P (type
)
7639 && CP_TYPE_CONTEXT (type
) == std_node
7640 && strcmp (TYPE_NAME_STRING (type
), "initializer_list") == 0);
7643 /* Returns true iff DECL is a list constructor: i.e. a constructor which
7644 will accept an argument list of a single std::initializer_list<T>. */
7647 is_list_ctor (tree decl
)
7649 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
7652 if (!args
|| args
== void_list_node
)
7655 arg
= non_reference (TREE_VALUE (args
));
7656 if (!is_std_init_list (arg
))
7659 args
= TREE_CHAIN (args
);
7661 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
7662 /* There are more non-defaulted parms. */
7668 #include "gt-cp-call.h"