1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2016 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com) and
4 modified by Brendan Kehoe (brendan@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
27 #include "coretypes.h"
31 #include "stringpool.h"
33 #include "stor-layout.h"
34 #include "trans-mem.h"
39 #include "langhooks.h"
40 #include "c-family/c-objc.h"
41 #include "internal-fn.h"
43 /* The various kinds of conversion. */
45 enum conversion_kind
{
62 /* The rank of the conversion. Order of the enumerals matters; better
63 conversions should come earlier in the list. */
65 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. */
81 /* The kind of conversion represented by this step. */
83 /* The rank of this conversion. */
85 BOOL_BITFIELD user_conv_p
: 1;
86 BOOL_BITFIELD ellipsis_p
: 1;
87 BOOL_BITFIELD this_p
: 1;
88 /* True if this conversion would be permitted with a bending of
89 language standards, e.g. disregarding pointer qualifiers or
90 converting integers to pointers. */
91 BOOL_BITFIELD bad_p
: 1;
92 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
93 temporary should be created to hold the result of the
95 BOOL_BITFIELD need_temporary_p
: 1;
96 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
97 from a pointer-to-derived to pointer-to-base is being performed. */
98 BOOL_BITFIELD base_p
: 1;
99 /* If KIND is ck_ref_bind, true when either an lvalue reference is
100 being bound to an lvalue expression or an rvalue reference is
101 being bound to an rvalue expression. If KIND is ck_rvalue,
102 true when we should treat an lvalue as an rvalue (12.8p33). If
103 KIND is ck_base, always false. */
104 BOOL_BITFIELD rvaluedness_matches_p
: 1;
105 BOOL_BITFIELD check_narrowing
: 1;
106 /* The type of the expression resulting from the conversion. */
109 /* The next conversion in the chain. Since the conversions are
110 arranged from outermost to innermost, the NEXT conversion will
111 actually be performed before this conversion. This variant is
112 used only when KIND is neither ck_identity, ck_ambig nor
113 ck_list. Please use the next_conversion function instead
114 of using this field directly. */
116 /* The expression at the beginning of the conversion chain. This
117 variant is used only if KIND is ck_identity or ck_ambig. */
119 /* The array of conversions for an initializer_list, so this
120 variant is used only when KIN D is ck_list. */
123 /* The function candidate corresponding to this conversion
124 sequence. This field is only used if KIND is ck_user. */
125 struct z_candidate
*cand
;
128 #define CONVERSION_RANK(NODE) \
129 ((NODE)->bad_p ? cr_bad \
130 : (NODE)->ellipsis_p ? cr_ellipsis \
131 : (NODE)->user_conv_p ? cr_user \
134 #define BAD_CONVERSION_RANK(NODE) \
135 ((NODE)->ellipsis_p ? cr_ellipsis \
136 : (NODE)->user_conv_p ? cr_user \
139 static struct obstack conversion_obstack
;
140 static bool conversion_obstack_initialized
;
141 struct rejection_reason
;
143 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
144 static int equal_functions (tree
, tree
);
145 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
147 static int compare_ics (conversion
*, conversion
*);
148 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
149 static tree
build_java_interface_fn_ref (tree
, tree
);
150 #define convert_like(CONV, EXPR, COMPLAIN) \
151 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, 0, \
152 /*issue_conversion_warnings=*/true, \
153 /*c_cast_p=*/false, (COMPLAIN))
154 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
155 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), 0, \
156 /*issue_conversion_warnings=*/true, \
157 /*c_cast_p=*/false, (COMPLAIN))
158 static tree
convert_like_real (conversion
*, tree
, tree
, int, int, bool,
159 bool, tsubst_flags_t
);
160 static void op_error (location_t
, enum tree_code
, enum tree_code
, tree
,
162 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
164 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
165 static void print_z_candidates (location_t
, struct z_candidate
*);
166 static tree
build_this (tree
);
167 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
168 static bool any_strictly_viable (struct z_candidate
*);
169 static struct z_candidate
*add_template_candidate
170 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
171 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
172 static struct z_candidate
*add_template_candidate_real
173 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
174 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
175 static void add_builtin_candidates
176 (struct z_candidate
**, enum tree_code
, enum tree_code
,
177 tree
, tree
*, int, tsubst_flags_t
);
178 static void add_builtin_candidate
179 (struct z_candidate
**, enum tree_code
, enum tree_code
,
180 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
181 static bool is_complete (tree
);
182 static void build_builtin_candidate
183 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
184 int, tsubst_flags_t
);
185 static struct z_candidate
*add_conv_candidate
186 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
187 tree
, tsubst_flags_t
);
188 static struct z_candidate
*add_function_candidate
189 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
190 tree
, int, tsubst_flags_t
);
191 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
193 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
195 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
196 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
197 static conversion
*next_conversion (conversion
*);
198 static bool is_subseq (conversion
*, conversion
*);
199 static conversion
*maybe_handle_ref_bind (conversion
**);
200 static void maybe_handle_implicit_object (conversion
**);
201 static struct z_candidate
*add_candidate
202 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
203 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
204 static tree
source_type (conversion
*);
205 static void add_warning (struct z_candidate
*, struct z_candidate
*);
206 static bool reference_compatible_p (tree
, tree
);
207 static conversion
*direct_reference_binding (tree
, conversion
*);
208 static bool promoted_arithmetic_type_p (tree
);
209 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
210 static char *name_as_c_string (tree
, tree
, bool *);
211 static tree
prep_operand (tree
);
212 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
213 bool, tree
, tree
, int, struct z_candidate
**,
215 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
216 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
218 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
219 NAME can take many forms... */
222 check_dtor_name (tree basetype
, tree name
)
224 /* Just accept something we've already complained about. */
225 if (name
== error_mark_node
)
228 if (TREE_CODE (name
) == TYPE_DECL
)
229 name
= TREE_TYPE (name
);
230 else if (TYPE_P (name
))
232 else if (identifier_p (name
))
234 if ((MAYBE_CLASS_TYPE_P (basetype
)
235 && name
== constructor_name (basetype
))
236 || (TREE_CODE (basetype
) == ENUMERAL_TYPE
237 && name
== TYPE_IDENTIFIER (basetype
)))
240 name
= get_type_value (name
);
246 template <class T> struct S { ~S(); };
250 NAME will be a class template. */
251 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
255 if (!name
|| name
== error_mark_node
)
257 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
260 /* We want the address of a function or method. We avoid creating a
261 pointer-to-member function. */
264 build_addr_func (tree function
, tsubst_flags_t complain
)
266 tree type
= TREE_TYPE (function
);
268 /* We have to do these by hand to avoid real pointer to member
270 if (TREE_CODE (type
) == METHOD_TYPE
)
272 if (TREE_CODE (function
) == OFFSET_REF
)
274 tree object
= build_address (TREE_OPERAND (function
, 0));
275 return get_member_function_from_ptrfunc (&object
,
276 TREE_OPERAND (function
, 1),
279 function
= build_address (function
);
282 function
= decay_conversion (function
, complain
, /*reject_builtin=*/false);
287 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
288 POINTER_TYPE to those. Note, pointer to member function types
289 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
290 two variants. build_call_a is the primitive taking an array of
291 arguments, while build_call_n is a wrapper that handles varargs. */
294 build_call_n (tree function
, int n
, ...)
297 return build_call_a (function
, 0, NULL
);
300 tree
*argarray
= XALLOCAVEC (tree
, n
);
305 for (i
= 0; i
< n
; i
++)
306 argarray
[i
] = va_arg (ap
, tree
);
308 return build_call_a (function
, n
, argarray
);
312 /* Update various flags in cfun and the call itself based on what is being
313 called. Split out of build_call_a so that bot_manip can use it too. */
316 set_flags_from_callee (tree call
)
319 tree decl
= get_callee_fndecl (call
);
321 /* We check both the decl and the type; a function may be known not to
322 throw without being declared throw(). */
323 nothrow
= decl
&& TREE_NOTHROW (decl
);
324 if (CALL_EXPR_FN (call
))
325 nothrow
|= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (CALL_EXPR_FN (call
))));
326 else if (internal_fn_flags (CALL_EXPR_IFN (call
)) & ECF_NOTHROW
)
329 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
330 cp_function_chain
->can_throw
= 1;
332 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
333 current_function_returns_abnormally
= 1;
335 TREE_NOTHROW (call
) = nothrow
;
339 build_call_a (tree function
, int n
, tree
*argarray
)
346 function
= build_addr_func (function
, tf_warning_or_error
);
348 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
349 fntype
= TREE_TYPE (TREE_TYPE (function
));
350 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
351 || TREE_CODE (fntype
) == METHOD_TYPE
);
352 result_type
= TREE_TYPE (fntype
);
353 /* An rvalue has no cv-qualifiers. */
354 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
355 result_type
= cv_unqualified (result_type
);
357 function
= build_call_array_loc (input_location
,
358 result_type
, function
, n
, argarray
);
359 set_flags_from_callee (function
);
361 decl
= get_callee_fndecl (function
);
363 if (decl
&& !TREE_USED (decl
))
365 /* We invoke build_call directly for several library
366 functions. These may have been declared normally if
367 we're building libgcc, so we can't just check
369 gcc_assert (DECL_ARTIFICIAL (decl
)
370 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
375 require_complete_eh_spec_types (fntype
, decl
);
377 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
379 /* Don't pass empty class objects by value. This is useful
380 for tags in STL, which are used to control overload resolution.
381 We don't need to handle other cases of copying empty classes. */
382 if (! decl
|| ! DECL_BUILT_IN (decl
))
383 for (i
= 0; i
< n
; i
++)
385 tree arg
= CALL_EXPR_ARG (function
, i
);
386 if (is_empty_class (TREE_TYPE (arg
))
387 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
389 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
390 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
391 CALL_EXPR_ARG (function
, i
) = arg
;
398 /* New overloading code. */
402 struct candidate_warning
{
404 candidate_warning
*next
;
407 /* Information for providing diagnostics about why overloading failed. */
409 enum rejection_reason_code
{
412 rr_explicit_conversion
,
413 rr_template_conversion
,
415 rr_bad_arg_conversion
,
416 rr_template_unification
,
418 rr_constraint_failure
421 struct conversion_info
{
422 /* The index of the argument, 0-based. */
424 /* The actual argument or its type. */
426 /* The type of the parameter. */
430 struct rejection_reason
{
431 enum rejection_reason_code code
;
433 /* Information about an arity mismatch. */
435 /* The expected number of arguments. */
437 /* The actual number of arguments in the call. */
439 /* Whether the call was a varargs call. */
442 /* Information about an argument conversion mismatch. */
443 struct conversion_info conversion
;
444 /* Same, but for bad argument conversions. */
445 struct conversion_info bad_conversion
;
446 /* Information about template unification failures. These are the
447 parameters passed to fn_type_unification. */
455 unification_kind_t strict
;
457 } template_unification
;
458 /* Information about template instantiation failures. These are the
459 parameters passed to instantiate_template. */
463 } template_instantiation
;
468 /* The FUNCTION_DECL that will be called if this candidate is
469 selected by overload resolution. */
471 /* If not NULL_TREE, the first argument to use when calling this
474 /* The rest of the arguments to use when calling this function. If
475 there are no further arguments this may be NULL or it may be an
477 const vec
<tree
, va_gc
> *args
;
478 /* The implicit conversion sequences for each of the arguments to
481 /* The number of implicit conversion sequences. */
483 /* If FN is a user-defined conversion, the standard conversion
484 sequence from the type returned by FN to the desired destination
486 conversion
*second_conv
;
487 struct rejection_reason
*reason
;
488 /* If FN is a member function, the binfo indicating the path used to
489 qualify the name of FN at the call site. This path is used to
490 determine whether or not FN is accessible if it is selected by
491 overload resolution. The DECL_CONTEXT of FN will always be a
492 (possibly improper) base of this binfo. */
494 /* If FN is a non-static member function, the binfo indicating the
495 subobject to which the `this' pointer should be converted if FN
496 is selected by overload resolution. The type pointed to by
497 the `this' pointer must correspond to the most derived class
498 indicated by the CONVERSION_PATH. */
499 tree conversion_path
;
502 candidate_warning
*warnings
;
506 /* The flags active in add_candidate. */
510 /* Returns true iff T is a null pointer constant in the sense of
514 null_ptr_cst_p (tree t
)
516 tree type
= TREE_TYPE (t
);
520 A null pointer constant is an integral constant expression
521 (_expr.const_) rvalue of integer type that evaluates to zero or
522 an rvalue of type std::nullptr_t. */
523 if (NULLPTR_TYPE_P (type
))
526 if (cxx_dialect
>= cxx11
)
528 /* Core issue 903 says only literal 0 is a null pointer constant. */
529 if (TREE_CODE (type
) == INTEGER_TYPE
530 && TREE_CODE (t
) == INTEGER_CST
532 && !TREE_OVERFLOW (t
))
535 else if (CP_INTEGRAL_TYPE_P (type
))
537 t
= fold_non_dependent_expr (t
);
539 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
546 /* Returns true iff T is a null member pointer value (4.11). */
549 null_member_pointer_value_p (tree t
)
551 tree type
= TREE_TYPE (t
);
554 else if (TYPE_PTRMEMFUNC_P (type
))
555 return (TREE_CODE (t
) == CONSTRUCTOR
556 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
557 else if (TYPE_PTRDATAMEM_P (type
))
558 return integer_all_onesp (t
);
563 /* Returns nonzero if PARMLIST consists of only default parms,
564 ellipsis, and/or undeduced parameter packs. */
567 sufficient_parms_p (const_tree parmlist
)
569 for (; parmlist
&& parmlist
!= void_list_node
;
570 parmlist
= TREE_CHAIN (parmlist
))
571 if (!TREE_PURPOSE (parmlist
)
572 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
577 /* Allocate N bytes of memory from the conversion obstack. The memory
578 is zeroed before being returned. */
581 conversion_obstack_alloc (size_t n
)
584 if (!conversion_obstack_initialized
)
586 gcc_obstack_init (&conversion_obstack
);
587 conversion_obstack_initialized
= true;
589 p
= obstack_alloc (&conversion_obstack
, n
);
594 /* Allocate rejection reasons. */
596 static struct rejection_reason
*
597 alloc_rejection (enum rejection_reason_code code
)
599 struct rejection_reason
*p
;
600 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
605 static struct rejection_reason
*
606 arity_rejection (tree first_arg
, int expected
, int actual
)
608 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
609 int adjust
= first_arg
!= NULL_TREE
;
610 r
->u
.arity
.expected
= expected
- adjust
;
611 r
->u
.arity
.actual
= actual
- adjust
;
615 static struct rejection_reason
*
616 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
618 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
619 int adjust
= first_arg
!= NULL_TREE
;
620 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
621 r
->u
.conversion
.from
= from
;
622 r
->u
.conversion
.to_type
= to
;
626 static struct rejection_reason
*
627 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
)
629 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
630 int adjust
= first_arg
!= NULL_TREE
;
631 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
632 r
->u
.bad_conversion
.from
= from
;
633 r
->u
.bad_conversion
.to_type
= to
;
637 static struct rejection_reason
*
638 explicit_conversion_rejection (tree from
, tree to
)
640 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
641 r
->u
.conversion
.n_arg
= 0;
642 r
->u
.conversion
.from
= from
;
643 r
->u
.conversion
.to_type
= to
;
647 static struct rejection_reason
*
648 template_conversion_rejection (tree from
, tree to
)
650 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
651 r
->u
.conversion
.n_arg
= 0;
652 r
->u
.conversion
.from
= from
;
653 r
->u
.conversion
.to_type
= to
;
657 static struct rejection_reason
*
658 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
659 const tree
*args
, unsigned int nargs
,
660 tree return_type
, unification_kind_t strict
,
663 size_t args_n_bytes
= sizeof (*args
) * nargs
;
664 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
665 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
666 r
->u
.template_unification
.tmpl
= tmpl
;
667 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
668 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
669 /* Copy args to our own storage. */
670 memcpy (args1
, args
, args_n_bytes
);
671 r
->u
.template_unification
.args
= args1
;
672 r
->u
.template_unification
.nargs
= nargs
;
673 r
->u
.template_unification
.return_type
= return_type
;
674 r
->u
.template_unification
.strict
= strict
;
675 r
->u
.template_unification
.flags
= flags
;
679 static struct rejection_reason
*
680 template_unification_error_rejection (void)
682 return alloc_rejection (rr_template_unification
);
685 static struct rejection_reason
*
686 invalid_copy_with_fn_template_rejection (void)
688 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
692 // Build a constraint failure record, saving information into the
693 // template_instantiation field of the rejection. If FN is not a template
694 // declaration, the TMPL member is the FN declaration and TARGS is empty.
696 static struct rejection_reason
*
697 constraint_failure (tree fn
)
699 struct rejection_reason
*r
= alloc_rejection (rr_constraint_failure
);
700 if (tree ti
= DECL_TEMPLATE_INFO (fn
))
702 r
->u
.template_instantiation
.tmpl
= TI_TEMPLATE (ti
);
703 r
->u
.template_instantiation
.targs
= TI_ARGS (ti
);
707 r
->u
.template_instantiation
.tmpl
= fn
;
708 r
->u
.template_instantiation
.targs
= NULL_TREE
;
713 /* Dynamically allocate a conversion. */
716 alloc_conversion (conversion_kind kind
)
719 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
724 /* Make sure that all memory on the conversion obstack has been
728 validate_conversion_obstack (void)
730 if (conversion_obstack_initialized
)
731 gcc_assert ((obstack_next_free (&conversion_obstack
)
732 == obstack_base (&conversion_obstack
)));
735 /* Dynamically allocate an array of N conversions. */
738 alloc_conversions (size_t n
)
740 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
744 build_conv (conversion_kind code
, tree type
, conversion
*from
)
747 conversion_rank rank
= CONVERSION_RANK (from
);
749 /* Note that the caller is responsible for filling in t->cand for
750 user-defined conversions. */
751 t
= alloc_conversion (code
);
774 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
775 t
->bad_p
= from
->bad_p
;
780 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
781 specialization of std::initializer_list<T>, if such a conversion is
785 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
787 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
788 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
789 conversion
**subconvs
= alloc_conversions (len
);
794 /* Within a list-initialization we can have more user-defined
796 flags
&= ~LOOKUP_NO_CONVERSION
;
797 /* But no narrowing conversions. */
798 flags
|= LOOKUP_NO_NARROWING
;
800 /* Can't make an array of these types. */
801 if (TREE_CODE (elttype
) == REFERENCE_TYPE
802 || TREE_CODE (elttype
) == FUNCTION_TYPE
803 || VOID_TYPE_P (elttype
))
806 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
809 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
810 false, flags
, complain
);
817 t
= alloc_conversion (ck_list
);
819 t
->u
.list
= subconvs
;
822 for (i
= 0; i
< len
; ++i
)
824 conversion
*sub
= subconvs
[i
];
825 if (sub
->rank
> t
->rank
)
827 if (sub
->user_conv_p
)
828 t
->user_conv_p
= true;
836 /* Return the next conversion of the conversion chain (if applicable),
837 or NULL otherwise. Please use this function instead of directly
838 accessing fields of struct conversion. */
841 next_conversion (conversion
*conv
)
844 || conv
->kind
== ck_identity
845 || conv
->kind
== ck_ambig
846 || conv
->kind
== ck_list
)
851 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
852 is a valid aggregate initializer for array type ATYPE. */
855 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
858 tree elttype
= TREE_TYPE (atype
);
859 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
861 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
863 if (TREE_CODE (elttype
) == ARRAY_TYPE
864 && TREE_CODE (val
) == CONSTRUCTOR
)
865 ok
= can_convert_array (elttype
, val
, flags
, complain
);
867 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
875 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
876 aggregate class, if such a conversion is possible. */
879 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
881 unsigned HOST_WIDE_INT i
= 0;
883 tree field
= next_initializable_field (TYPE_FIELDS (type
));
884 tree empty_ctor
= NULL_TREE
;
886 /* We already called reshape_init in implicit_conversion. */
888 /* The conversions within the init-list aren't affected by the enclosing
889 context; they're always simple copy-initialization. */
890 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
892 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
894 tree ftype
= TREE_TYPE (field
);
898 if (i
< CONSTRUCTOR_NELTS (ctor
))
899 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
900 else if (DECL_INITIAL (field
))
901 val
= get_nsdmi (field
, /*ctor*/false);
902 else if (TREE_CODE (ftype
) == REFERENCE_TYPE
)
903 /* Value-initialization of reference is ill-formed. */
907 if (empty_ctor
== NULL_TREE
)
908 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
913 if (TREE_CODE (ftype
) == ARRAY_TYPE
914 && TREE_CODE (val
) == CONSTRUCTOR
)
915 ok
= can_convert_array (ftype
, val
, flags
, complain
);
917 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
923 if (TREE_CODE (type
) == UNION_TYPE
)
927 if (i
< CONSTRUCTOR_NELTS (ctor
))
930 c
= alloc_conversion (ck_aggr
);
933 c
->user_conv_p
= true;
934 c
->check_narrowing
= true;
939 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
940 array type, if such a conversion is possible. */
943 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
946 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
947 tree elttype
= TREE_TYPE (type
);
952 enum conversion_rank rank
= cr_exact
;
954 /* We might need to propagate the size from the element to the array. */
955 complete_type (type
);
957 if (TYPE_DOMAIN (type
)
958 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
960 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
965 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
967 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
970 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
971 false, flags
, complain
);
975 if (sub
->rank
> rank
)
977 if (sub
->user_conv_p
)
983 c
= alloc_conversion (ck_aggr
);
986 c
->user_conv_p
= user
;
992 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
993 complex type, if such a conversion is possible. */
996 build_complex_conv (tree type
, tree ctor
, int flags
,
997 tsubst_flags_t complain
)
1000 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1001 tree elttype
= TREE_TYPE (type
);
1006 enum conversion_rank rank
= cr_exact
;
1011 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1013 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1016 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1017 false, flags
, complain
);
1021 if (sub
->rank
> rank
)
1023 if (sub
->user_conv_p
)
1029 c
= alloc_conversion (ck_aggr
);
1032 c
->user_conv_p
= user
;
1038 /* Build a representation of the identity conversion from EXPR to
1039 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1042 build_identity_conv (tree type
, tree expr
)
1046 c
= alloc_conversion (ck_identity
);
1053 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1054 were multiple user-defined conversions to accomplish the job.
1055 Build a conversion that indicates that ambiguity. */
1058 build_ambiguous_conv (tree type
, tree expr
)
1062 c
= alloc_conversion (ck_ambig
);
1070 strip_top_quals (tree t
)
1072 if (TREE_CODE (t
) == ARRAY_TYPE
)
1074 return cp_build_qualified_type (t
, 0);
1077 /* Returns the standard conversion path (see [conv]) from type FROM to type
1078 TO, if any. For proper handling of null pointer constants, you must
1079 also pass the expression EXPR to convert from. If C_CAST_P is true,
1080 this conversion is coming from a C-style cast. */
1083 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1084 int flags
, tsubst_flags_t complain
)
1086 enum tree_code fcode
, tcode
;
1088 bool fromref
= false;
1091 to
= non_reference (to
);
1092 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1095 from
= TREE_TYPE (from
);
1098 to
= strip_top_quals (to
);
1099 from
= strip_top_quals (from
);
1101 if (expr
&& type_unknown_p (expr
))
1103 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1105 tsubst_flags_t tflags
= tf_conv
;
1106 expr
= instantiate_type (to
, expr
, tflags
);
1107 if (expr
== error_mark_node
)
1109 from
= TREE_TYPE (expr
);
1111 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1113 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1114 expr
= resolve_nondeduced_context (expr
, complain
);
1115 from
= TREE_TYPE (expr
);
1119 fcode
= TREE_CODE (from
);
1120 tcode
= TREE_CODE (to
);
1122 conv
= build_identity_conv (from
, expr
);
1123 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1125 from
= type_decays_to (from
);
1126 fcode
= TREE_CODE (from
);
1127 conv
= build_conv (ck_lvalue
, from
, conv
);
1129 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1130 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1131 express the copy constructor call required by copy-initialization. */
1132 else if (fromref
|| (expr
&& obvalue_p (expr
)))
1137 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1140 from
= strip_top_quals (bitfield_type
);
1141 fcode
= TREE_CODE (from
);
1144 conv
= build_conv (ck_rvalue
, from
, conv
);
1145 if (flags
& LOOKUP_PREFER_RVALUE
)
1146 conv
->rvaluedness_matches_p
= true;
1149 /* Allow conversion between `__complex__' data types. */
1150 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1152 /* The standard conversion sequence to convert FROM to TO is
1153 the standard conversion sequence to perform componentwise
1155 conversion
*part_conv
= standard_conversion
1156 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
,
1161 conv
= build_conv (part_conv
->kind
, to
, conv
);
1162 conv
->rank
= part_conv
->rank
;
1170 if (same_type_p (from
, to
))
1172 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1173 conv
->type
= qualified_to
;
1178 A null pointer constant can be converted to a pointer type; ... A
1179 null pointer constant of integral type can be converted to an
1180 rvalue of type std::nullptr_t. */
1181 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1182 || NULLPTR_TYPE_P (to
))
1183 && ((expr
&& null_ptr_cst_p (expr
))
1184 || NULLPTR_TYPE_P (from
)))
1185 conv
= build_conv (ck_std
, to
, conv
);
1186 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1187 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1189 /* For backwards brain damage compatibility, allow interconversion of
1190 pointers and integers with a pedwarn. */
1191 conv
= build_conv (ck_std
, to
, conv
);
1194 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1196 /* For backwards brain damage compatibility, allow interconversion of
1197 enums and integers with a pedwarn. */
1198 conv
= build_conv (ck_std
, to
, conv
);
1201 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1202 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1207 if (tcode
== POINTER_TYPE
1208 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (from
),
1211 else if (VOID_TYPE_P (TREE_TYPE (to
))
1212 && !TYPE_PTRDATAMEM_P (from
)
1213 && TREE_CODE (TREE_TYPE (from
)) != FUNCTION_TYPE
)
1215 tree nfrom
= TREE_TYPE (from
);
1216 /* Don't try to apply restrict to void. */
1217 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1218 from
= build_pointer_type
1219 (cp_build_qualified_type (void_type_node
, quals
));
1220 conv
= build_conv (ck_ptr
, from
, conv
);
1222 else if (TYPE_PTRDATAMEM_P (from
))
1224 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1225 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1227 if (DERIVED_FROM_P (fbase
, tbase
)
1228 && (same_type_ignoring_top_level_qualifiers_p
1229 (TYPE_PTRMEM_POINTED_TO_TYPE (from
),
1230 TYPE_PTRMEM_POINTED_TO_TYPE (to
))))
1232 from
= build_ptrmem_type (tbase
,
1233 TYPE_PTRMEM_POINTED_TO_TYPE (from
));
1234 conv
= build_conv (ck_pmem
, from
, conv
);
1236 else if (!same_type_p (fbase
, tbase
))
1239 else if (CLASS_TYPE_P (TREE_TYPE (from
))
1240 && CLASS_TYPE_P (TREE_TYPE (to
))
1243 An rvalue of type "pointer to cv D," where D is a
1244 class type, can be converted to an rvalue of type
1245 "pointer to cv B," where B is a base class (clause
1246 _class.derived_) of D. If B is an inaccessible
1247 (clause _class.access_) or ambiguous
1248 (_class.member.lookup_) base class of D, a program
1249 that necessitates this conversion is ill-formed.
1250 Therefore, we use DERIVED_FROM_P, and do not check
1251 access or uniqueness. */
1252 && DERIVED_FROM_P (TREE_TYPE (to
), TREE_TYPE (from
)))
1255 cp_build_qualified_type (TREE_TYPE (to
),
1256 cp_type_quals (TREE_TYPE (from
)));
1257 from
= build_pointer_type (from
);
1258 conv
= build_conv (ck_ptr
, from
, conv
);
1259 conv
->base_p
= true;
1261 else if (tx_safe_fn_type_p (TREE_TYPE (from
)))
1263 /* A prvalue of type "pointer to transaction_safe function" can be
1264 converted to a prvalue of type "pointer to function". */
1265 tree unsafe
= tx_unsafe_fn_variant (TREE_TYPE (from
));
1266 if (same_type_p (unsafe
, TREE_TYPE (to
)))
1268 from
= build_pointer_type (unsafe
);
1269 conv
= build_conv (ck_tsafe
, from
, conv
);
1273 if (tcode
== POINTER_TYPE
)
1275 to_pointee
= TREE_TYPE (to
);
1276 from_pointee
= TREE_TYPE (from
);
1280 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1281 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1284 if (same_type_p (from
, to
))
1286 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1287 /* In a C-style cast, we ignore CV-qualification because we
1288 are allowed to perform a static_cast followed by a
1290 conv
= build_conv (ck_qual
, to
, conv
);
1291 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1292 conv
= build_conv (ck_qual
, to
, conv
);
1293 else if (expr
&& string_conv_p (to
, expr
, 0))
1294 /* converting from string constant to char *. */
1295 conv
= build_conv (ck_qual
, to
, conv
);
1296 /* Allow conversions among compatible ObjC pointer types (base
1297 conversions have been already handled above). */
1298 else if (c_dialect_objc ()
1299 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1300 conv
= build_conv (ck_ptr
, to
, conv
);
1301 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1303 conv
= build_conv (ck_ptr
, to
, conv
);
1311 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1313 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1314 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1315 tree fbase
= class_of_this_parm (fromfn
);
1316 tree tbase
= class_of_this_parm (tofn
);
1318 if (!DERIVED_FROM_P (fbase
, tbase
)
1319 || !same_type_p (static_fn_type (fromfn
),
1320 static_fn_type (tofn
)))
1323 from
= build_memfn_type (fromfn
,
1325 cp_type_quals (tbase
),
1326 type_memfn_rqual (tofn
));
1327 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1328 conv
= build_conv (ck_pmem
, from
, conv
);
1329 conv
->base_p
= true;
1331 else if (tcode
== BOOLEAN_TYPE
)
1335 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1336 to member type can be converted to a prvalue of type bool. ...
1337 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1338 std::nullptr_t can be converted to a prvalue of type bool; */
1339 if (ARITHMETIC_TYPE_P (from
)
1340 || UNSCOPED_ENUM_P (from
)
1341 || fcode
== POINTER_TYPE
1342 || TYPE_PTRMEM_P (from
)
1343 || NULLPTR_TYPE_P (from
))
1345 conv
= build_conv (ck_std
, to
, conv
);
1346 if (fcode
== POINTER_TYPE
1347 || TYPE_PTRDATAMEM_P (from
)
1348 || (TYPE_PTRMEMFUNC_P (from
)
1349 && conv
->rank
< cr_pbool
)
1350 || NULLPTR_TYPE_P (from
))
1351 conv
->rank
= cr_pbool
;
1352 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1359 /* We don't check for ENUMERAL_TYPE here because there are no standard
1360 conversions to enum type. */
1361 /* As an extension, allow conversion to complex type. */
1362 else if (ARITHMETIC_TYPE_P (to
))
1364 if (! (INTEGRAL_CODE_P (fcode
)
1365 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1366 || SCOPED_ENUM_P (from
))
1368 conv
= build_conv (ck_std
, to
, conv
);
1370 /* Give this a better rank if it's a promotion. */
1371 if (same_type_p (to
, type_promotes_to (from
))
1372 && next_conversion (conv
)->rank
<= cr_promotion
)
1373 conv
->rank
= cr_promotion
;
1375 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1376 && vector_types_convertible_p (from
, to
, false))
1377 return build_conv (ck_std
, to
, conv
);
1378 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1379 && is_properly_derived_from (from
, to
))
1381 if (conv
->kind
== ck_rvalue
)
1382 conv
= next_conversion (conv
);
1383 conv
= build_conv (ck_base
, to
, conv
);
1384 /* The derived-to-base conversion indicates the initialization
1385 of a parameter with base type from an object of a derived
1386 type. A temporary object is created to hold the result of
1387 the conversion unless we're binding directly to a reference. */
1388 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1393 if (flags
& LOOKUP_NO_NARROWING
)
1394 conv
->check_narrowing
= true;
1399 /* Returns nonzero if T1 is reference-related to T2. */
1402 reference_related_p (tree t1
, tree t2
)
1404 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1407 t1
= TYPE_MAIN_VARIANT (t1
);
1408 t2
= TYPE_MAIN_VARIANT (t2
);
1412 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1413 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1415 return (same_type_p (t1
, t2
)
1416 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1417 && DERIVED_FROM_P (t1
, t2
)));
1420 /* Returns nonzero if T1 is reference-compatible with T2. */
1423 reference_compatible_p (tree t1
, tree t2
)
1427 "cv1 T1" is reference compatible with "cv2 T2" if T1 is
1428 reference-related to T2 and cv1 is the same cv-qualification as,
1429 or greater cv-qualification than, cv2. */
1430 return (reference_related_p (t1
, t2
)
1431 && at_least_as_qualified_p (t1
, t2
));
1434 /* A reference of the indicated TYPE is being bound directly to the
1435 expression represented by the implicit conversion sequence CONV.
1436 Return a conversion sequence for this binding. */
1439 direct_reference_binding (tree type
, conversion
*conv
)
1443 gcc_assert (TREE_CODE (type
) == REFERENCE_TYPE
);
1444 gcc_assert (TREE_CODE (conv
->type
) != REFERENCE_TYPE
);
1446 t
= TREE_TYPE (type
);
1450 When a parameter of reference type binds directly
1451 (_dcl.init.ref_) to an argument expression, the implicit
1452 conversion sequence is the identity conversion, unless the
1453 argument expression has a type that is a derived class of the
1454 parameter type, in which case the implicit conversion sequence is
1455 a derived-to-base Conversion.
1457 If the parameter binds directly to the result of applying a
1458 conversion function to the argument expression, the implicit
1459 conversion sequence is a user-defined conversion sequence
1460 (_over.ics.user_), with the second standard conversion sequence
1461 either an identity conversion or, if the conversion function
1462 returns an entity of a type that is a derived class of the
1463 parameter type, a derived-to-base conversion. */
1464 if (!same_type_ignoring_top_level_qualifiers_p (t
, conv
->type
))
1466 /* Represent the derived-to-base conversion. */
1467 conv
= build_conv (ck_base
, t
, conv
);
1468 /* We will actually be binding to the base-class subobject in
1469 the derived class, so we mark this conversion appropriately.
1470 That way, convert_like knows not to generate a temporary. */
1471 conv
->need_temporary_p
= false;
1473 return build_conv (ck_ref_bind
, type
, conv
);
1476 /* Returns the conversion path from type FROM to reference type TO for
1477 purposes of reference binding. For lvalue binding, either pass a
1478 reference type to FROM or an lvalue expression to EXPR. If the
1479 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1480 the conversion returned. If C_CAST_P is true, this
1481 conversion is coming from a C-style cast. */
1484 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1485 tsubst_flags_t complain
)
1487 conversion
*conv
= NULL
;
1488 tree to
= TREE_TYPE (rto
);
1493 cp_lvalue_kind gl_kind
;
1496 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1498 expr
= instantiate_type (to
, expr
, tf_none
);
1499 if (expr
== error_mark_node
)
1501 from
= TREE_TYPE (expr
);
1504 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1506 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1507 /* DR 1288: Otherwise, if the initializer list has a single element
1508 of type E and ... [T's] referenced type is reference-related to E,
1509 the object or reference is initialized from that element... */
1510 if (CONSTRUCTOR_NELTS (expr
) == 1)
1512 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1513 if (error_operand_p (elt
))
1515 tree etype
= TREE_TYPE (elt
);
1516 if (reference_related_p (to
, etype
))
1523 /* Otherwise, if T is a reference type, a prvalue temporary of the
1524 type referenced by T is copy-list-initialized or
1525 direct-list-initialized, depending on the kind of initialization
1526 for the reference, and the reference is bound to that temporary. */
1527 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1528 flags
|LOOKUP_NO_TEMP_BIND
, complain
);
1532 if (TREE_CODE (from
) == REFERENCE_TYPE
)
1534 from
= TREE_TYPE (from
);
1535 if (!TYPE_REF_IS_RVALUE (rfrom
)
1536 || TREE_CODE (from
) == FUNCTION_TYPE
)
1537 gl_kind
= clk_ordinary
;
1539 gl_kind
= clk_rvalueref
;
1543 gl_kind
= lvalue_kind (expr
);
1544 if (gl_kind
& clk_class
)
1545 /* A class prvalue is not a glvalue. */
1550 is_lvalue
= gl_kind
&& !(gl_kind
& clk_rvalueref
);
1553 if ((gl_kind
& clk_bitfield
) != 0)
1554 tfrom
= unlowered_expr_type (expr
);
1556 /* Figure out whether or not the types are reference-related and
1557 reference compatible. We have to do this after stripping
1558 references from FROM. */
1559 related_p
= reference_related_p (to
, tfrom
);
1560 /* If this is a C cast, first convert to an appropriately qualified
1561 type, so that we can later do a const_cast to the desired type. */
1562 if (related_p
&& c_cast_p
1563 && !at_least_as_qualified_p (to
, tfrom
))
1564 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1565 compatible_p
= reference_compatible_p (to
, tfrom
);
1567 /* Directly bind reference when target expression's type is compatible with
1568 the reference and expression is an lvalue. In DR391, the wording in
1569 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1570 const and rvalue references to rvalues of compatible class type.
1571 We should also do direct bindings for non-class xvalues. */
1574 || (!(flags
& LOOKUP_NO_TEMP_BIND
)
1575 && (CLASS_TYPE_P (from
)
1576 || TREE_CODE (from
) == ARRAY_TYPE
))))
1580 If the initializer expression
1582 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1583 is reference-compatible with "cv2 T2,"
1585 the reference is bound directly to the initializer expression
1589 If the initializer expression is an rvalue, with T2 a class type,
1590 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1591 is bound to the object represented by the rvalue or to a sub-object
1592 within that object. */
1594 conv
= build_identity_conv (tfrom
, expr
);
1595 conv
= direct_reference_binding (rto
, conv
);
1597 if (flags
& LOOKUP_PREFER_RVALUE
)
1598 /* The top-level caller requested that we pretend that the lvalue
1599 be treated as an rvalue. */
1600 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1601 else if (TREE_CODE (rfrom
) == REFERENCE_TYPE
)
1602 /* Handle rvalue reference to function properly. */
1603 conv
->rvaluedness_matches_p
1604 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1606 conv
->rvaluedness_matches_p
1607 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1609 if ((gl_kind
& clk_bitfield
) != 0
1610 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1611 /* For the purposes of overload resolution, we ignore the fact
1612 this expression is a bitfield or packed field. (In particular,
1613 [over.ics.ref] says specifically that a function with a
1614 non-const reference parameter is viable even if the
1615 argument is a bitfield.)
1617 However, when we actually call the function we must create
1618 a temporary to which to bind the reference. If the
1619 reference is volatile, or isn't const, then we cannot make
1620 a temporary, so we just issue an error when the conversion
1622 conv
->need_temporary_p
= true;
1624 /* Don't allow binding of lvalues (other than function lvalues) to
1625 rvalue references. */
1626 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1627 && TREE_CODE (to
) != FUNCTION_TYPE
1628 && !(flags
& LOOKUP_PREFER_RVALUE
))
1631 /* Nor the reverse. */
1632 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1633 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1634 || (flags
& LOOKUP_NO_RVAL_BIND
))
1635 && TREE_CODE (to
) != FUNCTION_TYPE
)
1643 /* [class.conv.fct] A conversion function is never used to convert a
1644 (possibly cv-qualified) object to the (possibly cv-qualified) same
1645 object type (or a reference to it), to a (possibly cv-qualified) base
1646 class of that type (or a reference to it).... */
1647 else if (CLASS_TYPE_P (from
) && !related_p
1648 && !(flags
& LOOKUP_NO_CONVERSION
))
1652 If the initializer expression
1654 -- has a class type (i.e., T2 is a class type) can be
1655 implicitly converted to an lvalue of type "cv3 T3," where
1656 "cv1 T1" is reference-compatible with "cv3 T3". (this
1657 conversion is selected by enumerating the applicable
1658 conversion functions (_over.match.ref_) and choosing the
1659 best one through overload resolution. (_over.match_).
1661 the reference is bound to the lvalue result of the conversion
1662 in the second case. */
1663 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1666 return cand
->second_conv
;
1669 /* From this point on, we conceptually need temporaries, even if we
1670 elide them. Only the cases above are "direct bindings". */
1671 if (flags
& LOOKUP_NO_TEMP_BIND
)
1676 When a parameter of reference type is not bound directly to an
1677 argument expression, the conversion sequence is the one required
1678 to convert the argument expression to the underlying type of the
1679 reference according to _over.best.ics_. Conceptually, this
1680 conversion sequence corresponds to copy-initializing a temporary
1681 of the underlying type with the argument expression. Any
1682 difference in top-level cv-qualification is subsumed by the
1683 initialization itself and does not constitute a conversion. */
1687 Otherwise, the reference shall be an lvalue reference to a
1688 non-volatile const type, or the reference shall be an rvalue
1691 We try below to treat this as a bad conversion to improve diagnostics,
1692 but if TO is an incomplete class, we need to reject this conversion
1693 now to avoid unnecessary instantiation. */
1694 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1695 && !COMPLETE_TYPE_P (to
))
1698 /* We're generating a temporary now, but don't bind any more in the
1699 conversion (specifically, don't slice the temporary returned by a
1700 conversion operator). */
1701 flags
|= LOOKUP_NO_TEMP_BIND
;
1703 /* Core issue 899: When [copy-]initializing a temporary to be bound
1704 to the first parameter of a copy constructor (12.8) called with
1705 a single argument in the context of direct-initialization,
1706 explicit conversion functions are also considered.
1708 So don't set LOOKUP_ONLYCONVERTING in that case. */
1709 if (!(flags
& LOOKUP_COPY_PARM
))
1710 flags
|= LOOKUP_ONLYCONVERTING
;
1713 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1718 if (conv
->user_conv_p
)
1720 /* If initializing the temporary used a conversion function,
1721 recalculate the second conversion sequence. */
1722 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1723 if (t
->kind
== ck_user
1724 && DECL_CONV_FN_P (t
->cand
->fn
))
1726 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1727 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1728 conversion
*new_second
1729 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1733 return merge_conversion_sequences (t
, new_second
);
1737 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1738 /* This reference binding, unlike those above, requires the
1739 creation of a temporary. */
1740 conv
->need_temporary_p
= true;
1741 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1745 Otherwise, the reference shall be an lvalue reference to a
1746 non-volatile const type, or the reference shall be an rvalue
1748 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1753 Otherwise, a temporary of type "cv1 T1" is created and
1754 initialized from the initializer expression using the rules for a
1755 non-reference copy initialization. If T1 is reference-related to
1756 T2, cv1 must be the same cv-qualification as, or greater
1757 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1758 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1764 /* Returns the implicit conversion sequence (see [over.ics]) from type
1765 FROM to type TO. The optional expression EXPR may affect the
1766 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1767 true, this conversion is coming from a C-style cast. */
1770 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1771 int flags
, tsubst_flags_t complain
)
1775 if (from
== error_mark_node
|| to
== error_mark_node
1776 || expr
== error_mark_node
)
1779 /* Other flags only apply to the primary function in overload
1780 resolution, or after we've chosen one. */
1781 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1782 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1783 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1785 /* FIXME: actually we don't want warnings either, but we can't just
1786 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1787 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1788 We really ought not to issue that warning until we've committed
1789 to that conversion. */
1790 complain
&= ~tf_error
;
1792 /* Call reshape_init early to remove redundant braces. */
1793 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1794 && CLASS_TYPE_P (to
)
1795 && COMPLETE_TYPE_P (complete_type (to
))
1796 && !CLASSTYPE_NON_AGGREGATE (to
))
1798 expr
= reshape_init (to
, expr
, complain
);
1799 if (expr
== error_mark_node
)
1801 from
= TREE_TYPE (expr
);
1804 if (TREE_CODE (to
) == REFERENCE_TYPE
)
1805 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1807 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
1812 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1814 if (is_std_init_list (to
))
1815 return build_list_conv (to
, expr
, flags
, complain
);
1817 /* As an extension, allow list-initialization of _Complex. */
1818 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1820 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1825 /* Allow conversion from an initializer-list with one element to a
1827 if (SCALAR_TYPE_P (to
))
1829 int nelts
= CONSTRUCTOR_NELTS (expr
);
1833 elt
= build_value_init (to
, tf_none
);
1834 else if (nelts
== 1)
1835 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1837 elt
= error_mark_node
;
1839 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1840 c_cast_p
, flags
, complain
);
1843 conv
->check_narrowing
= true;
1844 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1845 /* Too many levels of braces, i.e. '{{1}}'. */
1850 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1851 return build_array_conv (to
, expr
, flags
, complain
);
1854 if (expr
!= NULL_TREE
1855 && (MAYBE_CLASS_TYPE_P (from
)
1856 || MAYBE_CLASS_TYPE_P (to
))
1857 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1859 struct z_candidate
*cand
;
1861 if (CLASS_TYPE_P (to
)
1862 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1863 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1864 return build_aggr_conv (to
, expr
, flags
, complain
);
1866 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1869 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
1870 && CONSTRUCTOR_NELTS (expr
) == 1
1871 && !is_list_ctor (cand
->fn
))
1873 /* "If C is not an initializer-list constructor and the
1874 initializer list has a single element of type cv U, where U is
1875 X or a class derived from X, the implicit conversion sequence
1876 has Exact Match rank if U is X, or Conversion rank if U is
1878 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1879 tree elttype
= TREE_TYPE (elt
);
1880 if (reference_related_p (to
, elttype
))
1881 return implicit_conversion (to
, elttype
, elt
,
1882 c_cast_p
, flags
, complain
);
1884 conv
= cand
->second_conv
;
1887 /* We used to try to bind a reference to a temporary here, but that
1888 is now handled after the recursive call to this function at the end
1889 of reference_binding. */
1896 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1897 functions. ARGS will not be changed until a single candidate is
1900 static struct z_candidate
*
1901 add_candidate (struct z_candidate
**candidates
,
1902 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1903 size_t num_convs
, conversion
**convs
,
1904 tree access_path
, tree conversion_path
,
1905 int viable
, struct rejection_reason
*reason
,
1908 struct z_candidate
*cand
= (struct z_candidate
*)
1909 conversion_obstack_alloc (sizeof (struct z_candidate
));
1912 cand
->first_arg
= first_arg
;
1914 cand
->convs
= convs
;
1915 cand
->num_convs
= num_convs
;
1916 cand
->access_path
= access_path
;
1917 cand
->conversion_path
= conversion_path
;
1918 cand
->viable
= viable
;
1919 cand
->reason
= reason
;
1920 cand
->next
= *candidates
;
1921 cand
->flags
= flags
;
1927 /* Return the number of remaining arguments in the parameter list
1928 beginning with ARG. */
1931 remaining_arguments (tree arg
)
1935 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
1936 arg
= TREE_CHAIN (arg
))
1942 /* Create an overload candidate for the function or method FN called
1943 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
1944 FLAGS is passed on to implicit_conversion.
1946 This does not change ARGS.
1948 CTYPE, if non-NULL, is the type we want to pretend this function
1949 comes from for purposes of overload resolution. */
1951 static struct z_candidate
*
1952 add_function_candidate (struct z_candidate
**candidates
,
1953 tree fn
, tree ctype
, tree first_arg
,
1954 const vec
<tree
, va_gc
> *args
, tree access_path
,
1955 tree conversion_path
, int flags
,
1956 tsubst_flags_t complain
)
1958 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1962 tree orig_first_arg
= first_arg
;
1965 struct rejection_reason
*reason
= NULL
;
1967 /* At this point we should not see any functions which haven't been
1968 explicitly declared, except for friend functions which will have
1969 been found using argument dependent lookup. */
1970 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
1972 /* The `this', `in_chrg' and VTT arguments to constructors are not
1973 considered in overload resolution. */
1974 if (DECL_CONSTRUCTOR_P (fn
))
1976 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
1977 skip
= num_artificial_parms_for (fn
);
1978 if (skip
> 0 && first_arg
!= NULL_TREE
)
1981 first_arg
= NULL_TREE
;
1987 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
1988 convs
= alloc_conversions (len
);
1990 /* 13.3.2 - Viable functions [over.match.viable]
1991 First, to be a viable function, a candidate function shall have enough
1992 parameters to agree in number with the arguments in the list.
1994 We need to check this first; otherwise, checking the ICSes might cause
1995 us to produce an ill-formed template instantiation. */
1997 parmnode
= parmlist
;
1998 for (i
= 0; i
< len
; ++i
)
2000 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
2002 parmnode
= TREE_CHAIN (parmnode
);
2005 if ((i
< len
&& parmnode
)
2006 || !sufficient_parms_p (parmnode
))
2008 int remaining
= remaining_arguments (parmnode
);
2010 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2013 /* Second, for a function to be viable, its constraints must be
2015 if (flag_concepts
&& viable
2016 && !constraints_satisfied_p (fn
))
2018 reason
= constraint_failure (fn
);
2022 /* When looking for a function from a subobject from an implicit
2023 copy/move constructor/operator=, don't consider anything that takes (a
2024 reference to) an unrelated type. See c++/44909 and core 1092. */
2025 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2027 if (DECL_CONSTRUCTOR_P (fn
))
2029 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2030 && DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
)
2036 parmnode
= chain_index (i
-1, parmlist
);
2037 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2042 /* This only applies at the top level. */
2043 flags
&= ~LOOKUP_DEFAULTED
;
2049 /* Third, for F to be a viable function, there shall exist for each
2050 argument an implicit conversion sequence that converts that argument
2051 to the corresponding parameter of F. */
2053 parmnode
= parmlist
;
2055 for (i
= 0; i
< len
; ++i
)
2057 tree argtype
, to_type
;
2062 if (parmnode
== void_list_node
)
2065 if (i
== 0 && first_arg
!= NULL_TREE
)
2068 arg
= CONST_CAST_TREE (
2069 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2070 argtype
= lvalue_type (arg
);
2072 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2073 && ! DECL_CONSTRUCTOR_P (fn
));
2077 tree parmtype
= TREE_VALUE (parmnode
);
2080 parmnode
= TREE_CHAIN (parmnode
);
2082 /* The type of the implicit object parameter ('this') for
2083 overload resolution is not always the same as for the
2084 function itself; conversion functions are considered to
2085 be members of the class being converted, and functions
2086 introduced by a using-declaration are considered to be
2087 members of the class that uses them.
2089 Since build_over_call ignores the ICS for the `this'
2090 parameter, we can just change the parm type. */
2091 if (ctype
&& is_this
)
2093 parmtype
= cp_build_qualified_type
2094 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2095 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2097 /* If the function has a ref-qualifier, the implicit
2098 object parameter has reference type. */
2099 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2100 parmtype
= cp_build_reference_type (parmtype
, rv
);
2101 /* The special handling of 'this' conversions in compare_ics
2102 does not apply if there is a ref-qualifier. */
2107 parmtype
= build_pointer_type (parmtype
);
2108 arg
= build_this (arg
);
2109 argtype
= lvalue_type (arg
);
2113 /* Core issue 899: When [copy-]initializing a temporary to be bound
2114 to the first parameter of a copy constructor (12.8) called with
2115 a single argument in the context of direct-initialization,
2116 explicit conversion functions are also considered.
2118 So set LOOKUP_COPY_PARM to let reference_binding know that
2119 it's being called in that context. We generalize the above
2120 to handle move constructors and template constructors as well;
2121 the standardese should soon be updated similarly. */
2122 if (ctype
&& i
== 0 && (len
-skip
== 1)
2123 && DECL_CONSTRUCTOR_P (fn
)
2124 && parmtype
!= error_mark_node
2125 && (same_type_ignoring_top_level_qualifiers_p
2126 (non_reference (parmtype
), ctype
)))
2128 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2129 lflags
|= LOOKUP_COPY_PARM
;
2130 /* We allow user-defined conversions within init-lists, but
2131 don't list-initialize the copy parm, as that would mean
2132 using two levels of braces for the same type. */
2133 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2134 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2135 lflags
|= LOOKUP_NO_CONVERSION
;
2138 lflags
|= LOOKUP_ONLYCONVERTING
;
2140 t
= implicit_conversion (parmtype
, argtype
, arg
,
2141 /*c_cast_p=*/false, lflags
, complain
);
2146 t
= build_identity_conv (argtype
, arg
);
2147 t
->ellipsis_p
= true;
2158 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
);
2165 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
);
2170 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2171 access_path
, conversion_path
, viable
, reason
, flags
);
2174 /* Create an overload candidate for the conversion function FN which will
2175 be invoked for expression OBJ, producing a pointer-to-function which
2176 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2177 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2178 passed on to implicit_conversion.
2180 Actually, we don't really care about FN; we care about the type it
2181 converts to. There may be multiple conversion functions that will
2182 convert to that type, and we rely on build_user_type_conversion_1 to
2183 choose the best one; so when we create our candidate, we record the type
2184 instead of the function. */
2186 static struct z_candidate
*
2187 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2188 const vec
<tree
, va_gc
> *arglist
,
2189 tree access_path
, tree conversion_path
,
2190 tsubst_flags_t complain
)
2192 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2193 int i
, len
, viable
, flags
;
2194 tree parmlist
, parmnode
;
2196 struct rejection_reason
*reason
;
2198 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2199 parmlist
= TREE_TYPE (parmlist
);
2200 parmlist
= TYPE_ARG_TYPES (parmlist
);
2202 len
= vec_safe_length (arglist
) + 1;
2203 convs
= alloc_conversions (len
);
2204 parmnode
= parmlist
;
2206 flags
= LOOKUP_IMPLICIT
;
2209 /* Don't bother looking up the same type twice. */
2210 if (*candidates
&& (*candidates
)->fn
== totype
)
2213 for (i
= 0; i
< len
; ++i
)
2215 tree arg
, argtype
, convert_type
= NULL_TREE
;
2221 arg
= (*arglist
)[i
- 1];
2222 argtype
= lvalue_type (arg
);
2226 t
= implicit_conversion (totype
, argtype
, arg
, /*c_cast_p=*/false,
2228 convert_type
= totype
;
2230 else if (parmnode
== void_list_node
)
2234 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2235 /*c_cast_p=*/false, flags
, complain
);
2236 convert_type
= TREE_VALUE (parmnode
);
2240 t
= build_identity_conv (argtype
, arg
);
2241 t
->ellipsis_p
= true;
2242 convert_type
= argtype
;
2252 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
);
2259 parmnode
= TREE_CHAIN (parmnode
);
2263 || ! sufficient_parms_p (parmnode
))
2265 int remaining
= remaining_arguments (parmnode
);
2267 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2270 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2271 access_path
, conversion_path
, viable
, reason
, flags
);
2275 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2276 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2277 int flags
, tsubst_flags_t complain
)
2284 struct rejection_reason
*reason
= NULL
;
2289 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2290 convs
= alloc_conversions (num_convs
);
2292 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2293 conversion ops are allowed. We handle that here by just checking for
2294 boolean_type_node because other operators don't ask for it. COND_EXPR
2295 also does contextual conversion to bool for the first operand, but we
2296 handle that in build_conditional_expr, and type1 here is operand 2. */
2297 if (type1
!= boolean_type_node
)
2298 flags
|= LOOKUP_ONLYCONVERTING
;
2300 for (i
= 0; i
< 2; ++i
)
2305 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2306 /*c_cast_p=*/false, flags
, complain
);
2310 /* We need something for printing the candidate. */
2311 t
= build_identity_conv (types
[i
], NULL_TREE
);
2312 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2318 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2324 /* For COND_EXPR we rearranged the arguments; undo that now. */
2327 convs
[2] = convs
[1];
2328 convs
[1] = convs
[0];
2329 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2330 /*c_cast_p=*/false, flags
,
2337 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2342 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2344 /*access_path=*/NULL_TREE
,
2345 /*conversion_path=*/NULL_TREE
,
2346 viable
, reason
, flags
);
2350 is_complete (tree t
)
2352 return COMPLETE_TYPE_P (complete_type (t
));
2355 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2358 promoted_arithmetic_type_p (tree type
)
2362 In this section, the term promoted integral type is used to refer
2363 to those integral types which are preserved by integral promotion
2364 (including e.g. int and long but excluding e.g. char).
2365 Similarly, the term promoted arithmetic type refers to promoted
2366 integral types plus floating types. */
2367 return ((CP_INTEGRAL_TYPE_P (type
)
2368 && same_type_p (type_promotes_to (type
), type
))
2369 || TREE_CODE (type
) == REAL_TYPE
);
2372 /* Create any builtin operator overload candidates for the operator in
2373 question given the converted operand types TYPE1 and TYPE2. The other
2374 args are passed through from add_builtin_candidates to
2375 build_builtin_candidate.
2377 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2378 If CODE is requires candidates operands of the same type of the kind
2379 of which TYPE1 and TYPE2 are, we add both candidates
2380 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2383 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2384 enum tree_code code2
, tree fnname
, tree type1
,
2385 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2386 tsubst_flags_t complain
)
2390 case POSTINCREMENT_EXPR
:
2391 case POSTDECREMENT_EXPR
:
2392 args
[1] = integer_zero_node
;
2393 type2
= integer_type_node
;
2402 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2403 and VQ is either volatile or empty, there exist candidate operator
2404 functions of the form
2405 VQ T& operator++(VQ T&);
2406 T operator++(VQ T&, int);
2407 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2408 type other than bool, and VQ is either volatile or empty, there exist
2409 candidate operator functions of the form
2410 VQ T& operator--(VQ T&);
2411 T operator--(VQ T&, int);
2412 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2413 complete object type, and VQ is either volatile or empty, there exist
2414 candidate operator functions of the form
2415 T*VQ& operator++(T*VQ&);
2416 T*VQ& operator--(T*VQ&);
2417 T* operator++(T*VQ&, int);
2418 T* operator--(T*VQ&, int); */
2420 case POSTDECREMENT_EXPR
:
2421 case PREDECREMENT_EXPR
:
2422 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2425 case POSTINCREMENT_EXPR
:
2426 case PREINCREMENT_EXPR
:
2427 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2429 type1
= build_reference_type (type1
);
2434 /* 7 For every cv-qualified or cv-unqualified object type T, there
2435 exist candidate operator functions of the form
2439 8 For every function type T, there exist candidate operator functions of
2441 T& operator*(T*); */
2444 if (TYPE_PTR_P (type1
)
2445 && (TYPE_PTROB_P (type1
)
2446 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2450 /* 9 For every type T, there exist candidate operator functions of the form
2453 10For every promoted arithmetic type T, there exist candidate operator
2454 functions of the form
2458 case UNARY_PLUS_EXPR
: /* unary + */
2459 if (TYPE_PTR_P (type1
))
2463 if (ARITHMETIC_TYPE_P (type1
))
2467 /* 11For every promoted integral type T, there exist candidate operator
2468 functions of the form
2472 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2476 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2477 is the same type as C2 or is a derived class of C2, T is a complete
2478 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2479 there exist candidate operator functions of the form
2480 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2481 where CV12 is the union of CV1 and CV2. */
2484 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2486 tree c1
= TREE_TYPE (type1
);
2487 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2489 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2490 && (TYPE_PTRMEMFUNC_P (type2
)
2491 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2496 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2497 didate operator functions of the form
2502 bool operator<(L, R);
2503 bool operator>(L, R);
2504 bool operator<=(L, R);
2505 bool operator>=(L, R);
2506 bool operator==(L, R);
2507 bool operator!=(L, R);
2508 where LR is the result of the usual arithmetic conversions between
2511 14For every pair of types T and I, where T is a cv-qualified or cv-
2512 unqualified complete object type and I is a promoted integral type,
2513 there exist candidate operator functions of the form
2514 T* operator+(T*, I);
2515 T& operator[](T*, I);
2516 T* operator-(T*, I);
2517 T* operator+(I, T*);
2518 T& operator[](I, T*);
2520 15For every T, where T is a pointer to complete object type, there exist
2521 candidate operator functions of the form112)
2522 ptrdiff_t operator-(T, T);
2524 16For every pointer or enumeration type T, there exist candidate operator
2525 functions of the form
2526 bool operator<(T, T);
2527 bool operator>(T, T);
2528 bool operator<=(T, T);
2529 bool operator>=(T, T);
2530 bool operator==(T, T);
2531 bool operator!=(T, T);
2533 17For every pointer to member type T, there exist candidate operator
2534 functions of the form
2535 bool operator==(T, T);
2536 bool operator!=(T, T); */
2539 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2541 if (TYPE_PTROB_P (type1
)
2542 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2544 type2
= ptrdiff_type_node
;
2548 case TRUNC_DIV_EXPR
:
2549 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2555 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2556 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2558 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2563 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2575 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2577 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2579 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2580 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2582 if (TYPE_PTR_P (type1
)
2583 && null_ptr_cst_p (args
[1]))
2588 if (null_ptr_cst_p (args
[0])
2589 && TYPE_PTR_P (type2
))
2597 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2601 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2603 type1
= ptrdiff_type_node
;
2606 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2608 type2
= ptrdiff_type_node
;
2613 /* 18For every pair of promoted integral types L and R, there exist candi-
2614 date operator functions of the form
2621 where LR is the result of the usual arithmetic conversions between
2624 case TRUNC_MOD_EXPR
:
2630 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2634 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2635 type, VQ is either volatile or empty, and R is a promoted arithmetic
2636 type, there exist candidate operator functions of the form
2637 VQ L& operator=(VQ L&, R);
2638 VQ L& operator*=(VQ L&, R);
2639 VQ L& operator/=(VQ L&, R);
2640 VQ L& operator+=(VQ L&, R);
2641 VQ L& operator-=(VQ L&, R);
2643 20For every pair T, VQ), where T is any type and VQ is either volatile
2644 or empty, there exist candidate operator functions of the form
2645 T*VQ& operator=(T*VQ&, T*);
2647 21For every pair T, VQ), where T is a pointer to member type and VQ is
2648 either volatile or empty, there exist candidate operator functions of
2650 VQ T& operator=(VQ T&, T);
2652 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2653 unqualified complete object type, VQ is either volatile or empty, and
2654 I is a promoted integral type, there exist candidate operator func-
2656 T*VQ& operator+=(T*VQ&, I);
2657 T*VQ& operator-=(T*VQ&, I);
2659 23For every triple L, VQ, R), where L is an integral or enumeration
2660 type, VQ is either volatile or empty, and R is a promoted integral
2661 type, there exist candidate operator functions of the form
2663 VQ L& operator%=(VQ L&, R);
2664 VQ L& operator<<=(VQ L&, R);
2665 VQ L& operator>>=(VQ L&, R);
2666 VQ L& operator&=(VQ L&, R);
2667 VQ L& operator^=(VQ L&, R);
2668 VQ L& operator|=(VQ L&, R); */
2675 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2677 type2
= ptrdiff_type_node
;
2682 case TRUNC_DIV_EXPR
:
2683 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2687 case TRUNC_MOD_EXPR
:
2693 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2698 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2700 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2701 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2702 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2703 || ((TYPE_PTRMEMFUNC_P (type1
)
2704 || TYPE_PTR_P (type1
))
2705 && null_ptr_cst_p (args
[1])))
2715 type1
= build_reference_type (type1
);
2721 For every pair of promoted arithmetic types L and R, there
2722 exist candidate operator functions of the form
2724 LR operator?(bool, L, R);
2726 where LR is the result of the usual arithmetic conversions
2727 between types L and R.
2729 For every type T, where T is a pointer or pointer-to-member
2730 type, there exist candidate operator functions of the form T
2731 operator?(bool, T, T); */
2733 if (promoted_arithmetic_type_p (type1
)
2734 && promoted_arithmetic_type_p (type2
))
2738 /* Otherwise, the types should be pointers. */
2739 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2742 /* We don't check that the two types are the same; the logic
2743 below will actually create two candidates; one in which both
2744 parameter types are TYPE1, and one in which both parameter
2750 if (ARITHMETIC_TYPE_P (type1
))
2758 /* Make sure we don't create builtin candidates with dependent types. */
2759 bool u1
= uses_template_parms (type1
);
2760 bool u2
= type2
? uses_template_parms (type2
) : false;
2763 /* Try to recover if one of the types is non-dependent. But if
2764 there's only one type, there's nothing we can do. */
2767 /* And we lose if both are dependent. */
2770 /* Or if they have different forms. */
2771 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2780 /* If we're dealing with two pointer types or two enumeral types,
2781 we need candidates for both of them. */
2782 if (type2
&& !same_type_p (type1
, type2
)
2783 && TREE_CODE (type1
) == TREE_CODE (type2
)
2784 && (TREE_CODE (type1
) == REFERENCE_TYPE
2785 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2786 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2787 || TYPE_PTRMEMFUNC_P (type1
)
2788 || MAYBE_CLASS_TYPE_P (type1
)
2789 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2791 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2793 tree cptype
= composite_pointer_type (type1
, type2
,
2798 if (cptype
!= error_mark_node
)
2800 build_builtin_candidate
2801 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2807 build_builtin_candidate
2808 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2809 build_builtin_candidate
2810 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2814 build_builtin_candidate
2815 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2819 type_decays_to (tree type
)
2821 if (TREE_CODE (type
) == ARRAY_TYPE
)
2822 return build_pointer_type (TREE_TYPE (type
));
2823 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2824 return build_pointer_type (type
);
2828 /* There are three conditions of builtin candidates:
2830 1) bool-taking candidates. These are the same regardless of the input.
2831 2) pointer-pair taking candidates. These are generated for each type
2832 one of the input types converts to.
2833 3) arithmetic candidates. According to the standard, we should generate
2834 all of these, but I'm trying not to...
2836 Here we generate a superset of the possible candidates for this particular
2837 case. That is a subset of the full set the standard defines, plus some
2838 other cases which the standard disallows. add_builtin_candidate will
2839 filter out the invalid set. */
2842 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2843 enum tree_code code2
, tree fnname
, tree
*args
,
2844 int flags
, tsubst_flags_t complain
)
2848 tree type
, argtypes
[3], t
;
2849 /* TYPES[i] is the set of possible builtin-operator parameter types
2850 we will consider for the Ith argument. */
2851 vec
<tree
, va_gc
> *types
[2];
2854 for (i
= 0; i
< 3; ++i
)
2857 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2859 argtypes
[i
] = NULL_TREE
;
2864 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2865 and VQ is either volatile or empty, there exist candidate operator
2866 functions of the form
2867 VQ T& operator++(VQ T&); */
2869 case POSTINCREMENT_EXPR
:
2870 case PREINCREMENT_EXPR
:
2871 case POSTDECREMENT_EXPR
:
2872 case PREDECREMENT_EXPR
:
2877 /* 24There also exist candidate operator functions of the form
2878 bool operator!(bool);
2879 bool operator&&(bool, bool);
2880 bool operator||(bool, bool); */
2882 case TRUTH_NOT_EXPR
:
2883 build_builtin_candidate
2884 (candidates
, fnname
, boolean_type_node
,
2885 NULL_TREE
, args
, argtypes
, flags
, complain
);
2888 case TRUTH_ORIF_EXPR
:
2889 case TRUTH_ANDIF_EXPR
:
2890 build_builtin_candidate
2891 (candidates
, fnname
, boolean_type_node
,
2892 boolean_type_node
, args
, argtypes
, flags
, complain
);
2914 types
[0] = make_tree_vector ();
2915 types
[1] = make_tree_vector ();
2917 for (i
= 0; i
< 2; ++i
)
2921 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
2925 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
2928 convs
= lookup_conversions (argtypes
[i
]);
2930 if (code
== COND_EXPR
)
2932 if (lvalue_p (args
[i
]))
2933 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
2935 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
2941 for (; convs
; convs
= TREE_CHAIN (convs
))
2943 type
= TREE_TYPE (convs
);
2946 && (TREE_CODE (type
) != REFERENCE_TYPE
2947 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
2950 if (code
== COND_EXPR
&& TREE_CODE (type
) == REFERENCE_TYPE
)
2951 vec_safe_push (types
[i
], type
);
2953 type
= non_reference (type
);
2954 if (i
!= 0 || ! ref1
)
2956 type
= cv_unqualified (type_decays_to (type
));
2957 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
2958 vec_safe_push (types
[i
], type
);
2959 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2960 type
= type_promotes_to (type
);
2963 if (! vec_member (type
, types
[i
]))
2964 vec_safe_push (types
[i
], type
);
2969 if (code
== COND_EXPR
&& lvalue_p (args
[i
]))
2970 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
2971 type
= non_reference (argtypes
[i
]);
2972 if (i
!= 0 || ! ref1
)
2974 type
= cv_unqualified (type_decays_to (type
));
2975 if (enum_p
&& UNSCOPED_ENUM_P (type
))
2976 vec_safe_push (types
[i
], type
);
2977 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
2978 type
= type_promotes_to (type
);
2980 vec_safe_push (types
[i
], type
);
2984 /* Run through the possible parameter types of both arguments,
2985 creating candidates with those parameter types. */
2986 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
2991 if (!types
[1]->is_empty ())
2992 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
2993 add_builtin_candidate
2994 (candidates
, code
, code2
, fnname
, t
,
2995 u
, args
, argtypes
, flags
, complain
);
2997 add_builtin_candidate
2998 (candidates
, code
, code2
, fnname
, t
,
2999 NULL_TREE
, args
, argtypes
, flags
, complain
);
3002 release_tree_vector (types
[0]);
3003 release_tree_vector (types
[1]);
3007 /* If TMPL can be successfully instantiated as indicated by
3008 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3010 TMPL is the template. EXPLICIT_TARGS are any explicit template
3011 arguments. ARGLIST is the arguments provided at the call-site.
3012 This does not change ARGLIST. The RETURN_TYPE is the desired type
3013 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3014 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3015 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3017 static struct z_candidate
*
3018 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3019 tree ctype
, tree explicit_targs
, tree first_arg
,
3020 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3021 tree access_path
, tree conversion_path
,
3022 int flags
, tree obj
, unification_kind_t strict
,
3023 tsubst_flags_t complain
)
3025 int ntparms
= DECL_NTPARMS (tmpl
);
3026 tree targs
= make_tree_vec (ntparms
);
3027 unsigned int len
= vec_safe_length (arglist
);
3028 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3029 unsigned int skip_without_in_chrg
= 0;
3030 tree first_arg_without_in_chrg
= first_arg
;
3031 tree
*args_without_in_chrg
;
3032 unsigned int nargs_without_in_chrg
;
3033 unsigned int ia
, ix
;
3035 struct z_candidate
*cand
;
3037 struct rejection_reason
*reason
= NULL
;
3040 /* We don't do deduction on the in-charge parameter, the VTT
3041 parameter or 'this'. */
3042 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3044 if (first_arg_without_in_chrg
!= NULL_TREE
)
3045 first_arg_without_in_chrg
= NULL_TREE
;
3046 else if (return_type
&& strict
== DEDUCE_CALL
)
3047 /* We're deducing for a call to the result of a template conversion
3048 function, so the args don't contain 'this'; leave them alone. */;
3050 ++skip_without_in_chrg
;
3053 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3054 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3055 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3057 if (first_arg_without_in_chrg
!= NULL_TREE
)
3058 first_arg_without_in_chrg
= NULL_TREE
;
3060 ++skip_without_in_chrg
;
3063 if (len
< skip_without_in_chrg
)
3066 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3067 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3068 TREE_TYPE ((*arglist
)[0])))
3070 /* 12.8/6 says, "A declaration of a constructor for a class X is
3071 ill-formed if its first parameter is of type (optionally cv-qualified)
3072 X and either there are no other parameters or else all other
3073 parameters have default arguments. A member function template is never
3074 instantiated to produce such a constructor signature."
3076 So if we're trying to copy an object of the containing class, don't
3077 consider a template constructor that has a first parameter type that
3078 is just a template parameter, as we would deduce a signature that we
3079 would then reject in the code below. */
3080 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3082 firstparm
= TREE_VALUE (firstparm
);
3083 if (PACK_EXPANSION_P (firstparm
))
3084 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3085 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3087 gcc_assert (!explicit_targs
);
3088 reason
= invalid_copy_with_fn_template_rejection ();
3094 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3095 + (len
- skip_without_in_chrg
));
3096 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3098 if (first_arg_without_in_chrg
!= NULL_TREE
)
3100 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3103 for (ix
= skip_without_in_chrg
;
3104 vec_safe_iterate (arglist
, ix
, &arg
);
3107 args_without_in_chrg
[ia
] = arg
;
3110 gcc_assert (ia
== nargs_without_in_chrg
);
3112 errs
= errorcount
+sorrycount
;
3113 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3114 args_without_in_chrg
,
3115 nargs_without_in_chrg
,
3116 return_type
, strict
, flags
, false,
3117 complain
& tf_decltype
);
3119 if (fn
== error_mark_node
)
3121 /* Don't repeat unification later if it already resulted in errors. */
3122 if (errorcount
+sorrycount
== errs
)
3123 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3124 targs
, args_without_in_chrg
,
3125 nargs_without_in_chrg
,
3126 return_type
, strict
, flags
);
3128 reason
= template_unification_error_rejection ();
3132 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3134 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3135 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3138 /* We're trying to produce a constructor with a prohibited signature,
3139 as discussed above; handle here any cases we didn't catch then,
3141 reason
= invalid_copy_with_fn_template_rejection ();
3146 if (obj
!= NULL_TREE
)
3147 /* Aha, this is a conversion function. */
3148 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3149 access_path
, conversion_path
, complain
);
3151 cand
= add_function_candidate (candidates
, fn
, ctype
,
3152 first_arg
, arglist
, access_path
,
3153 conversion_path
, flags
, complain
);
3154 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3155 /* This situation can occur if a member template of a template
3156 class is specialized. Then, instantiate_template might return
3157 an instantiation of the specialization, in which case the
3158 DECL_TI_TEMPLATE field will point at the original
3159 specialization. For example:
3161 template <class T> struct S { template <class U> void f(U);
3162 template <> void f(int) {}; };
3166 Here, TMPL will be template <class U> S<double>::f(U).
3167 And, instantiate template will give us the specialization
3168 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3169 for this will point at template <class T> template <> S<T>::f(int),
3170 so that we can find the definition. For the purposes of
3171 overload resolution, however, we want the original TMPL. */
3172 cand
->template_decl
= build_template_info (tmpl
, targs
);
3174 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3175 cand
->explicit_targs
= explicit_targs
;
3179 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3180 access_path
, conversion_path
, 0, reason
, flags
);
3184 static struct z_candidate
*
3185 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3186 tree explicit_targs
, tree first_arg
,
3187 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3188 tree access_path
, tree conversion_path
, int flags
,
3189 unification_kind_t strict
, tsubst_flags_t complain
)
3192 add_template_candidate_real (candidates
, tmpl
, ctype
,
3193 explicit_targs
, first_arg
, arglist
,
3194 return_type
, access_path
, conversion_path
,
3195 flags
, NULL_TREE
, strict
, complain
);
3198 /* Create an overload candidate for the conversion function template TMPL,
3199 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3200 pointer-to-function which will in turn be called with the argument list
3201 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3202 passed on to implicit_conversion. */
3204 static struct z_candidate
*
3205 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3207 const vec
<tree
, va_gc
> *arglist
,
3208 tree return_type
, tree access_path
,
3209 tree conversion_path
, tsubst_flags_t complain
)
3211 /* Making this work broke PR 71117, so until the committee resolves core
3212 issue 2189, let's disable this candidate if there are any viable call
3214 if (any_strictly_viable (*candidates
))
3218 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3219 NULL_TREE
, arglist
, return_type
, access_path
,
3220 conversion_path
, 0, obj
, DEDUCE_CALL
,
3224 /* The CANDS are the set of candidates that were considered for
3225 overload resolution. Return the set of viable candidates, or CANDS
3226 if none are viable. If any of the candidates were viable, set
3227 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3228 considered viable only if it is strictly viable. */
3230 static struct z_candidate
*
3231 splice_viable (struct z_candidate
*cands
,
3235 struct z_candidate
*viable
;
3236 struct z_candidate
**last_viable
;
3237 struct z_candidate
**cand
;
3238 bool found_strictly_viable
= false;
3240 /* Be strict inside templates, since build_over_call won't actually
3241 do the conversions to get pedwarns. */
3242 if (processing_template_decl
)
3246 last_viable
= &viable
;
3247 *any_viable_p
= false;
3252 struct z_candidate
*c
= *cand
;
3254 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3256 /* Be strict in the presence of a viable candidate. Also if
3257 there are template candidates, so that we get deduction errors
3258 for them instead of silently preferring a bad conversion. */
3260 if (viable
&& !found_strictly_viable
)
3262 /* Put any spliced near matches back onto the main list so
3263 that we see them if there is no strict match. */
3264 *any_viable_p
= false;
3265 *last_viable
= cands
;
3268 last_viable
= &viable
;
3272 if (strict_p
? c
->viable
== 1 : c
->viable
)
3277 last_viable
= &c
->next
;
3278 *any_viable_p
= true;
3280 found_strictly_viable
= true;
3286 return viable
? viable
: cands
;
3290 any_strictly_viable (struct z_candidate
*cands
)
3292 for (; cands
; cands
= cands
->next
)
3293 if (cands
->viable
== 1)
3298 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3299 words, it is about to become the "this" pointer for a member
3300 function call. Take the address of the object. */
3303 build_this (tree obj
)
3305 /* In a template, we are only concerned about the type of the
3306 expression, so we can take a shortcut. */
3307 if (processing_template_decl
)
3308 return build_address (obj
);
3310 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3313 /* Returns true iff functions are equivalent. Equivalent functions are
3314 not '==' only if one is a function-local extern function or if
3315 both are extern "C". */
3318 equal_functions (tree fn1
, tree fn2
)
3320 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3322 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3324 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3325 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3326 return decls_match (fn1
, fn2
);
3330 /* Print information about a candidate being rejected due to INFO. */
3333 print_conversion_rejection (location_t loc
, struct conversion_info
*info
)
3335 tree from
= info
->from
;
3337 from
= lvalue_type (from
);
3338 if (info
->n_arg
== -1)
3340 /* Conversion of implicit `this' argument failed. */
3341 if (!TYPE_P (info
->from
))
3342 /* A bad conversion for 'this' must be discarding cv-quals. */
3343 inform (loc
, " passing %qT as %<this%> "
3344 "argument discards qualifiers",
3347 inform (loc
, " no known conversion for implicit "
3348 "%<this%> parameter from %qT to %qT",
3349 from
, info
->to_type
);
3351 else if (!TYPE_P (info
->from
))
3353 if (info
->n_arg
>= 0)
3354 inform (loc
, " conversion of argument %d would be ill-formed:",
3356 perform_implicit_conversion (info
->to_type
, info
->from
,
3357 tf_warning_or_error
);
3359 else if (info
->n_arg
== -2)
3360 /* Conversion of conversion function return value failed. */
3361 inform (loc
, " no known conversion from %qT to %qT",
3362 from
, info
->to_type
);
3364 inform (loc
, " no known conversion for argument %d from %qT to %qT",
3365 info
->n_arg
+ 1, from
, info
->to_type
);
3368 /* Print information about a candidate with WANT parameters and we found
3372 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3374 inform_n (loc
, want
,
3375 " candidate expects %d argument, %d provided",
3376 " candidate expects %d arguments, %d provided",
3380 /* Print information about one overload candidate CANDIDATE. MSGSTR
3381 is the text to print before the candidate itself.
3383 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3384 to have been run through gettext by the caller. This wart makes
3385 life simpler in print_z_candidates and for the translators. */
3388 print_z_candidate (location_t loc
, const char *msgstr
,
3389 struct z_candidate
*candidate
)
3391 const char *msg
= (msgstr
== NULL
3393 : ACONCAT ((msgstr
, " ", NULL
)));
3394 location_t cloc
= location_of (candidate
->fn
);
3396 if (identifier_p (candidate
->fn
))
3399 if (candidate
->num_convs
== 3)
3400 inform (cloc
, "%s%D(%T, %T, %T) <built-in>", msg
, candidate
->fn
,
3401 candidate
->convs
[0]->type
,
3402 candidate
->convs
[1]->type
,
3403 candidate
->convs
[2]->type
);
3404 else if (candidate
->num_convs
== 2)
3405 inform (cloc
, "%s%D(%T, %T) <built-in>", msg
, candidate
->fn
,
3406 candidate
->convs
[0]->type
,
3407 candidate
->convs
[1]->type
);
3409 inform (cloc
, "%s%D(%T) <built-in>", msg
, candidate
->fn
,
3410 candidate
->convs
[0]->type
);
3412 else if (TYPE_P (candidate
->fn
))
3413 inform (cloc
, "%s%T <conversion>", msg
, candidate
->fn
);
3414 else if (candidate
->viable
== -1)
3415 inform (cloc
, "%s%#D <near match>", msg
, candidate
->fn
);
3416 else if (DECL_DELETED_FN (candidate
->fn
))
3417 inform (cloc
, "%s%#D <deleted>", msg
, candidate
->fn
);
3419 inform (cloc
, "%s%#D", msg
, candidate
->fn
);
3420 /* Give the user some information about why this candidate failed. */
3421 if (candidate
->reason
!= NULL
)
3423 struct rejection_reason
*r
= candidate
->reason
;
3428 print_arity_information (cloc
, r
->u
.arity
.actual
,
3429 r
->u
.arity
.expected
);
3431 case rr_arg_conversion
:
3432 print_conversion_rejection (cloc
, &r
->u
.conversion
);
3434 case rr_bad_arg_conversion
:
3435 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
);
3437 case rr_explicit_conversion
:
3438 inform (cloc
, " return type %qT of explicit conversion function "
3439 "cannot be converted to %qT with a qualification "
3440 "conversion", r
->u
.conversion
.from
,
3441 r
->u
.conversion
.to_type
);
3443 case rr_template_conversion
:
3444 inform (cloc
, " conversion from return type %qT of template "
3445 "conversion function specialization to %qT is not an "
3446 "exact match", r
->u
.conversion
.from
,
3447 r
->u
.conversion
.to_type
);
3449 case rr_template_unification
:
3450 /* We use template_unification_error_rejection if unification caused
3451 actual non-SFINAE errors, in which case we don't need to repeat
3453 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3455 inform (cloc
, " substitution of deduced template arguments "
3456 "resulted in errors seen above");
3459 /* Re-run template unification with diagnostics. */
3460 inform (cloc
, " template argument deduction/substitution failed:");
3461 fn_type_unification (r
->u
.template_unification
.tmpl
,
3462 r
->u
.template_unification
.explicit_targs
,
3464 (r
->u
.template_unification
.num_targs
)),
3465 r
->u
.template_unification
.args
,
3466 r
->u
.template_unification
.nargs
,
3467 r
->u
.template_unification
.return_type
,
3468 r
->u
.template_unification
.strict
,
3469 r
->u
.template_unification
.flags
,
3472 case rr_invalid_copy
:
3474 " a constructor taking a single argument of its own "
3475 "class type is invalid");
3477 case rr_constraint_failure
:
3479 tree tmpl
= r
->u
.template_instantiation
.tmpl
;
3480 tree args
= r
->u
.template_instantiation
.targs
;
3481 diagnose_constraints (cloc
, tmpl
, args
);
3486 /* This candidate didn't have any issues or we failed to
3487 handle a particular code. Either way... */
3494 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3496 struct z_candidate
*cand1
;
3497 struct z_candidate
**cand2
;
3502 /* Remove non-viable deleted candidates. */
3504 for (cand2
= &cand1
; *cand2
; )
3506 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3507 && !(*cand2
)->viable
3508 && DECL_DELETED_FN ((*cand2
)->fn
))
3509 *cand2
= (*cand2
)->next
;
3511 cand2
= &(*cand2
)->next
;
3513 /* ...if there are any non-deleted ones. */
3517 /* There may be duplicates in the set of candidates. We put off
3518 checking this condition as long as possible, since we have no way
3519 to eliminate duplicates from a set of functions in less than n^2
3520 time. Now we are about to emit an error message, so it is more
3521 permissible to go slowly. */
3522 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3524 tree fn
= cand1
->fn
;
3525 /* Skip builtin candidates and conversion functions. */
3528 cand2
= &cand1
->next
;
3531 if (DECL_P ((*cand2
)->fn
)
3532 && equal_functions (fn
, (*cand2
)->fn
))
3533 *cand2
= (*cand2
)->next
;
3535 cand2
= &(*cand2
)->next
;
3539 for (; candidates
; candidates
= candidates
->next
)
3540 print_z_candidate (loc
, "candidate:", candidates
);
3543 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3544 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3545 the result of the conversion function to convert it to the final
3546 desired type. Merge the two sequences into a single sequence,
3547 and return the merged sequence. */
3550 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3553 bool bad
= user_seq
->bad_p
;
3555 gcc_assert (user_seq
->kind
== ck_user
);
3557 /* Find the end of the second conversion sequence. */
3558 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3560 /* The entire sequence is a user-conversion sequence. */
3561 (*t
)->user_conv_p
= true;
3566 /* Replace the identity conversion with the user conversion
3573 /* Handle overload resolution for initializing an object of class type from
3574 an initializer list. First we look for a suitable constructor that
3575 takes a std::initializer_list; if we don't find one, we then look for a
3576 non-list constructor.
3578 Parameters are as for add_candidates, except that the arguments are in
3579 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3580 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3583 add_list_candidates (tree fns
, tree first_arg
,
3584 const vec
<tree
, va_gc
> *args
, tree totype
,
3585 tree explicit_targs
, bool template_only
,
3586 tree conversion_path
, tree access_path
,
3588 struct z_candidate
**candidates
,
3589 tsubst_flags_t complain
)
3591 gcc_assert (*candidates
== NULL
);
3593 /* We're looking for a ctor for list-initialization. */
3594 flags
|= LOOKUP_LIST_INIT_CTOR
;
3595 /* And we don't allow narrowing conversions. We also use this flag to
3596 avoid the copy constructor call for copy-list-initialization. */
3597 flags
|= LOOKUP_NO_NARROWING
;
3599 unsigned nart
= num_artificial_parms_for (get_first_fn (fns
)) - 1;
3600 tree init_list
= (*args
)[nart
];
3602 /* Always use the default constructor if the list is empty (DR 990). */
3603 if (CONSTRUCTOR_NELTS (init_list
) == 0
3604 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3606 /* If the class has a list ctor, try passing the list as a single
3607 argument first, but only consider list ctors. */
3608 else if (TYPE_HAS_LIST_CTOR (totype
))
3610 flags
|= LOOKUP_LIST_ONLY
;
3611 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3612 explicit_targs
, template_only
, conversion_path
,
3613 access_path
, flags
, candidates
, complain
);
3614 if (any_strictly_viable (*candidates
))
3618 /* Expand the CONSTRUCTOR into a new argument vec. */
3619 vec
<tree
, va_gc
> *new_args
;
3620 vec_alloc (new_args
, nart
+ CONSTRUCTOR_NELTS (init_list
));
3621 for (unsigned i
= 0; i
< nart
; ++i
)
3622 new_args
->quick_push ((*args
)[i
]);
3623 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (init_list
); ++i
)
3624 new_args
->quick_push (CONSTRUCTOR_ELT (init_list
, i
)->value
);
3626 /* We aren't looking for list-ctors anymore. */
3627 flags
&= ~LOOKUP_LIST_ONLY
;
3628 /* We allow more user-defined conversions within an init-list. */
3629 flags
&= ~LOOKUP_NO_CONVERSION
;
3631 add_candidates (fns
, first_arg
, new_args
, NULL_TREE
,
3632 explicit_targs
, template_only
, conversion_path
,
3633 access_path
, flags
, candidates
, complain
);
3636 /* Returns the best overload candidate to perform the requested
3637 conversion. This function is used for three the overloading situations
3638 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3639 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3640 per [dcl.init.ref], so we ignore temporary bindings. */
3642 static struct z_candidate
*
3643 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3644 tsubst_flags_t complain
)
3646 struct z_candidate
*candidates
, *cand
;
3648 tree ctors
= NULL_TREE
;
3649 tree conv_fns
= NULL_TREE
;
3650 conversion
*conv
= NULL
;
3651 tree first_arg
= NULL_TREE
;
3652 vec
<tree
, va_gc
> *args
= NULL
;
3659 fromtype
= TREE_TYPE (expr
);
3661 /* We represent conversion within a hierarchy using RVALUE_CONV and
3662 BASE_CONV, as specified by [over.best.ics]; these become plain
3663 constructor calls, as specified in [dcl.init]. */
3664 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3665 || !DERIVED_FROM_P (totype
, fromtype
));
3667 if (MAYBE_CLASS_TYPE_P (totype
))
3668 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3669 creating a garbage BASELINK; constructors can't be inherited. */
3670 ctors
= lookup_fnfields_slot (totype
, complete_ctor_identifier
);
3672 if (MAYBE_CLASS_TYPE_P (fromtype
))
3674 tree to_nonref
= non_reference (totype
);
3675 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3676 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3677 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3679 /* [class.conv.fct] A conversion function is never used to
3680 convert a (possibly cv-qualified) object to the (possibly
3681 cv-qualified) same object type (or a reference to it), to a
3682 (possibly cv-qualified) base class of that type (or a
3683 reference to it)... */
3686 conv_fns
= lookup_conversions (fromtype
);
3690 flags
|= LOOKUP_NO_CONVERSION
;
3691 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3692 flags
|= LOOKUP_NO_NARROWING
;
3694 /* It's OK to bind a temporary for converting constructor arguments, but
3695 not in converting the return value of a conversion operator. */
3696 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3697 | (flags
& LOOKUP_NO_NARROWING
));
3698 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3702 int ctorflags
= flags
;
3704 first_arg
= build_dummy_object (totype
);
3706 /* We should never try to call the abstract or base constructor
3708 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_CURRENT (ctors
))
3709 && !DECL_HAS_VTT_PARM_P (OVL_CURRENT (ctors
)));
3711 args
= make_tree_vector_single (expr
);
3712 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3714 /* List-initialization. */
3715 add_list_candidates (ctors
, first_arg
, args
, totype
, NULL_TREE
,
3716 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3717 ctorflags
, &candidates
, complain
);
3721 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3722 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3723 ctorflags
, &candidates
, complain
);
3726 for (cand
= candidates
; cand
; cand
= cand
->next
)
3728 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3730 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3731 set, then this is copy-initialization. In that case, "The
3732 result of the call is then used to direct-initialize the
3733 object that is the destination of the copy-initialization."
3736 We represent this in the conversion sequence with an
3737 rvalue conversion, which means a constructor call. */
3738 if (TREE_CODE (totype
) != REFERENCE_TYPE
3739 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3741 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3748 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3750 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3751 struct z_candidate
*old_candidates
;
3753 /* If we are called to convert to a reference type, we are trying to
3754 find a direct binding, so don't even consider temporaries. If
3755 we don't find a direct binding, the caller will try again to
3756 look for a temporary binding. */
3757 if (TREE_CODE (totype
) == REFERENCE_TYPE
)
3758 convflags
|= LOOKUP_NO_TEMP_BIND
;
3760 old_candidates
= candidates
;
3761 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3763 conversion_path
, TYPE_BINFO (fromtype
),
3764 flags
, &candidates
, complain
);
3766 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3768 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3770 = implicit_conversion (totype
,
3773 /*c_cast_p=*/false, convflags
,
3776 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3777 copy-initialization. In that case, "The result of the
3778 call is then used to direct-initialize the object that is
3779 the destination of the copy-initialization." [dcl.init]
3781 We represent this in the conversion sequence with an
3782 rvalue conversion, which means a constructor call. But
3783 don't add a second rvalue conversion if there's already
3784 one there. Which there really shouldn't be, but it's
3785 harmless since we'd add it here anyway. */
3786 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3787 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3788 ics
= build_conv (ck_rvalue
, totype
, ics
);
3790 cand
->second_conv
= ics
;
3795 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
3798 else if (DECL_NONCONVERTING_P (cand
->fn
)
3799 && ics
->rank
> cr_exact
)
3801 /* 13.3.1.5: For direct-initialization, those explicit
3802 conversion functions that are not hidden within S and
3803 yield type T or a type that can be converted to type T
3804 with a qualification conversion (4.4) are also candidate
3806 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3807 I've raised this issue with the committee. --jason 9/2011 */
3809 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3811 else if (cand
->viable
== 1 && ics
->bad_p
)
3815 = bad_arg_conversion_rejection (NULL_TREE
, -2,
3818 else if (primary_template_instantiation_p (cand
->fn
)
3819 && ics
->rank
> cr_exact
)
3821 /* 13.3.3.1.2: If the user-defined conversion is specified by
3822 a specialization of a conversion function template, the
3823 second standard conversion sequence shall have exact match
3826 cand
->reason
= template_conversion_rejection (rettype
, totype
);
3831 candidates
= splice_viable (candidates
, false, &any_viable_p
);
3835 release_tree_vector (args
);
3839 cand
= tourney (candidates
, complain
);
3842 if (complain
& tf_error
)
3844 error ("conversion from %qT to %qT is ambiguous",
3846 print_z_candidates (location_of (expr
), candidates
);
3849 cand
= candidates
; /* any one will do */
3850 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
3851 cand
->second_conv
->user_conv_p
= true;
3852 if (!any_strictly_viable (candidates
))
3853 cand
->second_conv
->bad_p
= true;
3854 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
3855 ambiguous conversion is no worse than another user-defined
3862 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
3863 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
3864 else if (cand
->second_conv
->kind
== ck_rvalue
)
3865 /* DR 5: [in the first step of copy-initialization]...if the function
3866 is a constructor, the call initializes a temporary of the
3867 cv-unqualified version of the destination type. */
3868 convtype
= cv_unqualified (totype
);
3871 /* Build the user conversion sequence. */
3875 build_identity_conv (TREE_TYPE (expr
), expr
));
3877 if (cand
->viable
== -1)
3880 /* Remember that this was a list-initialization. */
3881 if (flags
& LOOKUP_NO_NARROWING
)
3882 conv
->check_narrowing
= true;
3884 /* Combine it with the second conversion sequence. */
3885 cand
->second_conv
= merge_conversion_sequences (conv
,
3891 /* Wrapper for above. */
3894 build_user_type_conversion (tree totype
, tree expr
, int flags
,
3895 tsubst_flags_t complain
)
3897 struct z_candidate
*cand
;
3900 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
3901 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
3905 if (cand
->second_conv
->kind
== ck_ambig
)
3906 ret
= error_mark_node
;
3909 expr
= convert_like (cand
->second_conv
, expr
, complain
);
3910 ret
= convert_from_reference (expr
);
3916 timevar_cond_stop (TV_OVERLOAD
, subtime
);
3920 /* Subroutine of convert_nontype_argument.
3922 EXPR is an argument for a template non-type parameter of integral or
3923 enumeration type. Do any necessary conversions (that are permitted for
3924 non-type arguments) to convert it to the parameter type.
3926 If conversion is successful, returns the converted expression;
3927 otherwise, returns error_mark_node. */
3930 build_integral_nontype_arg_conv (tree type
, tree expr
, tsubst_flags_t complain
)
3935 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
3937 if (error_operand_p (expr
))
3938 return error_mark_node
;
3940 gcc_assert (INTEGRAL_OR_ENUMERATION_TYPE_P (type
));
3942 /* Get the high-water mark for the CONVERSION_OBSTACK. */
3943 p
= conversion_obstack_alloc (0);
3945 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
3947 LOOKUP_IMPLICIT
, complain
);
3949 /* for a non-type template-parameter of integral or
3950 enumeration type, integral promotions (4.5) and integral
3951 conversions (4.7) are applied. */
3952 /* It should be sufficient to check the outermost conversion step, since
3953 there are no qualification conversions to integer type. */
3957 /* A conversion function is OK. If it isn't constexpr, we'll
3958 complain later that the argument isn't constant. */
3960 /* The lvalue-to-rvalue conversion is OK. */
3966 t
= next_conversion (conv
)->type
;
3967 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
))
3970 if (complain
& tf_error
)
3971 error_at (loc
, "conversion from %qT to %qT not considered for "
3972 "non-type template argument", t
, type
);
3981 expr
= convert_like (conv
, expr
, complain
);
3983 expr
= error_mark_node
;
3985 /* Free all the conversions we allocated. */
3986 obstack_free (&conversion_obstack
, p
);
3991 /* Do any initial processing on the arguments to a function call. */
3993 static vec
<tree
, va_gc
> *
3994 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
3999 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4001 if (error_operand_p (arg
))
4003 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4005 if (complain
& tf_error
)
4006 error ("invalid use of void expression");
4009 else if (invalid_nonstatic_memfn_p (input_location
, arg
, complain
))
4015 /* Perform overload resolution on FN, which is called with the ARGS.
4017 Return the candidate function selected by overload resolution, or
4018 NULL if the event that overload resolution failed. In the case
4019 that overload resolution fails, *CANDIDATES will be the set of
4020 candidates considered, and ANY_VIABLE_P will be set to true or
4021 false to indicate whether or not any of the candidates were
4024 The ARGS should already have gone through RESOLVE_ARGS before this
4025 function is called. */
4027 static struct z_candidate
*
4028 perform_overload_resolution (tree fn
,
4029 const vec
<tree
, va_gc
> *args
,
4030 struct z_candidate
**candidates
,
4031 bool *any_viable_p
, tsubst_flags_t complain
)
4033 struct z_candidate
*cand
;
4034 tree explicit_targs
;
4037 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4039 explicit_targs
= NULL_TREE
;
4043 *any_viable_p
= true;
4046 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4047 || TREE_CODE (fn
) == TEMPLATE_DECL
4048 || TREE_CODE (fn
) == OVERLOAD
4049 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4051 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4053 explicit_targs
= TREE_OPERAND (fn
, 1);
4054 fn
= TREE_OPERAND (fn
, 0);
4058 /* Add the various candidate functions. */
4059 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4060 explicit_targs
, template_only
,
4061 /*conversion_path=*/NULL_TREE
,
4062 /*access_path=*/NULL_TREE
,
4064 candidates
, complain
);
4066 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4068 cand
= tourney (*candidates
, complain
);
4072 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4076 /* Print an error message about being unable to build a call to FN with
4077 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4078 be located; CANDIDATES is a possibly empty list of such
4082 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4083 struct z_candidate
*candidates
)
4085 tree name
= DECL_NAME (OVL_CURRENT (fn
));
4086 location_t loc
= location_of (name
);
4088 if (!any_strictly_viable (candidates
))
4089 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4090 name
, build_tree_list_vec (args
));
4092 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4093 name
, build_tree_list_vec (args
));
4095 print_z_candidates (loc
, candidates
);
4098 /* Return an expression for a call to FN (a namespace-scope function,
4099 or a static member function) with the ARGS. This may change
4103 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
, bool koenig_p
,
4104 tsubst_flags_t complain
)
4106 struct z_candidate
*candidates
, *cand
;
4111 if (args
!= NULL
&& *args
!= NULL
)
4113 *args
= resolve_args (*args
, complain
);
4115 return error_mark_node
;
4119 tm_malloc_replacement (fn
);
4121 /* If this function was found without using argument dependent
4122 lookup, then we want to ignore any undeclared friend
4128 fn
= remove_hidden_names (fn
);
4131 if (complain
& tf_error
)
4132 print_error_for_call_failure (orig_fn
, *args
, NULL
);
4133 return error_mark_node
;
4137 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4138 p
= conversion_obstack_alloc (0);
4140 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4145 if (complain
& tf_error
)
4147 // If there is a single (non-viable) function candidate,
4148 // let the error be diagnosed by cp_build_function_call_vec.
4149 if (!any_viable_p
&& candidates
&& ! candidates
->next
4150 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4151 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4153 // Otherwise, emit notes for non-viable candidates.
4154 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4155 fn
= TREE_OPERAND (fn
, 0);
4156 print_error_for_call_failure (fn
, *args
, candidates
);
4158 result
= error_mark_node
;
4162 int flags
= LOOKUP_NORMAL
;
4163 /* If fn is template_id_expr, the call has explicit template arguments
4164 (e.g. func<int>(5)), communicate this info to build_over_call
4165 through flags so that later we can use it to decide whether to warn
4166 about peculiar null pointer conversion. */
4167 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4169 /* If overload resolution selects a specialization of a
4170 function concept for non-dependent template arguments,
4171 the expression is true if the constraints are satisfied
4172 and false otherwise.
4174 NOTE: This is an extension of Concepts Lite TS that
4175 allows constraints to be used in expressions. */
4176 if (flag_concepts
&& !processing_template_decl
)
4178 tree tmpl
= DECL_TI_TEMPLATE (cand
->fn
);
4179 tree targs
= DECL_TI_ARGS (cand
->fn
);
4180 tree decl
= DECL_TEMPLATE_RESULT (tmpl
);
4181 if (DECL_DECLARED_CONCEPT_P (decl
))
4182 return evaluate_function_concept (decl
, targs
);
4185 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4188 result
= build_over_call (cand
, flags
, complain
);
4191 /* Free all the conversions we allocated. */
4192 obstack_free (&conversion_obstack
, p
);
4197 /* Build a call to a global operator new. FNNAME is the name of the
4198 operator (either "operator new" or "operator new[]") and ARGS are
4199 the arguments provided. This may change ARGS. *SIZE points to the
4200 total number of bytes required by the allocation, and is updated if
4201 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4202 be used. If this function determines that no cookie should be
4203 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4204 is not NULL_TREE, it is evaluated before calculating the final
4205 array size, and if it fails, the array size is replaced with
4206 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4207 is non-NULL, it will be set, upon return, to the allocation
4211 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4212 tree
*size
, tree
*cookie_size
, tree size_check
,
4213 tree
*fn
, tsubst_flags_t complain
)
4215 tree original_size
= *size
;
4217 struct z_candidate
*candidates
;
4218 struct z_candidate
*cand
;
4223 /* Set to (size_t)-1 if the size check fails. */
4224 if (size_check
!= NULL_TREE
)
4226 tree errval
= TYPE_MAX_VALUE (sizetype
);
4227 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4228 errval
= throw_bad_array_new_length ();
4229 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4230 original_size
, errval
);
4232 vec_safe_insert (*args
, 0, *size
);
4233 *args
= resolve_args (*args
, complain
);
4235 return error_mark_node
;
4241 If this lookup fails to find the name, or if the allocated type
4242 is not a class type, the allocation function's name is looked
4243 up in the global scope.
4245 we disregard block-scope declarations of "operator new". */
4246 fns
= lookup_function_nonclass (fnname
, *args
, /*block_p=*/false);
4248 /* Figure out what function is being called. */
4249 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4252 /* If no suitable function could be found, issue an error message
4256 if (complain
& tf_error
)
4257 print_error_for_call_failure (fns
, *args
, candidates
);
4258 return error_mark_node
;
4261 /* If a cookie is required, add some extra space. Whether
4262 or not a cookie is required cannot be determined until
4263 after we know which function was called. */
4266 bool use_cookie
= true;
4269 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4270 /* Skip the size_t parameter. */
4271 arg_types
= TREE_CHAIN (arg_types
);
4272 /* Check the remaining parameters (if any). */
4274 && TREE_CHAIN (arg_types
) == void_list_node
4275 && same_type_p (TREE_VALUE (arg_types
),
4278 /* If we need a cookie, adjust the number of bytes allocated. */
4281 /* Update the total size. */
4282 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4285 /* Set to (size_t)-1 if the size check fails. */
4286 gcc_assert (size_check
!= NULL_TREE
);
4287 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4288 *size
, TYPE_MAX_VALUE (sizetype
));
4290 /* Update the argument list to reflect the adjusted size. */
4291 (**args
)[0] = *size
;
4294 *cookie_size
= NULL_TREE
;
4297 /* Tell our caller which function we decided to call. */
4301 /* Build the CALL_EXPR. */
4302 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4305 /* Build a new call to operator(). This may change ARGS. */
4308 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4310 struct z_candidate
*candidates
= 0, *cand
;
4311 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4312 tree type
= TREE_TYPE (obj
);
4314 tree result
= NULL_TREE
;
4317 if (error_operand_p (obj
))
4318 return error_mark_node
;
4320 obj
= prep_operand (obj
);
4322 if (TYPE_PTRMEMFUNC_P (type
))
4324 if (complain
& tf_error
)
4325 /* It's no good looking for an overloaded operator() on a
4326 pointer-to-member-function. */
4327 error ("pointer-to-member function %E cannot be called without an object; consider using .* or ->*", obj
);
4328 return error_mark_node
;
4331 if (TYPE_BINFO (type
))
4333 fns
= lookup_fnfields (TYPE_BINFO (type
), ansi_opname (CALL_EXPR
), 1);
4334 if (fns
== error_mark_node
)
4335 return error_mark_node
;
4340 if (args
!= NULL
&& *args
!= NULL
)
4342 *args
= resolve_args (*args
, complain
);
4344 return error_mark_node
;
4347 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4348 p
= conversion_obstack_alloc (0);
4352 first_mem_arg
= obj
;
4354 add_candidates (BASELINK_FUNCTIONS (fns
),
4355 first_mem_arg
, *args
, NULL_TREE
,
4357 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4358 LOOKUP_NORMAL
, &candidates
, complain
);
4361 convs
= lookup_conversions (type
);
4363 for (; convs
; convs
= TREE_CHAIN (convs
))
4365 tree fns
= TREE_VALUE (convs
);
4366 tree totype
= TREE_TYPE (convs
);
4368 if (TYPE_PTRFN_P (totype
)
4369 || TYPE_REFFN_P (totype
)
4370 || (TREE_CODE (totype
) == REFERENCE_TYPE
4371 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4372 for (; fns
; fns
= OVL_NEXT (fns
))
4374 tree fn
= OVL_CURRENT (fns
);
4376 if (DECL_NONCONVERTING_P (fn
))
4379 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4380 add_template_conv_candidate
4381 (&candidates
, fn
, obj
, *args
, totype
,
4382 /*access_path=*/NULL_TREE
,
4383 /*conversion_path=*/NULL_TREE
, complain
);
4385 add_conv_candidate (&candidates
, fn
, obj
,
4386 *args
, /*conversion_path=*/NULL_TREE
,
4387 /*access_path=*/NULL_TREE
, complain
);
4391 /* Be strict here because if we choose a bad conversion candidate, the
4392 errors we get won't mention the call context. */
4393 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4396 if (complain
& tf_error
)
4398 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4399 build_tree_list_vec (*args
));
4400 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4402 result
= error_mark_node
;
4406 cand
= tourney (candidates
, complain
);
4409 if (complain
& tf_error
)
4411 error ("call of %<(%T) (%A)%> is ambiguous",
4412 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4413 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4415 result
= error_mark_node
;
4417 /* Since cand->fn will be a type, not a function, for a conversion
4418 function, we must be careful not to unconditionally look at
4420 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4421 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
) == CALL_EXPR
)
4422 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4425 if (DECL_P (cand
->fn
))
4426 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4429 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4430 obj
= convert_from_reference (obj
);
4431 result
= cp_build_function_call_vec (obj
, args
, complain
);
4435 /* Free all the conversions we allocated. */
4436 obstack_free (&conversion_obstack
, p
);
4441 /* Wrapper for above. */
4444 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4447 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4448 ret
= build_op_call_1 (obj
, args
, complain
);
4449 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4453 /* Called by op_error to prepare format strings suitable for the error
4454 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4455 and a suffix (controlled by NTYPES). */
4458 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4462 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4463 : G_("no match for "), errmsg
, NULL
);
4466 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4467 else if (ntypes
== 2)
4468 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4470 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4476 op_error (location_t loc
, enum tree_code code
, enum tree_code code2
,
4477 tree arg1
, tree arg2
, tree arg3
, bool match
)
4481 if (code
== MODIFY_EXPR
)
4482 opname
= assignment_operator_name_info
[code2
].name
;
4484 opname
= operator_name_info
[code
].name
;
4489 if (flag_diagnostics_show_caret
)
4490 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4492 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4494 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4495 "in %<%E ? %E : %E%>"), 3, match
),
4497 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4500 case POSTINCREMENT_EXPR
:
4501 case POSTDECREMENT_EXPR
:
4502 if (flag_diagnostics_show_caret
)
4503 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4504 opname
, TREE_TYPE (arg1
));
4506 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4508 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4512 if (flag_diagnostics_show_caret
)
4513 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4514 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4516 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4518 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4523 if (flag_diagnostics_show_caret
)
4524 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4525 opname
, TREE_TYPE (arg1
));
4527 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4528 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4533 if (flag_diagnostics_show_caret
)
4534 error_at (loc
, op_error_string (G_("%<operator%s%>"), 2, match
),
4535 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4537 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4539 opname
, arg1
, opname
, arg2
,
4540 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4542 if (flag_diagnostics_show_caret
)
4543 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4544 opname
, TREE_TYPE (arg1
));
4546 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4548 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4553 /* Return the implicit conversion sequence that could be used to
4554 convert E1 to E2 in [expr.cond]. */
4557 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4559 tree t1
= non_reference (TREE_TYPE (e1
));
4560 tree t2
= non_reference (TREE_TYPE (e2
));
4566 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4567 implicitly converted (clause _conv_) to the type "lvalue reference to
4568 T2", subject to the constraint that in the conversion the
4569 reference must bind directly (_dcl.init.ref_) to an lvalue.
4571 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4572 implicitly converted to the type "rvalue reference to T2", subject to
4573 the constraint that the reference must bind directly. */
4576 tree rtype
= cp_build_reference_type (t2
, !lvalue_p (e2
));
4577 conv
= implicit_conversion (rtype
,
4581 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4582 |LOOKUP_ONLYCONVERTING
,
4584 if (conv
&& !conv
->bad_p
)
4588 /* If E2 is a prvalue or if neither of the conversions above can be done
4589 and at least one of the operands has (possibly cv-qualified) class
4591 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4596 If E1 and E2 have class type, and the underlying class types are
4597 the same or one is a base class of the other: E1 can be converted
4598 to match E2 if the class of T2 is the same type as, or a base
4599 class of, the class of T1, and the cv-qualification of T2 is the
4600 same cv-qualification as, or a greater cv-qualification than, the
4601 cv-qualification of T1. If the conversion is applied, E1 is
4602 changed to an rvalue of type T2 that still refers to the original
4603 source class object (or the appropriate subobject thereof). */
4604 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4605 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4607 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4609 conv
= build_identity_conv (t1
, e1
);
4610 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4611 TYPE_MAIN_VARIANT (t2
)))
4612 conv
= build_conv (ck_base
, t2
, conv
);
4614 conv
= build_conv (ck_rvalue
, t2
, conv
);
4623 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4624 converted to the type that expression E2 would have if E2 were
4625 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4626 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4627 LOOKUP_IMPLICIT
, complain
);
4630 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4631 arguments to the conditional expression. */
4634 build_conditional_expr_1 (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
4635 tsubst_flags_t complain
)
4639 tree result
= NULL_TREE
;
4640 tree result_type
= NULL_TREE
;
4641 bool is_lvalue
= true;
4642 struct z_candidate
*candidates
= 0;
4643 struct z_candidate
*cand
;
4645 tree orig_arg2
, orig_arg3
;
4647 /* As a G++ extension, the second argument to the conditional can be
4648 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4649 c'.) If the second operand is omitted, make sure it is
4650 calculated only once. */
4653 if (complain
& tf_error
)
4654 pedwarn (loc
, OPT_Wpedantic
,
4655 "ISO C++ forbids omitting the middle term of a ?: expression");
4657 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4658 if (lvalue_p (arg1
))
4659 arg2
= arg1
= cp_stabilize_reference (arg1
);
4661 arg2
= arg1
= save_expr (arg1
);
4664 /* If something has already gone wrong, just pass that fact up the
4666 if (error_operand_p (arg1
)
4667 || error_operand_p (arg2
)
4668 || error_operand_p (arg3
))
4669 return error_mark_node
;
4674 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4676 tree arg1_type
= TREE_TYPE (arg1
);
4678 /* If arg1 is another cond_expr choosing between -1 and 0,
4679 then we can use its comparison. It may help to avoid
4680 additional comparison, produce more accurate diagnostics
4681 and enables folding. */
4682 if (TREE_CODE (arg1
) == VEC_COND_EXPR
4683 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
4684 && integer_zerop (TREE_OPERAND (arg1
, 2)))
4685 arg1
= TREE_OPERAND (arg1
, 0);
4687 arg1
= force_rvalue (arg1
, complain
);
4688 arg2
= force_rvalue (arg2
, complain
);
4689 arg3
= force_rvalue (arg3
, complain
);
4691 /* force_rvalue can return error_mark on valid arguments. */
4692 if (error_operand_p (arg1
)
4693 || error_operand_p (arg2
)
4694 || error_operand_p (arg3
))
4695 return error_mark_node
;
4697 arg2_type
= TREE_TYPE (arg2
);
4698 arg3_type
= TREE_TYPE (arg3
);
4700 if (!VECTOR_TYPE_P (arg2_type
)
4701 && !VECTOR_TYPE_P (arg3_type
))
4703 /* Rely on the error messages of the scalar version. */
4704 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4705 orig_arg2
, orig_arg3
, complain
);
4706 if (scal
== error_mark_node
)
4707 return error_mark_node
;
4708 tree stype
= TREE_TYPE (scal
);
4709 tree ctype
= TREE_TYPE (arg1_type
);
4710 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4711 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4713 if (complain
& tf_error
)
4714 error_at (loc
, "inferred scalar type %qT is not an integer or "
4715 "floating point type of the same size as %qT", stype
,
4716 COMPARISON_CLASS_P (arg1
)
4717 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4719 return error_mark_node
;
4722 tree vtype
= build_opaque_vector_type (stype
,
4723 TYPE_VECTOR_SUBPARTS (arg1_type
));
4724 /* We could pass complain & tf_warning to unsafe_conversion_p,
4725 but the warnings (like Wsign-conversion) have already been
4726 given by the scalar build_conditional_expr_1. We still check
4727 unsafe_conversion_p to forbid truncating long long -> float. */
4728 if (unsafe_conversion_p (loc
, stype
, arg2
, false))
4730 if (complain
& tf_error
)
4731 error_at (loc
, "conversion of scalar %qT to vector %qT "
4732 "involves truncation", arg2_type
, vtype
);
4733 return error_mark_node
;
4735 if (unsafe_conversion_p (loc
, stype
, arg3
, false))
4737 if (complain
& tf_error
)
4738 error_at (loc
, "conversion of scalar %qT to vector %qT "
4739 "involves truncation", arg3_type
, vtype
);
4740 return error_mark_node
;
4743 arg2
= cp_convert (stype
, arg2
, complain
);
4744 arg2
= save_expr (arg2
);
4745 arg2
= build_vector_from_val (vtype
, arg2
);
4747 arg3
= cp_convert (stype
, arg3
, complain
);
4748 arg3
= save_expr (arg3
);
4749 arg3
= build_vector_from_val (vtype
, arg3
);
4753 if (VECTOR_TYPE_P (arg2_type
) != VECTOR_TYPE_P (arg3_type
))
4755 enum stv_conv convert_flag
=
4756 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
4757 complain
& tf_error
);
4759 switch (convert_flag
)
4762 return error_mark_node
;
4765 arg2
= save_expr (arg2
);
4766 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
4767 arg2
= build_vector_from_val (arg3_type
, arg2
);
4768 arg2_type
= TREE_TYPE (arg2
);
4773 arg3
= save_expr (arg3
);
4774 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
4775 arg3
= build_vector_from_val (arg2_type
, arg3
);
4776 arg3_type
= TREE_TYPE (arg3
);
4784 if (!same_type_p (arg2_type
, arg3_type
)
4785 || TYPE_VECTOR_SUBPARTS (arg1_type
)
4786 != TYPE_VECTOR_SUBPARTS (arg2_type
)
4787 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
4789 if (complain
& tf_error
)
4791 "incompatible vector types in conditional expression: "
4792 "%qT, %qT and %qT", TREE_TYPE (arg1
),
4793 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
4794 return error_mark_node
;
4797 if (!COMPARISON_CLASS_P (arg1
))
4799 tree cmp_type
= build_same_sized_truth_vector_type (arg1_type
);
4800 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
4802 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
4807 The first expression is implicitly converted to bool (clause
4809 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
4811 if (error_operand_p (arg1
))
4812 return error_mark_node
;
4816 If either the second or the third operand has type (possibly
4817 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
4818 array-to-pointer (_conv.array_), and function-to-pointer
4819 (_conv.func_) standard conversions are performed on the second
4820 and third operands. */
4821 arg2_type
= unlowered_expr_type (arg2
);
4822 arg3_type
= unlowered_expr_type (arg3
);
4823 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
4825 /* Do the conversions. We don't these for `void' type arguments
4826 since it can't have any effect and since decay_conversion
4827 does not handle that case gracefully. */
4828 if (!VOID_TYPE_P (arg2_type
))
4829 arg2
= decay_conversion (arg2
, complain
);
4830 if (!VOID_TYPE_P (arg3_type
))
4831 arg3
= decay_conversion (arg3
, complain
);
4832 arg2_type
= TREE_TYPE (arg2
);
4833 arg3_type
= TREE_TYPE (arg3
);
4837 One of the following shall hold:
4839 --The second or the third operand (but not both) is a
4840 throw-expression (_except.throw_); the result is of the
4841 type of the other and is an rvalue.
4843 --Both the second and the third operands have type void; the
4844 result is of type void and is an rvalue.
4846 We must avoid calling force_rvalue for expressions of type
4847 "void" because it will complain that their value is being
4849 if (TREE_CODE (arg2
) == THROW_EXPR
4850 && TREE_CODE (arg3
) != THROW_EXPR
)
4852 if (!VOID_TYPE_P (arg3_type
))
4854 arg3
= force_rvalue (arg3
, complain
);
4855 if (arg3
== error_mark_node
)
4856 return error_mark_node
;
4858 arg3_type
= TREE_TYPE (arg3
);
4859 result_type
= arg3_type
;
4861 else if (TREE_CODE (arg2
) != THROW_EXPR
4862 && TREE_CODE (arg3
) == THROW_EXPR
)
4864 if (!VOID_TYPE_P (arg2_type
))
4866 arg2
= force_rvalue (arg2
, complain
);
4867 if (arg2
== error_mark_node
)
4868 return error_mark_node
;
4870 arg2_type
= TREE_TYPE (arg2
);
4871 result_type
= arg2_type
;
4873 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
4874 result_type
= void_type_node
;
4877 if (complain
& tf_error
)
4879 if (VOID_TYPE_P (arg2_type
))
4880 error_at (EXPR_LOC_OR_LOC (arg3
, loc
),
4881 "second operand to the conditional operator "
4882 "is of type %<void%>, but the third operand is "
4883 "neither a throw-expression nor of type %<void%>");
4885 error_at (EXPR_LOC_OR_LOC (arg2
, loc
),
4886 "third operand to the conditional operator "
4887 "is of type %<void%>, but the second operand is "
4888 "neither a throw-expression nor of type %<void%>");
4890 return error_mark_node
;
4894 goto valid_operands
;
4898 Otherwise, if the second and third operand have different types,
4899 and either has (possibly cv-qualified) class type, or if both are
4900 glvalues of the same value category and the same type except for
4901 cv-qualification, an attempt is made to convert each of those operands
4902 to the type of the other. */
4903 else if (!same_type_p (arg2_type
, arg3_type
)
4904 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
4905 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
4907 && glvalue_p (arg2
) && glvalue_p (arg3
)
4908 && lvalue_p (arg2
) == lvalue_p (arg3
))))
4912 bool converted
= false;
4914 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4915 p
= conversion_obstack_alloc (0);
4917 conv2
= conditional_conversion (arg2
, arg3
, complain
);
4918 conv3
= conditional_conversion (arg3
, arg2
, complain
);
4922 If both can be converted, or one can be converted but the
4923 conversion is ambiguous, the program is ill-formed. If
4924 neither can be converted, the operands are left unchanged and
4925 further checking is performed as described below. If exactly
4926 one conversion is possible, that conversion is applied to the
4927 chosen operand and the converted operand is used in place of
4928 the original operand for the remainder of this section. */
4929 if ((conv2
&& !conv2
->bad_p
4930 && conv3
&& !conv3
->bad_p
)
4931 || (conv2
&& conv2
->kind
== ck_ambig
)
4932 || (conv3
&& conv3
->kind
== ck_ambig
))
4934 if (complain
& tf_error
)
4936 error_at (loc
, "operands to ?: have different types %qT and %qT",
4937 arg2_type
, arg3_type
);
4938 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
4939 inform (loc
, " and each type can be converted to the other");
4940 else if (conv2
&& conv2
->kind
== ck_ambig
)
4941 convert_like (conv2
, arg2
, complain
);
4943 convert_like (conv3
, arg3
, complain
);
4945 result
= error_mark_node
;
4947 else if (conv2
&& !conv2
->bad_p
)
4949 arg2
= convert_like (conv2
, arg2
, complain
);
4950 arg2
= convert_from_reference (arg2
);
4951 arg2_type
= TREE_TYPE (arg2
);
4952 /* Even if CONV2 is a valid conversion, the result of the
4953 conversion may be invalid. For example, if ARG3 has type
4954 "volatile X", and X does not have a copy constructor
4955 accepting a "volatile X&", then even if ARG2 can be
4956 converted to X, the conversion will fail. */
4957 if (error_operand_p (arg2
))
4958 result
= error_mark_node
;
4961 else if (conv3
&& !conv3
->bad_p
)
4963 arg3
= convert_like (conv3
, arg3
, complain
);
4964 arg3
= convert_from_reference (arg3
);
4965 arg3_type
= TREE_TYPE (arg3
);
4966 if (error_operand_p (arg3
))
4967 result
= error_mark_node
;
4971 /* Free all the conversions we allocated. */
4972 obstack_free (&conversion_obstack
, p
);
4977 /* If, after the conversion, both operands have class type,
4978 treat the cv-qualification of both operands as if it were the
4979 union of the cv-qualification of the operands.
4981 The standard is not clear about what to do in this
4982 circumstance. For example, if the first operand has type
4983 "const X" and the second operand has a user-defined
4984 conversion to "volatile X", what is the type of the second
4985 operand after this step? Making it be "const X" (matching
4986 the first operand) seems wrong, as that discards the
4987 qualification without actually performing a copy. Leaving it
4988 as "volatile X" seems wrong as that will result in the
4989 conditional expression failing altogether, even though,
4990 according to this step, the one operand could be converted to
4991 the type of the other. */
4993 && CLASS_TYPE_P (arg2_type
)
4994 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
4995 arg2_type
= arg3_type
=
4996 cp_build_qualified_type (arg2_type
,
4997 cp_type_quals (arg2_type
)
4998 | cp_type_quals (arg3_type
));
5003 If the second and third operands are glvalues of the same value
5004 category and have the same type, the result is of that type and
5006 if (((lvalue_p (arg2
) && lvalue_p (arg3
))
5007 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
5008 && same_type_p (arg2_type
, arg3_type
))
5010 result_type
= arg2_type
;
5011 arg2
= mark_lvalue_use (arg2
);
5012 arg3
= mark_lvalue_use (arg3
);
5013 goto valid_operands
;
5018 Otherwise, the result is an rvalue. If the second and third
5019 operand do not have the same type, and either has (possibly
5020 cv-qualified) class type, overload resolution is used to
5021 determine the conversions (if any) to be applied to the operands
5022 (_over.match.oper_, _over.built_). */
5024 if (!same_type_p (arg2_type
, arg3_type
)
5025 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5031 /* Rearrange the arguments so that add_builtin_candidate only has
5032 to know about two args. In build_builtin_candidate, the
5033 arguments are unscrambled. */
5037 add_builtin_candidates (&candidates
,
5040 ansi_opname (COND_EXPR
),
5042 LOOKUP_NORMAL
, complain
);
5046 If the overload resolution fails, the program is
5048 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5051 if (complain
& tf_error
)
5052 error_at (loc
, "operands to ?: have different types %qT and %qT",
5053 arg2_type
, arg3_type
);
5054 return error_mark_node
;
5056 cand
= tourney (candidates
, complain
);
5059 if (complain
& tf_error
)
5061 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5062 print_z_candidates (loc
, candidates
);
5064 return error_mark_node
;
5069 Otherwise, the conversions thus determined are applied, and
5070 the converted operands are used in place of the original
5071 operands for the remainder of this section. */
5072 conv
= cand
->convs
[0];
5073 arg1
= convert_like (conv
, arg1
, complain
);
5074 conv
= cand
->convs
[1];
5075 arg2
= convert_like (conv
, arg2
, complain
);
5076 arg2_type
= TREE_TYPE (arg2
);
5077 conv
= cand
->convs
[2];
5078 arg3
= convert_like (conv
, arg3
, complain
);
5079 arg3_type
= TREE_TYPE (arg3
);
5084 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5085 and function-to-pointer (_conv.func_) standard conversions are
5086 performed on the second and third operands.
5088 We need to force the lvalue-to-rvalue conversion here for class types,
5089 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5090 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5093 arg2
= force_rvalue (arg2
, complain
);
5094 if (!CLASS_TYPE_P (arg2_type
))
5095 arg2_type
= TREE_TYPE (arg2
);
5097 arg3
= force_rvalue (arg3
, complain
);
5098 if (!CLASS_TYPE_P (arg3_type
))
5099 arg3_type
= TREE_TYPE (arg3
);
5101 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5102 return error_mark_node
;
5106 After those conversions, one of the following shall hold:
5108 --The second and third operands have the same type; the result is of
5110 if (same_type_p (arg2_type
, arg3_type
))
5111 result_type
= arg2_type
;
5114 --The second and third operands have arithmetic or enumeration
5115 type; the usual arithmetic conversions are performed to bring
5116 them to a common type, and the result is of that type. */
5117 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5118 || UNSCOPED_ENUM_P (arg2_type
))
5119 && (ARITHMETIC_TYPE_P (arg3_type
)
5120 || UNSCOPED_ENUM_P (arg3_type
)))
5122 /* In this case, there is always a common type. */
5123 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5125 if (complain
& tf_warning
)
5126 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5127 "implicit conversion from %qT to %qT to "
5128 "match other result of conditional",
5131 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5132 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5134 if (TREE_CODE (orig_arg2
) == CONST_DECL
5135 && TREE_CODE (orig_arg3
) == CONST_DECL
5136 && DECL_CONTEXT (orig_arg2
) == DECL_CONTEXT (orig_arg3
))
5137 /* Two enumerators from the same enumeration can have different
5138 types when the enumeration is still being defined. */;
5139 else if (complain
& tf_warning
)
5140 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5141 "conditional expression: %qT vs %qT",
5142 arg2_type
, arg3_type
);
5144 else if (extra_warnings
5145 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5146 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5147 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5148 && !same_type_p (arg2_type
,
5149 type_promotes_to (arg3_type
)))))
5151 if (complain
& tf_warning
)
5152 warning_at (loc
, OPT_Wextra
, "enumeral and non-enumeral type in "
5153 "conditional expression");
5156 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5157 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5161 --The second and third operands have pointer type, or one has
5162 pointer type and the other is a null pointer constant; pointer
5163 conversions (_conv.ptr_) and qualification conversions
5164 (_conv.qual_) are performed to bring them to their composite
5165 pointer type (_expr.rel_). The result is of the composite
5168 --The second and third operands have pointer to member type, or
5169 one has pointer to member type and the other is a null pointer
5170 constant; pointer to member conversions (_conv.mem_) and
5171 qualification conversions (_conv.qual_) are performed to bring
5172 them to a common type, whose cv-qualification shall match the
5173 cv-qualification of either the second or the third operand.
5174 The result is of the common type. */
5175 else if ((null_ptr_cst_p (arg2
)
5176 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5177 || (null_ptr_cst_p (arg3
)
5178 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5179 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5180 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5181 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5183 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5184 arg3
, CPO_CONDITIONAL_EXPR
,
5186 if (result_type
== error_mark_node
)
5187 return error_mark_node
;
5188 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5189 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5194 if (complain
& tf_error
)
5195 error_at (loc
, "operands to ?: have different types %qT and %qT",
5196 arg2_type
, arg3_type
);
5197 return error_mark_node
;
5200 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5201 return error_mark_node
;
5204 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5206 /* We can't use result_type below, as fold might have returned a
5211 /* Expand both sides into the same slot, hopefully the target of
5212 the ?: expression. We used to check for TARGET_EXPRs here,
5213 but now we sometimes wrap them in NOP_EXPRs so the test would
5215 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5216 result
= get_target_expr_sfinae (result
, complain
);
5217 /* If this expression is an rvalue, but might be mistaken for an
5218 lvalue, we must add a NON_LVALUE_EXPR. */
5219 result
= rvalue (result
);
5222 result
= force_paren_expr (result
);
5227 /* Wrapper for above. */
5230 build_conditional_expr (location_t loc
, tree arg1
, tree arg2
, tree arg3
,
5231 tsubst_flags_t complain
)
5234 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5235 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5236 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5240 /* OPERAND is an operand to an expression. Perform necessary steps
5241 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5245 prep_operand (tree operand
)
5249 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5250 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5251 /* Make sure the template type is instantiated now. */
5252 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5258 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5259 OVERLOAD) to the CANDIDATES, returning an updated list of
5260 CANDIDATES. The ARGS are the arguments provided to the call;
5261 if FIRST_ARG is non-null it is the implicit object argument,
5262 otherwise the first element of ARGS is used if needed. The
5263 EXPLICIT_TARGS are explicit template arguments provided.
5264 TEMPLATE_ONLY is true if only template functions should be
5265 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5266 add_function_candidate. */
5269 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5271 tree explicit_targs
, bool template_only
,
5272 tree conversion_path
, tree access_path
,
5274 struct z_candidate
**candidates
,
5275 tsubst_flags_t complain
)
5278 const vec
<tree
, va_gc
> *non_static_args
;
5279 bool check_list_ctor
;
5280 bool check_converting
;
5281 unification_kind_t strict
;
5287 /* Precalculate special handling of constructors and conversion ops. */
5288 fn
= OVL_CURRENT (fns
);
5289 if (DECL_CONV_FN_P (fn
))
5291 check_list_ctor
= false;
5292 check_converting
= !!(flags
& LOOKUP_ONLYCONVERTING
);
5293 if (flags
& LOOKUP_NO_CONVERSION
)
5294 /* We're doing return_type(x). */
5295 strict
= DEDUCE_CONV
;
5297 /* We're doing x.operator return_type(). */
5298 strict
= DEDUCE_EXACT
;
5299 /* [over.match.funcs] For conversion functions, the function
5300 is considered to be a member of the class of the implicit
5301 object argument for the purpose of defining the type of
5302 the implicit object parameter. */
5303 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5307 if (DECL_CONSTRUCTOR_P (fn
))
5309 check_list_ctor
= !!(flags
& LOOKUP_LIST_ONLY
);
5310 /* For list-initialization we consider explicit constructors
5311 and complain if one is chosen. */
5313 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5314 == LOOKUP_ONLYCONVERTING
);
5318 check_list_ctor
= false;
5319 check_converting
= false;
5321 strict
= DEDUCE_CALL
;
5322 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5326 non_static_args
= args
;
5328 /* Delay creating the implicit this parameter until it is needed. */
5329 non_static_args
= NULL
;
5331 for (; fns
; fns
= OVL_NEXT (fns
))
5334 const vec
<tree
, va_gc
> *fn_args
;
5336 fn
= OVL_CURRENT (fns
);
5338 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5340 if (check_list_ctor
&& !is_list_ctor (fn
))
5343 /* Figure out which set of arguments to use. */
5344 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5346 /* If this function is a non-static member and we didn't get an
5347 implicit object argument, move it out of args. */
5348 if (first_arg
== NULL_TREE
)
5352 vec
<tree
, va_gc
> *tempvec
;
5353 vec_alloc (tempvec
, args
->length () - 1);
5354 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5355 tempvec
->quick_push (arg
);
5356 non_static_args
= tempvec
;
5357 first_arg
= (*args
)[0];
5360 fn_first_arg
= first_arg
;
5361 fn_args
= non_static_args
;
5365 /* Otherwise, just use the list of arguments provided. */
5366 fn_first_arg
= NULL_TREE
;
5370 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5371 add_template_candidate (candidates
,
5383 else if (!template_only
)
5384 add_function_candidate (candidates
,
5396 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5397 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5400 op_is_ordered (tree_code code
)
5406 return (flag_strong_eval_order
> 1 ? -1 : 0);
5410 return (flag_strong_eval_order
> 1 ? 1 : 0);
5413 // Not overloadable (yet).
5415 // Only one argument.
5422 return (flag_strong_eval_order
? 1 : 0);
5430 build_new_op_1 (location_t loc
, enum tree_code code
, int flags
, tree arg1
,
5431 tree arg2
, tree arg3
, tree
*overload
, tsubst_flags_t complain
)
5433 struct z_candidate
*candidates
= 0, *cand
;
5434 vec
<tree
, va_gc
> *arglist
;
5437 tree result
= NULL_TREE
;
5438 bool result_valid_p
= false;
5439 enum tree_code code2
= NOP_EXPR
;
5440 enum tree_code code_orig_arg1
= ERROR_MARK
;
5441 enum tree_code code_orig_arg2
= ERROR_MARK
;
5447 if (error_operand_p (arg1
)
5448 || error_operand_p (arg2
)
5449 || error_operand_p (arg3
))
5450 return error_mark_node
;
5452 if (code
== MODIFY_EXPR
)
5454 code2
= TREE_CODE (arg3
);
5456 fnname
= ansi_assopname (code2
);
5459 fnname
= ansi_opname (code
);
5461 arg1
= prep_operand (arg1
);
5463 bool memonly
= false;
5468 case VEC_DELETE_EXPR
:
5470 /* Use build_op_new_call and build_op_delete_call instead. */
5474 /* Use build_op_call instead. */
5477 case TRUTH_ORIF_EXPR
:
5478 case TRUTH_ANDIF_EXPR
:
5479 case TRUTH_AND_EXPR
:
5481 /* These are saved for the sake of warn_logical_operator. */
5482 code_orig_arg1
= TREE_CODE (arg1
);
5483 code_orig_arg2
= TREE_CODE (arg2
);
5491 /* These are saved for the sake of maybe_warn_bool_compare. */
5492 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5493 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5496 /* =, ->, [], () must be non-static member functions. */
5498 if (code2
!= NOP_EXPR
)
5510 arg2
= prep_operand (arg2
);
5511 arg3
= prep_operand (arg3
);
5513 if (code
== COND_EXPR
)
5514 /* Use build_conditional_expr instead. */
5516 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5517 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5520 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5521 arg2
= integer_zero_node
;
5523 vec_alloc (arglist
, 3);
5524 arglist
->quick_push (arg1
);
5525 if (arg2
!= NULL_TREE
)
5526 arglist
->quick_push (arg2
);
5527 if (arg3
!= NULL_TREE
)
5528 arglist
->quick_push (arg3
);
5530 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5531 p
= conversion_obstack_alloc (0);
5533 /* Add namespace-scope operators to the list of functions to
5536 add_candidates (lookup_function_nonclass (fnname
, arglist
,
5538 NULL_TREE
, arglist
, NULL_TREE
,
5539 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5540 flags
, &candidates
, complain
);
5544 args
[2] = NULL_TREE
;
5546 /* Add class-member operators to the candidate set. */
5547 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5551 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5552 if (fns
== error_mark_node
)
5554 result
= error_mark_node
;
5555 goto user_defined_result_ready
;
5558 add_candidates (BASELINK_FUNCTIONS (fns
),
5559 NULL_TREE
, arglist
, NULL_TREE
,
5561 BASELINK_BINFO (fns
),
5562 BASELINK_ACCESS_BINFO (fns
),
5563 flags
, &candidates
, complain
);
5565 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5566 only non-member functions that have type T1 or reference to
5567 cv-qualified-opt T1 for the first argument, if the first argument
5568 has an enumeration type, or T2 or reference to cv-qualified-opt
5569 T2 for the second argument, if the second argument has an
5570 enumeration type. Filter out those that don't match. */
5571 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5573 struct z_candidate
**candp
, **next
;
5575 for (candp
= &candidates
; *candp
; candp
= next
)
5577 tree parmlist
, parmtype
;
5578 int i
, nargs
= (arg2
? 2 : 1);
5583 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5585 for (i
= 0; i
< nargs
; ++i
)
5587 parmtype
= TREE_VALUE (parmlist
);
5589 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
5590 parmtype
= TREE_TYPE (parmtype
);
5591 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5592 && (same_type_ignoring_top_level_qualifiers_p
5593 (TREE_TYPE (args
[i
]), parmtype
)))
5596 parmlist
= TREE_CHAIN (parmlist
);
5599 /* No argument has an appropriate type, so remove this
5600 candidate function from the list. */
5603 *candp
= cand
->next
;
5609 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5616 /* For these, the built-in candidates set is empty
5617 [over.match.oper]/3. We don't want non-strict matches
5618 because exact matches are always possible with built-in
5619 operators. The built-in candidate set for COMPONENT_REF
5620 would be empty too, but since there are no such built-in
5621 operators, we accept non-strict matches for them. */
5630 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5635 case POSTINCREMENT_EXPR
:
5636 case POSTDECREMENT_EXPR
:
5637 /* Don't try anything fancy if we're not allowed to produce
5639 if (!(complain
& tf_error
))
5640 return error_mark_node
;
5642 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5643 distinguish between prefix and postfix ++ and
5644 operator++() was used for both, so we allow this with
5648 const char *msg
= (flag_permissive
)
5649 ? G_("no %<%D(int)%> declared for postfix %qs,"
5650 " trying prefix operator instead")
5651 : G_("no %<%D(int)%> declared for postfix %qs");
5652 permerror (loc
, msg
, fnname
, operator_name_info
[code
].name
);
5655 if (!flag_permissive
)
5656 return error_mark_node
;
5658 if (code
== POSTINCREMENT_EXPR
)
5659 code
= PREINCREMENT_EXPR
;
5661 code
= PREDECREMENT_EXPR
;
5662 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5663 NULL_TREE
, overload
, complain
);
5666 /* The caller will deal with these. */
5671 result_valid_p
= true;
5675 if (complain
& tf_error
)
5677 /* If one of the arguments of the operator represents
5678 an invalid use of member function pointer, try to report
5679 a meaningful error ... */
5680 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
5681 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
5682 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
5683 /* We displayed the error message. */;
5686 /* ... Otherwise, report the more generic
5687 "no matching operator found" error */
5688 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5689 print_z_candidates (loc
, candidates
);
5692 result
= error_mark_node
;
5698 cand
= tourney (candidates
, complain
);
5701 if (complain
& tf_error
)
5703 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5704 print_z_candidates (loc
, candidates
);
5706 result
= error_mark_node
;
5708 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5711 *overload
= cand
->fn
;
5713 if (resolve_args (arglist
, complain
) == NULL
)
5714 result
= error_mark_node
;
5716 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5718 if (trivial_fn_p (cand
->fn
))
5719 /* There won't be a CALL_EXPR. */;
5720 else if (result
&& result
!= error_mark_node
)
5722 tree call
= extract_call_expr (result
);
5723 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
5725 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
5726 /* This prevents build_new_function_call from discarding this
5727 function during instantiation of the enclosing template. */
5728 KOENIG_LOOKUP_P (call
) = 1;
5730 /* Specify evaluation order as per P0145R2. */
5731 CALL_EXPR_ORDERED_ARGS (call
) = false;
5732 switch (op_is_ordered (code
))
5735 CALL_EXPR_REVERSE_ARGS (call
) = true;
5739 CALL_EXPR_ORDERED_ARGS (call
) = true;
5749 /* Give any warnings we noticed during overload resolution. */
5750 if (cand
->warnings
&& (complain
& tf_warning
))
5752 struct candidate_warning
*w
;
5753 for (w
= cand
->warnings
; w
; w
= w
->next
)
5754 joust (cand
, w
->loser
, 1, complain
);
5757 /* Check for comparison of different enum types. */
5766 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
5767 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
5768 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
5769 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
5770 && (complain
& tf_warning
))
5772 warning (OPT_Wenum_compare
,
5773 "comparison between %q#T and %q#T",
5774 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5781 /* We need to strip any leading REF_BIND so that bitfields
5782 don't cause errors. This should not remove any important
5783 conversions, because builtins don't apply to class
5784 objects directly. */
5785 conv
= cand
->convs
[0];
5786 if (conv
->kind
== ck_ref_bind
)
5787 conv
= next_conversion (conv
);
5788 arg1
= convert_like (conv
, arg1
, complain
);
5792 conv
= cand
->convs
[1];
5793 if (conv
->kind
== ck_ref_bind
)
5794 conv
= next_conversion (conv
);
5796 arg2
= decay_conversion (arg2
, complain
);
5798 /* We need to call warn_logical_operator before
5799 converting arg2 to a boolean_type, but after
5800 decaying an enumerator to its value. */
5801 if (complain
& tf_warning
)
5802 warn_logical_operator (loc
, code
, boolean_type_node
,
5803 code_orig_arg1
, arg1
,
5804 code_orig_arg2
, arg2
);
5806 arg2
= convert_like (conv
, arg2
, complain
);
5810 conv
= cand
->convs
[2];
5811 if (conv
->kind
== ck_ref_bind
)
5812 conv
= next_conversion (conv
);
5813 arg3
= convert_like (conv
, arg3
, complain
);
5819 user_defined_result_ready
:
5821 /* Free all the conversions we allocated. */
5822 obstack_free (&conversion_obstack
, p
);
5824 if (result
|| result_valid_p
)
5831 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
5834 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
5836 case TRUTH_ANDIF_EXPR
:
5837 case TRUTH_ORIF_EXPR
:
5838 case TRUTH_AND_EXPR
:
5840 if (complain
& tf_warning
)
5841 warn_logical_operator (loc
, code
, boolean_type_node
,
5842 code_orig_arg1
, arg1
,
5843 code_orig_arg2
, arg2
);
5851 if ((complain
& tf_warning
)
5852 && ((code_orig_arg1
== BOOLEAN_TYPE
)
5853 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
5854 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
5855 if (complain
& tf_warning
&& warn_tautological_compare
)
5856 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
5861 case TRUNC_DIV_EXPR
:
5866 case TRUNC_MOD_EXPR
:
5870 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
5872 case UNARY_PLUS_EXPR
:
5875 case TRUTH_NOT_EXPR
:
5876 case PREINCREMENT_EXPR
:
5877 case POSTINCREMENT_EXPR
:
5878 case PREDECREMENT_EXPR
:
5879 case POSTDECREMENT_EXPR
:
5883 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
5886 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
5889 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
5893 /* The caller will deal with these. */
5905 /* Wrapper for above. */
5908 build_new_op (location_t loc
, enum tree_code code
, int flags
,
5909 tree arg1
, tree arg2
, tree arg3
,
5910 tree
*overload
, tsubst_flags_t complain
)
5913 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5914 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
5915 overload
, complain
);
5916 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5920 /* CALL was returned by some call-building function; extract the actual
5921 CALL_EXPR from any bits that have been tacked on, e.g. by
5922 convert_from_reference. */
5925 extract_call_expr (tree call
)
5927 while (TREE_CODE (call
) == COMPOUND_EXPR
)
5928 call
= TREE_OPERAND (call
, 1);
5929 if (REFERENCE_REF_P (call
))
5930 call
= TREE_OPERAND (call
, 0);
5931 if (TREE_CODE (call
) == TARGET_EXPR
)
5932 call
= TARGET_EXPR_INITIAL (call
);
5933 gcc_assert (TREE_CODE (call
) == CALL_EXPR
5934 || TREE_CODE (call
) == AGGR_INIT_EXPR
5935 || call
== error_mark_node
);
5939 /* Returns true if FN has two parameters, of which the second has type
5943 second_parm_is_size_t (tree fn
)
5945 tree t
= FUNCTION_ARG_CHAIN (fn
);
5947 && same_type_p (TREE_VALUE (t
), size_type_node
)
5948 && TREE_CHAIN (t
) == void_list_node
);
5951 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
5952 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
5955 non_placement_deallocation_fn_p (tree t
)
5957 /* A template instance is never a usual deallocation function,
5958 regardless of its signature. */
5959 if (TREE_CODE (t
) == TEMPLATE_DECL
5960 || primary_template_instantiation_p (t
))
5963 /* If a class T has a member deallocation function named operator delete
5964 with exactly one parameter, then that function is a usual
5965 (non-placement) deallocation function. If class T does not declare
5966 such an operator delete but does declare a member deallocation
5967 function named operator delete with exactly two parameters, the second
5968 of which has type std::size_t (18.2), then this function is a usual
5969 deallocation function. */
5970 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
5971 if (FUNCTION_ARG_CHAIN (t
) == void_list_node
5972 || ((!global
|| flag_sized_deallocation
)
5973 && second_parm_is_size_t (t
)))
5978 /* Build a call to operator delete. This has to be handled very specially,
5979 because the restrictions on what signatures match are different from all
5980 other call instances. For a normal delete, only a delete taking (void *)
5981 or (void *, size_t) is accepted. For a placement delete, only an exact
5982 match with the placement new is accepted.
5984 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
5985 ADDR is the pointer to be deleted.
5986 SIZE is the size of the memory block to be deleted.
5987 GLOBAL_P is true if the delete-expression should not consider
5988 class-specific delete operators.
5989 PLACEMENT is the corresponding placement new call, or NULL_TREE.
5991 If this call to "operator delete" is being generated as part to
5992 deallocate memory allocated via a new-expression (as per [expr.new]
5993 which requires that if the initialization throws an exception then
5994 we call a deallocation function), then ALLOC_FN is the allocation
5998 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
5999 bool global_p
, tree placement
,
6000 tree alloc_fn
, tsubst_flags_t complain
)
6002 tree fn
= NULL_TREE
;
6003 tree fns
, fnname
, type
, t
;
6005 if (addr
== error_mark_node
)
6006 return error_mark_node
;
6008 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6010 fnname
= ansi_opname (code
);
6012 if (CLASS_TYPE_P (type
)
6013 && COMPLETE_TYPE_P (complete_type (type
))
6017 If the result of the lookup is ambiguous or inaccessible, or if
6018 the lookup selects a placement deallocation function, the
6019 program is ill-formed.
6021 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6023 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6024 if (fns
== error_mark_node
)
6025 return error_mark_node
;
6030 if (fns
== NULL_TREE
)
6031 fns
= lookup_name_nonclass (fnname
);
6033 /* Strip const and volatile from addr. */
6034 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6038 /* "A declaration of a placement deallocation function matches the
6039 declaration of a placement allocation function if it has the same
6040 number of parameters and, after parameter transformations (8.3.5),
6041 all parameter types except the first are identical."
6043 So we build up the function type we want and ask instantiate_type
6044 to get it for us. */
6045 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6046 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6047 t
= build_function_type (void_type_node
, t
);
6049 fn
= instantiate_type (t
, fns
, tf_none
);
6050 if (fn
== error_mark_node
)
6053 if (BASELINK_P (fn
))
6054 fn
= BASELINK_FUNCTIONS (fn
);
6056 /* "If the lookup finds the two-parameter form of a usual deallocation
6057 function (3.7.4.2) and that function, considered as a placement
6058 deallocation function, would have been selected as a match for the
6059 allocation function, the program is ill-formed." */
6060 if (second_parm_is_size_t (fn
))
6063 = G_("exception cleanup for this placement new selects "
6064 "non-placement operator delete");
6066 = G_("%qD is a usual (non-placement) deallocation "
6067 "function in C++14 (or with -fsized-deallocation)");
6069 /* But if the class has an operator delete (void *), then that is
6070 the usual deallocation function, so we shouldn't complain
6071 about using the operator delete (void *, size_t). */
6072 if (DECL_CLASS_SCOPE_P (fn
))
6073 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
6074 t
; t
= OVL_NEXT (t
))
6076 tree elt
= OVL_CURRENT (t
);
6077 if (non_placement_deallocation_fn_p (elt
)
6078 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6081 /* Before C++14 a two-parameter global deallocation function is
6082 always a placement deallocation function, but warn if
6084 else if (!flag_sized_deallocation
)
6086 if ((complain
& tf_warning
)
6087 && warning (OPT_Wc__14_compat
, msg1
))
6088 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6092 if (complain
& tf_warning_or_error
)
6094 if (permerror (input_location
, msg1
))
6096 /* Only mention C++14 for namespace-scope delete. */
6097 if (DECL_NAMESPACE_SCOPE_P (fn
))
6098 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6100 inform (DECL_SOURCE_LOCATION (fn
),
6101 "%qD is a usual (non-placement) deallocation "
6106 return error_mark_node
;
6111 /* "Any non-placement deallocation function matches a non-placement
6112 allocation function. If the lookup finds a single matching
6113 deallocation function, that function will be called; otherwise, no
6114 deallocation function will be called." */
6115 for (t
= BASELINK_P (fns
) ? BASELINK_FUNCTIONS (fns
) : fns
;
6116 t
; t
= OVL_NEXT (t
))
6118 tree elt
= OVL_CURRENT (t
);
6119 if (non_placement_deallocation_fn_p (elt
))
6122 /* "If a class T has a member deallocation function named
6123 operator delete with exactly one parameter, then that
6124 function is a usual (non-placement) deallocation
6125 function. If class T does not declare such an operator
6126 delete but does declare a member deallocation function named
6127 operator delete with exactly two parameters, the second of
6128 which has type std::size_t (18.2), then this function is a
6129 usual deallocation function."
6131 So in a class (void*) beats (void*, size_t). */
6132 if (DECL_CLASS_SCOPE_P (fn
))
6134 if (FUNCTION_ARG_CHAIN (fn
) == void_list_node
)
6137 /* At global scope (in C++14 and above) the rules are different:
6139 If deallocation function lookup finds both a usual
6140 deallocation function with only a pointer parameter and a
6141 usual deallocation function with both a pointer parameter
6142 and a size parameter, the function to be called is selected
6145 * If the type is complete and if, for the second alternative
6146 (delete array) only, the operand is a pointer to a class
6147 type with a non-trivial destructor or a (possibly
6148 multi-dimensional) array thereof, the function with two
6149 parameters is selected.
6151 * Otherwise, it is unspecified which of the two deallocation
6152 functions is selected. */
6155 bool want_size
= COMPLETE_TYPE_P (type
);
6156 if (code
== VEC_DELETE_EXPR
6157 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6158 /* We need a cookie to determine the array size. */
6160 bool have_size
= (FUNCTION_ARG_CHAIN (fn
) != void_list_node
);
6161 if (want_size
== have_size
)
6167 /* If we have a matching function, call it. */
6170 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6172 /* If the FN is a member function, make sure that it is
6174 if (BASELINK_P (fns
))
6175 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6178 /* Core issue 901: It's ok to new a type with deleted delete. */
6179 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6184 /* The placement args might not be suitable for overload
6185 resolution at this point, so build the call directly. */
6186 int nargs
= call_expr_nargs (placement
);
6187 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6190 for (i
= 1; i
< nargs
; i
++)
6191 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6192 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6193 return error_mark_node
;
6194 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6199 vec
<tree
, va_gc
> *args
= make_tree_vector ();
6200 args
->quick_push (addr
);
6201 if (FUNCTION_ARG_CHAIN (fn
) != void_list_node
)
6202 args
->quick_push (size
);
6203 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6204 release_tree_vector (args
);
6211 If no unambiguous matching deallocation function can be found,
6212 propagating the exception does not cause the object's memory to
6216 if ((complain
& tf_warning
)
6218 warning (0, "no corresponding deallocation function for %qD",
6223 if (complain
& tf_error
)
6224 error ("no suitable %<operator %s%> for %qT",
6225 operator_name_info
[(int)code
].name
, type
);
6226 return error_mark_node
;
6229 /* If the current scope isn't allowed to access DECL along
6230 BASETYPE_PATH, give an error. The most derived class in
6231 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6232 the declaration to use in the error diagnostic. */
6235 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6236 tsubst_flags_t complain
)
6238 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6240 if (!accessible_p (basetype_path
, decl
, true))
6242 if (complain
& tf_error
)
6244 if (TREE_PRIVATE (decl
))
6246 error ("%q#D is private within this context", diag_decl
);
6247 inform (DECL_SOURCE_LOCATION (diag_decl
),
6248 "declared private here");
6250 else if (TREE_PROTECTED (decl
))
6252 error ("%q#D is protected within this context", diag_decl
);
6253 inform (DECL_SOURCE_LOCATION (diag_decl
),
6254 "declared protected here");
6258 error ("%q#D is inaccessible within this context", diag_decl
);
6259 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6268 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6269 bitwise or of LOOKUP_* values. If any errors are warnings are
6270 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6271 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6275 build_temp (tree expr
, tree type
, int flags
,
6276 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6279 vec
<tree
, va_gc
> *args
;
6281 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6282 args
= make_tree_vector_single (expr
);
6283 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6284 &args
, type
, flags
, complain
);
6285 release_tree_vector (args
);
6286 if (warningcount
+ werrorcount
> savew
)
6287 *diagnostic_kind
= DK_WARNING
;
6288 else if (errorcount
> savee
)
6289 *diagnostic_kind
= DK_ERROR
;
6291 *diagnostic_kind
= DK_UNSPECIFIED
;
6295 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6296 EXPR is implicitly converted to type TOTYPE.
6297 FN and ARGNUM are used for diagnostics. */
6300 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6302 /* Issue warnings about peculiar, but valid, uses of NULL. */
6303 if (expr
== null_node
&& TREE_CODE (totype
) != BOOLEAN_TYPE
6304 && ARITHMETIC_TYPE_P (totype
))
6306 source_location loc
=
6307 expansion_point_location_if_in_system_header (input_location
);
6310 warning_at (loc
, OPT_Wconversion_null
,
6311 "passing NULL to non-pointer argument %P of %qD",
6314 warning_at (loc
, OPT_Wconversion_null
,
6315 "converting to non-pointer type %qT from NULL", totype
);
6318 /* Issue warnings if "false" is converted to a NULL pointer */
6319 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6320 && TYPE_PTR_P (totype
))
6323 warning_at (input_location
, OPT_Wconversion_null
,
6324 "converting %<false%> to pointer type for argument %P "
6325 "of %qD", argnum
, fn
);
6327 warning_at (input_location
, OPT_Wconversion_null
,
6328 "converting %<false%> to pointer type %qT", totype
);
6332 /* We gave a diagnostic during a conversion. If this was in the second
6333 standard conversion sequence of a user-defined conversion sequence, say
6334 which user-defined conversion. */
6337 maybe_print_user_conv_context (conversion
*convs
)
6339 if (convs
->user_conv_p
)
6340 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6341 if (t
->kind
== ck_user
)
6343 print_z_candidate (0, " after user-defined conversion:",
6349 /* Perform the conversions in CONVS on the expression EXPR. FN and
6350 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6351 indicates the `this' argument of a method. INNER is nonzero when
6352 being called to continue a conversion chain. It is negative when a
6353 reference binding will be applied, positive otherwise. If
6354 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6355 conversions will be emitted if appropriate. If C_CAST_P is true,
6356 this conversion is coming from a C-style cast; in that case,
6357 conversions to inaccessible bases are permitted. */
6360 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6361 int inner
, bool issue_conversion_warnings
,
6362 bool c_cast_p
, tsubst_flags_t complain
)
6364 tree totype
= convs
->type
;
6365 diagnostic_t diag_kind
;
6367 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6369 if (convs
->bad_p
&& !(complain
& tf_error
))
6370 return error_mark_node
;
6373 && convs
->kind
!= ck_user
6374 && convs
->kind
!= ck_list
6375 && convs
->kind
!= ck_ambig
6376 && (convs
->kind
!= ck_ref_bind
6377 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6378 && (convs
->kind
!= ck_rvalue
6379 || SCALAR_TYPE_P (totype
))
6380 && convs
->kind
!= ck_base
)
6382 bool complained
= false;
6383 conversion
*t
= convs
;
6385 /* Give a helpful error if this is bad because of excess braces. */
6386 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6387 && SCALAR_TYPE_P (totype
)
6388 && CONSTRUCTOR_NELTS (expr
) > 0
6389 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6391 complained
= permerror (loc
, "too many braces around initializer "
6393 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6394 && CONSTRUCTOR_NELTS (expr
) == 1)
6395 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6398 /* Give a helpful error if this is bad because a conversion to bool
6399 from std::nullptr_t requires direct-initialization. */
6400 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6401 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6402 complained
= permerror (loc
, "converting to %qT from %qT requires "
6403 "direct-initialization",
6404 totype
, TREE_TYPE (expr
));
6406 for (; t
; t
= next_conversion (t
))
6408 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6410 complained
= permerror (loc
, "invalid user-defined conversion "
6411 "from %qT to %qT", TREE_TYPE (expr
),
6414 print_z_candidate (loc
, "candidate is:", t
->cand
);
6415 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
6416 /*issue_conversion_warnings=*/false,
6419 if (convs
->kind
== ck_ref_bind
)
6420 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6421 LOOKUP_NORMAL
, NULL_TREE
,
6424 expr
= cp_convert (totype
, expr
, complain
);
6425 if (complained
&& fn
)
6426 inform (DECL_SOURCE_LOCATION (fn
),
6427 " initializing argument %P of %qD", argnum
, fn
);
6430 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6432 expr
= convert_like_real (t
, expr
, fn
, argnum
, 1,
6433 /*issue_conversion_warnings=*/false,
6438 else if (t
->kind
== ck_ambig
)
6439 return convert_like_real (t
, expr
, fn
, argnum
, 1,
6440 /*issue_conversion_warnings=*/false,
6443 else if (t
->kind
== ck_identity
)
6447 complained
= permerror (loc
, "invalid conversion from %qT to %qT",
6448 TREE_TYPE (expr
), totype
);
6449 if (complained
&& fn
)
6450 inform (DECL_SOURCE_LOCATION (fn
),
6451 " initializing argument %P of %qD", argnum
, fn
);
6453 return cp_convert (totype
, expr
, complain
);
6456 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6457 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6459 switch (convs
->kind
)
6463 struct z_candidate
*cand
= convs
->cand
;
6464 tree convfn
= cand
->fn
;
6467 /* When converting from an init list we consider explicit
6468 constructors, but actually trying to call one is an error. */
6469 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6470 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
6471 /* Unless this is for direct-list-initialization. */
6472 && !CONSTRUCTOR_IS_DIRECT_INIT (expr
)
6473 /* And in C++98 a default constructor can't be explicit. */
6474 && cxx_dialect
>= cxx11
)
6476 if (!(complain
& tf_error
))
6477 return error_mark_node
;
6478 location_t loc
= location_of (expr
);
6479 if (CONSTRUCTOR_NELTS (expr
) == 0
6480 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
6482 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
6483 "would use explicit constructor %qD",
6485 inform (loc
, "in C++11 and above a default constructor "
6489 error ("converting to %qT from initializer list would use "
6490 "explicit constructor %qD", totype
, convfn
);
6493 /* If we're initializing from {}, it's value-initialization. */
6494 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6495 && CONSTRUCTOR_NELTS (expr
) == 0
6496 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6498 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6499 expr
= build_value_init (totype
, complain
);
6500 expr
= get_target_expr_sfinae (expr
, complain
);
6501 if (expr
!= error_mark_node
)
6503 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6504 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
6509 expr
= mark_rvalue_use (expr
);
6511 /* Set user_conv_p on the argument conversions, so rvalue/base
6512 handling knows not to allow any more UDCs. */
6513 for (i
= 0; i
< cand
->num_convs
; ++i
)
6514 cand
->convs
[i
]->user_conv_p
= true;
6516 expr
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
6518 /* If this is a constructor or a function returning an aggr type,
6519 we need to build up a TARGET_EXPR. */
6520 if (DECL_CONSTRUCTOR_P (convfn
))
6522 expr
= build_cplus_new (totype
, expr
, complain
);
6524 /* Remember that this was list-initialization. */
6525 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
6526 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6532 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
6534 int nelts
= CONSTRUCTOR_NELTS (expr
);
6536 expr
= build_value_init (totype
, complain
);
6537 else if (nelts
== 1)
6538 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6542 expr
= mark_rvalue_use (expr
);
6544 if (type_unknown_p (expr
))
6545 expr
= instantiate_type (totype
, expr
, complain
);
6546 /* Convert a constant to its underlying value, unless we are
6547 about to bind it to a reference, in which case we need to
6548 leave it as an lvalue. */
6551 expr
= scalar_constant_value (expr
);
6552 if (expr
== null_node
&& INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
6553 /* If __null has been converted to an integer type, we do not
6554 want to warn about uses of EXPR as an integer, rather than
6556 expr
= build_int_cst (totype
, 0);
6560 /* We leave bad_p off ck_ambig because overload resolution considers
6561 it valid, it just fails when we try to perform it. So we need to
6562 check complain here, too. */
6563 if (complain
& tf_error
)
6565 /* Call build_user_type_conversion again for the error. */
6566 build_user_type_conversion (totype
, convs
->u
.expr
, LOOKUP_NORMAL
,
6569 inform (DECL_SOURCE_LOCATION (fn
),
6570 " initializing argument %P of %qD", argnum
, fn
);
6572 return error_mark_node
;
6576 /* Conversion to std::initializer_list<T>. */
6577 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
6578 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
6579 unsigned len
= CONSTRUCTOR_NELTS (expr
);
6580 tree array
, val
, field
;
6581 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
6584 /* Convert all the elements. */
6585 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
6587 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
6588 1, false, false, complain
);
6589 if (sub
== error_mark_node
)
6591 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
6592 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
6593 return error_mark_node
;
6594 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
6595 if (!TREE_CONSTANT (sub
))
6596 TREE_CONSTANT (new_ctor
) = false;
6598 /* Build up the array. */
6599 elttype
= cp_build_qualified_type
6600 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
6601 array
= build_array_of_n_type (elttype
, len
);
6602 array
= finish_compound_literal (array
, new_ctor
, complain
);
6603 /* Take the address explicitly rather than via decay_conversion
6604 to avoid the error about taking the address of a temporary. */
6605 array
= cp_build_addr_expr (array
, complain
);
6606 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
6607 if (array
== error_mark_node
)
6608 return error_mark_node
;
6610 /* Build up the initializer_list object. */
6611 totype
= complete_type (totype
);
6612 field
= next_initializable_field (TYPE_FIELDS (totype
));
6613 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
6614 field
= next_initializable_field (DECL_CHAIN (field
));
6615 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
6616 new_ctor
= build_constructor (totype
, vec
);
6617 return get_target_expr_sfinae (new_ctor
, complain
);
6621 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
6623 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6624 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
6625 real
= perform_implicit_conversion (TREE_TYPE (totype
),
6627 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
6629 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
6632 expr
= reshape_init (totype
, expr
, complain
);
6633 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
6635 if (expr
!= error_mark_node
)
6636 TARGET_EXPR_LIST_INIT_P (expr
) = true;
6643 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
6644 convs
->kind
== ck_ref_bind
? -1 : 1,
6645 convs
->kind
== ck_ref_bind
? issue_conversion_warnings
: false,
6648 if (expr
== error_mark_node
)
6649 return error_mark_node
;
6651 switch (convs
->kind
)
6654 expr
= decay_conversion (expr
, complain
);
6655 if (expr
== error_mark_node
)
6657 if (complain
& tf_error
)
6659 maybe_print_user_conv_context (convs
);
6661 inform (DECL_SOURCE_LOCATION (fn
),
6662 " initializing argument %P of %qD", argnum
, fn
);
6664 return error_mark_node
;
6667 if (! MAYBE_CLASS_TYPE_P (totype
))
6671 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
6673 /* We are going to bind a reference directly to a base-class
6674 subobject of EXPR. */
6675 /* Build an expression for `*((base*) &expr)'. */
6676 expr
= convert_to_base (expr
, totype
,
6677 !c_cast_p
, /*nonnull=*/true, complain
);
6681 /* Copy-initialization where the cv-unqualified version of the source
6682 type is the same class as, or a derived class of, the class of the
6683 destination [is treated as direct-initialization]. [dcl.init] */
6684 flags
= LOOKUP_NORMAL
;
6685 if (convs
->user_conv_p
)
6686 /* This conversion is being done in the context of a user-defined
6687 conversion (i.e. the second step of copy-initialization), so
6688 don't allow any more. */
6689 flags
|= LOOKUP_NO_CONVERSION
;
6691 flags
|= LOOKUP_ONLYCONVERTING
;
6692 if (convs
->rvaluedness_matches_p
)
6693 flags
|= LOOKUP_PREFER_RVALUE
;
6694 if (TREE_CODE (expr
) == TARGET_EXPR
6695 && TARGET_EXPR_LIST_INIT_P (expr
))
6696 /* Copy-list-initialization doesn't actually involve a copy. */
6698 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
6699 if (diag_kind
&& complain
)
6701 maybe_print_user_conv_context (convs
);
6703 inform (DECL_SOURCE_LOCATION (fn
),
6704 " initializing argument %P of %qD", argnum
, fn
);
6707 return build_cplus_new (totype
, expr
, complain
);
6711 tree ref_type
= totype
;
6713 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
6715 tree extype
= TREE_TYPE (expr
);
6716 if (TYPE_REF_IS_RVALUE (ref_type
)
6718 error_at (loc
, "cannot bind rvalue reference of type %qT to "
6719 "lvalue of type %qT", totype
, extype
);
6720 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
6721 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
6722 error_at (loc
, "cannot bind non-const lvalue reference of "
6723 "type %qT to an rvalue of type %qT", totype
, extype
);
6724 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
6725 error_at (loc
, "binding reference of type %qT to %qT "
6726 "discards qualifiers", totype
, extype
);
6729 maybe_print_user_conv_context (convs
);
6731 inform (DECL_SOURCE_LOCATION (fn
),
6732 " initializing argument %P of %qD", argnum
, fn
);
6733 return error_mark_node
;
6736 /* If necessary, create a temporary.
6738 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
6739 that need temporaries, even when their types are reference
6740 compatible with the type of reference being bound, so the
6741 upcoming call to cp_build_addr_expr doesn't fail. */
6742 if (convs
->need_temporary_p
6743 || TREE_CODE (expr
) == CONSTRUCTOR
6744 || TREE_CODE (expr
) == VA_ARG_EXPR
)
6746 /* Otherwise, a temporary of type "cv1 T1" is created and
6747 initialized from the initializer expression using the rules
6748 for a non-reference copy-initialization (8.5). */
6750 tree type
= TREE_TYPE (ref_type
);
6751 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
6753 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6754 (type
, next_conversion (convs
)->type
));
6755 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
6756 && !TYPE_REF_IS_RVALUE (ref_type
))
6758 /* If the reference is volatile or non-const, we
6759 cannot create a temporary. */
6760 if (lvalue
& clk_bitfield
)
6761 error_at (loc
, "cannot bind bitfield %qE to %qT",
6763 else if (lvalue
& clk_packed
)
6764 error_at (loc
, "cannot bind packed field %qE to %qT",
6767 error_at (loc
, "cannot bind rvalue %qE to %qT",
6769 return error_mark_node
;
6771 /* If the source is a packed field, and we must use a copy
6772 constructor, then building the target expr will require
6773 binding the field to the reference parameter to the
6774 copy constructor, and we'll end up with an infinite
6775 loop. If we can use a bitwise copy, then we'll be
6777 if ((lvalue
& clk_packed
)
6778 && CLASS_TYPE_P (type
)
6779 && type_has_nontrivial_copy_init (type
))
6781 error_at (loc
, "cannot bind packed field %qE to %qT",
6783 return error_mark_node
;
6785 if (lvalue
& clk_bitfield
)
6787 expr
= convert_bitfield_to_declared_type (expr
);
6788 expr
= fold_convert (type
, expr
);
6790 expr
= build_target_expr_with_type (expr
, type
, complain
);
6793 /* Take the address of the thing to which we will bind the
6795 expr
= cp_build_addr_expr (expr
, complain
);
6796 if (expr
== error_mark_node
)
6797 return error_mark_node
;
6799 /* Convert it to a pointer to the type referred to by the
6800 reference. This will adjust the pointer if a derived to
6801 base conversion is being performed. */
6802 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
6804 /* Convert the pointer to the desired reference type. */
6805 return build_nop (ref_type
, expr
);
6809 return decay_conversion (expr
, complain
);
6812 /* ??? Should the address of a transaction-safe pointer point to the TM
6813 clone, and this conversion look up the primary function? */
6814 return build_nop (totype
, expr
);
6817 /* Warn about deprecated conversion if appropriate. */
6818 string_conv_p (totype
, expr
, 1);
6823 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
6824 /*nonnull=*/false, complain
);
6825 return build_nop (totype
, expr
);
6828 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
6829 c_cast_p
, complain
);
6835 if (convs
->check_narrowing
6836 && !check_narrowing (totype
, expr
, complain
))
6837 return error_mark_node
;
6839 if (issue_conversion_warnings
)
6840 expr
= cp_convert_and_check (totype
, expr
, complain
);
6842 expr
= cp_convert (totype
, expr
, complain
);
6847 /* ARG is being passed to a varargs function. Perform any conversions
6848 required. Return the converted value. */
6851 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
6854 location_t loc
= EXPR_LOC_OR_LOC (arg
, input_location
);
6858 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
6859 standard conversions are performed. */
6860 arg
= decay_conversion (arg
, complain
);
6861 arg_type
= TREE_TYPE (arg
);
6864 If the argument has integral or enumeration type that is subject
6865 to the integral promotions (_conv.prom_), or a floating point
6866 type that is subject to the floating point promotion
6867 (_conv.fpprom_), the value of the argument is converted to the
6868 promoted type before the call. */
6869 if (TREE_CODE (arg_type
) == REAL_TYPE
6870 && (TYPE_PRECISION (arg_type
)
6871 < TYPE_PRECISION (double_type_node
))
6872 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
6874 if ((complain
& tf_warning
)
6875 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
6876 warning_at (loc
, OPT_Wdouble_promotion
,
6877 "implicit conversion from %qT to %qT when passing "
6878 "argument to function",
6879 arg_type
, double_type_node
);
6880 arg
= convert_to_real_nofold (double_type_node
, arg
);
6882 else if (NULLPTR_TYPE_P (arg_type
))
6883 arg
= null_pointer_node
;
6884 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
6886 if (SCOPED_ENUM_P (arg_type
))
6888 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
6890 prom
= cp_perform_integral_promotions (prom
, complain
);
6891 if (abi_version_crosses (6)
6892 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
6893 && (complain
& tf_warning
))
6894 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
6895 "%qT before -fabi-version=6, %qT after", arg_type
,
6896 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
6897 if (!abi_version_at_least (6))
6901 arg
= cp_perform_integral_promotions (arg
, complain
);
6904 arg
= require_complete_type_sfinae (arg
, complain
);
6905 arg_type
= TREE_TYPE (arg
);
6907 if (arg
!= error_mark_node
6908 /* In a template (or ill-formed code), we can have an incomplete type
6909 even after require_complete_type_sfinae, in which case we don't know
6910 whether it has trivial copy or not. */
6911 && COMPLETE_TYPE_P (arg_type
))
6913 /* Build up a real lvalue-to-rvalue conversion in case the
6914 copy constructor is trivial but not callable. */
6915 if (!cp_unevaluated_operand
&& CLASS_TYPE_P (arg_type
))
6916 force_rvalue (arg
, complain
);
6918 /* [expr.call] 5.2.2/7:
6919 Passing a potentially-evaluated argument of class type (Clause 9)
6920 with a non-trivial copy constructor or a non-trivial destructor
6921 with no corresponding parameter is conditionally-supported, with
6922 implementation-defined semantics.
6924 We support it as pass-by-invisible-reference, just like a normal
6927 If the call appears in the context of a sizeof expression,
6928 it is not potentially-evaluated. */
6929 if (cp_unevaluated_operand
== 0
6930 && (type_has_nontrivial_copy_init (arg_type
)
6931 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
)))
6933 if (complain
& tf_warning
)
6934 warning (OPT_Wconditionally_supported
,
6935 "passing objects of non-trivially-copyable "
6936 "type %q#T through %<...%> is conditionally supported",
6938 return cp_build_addr_expr (arg
, complain
);
6945 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
6948 build_x_va_arg (source_location loc
, tree expr
, tree type
)
6950 if (processing_template_decl
)
6952 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
6953 SET_EXPR_LOCATION (r
, loc
);
6957 type
= complete_type_or_else (type
, NULL_TREE
);
6959 if (expr
== error_mark_node
|| !type
)
6960 return error_mark_node
;
6962 expr
= mark_lvalue_use (expr
);
6964 if (TREE_CODE (type
) == REFERENCE_TYPE
)
6966 error ("cannot receive reference type %qT through %<...%>", type
);
6967 return error_mark_node
;
6970 if (type_has_nontrivial_copy_init (type
)
6971 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
6973 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
6974 it as pass by invisible reference. */
6975 warning_at (loc
, OPT_Wconditionally_supported
,
6976 "receiving objects of non-trivially-copyable type %q#T "
6977 "through %<...%> is conditionally-supported", type
);
6979 tree ref
= cp_build_reference_type (type
, false);
6980 expr
= build_va_arg (loc
, expr
, ref
);
6981 return convert_from_reference (expr
);
6984 return build_va_arg (loc
, expr
, type
);
6987 /* TYPE has been given to va_arg. Apply the default conversions which
6988 would have happened when passed via ellipsis. Return the promoted
6989 type, or the passed type if there is no change. */
6992 cxx_type_promotes_to (tree type
)
6996 /* Perform the array-to-pointer and function-to-pointer
6998 type
= type_decays_to (type
);
7000 promote
= type_promotes_to (type
);
7001 if (same_type_p (type
, promote
))
7007 /* ARG is a default argument expression being passed to a parameter of
7008 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7009 zero-based argument number. Do any required conversions. Return
7010 the converted value. */
7012 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
7014 push_defarg_context (tree fn
)
7015 { vec_safe_push (default_arg_context
, fn
); }
7018 pop_defarg_context (void)
7019 { default_arg_context
->pop (); }
7022 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
7023 tsubst_flags_t complain
)
7028 /* See through clones. */
7029 fn
= DECL_ORIGIN (fn
);
7031 /* Detect recursion. */
7032 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
7035 if (complain
& tf_error
)
7036 error ("recursive evaluation of default argument for %q#D", fn
);
7037 return error_mark_node
;
7040 /* If the ARG is an unparsed default argument expression, the
7041 conversion cannot be performed. */
7042 if (TREE_CODE (arg
) == DEFAULT_ARG
)
7044 if (complain
& tf_error
)
7045 error ("call to %qD uses the default argument for parameter %P, which "
7046 "is not yet defined", fn
, parmnum
);
7047 return error_mark_node
;
7050 push_defarg_context (fn
);
7052 if (fn
&& DECL_TEMPLATE_INFO (fn
))
7053 arg
= tsubst_default_argument (fn
, type
, arg
, complain
);
7059 The names in the expression are bound, and the semantic
7060 constraints are checked, at the point where the default
7061 expressions appears.
7063 we must not perform access checks here. */
7064 push_deferring_access_checks (dk_no_check
);
7065 /* We must make a copy of ARG, in case subsequent processing
7066 alters any part of it. */
7067 arg
= break_out_target_exprs (arg
);
7068 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
7069 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
7071 arg
= convert_for_arg_passing (type
, arg
, complain
);
7072 pop_deferring_access_checks();
7074 pop_defarg_context ();
7079 /* Returns the type which will really be used for passing an argument of
7083 type_passed_as (tree type
)
7085 /* Pass classes with copy ctors by invisible reference. */
7086 if (TREE_ADDRESSABLE (type
))
7088 type
= build_reference_type (type
);
7089 /* There are no other pointers to this temporary. */
7090 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
7092 else if (targetm
.calls
.promote_prototypes (type
)
7093 && INTEGRAL_TYPE_P (type
)
7094 && COMPLETE_TYPE_P (type
)
7095 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7096 type
= integer_type_node
;
7101 /* Actually perform the appropriate conversion. */
7104 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
7108 /* If VAL is a bitfield, then -- since it has already been converted
7109 to TYPE -- it cannot have a precision greater than TYPE.
7111 If it has a smaller precision, we must widen it here. For
7112 example, passing "int f:3;" to a function expecting an "int" will
7113 not result in any conversion before this point.
7115 If the precision is the same we must not risk widening. For
7116 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7117 often have type "int", even though the C++ type for the field is
7118 "long long". If the value is being passed to a function
7119 expecting an "int", then no conversions will be required. But,
7120 if we call convert_bitfield_to_declared_type, the bitfield will
7121 be converted to "long long". */
7122 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
7124 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
7125 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
7127 if (val
== error_mark_node
)
7129 /* Pass classes with copy ctors by invisible reference. */
7130 else if (TREE_ADDRESSABLE (type
))
7131 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
7132 else if (targetm
.calls
.promote_prototypes (type
)
7133 && INTEGRAL_TYPE_P (type
)
7134 && COMPLETE_TYPE_P (type
)
7135 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7136 val
= cp_perform_integral_promotions (val
, complain
);
7137 if ((complain
& tf_warning
)
7138 && warn_suggest_attribute_format
)
7140 tree rhstype
= TREE_TYPE (val
);
7141 const enum tree_code coder
= TREE_CODE (rhstype
);
7142 const enum tree_code codel
= TREE_CODE (type
);
7143 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7145 && check_missing_format_attribute (type
, rhstype
))
7146 warning (OPT_Wsuggest_attribute_format
,
7147 "argument of function call might be a candidate for a format attribute");
7152 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7153 which just decay_conversion or no conversions at all should be done.
7154 This is true for some builtins which don't act like normal functions.
7155 Return 2 if no conversions at all should be done, 1 if just
7156 decay_conversion. Return 3 for special treatment of the 3rd argument
7157 for __builtin_*_overflow_p. */
7160 magic_varargs_p (tree fn
)
7162 if (flag_cilkplus
&& is_cilkplus_reduce_builtin (fn
) != BUILT_IN_NONE
)
7165 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
7166 switch (DECL_FUNCTION_CODE (fn
))
7168 case BUILT_IN_CLASSIFY_TYPE
:
7169 case BUILT_IN_CONSTANT_P
:
7170 case BUILT_IN_NEXT_ARG
:
7171 case BUILT_IN_VA_START
:
7174 case BUILT_IN_ADD_OVERFLOW_P
:
7175 case BUILT_IN_SUB_OVERFLOW_P
:
7176 case BUILT_IN_MUL_OVERFLOW_P
:
7180 return lookup_attribute ("type generic",
7181 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
7187 /* Returns the decl of the dispatcher function if FN is a function version. */
7190 get_function_version_dispatcher (tree fn
)
7192 tree dispatcher_decl
= NULL
;
7194 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7195 && DECL_FUNCTION_VERSIONED (fn
));
7197 gcc_assert (targetm
.get_function_versions_dispatcher
);
7198 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
7200 if (dispatcher_decl
== NULL
)
7202 error_at (input_location
, "use of multiversioned function "
7203 "without a default");
7207 retrofit_lang_decl (dispatcher_decl
);
7208 gcc_assert (dispatcher_decl
!= NULL
);
7209 return dispatcher_decl
;
7212 /* fn is a function version dispatcher that is marked used. Mark all the
7213 semantically identical function versions it will dispatch as used. */
7216 mark_versions_used (tree fn
)
7218 struct cgraph_node
*node
;
7219 struct cgraph_function_version_info
*node_v
;
7220 struct cgraph_function_version_info
*it_v
;
7222 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7224 node
= cgraph_node::get (fn
);
7228 gcc_assert (node
->dispatcher_function
);
7230 node_v
= node
->function_version ();
7234 /* All semantically identical versions are chained. Traverse and mark each
7235 one of them as used. */
7236 it_v
= node_v
->next
;
7237 while (it_v
!= NULL
)
7239 mark_used (it_v
->this_node
->decl
);
7244 /* Build a call to "the copy constructor" for the type of A, even if it
7245 wouldn't be selected by normal overload resolution. Used for
7249 call_copy_ctor (tree a
, tsubst_flags_t complain
)
7251 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
7252 tree binfo
= TYPE_BINFO (ctype
);
7253 tree copy
= get_copy_ctor (ctype
, complain
);
7254 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7255 tree ob
= build_dummy_object (ctype
);
7256 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7257 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7258 LOOKUP_NORMAL
, NULL
, complain
);
7259 release_tree_vector (args
);
7263 /* Return true iff T refers to a base field. */
7266 is_base_field_ref (tree t
)
7269 if (TREE_CODE (t
) == ADDR_EXPR
)
7270 t
= TREE_OPERAND (t
, 0);
7271 if (TREE_CODE (t
) == COMPONENT_REF
)
7272 t
= TREE_OPERAND (t
, 1);
7273 if (TREE_CODE (t
) == FIELD_DECL
)
7274 return DECL_FIELD_IS_BASE (t
);
7278 /* We can't elide a copy from a function returning by value to a base
7279 subobject, as the callee might clobber tail padding. Return true iff this
7280 could be that case. */
7283 unsafe_copy_elision_p (tree target
, tree exp
)
7285 /* Copy elision only happens with a TARGET_EXPR. */
7286 if (TREE_CODE (exp
) != TARGET_EXPR
)
7288 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
7289 /* It's safe to elide the copy for a class with no tail padding. */
7290 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
7292 /* It's safe to elide the copy if we aren't initializing a base object. */
7293 if (!is_base_field_ref (target
))
7295 tree init
= TARGET_EXPR_INITIAL (exp
);
7296 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7297 while (TREE_CODE (init
) == COMPOUND_EXPR
)
7298 init
= TREE_OPERAND (init
, 1);
7299 return (TREE_CODE (init
) == AGGR_INIT_EXPR
7300 && !AGGR_INIT_VIA_CTOR_P (init
));
7303 /* Subroutine of the various build_*_call functions. Overload resolution
7304 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7305 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7306 bitmask of various LOOKUP_* flags which apply to the call itself. */
7309 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
7312 const vec
<tree
, va_gc
> *args
= cand
->args
;
7313 tree first_arg
= cand
->first_arg
;
7314 conversion
**convs
= cand
->convs
;
7316 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7321 unsigned int arg_index
= 0;
7325 bool already_used
= false;
7327 /* In a template, there is no need to perform all of the work that
7328 is normally done. We are only interested in the type of the call
7329 expression, i.e., the return type of the function. Any semantic
7330 errors will be deferred until the template is instantiated. */
7331 if (processing_template_decl
)
7335 const tree
*argarray
;
7338 return_type
= TREE_TYPE (TREE_TYPE (fn
));
7339 nargs
= vec_safe_length (args
);
7340 if (first_arg
== NULL_TREE
)
7341 argarray
= args
->address ();
7349 alcarray
= XALLOCAVEC (tree
, nargs
);
7350 alcarray
[0] = build_this (first_arg
);
7351 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
7352 alcarray
[ix
+ 1] = arg
;
7353 argarray
= alcarray
;
7356 addr
= build_addr_func (fn
, complain
);
7357 if (addr
== error_mark_node
)
7358 return error_mark_node
;
7359 expr
= build_call_array_loc (input_location
, return_type
,
7360 addr
, nargs
, argarray
);
7361 if (TREE_THIS_VOLATILE (fn
) && cfun
)
7362 current_function_returns_abnormally
= 1;
7363 return convert_from_reference (expr
);
7366 /* Give any warnings we noticed during overload resolution. */
7367 if (cand
->warnings
&& (complain
& tf_warning
))
7369 struct candidate_warning
*w
;
7370 for (w
= cand
->warnings
; w
; w
= w
->next
)
7371 joust (cand
, w
->loser
, 1, complain
);
7374 /* Make =delete work with SFINAE. */
7375 if (DECL_DELETED_FN (fn
) && !(complain
& tf_error
))
7376 return error_mark_node
;
7378 if (DECL_FUNCTION_MEMBER_P (fn
))
7381 /* If FN is a template function, two cases must be considered.
7386 template <class T> void f();
7388 template <class T> struct B {
7392 struct C : A, B<int> {
7394 using B<int>::g; // #2
7397 In case #1 where `A::f' is a member template, DECL_ACCESS is
7398 recorded in the primary template but not in its specialization.
7399 We check access of FN using its primary template.
7401 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
7402 because it is a member of class template B, DECL_ACCESS is
7403 recorded in the specialization `B<int>::g'. We cannot use its
7404 primary template because `B<T>::g' and `B<int>::g' may have
7405 different access. */
7406 if (DECL_TEMPLATE_INFO (fn
)
7407 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
7408 access_fn
= DECL_TI_TEMPLATE (fn
);
7411 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
7413 return error_mark_node
;
7416 /* If we're checking for implicit delete, don't bother with argument
7418 if (flags
& LOOKUP_SPECULATIVE
)
7420 if (DECL_DELETED_FN (fn
))
7422 if (complain
& tf_error
)
7424 return error_mark_node
;
7426 if (cand
->viable
== 1)
7428 else if (!(complain
& tf_error
))
7429 /* Reject bad conversions now. */
7430 return error_mark_node
;
7431 /* else continue to get conversion error. */
7434 /* N3276 magic doesn't apply to nested calls. */
7435 int decltype_flag
= (complain
& tf_decltype
);
7436 complain
&= ~tf_decltype
;
7438 /* Find maximum size of vector to hold converted arguments. */
7439 parmlen
= list_length (parm
);
7440 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
7441 if (parmlen
> nargs
)
7443 argarray
= XALLOCAVEC (tree
, nargs
);
7445 /* The implicit parameters to a constructor are not considered by overload
7446 resolution, and must be of the proper type. */
7447 if (DECL_CONSTRUCTOR_P (fn
))
7450 if (first_arg
!= NULL_TREE
)
7452 object_arg
= first_arg
;
7453 first_arg
= NULL_TREE
;
7457 object_arg
= (*args
)[arg_index
];
7460 argarray
[j
++] = build_this (object_arg
);
7461 parm
= TREE_CHAIN (parm
);
7462 /* We should never try to call the abstract constructor. */
7463 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
7465 if (DECL_HAS_VTT_PARM_P (fn
))
7467 argarray
[j
++] = (*args
)[arg_index
];
7469 parm
= TREE_CHAIN (parm
);
7472 /* Bypass access control for 'this' parameter. */
7473 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
7475 tree parmtype
= TREE_VALUE (parm
);
7476 tree arg
= build_this (first_arg
!= NULL_TREE
7478 : (*args
)[arg_index
]);
7479 tree argtype
= TREE_TYPE (arg
);
7483 if (convs
[i
]->bad_p
)
7485 if (complain
& tf_error
)
7487 if (permerror (input_location
, "passing %qT as %<this%> "
7488 "argument discards qualifiers",
7489 TREE_TYPE (argtype
)))
7490 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
7493 return error_mark_node
;
7496 /* See if the function member or the whole class type is declared
7497 final and the call can be devirtualized. */
7498 if (DECL_FINAL_P (fn
)
7499 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
7500 flags
|= LOOKUP_NONVIRTUAL
;
7502 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
7503 X is called for an object that is not of type X, or of a type
7504 derived from X, the behavior is undefined.
7506 So we can assume that anything passed as 'this' is non-null, and
7507 optimize accordingly. */
7508 gcc_assert (TYPE_PTR_P (parmtype
));
7509 /* Convert to the base in which the function was declared. */
7510 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
7511 converted_arg
= build_base_path (PLUS_EXPR
,
7513 cand
->conversion_path
,
7515 /* Check that the base class is accessible. */
7516 if (!accessible_base_p (TREE_TYPE (argtype
),
7517 BINFO_TYPE (cand
->conversion_path
), true))
7519 if (complain
& tf_error
)
7520 error ("%qT is not an accessible base of %qT",
7521 BINFO_TYPE (cand
->conversion_path
),
7522 TREE_TYPE (argtype
));
7524 return error_mark_node
;
7526 /* If fn was found by a using declaration, the conversion path
7527 will be to the derived class, not the base declaring fn. We
7528 must convert from derived to base. */
7529 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
7530 TREE_TYPE (parmtype
), ba_unique
,
7532 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
7533 base_binfo
, 1, complain
);
7535 argarray
[j
++] = converted_arg
;
7536 parm
= TREE_CHAIN (parm
);
7537 if (first_arg
!= NULL_TREE
)
7538 first_arg
= NULL_TREE
;
7545 gcc_assert (first_arg
== NULL_TREE
);
7546 for (; arg_index
< vec_safe_length (args
) && parm
;
7547 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
7549 tree type
= TREE_VALUE (parm
);
7550 tree arg
= (*args
)[arg_index
];
7551 bool conversion_warning
= true;
7555 /* If the argument is NULL and used to (implicitly) instantiate a
7556 template function (and bind one of the template arguments to
7557 the type of 'long int'), we don't want to warn about passing NULL
7558 to non-pointer argument.
7559 For example, if we have this template function:
7561 template<typename T> void func(T x) {}
7563 we want to warn (when -Wconversion is enabled) in this case:
7569 but not in this case:
7575 if (arg
== null_node
7576 && DECL_TEMPLATE_INFO (fn
)
7577 && cand
->template_decl
7578 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
7579 conversion_warning
= false;
7581 /* Warn about initializer_list deduction that isn't currently in the
7583 if (cxx_dialect
> cxx98
7584 && flag_deduce_init_list
7585 && cand
->template_decl
7586 && is_std_init_list (non_reference (type
))
7587 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
7589 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
7590 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
7591 tree patparm
= get_pattern_parm (realparm
, tmpl
);
7592 tree pattype
= TREE_TYPE (patparm
);
7593 if (PACK_EXPANSION_P (pattype
))
7594 pattype
= PACK_EXPANSION_PATTERN (pattype
);
7595 pattype
= non_reference (pattype
);
7597 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
7598 && (cand
->explicit_targs
== NULL_TREE
7599 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
7600 <= TEMPLATE_TYPE_IDX (pattype
))))
7602 pedwarn (input_location
, 0, "deducing %qT as %qT",
7603 non_reference (TREE_TYPE (patparm
)),
7604 non_reference (type
));
7605 pedwarn (DECL_SOURCE_LOCATION (cand
->fn
), 0,
7606 " in call to %qD", cand
->fn
);
7607 pedwarn (input_location
, 0,
7608 " (you can disable this with -fno-deduce-init-list)");
7611 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
7614 : complain
& (~tf_warning
));
7616 val
= convert_for_arg_passing (type
, val
, complain
);
7618 if (val
== error_mark_node
)
7619 return error_mark_node
;
7621 argarray
[j
++] = val
;
7624 /* Default arguments */
7625 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
7627 if (TREE_VALUE (parm
) == error_mark_node
)
7628 return error_mark_node
;
7629 argarray
[j
++] = convert_default_arg (TREE_VALUE (parm
),
7630 TREE_PURPOSE (parm
),
7636 int magic
= magic_varargs_p (fn
);
7637 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
7639 tree a
= (*args
)[arg_index
];
7640 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
7642 /* Do no conversions for certain magic varargs. */
7643 a
= mark_type_use (a
);
7644 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
7645 return error_mark_node
;
7647 else if (magic
!= 0)
7648 /* For other magic varargs only do decay_conversion. */
7649 a
= decay_conversion (a
, complain
);
7650 else if (DECL_CONSTRUCTOR_P (fn
)
7651 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
7654 /* Avoid infinite recursion trying to call A(...). */
7655 if (complain
& tf_error
)
7656 /* Try to call the actual copy constructor for a good error. */
7657 call_copy_ctor (a
, complain
);
7658 return error_mark_node
;
7661 a
= convert_arg_to_ellipsis (a
, complain
);
7662 if (a
== error_mark_node
)
7663 return error_mark_node
;
7667 gcc_assert (j
<= nargs
);
7670 /* Avoid to do argument-transformation, if warnings for format, and for
7671 nonnull are disabled. Just in case that at least one of them is active
7672 the check_function_arguments function might warn about something. */
7674 if (warn_nonnull
|| warn_format
|| warn_suggest_attribute_format
)
7676 tree
*fargs
= (!nargs
? argarray
7677 : (tree
*) alloca (nargs
* sizeof (tree
)));
7678 for (j
= 0; j
< nargs
; j
++)
7679 fargs
[j
] = maybe_constant_value (argarray
[j
]);
7681 check_function_arguments (input_location
, TREE_TYPE (fn
), nargs
, fargs
);
7684 /* Avoid actually calling copy constructors and copy assignment operators,
7687 if (! flag_elide_constructors
)
7688 /* Do things the hard way. */;
7689 else if (cand
->num_convs
== 1
7690 && (DECL_COPY_CONSTRUCTOR_P (fn
)
7691 || DECL_MOVE_CONSTRUCTOR_P (fn
))
7692 /* It's unsafe to elide the constructor when handling
7693 a noexcept-expression, it may evaluate to the wrong
7694 value (c++/53025). */
7695 && cp_noexcept_operand
== 0)
7698 tree arg
= argarray
[num_artificial_parms_for (fn
)];
7700 bool trivial
= trivial_fn_p (fn
);
7702 /* Pull out the real argument, disregarding const-correctness. */
7704 while (CONVERT_EXPR_P (targ
)
7705 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
7706 targ
= TREE_OPERAND (targ
, 0);
7707 if (TREE_CODE (targ
) == ADDR_EXPR
)
7709 targ
= TREE_OPERAND (targ
, 0);
7710 if (!same_type_ignoring_top_level_qualifiers_p
7711 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
7720 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7722 /* [class.copy]: the copy constructor is implicitly defined even if
7723 the implementation elided its use. */
7724 if (!trivial
|| DECL_DELETED_FN (fn
))
7726 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
7727 return error_mark_node
;
7728 already_used
= true;
7731 /* If we're creating a temp and we already have one, don't create a
7732 new one. If we're not creating a temp but we get one, use
7733 INIT_EXPR to collapse the temp into our target. Otherwise, if the
7734 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
7735 temp or an INIT_EXPR otherwise. */
7737 if (is_dummy_object (fa
))
7739 if (TREE_CODE (arg
) == TARGET_EXPR
)
7742 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
7744 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
7745 && !unsafe_copy_elision_p (fa
, arg
))
7747 tree to
= cp_stabilize_reference (cp_build_indirect_ref (fa
,
7751 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
7755 else if (DECL_OVERLOADED_OPERATOR_P (fn
) == NOP_EXPR
7756 && trivial_fn_p (fn
)
7757 && !DECL_DELETED_FN (fn
))
7759 tree to
= cp_stabilize_reference
7760 (cp_build_indirect_ref (argarray
[0], RO_NULL
, complain
));
7761 tree type
= TREE_TYPE (to
);
7762 tree as_base
= CLASSTYPE_AS_BASE (type
);
7763 tree arg
= argarray
[1];
7765 if (is_really_empty_class (type
))
7767 /* Avoid copying empty classes. */
7768 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
7769 TREE_NO_WARNING (val
) = 1;
7771 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
7773 arg
= cp_build_indirect_ref (arg
, RO_NULL
, complain
);
7774 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
7778 /* We must only copy the non-tail padding parts. */
7780 tree array_type
, alias_set
;
7782 arg2
= TYPE_SIZE_UNIT (as_base
);
7783 arg0
= cp_build_addr_expr (to
, complain
);
7785 array_type
= build_array_type (char_type_node
,
7787 (size_binop (MINUS_EXPR
,
7788 arg2
, size_int (1))));
7789 alias_set
= build_int_cst (build_pointer_type (type
), 0);
7790 t
= build2 (MODIFY_EXPR
, void_type_node
,
7791 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
7792 build2 (MEM_REF
, array_type
, arg
, alias_set
));
7793 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
7794 TREE_NO_WARNING (val
) = 1;
7799 else if (DECL_DESTRUCTOR_P (fn
)
7800 && trivial_fn_p (fn
)
7801 && !DECL_DELETED_FN (fn
))
7802 return fold_convert (void_type_node
, argarray
[0]);
7803 /* FIXME handle trivial default constructor, too. */
7805 /* For calls to a multi-versioned function, overload resolution
7806 returns the function with the highest target priority, that is,
7807 the version that will checked for dispatching first. If this
7808 version is inlinable, a direct call to this version can be made
7809 otherwise the call should go through the dispatcher. */
7811 if (DECL_FUNCTION_VERSIONED (fn
)
7812 && (current_function_decl
== NULL
7813 || !targetm
.target_option
.can_inline_p (current_function_decl
, fn
)))
7815 fn
= get_function_version_dispatcher (fn
);
7819 mark_versions_used (fn
);
7823 && !mark_used (fn
, complain
))
7824 return error_mark_node
;
7826 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0
7827 /* Don't mess with virtual lookup in instantiate_non_dependent_expr;
7828 virtual functions can't be constexpr. */
7829 && !in_template_function ())
7832 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
7834 ba_any
, NULL
, complain
);
7835 gcc_assert (binfo
&& binfo
!= error_mark_node
);
7837 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
7839 if (TREE_SIDE_EFFECTS (argarray
[0]))
7840 argarray
[0] = save_expr (argarray
[0]);
7841 t
= build_pointer_type (TREE_TYPE (fn
));
7842 if (DECL_CONTEXT (fn
) && TYPE_JAVA_INTERFACE (DECL_CONTEXT (fn
)))
7843 fn
= build_java_interface_fn_ref (fn
, argarray
[0]);
7845 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
7850 fn
= build_addr_func (fn
, complain
);
7851 if (fn
== error_mark_node
)
7852 return error_mark_node
;
7855 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
7856 if (call
!= error_mark_node
7857 && cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
7859 tree c
= extract_call_expr (call
);
7860 /* build_new_op_1 will clear this when appropriate. */
7861 CALL_EXPR_ORDERED_ARGS (c
) = true;
7866 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
7867 This function performs no overload resolution, conversion, or other
7868 high-level operations. */
7871 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
7872 tsubst_flags_t complain
)
7876 /* Remember roughly where this call is. */
7877 location_t loc
= EXPR_LOC_OR_LOC (fn
, input_location
);
7878 fn
= build_call_a (fn
, nargs
, argarray
);
7879 SET_EXPR_LOCATION (fn
, loc
);
7881 fndecl
= get_callee_fndecl (fn
);
7883 /* Check that arguments to builtin functions match the expectations. */
7885 && DECL_BUILT_IN (fndecl
)
7886 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
7890 /* We need to take care that values to BUILT_IN_NORMAL
7892 for (i
= 0; i
< nargs
; i
++)
7893 argarray
[i
] = fold_non_dependent_expr (argarray
[i
]);
7895 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
7897 return error_mark_node
;
7900 /* If it is a built-in array notation function, then the return type of
7901 the function is the element type of the array passed in as array
7902 notation (i.e. the first parameter of the function). */
7903 if (flag_cilkplus
&& TREE_CODE (fn
) == CALL_EXPR
)
7905 enum built_in_function bif
=
7906 is_cilkplus_reduce_builtin (CALL_EXPR_FN (fn
));
7907 if (bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_ADD
7908 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUL
7909 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MAX
7910 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MIN
7911 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE
7912 || bif
== BUILT_IN_CILKPLUS_SEC_REDUCE_MUTATING
)
7914 if (call_expr_nargs (fn
) == 0)
7916 error_at (EXPR_LOCATION (fn
), "Invalid builtin arguments");
7917 return error_mark_node
;
7919 /* for bif == BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_ZERO or
7920 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_ZERO or
7921 BUILT_IN_CILKPLUS_SEC_REDUCE_ANY_NONZERO or
7922 BUILT_IN_CILKPLUS_SEC_REDUCE_ALL_NONZERO or
7923 BUILT_IN_CILKPLUS_SEC_REDUCE_MIN_IND or
7924 BUILT_IN_CILKPLUS_SEC_REDUCE_MAX_IND
7925 The pre-defined return-type is the correct one. */
7926 tree array_ntn
= CALL_EXPR_ARG (fn
, 0);
7927 TREE_TYPE (fn
) = TREE_TYPE (array_ntn
);
7932 if (VOID_TYPE_P (TREE_TYPE (fn
)))
7935 /* 5.2.2/11: If a function call is a prvalue of object type: if the
7936 function call is either the operand of a decltype-specifier or the
7937 right operand of a comma operator that is the operand of a
7938 decltype-specifier, a temporary object is not introduced for the
7939 prvalue. The type of the prvalue may be incomplete. */
7940 if (!(complain
& tf_decltype
))
7942 fn
= require_complete_type_sfinae (fn
, complain
);
7943 if (fn
== error_mark_node
)
7944 return error_mark_node
;
7946 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
7947 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
7949 return convert_from_reference (fn
);
7952 static GTY(()) tree java_iface_lookup_fn
;
7954 /* Make an expression which yields the address of the Java interface
7955 method FN. This is achieved by generating a call to libjava's
7956 _Jv_LookupInterfaceMethodIdx(). */
7959 build_java_interface_fn_ref (tree fn
, tree instance
)
7961 tree lookup_fn
, method
, idx
;
7962 tree klass_ref
, iface
, iface_ref
;
7965 if (!java_iface_lookup_fn
)
7967 tree ftype
= build_function_type_list (ptr_type_node
,
7968 ptr_type_node
, ptr_type_node
,
7969 java_int_type_node
, NULL_TREE
);
7970 java_iface_lookup_fn
7971 = add_builtin_function ("_Jv_LookupInterfaceMethodIdx", ftype
,
7972 0, NOT_BUILT_IN
, NULL
, NULL_TREE
);
7975 /* Look up the pointer to the runtime java.lang.Class object for `instance'.
7976 This is the first entry in the vtable. */
7977 klass_ref
= build_vtbl_ref (cp_build_indirect_ref (instance
, RO_NULL
,
7978 tf_warning_or_error
),
7981 /* Get the java.lang.Class pointer for the interface being called. */
7982 iface
= DECL_CONTEXT (fn
);
7983 iface_ref
= lookup_field (iface
, get_identifier ("class$"), 0, false);
7984 if (!iface_ref
|| !VAR_P (iface_ref
)
7985 || DECL_CONTEXT (iface_ref
) != iface
)
7987 error ("could not find class$ field in java interface type %qT",
7989 return error_mark_node
;
7991 iface_ref
= build_address (iface_ref
);
7992 iface_ref
= convert (build_pointer_type (iface
), iface_ref
);
7994 /* Determine the itable index of FN. */
7996 for (method
= TYPE_METHODS (iface
); method
; method
= DECL_CHAIN (method
))
7998 if (!DECL_VIRTUAL_P (method
))
8004 idx
= build_int_cst (NULL_TREE
, i
);
8006 lookup_fn
= build1 (ADDR_EXPR
,
8007 build_pointer_type (TREE_TYPE (java_iface_lookup_fn
)),
8008 java_iface_lookup_fn
);
8009 return build_call_nary (ptr_type_node
, lookup_fn
,
8010 3, klass_ref
, iface_ref
, idx
);
8013 /* Returns the value to use for the in-charge parameter when making a
8014 call to a function with the indicated NAME.
8016 FIXME:Can't we find a neater way to do this mapping? */
8019 in_charge_arg_for_name (tree name
)
8021 if (name
== base_ctor_identifier
8022 || name
== base_dtor_identifier
)
8023 return integer_zero_node
;
8024 else if (name
== complete_ctor_identifier
)
8025 return integer_one_node
;
8026 else if (name
== complete_dtor_identifier
)
8027 return integer_two_node
;
8028 else if (name
== deleting_dtor_identifier
)
8029 return integer_three_node
;
8031 /* This function should only be called with one of the names listed
8037 /* Build a call to a constructor, destructor, or an assignment
8038 operator for INSTANCE, an expression with class type. NAME
8039 indicates the special member function to call; *ARGS are the
8040 arguments. ARGS may be NULL. This may change ARGS. BINFO
8041 indicates the base of INSTANCE that is to be passed as the `this'
8042 parameter to the member function called.
8044 FLAGS are the LOOKUP_* flags to use when processing the call.
8046 If NAME indicates a complete object constructor, INSTANCE may be
8047 NULL_TREE. In this case, the caller will call build_cplus_new to
8048 store the newly constructed object into a VAR_DECL. */
8051 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
8052 tree binfo
, int flags
, tsubst_flags_t complain
)
8055 /* The type of the subobject to be constructed or destroyed. */
8057 vec
<tree
, va_gc
> *allocated
= NULL
;
8060 gcc_assert (name
== complete_ctor_identifier
8061 || name
== base_ctor_identifier
8062 || name
== complete_dtor_identifier
8063 || name
== base_dtor_identifier
8064 || name
== deleting_dtor_identifier
8065 || name
== ansi_assopname (NOP_EXPR
));
8068 /* Resolve the name. */
8069 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
8070 return error_mark_node
;
8072 binfo
= TYPE_BINFO (binfo
);
8075 gcc_assert (binfo
!= NULL_TREE
);
8077 class_type
= BINFO_TYPE (binfo
);
8079 /* Handle the special case where INSTANCE is NULL_TREE. */
8080 if (name
== complete_ctor_identifier
&& !instance
)
8081 instance
= build_dummy_object (class_type
);
8084 if (name
== complete_dtor_identifier
8085 || name
== base_dtor_identifier
8086 || name
== deleting_dtor_identifier
)
8087 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
8089 /* Convert to the base class, if necessary. */
8090 if (!same_type_ignoring_top_level_qualifiers_p
8091 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
8093 if (name
!= ansi_assopname (NOP_EXPR
))
8094 /* For constructors and destructors, either the base is
8095 non-virtual, or it is virtual but we are doing the
8096 conversion from a constructor or destructor for the
8097 complete object. In either case, we can convert
8099 instance
= convert_to_base_statically (instance
, binfo
);
8101 /* However, for assignment operators, we must convert
8102 dynamically if the base is virtual. */
8103 instance
= build_base_path (PLUS_EXPR
, instance
,
8104 binfo
, /*nonnull=*/1, complain
);
8108 gcc_assert (instance
!= NULL_TREE
);
8110 fns
= lookup_fnfields (binfo
, name
, 1);
8112 /* When making a call to a constructor or destructor for a subobject
8113 that uses virtual base classes, pass down a pointer to a VTT for
8115 if ((name
== base_ctor_identifier
8116 || name
== base_dtor_identifier
)
8117 && CLASSTYPE_VBASECLASSES (class_type
))
8122 /* If the current function is a complete object constructor
8123 or destructor, then we fetch the VTT directly.
8124 Otherwise, we look it up using the VTT we were given. */
8125 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
8126 vtt
= decay_conversion (vtt
, complain
);
8127 if (vtt
== error_mark_node
)
8128 return error_mark_node
;
8129 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
8130 if (BINFO_SUBVTT_INDEX (binfo
))
8131 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
8137 allocated
= make_tree_vector ();
8141 vec_safe_insert (*args
, 0, sub_vtt
);
8144 ret
= build_new_method_call (instance
, fns
, args
,
8145 TYPE_BINFO (BINFO_TYPE (binfo
)),
8149 if (allocated
!= NULL
)
8150 release_tree_vector (allocated
);
8152 if ((complain
& tf_error
)
8153 && (flags
& LOOKUP_DELEGATING_CONS
)
8154 && name
== complete_ctor_identifier
8155 && TREE_CODE (ret
) == CALL_EXPR
8156 && (DECL_ABSTRACT_ORIGIN (TREE_OPERAND (CALL_EXPR_FN (ret
), 0))
8157 == current_function_decl
))
8158 error ("constructor delegates to itself");
8163 /* Return the NAME, as a C string. The NAME indicates a function that
8164 is a member of TYPE. *FREE_P is set to true if the caller must
8165 free the memory returned.
8167 Rather than go through all of this, we should simply set the names
8168 of constructors and destructors appropriately, and dispense with
8169 ctor_identifier, dtor_identifier, etc. */
8172 name_as_c_string (tree name
, tree type
, bool *free_p
)
8176 /* Assume that we will not allocate memory. */
8178 /* Constructors and destructors are special. */
8179 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
8182 = CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
))));
8183 /* For a destructor, add the '~'. */
8184 if (name
== complete_dtor_identifier
8185 || name
== base_dtor_identifier
8186 || name
== deleting_dtor_identifier
)
8188 pretty_name
= concat ("~", pretty_name
, NULL
);
8189 /* Remember that we need to free the memory allocated. */
8193 else if (IDENTIFIER_TYPENAME_P (name
))
8195 pretty_name
= concat ("operator ",
8196 type_as_string_translate (TREE_TYPE (name
),
8197 TFF_PLAIN_IDENTIFIER
),
8199 /* Remember that we need to free the memory allocated. */
8203 pretty_name
= CONST_CAST (char *, identifier_to_locale (IDENTIFIER_POINTER (name
)));
8208 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
8209 be set, upon return, to the function called. ARGS may be NULL.
8210 This may change ARGS. */
8213 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
8214 tree conversion_path
, int flags
,
8215 tree
*fn_p
, tsubst_flags_t complain
)
8217 struct z_candidate
*candidates
= 0, *cand
;
8218 tree explicit_targs
= NULL_TREE
;
8219 tree basetype
= NULL_TREE
;
8220 tree access_binfo
, binfo
;
8222 tree first_mem_arg
= NULL_TREE
;
8224 bool skip_first_for_error
;
8225 vec
<tree
, va_gc
> *user_args
;
8228 int template_only
= 0;
8232 vec
<tree
, va_gc
> *orig_args
= NULL
;
8235 gcc_assert (instance
!= NULL_TREE
);
8237 /* We don't know what function we're going to call, yet. */
8241 if (error_operand_p (instance
)
8242 || !fns
|| error_operand_p (fns
))
8243 return error_mark_node
;
8245 if (!BASELINK_P (fns
))
8247 if (complain
& tf_error
)
8248 error ("call to non-function %qD", fns
);
8249 return error_mark_node
;
8252 orig_instance
= instance
;
8255 /* Dismantle the baselink to collect all the information we need. */
8256 if (!conversion_path
)
8257 conversion_path
= BASELINK_BINFO (fns
);
8258 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
8259 binfo
= BASELINK_BINFO (fns
);
8260 optype
= BASELINK_OPTYPE (fns
);
8261 fns
= BASELINK_FUNCTIONS (fns
);
8262 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
8264 explicit_targs
= TREE_OPERAND (fns
, 1);
8265 fns
= TREE_OPERAND (fns
, 0);
8268 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
8269 || TREE_CODE (fns
) == TEMPLATE_DECL
8270 || TREE_CODE (fns
) == OVERLOAD
);
8271 fn
= get_first_fn (fns
);
8272 name
= DECL_NAME (fn
);
8274 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
8275 gcc_assert (CLASS_TYPE_P (basetype
));
8277 if (processing_template_decl
)
8279 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
8280 instance
= build_non_dependent_expr (instance
);
8282 make_args_non_dependent (*args
);
8285 user_args
= args
== NULL
? NULL
: *args
;
8286 /* Under DR 147 A::A() is an invalid constructor call,
8287 not a functional cast. */
8288 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
8290 if (! (complain
& tf_error
))
8291 return error_mark_node
;
8293 if (permerror (input_location
,
8294 "cannot call constructor %<%T::%D%> directly",
8296 inform (input_location
, "for a function-style cast, remove the "
8297 "redundant %<::%D%>", name
);
8298 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
8303 /* Figure out whether to skip the first argument for the error
8304 message we will display to users if an error occurs. We don't
8305 want to display any compiler-generated arguments. The "this"
8306 pointer hasn't been added yet. However, we must remove the VTT
8307 pointer if this is a call to a base-class constructor or
8309 skip_first_for_error
= false;
8310 if (IDENTIFIER_CTOR_OR_DTOR_P (name
))
8312 /* Callers should explicitly indicate whether they want to construct
8313 the complete object or just the part without virtual bases. */
8314 gcc_assert (name
!= ctor_identifier
);
8315 /* Similarly for destructors. */
8316 gcc_assert (name
!= dtor_identifier
);
8317 /* Remove the VTT pointer, if present. */
8318 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
8319 && CLASSTYPE_VBASECLASSES (basetype
))
8320 skip_first_for_error
= true;
8323 /* Process the argument list. */
8324 if (args
!= NULL
&& *args
!= NULL
)
8326 *args
= resolve_args (*args
, complain
);
8328 return error_mark_node
;
8331 /* Consider the object argument to be used even if we end up selecting a
8332 static member function. */
8333 instance
= mark_type_use (instance
);
8335 /* It's OK to call destructors and constructors on cv-qualified objects.
8336 Therefore, convert the INSTANCE to the unqualified type, if
8338 if (DECL_DESTRUCTOR_P (fn
)
8339 || DECL_CONSTRUCTOR_P (fn
))
8341 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
8343 instance
= build_this (instance
);
8344 instance
= build_nop (build_pointer_type (basetype
), instance
);
8345 instance
= build_fold_indirect_ref (instance
);
8348 if (DECL_DESTRUCTOR_P (fn
))
8349 name
= complete_dtor_identifier
;
8351 /* For the overload resolution we need to find the actual `this`
8352 that would be captured if the call turns out to be to a
8353 non-static member function. Do not actually capture it at this
8355 if (DECL_CONSTRUCTOR_P (fn
))
8356 /* Constructors don't use the enclosing 'this'. */
8357 first_mem_arg
= instance
;
8359 first_mem_arg
= maybe_resolve_dummy (instance
, false);
8361 /* Get the high-water mark for the CONVERSION_OBSTACK. */
8362 p
= conversion_obstack_alloc (0);
8364 /* The number of arguments artificial parms in ARGS; we subtract one because
8365 there's no 'this' in ARGS. */
8366 unsigned skip
= num_artificial_parms_for (fn
) - 1;
8368 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
8369 initializer, not T({ }). */
8370 if (DECL_CONSTRUCTOR_P (fn
)
8371 && vec_safe_length (user_args
) > skip
8372 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
8374 tree init_list
= (*user_args
)[skip
];
8375 tree init
= NULL_TREE
;
8377 gcc_assert (user_args
->length () == skip
+ 1
8378 && !(flags
& LOOKUP_ONLYCONVERTING
));
8380 /* If the initializer list has no elements and T is a class type with
8381 a default constructor, the object is value-initialized. Handle
8382 this here so we don't need to handle it wherever we use
8383 build_special_member_call. */
8384 if (CONSTRUCTOR_NELTS (init_list
) == 0
8385 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
8386 /* For a user-provided default constructor, use the normal
8387 mechanisms so that protected access works. */
8388 && type_has_non_user_provided_default_constructor (basetype
)
8389 && !processing_template_decl
)
8390 init
= build_value_init (basetype
, complain
);
8392 /* If BASETYPE is an aggregate, we need to do aggregate
8394 else if (CP_AGGREGATE_TYPE_P (basetype
))
8396 init
= reshape_init (basetype
, init_list
, complain
);
8397 init
= digest_init (basetype
, init
, complain
);
8402 if (is_dummy_object (instance
))
8403 return get_target_expr_sfinae (init
, complain
);
8404 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
8405 TREE_SIDE_EFFECTS (init
) = true;
8409 /* Otherwise go ahead with overload resolution. */
8410 add_list_candidates (fns
, first_mem_arg
, user_args
,
8411 basetype
, explicit_targs
, template_only
,
8412 conversion_path
, access_binfo
, flags
,
8413 &candidates
, complain
);
8417 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
8418 explicit_targs
, template_only
, conversion_path
,
8419 access_binfo
, flags
, &candidates
, complain
);
8421 any_viable_p
= false;
8422 candidates
= splice_viable (candidates
, false, &any_viable_p
);
8426 if (complain
& tf_error
)
8428 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
8429 cxx_incomplete_type_error (instance
, basetype
);
8431 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
8432 basetype
, optype
, build_tree_list_vec (user_args
),
8433 TREE_TYPE (instance
));
8440 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
8441 arglist
= build_tree_list_vec (user_args
);
8442 if (skip_first_for_error
)
8443 arglist
= TREE_CHAIN (arglist
);
8444 error ("no matching function for call to %<%T::%s(%A)%#V%>",
8445 basetype
, pretty_name
, arglist
,
8446 TREE_TYPE (instance
));
8450 print_z_candidates (location_of (name
), candidates
);
8452 call
= error_mark_node
;
8456 cand
= tourney (candidates
, complain
);
8463 if (complain
& tf_error
)
8465 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
8466 arglist
= build_tree_list_vec (user_args
);
8467 if (skip_first_for_error
)
8468 arglist
= TREE_CHAIN (arglist
);
8469 if (!any_strictly_viable (candidates
))
8470 error ("no matching function for call to %<%s(%A)%>",
8471 pretty_name
, arglist
);
8473 error ("call of overloaded %<%s(%A)%> is ambiguous",
8474 pretty_name
, arglist
);
8475 print_z_candidates (location_of (name
), candidates
);
8479 call
= error_mark_node
;
8486 if (!(flags
& LOOKUP_NONVIRTUAL
)
8487 && DECL_PURE_VIRTUAL_P (fn
)
8488 && instance
== current_class_ref
8489 && (complain
& tf_warning
))
8491 /* This is not an error, it is runtime undefined
8493 if (!current_function_decl
)
8494 warning (0, "pure virtual %q#D called from "
8495 "non-static data member initializer", fn
);
8496 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
8497 || DECL_DESTRUCTOR_P (current_function_decl
))
8498 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
8499 ? "pure virtual %q#D called from constructor"
8500 : "pure virtual %q#D called from destructor"),
8504 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
8505 && !DECL_CONSTRUCTOR_P (fn
)
8506 && is_dummy_object (instance
))
8508 instance
= maybe_resolve_dummy (instance
, true);
8509 if (instance
== error_mark_node
)
8510 call
= error_mark_node
;
8511 else if (!is_dummy_object (instance
))
8513 /* We captured 'this' in the current lambda now that
8514 we know we really need it. */
8515 cand
->first_arg
= instance
;
8517 else if (any_dependent_bases_p ())
8518 /* We can't tell until instantiation time whether we can use
8519 *this as the implicit object argument. */;
8522 if (complain
& tf_error
)
8523 error ("cannot call member function %qD without object",
8525 call
= error_mark_node
;
8529 if (call
!= error_mark_node
)
8531 /* Optimize away vtable lookup if we know that this
8532 function can't be overridden. We need to check if
8533 the context and the type where we found fn are the same,
8534 actually FN might be defined in a different class
8535 type because of a using-declaration. In this case, we
8536 do not want to perform a non-virtual call. */
8537 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
8538 && same_type_ignoring_top_level_qualifiers_p
8539 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
8540 && resolves_to_fixed_type_p (instance
, 0))
8541 flags
|= LOOKUP_NONVIRTUAL
;
8543 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
8544 /* Now we know what function is being called. */
8547 /* Build the actual CALL_EXPR. */
8548 call
= build_over_call (cand
, flags
, complain
);
8549 /* In an expression of the form `a->f()' where `f' turns
8550 out to be a static member function, `a' is
8551 none-the-less evaluated. */
8552 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
8553 && !is_dummy_object (instance
)
8554 && TREE_SIDE_EFFECTS (instance
))
8555 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
),
8557 else if (call
!= error_mark_node
8558 && DECL_DESTRUCTOR_P (cand
->fn
)
8559 && !VOID_TYPE_P (TREE_TYPE (call
)))
8560 /* An explicit call of the form "x->~X()" has type
8561 "void". However, on platforms where destructors
8562 return "this" (i.e., those where
8563 targetm.cxx.cdtor_returns_this is true), such calls
8564 will appear to have a return value of pointer type
8565 to the low-level call machinery. We do not want to
8566 change the low-level machinery, since we want to be
8567 able to optimize "delete f()" on such platforms as
8568 "operator delete(~X(f()))" (rather than generating
8569 "t = f(), ~X(t), operator delete (t)"). */
8570 call
= build_nop (void_type_node
, call
);
8575 if (processing_template_decl
&& call
!= error_mark_node
)
8577 bool cast_to_void
= false;
8579 if (TREE_CODE (call
) == COMPOUND_EXPR
)
8580 call
= TREE_OPERAND (call
, 1);
8581 else if (TREE_CODE (call
) == NOP_EXPR
)
8583 cast_to_void
= true;
8584 call
= TREE_OPERAND (call
, 0);
8586 if (INDIRECT_REF_P (call
))
8587 call
= TREE_OPERAND (call
, 0);
8588 call
= (build_min_non_dep_call_vec
8590 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
8591 orig_instance
, orig_fns
, NULL_TREE
),
8593 SET_EXPR_LOCATION (call
, input_location
);
8594 call
= convert_from_reference (call
);
8596 call
= build_nop (void_type_node
, call
);
8599 /* Free all the conversions we allocated. */
8600 obstack_free (&conversion_obstack
, p
);
8602 if (orig_args
!= NULL
)
8603 release_tree_vector (orig_args
);
8608 /* Wrapper for above. */
8611 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
8612 tree conversion_path
, int flags
,
8613 tree
*fn_p
, tsubst_flags_t complain
)
8616 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
8617 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
8619 timevar_cond_stop (TV_OVERLOAD
, subtime
);
8623 /* Returns true iff standard conversion sequence ICS1 is a proper
8624 subsequence of ICS2. */
8627 is_subseq (conversion
*ics1
, conversion
*ics2
)
8629 /* We can assume that a conversion of the same code
8630 between the same types indicates a subsequence since we only get
8631 here if the types we are converting from are the same. */
8633 while (ics1
->kind
== ck_rvalue
8634 || ics1
->kind
== ck_lvalue
)
8635 ics1
= next_conversion (ics1
);
8639 while (ics2
->kind
== ck_rvalue
8640 || ics2
->kind
== ck_lvalue
)
8641 ics2
= next_conversion (ics2
);
8643 if (ics2
->kind
== ck_user
8644 || ics2
->kind
== ck_ambig
8645 || ics2
->kind
== ck_aggr
8646 || ics2
->kind
== ck_list
8647 || ics2
->kind
== ck_identity
)
8648 /* At this point, ICS1 cannot be a proper subsequence of
8649 ICS2. We can get a USER_CONV when we are comparing the
8650 second standard conversion sequence of two user conversion
8654 ics2
= next_conversion (ics2
);
8656 if (ics2
->kind
== ics1
->kind
8657 && same_type_p (ics2
->type
, ics1
->type
)
8658 && same_type_p (next_conversion (ics2
)->type
,
8659 next_conversion (ics1
)->type
))
8664 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
8665 be any _TYPE nodes. */
8668 is_properly_derived_from (tree derived
, tree base
)
8670 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
8673 /* We only allow proper derivation here. The DERIVED_FROM_P macro
8674 considers every class derived from itself. */
8675 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
8676 && DERIVED_FROM_P (base
, derived
));
8679 /* We build the ICS for an implicit object parameter as a pointer
8680 conversion sequence. However, such a sequence should be compared
8681 as if it were a reference conversion sequence. If ICS is the
8682 implicit conversion sequence for an implicit object parameter,
8683 modify it accordingly. */
8686 maybe_handle_implicit_object (conversion
**ics
)
8690 /* [over.match.funcs]
8692 For non-static member functions, the type of the
8693 implicit object parameter is "reference to cv X"
8694 where X is the class of which the function is a
8695 member and cv is the cv-qualification on the member
8696 function declaration. */
8697 conversion
*t
= *ics
;
8698 tree reference_type
;
8700 /* The `this' parameter is a pointer to a class type. Make the
8701 implicit conversion talk about a reference to that same class
8703 reference_type
= TREE_TYPE (t
->type
);
8704 reference_type
= build_reference_type (reference_type
);
8706 if (t
->kind
== ck_qual
)
8707 t
= next_conversion (t
);
8708 if (t
->kind
== ck_ptr
)
8709 t
= next_conversion (t
);
8710 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
8711 t
= direct_reference_binding (reference_type
, t
);
8713 t
->rvaluedness_matches_p
= 0;
8718 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
8719 and return the initial reference binding conversion. Otherwise,
8720 leave *ICS unchanged and return NULL. */
8723 maybe_handle_ref_bind (conversion
**ics
)
8725 if ((*ics
)->kind
== ck_ref_bind
)
8727 conversion
*old_ics
= *ics
;
8728 *ics
= next_conversion (old_ics
);
8729 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
8736 /* Compare two implicit conversion sequences according to the rules set out in
8737 [over.ics.rank]. Return values:
8739 1: ics1 is better than ics2
8740 -1: ics2 is better than ics1
8741 0: ics1 and ics2 are indistinguishable */
8744 compare_ics (conversion
*ics1
, conversion
*ics2
)
8750 tree deref_from_type1
= NULL_TREE
;
8751 tree deref_from_type2
= NULL_TREE
;
8752 tree deref_to_type1
= NULL_TREE
;
8753 tree deref_to_type2
= NULL_TREE
;
8754 conversion_rank rank1
, rank2
;
8756 /* REF_BINDING is nonzero if the result of the conversion sequence
8757 is a reference type. In that case REF_CONV is the reference
8758 binding conversion. */
8759 conversion
*ref_conv1
;
8760 conversion
*ref_conv2
;
8762 /* Compare badness before stripping the reference conversion. */
8763 if (ics1
->bad_p
> ics2
->bad_p
)
8765 else if (ics1
->bad_p
< ics2
->bad_p
)
8768 /* Handle implicit object parameters. */
8769 maybe_handle_implicit_object (&ics1
);
8770 maybe_handle_implicit_object (&ics2
);
8772 /* Handle reference parameters. */
8773 ref_conv1
= maybe_handle_ref_bind (&ics1
);
8774 ref_conv2
= maybe_handle_ref_bind (&ics2
);
8776 /* List-initialization sequence L1 is a better conversion sequence than
8777 list-initialization sequence L2 if L1 converts to
8778 std::initializer_list<X> for some X and L2 does not. */
8779 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
8781 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
8786 When comparing the basic forms of implicit conversion sequences (as
8787 defined in _over.best.ics_)
8789 --a standard conversion sequence (_over.ics.scs_) is a better
8790 conversion sequence than a user-defined conversion sequence
8791 or an ellipsis conversion sequence, and
8793 --a user-defined conversion sequence (_over.ics.user_) is a
8794 better conversion sequence than an ellipsis conversion sequence
8795 (_over.ics.ellipsis_). */
8796 /* Use BAD_CONVERSION_RANK because we already checked for a badness
8797 mismatch. If both ICS are bad, we try to make a decision based on
8798 what would have happened if they'd been good. This is not an
8799 extension, we'll still give an error when we build up the call; this
8800 just helps us give a more helpful error message. */
8801 rank1
= BAD_CONVERSION_RANK (ics1
);
8802 rank2
= BAD_CONVERSION_RANK (ics2
);
8806 else if (rank1
< rank2
)
8809 if (ics1
->ellipsis_p
)
8810 /* Both conversions are ellipsis conversions. */
8813 /* User-defined conversion sequence U1 is a better conversion sequence
8814 than another user-defined conversion sequence U2 if they contain the
8815 same user-defined conversion operator or constructor and if the sec-
8816 ond standard conversion sequence of U1 is better than the second
8817 standard conversion sequence of U2. */
8819 /* Handle list-conversion with the same code even though it isn't always
8820 ranked as a user-defined conversion and it doesn't have a second
8821 standard conversion sequence; it will still have the desired effect.
8822 Specifically, we need to do the reference binding comparison at the
8823 end of this function. */
8825 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
8830 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
8831 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
8832 || t1
->kind
== ck_list
)
8834 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
8835 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
8836 || t2
->kind
== ck_list
)
8839 if (t1
->kind
!= t2
->kind
)
8841 else if (t1
->kind
== ck_user
)
8843 if (t1
->cand
->fn
!= t2
->cand
->fn
)
8848 /* For ambiguous or aggregate conversions, use the target type as
8849 a proxy for the conversion function. */
8850 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
8854 /* We can just fall through here, after setting up
8855 FROM_TYPE1 and FROM_TYPE2. */
8856 from_type1
= t1
->type
;
8857 from_type2
= t2
->type
;
8864 /* We're dealing with two standard conversion sequences.
8868 Standard conversion sequence S1 is a better conversion
8869 sequence than standard conversion sequence S2 if
8871 --S1 is a proper subsequence of S2 (comparing the conversion
8872 sequences in the canonical form defined by _over.ics.scs_,
8873 excluding any Lvalue Transformation; the identity
8874 conversion sequence is considered to be a subsequence of
8875 any non-identity conversion sequence */
8878 while (t1
->kind
!= ck_identity
)
8879 t1
= next_conversion (t1
);
8880 from_type1
= t1
->type
;
8883 while (t2
->kind
!= ck_identity
)
8884 t2
= next_conversion (t2
);
8885 from_type2
= t2
->type
;
8888 /* One sequence can only be a subsequence of the other if they start with
8889 the same type. They can start with different types when comparing the
8890 second standard conversion sequence in two user-defined conversion
8892 if (same_type_p (from_type1
, from_type2
))
8894 if (is_subseq (ics1
, ics2
))
8896 if (is_subseq (ics2
, ics1
))
8904 --the rank of S1 is better than the rank of S2 (by the rules
8907 Standard conversion sequences are ordered by their ranks: an Exact
8908 Match is a better conversion than a Promotion, which is a better
8909 conversion than a Conversion.
8911 Two conversion sequences with the same rank are indistinguishable
8912 unless one of the following rules applies:
8914 --A conversion that does not a convert a pointer, pointer to member,
8915 or std::nullptr_t to bool is better than one that does.
8917 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
8918 so that we do not have to check it explicitly. */
8919 if (ics1
->rank
< ics2
->rank
)
8921 else if (ics2
->rank
< ics1
->rank
)
8924 to_type1
= ics1
->type
;
8925 to_type2
= ics2
->type
;
8927 /* A conversion from scalar arithmetic type to complex is worse than a
8928 conversion between scalar arithmetic types. */
8929 if (same_type_p (from_type1
, from_type2
)
8930 && ARITHMETIC_TYPE_P (from_type1
)
8931 && ARITHMETIC_TYPE_P (to_type1
)
8932 && ARITHMETIC_TYPE_P (to_type2
)
8933 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
8934 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
8936 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
8942 if (TYPE_PTR_P (from_type1
)
8943 && TYPE_PTR_P (from_type2
)
8944 && TYPE_PTR_P (to_type1
)
8945 && TYPE_PTR_P (to_type2
))
8947 deref_from_type1
= TREE_TYPE (from_type1
);
8948 deref_from_type2
= TREE_TYPE (from_type2
);
8949 deref_to_type1
= TREE_TYPE (to_type1
);
8950 deref_to_type2
= TREE_TYPE (to_type2
);
8952 /* The rules for pointers to members A::* are just like the rules
8953 for pointers A*, except opposite: if B is derived from A then
8954 A::* converts to B::*, not vice versa. For that reason, we
8955 switch the from_ and to_ variables here. */
8956 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
8957 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
8958 || (TYPE_PTRMEMFUNC_P (from_type1
)
8959 && TYPE_PTRMEMFUNC_P (from_type2
)
8960 && TYPE_PTRMEMFUNC_P (to_type1
)
8961 && TYPE_PTRMEMFUNC_P (to_type2
)))
8963 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
8964 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
8965 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
8966 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
8969 if (deref_from_type1
!= NULL_TREE
8970 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
8971 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
8973 /* This was one of the pointer or pointer-like conversions.
8977 --If class B is derived directly or indirectly from class A,
8978 conversion of B* to A* is better than conversion of B* to
8979 void*, and conversion of A* to void* is better than
8980 conversion of B* to void*. */
8981 if (VOID_TYPE_P (deref_to_type1
)
8982 && VOID_TYPE_P (deref_to_type2
))
8984 if (is_properly_derived_from (deref_from_type1
,
8987 else if (is_properly_derived_from (deref_from_type2
,
8991 else if (VOID_TYPE_P (deref_to_type1
)
8992 || VOID_TYPE_P (deref_to_type2
))
8994 if (same_type_p (deref_from_type1
, deref_from_type2
))
8996 if (VOID_TYPE_P (deref_to_type2
))
8998 if (is_properly_derived_from (deref_from_type1
,
9002 /* We know that DEREF_TO_TYPE1 is `void' here. */
9003 else if (is_properly_derived_from (deref_from_type1
,
9008 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
9009 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
9013 --If class B is derived directly or indirectly from class A
9014 and class C is derived directly or indirectly from B,
9016 --conversion of C* to B* is better than conversion of C* to
9019 --conversion of B* to A* is better than conversion of C* to
9021 if (same_type_p (deref_from_type1
, deref_from_type2
))
9023 if (is_properly_derived_from (deref_to_type1
,
9026 else if (is_properly_derived_from (deref_to_type2
,
9030 else if (same_type_p (deref_to_type1
, deref_to_type2
))
9032 if (is_properly_derived_from (deref_from_type2
,
9035 else if (is_properly_derived_from (deref_from_type1
,
9041 else if (CLASS_TYPE_P (non_reference (from_type1
))
9042 && same_type_p (from_type1
, from_type2
))
9044 tree from
= non_reference (from_type1
);
9048 --binding of an expression of type C to a reference of type
9049 B& is better than binding an expression of type C to a
9050 reference of type A&
9052 --conversion of C to B is better than conversion of C to A, */
9053 if (is_properly_derived_from (from
, to_type1
)
9054 && is_properly_derived_from (from
, to_type2
))
9056 if (is_properly_derived_from (to_type1
, to_type2
))
9058 else if (is_properly_derived_from (to_type2
, to_type1
))
9062 else if (CLASS_TYPE_P (non_reference (to_type1
))
9063 && same_type_p (to_type1
, to_type2
))
9065 tree to
= non_reference (to_type1
);
9069 --binding of an expression of type B to a reference of type
9070 A& is better than binding an expression of type C to a
9071 reference of type A&,
9073 --conversion of B to A is better than conversion of C to A */
9074 if (is_properly_derived_from (from_type1
, to
)
9075 && is_properly_derived_from (from_type2
, to
))
9077 if (is_properly_derived_from (from_type2
, from_type1
))
9079 else if (is_properly_derived_from (from_type1
, from_type2
))
9086 --S1 and S2 differ only in their qualification conversion and yield
9087 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
9088 qualification signature of type T1 is a proper subset of the cv-
9089 qualification signature of type T2 */
9090 if (ics1
->kind
== ck_qual
9091 && ics2
->kind
== ck_qual
9092 && same_type_p (from_type1
, from_type2
))
9094 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
9101 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
9102 to an implicit object parameter of a non-static member function
9103 declared without a ref-qualifier, and either S1 binds an lvalue
9104 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
9105 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
9106 draft standard, 13.3.3.2)
9108 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
9109 types to which the references refer are the same type except for
9110 top-level cv-qualifiers, and the type to which the reference
9111 initialized by S2 refers is more cv-qualified than the type to
9112 which the reference initialized by S1 refers.
9114 DR 1328 [over.match.best]: the context is an initialization by
9115 conversion function for direct reference binding (13.3.1.6) of a
9116 reference to function type, the return type of F1 is the same kind of
9117 reference (i.e. lvalue or rvalue) as the reference being initialized,
9118 and the return type of F2 is not. */
9120 if (ref_conv1
&& ref_conv2
)
9122 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
9123 && (ref_conv1
->rvaluedness_matches_p
9124 != ref_conv2
->rvaluedness_matches_p
)
9125 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
9126 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
9127 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
9129 if (ref_conv1
->bad_p
9130 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
9131 TREE_TYPE (ref_conv2
->type
)))
9132 /* Don't prefer a bad conversion that drops cv-quals to a bad
9133 conversion with the wrong rvalueness. */
9135 return (ref_conv1
->rvaluedness_matches_p
9136 - ref_conv2
->rvaluedness_matches_p
);
9139 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
9141 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
9142 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
9143 if (ref_conv1
->bad_p
)
9145 /* Prefer the one that drops fewer cv-quals. */
9146 tree ftype
= next_conversion (ref_conv1
)->type
;
9147 int fquals
= cp_type_quals (ftype
);
9151 return comp_cv_qualification (q2
, q1
);
9155 /* Neither conversion sequence is better than the other. */
9159 /* The source type for this standard conversion sequence. */
9162 source_type (conversion
*t
)
9164 for (;; t
= next_conversion (t
))
9166 if (t
->kind
== ck_user
9167 || t
->kind
== ck_ambig
9168 || t
->kind
== ck_identity
)
9174 /* Note a warning about preferring WINNER to LOSER. We do this by storing
9175 a pointer to LOSER and re-running joust to produce the warning if WINNER
9176 is actually used. */
9179 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
9181 candidate_warning
*cw
= (candidate_warning
*)
9182 conversion_obstack_alloc (sizeof (candidate_warning
));
9184 cw
->next
= winner
->warnings
;
9185 winner
->warnings
= cw
;
9188 /* Compare two candidates for overloading as described in
9189 [over.match.best]. Return values:
9191 1: cand1 is better than cand2
9192 -1: cand2 is better than cand1
9193 0: cand1 and cand2 are indistinguishable */
9196 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
9197 tsubst_flags_t complain
)
9200 int off1
= 0, off2
= 0;
9204 /* Candidates that involve bad conversions are always worse than those
9206 if (cand1
->viable
> cand2
->viable
)
9208 if (cand1
->viable
< cand2
->viable
)
9211 /* If we have two pseudo-candidates for conversions to the same type,
9212 or two candidates for the same function, arbitrarily pick one. */
9213 if (cand1
->fn
== cand2
->fn
9214 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
9217 /* Prefer a non-deleted function over an implicitly deleted move
9218 constructor or assignment operator. This differs slightly from the
9219 wording for issue 1402 (which says the move op is ignored by overload
9220 resolution), but this way produces better error messages. */
9221 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
9222 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
9223 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
9225 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
9226 && move_fn_p (cand1
->fn
))
9228 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
9229 && move_fn_p (cand2
->fn
))
9233 /* a viable function F1
9234 is defined to be a better function than another viable function F2 if
9235 for all arguments i, ICSi(F1) is not a worse conversion sequence than
9236 ICSi(F2), and then */
9238 /* for some argument j, ICSj(F1) is a better conversion sequence than
9241 /* For comparing static and non-static member functions, we ignore
9242 the implicit object parameter of the non-static function. The
9243 standard says to pretend that the static function has an object
9244 parm, but that won't work with operator overloading. */
9245 len
= cand1
->num_convs
;
9246 if (len
!= cand2
->num_convs
)
9248 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
9249 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
9251 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
9252 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
9253 /* We're comparing a near-match list constructor and a near-match
9254 non-list constructor. Just treat them as unordered. */
9257 gcc_assert (static_1
!= static_2
);
9268 for (i
= 0; i
< len
; ++i
)
9270 conversion
*t1
= cand1
->convs
[i
+ off1
];
9271 conversion
*t2
= cand2
->convs
[i
+ off2
];
9272 int comp
= compare_ics (t1
, t2
);
9276 if ((complain
& tf_warning
)
9278 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
9279 == cr_std
+ cr_promotion
)
9280 && t1
->kind
== ck_std
9281 && t2
->kind
== ck_std
9282 && TREE_CODE (t1
->type
) == INTEGER_TYPE
9283 && TREE_CODE (t2
->type
) == INTEGER_TYPE
9284 && (TYPE_PRECISION (t1
->type
)
9285 == TYPE_PRECISION (t2
->type
))
9286 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
9287 || (TREE_CODE (next_conversion (t1
)->type
)
9290 tree type
= next_conversion (t1
)->type
;
9292 struct z_candidate
*w
, *l
;
9294 type1
= t1
->type
, type2
= t2
->type
,
9295 w
= cand1
, l
= cand2
;
9297 type1
= t2
->type
, type2
= t1
->type
,
9298 w
= cand2
, l
= cand1
;
9302 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
9303 type
, type1
, type2
);
9304 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
9310 if (winner
&& comp
!= winner
)
9319 /* warn about confusing overload resolution for user-defined conversions,
9320 either between a constructor and a conversion op, or between two
9322 if ((complain
& tf_warning
)
9323 && winner
&& warn_conversion
&& cand1
->second_conv
9324 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
9325 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
9327 struct z_candidate
*w
, *l
;
9328 bool give_warning
= false;
9331 w
= cand1
, l
= cand2
;
9333 w
= cand2
, l
= cand1
;
9335 /* We don't want to complain about `X::operator T1 ()'
9336 beating `X::operator T2 () const', when T2 is a no less
9337 cv-qualified version of T1. */
9338 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
9339 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
9341 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
9342 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
9344 if (TREE_CODE (t
) == TREE_CODE (f
) && POINTER_TYPE_P (t
))
9349 if (!comp_ptr_ttypes (t
, f
))
9350 give_warning
= true;
9353 give_warning
= true;
9359 tree source
= source_type (w
->convs
[0]);
9360 if (! DECL_CONSTRUCTOR_P (w
->fn
))
9361 source
= TREE_TYPE (source
);
9362 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
9363 && warning (OPT_Wconversion
, " for conversion from %qT to %qT",
9364 source
, w
->second_conv
->type
))
9366 inform (input_location
, " because conversion sequence for the argument is better");
9376 /* DR 495 moved this tiebreaker above the template ones. */
9378 the context is an initialization by user-defined conversion (see
9379 _dcl.init_ and _over.match.user_) and the standard conversion
9380 sequence from the return type of F1 to the destination type (i.e.,
9381 the type of the entity being initialized) is a better conversion
9382 sequence than the standard conversion sequence from the return type
9383 of F2 to the destination type. */
9385 if (cand1
->second_conv
)
9387 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
9393 F1 is a non-template function and F2 is a template function
9396 if (!cand1
->template_decl
&& cand2
->template_decl
)
9398 else if (cand1
->template_decl
&& !cand2
->template_decl
)
9402 F1 and F2 are template functions and the function template for F1 is
9403 more specialized than the template for F2 according to the partial
9406 if (cand1
->template_decl
&& cand2
->template_decl
)
9408 winner
= more_specialized_fn
9409 (TI_TEMPLATE (cand1
->template_decl
),
9410 TI_TEMPLATE (cand2
->template_decl
),
9411 /* [temp.func.order]: The presence of unused ellipsis and default
9412 arguments has no effect on the partial ordering of function
9413 templates. add_function_candidate() will not have
9414 counted the "this" argument for constructors. */
9415 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
9421 // or, if not that, F1 is more constrained than F2.
9422 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
9424 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
9429 /* Check whether we can discard a builtin candidate, either because we
9430 have two identical ones or matching builtin and non-builtin candidates.
9432 (Pedantically in the latter case the builtin which matched the user
9433 function should not be added to the overload set, but we spot it here.
9436 ... the builtin candidates include ...
9437 - do not have the same parameter type list as any non-template
9438 non-member candidate. */
9440 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
9442 for (i
= 0; i
< len
; ++i
)
9443 if (!same_type_p (cand1
->convs
[i
]->type
,
9444 cand2
->convs
[i
]->type
))
9446 if (i
== cand1
->num_convs
)
9448 if (cand1
->fn
== cand2
->fn
)
9449 /* Two built-in candidates; arbitrarily pick one. */
9451 else if (identifier_p (cand1
->fn
))
9452 /* cand1 is built-in; prefer cand2. */
9455 /* cand2 is built-in; prefer cand1. */
9460 /* For candidates of a multi-versioned function, make the version with
9461 the highest priority win. This version will be checked for dispatching
9462 first. If this version can be inlined into the caller, the front-end
9463 will simply make a direct call to this function. */
9465 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
9466 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
9467 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
9468 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
9470 tree f1
= TREE_TYPE (cand1
->fn
);
9471 tree f2
= TREE_TYPE (cand2
->fn
);
9472 tree p1
= TYPE_ARG_TYPES (f1
);
9473 tree p2
= TYPE_ARG_TYPES (f2
);
9475 /* Check if cand1->fn and cand2->fn are versions of the same function. It
9476 is possible that cand1->fn and cand2->fn are function versions but of
9477 different functions. Check types to see if they are versions of the same
9479 if (compparms (p1
, p2
)
9480 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
9482 /* Always make the version with the higher priority, more
9483 specialized, win. */
9484 gcc_assert (targetm
.compare_version_priority
);
9485 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
9492 /* If the two function declarations represent the same function (this can
9493 happen with declarations in multiple scopes and arg-dependent lookup),
9494 arbitrarily choose one. But first make sure the default args we're
9496 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
9497 && equal_functions (cand1
->fn
, cand2
->fn
))
9499 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
9500 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
9502 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
9504 for (i
= 0; i
< len
; ++i
)
9506 /* Don't crash if the fn is variadic. */
9509 parms1
= TREE_CHAIN (parms1
);
9510 parms2
= TREE_CHAIN (parms2
);
9514 parms1
= TREE_CHAIN (parms1
);
9516 parms2
= TREE_CHAIN (parms2
);
9520 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
9521 TREE_PURPOSE (parms2
)))
9525 if (complain
& tf_error
)
9527 if (permerror (input_location
,
9528 "default argument mismatch in "
9529 "overload resolution"))
9531 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
9532 " candidate 1: %q#F", cand1
->fn
);
9533 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
9534 " candidate 2: %q#F", cand2
->fn
);
9541 add_warning (cand1
, cand2
);
9544 parms1
= TREE_CHAIN (parms1
);
9545 parms2
= TREE_CHAIN (parms2
);
9553 /* Extension: If the worst conversion for one candidate is worse than the
9554 worst conversion for the other, take the first. */
9555 if (!pedantic
&& (complain
& tf_warning_or_error
))
9557 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
9558 struct z_candidate
*w
= 0, *l
= 0;
9560 for (i
= 0; i
< len
; ++i
)
9562 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
9563 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
9564 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
9565 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
9568 winner
= 1, w
= cand1
, l
= cand2
;
9570 winner
= -1, w
= cand2
, l
= cand1
;
9573 /* Don't choose a deleted function over ambiguity. */
9574 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
9578 pedwarn (input_location
, 0,
9579 "ISO C++ says that these are ambiguous, even "
9580 "though the worst conversion for the first is better than "
9581 "the worst conversion for the second:");
9582 print_z_candidate (input_location
, _("candidate 1:"), w
);
9583 print_z_candidate (input_location
, _("candidate 2:"), l
);
9591 gcc_assert (!winner
);
9595 /* Given a list of candidates for overloading, find the best one, if any.
9596 This algorithm has a worst case of O(2n) (winner is last), and a best
9597 case of O(n/2) (totally ambiguous); much better than a sorting
9600 static struct z_candidate
*
9601 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
9603 struct z_candidate
*champ
= candidates
, *challenger
;
9605 int champ_compared_to_predecessor
= 0;
9607 /* Walk through the list once, comparing each current champ to the next
9608 candidate, knocking out a candidate or two with each comparison. */
9610 for (challenger
= champ
->next
; challenger
; )
9612 fate
= joust (champ
, challenger
, 0, complain
);
9614 challenger
= challenger
->next
;
9619 champ
= challenger
->next
;
9622 champ_compared_to_predecessor
= 0;
9627 champ_compared_to_predecessor
= 1;
9630 challenger
= champ
->next
;
9634 /* Make sure the champ is better than all the candidates it hasn't yet
9635 been compared to. */
9637 for (challenger
= candidates
;
9639 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
9640 challenger
= challenger
->next
)
9642 fate
= joust (champ
, challenger
, 0, complain
);
9650 /* Returns nonzero if things of type FROM can be converted to TO. */
9653 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
9655 tree arg
= NULL_TREE
;
9656 /* implicit_conversion only considers user-defined conversions
9657 if it has an expression for the call argument list. */
9658 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
9659 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
9660 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
9663 /* Returns nonzero if things of type FROM can be converted to TO with a
9664 standard conversion. */
9667 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
9669 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
9672 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
9675 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
9676 tsubst_flags_t complain
)
9682 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9683 p
= conversion_obstack_alloc (0);
9684 /* We want to discard any access checks done for this test,
9685 as we might not be in the appropriate access context and
9686 we'll do the check again when we actually perform the
9688 push_deferring_access_checks (dk_deferred
);
9690 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
9692 ok_p
= (t
&& !t
->bad_p
);
9694 /* Discard the access checks now. */
9695 pop_deferring_access_checks ();
9696 /* Free all the conversions we allocated. */
9697 obstack_free (&conversion_obstack
, p
);
9702 /* Like can_convert_arg, but allows dubious conversions as well. */
9705 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
9706 tsubst_flags_t complain
)
9711 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9712 p
= conversion_obstack_alloc (0);
9713 /* Try to perform the conversion. */
9714 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
9716 /* Free all the conversions we allocated. */
9717 obstack_free (&conversion_obstack
, p
);
9722 /* Convert EXPR to TYPE. Return the converted expression.
9724 Note that we allow bad conversions here because by the time we get to
9725 this point we are committed to doing the conversion. If we end up
9726 doing a bad conversion, convert_like will complain. */
9729 perform_implicit_conversion_flags (tree type
, tree expr
,
9730 tsubst_flags_t complain
, int flags
)
9734 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
9736 if (error_operand_p (expr
))
9737 return error_mark_node
;
9739 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9740 p
= conversion_obstack_alloc (0);
9742 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
9748 if (complain
& tf_error
)
9750 /* If expr has unknown type, then it is an overloaded function.
9751 Call instantiate_type to get good error messages. */
9752 if (TREE_TYPE (expr
) == unknown_type_node
)
9753 instantiate_type (type
, expr
, complain
);
9754 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
9755 /* We gave an error. */;
9757 error_at (loc
, "could not convert %qE from %qT to %qT", expr
,
9758 TREE_TYPE (expr
), type
);
9760 expr
= error_mark_node
;
9762 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
9764 /* In a template, we are only concerned about determining the
9765 type of non-dependent expressions, so we do not have to
9766 perform the actual conversion. But for initializers, we
9767 need to be able to perform it at instantiation
9768 (or instantiate_non_dependent_expr) time. */
9769 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
9770 if (!(flags
& LOOKUP_ONLYCONVERTING
))
9771 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
9774 expr
= convert_like (conv
, expr
, complain
);
9776 /* Free all the conversions we allocated. */
9777 obstack_free (&conversion_obstack
, p
);
9783 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
9785 return perform_implicit_conversion_flags (type
, expr
, complain
,
9789 /* Convert EXPR to TYPE (as a direct-initialization) if that is
9790 permitted. If the conversion is valid, the converted expression is
9791 returned. Otherwise, NULL_TREE is returned, except in the case
9792 that TYPE is a class type; in that case, an error is issued. If
9793 C_CAST_P is true, then this direct-initialization is taking
9794 place as part of a static_cast being attempted as part of a C-style
9798 perform_direct_initialization_if_possible (tree type
,
9801 tsubst_flags_t complain
)
9806 if (type
== error_mark_node
|| error_operand_p (expr
))
9807 return error_mark_node
;
9810 If the destination type is a (possibly cv-qualified) class type:
9812 -- If the initialization is direct-initialization ...,
9813 constructors are considered. ... If no constructor applies, or
9814 the overload resolution is ambiguous, the initialization is
9816 if (CLASS_TYPE_P (type
))
9818 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
9819 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
9820 &args
, type
, LOOKUP_NORMAL
, complain
);
9821 release_tree_vector (args
);
9822 return build_cplus_new (type
, expr
, complain
);
9825 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9826 p
= conversion_obstack_alloc (0);
9828 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
9830 LOOKUP_NORMAL
, complain
);
9831 if (!conv
|| conv
->bad_p
)
9834 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0, 0,
9835 /*issue_conversion_warnings=*/false,
9839 /* Free all the conversions we allocated. */
9840 obstack_free (&conversion_obstack
, p
);
9845 /* When initializing a reference that lasts longer than a full-expression,
9846 this special rule applies:
9850 The temporary to which the reference is bound or the temporary
9851 that is the complete object to which the reference is bound
9852 persists for the lifetime of the reference.
9854 The temporaries created during the evaluation of the expression
9855 initializing the reference, except the temporary to which the
9856 reference is bound, are destroyed at the end of the
9857 full-expression in which they are created.
9859 In that case, we store the converted expression into a new
9860 VAR_DECL in a new scope.
9862 However, we want to be careful not to create temporaries when
9863 they are not required. For example, given:
9866 struct D : public B {};
9870 there is no need to copy the return value from "f"; we can just
9871 extend its lifetime. Similarly, given:
9874 struct T { operator S(); };
9878 we can extend the lifetime of the return value of the conversion
9881 The next several functions are involved in this lifetime extension. */
9883 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
9884 reference is being bound to a temporary. Create and return a new
9885 VAR_DECL with the indicated TYPE; this variable will store the value to
9886 which the reference is bound. */
9889 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
9893 /* Create the variable. */
9894 var
= create_temporary_var (type
);
9896 /* Register the variable. */
9898 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
9900 /* Namespace-scope or local static; give it a mangled name. */
9901 /* FIXME share comdat with decl? */
9904 TREE_STATIC (var
) = TREE_STATIC (decl
);
9905 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
9906 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
9907 name
= mangle_ref_init_variable (decl
);
9908 DECL_NAME (var
) = name
;
9909 SET_DECL_ASSEMBLER_NAME (var
, name
);
9910 var
= pushdecl_top_level (var
);
9913 /* Create a new cleanup level if necessary. */
9914 maybe_push_cleanup_level (type
);
9919 /* EXPR is the initializer for a variable DECL of reference or
9920 std::initializer_list type. Create, push and return a new VAR_DECL
9921 for the initializer so that it will live as long as DECL. Any
9922 cleanup for the new variable is returned through CLEANUP, and the
9923 code to initialize the new variable is returned through INITP. */
9926 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
9933 /* Create the temporary variable. */
9934 type
= TREE_TYPE (expr
);
9935 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
9936 layout_decl (var
, 0);
9937 /* If the rvalue is the result of a function call it will be
9938 a TARGET_EXPR. If it is some other construct (such as a
9939 member access expression where the underlying object is
9940 itself the result of a function call), turn it into a
9941 TARGET_EXPR here. It is important that EXPR be a
9942 TARGET_EXPR below since otherwise the INIT_EXPR will
9943 attempt to make a bitwise copy of EXPR to initialize
9945 if (TREE_CODE (expr
) != TARGET_EXPR
)
9946 expr
= get_target_expr (expr
);
9948 if (TREE_CODE (decl
) == FIELD_DECL
9949 && extra_warnings
&& !TREE_NO_WARNING (decl
))
9951 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
9952 "until the constructor exits", decl
);
9953 TREE_NO_WARNING (decl
) = true;
9956 /* Recursively extend temps in this initializer. */
9957 TARGET_EXPR_INITIAL (expr
)
9958 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
9960 /* Any reference temp has a non-trivial initializer. */
9961 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
9963 /* If the initializer is constant, put it in DECL_INITIAL so we get
9964 static initialization and use in constant expressions. */
9965 init
= maybe_constant_init (expr
);
9966 if (TREE_CONSTANT (init
))
9968 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
9970 /* 5.19 says that a constant expression can include an
9971 lvalue-rvalue conversion applied to "a glvalue of literal type
9972 that refers to a non-volatile temporary object initialized
9973 with a constant expression". Rather than try to communicate
9974 that this VAR_DECL is a temporary, just mark it constexpr.
9976 Currently this is only useful for initializer_list temporaries,
9977 since reference vars can't appear in constant expressions. */
9978 DECL_DECLARED_CONSTEXPR_P (var
) = true;
9979 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
9980 TREE_CONSTANT (var
) = true;
9982 DECL_INITIAL (var
) = init
;
9986 /* Create the INIT_EXPR that will initialize the temporary
9988 init
= split_nonconstant_init (var
, expr
);
9989 if (at_function_scope_p ())
9991 add_decl_expr (var
);
9993 if (TREE_STATIC (var
))
9994 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
9997 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
9999 vec_safe_push (*cleanups
, cleanup
);
10002 /* We must be careful to destroy the temporary only
10003 after its initialization has taken place. If the
10004 initialization throws an exception, then the
10005 destructor should not be run. We cannot simply
10006 transform INIT into something like:
10008 (INIT, ({ CLEANUP_STMT; }))
10010 because emit_local_var always treats the
10011 initializer as a full-expression. Thus, the
10012 destructor would run too early; it would run at the
10013 end of initializing the reference variable, rather
10014 than at the end of the block enclosing the
10015 reference variable.
10017 The solution is to pass back a cleanup expression
10018 which the caller is responsible for attaching to
10019 the statement tree. */
10023 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
10024 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
10026 if (CP_DECL_THREAD_LOCAL_P (var
))
10027 tls_aggregates
= tree_cons (NULL_TREE
, var
,
10030 static_aggregates
= tree_cons (NULL_TREE
, var
,
10031 static_aggregates
);
10034 /* Check whether the dtor is callable. */
10035 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
10037 /* Avoid -Wunused-variable warning (c++/38958). */
10038 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
10040 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
10046 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
10047 initializing a variable of that TYPE. */
10050 initialize_reference (tree type
, tree expr
,
10051 int flags
, tsubst_flags_t complain
)
10055 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
10057 if (type
== error_mark_node
|| error_operand_p (expr
))
10058 return error_mark_node
;
10060 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10061 p
= conversion_obstack_alloc (0);
10063 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
10065 if (!conv
|| conv
->bad_p
)
10067 if (complain
& tf_error
)
10070 convert_like (conv
, expr
, complain
);
10071 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
10072 && !TYPE_REF_IS_RVALUE (type
)
10073 && !lvalue_p (expr
))
10074 error_at (loc
, "invalid initialization of non-const reference of "
10075 "type %qT from an rvalue of type %qT",
10076 type
, TREE_TYPE (expr
));
10078 error_at (loc
, "invalid initialization of reference of type "
10079 "%qT from expression of type %qT", type
,
10082 return error_mark_node
;
10085 if (conv
->kind
== ck_ref_bind
)
10086 /* Perform the conversion. */
10087 expr
= convert_like (conv
, expr
, complain
);
10088 else if (conv
->kind
== ck_ambig
)
10089 /* We gave an error in build_user_type_conversion_1. */
10090 expr
= error_mark_node
;
10092 gcc_unreachable ();
10094 /* Free all the conversions we allocated. */
10095 obstack_free (&conversion_obstack
, p
);
10100 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
10101 which is bound either to a reference or a std::initializer_list. */
10104 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
10109 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
10111 TREE_OPERAND (sub
, 1)
10112 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
10115 if (TREE_CODE (sub
) != ADDR_EXPR
)
10117 /* Deal with binding to a subobject. */
10118 for (p
= &TREE_OPERAND (sub
, 0); TREE_CODE (*p
) == COMPONENT_REF
; )
10119 p
= &TREE_OPERAND (*p
, 0);
10120 if (TREE_CODE (*p
) == TARGET_EXPR
)
10122 tree subinit
= NULL_TREE
;
10123 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
10124 recompute_tree_invariant_for_addr_expr (sub
);
10126 init
= fold_convert (TREE_TYPE (init
), sub
);
10128 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
10133 /* INIT is part of the initializer for DECL. If there are any
10134 reference or initializer lists being initialized, extend their
10135 lifetime to match that of DECL. */
10138 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
10140 tree type
= TREE_TYPE (init
);
10141 if (processing_template_decl
)
10143 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10144 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
10145 else if (is_std_init_list (type
))
10147 /* The temporary array underlying a std::initializer_list
10148 is handled like a reference temporary. */
10150 if (TREE_CODE (ctor
) == TARGET_EXPR
)
10151 ctor
= TARGET_EXPR_INITIAL (ctor
);
10152 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
10154 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
10155 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
10156 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
10159 else if (TREE_CODE (init
) == CONSTRUCTOR
)
10162 constructor_elt
*p
;
10163 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (init
);
10164 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
10165 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
10171 /* Returns true iff an initializer for TYPE could contain temporaries that
10172 need to be extended because they are bound to references or
10173 std::initializer_list. */
10176 type_has_extended_temps (tree type
)
10178 type
= strip_array_types (type
);
10179 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10181 if (CLASS_TYPE_P (type
))
10183 if (is_std_init_list (type
))
10185 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
10186 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
10187 if (type_has_extended_temps (TREE_TYPE (f
)))
10193 /* Returns true iff TYPE is some variant of std::initializer_list. */
10196 is_std_init_list (tree type
)
10198 /* Look through typedefs. */
10199 if (!TYPE_P (type
))
10201 if (cxx_dialect
== cxx98
)
10203 type
= TYPE_MAIN_VARIANT (type
);
10204 return (CLASS_TYPE_P (type
)
10205 && CP_TYPE_CONTEXT (type
) == std_node
10206 && strcmp (TYPE_NAME_STRING (type
), "initializer_list") == 0);
10209 /* Returns true iff DECL is a list constructor: i.e. a constructor which
10210 will accept an argument list of a single std::initializer_list<T>. */
10213 is_list_ctor (tree decl
)
10215 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
10218 if (!args
|| args
== void_list_node
)
10221 arg
= non_reference (TREE_VALUE (args
));
10222 if (!is_std_init_list (arg
))
10225 args
= TREE_CHAIN (args
);
10227 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
10228 /* There are more non-defaulted parms. */
10234 #include "gt-cp-call.h"