1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2019 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"
42 #include "stringpool.h"
44 #include "gcc-rich-location.h"
46 /* The various kinds of conversion. */
48 enum conversion_kind
{
65 /* The rank of the conversion. Order of the enumerals matters; better
66 conversions should come earlier in the list. */
68 enum conversion_rank
{
79 /* An implicit conversion sequence, in the sense of [over.best.ics].
80 The first conversion to be performed is at the end of the chain.
81 That conversion is always a cr_identity conversion. */
84 /* The kind of conversion represented by this step. */
86 /* The rank of this conversion. */
88 BOOL_BITFIELD user_conv_p
: 1;
89 BOOL_BITFIELD ellipsis_p
: 1;
90 BOOL_BITFIELD this_p
: 1;
91 /* True if this conversion would be permitted with a bending of
92 language standards, e.g. disregarding pointer qualifiers or
93 converting integers to pointers. */
94 BOOL_BITFIELD bad_p
: 1;
95 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
96 temporary should be created to hold the result of the
97 conversion. If KIND is ck_ambig or ck_user, true means force
98 copy-initialization. */
99 BOOL_BITFIELD need_temporary_p
: 1;
100 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
101 from a pointer-to-derived to pointer-to-base is being performed. */
102 BOOL_BITFIELD base_p
: 1;
103 /* If KIND is ck_ref_bind, true when either an lvalue reference is
104 being bound to an lvalue expression or an rvalue reference is
105 being bound to an rvalue expression. If KIND is ck_rvalue or ck_base,
106 true when we are treating an lvalue as an rvalue (12.8p33). If
107 ck_identity, we will be binding a reference directly or decaying to
109 BOOL_BITFIELD rvaluedness_matches_p
: 1;
110 BOOL_BITFIELD check_narrowing
: 1;
111 /* Whether check_narrowing should only check TREE_CONSTANTs; used
112 in build_converted_constant_expr. */
113 BOOL_BITFIELD check_narrowing_const_only
: 1;
114 /* The type of the expression resulting from the conversion. */
117 /* The next conversion in the chain. Since the conversions are
118 arranged from outermost to innermost, the NEXT conversion will
119 actually be performed before this conversion. This variant is
120 used only when KIND is neither ck_identity, ck_ambig nor
121 ck_list. Please use the next_conversion function instead
122 of using this field directly. */
124 /* The expression at the beginning of the conversion chain. This
125 variant is used only if KIND is ck_identity or ck_ambig. */
127 /* The array of conversions for an initializer_list, so this
128 variant is used only when KIN D is ck_list. */
131 /* The function candidate corresponding to this conversion
132 sequence. This field is only used if KIND is ck_user. */
133 struct z_candidate
*cand
;
136 #define CONVERSION_RANK(NODE) \
137 ((NODE)->bad_p ? cr_bad \
138 : (NODE)->ellipsis_p ? cr_ellipsis \
139 : (NODE)->user_conv_p ? cr_user \
142 #define BAD_CONVERSION_RANK(NODE) \
143 ((NODE)->ellipsis_p ? cr_ellipsis \
144 : (NODE)->user_conv_p ? cr_user \
147 static struct obstack conversion_obstack
;
148 static bool conversion_obstack_initialized
;
149 struct rejection_reason
;
151 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
152 static int equal_functions (tree
, tree
);
153 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
155 static int compare_ics (conversion
*, conversion
*);
156 static void maybe_warn_class_memaccess (location_t
, tree
,
157 const vec
<tree
, va_gc
> *);
158 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
159 #define convert_like(CONV, EXPR, COMPLAIN) \
160 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
161 /*issue_conversion_warnings=*/true, \
162 /*c_cast_p=*/false, (COMPLAIN))
163 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
164 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
165 /*issue_conversion_warnings=*/true, \
166 /*c_cast_p=*/false, (COMPLAIN))
167 static tree
convert_like_real (conversion
*, tree
, tree
, int, bool,
168 bool, tsubst_flags_t
);
169 static void op_error (const op_location_t
&, enum tree_code
, enum tree_code
,
170 tree
, tree
, tree
, bool);
171 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
173 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
174 static void print_z_candidates (location_t
, struct z_candidate
*);
175 static tree
build_this (tree
);
176 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
177 static bool any_strictly_viable (struct z_candidate
*);
178 static struct z_candidate
*add_template_candidate
179 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
180 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
181 static struct z_candidate
*add_template_candidate_real
182 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
183 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
184 static void add_builtin_candidates
185 (struct z_candidate
**, enum tree_code
, enum tree_code
,
186 tree
, tree
*, int, tsubst_flags_t
);
187 static void add_builtin_candidate
188 (struct z_candidate
**, enum tree_code
, enum tree_code
,
189 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
190 static bool is_complete (tree
);
191 static void build_builtin_candidate
192 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
193 int, tsubst_flags_t
);
194 static struct z_candidate
*add_conv_candidate
195 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
196 tree
, tsubst_flags_t
);
197 static struct z_candidate
*add_function_candidate
198 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
199 tree
, int, conversion
**, tsubst_flags_t
);
200 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
202 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
204 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
205 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
206 static conversion
*next_conversion (conversion
*);
207 static bool is_subseq (conversion
*, conversion
*);
208 static conversion
*maybe_handle_ref_bind (conversion
**);
209 static void maybe_handle_implicit_object (conversion
**);
210 static struct z_candidate
*add_candidate
211 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
212 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
213 static tree
source_type (conversion
*);
214 static void add_warning (struct z_candidate
*, struct z_candidate
*);
215 static bool reference_compatible_p (tree
, tree
);
216 static conversion
*direct_reference_binding (tree
, conversion
*);
217 static bool promoted_arithmetic_type_p (tree
);
218 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
219 static char *name_as_c_string (tree
, tree
, bool *);
220 static tree
prep_operand (tree
);
221 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
222 bool, tree
, tree
, int, struct z_candidate
**,
224 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
225 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
227 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
228 NAME can take many forms... */
231 check_dtor_name (tree basetype
, tree name
)
233 /* Just accept something we've already complained about. */
234 if (name
== error_mark_node
)
237 if (TREE_CODE (name
) == TYPE_DECL
)
238 name
= TREE_TYPE (name
);
239 else if (TYPE_P (name
))
241 else if (identifier_p (name
))
243 if ((MAYBE_CLASS_TYPE_P (basetype
)
244 || TREE_CODE (basetype
) == ENUMERAL_TYPE
)
245 && name
== constructor_name (basetype
))
248 name
= get_type_value (name
);
254 template <class T> struct S { ~S(); };
258 NAME will be a class template. */
259 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
263 if (!name
|| name
== error_mark_node
)
265 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
268 /* We want the address of a function or method. We avoid creating a
269 pointer-to-member function. */
272 build_addr_func (tree function
, tsubst_flags_t complain
)
274 tree type
= TREE_TYPE (function
);
276 /* We have to do these by hand to avoid real pointer to member
278 if (TREE_CODE (type
) == METHOD_TYPE
)
280 if (TREE_CODE (function
) == OFFSET_REF
)
282 tree object
= build_address (TREE_OPERAND (function
, 0));
283 return get_member_function_from_ptrfunc (&object
,
284 TREE_OPERAND (function
, 1),
287 function
= build_address (function
);
290 function
= decay_conversion (function
, complain
, /*reject_builtin=*/false);
295 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
296 POINTER_TYPE to those. Note, pointer to member function types
297 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
298 two variants. build_call_a is the primitive taking an array of
299 arguments, while build_call_n is a wrapper that handles varargs. */
302 build_call_n (tree function
, int n
, ...)
305 return build_call_a (function
, 0, NULL
);
308 tree
*argarray
= XALLOCAVEC (tree
, n
);
313 for (i
= 0; i
< n
; i
++)
314 argarray
[i
] = va_arg (ap
, tree
);
316 return build_call_a (function
, n
, argarray
);
320 /* Update various flags in cfun and the call itself based on what is being
321 called. Split out of build_call_a so that bot_manip can use it too. */
324 set_flags_from_callee (tree call
)
326 /* Handle both CALL_EXPRs and AGGR_INIT_EXPRs. */
327 tree decl
= cp_get_callee_fndecl_nofold (call
);
329 /* We check both the decl and the type; a function may be known not to
330 throw without being declared throw(). */
331 bool nothrow
= decl
&& TREE_NOTHROW (decl
);
332 tree callee
= cp_get_callee (call
);
334 nothrow
|= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (callee
)));
335 else if (TREE_CODE (call
) == CALL_EXPR
336 && internal_fn_flags (CALL_EXPR_IFN (call
)) & ECF_NOTHROW
)
339 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
340 cp_function_chain
->can_throw
= 1;
342 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
343 current_function_returns_abnormally
= 1;
345 TREE_NOTHROW (call
) = nothrow
;
349 build_call_a (tree function
, int n
, tree
*argarray
)
356 function
= build_addr_func (function
, tf_warning_or_error
);
358 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
359 fntype
= TREE_TYPE (TREE_TYPE (function
));
360 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
361 || TREE_CODE (fntype
) == METHOD_TYPE
);
362 result_type
= TREE_TYPE (fntype
);
363 /* An rvalue has no cv-qualifiers. */
364 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
365 result_type
= cv_unqualified (result_type
);
367 function
= build_call_array_loc (input_location
,
368 result_type
, function
, n
, argarray
);
369 set_flags_from_callee (function
);
371 decl
= get_callee_fndecl (function
);
373 if (decl
&& !TREE_USED (decl
))
375 /* We invoke build_call directly for several library
376 functions. These may have been declared normally if
377 we're building libgcc, so we can't just check
379 gcc_assert (DECL_ARTIFICIAL (decl
)
380 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
385 require_complete_eh_spec_types (fntype
, decl
);
387 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
389 /* Don't pass empty class objects by value. This is useful
390 for tags in STL, which are used to control overload resolution.
391 We don't need to handle other cases of copying empty classes. */
392 if (!decl
|| !fndecl_built_in_p (decl
))
393 for (i
= 0; i
< n
; i
++)
395 tree arg
= CALL_EXPR_ARG (function
, i
);
396 if (is_empty_class (TREE_TYPE (arg
))
397 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
399 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
400 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
401 CALL_EXPR_ARG (function
, i
) = arg
;
408 /* New overloading code. */
412 struct candidate_warning
{
414 candidate_warning
*next
;
417 /* Information for providing diagnostics about why overloading failed. */
419 enum rejection_reason_code
{
422 rr_explicit_conversion
,
423 rr_template_conversion
,
425 rr_bad_arg_conversion
,
426 rr_template_unification
,
429 rr_constraint_failure
432 struct conversion_info
{
433 /* The index of the argument, 0-based. */
435 /* The actual argument or its type. */
437 /* The type of the parameter. */
439 /* The location of the argument. */
443 struct rejection_reason
{
444 enum rejection_reason_code code
;
446 /* Information about an arity mismatch. */
448 /* The expected number of arguments. */
450 /* The actual number of arguments in the call. */
452 /* Whether the call was a varargs call. */
455 /* Information about an argument conversion mismatch. */
456 struct conversion_info conversion
;
457 /* Same, but for bad argument conversions. */
458 struct conversion_info bad_conversion
;
459 /* Information about template unification failures. These are the
460 parameters passed to fn_type_unification. */
468 unification_kind_t strict
;
470 } template_unification
;
471 /* Information about template instantiation failures. These are the
472 parameters passed to instantiate_template. */
476 } template_instantiation
;
481 /* The FUNCTION_DECL that will be called if this candidate is
482 selected by overload resolution. */
484 /* If not NULL_TREE, the first argument to use when calling this
487 /* The rest of the arguments to use when calling this function. If
488 there are no further arguments this may be NULL or it may be an
490 const vec
<tree
, va_gc
> *args
;
491 /* The implicit conversion sequences for each of the arguments to
494 /* The number of implicit conversion sequences. */
496 /* If FN is a user-defined conversion, the standard conversion
497 sequence from the type returned by FN to the desired destination
499 conversion
*second_conv
;
500 struct rejection_reason
*reason
;
501 /* If FN is a member function, the binfo indicating the path used to
502 qualify the name of FN at the call site. This path is used to
503 determine whether or not FN is accessible if it is selected by
504 overload resolution. The DECL_CONTEXT of FN will always be a
505 (possibly improper) base of this binfo. */
507 /* If FN is a non-static member function, the binfo indicating the
508 subobject to which the `this' pointer should be converted if FN
509 is selected by overload resolution. The type pointed to by
510 the `this' pointer must correspond to the most derived class
511 indicated by the CONVERSION_PATH. */
512 tree conversion_path
;
515 candidate_warning
*warnings
;
519 /* The flags active in add_candidate. */
523 /* Returns true iff T is a null pointer constant in the sense of
527 null_ptr_cst_p (tree t
)
529 tree type
= TREE_TYPE (t
);
533 A null pointer constant is an integral constant expression
534 (_expr.const_) rvalue of integer type that evaluates to zero or
535 an rvalue of type std::nullptr_t. */
536 if (NULLPTR_TYPE_P (type
))
539 if (cxx_dialect
>= cxx11
)
541 STRIP_ANY_LOCATION_WRAPPER (t
);
543 /* Core issue 903 says only literal 0 is a null pointer constant. */
544 if (TREE_CODE (t
) == INTEGER_CST
545 && !TREE_OVERFLOW (t
)
546 && TREE_CODE (type
) == INTEGER_TYPE
548 && !char_type_p (type
))
551 else if (CP_INTEGRAL_TYPE_P (type
))
553 t
= fold_non_dependent_expr (t
, tf_none
);
555 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
562 /* Returns true iff T is a null member pointer value (4.11). */
565 null_member_pointer_value_p (tree t
)
567 tree type
= TREE_TYPE (t
);
570 else if (TYPE_PTRMEMFUNC_P (type
))
571 return (TREE_CODE (t
) == CONSTRUCTOR
572 && CONSTRUCTOR_NELTS (t
)
573 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
574 else if (TYPE_PTRDATAMEM_P (type
))
575 return integer_all_onesp (t
);
580 /* Returns nonzero if PARMLIST consists of only default parms,
581 ellipsis, and/or undeduced parameter packs. */
584 sufficient_parms_p (const_tree parmlist
)
586 for (; parmlist
&& parmlist
!= void_list_node
;
587 parmlist
= TREE_CHAIN (parmlist
))
588 if (!TREE_PURPOSE (parmlist
)
589 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
594 /* Allocate N bytes of memory from the conversion obstack. The memory
595 is zeroed before being returned. */
598 conversion_obstack_alloc (size_t n
)
601 if (!conversion_obstack_initialized
)
603 gcc_obstack_init (&conversion_obstack
);
604 conversion_obstack_initialized
= true;
606 p
= obstack_alloc (&conversion_obstack
, n
);
611 /* Allocate rejection reasons. */
613 static struct rejection_reason
*
614 alloc_rejection (enum rejection_reason_code code
)
616 struct rejection_reason
*p
;
617 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
622 static struct rejection_reason
*
623 arity_rejection (tree first_arg
, int expected
, int actual
)
625 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
626 int adjust
= first_arg
!= NULL_TREE
;
627 r
->u
.arity
.expected
= expected
- adjust
;
628 r
->u
.arity
.actual
= actual
- adjust
;
632 static struct rejection_reason
*
633 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
,
636 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
637 int adjust
= first_arg
!= NULL_TREE
;
638 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
639 r
->u
.conversion
.from
= from
;
640 r
->u
.conversion
.to_type
= to
;
641 r
->u
.conversion
.loc
= loc
;
645 static struct rejection_reason
*
646 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
,
649 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
650 int adjust
= first_arg
!= NULL_TREE
;
651 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
652 r
->u
.bad_conversion
.from
= from
;
653 r
->u
.bad_conversion
.to_type
= to
;
654 r
->u
.bad_conversion
.loc
= loc
;
658 static struct rejection_reason
*
659 explicit_conversion_rejection (tree from
, tree to
)
661 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
662 r
->u
.conversion
.n_arg
= 0;
663 r
->u
.conversion
.from
= from
;
664 r
->u
.conversion
.to_type
= to
;
665 r
->u
.conversion
.loc
= UNKNOWN_LOCATION
;
669 static struct rejection_reason
*
670 template_conversion_rejection (tree from
, tree to
)
672 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
673 r
->u
.conversion
.n_arg
= 0;
674 r
->u
.conversion
.from
= from
;
675 r
->u
.conversion
.to_type
= to
;
676 r
->u
.conversion
.loc
= UNKNOWN_LOCATION
;
680 static struct rejection_reason
*
681 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
682 const tree
*args
, unsigned int nargs
,
683 tree return_type
, unification_kind_t strict
,
686 size_t args_n_bytes
= sizeof (*args
) * nargs
;
687 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
688 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
689 r
->u
.template_unification
.tmpl
= tmpl
;
690 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
691 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
692 /* Copy args to our own storage. */
693 memcpy (args1
, args
, args_n_bytes
);
694 r
->u
.template_unification
.args
= args1
;
695 r
->u
.template_unification
.nargs
= nargs
;
696 r
->u
.template_unification
.return_type
= return_type
;
697 r
->u
.template_unification
.strict
= strict
;
698 r
->u
.template_unification
.flags
= flags
;
702 static struct rejection_reason
*
703 template_unification_error_rejection (void)
705 return alloc_rejection (rr_template_unification
);
708 static struct rejection_reason
*
709 invalid_copy_with_fn_template_rejection (void)
711 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
715 static struct rejection_reason
*
716 inherited_ctor_rejection (void)
718 struct rejection_reason
*r
= alloc_rejection (rr_inherited_ctor
);
722 // Build a constraint failure record, saving information into the
723 // template_instantiation field of the rejection. If FN is not a template
724 // declaration, the TMPL member is the FN declaration and TARGS is empty.
726 static struct rejection_reason
*
727 constraint_failure (tree fn
)
729 struct rejection_reason
*r
= alloc_rejection (rr_constraint_failure
);
730 if (tree ti
= DECL_TEMPLATE_INFO (fn
))
732 r
->u
.template_instantiation
.tmpl
= TI_TEMPLATE (ti
);
733 r
->u
.template_instantiation
.targs
= TI_ARGS (ti
);
737 r
->u
.template_instantiation
.tmpl
= fn
;
738 r
->u
.template_instantiation
.targs
= NULL_TREE
;
743 /* Dynamically allocate a conversion. */
746 alloc_conversion (conversion_kind kind
)
749 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
754 /* Make sure that all memory on the conversion obstack has been
758 validate_conversion_obstack (void)
760 if (conversion_obstack_initialized
)
761 gcc_assert ((obstack_next_free (&conversion_obstack
)
762 == obstack_base (&conversion_obstack
)));
765 /* Dynamically allocate an array of N conversions. */
768 alloc_conversions (size_t n
)
770 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
774 build_conv (conversion_kind code
, tree type
, conversion
*from
)
777 conversion_rank rank
= CONVERSION_RANK (from
);
779 /* Note that the caller is responsible for filling in t->cand for
780 user-defined conversions. */
781 t
= alloc_conversion (code
);
805 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
806 t
->bad_p
= from
->bad_p
;
811 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
812 specialization of std::initializer_list<T>, if such a conversion is
816 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
818 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
819 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
820 conversion
**subconvs
= alloc_conversions (len
);
825 /* Within a list-initialization we can have more user-defined
827 flags
&= ~LOOKUP_NO_CONVERSION
;
828 /* But no narrowing conversions. */
829 flags
|= LOOKUP_NO_NARROWING
;
831 /* Can't make an array of these types. */
832 if (TYPE_REF_P (elttype
)
833 || TREE_CODE (elttype
) == FUNCTION_TYPE
834 || VOID_TYPE_P (elttype
))
837 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
840 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
841 false, flags
, complain
);
848 t
= alloc_conversion (ck_list
);
850 t
->u
.list
= subconvs
;
853 for (i
= 0; i
< len
; ++i
)
855 conversion
*sub
= subconvs
[i
];
856 if (sub
->rank
> t
->rank
)
858 if (sub
->user_conv_p
)
859 t
->user_conv_p
= true;
867 /* Return the next conversion of the conversion chain (if applicable),
868 or NULL otherwise. Please use this function instead of directly
869 accessing fields of struct conversion. */
872 next_conversion (conversion
*conv
)
875 || conv
->kind
== ck_identity
876 || conv
->kind
== ck_ambig
877 || conv
->kind
== ck_list
)
882 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
883 is a valid aggregate initializer for array type ATYPE. */
886 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
889 tree elttype
= TREE_TYPE (atype
);
890 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
892 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
894 if (TREE_CODE (elttype
) == ARRAY_TYPE
895 && TREE_CODE (val
) == CONSTRUCTOR
)
896 ok
= can_convert_array (elttype
, val
, flags
, complain
);
898 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
906 /* Helper for build_aggr_conv. Return true if FIELD is in PSET, or if
907 FIELD has ANON_AGGR_TYPE_P and any initializable field in there recursively
911 field_in_pset (hash_set
<tree
, true> &pset
, tree field
)
913 if (pset
.contains (field
))
915 if (ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
916 for (field
= TYPE_FIELDS (TREE_TYPE (field
));
917 field
; field
= DECL_CHAIN (field
))
919 field
= next_initializable_field (field
);
920 if (field
== NULL_TREE
)
922 if (field_in_pset (pset
, field
))
928 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
929 aggregate class, if such a conversion is possible. */
932 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
934 unsigned HOST_WIDE_INT i
= 0;
936 tree field
= next_initializable_field (TYPE_FIELDS (type
));
937 tree empty_ctor
= NULL_TREE
;
938 hash_set
<tree
, true> pset
;
940 /* We already called reshape_init in implicit_conversion. */
942 /* The conversions within the init-list aren't affected by the enclosing
943 context; they're always simple copy-initialization. */
944 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
946 /* For designated initializers, verify that each initializer is convertible
947 to corresponding TREE_TYPE (ce->index) and mark those FIELD_DECLs as
948 visited. In the following loop then ignore already visited
950 if (CONSTRUCTOR_IS_DESIGNATED_INIT (ctor
))
953 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), i
, idx
, val
)
955 if (idx
&& TREE_CODE (idx
) == FIELD_DECL
)
957 tree ftype
= TREE_TYPE (idx
);
960 if (TREE_CODE (ftype
) == ARRAY_TYPE
961 && TREE_CODE (val
) == CONSTRUCTOR
)
962 ok
= can_convert_array (ftype
, val
, flags
, complain
);
964 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
969 /* For unions, there should be just one initializer. */
970 if (TREE_CODE (type
) == UNION_TYPE
)
983 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
985 tree ftype
= TREE_TYPE (field
);
989 if (!pset
.is_empty () && field_in_pset (pset
, field
))
991 if (i
< CONSTRUCTOR_NELTS (ctor
))
993 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
996 else if (DECL_INITIAL (field
))
997 val
= get_nsdmi (field
, /*ctor*/false, complain
);
998 else if (TYPE_REF_P (ftype
))
999 /* Value-initialization of reference is ill-formed. */
1003 if (empty_ctor
== NULL_TREE
)
1004 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
1008 if (TREE_CODE (ftype
) == ARRAY_TYPE
1009 && TREE_CODE (val
) == CONSTRUCTOR
)
1010 ok
= can_convert_array (ftype
, val
, flags
, complain
);
1012 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
1018 if (TREE_CODE (type
) == UNION_TYPE
)
1022 if (i
< CONSTRUCTOR_NELTS (ctor
))
1025 c
= alloc_conversion (ck_aggr
);
1028 c
->user_conv_p
= true;
1029 c
->check_narrowing
= true;
1034 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
1035 array type, if such a conversion is possible. */
1038 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
1041 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1042 tree elttype
= TREE_TYPE (type
);
1047 enum conversion_rank rank
= cr_exact
;
1049 /* We might need to propagate the size from the element to the array. */
1050 complete_type (type
);
1052 if (TYPE_DOMAIN (type
)
1053 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
1055 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
1060 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1062 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1065 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1066 false, flags
, complain
);
1070 if (sub
->rank
> rank
)
1072 if (sub
->user_conv_p
)
1078 c
= alloc_conversion (ck_aggr
);
1081 c
->user_conv_p
= user
;
1087 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1088 complex type, if such a conversion is possible. */
1091 build_complex_conv (tree type
, tree ctor
, int flags
,
1092 tsubst_flags_t complain
)
1095 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1096 tree elttype
= TREE_TYPE (type
);
1101 enum conversion_rank rank
= cr_exact
;
1106 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1108 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1111 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1112 false, flags
, complain
);
1116 if (sub
->rank
> rank
)
1118 if (sub
->user_conv_p
)
1124 c
= alloc_conversion (ck_aggr
);
1127 c
->user_conv_p
= user
;
1133 /* Build a representation of the identity conversion from EXPR to
1134 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1137 build_identity_conv (tree type
, tree expr
)
1141 c
= alloc_conversion (ck_identity
);
1148 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1149 were multiple user-defined conversions to accomplish the job.
1150 Build a conversion that indicates that ambiguity. */
1153 build_ambiguous_conv (tree type
, tree expr
)
1157 c
= alloc_conversion (ck_ambig
);
1165 strip_top_quals (tree t
)
1167 if (TREE_CODE (t
) == ARRAY_TYPE
)
1169 return cp_build_qualified_type (t
, 0);
1172 /* Returns the standard conversion path (see [conv]) from type FROM to type
1173 TO, if any. For proper handling of null pointer constants, you must
1174 also pass the expression EXPR to convert from. If C_CAST_P is true,
1175 this conversion is coming from a C-style cast. */
1178 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1179 int flags
, tsubst_flags_t complain
)
1181 enum tree_code fcode
, tcode
;
1183 bool fromref
= false;
1186 to
= non_reference (to
);
1187 if (TYPE_REF_P (from
))
1190 from
= TREE_TYPE (from
);
1193 to
= strip_top_quals (to
);
1194 from
= strip_top_quals (from
);
1196 if (expr
&& type_unknown_p (expr
))
1198 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1200 tsubst_flags_t tflags
= tf_conv
;
1201 expr
= instantiate_type (to
, expr
, tflags
);
1202 if (expr
== error_mark_node
)
1204 from
= TREE_TYPE (expr
);
1206 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1208 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1209 expr
= resolve_nondeduced_context (expr
, complain
);
1210 from
= TREE_TYPE (expr
);
1214 fcode
= TREE_CODE (from
);
1215 tcode
= TREE_CODE (to
);
1217 conv
= build_identity_conv (from
, expr
);
1218 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1220 from
= type_decays_to (from
);
1221 fcode
= TREE_CODE (from
);
1222 /* Tell convert_like_real that we're using the address. */
1223 conv
->rvaluedness_matches_p
= true;
1224 conv
= build_conv (ck_lvalue
, from
, conv
);
1226 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1227 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1228 express the copy constructor call required by copy-initialization. */
1229 else if (fromref
|| (expr
&& obvalue_p (expr
)))
1234 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1237 from
= strip_top_quals (bitfield_type
);
1238 fcode
= TREE_CODE (from
);
1241 conv
= build_conv (ck_rvalue
, from
, conv
);
1242 if (flags
& LOOKUP_PREFER_RVALUE
)
1243 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1244 conv
->rvaluedness_matches_p
= true;
1247 /* Allow conversion between `__complex__' data types. */
1248 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1250 /* The standard conversion sequence to convert FROM to TO is
1251 the standard conversion sequence to perform componentwise
1253 conversion
*part_conv
= standard_conversion
1254 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
,
1259 conv
= build_conv (part_conv
->kind
, to
, conv
);
1260 conv
->rank
= part_conv
->rank
;
1268 if (same_type_p (from
, to
))
1270 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1271 conv
->type
= qualified_to
;
1276 A null pointer constant can be converted to a pointer type; ... A
1277 null pointer constant of integral type can be converted to an
1278 rvalue of type std::nullptr_t. */
1279 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1280 || NULLPTR_TYPE_P (to
))
1281 && ((expr
&& null_ptr_cst_p (expr
))
1282 || NULLPTR_TYPE_P (from
)))
1283 conv
= build_conv (ck_std
, to
, conv
);
1284 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1285 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1287 /* For backwards brain damage compatibility, allow interconversion of
1288 pointers and integers with a pedwarn. */
1289 conv
= build_conv (ck_std
, to
, conv
);
1292 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1294 /* For backwards brain damage compatibility, allow interconversion of
1295 enums and integers with a pedwarn. */
1296 conv
= build_conv (ck_std
, to
, conv
);
1299 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1300 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1305 if (tcode
== POINTER_TYPE
)
1307 to_pointee
= TREE_TYPE (to
);
1308 from_pointee
= TREE_TYPE (from
);
1310 /* Since this is the target of a pointer, it can't have function
1311 qualifiers, so any TYPE_QUALS must be for attributes const or
1312 noreturn. Strip them. */
1313 if (TREE_CODE (to_pointee
) == FUNCTION_TYPE
1314 && TYPE_QUALS (to_pointee
))
1315 to_pointee
= build_qualified_type (to_pointee
, TYPE_UNQUALIFIED
);
1316 if (TREE_CODE (from_pointee
) == FUNCTION_TYPE
1317 && TYPE_QUALS (from_pointee
))
1318 from_pointee
= build_qualified_type (from_pointee
, TYPE_UNQUALIFIED
);
1322 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1323 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1326 if (tcode
== POINTER_TYPE
1327 && same_type_ignoring_top_level_qualifiers_p (from_pointee
,
1330 else if (VOID_TYPE_P (to_pointee
)
1331 && !TYPE_PTRDATAMEM_P (from
)
1332 && TREE_CODE (from_pointee
) != FUNCTION_TYPE
)
1334 tree nfrom
= TREE_TYPE (from
);
1335 /* Don't try to apply restrict to void. */
1336 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1337 from_pointee
= cp_build_qualified_type (void_type_node
, quals
);
1338 from
= build_pointer_type (from_pointee
);
1339 conv
= build_conv (ck_ptr
, from
, conv
);
1341 else if (TYPE_PTRDATAMEM_P (from
))
1343 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1344 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1346 if (same_type_p (fbase
, tbase
))
1347 /* No base conversion needed. */;
1348 else if (DERIVED_FROM_P (fbase
, tbase
)
1349 && (same_type_ignoring_top_level_qualifiers_p
1350 (from_pointee
, to_pointee
)))
1352 from
= build_ptrmem_type (tbase
, from_pointee
);
1353 conv
= build_conv (ck_pmem
, from
, conv
);
1358 else if (CLASS_TYPE_P (from_pointee
)
1359 && CLASS_TYPE_P (to_pointee
)
1362 An rvalue of type "pointer to cv D," where D is a
1363 class type, can be converted to an rvalue of type
1364 "pointer to cv B," where B is a base class (clause
1365 _class.derived_) of D. If B is an inaccessible
1366 (clause _class.access_) or ambiguous
1367 (_class.member.lookup_) base class of D, a program
1368 that necessitates this conversion is ill-formed.
1369 Therefore, we use DERIVED_FROM_P, and do not check
1370 access or uniqueness. */
1371 && DERIVED_FROM_P (to_pointee
, from_pointee
))
1374 = cp_build_qualified_type (to_pointee
,
1375 cp_type_quals (from_pointee
));
1376 from
= build_pointer_type (from_pointee
);
1377 conv
= build_conv (ck_ptr
, from
, conv
);
1378 conv
->base_p
= true;
1381 if (same_type_p (from
, to
))
1383 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1384 /* In a C-style cast, we ignore CV-qualification because we
1385 are allowed to perform a static_cast followed by a
1387 conv
= build_conv (ck_qual
, to
, conv
);
1388 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1389 conv
= build_conv (ck_qual
, to
, conv
);
1390 else if (expr
&& string_conv_p (to
, expr
, 0))
1391 /* converting from string constant to char *. */
1392 conv
= build_conv (ck_qual
, to
, conv
);
1393 else if (fnptr_conv_p (to
, from
))
1394 conv
= build_conv (ck_fnptr
, to
, conv
);
1395 /* Allow conversions among compatible ObjC pointer types (base
1396 conversions have been already handled above). */
1397 else if (c_dialect_objc ()
1398 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1399 conv
= build_conv (ck_ptr
, to
, conv
);
1400 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1402 conv
= build_conv (ck_ptr
, to
, conv
);
1410 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1412 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1413 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1414 tree fbase
= class_of_this_parm (fromfn
);
1415 tree tbase
= class_of_this_parm (tofn
);
1417 if (!DERIVED_FROM_P (fbase
, tbase
))
1420 tree fstat
= static_fn_type (fromfn
);
1421 tree tstat
= static_fn_type (tofn
);
1422 if (same_type_p (tstat
, fstat
)
1423 || fnptr_conv_p (tstat
, fstat
))
1428 if (!same_type_p (fbase
, tbase
))
1430 from
= build_memfn_type (fstat
,
1432 cp_type_quals (tbase
),
1433 type_memfn_rqual (tofn
));
1434 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1435 conv
= build_conv (ck_pmem
, from
, conv
);
1436 conv
->base_p
= true;
1438 if (fnptr_conv_p (tstat
, fstat
))
1439 conv
= build_conv (ck_fnptr
, to
, conv
);
1441 else if (tcode
== BOOLEAN_TYPE
)
1445 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1446 to member type can be converted to a prvalue of type bool. ...
1447 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1448 std::nullptr_t can be converted to a prvalue of type bool; */
1449 if (ARITHMETIC_TYPE_P (from
)
1450 || UNSCOPED_ENUM_P (from
)
1451 || fcode
== POINTER_TYPE
1452 || TYPE_PTRMEM_P (from
)
1453 || NULLPTR_TYPE_P (from
))
1455 conv
= build_conv (ck_std
, to
, conv
);
1456 if (fcode
== POINTER_TYPE
1457 || TYPE_PTRDATAMEM_P (from
)
1458 || (TYPE_PTRMEMFUNC_P (from
)
1459 && conv
->rank
< cr_pbool
)
1460 || NULLPTR_TYPE_P (from
))
1461 conv
->rank
= cr_pbool
;
1462 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1464 if (flags
& LOOKUP_NO_NARROWING
)
1465 conv
->check_narrowing
= true;
1471 /* We don't check for ENUMERAL_TYPE here because there are no standard
1472 conversions to enum type. */
1473 /* As an extension, allow conversion to complex type. */
1474 else if (ARITHMETIC_TYPE_P (to
))
1476 if (! (INTEGRAL_CODE_P (fcode
)
1477 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1478 || SCOPED_ENUM_P (from
))
1481 /* If we're parsing an enum with no fixed underlying type, we're
1482 dealing with an incomplete type, which renders the conversion
1484 if (!COMPLETE_TYPE_P (from
))
1487 conv
= build_conv (ck_std
, to
, conv
);
1489 /* Give this a better rank if it's a promotion. */
1490 if (same_type_p (to
, type_promotes_to (from
))
1491 && next_conversion (conv
)->rank
<= cr_promotion
)
1492 conv
->rank
= cr_promotion
;
1494 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1495 && vector_types_convertible_p (from
, to
, false))
1496 return build_conv (ck_std
, to
, conv
);
1497 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1498 && is_properly_derived_from (from
, to
))
1500 if (conv
->kind
== ck_rvalue
)
1501 conv
= next_conversion (conv
);
1502 conv
= build_conv (ck_base
, to
, conv
);
1503 /* The derived-to-base conversion indicates the initialization
1504 of a parameter with base type from an object of a derived
1505 type. A temporary object is created to hold the result of
1506 the conversion unless we're binding directly to a reference. */
1507 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1508 if (flags
& LOOKUP_PREFER_RVALUE
)
1509 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1510 conv
->rvaluedness_matches_p
= true;
1515 if (flags
& LOOKUP_NO_NARROWING
)
1516 conv
->check_narrowing
= true;
1521 /* Returns nonzero if T1 is reference-related to T2. */
1524 reference_related_p (tree t1
, tree t2
)
1526 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1529 t1
= TYPE_MAIN_VARIANT (t1
);
1530 t2
= TYPE_MAIN_VARIANT (t2
);
1534 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1535 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1537 return (same_type_p (t1
, t2
)
1538 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1539 && DERIVED_FROM_P (t1
, t2
)));
1542 /* Returns nonzero if T1 is reference-compatible with T2. */
1545 reference_compatible_p (tree t1
, tree t2
)
1549 "cv1 T1" is reference compatible with "cv2 T2" if
1550 * T1 is reference-related to T2 or
1551 * T2 is "noexcept function" and T1 is "function", where the
1552 function types are otherwise the same,
1553 and cv1 is the same cv-qualification as, or greater cv-qualification
1555 return ((reference_related_p (t1
, t2
)
1556 || fnptr_conv_p (t1
, t2
))
1557 && at_least_as_qualified_p (t1
, t2
));
1560 /* A reference of the indicated TYPE is being bound directly to the
1561 expression represented by the implicit conversion sequence CONV.
1562 Return a conversion sequence for this binding. */
1565 direct_reference_binding (tree type
, conversion
*conv
)
1569 gcc_assert (TYPE_REF_P (type
));
1570 gcc_assert (!TYPE_REF_P (conv
->type
));
1572 t
= TREE_TYPE (type
);
1574 if (conv
->kind
== ck_identity
)
1575 /* Mark the identity conv as to not decay to rvalue. */
1576 conv
->rvaluedness_matches_p
= true;
1580 When a parameter of reference type binds directly
1581 (_dcl.init.ref_) to an argument expression, the implicit
1582 conversion sequence is the identity conversion, unless the
1583 argument expression has a type that is a derived class of the
1584 parameter type, in which case the implicit conversion sequence is
1585 a derived-to-base Conversion.
1587 If the parameter binds directly to the result of applying a
1588 conversion function to the argument expression, the implicit
1589 conversion sequence is a user-defined conversion sequence
1590 (_over.ics.user_), with the second standard conversion sequence
1591 either an identity conversion or, if the conversion function
1592 returns an entity of a type that is a derived class of the
1593 parameter type, a derived-to-base conversion. */
1594 if (is_properly_derived_from (conv
->type
, t
))
1596 /* Represent the derived-to-base conversion. */
1597 conv
= build_conv (ck_base
, t
, conv
);
1598 /* We will actually be binding to the base-class subobject in
1599 the derived class, so we mark this conversion appropriately.
1600 That way, convert_like knows not to generate a temporary. */
1601 conv
->need_temporary_p
= false;
1604 return build_conv (ck_ref_bind
, type
, conv
);
1607 /* Returns the conversion path from type FROM to reference type TO for
1608 purposes of reference binding. For lvalue binding, either pass a
1609 reference type to FROM or an lvalue expression to EXPR. If the
1610 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1611 the conversion returned. If C_CAST_P is true, this
1612 conversion is coming from a C-style cast. */
1615 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1616 tsubst_flags_t complain
)
1618 conversion
*conv
= NULL
;
1619 tree to
= TREE_TYPE (rto
);
1624 cp_lvalue_kind gl_kind
;
1627 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1629 expr
= instantiate_type (to
, expr
, tf_none
);
1630 if (expr
== error_mark_node
)
1632 from
= TREE_TYPE (expr
);
1635 bool copy_list_init
= false;
1636 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1638 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1639 /* DR 1288: Otherwise, if the initializer list has a single element
1640 of type E and ... [T's] referenced type is reference-related to E,
1641 the object or reference is initialized from that element... */
1642 if (CONSTRUCTOR_NELTS (expr
) == 1)
1644 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1645 if (error_operand_p (elt
))
1647 tree etype
= TREE_TYPE (elt
);
1648 if (reference_related_p (to
, etype
))
1655 /* Otherwise, if T is a reference type, a prvalue temporary of the type
1656 referenced by T is copy-list-initialized, and the reference is bound
1657 to that temporary. */
1658 copy_list_init
= true;
1662 if (TYPE_REF_P (from
))
1664 from
= TREE_TYPE (from
);
1665 if (!TYPE_REF_IS_RVALUE (rfrom
)
1666 || TREE_CODE (from
) == FUNCTION_TYPE
)
1667 gl_kind
= clk_ordinary
;
1669 gl_kind
= clk_rvalueref
;
1672 gl_kind
= lvalue_kind (expr
);
1673 else if (CLASS_TYPE_P (from
)
1674 || TREE_CODE (from
) == ARRAY_TYPE
)
1675 gl_kind
= clk_class
;
1679 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1680 if ((flags
& LOOKUP_NO_TEMP_BIND
)
1681 && (gl_kind
& clk_class
))
1684 /* Same mask as real_lvalue_p. */
1685 is_lvalue
= gl_kind
&& !(gl_kind
& (clk_rvalueref
|clk_class
));
1688 if ((gl_kind
& clk_bitfield
) != 0)
1689 tfrom
= unlowered_expr_type (expr
);
1691 /* Figure out whether or not the types are reference-related and
1692 reference compatible. We have to do this after stripping
1693 references from FROM. */
1694 related_p
= reference_related_p (to
, tfrom
);
1695 /* If this is a C cast, first convert to an appropriately qualified
1696 type, so that we can later do a const_cast to the desired type. */
1697 if (related_p
&& c_cast_p
1698 && !at_least_as_qualified_p (to
, tfrom
))
1699 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1700 compatible_p
= reference_compatible_p (to
, tfrom
);
1702 /* Directly bind reference when target expression's type is compatible with
1703 the reference and expression is an lvalue. In DR391, the wording in
1704 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1705 const and rvalue references to rvalues of compatible class type.
1706 We should also do direct bindings for non-class xvalues. */
1707 if ((related_p
|| compatible_p
) && gl_kind
)
1711 If the initializer expression
1713 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1714 is reference-compatible with "cv2 T2,"
1716 the reference is bound directly to the initializer expression
1720 If the initializer expression is an rvalue, with T2 a class type,
1721 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1722 is bound to the object represented by the rvalue or to a sub-object
1723 within that object. */
1725 conv
= build_identity_conv (tfrom
, expr
);
1726 conv
= direct_reference_binding (rto
, conv
);
1728 if (TYPE_REF_P (rfrom
))
1729 /* Handle rvalue reference to function properly. */
1730 conv
->rvaluedness_matches_p
1731 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1733 conv
->rvaluedness_matches_p
1734 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1736 if ((gl_kind
& clk_bitfield
) != 0
1737 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1738 /* For the purposes of overload resolution, we ignore the fact
1739 this expression is a bitfield or packed field. (In particular,
1740 [over.ics.ref] says specifically that a function with a
1741 non-const reference parameter is viable even if the
1742 argument is a bitfield.)
1744 However, when we actually call the function we must create
1745 a temporary to which to bind the reference. If the
1746 reference is volatile, or isn't const, then we cannot make
1747 a temporary, so we just issue an error when the conversion
1749 conv
->need_temporary_p
= true;
1751 /* Don't allow binding of lvalues (other than function lvalues) to
1752 rvalue references. */
1753 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1754 && TREE_CODE (to
) != FUNCTION_TYPE
)
1757 /* Nor the reverse. */
1758 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1759 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1760 || (flags
& LOOKUP_NO_RVAL_BIND
))
1761 && TREE_CODE (to
) != FUNCTION_TYPE
)
1769 /* [class.conv.fct] A conversion function is never used to convert a
1770 (possibly cv-qualified) object to the (possibly cv-qualified) same
1771 object type (or a reference to it), to a (possibly cv-qualified) base
1772 class of that type (or a reference to it).... */
1773 else if (CLASS_TYPE_P (from
) && !related_p
1774 && !(flags
& LOOKUP_NO_CONVERSION
))
1778 If the initializer expression
1780 -- has a class type (i.e., T2 is a class type) can be
1781 implicitly converted to an lvalue of type "cv3 T3," where
1782 "cv1 T1" is reference-compatible with "cv3 T3". (this
1783 conversion is selected by enumerating the applicable
1784 conversion functions (_over.match.ref_) and choosing the
1785 best one through overload resolution. (_over.match_).
1787 the reference is bound to the lvalue result of the conversion
1788 in the second case. */
1789 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1792 return cand
->second_conv
;
1795 /* From this point on, we conceptually need temporaries, even if we
1796 elide them. Only the cases above are "direct bindings". */
1797 if (flags
& LOOKUP_NO_TEMP_BIND
)
1802 When a parameter of reference type is not bound directly to an
1803 argument expression, the conversion sequence is the one required
1804 to convert the argument expression to the underlying type of the
1805 reference according to _over.best.ics_. Conceptually, this
1806 conversion sequence corresponds to copy-initializing a temporary
1807 of the underlying type with the argument expression. Any
1808 difference in top-level cv-qualification is subsumed by the
1809 initialization itself and does not constitute a conversion. */
1813 Otherwise, the reference shall be an lvalue reference to a
1814 non-volatile const type, or the reference shall be an rvalue
1817 We try below to treat this as a bad conversion to improve diagnostics,
1818 but if TO is an incomplete class, we need to reject this conversion
1819 now to avoid unnecessary instantiation. */
1820 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1821 && !COMPLETE_TYPE_P (to
))
1824 /* We're generating a temporary now, but don't bind any more in the
1825 conversion (specifically, don't slice the temporary returned by a
1826 conversion operator). */
1827 flags
|= LOOKUP_NO_TEMP_BIND
;
1829 /* Core issue 899: When [copy-]initializing a temporary to be bound
1830 to the first parameter of a copy constructor (12.8) called with
1831 a single argument in the context of direct-initialization,
1832 explicit conversion functions are also considered.
1834 So don't set LOOKUP_ONLYCONVERTING in that case. */
1835 if (!(flags
& LOOKUP_COPY_PARM
))
1836 flags
|= LOOKUP_ONLYCONVERTING
;
1839 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1844 if (conv
->user_conv_p
)
1847 /* Remember this was copy-list-initialization. */
1848 conv
->need_temporary_p
= true;
1850 /* If initializing the temporary used a conversion function,
1851 recalculate the second conversion sequence. */
1852 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1853 if (t
->kind
== ck_user
1854 && DECL_CONV_FN_P (t
->cand
->fn
))
1856 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1857 /* A prvalue of non-class type is cv-unqualified. */
1858 if (!TYPE_REF_P (ftype
) && !CLASS_TYPE_P (ftype
))
1859 ftype
= cv_unqualified (ftype
);
1860 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1861 conversion
*new_second
1862 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1866 return merge_conversion_sequences (t
, new_second
);
1870 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1871 /* This reference binding, unlike those above, requires the
1872 creation of a temporary. */
1873 conv
->need_temporary_p
= true;
1874 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1878 Otherwise, the reference shall be an lvalue reference to a
1879 non-volatile const type, or the reference shall be an rvalue
1881 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1886 Otherwise, a temporary of type "cv1 T1" is created and
1887 initialized from the initializer expression using the rules for a
1888 non-reference copy initialization. If T1 is reference-related to
1889 T2, cv1 must be the same cv-qualification as, or greater
1890 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1891 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1897 /* Returns the implicit conversion sequence (see [over.ics]) from type
1898 FROM to type TO. The optional expression EXPR may affect the
1899 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1900 true, this conversion is coming from a C-style cast. */
1903 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1904 int flags
, tsubst_flags_t complain
)
1908 if (from
== error_mark_node
|| to
== error_mark_node
1909 || expr
== error_mark_node
)
1912 /* Other flags only apply to the primary function in overload
1913 resolution, or after we've chosen one. */
1914 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1915 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1916 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1918 /* FIXME: actually we don't want warnings either, but we can't just
1919 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1920 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1921 We really ought not to issue that warning until we've committed
1922 to that conversion. */
1923 complain
&= ~tf_error
;
1925 /* Call reshape_init early to remove redundant braces. */
1926 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1927 && CLASS_TYPE_P (to
)
1928 && COMPLETE_TYPE_P (complete_type (to
))
1929 && !CLASSTYPE_NON_AGGREGATE (to
))
1931 expr
= reshape_init (to
, expr
, complain
);
1932 if (expr
== error_mark_node
)
1934 from
= TREE_TYPE (expr
);
1937 if (TYPE_REF_P (to
))
1938 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1940 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
1945 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1947 if (is_std_init_list (to
) && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr
))
1948 return build_list_conv (to
, expr
, flags
, complain
);
1950 /* As an extension, allow list-initialization of _Complex. */
1951 if (TREE_CODE (to
) == COMPLEX_TYPE
1952 && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr
))
1954 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1959 /* Allow conversion from an initializer-list with one element to a
1961 if (SCALAR_TYPE_P (to
))
1963 int nelts
= CONSTRUCTOR_NELTS (expr
);
1967 elt
= build_value_init (to
, tf_none
);
1968 else if (nelts
== 1 && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr
))
1969 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1971 elt
= error_mark_node
;
1973 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1974 c_cast_p
, flags
, complain
);
1977 conv
->check_narrowing
= true;
1978 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1979 /* Too many levels of braces, i.e. '{{1}}'. */
1984 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1985 return build_array_conv (to
, expr
, flags
, complain
);
1988 if (expr
!= NULL_TREE
1989 && (MAYBE_CLASS_TYPE_P (from
)
1990 || MAYBE_CLASS_TYPE_P (to
))
1991 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1993 struct z_candidate
*cand
;
1995 if (CLASS_TYPE_P (to
)
1996 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1997 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1998 return build_aggr_conv (to
, expr
, flags
, complain
);
2000 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
2003 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
2004 && CONSTRUCTOR_NELTS (expr
) == 1
2005 && !is_list_ctor (cand
->fn
))
2007 /* "If C is not an initializer-list constructor and the
2008 initializer list has a single element of type cv U, where U is
2009 X or a class derived from X, the implicit conversion sequence
2010 has Exact Match rank if U is X, or Conversion rank if U is
2012 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
2013 tree elttype
= TREE_TYPE (elt
);
2014 if (reference_related_p (to
, elttype
))
2015 return implicit_conversion (to
, elttype
, elt
,
2016 c_cast_p
, flags
, complain
);
2018 conv
= cand
->second_conv
;
2021 /* We used to try to bind a reference to a temporary here, but that
2022 is now handled after the recursive call to this function at the end
2023 of reference_binding. */
2030 /* Like implicit_conversion, but return NULL if the conversion is bad.
2032 This is not static so that check_non_deducible_conversion can call it within
2033 add_template_candidate_real as part of overload resolution; it should not be
2034 called outside of overload resolution. */
2037 good_conversion (tree to
, tree from
, tree expr
,
2038 int flags
, tsubst_flags_t complain
)
2040 conversion
*c
= implicit_conversion (to
, from
, expr
, /*cast*/false,
2047 /* Add a new entry to the list of candidates. Used by the add_*_candidate
2048 functions. ARGS will not be changed until a single candidate is
2051 static struct z_candidate
*
2052 add_candidate (struct z_candidate
**candidates
,
2053 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
2054 size_t num_convs
, conversion
**convs
,
2055 tree access_path
, tree conversion_path
,
2056 int viable
, struct rejection_reason
*reason
,
2059 struct z_candidate
*cand
= (struct z_candidate
*)
2060 conversion_obstack_alloc (sizeof (struct z_candidate
));
2063 cand
->first_arg
= first_arg
;
2065 cand
->convs
= convs
;
2066 cand
->num_convs
= num_convs
;
2067 cand
->access_path
= access_path
;
2068 cand
->conversion_path
= conversion_path
;
2069 cand
->viable
= viable
;
2070 cand
->reason
= reason
;
2071 cand
->next
= *candidates
;
2072 cand
->flags
= flags
;
2078 /* Return the number of remaining arguments in the parameter list
2079 beginning with ARG. */
2082 remaining_arguments (tree arg
)
2086 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
2087 arg
= TREE_CHAIN (arg
))
2093 /* [over.match.copy]: When initializing a temporary object (12.2) to be bound
2094 to the first parameter of a constructor where the parameter is of type
2095 "reference to possibly cv-qualified T" and the constructor is called with a
2096 single argument in the context of direct-initialization of an object of type
2097 "cv2 T", explicit conversion functions are also considered.
2099 So set LOOKUP_COPY_PARM to let reference_binding know that
2100 it's being called in that context. */
2103 conv_flags (int i
, int nargs
, tree fn
, tree arg
, int flags
)
2107 if (i
== 0 && nargs
== 1 && DECL_CONSTRUCTOR_P (fn
)
2108 && (t
= FUNCTION_FIRST_USER_PARMTYPE (fn
))
2109 && (same_type_ignoring_top_level_qualifiers_p
2110 (non_reference (TREE_VALUE (t
)), DECL_CONTEXT (fn
))))
2112 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2113 lflags
|= LOOKUP_COPY_PARM
;
2114 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2115 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2116 lflags
|= LOOKUP_NO_CONVERSION
;
2119 lflags
|= LOOKUP_ONLYCONVERTING
;
2124 /* Create an overload candidate for the function or method FN called
2125 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
2126 FLAGS is passed on to implicit_conversion.
2128 This does not change ARGS.
2130 CTYPE, if non-NULL, is the type we want to pretend this function
2131 comes from for purposes of overload resolution. */
2133 static struct z_candidate
*
2134 add_function_candidate (struct z_candidate
**candidates
,
2135 tree fn
, tree ctype
, tree first_arg
,
2136 const vec
<tree
, va_gc
> *args
, tree access_path
,
2137 tree conversion_path
, int flags
,
2139 tsubst_flags_t complain
)
2141 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2144 tree orig_first_arg
= first_arg
;
2147 struct rejection_reason
*reason
= NULL
;
2149 /* At this point we should not see any functions which haven't been
2150 explicitly declared, except for friend functions which will have
2151 been found using argument dependent lookup. */
2152 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
2154 /* The `this', `in_chrg' and VTT arguments to constructors are not
2155 considered in overload resolution. */
2156 if (DECL_CONSTRUCTOR_P (fn
))
2158 if (ctor_omit_inherited_parms (fn
))
2159 /* Bring back parameters omitted from an inherited ctor. */
2160 parmlist
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn
));
2162 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
2163 skip
= num_artificial_parms_for (fn
);
2164 if (skip
> 0 && first_arg
!= NULL_TREE
)
2167 first_arg
= NULL_TREE
;
2173 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
2175 convs
= alloc_conversions (len
);
2177 /* 13.3.2 - Viable functions [over.match.viable]
2178 First, to be a viable function, a candidate function shall have enough
2179 parameters to agree in number with the arguments in the list.
2181 We need to check this first; otherwise, checking the ICSes might cause
2182 us to produce an ill-formed template instantiation. */
2184 parmnode
= parmlist
;
2185 for (i
= 0; i
< len
; ++i
)
2187 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
2189 parmnode
= TREE_CHAIN (parmnode
);
2192 if ((i
< len
&& parmnode
)
2193 || !sufficient_parms_p (parmnode
))
2195 int remaining
= remaining_arguments (parmnode
);
2197 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2200 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2201 parameter of type "reference to cv C" (including such a constructor
2202 instantiated from a template) is excluded from the set of candidate
2203 functions when used to construct an object of type D with an argument list
2204 containing a single argument if C is reference-related to D. */
2205 if (viable
&& len
== 1 && parmlist
&& DECL_CONSTRUCTOR_P (fn
)
2206 && flag_new_inheriting_ctors
2207 && DECL_INHERITED_CTOR (fn
))
2209 tree ptype
= non_reference (TREE_VALUE (parmlist
));
2210 tree dtype
= DECL_CONTEXT (fn
);
2211 tree btype
= DECL_INHERITED_CTOR_BASE (fn
);
2212 if (reference_related_p (ptype
, dtype
)
2213 && reference_related_p (btype
, ptype
))
2216 reason
= inherited_ctor_rejection ();
2220 /* Second, for a function to be viable, its constraints must be
2222 if (flag_concepts
&& viable
2223 && !constraints_satisfied_p (fn
))
2225 reason
= constraint_failure (fn
);
2229 /* When looking for a function from a subobject from an implicit
2230 copy/move constructor/operator=, don't consider anything that takes (a
2231 reference to) an unrelated type. See c++/44909 and core 1092. */
2232 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2234 if (DECL_CONSTRUCTOR_P (fn
))
2236 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2237 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
))
2243 parmnode
= chain_index (i
-1, parmlist
);
2244 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2249 /* This only applies at the top level. */
2250 flags
&= ~LOOKUP_DEFAULTED
;
2256 /* Third, for F to be a viable function, there shall exist for each
2257 argument an implicit conversion sequence that converts that argument
2258 to the corresponding parameter of F. */
2260 parmnode
= parmlist
;
2262 for (i
= 0; i
< len
; ++i
)
2264 tree argtype
, to_type
;
2269 if (parmnode
== void_list_node
)
2274 /* Already set during deduction. */
2275 parmnode
= TREE_CHAIN (parmnode
);
2279 if (i
== 0 && first_arg
!= NULL_TREE
)
2282 arg
= CONST_CAST_TREE (
2283 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2284 argtype
= lvalue_type (arg
);
2286 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2287 && ! DECL_CONSTRUCTOR_P (fn
));
2291 tree parmtype
= TREE_VALUE (parmnode
);
2293 parmnode
= TREE_CHAIN (parmnode
);
2295 /* The type of the implicit object parameter ('this') for
2296 overload resolution is not always the same as for the
2297 function itself; conversion functions are considered to
2298 be members of the class being converted, and functions
2299 introduced by a using-declaration are considered to be
2300 members of the class that uses them.
2302 Since build_over_call ignores the ICS for the `this'
2303 parameter, we can just change the parm type. */
2304 if (ctype
&& is_this
)
2306 parmtype
= cp_build_qualified_type
2307 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2308 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2310 /* If the function has a ref-qualifier, the implicit
2311 object parameter has reference type. */
2312 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2313 parmtype
= cp_build_reference_type (parmtype
, rv
);
2314 /* The special handling of 'this' conversions in compare_ics
2315 does not apply if there is a ref-qualifier. */
2320 parmtype
= build_pointer_type (parmtype
);
2321 /* We don't use build_this here because we don't want to
2322 capture the object argument until we've chosen a
2323 non-static member function. */
2324 arg
= build_address (arg
);
2325 argtype
= lvalue_type (arg
);
2329 int lflags
= conv_flags (i
, len
-skip
, fn
, arg
, flags
);
2331 t
= implicit_conversion (parmtype
, argtype
, arg
,
2332 /*c_cast_p=*/false, lflags
, complain
);
2337 t
= build_identity_conv (argtype
, arg
);
2338 t
->ellipsis_p
= true;
2349 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
,
2350 EXPR_LOCATION (arg
));
2357 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
,
2358 EXPR_LOCATION (arg
));
2364 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2365 access_path
, conversion_path
, viable
, reason
, flags
);
2368 /* Create an overload candidate for the conversion function FN which will
2369 be invoked for expression OBJ, producing a pointer-to-function which
2370 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2371 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2372 passed on to implicit_conversion.
2374 Actually, we don't really care about FN; we care about the type it
2375 converts to. There may be multiple conversion functions that will
2376 convert to that type, and we rely on build_user_type_conversion_1 to
2377 choose the best one; so when we create our candidate, we record the type
2378 instead of the function. */
2380 static struct z_candidate
*
2381 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2382 const vec
<tree
, va_gc
> *arglist
,
2383 tree access_path
, tree conversion_path
,
2384 tsubst_flags_t complain
)
2386 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2387 int i
, len
, viable
, flags
;
2388 tree parmlist
, parmnode
;
2390 struct rejection_reason
*reason
;
2392 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2393 parmlist
= TREE_TYPE (parmlist
);
2394 parmlist
= TYPE_ARG_TYPES (parmlist
);
2396 len
= vec_safe_length (arglist
) + 1;
2397 convs
= alloc_conversions (len
);
2398 parmnode
= parmlist
;
2400 flags
= LOOKUP_IMPLICIT
;
2403 /* Don't bother looking up the same type twice. */
2404 if (*candidates
&& (*candidates
)->fn
== totype
)
2407 for (i
= 0; i
< len
; ++i
)
2409 tree arg
, argtype
, convert_type
= NULL_TREE
;
2415 arg
= (*arglist
)[i
- 1];
2416 argtype
= lvalue_type (arg
);
2420 t
= build_identity_conv (argtype
, NULL_TREE
);
2421 t
= build_conv (ck_user
, totype
, t
);
2422 /* Leave the 'cand' field null; we'll figure out the conversion in
2423 convert_like_real if this candidate is chosen. */
2424 convert_type
= totype
;
2426 else if (parmnode
== void_list_node
)
2430 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2431 /*c_cast_p=*/false, flags
, complain
);
2432 convert_type
= TREE_VALUE (parmnode
);
2436 t
= build_identity_conv (argtype
, arg
);
2437 t
->ellipsis_p
= true;
2438 convert_type
= argtype
;
2448 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
,
2449 EXPR_LOCATION (arg
));
2456 parmnode
= TREE_CHAIN (parmnode
);
2460 || ! sufficient_parms_p (parmnode
))
2462 int remaining
= remaining_arguments (parmnode
);
2464 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2467 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2468 access_path
, conversion_path
, viable
, reason
, flags
);
2472 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2473 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2474 int flags
, tsubst_flags_t complain
)
2481 struct rejection_reason
*reason
= NULL
;
2486 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2487 convs
= alloc_conversions (num_convs
);
2489 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2490 conversion ops are allowed. We handle that here by just checking for
2491 boolean_type_node because other operators don't ask for it. COND_EXPR
2492 also does contextual conversion to bool for the first operand, but we
2493 handle that in build_conditional_expr, and type1 here is operand 2. */
2494 if (type1
!= boolean_type_node
)
2495 flags
|= LOOKUP_ONLYCONVERTING
;
2497 for (i
= 0; i
< 2; ++i
)
2502 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2503 /*c_cast_p=*/false, flags
, complain
);
2507 /* We need something for printing the candidate. */
2508 t
= build_identity_conv (types
[i
], NULL_TREE
);
2509 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2510 types
[i
], EXPR_LOCATION (args
[i
]));
2515 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2517 EXPR_LOCATION (args
[i
]));
2522 /* For COND_EXPR we rearranged the arguments; undo that now. */
2525 convs
[2] = convs
[1];
2526 convs
[1] = convs
[0];
2527 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2528 /*c_cast_p=*/false, flags
,
2535 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2537 EXPR_LOCATION (args
[2]));
2541 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2543 /*access_path=*/NULL_TREE
,
2544 /*conversion_path=*/NULL_TREE
,
2545 viable
, reason
, flags
);
2549 is_complete (tree t
)
2551 return COMPLETE_TYPE_P (complete_type (t
));
2554 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2557 promoted_arithmetic_type_p (tree type
)
2561 In this section, the term promoted integral type is used to refer
2562 to those integral types which are preserved by integral promotion
2563 (including e.g. int and long but excluding e.g. char).
2564 Similarly, the term promoted arithmetic type refers to promoted
2565 integral types plus floating types. */
2566 return ((CP_INTEGRAL_TYPE_P (type
)
2567 && same_type_p (type_promotes_to (type
), type
))
2568 || TREE_CODE (type
) == REAL_TYPE
);
2571 /* Create any builtin operator overload candidates for the operator in
2572 question given the converted operand types TYPE1 and TYPE2. The other
2573 args are passed through from add_builtin_candidates to
2574 build_builtin_candidate.
2576 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2577 If CODE is requires candidates operands of the same type of the kind
2578 of which TYPE1 and TYPE2 are, we add both candidates
2579 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2582 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2583 enum tree_code code2
, tree fnname
, tree type1
,
2584 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2585 tsubst_flags_t complain
)
2589 case POSTINCREMENT_EXPR
:
2590 case POSTDECREMENT_EXPR
:
2591 args
[1] = integer_zero_node
;
2592 type2
= integer_type_node
;
2601 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2602 and VQ is either volatile or empty, there exist candidate operator
2603 functions of the form
2604 VQ T& operator++(VQ T&);
2605 T operator++(VQ T&, int);
2606 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2607 type other than bool, and VQ is either volatile or empty, there exist
2608 candidate operator functions of the form
2609 VQ T& operator--(VQ T&);
2610 T operator--(VQ T&, int);
2611 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2612 complete object type, and VQ is either volatile or empty, there exist
2613 candidate operator functions of the form
2614 T*VQ& operator++(T*VQ&);
2615 T*VQ& operator--(T*VQ&);
2616 T* operator++(T*VQ&, int);
2617 T* operator--(T*VQ&, int); */
2619 case POSTDECREMENT_EXPR
:
2620 case PREDECREMENT_EXPR
:
2621 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2624 case POSTINCREMENT_EXPR
:
2625 case PREINCREMENT_EXPR
:
2626 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2628 type1
= build_reference_type (type1
);
2633 /* 7 For every cv-qualified or cv-unqualified object type T, there
2634 exist candidate operator functions of the form
2638 8 For every function type T, there exist candidate operator functions of
2640 T& operator*(T*); */
2643 if (TYPE_PTR_P (type1
)
2644 && (TYPE_PTROB_P (type1
)
2645 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2649 /* 9 For every type T, there exist candidate operator functions of the form
2652 10For every promoted arithmetic type T, there exist candidate operator
2653 functions of the form
2657 case UNARY_PLUS_EXPR
: /* unary + */
2658 if (TYPE_PTR_P (type1
))
2662 if (ARITHMETIC_TYPE_P (type1
))
2666 /* 11For every promoted integral type T, there exist candidate operator
2667 functions of the form
2671 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2675 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2676 is the same type as C2 or is a derived class of C2, T is a complete
2677 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2678 there exist candidate operator functions of the form
2679 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2680 where CV12 is the union of CV1 and CV2. */
2683 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2685 tree c1
= TREE_TYPE (type1
);
2686 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2688 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2689 && (TYPE_PTRMEMFUNC_P (type2
)
2690 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2695 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2696 didate operator functions of the form
2701 bool operator<(L, R);
2702 bool operator>(L, R);
2703 bool operator<=(L, R);
2704 bool operator>=(L, R);
2705 bool operator==(L, R);
2706 bool operator!=(L, R);
2707 where LR is the result of the usual arithmetic conversions between
2710 14For every pair of types T and I, where T is a cv-qualified or cv-
2711 unqualified complete object type and I is a promoted integral type,
2712 there exist candidate operator functions of the form
2713 T* operator+(T*, I);
2714 T& operator[](T*, I);
2715 T* operator-(T*, I);
2716 T* operator+(I, T*);
2717 T& operator[](I, T*);
2719 15For every T, where T is a pointer to complete object type, there exist
2720 candidate operator functions of the form112)
2721 ptrdiff_t operator-(T, T);
2723 16For every pointer or enumeration type T, there exist candidate operator
2724 functions of the form
2725 bool operator<(T, T);
2726 bool operator>(T, T);
2727 bool operator<=(T, T);
2728 bool operator>=(T, T);
2729 bool operator==(T, T);
2730 bool operator!=(T, T);
2732 17For every pointer to member type T, there exist candidate operator
2733 functions of the form
2734 bool operator==(T, T);
2735 bool operator!=(T, T); */
2738 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2740 if (TYPE_PTROB_P (type1
)
2741 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2743 type2
= ptrdiff_type_node
;
2748 case TRUNC_DIV_EXPR
:
2749 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2755 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2756 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2758 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2763 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2775 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2777 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2779 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2780 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2782 if (TYPE_PTR_P (type1
)
2783 && null_ptr_cst_p (args
[1]))
2788 if (null_ptr_cst_p (args
[0])
2789 && TYPE_PTR_P (type2
))
2797 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2801 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2803 type1
= ptrdiff_type_node
;
2806 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2808 type2
= ptrdiff_type_node
;
2813 /* 18For every pair of promoted integral types L and R, there exist candi-
2814 date operator functions of the form
2821 where LR is the result of the usual arithmetic conversions between
2824 case TRUNC_MOD_EXPR
:
2830 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2834 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2835 type, VQ is either volatile or empty, and R is a promoted arithmetic
2836 type, there exist candidate operator functions of the form
2837 VQ L& operator=(VQ L&, R);
2838 VQ L& operator*=(VQ L&, R);
2839 VQ L& operator/=(VQ L&, R);
2840 VQ L& operator+=(VQ L&, R);
2841 VQ L& operator-=(VQ L&, R);
2843 20For every pair T, VQ), where T is any type and VQ is either volatile
2844 or empty, there exist candidate operator functions of the form
2845 T*VQ& operator=(T*VQ&, T*);
2847 21For every pair T, VQ), where T is a pointer to member type and VQ is
2848 either volatile or empty, there exist candidate operator functions of
2850 VQ T& operator=(VQ T&, T);
2852 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2853 unqualified complete object type, VQ is either volatile or empty, and
2854 I is a promoted integral type, there exist candidate operator func-
2856 T*VQ& operator+=(T*VQ&, I);
2857 T*VQ& operator-=(T*VQ&, I);
2859 23For every triple L, VQ, R), where L is an integral or enumeration
2860 type, VQ is either volatile or empty, and R is a promoted integral
2861 type, there exist candidate operator functions of the form
2863 VQ L& operator%=(VQ L&, R);
2864 VQ L& operator<<=(VQ L&, R);
2865 VQ L& operator>>=(VQ L&, R);
2866 VQ L& operator&=(VQ L&, R);
2867 VQ L& operator^=(VQ L&, R);
2868 VQ L& operator|=(VQ L&, R); */
2875 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2877 type2
= ptrdiff_type_node
;
2882 case TRUNC_DIV_EXPR
:
2883 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2887 case TRUNC_MOD_EXPR
:
2893 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2898 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2900 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2901 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2902 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2903 || ((TYPE_PTRMEMFUNC_P (type1
)
2904 || TYPE_PTR_P (type1
))
2905 && null_ptr_cst_p (args
[1])))
2915 type1
= build_reference_type (type1
);
2921 For every pair of promoted arithmetic types L and R, there
2922 exist candidate operator functions of the form
2924 LR operator?(bool, L, R);
2926 where LR is the result of the usual arithmetic conversions
2927 between types L and R.
2929 For every type T, where T is a pointer or pointer-to-member
2930 type, there exist candidate operator functions of the form T
2931 operator?(bool, T, T); */
2933 if (promoted_arithmetic_type_p (type1
)
2934 && promoted_arithmetic_type_p (type2
))
2938 /* Otherwise, the types should be pointers. */
2939 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2942 /* We don't check that the two types are the same; the logic
2943 below will actually create two candidates; one in which both
2944 parameter types are TYPE1, and one in which both parameter
2950 if (ARITHMETIC_TYPE_P (type1
))
2958 /* Make sure we don't create builtin candidates with dependent types. */
2959 bool u1
= uses_template_parms (type1
);
2960 bool u2
= type2
? uses_template_parms (type2
) : false;
2963 /* Try to recover if one of the types is non-dependent. But if
2964 there's only one type, there's nothing we can do. */
2967 /* And we lose if both are dependent. */
2970 /* Or if they have different forms. */
2971 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2980 /* If we're dealing with two pointer types or two enumeral types,
2981 we need candidates for both of them. */
2982 if (type2
&& !same_type_p (type1
, type2
)
2983 && TREE_CODE (type1
) == TREE_CODE (type2
)
2984 && (TYPE_REF_P (type1
)
2985 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2986 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2987 || TYPE_PTRMEMFUNC_P (type1
)
2988 || MAYBE_CLASS_TYPE_P (type1
)
2989 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2991 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2993 tree cptype
= composite_pointer_type (type1
, type2
,
2998 if (cptype
!= error_mark_node
)
3000 build_builtin_candidate
3001 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
3007 build_builtin_candidate
3008 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
3009 build_builtin_candidate
3010 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
3014 build_builtin_candidate
3015 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
3019 type_decays_to (tree type
)
3021 if (TREE_CODE (type
) == ARRAY_TYPE
)
3022 return build_pointer_type (TREE_TYPE (type
));
3023 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3024 return build_pointer_type (type
);
3028 /* There are three conditions of builtin candidates:
3030 1) bool-taking candidates. These are the same regardless of the input.
3031 2) pointer-pair taking candidates. These are generated for each type
3032 one of the input types converts to.
3033 3) arithmetic candidates. According to the standard, we should generate
3034 all of these, but I'm trying not to...
3036 Here we generate a superset of the possible candidates for this particular
3037 case. That is a subset of the full set the standard defines, plus some
3038 other cases which the standard disallows. add_builtin_candidate will
3039 filter out the invalid set. */
3042 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
3043 enum tree_code code2
, tree fnname
, tree
*args
,
3044 int flags
, tsubst_flags_t complain
)
3048 tree type
, argtypes
[3], t
;
3049 /* TYPES[i] is the set of possible builtin-operator parameter types
3050 we will consider for the Ith argument. */
3051 vec
<tree
, va_gc
> *types
[2];
3054 for (i
= 0; i
< 3; ++i
)
3057 argtypes
[i
] = unlowered_expr_type (args
[i
]);
3059 argtypes
[i
] = NULL_TREE
;
3064 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
3065 and VQ is either volatile or empty, there exist candidate operator
3066 functions of the form
3067 VQ T& operator++(VQ T&); */
3069 case POSTINCREMENT_EXPR
:
3070 case PREINCREMENT_EXPR
:
3071 case POSTDECREMENT_EXPR
:
3072 case PREDECREMENT_EXPR
:
3077 /* 24There also exist candidate operator functions of the form
3078 bool operator!(bool);
3079 bool operator&&(bool, bool);
3080 bool operator||(bool, bool); */
3082 case TRUTH_NOT_EXPR
:
3083 build_builtin_candidate
3084 (candidates
, fnname
, boolean_type_node
,
3085 NULL_TREE
, args
, argtypes
, flags
, complain
);
3088 case TRUTH_ORIF_EXPR
:
3089 case TRUTH_ANDIF_EXPR
:
3090 build_builtin_candidate
3091 (candidates
, fnname
, boolean_type_node
,
3092 boolean_type_node
, args
, argtypes
, flags
, complain
);
3114 types
[0] = make_tree_vector ();
3115 types
[1] = make_tree_vector ();
3117 for (i
= 0; i
< 2; ++i
)
3121 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
3125 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
3128 convs
= lookup_conversions (argtypes
[i
]);
3130 if (code
== COND_EXPR
)
3132 if (lvalue_p (args
[i
]))
3133 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3135 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
3141 for (; convs
; convs
= TREE_CHAIN (convs
))
3143 type
= TREE_TYPE (convs
);
3146 && (!TYPE_REF_P (type
)
3147 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
3150 if (code
== COND_EXPR
&& TYPE_REF_P (type
))
3151 vec_safe_push (types
[i
], type
);
3153 type
= non_reference (type
);
3154 if (i
!= 0 || ! ref1
)
3156 type
= cv_unqualified (type_decays_to (type
));
3157 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
3158 vec_safe_push (types
[i
], type
);
3159 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3160 type
= type_promotes_to (type
);
3163 if (! vec_member (type
, types
[i
]))
3164 vec_safe_push (types
[i
], type
);
3169 if (code
== COND_EXPR
&& lvalue_p (args
[i
]))
3170 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3171 type
= non_reference (argtypes
[i
]);
3172 if (i
!= 0 || ! ref1
)
3174 type
= cv_unqualified (type_decays_to (type
));
3175 if (enum_p
&& UNSCOPED_ENUM_P (type
))
3176 vec_safe_push (types
[i
], type
);
3177 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3178 type
= type_promotes_to (type
);
3180 vec_safe_push (types
[i
], type
);
3184 /* Run through the possible parameter types of both arguments,
3185 creating candidates with those parameter types. */
3186 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
3191 if (!types
[1]->is_empty ())
3192 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
3193 add_builtin_candidate
3194 (candidates
, code
, code2
, fnname
, t
,
3195 u
, args
, argtypes
, flags
, complain
);
3197 add_builtin_candidate
3198 (candidates
, code
, code2
, fnname
, t
,
3199 NULL_TREE
, args
, argtypes
, flags
, complain
);
3202 release_tree_vector (types
[0]);
3203 release_tree_vector (types
[1]);
3207 /* If TMPL can be successfully instantiated as indicated by
3208 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3210 TMPL is the template. EXPLICIT_TARGS are any explicit template
3211 arguments. ARGLIST is the arguments provided at the call-site.
3212 This does not change ARGLIST. The RETURN_TYPE is the desired type
3213 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3214 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3215 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3217 static struct z_candidate
*
3218 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3219 tree ctype
, tree explicit_targs
, tree first_arg
,
3220 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3221 tree access_path
, tree conversion_path
,
3222 int flags
, tree obj
, unification_kind_t strict
,
3223 tsubst_flags_t complain
)
3225 int ntparms
= DECL_NTPARMS (tmpl
);
3226 tree targs
= make_tree_vec (ntparms
);
3227 unsigned int len
= vec_safe_length (arglist
);
3228 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3229 unsigned int skip_without_in_chrg
= 0;
3230 tree first_arg_without_in_chrg
= first_arg
;
3231 tree
*args_without_in_chrg
;
3232 unsigned int nargs_without_in_chrg
;
3233 unsigned int ia
, ix
;
3235 struct z_candidate
*cand
;
3237 struct rejection_reason
*reason
= NULL
;
3239 conversion
**convs
= NULL
;
3241 /* We don't do deduction on the in-charge parameter, the VTT
3242 parameter or 'this'. */
3243 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3245 if (first_arg_without_in_chrg
!= NULL_TREE
)
3246 first_arg_without_in_chrg
= NULL_TREE
;
3247 else if (return_type
&& strict
== DEDUCE_CALL
)
3248 /* We're deducing for a call to the result of a template conversion
3249 function, so the args don't contain 'this'; leave them alone. */;
3251 ++skip_without_in_chrg
;
3254 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3255 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3256 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3258 if (first_arg_without_in_chrg
!= NULL_TREE
)
3259 first_arg_without_in_chrg
= NULL_TREE
;
3261 ++skip_without_in_chrg
;
3264 if (len
< skip_without_in_chrg
)
3267 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3268 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3269 TREE_TYPE ((*arglist
)[0])))
3271 /* 12.8/6 says, "A declaration of a constructor for a class X is
3272 ill-formed if its first parameter is of type (optionally cv-qualified)
3273 X and either there are no other parameters or else all other
3274 parameters have default arguments. A member function template is never
3275 instantiated to produce such a constructor signature."
3277 So if we're trying to copy an object of the containing class, don't
3278 consider a template constructor that has a first parameter type that
3279 is just a template parameter, as we would deduce a signature that we
3280 would then reject in the code below. */
3281 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3283 firstparm
= TREE_VALUE (firstparm
);
3284 if (PACK_EXPANSION_P (firstparm
))
3285 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3286 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3288 gcc_assert (!explicit_targs
);
3289 reason
= invalid_copy_with_fn_template_rejection ();
3295 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3296 + (len
- skip_without_in_chrg
));
3297 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3299 if (first_arg_without_in_chrg
!= NULL_TREE
)
3301 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3304 for (ix
= skip_without_in_chrg
;
3305 vec_safe_iterate (arglist
, ix
, &arg
);
3308 args_without_in_chrg
[ia
] = arg
;
3311 gcc_assert (ia
== nargs_without_in_chrg
);
3313 errs
= errorcount
+sorrycount
;
3315 convs
= alloc_conversions (nargs
);
3316 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3317 args_without_in_chrg
,
3318 nargs_without_in_chrg
,
3319 return_type
, strict
, flags
, convs
,
3320 false, complain
& tf_decltype
);
3322 if (fn
== error_mark_node
)
3324 /* Don't repeat unification later if it already resulted in errors. */
3325 if (errorcount
+sorrycount
== errs
)
3326 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3327 targs
, args_without_in_chrg
,
3328 nargs_without_in_chrg
,
3329 return_type
, strict
, flags
);
3331 reason
= template_unification_error_rejection ();
3335 /* Now the explicit specifier might have been deduced; check if this
3336 declaration is explicit. If it is and we're ignoring non-converting
3337 constructors, don't add this function to the set of candidates. */
3338 if ((flags
& LOOKUP_ONLYCONVERTING
) && DECL_NONCONVERTING_P (fn
))
3341 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3343 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3344 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3347 /* We're trying to produce a constructor with a prohibited signature,
3348 as discussed above; handle here any cases we didn't catch then,
3350 reason
= invalid_copy_with_fn_template_rejection ();
3355 if (obj
!= NULL_TREE
)
3356 /* Aha, this is a conversion function. */
3357 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3358 access_path
, conversion_path
, complain
);
3360 cand
= add_function_candidate (candidates
, fn
, ctype
,
3361 first_arg
, arglist
, access_path
,
3362 conversion_path
, flags
, convs
, complain
);
3363 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3364 /* This situation can occur if a member template of a template
3365 class is specialized. Then, instantiate_template might return
3366 an instantiation of the specialization, in which case the
3367 DECL_TI_TEMPLATE field will point at the original
3368 specialization. For example:
3370 template <class T> struct S { template <class U> void f(U);
3371 template <> void f(int) {}; };
3375 Here, TMPL will be template <class U> S<double>::f(U).
3376 And, instantiate template will give us the specialization
3377 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3378 for this will point at template <class T> template <> S<T>::f(int),
3379 so that we can find the definition. For the purposes of
3380 overload resolution, however, we want the original TMPL. */
3381 cand
->template_decl
= build_template_info (tmpl
, targs
);
3383 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3384 cand
->explicit_targs
= explicit_targs
;
3388 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3389 access_path
, conversion_path
, 0, reason
, flags
);
3393 static struct z_candidate
*
3394 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3395 tree explicit_targs
, tree first_arg
,
3396 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3397 tree access_path
, tree conversion_path
, int flags
,
3398 unification_kind_t strict
, tsubst_flags_t complain
)
3401 add_template_candidate_real (candidates
, tmpl
, ctype
,
3402 explicit_targs
, first_arg
, arglist
,
3403 return_type
, access_path
, conversion_path
,
3404 flags
, NULL_TREE
, strict
, complain
);
3407 /* Create an overload candidate for the conversion function template TMPL,
3408 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3409 pointer-to-function which will in turn be called with the argument list
3410 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3411 passed on to implicit_conversion. */
3413 static struct z_candidate
*
3414 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3416 const vec
<tree
, va_gc
> *arglist
,
3417 tree return_type
, tree access_path
,
3418 tree conversion_path
, tsubst_flags_t complain
)
3420 /* Making this work broke PR 71117 and 85118, so until the committee resolves
3421 core issue 2189, let's disable this candidate if there are any call
3427 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3428 NULL_TREE
, arglist
, return_type
, access_path
,
3429 conversion_path
, 0, obj
, DEDUCE_CALL
,
3433 /* The CANDS are the set of candidates that were considered for
3434 overload resolution. Return the set of viable candidates, or CANDS
3435 if none are viable. If any of the candidates were viable, set
3436 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3437 considered viable only if it is strictly viable. */
3439 static struct z_candidate
*
3440 splice_viable (struct z_candidate
*cands
,
3444 struct z_candidate
*viable
;
3445 struct z_candidate
**last_viable
;
3446 struct z_candidate
**cand
;
3447 bool found_strictly_viable
= false;
3449 /* Be strict inside templates, since build_over_call won't actually
3450 do the conversions to get pedwarns. */
3451 if (processing_template_decl
)
3455 last_viable
= &viable
;
3456 *any_viable_p
= false;
3461 struct z_candidate
*c
= *cand
;
3463 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3465 /* Be strict in the presence of a viable candidate. Also if
3466 there are template candidates, so that we get deduction errors
3467 for them instead of silently preferring a bad conversion. */
3469 if (viable
&& !found_strictly_viable
)
3471 /* Put any spliced near matches back onto the main list so
3472 that we see them if there is no strict match. */
3473 *any_viable_p
= false;
3474 *last_viable
= cands
;
3477 last_viable
= &viable
;
3481 if (strict_p
? c
->viable
== 1 : c
->viable
)
3486 last_viable
= &c
->next
;
3487 *any_viable_p
= true;
3489 found_strictly_viable
= true;
3495 return viable
? viable
: cands
;
3499 any_strictly_viable (struct z_candidate
*cands
)
3501 for (; cands
; cands
= cands
->next
)
3502 if (cands
->viable
== 1)
3507 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3508 words, it is about to become the "this" pointer for a member
3509 function call. Take the address of the object. */
3512 build_this (tree obj
)
3514 /* In a template, we are only concerned about the type of the
3515 expression, so we can take a shortcut. */
3516 if (processing_template_decl
)
3517 return build_address (obj
);
3519 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3522 /* Returns true iff functions are equivalent. Equivalent functions are
3523 not '==' only if one is a function-local extern function or if
3524 both are extern "C". */
3527 equal_functions (tree fn1
, tree fn2
)
3529 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3531 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3533 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3534 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3535 return decls_match (fn1
, fn2
);
3539 /* Print information about a candidate FN being rejected due to INFO. */
3542 print_conversion_rejection (location_t loc
, struct conversion_info
*info
,
3545 tree from
= info
->from
;
3547 from
= lvalue_type (from
);
3548 if (info
->n_arg
== -1)
3550 /* Conversion of implicit `this' argument failed. */
3551 if (!TYPE_P (info
->from
))
3552 /* A bad conversion for 'this' must be discarding cv-quals. */
3553 inform (loc
, " passing %qT as %<this%> "
3554 "argument discards qualifiers",
3557 inform (loc
, " no known conversion for implicit "
3558 "%<this%> parameter from %qH to %qI",
3559 from
, info
->to_type
);
3561 else if (!TYPE_P (info
->from
))
3563 if (info
->n_arg
>= 0)
3564 inform (loc
, " conversion of argument %d would be ill-formed:",
3566 perform_implicit_conversion (info
->to_type
, info
->from
,
3567 tf_warning_or_error
);
3569 else if (info
->n_arg
== -2)
3570 /* Conversion of conversion function return value failed. */
3571 inform (loc
, " no known conversion from %qH to %qI",
3572 from
, info
->to_type
);
3575 if (TREE_CODE (fn
) == FUNCTION_DECL
)
3576 loc
= get_fndecl_argument_location (fn
, info
->n_arg
);
3577 inform (loc
, " no known conversion for argument %d from %qH to %qI",
3578 info
->n_arg
+ 1, from
, info
->to_type
);
3582 /* Print information about a candidate with WANT parameters and we found
3586 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3588 inform_n (loc
, want
,
3589 " candidate expects %d argument, %d provided",
3590 " candidate expects %d arguments, %d provided",
3594 /* Print information about one overload candidate CANDIDATE. MSGSTR
3595 is the text to print before the candidate itself.
3597 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3598 to have been run through gettext by the caller. This wart makes
3599 life simpler in print_z_candidates and for the translators. */
3602 print_z_candidate (location_t loc
, const char *msgstr
,
3603 struct z_candidate
*candidate
)
3605 const char *msg
= (msgstr
== NULL
3607 : ACONCAT ((msgstr
, " ", NULL
)));
3608 tree fn
= candidate
->fn
;
3609 if (flag_new_inheriting_ctors
)
3610 fn
= strip_inheriting_ctors (fn
);
3611 location_t cloc
= location_of (fn
);
3613 if (identifier_p (fn
))
3616 if (candidate
->num_convs
== 3)
3617 inform (cloc
, "%s%<%D(%T, %T, %T)%> <built-in>", msg
, fn
,
3618 candidate
->convs
[0]->type
,
3619 candidate
->convs
[1]->type
,
3620 candidate
->convs
[2]->type
);
3621 else if (candidate
->num_convs
== 2)
3622 inform (cloc
, "%s%<%D(%T, %T)%> <built-in>", msg
, fn
,
3623 candidate
->convs
[0]->type
,
3624 candidate
->convs
[1]->type
);
3626 inform (cloc
, "%s%<%D(%T)%> <built-in>", msg
, fn
,
3627 candidate
->convs
[0]->type
);
3629 else if (TYPE_P (fn
))
3630 inform (cloc
, "%s%qT <conversion>", msg
, fn
);
3631 else if (candidate
->viable
== -1)
3632 inform (cloc
, "%s%#qD <near match>", msg
, fn
);
3633 else if (DECL_DELETED_FN (fn
))
3634 inform (cloc
, "%s%#qD <deleted>", msg
, fn
);
3636 inform (cloc
, "%s%#qD", msg
, fn
);
3637 if (fn
!= candidate
->fn
)
3639 cloc
= location_of (candidate
->fn
);
3640 inform (cloc
, " inherited here");
3642 /* Give the user some information about why this candidate failed. */
3643 if (candidate
->reason
!= NULL
)
3645 struct rejection_reason
*r
= candidate
->reason
;
3650 print_arity_information (cloc
, r
->u
.arity
.actual
,
3651 r
->u
.arity
.expected
);
3653 case rr_arg_conversion
:
3654 print_conversion_rejection (cloc
, &r
->u
.conversion
, fn
);
3656 case rr_bad_arg_conversion
:
3657 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
, fn
);
3659 case rr_explicit_conversion
:
3660 inform (cloc
, " return type %qT of explicit conversion function "
3661 "cannot be converted to %qT with a qualification "
3662 "conversion", r
->u
.conversion
.from
,
3663 r
->u
.conversion
.to_type
);
3665 case rr_template_conversion
:
3666 inform (cloc
, " conversion from return type %qT of template "
3667 "conversion function specialization to %qT is not an "
3668 "exact match", r
->u
.conversion
.from
,
3669 r
->u
.conversion
.to_type
);
3671 case rr_template_unification
:
3672 /* We use template_unification_error_rejection if unification caused
3673 actual non-SFINAE errors, in which case we don't need to repeat
3675 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3677 inform (cloc
, " substitution of deduced template arguments "
3678 "resulted in errors seen above");
3681 /* Re-run template unification with diagnostics. */
3682 inform (cloc
, " template argument deduction/substitution failed:");
3683 fn_type_unification (r
->u
.template_unification
.tmpl
,
3684 r
->u
.template_unification
.explicit_targs
,
3686 (r
->u
.template_unification
.num_targs
)),
3687 r
->u
.template_unification
.args
,
3688 r
->u
.template_unification
.nargs
,
3689 r
->u
.template_unification
.return_type
,
3690 r
->u
.template_unification
.strict
,
3691 r
->u
.template_unification
.flags
,
3694 case rr_invalid_copy
:
3696 " a constructor taking a single argument of its own "
3697 "class type is invalid");
3699 case rr_constraint_failure
:
3701 tree tmpl
= r
->u
.template_instantiation
.tmpl
;
3702 tree args
= r
->u
.template_instantiation
.targs
;
3703 diagnose_constraints (cloc
, tmpl
, args
);
3706 case rr_inherited_ctor
:
3707 inform (cloc
, " an inherited constructor is not a candidate for "
3708 "initialization from an expression of the same or derived "
3713 /* This candidate didn't have any issues or we failed to
3714 handle a particular code. Either way... */
3721 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3723 struct z_candidate
*cand1
;
3724 struct z_candidate
**cand2
;
3729 /* Remove non-viable deleted candidates. */
3731 for (cand2
= &cand1
; *cand2
; )
3733 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3734 && !(*cand2
)->viable
3735 && DECL_DELETED_FN ((*cand2
)->fn
))
3736 *cand2
= (*cand2
)->next
;
3738 cand2
= &(*cand2
)->next
;
3740 /* ...if there are any non-deleted ones. */
3744 /* There may be duplicates in the set of candidates. We put off
3745 checking this condition as long as possible, since we have no way
3746 to eliminate duplicates from a set of functions in less than n^2
3747 time. Now we are about to emit an error message, so it is more
3748 permissible to go slowly. */
3749 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3751 tree fn
= cand1
->fn
;
3752 /* Skip builtin candidates and conversion functions. */
3755 cand2
= &cand1
->next
;
3758 if (DECL_P ((*cand2
)->fn
)
3759 && equal_functions (fn
, (*cand2
)->fn
))
3760 *cand2
= (*cand2
)->next
;
3762 cand2
= &(*cand2
)->next
;
3766 for (; candidates
; candidates
= candidates
->next
)
3767 print_z_candidate (loc
, "candidate:", candidates
);
3770 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3771 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3772 the result of the conversion function to convert it to the final
3773 desired type. Merge the two sequences into a single sequence,
3774 and return the merged sequence. */
3777 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3780 bool bad
= user_seq
->bad_p
;
3782 gcc_assert (user_seq
->kind
== ck_user
);
3784 /* Find the end of the second conversion sequence. */
3785 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3787 /* The entire sequence is a user-conversion sequence. */
3788 (*t
)->user_conv_p
= true;
3793 if ((*t
)->rvaluedness_matches_p
)
3794 /* We're binding a reference directly to the result of the conversion.
3795 build_user_type_conversion_1 stripped the REFERENCE_TYPE from the return
3796 type, but we want it back. */
3797 user_seq
->type
= TREE_TYPE (TREE_TYPE (user_seq
->cand
->fn
));
3799 /* Replace the identity conversion with the user conversion
3806 /* Handle overload resolution for initializing an object of class type from
3807 an initializer list. First we look for a suitable constructor that
3808 takes a std::initializer_list; if we don't find one, we then look for a
3809 non-list constructor.
3811 Parameters are as for add_candidates, except that the arguments are in
3812 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3813 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3816 add_list_candidates (tree fns
, tree first_arg
,
3817 const vec
<tree
, va_gc
> *args
, tree totype
,
3818 tree explicit_targs
, bool template_only
,
3819 tree conversion_path
, tree access_path
,
3821 struct z_candidate
**candidates
,
3822 tsubst_flags_t complain
)
3824 gcc_assert (*candidates
== NULL
);
3826 /* We're looking for a ctor for list-initialization. */
3827 flags
|= LOOKUP_LIST_INIT_CTOR
;
3828 /* And we don't allow narrowing conversions. We also use this flag to
3829 avoid the copy constructor call for copy-list-initialization. */
3830 flags
|= LOOKUP_NO_NARROWING
;
3832 unsigned nart
= num_artificial_parms_for (OVL_FIRST (fns
)) - 1;
3833 tree init_list
= (*args
)[nart
];
3835 /* Always use the default constructor if the list is empty (DR 990). */
3836 if (CONSTRUCTOR_NELTS (init_list
) == 0
3837 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3839 /* If the class has a list ctor, try passing the list as a single
3840 argument first, but only consider list ctors. */
3841 else if (TYPE_HAS_LIST_CTOR (totype
))
3843 flags
|= LOOKUP_LIST_ONLY
;
3844 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3845 explicit_targs
, template_only
, conversion_path
,
3846 access_path
, flags
, candidates
, complain
);
3847 if (any_strictly_viable (*candidates
))
3851 /* Expand the CONSTRUCTOR into a new argument vec. */
3852 vec
<tree
, va_gc
> *new_args
;
3853 vec_alloc (new_args
, nart
+ CONSTRUCTOR_NELTS (init_list
));
3854 for (unsigned i
= 0; i
< nart
; ++i
)
3855 new_args
->quick_push ((*args
)[i
]);
3856 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (init_list
); ++i
)
3857 new_args
->quick_push (CONSTRUCTOR_ELT (init_list
, i
)->value
);
3859 /* We aren't looking for list-ctors anymore. */
3860 flags
&= ~LOOKUP_LIST_ONLY
;
3861 /* We allow more user-defined conversions within an init-list. */
3862 flags
&= ~LOOKUP_NO_CONVERSION
;
3864 add_candidates (fns
, first_arg
, new_args
, NULL_TREE
,
3865 explicit_targs
, template_only
, conversion_path
,
3866 access_path
, flags
, candidates
, complain
);
3869 /* Returns the best overload candidate to perform the requested
3870 conversion. This function is used for three the overloading situations
3871 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3872 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3873 per [dcl.init.ref], so we ignore temporary bindings. */
3875 static struct z_candidate
*
3876 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3877 tsubst_flags_t complain
)
3879 struct z_candidate
*candidates
, *cand
;
3881 tree ctors
= NULL_TREE
;
3882 tree conv_fns
= NULL_TREE
;
3883 conversion
*conv
= NULL
;
3884 tree first_arg
= NULL_TREE
;
3885 vec
<tree
, va_gc
> *args
= NULL
;
3892 fromtype
= TREE_TYPE (expr
);
3894 /* We represent conversion within a hierarchy using RVALUE_CONV and
3895 BASE_CONV, as specified by [over.best.ics]; these become plain
3896 constructor calls, as specified in [dcl.init]. */
3897 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3898 || !DERIVED_FROM_P (totype
, fromtype
));
3900 if (CLASS_TYPE_P (totype
))
3901 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3902 creating a garbage BASELINK; constructors can't be inherited. */
3903 ctors
= get_class_binding (totype
, complete_ctor_identifier
);
3905 if (MAYBE_CLASS_TYPE_P (fromtype
))
3907 tree to_nonref
= non_reference (totype
);
3908 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3909 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3910 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3912 /* [class.conv.fct] A conversion function is never used to
3913 convert a (possibly cv-qualified) object to the (possibly
3914 cv-qualified) same object type (or a reference to it), to a
3915 (possibly cv-qualified) base class of that type (or a
3916 reference to it)... */
3919 conv_fns
= lookup_conversions (fromtype
);
3923 flags
|= LOOKUP_NO_CONVERSION
;
3924 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3925 flags
|= LOOKUP_NO_NARROWING
;
3927 /* It's OK to bind a temporary for converting constructor arguments, but
3928 not in converting the return value of a conversion operator. */
3929 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3930 | (flags
& LOOKUP_NO_NARROWING
));
3931 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3935 int ctorflags
= flags
;
3937 first_arg
= build_dummy_object (totype
);
3939 /* We should never try to call the abstract or base constructor
3941 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors
))
3942 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors
)));
3944 args
= make_tree_vector_single (expr
);
3945 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3947 /* List-initialization. */
3948 add_list_candidates (ctors
, first_arg
, args
, totype
, NULL_TREE
,
3949 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3950 ctorflags
, &candidates
, complain
);
3954 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3955 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3956 ctorflags
, &candidates
, complain
);
3959 for (cand
= candidates
; cand
; cand
= cand
->next
)
3961 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3963 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3964 set, then this is copy-initialization. In that case, "The
3965 result of the call is then used to direct-initialize the
3966 object that is the destination of the copy-initialization."
3969 We represent this in the conversion sequence with an
3970 rvalue conversion, which means a constructor call. */
3971 if (!TYPE_REF_P (totype
)
3972 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3974 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3980 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3981 first_arg
= CONSTRUCTOR_ELT (expr
, 0)->value
;
3986 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3988 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3989 struct z_candidate
*old_candidates
;
3991 /* If we are called to convert to a reference type, we are trying to
3992 find a direct binding, so don't even consider temporaries. If
3993 we don't find a direct binding, the caller will try again to
3994 look for a temporary binding. */
3995 if (TYPE_REF_P (totype
))
3996 convflags
|= LOOKUP_NO_TEMP_BIND
;
3998 old_candidates
= candidates
;
3999 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
4001 conversion_path
, TYPE_BINFO (fromtype
),
4002 flags
, &candidates
, complain
);
4004 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
4006 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
4008 = implicit_conversion (totype
,
4011 /*c_cast_p=*/false, convflags
,
4014 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
4015 copy-initialization. In that case, "The result of the
4016 call is then used to direct-initialize the object that is
4017 the destination of the copy-initialization." [dcl.init]
4019 We represent this in the conversion sequence with an
4020 rvalue conversion, which means a constructor call. But
4021 don't add a second rvalue conversion if there's already
4022 one there. Which there really shouldn't be, but it's
4023 harmless since we'd add it here anyway. */
4024 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
4025 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
4026 ics
= build_conv (ck_rvalue
, totype
, ics
);
4028 cand
->second_conv
= ics
;
4033 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
4035 EXPR_LOCATION (expr
));
4037 else if (TYPE_REF_P (totype
) && !ics
->rvaluedness_matches_p
4038 && TREE_CODE (TREE_TYPE (totype
)) != FUNCTION_TYPE
)
4040 /* If we are called to convert to a reference type, we are trying
4041 to find a direct binding per [over.match.ref], so rvaluedness
4042 must match for non-functions. */
4045 else if (DECL_NONCONVERTING_P (cand
->fn
)
4046 && ics
->rank
> cr_exact
)
4048 /* 13.3.1.5: For direct-initialization, those explicit
4049 conversion functions that are not hidden within S and
4050 yield type T or a type that can be converted to type T
4051 with a qualification conversion (4.4) are also candidate
4053 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
4054 I've raised this issue with the committee. --jason 9/2011 */
4056 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
4058 else if (cand
->viable
== 1 && ics
->bad_p
)
4062 = bad_arg_conversion_rejection (NULL_TREE
, -2,
4064 EXPR_LOCATION (expr
));
4066 else if (primary_template_specialization_p (cand
->fn
)
4067 && ics
->rank
> cr_exact
)
4069 /* 13.3.3.1.2: If the user-defined conversion is specified by
4070 a specialization of a conversion function template, the
4071 second standard conversion sequence shall have exact match
4074 cand
->reason
= template_conversion_rejection (rettype
, totype
);
4079 candidates
= splice_viable (candidates
, false, &any_viable_p
);
4083 release_tree_vector (args
);
4087 cand
= tourney (candidates
, complain
);
4090 if (complain
& tf_error
)
4092 auto_diagnostic_group d
;
4093 error ("conversion from %qH to %qI is ambiguous",
4095 print_z_candidates (location_of (expr
), candidates
);
4098 cand
= candidates
; /* any one will do */
4099 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
4100 cand
->second_conv
->user_conv_p
= true;
4101 if (!any_strictly_viable (candidates
))
4102 cand
->second_conv
->bad_p
= true;
4103 if (flags
& LOOKUP_ONLYCONVERTING
)
4104 cand
->second_conv
->need_temporary_p
= true;
4105 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
4106 ambiguous conversion is no worse than another user-defined
4113 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
4114 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
4115 else if (cand
->second_conv
->kind
== ck_rvalue
)
4116 /* DR 5: [in the first step of copy-initialization]...if the function
4117 is a constructor, the call initializes a temporary of the
4118 cv-unqualified version of the destination type. */
4119 convtype
= cv_unqualified (totype
);
4122 /* Build the user conversion sequence. */
4126 build_identity_conv (TREE_TYPE (expr
), expr
));
4128 if (cand
->viable
== -1)
4131 /* We're performing the maybe-rvalue overload resolution and
4132 a conversion function is in play. Reject converting the return
4133 value of the conversion function to a base class. */
4134 if ((flags
& LOOKUP_PREFER_RVALUE
) && !DECL_CONSTRUCTOR_P (cand
->fn
))
4135 for (conversion
*t
= cand
->second_conv
; t
; t
= next_conversion (t
))
4136 if (t
->kind
== ck_base
)
4139 /* Remember that this was a list-initialization. */
4140 if (flags
& LOOKUP_NO_NARROWING
)
4141 conv
->check_narrowing
= true;
4143 /* Combine it with the second conversion sequence. */
4144 cand
->second_conv
= merge_conversion_sequences (conv
,
4150 /* Wrapper for above. */
4153 build_user_type_conversion (tree totype
, tree expr
, int flags
,
4154 tsubst_flags_t complain
)
4156 struct z_candidate
*cand
;
4159 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4160 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
4164 if (cand
->second_conv
->kind
== ck_ambig
)
4165 ret
= error_mark_node
;
4168 expr
= convert_like (cand
->second_conv
, expr
, complain
);
4169 ret
= convert_from_reference (expr
);
4175 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4179 /* Worker for build_converted_constant_expr. */
4182 build_converted_constant_expr_internal (tree type
, tree expr
,
4183 int flags
, tsubst_flags_t complain
)
4188 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
4190 if (error_operand_p (expr
))
4191 return error_mark_node
;
4193 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4194 p
= conversion_obstack_alloc (0);
4196 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
4197 /*c_cast_p=*/false, flags
, complain
);
4199 /* A converted constant expression of type T is an expression, implicitly
4200 converted to type T, where the converted expression is a constant
4201 expression and the implicit conversion sequence contains only
4203 * user-defined conversions,
4204 * lvalue-to-rvalue conversions (7.1),
4205 * array-to-pointer conversions (7.2),
4206 * function-to-pointer conversions (7.3),
4207 * qualification conversions (7.5),
4208 * integral promotions (7.6),
4209 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4210 * null pointer conversions (7.11) from std::nullptr_t,
4211 * null member pointer conversions (7.12) from std::nullptr_t, and
4212 * function pointer conversions (7.13),
4214 and where the reference binding (if any) binds directly. */
4216 for (conversion
*c
= conv
;
4217 conv
&& c
->kind
!= ck_identity
;
4218 c
= next_conversion (c
))
4222 /* A conversion function is OK. If it isn't constexpr, we'll
4223 complain later that the argument isn't constant. */
4225 /* The lvalue-to-rvalue conversion is OK. */
4227 /* Array-to-pointer and function-to-pointer. */
4229 /* Function pointer conversions. */
4231 /* Qualification conversions. */
4236 if (c
->need_temporary_p
)
4238 if (complain
& tf_error
)
4239 error_at (loc
, "initializing %qH with %qI in converted "
4240 "constant expression does not bind directly",
4241 type
, next_conversion (c
)->type
);
4250 t
= next_conversion (c
)->type
;
4251 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
)
4252 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
4253 /* Integral promotion or conversion. */
4255 if (NULLPTR_TYPE_P (t
))
4256 /* Conversion from nullptr to pointer or pointer-to-member. */
4259 if (complain
& tf_error
)
4260 error_at (loc
, "conversion from %qH to %qI in a "
4261 "converted constant expression", t
, type
);
4270 /* Avoid confusing convert_nontype_argument by introducing
4271 a redundant conversion to the same reference type. */
4272 if (conv
&& conv
->kind
== ck_ref_bind
4273 && REFERENCE_REF_P (expr
))
4275 tree ref
= TREE_OPERAND (expr
, 0);
4276 if (same_type_p (type
, TREE_TYPE (ref
)))
4282 conv
->check_narrowing
= true;
4283 conv
->check_narrowing_const_only
= true;
4284 expr
= convert_like (conv
, expr
, complain
);
4288 if (complain
& tf_error
)
4289 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
4290 TREE_TYPE (expr
), type
);
4291 expr
= error_mark_node
;
4294 /* Free all the conversions we allocated. */
4295 obstack_free (&conversion_obstack
, p
);
4300 /* Subroutine of convert_nontype_argument.
4302 EXPR is an expression used in a context that requires a converted
4303 constant-expression, such as a template non-type parameter. Do any
4304 necessary conversions (that are permitted for converted
4305 constant-expressions) to convert it to the desired type.
4307 This function doesn't consider explicit conversion functions. If
4308 you mean to use "a contextually converted constant expression of type
4309 bool", use build_converted_constant_bool_expr.
4311 If conversion is successful, returns the converted expression;
4312 otherwise, returns error_mark_node. */
4315 build_converted_constant_expr (tree type
, tree expr
, tsubst_flags_t complain
)
4317 return build_converted_constant_expr_internal (type
, expr
, LOOKUP_IMPLICIT
,
4321 /* Used to create "a contextually converted constant expression of type
4322 bool". This differs from build_converted_constant_expr in that it
4323 also considers explicit conversion functions. */
4326 build_converted_constant_bool_expr (tree expr
, tsubst_flags_t complain
)
4328 return build_converted_constant_expr_internal (boolean_type_node
, expr
,
4329 LOOKUP_NORMAL
, complain
);
4332 /* Do any initial processing on the arguments to a function call. */
4334 static vec
<tree
, va_gc
> *
4335 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
4340 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4342 if (error_operand_p (arg
))
4344 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4346 if (complain
& tf_error
)
4347 error ("invalid use of void expression");
4350 else if (invalid_nonstatic_memfn_p (EXPR_LOCATION (arg
), arg
, complain
))
4356 /* Perform overload resolution on FN, which is called with the ARGS.
4358 Return the candidate function selected by overload resolution, or
4359 NULL if the event that overload resolution failed. In the case
4360 that overload resolution fails, *CANDIDATES will be the set of
4361 candidates considered, and ANY_VIABLE_P will be set to true or
4362 false to indicate whether or not any of the candidates were
4365 The ARGS should already have gone through RESOLVE_ARGS before this
4366 function is called. */
4368 static struct z_candidate
*
4369 perform_overload_resolution (tree fn
,
4370 const vec
<tree
, va_gc
> *args
,
4371 struct z_candidate
**candidates
,
4372 bool *any_viable_p
, tsubst_flags_t complain
)
4374 struct z_candidate
*cand
;
4375 tree explicit_targs
;
4378 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4380 explicit_targs
= NULL_TREE
;
4384 *any_viable_p
= true;
4387 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4388 || TREE_CODE (fn
) == TEMPLATE_DECL
4389 || TREE_CODE (fn
) == OVERLOAD
4390 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4392 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4394 explicit_targs
= TREE_OPERAND (fn
, 1);
4395 fn
= TREE_OPERAND (fn
, 0);
4399 /* Add the various candidate functions. */
4400 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4401 explicit_targs
, template_only
,
4402 /*conversion_path=*/NULL_TREE
,
4403 /*access_path=*/NULL_TREE
,
4405 candidates
, complain
);
4407 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4409 cand
= tourney (*candidates
, complain
);
4413 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4417 /* Print an error message about being unable to build a call to FN with
4418 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4419 be located; CANDIDATES is a possibly empty list of such
4423 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4424 struct z_candidate
*candidates
)
4426 tree targs
= NULL_TREE
;
4427 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4429 targs
= TREE_OPERAND (fn
, 1);
4430 fn
= TREE_OPERAND (fn
, 0);
4432 tree name
= OVL_NAME (fn
);
4433 location_t loc
= location_of (name
);
4435 name
= lookup_template_function (name
, targs
);
4437 auto_diagnostic_group d
;
4438 if (!any_strictly_viable (candidates
))
4439 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4440 name
, build_tree_list_vec (args
));
4442 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4443 name
, build_tree_list_vec (args
));
4445 print_z_candidates (loc
, candidates
);
4448 /* Return an expression for a call to FN (a namespace-scope function,
4449 or a static member function) with the ARGS. This may change
4453 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
,
4454 tsubst_flags_t complain
)
4456 struct z_candidate
*candidates
, *cand
;
4461 if (args
!= NULL
&& *args
!= NULL
)
4463 *args
= resolve_args (*args
, complain
);
4465 return error_mark_node
;
4469 tm_malloc_replacement (fn
);
4471 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4472 p
= conversion_obstack_alloc (0);
4474 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4479 if (complain
& tf_error
)
4481 // If there is a single (non-viable) function candidate,
4482 // let the error be diagnosed by cp_build_function_call_vec.
4483 if (!any_viable_p
&& candidates
&& ! candidates
->next
4484 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4485 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4487 // Otherwise, emit notes for non-viable candidates.
4488 print_error_for_call_failure (fn
, *args
, candidates
);
4490 result
= error_mark_node
;
4494 int flags
= LOOKUP_NORMAL
;
4495 /* If fn is template_id_expr, the call has explicit template arguments
4496 (e.g. func<int>(5)), communicate this info to build_over_call
4497 through flags so that later we can use it to decide whether to warn
4498 about peculiar null pointer conversion. */
4499 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4501 /* If overload resolution selects a specialization of a
4502 function concept for non-dependent template arguments,
4503 the expression is true if the constraints are satisfied
4504 and false otherwise.
4506 NOTE: This is an extension of Concepts Lite TS that
4507 allows constraints to be used in expressions. */
4508 if (flag_concepts
&& !processing_template_decl
)
4510 tree tmpl
= DECL_TI_TEMPLATE (cand
->fn
);
4511 tree targs
= DECL_TI_ARGS (cand
->fn
);
4512 tree decl
= DECL_TEMPLATE_RESULT (tmpl
);
4513 if (DECL_DECLARED_CONCEPT_P (decl
))
4514 return evaluate_function_concept (decl
, targs
);
4517 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4520 result
= build_over_call (cand
, flags
, complain
);
4523 /* Free all the conversions we allocated. */
4524 obstack_free (&conversion_obstack
, p
);
4529 /* Build a call to a global operator new. FNNAME is the name of the
4530 operator (either "operator new" or "operator new[]") and ARGS are
4531 the arguments provided. This may change ARGS. *SIZE points to the
4532 total number of bytes required by the allocation, and is updated if
4533 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4534 be used. If this function determines that no cookie should be
4535 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4536 is not NULL_TREE, it is evaluated before calculating the final
4537 array size, and if it fails, the array size is replaced with
4538 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4539 is non-NULL, it will be set, upon return, to the allocation
4543 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4544 tree
*size
, tree
*cookie_size
,
4545 tree align_arg
, tree size_check
,
4546 tree
*fn
, tsubst_flags_t complain
)
4548 tree original_size
= *size
;
4550 struct z_candidate
*candidates
;
4551 struct z_candidate
*cand
= NULL
;
4556 /* Set to (size_t)-1 if the size check fails. */
4557 if (size_check
!= NULL_TREE
)
4559 tree errval
= TYPE_MAX_VALUE (sizetype
);
4560 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4561 errval
= throw_bad_array_new_length ();
4562 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4563 original_size
, errval
);
4565 vec_safe_insert (*args
, 0, *size
);
4566 *args
= resolve_args (*args
, complain
);
4568 return error_mark_node
;
4574 If this lookup fails to find the name, or if the allocated type
4575 is not a class type, the allocation function's name is looked
4576 up in the global scope.
4578 we disregard block-scope declarations of "operator new". */
4579 fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/false, 0, 0);
4580 fns
= lookup_arg_dependent (fnname
, fns
, *args
);
4584 vec
<tree
, va_gc
>* align_args
4585 = vec_copy_and_insert (*args
, align_arg
, 1);
4586 cand
= perform_overload_resolution (fns
, align_args
, &candidates
,
4587 &any_viable_p
, tf_none
);
4590 /* If no aligned allocation function matches, try again without the
4594 /* Figure out what function is being called. */
4596 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4599 /* If no suitable function could be found, issue an error message
4603 if (complain
& tf_error
)
4604 print_error_for_call_failure (fns
, *args
, candidates
);
4605 return error_mark_node
;
4608 /* If a cookie is required, add some extra space. Whether
4609 or not a cookie is required cannot be determined until
4610 after we know which function was called. */
4613 bool use_cookie
= true;
4616 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4617 /* Skip the size_t parameter. */
4618 arg_types
= TREE_CHAIN (arg_types
);
4619 /* Check the remaining parameters (if any). */
4621 && TREE_CHAIN (arg_types
) == void_list_node
4622 && same_type_p (TREE_VALUE (arg_types
),
4625 /* If we need a cookie, adjust the number of bytes allocated. */
4628 /* Update the total size. */
4629 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4632 /* Set to (size_t)-1 if the size check fails. */
4633 gcc_assert (size_check
!= NULL_TREE
);
4634 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4635 *size
, TYPE_MAX_VALUE (sizetype
));
4637 /* Update the argument list to reflect the adjusted size. */
4638 (**args
)[0] = *size
;
4641 *cookie_size
= NULL_TREE
;
4644 /* Tell our caller which function we decided to call. */
4648 /* Build the CALL_EXPR. */
4649 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4652 /* Build a new call to operator(). This may change ARGS. */
4655 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4657 struct z_candidate
*candidates
= 0, *cand
;
4658 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4660 tree result
= NULL_TREE
;
4663 obj
= mark_lvalue_use (obj
);
4665 if (error_operand_p (obj
))
4666 return error_mark_node
;
4668 tree type
= TREE_TYPE (obj
);
4670 obj
= prep_operand (obj
);
4672 if (TYPE_PTRMEMFUNC_P (type
))
4674 if (complain
& tf_error
)
4675 /* It's no good looking for an overloaded operator() on a
4676 pointer-to-member-function. */
4677 error ("pointer-to-member function %qE cannot be called without "
4678 "an object; consider using %<.*%> or %<->*%>", obj
);
4679 return error_mark_node
;
4682 if (TYPE_BINFO (type
))
4684 fns
= lookup_fnfields (TYPE_BINFO (type
), call_op_identifier
, 1);
4685 if (fns
== error_mark_node
)
4686 return error_mark_node
;
4691 if (args
!= NULL
&& *args
!= NULL
)
4693 *args
= resolve_args (*args
, complain
);
4695 return error_mark_node
;
4698 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4699 p
= conversion_obstack_alloc (0);
4703 first_mem_arg
= obj
;
4705 add_candidates (BASELINK_FUNCTIONS (fns
),
4706 first_mem_arg
, *args
, NULL_TREE
,
4708 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4709 LOOKUP_NORMAL
, &candidates
, complain
);
4712 convs
= lookup_conversions (type
);
4714 for (; convs
; convs
= TREE_CHAIN (convs
))
4716 tree totype
= TREE_TYPE (convs
);
4718 if (TYPE_PTRFN_P (totype
)
4719 || TYPE_REFFN_P (totype
)
4720 || (TYPE_REF_P (totype
)
4721 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4722 for (ovl_iterator
iter (TREE_VALUE (convs
)); iter
; ++iter
)
4726 if (DECL_NONCONVERTING_P (fn
))
4729 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4730 add_template_conv_candidate
4731 (&candidates
, fn
, obj
, *args
, totype
,
4732 /*access_path=*/NULL_TREE
,
4733 /*conversion_path=*/NULL_TREE
, complain
);
4735 add_conv_candidate (&candidates
, fn
, obj
,
4736 *args
, /*conversion_path=*/NULL_TREE
,
4737 /*access_path=*/NULL_TREE
, complain
);
4741 /* Be strict here because if we choose a bad conversion candidate, the
4742 errors we get won't mention the call context. */
4743 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4746 if (complain
& tf_error
)
4748 auto_diagnostic_group d
;
4749 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4750 build_tree_list_vec (*args
));
4751 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4753 result
= error_mark_node
;
4757 cand
= tourney (candidates
, complain
);
4760 if (complain
& tf_error
)
4762 auto_diagnostic_group d
;
4763 error ("call of %<(%T) (%A)%> is ambiguous",
4764 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4765 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4767 result
= error_mark_node
;
4769 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4770 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
)
4771 && DECL_OVERLOADED_OPERATOR_IS (cand
->fn
, CALL_EXPR
))
4772 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4775 if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4776 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4780 gcc_checking_assert (TYPE_P (cand
->fn
));
4781 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4783 obj
= convert_from_reference (obj
);
4784 result
= cp_build_function_call_vec (obj
, args
, complain
);
4788 /* Free all the conversions we allocated. */
4789 obstack_free (&conversion_obstack
, p
);
4794 /* Wrapper for above. */
4797 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4800 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4801 ret
= build_op_call_1 (obj
, args
, complain
);
4802 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4806 /* Called by op_error to prepare format strings suitable for the error
4807 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4808 and a suffix (controlled by NTYPES). */
4811 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4815 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4816 : G_("no match for "), errmsg
, NULL
);
4819 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4820 else if (ntypes
== 2)
4821 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4823 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4829 op_error (const op_location_t
&loc
,
4830 enum tree_code code
, enum tree_code code2
,
4831 tree arg1
, tree arg2
, tree arg3
, bool match
)
4833 bool assop
= code
== MODIFY_EXPR
;
4834 const char *opname
= OVL_OP_INFO (assop
, assop
? code2
: code
)->name
;
4839 if (flag_diagnostics_show_caret
)
4840 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4842 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4844 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4845 "in %<%E ? %E : %E%>"), 3, match
),
4847 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4850 case POSTINCREMENT_EXPR
:
4851 case POSTDECREMENT_EXPR
:
4852 if (flag_diagnostics_show_caret
)
4853 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4854 opname
, TREE_TYPE (arg1
));
4856 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4858 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4862 if (flag_diagnostics_show_caret
)
4863 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4864 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4866 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4868 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4873 if (flag_diagnostics_show_caret
)
4874 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4875 opname
, TREE_TYPE (arg1
));
4877 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4878 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4883 if (flag_diagnostics_show_caret
)
4885 binary_op_rich_location
richloc (loc
, arg1
, arg2
, true);
4887 op_error_string (G_("%<operator%s%>"), 2, match
),
4888 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4891 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4893 opname
, arg1
, opname
, arg2
,
4894 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4896 if (flag_diagnostics_show_caret
)
4897 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4898 opname
, TREE_TYPE (arg1
));
4900 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4902 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4907 /* Return the implicit conversion sequence that could be used to
4908 convert E1 to E2 in [expr.cond]. */
4911 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4913 tree t1
= non_reference (TREE_TYPE (e1
));
4914 tree t2
= non_reference (TREE_TYPE (e2
));
4920 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4921 implicitly converted (clause _conv_) to the type "lvalue reference to
4922 T2", subject to the constraint that in the conversion the
4923 reference must bind directly (_dcl.init.ref_) to an lvalue.
4925 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4926 implicitly converted to the type "rvalue reference to T2", subject to
4927 the constraint that the reference must bind directly. */
4930 tree rtype
= cp_build_reference_type (t2
, !lvalue_p (e2
));
4931 conv
= implicit_conversion (rtype
,
4935 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4936 |LOOKUP_ONLYCONVERTING
,
4938 if (conv
&& !conv
->bad_p
)
4942 /* If E2 is a prvalue or if neither of the conversions above can be done
4943 and at least one of the operands has (possibly cv-qualified) class
4945 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4950 If E1 and E2 have class type, and the underlying class types are
4951 the same or one is a base class of the other: E1 can be converted
4952 to match E2 if the class of T2 is the same type as, or a base
4953 class of, the class of T1, and the cv-qualification of T2 is the
4954 same cv-qualification as, or a greater cv-qualification than, the
4955 cv-qualification of T1. If the conversion is applied, E1 is
4956 changed to an rvalue of type T2 that still refers to the original
4957 source class object (or the appropriate subobject thereof). */
4958 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4959 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4961 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4963 conv
= build_identity_conv (t1
, e1
);
4964 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4965 TYPE_MAIN_VARIANT (t2
)))
4966 conv
= build_conv (ck_base
, t2
, conv
);
4968 conv
= build_conv (ck_rvalue
, t2
, conv
);
4977 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4978 converted to the type that expression E2 would have if E2 were
4979 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4980 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4981 LOOKUP_IMPLICIT
, complain
);
4984 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4985 arguments to the conditional expression. */
4988 build_conditional_expr_1 (const op_location_t
&loc
,
4989 tree arg1
, tree arg2
, tree arg3
,
4990 tsubst_flags_t complain
)
4994 tree result
= NULL_TREE
;
4995 tree result_type
= NULL_TREE
;
4996 bool is_glvalue
= true;
4997 struct z_candidate
*candidates
= 0;
4998 struct z_candidate
*cand
;
5000 tree orig_arg2
, orig_arg3
;
5002 /* As a G++ extension, the second argument to the conditional can be
5003 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
5004 c'.) If the second operand is omitted, make sure it is
5005 calculated only once. */
5008 if (complain
& tf_error
)
5009 pedwarn (loc
, OPT_Wpedantic
,
5010 "ISO C++ forbids omitting the middle term of a ?: expression");
5012 if ((complain
& tf_warning
) && !truth_value_p (TREE_CODE (arg1
)))
5013 warn_for_omitted_condop (loc
, arg1
);
5015 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
5016 if (lvalue_p (arg1
))
5017 arg2
= arg1
= cp_stabilize_reference (arg1
);
5019 arg2
= arg1
= cp_save_expr (arg1
);
5022 /* If something has already gone wrong, just pass that fact up the
5024 if (error_operand_p (arg1
)
5025 || error_operand_p (arg2
)
5026 || error_operand_p (arg3
))
5027 return error_mark_node
;
5032 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
5034 tree arg1_type
= TREE_TYPE (arg1
);
5036 /* If arg1 is another cond_expr choosing between -1 and 0,
5037 then we can use its comparison. It may help to avoid
5038 additional comparison, produce more accurate diagnostics
5039 and enables folding. */
5040 if (TREE_CODE (arg1
) == VEC_COND_EXPR
5041 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
5042 && integer_zerop (TREE_OPERAND (arg1
, 2)))
5043 arg1
= TREE_OPERAND (arg1
, 0);
5045 arg1
= force_rvalue (arg1
, complain
);
5046 arg2
= force_rvalue (arg2
, complain
);
5047 arg3
= force_rvalue (arg3
, complain
);
5049 /* force_rvalue can return error_mark on valid arguments. */
5050 if (error_operand_p (arg1
)
5051 || error_operand_p (arg2
)
5052 || error_operand_p (arg3
))
5053 return error_mark_node
;
5055 arg2_type
= TREE_TYPE (arg2
);
5056 arg3_type
= TREE_TYPE (arg3
);
5058 if (!VECTOR_TYPE_P (arg2_type
)
5059 && !VECTOR_TYPE_P (arg3_type
))
5061 /* Rely on the error messages of the scalar version. */
5062 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
5063 orig_arg2
, orig_arg3
, complain
);
5064 if (scal
== error_mark_node
)
5065 return error_mark_node
;
5066 tree stype
= TREE_TYPE (scal
);
5067 tree ctype
= TREE_TYPE (arg1_type
);
5068 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
5069 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
5071 if (complain
& tf_error
)
5072 error_at (loc
, "inferred scalar type %qT is not an integer or "
5073 "floating point type of the same size as %qT", stype
,
5074 COMPARISON_CLASS_P (arg1
)
5075 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
5077 return error_mark_node
;
5080 tree vtype
= build_opaque_vector_type (stype
,
5081 TYPE_VECTOR_SUBPARTS (arg1_type
));
5082 /* We could pass complain & tf_warning to unsafe_conversion_p,
5083 but the warnings (like Wsign-conversion) have already been
5084 given by the scalar build_conditional_expr_1. We still check
5085 unsafe_conversion_p to forbid truncating long long -> float. */
5086 if (unsafe_conversion_p (loc
, stype
, arg2
, NULL_TREE
, false))
5088 if (complain
& tf_error
)
5089 error_at (loc
, "conversion of scalar %qH to vector %qI "
5090 "involves truncation", arg2_type
, vtype
);
5091 return error_mark_node
;
5093 if (unsafe_conversion_p (loc
, stype
, arg3
, NULL_TREE
, false))
5095 if (complain
& tf_error
)
5096 error_at (loc
, "conversion of scalar %qH to vector %qI "
5097 "involves truncation", arg3_type
, vtype
);
5098 return error_mark_node
;
5101 arg2
= cp_convert (stype
, arg2
, complain
);
5102 arg2
= save_expr (arg2
);
5103 arg2
= build_vector_from_val (vtype
, arg2
);
5105 arg3
= cp_convert (stype
, arg3
, complain
);
5106 arg3
= save_expr (arg3
);
5107 arg3
= build_vector_from_val (vtype
, arg3
);
5111 if (VECTOR_TYPE_P (arg2_type
) != VECTOR_TYPE_P (arg3_type
))
5113 enum stv_conv convert_flag
=
5114 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
5115 complain
& tf_error
);
5117 switch (convert_flag
)
5120 return error_mark_node
;
5123 arg2
= save_expr (arg2
);
5124 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
5125 arg2
= build_vector_from_val (arg3_type
, arg2
);
5126 arg2_type
= TREE_TYPE (arg2
);
5131 arg3
= save_expr (arg3
);
5132 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
5133 arg3
= build_vector_from_val (arg2_type
, arg3
);
5134 arg3_type
= TREE_TYPE (arg3
);
5142 if (!same_type_p (arg2_type
, arg3_type
)
5143 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type
),
5144 TYPE_VECTOR_SUBPARTS (arg2_type
))
5145 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
5147 if (complain
& tf_error
)
5149 "incompatible vector types in conditional expression: "
5150 "%qT, %qT and %qT", TREE_TYPE (arg1
),
5151 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
5152 return error_mark_node
;
5155 if (!COMPARISON_CLASS_P (arg1
))
5157 tree cmp_type
= build_same_sized_truth_vector_type (arg1_type
);
5158 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
5160 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
5165 The first expression is implicitly converted to bool (clause
5167 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
5169 if (error_operand_p (arg1
))
5170 return error_mark_node
;
5174 If either the second or the third operand has type (possibly
5175 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
5176 array-to-pointer (_conv.array_), and function-to-pointer
5177 (_conv.func_) standard conversions are performed on the second
5178 and third operands. */
5179 arg2_type
= unlowered_expr_type (arg2
);
5180 arg3_type
= unlowered_expr_type (arg3
);
5181 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
5183 /* 'void' won't help in resolving an overloaded expression on the
5184 other side, so require it to resolve by itself. */
5185 if (arg2_type
== unknown_type_node
)
5187 arg2
= resolve_nondeduced_context_or_error (arg2
, complain
);
5188 arg2_type
= TREE_TYPE (arg2
);
5190 if (arg3_type
== unknown_type_node
)
5192 arg3
= resolve_nondeduced_context_or_error (arg3
, complain
);
5193 arg3_type
= TREE_TYPE (arg3
);
5198 One of the following shall hold:
5200 --The second or the third operand (but not both) is a
5201 throw-expression (_except.throw_); the result is of the type
5202 and value category of the other.
5204 --Both the second and the third operands have type void; the
5205 result is of type void and is a prvalue. */
5206 if (TREE_CODE (arg2
) == THROW_EXPR
5207 && TREE_CODE (arg3
) != THROW_EXPR
)
5209 result_type
= arg3_type
;
5210 is_glvalue
= glvalue_p (arg3
);
5212 else if (TREE_CODE (arg2
) != THROW_EXPR
5213 && TREE_CODE (arg3
) == THROW_EXPR
)
5215 result_type
= arg2_type
;
5216 is_glvalue
= glvalue_p (arg2
);
5218 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
5220 result_type
= void_type_node
;
5225 if (complain
& tf_error
)
5227 if (VOID_TYPE_P (arg2_type
))
5228 error_at (cp_expr_loc_or_loc (arg3
, loc
),
5229 "second operand to the conditional operator "
5230 "is of type %<void%>, but the third operand is "
5231 "neither a throw-expression nor of type %<void%>");
5233 error_at (cp_expr_loc_or_loc (arg2
, loc
),
5234 "third operand to the conditional operator "
5235 "is of type %<void%>, but the second operand is "
5236 "neither a throw-expression nor of type %<void%>");
5238 return error_mark_node
;
5241 goto valid_operands
;
5245 Otherwise, if the second and third operand have different types,
5246 and either has (possibly cv-qualified) class type, or if both are
5247 glvalues of the same value category and the same type except for
5248 cv-qualification, an attempt is made to convert each of those operands
5249 to the type of the other. */
5250 else if (!same_type_p (arg2_type
, arg3_type
)
5251 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
5252 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
5254 && glvalue_p (arg2
) && glvalue_p (arg3
)
5255 && lvalue_p (arg2
) == lvalue_p (arg3
))))
5259 bool converted
= false;
5261 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5262 p
= conversion_obstack_alloc (0);
5264 conv2
= conditional_conversion (arg2
, arg3
, complain
);
5265 conv3
= conditional_conversion (arg3
, arg2
, complain
);
5269 If both can be converted, or one can be converted but the
5270 conversion is ambiguous, the program is ill-formed. If
5271 neither can be converted, the operands are left unchanged and
5272 further checking is performed as described below. If exactly
5273 one conversion is possible, that conversion is applied to the
5274 chosen operand and the converted operand is used in place of
5275 the original operand for the remainder of this section. */
5276 if ((conv2
&& !conv2
->bad_p
5277 && conv3
&& !conv3
->bad_p
)
5278 || (conv2
&& conv2
->kind
== ck_ambig
)
5279 || (conv3
&& conv3
->kind
== ck_ambig
))
5281 if (complain
& tf_error
)
5283 error_at (loc
, "operands to ?: have different types %qT and %qT",
5284 arg2_type
, arg3_type
);
5285 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
5286 inform (loc
, " and each type can be converted to the other");
5287 else if (conv2
&& conv2
->kind
== ck_ambig
)
5288 convert_like (conv2
, arg2
, complain
);
5290 convert_like (conv3
, arg3
, complain
);
5292 result
= error_mark_node
;
5294 else if (conv2
&& !conv2
->bad_p
)
5296 arg2
= convert_like (conv2
, arg2
, complain
);
5297 arg2
= convert_from_reference (arg2
);
5298 arg2_type
= TREE_TYPE (arg2
);
5299 /* Even if CONV2 is a valid conversion, the result of the
5300 conversion may be invalid. For example, if ARG3 has type
5301 "volatile X", and X does not have a copy constructor
5302 accepting a "volatile X&", then even if ARG2 can be
5303 converted to X, the conversion will fail. */
5304 if (error_operand_p (arg2
))
5305 result
= error_mark_node
;
5308 else if (conv3
&& !conv3
->bad_p
)
5310 arg3
= convert_like (conv3
, arg3
, complain
);
5311 arg3
= convert_from_reference (arg3
);
5312 arg3_type
= TREE_TYPE (arg3
);
5313 if (error_operand_p (arg3
))
5314 result
= error_mark_node
;
5318 /* Free all the conversions we allocated. */
5319 obstack_free (&conversion_obstack
, p
);
5324 /* If, after the conversion, both operands have class type,
5325 treat the cv-qualification of both operands as if it were the
5326 union of the cv-qualification of the operands.
5328 The standard is not clear about what to do in this
5329 circumstance. For example, if the first operand has type
5330 "const X" and the second operand has a user-defined
5331 conversion to "volatile X", what is the type of the second
5332 operand after this step? Making it be "const X" (matching
5333 the first operand) seems wrong, as that discards the
5334 qualification without actually performing a copy. Leaving it
5335 as "volatile X" seems wrong as that will result in the
5336 conditional expression failing altogether, even though,
5337 according to this step, the one operand could be converted to
5338 the type of the other. */
5340 && CLASS_TYPE_P (arg2_type
)
5341 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
5342 arg2_type
= arg3_type
=
5343 cp_build_qualified_type (arg2_type
,
5344 cp_type_quals (arg2_type
)
5345 | cp_type_quals (arg3_type
));
5350 If the second and third operands are glvalues of the same value
5351 category and have the same type, the result is of that type and
5353 if (((lvalue_p (arg2
) && lvalue_p (arg3
))
5354 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
5355 && same_type_p (arg2_type
, arg3_type
))
5357 result_type
= arg2_type
;
5358 arg2
= mark_lvalue_use (arg2
);
5359 arg3
= mark_lvalue_use (arg3
);
5360 goto valid_operands
;
5365 Otherwise, the result is an rvalue. If the second and third
5366 operand do not have the same type, and either has (possibly
5367 cv-qualified) class type, overload resolution is used to
5368 determine the conversions (if any) to be applied to the operands
5369 (_over.match.oper_, _over.built_). */
5371 if (!same_type_p (arg2_type
, arg3_type
)
5372 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5378 /* Rearrange the arguments so that add_builtin_candidate only has
5379 to know about two args. In build_builtin_candidate, the
5380 arguments are unscrambled. */
5384 add_builtin_candidates (&candidates
,
5387 ovl_op_identifier (false, COND_EXPR
),
5389 LOOKUP_NORMAL
, complain
);
5393 If the overload resolution fails, the program is
5395 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5398 if (complain
& tf_error
)
5399 error_at (loc
, "operands to ?: have different types %qT and %qT",
5400 arg2_type
, arg3_type
);
5401 return error_mark_node
;
5403 cand
= tourney (candidates
, complain
);
5406 if (complain
& tf_error
)
5408 auto_diagnostic_group d
;
5409 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5410 print_z_candidates (loc
, candidates
);
5412 return error_mark_node
;
5417 Otherwise, the conversions thus determined are applied, and
5418 the converted operands are used in place of the original
5419 operands for the remainder of this section. */
5420 conv
= cand
->convs
[0];
5421 arg1
= convert_like (conv
, arg1
, complain
);
5422 conv
= cand
->convs
[1];
5423 arg2
= convert_like (conv
, arg2
, complain
);
5424 arg2_type
= TREE_TYPE (arg2
);
5425 conv
= cand
->convs
[2];
5426 arg3
= convert_like (conv
, arg3
, complain
);
5427 arg3_type
= TREE_TYPE (arg3
);
5432 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5433 and function-to-pointer (_conv.func_) standard conversions are
5434 performed on the second and third operands.
5436 We need to force the lvalue-to-rvalue conversion here for class types,
5437 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5438 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5441 arg2
= force_rvalue (arg2
, complain
);
5442 if (!CLASS_TYPE_P (arg2_type
))
5443 arg2_type
= TREE_TYPE (arg2
);
5445 arg3
= force_rvalue (arg3
, complain
);
5446 if (!CLASS_TYPE_P (arg3_type
))
5447 arg3_type
= TREE_TYPE (arg3
);
5449 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5450 return error_mark_node
;
5454 After those conversions, one of the following shall hold:
5456 --The second and third operands have the same type; the result is of
5458 if (same_type_p (arg2_type
, arg3_type
))
5459 result_type
= arg2_type
;
5462 --The second and third operands have arithmetic or enumeration
5463 type; the usual arithmetic conversions are performed to bring
5464 them to a common type, and the result is of that type. */
5465 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5466 || UNSCOPED_ENUM_P (arg2_type
))
5467 && (ARITHMETIC_TYPE_P (arg3_type
)
5468 || UNSCOPED_ENUM_P (arg3_type
)))
5470 /* In this case, there is always a common type. */
5471 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5473 if (complain
& tf_warning
)
5474 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5475 "implicit conversion from %qH to %qI to "
5476 "match other result of conditional",
5479 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5480 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5482 tree stripped_orig_arg2
= tree_strip_any_location_wrapper (orig_arg2
);
5483 tree stripped_orig_arg3
= tree_strip_any_location_wrapper (orig_arg3
);
5484 if (TREE_CODE (stripped_orig_arg2
) == CONST_DECL
5485 && TREE_CODE (stripped_orig_arg3
) == CONST_DECL
5486 && (DECL_CONTEXT (stripped_orig_arg2
)
5487 == DECL_CONTEXT (stripped_orig_arg3
)))
5488 /* Two enumerators from the same enumeration can have different
5489 types when the enumeration is still being defined. */;
5490 else if (complain
& tf_warning
)
5491 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5492 "conditional expression: %qT vs %qT",
5493 arg2_type
, arg3_type
);
5495 else if (extra_warnings
5496 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5497 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5498 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5499 && !same_type_p (arg2_type
,
5500 type_promotes_to (arg3_type
)))))
5502 if (complain
& tf_warning
)
5503 warning_at (loc
, OPT_Wextra
, "enumeral and non-enumeral type in "
5504 "conditional expression");
5507 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5508 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5512 --The second and third operands have pointer type, or one has
5513 pointer type and the other is a null pointer constant; pointer
5514 conversions (_conv.ptr_) and qualification conversions
5515 (_conv.qual_) are performed to bring them to their composite
5516 pointer type (_expr.rel_). The result is of the composite
5519 --The second and third operands have pointer to member type, or
5520 one has pointer to member type and the other is a null pointer
5521 constant; pointer to member conversions (_conv.mem_) and
5522 qualification conversions (_conv.qual_) are performed to bring
5523 them to a common type, whose cv-qualification shall match the
5524 cv-qualification of either the second or the third operand.
5525 The result is of the common type. */
5526 else if ((null_ptr_cst_p (arg2
)
5527 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5528 || (null_ptr_cst_p (arg3
)
5529 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5530 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5531 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5532 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5534 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5535 arg3
, CPO_CONDITIONAL_EXPR
,
5537 if (result_type
== error_mark_node
)
5538 return error_mark_node
;
5539 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5540 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5545 if (complain
& tf_error
)
5546 error_at (loc
, "operands to ?: have different types %qT and %qT",
5547 arg2_type
, arg3_type
);
5548 return error_mark_node
;
5551 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5552 return error_mark_node
;
5555 if (processing_template_decl
&& is_glvalue
)
5557 /* Let lvalue_kind know this was a glvalue. */
5558 tree arg
= (result_type
== arg2_type
? arg2
: arg3
);
5559 result_type
= cp_build_reference_type (result_type
, xvalue_p (arg
));
5562 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5564 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5565 warn here, because the COND_EXPR will be turned into ARG2. */
5566 if (warn_duplicated_branches
5567 && (complain
& tf_warning
)
5568 && (arg2
== arg3
|| operand_equal_p (arg2
, arg3
, 0)))
5569 warning_at (EXPR_LOCATION (result
), OPT_Wduplicated_branches
,
5570 "this condition has identical branches");
5572 /* We can't use result_type below, as fold might have returned a
5577 /* Expand both sides into the same slot, hopefully the target of
5578 the ?: expression. We used to check for TARGET_EXPRs here,
5579 but now we sometimes wrap them in NOP_EXPRs so the test would
5581 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5582 result
= get_target_expr_sfinae (result
, complain
);
5583 /* If this expression is an rvalue, but might be mistaken for an
5584 lvalue, we must add a NON_LVALUE_EXPR. */
5585 result
= rvalue (result
);
5588 result
= force_paren_expr (result
);
5593 /* Wrapper for above. */
5596 build_conditional_expr (const op_location_t
&loc
,
5597 tree arg1
, tree arg2
, tree arg3
,
5598 tsubst_flags_t complain
)
5601 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5602 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5603 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5607 /* OPERAND is an operand to an expression. Perform necessary steps
5608 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5612 prep_operand (tree operand
)
5616 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5617 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5618 /* Make sure the template type is instantiated now. */
5619 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5625 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5626 OVERLOAD) to the CANDIDATES, returning an updated list of
5627 CANDIDATES. The ARGS are the arguments provided to the call;
5628 if FIRST_ARG is non-null it is the implicit object argument,
5629 otherwise the first element of ARGS is used if needed. The
5630 EXPLICIT_TARGS are explicit template arguments provided.
5631 TEMPLATE_ONLY is true if only template functions should be
5632 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5633 add_function_candidate. */
5636 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5638 tree explicit_targs
, bool template_only
,
5639 tree conversion_path
, tree access_path
,
5641 struct z_candidate
**candidates
,
5642 tsubst_flags_t complain
)
5645 const vec
<tree
, va_gc
> *non_static_args
;
5646 bool check_list_ctor
= false;
5647 bool check_converting
= false;
5648 unification_kind_t strict
;
5653 /* Precalculate special handling of constructors and conversion ops. */
5654 tree fn
= OVL_FIRST (fns
);
5655 if (DECL_CONV_FN_P (fn
))
5657 check_list_ctor
= false;
5658 check_converting
= (flags
& LOOKUP_ONLYCONVERTING
) != 0;
5659 if (flags
& LOOKUP_NO_CONVERSION
)
5660 /* We're doing return_type(x). */
5661 strict
= DEDUCE_CONV
;
5663 /* We're doing x.operator return_type(). */
5664 strict
= DEDUCE_EXACT
;
5665 /* [over.match.funcs] For conversion functions, the function
5666 is considered to be a member of the class of the implicit
5667 object argument for the purpose of defining the type of
5668 the implicit object parameter. */
5669 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5673 if (DECL_CONSTRUCTOR_P (fn
))
5675 check_list_ctor
= (flags
& LOOKUP_LIST_ONLY
) != 0;
5676 /* For list-initialization we consider explicit constructors
5677 and complain if one is chosen. */
5679 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5680 == LOOKUP_ONLYCONVERTING
);
5682 strict
= DEDUCE_CALL
;
5683 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5687 non_static_args
= args
;
5689 /* Delay creating the implicit this parameter until it is needed. */
5690 non_static_args
= NULL
;
5692 for (lkp_iterator
iter (fns
); iter
; ++iter
)
5696 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5698 if (check_list_ctor
&& !is_list_ctor (fn
))
5701 tree fn_first_arg
= NULL_TREE
;
5702 const vec
<tree
, va_gc
> *fn_args
= args
;
5704 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5706 /* Figure out where the object arg comes from. If this
5707 function is a non-static member and we didn't get an
5708 implicit object argument, move it out of args. */
5709 if (first_arg
== NULL_TREE
)
5713 vec
<tree
, va_gc
> *tempvec
;
5714 vec_alloc (tempvec
, args
->length () - 1);
5715 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5716 tempvec
->quick_push (arg
);
5717 non_static_args
= tempvec
;
5718 first_arg
= (*args
)[0];
5721 fn_first_arg
= first_arg
;
5722 fn_args
= non_static_args
;
5725 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5726 add_template_candidate (candidates
,
5738 else if (!template_only
)
5739 add_function_candidate (candidates
,
5752 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5753 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5756 op_is_ordered (tree_code code
)
5762 return (flag_strong_eval_order
> 1 ? -1 : 0);
5766 return (flag_strong_eval_order
> 1 ? 1 : 0);
5769 // Not overloadable (yet).
5771 // Only one argument.
5778 return (flag_strong_eval_order
? 1 : 0);
5786 build_new_op_1 (const op_location_t
&loc
, enum tree_code code
, int flags
,
5787 tree arg1
, tree arg2
, tree arg3
, tree
*overload
,
5788 tsubst_flags_t complain
)
5790 struct z_candidate
*candidates
= 0, *cand
;
5791 vec
<tree
, va_gc
> *arglist
;
5793 tree result
= NULL_TREE
;
5794 bool result_valid_p
= false;
5795 enum tree_code code2
= NOP_EXPR
;
5796 enum tree_code code_orig_arg1
= ERROR_MARK
;
5797 enum tree_code code_orig_arg2
= ERROR_MARK
;
5803 if (error_operand_p (arg1
)
5804 || error_operand_p (arg2
)
5805 || error_operand_p (arg3
))
5806 return error_mark_node
;
5808 bool ismodop
= code
== MODIFY_EXPR
;
5811 code2
= TREE_CODE (arg3
);
5814 tree fnname
= ovl_op_identifier (ismodop
, ismodop
? code2
: code
);
5816 arg1
= prep_operand (arg1
);
5818 bool memonly
= false;
5823 case VEC_DELETE_EXPR
:
5825 /* Use build_op_new_call and build_op_delete_call instead. */
5829 /* Use build_op_call instead. */
5832 case TRUTH_ORIF_EXPR
:
5833 case TRUTH_ANDIF_EXPR
:
5834 case TRUTH_AND_EXPR
:
5836 /* These are saved for the sake of warn_logical_operator. */
5837 code_orig_arg1
= TREE_CODE (arg1
);
5838 code_orig_arg2
= TREE_CODE (arg2
);
5846 /* These are saved for the sake of maybe_warn_bool_compare. */
5847 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5848 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5851 /* =, ->, [], () must be non-static member functions. */
5853 if (code2
!= NOP_EXPR
)
5865 arg2
= prep_operand (arg2
);
5866 arg3
= prep_operand (arg3
);
5868 if (code
== COND_EXPR
)
5869 /* Use build_conditional_expr instead. */
5871 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5872 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5875 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5876 arg2
= integer_zero_node
;
5878 vec_alloc (arglist
, 3);
5879 arglist
->quick_push (arg1
);
5880 if (arg2
!= NULL_TREE
)
5881 arglist
->quick_push (arg2
);
5882 if (arg3
!= NULL_TREE
)
5883 arglist
->quick_push (arg3
);
5885 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5886 p
= conversion_obstack_alloc (0);
5888 /* Add namespace-scope operators to the list of functions to
5892 tree fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/true, 0, 0);
5893 fns
= lookup_arg_dependent (fnname
, fns
, arglist
);
5894 add_candidates (fns
, NULL_TREE
, arglist
, NULL_TREE
,
5895 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5896 flags
, &candidates
, complain
);
5901 args
[2] = NULL_TREE
;
5903 /* Add class-member operators to the candidate set. */
5904 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5908 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5909 if (fns
== error_mark_node
)
5911 result
= error_mark_node
;
5912 goto user_defined_result_ready
;
5915 add_candidates (BASELINK_FUNCTIONS (fns
),
5916 NULL_TREE
, arglist
, NULL_TREE
,
5918 BASELINK_BINFO (fns
),
5919 BASELINK_ACCESS_BINFO (fns
),
5920 flags
, &candidates
, complain
);
5922 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5923 only non-member functions that have type T1 or reference to
5924 cv-qualified-opt T1 for the first argument, if the first argument
5925 has an enumeration type, or T2 or reference to cv-qualified-opt
5926 T2 for the second argument, if the second argument has an
5927 enumeration type. Filter out those that don't match. */
5928 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5930 struct z_candidate
**candp
, **next
;
5932 for (candp
= &candidates
; *candp
; candp
= next
)
5934 tree parmlist
, parmtype
;
5935 int i
, nargs
= (arg2
? 2 : 1);
5940 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5942 for (i
= 0; i
< nargs
; ++i
)
5944 parmtype
= TREE_VALUE (parmlist
);
5946 if (TYPE_REF_P (parmtype
))
5947 parmtype
= TREE_TYPE (parmtype
);
5948 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5949 && (same_type_ignoring_top_level_qualifiers_p
5950 (TREE_TYPE (args
[i
]), parmtype
)))
5953 parmlist
= TREE_CHAIN (parmlist
);
5956 /* No argument has an appropriate type, so remove this
5957 candidate function from the list. */
5960 *candp
= cand
->next
;
5966 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5973 /* For these, the built-in candidates set is empty
5974 [over.match.oper]/3. We don't want non-strict matches
5975 because exact matches are always possible with built-in
5976 operators. The built-in candidate set for COMPONENT_REF
5977 would be empty too, but since there are no such built-in
5978 operators, we accept non-strict matches for them. */
5987 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5992 case POSTINCREMENT_EXPR
:
5993 case POSTDECREMENT_EXPR
:
5994 /* Don't try anything fancy if we're not allowed to produce
5996 if (!(complain
& tf_error
))
5997 return error_mark_node
;
5999 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
6000 distinguish between prefix and postfix ++ and
6001 operator++() was used for both, so we allow this with
6005 const char *msg
= (flag_permissive
)
6006 ? G_("no %<%D(int)%> declared for postfix %qs,"
6007 " trying prefix operator instead")
6008 : G_("no %<%D(int)%> declared for postfix %qs");
6009 permerror (loc
, msg
, fnname
, OVL_OP_INFO (false, code
)->name
);
6012 if (!flag_permissive
)
6013 return error_mark_node
;
6015 if (code
== POSTINCREMENT_EXPR
)
6016 code
= PREINCREMENT_EXPR
;
6018 code
= PREDECREMENT_EXPR
;
6019 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
6020 NULL_TREE
, overload
, complain
);
6023 /* The caller will deal with these. */
6028 result_valid_p
= true;
6032 if (complain
& tf_error
)
6034 /* If one of the arguments of the operator represents
6035 an invalid use of member function pointer, try to report
6036 a meaningful error ... */
6037 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
6038 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
6039 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
6040 /* We displayed the error message. */;
6043 /* ... Otherwise, report the more generic
6044 "no matching operator found" error */
6045 auto_diagnostic_group d
;
6046 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
6047 print_z_candidates (loc
, candidates
);
6050 result
= error_mark_node
;
6056 cand
= tourney (candidates
, complain
);
6059 if (complain
& tf_error
)
6061 auto_diagnostic_group d
;
6062 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
6063 print_z_candidates (loc
, candidates
);
6065 result
= error_mark_node
;
6067 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
6070 *overload
= cand
->fn
;
6072 if (resolve_args (arglist
, complain
) == NULL
)
6073 result
= error_mark_node
;
6075 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
6077 if (trivial_fn_p (cand
->fn
))
6078 /* There won't be a CALL_EXPR. */;
6079 else if (result
&& result
!= error_mark_node
)
6081 tree call
= extract_call_expr (result
);
6082 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
6084 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
6085 /* This prevents build_new_function_call from discarding this
6086 function during instantiation of the enclosing template. */
6087 KOENIG_LOOKUP_P (call
) = 1;
6089 /* Specify evaluation order as per P0145R2. */
6090 CALL_EXPR_ORDERED_ARGS (call
) = false;
6091 switch (op_is_ordered (code
))
6094 CALL_EXPR_REVERSE_ARGS (call
) = true;
6098 CALL_EXPR_ORDERED_ARGS (call
) = true;
6108 /* Give any warnings we noticed during overload resolution. */
6109 if (cand
->warnings
&& (complain
& tf_warning
))
6111 struct candidate_warning
*w
;
6112 for (w
= cand
->warnings
; w
; w
= w
->next
)
6113 joust (cand
, w
->loser
, 1, complain
);
6116 /* Check for comparison of different enum types. */
6125 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
6126 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
6127 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
6128 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
6129 && (complain
& tf_warning
))
6131 warning (OPT_Wenum_compare
,
6132 "comparison between %q#T and %q#T",
6133 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
6140 /* We need to strip any leading REF_BIND so that bitfields
6141 don't cause errors. This should not remove any important
6142 conversions, because builtins don't apply to class
6143 objects directly. */
6144 conv
= cand
->convs
[0];
6145 if (conv
->kind
== ck_ref_bind
)
6146 conv
= next_conversion (conv
);
6147 arg1
= convert_like (conv
, arg1
, complain
);
6151 conv
= cand
->convs
[1];
6152 if (conv
->kind
== ck_ref_bind
)
6153 conv
= next_conversion (conv
);
6155 arg2
= decay_conversion (arg2
, complain
);
6157 /* We need to call warn_logical_operator before
6158 converting arg2 to a boolean_type, but after
6159 decaying an enumerator to its value. */
6160 if (complain
& tf_warning
)
6161 warn_logical_operator (loc
, code
, boolean_type_node
,
6162 code_orig_arg1
, arg1
,
6163 code_orig_arg2
, arg2
);
6165 arg2
= convert_like (conv
, arg2
, complain
);
6169 conv
= cand
->convs
[2];
6170 if (conv
->kind
== ck_ref_bind
)
6171 conv
= next_conversion (conv
);
6172 arg3
= convert_like (conv
, arg3
, complain
);
6178 user_defined_result_ready
:
6180 /* Free all the conversions we allocated. */
6181 obstack_free (&conversion_obstack
, p
);
6183 if (result
|| result_valid_p
)
6190 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
6193 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
6195 case TRUTH_ANDIF_EXPR
:
6196 case TRUTH_ORIF_EXPR
:
6197 case TRUTH_AND_EXPR
:
6199 if (complain
& tf_warning
)
6200 warn_logical_operator (loc
, code
, boolean_type_node
,
6201 code_orig_arg1
, arg1
,
6202 code_orig_arg2
, arg2
);
6210 if ((complain
& tf_warning
)
6211 && ((code_orig_arg1
== BOOLEAN_TYPE
)
6212 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
6213 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
6214 if (complain
& tf_warning
&& warn_tautological_compare
)
6215 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
6220 case TRUNC_DIV_EXPR
:
6225 case TRUNC_MOD_EXPR
:
6229 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
6231 case UNARY_PLUS_EXPR
:
6234 case TRUTH_NOT_EXPR
:
6235 case PREINCREMENT_EXPR
:
6236 case POSTINCREMENT_EXPR
:
6237 case PREDECREMENT_EXPR
:
6238 case POSTDECREMENT_EXPR
:
6242 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
6245 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
6248 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
6252 /* The caller will deal with these. */
6264 /* Wrapper for above. */
6267 build_new_op (const op_location_t
&loc
, enum tree_code code
, int flags
,
6268 tree arg1
, tree arg2
, tree arg3
,
6269 tree
*overload
, tsubst_flags_t complain
)
6272 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
6273 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
6274 overload
, complain
);
6275 timevar_cond_stop (TV_OVERLOAD
, subtime
);
6279 /* CALL was returned by some call-building function; extract the actual
6280 CALL_EXPR from any bits that have been tacked on, e.g. by
6281 convert_from_reference. */
6284 extract_call_expr (tree call
)
6286 while (TREE_CODE (call
) == COMPOUND_EXPR
)
6287 call
= TREE_OPERAND (call
, 1);
6288 if (REFERENCE_REF_P (call
))
6289 call
= TREE_OPERAND (call
, 0);
6290 if (TREE_CODE (call
) == TARGET_EXPR
)
6291 call
= TARGET_EXPR_INITIAL (call
);
6292 gcc_assert (TREE_CODE (call
) == CALL_EXPR
6293 || TREE_CODE (call
) == AGGR_INIT_EXPR
6294 || call
== error_mark_node
);
6298 /* Returns true if FN has two parameters, of which the second has type
6302 second_parm_is_size_t (tree fn
)
6304 tree t
= FUNCTION_ARG_CHAIN (fn
);
6305 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6308 if (t
== void_list_node
)
6313 /* True if T, an allocation function, has std::align_val_t as its second
6317 aligned_allocation_fn_p (tree t
)
6319 if (!aligned_new_threshold
)
6322 tree a
= FUNCTION_ARG_CHAIN (t
);
6323 return (a
&& same_type_p (TREE_VALUE (a
), align_type_node
));
6326 /* True if T is std::destroying_delete_t. */
6329 std_destroying_delete_t_p (tree t
)
6331 return (TYPE_CONTEXT (t
) == std_node
6332 && id_equal (TYPE_IDENTIFIER (t
), "destroying_delete_t"));
6335 /* A deallocation function with at least two parameters whose second parameter
6336 type is of type std::destroying_delete_t is a destroying operator delete. A
6337 destroying operator delete shall be a class member function named operator
6338 delete. [ Note: Array deletion cannot use a destroying operator
6339 delete. --end note ] */
6342 destroying_delete_p (tree t
)
6344 tree a
= TYPE_ARG_TYPES (TREE_TYPE (t
));
6345 if (!a
|| !TREE_CHAIN (a
))
6347 tree type
= TREE_VALUE (TREE_CHAIN (a
));
6348 return std_destroying_delete_t_p (type
) ? type
: NULL_TREE
;
6351 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6352 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6353 std::align_val_t. */
6356 aligned_deallocation_fn_p (tree t
)
6358 if (!aligned_new_threshold
)
6361 /* A template instance is never a usual deallocation function,
6362 regardless of its signature. */
6363 if (TREE_CODE (t
) == TEMPLATE_DECL
6364 || primary_template_specialization_p (t
))
6367 tree a
= FUNCTION_ARG_CHAIN (t
);
6368 if (destroying_delete_p (t
))
6370 if (same_type_p (TREE_VALUE (a
), align_type_node
)
6371 && TREE_CHAIN (a
) == void_list_node
)
6373 if (!same_type_p (TREE_VALUE (a
), size_type_node
))
6376 if (a
&& same_type_p (TREE_VALUE (a
), align_type_node
)
6377 && TREE_CHAIN (a
) == void_list_node
)
6382 /* Returns true if FN is a usual deallocation fn with a size_t parameter. */
6385 sized_deallocation_fn_p (tree fn
)
6387 tree t
= FUNCTION_ARG_CHAIN (fn
);
6388 if (destroying_delete_p (fn
))
6390 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6393 if (t
== void_list_node
)
6395 if (aligned_new_threshold
&& t
6396 && same_type_p (TREE_VALUE (t
), align_type_node
)
6397 && TREE_CHAIN (t
) == void_list_node
)
6402 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6403 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6406 usual_deallocation_fn_p (tree t
)
6408 /* A template instance is never a usual deallocation function,
6409 regardless of its signature. */
6410 if (TREE_CODE (t
) == TEMPLATE_DECL
6411 || primary_template_specialization_p (t
))
6414 /* A usual deallocation function is a deallocation function whose parameters
6416 - optionally, a parameter of type std::destroying_delete_t, then
6417 - optionally, a parameter of type std::size_t, then
6418 - optionally, a parameter of type std::align_val_t. */
6419 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
6420 tree chain
= FUNCTION_ARG_CHAIN (t
);
6423 if (destroying_delete_p (t
))
6424 chain
= TREE_CHAIN (chain
);
6425 if (chain
== void_list_node
6426 || ((!global
|| flag_sized_deallocation
)
6427 && sized_deallocation_fn_p (t
)))
6429 if (aligned_deallocation_fn_p (t
))
6434 /* Build a call to operator delete. This has to be handled very specially,
6435 because the restrictions on what signatures match are different from all
6436 other call instances. For a normal delete, only a delete taking (void *)
6437 or (void *, size_t) is accepted. For a placement delete, only an exact
6438 match with the placement new is accepted.
6440 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6441 ADDR is the pointer to be deleted.
6442 SIZE is the size of the memory block to be deleted.
6443 GLOBAL_P is true if the delete-expression should not consider
6444 class-specific delete operators.
6445 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6447 If this call to "operator delete" is being generated as part to
6448 deallocate memory allocated via a new-expression (as per [expr.new]
6449 which requires that if the initialization throws an exception then
6450 we call a deallocation function), then ALLOC_FN is the allocation
6454 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
6455 bool global_p
, tree placement
,
6456 tree alloc_fn
, tsubst_flags_t complain
)
6458 tree fn
= NULL_TREE
;
6459 tree fns
, fnname
, type
, t
;
6461 if (addr
== error_mark_node
)
6462 return error_mark_node
;
6464 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6466 fnname
= ovl_op_identifier (false, code
);
6468 if (CLASS_TYPE_P (type
)
6469 && COMPLETE_TYPE_P (complete_type (type
))
6473 If the result of the lookup is ambiguous or inaccessible, or if
6474 the lookup selects a placement deallocation function, the
6475 program is ill-formed.
6477 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6479 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6480 if (fns
== error_mark_node
)
6481 return error_mark_node
;
6486 if (fns
== NULL_TREE
)
6487 fns
= lookup_name_nonclass (fnname
);
6489 /* Strip const and volatile from addr. */
6491 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6495 /* "A declaration of a placement deallocation function matches the
6496 declaration of a placement allocation function if it has the same
6497 number of parameters and, after parameter transformations (8.3.5),
6498 all parameter types except the first are identical."
6500 So we build up the function type we want and ask instantiate_type
6501 to get it for us. */
6502 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6503 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6504 t
= build_function_type (void_type_node
, t
);
6506 fn
= instantiate_type (t
, fns
, tf_none
);
6507 if (fn
== error_mark_node
)
6510 fn
= MAYBE_BASELINK_FUNCTIONS (fn
);
6512 /* "If the lookup finds the two-parameter form of a usual deallocation
6513 function (3.7.4.2) and that function, considered as a placement
6514 deallocation function, would have been selected as a match for the
6515 allocation function, the program is ill-formed." */
6516 if (second_parm_is_size_t (fn
))
6518 const char *const msg1
6519 = G_("exception cleanup for this placement new selects "
6520 "non-placement operator delete");
6521 const char *const msg2
6522 = G_("%qD is a usual (non-placement) deallocation "
6523 "function in C++14 (or with -fsized-deallocation)");
6525 /* But if the class has an operator delete (void *), then that is
6526 the usual deallocation function, so we shouldn't complain
6527 about using the operator delete (void *, size_t). */
6528 if (DECL_CLASS_SCOPE_P (fn
))
6529 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
));
6533 if (usual_deallocation_fn_p (elt
)
6534 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6537 /* Before C++14 a two-parameter global deallocation function is
6538 always a placement deallocation function, but warn if
6540 else if (!flag_sized_deallocation
)
6542 if (complain
& tf_warning
)
6544 auto_diagnostic_group d
;
6545 if (warning (OPT_Wc__14_compat
, msg1
))
6546 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6551 if (complain
& tf_warning_or_error
)
6553 auto_diagnostic_group d
;
6554 if (permerror (input_location
, msg1
))
6556 /* Only mention C++14 for namespace-scope delete. */
6557 if (DECL_NAMESPACE_SCOPE_P (fn
))
6558 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6560 inform (DECL_SOURCE_LOCATION (fn
),
6561 "%qD is a usual (non-placement) deallocation "
6566 return error_mark_node
;
6571 /* "Any non-placement deallocation function matches a non-placement
6572 allocation function. If the lookup finds a single matching
6573 deallocation function, that function will be called; otherwise, no
6574 deallocation function will be called." */
6575 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
)); iter
; ++iter
)
6578 if (usual_deallocation_fn_p (elt
))
6586 /* -- If any of the deallocation functions is a destroying
6587 operator delete, all deallocation functions that are not
6588 destroying operator deletes are eliminated from further
6590 bool fn_destroying
= destroying_delete_p (fn
);
6591 bool elt_destroying
= destroying_delete_p (elt
);
6592 if (elt_destroying
!= fn_destroying
)
6599 /* -- If the type has new-extended alignment, a function with a
6600 parameter of type std::align_val_t is preferred; otherwise a
6601 function without such a parameter is preferred. If exactly one
6602 preferred function is found, that function is selected and the
6603 selection process terminates. If more than one preferred
6604 function is found, all non-preferred functions are eliminated
6605 from further consideration. */
6606 if (aligned_new_threshold
)
6608 bool want_align
= type_has_new_extended_alignment (type
);
6609 bool fn_align
= aligned_deallocation_fn_p (fn
);
6610 bool elt_align
= aligned_deallocation_fn_p (elt
);
6612 if (elt_align
!= fn_align
)
6614 if (want_align
== elt_align
)
6620 /* -- If the deallocation functions have class scope, the one
6621 without a parameter of type std::size_t is selected. */
6623 if (DECL_CLASS_SCOPE_P (fn
))
6626 /* -- If the type is complete and if, for the second alternative
6627 (delete array) only, the operand is a pointer to a class type
6628 with a non-trivial destructor or a (possibly multi-dimensional)
6629 array thereof, the function with a parameter of type std::size_t
6632 -- Otherwise, it is unspecified whether a deallocation function
6633 with a parameter of type std::size_t is selected. */
6636 want_size
= COMPLETE_TYPE_P (type
);
6637 if (code
== VEC_DELETE_EXPR
6638 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6639 /* We need a cookie to determine the array size. */
6642 bool fn_size
= sized_deallocation_fn_p (fn
);
6643 bool elt_size
= sized_deallocation_fn_p (elt
);
6644 gcc_assert (fn_size
!= elt_size
);
6645 if (want_size
== elt_size
)
6650 /* If we have a matching function, call it. */
6653 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6655 /* If the FN is a member function, make sure that it is
6657 if (BASELINK_P (fns
))
6658 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6661 /* Core issue 901: It's ok to new a type with deleted delete. */
6662 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6667 /* The placement args might not be suitable for overload
6668 resolution at this point, so build the call directly. */
6669 int nargs
= call_expr_nargs (placement
);
6670 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6673 for (i
= 1; i
< nargs
; i
++)
6674 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6675 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6676 return error_mark_node
;
6677 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6681 tree destroying
= destroying_delete_p (fn
);
6684 /* Strip const and volatile from addr but retain the type of the
6686 tree rtype
= TREE_TYPE (TREE_TYPE (oaddr
));
6687 rtype
= cv_unqualified (rtype
);
6688 rtype
= TYPE_POINTER_TO (rtype
);
6689 addr
= cp_convert (rtype
, oaddr
, complain
);
6690 destroying
= build_functional_cast (destroying
, NULL_TREE
,
6695 vec
<tree
, va_gc
> *args
= make_tree_vector ();
6696 args
->quick_push (addr
);
6698 args
->quick_push (destroying
);
6699 if (sized_deallocation_fn_p (fn
))
6700 args
->quick_push (size
);
6701 if (aligned_deallocation_fn_p (fn
))
6703 tree al
= build_int_cst (align_type_node
, TYPE_ALIGN_UNIT (type
));
6704 args
->quick_push (al
);
6706 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6707 release_tree_vector (args
);
6714 If no unambiguous matching deallocation function can be found,
6715 propagating the exception does not cause the object's memory to
6719 if ((complain
& tf_warning
)
6721 warning (0, "no corresponding deallocation function for %qD",
6726 if (complain
& tf_error
)
6727 error ("no suitable %<operator %s%> for %qT",
6728 OVL_OP_INFO (false, code
)->name
, type
);
6729 return error_mark_node
;
6732 /* Issue diagnostics about a disallowed access of DECL, using DIAG_DECL
6735 If ISSUE_ERROR is true, then issue an error about the
6736 access, followed by a note showing the declaration.
6737 Otherwise, just show the note. */
6740 complain_about_access (tree decl
, tree diag_decl
, bool issue_error
)
6742 if (TREE_PRIVATE (decl
))
6745 error ("%q#D is private within this context", diag_decl
);
6746 inform (DECL_SOURCE_LOCATION (diag_decl
),
6747 "declared private here");
6749 else if (TREE_PROTECTED (decl
))
6752 error ("%q#D is protected within this context", diag_decl
);
6753 inform (DECL_SOURCE_LOCATION (diag_decl
),
6754 "declared protected here");
6759 error ("%q#D is inaccessible within this context", diag_decl
);
6760 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6764 /* If the current scope isn't allowed to access DECL along
6765 BASETYPE_PATH, give an error. The most derived class in
6766 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6767 the declaration to use in the error diagnostic. */
6770 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6771 tsubst_flags_t complain
, access_failure_info
*afi
)
6773 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6775 if (flag_new_inheriting_ctors
6776 && DECL_INHERITED_CTOR (decl
))
6778 /* 7.3.3/18: The additional constructors are accessible if they would be
6779 accessible when used to construct an object of the corresponding base
6781 decl
= strip_inheriting_ctors (decl
);
6782 basetype_path
= lookup_base (basetype_path
, DECL_CONTEXT (decl
),
6783 ba_any
, NULL
, complain
);
6786 if (!accessible_p (basetype_path
, decl
, true))
6788 if (flag_new_inheriting_ctors
)
6789 diag_decl
= strip_inheriting_ctors (diag_decl
);
6790 if (complain
& tf_error
)
6791 complain_about_access (decl
, diag_decl
, true);
6793 afi
->record_access_failure (basetype_path
, decl
, diag_decl
);
6800 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6801 bitwise or of LOOKUP_* values. If any errors are warnings are
6802 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6803 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6807 build_temp (tree expr
, tree type
, int flags
,
6808 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6811 vec
<tree
, va_gc
> *args
;
6813 *diagnostic_kind
= DK_UNSPECIFIED
;
6815 /* If the source is a packed field, calling the copy constructor will require
6816 binding the field to the reference parameter to the copy constructor, and
6817 we'll end up with an infinite loop. If we can use a bitwise copy, then
6819 if ((lvalue_kind (expr
) & clk_packed
)
6820 && CLASS_TYPE_P (TREE_TYPE (expr
))
6821 && !type_has_nontrivial_copy_init (TREE_TYPE (expr
)))
6822 return get_target_expr_sfinae (expr
, complain
);
6824 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6825 args
= make_tree_vector_single (expr
);
6826 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6827 &args
, type
, flags
, complain
);
6828 release_tree_vector (args
);
6829 if (warningcount
+ werrorcount
> savew
)
6830 *diagnostic_kind
= DK_WARNING
;
6831 else if (errorcount
> savee
)
6832 *diagnostic_kind
= DK_ERROR
;
6836 /* Get any location for EXPR, falling back to input_location.
6838 If the result is in a system header and is the virtual location for
6839 a token coming from the expansion of a macro, unwind it to the
6840 location of the expansion point of the macro (e.g. to avoid the
6841 diagnostic being suppressed for expansions of NULL where "NULL" is
6842 in a system header). */
6845 get_location_for_expr_unwinding_for_system_header (tree expr
)
6847 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6848 loc
= expansion_point_location_if_in_system_header (loc
);
6852 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6853 Also handle a subset of zero as null warnings.
6854 EXPR is implicitly converted to type TOTYPE.
6855 FN and ARGNUM are used for diagnostics. */
6858 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6860 /* Issue warnings about peculiar, but valid, uses of NULL. */
6861 if (TREE_CODE (totype
) != BOOLEAN_TYPE
6862 && ARITHMETIC_TYPE_P (totype
)
6863 && null_node_p (expr
))
6865 location_t loc
= get_location_for_expr_unwinding_for_system_header (expr
);
6868 auto_diagnostic_group d
;
6869 if (warning_at (loc
, OPT_Wconversion_null
,
6870 "passing NULL to non-pointer argument %P of %qD",
6872 inform (get_fndecl_argument_location (fn
, argnum
),
6876 warning_at (loc
, OPT_Wconversion_null
,
6877 "converting to non-pointer type %qT from NULL", totype
);
6880 /* Issue warnings if "false" is converted to a NULL pointer */
6881 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6882 && TYPE_PTR_P (totype
))
6884 location_t loc
= get_location_for_expr_unwinding_for_system_header (expr
);
6887 auto_diagnostic_group d
;
6888 if (warning_at (loc
, OPT_Wconversion_null
,
6889 "converting %<false%> to pointer type for argument "
6890 "%P of %qD", argnum
, fn
))
6891 inform (get_fndecl_argument_location (fn
, argnum
),
6895 warning_at (loc
, OPT_Wconversion_null
,
6896 "converting %<false%> to pointer type %qT", totype
);
6898 /* Handle zero as null pointer warnings for cases other
6899 than EQ_EXPR and NE_EXPR */
6900 else if ((TYPE_PTR_OR_PTRMEM_P (totype
) || NULLPTR_TYPE_P (totype
))
6901 && null_ptr_cst_p (expr
))
6903 location_t loc
= get_location_for_expr_unwinding_for_system_header (expr
);
6904 maybe_warn_zero_as_null_pointer_constant (expr
, loc
);
6908 /* We gave a diagnostic during a conversion. If this was in the second
6909 standard conversion sequence of a user-defined conversion sequence, say
6910 which user-defined conversion. */
6913 maybe_print_user_conv_context (conversion
*convs
)
6915 if (convs
->user_conv_p
)
6916 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6917 if (t
->kind
== ck_user
)
6919 print_z_candidate (0, " after user-defined conversion:",
6925 /* Locate the parameter with the given index within FNDECL.
6926 ARGNUM is zero based, -1 indicates the `this' argument of a method.
6927 Return the location of the FNDECL itself if there are problems. */
6930 get_fndecl_argument_location (tree fndecl
, int argnum
)
6932 /* The locations of implicitly-declared functions are likely to be
6933 more meaningful than those of their parameters. */
6934 if (DECL_ARTIFICIAL (fndecl
))
6935 return DECL_SOURCE_LOCATION (fndecl
);
6940 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6941 for (i
= 0, param
= FUNCTION_FIRST_USER_PARM (fndecl
);
6942 i
< argnum
&& param
;
6943 i
++, param
= TREE_CHAIN (param
))
6946 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6947 return the location of FNDECL. */
6949 return DECL_SOURCE_LOCATION (fndecl
);
6951 return DECL_SOURCE_LOCATION (param
);
6954 /* If FNDECL is non-NULL, issue a note highlighting ARGNUM
6955 within its declaration (or the fndecl itself if something went
6959 maybe_inform_about_fndecl_for_bogus_argument_init (tree fn
, int argnum
)
6962 inform (get_fndecl_argument_location (fn
, argnum
),
6963 " initializing argument %P of %qD", argnum
, fn
);
6966 /* Perform the conversions in CONVS on the expression EXPR. FN and
6967 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6968 indicates the `this' argument of a method. INNER is nonzero when
6969 being called to continue a conversion chain. It is negative when a
6970 reference binding will be applied, positive otherwise. If
6971 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6972 conversions will be emitted if appropriate. If C_CAST_P is true,
6973 this conversion is coming from a C-style cast; in that case,
6974 conversions to inaccessible bases are permitted. */
6977 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6978 bool issue_conversion_warnings
,
6979 bool c_cast_p
, tsubst_flags_t complain
)
6981 tree totype
= convs
->type
;
6982 diagnostic_t diag_kind
;
6984 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
6986 if (convs
->bad_p
&& !(complain
& tf_error
))
6987 return error_mark_node
;
6990 && convs
->kind
!= ck_user
6991 && convs
->kind
!= ck_list
6992 && convs
->kind
!= ck_ambig
6993 && (convs
->kind
!= ck_ref_bind
6994 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6995 && (convs
->kind
!= ck_rvalue
6996 || SCALAR_TYPE_P (totype
))
6997 && convs
->kind
!= ck_base
)
6999 bool complained
= false;
7000 conversion
*t
= convs
;
7002 /* Give a helpful error if this is bad because of excess braces. */
7003 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
7004 && SCALAR_TYPE_P (totype
)
7005 && CONSTRUCTOR_NELTS (expr
) > 0
7006 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
7008 complained
= permerror (loc
, "too many braces around initializer "
7010 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
7011 && CONSTRUCTOR_NELTS (expr
) == 1)
7012 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7015 /* Give a helpful error if this is bad because a conversion to bool
7016 from std::nullptr_t requires direct-initialization. */
7017 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
7018 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
7019 complained
= permerror (loc
, "converting to %qH from %qI requires "
7020 "direct-initialization",
7021 totype
, TREE_TYPE (expr
));
7023 for (; t
; t
= next_conversion (t
))
7025 if (t
->kind
== ck_user
&& t
->cand
->reason
)
7027 auto_diagnostic_group d
;
7028 complained
= permerror (loc
, "invalid user-defined conversion "
7029 "from %qH to %qI", TREE_TYPE (expr
),
7032 print_z_candidate (loc
, "candidate is:", t
->cand
);
7033 expr
= convert_like_real (t
, expr
, fn
, argnum
,
7034 /*issue_conversion_warnings=*/false,
7037 if (convs
->kind
== ck_ref_bind
)
7038 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
7039 LOOKUP_NORMAL
, NULL_TREE
,
7042 expr
= cp_convert (totype
, expr
, complain
);
7044 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7047 else if (t
->kind
== ck_user
|| !t
->bad_p
)
7049 expr
= convert_like_real (t
, expr
, fn
, argnum
,
7050 /*issue_conversion_warnings=*/false,
7055 else if (t
->kind
== ck_ambig
)
7056 return convert_like_real (t
, expr
, fn
, argnum
,
7057 /*issue_conversion_warnings=*/false,
7060 else if (t
->kind
== ck_identity
)
7065 range_label_for_type_mismatch
label (TREE_TYPE (expr
), totype
);
7066 gcc_rich_location
richloc (loc
, &label
);
7067 complained
= permerror (&richloc
,
7068 "invalid conversion from %qH to %qI",
7069 TREE_TYPE (expr
), totype
);
7072 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7074 return cp_convert (totype
, expr
, complain
);
7077 if (issue_conversion_warnings
&& (complain
& tf_warning
))
7078 conversion_null_warnings (totype
, expr
, fn
, argnum
);
7080 switch (convs
->kind
)
7084 struct z_candidate
*cand
= convs
->cand
;
7087 /* We chose the surrogate function from add_conv_candidate, now we
7088 actually need to build the conversion. */
7089 cand
= build_user_type_conversion_1 (totype
, expr
,
7090 LOOKUP_NO_CONVERSION
, complain
);
7092 tree convfn
= cand
->fn
;
7094 /* When converting from an init list we consider explicit
7095 constructors, but actually trying to call one is an error. */
7096 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
7097 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
7098 /* Unless this is for direct-list-initialization. */
7099 && (!CONSTRUCTOR_IS_DIRECT_INIT (expr
) || convs
->need_temporary_p
)
7100 /* And in C++98 a default constructor can't be explicit. */
7101 && cxx_dialect
>= cxx11
)
7103 if (!(complain
& tf_error
))
7104 return error_mark_node
;
7105 location_t loc
= location_of (expr
);
7106 if (CONSTRUCTOR_NELTS (expr
) == 0
7107 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
7109 auto_diagnostic_group d
;
7110 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
7111 "would use explicit constructor %qD",
7113 inform (loc
, "in C++11 and above a default constructor "
7117 error ("converting to %qT from initializer list would use "
7118 "explicit constructor %qD", totype
, convfn
);
7121 /* If we're initializing from {}, it's value-initialization. */
7122 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
7123 && CONSTRUCTOR_NELTS (expr
) == 0
7124 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
)
7125 && !processing_template_decl
)
7127 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
7128 if (abstract_virtuals_error_sfinae (NULL_TREE
, totype
, complain
))
7129 return error_mark_node
;
7130 expr
= build_value_init (totype
, complain
);
7131 expr
= get_target_expr_sfinae (expr
, complain
);
7132 if (expr
!= error_mark_node
)
7134 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7135 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
7140 /* We don't know here whether EXPR is being used as an lvalue or
7141 rvalue, but we know it's read. */
7142 mark_exp_read (expr
);
7144 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
7146 expr
= build_over_call (cand
, LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
,
7149 /* If this is a constructor or a function returning an aggr type,
7150 we need to build up a TARGET_EXPR. */
7151 if (DECL_CONSTRUCTOR_P (convfn
))
7153 expr
= build_cplus_new (totype
, expr
, complain
);
7155 /* Remember that this was list-initialization. */
7156 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
7157 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7163 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
7165 int nelts
= CONSTRUCTOR_NELTS (expr
);
7167 expr
= build_value_init (totype
, complain
);
7168 else if (nelts
== 1)
7169 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7173 expr
= mark_use (expr
, /*rvalue_p=*/!convs
->rvaluedness_matches_p
,
7174 /*read_p=*/true, UNKNOWN_LOCATION
,
7175 /*reject_builtin=*/true);
7177 if (type_unknown_p (expr
))
7178 expr
= instantiate_type (totype
, expr
, complain
);
7179 if (expr
== null_node
7180 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
7181 /* If __null has been converted to an integer type, we do not want to
7182 continue to warn about uses of EXPR as an integer, rather than as a
7184 expr
= build_int_cst (totype
, 0);
7187 /* We leave bad_p off ck_ambig because overload resolution considers
7188 it valid, it just fails when we try to perform it. So we need to
7189 check complain here, too. */
7190 if (complain
& tf_error
)
7192 /* Call build_user_type_conversion again for the error. */
7193 int flags
= (convs
->need_temporary_p
7194 ? LOOKUP_IMPLICIT
: LOOKUP_NORMAL
);
7195 build_user_type_conversion (totype
, convs
->u
.expr
, flags
, complain
);
7196 gcc_assert (seen_error ());
7197 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7199 return error_mark_node
;
7203 /* Conversion to std::initializer_list<T>. */
7204 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
7205 unsigned len
= CONSTRUCTOR_NELTS (expr
);
7210 tree val
; unsigned ix
;
7212 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
7214 /* Convert all the elements. */
7215 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
7217 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
,
7218 argnum
, false, false, complain
);
7219 if (sub
== error_mark_node
)
7221 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
7222 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
7223 return error_mark_node
;
7224 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
),
7226 if (!TREE_CONSTANT (sub
))
7227 TREE_CONSTANT (new_ctor
) = false;
7229 /* Build up the array. */
7230 elttype
= cp_build_qualified_type
7231 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
7232 array
= build_array_of_n_type (elttype
, len
);
7233 array
= finish_compound_literal (array
, new_ctor
, complain
);
7234 /* Take the address explicitly rather than via decay_conversion
7235 to avoid the error about taking the address of a temporary. */
7236 array
= cp_build_addr_expr (array
, complain
);
7239 array
= nullptr_node
;
7241 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
7242 if (array
== error_mark_node
)
7243 return error_mark_node
;
7245 /* Build up the initializer_list object. Note: fail gracefully
7246 if the object cannot be completed because, for example, no
7247 definition is provided (c++/80956). */
7248 totype
= complete_type_or_maybe_complain (totype
, NULL_TREE
, complain
);
7250 return error_mark_node
;
7251 tree field
= next_initializable_field (TYPE_FIELDS (totype
));
7252 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
7253 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
7254 field
= next_initializable_field (DECL_CHAIN (field
));
7255 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
7256 tree new_ctor
= build_constructor (totype
, vec
);
7257 return get_target_expr_sfinae (new_ctor
, complain
);
7261 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
7263 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7264 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
7265 real
= perform_implicit_conversion (TREE_TYPE (totype
),
7267 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
7269 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
7272 expr
= reshape_init (totype
, expr
, complain
);
7273 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
7275 if (expr
!= error_mark_node
)
7276 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7283 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
7284 convs
->kind
== ck_ref_bind
7285 ? issue_conversion_warnings
: false,
7286 c_cast_p
, complain
);
7287 if (expr
== error_mark_node
)
7288 return error_mark_node
;
7290 switch (convs
->kind
)
7293 expr
= decay_conversion (expr
, complain
);
7294 if (expr
== error_mark_node
)
7296 if (complain
& tf_error
)
7298 auto_diagnostic_group d
;
7299 maybe_print_user_conv_context (convs
);
7300 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7302 return error_mark_node
;
7305 if (! MAYBE_CLASS_TYPE_P (totype
))
7308 /* Don't introduce copies when passing arguments along to the inherited
7310 if (current_function_decl
7311 && flag_new_inheriting_ctors
7312 && DECL_INHERITED_CTOR (current_function_decl
))
7315 if (TREE_CODE (expr
) == TARGET_EXPR
7316 && TARGET_EXPR_LIST_INIT_P (expr
))
7317 /* Copy-list-initialization doesn't actually involve a copy. */
7322 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
7324 /* We are going to bind a reference directly to a base-class
7325 subobject of EXPR. */
7326 /* Build an expression for `*((base*) &expr)'. */
7327 expr
= convert_to_base (expr
, totype
,
7328 !c_cast_p
, /*nonnull=*/true, complain
);
7332 /* Copy-initialization where the cv-unqualified version of the source
7333 type is the same class as, or a derived class of, the class of the
7334 destination [is treated as direct-initialization]. [dcl.init] */
7335 flags
= LOOKUP_NORMAL
;
7336 if (convs
->user_conv_p
)
7337 /* This conversion is being done in the context of a user-defined
7338 conversion (i.e. the second step of copy-initialization), so
7339 don't allow any more. */
7340 flags
|= LOOKUP_NO_CONVERSION
;
7342 flags
|= LOOKUP_ONLYCONVERTING
;
7343 if (convs
->rvaluedness_matches_p
)
7344 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
7345 flags
|= LOOKUP_PREFER_RVALUE
;
7346 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
7347 if (diag_kind
&& complain
)
7349 auto_diagnostic_group d
;
7350 maybe_print_user_conv_context (convs
);
7351 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7354 return build_cplus_new (totype
, expr
, complain
);
7358 tree ref_type
= totype
;
7360 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
7362 tree extype
= TREE_TYPE (expr
);
7363 auto_diagnostic_group d
;
7364 if (TYPE_REF_IS_RVALUE (ref_type
)
7366 error_at (loc
, "cannot bind rvalue reference of type %qH to "
7367 "lvalue of type %qI", totype
, extype
);
7368 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
7369 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
7370 error_at (loc
, "cannot bind non-const lvalue reference of "
7371 "type %qH to an rvalue of type %qI", totype
, extype
);
7372 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
7373 error_at (loc
, "binding reference of type %qH to %qI "
7374 "discards qualifiers", totype
, extype
);
7377 maybe_print_user_conv_context (convs
);
7378 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7380 return error_mark_node
;
7383 /* If necessary, create a temporary.
7385 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7386 that need temporaries, even when their types are reference
7387 compatible with the type of reference being bound, so the
7388 upcoming call to cp_build_addr_expr doesn't fail. */
7389 if (convs
->need_temporary_p
7390 || TREE_CODE (expr
) == CONSTRUCTOR
7391 || TREE_CODE (expr
) == VA_ARG_EXPR
)
7393 /* Otherwise, a temporary of type "cv1 T1" is created and
7394 initialized from the initializer expression using the rules
7395 for a non-reference copy-initialization (8.5). */
7397 tree type
= TREE_TYPE (ref_type
);
7398 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
7400 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7401 (type
, next_conversion (convs
)->type
));
7402 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
7403 && !TYPE_REF_IS_RVALUE (ref_type
))
7405 /* If the reference is volatile or non-const, we
7406 cannot create a temporary. */
7407 if (lvalue
& clk_bitfield
)
7408 error_at (loc
, "cannot bind bitfield %qE to %qT",
7410 else if (lvalue
& clk_packed
)
7411 error_at (loc
, "cannot bind packed field %qE to %qT",
7414 error_at (loc
, "cannot bind rvalue %qE to %qT",
7416 return error_mark_node
;
7418 /* If the source is a packed field, and we must use a copy
7419 constructor, then building the target expr will require
7420 binding the field to the reference parameter to the
7421 copy constructor, and we'll end up with an infinite
7422 loop. If we can use a bitwise copy, then we'll be
7424 if ((lvalue
& clk_packed
)
7425 && CLASS_TYPE_P (type
)
7426 && type_has_nontrivial_copy_init (type
))
7428 error_at (loc
, "cannot bind packed field %qE to %qT",
7430 return error_mark_node
;
7432 if (lvalue
& clk_bitfield
)
7434 expr
= convert_bitfield_to_declared_type (expr
);
7435 expr
= fold_convert (type
, expr
);
7437 expr
= build_target_expr_with_type (expr
, type
, complain
);
7440 /* Take the address of the thing to which we will bind the
7442 expr
= cp_build_addr_expr (expr
, complain
);
7443 if (expr
== error_mark_node
)
7444 return error_mark_node
;
7446 /* Convert it to a pointer to the type referred to by the
7447 reference. This will adjust the pointer if a derived to
7448 base conversion is being performed. */
7449 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
7451 /* Convert the pointer to the desired reference type. */
7452 return build_nop (ref_type
, expr
);
7456 return decay_conversion (expr
, complain
);
7459 /* ??? Should the address of a transaction-safe pointer point to the TM
7460 clone, and this conversion look up the primary function? */
7461 return build_nop (totype
, expr
);
7464 /* Warn about deprecated conversion if appropriate. */
7465 if (complain
& tf_warning
)
7466 string_conv_p (totype
, expr
, 1);
7471 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
7472 /*nonnull=*/false, complain
);
7473 return build_nop (totype
, expr
);
7476 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
7477 c_cast_p
, complain
);
7483 if (convs
->check_narrowing
7484 && !check_narrowing (totype
, expr
, complain
,
7485 convs
->check_narrowing_const_only
))
7486 return error_mark_node
;
7488 warning_sentinel
w (warn_zero_as_null_pointer_constant
);
7489 if (issue_conversion_warnings
)
7490 expr
= cp_convert_and_check (totype
, expr
, complain
);
7492 expr
= cp_convert (totype
, expr
, complain
);
7497 /* ARG is being passed to a varargs function. Perform any conversions
7498 required. Return the converted value. */
7501 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
7504 location_t loc
= cp_expr_loc_or_loc (arg
, input_location
);
7508 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7509 standard conversions are performed. */
7510 arg
= decay_conversion (arg
, complain
);
7511 arg_type
= TREE_TYPE (arg
);
7514 If the argument has integral or enumeration type that is subject
7515 to the integral promotions (_conv.prom_), or a floating point
7516 type that is subject to the floating point promotion
7517 (_conv.fpprom_), the value of the argument is converted to the
7518 promoted type before the call. */
7519 if (TREE_CODE (arg_type
) == REAL_TYPE
7520 && (TYPE_PRECISION (arg_type
)
7521 < TYPE_PRECISION (double_type_node
))
7522 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
7524 if ((complain
& tf_warning
)
7525 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
7526 warning_at (loc
, OPT_Wdouble_promotion
,
7527 "implicit conversion from %qH to %qI when passing "
7528 "argument to function",
7529 arg_type
, double_type_node
);
7530 arg
= convert_to_real_nofold (double_type_node
, arg
);
7532 else if (NULLPTR_TYPE_P (arg_type
))
7533 arg
= null_pointer_node
;
7534 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
7536 if (SCOPED_ENUM_P (arg_type
))
7538 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
7540 prom
= cp_perform_integral_promotions (prom
, complain
);
7541 if (abi_version_crosses (6)
7542 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
7543 && (complain
& tf_warning
))
7544 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
7545 "%qT before %<-fabi-version=6%>, %qT after", arg_type
,
7546 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
7547 if (!abi_version_at_least (6))
7551 arg
= cp_perform_integral_promotions (arg
, complain
);
7554 arg
= require_complete_type_sfinae (arg
, complain
);
7555 arg_type
= TREE_TYPE (arg
);
7557 if (arg
!= error_mark_node
7558 /* In a template (or ill-formed code), we can have an incomplete type
7559 even after require_complete_type_sfinae, in which case we don't know
7560 whether it has trivial copy or not. */
7561 && COMPLETE_TYPE_P (arg_type
)
7562 && !cp_unevaluated_operand
)
7564 /* [expr.call] 5.2.2/7:
7565 Passing a potentially-evaluated argument of class type (Clause 9)
7566 with a non-trivial copy constructor or a non-trivial destructor
7567 with no corresponding parameter is conditionally-supported, with
7568 implementation-defined semantics.
7570 We support it as pass-by-invisible-reference, just like a normal
7573 If the call appears in the context of a sizeof expression,
7574 it is not potentially-evaluated. */
7575 if (type_has_nontrivial_copy_init (arg_type
)
7576 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
))
7578 arg
= force_rvalue (arg
, complain
);
7579 if (complain
& tf_warning
)
7580 warning (OPT_Wconditionally_supported
,
7581 "passing objects of non-trivially-copyable "
7582 "type %q#T through %<...%> is conditionally supported",
7584 return build1 (ADDR_EXPR
, build_reference_type (arg_type
), arg
);
7586 /* Build up a real lvalue-to-rvalue conversion in case the
7587 copy constructor is trivial but not callable. */
7588 else if (CLASS_TYPE_P (arg_type
))
7589 force_rvalue (arg
, complain
);
7596 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7599 build_x_va_arg (location_t loc
, tree expr
, tree type
)
7601 if (processing_template_decl
)
7603 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
7604 SET_EXPR_LOCATION (r
, loc
);
7608 type
= complete_type_or_else (type
, NULL_TREE
);
7610 if (expr
== error_mark_node
|| !type
)
7611 return error_mark_node
;
7613 expr
= mark_lvalue_use (expr
);
7615 if (TYPE_REF_P (type
))
7617 error ("cannot receive reference type %qT through %<...%>", type
);
7618 return error_mark_node
;
7621 if (type_has_nontrivial_copy_init (type
)
7622 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7624 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7625 it as pass by invisible reference. */
7626 warning_at (loc
, OPT_Wconditionally_supported
,
7627 "receiving objects of non-trivially-copyable type %q#T "
7628 "through %<...%> is conditionally-supported", type
);
7630 tree ref
= cp_build_reference_type (type
, false);
7631 expr
= build_va_arg (loc
, expr
, ref
);
7632 return convert_from_reference (expr
);
7635 tree ret
= build_va_arg (loc
, expr
, type
);
7636 if (CLASS_TYPE_P (type
))
7637 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7638 know how to handle it. */
7639 ret
= get_target_expr (ret
);
7643 /* TYPE has been given to va_arg. Apply the default conversions which
7644 would have happened when passed via ellipsis. Return the promoted
7645 type, or the passed type if there is no change. */
7648 cxx_type_promotes_to (tree type
)
7652 /* Perform the array-to-pointer and function-to-pointer
7654 type
= type_decays_to (type
);
7656 promote
= type_promotes_to (type
);
7657 if (same_type_p (type
, promote
))
7663 /* ARG is a default argument expression being passed to a parameter of
7664 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7665 zero-based argument number. Do any required conversions. Return
7666 the converted value. */
7668 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
7670 push_defarg_context (tree fn
)
7671 { vec_safe_push (default_arg_context
, fn
); }
7674 pop_defarg_context (void)
7675 { default_arg_context
->pop (); }
7678 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
7679 tsubst_flags_t complain
)
7684 /* See through clones. */
7685 fn
= DECL_ORIGIN (fn
);
7686 /* And inheriting ctors. */
7687 if (flag_new_inheriting_ctors
)
7688 fn
= strip_inheriting_ctors (fn
);
7690 /* Detect recursion. */
7691 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
7694 if (complain
& tf_error
)
7695 error ("recursive evaluation of default argument for %q#D", fn
);
7696 return error_mark_node
;
7699 /* If the ARG is an unparsed default argument expression, the
7700 conversion cannot be performed. */
7701 if (TREE_CODE (arg
) == DEFAULT_ARG
)
7703 if (complain
& tf_error
)
7704 error ("call to %qD uses the default argument for parameter %P, which "
7705 "is not yet defined", fn
, parmnum
);
7706 return error_mark_node
;
7709 push_defarg_context (fn
);
7711 if (fn
&& DECL_TEMPLATE_INFO (fn
))
7712 arg
= tsubst_default_argument (fn
, parmnum
, type
, arg
, complain
);
7718 The names in the expression are bound, and the semantic
7719 constraints are checked, at the point where the default
7720 expressions appears.
7722 we must not perform access checks here. */
7723 push_deferring_access_checks (dk_no_check
);
7724 /* We must make a copy of ARG, in case subsequent processing
7725 alters any part of it. */
7726 arg
= break_out_target_exprs (arg
, /*clear location*/true);
7728 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
7729 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
7731 arg
= convert_for_arg_passing (type
, arg
, complain
);
7732 pop_deferring_access_checks();
7734 pop_defarg_context ();
7739 /* Returns the type which will really be used for passing an argument of
7743 type_passed_as (tree type
)
7745 /* Pass classes with copy ctors by invisible reference. */
7746 if (TREE_ADDRESSABLE (type
))
7748 type
= build_reference_type (type
);
7749 /* There are no other pointers to this temporary. */
7750 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
7752 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7753 && INTEGRAL_TYPE_P (type
)
7754 && COMPLETE_TYPE_P (type
)
7755 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7756 type
= integer_type_node
;
7761 /* Actually perform the appropriate conversion. */
7764 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
7768 /* If VAL is a bitfield, then -- since it has already been converted
7769 to TYPE -- it cannot have a precision greater than TYPE.
7771 If it has a smaller precision, we must widen it here. For
7772 example, passing "int f:3;" to a function expecting an "int" will
7773 not result in any conversion before this point.
7775 If the precision is the same we must not risk widening. For
7776 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7777 often have type "int", even though the C++ type for the field is
7778 "long long". If the value is being passed to a function
7779 expecting an "int", then no conversions will be required. But,
7780 if we call convert_bitfield_to_declared_type, the bitfield will
7781 be converted to "long long". */
7782 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
7784 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
7785 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
7787 if (val
== error_mark_node
)
7789 /* Pass classes with copy ctors by invisible reference. */
7790 else if (TREE_ADDRESSABLE (type
))
7791 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
7792 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7793 && INTEGRAL_TYPE_P (type
)
7794 && COMPLETE_TYPE_P (type
)
7795 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7796 val
= cp_perform_integral_promotions (val
, complain
);
7797 if (complain
& tf_warning
)
7799 if (warn_suggest_attribute_format
)
7801 tree rhstype
= TREE_TYPE (val
);
7802 const enum tree_code coder
= TREE_CODE (rhstype
);
7803 const enum tree_code codel
= TREE_CODE (type
);
7804 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7806 && check_missing_format_attribute (type
, rhstype
))
7807 warning (OPT_Wsuggest_attribute_format
,
7808 "argument of function call might be a candidate "
7809 "for a format attribute");
7811 maybe_warn_parm_abi (type
, cp_expr_loc_or_loc (val
, input_location
));
7814 if (complain
& tf_warning
)
7815 warn_for_address_or_pointer_of_packed_member (type
, val
);
7820 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7821 which just decay_conversion or no conversions at all should be done.
7822 This is true for some builtins which don't act like normal functions.
7823 Return 2 if no conversions at all should be done, 1 if just
7824 decay_conversion. Return 3 for special treatment of the 3rd argument
7825 for __builtin_*_overflow_p. */
7828 magic_varargs_p (tree fn
)
7830 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
7831 switch (DECL_FUNCTION_CODE (fn
))
7833 case BUILT_IN_CLASSIFY_TYPE
:
7834 case BUILT_IN_CONSTANT_P
:
7835 case BUILT_IN_NEXT_ARG
:
7836 case BUILT_IN_VA_START
:
7839 case BUILT_IN_ADD_OVERFLOW_P
:
7840 case BUILT_IN_SUB_OVERFLOW_P
:
7841 case BUILT_IN_MUL_OVERFLOW_P
:
7845 return lookup_attribute ("type generic",
7846 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
7852 /* Returns the decl of the dispatcher function if FN is a function version. */
7855 get_function_version_dispatcher (tree fn
)
7857 tree dispatcher_decl
= NULL
;
7859 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7860 && DECL_FUNCTION_VERSIONED (fn
));
7862 gcc_assert (targetm
.get_function_versions_dispatcher
);
7863 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
7865 if (dispatcher_decl
== NULL
)
7867 error_at (input_location
, "use of multiversioned function "
7868 "without a default");
7872 retrofit_lang_decl (dispatcher_decl
);
7873 gcc_assert (dispatcher_decl
!= NULL
);
7874 return dispatcher_decl
;
7877 /* fn is a function version dispatcher that is marked used. Mark all the
7878 semantically identical function versions it will dispatch as used. */
7881 mark_versions_used (tree fn
)
7883 struct cgraph_node
*node
;
7884 struct cgraph_function_version_info
*node_v
;
7885 struct cgraph_function_version_info
*it_v
;
7887 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7889 node
= cgraph_node::get (fn
);
7893 gcc_assert (node
->dispatcher_function
);
7895 node_v
= node
->function_version ();
7899 /* All semantically identical versions are chained. Traverse and mark each
7900 one of them as used. */
7901 it_v
= node_v
->next
;
7902 while (it_v
!= NULL
)
7904 mark_used (it_v
->this_node
->decl
);
7909 /* Build a call to "the copy constructor" for the type of A, even if it
7910 wouldn't be selected by normal overload resolution. Used for
7914 call_copy_ctor (tree a
, tsubst_flags_t complain
)
7916 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
7917 tree binfo
= TYPE_BINFO (ctype
);
7918 tree copy
= get_copy_ctor (ctype
, complain
);
7919 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7920 tree ob
= build_dummy_object (ctype
);
7921 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7922 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7923 LOOKUP_NORMAL
, NULL
, complain
);
7924 release_tree_vector (args
);
7928 /* Return true iff T refers to a base field. */
7931 is_base_field_ref (tree t
)
7934 if (TREE_CODE (t
) == ADDR_EXPR
)
7935 t
= TREE_OPERAND (t
, 0);
7936 if (TREE_CODE (t
) == COMPONENT_REF
)
7937 t
= TREE_OPERAND (t
, 1);
7938 if (TREE_CODE (t
) == FIELD_DECL
)
7939 return DECL_FIELD_IS_BASE (t
);
7943 /* We can't elide a copy from a function returning by value to a base
7944 subobject, as the callee might clobber tail padding. Return true iff this
7945 could be that case. */
7948 unsafe_copy_elision_p (tree target
, tree exp
)
7950 /* Copy elision only happens with a TARGET_EXPR. */
7951 if (TREE_CODE (exp
) != TARGET_EXPR
)
7953 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
7954 /* It's safe to elide the copy for a class with no tail padding. */
7955 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
7957 /* It's safe to elide the copy if we aren't initializing a base object. */
7958 if (!is_base_field_ref (target
))
7960 tree init
= TARGET_EXPR_INITIAL (exp
);
7961 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7962 while (TREE_CODE (init
) == COMPOUND_EXPR
)
7963 init
= TREE_OPERAND (init
, 1);
7964 if (TREE_CODE (init
) == COND_EXPR
)
7966 /* We'll end up copying from each of the arms of the COND_EXPR directly
7967 into the target, so look at them. */
7968 if (tree op
= TREE_OPERAND (init
, 1))
7969 if (unsafe_copy_elision_p (target
, op
))
7971 return unsafe_copy_elision_p (target
, TREE_OPERAND (init
, 2));
7973 return (TREE_CODE (init
) == AGGR_INIT_EXPR
7974 && !AGGR_INIT_VIA_CTOR_P (init
));
7977 /* True iff C is a conversion that binds a reference to a prvalue. */
7980 conv_binds_ref_to_prvalue (conversion
*c
)
7982 if (c
->kind
!= ck_ref_bind
)
7984 if (c
->need_temporary_p
)
7987 c
= next_conversion (c
);
7989 if (c
->kind
== ck_rvalue
)
7991 if (c
->kind
== ck_user
&& !TYPE_REF_P (c
->type
))
7993 if (c
->kind
== ck_identity
&& c
->u
.expr
7994 && TREE_CODE (c
->u
.expr
) == TARGET_EXPR
)
8000 /* Call the trivial destructor for INSTANCE, which can be either an lvalue of
8001 class type or a pointer to class type. */
8004 build_trivial_dtor_call (tree instance
)
8006 gcc_assert (!is_dummy_object (instance
));
8008 if (!flag_lifetime_dse
)
8011 return fold_convert (void_type_node
, instance
);
8014 if (INDIRECT_TYPE_P (TREE_TYPE (instance
)))
8016 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
8018 instance
= cp_build_fold_indirect_ref (instance
);
8021 /* A trivial destructor should still clobber the object. */
8022 tree clobber
= build_clobber (TREE_TYPE (instance
));
8023 return build2 (MODIFY_EXPR
, void_type_node
,
8027 /* Subroutine of the various build_*_call functions. Overload resolution
8028 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
8029 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
8030 bitmask of various LOOKUP_* flags which apply to the call itself. */
8033 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
8036 const vec
<tree
, va_gc
> *args
= cand
->args
;
8037 tree first_arg
= cand
->first_arg
;
8038 conversion
**convs
= cand
->convs
;
8040 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
8045 unsigned int arg_index
= 0;
8049 bool already_used
= false;
8051 /* In a template, there is no need to perform all of the work that
8052 is normally done. We are only interested in the type of the call
8053 expression, i.e., the return type of the function. Any semantic
8054 errors will be deferred until the template is instantiated. */
8055 if (processing_template_decl
)
8059 const tree
*argarray
;
8062 if (undeduced_auto_decl (fn
))
8063 mark_used (fn
, complain
);
8065 /* Otherwise set TREE_USED for the benefit of -Wunused-function.
8069 return_type
= TREE_TYPE (TREE_TYPE (fn
));
8070 nargs
= vec_safe_length (args
);
8071 if (first_arg
== NULL_TREE
)
8072 argarray
= args
->address ();
8080 alcarray
= XALLOCAVEC (tree
, nargs
);
8081 alcarray
[0] = build_this (first_arg
);
8082 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
8083 alcarray
[ix
+ 1] = arg
;
8084 argarray
= alcarray
;
8087 addr
= build_addr_func (fn
, complain
);
8088 if (addr
== error_mark_node
)
8089 return error_mark_node
;
8090 expr
= build_call_array_loc (input_location
, return_type
,
8091 addr
, nargs
, argarray
);
8092 if (TREE_THIS_VOLATILE (fn
) && cfun
)
8093 current_function_returns_abnormally
= 1;
8094 return convert_from_reference (expr
);
8097 /* Give any warnings we noticed during overload resolution. */
8098 if (cand
->warnings
&& (complain
& tf_warning
))
8100 struct candidate_warning
*w
;
8101 for (w
= cand
->warnings
; w
; w
= w
->next
)
8102 joust (cand
, w
->loser
, 1, complain
);
8105 /* Core issue 2327: P0135 doesn't say how to handle the case where the
8106 argument to the copy constructor ends up being a prvalue after
8107 conversion. Let's do the normal processing, but pretend we aren't
8108 actually using the copy constructor. */
8109 bool force_elide
= false;
8110 if (cxx_dialect
>= cxx17
8111 && cand
->num_convs
== 1
8112 && DECL_COMPLETE_CONSTRUCTOR_P (fn
)
8113 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8114 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8115 && conv_binds_ref_to_prvalue (convs
[0]))
8118 goto not_really_used
;
8121 /* OK, we're actually calling this inherited constructor; set its deletedness
8122 appropriately. We can get away with doing this here because calling is
8123 the only way to refer to a constructor. */
8124 if (DECL_INHERITED_CTOR (fn
))
8125 deduce_inheriting_ctor (fn
);
8127 /* Make =delete work with SFINAE. */
8128 if (DECL_DELETED_FN (fn
))
8130 if (complain
& tf_error
)
8132 return error_mark_node
;
8135 if (DECL_FUNCTION_MEMBER_P (fn
))
8138 /* If FN is a template function, two cases must be considered.
8143 template <class T> void f();
8145 template <class T> struct B {
8149 struct C : A, B<int> {
8151 using B<int>::g; // #2
8154 In case #1 where `A::f' is a member template, DECL_ACCESS is
8155 recorded in the primary template but not in its specialization.
8156 We check access of FN using its primary template.
8158 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
8159 because it is a member of class template B, DECL_ACCESS is
8160 recorded in the specialization `B<int>::g'. We cannot use its
8161 primary template because `B<T>::g' and `B<int>::g' may have
8162 different access. */
8163 if (DECL_TEMPLATE_INFO (fn
)
8164 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
8165 access_fn
= DECL_TI_TEMPLATE (fn
);
8168 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
8170 return error_mark_node
;
8173 /* If we're checking for implicit delete, don't bother with argument
8175 if (flags
& LOOKUP_SPECULATIVE
)
8177 if (cand
->viable
== 1)
8179 else if (!(complain
& tf_error
))
8180 /* Reject bad conversions now. */
8181 return error_mark_node
;
8182 /* else continue to get conversion error. */
8187 /* N3276 magic doesn't apply to nested calls. */
8188 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
8189 complain
&= ~tf_decltype
;
8190 /* No-Cleanup doesn't apply to nested calls either. */
8191 tsubst_flags_t no_cleanup_complain
= complain
;
8192 complain
&= ~tf_no_cleanup
;
8194 /* Find maximum size of vector to hold converted arguments. */
8195 parmlen
= list_length (parm
);
8196 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
8197 if (parmlen
> nargs
)
8199 argarray
= XALLOCAVEC (tree
, nargs
);
8201 /* The implicit parameters to a constructor are not considered by overload
8202 resolution, and must be of the proper type. */
8203 if (DECL_CONSTRUCTOR_P (fn
))
8206 if (first_arg
!= NULL_TREE
)
8208 object_arg
= first_arg
;
8209 first_arg
= NULL_TREE
;
8213 object_arg
= (*args
)[arg_index
];
8216 argarray
[j
++] = build_this (object_arg
);
8217 parm
= TREE_CHAIN (parm
);
8218 /* We should never try to call the abstract constructor. */
8219 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
8221 if (DECL_HAS_VTT_PARM_P (fn
))
8223 argarray
[j
++] = (*args
)[arg_index
];
8225 parm
= TREE_CHAIN (parm
);
8228 if (flags
& LOOKUP_PREFER_RVALUE
)
8230 /* The implicit move specified in 15.8.3/3 fails "...if the type of
8231 the first parameter of the selected constructor is not an rvalue
8232 reference to the object's type (possibly cv-qualified)...." */
8233 gcc_assert (!(complain
& tf_error
));
8234 tree ptype
= convs
[0]->type
;
8235 if (!TYPE_REF_P (ptype
)
8236 || !TYPE_REF_IS_RVALUE (ptype
)
8237 || CONVERSION_RANK (convs
[0]) > cr_exact
)
8238 return error_mark_node
;
8241 /* Bypass access control for 'this' parameter. */
8242 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
8244 tree parmtype
= TREE_VALUE (parm
);
8245 tree arg
= build_this (first_arg
!= NULL_TREE
8247 : (*args
)[arg_index
]);
8248 tree argtype
= TREE_TYPE (arg
);
8252 if (arg
== error_mark_node
)
8253 return error_mark_node
;
8255 if (convs
[i
]->bad_p
)
8257 if (complain
& tf_error
)
8259 auto_diagnostic_group d
;
8260 if (permerror (input_location
, "passing %qT as %<this%> "
8261 "argument discards qualifiers",
8262 TREE_TYPE (argtype
)))
8263 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
8266 return error_mark_node
;
8269 /* See if the function member or the whole class type is declared
8270 final and the call can be devirtualized. */
8271 if (DECL_FINAL_P (fn
)
8272 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
8273 flags
|= LOOKUP_NONVIRTUAL
;
8275 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
8276 X is called for an object that is not of type X, or of a type
8277 derived from X, the behavior is undefined.
8279 So we can assume that anything passed as 'this' is non-null, and
8280 optimize accordingly. */
8281 gcc_assert (TYPE_PTR_P (parmtype
));
8282 /* Convert to the base in which the function was declared. */
8283 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
8284 converted_arg
= build_base_path (PLUS_EXPR
,
8286 cand
->conversion_path
,
8288 /* Check that the base class is accessible. */
8289 if (!accessible_base_p (TREE_TYPE (argtype
),
8290 BINFO_TYPE (cand
->conversion_path
), true))
8292 if (complain
& tf_error
)
8293 error ("%qT is not an accessible base of %qT",
8294 BINFO_TYPE (cand
->conversion_path
),
8295 TREE_TYPE (argtype
));
8297 return error_mark_node
;
8299 /* If fn was found by a using declaration, the conversion path
8300 will be to the derived class, not the base declaring fn. We
8301 must convert from derived to base. */
8302 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
8303 TREE_TYPE (parmtype
), ba_unique
,
8305 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
8306 base_binfo
, 1, complain
);
8308 argarray
[j
++] = converted_arg
;
8309 parm
= TREE_CHAIN (parm
);
8310 if (first_arg
!= NULL_TREE
)
8311 first_arg
= NULL_TREE
;
8318 gcc_assert (first_arg
== NULL_TREE
);
8319 for (; arg_index
< vec_safe_length (args
) && parm
;
8320 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
8322 tree type
= TREE_VALUE (parm
);
8323 tree arg
= (*args
)[arg_index
];
8324 bool conversion_warning
= true;
8328 /* If the argument is NULL and used to (implicitly) instantiate a
8329 template function (and bind one of the template arguments to
8330 the type of 'long int'), we don't want to warn about passing NULL
8331 to non-pointer argument.
8332 For example, if we have this template function:
8334 template<typename T> void func(T x) {}
8336 we want to warn (when -Wconversion is enabled) in this case:
8342 but not in this case:
8348 if (null_node_p (arg
)
8349 && DECL_TEMPLATE_INFO (fn
)
8350 && cand
->template_decl
8351 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
8352 conversion_warning
= false;
8354 /* Warn about initializer_list deduction that isn't currently in the
8356 if (cxx_dialect
> cxx98
8357 && flag_deduce_init_list
8358 && cand
->template_decl
8359 && is_std_init_list (non_reference (type
))
8360 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
8362 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
8363 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
8364 tree patparm
= get_pattern_parm (realparm
, tmpl
);
8365 tree pattype
= TREE_TYPE (patparm
);
8366 if (PACK_EXPANSION_P (pattype
))
8367 pattype
= PACK_EXPANSION_PATTERN (pattype
);
8368 pattype
= non_reference (pattype
);
8370 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
8371 && (cand
->explicit_targs
== NULL_TREE
8372 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
8373 <= TEMPLATE_TYPE_IDX (pattype
))))
8375 pedwarn (input_location
, 0, "deducing %qT as %qT",
8376 non_reference (TREE_TYPE (patparm
)),
8377 non_reference (type
));
8378 pedwarn (DECL_SOURCE_LOCATION (cand
->fn
), 0,
8379 " in call to %qD", cand
->fn
);
8380 pedwarn (input_location
, 0,
8381 " (you can disable this with "
8382 "%<-fno-deduce-init-list%>)");
8386 /* Set user_conv_p on the argument conversions, so rvalue/base handling
8387 knows not to allow any more UDCs. This needs to happen after we
8388 process cand->warnings. */
8389 if (flags
& LOOKUP_NO_CONVERSION
)
8390 conv
->user_conv_p
= true;
8392 tsubst_flags_t arg_complain
= complain
;
8393 if (!conversion_warning
)
8394 arg_complain
&= ~tf_warning
;
8396 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
8398 val
= convert_for_arg_passing (type
, val
, arg_complain
);
8400 if (val
== error_mark_node
)
8401 return error_mark_node
;
8403 argarray
[j
++] = val
;
8406 /* Default arguments */
8407 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
8409 if (TREE_VALUE (parm
) == error_mark_node
)
8410 return error_mark_node
;
8411 val
= convert_default_arg (TREE_VALUE (parm
),
8412 TREE_PURPOSE (parm
),
8415 if (val
== error_mark_node
)
8416 return error_mark_node
;
8417 argarray
[j
++] = val
;
8421 int magic
= magic_varargs_p (fn
);
8422 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
8424 tree a
= (*args
)[arg_index
];
8425 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
8427 /* Do no conversions for certain magic varargs. */
8428 a
= mark_type_use (a
);
8429 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
8430 return error_mark_node
;
8432 else if (magic
!= 0)
8433 /* For other magic varargs only do decay_conversion. */
8434 a
= decay_conversion (a
, complain
);
8435 else if (DECL_CONSTRUCTOR_P (fn
)
8436 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
8439 /* Avoid infinite recursion trying to call A(...). */
8440 if (complain
& tf_error
)
8441 /* Try to call the actual copy constructor for a good error. */
8442 call_copy_ctor (a
, complain
);
8443 return error_mark_node
;
8446 a
= convert_arg_to_ellipsis (a
, complain
);
8447 if (a
== error_mark_node
)
8448 return error_mark_node
;
8452 gcc_assert (j
<= nargs
);
8455 /* Avoid to do argument-transformation, if warnings for format, and for
8456 nonnull are disabled. Just in case that at least one of them is active
8457 the check_function_arguments function might warn about something. */
8459 bool warned_p
= false;
8462 || warn_suggest_attribute_format
8465 tree
*fargs
= (!nargs
? argarray
8466 : (tree
*) alloca (nargs
* sizeof (tree
)));
8467 for (j
= 0; j
< nargs
; j
++)
8469 /* For -Wformat undo the implicit passing by hidden reference
8470 done by convert_arg_to_ellipsis. */
8471 if (TREE_CODE (argarray
[j
]) == ADDR_EXPR
8472 && TYPE_REF_P (TREE_TYPE (argarray
[j
])))
8473 fargs
[j
] = TREE_OPERAND (argarray
[j
], 0);
8475 fargs
[j
] = argarray
[j
];
8478 warned_p
= check_function_arguments (input_location
, fn
, TREE_TYPE (fn
),
8479 nargs
, fargs
, NULL
);
8482 if (DECL_INHERITED_CTOR (fn
))
8484 /* Check for passing ellipsis arguments to an inherited constructor. We
8485 could handle this by open-coding the inherited constructor rather than
8486 defining it, but let's not bother now. */
8487 if (!cp_unevaluated_operand
8489 && cand
->convs
[cand
->num_convs
-1]->ellipsis_p
)
8491 if (complain
& tf_error
)
8493 sorry ("passing arguments to ellipsis of inherited constructor "
8495 inform (DECL_SOURCE_LOCATION (cand
->fn
), "declared here");
8497 return error_mark_node
;
8500 /* A base constructor inheriting from a virtual base doesn't get the
8501 inherited arguments, just this and __vtt. */
8502 if (ctor_omit_inherited_parms (fn
))
8506 /* Avoid actually calling copy constructors and copy assignment operators,
8509 if (! flag_elide_constructors
&& !force_elide
)
8510 /* Do things the hard way. */;
8511 else if (cand
->num_convs
== 1
8512 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8513 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8514 /* It's unsafe to elide the constructor when handling
8515 a noexcept-expression, it may evaluate to the wrong
8516 value (c++/53025). */
8517 && (force_elide
|| cp_noexcept_operand
== 0))
8520 tree arg
= argarray
[num_artificial_parms_for (fn
)];
8522 bool trivial
= trivial_fn_p (fn
);
8524 /* Pull out the real argument, disregarding const-correctness. */
8526 /* Strip the reference binding for the constructor parameter. */
8527 if (CONVERT_EXPR_P (targ
)
8528 && TYPE_REF_P (TREE_TYPE (targ
)))
8529 targ
= TREE_OPERAND (targ
, 0);
8530 /* But don't strip any other reference bindings; binding a temporary to a
8531 reference prevents copy elision. */
8532 while ((CONVERT_EXPR_P (targ
)
8533 && !TYPE_REF_P (TREE_TYPE (targ
)))
8534 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
8535 targ
= TREE_OPERAND (targ
, 0);
8536 if (TREE_CODE (targ
) == ADDR_EXPR
)
8538 targ
= TREE_OPERAND (targ
, 0);
8539 if (!same_type_ignoring_top_level_qualifiers_p
8540 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
8549 arg
= cp_build_fold_indirect_ref (arg
);
8551 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8553 if (CHECKING_P
&& cxx_dialect
>= cxx17
)
8554 gcc_assert (TREE_CODE (arg
) != TARGET_EXPR
8556 /* It's from binding the ref parm to a packed field. */
8557 || convs
[0]->need_temporary_p
8559 /* See unsafe_copy_elision_p. */
8560 || DECL_BASE_CONSTRUCTOR_P (fn
));
8563 bool unsafe
= unsafe_copy_elision_p (fa
, arg
);
8564 bool eliding_temp
= (TREE_CODE (arg
) == TARGET_EXPR
&& !unsafe
);
8566 /* [class.copy]: the copy constructor is implicitly defined even if the
8567 implementation elided its use. But don't warn about deprecation when
8568 eliding a temporary, as then no copy is actually performed. */
8569 warning_sentinel
s (warn_deprecated_copy
, eliding_temp
);
8571 /* The language says this isn't called. */;
8574 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
8575 return error_mark_node
;
8576 already_used
= true;
8579 cp_warn_deprecated_use (fn
, complain
);
8581 /* If we're creating a temp and we already have one, don't create a
8582 new one. If we're not creating a temp but we get one, use
8583 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8584 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8585 temp or an INIT_EXPR otherwise. */
8586 if (is_dummy_object (fa
))
8588 if (TREE_CODE (arg
) == TARGET_EXPR
)
8591 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
8593 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
8596 tree to
= cp_stabilize_reference (cp_build_fold_indirect_ref (fa
));
8598 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
8602 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
8603 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
)
8604 && trivial_fn_p (fn
))
8606 tree to
= cp_stabilize_reference
8607 (cp_build_fold_indirect_ref (argarray
[0]));
8608 tree type
= TREE_TYPE (to
);
8609 tree as_base
= CLASSTYPE_AS_BASE (type
);
8610 tree arg
= argarray
[1];
8611 location_t loc
= cp_expr_loc_or_loc (arg
, input_location
);
8613 if (is_really_empty_class (type
, /*ignore_vptr*/true))
8615 /* Avoid copying empty classes. */
8616 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
8617 TREE_NO_WARNING (val
) = 1;
8619 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
8621 if (is_std_init_list (type
)
8622 && conv_binds_ref_to_prvalue (convs
[1]))
8623 warning_at (loc
, OPT_Winit_list_lifetime
,
8624 "assignment from temporary initializer_list does not "
8625 "extend the lifetime of the underlying array");
8626 arg
= cp_build_fold_indirect_ref (arg
);
8627 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
8631 /* We must only copy the non-tail padding parts. */
8633 tree array_type
, alias_set
;
8635 arg2
= TYPE_SIZE_UNIT (as_base
);
8636 arg0
= cp_build_addr_expr (to
, complain
);
8638 array_type
= build_array_type (unsigned_char_type_node
,
8640 (size_binop (MINUS_EXPR
,
8641 arg2
, size_int (1))));
8642 alias_set
= build_int_cst (build_pointer_type (type
), 0);
8643 t
= build2 (MODIFY_EXPR
, void_type_node
,
8644 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
8645 build2 (MEM_REF
, array_type
, arg
, alias_set
));
8646 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
8647 TREE_NO_WARNING (val
) = 1;
8650 cp_warn_deprecated_use (fn
, complain
);
8654 else if (trivial_fn_p (fn
))
8656 if (DECL_DESTRUCTOR_P (fn
))
8657 return build_trivial_dtor_call (argarray
[0]);
8658 else if (default_ctor_p (fn
))
8660 if (is_dummy_object (argarray
[0]))
8661 return force_target_expr (DECL_CONTEXT (fn
), void_node
,
8662 no_cleanup_complain
);
8664 return cp_build_fold_indirect_ref (argarray
[0]);
8668 gcc_assert (!force_elide
);
8671 && !mark_used (fn
, complain
))
8672 return error_mark_node
;
8674 /* Warn if the built-in writes to an object of a non-trivial type. */
8675 if (warn_class_memaccess
8676 && vec_safe_length (args
) >= 2
8677 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8678 maybe_warn_class_memaccess (input_location
, fn
, args
);
8680 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
8683 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
8685 ba_any
, NULL
, complain
);
8686 gcc_assert (binfo
&& binfo
!= error_mark_node
);
8688 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
8690 if (TREE_SIDE_EFFECTS (argarray
[0]))
8691 argarray
[0] = save_expr (argarray
[0]);
8692 t
= build_pointer_type (TREE_TYPE (fn
));
8693 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
8698 fn
= build_addr_func (fn
, complain
);
8699 if (fn
== error_mark_node
)
8700 return error_mark_node
;
8703 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
8704 if (call
== error_mark_node
)
8706 if (cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
8708 tree c
= extract_call_expr (call
);
8709 /* build_new_op_1 will clear this when appropriate. */
8710 CALL_EXPR_ORDERED_ARGS (c
) = true;
8714 tree c
= extract_call_expr (call
);
8715 if (TREE_CODE (c
) == CALL_EXPR
)
8716 TREE_NO_WARNING (c
) = 1;
8724 /* Return the DECL of the first non-static subobject of class TYPE
8725 that satisfies the predicate PRED or null if none can be found. */
8727 template <class Predicate
>
8729 first_non_static_field (tree type
, Predicate pred
)
8731 if (!type
|| !CLASS_TYPE_P (type
))
8734 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8736 if (TREE_CODE (field
) != FIELD_DECL
)
8738 if (TREE_STATIC (field
))
8746 for (tree base_binfo
, binfo
= TYPE_BINFO (type
);
8747 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8749 tree base
= TREE_TYPE (base_binfo
);
8752 if (tree field
= first_non_static_field (base
, pred
))
8759 struct NonPublicField
8761 bool operator() (const_tree t
)
8763 return DECL_P (t
) && (TREE_PRIVATE (t
) || TREE_PROTECTED (t
));
8767 /* Return the DECL of the first non-public subobject of class TYPE
8768 or null if none can be found. */
8771 first_non_public_field (tree type
)
8773 return first_non_static_field (type
, NonPublicField ());
8776 struct NonTrivialField
8778 bool operator() (const_tree t
)
8780 return !trivial_type_p (DECL_P (t
) ? TREE_TYPE (t
) : t
);
8784 /* Return the DECL of the first non-trivial subobject of class TYPE
8785 or null if none can be found. */
8788 first_non_trivial_field (tree type
)
8790 return first_non_static_field (type
, NonTrivialField ());
8793 } /* unnamed namespace */
8795 /* Return true if all copy and move assignment operator overloads for
8796 class TYPE are trivial and at least one of them is not deleted and,
8797 when ACCESS is set, accessible. Return false otherwise. Set
8798 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8799 copy or move assignment. */
8802 has_trivial_copy_assign_p (tree type
, bool access
, bool *hasassign
)
8804 tree fns
= get_class_binding (type
, assign_op_identifier
);
8805 bool all_trivial
= true;
8807 /* Iterate over overloads of the assignment operator, checking
8808 accessible copy assignments for triviality. */
8810 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8814 /* Skip operators that aren't copy assignments. */
8818 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8819 || accessible_p (TYPE_BINFO (type
), f
, true));
8821 /* Skip template assignment operators and deleted functions. */
8822 if (TREE_CODE (f
) != FUNCTION_DECL
|| DECL_DELETED_FN (f
))
8828 if (!accessible
|| !trivial_fn_p (f
))
8829 all_trivial
= false;
8831 /* Break early when both properties have been determined. */
8832 if (*hasassign
&& !all_trivial
)
8836 /* Return true if they're all trivial and one of the expressions
8837 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8838 tree ref
= cp_build_reference_type (type
, false);
8840 && (is_trivially_xible (MODIFY_EXPR
, type
, type
)
8841 || is_trivially_xible (MODIFY_EXPR
, type
, ref
)));
8844 /* Return true if all copy and move ctor overloads for class TYPE are
8845 trivial and at least one of them is not deleted and, when ACCESS is
8846 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8847 to true when the TYPE has a (not necessarily trivial) default and copy
8848 (or move) ctor, respectively. */
8851 has_trivial_copy_p (tree type
, bool access
, bool hasctor
[2])
8853 tree fns
= get_class_binding (type
, complete_ctor_identifier
);
8854 bool all_trivial
= true;
8856 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8860 /* Skip template constructors. */
8861 if (TREE_CODE (f
) != FUNCTION_DECL
)
8864 bool cpy_or_move_ctor_p
= copy_fn_p (f
);
8866 /* Skip ctors other than default, copy, and move. */
8867 if (!cpy_or_move_ctor_p
&& !default_ctor_p (f
))
8870 if (DECL_DELETED_FN (f
))
8873 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8874 || accessible_p (TYPE_BINFO (type
), f
, true));
8877 hasctor
[cpy_or_move_ctor_p
] = true;
8879 if (cpy_or_move_ctor_p
&& (!accessible
|| !trivial_fn_p (f
)))
8880 all_trivial
= false;
8882 /* Break early when both properties have been determined. */
8883 if (hasctor
[0] && hasctor
[1] && !all_trivial
)
8890 /* Issue a warning on a call to the built-in function FNDECL if it is
8891 a raw memory write whose destination is not an object of (something
8892 like) trivial or standard layout type with a non-deleted assignment
8893 and copy ctor. Detects const correctness violations, corrupting
8894 references, virtual table pointers, and bypassing non-trivial
8898 maybe_warn_class_memaccess (location_t loc
, tree fndecl
,
8899 const vec
<tree
, va_gc
> *args
)
8901 /* Except for bcopy where it's second, the destination pointer is
8902 the first argument for all functions handled here. Compute
8903 the index of the destination and source arguments. */
8904 unsigned dstidx
= DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_BCOPY
;
8905 unsigned srcidx
= !dstidx
;
8907 tree dest
= (*args
)[dstidx
];
8908 if (!TREE_TYPE (dest
) || !INDIRECT_TYPE_P (TREE_TYPE (dest
)))
8911 tree srctype
= NULL_TREE
;
8913 /* Determine the type of the pointed-to object and whether it's
8914 a complete class type. */
8915 tree desttype
= TREE_TYPE (TREE_TYPE (dest
));
8917 if (!desttype
|| !COMPLETE_TYPE_P (desttype
) || !CLASS_TYPE_P (desttype
))
8920 /* Check to see if the raw memory call is made by a non-static member
8921 function with THIS as the destination argument for the destination
8922 type. If so, and if the class has no non-trivial bases or members,
8923 be more permissive. */
8924 if (current_function_decl
8925 && DECL_NONSTATIC_MEMBER_FUNCTION_P (current_function_decl
)
8926 && is_this_parameter (tree_strip_nop_conversions (dest
)))
8928 tree ctx
= DECL_CONTEXT (current_function_decl
);
8929 bool special
= same_type_ignoring_top_level_qualifiers_p (ctx
, desttype
);
8930 tree binfo
= TYPE_BINFO (ctx
);
8933 && !BINFO_VTABLE (binfo
)
8934 && !first_non_trivial_field (desttype
))
8938 /* True if the class is trivial. */
8939 bool trivial
= trivial_type_p (desttype
);
8941 /* Set to true if DESTYPE has an accessible copy assignment. */
8942 bool hasassign
= false;
8943 /* True if all of the class' overloaded copy assignment operators
8944 are all trivial (and not deleted) and at least one of them is
8946 bool trivassign
= has_trivial_copy_assign_p (desttype
, true, &hasassign
);
8948 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8950 bool hasctors
[2] = { false, false };
8952 /* True if all of the class' overloaded copy constructors are all
8953 trivial (and not deleted) and at least one of them is accessible. */
8954 bool trivcopy
= has_trivial_copy_p (desttype
, true, hasctors
);
8956 /* Set FLD to the first private/protected member of the class. */
8957 tree fld
= trivial
? first_non_public_field (desttype
) : NULL_TREE
;
8959 /* The warning format string. */
8960 const char *warnfmt
= NULL
;
8961 /* A suggested alternative to offer instead of the raw memory call.
8962 Empty string when none can be come up with. */
8963 const char *suggest
= "";
8964 bool warned
= false;
8966 switch (DECL_FUNCTION_CODE (fndecl
))
8968 case BUILT_IN_MEMSET
:
8969 if (!integer_zerop (maybe_constant_value ((*args
)[1])))
8971 /* Diagnose setting non-copy-assignable or non-trivial types,
8972 or types with a private member, to (potentially) non-zero
8973 bytes. Since the value of the bytes being written is unknown,
8974 suggest using assignment instead (if one exists). Also warn
8975 for writes into objects for which zero-initialization doesn't
8976 mean all bits clear (pointer-to-member data, where null is all
8977 bits set). Since the value being written is (most likely)
8978 non-zero, simply suggest assignment (but not copy assignment). */
8979 suggest
= "; use assignment instead";
8981 warnfmt
= G_("%qD writing to an object of type %#qT with "
8982 "no trivial copy-assignment");
8984 warnfmt
= G_("%qD writing to an object of non-trivial type %#qT%s");
8987 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8988 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8989 "%qD writing to an object of type %#qT with "
8991 fndecl
, desttype
, access
, fld
);
8993 else if (!zero_init_p (desttype
))
8994 warnfmt
= G_("%qD writing to an object of type %#qT containing "
8995 "a pointer to data member%s");
9001 case BUILT_IN_BZERO
:
9002 /* Similarly to the above, diagnose clearing non-trivial or non-
9003 standard layout objects, or objects of types with no assignmenmt.
9004 Since the value being written is known to be zero, suggest either
9005 copy assignment, copy ctor, or default ctor as an alternative,
9006 depending on what's available. */
9008 if (hasassign
&& hasctors
[0])
9009 suggest
= G_("; use assignment or value-initialization instead");
9011 suggest
= G_("; use assignment instead");
9012 else if (hasctors
[0])
9013 suggest
= G_("; use value-initialization instead");
9016 warnfmt
= G_("%qD clearing an object of type %#qT with "
9017 "no trivial copy-assignment%s");
9019 warnfmt
= G_("%qD clearing an object of non-trivial type %#qT%s");
9020 else if (!zero_init_p (desttype
))
9021 warnfmt
= G_("%qD clearing an object of type %#qT containing "
9022 "a pointer-to-member%s");
9025 case BUILT_IN_BCOPY
:
9026 case BUILT_IN_MEMCPY
:
9027 case BUILT_IN_MEMMOVE
:
9028 case BUILT_IN_MEMPCPY
:
9029 /* Determine the type of the source object. */
9030 srctype
= TREE_TYPE ((*args
)[srcidx
]);
9031 if (!srctype
|| !INDIRECT_TYPE_P (srctype
))
9032 srctype
= void_type_node
;
9034 srctype
= TREE_TYPE (srctype
);
9036 /* Since it's impossible to determine wheter the byte copy is
9037 being used in place of assignment to an existing object or
9038 as a substitute for initialization, assume it's the former.
9039 Determine the best alternative to use instead depending on
9040 what's not deleted. */
9041 if (hasassign
&& hasctors
[1])
9042 suggest
= G_("; use copy-assignment or copy-initialization instead");
9044 suggest
= G_("; use copy-assignment instead");
9045 else if (hasctors
[1])
9046 suggest
= G_("; use copy-initialization instead");
9049 warnfmt
= G_("%qD writing to an object of type %#qT with no trivial "
9050 "copy-assignment%s");
9051 else if (!trivially_copyable_p (desttype
))
9052 warnfmt
= G_("%qD writing to an object of non-trivially copyable "
9055 warnfmt
= G_("%qD writing to an object with a deleted copy constructor");
9058 && !VOID_TYPE_P (srctype
)
9059 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
9060 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
9063 /* Warn when copying into a non-trivial object from an object
9064 of a different type other than void or char. */
9065 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9066 "%qD copying an object of non-trivial type "
9067 "%#qT from an array of %#qT",
9068 fndecl
, desttype
, srctype
);
9071 && !VOID_TYPE_P (srctype
)
9072 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
9073 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
9076 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
9077 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9078 "%qD copying an object of type %#qT with "
9079 "%qs member %qD from an array of %#qT; use "
9080 "assignment or copy-initialization instead",
9081 fndecl
, desttype
, access
, fld
, srctype
);
9083 else if (!trivial
&& vec_safe_length (args
) > 2)
9085 tree sz
= maybe_constant_value ((*args
)[2]);
9086 if (!tree_fits_uhwi_p (sz
))
9089 /* Finally, warn on partial copies. */
9090 unsigned HOST_WIDE_INT typesize
9091 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype
));
9092 if (unsigned HOST_WIDE_INT partial
= tree_to_uhwi (sz
) % typesize
)
9093 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9094 (typesize
- partial
> 1
9095 ? G_("%qD writing to an object of "
9096 "a non-trivial type %#qT leaves %wu "
9098 : G_("%qD writing to an object of "
9099 "a non-trivial type %#qT leaves %wu "
9101 fndecl
, desttype
, typesize
- partial
);
9105 case BUILT_IN_REALLOC
:
9107 if (!trivially_copyable_p (desttype
))
9108 warnfmt
= G_("%qD moving an object of non-trivially copyable type "
9109 "%#qT; use %<new%> and %<delete%> instead");
9111 warnfmt
= G_("%qD moving an object of type %#qT with deleted copy "
9112 "constructor; use %<new%> and %<delete%> instead");
9113 else if (!get_dtor (desttype
, tf_none
))
9114 warnfmt
= G_("%qD moving an object of type %#qT with deleted "
9118 tree sz
= maybe_constant_value ((*args
)[1]);
9119 if (TREE_CODE (sz
) == INTEGER_CST
9120 && tree_int_cst_lt (sz
, TYPE_SIZE_UNIT (desttype
)))
9121 /* Finally, warn on reallocation into insufficient space. */
9122 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9123 "%qD moving an object of non-trivial type "
9124 "%#qT and size %E into a region of size %E",
9125 fndecl
, desttype
, TYPE_SIZE_UNIT (desttype
),
9137 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9138 warnfmt
, fndecl
, desttype
, suggest
);
9140 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9141 warnfmt
, fndecl
, desttype
);
9145 inform (location_of (desttype
), "%#qT declared here", desttype
);
9148 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
9149 This function performs no overload resolution, conversion, or other
9150 high-level operations. */
9153 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
9154 tsubst_flags_t complain
)
9158 /* Remember roughly where this call is. */
9159 location_t loc
= cp_expr_loc_or_loc (fn
, input_location
);
9160 fn
= build_call_a (fn
, nargs
, argarray
);
9161 SET_EXPR_LOCATION (fn
, loc
);
9163 fndecl
= get_callee_fndecl (fn
);
9165 /* Check that arguments to builtin functions match the expectations. */
9167 && !processing_template_decl
9168 && fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
9172 /* We need to take care that values to BUILT_IN_NORMAL
9174 for (i
= 0; i
< nargs
; i
++)
9175 argarray
[i
] = maybe_constant_value (argarray
[i
]);
9177 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
9179 return error_mark_node
;
9182 if (VOID_TYPE_P (TREE_TYPE (fn
)))
9185 /* 5.2.2/11: If a function call is a prvalue of object type: if the
9186 function call is either the operand of a decltype-specifier or the
9187 right operand of a comma operator that is the operand of a
9188 decltype-specifier, a temporary object is not introduced for the
9189 prvalue. The type of the prvalue may be incomplete. */
9190 if (!(complain
& tf_decltype
))
9192 fn
= require_complete_type_sfinae (fn
, complain
);
9193 if (fn
== error_mark_node
)
9194 return error_mark_node
;
9196 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
9198 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
9199 maybe_warn_parm_abi (TREE_TYPE (fn
), loc
);
9202 return convert_from_reference (fn
);
9205 /* Returns the value to use for the in-charge parameter when making a
9206 call to a function with the indicated NAME.
9208 FIXME:Can't we find a neater way to do this mapping? */
9211 in_charge_arg_for_name (tree name
)
9213 if (IDENTIFIER_CTOR_P (name
))
9215 if (name
== complete_ctor_identifier
)
9216 return integer_one_node
;
9217 gcc_checking_assert (name
== base_ctor_identifier
);
9221 if (name
== complete_dtor_identifier
)
9222 return integer_two_node
;
9223 else if (name
== deleting_dtor_identifier
)
9224 return integer_three_node
;
9225 gcc_checking_assert (name
== base_dtor_identifier
);
9228 return integer_zero_node
;
9231 /* We've built up a constructor call RET. Complain if it delegates to the
9232 constructor we're currently compiling. */
9235 check_self_delegation (tree ret
)
9237 if (TREE_CODE (ret
) == TARGET_EXPR
)
9238 ret
= TARGET_EXPR_INITIAL (ret
);
9239 tree fn
= cp_get_callee_fndecl_nofold (ret
);
9240 if (fn
&& DECL_ABSTRACT_ORIGIN (fn
) == current_function_decl
)
9241 error ("constructor delegates to itself");
9244 /* Build a call to a constructor, destructor, or an assignment
9245 operator for INSTANCE, an expression with class type. NAME
9246 indicates the special member function to call; *ARGS are the
9247 arguments. ARGS may be NULL. This may change ARGS. BINFO
9248 indicates the base of INSTANCE that is to be passed as the `this'
9249 parameter to the member function called.
9251 FLAGS are the LOOKUP_* flags to use when processing the call.
9253 If NAME indicates a complete object constructor, INSTANCE may be
9254 NULL_TREE. In this case, the caller will call build_cplus_new to
9255 store the newly constructed object into a VAR_DECL. */
9258 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
9259 tree binfo
, int flags
, tsubst_flags_t complain
)
9262 /* The type of the subobject to be constructed or destroyed. */
9264 vec
<tree
, va_gc
> *allocated
= NULL
;
9267 gcc_assert (IDENTIFIER_CDTOR_P (name
) || name
== assign_op_identifier
);
9269 if (error_operand_p (instance
))
9270 return error_mark_node
;
9272 if (IDENTIFIER_DTOR_P (name
))
9274 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
9275 if (!type_build_dtor_call (TREE_TYPE (instance
)))
9276 /* Shortcut to avoid lazy destructor declaration. */
9277 return build_trivial_dtor_call (instance
);
9282 /* Resolve the name. */
9283 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
9284 return error_mark_node
;
9286 binfo
= TYPE_BINFO (binfo
);
9289 gcc_assert (binfo
!= NULL_TREE
);
9291 class_type
= BINFO_TYPE (binfo
);
9293 /* Handle the special case where INSTANCE is NULL_TREE. */
9294 if (name
== complete_ctor_identifier
&& !instance
)
9295 instance
= build_dummy_object (class_type
);
9298 /* Convert to the base class, if necessary. */
9299 if (!same_type_ignoring_top_level_qualifiers_p
9300 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
9302 if (IDENTIFIER_CDTOR_P (name
))
9303 /* For constructors and destructors, either the base is
9304 non-virtual, or it is virtual but we are doing the
9305 conversion from a constructor or destructor for the
9306 complete object. In either case, we can convert
9308 instance
= convert_to_base_statically (instance
, binfo
);
9311 /* However, for assignment operators, we must convert
9312 dynamically if the base is virtual. */
9313 gcc_checking_assert (name
== assign_op_identifier
);
9314 instance
= build_base_path (PLUS_EXPR
, instance
,
9315 binfo
, /*nonnull=*/1, complain
);
9320 gcc_assert (instance
!= NULL_TREE
);
9322 /* In C++17, "If the initializer expression is a prvalue and the
9323 cv-unqualified version of the source type is the same class as the class
9324 of the destination, the initializer expression is used to initialize the
9325 destination object." Handle that here to avoid doing overload
9327 if (cxx_dialect
>= cxx17
9328 && args
&& vec_safe_length (*args
) == 1
9329 && name
== complete_ctor_identifier
)
9331 tree arg
= (**args
)[0];
9333 if (BRACE_ENCLOSED_INITIALIZER_P (arg
)
9334 && !TYPE_HAS_LIST_CTOR (class_type
)
9335 && CONSTRUCTOR_NELTS (arg
) == 1)
9336 arg
= CONSTRUCTOR_ELT (arg
, 0)->value
;
9338 if ((TREE_CODE (arg
) == TARGET_EXPR
9339 || TREE_CODE (arg
) == CONSTRUCTOR
)
9340 && (same_type_ignoring_top_level_qualifiers_p
9341 (class_type
, TREE_TYPE (arg
))))
9343 if (is_dummy_object (instance
))
9345 else if (TREE_CODE (arg
) == TARGET_EXPR
)
9346 TARGET_EXPR_DIRECT_INIT_P (arg
) = true;
9348 if ((complain
& tf_error
)
9349 && (flags
& LOOKUP_DELEGATING_CONS
))
9350 check_self_delegation (arg
);
9351 /* Avoid change of behavior on Wunused-var-2.C. */
9352 instance
= mark_lvalue_use (instance
);
9353 return build2 (INIT_EXPR
, class_type
, instance
, arg
);
9357 fns
= lookup_fnfields (binfo
, name
, 1);
9359 /* When making a call to a constructor or destructor for a subobject
9360 that uses virtual base classes, pass down a pointer to a VTT for
9362 if ((name
== base_ctor_identifier
9363 || name
== base_dtor_identifier
)
9364 && CLASSTYPE_VBASECLASSES (class_type
))
9369 /* If the current function is a complete object constructor
9370 or destructor, then we fetch the VTT directly.
9371 Otherwise, we look it up using the VTT we were given. */
9372 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
9373 vtt
= decay_conversion (vtt
, complain
);
9374 if (vtt
== error_mark_node
)
9375 return error_mark_node
;
9376 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
9377 if (BINFO_SUBVTT_INDEX (binfo
))
9378 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
9384 allocated
= make_tree_vector ();
9388 vec_safe_insert (*args
, 0, sub_vtt
);
9391 ret
= build_new_method_call (instance
, fns
, args
,
9392 TYPE_BINFO (BINFO_TYPE (binfo
)),
9396 if (allocated
!= NULL
)
9397 release_tree_vector (allocated
);
9399 if ((complain
& tf_error
)
9400 && (flags
& LOOKUP_DELEGATING_CONS
)
9401 && name
== complete_ctor_identifier
)
9402 check_self_delegation (ret
);
9407 /* Return the NAME, as a C string. The NAME indicates a function that
9408 is a member of TYPE. *FREE_P is set to true if the caller must
9409 free the memory returned.
9411 Rather than go through all of this, we should simply set the names
9412 of constructors and destructors appropriately, and dispense with
9413 ctor_identifier, dtor_identifier, etc. */
9416 name_as_c_string (tree name
, tree type
, bool *free_p
)
9418 const char *pretty_name
;
9420 /* Assume that we will not allocate memory. */
9422 /* Constructors and destructors are special. */
9423 if (IDENTIFIER_CDTOR_P (name
))
9426 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
)));
9427 /* For a destructor, add the '~'. */
9428 if (IDENTIFIER_DTOR_P (name
))
9430 pretty_name
= concat ("~", pretty_name
, NULL
);
9431 /* Remember that we need to free the memory allocated. */
9435 else if (IDENTIFIER_CONV_OP_P (name
))
9437 pretty_name
= concat ("operator ",
9438 type_as_string_translate (TREE_TYPE (name
),
9439 TFF_PLAIN_IDENTIFIER
),
9441 /* Remember that we need to free the memory allocated. */
9445 pretty_name
= identifier_to_locale (IDENTIFIER_POINTER (name
));
9447 return CONST_CAST (char *, pretty_name
);
9450 /* If CANDIDATES contains exactly one candidate, return it, otherwise
9453 static z_candidate
*
9454 single_z_candidate (z_candidate
*candidates
)
9456 if (candidates
== NULL
)
9459 if (candidates
->next
)
9465 /* If CANDIDATE is invalid due to a bad argument type, return the
9466 pertinent conversion_info.
9468 Otherwise, return NULL. */
9470 static const conversion_info
*
9471 maybe_get_bad_conversion_for_unmatched_call (const z_candidate
*candidate
)
9473 /* Must be an rr_arg_conversion or rr_bad_arg_conversion. */
9474 rejection_reason
*r
= candidate
->reason
;
9484 case rr_arg_conversion
:
9485 return &r
->u
.conversion
;
9487 case rr_bad_arg_conversion
:
9488 return &r
->u
.bad_conversion
;
9492 /* Issue an error and note complaining about a bad argument type at a
9493 callsite with a single candidate FNDECL.
9495 ARG_LOC is the location of the argument (or UNKNOWN_LOCATION, in which
9496 case input_location is used).
9497 FROM_TYPE is the type of the actual argument; TO_TYPE is the type of
9498 the formal parameter. */
9501 complain_about_bad_argument (location_t arg_loc
,
9502 tree from_type
, tree to_type
,
9503 tree fndecl
, int parmnum
)
9505 auto_diagnostic_group d
;
9506 range_label_for_type_mismatch
rhs_label (from_type
, to_type
);
9507 range_label
*label
= &rhs_label
;
9508 if (arg_loc
== UNKNOWN_LOCATION
)
9510 arg_loc
= input_location
;
9513 gcc_rich_location
richloc (arg_loc
, label
);
9515 "cannot convert %qH to %qI",
9516 from_type
, to_type
);
9517 maybe_inform_about_fndecl_for_bogus_argument_init (fndecl
,
9521 /* Subroutine of build_new_method_call_1, for where there are no viable
9522 candidates for the call. */
9525 complain_about_no_candidates_for_method_call (tree instance
,
9526 z_candidate
*candidates
,
9527 tree explicit_targs
,
9529 tree optype
, tree name
,
9530 bool skip_first_for_error
,
9531 vec
<tree
, va_gc
> *user_args
)
9533 auto_diagnostic_group d
;
9534 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
9535 cxx_incomplete_type_error (instance
, basetype
);
9537 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9538 basetype
, optype
, build_tree_list_vec (user_args
),
9539 TREE_TYPE (instance
));
9542 /* Special-case for when there's a single candidate that's failing
9543 due to a bad argument type. */
9544 if (z_candidate
*candidate
= single_z_candidate (candidates
))
9545 if (const conversion_info
*conv
9546 = maybe_get_bad_conversion_for_unmatched_call (candidate
))
9548 complain_about_bad_argument (conv
->loc
,
9549 conv
->from
, conv
->to_type
,
9550 candidate
->fn
, conv
->n_arg
);
9554 tree arglist
= build_tree_list_vec (user_args
);
9555 tree errname
= name
;
9556 bool twiddle
= false;
9557 if (IDENTIFIER_CDTOR_P (errname
))
9559 twiddle
= IDENTIFIER_DTOR_P (errname
);
9560 errname
= constructor_name (basetype
);
9563 errname
= lookup_template_function (errname
, explicit_targs
);
9564 if (skip_first_for_error
)
9565 arglist
= TREE_CHAIN (arglist
);
9566 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9567 basetype
, &"~"[!twiddle
], errname
, arglist
,
9568 TREE_TYPE (instance
));
9570 print_z_candidates (location_of (name
), candidates
);
9573 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
9574 be set, upon return, to the function called. ARGS may be NULL.
9575 This may change ARGS. */
9578 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9579 tree conversion_path
, int flags
,
9580 tree
*fn_p
, tsubst_flags_t complain
)
9582 struct z_candidate
*candidates
= 0, *cand
;
9583 tree explicit_targs
= NULL_TREE
;
9584 tree basetype
= NULL_TREE
;
9585 tree access_binfo
, binfo
;
9587 tree first_mem_arg
= NULL_TREE
;
9589 bool skip_first_for_error
;
9590 vec
<tree
, va_gc
> *user_args
;
9593 int template_only
= 0;
9597 vec
<tree
, va_gc
> *orig_args
= NULL
;
9600 gcc_assert (instance
!= NULL_TREE
);
9602 /* We don't know what function we're going to call, yet. */
9606 if (error_operand_p (instance
)
9607 || !fns
|| error_operand_p (fns
))
9608 return error_mark_node
;
9610 if (!BASELINK_P (fns
))
9612 if (complain
& tf_error
)
9613 error ("call to non-function %qD", fns
);
9614 return error_mark_node
;
9617 orig_instance
= instance
;
9620 /* Dismantle the baselink to collect all the information we need. */
9621 if (!conversion_path
)
9622 conversion_path
= BASELINK_BINFO (fns
);
9623 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
9624 binfo
= BASELINK_BINFO (fns
);
9625 optype
= BASELINK_OPTYPE (fns
);
9626 fns
= BASELINK_FUNCTIONS (fns
);
9627 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
9629 explicit_targs
= TREE_OPERAND (fns
, 1);
9630 fns
= TREE_OPERAND (fns
, 0);
9633 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
9634 || TREE_CODE (fns
) == TEMPLATE_DECL
9635 || TREE_CODE (fns
) == OVERLOAD
);
9636 fn
= OVL_FIRST (fns
);
9637 name
= DECL_NAME (fn
);
9639 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
9640 gcc_assert (CLASS_TYPE_P (basetype
));
9642 user_args
= args
== NULL
? NULL
: *args
;
9643 /* Under DR 147 A::A() is an invalid constructor call,
9644 not a functional cast. */
9645 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
9647 if (! (complain
& tf_error
))
9648 return error_mark_node
;
9650 basetype
= DECL_CONTEXT (fn
);
9651 name
= constructor_name (basetype
);
9652 auto_diagnostic_group d
;
9653 if (permerror (input_location
,
9654 "cannot call constructor %<%T::%D%> directly",
9656 inform (input_location
, "for a function-style cast, remove the "
9657 "redundant %<::%D%>", name
);
9658 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
9663 if (processing_template_decl
)
9665 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
9666 instance
= build_non_dependent_expr (instance
);
9668 make_args_non_dependent (*args
);
9671 /* Process the argument list. */
9672 if (args
!= NULL
&& *args
!= NULL
)
9674 *args
= resolve_args (*args
, complain
);
9676 return error_mark_node
;
9680 /* Consider the object argument to be used even if we end up selecting a
9681 static member function. */
9682 instance
= mark_type_use (instance
);
9684 /* Figure out whether to skip the first argument for the error
9685 message we will display to users if an error occurs. We don't
9686 want to display any compiler-generated arguments. The "this"
9687 pointer hasn't been added yet. However, we must remove the VTT
9688 pointer if this is a call to a base-class constructor or
9690 skip_first_for_error
= false;
9691 if (IDENTIFIER_CDTOR_P (name
))
9693 /* Callers should explicitly indicate whether they want to ctor
9694 the complete object or just the part without virtual bases. */
9695 gcc_assert (name
!= ctor_identifier
);
9697 /* Remove the VTT pointer, if present. */
9698 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
9699 && CLASSTYPE_VBASECLASSES (basetype
))
9700 skip_first_for_error
= true;
9702 /* It's OK to call destructors and constructors on cv-qualified
9703 objects. Therefore, convert the INSTANCE to the unqualified
9704 type, if necessary. */
9705 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
9707 instance
= build_this (instance
);
9708 instance
= build_nop (build_pointer_type (basetype
), instance
);
9709 instance
= build_fold_indirect_ref (instance
);
9713 gcc_assert (!DECL_DESTRUCTOR_P (fn
) && !DECL_CONSTRUCTOR_P (fn
));
9715 /* For the overload resolution we need to find the actual `this`
9716 that would be captured if the call turns out to be to a
9717 non-static member function. Do not actually capture it at this
9719 if (DECL_CONSTRUCTOR_P (fn
))
9720 /* Constructors don't use the enclosing 'this'. */
9721 first_mem_arg
= instance
;
9723 first_mem_arg
= maybe_resolve_dummy (instance
, false);
9725 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9726 p
= conversion_obstack_alloc (0);
9728 /* The number of arguments artificial parms in ARGS; we subtract one because
9729 there's no 'this' in ARGS. */
9730 unsigned skip
= num_artificial_parms_for (fn
) - 1;
9732 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9733 initializer, not T({ }). */
9734 if (DECL_CONSTRUCTOR_P (fn
)
9735 && vec_safe_length (user_args
) > skip
9736 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
9738 tree init_list
= (*user_args
)[skip
];
9739 tree init
= NULL_TREE
;
9741 gcc_assert (user_args
->length () == skip
+ 1
9742 && !(flags
& LOOKUP_ONLYCONVERTING
));
9744 /* If the initializer list has no elements and T is a class type with
9745 a default constructor, the object is value-initialized. Handle
9746 this here so we don't need to handle it wherever we use
9747 build_special_member_call. */
9748 if (CONSTRUCTOR_NELTS (init_list
) == 0
9749 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
9750 /* For a user-provided default constructor, use the normal
9751 mechanisms so that protected access works. */
9752 && type_has_non_user_provided_default_constructor (basetype
)
9753 && !processing_template_decl
)
9754 init
= build_value_init (basetype
, complain
);
9756 /* If BASETYPE is an aggregate, we need to do aggregate
9758 else if (CP_AGGREGATE_TYPE_P (basetype
))
9760 init
= reshape_init (basetype
, init_list
, complain
);
9761 init
= digest_init (basetype
, init
, complain
);
9766 if (is_dummy_object (instance
))
9767 return get_target_expr_sfinae (init
, complain
);
9768 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
9769 TREE_SIDE_EFFECTS (init
) = true;
9773 /* Otherwise go ahead with overload resolution. */
9774 add_list_candidates (fns
, first_mem_arg
, user_args
,
9775 basetype
, explicit_targs
, template_only
,
9776 conversion_path
, access_binfo
, flags
,
9777 &candidates
, complain
);
9780 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
9781 explicit_targs
, template_only
, conversion_path
,
9782 access_binfo
, flags
, &candidates
, complain
);
9784 any_viable_p
= false;
9785 candidates
= splice_viable (candidates
, false, &any_viable_p
);
9789 if (complain
& tf_error
)
9790 complain_about_no_candidates_for_method_call (instance
, candidates
,
9791 explicit_targs
, basetype
,
9793 skip_first_for_error
,
9795 call
= error_mark_node
;
9799 cand
= tourney (candidates
, complain
);
9806 if (complain
& tf_error
)
9808 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
9809 arglist
= build_tree_list_vec (user_args
);
9810 if (skip_first_for_error
)
9811 arglist
= TREE_CHAIN (arglist
);
9812 auto_diagnostic_group d
;
9813 if (!any_strictly_viable (candidates
))
9814 error ("no matching function for call to %<%s(%A)%>",
9815 pretty_name
, arglist
);
9817 error ("call of overloaded %<%s(%A)%> is ambiguous",
9818 pretty_name
, arglist
);
9819 print_z_candidates (location_of (name
), candidates
);
9823 call
= error_mark_node
;
9830 if (!(flags
& LOOKUP_NONVIRTUAL
)
9831 && DECL_PURE_VIRTUAL_P (fn
)
9832 && instance
== current_class_ref
9833 && (complain
& tf_warning
))
9835 /* This is not an error, it is runtime undefined
9837 if (!current_function_decl
)
9838 warning (0, "pure virtual %q#D called from "
9839 "non-static data member initializer", fn
);
9840 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
9841 || DECL_DESTRUCTOR_P (current_function_decl
))
9842 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
9843 ? G_("pure virtual %q#D called from constructor")
9844 : G_("pure virtual %q#D called from destructor")),
9848 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
9849 && !DECL_CONSTRUCTOR_P (fn
)
9850 && is_dummy_object (instance
))
9852 instance
= maybe_resolve_dummy (instance
, true);
9853 if (instance
== error_mark_node
)
9854 call
= error_mark_node
;
9855 else if (!is_dummy_object (instance
))
9857 /* We captured 'this' in the current lambda now that
9858 we know we really need it. */
9859 cand
->first_arg
= instance
;
9861 else if (any_dependent_bases_p ())
9862 /* We can't tell until instantiation time whether we can use
9863 *this as the implicit object argument. */;
9866 if (complain
& tf_error
)
9867 error ("cannot call member function %qD without object",
9869 call
= error_mark_node
;
9873 if (call
!= error_mark_node
)
9875 /* Optimize away vtable lookup if we know that this
9876 function can't be overridden. We need to check if
9877 the context and the type where we found fn are the same,
9878 actually FN might be defined in a different class
9879 type because of a using-declaration. In this case, we
9880 do not want to perform a non-virtual call. */
9881 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
9882 && same_type_ignoring_top_level_qualifiers_p
9883 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
9884 && resolves_to_fixed_type_p (instance
, 0))
9885 flags
|= LOOKUP_NONVIRTUAL
;
9887 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
9888 /* Now we know what function is being called. */
9891 /* Build the actual CALL_EXPR. */
9892 call
= build_over_call (cand
, flags
, complain
);
9893 /* In an expression of the form `a->f()' where `f' turns
9894 out to be a static member function, `a' is
9895 none-the-less evaluated. */
9896 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
9897 && !is_dummy_object (instance
)
9898 && TREE_SIDE_EFFECTS (instance
))
9900 /* But avoid the implicit lvalue-rvalue conversion when 'a'
9903 if (TREE_THIS_VOLATILE (a
))
9905 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
), a
, call
);
9907 else if (call
!= error_mark_node
9908 && DECL_DESTRUCTOR_P (cand
->fn
)
9909 && !VOID_TYPE_P (TREE_TYPE (call
)))
9910 /* An explicit call of the form "x->~X()" has type
9911 "void". However, on platforms where destructors
9912 return "this" (i.e., those where
9913 targetm.cxx.cdtor_returns_this is true), such calls
9914 will appear to have a return value of pointer type
9915 to the low-level call machinery. We do not want to
9916 change the low-level machinery, since we want to be
9917 able to optimize "delete f()" on such platforms as
9918 "operator delete(~X(f()))" (rather than generating
9919 "t = f(), ~X(t), operator delete (t)"). */
9920 call
= build_nop (void_type_node
, call
);
9925 if (processing_template_decl
&& call
!= error_mark_node
)
9927 bool cast_to_void
= false;
9929 if (TREE_CODE (call
) == COMPOUND_EXPR
)
9930 call
= TREE_OPERAND (call
, 1);
9931 else if (TREE_CODE (call
) == NOP_EXPR
)
9933 cast_to_void
= true;
9934 call
= TREE_OPERAND (call
, 0);
9936 if (INDIRECT_REF_P (call
))
9937 call
= TREE_OPERAND (call
, 0);
9938 call
= (build_min_non_dep_call_vec
9940 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
9941 orig_instance
, orig_fns
, NULL_TREE
),
9943 SET_EXPR_LOCATION (call
, input_location
);
9944 call
= convert_from_reference (call
);
9946 call
= build_nop (void_type_node
, call
);
9949 /* Free all the conversions we allocated. */
9950 obstack_free (&conversion_obstack
, p
);
9952 if (orig_args
!= NULL
)
9953 release_tree_vector (orig_args
);
9958 /* Wrapper for above. */
9961 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9962 tree conversion_path
, int flags
,
9963 tree
*fn_p
, tsubst_flags_t complain
)
9966 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
9967 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
9969 timevar_cond_stop (TV_OVERLOAD
, subtime
);
9973 /* Returns true iff standard conversion sequence ICS1 is a proper
9974 subsequence of ICS2. */
9977 is_subseq (conversion
*ics1
, conversion
*ics2
)
9979 /* We can assume that a conversion of the same code
9980 between the same types indicates a subsequence since we only get
9981 here if the types we are converting from are the same. */
9983 while (ics1
->kind
== ck_rvalue
9984 || ics1
->kind
== ck_lvalue
)
9985 ics1
= next_conversion (ics1
);
9989 while (ics2
->kind
== ck_rvalue
9990 || ics2
->kind
== ck_lvalue
)
9991 ics2
= next_conversion (ics2
);
9993 if (ics2
->kind
== ck_user
9994 || ics2
->kind
== ck_ambig
9995 || ics2
->kind
== ck_aggr
9996 || ics2
->kind
== ck_list
9997 || ics2
->kind
== ck_identity
)
9998 /* At this point, ICS1 cannot be a proper subsequence of
9999 ICS2. We can get a USER_CONV when we are comparing the
10000 second standard conversion sequence of two user conversion
10004 ics2
= next_conversion (ics2
);
10006 while (ics2
->kind
== ck_rvalue
10007 || ics2
->kind
== ck_lvalue
)
10008 ics2
= next_conversion (ics2
);
10010 if (ics2
->kind
== ics1
->kind
10011 && same_type_p (ics2
->type
, ics1
->type
)
10012 && (ics1
->kind
== ck_identity
10013 || same_type_p (next_conversion (ics2
)->type
,
10014 next_conversion (ics1
)->type
)))
10019 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
10020 be any _TYPE nodes. */
10023 is_properly_derived_from (tree derived
, tree base
)
10025 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
10028 /* We only allow proper derivation here. The DERIVED_FROM_P macro
10029 considers every class derived from itself. */
10030 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
10031 && DERIVED_FROM_P (base
, derived
));
10034 /* We build the ICS for an implicit object parameter as a pointer
10035 conversion sequence. However, such a sequence should be compared
10036 as if it were a reference conversion sequence. If ICS is the
10037 implicit conversion sequence for an implicit object parameter,
10038 modify it accordingly. */
10041 maybe_handle_implicit_object (conversion
**ics
)
10043 if ((*ics
)->this_p
)
10045 /* [over.match.funcs]
10047 For non-static member functions, the type of the
10048 implicit object parameter is "reference to cv X"
10049 where X is the class of which the function is a
10050 member and cv is the cv-qualification on the member
10051 function declaration. */
10052 conversion
*t
= *ics
;
10053 tree reference_type
;
10055 /* The `this' parameter is a pointer to a class type. Make the
10056 implicit conversion talk about a reference to that same class
10058 reference_type
= TREE_TYPE (t
->type
);
10059 reference_type
= build_reference_type (reference_type
);
10061 if (t
->kind
== ck_qual
)
10062 t
= next_conversion (t
);
10063 if (t
->kind
== ck_ptr
)
10064 t
= next_conversion (t
);
10065 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
10066 t
= direct_reference_binding (reference_type
, t
);
10068 t
->rvaluedness_matches_p
= 0;
10073 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
10074 and return the initial reference binding conversion. Otherwise,
10075 leave *ICS unchanged and return NULL. */
10077 static conversion
*
10078 maybe_handle_ref_bind (conversion
**ics
)
10080 if ((*ics
)->kind
== ck_ref_bind
)
10082 conversion
*old_ics
= *ics
;
10083 *ics
= next_conversion (old_ics
);
10084 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
10091 /* Compare two implicit conversion sequences according to the rules set out in
10092 [over.ics.rank]. Return values:
10094 1: ics1 is better than ics2
10095 -1: ics2 is better than ics1
10096 0: ics1 and ics2 are indistinguishable */
10099 compare_ics (conversion
*ics1
, conversion
*ics2
)
10105 tree deref_from_type1
= NULL_TREE
;
10106 tree deref_from_type2
= NULL_TREE
;
10107 tree deref_to_type1
= NULL_TREE
;
10108 tree deref_to_type2
= NULL_TREE
;
10109 conversion_rank rank1
, rank2
;
10111 /* REF_BINDING is nonzero if the result of the conversion sequence
10112 is a reference type. In that case REF_CONV is the reference
10113 binding conversion. */
10114 conversion
*ref_conv1
;
10115 conversion
*ref_conv2
;
10117 /* Compare badness before stripping the reference conversion. */
10118 if (ics1
->bad_p
> ics2
->bad_p
)
10120 else if (ics1
->bad_p
< ics2
->bad_p
)
10123 /* Handle implicit object parameters. */
10124 maybe_handle_implicit_object (&ics1
);
10125 maybe_handle_implicit_object (&ics2
);
10127 /* Handle reference parameters. */
10128 ref_conv1
= maybe_handle_ref_bind (&ics1
);
10129 ref_conv2
= maybe_handle_ref_bind (&ics2
);
10131 /* List-initialization sequence L1 is a better conversion sequence than
10132 list-initialization sequence L2 if L1 converts to
10133 std::initializer_list<X> for some X and L2 does not. */
10134 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
10136 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
10141 When comparing the basic forms of implicit conversion sequences (as
10142 defined in _over.best.ics_)
10144 --a standard conversion sequence (_over.ics.scs_) is a better
10145 conversion sequence than a user-defined conversion sequence
10146 or an ellipsis conversion sequence, and
10148 --a user-defined conversion sequence (_over.ics.user_) is a
10149 better conversion sequence than an ellipsis conversion sequence
10150 (_over.ics.ellipsis_). */
10151 /* Use BAD_CONVERSION_RANK because we already checked for a badness
10152 mismatch. If both ICS are bad, we try to make a decision based on
10153 what would have happened if they'd been good. This is not an
10154 extension, we'll still give an error when we build up the call; this
10155 just helps us give a more helpful error message. */
10156 rank1
= BAD_CONVERSION_RANK (ics1
);
10157 rank2
= BAD_CONVERSION_RANK (ics2
);
10161 else if (rank1
< rank2
)
10164 if (ics1
->ellipsis_p
)
10165 /* Both conversions are ellipsis conversions. */
10168 /* User-defined conversion sequence U1 is a better conversion sequence
10169 than another user-defined conversion sequence U2 if they contain the
10170 same user-defined conversion operator or constructor and if the sec-
10171 ond standard conversion sequence of U1 is better than the second
10172 standard conversion sequence of U2. */
10174 /* Handle list-conversion with the same code even though it isn't always
10175 ranked as a user-defined conversion and it doesn't have a second
10176 standard conversion sequence; it will still have the desired effect.
10177 Specifically, we need to do the reference binding comparison at the
10178 end of this function. */
10180 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
10181 || ics1
->kind
== ck_aggr
|| ics2
->kind
== ck_aggr
)
10186 for (t1
= ics1
; t1
&& t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
10187 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
10188 || t1
->kind
== ck_list
)
10190 for (t2
= ics2
; t2
&& t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
10191 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
10192 || t2
->kind
== ck_list
)
10195 if (!t1
|| !t2
|| t1
->kind
!= t2
->kind
)
10197 else if (t1
->kind
== ck_user
)
10199 tree f1
= t1
->cand
? t1
->cand
->fn
: t1
->type
;
10200 tree f2
= t2
->cand
? t2
->cand
->fn
: t2
->type
;
10206 /* For ambiguous or aggregate conversions, use the target type as
10207 a proxy for the conversion function. */
10208 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
10212 /* We can just fall through here, after setting up
10213 FROM_TYPE1 and FROM_TYPE2. */
10214 from_type1
= t1
->type
;
10215 from_type2
= t2
->type
;
10222 /* We're dealing with two standard conversion sequences.
10226 Standard conversion sequence S1 is a better conversion
10227 sequence than standard conversion sequence S2 if
10229 --S1 is a proper subsequence of S2 (comparing the conversion
10230 sequences in the canonical form defined by _over.ics.scs_,
10231 excluding any Lvalue Transformation; the identity
10232 conversion sequence is considered to be a subsequence of
10233 any non-identity conversion sequence */
10236 while (t1
->kind
!= ck_identity
)
10237 t1
= next_conversion (t1
);
10238 from_type1
= t1
->type
;
10241 while (t2
->kind
!= ck_identity
)
10242 t2
= next_conversion (t2
);
10243 from_type2
= t2
->type
;
10246 /* One sequence can only be a subsequence of the other if they start with
10247 the same type. They can start with different types when comparing the
10248 second standard conversion sequence in two user-defined conversion
10250 if (same_type_p (from_type1
, from_type2
))
10252 if (is_subseq (ics1
, ics2
))
10254 if (is_subseq (ics2
, ics1
))
10262 --the rank of S1 is better than the rank of S2 (by the rules
10265 Standard conversion sequences are ordered by their ranks: an Exact
10266 Match is a better conversion than a Promotion, which is a better
10267 conversion than a Conversion.
10269 Two conversion sequences with the same rank are indistinguishable
10270 unless one of the following rules applies:
10272 --A conversion that does not a convert a pointer, pointer to member,
10273 or std::nullptr_t to bool is better than one that does.
10275 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
10276 so that we do not have to check it explicitly. */
10277 if (ics1
->rank
< ics2
->rank
)
10279 else if (ics2
->rank
< ics1
->rank
)
10282 to_type1
= ics1
->type
;
10283 to_type2
= ics2
->type
;
10285 /* A conversion from scalar arithmetic type to complex is worse than a
10286 conversion between scalar arithmetic types. */
10287 if (same_type_p (from_type1
, from_type2
)
10288 && ARITHMETIC_TYPE_P (from_type1
)
10289 && ARITHMETIC_TYPE_P (to_type1
)
10290 && ARITHMETIC_TYPE_P (to_type2
)
10291 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
10292 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
10294 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
10300 if (TYPE_PTR_P (from_type1
)
10301 && TYPE_PTR_P (from_type2
)
10302 && TYPE_PTR_P (to_type1
)
10303 && TYPE_PTR_P (to_type2
))
10305 deref_from_type1
= TREE_TYPE (from_type1
);
10306 deref_from_type2
= TREE_TYPE (from_type2
);
10307 deref_to_type1
= TREE_TYPE (to_type1
);
10308 deref_to_type2
= TREE_TYPE (to_type2
);
10310 /* The rules for pointers to members A::* are just like the rules
10311 for pointers A*, except opposite: if B is derived from A then
10312 A::* converts to B::*, not vice versa. For that reason, we
10313 switch the from_ and to_ variables here. */
10314 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
10315 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
10316 || (TYPE_PTRMEMFUNC_P (from_type1
)
10317 && TYPE_PTRMEMFUNC_P (from_type2
)
10318 && TYPE_PTRMEMFUNC_P (to_type1
)
10319 && TYPE_PTRMEMFUNC_P (to_type2
)))
10321 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
10322 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
10323 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
10324 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
10327 if (deref_from_type1
!= NULL_TREE
10328 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
10329 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
10331 /* This was one of the pointer or pointer-like conversions.
10335 --If class B is derived directly or indirectly from class A,
10336 conversion of B* to A* is better than conversion of B* to
10337 void*, and conversion of A* to void* is better than
10338 conversion of B* to void*. */
10339 if (VOID_TYPE_P (deref_to_type1
)
10340 && VOID_TYPE_P (deref_to_type2
))
10342 if (is_properly_derived_from (deref_from_type1
,
10345 else if (is_properly_derived_from (deref_from_type2
,
10349 else if (VOID_TYPE_P (deref_to_type1
)
10350 || VOID_TYPE_P (deref_to_type2
))
10352 if (same_type_p (deref_from_type1
, deref_from_type2
))
10354 if (VOID_TYPE_P (deref_to_type2
))
10356 if (is_properly_derived_from (deref_from_type1
,
10360 /* We know that DEREF_TO_TYPE1 is `void' here. */
10361 else if (is_properly_derived_from (deref_from_type1
,
10366 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
10367 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
10371 --If class B is derived directly or indirectly from class A
10372 and class C is derived directly or indirectly from B,
10374 --conversion of C* to B* is better than conversion of C* to
10377 --conversion of B* to A* is better than conversion of C* to
10379 if (same_type_p (deref_from_type1
, deref_from_type2
))
10381 if (is_properly_derived_from (deref_to_type1
,
10384 else if (is_properly_derived_from (deref_to_type2
,
10388 else if (same_type_p (deref_to_type1
, deref_to_type2
))
10390 if (is_properly_derived_from (deref_from_type2
,
10393 else if (is_properly_derived_from (deref_from_type1
,
10399 else if (CLASS_TYPE_P (non_reference (from_type1
))
10400 && same_type_p (from_type1
, from_type2
))
10402 tree from
= non_reference (from_type1
);
10406 --binding of an expression of type C to a reference of type
10407 B& is better than binding an expression of type C to a
10408 reference of type A&
10410 --conversion of C to B is better than conversion of C to A, */
10411 if (is_properly_derived_from (from
, to_type1
)
10412 && is_properly_derived_from (from
, to_type2
))
10414 if (is_properly_derived_from (to_type1
, to_type2
))
10416 else if (is_properly_derived_from (to_type2
, to_type1
))
10420 else if (CLASS_TYPE_P (non_reference (to_type1
))
10421 && same_type_p (to_type1
, to_type2
))
10423 tree to
= non_reference (to_type1
);
10427 --binding of an expression of type B to a reference of type
10428 A& is better than binding an expression of type C to a
10429 reference of type A&,
10431 --conversion of B to A is better than conversion of C to A */
10432 if (is_properly_derived_from (from_type1
, to
)
10433 && is_properly_derived_from (from_type2
, to
))
10435 if (is_properly_derived_from (from_type2
, from_type1
))
10437 else if (is_properly_derived_from (from_type1
, from_type2
))
10444 --S1 and S2 differ only in their qualification conversion and yield
10445 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
10446 qualification signature of type T1 is a proper subset of the cv-
10447 qualification signature of type T2 */
10448 if (ics1
->kind
== ck_qual
10449 && ics2
->kind
== ck_qual
10450 && same_type_p (from_type1
, from_type2
))
10452 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
10459 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
10460 to an implicit object parameter of a non-static member function
10461 declared without a ref-qualifier, and either S1 binds an lvalue
10462 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
10463 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
10464 draft standard, 13.3.3.2)
10466 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
10467 types to which the references refer are the same type except for
10468 top-level cv-qualifiers, and the type to which the reference
10469 initialized by S2 refers is more cv-qualified than the type to
10470 which the reference initialized by S1 refers.
10472 DR 1328 [over.match.best]: the context is an initialization by
10473 conversion function for direct reference binding (13.3.1.6) of a
10474 reference to function type, the return type of F1 is the same kind of
10475 reference (i.e. lvalue or rvalue) as the reference being initialized,
10476 and the return type of F2 is not. */
10478 if (ref_conv1
&& ref_conv2
)
10480 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
10481 && (ref_conv1
->rvaluedness_matches_p
10482 != ref_conv2
->rvaluedness_matches_p
)
10483 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
10484 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
10485 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
10487 if (ref_conv1
->bad_p
10488 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
10489 TREE_TYPE (ref_conv2
->type
)))
10490 /* Don't prefer a bad conversion that drops cv-quals to a bad
10491 conversion with the wrong rvalueness. */
10493 return (ref_conv1
->rvaluedness_matches_p
10494 - ref_conv2
->rvaluedness_matches_p
);
10497 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
10499 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
10500 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
10501 if (ref_conv1
->bad_p
)
10503 /* Prefer the one that drops fewer cv-quals. */
10504 tree ftype
= next_conversion (ref_conv1
)->type
;
10505 int fquals
= cp_type_quals (ftype
);
10509 return comp_cv_qualification (q2
, q1
);
10513 /* Neither conversion sequence is better than the other. */
10517 /* The source type for this standard conversion sequence. */
10520 source_type (conversion
*t
)
10522 for (;; t
= next_conversion (t
))
10524 if (t
->kind
== ck_user
10525 || t
->kind
== ck_ambig
10526 || t
->kind
== ck_identity
)
10529 gcc_unreachable ();
10532 /* Note a warning about preferring WINNER to LOSER. We do this by storing
10533 a pointer to LOSER and re-running joust to produce the warning if WINNER
10534 is actually used. */
10537 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
10539 candidate_warning
*cw
= (candidate_warning
*)
10540 conversion_obstack_alloc (sizeof (candidate_warning
));
10542 cw
->next
= winner
->warnings
;
10543 winner
->warnings
= cw
;
10546 /* CAND is a constructor candidate in joust in C++17 and up. If it copies a
10547 prvalue returned from a conversion function, replace CAND with the candidate
10548 for the conversion and return true. Otherwise, return false. */
10551 joust_maybe_elide_copy (z_candidate
*&cand
)
10553 tree fn
= cand
->fn
;
10554 if (!DECL_COPY_CONSTRUCTOR_P (fn
) && !DECL_MOVE_CONSTRUCTOR_P (fn
))
10556 conversion
*conv
= cand
->convs
[0];
10557 gcc_checking_assert (conv
->kind
== ck_ref_bind
);
10558 conv
= next_conversion (conv
);
10559 if (conv
->kind
== ck_user
&& !TYPE_REF_P (conv
->type
))
10561 gcc_checking_assert (same_type_ignoring_top_level_qualifiers_p
10562 (conv
->type
, DECL_CONTEXT (fn
)));
10563 z_candidate
*uc
= conv
->cand
;
10564 if (DECL_CONV_FN_P (uc
->fn
))
10573 /* Compare two candidates for overloading as described in
10574 [over.match.best]. Return values:
10576 1: cand1 is better than cand2
10577 -1: cand2 is better than cand1
10578 0: cand1 and cand2 are indistinguishable */
10581 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
10582 tsubst_flags_t complain
)
10585 int off1
= 0, off2
= 0;
10589 /* Candidates that involve bad conversions are always worse than those
10591 if (cand1
->viable
> cand2
->viable
)
10593 if (cand1
->viable
< cand2
->viable
)
10596 /* If we have two pseudo-candidates for conversions to the same type,
10597 or two candidates for the same function, arbitrarily pick one. */
10598 if (cand1
->fn
== cand2
->fn
10599 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
10602 /* Prefer a non-deleted function over an implicitly deleted move
10603 constructor or assignment operator. This differs slightly from the
10604 wording for issue 1402 (which says the move op is ignored by overload
10605 resolution), but this way produces better error messages. */
10606 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10607 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10608 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
10610 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
10611 && move_fn_p (cand1
->fn
))
10613 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
10614 && move_fn_p (cand2
->fn
))
10618 /* a viable function F1
10619 is defined to be a better function than another viable function F2 if
10620 for all arguments i, ICSi(F1) is not a worse conversion sequence than
10621 ICSi(F2), and then */
10623 /* for some argument j, ICSj(F1) is a better conversion sequence than
10626 /* For comparing static and non-static member functions, we ignore
10627 the implicit object parameter of the non-static function. The
10628 standard says to pretend that the static function has an object
10629 parm, but that won't work with operator overloading. */
10630 len
= cand1
->num_convs
;
10631 if (len
!= cand2
->num_convs
)
10633 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
10634 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
10636 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
10637 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
10638 /* We're comparing a near-match list constructor and a near-match
10639 non-list constructor. Just treat them as unordered. */
10642 gcc_assert (static_1
!= static_2
);
10653 /* Handle C++17 copy elision in [over.match.ctor] (direct-init) context. The
10654 standard currently says that only constructors are candidates, but if one
10655 copies a prvalue returned by a conversion function we want to treat the
10656 conversion as the candidate instead.
10658 Clang does something similar, as discussed at
10659 http://lists.isocpp.org/core/2017/10/3166.php
10660 http://lists.isocpp.org/core/2019/03/5721.php */
10661 int elided_tiebreaker
= 0;
10662 if (len
== 1 && cxx_dialect
>= cxx17
10663 && DECL_P (cand1
->fn
)
10664 && DECL_COMPLETE_CONSTRUCTOR_P (cand1
->fn
)
10665 && !(cand1
->flags
& LOOKUP_ONLYCONVERTING
))
10667 bool elided1
= joust_maybe_elide_copy (cand1
);
10668 bool elided2
= joust_maybe_elide_copy (cand2
);
10669 /* As a tiebreaker below we will prefer a constructor to a conversion
10670 operator exposed this way. */
10671 elided_tiebreaker
= elided2
- elided1
;
10674 for (i
= 0; i
< len
; ++i
)
10676 conversion
*t1
= cand1
->convs
[i
+ off1
];
10677 conversion
*t2
= cand2
->convs
[i
+ off2
];
10678 int comp
= compare_ics (t1
, t2
);
10682 if ((complain
& tf_warning
)
10684 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
10685 == cr_std
+ cr_promotion
)
10686 && t1
->kind
== ck_std
10687 && t2
->kind
== ck_std
10688 && TREE_CODE (t1
->type
) == INTEGER_TYPE
10689 && TREE_CODE (t2
->type
) == INTEGER_TYPE
10690 && (TYPE_PRECISION (t1
->type
)
10691 == TYPE_PRECISION (t2
->type
))
10692 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
10693 || (TREE_CODE (next_conversion (t1
)->type
)
10694 == ENUMERAL_TYPE
)))
10696 tree type
= next_conversion (t1
)->type
;
10698 struct z_candidate
*w
, *l
;
10700 type1
= t1
->type
, type2
= t2
->type
,
10701 w
= cand1
, l
= cand2
;
10703 type1
= t2
->type
, type2
= t1
->type
,
10704 w
= cand2
, l
= cand1
;
10708 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
10709 type
, type1
, type2
);
10710 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
10713 add_warning (w
, l
);
10716 if (winner
&& comp
!= winner
)
10725 /* warn about confusing overload resolution for user-defined conversions,
10726 either between a constructor and a conversion op, or between two
10728 if ((complain
& tf_warning
)
10729 && winner
&& warn_conversion
&& cand1
->second_conv
10730 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
10731 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
10733 struct z_candidate
*w
, *l
;
10734 bool give_warning
= false;
10737 w
= cand1
, l
= cand2
;
10739 w
= cand2
, l
= cand1
;
10741 /* We don't want to complain about `X::operator T1 ()'
10742 beating `X::operator T2 () const', when T2 is a no less
10743 cv-qualified version of T1. */
10744 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
10745 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
10747 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
10748 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
10750 if (TREE_CODE (t
) == TREE_CODE (f
) && INDIRECT_TYPE_P (t
))
10755 if (!comp_ptr_ttypes (t
, f
))
10756 give_warning
= true;
10759 give_warning
= true;
10765 tree source
= source_type (w
->convs
[0]);
10766 if (INDIRECT_TYPE_P (source
))
10767 source
= TREE_TYPE (source
);
10768 auto_diagnostic_group d
;
10769 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
10770 && warning (OPT_Wconversion
, " for conversion from %qH to %qI",
10771 source
, w
->second_conv
->type
))
10773 inform (input_location
, " because conversion sequence for the argument is better");
10777 add_warning (w
, l
);
10783 /* Put this tiebreaker first, so that we don't try to look at second_conv of
10784 a constructor candidate that doesn't have one. */
10785 if (elided_tiebreaker
)
10786 return elided_tiebreaker
;
10788 /* DR 495 moved this tiebreaker above the template ones. */
10789 /* or, if not that,
10790 the context is an initialization by user-defined conversion (see
10791 _dcl.init_ and _over.match.user_) and the standard conversion
10792 sequence from the return type of F1 to the destination type (i.e.,
10793 the type of the entity being initialized) is a better conversion
10794 sequence than the standard conversion sequence from the return type
10795 of F2 to the destination type. */
10797 if (cand1
->second_conv
)
10799 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
10804 /* or, if not that,
10805 F1 is a non-template function and F2 is a template function
10808 if (!cand1
->template_decl
&& cand2
->template_decl
)
10810 else if (cand1
->template_decl
&& !cand2
->template_decl
)
10813 /* or, if not that,
10814 F1 and F2 are template functions and the function template for F1 is
10815 more specialized than the template for F2 according to the partial
10818 if (cand1
->template_decl
&& cand2
->template_decl
)
10820 winner
= more_specialized_fn
10821 (TI_TEMPLATE (cand1
->template_decl
),
10822 TI_TEMPLATE (cand2
->template_decl
),
10823 /* [temp.func.order]: The presence of unused ellipsis and default
10824 arguments has no effect on the partial ordering of function
10825 templates. add_function_candidate() will not have
10826 counted the "this" argument for constructors. */
10827 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
10833 // or, if not that, F1 is more constrained than F2.
10834 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
10836 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
10841 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10842 if (deduction_guide_p (cand1
->fn
))
10844 gcc_assert (deduction_guide_p (cand2
->fn
));
10845 /* We distinguish between candidates from an explicit deduction guide and
10846 candidates built from a constructor based on DECL_ARTIFICIAL. */
10847 int art1
= DECL_ARTIFICIAL (cand1
->fn
);
10848 int art2
= DECL_ARTIFICIAL (cand2
->fn
);
10850 return art2
- art1
;
10854 /* Prefer the special copy guide over a declared copy/move
10856 if (copy_guide_p (cand1
->fn
))
10858 if (copy_guide_p (cand2
->fn
))
10861 /* Prefer a candidate generated from a non-template constructor. */
10862 int tg1
= template_guide_p (cand1
->fn
);
10863 int tg2
= template_guide_p (cand2
->fn
);
10869 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10870 for all arguments the corresponding parameters of F1 and F2 have the same
10871 type (CWG 2273/2277). */
10872 if (DECL_P (cand1
->fn
) && DECL_CLASS_SCOPE_P (cand1
->fn
)
10873 && !DECL_CONV_FN_P (cand1
->fn
)
10874 && DECL_P (cand2
->fn
) && DECL_CLASS_SCOPE_P (cand2
->fn
)
10875 && !DECL_CONV_FN_P (cand2
->fn
))
10877 tree base1
= DECL_CONTEXT (strip_inheriting_ctors (cand1
->fn
));
10878 tree base2
= DECL_CONTEXT (strip_inheriting_ctors (cand2
->fn
));
10880 bool used1
= false;
10881 bool used2
= false;
10882 if (base1
== base2
)
10883 /* No difference. */;
10884 else if (DERIVED_FROM_P (base1
, base2
))
10886 else if (DERIVED_FROM_P (base2
, base1
))
10889 if (int diff
= used2
- used1
)
10891 for (i
= 0; i
< len
; ++i
)
10893 conversion
*t1
= cand1
->convs
[i
+ off1
];
10894 conversion
*t2
= cand2
->convs
[i
+ off2
];
10895 if (!same_type_p (t1
->type
, t2
->type
))
10903 /* Check whether we can discard a builtin candidate, either because we
10904 have two identical ones or matching builtin and non-builtin candidates.
10906 (Pedantically in the latter case the builtin which matched the user
10907 function should not be added to the overload set, but we spot it here.
10910 ... the builtin candidates include ...
10911 - do not have the same parameter type list as any non-template
10912 non-member candidate. */
10914 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
10916 for (i
= 0; i
< len
; ++i
)
10917 if (!same_type_p (cand1
->convs
[i
]->type
,
10918 cand2
->convs
[i
]->type
))
10920 if (i
== cand1
->num_convs
)
10922 if (cand1
->fn
== cand2
->fn
)
10923 /* Two built-in candidates; arbitrarily pick one. */
10925 else if (identifier_p (cand1
->fn
))
10926 /* cand1 is built-in; prefer cand2. */
10929 /* cand2 is built-in; prefer cand1. */
10934 /* For candidates of a multi-versioned function, make the version with
10935 the highest priority win. This version will be checked for dispatching
10936 first. If this version can be inlined into the caller, the front-end
10937 will simply make a direct call to this function. */
10939 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10940 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
10941 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10942 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
10944 tree f1
= TREE_TYPE (cand1
->fn
);
10945 tree f2
= TREE_TYPE (cand2
->fn
);
10946 tree p1
= TYPE_ARG_TYPES (f1
);
10947 tree p2
= TYPE_ARG_TYPES (f2
);
10949 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10950 is possible that cand1->fn and cand2->fn are function versions but of
10951 different functions. Check types to see if they are versions of the same
10953 if (compparms (p1
, p2
)
10954 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
10956 /* Always make the version with the higher priority, more
10957 specialized, win. */
10958 gcc_assert (targetm
.compare_version_priority
);
10959 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
10966 /* If the two function declarations represent the same function (this can
10967 happen with declarations in multiple scopes and arg-dependent lookup),
10968 arbitrarily choose one. But first make sure the default args we're
10970 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
10971 && equal_functions (cand1
->fn
, cand2
->fn
))
10973 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
10974 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
10976 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
10978 for (i
= 0; i
< len
; ++i
)
10980 /* Don't crash if the fn is variadic. */
10983 parms1
= TREE_CHAIN (parms1
);
10984 parms2
= TREE_CHAIN (parms2
);
10988 parms1
= TREE_CHAIN (parms1
);
10990 parms2
= TREE_CHAIN (parms2
);
10992 for (; parms1
; ++i
)
10994 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
10995 TREE_PURPOSE (parms2
)))
10999 if (complain
& tf_error
)
11001 auto_diagnostic_group d
;
11002 if (permerror (input_location
,
11003 "default argument mismatch in "
11004 "overload resolution"))
11006 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
11007 " candidate 1: %q#F", cand1
->fn
);
11008 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
11009 " candidate 2: %q#F", cand2
->fn
);
11016 add_warning (cand1
, cand2
);
11019 parms1
= TREE_CHAIN (parms1
);
11020 parms2
= TREE_CHAIN (parms2
);
11028 /* Extension: If the worst conversion for one candidate is better than the
11029 worst conversion for the other, take the first. */
11030 if (!pedantic
&& (complain
& tf_warning_or_error
))
11032 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
11033 struct z_candidate
*w
= 0, *l
= 0;
11035 for (i
= 0; i
< len
; ++i
)
11037 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
11038 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
11039 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
11040 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
11043 winner
= 1, w
= cand1
, l
= cand2
;
11045 winner
= -1, w
= cand2
, l
= cand1
;
11048 /* Don't choose a deleted function over ambiguity. */
11049 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
11053 auto_diagnostic_group d
;
11054 if (pedwarn (input_location
, 0,
11055 "ISO C++ says that these are ambiguous, even "
11056 "though the worst conversion for the first is "
11057 "better than the worst conversion for the second:"))
11059 print_z_candidate (input_location
, _("candidate 1:"), w
);
11060 print_z_candidate (input_location
, _("candidate 2:"), l
);
11064 add_warning (w
, l
);
11069 gcc_assert (!winner
);
11073 /* Given a list of candidates for overloading, find the best one, if any.
11074 This algorithm has a worst case of O(2n) (winner is last), and a best
11075 case of O(n/2) (totally ambiguous); much better than a sorting
11078 static struct z_candidate
*
11079 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
11081 struct z_candidate
*champ
= candidates
, *challenger
;
11083 int champ_compared_to_predecessor
= 0;
11085 /* Walk through the list once, comparing each current champ to the next
11086 candidate, knocking out a candidate or two with each comparison. */
11088 for (challenger
= champ
->next
; challenger
; )
11090 fate
= joust (champ
, challenger
, 0, complain
);
11092 challenger
= challenger
->next
;
11097 champ
= challenger
->next
;
11100 champ_compared_to_predecessor
= 0;
11104 champ
= challenger
;
11105 champ_compared_to_predecessor
= 1;
11108 challenger
= champ
->next
;
11112 /* Make sure the champ is better than all the candidates it hasn't yet
11113 been compared to. */
11115 for (challenger
= candidates
;
11116 challenger
!= champ
11117 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
11118 challenger
= challenger
->next
)
11120 fate
= joust (champ
, challenger
, 0, complain
);
11128 /* Returns nonzero if things of type FROM can be converted to TO. */
11131 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
11133 tree arg
= NULL_TREE
;
11134 /* implicit_conversion only considers user-defined conversions
11135 if it has an expression for the call argument list. */
11136 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
11137 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
11138 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
11141 /* Returns nonzero if things of type FROM can be converted to TO with a
11142 standard conversion. */
11145 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
11147 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
11150 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
11153 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
11154 tsubst_flags_t complain
)
11160 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11161 p
= conversion_obstack_alloc (0);
11162 /* We want to discard any access checks done for this test,
11163 as we might not be in the appropriate access context and
11164 we'll do the check again when we actually perform the
11166 push_deferring_access_checks (dk_deferred
);
11168 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
11170 ok_p
= (t
&& !t
->bad_p
);
11172 /* Discard the access checks now. */
11173 pop_deferring_access_checks ();
11174 /* Free all the conversions we allocated. */
11175 obstack_free (&conversion_obstack
, p
);
11180 /* Like can_convert_arg, but allows dubious conversions as well. */
11183 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
11184 tsubst_flags_t complain
)
11189 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11190 p
= conversion_obstack_alloc (0);
11191 /* Try to perform the conversion. */
11192 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
11194 /* Free all the conversions we allocated. */
11195 obstack_free (&conversion_obstack
, p
);
11200 /* Convert EXPR to TYPE. Return the converted expression.
11202 Note that we allow bad conversions here because by the time we get to
11203 this point we are committed to doing the conversion. If we end up
11204 doing a bad conversion, convert_like will complain. */
11207 perform_implicit_conversion_flags (tree type
, tree expr
,
11208 tsubst_flags_t complain
, int flags
)
11212 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
11214 if (TYPE_REF_P (type
))
11215 expr
= mark_lvalue_use (expr
);
11217 expr
= mark_rvalue_use (expr
);
11219 if (error_operand_p (expr
))
11220 return error_mark_node
;
11222 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11223 p
= conversion_obstack_alloc (0);
11225 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
11226 /*c_cast_p=*/false,
11231 if (complain
& tf_error
)
11233 /* If expr has unknown type, then it is an overloaded function.
11234 Call instantiate_type to get good error messages. */
11235 if (TREE_TYPE (expr
) == unknown_type_node
)
11236 instantiate_type (type
, expr
, complain
);
11237 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
11238 /* We gave an error. */;
11241 range_label_for_type_mismatch
label (TREE_TYPE (expr
), type
);
11242 gcc_rich_location
rich_loc (loc
, &label
);
11243 error_at (&rich_loc
, "could not convert %qE from %qH to %qI",
11244 expr
, TREE_TYPE (expr
), type
);
11247 expr
= error_mark_node
;
11249 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
11251 /* In a template, we are only concerned about determining the
11252 type of non-dependent expressions, so we do not have to
11253 perform the actual conversion. But for initializers, we
11254 need to be able to perform it at instantiation
11255 (or instantiate_non_dependent_expr) time. */
11256 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
11257 if (!(flags
& LOOKUP_ONLYCONVERTING
))
11258 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
11259 if (flags
& LOOKUP_NO_NARROWING
)
11260 IMPLICIT_CONV_EXPR_BRACED_INIT (expr
) = true;
11263 expr
= convert_like (conv
, expr
, complain
);
11265 /* Free all the conversions we allocated. */
11266 obstack_free (&conversion_obstack
, p
);
11272 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
11274 return perform_implicit_conversion_flags (type
, expr
, complain
,
11278 /* Convert EXPR to TYPE (as a direct-initialization) if that is
11279 permitted. If the conversion is valid, the converted expression is
11280 returned. Otherwise, NULL_TREE is returned, except in the case
11281 that TYPE is a class type; in that case, an error is issued. If
11282 C_CAST_P is true, then this direct-initialization is taking
11283 place as part of a static_cast being attempted as part of a C-style
11287 perform_direct_initialization_if_possible (tree type
,
11290 tsubst_flags_t complain
)
11295 if (type
== error_mark_node
|| error_operand_p (expr
))
11296 return error_mark_node
;
11299 If the destination type is a (possibly cv-qualified) class type:
11301 -- If the initialization is direct-initialization ...,
11302 constructors are considered. ... If no constructor applies, or
11303 the overload resolution is ambiguous, the initialization is
11305 if (CLASS_TYPE_P (type
))
11307 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
11308 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
11309 &args
, type
, LOOKUP_NORMAL
, complain
);
11310 release_tree_vector (args
);
11311 return build_cplus_new (type
, expr
, complain
);
11314 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11315 p
= conversion_obstack_alloc (0);
11317 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
11319 LOOKUP_NORMAL
, complain
);
11320 if (!conv
|| conv
->bad_p
)
11322 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
11324 /* In a template, we are only concerned about determining the
11325 type of non-dependent expressions, so we do not have to
11326 perform the actual conversion. But for initializers, we
11327 need to be able to perform it at instantiation
11328 (or instantiate_non_dependent_expr) time. */
11329 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
11330 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
11333 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0,
11334 /*issue_conversion_warnings=*/false,
11338 /* Free all the conversions we allocated. */
11339 obstack_free (&conversion_obstack
, p
);
11344 /* When initializing a reference that lasts longer than a full-expression,
11345 this special rule applies:
11349 The temporary to which the reference is bound or the temporary
11350 that is the complete object to which the reference is bound
11351 persists for the lifetime of the reference.
11353 The temporaries created during the evaluation of the expression
11354 initializing the reference, except the temporary to which the
11355 reference is bound, are destroyed at the end of the
11356 full-expression in which they are created.
11358 In that case, we store the converted expression into a new
11359 VAR_DECL in a new scope.
11361 However, we want to be careful not to create temporaries when
11362 they are not required. For example, given:
11365 struct D : public B {};
11369 there is no need to copy the return value from "f"; we can just
11370 extend its lifetime. Similarly, given:
11373 struct T { operator S(); };
11377 we can extend the lifetime of the return value of the conversion
11380 The next several functions are involved in this lifetime extension. */
11382 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
11383 reference is being bound to a temporary. Create and return a new
11384 VAR_DECL with the indicated TYPE; this variable will store the value to
11385 which the reference is bound. */
11388 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
11390 tree var
= create_temporary_var (type
);
11392 /* Register the variable. */
11394 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
11396 /* Namespace-scope or local static; give it a mangled name. */
11398 /* If an initializer is visible to multiple translation units, those
11399 translation units must agree on the addresses of the
11400 temporaries. Therefore the temporaries must be given a consistent name
11401 and vague linkage. The mangled name of a temporary is the name of the
11402 non-temporary object in whose initializer they appear, prefixed with
11403 GR and suffixed with a sequence number mangled using the usual rules
11404 for a seq-id. Temporaries are numbered with a pre-order, depth-first,
11405 left-to-right walk of the complete initializer. */
11407 TREE_STATIC (var
) = TREE_STATIC (decl
);
11408 TREE_PUBLIC (var
) = TREE_PUBLIC (decl
);
11409 if (vague_linkage_p (decl
))
11410 comdat_linkage (var
);
11412 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
11413 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
11415 tree name
= mangle_ref_init_variable (decl
);
11416 DECL_NAME (var
) = name
;
11417 SET_DECL_ASSEMBLER_NAME (var
, name
);
11420 /* Create a new cleanup level if necessary. */
11421 maybe_push_cleanup_level (type
);
11423 return pushdecl (var
);
11426 /* EXPR is the initializer for a variable DECL of reference or
11427 std::initializer_list type. Create, push and return a new VAR_DECL
11428 for the initializer so that it will live as long as DECL. Any
11429 cleanup for the new variable is returned through CLEANUP, and the
11430 code to initialize the new variable is returned through INITP. */
11433 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
11440 /* Create the temporary variable. */
11441 type
= TREE_TYPE (expr
);
11442 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
11443 layout_decl (var
, 0);
11444 /* If the rvalue is the result of a function call it will be
11445 a TARGET_EXPR. If it is some other construct (such as a
11446 member access expression where the underlying object is
11447 itself the result of a function call), turn it into a
11448 TARGET_EXPR here. It is important that EXPR be a
11449 TARGET_EXPR below since otherwise the INIT_EXPR will
11450 attempt to make a bitwise copy of EXPR to initialize
11452 if (TREE_CODE (expr
) != TARGET_EXPR
)
11453 expr
= get_target_expr (expr
);
11455 if (TREE_CODE (decl
) == FIELD_DECL
11456 && extra_warnings
&& !TREE_NO_WARNING (decl
))
11458 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
11459 "until the constructor exits", decl
);
11460 TREE_NO_WARNING (decl
) = true;
11463 /* Recursively extend temps in this initializer. */
11464 TARGET_EXPR_INITIAL (expr
)
11465 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
11467 /* Any reference temp has a non-trivial initializer. */
11468 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
11470 /* If the initializer is constant, put it in DECL_INITIAL so we get
11471 static initialization and use in constant expressions. */
11472 init
= maybe_constant_init (expr
);
11473 /* As in store_init_value. */
11474 init
= cp_fully_fold (init
);
11475 if (TREE_CONSTANT (init
))
11477 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
11479 /* 5.19 says that a constant expression can include an
11480 lvalue-rvalue conversion applied to "a glvalue of literal type
11481 that refers to a non-volatile temporary object initialized
11482 with a constant expression". Rather than try to communicate
11483 that this VAR_DECL is a temporary, just mark it constexpr. */
11484 DECL_DECLARED_CONSTEXPR_P (var
) = true;
11485 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
11486 TREE_CONSTANT (var
) = true;
11487 TREE_READONLY (var
) = true;
11489 DECL_INITIAL (var
) = init
;
11493 /* Create the INIT_EXPR that will initialize the temporary
11495 init
= split_nonconstant_init (var
, expr
);
11496 if (at_function_scope_p ())
11498 add_decl_expr (var
);
11500 if (TREE_STATIC (var
))
11501 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
11504 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11506 vec_safe_push (*cleanups
, cleanup
);
11509 /* We must be careful to destroy the temporary only
11510 after its initialization has taken place. If the
11511 initialization throws an exception, then the
11512 destructor should not be run. We cannot simply
11513 transform INIT into something like:
11515 (INIT, ({ CLEANUP_STMT; }))
11517 because emit_local_var always treats the
11518 initializer as a full-expression. Thus, the
11519 destructor would run too early; it would run at the
11520 end of initializing the reference variable, rather
11521 than at the end of the block enclosing the
11522 reference variable.
11524 The solution is to pass back a cleanup expression
11525 which the caller is responsible for attaching to
11526 the statement tree. */
11530 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
11531 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
11533 if (CP_DECL_THREAD_LOCAL_P (var
))
11534 tls_aggregates
= tree_cons (NULL_TREE
, var
,
11537 static_aggregates
= tree_cons (NULL_TREE
, var
,
11538 static_aggregates
);
11541 /* Check whether the dtor is callable. */
11542 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11544 /* Avoid -Wunused-variable warning (c++/38958). */
11545 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
11547 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
11553 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
11554 initializing a variable of that TYPE. */
11557 initialize_reference (tree type
, tree expr
,
11558 int flags
, tsubst_flags_t complain
)
11562 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
11564 if (type
== error_mark_node
|| error_operand_p (expr
))
11565 return error_mark_node
;
11567 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11568 p
= conversion_obstack_alloc (0);
11570 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
11572 if (!conv
|| conv
->bad_p
)
11574 if (complain
& tf_error
)
11577 convert_like (conv
, expr
, complain
);
11578 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
11579 && !TYPE_REF_IS_RVALUE (type
)
11580 && !lvalue_p (expr
))
11581 error_at (loc
, "invalid initialization of non-const reference of "
11582 "type %qH from an rvalue of type %qI",
11583 type
, TREE_TYPE (expr
));
11585 error_at (loc
, "invalid initialization of reference of type "
11586 "%qH from expression of type %qI", type
,
11589 return error_mark_node
;
11592 if (conv
->kind
== ck_ref_bind
)
11593 /* Perform the conversion. */
11594 expr
= convert_like (conv
, expr
, complain
);
11595 else if (conv
->kind
== ck_ambig
)
11596 /* We gave an error in build_user_type_conversion_1. */
11597 expr
= error_mark_node
;
11599 gcc_unreachable ();
11601 /* Free all the conversions we allocated. */
11602 obstack_free (&conversion_obstack
, p
);
11607 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
11608 which is bound either to a reference or a std::initializer_list. */
11611 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
11616 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
11618 TREE_OPERAND (sub
, 1)
11619 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
11622 if (TREE_CODE (sub
) != ADDR_EXPR
)
11624 /* Deal with binding to a subobject. */
11625 for (p
= &TREE_OPERAND (sub
, 0);
11626 (TREE_CODE (*p
) == COMPONENT_REF
11627 || TREE_CODE (*p
) == ARRAY_REF
); )
11628 p
= &TREE_OPERAND (*p
, 0);
11629 if (TREE_CODE (*p
) == TARGET_EXPR
)
11631 tree subinit
= NULL_TREE
;
11632 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
11633 recompute_tree_invariant_for_addr_expr (sub
);
11635 init
= fold_convert (TREE_TYPE (init
), sub
);
11637 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
11642 /* INIT is part of the initializer for DECL. If there are any
11643 reference or initializer lists being initialized, extend their
11644 lifetime to match that of DECL. */
11647 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
11649 tree type
= TREE_TYPE (init
);
11650 if (processing_template_decl
)
11652 if (TYPE_REF_P (type
))
11653 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
11657 if (TREE_CODE (ctor
) == TARGET_EXPR
)
11658 ctor
= TARGET_EXPR_INITIAL (ctor
);
11659 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
11661 if (is_std_init_list (type
))
11663 /* The temporary array underlying a std::initializer_list
11664 is handled like a reference temporary. */
11665 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
11666 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
11667 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
11672 constructor_elt
*p
;
11673 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (ctor
);
11674 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
11675 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
11677 recompute_constructor_flags (ctor
);
11678 if (decl_maybe_constant_var_p (decl
) && TREE_CONSTANT (ctor
))
11679 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
11686 /* Returns true iff an initializer for TYPE could contain temporaries that
11687 need to be extended because they are bound to references or
11688 std::initializer_list. */
11691 type_has_extended_temps (tree type
)
11693 type
= strip_array_types (type
);
11694 if (TYPE_REF_P (type
))
11696 if (CLASS_TYPE_P (type
))
11698 if (is_std_init_list (type
))
11700 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
11701 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
11702 if (type_has_extended_temps (TREE_TYPE (f
)))
11708 /* Returns true iff TYPE is some variant of std::initializer_list. */
11711 is_std_init_list (tree type
)
11713 if (!TYPE_P (type
))
11715 if (cxx_dialect
== cxx98
)
11717 /* Look through typedefs. */
11718 type
= TYPE_MAIN_VARIANT (type
);
11719 return (CLASS_TYPE_P (type
)
11720 && CP_TYPE_CONTEXT (type
) == std_node
11721 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
)));
11724 /* Returns true iff DECL is a list constructor: i.e. a constructor which
11725 will accept an argument list of a single std::initializer_list<T>. */
11728 is_list_ctor (tree decl
)
11730 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11733 if (!args
|| args
== void_list_node
)
11736 arg
= non_reference (TREE_VALUE (args
));
11737 if (!is_std_init_list (arg
))
11740 args
= TREE_CHAIN (args
);
11742 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
11743 /* There are more non-defaulted parms. */
11749 #include "gt-cp-call.h"