1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2020 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 or ck_base, 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 /* True if this conversion is taking place in a copy-initialization context
115 and we should only consider converting constructors. Only set in
116 ck_base and ck_rvalue. */
117 BOOL_BITFIELD copy_init_p
: 1;
118 /* The type of the expression resulting from the conversion. */
121 /* The next conversion in the chain. Since the conversions are
122 arranged from outermost to innermost, the NEXT conversion will
123 actually be performed before this conversion. This variant is
124 used only when KIND is neither ck_identity, ck_aggr, ck_ambig nor
125 ck_list. Please use the next_conversion function instead
126 of using this field directly. */
128 /* The expression at the beginning of the conversion chain. This
129 variant is used only if KIND is ck_identity, ck_aggr, or ck_ambig.
130 You can use conv_get_original_expr to get this expression. */
132 /* The array of conversions for an initializer_list, so this
133 variant is used only when KIN D is ck_list. */
136 /* The function candidate corresponding to this conversion
137 sequence. This field is only used if KIND is ck_user. */
138 struct z_candidate
*cand
;
141 #define CONVERSION_RANK(NODE) \
142 ((NODE)->bad_p ? cr_bad \
143 : (NODE)->ellipsis_p ? cr_ellipsis \
144 : (NODE)->user_conv_p ? cr_user \
147 #define BAD_CONVERSION_RANK(NODE) \
148 ((NODE)->ellipsis_p ? cr_ellipsis \
149 : (NODE)->user_conv_p ? cr_user \
152 static struct obstack conversion_obstack
;
153 static bool conversion_obstack_initialized
;
154 struct rejection_reason
;
156 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
157 static int equal_functions (tree
, tree
);
158 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
160 static int compare_ics (conversion
*, conversion
*);
161 static void maybe_warn_class_memaccess (location_t
, tree
,
162 const vec
<tree
, va_gc
> *);
163 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
164 #define convert_like(CONV, EXPR, COMPLAIN) \
165 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
166 /*issue_conversion_warnings=*/true, \
167 /*c_cast_p=*/false, (COMPLAIN))
168 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
169 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
170 /*issue_conversion_warnings=*/true, \
171 /*c_cast_p=*/false, (COMPLAIN))
172 static tree
convert_like_real (conversion
*, tree
, tree
, int, bool,
173 bool, tsubst_flags_t
);
174 static void op_error (const op_location_t
&, enum tree_code
, enum tree_code
,
175 tree
, tree
, tree
, bool);
176 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
178 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
179 static void print_z_candidates (location_t
, struct z_candidate
*);
180 static tree
build_this (tree
);
181 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
182 static bool any_strictly_viable (struct z_candidate
*);
183 static struct z_candidate
*add_template_candidate
184 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
185 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
186 static struct z_candidate
*add_template_candidate_real
187 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
188 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
189 static bool is_complete (tree
);
190 static struct z_candidate
*add_conv_candidate
191 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
192 tree
, tsubst_flags_t
);
193 static struct z_candidate
*add_function_candidate
194 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
195 tree
, int, conversion
**, tsubst_flags_t
);
196 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
198 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
200 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
201 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
202 static conversion
*next_conversion (conversion
*);
203 static bool is_subseq (conversion
*, conversion
*);
204 static conversion
*maybe_handle_ref_bind (conversion
**);
205 static void maybe_handle_implicit_object (conversion
**);
206 static struct z_candidate
*add_candidate
207 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
208 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
209 static tree
source_type (conversion
*);
210 static void add_warning (struct z_candidate
*, struct z_candidate
*);
211 static conversion
*direct_reference_binding (tree
, conversion
*);
212 static bool promoted_arithmetic_type_p (tree
);
213 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
214 static char *name_as_c_string (tree
, tree
, bool *);
215 static tree
prep_operand (tree
);
216 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
217 bool, tree
, tree
, int, struct z_candidate
**,
219 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
220 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
221 static conversion
*build_identity_conv (tree
, tree
);
222 static inline bool conv_binds_to_array_of_unknown_bound (conversion
*);
223 static tree
prevent_lifetime_extension (tree
);
225 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
226 NAME can take many forms... */
229 check_dtor_name (tree basetype
, tree name
)
231 /* Just accept something we've already complained about. */
232 if (name
== error_mark_node
)
235 if (TREE_CODE (name
) == TYPE_DECL
)
236 name
= TREE_TYPE (name
);
237 else if (TYPE_P (name
))
239 else if (identifier_p (name
))
241 if ((MAYBE_CLASS_TYPE_P (basetype
)
242 || TREE_CODE (basetype
) == ENUMERAL_TYPE
)
243 && name
== constructor_name (basetype
))
246 name
= get_type_value (name
);
252 template <class T> struct S { ~S(); };
256 NAME will be a class template. */
257 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
261 if (!name
|| name
== error_mark_node
)
263 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
266 /* We want the address of a function or method. We avoid creating a
267 pointer-to-member function. */
270 build_addr_func (tree function
, tsubst_flags_t complain
)
272 tree type
= TREE_TYPE (function
);
274 /* We have to do these by hand to avoid real pointer to member
276 if (TREE_CODE (type
) == METHOD_TYPE
)
278 if (TREE_CODE (function
) == OFFSET_REF
)
280 tree object
= build_address (TREE_OPERAND (function
, 0));
281 return get_member_function_from_ptrfunc (&object
,
282 TREE_OPERAND (function
, 1),
285 function
= build_address (function
);
287 else if (TREE_CODE (function
) == FUNCTION_DECL
288 && DECL_IMMEDIATE_FUNCTION_P (function
))
289 function
= build_address (function
);
291 function
= decay_conversion (function
, complain
, /*reject_builtin=*/false);
296 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
297 POINTER_TYPE to those. Note, pointer to member function types
298 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
299 two variants. build_call_a is the primitive taking an array of
300 arguments, while build_call_n is a wrapper that handles varargs. */
303 build_call_n (tree function
, int n
, ...)
306 return build_call_a (function
, 0, NULL
);
309 tree
*argarray
= XALLOCAVEC (tree
, n
);
314 for (i
= 0; i
< n
; i
++)
315 argarray
[i
] = va_arg (ap
, tree
);
317 return build_call_a (function
, n
, argarray
);
321 /* Update various flags in cfun and the call itself based on what is being
322 called. Split out of build_call_a so that bot_manip can use it too. */
325 set_flags_from_callee (tree call
)
327 /* Handle both CALL_EXPRs and AGGR_INIT_EXPRs. */
328 tree decl
= cp_get_callee_fndecl_nofold (call
);
330 /* We check both the decl and the type; a function may be known not to
331 throw without being declared throw(). */
332 bool nothrow
= decl
&& TREE_NOTHROW (decl
);
333 tree callee
= cp_get_callee (call
);
335 nothrow
|= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (callee
)));
336 else if (TREE_CODE (call
) == CALL_EXPR
337 && internal_fn_flags (CALL_EXPR_IFN (call
)) & ECF_NOTHROW
)
340 if (cfun
&& cp_function_chain
&& !cp_unevaluated_operand
)
342 if (!nothrow
&& at_function_scope_p ())
343 cp_function_chain
->can_throw
= 1;
345 if (decl
&& TREE_THIS_VOLATILE (decl
))
346 current_function_returns_abnormally
= 1;
349 TREE_NOTHROW (call
) = nothrow
;
353 build_call_a (tree function
, int n
, tree
*argarray
)
360 function
= build_addr_func (function
, tf_warning_or_error
);
362 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
363 fntype
= TREE_TYPE (TREE_TYPE (function
));
364 gcc_assert (FUNC_OR_METHOD_TYPE_P (fntype
));
365 result_type
= TREE_TYPE (fntype
);
366 /* An rvalue has no cv-qualifiers. */
367 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
368 result_type
= cv_unqualified (result_type
);
370 function
= build_call_array_loc (input_location
,
371 result_type
, function
, n
, argarray
);
372 set_flags_from_callee (function
);
374 decl
= get_callee_fndecl (function
);
376 if (decl
&& !TREE_USED (decl
))
378 /* We invoke build_call directly for several library
379 functions. These may have been declared normally if
380 we're building libgcc, so we can't just check
382 gcc_assert (DECL_ARTIFICIAL (decl
)
383 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
388 require_complete_eh_spec_types (fntype
, decl
);
390 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
392 /* Don't pass empty class objects by value. This is useful
393 for tags in STL, which are used to control overload resolution.
394 We don't need to handle other cases of copying empty classes. */
395 if (!decl
|| !fndecl_built_in_p (decl
))
396 for (i
= 0; i
< n
; i
++)
398 tree arg
= CALL_EXPR_ARG (function
, i
);
399 if (is_empty_class (TREE_TYPE (arg
))
400 && simple_empty_class_p (TREE_TYPE (arg
), arg
, INIT_EXPR
))
402 while (TREE_CODE (arg
) == TARGET_EXPR
)
403 /* We're disconnecting the initializer from its target,
404 don't create a temporary. */
405 arg
= TARGET_EXPR_INITIAL (arg
);
406 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
407 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
408 CALL_EXPR_ARG (function
, i
) = arg
;
415 /* New overloading code. */
419 struct candidate_warning
{
421 candidate_warning
*next
;
424 /* Information for providing diagnostics about why overloading failed. */
426 enum rejection_reason_code
{
429 rr_explicit_conversion
,
430 rr_template_conversion
,
432 rr_bad_arg_conversion
,
433 rr_template_unification
,
436 rr_constraint_failure
439 struct conversion_info
{
440 /* The index of the argument, 0-based. */
442 /* The actual argument or its type. */
444 /* The type of the parameter. */
446 /* The location of the argument. */
450 struct rejection_reason
{
451 enum rejection_reason_code code
;
453 /* Information about an arity mismatch. */
455 /* The expected number of arguments. */
457 /* The actual number of arguments in the call. */
459 /* Whether the call was a varargs call. */
462 /* Information about an argument conversion mismatch. */
463 struct conversion_info conversion
;
464 /* Same, but for bad argument conversions. */
465 struct conversion_info bad_conversion
;
466 /* Information about template unification failures. These are the
467 parameters passed to fn_type_unification. */
475 unification_kind_t strict
;
477 } template_unification
;
478 /* Information about template instantiation failures. These are the
479 parameters passed to instantiate_template. */
483 } template_instantiation
;
488 /* The FUNCTION_DECL that will be called if this candidate is
489 selected by overload resolution. */
491 /* If not NULL_TREE, the first argument to use when calling this
494 /* The rest of the arguments to use when calling this function. If
495 there are no further arguments this may be NULL or it may be an
497 const vec
<tree
, va_gc
> *args
;
498 /* The implicit conversion sequences for each of the arguments to
501 /* The number of implicit conversion sequences. */
503 /* If FN is a user-defined conversion, the standard conversion
504 sequence from the type returned by FN to the desired destination
506 conversion
*second_conv
;
507 struct rejection_reason
*reason
;
508 /* If FN is a member function, the binfo indicating the path used to
509 qualify the name of FN at the call site. This path is used to
510 determine whether or not FN is accessible if it is selected by
511 overload resolution. The DECL_CONTEXT of FN will always be a
512 (possibly improper) base of this binfo. */
514 /* If FN is a non-static member function, the binfo indicating the
515 subobject to which the `this' pointer should be converted if FN
516 is selected by overload resolution. The type pointed to by
517 the `this' pointer must correspond to the most derived class
518 indicated by the CONVERSION_PATH. */
519 tree conversion_path
;
522 candidate_warning
*warnings
;
526 /* The flags active in add_candidate. */
529 bool rewritten () { return (flags
& LOOKUP_REWRITTEN
); }
530 bool reversed () { return (flags
& LOOKUP_REVERSED
); }
533 /* Returns true iff T is a null pointer constant in the sense of
537 null_ptr_cst_p (tree t
)
539 tree type
= TREE_TYPE (t
);
543 A null pointer constant is an integer literal ([lex.icon]) with value
544 zero or a prvalue of type std::nullptr_t. */
545 if (NULLPTR_TYPE_P (type
))
548 if (cxx_dialect
>= cxx11
)
550 STRIP_ANY_LOCATION_WRAPPER (t
);
552 /* Core issue 903 says only literal 0 is a null pointer constant. */
553 if (TREE_CODE (t
) == INTEGER_CST
554 && !TREE_OVERFLOW (t
)
555 && TREE_CODE (type
) == INTEGER_TYPE
557 && !char_type_p (type
))
560 else if (CP_INTEGRAL_TYPE_P (type
))
562 t
= fold_non_dependent_expr (t
, tf_none
);
564 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
571 /* Returns true iff T is a null member pointer value (4.11). */
574 null_member_pointer_value_p (tree t
)
576 tree type
= TREE_TYPE (t
);
579 else if (TYPE_PTRMEMFUNC_P (type
))
580 return (TREE_CODE (t
) == CONSTRUCTOR
581 && CONSTRUCTOR_NELTS (t
)
582 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
583 else if (TYPE_PTRDATAMEM_P (type
))
584 return integer_all_onesp (t
);
589 /* Returns nonzero if PARMLIST consists of only default parms,
590 ellipsis, and/or undeduced parameter packs. */
593 sufficient_parms_p (const_tree parmlist
)
595 for (; parmlist
&& parmlist
!= void_list_node
;
596 parmlist
= TREE_CHAIN (parmlist
))
597 if (!TREE_PURPOSE (parmlist
)
598 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
603 /* Allocate N bytes of memory from the conversion obstack. The memory
604 is zeroed before being returned. */
607 conversion_obstack_alloc (size_t n
)
610 if (!conversion_obstack_initialized
)
612 gcc_obstack_init (&conversion_obstack
);
613 conversion_obstack_initialized
= true;
615 p
= obstack_alloc (&conversion_obstack
, n
);
620 /* Allocate rejection reasons. */
622 static struct rejection_reason
*
623 alloc_rejection (enum rejection_reason_code code
)
625 struct rejection_reason
*p
;
626 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
631 static struct rejection_reason
*
632 arity_rejection (tree first_arg
, int expected
, int actual
)
634 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
635 int adjust
= first_arg
!= NULL_TREE
;
636 r
->u
.arity
.expected
= expected
- adjust
;
637 r
->u
.arity
.actual
= actual
- adjust
;
641 static struct rejection_reason
*
642 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
,
645 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
646 int adjust
= first_arg
!= NULL_TREE
;
647 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
648 r
->u
.conversion
.from
= from
;
649 r
->u
.conversion
.to_type
= to
;
650 r
->u
.conversion
.loc
= loc
;
654 static struct rejection_reason
*
655 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
,
658 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
659 int adjust
= first_arg
!= NULL_TREE
;
660 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
661 r
->u
.bad_conversion
.from
= from
;
662 r
->u
.bad_conversion
.to_type
= to
;
663 r
->u
.bad_conversion
.loc
= loc
;
667 static struct rejection_reason
*
668 explicit_conversion_rejection (tree from
, tree to
)
670 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
671 r
->u
.conversion
.n_arg
= 0;
672 r
->u
.conversion
.from
= from
;
673 r
->u
.conversion
.to_type
= to
;
674 r
->u
.conversion
.loc
= UNKNOWN_LOCATION
;
678 static struct rejection_reason
*
679 template_conversion_rejection (tree from
, tree to
)
681 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
682 r
->u
.conversion
.n_arg
= 0;
683 r
->u
.conversion
.from
= from
;
684 r
->u
.conversion
.to_type
= to
;
685 r
->u
.conversion
.loc
= UNKNOWN_LOCATION
;
689 static struct rejection_reason
*
690 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
691 const tree
*args
, unsigned int nargs
,
692 tree return_type
, unification_kind_t strict
,
695 size_t args_n_bytes
= sizeof (*args
) * nargs
;
696 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
697 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
698 r
->u
.template_unification
.tmpl
= tmpl
;
699 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
700 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
701 /* Copy args to our own storage. */
702 memcpy (args1
, args
, args_n_bytes
);
703 r
->u
.template_unification
.args
= args1
;
704 r
->u
.template_unification
.nargs
= nargs
;
705 r
->u
.template_unification
.return_type
= return_type
;
706 r
->u
.template_unification
.strict
= strict
;
707 r
->u
.template_unification
.flags
= flags
;
711 static struct rejection_reason
*
712 template_unification_error_rejection (void)
714 return alloc_rejection (rr_template_unification
);
717 static struct rejection_reason
*
718 invalid_copy_with_fn_template_rejection (void)
720 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
724 static struct rejection_reason
*
725 inherited_ctor_rejection (void)
727 struct rejection_reason
*r
= alloc_rejection (rr_inherited_ctor
);
731 /* Build a constraint failure record. */
733 static struct rejection_reason
*
734 constraint_failure (void)
736 struct rejection_reason
*r
= alloc_rejection (rr_constraint_failure
);
740 /* Dynamically allocate a conversion. */
743 alloc_conversion (conversion_kind kind
)
746 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
751 /* Make sure that all memory on the conversion obstack has been
755 validate_conversion_obstack (void)
757 if (conversion_obstack_initialized
)
758 gcc_assert ((obstack_next_free (&conversion_obstack
)
759 == obstack_base (&conversion_obstack
)));
762 /* Dynamically allocate an array of N conversions. */
765 alloc_conversions (size_t n
)
767 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
771 build_conv (conversion_kind code
, tree type
, conversion
*from
)
774 conversion_rank rank
= CONVERSION_RANK (from
);
776 /* Note that the caller is responsible for filling in t->cand for
777 user-defined conversions. */
778 t
= alloc_conversion (code
);
802 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
803 t
->bad_p
= from
->bad_p
;
808 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
809 specialization of std::initializer_list<T>, if such a conversion is
813 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
815 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
816 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
817 conversion
**subconvs
= alloc_conversions (len
);
822 /* Within a list-initialization we can have more user-defined
824 flags
&= ~LOOKUP_NO_CONVERSION
;
825 /* But no narrowing conversions. */
826 flags
|= LOOKUP_NO_NARROWING
;
828 /* Can't make an array of these types. */
829 if (TYPE_REF_P (elttype
)
830 || TREE_CODE (elttype
) == FUNCTION_TYPE
831 || VOID_TYPE_P (elttype
))
834 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
837 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
838 false, flags
, complain
);
845 t
= alloc_conversion (ck_list
);
847 t
->u
.list
= subconvs
;
850 for (i
= 0; i
< len
; ++i
)
852 conversion
*sub
= subconvs
[i
];
853 if (sub
->rank
> t
->rank
)
855 if (sub
->user_conv_p
)
856 t
->user_conv_p
= true;
864 /* Return the next conversion of the conversion chain (if applicable),
865 or NULL otherwise. Please use this function instead of directly
866 accessing fields of struct conversion. */
869 next_conversion (conversion
*conv
)
872 || conv
->kind
== ck_identity
873 || conv
->kind
== ck_ambig
874 || conv
->kind
== ck_list
875 || conv
->kind
== ck_aggr
)
880 /* Strip to the first ck_user, ck_ambig, ck_list, ck_aggr or ck_identity
884 strip_standard_conversion (conversion
*conv
)
887 && conv
->kind
!= ck_user
888 && conv
->kind
!= ck_ambig
889 && conv
->kind
!= ck_list
890 && conv
->kind
!= ck_aggr
891 && conv
->kind
!= ck_identity
)
892 conv
= next_conversion (conv
);
896 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
897 is a valid aggregate initializer for array type ATYPE. */
900 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
903 tree elttype
= TREE_TYPE (atype
);
904 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
906 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
908 if (TREE_CODE (elttype
) == ARRAY_TYPE
909 && TREE_CODE (val
) == CONSTRUCTOR
)
910 ok
= can_convert_array (elttype
, val
, flags
, complain
);
912 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
920 /* Helper for build_aggr_conv. Return true if FIELD is in PSET, or if
921 FIELD has ANON_AGGR_TYPE_P and any initializable field in there recursively
925 field_in_pset (hash_set
<tree
, true> &pset
, tree field
)
927 if (pset
.contains (field
))
929 if (ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
930 for (field
= TYPE_FIELDS (TREE_TYPE (field
));
931 field
; field
= DECL_CHAIN (field
))
933 field
= next_initializable_field (field
);
934 if (field
== NULL_TREE
)
936 if (field_in_pset (pset
, field
))
942 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
943 aggregate class, if such a conversion is possible. */
946 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
948 unsigned HOST_WIDE_INT i
= 0;
950 tree field
= next_initializable_field (TYPE_FIELDS (type
));
951 tree empty_ctor
= NULL_TREE
;
952 hash_set
<tree
, true> pset
;
954 /* We already called reshape_init in implicit_conversion. */
956 /* The conversions within the init-list aren't affected by the enclosing
957 context; they're always simple copy-initialization. */
958 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
960 /* For designated initializers, verify that each initializer is convertible
961 to corresponding TREE_TYPE (ce->index) and mark those FIELD_DECLs as
962 visited. In the following loop then ignore already visited
964 if (CONSTRUCTOR_IS_DESIGNATED_INIT (ctor
))
967 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), i
, idx
, val
)
969 if (idx
&& TREE_CODE (idx
) == FIELD_DECL
)
971 tree ftype
= TREE_TYPE (idx
);
974 if (TREE_CODE (ftype
) == ARRAY_TYPE
975 && TREE_CODE (val
) == CONSTRUCTOR
)
976 ok
= can_convert_array (ftype
, val
, flags
, complain
);
978 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
983 /* For unions, there should be just one initializer. */
984 if (TREE_CODE (type
) == UNION_TYPE
)
997 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
999 tree ftype
= TREE_TYPE (field
);
1003 if (!pset
.is_empty () && field_in_pset (pset
, field
))
1005 if (i
< CONSTRUCTOR_NELTS (ctor
))
1007 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
1010 else if (DECL_INITIAL (field
))
1011 val
= get_nsdmi (field
, /*ctor*/false, complain
);
1012 else if (TYPE_REF_P (ftype
))
1013 /* Value-initialization of reference is ill-formed. */
1017 if (empty_ctor
== NULL_TREE
)
1018 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
1022 if (TREE_CODE (ftype
) == ARRAY_TYPE
1023 && TREE_CODE (val
) == CONSTRUCTOR
)
1024 ok
= can_convert_array (ftype
, val
, flags
, complain
);
1026 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
1032 if (TREE_CODE (type
) == UNION_TYPE
)
1036 if (i
< CONSTRUCTOR_NELTS (ctor
))
1039 c
= alloc_conversion (ck_aggr
);
1042 c
->user_conv_p
= true;
1043 c
->check_narrowing
= true;
1048 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
1049 array type, if such a conversion is possible. */
1052 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
1055 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1056 tree elttype
= TREE_TYPE (type
);
1061 enum conversion_rank rank
= cr_exact
;
1063 /* We might need to propagate the size from the element to the array. */
1064 complete_type (type
);
1066 if (TYPE_DOMAIN (type
)
1067 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
1069 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
1074 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1076 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1079 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1080 false, flags
, complain
);
1084 if (sub
->rank
> rank
)
1086 if (sub
->user_conv_p
)
1092 c
= alloc_conversion (ck_aggr
);
1095 c
->user_conv_p
= user
;
1101 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1102 complex type, if such a conversion is possible. */
1105 build_complex_conv (tree type
, tree ctor
, int flags
,
1106 tsubst_flags_t complain
)
1109 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1110 tree elttype
= TREE_TYPE (type
);
1115 enum conversion_rank rank
= cr_exact
;
1120 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1122 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1125 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1126 false, flags
, complain
);
1130 if (sub
->rank
> rank
)
1132 if (sub
->user_conv_p
)
1138 c
= alloc_conversion (ck_aggr
);
1141 c
->user_conv_p
= user
;
1147 /* Build a representation of the identity conversion from EXPR to
1148 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1151 build_identity_conv (tree type
, tree expr
)
1155 c
= alloc_conversion (ck_identity
);
1162 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1163 were multiple user-defined conversions to accomplish the job.
1164 Build a conversion that indicates that ambiguity. */
1167 build_ambiguous_conv (tree type
, tree expr
)
1171 c
= alloc_conversion (ck_ambig
);
1179 strip_top_quals (tree t
)
1181 if (TREE_CODE (t
) == ARRAY_TYPE
)
1183 return cp_build_qualified_type (t
, 0);
1186 /* Returns the standard conversion path (see [conv]) from type FROM to type
1187 TO, if any. For proper handling of null pointer constants, you must
1188 also pass the expression EXPR to convert from. If C_CAST_P is true,
1189 this conversion is coming from a C-style cast. */
1192 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1193 int flags
, tsubst_flags_t complain
)
1195 enum tree_code fcode
, tcode
;
1197 bool fromref
= false;
1200 to
= non_reference (to
);
1201 if (TYPE_REF_P (from
))
1204 from
= TREE_TYPE (from
);
1207 to
= strip_top_quals (to
);
1208 from
= strip_top_quals (from
);
1210 if (expr
&& type_unknown_p (expr
))
1212 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1214 tsubst_flags_t tflags
= tf_conv
;
1215 expr
= instantiate_type (to
, expr
, tflags
);
1216 if (expr
== error_mark_node
)
1218 from
= TREE_TYPE (expr
);
1220 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1222 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1223 expr
= resolve_nondeduced_context (expr
, complain
);
1224 from
= TREE_TYPE (expr
);
1228 fcode
= TREE_CODE (from
);
1229 tcode
= TREE_CODE (to
);
1231 conv
= build_identity_conv (from
, expr
);
1232 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1234 from
= type_decays_to (from
);
1235 fcode
= TREE_CODE (from
);
1236 /* Tell convert_like_real that we're using the address. */
1237 conv
->rvaluedness_matches_p
= true;
1238 conv
= build_conv (ck_lvalue
, from
, conv
);
1240 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1241 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1242 express the copy constructor call required by copy-initialization. */
1243 else if (fromref
|| (expr
&& obvalue_p (expr
)))
1248 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1251 from
= strip_top_quals (bitfield_type
);
1252 fcode
= TREE_CODE (from
);
1255 conv
= build_conv (ck_rvalue
, from
, conv
);
1256 if (flags
& LOOKUP_PREFER_RVALUE
)
1257 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1258 conv
->rvaluedness_matches_p
= true;
1259 /* If we're performing copy-initialization, remember to skip
1260 explicit constructors. */
1261 if (flags
& LOOKUP_ONLYCONVERTING
)
1262 conv
->copy_init_p
= true;
1265 /* Allow conversion between `__complex__' data types. */
1266 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1268 /* The standard conversion sequence to convert FROM to TO is
1269 the standard conversion sequence to perform componentwise
1271 conversion
*part_conv
= standard_conversion
1272 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
,
1277 conv
= build_conv (part_conv
->kind
, to
, conv
);
1278 conv
->rank
= part_conv
->rank
;
1286 if (same_type_p (from
, to
))
1288 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1289 conv
->type
= qualified_to
;
1294 A null pointer constant can be converted to a pointer type; ... A
1295 null pointer constant of integral type can be converted to an
1296 rvalue of type std::nullptr_t. */
1297 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1298 || NULLPTR_TYPE_P (to
))
1299 && ((expr
&& null_ptr_cst_p (expr
))
1300 || NULLPTR_TYPE_P (from
)))
1301 conv
= build_conv (ck_std
, to
, conv
);
1302 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1303 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1305 /* For backwards brain damage compatibility, allow interconversion of
1306 pointers and integers with a pedwarn. */
1307 conv
= build_conv (ck_std
, to
, conv
);
1310 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1312 /* For backwards brain damage compatibility, allow interconversion of
1313 enums and integers with a pedwarn. */
1314 conv
= build_conv (ck_std
, to
, conv
);
1317 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1318 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1323 if (tcode
== POINTER_TYPE
)
1325 to_pointee
= TREE_TYPE (to
);
1326 from_pointee
= TREE_TYPE (from
);
1328 /* Since this is the target of a pointer, it can't have function
1329 qualifiers, so any TYPE_QUALS must be for attributes const or
1330 noreturn. Strip them. */
1331 if (TREE_CODE (to_pointee
) == FUNCTION_TYPE
1332 && TYPE_QUALS (to_pointee
))
1333 to_pointee
= build_qualified_type (to_pointee
, TYPE_UNQUALIFIED
);
1334 if (TREE_CODE (from_pointee
) == FUNCTION_TYPE
1335 && TYPE_QUALS (from_pointee
))
1336 from_pointee
= build_qualified_type (from_pointee
, TYPE_UNQUALIFIED
);
1340 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1341 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1344 if (tcode
== POINTER_TYPE
1345 && same_type_ignoring_top_level_qualifiers_p (from_pointee
,
1348 else if (VOID_TYPE_P (to_pointee
)
1349 && !TYPE_PTRDATAMEM_P (from
)
1350 && TREE_CODE (from_pointee
) != FUNCTION_TYPE
)
1352 tree nfrom
= TREE_TYPE (from
);
1353 /* Don't try to apply restrict to void. */
1354 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1355 from_pointee
= cp_build_qualified_type (void_type_node
, quals
);
1356 from
= build_pointer_type (from_pointee
);
1357 conv
= build_conv (ck_ptr
, from
, conv
);
1359 else if (TYPE_PTRDATAMEM_P (from
))
1361 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1362 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1364 if (same_type_p (fbase
, tbase
))
1365 /* No base conversion needed. */;
1366 else if (DERIVED_FROM_P (fbase
, tbase
)
1367 && (same_type_ignoring_top_level_qualifiers_p
1368 (from_pointee
, to_pointee
)))
1370 from
= build_ptrmem_type (tbase
, from_pointee
);
1371 conv
= build_conv (ck_pmem
, from
, conv
);
1376 else if (CLASS_TYPE_P (from_pointee
)
1377 && CLASS_TYPE_P (to_pointee
)
1380 An rvalue of type "pointer to cv D," where D is a
1381 class type, can be converted to an rvalue of type
1382 "pointer to cv B," where B is a base class (clause
1383 _class.derived_) of D. If B is an inaccessible
1384 (clause _class.access_) or ambiguous
1385 (_class.member.lookup_) base class of D, a program
1386 that necessitates this conversion is ill-formed.
1387 Therefore, we use DERIVED_FROM_P, and do not check
1388 access or uniqueness. */
1389 && DERIVED_FROM_P (to_pointee
, from_pointee
))
1392 = cp_build_qualified_type (to_pointee
,
1393 cp_type_quals (from_pointee
));
1394 from
= build_pointer_type (from_pointee
);
1395 conv
= build_conv (ck_ptr
, from
, conv
);
1396 conv
->base_p
= true;
1399 if (same_type_p (from
, to
))
1401 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
, bounds_either
))
1402 /* In a C-style cast, we ignore CV-qualification because we
1403 are allowed to perform a static_cast followed by a
1405 conv
= build_conv (ck_qual
, to
, conv
);
1406 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1407 conv
= build_conv (ck_qual
, to
, conv
);
1408 else if (expr
&& string_conv_p (to
, expr
, 0))
1409 /* converting from string constant to char *. */
1410 conv
= build_conv (ck_qual
, to
, conv
);
1411 else if (fnptr_conv_p (to
, from
))
1412 conv
= build_conv (ck_fnptr
, to
, conv
);
1413 /* Allow conversions among compatible ObjC pointer types (base
1414 conversions have been already handled above). */
1415 else if (c_dialect_objc ()
1416 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1417 conv
= build_conv (ck_ptr
, to
, conv
);
1418 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1420 conv
= build_conv (ck_ptr
, to
, conv
);
1428 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1430 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1431 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1432 tree fbase
= class_of_this_parm (fromfn
);
1433 tree tbase
= class_of_this_parm (tofn
);
1435 if (!DERIVED_FROM_P (fbase
, tbase
))
1438 tree fstat
= static_fn_type (fromfn
);
1439 tree tstat
= static_fn_type (tofn
);
1440 if (same_type_p (tstat
, fstat
)
1441 || fnptr_conv_p (tstat
, fstat
))
1446 if (!same_type_p (fbase
, tbase
))
1448 from
= build_memfn_type (fstat
,
1450 cp_type_quals (tbase
),
1451 type_memfn_rqual (tofn
));
1452 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1453 conv
= build_conv (ck_pmem
, from
, conv
);
1454 conv
->base_p
= true;
1456 if (fnptr_conv_p (tstat
, fstat
))
1457 conv
= build_conv (ck_fnptr
, to
, conv
);
1459 else if (tcode
== BOOLEAN_TYPE
)
1463 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1464 to member type can be converted to a prvalue of type bool. ...
1465 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1466 std::nullptr_t can be converted to a prvalue of type bool; */
1467 if (ARITHMETIC_TYPE_P (from
)
1468 || UNSCOPED_ENUM_P (from
)
1469 || fcode
== POINTER_TYPE
1470 || TYPE_PTRMEM_P (from
)
1471 || NULLPTR_TYPE_P (from
))
1473 conv
= build_conv (ck_std
, to
, conv
);
1474 if (fcode
== POINTER_TYPE
1475 || TYPE_PTRDATAMEM_P (from
)
1476 || (TYPE_PTRMEMFUNC_P (from
)
1477 && conv
->rank
< cr_pbool
)
1478 || NULLPTR_TYPE_P (from
))
1479 conv
->rank
= cr_pbool
;
1480 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1482 if (flags
& LOOKUP_NO_NARROWING
)
1483 conv
->check_narrowing
= true;
1489 /* We don't check for ENUMERAL_TYPE here because there are no standard
1490 conversions to enum type. */
1491 /* As an extension, allow conversion to complex type. */
1492 else if (ARITHMETIC_TYPE_P (to
))
1494 if (! (INTEGRAL_CODE_P (fcode
)
1495 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1496 || SCOPED_ENUM_P (from
))
1499 /* If we're parsing an enum with no fixed underlying type, we're
1500 dealing with an incomplete type, which renders the conversion
1502 if (!COMPLETE_TYPE_P (from
))
1505 conv
= build_conv (ck_std
, to
, conv
);
1507 tree underlying_type
= NULL_TREE
;
1508 if (TREE_CODE (from
) == ENUMERAL_TYPE
1509 && ENUM_FIXED_UNDERLYING_TYPE_P (from
))
1510 underlying_type
= ENUM_UNDERLYING_TYPE (from
);
1512 /* Give this a better rank if it's a promotion.
1514 To handle CWG 1601, also bump the rank if we are converting
1515 an enumeration with a fixed underlying type to the underlying
1517 if ((same_type_p (to
, type_promotes_to (from
))
1518 || (underlying_type
&& same_type_p (to
, underlying_type
)))
1519 && next_conversion (conv
)->rank
<= cr_promotion
)
1520 conv
->rank
= cr_promotion
;
1522 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1523 && vector_types_convertible_p (from
, to
, false))
1524 return build_conv (ck_std
, to
, conv
);
1525 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1526 && is_properly_derived_from (from
, to
))
1528 if (conv
->kind
== ck_rvalue
)
1529 conv
= next_conversion (conv
);
1530 conv
= build_conv (ck_base
, to
, conv
);
1531 /* The derived-to-base conversion indicates the initialization
1532 of a parameter with base type from an object of a derived
1533 type. A temporary object is created to hold the result of
1534 the conversion unless we're binding directly to a reference. */
1535 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1536 if (flags
& LOOKUP_PREFER_RVALUE
)
1537 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1538 conv
->rvaluedness_matches_p
= true;
1539 /* If we're performing copy-initialization, remember to skip
1540 explicit constructors. */
1541 if (flags
& LOOKUP_ONLYCONVERTING
)
1542 conv
->copy_init_p
= true;
1547 if (flags
& LOOKUP_NO_NARROWING
)
1548 conv
->check_narrowing
= true;
1553 /* Returns nonzero if T1 is reference-related to T2. */
1556 reference_related_p (tree t1
, tree t2
)
1558 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1561 t1
= TYPE_MAIN_VARIANT (t1
);
1562 t2
= TYPE_MAIN_VARIANT (t2
);
1566 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1567 to "cv2 T2" if T1 is similar to T2, or T1 is a base class of T2. */
1568 return (similar_type_p (t1
, t2
)
1569 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1570 && DERIVED_FROM_P (t1
, t2
)));
1573 /* Returns nonzero if T1 is reference-compatible with T2. */
1576 reference_compatible_p (tree t1
, tree t2
)
1580 "cv1 T1" is reference compatible with "cv2 T2" if
1581 a prvalue of type "pointer to cv2 T2" can be converted to the type
1582 "pointer to cv1 T1" via a standard conversion sequence. */
1583 tree ptype1
= build_pointer_type (t1
);
1584 tree ptype2
= build_pointer_type (t2
);
1585 conversion
*conv
= standard_conversion (ptype1
, ptype2
, NULL_TREE
,
1586 /*c_cast_p=*/false, 0, tf_none
);
1587 if (!conv
|| conv
->bad_p
)
1592 /* Return true if converting FROM to TO would involve a qualification
1596 involves_qualification_conversion_p (tree to
, tree from
)
1598 /* If we're not convering a pointer to another one, we won't get
1599 a qualification conversion. */
1600 if (!((TYPE_PTR_P (to
) && TYPE_PTR_P (from
))
1601 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
))))
1604 conversion
*conv
= standard_conversion (to
, from
, NULL_TREE
,
1605 /*c_cast_p=*/false, 0, tf_none
);
1606 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1607 if (t
->kind
== ck_qual
)
1613 /* A reference of the indicated TYPE is being bound directly to the
1614 expression represented by the implicit conversion sequence CONV.
1615 Return a conversion sequence for this binding. */
1618 direct_reference_binding (tree type
, conversion
*conv
)
1622 gcc_assert (TYPE_REF_P (type
));
1623 gcc_assert (!TYPE_REF_P (conv
->type
));
1625 t
= TREE_TYPE (type
);
1627 if (conv
->kind
== ck_identity
)
1628 /* Mark the identity conv as to not decay to rvalue. */
1629 conv
->rvaluedness_matches_p
= true;
1633 When a parameter of reference type binds directly
1634 (_dcl.init.ref_) to an argument expression, the implicit
1635 conversion sequence is the identity conversion, unless the
1636 argument expression has a type that is a derived class of the
1637 parameter type, in which case the implicit conversion sequence is
1638 a derived-to-base Conversion.
1640 If the parameter binds directly to the result of applying a
1641 conversion function to the argument expression, the implicit
1642 conversion sequence is a user-defined conversion sequence
1643 (_over.ics.user_), with the second standard conversion sequence
1644 either an identity conversion or, if the conversion function
1645 returns an entity of a type that is a derived class of the
1646 parameter type, a derived-to-base conversion. */
1647 if (is_properly_derived_from (conv
->type
, t
))
1649 /* Represent the derived-to-base conversion. */
1650 conv
= build_conv (ck_base
, t
, conv
);
1651 /* We will actually be binding to the base-class subobject in
1652 the derived class, so we mark this conversion appropriately.
1653 That way, convert_like knows not to generate a temporary. */
1654 conv
->need_temporary_p
= false;
1656 else if (involves_qualification_conversion_p (t
, conv
->type
))
1657 /* Represent the qualification conversion. After DR 2352
1658 #1 and #2 were indistinguishable conversion sequences:
1661 void f(const int* const &); // #2
1662 void g(int* p) { f(p); }
1664 because the types "int *" and "const int *const" are
1665 reference-related and we were binding both directly and they
1666 had the same rank. To break it up, we add a ck_qual under the
1667 ck_ref_bind so that conversion sequence ranking chooses #1. */
1668 conv
= build_conv (ck_qual
, t
, conv
);
1670 return build_conv (ck_ref_bind
, type
, conv
);
1673 /* Returns the conversion path from type FROM to reference type TO for
1674 purposes of reference binding. For lvalue binding, either pass a
1675 reference type to FROM or an lvalue expression to EXPR. If the
1676 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1677 the conversion returned. If C_CAST_P is true, this
1678 conversion is coming from a C-style cast. */
1681 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1682 tsubst_flags_t complain
)
1684 conversion
*conv
= NULL
;
1685 tree to
= TREE_TYPE (rto
);
1690 cp_lvalue_kind gl_kind
;
1693 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1695 expr
= instantiate_type (to
, expr
, tf_none
);
1696 if (expr
== error_mark_node
)
1698 from
= TREE_TYPE (expr
);
1701 bool copy_list_init
= false;
1702 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1704 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1705 /* DR 1288: Otherwise, if the initializer list has a single element
1706 of type E and ... [T's] referenced type is reference-related to E,
1707 the object or reference is initialized from that element...
1709 ??? With P0388R4, we should bind 't' directly to U{}:
1712 because A[] and A[2] are reference-related. But we don't do it
1713 because grok_reference_init has deduced the array size (to 1), and
1714 A[1] and A[2] aren't reference-related. */
1715 if (CONSTRUCTOR_NELTS (expr
) == 1)
1717 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1718 if (error_operand_p (elt
))
1720 tree etype
= TREE_TYPE (elt
);
1721 if (reference_related_p (to
, etype
))
1728 /* Otherwise, if T is a reference type, a prvalue temporary of the type
1729 referenced by T is copy-list-initialized, and the reference is bound
1730 to that temporary. */
1731 copy_list_init
= true;
1735 if (TYPE_REF_P (from
))
1737 from
= TREE_TYPE (from
);
1738 if (!TYPE_REF_IS_RVALUE (rfrom
)
1739 || TREE_CODE (from
) == FUNCTION_TYPE
)
1740 gl_kind
= clk_ordinary
;
1742 gl_kind
= clk_rvalueref
;
1745 gl_kind
= lvalue_kind (expr
);
1746 else if (CLASS_TYPE_P (from
)
1747 || TREE_CODE (from
) == ARRAY_TYPE
)
1748 gl_kind
= clk_class
;
1752 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1753 if ((flags
& LOOKUP_NO_TEMP_BIND
)
1754 && (gl_kind
& clk_class
))
1757 /* Same mask as real_lvalue_p. */
1758 is_lvalue
= gl_kind
&& !(gl_kind
& (clk_rvalueref
|clk_class
));
1761 if ((gl_kind
& clk_bitfield
) != 0)
1762 tfrom
= unlowered_expr_type (expr
);
1764 /* Figure out whether or not the types are reference-related and
1765 reference compatible. We have to do this after stripping
1766 references from FROM. */
1767 related_p
= reference_related_p (to
, tfrom
);
1768 /* If this is a C cast, first convert to an appropriately qualified
1769 type, so that we can later do a const_cast to the desired type. */
1770 if (related_p
&& c_cast_p
1771 && !at_least_as_qualified_p (to
, tfrom
))
1772 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1773 compatible_p
= reference_compatible_p (to
, tfrom
);
1775 /* Directly bind reference when target expression's type is compatible with
1776 the reference and expression is an lvalue. In DR391, the wording in
1777 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1778 const and rvalue references to rvalues of compatible class type.
1779 We should also do direct bindings for non-class xvalues. */
1780 if ((related_p
|| compatible_p
) && gl_kind
)
1784 If the initializer expression
1786 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1787 is reference-compatible with "cv2 T2,"
1789 the reference is bound directly to the initializer expression
1793 If the initializer expression is an rvalue, with T2 a class type,
1794 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1795 is bound to the object represented by the rvalue or to a sub-object
1796 within that object. */
1798 conv
= build_identity_conv (tfrom
, expr
);
1799 conv
= direct_reference_binding (rto
, conv
);
1801 if (TYPE_REF_P (rfrom
))
1802 /* Handle rvalue reference to function properly. */
1803 conv
->rvaluedness_matches_p
1804 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1806 conv
->rvaluedness_matches_p
1807 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1809 if ((gl_kind
& clk_bitfield
) != 0
1810 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1811 /* For the purposes of overload resolution, we ignore the fact
1812 this expression is a bitfield or packed field. (In particular,
1813 [over.ics.ref] says specifically that a function with a
1814 non-const reference parameter is viable even if the
1815 argument is a bitfield.)
1817 However, when we actually call the function we must create
1818 a temporary to which to bind the reference. If the
1819 reference is volatile, or isn't const, then we cannot make
1820 a temporary, so we just issue an error when the conversion
1822 conv
->need_temporary_p
= true;
1824 /* Don't allow binding of lvalues (other than function lvalues) to
1825 rvalue references. */
1826 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1827 && TREE_CODE (to
) != FUNCTION_TYPE
)
1830 /* Nor the reverse. */
1831 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1832 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1833 || (flags
& LOOKUP_NO_RVAL_BIND
))
1834 && TREE_CODE (to
) != FUNCTION_TYPE
)
1842 /* [class.conv.fct] A conversion function is never used to convert a
1843 (possibly cv-qualified) object to the (possibly cv-qualified) same
1844 object type (or a reference to it), to a (possibly cv-qualified) base
1845 class of that type (or a reference to it).... */
1846 else if (CLASS_TYPE_P (from
) && !related_p
1847 && !(flags
& LOOKUP_NO_CONVERSION
))
1851 If the initializer expression
1853 -- has a class type (i.e., T2 is a class type) can be
1854 implicitly converted to an lvalue of type "cv3 T3," where
1855 "cv1 T1" is reference-compatible with "cv3 T3". (this
1856 conversion is selected by enumerating the applicable
1857 conversion functions (_over.match.ref_) and choosing the
1858 best one through overload resolution. (_over.match_).
1860 the reference is bound to the lvalue result of the conversion
1861 in the second case. */
1862 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1865 return cand
->second_conv
;
1868 /* From this point on, we conceptually need temporaries, even if we
1869 elide them. Only the cases above are "direct bindings". */
1870 if (flags
& LOOKUP_NO_TEMP_BIND
)
1875 When a parameter of reference type is not bound directly to an
1876 argument expression, the conversion sequence is the one required
1877 to convert the argument expression to the underlying type of the
1878 reference according to _over.best.ics_. Conceptually, this
1879 conversion sequence corresponds to copy-initializing a temporary
1880 of the underlying type with the argument expression. Any
1881 difference in top-level cv-qualification is subsumed by the
1882 initialization itself and does not constitute a conversion. */
1886 Otherwise, the reference shall be an lvalue reference to a
1887 non-volatile const type, or the reference shall be an rvalue
1890 We try below to treat this as a bad conversion to improve diagnostics,
1891 but if TO is an incomplete class, we need to reject this conversion
1892 now to avoid unnecessary instantiation. */
1893 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1894 && !COMPLETE_TYPE_P (to
))
1897 /* We're generating a temporary now, but don't bind any more in the
1898 conversion (specifically, don't slice the temporary returned by a
1899 conversion operator). */
1900 flags
|= LOOKUP_NO_TEMP_BIND
;
1902 /* Core issue 899: When [copy-]initializing a temporary to be bound
1903 to the first parameter of a copy constructor (12.8) called with
1904 a single argument in the context of direct-initialization,
1905 explicit conversion functions are also considered.
1907 So don't set LOOKUP_ONLYCONVERTING in that case. */
1908 if (!(flags
& LOOKUP_COPY_PARM
))
1909 flags
|= LOOKUP_ONLYCONVERTING
;
1912 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1917 if (conv
->user_conv_p
)
1920 /* Remember this was copy-list-initialization. */
1921 conv
->need_temporary_p
= true;
1923 /* If initializing the temporary used a conversion function,
1924 recalculate the second conversion sequence. */
1925 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1926 if (t
->kind
== ck_user
1927 && DECL_CONV_FN_P (t
->cand
->fn
))
1929 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1930 /* A prvalue of non-class type is cv-unqualified. */
1931 if (!TYPE_REF_P (ftype
) && !CLASS_TYPE_P (ftype
))
1932 ftype
= cv_unqualified (ftype
);
1933 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1934 conversion
*new_second
1935 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1939 return merge_conversion_sequences (t
, new_second
);
1943 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1944 /* This reference binding, unlike those above, requires the
1945 creation of a temporary. */
1946 conv
->need_temporary_p
= true;
1947 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1951 Otherwise, the reference shall be an lvalue reference to a
1952 non-volatile const type, or the reference shall be an rvalue
1954 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1959 Otherwise, a temporary of type "cv1 T1" is created and
1960 initialized from the initializer expression using the rules for a
1961 non-reference copy initialization. If T1 is reference-related to
1962 T2, cv1 must be the same cv-qualification as, or greater
1963 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1964 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1970 /* Returns the implicit conversion sequence (see [over.ics]) from type
1971 FROM to type TO. The optional expression EXPR may affect the
1972 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1973 true, this conversion is coming from a C-style cast. */
1976 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1977 int flags
, tsubst_flags_t complain
)
1981 if (from
== error_mark_node
|| to
== error_mark_node
1982 || expr
== error_mark_node
)
1985 /* Other flags only apply to the primary function in overload
1986 resolution, or after we've chosen one. */
1987 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1988 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1989 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1991 /* FIXME: actually we don't want warnings either, but we can't just
1992 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1993 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1994 We really ought not to issue that warning until we've committed
1995 to that conversion. */
1996 complain
&= ~tf_error
;
1998 /* Call reshape_init early to remove redundant braces. */
1999 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
2000 && CLASS_TYPE_P (to
)
2001 && COMPLETE_TYPE_P (complete_type (to
))
2002 && !CLASSTYPE_NON_AGGREGATE (to
))
2004 expr
= reshape_init (to
, expr
, complain
);
2005 if (expr
== error_mark_node
)
2007 from
= TREE_TYPE (expr
);
2010 if (TYPE_REF_P (to
))
2011 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
2013 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
2018 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
2020 if (is_std_init_list (to
) && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr
))
2021 return build_list_conv (to
, expr
, flags
, complain
);
2023 /* As an extension, allow list-initialization of _Complex. */
2024 if (TREE_CODE (to
) == COMPLEX_TYPE
2025 && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr
))
2027 conv
= build_complex_conv (to
, expr
, flags
, complain
);
2032 /* Allow conversion from an initializer-list with one element to a
2034 if (SCALAR_TYPE_P (to
))
2036 int nelts
= CONSTRUCTOR_NELTS (expr
);
2040 elt
= build_value_init (to
, tf_none
);
2041 else if (nelts
== 1 && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr
))
2042 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
2044 elt
= error_mark_node
;
2046 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
2047 c_cast_p
, flags
, complain
);
2050 conv
->check_narrowing
= true;
2051 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
2052 /* Too many levels of braces, i.e. '{{1}}'. */
2057 else if (TREE_CODE (to
) == ARRAY_TYPE
)
2058 return build_array_conv (to
, expr
, flags
, complain
);
2061 if (expr
!= NULL_TREE
2062 && (MAYBE_CLASS_TYPE_P (from
)
2063 || MAYBE_CLASS_TYPE_P (to
))
2064 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
2066 struct z_candidate
*cand
;
2068 if (CLASS_TYPE_P (to
)
2069 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
2070 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
2071 return build_aggr_conv (to
, expr
, flags
, complain
);
2073 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
2076 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
2077 && CONSTRUCTOR_NELTS (expr
) == 1
2078 && !is_list_ctor (cand
->fn
))
2080 /* "If C is not an initializer-list constructor and the
2081 initializer list has a single element of type cv U, where U is
2082 X or a class derived from X, the implicit conversion sequence
2083 has Exact Match rank if U is X, or Conversion rank if U is
2085 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
2086 tree elttype
= TREE_TYPE (elt
);
2087 if (reference_related_p (to
, elttype
))
2088 return implicit_conversion (to
, elttype
, elt
,
2089 c_cast_p
, flags
, complain
);
2091 conv
= cand
->second_conv
;
2094 /* We used to try to bind a reference to a temporary here, but that
2095 is now handled after the recursive call to this function at the end
2096 of reference_binding. */
2103 /* Like implicit_conversion, but return NULL if the conversion is bad.
2105 This is not static so that check_non_deducible_conversion can call it within
2106 add_template_candidate_real as part of overload resolution; it should not be
2107 called outside of overload resolution. */
2110 good_conversion (tree to
, tree from
, tree expr
,
2111 int flags
, tsubst_flags_t complain
)
2113 conversion
*c
= implicit_conversion (to
, from
, expr
, /*cast*/false,
2120 /* Add a new entry to the list of candidates. Used by the add_*_candidate
2121 functions. ARGS will not be changed until a single candidate is
2124 static struct z_candidate
*
2125 add_candidate (struct z_candidate
**candidates
,
2126 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
2127 size_t num_convs
, conversion
**convs
,
2128 tree access_path
, tree conversion_path
,
2129 int viable
, struct rejection_reason
*reason
,
2132 struct z_candidate
*cand
= (struct z_candidate
*)
2133 conversion_obstack_alloc (sizeof (struct z_candidate
));
2136 cand
->first_arg
= first_arg
;
2138 cand
->convs
= convs
;
2139 cand
->num_convs
= num_convs
;
2140 cand
->access_path
= access_path
;
2141 cand
->conversion_path
= conversion_path
;
2142 cand
->viable
= viable
;
2143 cand
->reason
= reason
;
2144 cand
->next
= *candidates
;
2145 cand
->flags
= flags
;
2148 if (convs
&& cand
->reversed ())
2149 /* Swap the conversions for comparison in joust; we'll swap them back
2150 before build_over_call. */
2151 std::swap (convs
[0], convs
[1]);
2156 /* Return the number of remaining arguments in the parameter list
2157 beginning with ARG. */
2160 remaining_arguments (tree arg
)
2164 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
2165 arg
= TREE_CHAIN (arg
))
2171 /* [over.match.copy]: When initializing a temporary object (12.2) to be bound
2172 to the first parameter of a constructor where the parameter is of type
2173 "reference to possibly cv-qualified T" and the constructor is called with a
2174 single argument in the context of direct-initialization of an object of type
2175 "cv2 T", explicit conversion functions are also considered.
2177 So set LOOKUP_COPY_PARM to let reference_binding know that
2178 it's being called in that context. */
2181 conv_flags (int i
, int nargs
, tree fn
, tree arg
, int flags
)
2185 if (i
== 0 && nargs
== 1 && DECL_CONSTRUCTOR_P (fn
)
2186 && (t
= FUNCTION_FIRST_USER_PARMTYPE (fn
))
2187 && (same_type_ignoring_top_level_qualifiers_p
2188 (non_reference (TREE_VALUE (t
)), DECL_CONTEXT (fn
))))
2190 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2191 lflags
|= LOOKUP_COPY_PARM
;
2192 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2193 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2194 lflags
|= LOOKUP_NO_CONVERSION
;
2197 lflags
|= LOOKUP_ONLYCONVERTING
;
2202 /* Create an overload candidate for the function or method FN called
2203 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
2204 FLAGS is passed on to implicit_conversion.
2206 This does not change ARGS.
2208 CTYPE, if non-NULL, is the type we want to pretend this function
2209 comes from for purposes of overload resolution. */
2211 static struct z_candidate
*
2212 add_function_candidate (struct z_candidate
**candidates
,
2213 tree fn
, tree ctype
, tree first_arg
,
2214 const vec
<tree
, va_gc
> *args
, tree access_path
,
2215 tree conversion_path
, int flags
,
2217 tsubst_flags_t complain
)
2219 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2222 tree orig_first_arg
= first_arg
;
2225 struct rejection_reason
*reason
= NULL
;
2227 /* At this point we should not see any functions which haven't been
2228 explicitly declared, except for friend functions which will have
2229 been found using argument dependent lookup. */
2230 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
2232 /* The `this', `in_chrg' and VTT arguments to constructors are not
2233 considered in overload resolution. */
2234 if (DECL_CONSTRUCTOR_P (fn
))
2236 if (ctor_omit_inherited_parms (fn
))
2237 /* Bring back parameters omitted from an inherited ctor. */
2238 parmlist
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn
));
2240 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
2241 skip
= num_artificial_parms_for (fn
);
2242 if (skip
> 0 && first_arg
!= NULL_TREE
)
2245 first_arg
= NULL_TREE
;
2251 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
2253 convs
= alloc_conversions (len
);
2255 /* 13.3.2 - Viable functions [over.match.viable]
2256 First, to be a viable function, a candidate function shall have enough
2257 parameters to agree in number with the arguments in the list.
2259 We need to check this first; otherwise, checking the ICSes might cause
2260 us to produce an ill-formed template instantiation. */
2262 parmnode
= parmlist
;
2263 for (i
= 0; i
< len
; ++i
)
2265 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
2267 parmnode
= TREE_CHAIN (parmnode
);
2270 if ((i
< len
&& parmnode
)
2271 || !sufficient_parms_p (parmnode
))
2273 int remaining
= remaining_arguments (parmnode
);
2275 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2278 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2279 parameter of type "reference to cv C" (including such a constructor
2280 instantiated from a template) is excluded from the set of candidate
2281 functions when used to construct an object of type D with an argument list
2282 containing a single argument if C is reference-related to D. */
2283 if (viable
&& len
== 1 && parmlist
&& DECL_CONSTRUCTOR_P (fn
)
2284 && flag_new_inheriting_ctors
2285 && DECL_INHERITED_CTOR (fn
))
2287 tree ptype
= non_reference (TREE_VALUE (parmlist
));
2288 tree dtype
= DECL_CONTEXT (fn
);
2289 tree btype
= DECL_INHERITED_CTOR_BASE (fn
);
2290 if (reference_related_p (ptype
, dtype
)
2291 && reference_related_p (btype
, ptype
))
2294 reason
= inherited_ctor_rejection ();
2298 /* Second, for a function to be viable, its constraints must be
2300 if (flag_concepts
&& viable
&& !constraints_satisfied_p (fn
))
2302 reason
= constraint_failure ();
2306 /* When looking for a function from a subobject from an implicit
2307 copy/move constructor/operator=, don't consider anything that takes (a
2308 reference to) an unrelated type. See c++/44909 and core 1092. */
2309 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2311 if (DECL_CONSTRUCTOR_P (fn
))
2313 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2314 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
))
2320 parmnode
= chain_index (i
-1, parmlist
);
2321 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2326 /* This only applies at the top level. */
2327 flags
&= ~LOOKUP_DEFAULTED
;
2333 /* Third, for F to be a viable function, there shall exist for each
2334 argument an implicit conversion sequence that converts that argument
2335 to the corresponding parameter of F. */
2337 parmnode
= parmlist
;
2339 for (i
= 0; i
< len
; ++i
)
2341 tree argtype
, to_type
;
2346 if (parmnode
== void_list_node
)
2351 /* Already set during deduction. */
2352 parmnode
= TREE_CHAIN (parmnode
);
2356 if (i
== 0 && first_arg
!= NULL_TREE
)
2359 arg
= CONST_CAST_TREE (
2360 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2361 argtype
= lvalue_type (arg
);
2363 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2364 && ! DECL_CONSTRUCTOR_P (fn
));
2368 tree parmtype
= TREE_VALUE (parmnode
);
2370 parmnode
= TREE_CHAIN (parmnode
);
2372 /* The type of the implicit object parameter ('this') for
2373 overload resolution is not always the same as for the
2374 function itself; conversion functions are considered to
2375 be members of the class being converted, and functions
2376 introduced by a using-declaration are considered to be
2377 members of the class that uses them.
2379 Since build_over_call ignores the ICS for the `this'
2380 parameter, we can just change the parm type. */
2381 if (ctype
&& is_this
)
2383 parmtype
= cp_build_qualified_type
2384 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2385 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2387 /* If the function has a ref-qualifier, the implicit
2388 object parameter has reference type. */
2389 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2390 parmtype
= cp_build_reference_type (parmtype
, rv
);
2391 /* The special handling of 'this' conversions in compare_ics
2392 does not apply if there is a ref-qualifier. */
2397 parmtype
= build_pointer_type (parmtype
);
2398 /* We don't use build_this here because we don't want to
2399 capture the object argument until we've chosen a
2400 non-static member function. */
2401 arg
= build_address (arg
);
2402 argtype
= lvalue_type (arg
);
2406 int lflags
= conv_flags (i
, len
-skip
, fn
, arg
, flags
);
2408 t
= implicit_conversion (parmtype
, argtype
, arg
,
2409 /*c_cast_p=*/false, lflags
, complain
);
2414 t
= build_identity_conv (argtype
, arg
);
2415 t
->ellipsis_p
= true;
2426 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
,
2427 EXPR_LOCATION (arg
));
2434 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
,
2435 EXPR_LOCATION (arg
));
2441 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2442 access_path
, conversion_path
, viable
, reason
, flags
);
2445 /* Create an overload candidate for the conversion function FN which will
2446 be invoked for expression OBJ, producing a pointer-to-function which
2447 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2448 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2449 passed on to implicit_conversion.
2451 Actually, we don't really care about FN; we care about the type it
2452 converts to. There may be multiple conversion functions that will
2453 convert to that type, and we rely on build_user_type_conversion_1 to
2454 choose the best one; so when we create our candidate, we record the type
2455 instead of the function. */
2457 static struct z_candidate
*
2458 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2459 const vec
<tree
, va_gc
> *arglist
,
2460 tree access_path
, tree conversion_path
,
2461 tsubst_flags_t complain
)
2463 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2464 int i
, len
, viable
, flags
;
2465 tree parmlist
, parmnode
;
2467 struct rejection_reason
*reason
;
2469 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2470 parmlist
= TREE_TYPE (parmlist
);
2471 parmlist
= TYPE_ARG_TYPES (parmlist
);
2473 len
= vec_safe_length (arglist
) + 1;
2474 convs
= alloc_conversions (len
);
2475 parmnode
= parmlist
;
2477 flags
= LOOKUP_IMPLICIT
;
2480 /* Don't bother looking up the same type twice. */
2481 if (*candidates
&& (*candidates
)->fn
== totype
)
2484 for (i
= 0; i
< len
; ++i
)
2486 tree arg
, argtype
, convert_type
= NULL_TREE
;
2492 arg
= (*arglist
)[i
- 1];
2493 argtype
= lvalue_type (arg
);
2497 t
= build_identity_conv (argtype
, NULL_TREE
);
2498 t
= build_conv (ck_user
, totype
, t
);
2499 /* Leave the 'cand' field null; we'll figure out the conversion in
2500 convert_like_real if this candidate is chosen. */
2501 convert_type
= totype
;
2503 else if (parmnode
== void_list_node
)
2507 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2508 /*c_cast_p=*/false, flags
, complain
);
2509 convert_type
= TREE_VALUE (parmnode
);
2513 t
= build_identity_conv (argtype
, arg
);
2514 t
->ellipsis_p
= true;
2515 convert_type
= argtype
;
2525 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
,
2526 EXPR_LOCATION (arg
));
2533 parmnode
= TREE_CHAIN (parmnode
);
2537 || ! sufficient_parms_p (parmnode
))
2539 int remaining
= remaining_arguments (parmnode
);
2541 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2544 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2545 access_path
, conversion_path
, viable
, reason
, flags
);
2549 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2550 tree type1
, tree type2
, const vec
<tree
,va_gc
> &args
,
2551 tree
*argtypes
, int flags
, tsubst_flags_t complain
)
2558 struct rejection_reason
*reason
= NULL
;
2563 num_convs
= args
.length ();
2564 convs
= alloc_conversions (num_convs
);
2566 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2567 conversion ops are allowed. We handle that here by just checking for
2568 boolean_type_node because other operators don't ask for it. COND_EXPR
2569 also does contextual conversion to bool for the first operand, but we
2570 handle that in build_conditional_expr, and type1 here is operand 2. */
2571 if (type1
!= boolean_type_node
)
2572 flags
|= LOOKUP_ONLYCONVERTING
;
2574 for (unsigned i
= 0; i
< 2 && i
< num_convs
; ++i
)
2576 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2577 /*c_cast_p=*/false, flags
, complain
);
2581 /* We need something for printing the candidate. */
2582 t
= build_identity_conv (types
[i
], NULL_TREE
);
2583 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2584 types
[i
], EXPR_LOCATION (args
[i
]));
2589 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2591 EXPR_LOCATION (args
[i
]));
2596 /* For COND_EXPR we rearranged the arguments; undo that now. */
2599 convs
[2] = convs
[1];
2600 convs
[1] = convs
[0];
2601 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2602 /*c_cast_p=*/false, flags
,
2609 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2611 EXPR_LOCATION (args
[2]));
2615 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2617 /*access_path=*/NULL_TREE
,
2618 /*conversion_path=*/NULL_TREE
,
2619 viable
, reason
, flags
);
2623 is_complete (tree t
)
2625 return COMPLETE_TYPE_P (complete_type (t
));
2628 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2631 promoted_arithmetic_type_p (tree type
)
2635 In this section, the term promoted integral type is used to refer
2636 to those integral types which are preserved by integral promotion
2637 (including e.g. int and long but excluding e.g. char).
2638 Similarly, the term promoted arithmetic type refers to promoted
2639 integral types plus floating types. */
2640 return ((CP_INTEGRAL_TYPE_P (type
)
2641 && same_type_p (type_promotes_to (type
), type
))
2642 || TREE_CODE (type
) == REAL_TYPE
);
2645 /* Create any builtin operator overload candidates for the operator in
2646 question given the converted operand types TYPE1 and TYPE2. The other
2647 args are passed through from add_builtin_candidates to
2648 build_builtin_candidate.
2650 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2651 If CODE is requires candidates operands of the same type of the kind
2652 of which TYPE1 and TYPE2 are, we add both candidates
2653 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2656 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2657 enum tree_code code2
, tree fnname
, tree type1
,
2658 tree type2
, vec
<tree
,va_gc
> &args
, tree
*argtypes
,
2659 int flags
, tsubst_flags_t complain
)
2663 case POSTINCREMENT_EXPR
:
2664 case POSTDECREMENT_EXPR
:
2665 args
[1] = integer_zero_node
;
2666 type2
= integer_type_node
;
2675 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2676 and VQ is either volatile or empty, there exist candidate operator
2677 functions of the form
2678 VQ T& operator++(VQ T&);
2679 T operator++(VQ T&, int);
2680 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2681 type other than bool, and VQ is either volatile or empty, there exist
2682 candidate operator functions of the form
2683 VQ T& operator--(VQ T&);
2684 T operator--(VQ T&, int);
2685 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2686 complete object type, and VQ is either volatile or empty, there exist
2687 candidate operator functions of the form
2688 T*VQ& operator++(T*VQ&);
2689 T*VQ& operator--(T*VQ&);
2690 T* operator++(T*VQ&, int);
2691 T* operator--(T*VQ&, int); */
2693 case POSTDECREMENT_EXPR
:
2694 case PREDECREMENT_EXPR
:
2695 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2698 case POSTINCREMENT_EXPR
:
2699 case PREINCREMENT_EXPR
:
2700 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2702 type1
= build_reference_type (type1
);
2707 /* 7 For every cv-qualified or cv-unqualified object type T, there
2708 exist candidate operator functions of the form
2712 8 For every function type T, there exist candidate operator functions of
2714 T& operator*(T*); */
2717 if (TYPE_PTR_P (type1
)
2718 && (TYPE_PTROB_P (type1
)
2719 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2723 /* 9 For every type T, there exist candidate operator functions of the form
2726 10For every promoted arithmetic type T, there exist candidate operator
2727 functions of the form
2731 case UNARY_PLUS_EXPR
: /* unary + */
2732 if (TYPE_PTR_P (type1
))
2736 if (ARITHMETIC_TYPE_P (type1
))
2740 /* 11For every promoted integral type T, there exist candidate operator
2741 functions of the form
2745 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2749 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2750 is the same type as C2 or is a derived class of C2, T is a complete
2751 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2752 there exist candidate operator functions of the form
2753 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2754 where CV12 is the union of CV1 and CV2. */
2757 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2759 tree c1
= TREE_TYPE (type1
);
2760 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2762 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2763 && (TYPE_PTRMEMFUNC_P (type2
)
2764 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2769 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2770 didate operator functions of the form
2775 bool operator<(L, R);
2776 bool operator>(L, R);
2777 bool operator<=(L, R);
2778 bool operator>=(L, R);
2779 bool operator==(L, R);
2780 bool operator!=(L, R);
2781 where LR is the result of the usual arithmetic conversions between
2784 For every integral type T there exists a candidate operator function of
2787 std::strong_ordering operator<=>(T, T);
2789 For every pair of floating-point types L and R, there exists a candidate
2790 operator function of the form
2792 std::partial_ordering operator<=>(L, R);
2794 14For every pair of types T and I, where T is a cv-qualified or cv-
2795 unqualified complete object type and I is a promoted integral type,
2796 there exist candidate operator functions of the form
2797 T* operator+(T*, I);
2798 T& operator[](T*, I);
2799 T* operator-(T*, I);
2800 T* operator+(I, T*);
2801 T& operator[](I, T*);
2803 15For every T, where T is a pointer to complete object type, there exist
2804 candidate operator functions of the form112)
2805 ptrdiff_t operator-(T, T);
2807 16For every pointer or enumeration type T, there exist candidate operator
2808 functions of the form
2809 bool operator<(T, T);
2810 bool operator>(T, T);
2811 bool operator<=(T, T);
2812 bool operator>=(T, T);
2813 bool operator==(T, T);
2814 bool operator!=(T, T);
2815 R operator<=>(T, T);
2817 where R is the result type specified in [expr.spaceship].
2819 17For every pointer to member type T, there exist candidate operator
2820 functions of the form
2821 bool operator==(T, T);
2822 bool operator!=(T, T);
2823 std::strong_equality operator<=>(T, T); */
2826 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2828 if (TYPE_PTROB_P (type1
)
2829 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2831 type2
= ptrdiff_type_node
;
2836 case TRUNC_DIV_EXPR
:
2837 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2841 /* This isn't exactly what's specified above for operator<=>, but it's
2842 close enough. In particular, we don't care about the return type
2843 specified above; it doesn't participate in overload resolution and it
2844 doesn't affect the semantics of the built-in operator. */
2845 case SPACESHIP_EXPR
:
2848 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2849 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2851 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2856 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2868 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2870 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2872 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2873 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2875 if (TYPE_PTR_P (type1
)
2876 && null_ptr_cst_p (args
[1]))
2881 if (null_ptr_cst_p (args
[0])
2882 && TYPE_PTR_P (type2
))
2890 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2894 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2896 type1
= ptrdiff_type_node
;
2899 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2901 type2
= ptrdiff_type_node
;
2906 /* 18For every pair of promoted integral types L and R, there exist candi-
2907 date operator functions of the form
2914 where LR is the result of the usual arithmetic conversions between
2917 case TRUNC_MOD_EXPR
:
2923 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2927 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2928 type, VQ is either volatile or empty, and R is a promoted arithmetic
2929 type, there exist candidate operator functions of the form
2930 VQ L& operator=(VQ L&, R);
2931 VQ L& operator*=(VQ L&, R);
2932 VQ L& operator/=(VQ L&, R);
2933 VQ L& operator+=(VQ L&, R);
2934 VQ L& operator-=(VQ L&, R);
2936 20For every pair T, VQ), where T is any type and VQ is either volatile
2937 or empty, there exist candidate operator functions of the form
2938 T*VQ& operator=(T*VQ&, T*);
2940 21For every pair T, VQ), where T is a pointer to member type and VQ is
2941 either volatile or empty, there exist candidate operator functions of
2943 VQ T& operator=(VQ T&, T);
2945 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2946 unqualified complete object type, VQ is either volatile or empty, and
2947 I is a promoted integral type, there exist candidate operator func-
2949 T*VQ& operator+=(T*VQ&, I);
2950 T*VQ& operator-=(T*VQ&, I);
2952 23For every triple L, VQ, R), where L is an integral or enumeration
2953 type, VQ is either volatile or empty, and R is a promoted integral
2954 type, there exist candidate operator functions of the form
2956 VQ L& operator%=(VQ L&, R);
2957 VQ L& operator<<=(VQ L&, R);
2958 VQ L& operator>>=(VQ L&, R);
2959 VQ L& operator&=(VQ L&, R);
2960 VQ L& operator^=(VQ L&, R);
2961 VQ L& operator|=(VQ L&, R); */
2968 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2970 type2
= ptrdiff_type_node
;
2975 case TRUNC_DIV_EXPR
:
2976 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2980 case TRUNC_MOD_EXPR
:
2986 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2991 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2993 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2994 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2995 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2996 || ((TYPE_PTRMEMFUNC_P (type1
)
2997 || TYPE_PTR_P (type1
))
2998 && null_ptr_cst_p (args
[1])))
3008 type1
= build_reference_type (type1
);
3014 For every pair of promoted arithmetic types L and R, there
3015 exist candidate operator functions of the form
3017 LR operator?(bool, L, R);
3019 where LR is the result of the usual arithmetic conversions
3020 between types L and R.
3022 For every type T, where T is a pointer or pointer-to-member
3023 type, there exist candidate operator functions of the form T
3024 operator?(bool, T, T); */
3026 if (promoted_arithmetic_type_p (type1
)
3027 && promoted_arithmetic_type_p (type2
))
3031 /* Otherwise, the types should be pointers. */
3032 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
3035 /* We don't check that the two types are the same; the logic
3036 below will actually create two candidates; one in which both
3037 parameter types are TYPE1, and one in which both parameter
3043 if (ARITHMETIC_TYPE_P (type1
))
3051 /* Make sure we don't create builtin candidates with dependent types. */
3052 bool u1
= uses_template_parms (type1
);
3053 bool u2
= type2
? uses_template_parms (type2
) : false;
3056 /* Try to recover if one of the types is non-dependent. But if
3057 there's only one type, there's nothing we can do. */
3060 /* And we lose if both are dependent. */
3063 /* Or if they have different forms. */
3064 if (TREE_CODE (type1
) != TREE_CODE (type2
))
3073 /* If we're dealing with two pointer types or two enumeral types,
3074 we need candidates for both of them. */
3075 if (type2
&& !same_type_p (type1
, type2
)
3076 && TREE_CODE (type1
) == TREE_CODE (type2
)
3077 && (TYPE_REF_P (type1
)
3078 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
3079 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
3080 || TYPE_PTRMEMFUNC_P (type1
)
3081 || MAYBE_CLASS_TYPE_P (type1
)
3082 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
3084 if (TYPE_PTR_OR_PTRMEM_P (type1
))
3086 tree cptype
= composite_pointer_type (input_location
,
3092 if (cptype
!= error_mark_node
)
3094 build_builtin_candidate
3095 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
3101 build_builtin_candidate
3102 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
3103 build_builtin_candidate
3104 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
3108 build_builtin_candidate
3109 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
3113 type_decays_to (tree type
)
3115 if (TREE_CODE (type
) == ARRAY_TYPE
)
3116 return build_pointer_type (TREE_TYPE (type
));
3117 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3118 return build_pointer_type (type
);
3122 /* There are three conditions of builtin candidates:
3124 1) bool-taking candidates. These are the same regardless of the input.
3125 2) pointer-pair taking candidates. These are generated for each type
3126 one of the input types converts to.
3127 3) arithmetic candidates. According to the standard, we should generate
3128 all of these, but I'm trying not to...
3130 Here we generate a superset of the possible candidates for this particular
3131 case. That is a subset of the full set the standard defines, plus some
3132 other cases which the standard disallows. add_builtin_candidate will
3133 filter out the invalid set. */
3136 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
3137 enum tree_code code2
, tree fnname
,
3138 vec
<tree
, va_gc
> *argv
,
3139 int flags
, tsubst_flags_t complain
)
3143 tree type
, argtypes
[3], t
;
3144 /* TYPES[i] is the set of possible builtin-operator parameter types
3145 we will consider for the Ith argument. */
3146 vec
<tree
, va_gc
> *types
[2];
3148 vec
<tree
, va_gc
> &args
= *argv
;
3149 unsigned len
= args
.length ();
3151 for (unsigned i
= 0; i
< len
; ++i
)
3154 argtypes
[i
] = unlowered_expr_type (args
[i
]);
3156 argtypes
[i
] = NULL_TREE
;
3161 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
3162 and VQ is either volatile or empty, there exist candidate operator
3163 functions of the form
3164 VQ T& operator++(VQ T&); */
3166 case POSTINCREMENT_EXPR
:
3167 case PREINCREMENT_EXPR
:
3168 case POSTDECREMENT_EXPR
:
3169 case PREDECREMENT_EXPR
:
3174 /* 24There also exist candidate operator functions of the form
3175 bool operator!(bool);
3176 bool operator&&(bool, bool);
3177 bool operator||(bool, bool); */
3179 case TRUTH_NOT_EXPR
:
3180 build_builtin_candidate
3181 (candidates
, fnname
, boolean_type_node
,
3182 NULL_TREE
, args
, argtypes
, flags
, complain
);
3185 case TRUTH_ORIF_EXPR
:
3186 case TRUTH_ANDIF_EXPR
:
3187 build_builtin_candidate
3188 (candidates
, fnname
, boolean_type_node
,
3189 boolean_type_node
, args
, argtypes
, flags
, complain
);
3205 case SPACESHIP_EXPR
:
3213 types
[0] = make_tree_vector ();
3214 types
[1] = make_tree_vector ();
3218 for (unsigned i
= 0; i
< len
; ++i
)
3220 if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
3224 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
3227 convs
= lookup_conversions (argtypes
[i
]);
3229 if (code
== COND_EXPR
)
3231 if (lvalue_p (args
[i
]))
3232 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3234 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
3240 for (; convs
; convs
= TREE_CHAIN (convs
))
3242 type
= TREE_TYPE (convs
);
3245 && (!TYPE_REF_P (type
)
3246 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
3249 if (code
== COND_EXPR
&& TYPE_REF_P (type
))
3250 vec_safe_push (types
[i
], type
);
3252 type
= non_reference (type
);
3253 if (i
!= 0 || ! ref1
)
3255 type
= cv_unqualified (type_decays_to (type
));
3256 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
3257 vec_safe_push (types
[i
], type
);
3258 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3259 type
= type_promotes_to (type
);
3262 if (! vec_member (type
, types
[i
]))
3263 vec_safe_push (types
[i
], type
);
3268 if (code
== COND_EXPR
&& lvalue_p (args
[i
]))
3269 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3270 type
= non_reference (argtypes
[i
]);
3271 if (i
!= 0 || ! ref1
)
3273 type
= cv_unqualified (type_decays_to (type
));
3274 if (enum_p
&& UNSCOPED_ENUM_P (type
))
3275 vec_safe_push (types
[i
], type
);
3276 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3277 type
= type_promotes_to (type
);
3279 vec_safe_push (types
[i
], type
);
3283 /* Run through the possible parameter types of both arguments,
3284 creating candidates with those parameter types. */
3285 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
3290 if (!types
[1]->is_empty ())
3291 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
3292 add_builtin_candidate
3293 (candidates
, code
, code2
, fnname
, t
,
3294 u
, args
, argtypes
, flags
, complain
);
3296 add_builtin_candidate
3297 (candidates
, code
, code2
, fnname
, t
,
3298 NULL_TREE
, args
, argtypes
, flags
, complain
);
3301 release_tree_vector (types
[0]);
3302 release_tree_vector (types
[1]);
3306 /* If TMPL can be successfully instantiated as indicated by
3307 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3309 TMPL is the template. EXPLICIT_TARGS are any explicit template
3310 arguments. ARGLIST is the arguments provided at the call-site.
3311 This does not change ARGLIST. The RETURN_TYPE is the desired type
3312 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3313 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3314 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3316 static struct z_candidate
*
3317 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3318 tree ctype
, tree explicit_targs
, tree first_arg
,
3319 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3320 tree access_path
, tree conversion_path
,
3321 int flags
, tree obj
, unification_kind_t strict
,
3322 tsubst_flags_t complain
)
3324 int ntparms
= DECL_NTPARMS (tmpl
);
3325 tree targs
= make_tree_vec (ntparms
);
3326 unsigned int len
= vec_safe_length (arglist
);
3327 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3328 unsigned int skip_without_in_chrg
= 0;
3329 tree first_arg_without_in_chrg
= first_arg
;
3330 tree
*args_without_in_chrg
;
3331 unsigned int nargs_without_in_chrg
;
3332 unsigned int ia
, ix
;
3334 struct z_candidate
*cand
;
3336 struct rejection_reason
*reason
= NULL
;
3338 conversion
**convs
= NULL
;
3340 /* We don't do deduction on the in-charge parameter, the VTT
3341 parameter or 'this'. */
3342 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3344 if (first_arg_without_in_chrg
!= NULL_TREE
)
3345 first_arg_without_in_chrg
= NULL_TREE
;
3346 else if (return_type
&& strict
== DEDUCE_CALL
)
3347 /* We're deducing for a call to the result of a template conversion
3348 function, so the args don't contain 'this'; leave them alone. */;
3350 ++skip_without_in_chrg
;
3353 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3354 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3355 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3357 if (first_arg_without_in_chrg
!= NULL_TREE
)
3358 first_arg_without_in_chrg
= NULL_TREE
;
3360 ++skip_without_in_chrg
;
3363 if (len
< skip_without_in_chrg
)
3366 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3367 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3368 TREE_TYPE ((*arglist
)[0])))
3370 /* 12.8/6 says, "A declaration of a constructor for a class X is
3371 ill-formed if its first parameter is of type (optionally cv-qualified)
3372 X and either there are no other parameters or else all other
3373 parameters have default arguments. A member function template is never
3374 instantiated to produce such a constructor signature."
3376 So if we're trying to copy an object of the containing class, don't
3377 consider a template constructor that has a first parameter type that
3378 is just a template parameter, as we would deduce a signature that we
3379 would then reject in the code below. */
3380 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3382 firstparm
= TREE_VALUE (firstparm
);
3383 if (PACK_EXPANSION_P (firstparm
))
3384 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3385 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3387 gcc_assert (!explicit_targs
);
3388 reason
= invalid_copy_with_fn_template_rejection ();
3394 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3395 + (len
- skip_without_in_chrg
));
3396 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3398 if (first_arg_without_in_chrg
!= NULL_TREE
)
3400 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3403 for (ix
= skip_without_in_chrg
;
3404 vec_safe_iterate (arglist
, ix
, &arg
);
3407 args_without_in_chrg
[ia
] = arg
;
3410 gcc_assert (ia
== nargs_without_in_chrg
);
3412 errs
= errorcount
+sorrycount
;
3414 convs
= alloc_conversions (nargs
);
3415 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3416 args_without_in_chrg
,
3417 nargs_without_in_chrg
,
3418 return_type
, strict
, flags
, convs
,
3419 false, complain
& tf_decltype
);
3421 if (fn
== error_mark_node
)
3423 /* Don't repeat unification later if it already resulted in errors. */
3424 if (errorcount
+sorrycount
== errs
)
3425 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3426 targs
, args_without_in_chrg
,
3427 nargs_without_in_chrg
,
3428 return_type
, strict
, flags
);
3430 reason
= template_unification_error_rejection ();
3434 /* Now the explicit specifier might have been deduced; check if this
3435 declaration is explicit. If it is and we're ignoring non-converting
3436 constructors, don't add this function to the set of candidates. */
3437 if ((flags
& LOOKUP_ONLYCONVERTING
) && DECL_NONCONVERTING_P (fn
))
3440 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3442 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3443 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3446 /* We're trying to produce a constructor with a prohibited signature,
3447 as discussed above; handle here any cases we didn't catch then,
3449 reason
= invalid_copy_with_fn_template_rejection ();
3454 if (obj
!= NULL_TREE
)
3455 /* Aha, this is a conversion function. */
3456 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3457 access_path
, conversion_path
, complain
);
3459 cand
= add_function_candidate (candidates
, fn
, ctype
,
3460 first_arg
, arglist
, access_path
,
3461 conversion_path
, flags
, convs
, complain
);
3462 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3463 /* This situation can occur if a member template of a template
3464 class is specialized. Then, instantiate_template might return
3465 an instantiation of the specialization, in which case the
3466 DECL_TI_TEMPLATE field will point at the original
3467 specialization. For example:
3469 template <class T> struct S { template <class U> void f(U);
3470 template <> void f(int) {}; };
3474 Here, TMPL will be template <class U> S<double>::f(U).
3475 And, instantiate template will give us the specialization
3476 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3477 for this will point at template <class T> template <> S<T>::f(int),
3478 so that we can find the definition. For the purposes of
3479 overload resolution, however, we want the original TMPL. */
3480 cand
->template_decl
= build_template_info (tmpl
, targs
);
3482 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3483 cand
->explicit_targs
= explicit_targs
;
3487 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3488 access_path
, conversion_path
, 0, reason
, flags
);
3492 static struct z_candidate
*
3493 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3494 tree explicit_targs
, tree first_arg
,
3495 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3496 tree access_path
, tree conversion_path
, int flags
,
3497 unification_kind_t strict
, tsubst_flags_t complain
)
3500 add_template_candidate_real (candidates
, tmpl
, ctype
,
3501 explicit_targs
, first_arg
, arglist
,
3502 return_type
, access_path
, conversion_path
,
3503 flags
, NULL_TREE
, strict
, complain
);
3506 /* Create an overload candidate for the conversion function template TMPL,
3507 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3508 pointer-to-function which will in turn be called with the argument list
3509 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3510 passed on to implicit_conversion. */
3512 static struct z_candidate
*
3513 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3515 const vec
<tree
, va_gc
> *arglist
,
3516 tree return_type
, tree access_path
,
3517 tree conversion_path
, tsubst_flags_t complain
)
3519 /* Making this work broke PR 71117 and 85118, so until the committee resolves
3520 core issue 2189, let's disable this candidate if there are any call
3526 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3527 NULL_TREE
, arglist
, return_type
, access_path
,
3528 conversion_path
, 0, obj
, DEDUCE_CALL
,
3532 /* The CANDS are the set of candidates that were considered for
3533 overload resolution. Return the set of viable candidates, or CANDS
3534 if none are viable. If any of the candidates were viable, set
3535 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3536 considered viable only if it is strictly viable. */
3538 static struct z_candidate
*
3539 splice_viable (struct z_candidate
*cands
,
3543 struct z_candidate
*viable
;
3544 struct z_candidate
**last_viable
;
3545 struct z_candidate
**cand
;
3546 bool found_strictly_viable
= false;
3548 /* Be strict inside templates, since build_over_call won't actually
3549 do the conversions to get pedwarns. */
3550 if (processing_template_decl
)
3554 last_viable
= &viable
;
3555 *any_viable_p
= false;
3560 struct z_candidate
*c
= *cand
;
3562 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3564 /* Be strict in the presence of a viable candidate. Also if
3565 there are template candidates, so that we get deduction errors
3566 for them instead of silently preferring a bad conversion. */
3568 if (viable
&& !found_strictly_viable
)
3570 /* Put any spliced near matches back onto the main list so
3571 that we see them if there is no strict match. */
3572 *any_viable_p
= false;
3573 *last_viable
= cands
;
3576 last_viable
= &viable
;
3580 if (strict_p
? c
->viable
== 1 : c
->viable
)
3585 last_viable
= &c
->next
;
3586 *any_viable_p
= true;
3588 found_strictly_viable
= true;
3594 return viable
? viable
: cands
;
3598 any_strictly_viable (struct z_candidate
*cands
)
3600 for (; cands
; cands
= cands
->next
)
3601 if (cands
->viable
== 1)
3606 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3607 words, it is about to become the "this" pointer for a member
3608 function call. Take the address of the object. */
3611 build_this (tree obj
)
3613 /* In a template, we are only concerned about the type of the
3614 expression, so we can take a shortcut. */
3615 if (processing_template_decl
)
3616 return build_address (obj
);
3618 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3621 /* Returns true iff functions are equivalent. Equivalent functions are
3622 not '==' only if one is a function-local extern function or if
3623 both are extern "C". */
3626 equal_functions (tree fn1
, tree fn2
)
3628 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3630 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3632 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3633 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3634 return decls_match (fn1
, fn2
);
3638 /* Print information about a candidate FN being rejected due to INFO. */
3641 print_conversion_rejection (location_t loc
, struct conversion_info
*info
,
3644 tree from
= info
->from
;
3646 from
= lvalue_type (from
);
3647 if (info
->n_arg
== -1)
3649 /* Conversion of implicit `this' argument failed. */
3650 if (!TYPE_P (info
->from
))
3651 /* A bad conversion for 'this' must be discarding cv-quals. */
3652 inform (loc
, " passing %qT as %<this%> "
3653 "argument discards qualifiers",
3656 inform (loc
, " no known conversion for implicit "
3657 "%<this%> parameter from %qH to %qI",
3658 from
, info
->to_type
);
3660 else if (!TYPE_P (info
->from
))
3662 if (info
->n_arg
>= 0)
3663 inform (loc
, " conversion of argument %d would be ill-formed:",
3665 perform_implicit_conversion (info
->to_type
, info
->from
,
3666 tf_warning_or_error
);
3668 else if (info
->n_arg
== -2)
3669 /* Conversion of conversion function return value failed. */
3670 inform (loc
, " no known conversion from %qH to %qI",
3671 from
, info
->to_type
);
3674 if (TREE_CODE (fn
) == FUNCTION_DECL
)
3675 loc
= get_fndecl_argument_location (fn
, info
->n_arg
);
3676 inform (loc
, " no known conversion for argument %d from %qH to %qI",
3677 info
->n_arg
+ 1, from
, info
->to_type
);
3681 /* Print information about a candidate with WANT parameters and we found
3685 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3687 inform_n (loc
, want
,
3688 " candidate expects %d argument, %d provided",
3689 " candidate expects %d arguments, %d provided",
3693 /* Print information about one overload candidate CANDIDATE. MSGSTR
3694 is the text to print before the candidate itself.
3696 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3697 to have been run through gettext by the caller. This wart makes
3698 life simpler in print_z_candidates and for the translators. */
3701 print_z_candidate (location_t loc
, const char *msgstr
,
3702 struct z_candidate
*candidate
)
3704 const char *msg
= (msgstr
== NULL
3706 : ACONCAT ((_(msgstr
), " ", NULL
)));
3707 tree fn
= candidate
->fn
;
3708 if (flag_new_inheriting_ctors
)
3709 fn
= strip_inheriting_ctors (fn
);
3710 location_t cloc
= location_of (fn
);
3712 if (identifier_p (fn
))
3715 if (candidate
->num_convs
== 3)
3716 inform (cloc
, "%s%<%D(%T, %T, %T)%> (built-in)", msg
, fn
,
3717 candidate
->convs
[0]->type
,
3718 candidate
->convs
[1]->type
,
3719 candidate
->convs
[2]->type
);
3720 else if (candidate
->num_convs
== 2)
3721 inform (cloc
, "%s%<%D(%T, %T)%> (built-in)", msg
, fn
,
3722 candidate
->convs
[0]->type
,
3723 candidate
->convs
[1]->type
);
3725 inform (cloc
, "%s%<%D(%T)%> (built-in)", msg
, fn
,
3726 candidate
->convs
[0]->type
);
3728 else if (TYPE_P (fn
))
3729 inform (cloc
, "%s%qT (conversion)", msg
, fn
);
3730 else if (candidate
->viable
== -1)
3731 inform (cloc
, "%s%#qD (near match)", msg
, fn
);
3732 else if (DECL_DELETED_FN (fn
))
3733 inform (cloc
, "%s%#qD (deleted)", msg
, fn
);
3734 else if (candidate
->reversed ())
3735 inform (cloc
, "%s%#qD (reversed)", msg
, fn
);
3736 else if (candidate
->rewritten ())
3737 inform (cloc
, "%s%#qD (rewritten)", msg
, fn
);
3739 inform (cloc
, "%s%#qD", msg
, fn
);
3740 if (fn
!= candidate
->fn
)
3742 cloc
= location_of (candidate
->fn
);
3743 inform (cloc
, " inherited here");
3745 /* Give the user some information about why this candidate failed. */
3746 if (candidate
->reason
!= NULL
)
3748 struct rejection_reason
*r
= candidate
->reason
;
3753 print_arity_information (cloc
, r
->u
.arity
.actual
,
3754 r
->u
.arity
.expected
);
3756 case rr_arg_conversion
:
3757 print_conversion_rejection (cloc
, &r
->u
.conversion
, fn
);
3759 case rr_bad_arg_conversion
:
3760 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
, fn
);
3762 case rr_explicit_conversion
:
3763 inform (cloc
, " return type %qT of explicit conversion function "
3764 "cannot be converted to %qT with a qualification "
3765 "conversion", r
->u
.conversion
.from
,
3766 r
->u
.conversion
.to_type
);
3768 case rr_template_conversion
:
3769 inform (cloc
, " conversion from return type %qT of template "
3770 "conversion function specialization to %qT is not an "
3771 "exact match", r
->u
.conversion
.from
,
3772 r
->u
.conversion
.to_type
);
3774 case rr_template_unification
:
3775 /* We use template_unification_error_rejection if unification caused
3776 actual non-SFINAE errors, in which case we don't need to repeat
3778 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3780 inform (cloc
, " substitution of deduced template arguments "
3781 "resulted in errors seen above");
3784 /* Re-run template unification with diagnostics. */
3785 inform (cloc
, " template argument deduction/substitution failed:");
3786 fn_type_unification (r
->u
.template_unification
.tmpl
,
3787 r
->u
.template_unification
.explicit_targs
,
3789 (r
->u
.template_unification
.num_targs
)),
3790 r
->u
.template_unification
.args
,
3791 r
->u
.template_unification
.nargs
,
3792 r
->u
.template_unification
.return_type
,
3793 r
->u
.template_unification
.strict
,
3794 r
->u
.template_unification
.flags
,
3797 case rr_invalid_copy
:
3799 " a constructor taking a single argument of its own "
3800 "class type is invalid");
3802 case rr_constraint_failure
:
3803 diagnose_constraints (cloc
, fn
, NULL_TREE
);
3805 case rr_inherited_ctor
:
3806 inform (cloc
, " an inherited constructor is not a candidate for "
3807 "initialization from an expression of the same or derived "
3812 /* This candidate didn't have any issues or we failed to
3813 handle a particular code. Either way... */
3820 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3822 struct z_candidate
*cand1
;
3823 struct z_candidate
**cand2
;
3828 /* Remove non-viable deleted candidates. */
3830 for (cand2
= &cand1
; *cand2
; )
3832 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3833 && !(*cand2
)->viable
3834 && DECL_DELETED_FN ((*cand2
)->fn
))
3835 *cand2
= (*cand2
)->next
;
3837 cand2
= &(*cand2
)->next
;
3839 /* ...if there are any non-deleted ones. */
3843 /* There may be duplicates in the set of candidates. We put off
3844 checking this condition as long as possible, since we have no way
3845 to eliminate duplicates from a set of functions in less than n^2
3846 time. Now we are about to emit an error message, so it is more
3847 permissible to go slowly. */
3848 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3850 tree fn
= cand1
->fn
;
3851 /* Skip builtin candidates and conversion functions. */
3854 cand2
= &cand1
->next
;
3857 if (DECL_P ((*cand2
)->fn
)
3858 && equal_functions (fn
, (*cand2
)->fn
))
3859 *cand2
= (*cand2
)->next
;
3861 cand2
= &(*cand2
)->next
;
3865 for (; candidates
; candidates
= candidates
->next
)
3866 print_z_candidate (loc
, N_("candidate:"), candidates
);
3869 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3870 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3871 the result of the conversion function to convert it to the final
3872 desired type. Merge the two sequences into a single sequence,
3873 and return the merged sequence. */
3876 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3879 bool bad
= user_seq
->bad_p
;
3881 gcc_assert (user_seq
->kind
== ck_user
);
3883 /* Find the end of the second conversion sequence. */
3884 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3886 /* The entire sequence is a user-conversion sequence. */
3887 (*t
)->user_conv_p
= true;
3892 if ((*t
)->rvaluedness_matches_p
)
3893 /* We're binding a reference directly to the result of the conversion.
3894 build_user_type_conversion_1 stripped the REFERENCE_TYPE from the return
3895 type, but we want it back. */
3896 user_seq
->type
= TREE_TYPE (TREE_TYPE (user_seq
->cand
->fn
));
3898 /* Replace the identity conversion with the user conversion
3905 /* Handle overload resolution for initializing an object of class type from
3906 an initializer list. First we look for a suitable constructor that
3907 takes a std::initializer_list; if we don't find one, we then look for a
3908 non-list constructor.
3910 Parameters are as for add_candidates, except that the arguments are in
3911 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3912 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3915 add_list_candidates (tree fns
, tree first_arg
,
3916 const vec
<tree
, va_gc
> *args
, tree totype
,
3917 tree explicit_targs
, bool template_only
,
3918 tree conversion_path
, tree access_path
,
3920 struct z_candidate
**candidates
,
3921 tsubst_flags_t complain
)
3923 gcc_assert (*candidates
== NULL
);
3925 /* We're looking for a ctor for list-initialization. */
3926 flags
|= LOOKUP_LIST_INIT_CTOR
;
3927 /* And we don't allow narrowing conversions. We also use this flag to
3928 avoid the copy constructor call for copy-list-initialization. */
3929 flags
|= LOOKUP_NO_NARROWING
;
3931 unsigned nart
= num_artificial_parms_for (OVL_FIRST (fns
)) - 1;
3932 tree init_list
= (*args
)[nart
];
3934 /* Always use the default constructor if the list is empty (DR 990). */
3935 if (CONSTRUCTOR_NELTS (init_list
) == 0
3936 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3938 /* If the class has a list ctor, try passing the list as a single
3939 argument first, but only consider list ctors. */
3940 else if (TYPE_HAS_LIST_CTOR (totype
))
3942 flags
|= LOOKUP_LIST_ONLY
;
3943 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3944 explicit_targs
, template_only
, conversion_path
,
3945 access_path
, flags
, candidates
, complain
);
3946 if (any_strictly_viable (*candidates
))
3950 /* Expand the CONSTRUCTOR into a new argument vec. */
3951 vec
<tree
, va_gc
> *new_args
;
3952 vec_alloc (new_args
, nart
+ CONSTRUCTOR_NELTS (init_list
));
3953 for (unsigned i
= 0; i
< nart
; ++i
)
3954 new_args
->quick_push ((*args
)[i
]);
3955 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (init_list
); ++i
)
3956 new_args
->quick_push (CONSTRUCTOR_ELT (init_list
, i
)->value
);
3958 /* We aren't looking for list-ctors anymore. */
3959 flags
&= ~LOOKUP_LIST_ONLY
;
3960 /* We allow more user-defined conversions within an init-list. */
3961 flags
&= ~LOOKUP_NO_CONVERSION
;
3963 add_candidates (fns
, first_arg
, new_args
, NULL_TREE
,
3964 explicit_targs
, template_only
, conversion_path
,
3965 access_path
, flags
, candidates
, complain
);
3968 /* Returns the best overload candidate to perform the requested
3969 conversion. This function is used for three the overloading situations
3970 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3971 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3972 per [dcl.init.ref], so we ignore temporary bindings. */
3974 static struct z_candidate
*
3975 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3976 tsubst_flags_t complain
)
3978 struct z_candidate
*candidates
, *cand
;
3980 tree ctors
= NULL_TREE
;
3981 tree conv_fns
= NULL_TREE
;
3982 conversion
*conv
= NULL
;
3983 tree first_arg
= NULL_TREE
;
3984 vec
<tree
, va_gc
> *args
= NULL
;
3991 fromtype
= TREE_TYPE (expr
);
3993 /* We represent conversion within a hierarchy using RVALUE_CONV and
3994 BASE_CONV, as specified by [over.best.ics]; these become plain
3995 constructor calls, as specified in [dcl.init]. */
3996 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3997 || !DERIVED_FROM_P (totype
, fromtype
));
3999 if (CLASS_TYPE_P (totype
))
4000 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
4001 creating a garbage BASELINK; constructors can't be inherited. */
4002 ctors
= get_class_binding (totype
, complete_ctor_identifier
);
4004 if (MAYBE_CLASS_TYPE_P (fromtype
))
4006 tree to_nonref
= non_reference (totype
);
4007 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
4008 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
4009 && DERIVED_FROM_P (to_nonref
, fromtype
)))
4011 /* [class.conv.fct] A conversion function is never used to
4012 convert a (possibly cv-qualified) object to the (possibly
4013 cv-qualified) same object type (or a reference to it), to a
4014 (possibly cv-qualified) base class of that type (or a
4015 reference to it)... */
4018 conv_fns
= lookup_conversions (fromtype
);
4022 flags
|= LOOKUP_NO_CONVERSION
;
4023 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
4024 flags
|= LOOKUP_NO_NARROWING
;
4026 /* It's OK to bind a temporary for converting constructor arguments, but
4027 not in converting the return value of a conversion operator. */
4028 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
4029 | (flags
& LOOKUP_NO_NARROWING
));
4030 flags
&= ~LOOKUP_NO_TEMP_BIND
;
4034 int ctorflags
= flags
;
4036 first_arg
= build_dummy_object (totype
);
4038 /* We should never try to call the abstract or base constructor
4040 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors
))
4041 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors
)));
4043 args
= make_tree_vector_single (expr
);
4044 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
4046 /* List-initialization. */
4047 add_list_candidates (ctors
, first_arg
, args
, totype
, NULL_TREE
,
4048 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
4049 ctorflags
, &candidates
, complain
);
4053 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
4054 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
4055 ctorflags
, &candidates
, complain
);
4058 for (cand
= candidates
; cand
; cand
= cand
->next
)
4060 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
4062 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
4063 set, then this is copy-initialization. In that case, "The
4064 result of the call is then used to direct-initialize the
4065 object that is the destination of the copy-initialization."
4068 We represent this in the conversion sequence with an
4069 rvalue conversion, which means a constructor call. */
4070 if (!TYPE_REF_P (totype
)
4071 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
4073 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
4079 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
4080 first_arg
= CONSTRUCTOR_ELT (expr
, 0)->value
;
4085 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
4087 tree conversion_path
= TREE_PURPOSE (conv_fns
);
4088 struct z_candidate
*old_candidates
;
4090 /* If we are called to convert to a reference type, we are trying to
4091 find a direct binding, so don't even consider temporaries. If
4092 we don't find a direct binding, the caller will try again to
4093 look for a temporary binding. */
4094 if (TYPE_REF_P (totype
))
4095 convflags
|= LOOKUP_NO_TEMP_BIND
;
4097 old_candidates
= candidates
;
4098 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
4100 conversion_path
, TYPE_BINFO (fromtype
),
4101 flags
, &candidates
, complain
);
4103 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
4105 if (cand
->viable
== 0)
4106 /* Already rejected, don't change to -1. */
4109 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
4111 = implicit_conversion (totype
,
4114 /*c_cast_p=*/false, convflags
,
4117 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
4118 copy-initialization. In that case, "The result of the
4119 call is then used to direct-initialize the object that is
4120 the destination of the copy-initialization." [dcl.init]
4122 We represent this in the conversion sequence with an
4123 rvalue conversion, which means a constructor call. But
4124 don't add a second rvalue conversion if there's already
4125 one there. Which there really shouldn't be, but it's
4126 harmless since we'd add it here anyway. */
4127 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
4128 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
4129 ics
= build_conv (ck_rvalue
, totype
, ics
);
4131 cand
->second_conv
= ics
;
4136 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
4138 EXPR_LOCATION (expr
));
4140 else if (TYPE_REF_P (totype
) && !ics
->rvaluedness_matches_p
4141 /* Limit this to non-templates for now (PR90546). */
4142 && !cand
->template_decl
4143 && TREE_CODE (TREE_TYPE (totype
)) != FUNCTION_TYPE
)
4145 /* If we are called to convert to a reference type, we are trying
4146 to find a direct binding per [over.match.ref], so rvaluedness
4147 must match for non-functions. */
4150 else if (DECL_NONCONVERTING_P (cand
->fn
)
4151 && ics
->rank
> cr_exact
)
4153 /* 13.3.1.5: For direct-initialization, those explicit
4154 conversion functions that are not hidden within S and
4155 yield type T or a type that can be converted to type T
4156 with a qualification conversion (4.4) are also candidate
4158 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
4159 I've raised this issue with the committee. --jason 9/2011 */
4161 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
4163 else if (cand
->viable
== 1 && ics
->bad_p
)
4167 = bad_arg_conversion_rejection (NULL_TREE
, -2,
4169 EXPR_LOCATION (expr
));
4171 else if (primary_template_specialization_p (cand
->fn
)
4172 && ics
->rank
> cr_exact
)
4174 /* 13.3.3.1.2: If the user-defined conversion is specified by
4175 a specialization of a conversion function template, the
4176 second standard conversion sequence shall have exact match
4179 cand
->reason
= template_conversion_rejection (rettype
, totype
);
4184 candidates
= splice_viable (candidates
, false, &any_viable_p
);
4188 release_tree_vector (args
);
4192 cand
= tourney (candidates
, complain
);
4195 if (complain
& tf_error
)
4197 auto_diagnostic_group d
;
4198 error_at (cp_expr_loc_or_input_loc (expr
),
4199 "conversion from %qH to %qI is ambiguous",
4201 print_z_candidates (location_of (expr
), candidates
);
4204 cand
= candidates
; /* any one will do */
4205 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
4206 cand
->second_conv
->user_conv_p
= true;
4207 if (!any_strictly_viable (candidates
))
4208 cand
->second_conv
->bad_p
= true;
4209 if (flags
& LOOKUP_ONLYCONVERTING
)
4210 cand
->second_conv
->need_temporary_p
= true;
4211 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
4212 ambiguous conversion is no worse than another user-defined
4219 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
4220 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
4221 else if (cand
->second_conv
->kind
== ck_rvalue
)
4222 /* DR 5: [in the first step of copy-initialization]...if the function
4223 is a constructor, the call initializes a temporary of the
4224 cv-unqualified version of the destination type. */
4225 convtype
= cv_unqualified (totype
);
4228 /* Build the user conversion sequence. */
4232 build_identity_conv (TREE_TYPE (expr
), expr
));
4234 if (cand
->viable
== -1)
4237 /* We're performing the maybe-rvalue overload resolution and
4238 a conversion function is in play. Reject converting the return
4239 value of the conversion function to a base class. */
4240 if ((flags
& LOOKUP_PREFER_RVALUE
) && !DECL_CONSTRUCTOR_P (cand
->fn
))
4241 for (conversion
*t
= cand
->second_conv
; t
; t
= next_conversion (t
))
4242 if (t
->kind
== ck_base
)
4245 /* Remember that this was a list-initialization. */
4246 if (flags
& LOOKUP_NO_NARROWING
)
4247 conv
->check_narrowing
= true;
4249 /* Combine it with the second conversion sequence. */
4250 cand
->second_conv
= merge_conversion_sequences (conv
,
4256 /* Wrapper for above. */
4259 build_user_type_conversion (tree totype
, tree expr
, int flags
,
4260 tsubst_flags_t complain
)
4262 struct z_candidate
*cand
;
4265 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4266 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
4270 if (cand
->second_conv
->kind
== ck_ambig
)
4271 ret
= error_mark_node
;
4274 expr
= convert_like (cand
->second_conv
, expr
, complain
);
4275 ret
= convert_from_reference (expr
);
4281 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4285 /* Worker for build_converted_constant_expr. */
4288 build_converted_constant_expr_internal (tree type
, tree expr
,
4289 int flags
, tsubst_flags_t complain
)
4294 location_t loc
= cp_expr_loc_or_input_loc (expr
);
4296 if (error_operand_p (expr
))
4297 return error_mark_node
;
4299 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4300 p
= conversion_obstack_alloc (0);
4302 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
4303 /*c_cast_p=*/false, flags
, complain
);
4305 /* A converted constant expression of type T is an expression, implicitly
4306 converted to type T, where the converted expression is a constant
4307 expression and the implicit conversion sequence contains only
4309 * user-defined conversions,
4310 * lvalue-to-rvalue conversions (7.1),
4311 * array-to-pointer conversions (7.2),
4312 * function-to-pointer conversions (7.3),
4313 * qualification conversions (7.5),
4314 * integral promotions (7.6),
4315 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4316 * null pointer conversions (7.11) from std::nullptr_t,
4317 * null member pointer conversions (7.12) from std::nullptr_t, and
4318 * function pointer conversions (7.13),
4320 and where the reference binding (if any) binds directly. */
4322 for (conversion
*c
= conv
;
4323 conv
&& c
->kind
!= ck_identity
;
4324 c
= next_conversion (c
))
4328 /* A conversion function is OK. If it isn't constexpr, we'll
4329 complain later that the argument isn't constant. */
4331 /* The lvalue-to-rvalue conversion is OK. */
4333 /* Array-to-pointer and function-to-pointer. */
4335 /* Function pointer conversions. */
4337 /* Qualification conversions. */
4342 if (c
->need_temporary_p
)
4344 if (complain
& tf_error
)
4345 error_at (loc
, "initializing %qH with %qI in converted "
4346 "constant expression does not bind directly",
4347 type
, next_conversion (c
)->type
);
4356 t
= next_conversion (c
)->type
;
4357 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
)
4358 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
4359 /* Integral promotion or conversion. */
4361 if (NULLPTR_TYPE_P (t
))
4362 /* Conversion from nullptr to pointer or pointer-to-member. */
4365 if (complain
& tf_error
)
4366 error_at (loc
, "conversion from %qH to %qI in a "
4367 "converted constant expression", t
, type
);
4376 /* Avoid confusing convert_nontype_argument by introducing
4377 a redundant conversion to the same reference type. */
4378 if (conv
&& conv
->kind
== ck_ref_bind
4379 && REFERENCE_REF_P (expr
))
4381 tree ref
= TREE_OPERAND (expr
, 0);
4382 if (same_type_p (type
, TREE_TYPE (ref
)))
4388 /* Don't copy a class in a template. */
4389 if (CLASS_TYPE_P (type
) && conv
->kind
== ck_rvalue
4390 && processing_template_decl
)
4391 conv
= next_conversion (conv
);
4393 conv
->check_narrowing
= true;
4394 conv
->check_narrowing_const_only
= true;
4395 expr
= convert_like (conv
, expr
, complain
);
4399 if (complain
& tf_error
)
4400 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
4401 TREE_TYPE (expr
), type
);
4402 expr
= error_mark_node
;
4405 /* Free all the conversions we allocated. */
4406 obstack_free (&conversion_obstack
, p
);
4411 /* Subroutine of convert_nontype_argument.
4413 EXPR is an expression used in a context that requires a converted
4414 constant-expression, such as a template non-type parameter. Do any
4415 necessary conversions (that are permitted for converted
4416 constant-expressions) to convert it to the desired type.
4418 This function doesn't consider explicit conversion functions. If
4419 you mean to use "a contextually converted constant expression of type
4420 bool", use build_converted_constant_bool_expr.
4422 If conversion is successful, returns the converted expression;
4423 otherwise, returns error_mark_node. */
4426 build_converted_constant_expr (tree type
, tree expr
, tsubst_flags_t complain
)
4428 return build_converted_constant_expr_internal (type
, expr
, LOOKUP_IMPLICIT
,
4432 /* Used to create "a contextually converted constant expression of type
4433 bool". This differs from build_converted_constant_expr in that it
4434 also considers explicit conversion functions. */
4437 build_converted_constant_bool_expr (tree expr
, tsubst_flags_t complain
)
4439 return build_converted_constant_expr_internal (boolean_type_node
, expr
,
4440 LOOKUP_NORMAL
, complain
);
4443 /* Do any initial processing on the arguments to a function call. */
4446 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
4451 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4453 if (error_operand_p (arg
))
4455 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4457 if (complain
& tf_error
)
4458 error_at (cp_expr_loc_or_input_loc (arg
),
4459 "invalid use of void expression");
4462 else if (invalid_nonstatic_memfn_p (EXPR_LOCATION (arg
), arg
, complain
))
4468 /* Perform overload resolution on FN, which is called with the ARGS.
4470 Return the candidate function selected by overload resolution, or
4471 NULL if the event that overload resolution failed. In the case
4472 that overload resolution fails, *CANDIDATES will be the set of
4473 candidates considered, and ANY_VIABLE_P will be set to true or
4474 false to indicate whether or not any of the candidates were
4477 The ARGS should already have gone through RESOLVE_ARGS before this
4478 function is called. */
4480 static struct z_candidate
*
4481 perform_overload_resolution (tree fn
,
4482 const vec
<tree
, va_gc
> *args
,
4483 struct z_candidate
**candidates
,
4484 bool *any_viable_p
, tsubst_flags_t complain
)
4486 struct z_candidate
*cand
;
4487 tree explicit_targs
;
4490 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4492 explicit_targs
= NULL_TREE
;
4496 *any_viable_p
= true;
4499 gcc_assert (OVL_P (fn
) || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4501 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4503 explicit_targs
= TREE_OPERAND (fn
, 1);
4504 fn
= TREE_OPERAND (fn
, 0);
4508 /* Add the various candidate functions. */
4509 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4510 explicit_targs
, template_only
,
4511 /*conversion_path=*/NULL_TREE
,
4512 /*access_path=*/NULL_TREE
,
4514 candidates
, complain
);
4516 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4518 cand
= tourney (*candidates
, complain
);
4522 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4526 /* Print an error message about being unable to build a call to FN with
4527 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4528 be located; CANDIDATES is a possibly empty list of such
4532 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4533 struct z_candidate
*candidates
)
4535 tree targs
= NULL_TREE
;
4536 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4538 targs
= TREE_OPERAND (fn
, 1);
4539 fn
= TREE_OPERAND (fn
, 0);
4541 tree name
= OVL_NAME (fn
);
4542 location_t loc
= location_of (name
);
4544 name
= lookup_template_function (name
, targs
);
4546 auto_diagnostic_group d
;
4547 if (!any_strictly_viable (candidates
))
4548 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4549 name
, build_tree_list_vec (args
));
4551 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4552 name
, build_tree_list_vec (args
));
4554 print_z_candidates (loc
, candidates
);
4557 /* Return an expression for a call to FN (a namespace-scope function,
4558 or a static member function) with the ARGS. This may change
4562 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
,
4563 tsubst_flags_t complain
)
4565 struct z_candidate
*candidates
, *cand
;
4570 if (args
!= NULL
&& *args
!= NULL
)
4572 *args
= resolve_args (*args
, complain
);
4574 return error_mark_node
;
4578 tm_malloc_replacement (fn
);
4580 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4581 p
= conversion_obstack_alloc (0);
4583 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4588 if (complain
& tf_error
)
4590 // If there is a single (non-viable) function candidate,
4591 // let the error be diagnosed by cp_build_function_call_vec.
4592 if (!any_viable_p
&& candidates
&& ! candidates
->next
4593 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4594 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4596 // Otherwise, emit notes for non-viable candidates.
4597 print_error_for_call_failure (fn
, *args
, candidates
);
4599 result
= error_mark_node
;
4603 int flags
= LOOKUP_NORMAL
;
4604 /* If fn is template_id_expr, the call has explicit template arguments
4605 (e.g. func<int>(5)), communicate this info to build_over_call
4606 through flags so that later we can use it to decide whether to warn
4607 about peculiar null pointer conversion. */
4608 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4609 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4611 result
= build_over_call (cand
, flags
, complain
);
4616 && TREE_CODE (result
) == CALL_EXPR
4617 && DECL_BUILT_IN_CLASS (TREE_OPERAND (CALL_EXPR_FN (result
), 0))
4619 result
= coro_validate_builtin_call (result
);
4621 /* Free all the conversions we allocated. */
4622 obstack_free (&conversion_obstack
, p
);
4627 /* Build a call to a global operator new. FNNAME is the name of the
4628 operator (either "operator new" or "operator new[]") and ARGS are
4629 the arguments provided. This may change ARGS. *SIZE points to the
4630 total number of bytes required by the allocation, and is updated if
4631 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4632 be used. If this function determines that no cookie should be
4633 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4634 is not NULL_TREE, it is evaluated before calculating the final
4635 array size, and if it fails, the array size is replaced with
4636 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4637 is non-NULL, it will be set, upon return, to the allocation
4641 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4642 tree
*size
, tree
*cookie_size
,
4643 tree align_arg
, tree size_check
,
4644 tree
*fn
, tsubst_flags_t complain
)
4646 tree original_size
= *size
;
4648 struct z_candidate
*candidates
;
4649 struct z_candidate
*cand
= NULL
;
4654 /* Set to (size_t)-1 if the size check fails. */
4655 if (size_check
!= NULL_TREE
)
4657 tree errval
= TYPE_MAX_VALUE (sizetype
);
4658 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4659 errval
= throw_bad_array_new_length ();
4660 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4661 original_size
, errval
);
4663 vec_safe_insert (*args
, 0, *size
);
4664 *args
= resolve_args (*args
, complain
);
4666 return error_mark_node
;
4672 If this lookup fails to find the name, or if the allocated type
4673 is not a class type, the allocation function's name is looked
4674 up in the global scope.
4676 we disregard block-scope declarations of "operator new". */
4677 fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/false, 0, 0);
4678 fns
= lookup_arg_dependent (fnname
, fns
, *args
);
4682 vec
<tree
, va_gc
>* align_args
4683 = vec_copy_and_insert (*args
, align_arg
, 1);
4684 cand
= perform_overload_resolution (fns
, align_args
, &candidates
,
4685 &any_viable_p
, tf_none
);
4688 /* If no aligned allocation function matches, try again without the
4692 /* Figure out what function is being called. */
4694 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4697 /* If no suitable function could be found, issue an error message
4701 if (complain
& tf_error
)
4702 print_error_for_call_failure (fns
, *args
, candidates
);
4703 return error_mark_node
;
4706 /* If a cookie is required, add some extra space. Whether
4707 or not a cookie is required cannot be determined until
4708 after we know which function was called. */
4711 bool use_cookie
= true;
4714 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4715 /* Skip the size_t parameter. */
4716 arg_types
= TREE_CHAIN (arg_types
);
4717 /* Check the remaining parameters (if any). */
4719 && TREE_CHAIN (arg_types
) == void_list_node
4720 && same_type_p (TREE_VALUE (arg_types
),
4723 /* If we need a cookie, adjust the number of bytes allocated. */
4726 /* Update the total size. */
4727 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4730 /* Set to (size_t)-1 if the size check fails. */
4731 gcc_assert (size_check
!= NULL_TREE
);
4732 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4733 *size
, TYPE_MAX_VALUE (sizetype
));
4735 /* Update the argument list to reflect the adjusted size. */
4736 (**args
)[0] = *size
;
4739 *cookie_size
= NULL_TREE
;
4742 /* Tell our caller which function we decided to call. */
4746 /* Build the CALL_EXPR. */
4747 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4750 /* Build a new call to operator(). This may change ARGS. */
4753 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4755 struct z_candidate
*candidates
= 0, *cand
;
4756 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4758 tree result
= NULL_TREE
;
4761 obj
= mark_lvalue_use (obj
);
4763 if (error_operand_p (obj
))
4764 return error_mark_node
;
4766 tree type
= TREE_TYPE (obj
);
4768 obj
= prep_operand (obj
);
4770 if (TYPE_PTRMEMFUNC_P (type
))
4772 if (complain
& tf_error
)
4773 /* It's no good looking for an overloaded operator() on a
4774 pointer-to-member-function. */
4775 error ("pointer-to-member function %qE cannot be called without "
4776 "an object; consider using %<.*%> or %<->*%>", obj
);
4777 return error_mark_node
;
4780 if (TYPE_BINFO (type
))
4782 fns
= lookup_fnfields (TYPE_BINFO (type
), call_op_identifier
, 1);
4783 if (fns
== error_mark_node
)
4784 return error_mark_node
;
4789 if (args
!= NULL
&& *args
!= NULL
)
4791 *args
= resolve_args (*args
, complain
);
4793 return error_mark_node
;
4796 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4797 p
= conversion_obstack_alloc (0);
4801 first_mem_arg
= obj
;
4803 add_candidates (BASELINK_FUNCTIONS (fns
),
4804 first_mem_arg
, *args
, NULL_TREE
,
4806 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4807 LOOKUP_NORMAL
, &candidates
, complain
);
4810 convs
= lookup_conversions (type
);
4812 for (; convs
; convs
= TREE_CHAIN (convs
))
4814 tree totype
= TREE_TYPE (convs
);
4816 if (TYPE_PTRFN_P (totype
)
4817 || TYPE_REFFN_P (totype
)
4818 || (TYPE_REF_P (totype
)
4819 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4820 for (ovl_iterator
iter (TREE_VALUE (convs
)); iter
; ++iter
)
4824 if (DECL_NONCONVERTING_P (fn
))
4827 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4828 add_template_conv_candidate
4829 (&candidates
, fn
, obj
, *args
, totype
,
4830 /*access_path=*/NULL_TREE
,
4831 /*conversion_path=*/NULL_TREE
, complain
);
4833 add_conv_candidate (&candidates
, fn
, obj
,
4834 *args
, /*conversion_path=*/NULL_TREE
,
4835 /*access_path=*/NULL_TREE
, complain
);
4839 /* Be strict here because if we choose a bad conversion candidate, the
4840 errors we get won't mention the call context. */
4841 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4844 if (complain
& tf_error
)
4846 auto_diagnostic_group d
;
4847 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4848 build_tree_list_vec (*args
));
4849 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4851 result
= error_mark_node
;
4855 cand
= tourney (candidates
, complain
);
4858 if (complain
& tf_error
)
4860 auto_diagnostic_group d
;
4861 error ("call of %<(%T) (%A)%> is ambiguous",
4862 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4863 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4865 result
= error_mark_node
;
4867 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4868 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
)
4869 && DECL_OVERLOADED_OPERATOR_IS (cand
->fn
, CALL_EXPR
))
4870 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4873 if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4874 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4878 gcc_checking_assert (TYPE_P (cand
->fn
));
4879 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4881 obj
= convert_from_reference (obj
);
4882 result
= cp_build_function_call_vec (obj
, args
, complain
);
4886 /* Free all the conversions we allocated. */
4887 obstack_free (&conversion_obstack
, p
);
4892 /* Wrapper for above. */
4895 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4898 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4899 ret
= build_op_call_1 (obj
, args
, complain
);
4900 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4904 /* Called by op_error to prepare format strings suitable for the error
4905 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4906 and a suffix (controlled by NTYPES). */
4909 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4913 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4914 : G_("no match for "), errmsg
, NULL
);
4917 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4918 else if (ntypes
== 2)
4919 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4921 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4927 op_error (const op_location_t
&loc
,
4928 enum tree_code code
, enum tree_code code2
,
4929 tree arg1
, tree arg2
, tree arg3
, bool match
)
4931 bool assop
= code
== MODIFY_EXPR
;
4932 const char *opname
= OVL_OP_INFO (assop
, assop
? code2
: code
)->name
;
4937 if (flag_diagnostics_show_caret
)
4938 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4940 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4942 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4943 "in %<%E ? %E : %E%>"), 3, match
),
4945 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4948 case POSTINCREMENT_EXPR
:
4949 case POSTDECREMENT_EXPR
:
4950 if (flag_diagnostics_show_caret
)
4951 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4952 opname
, TREE_TYPE (arg1
));
4954 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4956 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4960 if (flag_diagnostics_show_caret
)
4961 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4962 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4964 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4966 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4971 if (flag_diagnostics_show_caret
)
4972 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4973 opname
, TREE_TYPE (arg1
));
4975 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4976 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4980 if (flag_diagnostics_show_caret
)
4981 error_at (loc
, op_error_string (G_("%<operator %s%>"), 1, match
),
4982 opname
, TREE_TYPE (arg1
));
4984 error_at (loc
, op_error_string (G_("%<operator %s%> in %<%s%E%>"),
4986 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4991 if (flag_diagnostics_show_caret
)
4993 binary_op_rich_location
richloc (loc
, arg1
, arg2
, true);
4995 op_error_string (G_("%<operator%s%>"), 2, match
),
4996 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4999 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
5001 opname
, arg1
, opname
, arg2
,
5002 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
5004 if (flag_diagnostics_show_caret
)
5005 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
5006 opname
, TREE_TYPE (arg1
));
5008 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
5010 opname
, opname
, arg1
, TREE_TYPE (arg1
));
5015 /* Return the implicit conversion sequence that could be used to
5016 convert E1 to E2 in [expr.cond]. */
5019 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
5021 tree t1
= non_reference (TREE_TYPE (e1
));
5022 tree t2
= non_reference (TREE_TYPE (e2
));
5028 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
5029 implicitly converted (clause _conv_) to the type "lvalue reference to
5030 T2", subject to the constraint that in the conversion the
5031 reference must bind directly (_dcl.init.ref_) to an lvalue.
5033 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
5034 implicitly converted to the type "rvalue reference to T2", subject to
5035 the constraint that the reference must bind directly. */
5038 tree rtype
= cp_build_reference_type (t2
, !lvalue_p (e2
));
5039 conv
= implicit_conversion (rtype
,
5043 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
5044 |LOOKUP_ONLYCONVERTING
,
5046 if (conv
&& !conv
->bad_p
)
5050 /* If E2 is a prvalue or if neither of the conversions above can be done
5051 and at least one of the operands has (possibly cv-qualified) class
5053 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
5058 If E1 and E2 have class type, and the underlying class types are
5059 the same or one is a base class of the other: E1 can be converted
5060 to match E2 if the class of T2 is the same type as, or a base
5061 class of, the class of T1, and the cv-qualification of T2 is the
5062 same cv-qualification as, or a greater cv-qualification than, the
5063 cv-qualification of T1. If the conversion is applied, E1 is
5064 changed to an rvalue of type T2 that still refers to the original
5065 source class object (or the appropriate subobject thereof). */
5066 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
5067 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
5069 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
5071 conv
= build_identity_conv (t1
, e1
);
5072 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
5073 TYPE_MAIN_VARIANT (t2
)))
5074 conv
= build_conv (ck_base
, t2
, conv
);
5076 conv
= build_conv (ck_rvalue
, t2
, conv
);
5085 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
5086 converted to the type that expression E2 would have if E2 were
5087 converted to an rvalue (or the type it has, if E2 is an rvalue). */
5088 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
5089 LOOKUP_IMPLICIT
, complain
);
5092 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
5093 arguments to the conditional expression. */
5096 build_conditional_expr_1 (const op_location_t
&loc
,
5097 tree arg1
, tree arg2
, tree arg3
,
5098 tsubst_flags_t complain
)
5102 tree result
= NULL_TREE
;
5103 tree result_type
= NULL_TREE
;
5104 bool is_glvalue
= true;
5105 struct z_candidate
*candidates
= 0;
5106 struct z_candidate
*cand
;
5108 tree orig_arg2
, orig_arg3
;
5110 /* As a G++ extension, the second argument to the conditional can be
5111 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
5112 c'.) If the second operand is omitted, make sure it is
5113 calculated only once. */
5116 if (complain
& tf_error
)
5117 pedwarn (loc
, OPT_Wpedantic
,
5118 "ISO C++ forbids omitting the middle term of "
5119 "a %<?:%> expression");
5121 if ((complain
& tf_warning
) && !truth_value_p (TREE_CODE (arg1
)))
5122 warn_for_omitted_condop (loc
, arg1
);
5124 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
5125 if (glvalue_p (arg1
))
5127 arg1
= cp_stabilize_reference (arg1
);
5128 arg2
= arg1
= prevent_lifetime_extension (arg1
);
5131 arg2
= arg1
= cp_save_expr (arg1
);
5134 /* If something has already gone wrong, just pass that fact up the
5136 if (error_operand_p (arg1
)
5137 || error_operand_p (arg2
)
5138 || error_operand_p (arg3
))
5139 return error_mark_node
;
5144 if (gnu_vector_type_p (TREE_TYPE (arg1
))
5145 && VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
5147 tree arg1_type
= TREE_TYPE (arg1
);
5149 /* If arg1 is another cond_expr choosing between -1 and 0,
5150 then we can use its comparison. It may help to avoid
5151 additional comparison, produce more accurate diagnostics
5152 and enables folding. */
5153 if (TREE_CODE (arg1
) == VEC_COND_EXPR
5154 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
5155 && integer_zerop (TREE_OPERAND (arg1
, 2)))
5156 arg1
= TREE_OPERAND (arg1
, 0);
5158 arg1
= force_rvalue (arg1
, complain
);
5159 arg2
= force_rvalue (arg2
, complain
);
5160 arg3
= force_rvalue (arg3
, complain
);
5162 /* force_rvalue can return error_mark on valid arguments. */
5163 if (error_operand_p (arg1
)
5164 || error_operand_p (arg2
)
5165 || error_operand_p (arg3
))
5166 return error_mark_node
;
5168 arg2_type
= TREE_TYPE (arg2
);
5169 arg3_type
= TREE_TYPE (arg3
);
5171 if (!VECTOR_TYPE_P (arg2_type
)
5172 && !VECTOR_TYPE_P (arg3_type
))
5174 /* Rely on the error messages of the scalar version. */
5175 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
5176 orig_arg2
, orig_arg3
, complain
);
5177 if (scal
== error_mark_node
)
5178 return error_mark_node
;
5179 tree stype
= TREE_TYPE (scal
);
5180 tree ctype
= TREE_TYPE (arg1_type
);
5181 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
5182 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
5184 if (complain
& tf_error
)
5185 error_at (loc
, "inferred scalar type %qT is not an integer or "
5186 "floating-point type of the same size as %qT", stype
,
5187 COMPARISON_CLASS_P (arg1
)
5188 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
5190 return error_mark_node
;
5193 tree vtype
= build_opaque_vector_type (stype
,
5194 TYPE_VECTOR_SUBPARTS (arg1_type
));
5195 /* We could pass complain & tf_warning to unsafe_conversion_p,
5196 but the warnings (like Wsign-conversion) have already been
5197 given by the scalar build_conditional_expr_1. We still check
5198 unsafe_conversion_p to forbid truncating long long -> float. */
5199 if (unsafe_conversion_p (stype
, arg2
, NULL_TREE
, false))
5201 if (complain
& tf_error
)
5202 error_at (loc
, "conversion of scalar %qH to vector %qI "
5203 "involves truncation", arg2_type
, vtype
);
5204 return error_mark_node
;
5206 if (unsafe_conversion_p (stype
, arg3
, NULL_TREE
, false))
5208 if (complain
& tf_error
)
5209 error_at (loc
, "conversion of scalar %qH to vector %qI "
5210 "involves truncation", arg3_type
, vtype
);
5211 return error_mark_node
;
5214 arg2
= cp_convert (stype
, arg2
, complain
);
5215 arg2
= save_expr (arg2
);
5216 arg2
= build_vector_from_val (vtype
, arg2
);
5218 arg3
= cp_convert (stype
, arg3
, complain
);
5219 arg3
= save_expr (arg3
);
5220 arg3
= build_vector_from_val (vtype
, arg3
);
5224 if ((gnu_vector_type_p (arg2_type
) && !VECTOR_TYPE_P (arg3_type
))
5225 || (gnu_vector_type_p (arg3_type
) && !VECTOR_TYPE_P (arg2_type
)))
5227 enum stv_conv convert_flag
=
5228 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
5229 complain
& tf_error
);
5231 switch (convert_flag
)
5234 return error_mark_node
;
5237 arg2
= save_expr (arg2
);
5238 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
5239 arg2
= build_vector_from_val (arg3_type
, arg2
);
5240 arg2_type
= TREE_TYPE (arg2
);
5245 arg3
= save_expr (arg3
);
5246 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
5247 arg3
= build_vector_from_val (arg2_type
, arg3
);
5248 arg3_type
= TREE_TYPE (arg3
);
5256 if (!gnu_vector_type_p (arg2_type
)
5257 || !gnu_vector_type_p (arg3_type
)
5258 || !same_type_p (arg2_type
, arg3_type
)
5259 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type
),
5260 TYPE_VECTOR_SUBPARTS (arg2_type
))
5261 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
5263 if (complain
& tf_error
)
5265 "incompatible vector types in conditional expression: "
5266 "%qT, %qT and %qT", TREE_TYPE (arg1
),
5267 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
5268 return error_mark_node
;
5271 if (!COMPARISON_CLASS_P (arg1
))
5273 tree cmp_type
= truth_type_for (arg1_type
);
5274 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
5276 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
5281 The first expression is implicitly converted to bool (clause
5283 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
5285 if (error_operand_p (arg1
))
5286 return error_mark_node
;
5290 If either the second or the third operand has type (possibly
5291 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
5292 array-to-pointer (_conv.array_), and function-to-pointer
5293 (_conv.func_) standard conversions are performed on the second
5294 and third operands. */
5295 arg2_type
= unlowered_expr_type (arg2
);
5296 arg3_type
= unlowered_expr_type (arg3
);
5297 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
5299 /* 'void' won't help in resolving an overloaded expression on the
5300 other side, so require it to resolve by itself. */
5301 if (arg2_type
== unknown_type_node
)
5303 arg2
= resolve_nondeduced_context_or_error (arg2
, complain
);
5304 arg2_type
= TREE_TYPE (arg2
);
5306 if (arg3_type
== unknown_type_node
)
5308 arg3
= resolve_nondeduced_context_or_error (arg3
, complain
);
5309 arg3_type
= TREE_TYPE (arg3
);
5314 One of the following shall hold:
5316 --The second or the third operand (but not both) is a
5317 throw-expression (_except.throw_); the result is of the type
5318 and value category of the other.
5320 --Both the second and the third operands have type void; the
5321 result is of type void and is a prvalue. */
5322 if (TREE_CODE (arg2
) == THROW_EXPR
5323 && TREE_CODE (arg3
) != THROW_EXPR
)
5325 result_type
= arg3_type
;
5326 is_glvalue
= glvalue_p (arg3
);
5328 else if (TREE_CODE (arg2
) != THROW_EXPR
5329 && TREE_CODE (arg3
) == THROW_EXPR
)
5331 result_type
= arg2_type
;
5332 is_glvalue
= glvalue_p (arg2
);
5334 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
5336 result_type
= void_type_node
;
5341 if (complain
& tf_error
)
5343 if (VOID_TYPE_P (arg2_type
))
5344 error_at (cp_expr_loc_or_loc (arg3
, loc
),
5345 "second operand to the conditional operator "
5346 "is of type %<void%>, but the third operand is "
5347 "neither a throw-expression nor of type %<void%>");
5349 error_at (cp_expr_loc_or_loc (arg2
, loc
),
5350 "third operand to the conditional operator "
5351 "is of type %<void%>, but the second operand is "
5352 "neither a throw-expression nor of type %<void%>");
5354 return error_mark_node
;
5357 goto valid_operands
;
5361 Otherwise, if the second and third operand have different types,
5362 and either has (possibly cv-qualified) class type, or if both are
5363 glvalues of the same value category and the same type except for
5364 cv-qualification, an attempt is made to convert each of those operands
5365 to the type of the other. */
5366 else if (!same_type_p (arg2_type
, arg3_type
)
5367 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
5368 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
5370 && glvalue_p (arg2
) && glvalue_p (arg3
)
5371 && lvalue_p (arg2
) == lvalue_p (arg3
))))
5375 bool converted
= false;
5377 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5378 p
= conversion_obstack_alloc (0);
5380 conv2
= conditional_conversion (arg2
, arg3
, complain
);
5381 conv3
= conditional_conversion (arg3
, arg2
, complain
);
5385 If both can be converted, or one can be converted but the
5386 conversion is ambiguous, the program is ill-formed. If
5387 neither can be converted, the operands are left unchanged and
5388 further checking is performed as described below. If exactly
5389 one conversion is possible, that conversion is applied to the
5390 chosen operand and the converted operand is used in place of
5391 the original operand for the remainder of this section. */
5392 if ((conv2
&& !conv2
->bad_p
5393 && conv3
&& !conv3
->bad_p
)
5394 || (conv2
&& conv2
->kind
== ck_ambig
)
5395 || (conv3
&& conv3
->kind
== ck_ambig
))
5397 if (complain
& tf_error
)
5399 error_at (loc
, "operands to %<?:%> have different types "
5401 arg2_type
, arg3_type
);
5402 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
5403 inform (loc
, " and each type can be converted to the other");
5404 else if (conv2
&& conv2
->kind
== ck_ambig
)
5405 convert_like (conv2
, arg2
, complain
);
5407 convert_like (conv3
, arg3
, complain
);
5409 result
= error_mark_node
;
5411 else if (conv2
&& !conv2
->bad_p
)
5413 arg2
= convert_like (conv2
, arg2
, complain
);
5414 arg2
= convert_from_reference (arg2
);
5415 arg2_type
= TREE_TYPE (arg2
);
5416 /* Even if CONV2 is a valid conversion, the result of the
5417 conversion may be invalid. For example, if ARG3 has type
5418 "volatile X", and X does not have a copy constructor
5419 accepting a "volatile X&", then even if ARG2 can be
5420 converted to X, the conversion will fail. */
5421 if (error_operand_p (arg2
))
5422 result
= error_mark_node
;
5425 else if (conv3
&& !conv3
->bad_p
)
5427 arg3
= convert_like (conv3
, arg3
, complain
);
5428 arg3
= convert_from_reference (arg3
);
5429 arg3_type
= TREE_TYPE (arg3
);
5430 if (error_operand_p (arg3
))
5431 result
= error_mark_node
;
5435 /* Free all the conversions we allocated. */
5436 obstack_free (&conversion_obstack
, p
);
5441 /* If, after the conversion, both operands have class type,
5442 treat the cv-qualification of both operands as if it were the
5443 union of the cv-qualification of the operands.
5445 The standard is not clear about what to do in this
5446 circumstance. For example, if the first operand has type
5447 "const X" and the second operand has a user-defined
5448 conversion to "volatile X", what is the type of the second
5449 operand after this step? Making it be "const X" (matching
5450 the first operand) seems wrong, as that discards the
5451 qualification without actually performing a copy. Leaving it
5452 as "volatile X" seems wrong as that will result in the
5453 conditional expression failing altogether, even though,
5454 according to this step, the one operand could be converted to
5455 the type of the other. */
5457 && CLASS_TYPE_P (arg2_type
)
5458 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
5459 arg2_type
= arg3_type
=
5460 cp_build_qualified_type (arg2_type
,
5461 cp_type_quals (arg2_type
)
5462 | cp_type_quals (arg3_type
));
5467 If the second and third operands are glvalues of the same value
5468 category and have the same type, the result is of that type and
5470 if (((lvalue_p (arg2
) && lvalue_p (arg3
))
5471 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
5472 && same_type_p (arg2_type
, arg3_type
))
5474 result_type
= arg2_type
;
5475 arg2
= mark_lvalue_use (arg2
);
5476 arg3
= mark_lvalue_use (arg3
);
5477 goto valid_operands
;
5482 Otherwise, the result is an rvalue. If the second and third
5483 operand do not have the same type, and either has (possibly
5484 cv-qualified) class type, overload resolution is used to
5485 determine the conversions (if any) to be applied to the operands
5486 (_over.match.oper_, _over.built_). */
5488 if (!same_type_p (arg2_type
, arg3_type
)
5489 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5495 /* Rearrange the arguments so that add_builtin_candidate only has
5496 to know about two args. In build_builtin_candidate, the
5497 arguments are unscrambled. */
5498 args
->quick_push (arg2
);
5499 args
->quick_push (arg3
);
5500 args
->quick_push (arg1
);
5501 add_builtin_candidates (&candidates
,
5504 ovl_op_identifier (false, COND_EXPR
),
5506 LOOKUP_NORMAL
, complain
);
5510 If the overload resolution fails, the program is
5512 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5515 if (complain
& tf_error
)
5516 error_at (loc
, "operands to %<?:%> have different types %qT and %qT",
5517 arg2_type
, arg3_type
);
5518 return error_mark_node
;
5520 cand
= tourney (candidates
, complain
);
5523 if (complain
& tf_error
)
5525 auto_diagnostic_group d
;
5526 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5527 print_z_candidates (loc
, candidates
);
5529 return error_mark_node
;
5534 Otherwise, the conversions thus determined are applied, and
5535 the converted operands are used in place of the original
5536 operands for the remainder of this section. */
5537 conv
= cand
->convs
[0];
5538 arg1
= convert_like (conv
, arg1
, complain
);
5539 conv
= cand
->convs
[1];
5540 arg2
= convert_like (conv
, arg2
, complain
);
5541 arg2_type
= TREE_TYPE (arg2
);
5542 conv
= cand
->convs
[2];
5543 arg3
= convert_like (conv
, arg3
, complain
);
5544 arg3_type
= TREE_TYPE (arg3
);
5549 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5550 and function-to-pointer (_conv.func_) standard conversions are
5551 performed on the second and third operands.
5553 We need to force the lvalue-to-rvalue conversion here for class types,
5554 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5555 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5558 arg2
= force_rvalue (arg2
, complain
);
5559 if (!CLASS_TYPE_P (arg2_type
))
5560 arg2_type
= TREE_TYPE (arg2
);
5562 arg3
= force_rvalue (arg3
, complain
);
5563 if (!CLASS_TYPE_P (arg3_type
))
5564 arg3_type
= TREE_TYPE (arg3
);
5566 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5567 return error_mark_node
;
5571 After those conversions, one of the following shall hold:
5573 --The second and third operands have the same type; the result is of
5575 if (same_type_p (arg2_type
, arg3_type
))
5576 result_type
= arg2_type
;
5579 --The second and third operands have arithmetic or enumeration
5580 type; the usual arithmetic conversions are performed to bring
5581 them to a common type, and the result is of that type. */
5582 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5583 || UNSCOPED_ENUM_P (arg2_type
))
5584 && (ARITHMETIC_TYPE_P (arg3_type
)
5585 || UNSCOPED_ENUM_P (arg3_type
)))
5587 /* In this case, there is always a common type. */
5588 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5590 if (complain
& tf_warning
)
5591 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5592 "implicit conversion from %qH to %qI to "
5593 "match other result of conditional",
5596 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5597 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5599 tree stripped_orig_arg2
= tree_strip_any_location_wrapper (orig_arg2
);
5600 tree stripped_orig_arg3
= tree_strip_any_location_wrapper (orig_arg3
);
5601 if (TREE_CODE (stripped_orig_arg2
) == CONST_DECL
5602 && TREE_CODE (stripped_orig_arg3
) == CONST_DECL
5603 && (DECL_CONTEXT (stripped_orig_arg2
)
5604 == DECL_CONTEXT (stripped_orig_arg3
)))
5605 /* Two enumerators from the same enumeration can have different
5606 types when the enumeration is still being defined. */;
5607 else if (complain
& tf_warning
)
5608 warning_at (loc
, OPT_Wenum_compare
, "enumerated mismatch "
5609 "in conditional expression: %qT vs %qT",
5610 arg2_type
, arg3_type
);
5612 else if (extra_warnings
5613 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5614 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5615 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5616 && !same_type_p (arg2_type
,
5617 type_promotes_to (arg3_type
)))))
5619 if (complain
& tf_warning
)
5620 warning_at (loc
, OPT_Wextra
, "enumerated and non-enumerated "
5621 "type in conditional expression");
5624 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5625 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5629 --The second and third operands have pointer type, or one has
5630 pointer type and the other is a null pointer constant; pointer
5631 conversions (_conv.ptr_) and qualification conversions
5632 (_conv.qual_) are performed to bring them to their composite
5633 pointer type (_expr.rel_). The result is of the composite
5636 --The second and third operands have pointer to member type, or
5637 one has pointer to member type and the other is a null pointer
5638 constant; pointer to member conversions (_conv.mem_) and
5639 qualification conversions (_conv.qual_) are performed to bring
5640 them to a common type, whose cv-qualification shall match the
5641 cv-qualification of either the second or the third operand.
5642 The result is of the common type. */
5643 else if ((null_ptr_cst_p (arg2
)
5644 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5645 || (null_ptr_cst_p (arg3
)
5646 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5647 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5648 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5649 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5651 result_type
= composite_pointer_type (loc
,
5652 arg2_type
, arg3_type
, arg2
,
5653 arg3
, CPO_CONDITIONAL_EXPR
,
5655 if (result_type
== error_mark_node
)
5656 return error_mark_node
;
5657 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5658 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5663 if (complain
& tf_error
)
5664 error_at (loc
, "operands to %<?:%> have different types %qT and %qT",
5665 arg2_type
, arg3_type
);
5666 return error_mark_node
;
5669 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5670 return error_mark_node
;
5673 if (processing_template_decl
&& is_glvalue
)
5675 /* Let lvalue_kind know this was a glvalue. */
5676 tree arg
= (result_type
== arg2_type
? arg2
: arg3
);
5677 result_type
= cp_build_reference_type (result_type
, xvalue_p (arg
));
5680 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5682 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5683 warn here, because the COND_EXPR will be turned into ARG2. */
5684 if (warn_duplicated_branches
5685 && (complain
& tf_warning
)
5686 && (arg2
== arg3
|| operand_equal_p (arg2
, arg3
, 0)))
5687 warning_at (EXPR_LOCATION (result
), OPT_Wduplicated_branches
,
5688 "this condition has identical branches");
5690 /* We can't use result_type below, as fold might have returned a
5695 /* Expand both sides into the same slot, hopefully the target of
5696 the ?: expression. We used to check for TARGET_EXPRs here,
5697 but now we sometimes wrap them in NOP_EXPRs so the test would
5699 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5700 result
= get_target_expr_sfinae (result
, complain
);
5701 /* If this expression is an rvalue, but might be mistaken for an
5702 lvalue, we must add a NON_LVALUE_EXPR. */
5703 result
= rvalue (result
);
5706 result
= force_paren_expr (result
);
5711 /* Wrapper for above. */
5714 build_conditional_expr (const op_location_t
&loc
,
5715 tree arg1
, tree arg2
, tree arg3
,
5716 tsubst_flags_t complain
)
5719 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5720 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5721 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5725 /* OPERAND is an operand to an expression. Perform necessary steps
5726 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5730 prep_operand (tree operand
)
5734 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5735 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5736 /* Make sure the template type is instantiated now. */
5737 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5743 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5744 OVERLOAD) to the CANDIDATES, returning an updated list of
5745 CANDIDATES. The ARGS are the arguments provided to the call;
5746 if FIRST_ARG is non-null it is the implicit object argument,
5747 otherwise the first element of ARGS is used if needed. The
5748 EXPLICIT_TARGS are explicit template arguments provided.
5749 TEMPLATE_ONLY is true if only template functions should be
5750 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5751 add_function_candidate. */
5754 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5756 tree explicit_targs
, bool template_only
,
5757 tree conversion_path
, tree access_path
,
5759 struct z_candidate
**candidates
,
5760 tsubst_flags_t complain
)
5763 const vec
<tree
, va_gc
> *non_static_args
;
5764 bool check_list_ctor
= false;
5765 bool check_converting
= false;
5766 unification_kind_t strict
;
5771 /* Precalculate special handling of constructors and conversion ops. */
5772 tree fn
= OVL_FIRST (fns
);
5773 if (DECL_CONV_FN_P (fn
))
5775 check_list_ctor
= false;
5776 check_converting
= (flags
& LOOKUP_ONLYCONVERTING
) != 0;
5777 if (flags
& LOOKUP_NO_CONVERSION
)
5778 /* We're doing return_type(x). */
5779 strict
= DEDUCE_CONV
;
5781 /* We're doing x.operator return_type(). */
5782 strict
= DEDUCE_EXACT
;
5783 /* [over.match.funcs] For conversion functions, the function
5784 is considered to be a member of the class of the implicit
5785 object argument for the purpose of defining the type of
5786 the implicit object parameter. */
5787 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5791 if (DECL_CONSTRUCTOR_P (fn
))
5793 check_list_ctor
= (flags
& LOOKUP_LIST_ONLY
) != 0;
5794 /* For list-initialization we consider explicit constructors
5795 and complain if one is chosen. */
5797 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5798 == LOOKUP_ONLYCONVERTING
);
5800 strict
= DEDUCE_CALL
;
5801 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5805 non_static_args
= args
;
5807 /* Delay creating the implicit this parameter until it is needed. */
5808 non_static_args
= NULL
;
5810 for (lkp_iterator
iter (fns
); iter
; ++iter
)
5814 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5816 if (check_list_ctor
&& !is_list_ctor (fn
))
5819 tree fn_first_arg
= NULL_TREE
;
5820 const vec
<tree
, va_gc
> *fn_args
= args
;
5822 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5824 /* Figure out where the object arg comes from. If this
5825 function is a non-static member and we didn't get an
5826 implicit object argument, move it out of args. */
5827 if (first_arg
== NULL_TREE
)
5831 vec
<tree
, va_gc
> *tempvec
;
5832 vec_alloc (tempvec
, args
->length () - 1);
5833 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5834 tempvec
->quick_push (arg
);
5835 non_static_args
= tempvec
;
5836 first_arg
= (*args
)[0];
5839 fn_first_arg
= first_arg
;
5840 fn_args
= non_static_args
;
5843 /* Don't bother reversing an operator with two identical parameters. */
5844 else if (args
->length () == 2 && (flags
& LOOKUP_REVERSED
))
5846 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5847 if (same_type_p (TREE_VALUE (parmlist
),
5848 TREE_VALUE (TREE_CHAIN (parmlist
))))
5852 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5853 add_template_candidate (candidates
,
5865 else if (!template_only
)
5866 add_function_candidate (candidates
,
5879 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5880 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5883 op_is_ordered (tree_code code
)
5889 return (flag_strong_eval_order
> 1 ? -1 : 0);
5893 return (flag_strong_eval_order
> 1 ? 1 : 0);
5896 // Not overloadable (yet).
5898 // Only one argument.
5905 return (flag_strong_eval_order
? 1 : 0);
5912 /* Subroutine of build_new_op_1: Add to CANDIDATES all candidates for the
5913 operator indicated by CODE/CODE2. This function calls itself recursively to
5914 handle C++20 rewritten comparison operator candidates. */
5917 add_operator_candidates (z_candidate
**candidates
,
5918 tree_code code
, tree_code code2
,
5919 vec
<tree
, va_gc
> *arglist
,
5920 int flags
, tsubst_flags_t complain
)
5922 z_candidate
*start_candidates
= *candidates
;
5923 bool ismodop
= code2
!= ERROR_MARK
;
5924 tree fnname
= ovl_op_identifier (ismodop
, ismodop
? code2
: code
);
5926 /* LOOKUP_REWRITTEN is set when we're looking for the == or <=> operator to
5927 rewrite from, and also when we're looking for the e.g. < operator to use
5928 on the result of <=>. In the latter case, we don't want the flag set in
5929 the candidate, we just want to suppress looking for rewrites. */
5930 bool rewritten
= (flags
& LOOKUP_REWRITTEN
);
5931 if (rewritten
&& code
!= EQ_EXPR
&& code
!= SPACESHIP_EXPR
)
5932 flags
&= ~LOOKUP_REWRITTEN
;
5934 bool memonly
= false;
5937 /* =, ->, [], () must be non-static member functions. */
5939 if (code2
!= NOP_EXPR
)
5951 /* Add namespace-scope operators to the list of functions to
5955 tree fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/true, 0, 0);
5956 fns
= lookup_arg_dependent (fnname
, fns
, arglist
);
5957 add_candidates (fns
, NULL_TREE
, arglist
, NULL_TREE
,
5958 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5959 flags
, candidates
, complain
);
5962 /* Add class-member operators to the candidate set. */
5963 tree arg1_type
= TREE_TYPE ((*arglist
)[0]);
5964 unsigned nargs
= arglist
->length () > 1 ? 2 : 1;
5965 tree arg2_type
= nargs
> 1 ? TREE_TYPE ((*arglist
)[1]) : NULL_TREE
;
5966 if (CLASS_TYPE_P (arg1_type
))
5968 tree fns
= lookup_fnfields (arg1_type
, fnname
, 1);
5969 if (fns
== error_mark_node
)
5970 return error_mark_node
;
5972 add_candidates (BASELINK_FUNCTIONS (fns
),
5973 NULL_TREE
, arglist
, NULL_TREE
,
5975 BASELINK_BINFO (fns
),
5976 BASELINK_ACCESS_BINFO (fns
),
5977 flags
, candidates
, complain
);
5979 /* Per [over.match.oper]3.2, if no operand has a class type, then
5980 only non-member functions that have type T1 or reference to
5981 cv-qualified-opt T1 for the first argument, if the first argument
5982 has an enumeration type, or T2 or reference to cv-qualified-opt
5983 T2 for the second argument, if the second argument has an
5984 enumeration type. Filter out those that don't match. */
5985 else if (! arg2_type
|| ! CLASS_TYPE_P (arg2_type
))
5987 struct z_candidate
**candp
, **next
;
5989 for (candp
= candidates
; *candp
!= start_candidates
; candp
= next
)
5992 z_candidate
*cand
= *candp
;
5995 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5997 for (i
= 0; i
< nargs
; ++i
)
5999 tree parmtype
= TREE_VALUE (parmlist
);
6000 tree argtype
= unlowered_expr_type ((*arglist
)[i
]);
6002 if (TYPE_REF_P (parmtype
))
6003 parmtype
= TREE_TYPE (parmtype
);
6004 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
6005 && (same_type_ignoring_top_level_qualifiers_p
6006 (argtype
, parmtype
)))
6009 parmlist
= TREE_CHAIN (parmlist
);
6012 /* No argument has an appropriate type, so remove this
6013 candidate function from the list. */
6016 *candp
= cand
->next
;
6024 /* The standard says to rewrite built-in candidates, too,
6025 but there's no point. */
6026 add_builtin_candidates (candidates
, code
, code2
, fnname
, arglist
,
6029 /* Maybe add C++20 rewritten comparison candidates. */
6030 tree_code rewrite_code
= ERROR_MARK
;
6031 if (cxx_dialect
>= cxx2a
6033 && (OVERLOAD_TYPE_P (arg1_type
) || OVERLOAD_TYPE_P (arg2_type
)))
6040 case SPACESHIP_EXPR
:
6041 rewrite_code
= SPACESHIP_EXPR
;
6046 rewrite_code
= EQ_EXPR
;
6054 flags
|= LOOKUP_REWRITTEN
;
6055 if (rewrite_code
!= code
)
6056 /* Add rewritten candidates in same order. */
6057 add_operator_candidates (candidates
, rewrite_code
, ERROR_MARK
,
6058 arglist
, flags
, complain
);
6060 z_candidate
*save_cand
= *candidates
;
6062 /* Add rewritten candidates in reverse order. */
6063 flags
|= LOOKUP_REVERSED
;
6064 vec
<tree
,va_gc
> *revlist
= make_tree_vector ();
6065 revlist
->quick_push ((*arglist
)[1]);
6066 revlist
->quick_push ((*arglist
)[0]);
6067 add_operator_candidates (candidates
, rewrite_code
, ERROR_MARK
,
6068 revlist
, flags
, complain
);
6070 /* Release the vec if we didn't add a candidate that uses it. */
6071 for (z_candidate
*c
= *candidates
; c
!= save_cand
; c
= c
->next
)
6072 if (c
->args
== revlist
)
6077 release_tree_vector (revlist
);
6085 build_new_op_1 (const op_location_t
&loc
, enum tree_code code
, int flags
,
6086 tree arg1
, tree arg2
, tree arg3
, tree
*overload
,
6087 tsubst_flags_t complain
)
6089 struct z_candidate
*candidates
= 0, *cand
;
6090 vec
<tree
, va_gc
> *arglist
;
6091 tree result
= NULL_TREE
;
6092 bool result_valid_p
= false;
6093 enum tree_code code2
= ERROR_MARK
;
6094 enum tree_code code_orig_arg1
= ERROR_MARK
;
6095 enum tree_code code_orig_arg2
= ERROR_MARK
;
6101 if (error_operand_p (arg1
)
6102 || error_operand_p (arg2
)
6103 || error_operand_p (arg3
))
6104 return error_mark_node
;
6106 bool ismodop
= code
== MODIFY_EXPR
;
6109 code2
= TREE_CODE (arg3
);
6113 tree arg1_type
= unlowered_expr_type (arg1
);
6114 tree arg2_type
= arg2
? unlowered_expr_type (arg2
) : NULL_TREE
;
6116 arg1
= prep_operand (arg1
);
6122 case VEC_DELETE_EXPR
:
6124 /* Use build_op_new_call and build_op_delete_call instead. */
6128 /* Use build_op_call instead. */
6131 case TRUTH_ORIF_EXPR
:
6132 case TRUTH_ANDIF_EXPR
:
6133 case TRUTH_AND_EXPR
:
6135 /* These are saved for the sake of warn_logical_operator. */
6136 code_orig_arg1
= TREE_CODE (arg1
);
6137 code_orig_arg2
= TREE_CODE (arg2
);
6145 /* These are saved for the sake of maybe_warn_bool_compare. */
6146 code_orig_arg1
= TREE_CODE (arg1_type
);
6147 code_orig_arg2
= TREE_CODE (arg2_type
);
6154 arg2
= prep_operand (arg2
);
6155 arg3
= prep_operand (arg3
);
6157 if (code
== COND_EXPR
)
6158 /* Use build_conditional_expr instead. */
6160 else if (! OVERLOAD_TYPE_P (arg1_type
)
6161 && (! arg2
|| ! OVERLOAD_TYPE_P (arg2_type
)))
6164 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
6166 arg2
= integer_zero_node
;
6167 arg2_type
= integer_type_node
;
6170 vec_alloc (arglist
, 3);
6171 arglist
->quick_push (arg1
);
6172 if (arg2
!= NULL_TREE
)
6173 arglist
->quick_push (arg2
);
6174 if (arg3
!= NULL_TREE
)
6175 arglist
->quick_push (arg3
);
6177 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6178 p
= conversion_obstack_alloc (0);
6180 result
= add_operator_candidates (&candidates
, code
, code2
, arglist
,
6182 if (result
== error_mark_node
)
6183 goto user_defined_result_ready
;
6189 /* For these, the built-in candidates set is empty
6190 [over.match.oper]/3. We don't want non-strict matches
6191 because exact matches are always possible with built-in
6192 operators. The built-in candidate set for COMPONENT_REF
6193 would be empty too, but since there are no such built-in
6194 operators, we accept non-strict matches for them. */
6203 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
6208 case POSTINCREMENT_EXPR
:
6209 case POSTDECREMENT_EXPR
:
6210 /* Don't try anything fancy if we're not allowed to produce
6212 if (!(complain
& tf_error
))
6213 return error_mark_node
;
6215 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
6216 distinguish between prefix and postfix ++ and
6217 operator++() was used for both, so we allow this with
6221 tree fnname
= ovl_op_identifier (ismodop
, ismodop
? code2
: code
);
6222 const char *msg
= (flag_permissive
)
6223 ? G_("no %<%D(int)%> declared for postfix %qs,"
6224 " trying prefix operator instead")
6225 : G_("no %<%D(int)%> declared for postfix %qs");
6226 permerror (loc
, msg
, fnname
, OVL_OP_INFO (false, code
)->name
);
6229 if (!flag_permissive
)
6230 return error_mark_node
;
6232 if (code
== POSTINCREMENT_EXPR
)
6233 code
= PREINCREMENT_EXPR
;
6235 code
= PREDECREMENT_EXPR
;
6236 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
6237 NULL_TREE
, overload
, complain
);
6240 /* The caller will deal with these. */
6246 result_valid_p
= true;
6250 if (complain
& tf_error
)
6252 /* If one of the arguments of the operator represents
6253 an invalid use of member function pointer, try to report
6254 a meaningful error ... */
6255 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
6256 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
6257 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
6258 /* We displayed the error message. */;
6261 /* ... Otherwise, report the more generic
6262 "no matching operator found" error */
6263 auto_diagnostic_group d
;
6264 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
6265 print_z_candidates (loc
, candidates
);
6268 result
= error_mark_node
;
6274 cand
= tourney (candidates
, complain
);
6277 if (complain
& tf_error
)
6279 auto_diagnostic_group d
;
6280 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
6281 print_z_candidates (loc
, candidates
);
6283 result
= error_mark_node
;
6285 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
6288 *overload
= cand
->fn
;
6290 if (resolve_args (arglist
, complain
) == NULL
)
6291 result
= error_mark_node
;
6294 tsubst_flags_t ocomplain
= complain
;
6295 if (cand
->rewritten ())
6296 /* We'll wrap this call in another one. */
6297 ocomplain
&= ~tf_decltype
;
6298 if (cand
->reversed ())
6300 /* We swapped these in add_candidate, swap them back now. */
6301 std::swap (cand
->convs
[0], cand
->convs
[1]);
6302 if (cand
->fn
== current_function_decl
)
6303 warning_at (loc
, 0, "in C++20 this comparison calls the "
6304 "current function recursively with reversed "
6307 result
= build_over_call (cand
, LOOKUP_NORMAL
, ocomplain
);
6310 if (trivial_fn_p (cand
->fn
))
6311 /* There won't be a CALL_EXPR. */;
6312 else if (result
&& result
!= error_mark_node
)
6314 tree call
= extract_call_expr (result
);
6315 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
6317 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
6318 /* This prevents build_new_function_call from discarding this
6319 function during instantiation of the enclosing template. */
6320 KOENIG_LOOKUP_P (call
) = 1;
6322 /* Specify evaluation order as per P0145R2. */
6323 CALL_EXPR_ORDERED_ARGS (call
) = false;
6324 switch (op_is_ordered (code
))
6327 CALL_EXPR_REVERSE_ARGS (call
) = true;
6331 CALL_EXPR_ORDERED_ARGS (call
) = true;
6339 /* If this was a C++20 rewritten comparison, adjust the result. */
6340 if (cand
->rewritten ())
6342 /* FIXME build_min_non_dep_op_overload can't handle rewrites. */
6344 *overload
= NULL_TREE
;
6348 gcc_checking_assert (cand
->reversed ());
6351 /* If a rewritten operator== candidate is selected by
6352 overload resolution for an operator @, its return type
6353 shall be cv bool.... */
6354 if (TREE_CODE (TREE_TYPE (result
)) != BOOLEAN_TYPE
)
6356 if (complain
& tf_error
)
6358 auto_diagnostic_group d
;
6359 error_at (loc
, "return type of %qD is not %qs",
6361 inform (loc
, "used as rewritten candidate for "
6362 "comparison of %qT and %qT",
6363 arg1_type
, arg2_type
);
6365 result
= error_mark_node
;
6367 else if (code
== NE_EXPR
)
6368 /* !(y == x) or !(x == y) */
6369 result
= build1_loc (loc
, TRUTH_NOT_EXPR
,
6370 boolean_type_node
, result
);
6373 /* If a rewritten operator<=> candidate is selected by
6374 overload resolution for an operator @, x @ y is
6375 interpreted as 0 @ (y <=> x) if the selected candidate is
6376 a synthesized candidate with reversed order of parameters,
6377 or (x <=> y) @ 0 otherwise, using the selected rewritten
6378 operator<=> candidate. */
6379 case SPACESHIP_EXPR
:
6380 if (!cand
->reversed ())
6381 /* We're in the build_new_op call below for an outer
6382 reversed call; we don't need to do anything more. */
6391 tree rhs
= integer_zero_node
;
6392 if (cand
->reversed ())
6393 std::swap (lhs
, rhs
);
6394 result
= build_new_op (loc
, code
,
6395 LOOKUP_NORMAL
|LOOKUP_REWRITTEN
,
6396 lhs
, rhs
, NULL_TREE
,
6408 /* Give any warnings we noticed during overload resolution. */
6409 if (cand
->warnings
&& (complain
& tf_warning
))
6411 struct candidate_warning
*w
;
6412 for (w
= cand
->warnings
; w
; w
= w
->next
)
6413 joust (cand
, w
->loser
, 1, complain
);
6416 /* Check for comparison of different enum types. */
6425 if (TREE_CODE (arg1_type
) == ENUMERAL_TYPE
6426 && TREE_CODE (arg2_type
) == ENUMERAL_TYPE
6427 && (TYPE_MAIN_VARIANT (arg1_type
)
6428 != TYPE_MAIN_VARIANT (arg2_type
))
6429 && (complain
& tf_warning
))
6430 warning_at (loc
, OPT_Wenum_compare
,
6431 "comparison between %q#T and %q#T",
6432 arg1_type
, arg2_type
);
6438 /* "If a built-in candidate is selected by overload resolution, the
6439 operands of class type are converted to the types of the
6440 corresponding parameters of the selected operation function,
6441 except that the second standard conversion sequence of a
6442 user-defined conversion sequence (12.3.3.1.2) is not applied." */
6443 conv
= cand
->convs
[0];
6444 if (conv
->user_conv_p
)
6446 conv
= strip_standard_conversion (conv
);
6447 arg1
= convert_like (conv
, arg1
, complain
);
6452 conv
= cand
->convs
[1];
6453 if (conv
->user_conv_p
)
6455 conv
= strip_standard_conversion (conv
);
6456 arg2
= convert_like (conv
, arg2
, complain
);
6462 conv
= cand
->convs
[2];
6463 if (conv
->user_conv_p
)
6465 conv
= strip_standard_conversion (conv
);
6466 arg3
= convert_like (conv
, arg3
, complain
);
6472 user_defined_result_ready
:
6474 /* Free all the conversions we allocated. */
6475 obstack_free (&conversion_obstack
, p
);
6477 if (result
|| result_valid_p
)
6484 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
6487 return cp_build_indirect_ref (loc
, arg1
, RO_UNARY_STAR
, complain
);
6489 case TRUTH_ANDIF_EXPR
:
6490 case TRUTH_ORIF_EXPR
:
6491 case TRUTH_AND_EXPR
:
6493 if (complain
& tf_warning
)
6494 warn_logical_operator (loc
, code
, boolean_type_node
,
6495 code_orig_arg1
, arg1
,
6496 code_orig_arg2
, arg2
);
6504 if ((complain
& tf_warning
)
6505 && ((code_orig_arg1
== BOOLEAN_TYPE
)
6506 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
6507 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
6508 if (complain
& tf_warning
&& warn_tautological_compare
)
6509 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
6511 case SPACESHIP_EXPR
:
6515 case TRUNC_DIV_EXPR
:
6520 case TRUNC_MOD_EXPR
:
6524 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
6526 case UNARY_PLUS_EXPR
:
6529 case TRUTH_NOT_EXPR
:
6530 case PREINCREMENT_EXPR
:
6531 case POSTINCREMENT_EXPR
:
6532 case PREDECREMENT_EXPR
:
6533 case POSTDECREMENT_EXPR
:
6538 return cp_build_unary_op (code
, arg1
, false, complain
);
6541 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
6544 return build_m_component_ref (cp_build_indirect_ref (loc
, arg1
,
6549 /* The caller will deal with these. */
6561 /* Wrapper for above. */
6564 build_new_op (const op_location_t
&loc
, enum tree_code code
, int flags
,
6565 tree arg1
, tree arg2
, tree arg3
,
6566 tree
*overload
, tsubst_flags_t complain
)
6569 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
6570 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
6571 overload
, complain
);
6572 timevar_cond_stop (TV_OVERLOAD
, subtime
);
6576 /* CALL was returned by some call-building function; extract the actual
6577 CALL_EXPR from any bits that have been tacked on, e.g. by
6578 convert_from_reference. */
6581 extract_call_expr (tree call
)
6583 while (TREE_CODE (call
) == COMPOUND_EXPR
)
6584 call
= TREE_OPERAND (call
, 1);
6585 if (REFERENCE_REF_P (call
))
6586 call
= TREE_OPERAND (call
, 0);
6587 if (TREE_CODE (call
) == TARGET_EXPR
)
6588 call
= TARGET_EXPR_INITIAL (call
);
6589 if (cxx_dialect
>= cxx2a
)
6590 switch (TREE_CODE (call
))
6592 /* C++20 rewritten comparison operators. */
6593 case TRUTH_NOT_EXPR
:
6594 call
= TREE_OPERAND (call
, 0);
6600 case SPACESHIP_EXPR
:
6602 tree op0
= TREE_OPERAND (call
, 0);
6603 if (integer_zerop (op0
))
6604 call
= TREE_OPERAND (call
, 1);
6612 gcc_assert (TREE_CODE (call
) == CALL_EXPR
6613 || TREE_CODE (call
) == AGGR_INIT_EXPR
6614 || call
== error_mark_node
);
6618 /* Returns true if FN has two parameters, of which the second has type
6622 second_parm_is_size_t (tree fn
)
6624 tree t
= FUNCTION_ARG_CHAIN (fn
);
6625 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6628 if (t
== void_list_node
)
6633 /* True if T, an allocation function, has std::align_val_t as its second
6637 aligned_allocation_fn_p (tree t
)
6639 if (!aligned_new_threshold
)
6642 tree a
= FUNCTION_ARG_CHAIN (t
);
6643 return (a
&& same_type_p (TREE_VALUE (a
), align_type_node
));
6646 /* True if T is std::destroying_delete_t. */
6649 std_destroying_delete_t_p (tree t
)
6651 return (TYPE_CONTEXT (t
) == std_node
6652 && id_equal (TYPE_IDENTIFIER (t
), "destroying_delete_t"));
6655 /* A deallocation function with at least two parameters whose second parameter
6656 type is of type std::destroying_delete_t is a destroying operator delete. A
6657 destroying operator delete shall be a class member function named operator
6658 delete. [ Note: Array deletion cannot use a destroying operator
6659 delete. --end note ] */
6662 destroying_delete_p (tree t
)
6664 tree a
= TYPE_ARG_TYPES (TREE_TYPE (t
));
6665 if (!a
|| !TREE_CHAIN (a
))
6667 tree type
= TREE_VALUE (TREE_CHAIN (a
));
6668 return std_destroying_delete_t_p (type
) ? type
: NULL_TREE
;
6678 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6679 function (3.7.4.2 [basic.stc.dynamic.deallocation]). If so, and DI is
6680 non-null, also set *DI. */
6683 usual_deallocation_fn_p (tree t
, dealloc_info
*di
)
6685 if (di
) *di
= dealloc_info();
6687 /* A template instance is never a usual deallocation function,
6688 regardless of its signature. */
6689 if (TREE_CODE (t
) == TEMPLATE_DECL
6690 || primary_template_specialization_p (t
))
6693 /* A usual deallocation function is a deallocation function whose parameters
6695 - optionally, a parameter of type std::destroying_delete_t, then
6696 - optionally, a parameter of type std::size_t, then
6697 - optionally, a parameter of type std::align_val_t. */
6698 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
6699 tree chain
= FUNCTION_ARG_CHAIN (t
);
6700 if (chain
&& destroying_delete_p (t
))
6702 if (di
) di
->destroying
= TREE_VALUE (chain
);
6703 chain
= TREE_CHAIN (chain
);
6706 && (!global
|| flag_sized_deallocation
)
6707 && same_type_p (TREE_VALUE (chain
), size_type_node
))
6709 if (di
) di
->sized
= true;
6710 chain
= TREE_CHAIN (chain
);
6712 if (chain
&& aligned_new_threshold
6713 && same_type_p (TREE_VALUE (chain
), align_type_node
))
6715 if (di
) di
->aligned
= true;
6716 chain
= TREE_CHAIN (chain
);
6718 return (chain
== void_list_node
);
6721 /* Just return whether FN is a usual deallocation function. */
6724 usual_deallocation_fn_p (tree fn
)
6726 return usual_deallocation_fn_p (fn
, NULL
);
6729 /* Build a call to operator delete. This has to be handled very specially,
6730 because the restrictions on what signatures match are different from all
6731 other call instances. For a normal delete, only a delete taking (void *)
6732 or (void *, size_t) is accepted. For a placement delete, only an exact
6733 match with the placement new is accepted.
6735 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6736 ADDR is the pointer to be deleted.
6737 SIZE is the size of the memory block to be deleted.
6738 GLOBAL_P is true if the delete-expression should not consider
6739 class-specific delete operators.
6740 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6742 If this call to "operator delete" is being generated as part to
6743 deallocate memory allocated via a new-expression (as per [expr.new]
6744 which requires that if the initialization throws an exception then
6745 we call a deallocation function), then ALLOC_FN is the allocation
6749 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
6750 bool global_p
, tree placement
,
6751 tree alloc_fn
, tsubst_flags_t complain
)
6753 tree fn
= NULL_TREE
;
6754 tree fns
, fnname
, type
, t
;
6755 dealloc_info di_fn
= { };
6757 if (addr
== error_mark_node
)
6758 return error_mark_node
;
6760 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6762 fnname
= ovl_op_identifier (false, code
);
6764 if (CLASS_TYPE_P (type
)
6765 && COMPLETE_TYPE_P (complete_type (type
))
6769 If the result of the lookup is ambiguous or inaccessible, or if
6770 the lookup selects a placement deallocation function, the
6771 program is ill-formed.
6773 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6775 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6776 if (fns
== error_mark_node
)
6777 return error_mark_node
;
6782 if (fns
== NULL_TREE
)
6783 fns
= lookup_name_nonclass (fnname
);
6785 /* Strip const and volatile from addr. */
6787 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6791 /* "A declaration of a placement deallocation function matches the
6792 declaration of a placement allocation function if it has the same
6793 number of parameters and, after parameter transformations (8.3.5),
6794 all parameter types except the first are identical."
6796 So we build up the function type we want and ask instantiate_type
6797 to get it for us. */
6798 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6799 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6800 t
= build_function_type (void_type_node
, t
);
6802 fn
= instantiate_type (t
, fns
, tf_none
);
6803 if (fn
== error_mark_node
)
6806 fn
= MAYBE_BASELINK_FUNCTIONS (fn
);
6808 /* "If the lookup finds the two-parameter form of a usual deallocation
6809 function (3.7.4.2) and that function, considered as a placement
6810 deallocation function, would have been selected as a match for the
6811 allocation function, the program is ill-formed." */
6812 if (second_parm_is_size_t (fn
))
6814 const char *const msg1
6815 = G_("exception cleanup for this placement new selects "
6816 "non-placement %<operator delete%>");
6817 const char *const msg2
6818 = G_("%qD is a usual (non-placement) deallocation "
6819 "function in C++14 (or with %<-fsized-deallocation%>)");
6821 /* But if the class has an operator delete (void *), then that is
6822 the usual deallocation function, so we shouldn't complain
6823 about using the operator delete (void *, size_t). */
6824 if (DECL_CLASS_SCOPE_P (fn
))
6825 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
));
6829 if (usual_deallocation_fn_p (elt
)
6830 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6833 /* Before C++14 a two-parameter global deallocation function is
6834 always a placement deallocation function, but warn if
6836 else if (!flag_sized_deallocation
)
6838 if (complain
& tf_warning
)
6840 auto_diagnostic_group d
;
6841 if (warning (OPT_Wc__14_compat
, msg1
))
6842 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6847 if (complain
& tf_warning_or_error
)
6849 auto_diagnostic_group d
;
6850 if (permerror (input_location
, msg1
))
6852 /* Only mention C++14 for namespace-scope delete. */
6853 if (DECL_NAMESPACE_SCOPE_P (fn
))
6854 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6856 inform (DECL_SOURCE_LOCATION (fn
),
6857 "%qD is a usual (non-placement) deallocation "
6862 return error_mark_node
;
6867 /* "Any non-placement deallocation function matches a non-placement
6868 allocation function. If the lookup finds a single matching
6869 deallocation function, that function will be called; otherwise, no
6870 deallocation function will be called." */
6871 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
)); iter
; ++iter
)
6874 dealloc_info di_elt
;
6875 if (usual_deallocation_fn_p (elt
, &di_elt
))
6884 /* -- If any of the deallocation functions is a destroying
6885 operator delete, all deallocation functions that are not
6886 destroying operator deletes are eliminated from further
6888 if (di_elt
.destroying
!= di_fn
.destroying
)
6890 if (di_elt
.destroying
)
6898 /* -- If the type has new-extended alignment, a function with a
6899 parameter of type std::align_val_t is preferred; otherwise a
6900 function without such a parameter is preferred. If exactly one
6901 preferred function is found, that function is selected and the
6902 selection process terminates. If more than one preferred
6903 function is found, all non-preferred functions are eliminated
6904 from further consideration. */
6905 if (aligned_new_threshold
)
6907 bool want_align
= type_has_new_extended_alignment (type
);
6908 if (di_elt
.aligned
!= di_fn
.aligned
)
6910 if (want_align
== di_elt
.aligned
)
6919 /* -- If the deallocation functions have class scope, the one
6920 without a parameter of type std::size_t is selected. */
6922 if (DECL_CLASS_SCOPE_P (fn
))
6925 /* -- If the type is complete and if, for the second alternative
6926 (delete array) only, the operand is a pointer to a class type
6927 with a non-trivial destructor or a (possibly multi-dimensional)
6928 array thereof, the function with a parameter of type std::size_t
6931 -- Otherwise, it is unspecified whether a deallocation function
6932 with a parameter of type std::size_t is selected. */
6935 want_size
= COMPLETE_TYPE_P (type
);
6936 if (code
== VEC_DELETE_EXPR
6937 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6938 /* We need a cookie to determine the array size. */
6941 gcc_assert (di_fn
.sized
!= di_elt
.sized
);
6942 if (want_size
== di_elt
.sized
)
6950 /* If we have a matching function, call it. */
6953 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6955 /* If the FN is a member function, make sure that it is
6957 if (BASELINK_P (fns
))
6958 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6961 /* Core issue 901: It's ok to new a type with deleted delete. */
6962 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6967 /* The placement args might not be suitable for overload
6968 resolution at this point, so build the call directly. */
6969 int nargs
= call_expr_nargs (placement
);
6970 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6973 for (i
= 1; i
< nargs
; i
++)
6974 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6975 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6976 return error_mark_node
;
6977 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6981 tree destroying
= di_fn
.destroying
;
6984 /* Strip const and volatile from addr but retain the type of the
6986 tree rtype
= TREE_TYPE (TREE_TYPE (oaddr
));
6987 rtype
= cv_unqualified (rtype
);
6988 rtype
= TYPE_POINTER_TO (rtype
);
6989 addr
= cp_convert (rtype
, oaddr
, complain
);
6990 destroying
= build_functional_cast (input_location
,
6991 destroying
, NULL_TREE
,
6997 args
->quick_push (addr
);
6999 args
->quick_push (destroying
);
7001 args
->quick_push (size
);
7004 tree al
= build_int_cst (align_type_node
, TYPE_ALIGN_UNIT (type
));
7005 args
->quick_push (al
);
7007 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
7014 If no unambiguous matching deallocation function can be found,
7015 propagating the exception does not cause the object's memory to
7019 if ((complain
& tf_warning
)
7021 warning (0, "no corresponding deallocation function for %qD",
7026 if (complain
& tf_error
)
7027 error ("no suitable %<operator %s%> for %qT",
7028 OVL_OP_INFO (false, code
)->name
, type
);
7029 return error_mark_node
;
7032 /* Issue diagnostics about a disallowed access of DECL, using DIAG_DECL
7035 If ISSUE_ERROR is true, then issue an error about the
7036 access, followed by a note showing the declaration.
7037 Otherwise, just show the note. */
7040 complain_about_access (tree decl
, tree diag_decl
, bool issue_error
)
7042 if (TREE_PRIVATE (decl
))
7045 error ("%q#D is private within this context", diag_decl
);
7046 inform (DECL_SOURCE_LOCATION (diag_decl
),
7047 "declared private here");
7049 else if (TREE_PROTECTED (decl
))
7052 error ("%q#D is protected within this context", diag_decl
);
7053 inform (DECL_SOURCE_LOCATION (diag_decl
),
7054 "declared protected here");
7059 error ("%q#D is inaccessible within this context", diag_decl
);
7060 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
7064 /* If the current scope isn't allowed to access DECL along
7065 BASETYPE_PATH, give an error. The most derived class in
7066 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
7067 the declaration to use in the error diagnostic. */
7070 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
7071 tsubst_flags_t complain
, access_failure_info
*afi
)
7073 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
7075 if (flag_new_inheriting_ctors
7076 && DECL_INHERITED_CTOR (decl
))
7078 /* 7.3.3/18: The additional constructors are accessible if they would be
7079 accessible when used to construct an object of the corresponding base
7081 decl
= strip_inheriting_ctors (decl
);
7082 basetype_path
= lookup_base (basetype_path
, DECL_CONTEXT (decl
),
7083 ba_any
, NULL
, complain
);
7086 if (!accessible_p (basetype_path
, decl
, true))
7088 if (flag_new_inheriting_ctors
)
7089 diag_decl
= strip_inheriting_ctors (diag_decl
);
7090 if (complain
& tf_error
)
7091 complain_about_access (decl
, diag_decl
, true);
7093 afi
->record_access_failure (basetype_path
, decl
, diag_decl
);
7100 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
7101 bitwise or of LOOKUP_* values. If any errors are warnings are
7102 generated, set *DIAGNOSTIC_FN to "error" or "warning",
7103 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
7107 build_temp (tree expr
, tree type
, int flags
,
7108 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
7112 *diagnostic_kind
= DK_UNSPECIFIED
;
7114 /* If the source is a packed field, calling the copy constructor will require
7115 binding the field to the reference parameter to the copy constructor, and
7116 we'll end up with an infinite loop. If we can use a bitwise copy, then
7118 if ((lvalue_kind (expr
) & clk_packed
)
7119 && CLASS_TYPE_P (TREE_TYPE (expr
))
7120 && !type_has_nontrivial_copy_init (TREE_TYPE (expr
)))
7121 return get_target_expr_sfinae (expr
, complain
);
7123 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
7124 releasing_vec
args (make_tree_vector_single (expr
));
7125 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
7126 &args
, type
, flags
, complain
);
7127 if (warningcount
+ werrorcount
> savew
)
7128 *diagnostic_kind
= DK_WARNING
;
7129 else if (errorcount
> savee
)
7130 *diagnostic_kind
= DK_ERROR
;
7134 /* Get any location for EXPR, falling back to input_location.
7136 If the result is in a system header and is the virtual location for
7137 a token coming from the expansion of a macro, unwind it to the
7138 location of the expansion point of the macro (e.g. to avoid the
7139 diagnostic being suppressed for expansions of NULL where "NULL" is
7140 in a system header). */
7143 get_location_for_expr_unwinding_for_system_header (tree expr
)
7145 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
7146 loc
= expansion_point_location_if_in_system_header (loc
);
7150 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
7151 Also handle a subset of zero as null warnings.
7152 EXPR is implicitly converted to type TOTYPE.
7153 FN and ARGNUM are used for diagnostics. */
7156 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
7158 /* Issue warnings about peculiar, but valid, uses of NULL. */
7159 if (TREE_CODE (totype
) != BOOLEAN_TYPE
7160 && ARITHMETIC_TYPE_P (totype
)
7161 && null_node_p (expr
))
7163 location_t loc
= get_location_for_expr_unwinding_for_system_header (expr
);
7166 auto_diagnostic_group d
;
7167 if (warning_at (loc
, OPT_Wconversion_null
,
7168 "passing NULL to non-pointer argument %P of %qD",
7170 inform (get_fndecl_argument_location (fn
, argnum
),
7174 warning_at (loc
, OPT_Wconversion_null
,
7175 "converting to non-pointer type %qT from NULL", totype
);
7178 /* Issue warnings if "false" is converted to a NULL pointer */
7179 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
7180 && TYPE_PTR_P (totype
))
7182 location_t loc
= get_location_for_expr_unwinding_for_system_header (expr
);
7185 auto_diagnostic_group d
;
7186 if (warning_at (loc
, OPT_Wconversion_null
,
7187 "converting %<false%> to pointer type for argument "
7188 "%P of %qD", argnum
, fn
))
7189 inform (get_fndecl_argument_location (fn
, argnum
),
7193 warning_at (loc
, OPT_Wconversion_null
,
7194 "converting %<false%> to pointer type %qT", totype
);
7196 /* Handle zero as null pointer warnings for cases other
7197 than EQ_EXPR and NE_EXPR */
7198 else if ((TYPE_PTR_OR_PTRMEM_P (totype
) || NULLPTR_TYPE_P (totype
))
7199 && null_ptr_cst_p (expr
))
7201 location_t loc
= get_location_for_expr_unwinding_for_system_header (expr
);
7202 maybe_warn_zero_as_null_pointer_constant (expr
, loc
);
7206 /* We gave a diagnostic during a conversion. If this was in the second
7207 standard conversion sequence of a user-defined conversion sequence, say
7208 which user-defined conversion. */
7211 maybe_print_user_conv_context (conversion
*convs
)
7213 if (convs
->user_conv_p
)
7214 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
7215 if (t
->kind
== ck_user
)
7217 print_z_candidate (0, N_(" after user-defined conversion:"),
7223 /* Locate the parameter with the given index within FNDECL.
7224 ARGNUM is zero based, -1 indicates the `this' argument of a method.
7225 Return the location of the FNDECL itself if there are problems. */
7228 get_fndecl_argument_location (tree fndecl
, int argnum
)
7230 /* The locations of implicitly-declared functions are likely to be
7231 more meaningful than those of their parameters. */
7232 if (DECL_ARTIFICIAL (fndecl
))
7233 return DECL_SOURCE_LOCATION (fndecl
);
7238 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
7239 for (i
= 0, param
= FUNCTION_FIRST_USER_PARM (fndecl
);
7240 i
< argnum
&& param
;
7241 i
++, param
= TREE_CHAIN (param
))
7244 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
7245 return the location of FNDECL. */
7247 return DECL_SOURCE_LOCATION (fndecl
);
7249 return DECL_SOURCE_LOCATION (param
);
7252 /* If FNDECL is non-NULL, issue a note highlighting ARGNUM
7253 within its declaration (or the fndecl itself if something went
7257 maybe_inform_about_fndecl_for_bogus_argument_init (tree fn
, int argnum
)
7260 inform (get_fndecl_argument_location (fn
, argnum
),
7261 " initializing argument %P of %qD", argnum
, fn
);
7264 /* Maybe warn about C++20 Conversions to arrays of unknown bound. C is
7265 the conversion, EXPR is the expression we're converting. */
7268 maybe_warn_array_conv (location_t loc
, conversion
*c
, tree expr
)
7270 if (cxx_dialect
>= cxx2a
)
7273 tree type
= TREE_TYPE (expr
);
7274 type
= strip_pointer_operator (type
);
7276 if (TREE_CODE (type
) != ARRAY_TYPE
7277 || TYPE_DOMAIN (type
) == NULL_TREE
)
7280 if (conv_binds_to_array_of_unknown_bound (c
))
7281 pedwarn (loc
, OPT_Wpedantic
, "conversions to arrays of unknown bound "
7282 "are only available with %<-std=c++2a%> or %<-std=gnu++2a%>");
7285 /* Perform the conversions in CONVS on the expression EXPR. FN and
7286 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
7287 indicates the `this' argument of a method. INNER is nonzero when
7288 being called to continue a conversion chain. It is negative when a
7289 reference binding will be applied, positive otherwise. If
7290 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
7291 conversions will be emitted if appropriate. If C_CAST_P is true,
7292 this conversion is coming from a C-style cast; in that case,
7293 conversions to inaccessible bases are permitted. */
7296 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
7297 bool issue_conversion_warnings
,
7298 bool c_cast_p
, tsubst_flags_t complain
)
7300 tree totype
= convs
->type
;
7301 diagnostic_t diag_kind
;
7303 location_t loc
= cp_expr_loc_or_input_loc (expr
);
7305 if (convs
->bad_p
&& !(complain
& tf_error
))
7306 return error_mark_node
;
7309 && convs
->kind
!= ck_user
7310 && convs
->kind
!= ck_list
7311 && convs
->kind
!= ck_ambig
7312 && (convs
->kind
!= ck_ref_bind
7313 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
7314 && (convs
->kind
!= ck_rvalue
7315 || SCALAR_TYPE_P (totype
))
7316 && convs
->kind
!= ck_base
)
7318 bool complained
= false;
7319 conversion
*t
= convs
;
7321 /* Give a helpful error if this is bad because of excess braces. */
7322 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
7323 && SCALAR_TYPE_P (totype
)
7324 && CONSTRUCTOR_NELTS (expr
) > 0
7325 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
7327 complained
= permerror (loc
, "too many braces around initializer "
7329 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
7330 && CONSTRUCTOR_NELTS (expr
) == 1)
7331 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7334 /* Give a helpful error if this is bad because a conversion to bool
7335 from std::nullptr_t requires direct-initialization. */
7336 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
7337 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
7338 complained
= permerror (loc
, "converting to %qH from %qI requires "
7339 "direct-initialization",
7340 totype
, TREE_TYPE (expr
));
7342 for (; t
; t
= next_conversion (t
))
7344 if (t
->kind
== ck_user
&& t
->cand
->reason
)
7346 auto_diagnostic_group d
;
7347 complained
= permerror (loc
, "invalid user-defined conversion "
7348 "from %qH to %qI", TREE_TYPE (expr
),
7351 print_z_candidate (loc
, N_("candidate is:"), t
->cand
);
7352 expr
= convert_like_real (t
, expr
, fn
, argnum
,
7353 /*issue_conversion_warnings=*/false,
7356 if (convs
->kind
== ck_ref_bind
)
7357 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
7358 LOOKUP_NORMAL
, NULL_TREE
,
7361 expr
= cp_convert (totype
, expr
, complain
);
7363 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7366 else if (t
->kind
== ck_user
|| !t
->bad_p
)
7368 expr
= convert_like_real (t
, expr
, fn
, argnum
,
7369 /*issue_conversion_warnings=*/false,
7374 else if (t
->kind
== ck_ambig
)
7375 return convert_like_real (t
, expr
, fn
, argnum
,
7376 /*issue_conversion_warnings=*/false,
7379 else if (t
->kind
== ck_identity
)
7384 range_label_for_type_mismatch
label (TREE_TYPE (expr
), totype
);
7385 gcc_rich_location
richloc (loc
, &label
);
7386 complained
= permerror (&richloc
,
7387 "invalid conversion from %qH to %qI",
7388 TREE_TYPE (expr
), totype
);
7391 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7393 return cp_convert (totype
, expr
, complain
);
7396 if (issue_conversion_warnings
&& (complain
& tf_warning
))
7397 conversion_null_warnings (totype
, expr
, fn
, argnum
);
7399 /* Creating &TARGET_EXPR<> in a template breaks when substituting,
7400 and creating a CALL_EXPR in a template breaks in finish_call_expr
7401 so use an IMPLICIT_CONV_EXPR for this conversion. We would have
7402 created such codes e.g. when calling a user-defined conversion
7404 if (processing_template_decl
7405 && convs
->kind
!= ck_identity
7406 && (CLASS_TYPE_P (totype
) || CLASS_TYPE_P (TREE_TYPE (expr
))))
7408 expr
= build1 (IMPLICIT_CONV_EXPR
, totype
, expr
);
7409 return convs
->kind
== ck_ref_bind
? expr
: convert_from_reference (expr
);
7412 switch (convs
->kind
)
7416 struct z_candidate
*cand
= convs
->cand
;
7419 /* We chose the surrogate function from add_conv_candidate, now we
7420 actually need to build the conversion. */
7421 cand
= build_user_type_conversion_1 (totype
, expr
,
7422 LOOKUP_NO_CONVERSION
, complain
);
7424 tree convfn
= cand
->fn
;
7426 /* When converting from an init list we consider explicit
7427 constructors, but actually trying to call one is an error. */
7428 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
7429 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
7430 /* Unless this is for direct-list-initialization. */
7431 && (!CONSTRUCTOR_IS_DIRECT_INIT (expr
) || convs
->need_temporary_p
)
7432 /* And in C++98 a default constructor can't be explicit. */
7433 && cxx_dialect
>= cxx11
)
7435 if (!(complain
& tf_error
))
7436 return error_mark_node
;
7437 location_t loc
= location_of (expr
);
7438 if (CONSTRUCTOR_NELTS (expr
) == 0
7439 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
7441 auto_diagnostic_group d
;
7442 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
7443 "would use explicit constructor %qD",
7445 inform (loc
, "in C++11 and above a default constructor "
7449 error ("converting to %qT from initializer list would use "
7450 "explicit constructor %qD", totype
, convfn
);
7453 /* If we're initializing from {}, it's value-initialization. */
7454 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
7455 && CONSTRUCTOR_NELTS (expr
) == 0
7456 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
)
7457 && !processing_template_decl
)
7459 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
7460 if (abstract_virtuals_error_sfinae (NULL_TREE
, totype
, complain
))
7461 return error_mark_node
;
7462 expr
= build_value_init (totype
, complain
);
7463 expr
= get_target_expr_sfinae (expr
, complain
);
7464 if (expr
!= error_mark_node
)
7466 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7467 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
7472 /* We don't know here whether EXPR is being used as an lvalue or
7473 rvalue, but we know it's read. */
7474 mark_exp_read (expr
);
7476 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
7478 expr
= build_over_call (cand
, LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
,
7481 /* If this is a constructor or a function returning an aggr type,
7482 we need to build up a TARGET_EXPR. */
7483 if (DECL_CONSTRUCTOR_P (convfn
))
7485 expr
= build_cplus_new (totype
, expr
, complain
);
7487 /* Remember that this was list-initialization. */
7488 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
7489 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7495 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
7497 int nelts
= CONSTRUCTOR_NELTS (expr
);
7499 expr
= build_value_init (totype
, complain
);
7500 else if (nelts
== 1)
7501 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7505 expr
= mark_use (expr
, /*rvalue_p=*/!convs
->rvaluedness_matches_p
,
7506 /*read_p=*/true, UNKNOWN_LOCATION
,
7507 /*reject_builtin=*/true);
7509 if (type_unknown_p (expr
))
7510 expr
= instantiate_type (totype
, expr
, complain
);
7511 if (expr
== null_node
7512 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
7513 /* If __null has been converted to an integer type, we do not want to
7514 continue to warn about uses of EXPR as an integer, rather than as a
7516 expr
= build_int_cst (totype
, 0);
7519 /* We leave bad_p off ck_ambig because overload resolution considers
7520 it valid, it just fails when we try to perform it. So we need to
7521 check complain here, too. */
7522 if (complain
& tf_error
)
7524 /* Call build_user_type_conversion again for the error. */
7525 int flags
= (convs
->need_temporary_p
7526 ? LOOKUP_IMPLICIT
: LOOKUP_NORMAL
);
7527 build_user_type_conversion (totype
, convs
->u
.expr
, flags
, complain
);
7528 gcc_assert (seen_error ());
7529 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7531 return error_mark_node
;
7535 /* Conversion to std::initializer_list<T>. */
7536 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
7537 unsigned len
= CONSTRUCTOR_NELTS (expr
);
7542 tree val
; unsigned ix
;
7544 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
7546 /* Convert all the elements. */
7547 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
7549 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
,
7550 argnum
, false, false, complain
);
7551 if (sub
== error_mark_node
)
7553 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
7554 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
7555 return error_mark_node
;
7556 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
),
7558 if (!TREE_CONSTANT (sub
))
7559 TREE_CONSTANT (new_ctor
) = false;
7561 /* Build up the array. */
7562 elttype
= cp_build_qualified_type
7563 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
7564 array
= build_array_of_n_type (elttype
, len
);
7565 array
= finish_compound_literal (array
, new_ctor
, complain
);
7566 /* Take the address explicitly rather than via decay_conversion
7567 to avoid the error about taking the address of a temporary. */
7568 array
= cp_build_addr_expr (array
, complain
);
7571 array
= nullptr_node
;
7573 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
7574 if (array
== error_mark_node
)
7575 return error_mark_node
;
7577 /* Build up the initializer_list object. Note: fail gracefully
7578 if the object cannot be completed because, for example, no
7579 definition is provided (c++/80956). */
7580 totype
= complete_type_or_maybe_complain (totype
, NULL_TREE
, complain
);
7582 return error_mark_node
;
7583 tree field
= next_initializable_field (TYPE_FIELDS (totype
));
7584 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
7585 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
7586 field
= next_initializable_field (DECL_CHAIN (field
));
7587 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
7588 tree new_ctor
= build_constructor (totype
, vec
);
7589 return get_target_expr_sfinae (new_ctor
, complain
);
7593 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
7595 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7596 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
7597 real
= perform_implicit_conversion (TREE_TYPE (totype
),
7599 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
7601 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
7604 expr
= reshape_init (totype
, expr
, complain
);
7605 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
7607 if (expr
!= error_mark_node
)
7608 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7615 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
7616 convs
->kind
== ck_ref_bind
7617 ? issue_conversion_warnings
: false,
7618 c_cast_p
, complain
);
7619 if (expr
== error_mark_node
)
7620 return error_mark_node
;
7622 switch (convs
->kind
)
7625 expr
= decay_conversion (expr
, complain
);
7626 if (expr
== error_mark_node
)
7628 if (complain
& tf_error
)
7630 auto_diagnostic_group d
;
7631 maybe_print_user_conv_context (convs
);
7632 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7634 return error_mark_node
;
7637 if (! MAYBE_CLASS_TYPE_P (totype
))
7640 /* Don't introduce copies when passing arguments along to the inherited
7642 if (current_function_decl
7643 && flag_new_inheriting_ctors
7644 && DECL_INHERITED_CTOR (current_function_decl
))
7647 if (TREE_CODE (expr
) == TARGET_EXPR
7648 && TARGET_EXPR_LIST_INIT_P (expr
))
7649 /* Copy-list-initialization doesn't actually involve a copy. */
7654 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
7656 /* We are going to bind a reference directly to a base-class
7657 subobject of EXPR. */
7658 /* Build an expression for `*((base*) &expr)'. */
7659 expr
= convert_to_base (expr
, totype
,
7660 !c_cast_p
, /*nonnull=*/true, complain
);
7664 /* Copy-initialization where the cv-unqualified version of the source
7665 type is the same class as, or a derived class of, the class of the
7666 destination [is treated as direct-initialization]. [dcl.init] */
7667 flags
= LOOKUP_NORMAL
;
7668 /* This conversion is being done in the context of a user-defined
7669 conversion (i.e. the second step of copy-initialization), so
7670 don't allow any more. */
7671 if (convs
->user_conv_p
)
7672 flags
|= LOOKUP_NO_CONVERSION
;
7673 /* We might be performing a conversion of the argument
7674 to the user-defined conversion, i.e., not a conversion of the
7675 result of the user-defined conversion. In which case we skip
7676 explicit constructors. */
7677 if (convs
->copy_init_p
)
7678 flags
|= LOOKUP_ONLYCONVERTING
;
7679 if (convs
->rvaluedness_matches_p
)
7680 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
7681 flags
|= LOOKUP_PREFER_RVALUE
;
7682 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
7683 if (diag_kind
&& complain
)
7685 auto_diagnostic_group d
;
7686 maybe_print_user_conv_context (convs
);
7687 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7690 return build_cplus_new (totype
, expr
, complain
);
7694 tree ref_type
= totype
;
7696 /* direct_reference_binding might have inserted a ck_qual under
7697 this ck_ref_bind for the benefit of conversion sequence ranking.
7698 Ignore the conversion; we'll create our own below. */
7699 if (next_conversion (convs
)->kind
== ck_qual
7700 && !convs
->need_temporary_p
)
7702 gcc_assert (same_type_p (TREE_TYPE (expr
),
7703 next_conversion (convs
)->type
));
7704 /* Strip the cast created by the ck_qual; cp_build_addr_expr
7705 below expects an lvalue. */
7709 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
7711 tree extype
= TREE_TYPE (expr
);
7712 auto_diagnostic_group d
;
7713 if (TYPE_REF_IS_RVALUE (ref_type
)
7715 error_at (loc
, "cannot bind rvalue reference of type %qH to "
7716 "lvalue of type %qI", totype
, extype
);
7717 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
7718 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
7719 error_at (loc
, "cannot bind non-const lvalue reference of "
7720 "type %qH to an rvalue of type %qI", totype
, extype
);
7721 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
7723 /* If we're converting from T[] to T[N], don't talk
7724 about discarding qualifiers. (Converting from T[N] to
7725 T[] is allowed by P0388R4.) */
7726 if (TREE_CODE (extype
) == ARRAY_TYPE
7727 && TYPE_DOMAIN (extype
) == NULL_TREE
7728 && TREE_CODE (TREE_TYPE (totype
)) == ARRAY_TYPE
7729 && TYPE_DOMAIN (TREE_TYPE (totype
)) != NULL_TREE
)
7730 error_at (loc
, "cannot bind reference of type %qH to %qI "
7731 "due to different array bounds", totype
, extype
);
7733 error_at (loc
, "binding reference of type %qH to %qI "
7734 "discards qualifiers", totype
, extype
);
7738 maybe_print_user_conv_context (convs
);
7739 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7741 return error_mark_node
;
7743 else if (complain
& tf_warning
)
7744 maybe_warn_array_conv (loc
, convs
, expr
);
7746 /* If necessary, create a temporary.
7748 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7749 that need temporaries, even when their types are reference
7750 compatible with the type of reference being bound, so the
7751 upcoming call to cp_build_addr_expr doesn't fail. */
7752 if (convs
->need_temporary_p
7753 || TREE_CODE (expr
) == CONSTRUCTOR
7754 || TREE_CODE (expr
) == VA_ARG_EXPR
)
7756 /* Otherwise, a temporary of type "cv1 T1" is created and
7757 initialized from the initializer expression using the rules
7758 for a non-reference copy-initialization (8.5). */
7760 tree type
= TREE_TYPE (ref_type
);
7761 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
7763 gcc_assert (similar_type_p (type
, next_conversion (convs
)->type
));
7764 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
7765 && !TYPE_REF_IS_RVALUE (ref_type
))
7767 /* If the reference is volatile or non-const, we
7768 cannot create a temporary. */
7769 if (complain
& tf_error
)
7771 if (lvalue
& clk_bitfield
)
7772 error_at (loc
, "cannot bind bit-field %qE to %qT",
7774 else if (lvalue
& clk_packed
)
7775 error_at (loc
, "cannot bind packed field %qE to %qT",
7778 error_at (loc
, "cannot bind rvalue %qE to %qT",
7781 return error_mark_node
;
7783 /* If the source is a packed field, and we must use a copy
7784 constructor, then building the target expr will require
7785 binding the field to the reference parameter to the
7786 copy constructor, and we'll end up with an infinite
7787 loop. If we can use a bitwise copy, then we'll be
7789 if ((lvalue
& clk_packed
)
7790 && CLASS_TYPE_P (type
)
7791 && type_has_nontrivial_copy_init (type
))
7793 error_at (loc
, "cannot bind packed field %qE to %qT",
7795 return error_mark_node
;
7797 if (lvalue
& clk_bitfield
)
7799 expr
= convert_bitfield_to_declared_type (expr
);
7800 expr
= fold_convert (type
, expr
);
7803 /* Creating &TARGET_EXPR<> in a template would break when
7804 tsubsting the expression, so use an IMPLICIT_CONV_EXPR
7805 instead. This can happen even when there's no class
7806 involved, e.g., when converting an integer to a reference
7808 if (processing_template_decl
)
7809 return build1 (IMPLICIT_CONV_EXPR
, totype
, expr
);
7810 expr
= build_target_expr_with_type (expr
, type
, complain
);
7813 /* Take the address of the thing to which we will bind the
7815 expr
= cp_build_addr_expr (expr
, complain
);
7816 if (expr
== error_mark_node
)
7817 return error_mark_node
;
7819 /* Convert it to a pointer to the type referred to by the
7820 reference. This will adjust the pointer if a derived to
7821 base conversion is being performed. */
7822 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
7824 /* Convert the pointer to the desired reference type. */
7825 return build_nop (ref_type
, expr
);
7829 return decay_conversion (expr
, complain
);
7832 /* ??? Should the address of a transaction-safe pointer point to the TM
7833 clone, and this conversion look up the primary function? */
7834 return build_nop (totype
, expr
);
7837 /* Warn about deprecated conversion if appropriate. */
7838 if (complain
& tf_warning
)
7840 string_conv_p (totype
, expr
, 1);
7841 maybe_warn_array_conv (loc
, convs
, expr
);
7847 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
7848 /*nonnull=*/false, complain
);
7849 return build_nop (totype
, expr
);
7852 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
7853 c_cast_p
, complain
);
7859 if (convs
->check_narrowing
7860 && !check_narrowing (totype
, expr
, complain
,
7861 convs
->check_narrowing_const_only
))
7862 return error_mark_node
;
7864 warning_sentinel
w (warn_zero_as_null_pointer_constant
);
7865 if (issue_conversion_warnings
)
7866 expr
= cp_convert_and_check (totype
, expr
, complain
);
7868 expr
= cp_convert (totype
, expr
, complain
);
7873 /* ARG is being passed to a varargs function. Perform any conversions
7874 required. Return the converted value. */
7877 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
7879 tree arg_type
= TREE_TYPE (arg
);
7880 location_t loc
= cp_expr_loc_or_input_loc (arg
);
7884 If the argument has integral or enumeration type that is subject
7885 to the integral promotions (_conv.prom_), or a floating-point
7886 type that is subject to the floating-point promotion
7887 (_conv.fpprom_), the value of the argument is converted to the
7888 promoted type before the call. */
7889 if (TREE_CODE (arg_type
) == REAL_TYPE
7890 && (TYPE_PRECISION (arg_type
)
7891 < TYPE_PRECISION (double_type_node
))
7892 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
7894 if ((complain
& tf_warning
)
7895 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
7896 warning_at (loc
, OPT_Wdouble_promotion
,
7897 "implicit conversion from %qH to %qI when passing "
7898 "argument to function",
7899 arg_type
, double_type_node
);
7900 arg
= mark_rvalue_use (arg
);
7901 arg
= convert_to_real_nofold (double_type_node
, arg
);
7903 else if (NULLPTR_TYPE_P (arg_type
))
7905 arg
= mark_rvalue_use (arg
);
7906 if (TREE_SIDE_EFFECTS (arg
))
7907 arg
= cp_build_compound_expr (arg
, null_pointer_node
, complain
);
7909 arg
= null_pointer_node
;
7911 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
7913 if (SCOPED_ENUM_P (arg_type
))
7915 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
7917 prom
= cp_perform_integral_promotions (prom
, complain
);
7918 if (abi_version_crosses (6)
7919 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
7920 && (complain
& tf_warning
))
7921 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through %<...%>"
7922 " as %qT before %<-fabi-version=6%>, %qT after",
7924 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
7925 if (!abi_version_at_least (6))
7929 arg
= cp_perform_integral_promotions (arg
, complain
);
7934 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7935 standard conversions are performed. */
7936 arg
= decay_conversion (arg
, complain
);
7938 arg
= require_complete_type_sfinae (arg
, complain
);
7939 arg_type
= TREE_TYPE (arg
);
7941 if (arg
!= error_mark_node
7942 /* In a template (or ill-formed code), we can have an incomplete type
7943 even after require_complete_type_sfinae, in which case we don't know
7944 whether it has trivial copy or not. */
7945 && COMPLETE_TYPE_P (arg_type
)
7946 && !cp_unevaluated_operand
)
7948 /* [expr.call] 5.2.2/7:
7949 Passing a potentially-evaluated argument of class type (Clause 9)
7950 with a non-trivial copy constructor or a non-trivial destructor
7951 with no corresponding parameter is conditionally-supported, with
7952 implementation-defined semantics.
7954 We support it as pass-by-invisible-reference, just like a normal
7957 If the call appears in the context of a sizeof expression,
7958 it is not potentially-evaluated. */
7959 if (type_has_nontrivial_copy_init (arg_type
)
7960 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
))
7962 arg
= force_rvalue (arg
, complain
);
7963 if (complain
& tf_warning
)
7964 warning (OPT_Wconditionally_supported
,
7965 "passing objects of non-trivially-copyable "
7966 "type %q#T through %<...%> is conditionally supported",
7968 return build1 (ADDR_EXPR
, build_reference_type (arg_type
), arg
);
7970 /* Build up a real lvalue-to-rvalue conversion in case the
7971 copy constructor is trivial but not callable. */
7972 else if (CLASS_TYPE_P (arg_type
))
7973 force_rvalue (arg
, complain
);
7980 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7983 build_x_va_arg (location_t loc
, tree expr
, tree type
)
7985 if (processing_template_decl
)
7987 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
7988 SET_EXPR_LOCATION (r
, loc
);
7992 type
= complete_type_or_else (type
, NULL_TREE
);
7994 if (expr
== error_mark_node
|| !type
)
7995 return error_mark_node
;
7997 expr
= mark_lvalue_use (expr
);
7999 if (TYPE_REF_P (type
))
8001 error ("cannot receive reference type %qT through %<...%>", type
);
8002 return error_mark_node
;
8005 if (type_has_nontrivial_copy_init (type
)
8006 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8008 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
8009 it as pass by invisible reference. */
8010 warning_at (loc
, OPT_Wconditionally_supported
,
8011 "receiving objects of non-trivially-copyable type %q#T "
8012 "through %<...%> is conditionally-supported", type
);
8014 tree ref
= cp_build_reference_type (type
, false);
8015 expr
= build_va_arg (loc
, expr
, ref
);
8016 return convert_from_reference (expr
);
8019 tree ret
= build_va_arg (loc
, expr
, type
);
8020 if (CLASS_TYPE_P (type
))
8021 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
8022 know how to handle it. */
8023 ret
= get_target_expr (ret
);
8027 /* TYPE has been given to va_arg. Apply the default conversions which
8028 would have happened when passed via ellipsis. Return the promoted
8029 type, or the passed type if there is no change. */
8032 cxx_type_promotes_to (tree type
)
8036 /* Perform the array-to-pointer and function-to-pointer
8038 type
= type_decays_to (type
);
8040 promote
= type_promotes_to (type
);
8041 if (same_type_p (type
, promote
))
8047 /* ARG is a default argument expression being passed to a parameter of
8048 the indicated TYPE, which is a parameter to FN. PARMNUM is the
8049 zero-based argument number. Do any required conversions. Return
8050 the converted value. */
8052 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
8054 push_defarg_context (tree fn
)
8055 { vec_safe_push (default_arg_context
, fn
); }
8058 pop_defarg_context (void)
8059 { default_arg_context
->pop (); }
8062 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
8063 tsubst_flags_t complain
)
8068 /* See through clones. */
8069 fn
= DECL_ORIGIN (fn
);
8070 /* And inheriting ctors. */
8071 if (flag_new_inheriting_ctors
)
8072 fn
= strip_inheriting_ctors (fn
);
8074 /* Detect recursion. */
8075 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
8078 if (complain
& tf_error
)
8079 error ("recursive evaluation of default argument for %q#D", fn
);
8080 return error_mark_node
;
8083 /* If the ARG is an unparsed default argument expression, the
8084 conversion cannot be performed. */
8085 if (TREE_CODE (arg
) == DEFERRED_PARSE
)
8087 if (complain
& tf_error
)
8088 error ("call to %qD uses the default argument for parameter %P, which "
8089 "is not yet defined", fn
, parmnum
);
8090 return error_mark_node
;
8093 push_defarg_context (fn
);
8095 if (fn
&& DECL_TEMPLATE_INFO (fn
))
8096 arg
= tsubst_default_argument (fn
, parmnum
, type
, arg
, complain
);
8102 The names in the expression are bound, and the semantic
8103 constraints are checked, at the point where the default
8104 expressions appears.
8106 we must not perform access checks here. */
8107 push_deferring_access_checks (dk_no_check
);
8108 /* We must make a copy of ARG, in case subsequent processing
8109 alters any part of it. */
8110 arg
= break_out_target_exprs (arg
, /*clear location*/true);
8112 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
8113 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
8115 arg
= convert_for_arg_passing (type
, arg
, complain
);
8116 pop_deferring_access_checks();
8118 pop_defarg_context ();
8123 /* Returns the type which will really be used for passing an argument of
8127 type_passed_as (tree type
)
8129 /* Pass classes with copy ctors by invisible reference. */
8130 if (TREE_ADDRESSABLE (type
))
8132 type
= build_reference_type (type
);
8133 /* There are no other pointers to this temporary. */
8134 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
8136 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
8137 && INTEGRAL_TYPE_P (type
)
8138 && COMPLETE_TYPE_P (type
)
8139 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
8140 type
= integer_type_node
;
8145 /* Actually perform the appropriate conversion. */
8148 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
8152 /* If VAL is a bitfield, then -- since it has already been converted
8153 to TYPE -- it cannot have a precision greater than TYPE.
8155 If it has a smaller precision, we must widen it here. For
8156 example, passing "int f:3;" to a function expecting an "int" will
8157 not result in any conversion before this point.
8159 If the precision is the same we must not risk widening. For
8160 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
8161 often have type "int", even though the C++ type for the field is
8162 "long long". If the value is being passed to a function
8163 expecting an "int", then no conversions will be required. But,
8164 if we call convert_bitfield_to_declared_type, the bitfield will
8165 be converted to "long long". */
8166 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
8168 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
8169 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
8171 if (val
== error_mark_node
)
8173 /* Pass classes with copy ctors by invisible reference. */
8174 else if (TREE_ADDRESSABLE (type
))
8175 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
8176 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
8177 && INTEGRAL_TYPE_P (type
)
8178 && COMPLETE_TYPE_P (type
)
8179 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
8180 val
= cp_perform_integral_promotions (val
, complain
);
8181 if (complain
& tf_warning
)
8183 if (warn_suggest_attribute_format
)
8185 tree rhstype
= TREE_TYPE (val
);
8186 const enum tree_code coder
= TREE_CODE (rhstype
);
8187 const enum tree_code codel
= TREE_CODE (type
);
8188 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
8190 && check_missing_format_attribute (type
, rhstype
))
8191 warning (OPT_Wsuggest_attribute_format
,
8192 "argument of function call might be a candidate "
8193 "for a format attribute");
8195 maybe_warn_parm_abi (type
, cp_expr_loc_or_input_loc (val
));
8198 if (complain
& tf_warning
)
8199 warn_for_address_or_pointer_of_packed_member (type
, val
);
8204 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
8205 which just decay_conversion or no conversions at all should be done.
8206 This is true for some builtins which don't act like normal functions.
8207 Return 2 if no conversions at all should be done, 1 if just
8208 decay_conversion. Return 3 for special treatment of the 3rd argument
8209 for __builtin_*_overflow_p. */
8212 magic_varargs_p (tree fn
)
8214 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8215 switch (DECL_FUNCTION_CODE (fn
))
8217 case BUILT_IN_CLASSIFY_TYPE
:
8218 case BUILT_IN_CONSTANT_P
:
8219 case BUILT_IN_NEXT_ARG
:
8220 case BUILT_IN_VA_START
:
8223 case BUILT_IN_ADD_OVERFLOW_P
:
8224 case BUILT_IN_SUB_OVERFLOW_P
:
8225 case BUILT_IN_MUL_OVERFLOW_P
:
8229 return lookup_attribute ("type generic",
8230 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
8236 /* Returns the decl of the dispatcher function if FN is a function version. */
8239 get_function_version_dispatcher (tree fn
)
8241 tree dispatcher_decl
= NULL
;
8243 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
8244 && DECL_FUNCTION_VERSIONED (fn
));
8246 gcc_assert (targetm
.get_function_versions_dispatcher
);
8247 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
8249 if (dispatcher_decl
== NULL
)
8251 error_at (input_location
, "use of multiversioned function "
8252 "without a default");
8256 retrofit_lang_decl (dispatcher_decl
);
8257 gcc_assert (dispatcher_decl
!= NULL
);
8258 return dispatcher_decl
;
8261 /* fn is a function version dispatcher that is marked used. Mark all the
8262 semantically identical function versions it will dispatch as used. */
8265 mark_versions_used (tree fn
)
8267 struct cgraph_node
*node
;
8268 struct cgraph_function_version_info
*node_v
;
8269 struct cgraph_function_version_info
*it_v
;
8271 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8273 node
= cgraph_node::get (fn
);
8277 gcc_assert (node
->dispatcher_function
);
8279 node_v
= node
->function_version ();
8283 /* All semantically identical versions are chained. Traverse and mark each
8284 one of them as used. */
8285 it_v
= node_v
->next
;
8286 while (it_v
!= NULL
)
8288 mark_used (it_v
->this_node
->decl
);
8293 /* Build a call to "the copy constructor" for the type of A, even if it
8294 wouldn't be selected by normal overload resolution. Used for
8298 call_copy_ctor (tree a
, tsubst_flags_t complain
)
8300 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
8301 tree binfo
= TYPE_BINFO (ctype
);
8302 tree copy
= get_copy_ctor (ctype
, complain
);
8303 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
8304 tree ob
= build_dummy_object (ctype
);
8305 releasing_vec
args (make_tree_vector_single (a
));
8306 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
8307 LOOKUP_NORMAL
, NULL
, complain
);
8311 /* Return true iff T refers to a base field. */
8314 is_base_field_ref (tree t
)
8317 if (TREE_CODE (t
) == ADDR_EXPR
)
8318 t
= TREE_OPERAND (t
, 0);
8319 if (TREE_CODE (t
) == COMPONENT_REF
)
8320 t
= TREE_OPERAND (t
, 1);
8321 if (TREE_CODE (t
) == FIELD_DECL
)
8322 return DECL_FIELD_IS_BASE (t
);
8326 /* We can't elide a copy from a function returning by value to a base
8327 subobject, as the callee might clobber tail padding. Return true iff this
8328 could be that case. */
8331 unsafe_copy_elision_p (tree target
, tree exp
)
8333 /* Copy elision only happens with a TARGET_EXPR. */
8334 if (TREE_CODE (exp
) != TARGET_EXPR
)
8336 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
8337 /* It's safe to elide the copy for a class with no tail padding. */
8338 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
8340 /* It's safe to elide the copy if we aren't initializing a base object. */
8341 if (!is_base_field_ref (target
))
8343 tree init
= TARGET_EXPR_INITIAL (exp
);
8344 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
8345 while (TREE_CODE (init
) == COMPOUND_EXPR
)
8346 init
= TREE_OPERAND (init
, 1);
8347 if (TREE_CODE (init
) == COND_EXPR
)
8349 /* We'll end up copying from each of the arms of the COND_EXPR directly
8350 into the target, so look at them. */
8351 if (tree op
= TREE_OPERAND (init
, 1))
8352 if (unsafe_copy_elision_p (target
, op
))
8354 return unsafe_copy_elision_p (target
, TREE_OPERAND (init
, 2));
8356 return (TREE_CODE (init
) == AGGR_INIT_EXPR
8357 && !AGGR_INIT_VIA_CTOR_P (init
));
8360 /* True iff C is a conversion that binds a reference to a prvalue. */
8363 conv_binds_ref_to_prvalue (conversion
*c
)
8365 if (c
->kind
!= ck_ref_bind
)
8367 if (c
->need_temporary_p
)
8370 c
= next_conversion (c
);
8372 if (c
->kind
== ck_rvalue
)
8374 if (c
->kind
== ck_user
&& !TYPE_REF_P (c
->type
))
8376 if (c
->kind
== ck_identity
&& c
->u
.expr
8377 && TREE_CODE (c
->u
.expr
) == TARGET_EXPR
)
8383 /* Call the trivial destructor for INSTANCE, which can be either an lvalue of
8384 class type or a pointer to class type. */
8387 build_trivial_dtor_call (tree instance
)
8389 gcc_assert (!is_dummy_object (instance
));
8391 if (!flag_lifetime_dse
)
8394 return fold_convert (void_type_node
, instance
);
8397 if (INDIRECT_TYPE_P (TREE_TYPE (instance
)))
8399 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
8401 instance
= cp_build_fold_indirect_ref (instance
);
8404 /* A trivial destructor should still clobber the object. */
8405 tree clobber
= build_clobber (TREE_TYPE (instance
));
8406 return build2 (MODIFY_EXPR
, void_type_node
,
8410 /* Subroutine of the various build_*_call functions. Overload resolution
8411 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
8412 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
8413 bitmask of various LOOKUP_* flags which apply to the call itself. */
8416 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
8419 const vec
<tree
, va_gc
> *args
= cand
->args
;
8420 tree first_arg
= cand
->first_arg
;
8421 conversion
**convs
= cand
->convs
;
8423 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
8428 unsigned int arg_index
= 0;
8432 bool already_used
= false;
8434 /* In a template, there is no need to perform all of the work that
8435 is normally done. We are only interested in the type of the call
8436 expression, i.e., the return type of the function. Any semantic
8437 errors will be deferred until the template is instantiated. */
8438 if (processing_template_decl
)
8442 const tree
*argarray
;
8445 if (undeduced_auto_decl (fn
))
8446 mark_used (fn
, complain
);
8448 /* Otherwise set TREE_USED for the benefit of -Wunused-function.
8452 return_type
= TREE_TYPE (TREE_TYPE (fn
));
8453 nargs
= vec_safe_length (args
);
8454 if (first_arg
== NULL_TREE
)
8455 argarray
= args
->address ();
8463 alcarray
= XALLOCAVEC (tree
, nargs
);
8464 alcarray
[0] = build_this (first_arg
);
8465 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
8466 alcarray
[ix
+ 1] = arg
;
8467 argarray
= alcarray
;
8470 addr
= build_addr_func (fn
, complain
);
8471 if (addr
== error_mark_node
)
8472 return error_mark_node
;
8473 expr
= build_call_array_loc (input_location
, return_type
,
8474 addr
, nargs
, argarray
);
8475 if (TREE_THIS_VOLATILE (fn
) && cfun
)
8476 current_function_returns_abnormally
= 1;
8477 if (TREE_CODE (fn
) == FUNCTION_DECL
8478 && DECL_IMMEDIATE_FUNCTION_P (fn
)
8479 && cp_unevaluated_operand
== 0
8480 && (current_function_decl
== NULL_TREE
8481 || !DECL_IMMEDIATE_FUNCTION_P (current_function_decl
))
8482 && (current_binding_level
->kind
!= sk_function_parms
8483 || !current_binding_level
->immediate_fn_ctx_p
))
8485 tree obj_arg
= NULL_TREE
, exprimm
= expr
;
8486 if (DECL_CONSTRUCTOR_P (fn
))
8487 obj_arg
= first_arg
;
8489 && is_dummy_object (obj_arg
)
8490 && !type_dependent_expression_p (obj_arg
))
8492 exprimm
= build_cplus_new (DECL_CONTEXT (fn
), expr
, complain
);
8493 obj_arg
= NULL_TREE
;
8495 /* Look through *(const T *)&obj. */
8496 else if (obj_arg
&& TREE_CODE (obj_arg
) == INDIRECT_REF
)
8498 tree addr
= TREE_OPERAND (obj_arg
, 0);
8500 if (TREE_CODE (addr
) == ADDR_EXPR
)
8502 tree typeo
= TREE_TYPE (obj_arg
);
8503 tree typei
= TREE_TYPE (TREE_OPERAND (addr
, 0));
8504 if (same_type_ignoring_top_level_qualifiers_p (typeo
, typei
))
8505 obj_arg
= TREE_OPERAND (addr
, 0);
8508 fold_non_dependent_expr (exprimm
, complain
,
8509 /*manifestly_const_eval=*/true,
8512 return convert_from_reference (expr
);
8515 /* Give any warnings we noticed during overload resolution. */
8516 if (cand
->warnings
&& (complain
& tf_warning
))
8518 struct candidate_warning
*w
;
8519 for (w
= cand
->warnings
; w
; w
= w
->next
)
8520 joust (cand
, w
->loser
, 1, complain
);
8523 /* Core issue 2327: P0135 doesn't say how to handle the case where the
8524 argument to the copy constructor ends up being a prvalue after
8525 conversion. Let's do the normal processing, but pretend we aren't
8526 actually using the copy constructor. */
8527 bool force_elide
= false;
8528 if (cxx_dialect
>= cxx17
8529 && cand
->num_convs
== 1
8530 && DECL_COMPLETE_CONSTRUCTOR_P (fn
)
8531 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8532 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8533 && conv_binds_ref_to_prvalue (convs
[0]))
8536 goto not_really_used
;
8539 /* OK, we're actually calling this inherited constructor; set its deletedness
8540 appropriately. We can get away with doing this here because calling is
8541 the only way to refer to a constructor. */
8542 if (DECL_INHERITED_CTOR (fn
))
8543 deduce_inheriting_ctor (fn
);
8545 /* Make =delete work with SFINAE. */
8546 if (DECL_DELETED_FN (fn
))
8548 if (complain
& tf_error
)
8550 return error_mark_node
;
8553 if (DECL_FUNCTION_MEMBER_P (fn
))
8556 /* If FN is a template function, two cases must be considered.
8561 template <class T> void f();
8563 template <class T> struct B {
8567 struct C : A, B<int> {
8569 using B<int>::g; // #2
8572 In case #1 where `A::f' is a member template, DECL_ACCESS is
8573 recorded in the primary template but not in its specialization.
8574 We check access of FN using its primary template.
8576 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
8577 because it is a member of class template B, DECL_ACCESS is
8578 recorded in the specialization `B<int>::g'. We cannot use its
8579 primary template because `B<T>::g' and `B<int>::g' may have
8580 different access. */
8581 if (DECL_TEMPLATE_INFO (fn
)
8582 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
8583 access_fn
= DECL_TI_TEMPLATE (fn
);
8586 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
8588 return error_mark_node
;
8591 /* If we're checking for implicit delete, don't bother with argument
8593 if (flags
& LOOKUP_SPECULATIVE
)
8595 if (cand
->viable
== 1)
8597 else if (!(complain
& tf_error
))
8598 /* Reject bad conversions now. */
8599 return error_mark_node
;
8600 /* else continue to get conversion error. */
8605 /* N3276 magic doesn't apply to nested calls. */
8606 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
8607 complain
&= ~tf_decltype
;
8608 /* No-Cleanup doesn't apply to nested calls either. */
8609 tsubst_flags_t no_cleanup_complain
= complain
;
8610 complain
&= ~tf_no_cleanup
;
8612 /* Find maximum size of vector to hold converted arguments. */
8613 parmlen
= list_length (parm
);
8614 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
8615 if (parmlen
> nargs
)
8617 argarray
= XALLOCAVEC (tree
, nargs
);
8619 /* The implicit parameters to a constructor are not considered by overload
8620 resolution, and must be of the proper type. */
8621 if (DECL_CONSTRUCTOR_P (fn
))
8624 if (first_arg
!= NULL_TREE
)
8626 object_arg
= first_arg
;
8627 first_arg
= NULL_TREE
;
8631 object_arg
= (*args
)[arg_index
];
8634 argarray
[j
++] = build_this (object_arg
);
8635 parm
= TREE_CHAIN (parm
);
8636 /* We should never try to call the abstract constructor. */
8637 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
8639 if (DECL_HAS_VTT_PARM_P (fn
))
8641 argarray
[j
++] = (*args
)[arg_index
];
8643 parm
= TREE_CHAIN (parm
);
8646 if (flags
& LOOKUP_PREFER_RVALUE
)
8648 /* The implicit move specified in 15.8.3/3 fails "...if the type of
8649 the first parameter of the selected constructor is not an rvalue
8650 reference to the object's type (possibly cv-qualified)...." */
8651 gcc_assert (!(complain
& tf_error
));
8652 tree ptype
= convs
[0]->type
;
8653 if (!TYPE_REF_P (ptype
)
8654 || !TYPE_REF_IS_RVALUE (ptype
)
8655 || CONVERSION_RANK (convs
[0]) > cr_exact
)
8656 return error_mark_node
;
8659 /* Bypass access control for 'this' parameter. */
8660 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
8662 tree parmtype
= TREE_VALUE (parm
);
8663 tree arg
= build_this (first_arg
!= NULL_TREE
8665 : (*args
)[arg_index
]);
8666 tree argtype
= TREE_TYPE (arg
);
8670 if (arg
== error_mark_node
)
8671 return error_mark_node
;
8673 if (convs
[i
]->bad_p
)
8675 if (complain
& tf_error
)
8677 auto_diagnostic_group d
;
8678 if (permerror (input_location
, "passing %qT as %<this%> "
8679 "argument discards qualifiers",
8680 TREE_TYPE (argtype
)))
8681 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
8684 return error_mark_node
;
8687 /* Optimize away vtable lookup if we know that this
8688 function can't be overridden. We need to check if
8689 the context and the type where we found fn are the same,
8690 actually FN might be defined in a different class
8691 type because of a using-declaration. In this case, we
8692 do not want to perform a non-virtual call. Note that
8693 resolves_to_fixed_type_p checks CLASSTYPE_FINAL too. */
8694 if (DECL_FINAL_P (fn
)
8695 || (resolves_to_fixed_type_p (arg
, 0)
8696 && same_type_ignoring_top_level_qualifiers_p
8697 (DECL_CONTEXT (fn
), BINFO_TYPE (cand
->conversion_path
))))
8698 flags
|= LOOKUP_NONVIRTUAL
;
8700 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
8701 X is called for an object that is not of type X, or of a type
8702 derived from X, the behavior is undefined.
8704 So we can assume that anything passed as 'this' is non-null, and
8705 optimize accordingly. */
8706 gcc_assert (TYPE_PTR_P (parmtype
));
8707 /* Convert to the base in which the function was declared. */
8708 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
8709 converted_arg
= build_base_path (PLUS_EXPR
,
8711 cand
->conversion_path
,
8713 /* Check that the base class is accessible. */
8714 if (!accessible_base_p (TREE_TYPE (argtype
),
8715 BINFO_TYPE (cand
->conversion_path
), true))
8717 if (complain
& tf_error
)
8718 error ("%qT is not an accessible base of %qT",
8719 BINFO_TYPE (cand
->conversion_path
),
8720 TREE_TYPE (argtype
));
8722 return error_mark_node
;
8724 /* If fn was found by a using declaration, the conversion path
8725 will be to the derived class, not the base declaring fn. We
8726 must convert from derived to base. */
8727 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
8728 TREE_TYPE (parmtype
), ba_unique
,
8730 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
8731 base_binfo
, 1, complain
);
8733 argarray
[j
++] = converted_arg
;
8734 parm
= TREE_CHAIN (parm
);
8735 if (first_arg
!= NULL_TREE
)
8736 first_arg
= NULL_TREE
;
8743 gcc_assert (first_arg
== NULL_TREE
);
8744 for (; arg_index
< vec_safe_length (args
) && parm
;
8745 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
8747 tree type
= TREE_VALUE (parm
);
8748 tree arg
= (*args
)[arg_index
];
8749 bool conversion_warning
= true;
8753 /* If the argument is NULL and used to (implicitly) instantiate a
8754 template function (and bind one of the template arguments to
8755 the type of 'long int'), we don't want to warn about passing NULL
8756 to non-pointer argument.
8757 For example, if we have this template function:
8759 template<typename T> void func(T x) {}
8761 we want to warn (when -Wconversion is enabled) in this case:
8767 but not in this case:
8773 if (null_node_p (arg
)
8774 && DECL_TEMPLATE_INFO (fn
)
8775 && cand
->template_decl
8776 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
8777 conversion_warning
= false;
8779 /* Set user_conv_p on the argument conversions, so rvalue/base handling
8780 knows not to allow any more UDCs. This needs to happen after we
8781 process cand->warnings. */
8782 if (flags
& LOOKUP_NO_CONVERSION
)
8783 conv
->user_conv_p
= true;
8785 tsubst_flags_t arg_complain
= complain
;
8786 if (!conversion_warning
)
8787 arg_complain
&= ~tf_warning
;
8789 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
8791 val
= convert_for_arg_passing (type
, val
, arg_complain
);
8793 if (val
== error_mark_node
)
8794 return error_mark_node
;
8796 argarray
[j
++] = val
;
8799 /* Default arguments */
8800 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
8802 if (TREE_VALUE (parm
) == error_mark_node
)
8803 return error_mark_node
;
8804 val
= convert_default_arg (TREE_VALUE (parm
),
8805 TREE_PURPOSE (parm
),
8808 if (val
== error_mark_node
)
8809 return error_mark_node
;
8810 argarray
[j
++] = val
;
8814 int magic
= magic_varargs_p (fn
);
8815 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
8817 tree a
= (*args
)[arg_index
];
8818 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
8820 /* Do no conversions for certain magic varargs. */
8821 a
= mark_type_use (a
);
8822 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
8823 return error_mark_node
;
8825 else if (magic
!= 0)
8826 /* For other magic varargs only do decay_conversion. */
8827 a
= decay_conversion (a
, complain
);
8828 else if (DECL_CONSTRUCTOR_P (fn
)
8829 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
8832 /* Avoid infinite recursion trying to call A(...). */
8833 if (complain
& tf_error
)
8834 /* Try to call the actual copy constructor for a good error. */
8835 call_copy_ctor (a
, complain
);
8836 return error_mark_node
;
8839 a
= convert_arg_to_ellipsis (a
, complain
);
8840 if (a
== error_mark_node
)
8841 return error_mark_node
;
8845 gcc_assert (j
<= nargs
);
8848 /* Avoid to do argument-transformation, if warnings for format, and for
8849 nonnull are disabled. Just in case that at least one of them is active
8850 the check_function_arguments function might warn about something. */
8852 bool warned_p
= false;
8855 || warn_suggest_attribute_format
8858 tree
*fargs
= (!nargs
? argarray
8859 : (tree
*) alloca (nargs
* sizeof (tree
)));
8860 for (j
= 0; j
< nargs
; j
++)
8862 /* For -Wformat undo the implicit passing by hidden reference
8863 done by convert_arg_to_ellipsis. */
8864 if (TREE_CODE (argarray
[j
]) == ADDR_EXPR
8865 && TYPE_REF_P (TREE_TYPE (argarray
[j
])))
8866 fargs
[j
] = TREE_OPERAND (argarray
[j
], 0);
8868 fargs
[j
] = argarray
[j
];
8871 warned_p
= check_function_arguments (input_location
, fn
, TREE_TYPE (fn
),
8872 nargs
, fargs
, NULL
);
8875 if (DECL_INHERITED_CTOR (fn
))
8877 /* Check for passing ellipsis arguments to an inherited constructor. We
8878 could handle this by open-coding the inherited constructor rather than
8879 defining it, but let's not bother now. */
8880 if (!cp_unevaluated_operand
8882 && cand
->convs
[cand
->num_convs
-1]->ellipsis_p
)
8884 if (complain
& tf_error
)
8886 sorry ("passing arguments to ellipsis of inherited constructor "
8888 inform (DECL_SOURCE_LOCATION (cand
->fn
), "declared here");
8890 return error_mark_node
;
8893 /* A base constructor inheriting from a virtual base doesn't get the
8894 inherited arguments, just this and __vtt. */
8895 if (ctor_omit_inherited_parms (fn
))
8899 /* Avoid actually calling copy constructors and copy assignment operators,
8902 if (! flag_elide_constructors
&& !force_elide
)
8903 /* Do things the hard way. */;
8904 else if (cand
->num_convs
== 1
8905 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8906 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8907 /* It's unsafe to elide the constructor when handling
8908 a noexcept-expression, it may evaluate to the wrong
8909 value (c++/53025). */
8910 && (force_elide
|| cp_noexcept_operand
== 0))
8913 tree arg
= argarray
[num_artificial_parms_for (fn
)];
8915 bool trivial
= trivial_fn_p (fn
);
8917 /* Pull out the real argument, disregarding const-correctness. */
8919 /* Strip the reference binding for the constructor parameter. */
8920 if (CONVERT_EXPR_P (targ
)
8921 && TYPE_REF_P (TREE_TYPE (targ
)))
8922 targ
= TREE_OPERAND (targ
, 0);
8923 /* But don't strip any other reference bindings; binding a temporary to a
8924 reference prevents copy elision. */
8925 while ((CONVERT_EXPR_P (targ
)
8926 && !TYPE_REF_P (TREE_TYPE (targ
)))
8927 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
8928 targ
= TREE_OPERAND (targ
, 0);
8929 if (TREE_CODE (targ
) == ADDR_EXPR
)
8931 targ
= TREE_OPERAND (targ
, 0);
8932 if (!same_type_ignoring_top_level_qualifiers_p
8933 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
8942 arg
= cp_build_fold_indirect_ref (arg
);
8944 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8946 if (CHECKING_P
&& cxx_dialect
>= cxx17
)
8947 gcc_assert (TREE_CODE (arg
) != TARGET_EXPR
8949 /* It's from binding the ref parm to a packed field. */
8950 || convs
[0]->need_temporary_p
8952 /* See unsafe_copy_elision_p. */
8953 || DECL_BASE_CONSTRUCTOR_P (fn
));
8956 bool unsafe
= unsafe_copy_elision_p (fa
, arg
);
8957 bool eliding_temp
= (TREE_CODE (arg
) == TARGET_EXPR
&& !unsafe
);
8959 /* [class.copy]: the copy constructor is implicitly defined even if the
8960 implementation elided its use. But don't warn about deprecation when
8961 eliding a temporary, as then no copy is actually performed. */
8962 warning_sentinel
s (warn_deprecated_copy
, eliding_temp
);
8964 /* The language says this isn't called. */;
8967 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
8968 return error_mark_node
;
8969 already_used
= true;
8972 cp_warn_deprecated_use (fn
, complain
);
8974 /* If we're creating a temp and we already have one, don't create a
8975 new one. If we're not creating a temp but we get one, use
8976 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8977 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8978 temp or an INIT_EXPR otherwise. */
8979 if (is_dummy_object (fa
))
8981 if (TREE_CODE (arg
) == TARGET_EXPR
)
8984 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
8986 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
8989 tree to
= cp_stabilize_reference (cp_build_fold_indirect_ref (fa
));
8991 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
8995 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
8996 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
)
8997 && trivial_fn_p (fn
))
8999 tree to
= cp_stabilize_reference
9000 (cp_build_fold_indirect_ref (argarray
[0]));
9001 tree type
= TREE_TYPE (to
);
9002 tree as_base
= CLASSTYPE_AS_BASE (type
);
9003 tree arg
= argarray
[1];
9004 location_t loc
= cp_expr_loc_or_input_loc (arg
);
9006 if (is_really_empty_class (type
, /*ignore_vptr*/true))
9008 /* Avoid copying empty classes. */
9009 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
9010 TREE_NO_WARNING (val
) = 1;
9012 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
9014 if (is_std_init_list (type
)
9015 && conv_binds_ref_to_prvalue (convs
[1]))
9016 warning_at (loc
, OPT_Winit_list_lifetime
,
9017 "assignment from temporary %<initializer_list%> does "
9018 "not extend the lifetime of the underlying array");
9019 arg
= cp_build_fold_indirect_ref (arg
);
9020 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
9024 /* We must only copy the non-tail padding parts. */
9026 tree array_type
, alias_set
;
9028 arg2
= TYPE_SIZE_UNIT (as_base
);
9029 arg0
= cp_build_addr_expr (to
, complain
);
9031 array_type
= build_array_type (unsigned_char_type_node
,
9033 (size_binop (MINUS_EXPR
,
9034 arg2
, size_int (1))));
9035 alias_set
= build_int_cst (build_pointer_type (type
), 0);
9036 t
= build2 (MODIFY_EXPR
, void_type_node
,
9037 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
9038 build2 (MEM_REF
, array_type
, arg
, alias_set
));
9039 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
9040 TREE_NO_WARNING (val
) = 1;
9043 cp_warn_deprecated_use (fn
, complain
);
9047 else if (trivial_fn_p (fn
))
9049 if (DECL_DESTRUCTOR_P (fn
))
9050 return build_trivial_dtor_call (argarray
[0]);
9051 else if (default_ctor_p (fn
))
9053 if (is_dummy_object (argarray
[0]))
9054 return force_target_expr (DECL_CONTEXT (fn
), void_node
,
9055 no_cleanup_complain
);
9057 return cp_build_fold_indirect_ref (argarray
[0]);
9061 gcc_assert (!force_elide
);
9064 && !mark_used (fn
, complain
))
9065 return error_mark_node
;
9067 /* Warn if the built-in writes to an object of a non-trivial type. */
9068 if (warn_class_memaccess
9069 && vec_safe_length (args
) >= 2
9070 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
9071 maybe_warn_class_memaccess (input_location
, fn
, args
);
9073 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
9076 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
9078 ba_any
, NULL
, complain
);
9079 gcc_assert (binfo
&& binfo
!= error_mark_node
);
9081 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
9083 if (TREE_SIDE_EFFECTS (argarray
[0]))
9084 argarray
[0] = save_expr (argarray
[0]);
9085 t
= build_pointer_type (TREE_TYPE (fn
));
9086 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
9091 /* If FN is marked deprecated, then we've already issued a deprecated-use
9092 warning from mark_used above, so avoid redundantly issuing another one
9093 from build_addr_func. */
9094 warning_sentinel
w (warn_deprecated_decl
);
9096 fn
= build_addr_func (fn
, complain
);
9097 if (fn
== error_mark_node
)
9098 return error_mark_node
;
9101 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
9102 if (call
== error_mark_node
)
9104 if (cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
9106 tree c
= extract_call_expr (call
);
9107 /* build_new_op_1 will clear this when appropriate. */
9108 CALL_EXPR_ORDERED_ARGS (c
) = true;
9112 tree c
= extract_call_expr (call
);
9113 if (TREE_CODE (c
) == CALL_EXPR
)
9114 TREE_NO_WARNING (c
) = 1;
9116 if (TREE_CODE (fn
) == ADDR_EXPR
)
9118 tree fndecl
= STRIP_TEMPLATE (TREE_OPERAND (fn
, 0));
9119 if (TREE_CODE (fndecl
) == FUNCTION_DECL
9120 && DECL_IMMEDIATE_FUNCTION_P (fndecl
)
9121 && cp_unevaluated_operand
== 0
9122 && (current_function_decl
== NULL_TREE
9123 || !DECL_IMMEDIATE_FUNCTION_P (current_function_decl
))
9124 && (current_binding_level
->kind
!= sk_function_parms
9125 || !current_binding_level
->immediate_fn_ctx_p
))
9127 tree obj_arg
= NULL_TREE
;
9128 if (DECL_CONSTRUCTOR_P (fndecl
))
9129 obj_arg
= cand
->first_arg
? cand
->first_arg
: (*args
)[0];
9130 if (obj_arg
&& is_dummy_object (obj_arg
))
9132 call
= build_cplus_new (DECL_CONTEXT (fndecl
), call
, complain
);
9133 obj_arg
= NULL_TREE
;
9135 /* Look through *(const T *)&obj. */
9136 else if (obj_arg
&& TREE_CODE (obj_arg
) == INDIRECT_REF
)
9138 tree addr
= TREE_OPERAND (obj_arg
, 0);
9140 if (TREE_CODE (addr
) == ADDR_EXPR
)
9142 tree typeo
= TREE_TYPE (obj_arg
);
9143 tree typei
= TREE_TYPE (TREE_OPERAND (addr
, 0));
9144 if (same_type_ignoring_top_level_qualifiers_p (typeo
, typei
))
9145 obj_arg
= TREE_OPERAND (addr
, 0);
9148 call
= cxx_constant_value (call
, obj_arg
);
9157 /* Return the DECL of the first non-static subobject of class TYPE
9158 that satisfies the predicate PRED or null if none can be found. */
9160 template <class Predicate
>
9162 first_non_static_field (tree type
, Predicate pred
)
9164 if (!type
|| !CLASS_TYPE_P (type
))
9167 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
9169 if (TREE_CODE (field
) != FIELD_DECL
)
9171 if (TREE_STATIC (field
))
9179 for (tree base_binfo
, binfo
= TYPE_BINFO (type
);
9180 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
9182 tree base
= TREE_TYPE (base_binfo
);
9185 if (tree field
= first_non_static_field (base
, pred
))
9192 struct NonPublicField
9194 bool operator() (const_tree t
)
9196 return DECL_P (t
) && (TREE_PRIVATE (t
) || TREE_PROTECTED (t
));
9200 /* Return the DECL of the first non-public subobject of class TYPE
9201 or null if none can be found. */
9204 first_non_public_field (tree type
)
9206 return first_non_static_field (type
, NonPublicField ());
9209 struct NonTrivialField
9211 bool operator() (const_tree t
)
9213 return !trivial_type_p (DECL_P (t
) ? TREE_TYPE (t
) : t
);
9217 /* Return the DECL of the first non-trivial subobject of class TYPE
9218 or null if none can be found. */
9221 first_non_trivial_field (tree type
)
9223 return first_non_static_field (type
, NonTrivialField ());
9226 } /* unnamed namespace */
9228 /* Return true if all copy and move assignment operator overloads for
9229 class TYPE are trivial and at least one of them is not deleted and,
9230 when ACCESS is set, accessible. Return false otherwise. Set
9231 HASASSIGN to true when the TYPE has a (not necessarily trivial)
9232 copy or move assignment. */
9235 has_trivial_copy_assign_p (tree type
, bool access
, bool *hasassign
)
9237 tree fns
= get_class_binding (type
, assign_op_identifier
);
9238 bool all_trivial
= true;
9240 /* Iterate over overloads of the assignment operator, checking
9241 accessible copy assignments for triviality. */
9243 for (ovl_iterator
oi (fns
); oi
; ++oi
)
9247 /* Skip operators that aren't copy assignments. */
9251 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
9252 || accessible_p (TYPE_BINFO (type
), f
, true));
9254 /* Skip template assignment operators and deleted functions. */
9255 if (TREE_CODE (f
) != FUNCTION_DECL
|| DECL_DELETED_FN (f
))
9261 if (!accessible
|| !trivial_fn_p (f
))
9262 all_trivial
= false;
9264 /* Break early when both properties have been determined. */
9265 if (*hasassign
&& !all_trivial
)
9269 /* Return true if they're all trivial and one of the expressions
9270 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
9271 tree ref
= cp_build_reference_type (type
, false);
9273 && (is_trivially_xible (MODIFY_EXPR
, type
, type
)
9274 || is_trivially_xible (MODIFY_EXPR
, type
, ref
)));
9277 /* Return true if all copy and move ctor overloads for class TYPE are
9278 trivial and at least one of them is not deleted and, when ACCESS is
9279 set, accessible. Return false otherwise. Set each element of HASCTOR[]
9280 to true when the TYPE has a (not necessarily trivial) default and copy
9281 (or move) ctor, respectively. */
9284 has_trivial_copy_p (tree type
, bool access
, bool hasctor
[2])
9286 tree fns
= get_class_binding (type
, complete_ctor_identifier
);
9287 bool all_trivial
= true;
9289 for (ovl_iterator
oi (fns
); oi
; ++oi
)
9293 /* Skip template constructors. */
9294 if (TREE_CODE (f
) != FUNCTION_DECL
)
9297 bool cpy_or_move_ctor_p
= copy_fn_p (f
);
9299 /* Skip ctors other than default, copy, and move. */
9300 if (!cpy_or_move_ctor_p
&& !default_ctor_p (f
))
9303 if (DECL_DELETED_FN (f
))
9306 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
9307 || accessible_p (TYPE_BINFO (type
), f
, true));
9310 hasctor
[cpy_or_move_ctor_p
] = true;
9312 if (cpy_or_move_ctor_p
&& (!accessible
|| !trivial_fn_p (f
)))
9313 all_trivial
= false;
9315 /* Break early when both properties have been determined. */
9316 if (hasctor
[0] && hasctor
[1] && !all_trivial
)
9323 /* Issue a warning on a call to the built-in function FNDECL if it is
9324 a raw memory write whose destination is not an object of (something
9325 like) trivial or standard layout type with a non-deleted assignment
9326 and copy ctor. Detects const correctness violations, corrupting
9327 references, virtual table pointers, and bypassing non-trivial
9331 maybe_warn_class_memaccess (location_t loc
, tree fndecl
,
9332 const vec
<tree
, va_gc
> *args
)
9334 /* Except for bcopy where it's second, the destination pointer is
9335 the first argument for all functions handled here. Compute
9336 the index of the destination and source arguments. */
9337 unsigned dstidx
= DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_BCOPY
;
9338 unsigned srcidx
= !dstidx
;
9340 tree dest
= (*args
)[dstidx
];
9341 if (!TREE_TYPE (dest
)
9342 || (TREE_CODE (TREE_TYPE (dest
)) != ARRAY_TYPE
9343 && !INDIRECT_TYPE_P (TREE_TYPE (dest
))))
9346 tree srctype
= NULL_TREE
;
9348 /* Determine the type of the pointed-to object and whether it's
9349 a complete class type. */
9350 tree desttype
= TREE_TYPE (TREE_TYPE (dest
));
9352 if (!desttype
|| !COMPLETE_TYPE_P (desttype
) || !CLASS_TYPE_P (desttype
))
9355 /* Check to see if the raw memory call is made by a non-static member
9356 function with THIS as the destination argument for the destination
9357 type. If so, and if the class has no non-trivial bases or members,
9358 be more permissive. */
9359 if (current_function_decl
9360 && DECL_NONSTATIC_MEMBER_FUNCTION_P (current_function_decl
)
9361 && is_this_parameter (tree_strip_nop_conversions (dest
)))
9363 tree ctx
= DECL_CONTEXT (current_function_decl
);
9364 bool special
= same_type_ignoring_top_level_qualifiers_p (ctx
, desttype
);
9365 tree binfo
= TYPE_BINFO (ctx
);
9368 && !BINFO_VTABLE (binfo
)
9369 && !first_non_trivial_field (desttype
))
9373 /* True if the class is trivial. */
9374 bool trivial
= trivial_type_p (desttype
);
9376 /* Set to true if DESTYPE has an accessible copy assignment. */
9377 bool hasassign
= false;
9378 /* True if all of the class' overloaded copy assignment operators
9379 are all trivial (and not deleted) and at least one of them is
9381 bool trivassign
= has_trivial_copy_assign_p (desttype
, true, &hasassign
);
9383 /* Set to true if DESTTYPE has an accessible default and copy ctor,
9385 bool hasctors
[2] = { false, false };
9387 /* True if all of the class' overloaded copy constructors are all
9388 trivial (and not deleted) and at least one of them is accessible. */
9389 bool trivcopy
= has_trivial_copy_p (desttype
, true, hasctors
);
9391 /* Set FLD to the first private/protected member of the class. */
9392 tree fld
= trivial
? first_non_public_field (desttype
) : NULL_TREE
;
9394 /* The warning format string. */
9395 const char *warnfmt
= NULL
;
9396 /* A suggested alternative to offer instead of the raw memory call.
9397 Empty string when none can be come up with. */
9398 const char *suggest
= "";
9399 bool warned
= false;
9401 switch (DECL_FUNCTION_CODE (fndecl
))
9403 case BUILT_IN_MEMSET
:
9404 if (!integer_zerop (maybe_constant_value ((*args
)[1])))
9406 /* Diagnose setting non-copy-assignable or non-trivial types,
9407 or types with a private member, to (potentially) non-zero
9408 bytes. Since the value of the bytes being written is unknown,
9409 suggest using assignment instead (if one exists). Also warn
9410 for writes into objects for which zero-initialization doesn't
9411 mean all bits clear (pointer-to-member data, where null is all
9412 bits set). Since the value being written is (most likely)
9413 non-zero, simply suggest assignment (but not copy assignment). */
9414 suggest
= "; use assignment instead";
9416 warnfmt
= G_("%qD writing to an object of type %#qT with "
9417 "no trivial copy-assignment");
9419 warnfmt
= G_("%qD writing to an object of non-trivial type %#qT%s");
9422 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
9423 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9424 "%qD writing to an object of type %#qT with "
9426 fndecl
, desttype
, access
, fld
);
9428 else if (!zero_init_p (desttype
))
9429 warnfmt
= G_("%qD writing to an object of type %#qT containing "
9430 "a pointer to data member%s");
9436 case BUILT_IN_BZERO
:
9437 /* Similarly to the above, diagnose clearing non-trivial or non-
9438 standard layout objects, or objects of types with no assignmenmt.
9439 Since the value being written is known to be zero, suggest either
9440 copy assignment, copy ctor, or default ctor as an alternative,
9441 depending on what's available. */
9443 if (hasassign
&& hasctors
[0])
9444 suggest
= G_("; use assignment or value-initialization instead");
9446 suggest
= G_("; use assignment instead");
9447 else if (hasctors
[0])
9448 suggest
= G_("; use value-initialization instead");
9451 warnfmt
= G_("%qD clearing an object of type %#qT with "
9452 "no trivial copy-assignment%s");
9454 warnfmt
= G_("%qD clearing an object of non-trivial type %#qT%s");
9455 else if (!zero_init_p (desttype
))
9456 warnfmt
= G_("%qD clearing an object of type %#qT containing "
9457 "a pointer-to-member%s");
9460 case BUILT_IN_BCOPY
:
9461 case BUILT_IN_MEMCPY
:
9462 case BUILT_IN_MEMMOVE
:
9463 case BUILT_IN_MEMPCPY
:
9464 /* Determine the type of the source object. */
9465 srctype
= TREE_TYPE ((*args
)[srcidx
]);
9466 if (!srctype
|| !INDIRECT_TYPE_P (srctype
))
9467 srctype
= void_type_node
;
9469 srctype
= TREE_TYPE (srctype
);
9471 /* Since it's impossible to determine wheter the byte copy is
9472 being used in place of assignment to an existing object or
9473 as a substitute for initialization, assume it's the former.
9474 Determine the best alternative to use instead depending on
9475 what's not deleted. */
9476 if (hasassign
&& hasctors
[1])
9477 suggest
= G_("; use copy-assignment or copy-initialization instead");
9479 suggest
= G_("; use copy-assignment instead");
9480 else if (hasctors
[1])
9481 suggest
= G_("; use copy-initialization instead");
9484 warnfmt
= G_("%qD writing to an object of type %#qT with no trivial "
9485 "copy-assignment%s");
9486 else if (!trivially_copyable_p (desttype
))
9487 warnfmt
= G_("%qD writing to an object of non-trivially copyable "
9490 warnfmt
= G_("%qD writing to an object with a deleted copy constructor");
9493 && !VOID_TYPE_P (srctype
)
9494 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
9495 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
9498 /* Warn when copying into a non-trivial object from an object
9499 of a different type other than void or char. */
9500 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9501 "%qD copying an object of non-trivial type "
9502 "%#qT from an array of %#qT",
9503 fndecl
, desttype
, srctype
);
9506 && !VOID_TYPE_P (srctype
)
9507 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
9508 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
9511 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
9512 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9513 "%qD copying an object of type %#qT with "
9514 "%qs member %qD from an array of %#qT; use "
9515 "assignment or copy-initialization instead",
9516 fndecl
, desttype
, access
, fld
, srctype
);
9518 else if (!trivial
&& vec_safe_length (args
) > 2)
9520 tree sz
= maybe_constant_value ((*args
)[2]);
9521 if (!tree_fits_uhwi_p (sz
))
9524 /* Finally, warn on partial copies. */
9525 unsigned HOST_WIDE_INT typesize
9526 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype
));
9527 if (unsigned HOST_WIDE_INT partial
= tree_to_uhwi (sz
) % typesize
)
9528 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9529 (typesize
- partial
> 1
9530 ? G_("%qD writing to an object of "
9531 "a non-trivial type %#qT leaves %wu "
9533 : G_("%qD writing to an object of "
9534 "a non-trivial type %#qT leaves %wu "
9536 fndecl
, desttype
, typesize
- partial
);
9540 case BUILT_IN_REALLOC
:
9542 if (!trivially_copyable_p (desttype
))
9543 warnfmt
= G_("%qD moving an object of non-trivially copyable type "
9544 "%#qT; use %<new%> and %<delete%> instead");
9546 warnfmt
= G_("%qD moving an object of type %#qT with deleted copy "
9547 "constructor; use %<new%> and %<delete%> instead");
9548 else if (!get_dtor (desttype
, tf_none
))
9549 warnfmt
= G_("%qD moving an object of type %#qT with deleted "
9553 tree sz
= maybe_constant_value ((*args
)[1]);
9554 if (TREE_CODE (sz
) == INTEGER_CST
9555 && tree_int_cst_lt (sz
, TYPE_SIZE_UNIT (desttype
)))
9556 /* Finally, warn on reallocation into insufficient space. */
9557 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9558 "%qD moving an object of non-trivial type "
9559 "%#qT and size %E into a region of size %E",
9560 fndecl
, desttype
, TYPE_SIZE_UNIT (desttype
),
9572 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9573 warnfmt
, fndecl
, desttype
, suggest
);
9575 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9576 warnfmt
, fndecl
, desttype
);
9580 inform (location_of (desttype
), "%#qT declared here", desttype
);
9583 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
9584 If FN is the result of resolving an overloaded target built-in,
9585 ORIG_FNDECL is the original function decl, otherwise it is null.
9586 This function performs no overload resolution, conversion, or other
9587 high-level operations. */
9590 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
9591 tsubst_flags_t complain
, tree orig_fndecl
)
9595 /* Remember roughly where this call is. */
9596 location_t loc
= cp_expr_loc_or_input_loc (fn
);
9597 fn
= build_call_a (fn
, nargs
, argarray
);
9598 SET_EXPR_LOCATION (fn
, loc
);
9600 fndecl
= get_callee_fndecl (fn
);
9602 orig_fndecl
= fndecl
;
9604 /* Check that arguments to builtin functions match the expectations. */
9606 && !processing_template_decl
9607 && fndecl_built_in_p (fndecl
))
9611 /* We need to take care that values to BUILT_IN_NORMAL
9613 for (i
= 0; i
< nargs
; i
++)
9614 argarray
[i
] = maybe_constant_value (argarray
[i
]);
9616 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
9617 orig_fndecl
, nargs
, argarray
))
9618 return error_mark_node
;
9621 if (VOID_TYPE_P (TREE_TYPE (fn
)))
9624 /* 5.2.2/11: If a function call is a prvalue of object type: if the
9625 function call is either the operand of a decltype-specifier or the
9626 right operand of a comma operator that is the operand of a
9627 decltype-specifier, a temporary object is not introduced for the
9628 prvalue. The type of the prvalue may be incomplete. */
9629 if (!(complain
& tf_decltype
))
9631 fn
= require_complete_type_sfinae (fn
, complain
);
9632 if (fn
== error_mark_node
)
9633 return error_mark_node
;
9635 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
9637 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
9638 maybe_warn_parm_abi (TREE_TYPE (fn
), loc
);
9641 return convert_from_reference (fn
);
9644 /* Returns the value to use for the in-charge parameter when making a
9645 call to a function with the indicated NAME.
9647 FIXME:Can't we find a neater way to do this mapping? */
9650 in_charge_arg_for_name (tree name
)
9652 if (IDENTIFIER_CTOR_P (name
))
9654 if (name
== complete_ctor_identifier
)
9655 return integer_one_node
;
9656 gcc_checking_assert (name
== base_ctor_identifier
);
9660 if (name
== complete_dtor_identifier
)
9661 return integer_two_node
;
9662 else if (name
== deleting_dtor_identifier
)
9663 return integer_three_node
;
9664 gcc_checking_assert (name
== base_dtor_identifier
);
9667 return integer_zero_node
;
9670 /* We've built up a constructor call RET. Complain if it delegates to the
9671 constructor we're currently compiling. */
9674 check_self_delegation (tree ret
)
9676 if (TREE_CODE (ret
) == TARGET_EXPR
)
9677 ret
= TARGET_EXPR_INITIAL (ret
);
9678 tree fn
= cp_get_callee_fndecl_nofold (ret
);
9679 if (fn
&& DECL_ABSTRACT_ORIGIN (fn
) == current_function_decl
)
9680 error ("constructor delegates to itself");
9683 /* Build a call to a constructor, destructor, or an assignment
9684 operator for INSTANCE, an expression with class type. NAME
9685 indicates the special member function to call; *ARGS are the
9686 arguments. ARGS may be NULL. This may change ARGS. BINFO
9687 indicates the base of INSTANCE that is to be passed as the `this'
9688 parameter to the member function called.
9690 FLAGS are the LOOKUP_* flags to use when processing the call.
9692 If NAME indicates a complete object constructor, INSTANCE may be
9693 NULL_TREE. In this case, the caller will call build_cplus_new to
9694 store the newly constructed object into a VAR_DECL. */
9697 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
9698 tree binfo
, int flags
, tsubst_flags_t complain
)
9701 /* The type of the subobject to be constructed or destroyed. */
9703 vec
<tree
, va_gc
> *allocated
= NULL
;
9706 gcc_assert (IDENTIFIER_CDTOR_P (name
) || name
== assign_op_identifier
);
9708 if (error_operand_p (instance
))
9709 return error_mark_node
;
9711 if (IDENTIFIER_DTOR_P (name
))
9713 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
9714 if (!type_build_dtor_call (TREE_TYPE (instance
)))
9715 /* Shortcut to avoid lazy destructor declaration. */
9716 return build_trivial_dtor_call (instance
);
9721 /* Resolve the name. */
9722 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
9723 return error_mark_node
;
9725 binfo
= TYPE_BINFO (binfo
);
9728 gcc_assert (binfo
!= NULL_TREE
);
9730 class_type
= BINFO_TYPE (binfo
);
9732 /* Handle the special case where INSTANCE is NULL_TREE. */
9733 if (name
== complete_ctor_identifier
&& !instance
)
9734 instance
= build_dummy_object (class_type
);
9737 /* Convert to the base class, if necessary. */
9738 if (!same_type_ignoring_top_level_qualifiers_p
9739 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
9741 if (IDENTIFIER_CDTOR_P (name
))
9742 /* For constructors and destructors, either the base is
9743 non-virtual, or it is virtual but we are doing the
9744 conversion from a constructor or destructor for the
9745 complete object. In either case, we can convert
9747 instance
= convert_to_base_statically (instance
, binfo
);
9750 /* However, for assignment operators, we must convert
9751 dynamically if the base is virtual. */
9752 gcc_checking_assert (name
== assign_op_identifier
);
9753 instance
= build_base_path (PLUS_EXPR
, instance
,
9754 binfo
, /*nonnull=*/1, complain
);
9759 gcc_assert (instance
!= NULL_TREE
);
9761 /* In C++17, "If the initializer expression is a prvalue and the
9762 cv-unqualified version of the source type is the same class as the class
9763 of the destination, the initializer expression is used to initialize the
9764 destination object." Handle that here to avoid doing overload
9766 if (cxx_dialect
>= cxx17
9767 && args
&& vec_safe_length (*args
) == 1
9768 && name
== complete_ctor_identifier
)
9770 tree arg
= (**args
)[0];
9772 if (BRACE_ENCLOSED_INITIALIZER_P (arg
)
9773 && !TYPE_HAS_LIST_CTOR (class_type
)
9774 && CONSTRUCTOR_NELTS (arg
) == 1)
9775 arg
= CONSTRUCTOR_ELT (arg
, 0)->value
;
9777 if ((TREE_CODE (arg
) == TARGET_EXPR
9778 || TREE_CODE (arg
) == CONSTRUCTOR
)
9779 && (same_type_ignoring_top_level_qualifiers_p
9780 (class_type
, TREE_TYPE (arg
))))
9782 if (is_dummy_object (instance
))
9784 else if (TREE_CODE (arg
) == TARGET_EXPR
)
9785 TARGET_EXPR_DIRECT_INIT_P (arg
) = true;
9787 if ((complain
& tf_error
)
9788 && (flags
& LOOKUP_DELEGATING_CONS
))
9789 check_self_delegation (arg
);
9790 /* Avoid change of behavior on Wunused-var-2.C. */
9791 instance
= mark_lvalue_use (instance
);
9792 return build2 (INIT_EXPR
, class_type
, instance
, arg
);
9796 fns
= lookup_fnfields (binfo
, name
, 1);
9798 /* When making a call to a constructor or destructor for a subobject
9799 that uses virtual base classes, pass down a pointer to a VTT for
9801 if ((name
== base_ctor_identifier
9802 || name
== base_dtor_identifier
)
9803 && CLASSTYPE_VBASECLASSES (class_type
))
9808 /* If the current function is a complete object constructor
9809 or destructor, then we fetch the VTT directly.
9810 Otherwise, we look it up using the VTT we were given. */
9811 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
9812 vtt
= decay_conversion (vtt
, complain
);
9813 if (vtt
== error_mark_node
)
9814 return error_mark_node
;
9815 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
9816 if (BINFO_SUBVTT_INDEX (binfo
))
9817 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
9823 allocated
= make_tree_vector ();
9827 vec_safe_insert (*args
, 0, sub_vtt
);
9830 ret
= build_new_method_call (instance
, fns
, args
,
9831 TYPE_BINFO (BINFO_TYPE (binfo
)),
9835 if (allocated
!= NULL
)
9836 release_tree_vector (allocated
);
9838 if ((complain
& tf_error
)
9839 && (flags
& LOOKUP_DELEGATING_CONS
)
9840 && name
== complete_ctor_identifier
)
9841 check_self_delegation (ret
);
9846 /* Return the NAME, as a C string. The NAME indicates a function that
9847 is a member of TYPE. *FREE_P is set to true if the caller must
9848 free the memory returned.
9850 Rather than go through all of this, we should simply set the names
9851 of constructors and destructors appropriately, and dispense with
9852 ctor_identifier, dtor_identifier, etc. */
9855 name_as_c_string (tree name
, tree type
, bool *free_p
)
9857 const char *pretty_name
;
9859 /* Assume that we will not allocate memory. */
9861 /* Constructors and destructors are special. */
9862 if (IDENTIFIER_CDTOR_P (name
))
9865 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
)));
9866 /* For a destructor, add the '~'. */
9867 if (IDENTIFIER_DTOR_P (name
))
9869 pretty_name
= concat ("~", pretty_name
, NULL
);
9870 /* Remember that we need to free the memory allocated. */
9874 else if (IDENTIFIER_CONV_OP_P (name
))
9876 pretty_name
= concat ("operator ",
9877 type_as_string_translate (TREE_TYPE (name
),
9878 TFF_PLAIN_IDENTIFIER
),
9880 /* Remember that we need to free the memory allocated. */
9884 pretty_name
= identifier_to_locale (IDENTIFIER_POINTER (name
));
9886 return CONST_CAST (char *, pretty_name
);
9889 /* If CANDIDATES contains exactly one candidate, return it, otherwise
9892 static z_candidate
*
9893 single_z_candidate (z_candidate
*candidates
)
9895 if (candidates
== NULL
)
9898 if (candidates
->next
)
9904 /* If CANDIDATE is invalid due to a bad argument type, return the
9905 pertinent conversion_info.
9907 Otherwise, return NULL. */
9909 static const conversion_info
*
9910 maybe_get_bad_conversion_for_unmatched_call (const z_candidate
*candidate
)
9912 /* Must be an rr_arg_conversion or rr_bad_arg_conversion. */
9913 rejection_reason
*r
= candidate
->reason
;
9923 case rr_arg_conversion
:
9924 return &r
->u
.conversion
;
9926 case rr_bad_arg_conversion
:
9927 return &r
->u
.bad_conversion
;
9931 /* Issue an error and note complaining about a bad argument type at a
9932 callsite with a single candidate FNDECL.
9934 ARG_LOC is the location of the argument (or UNKNOWN_LOCATION, in which
9935 case input_location is used).
9936 FROM_TYPE is the type of the actual argument; TO_TYPE is the type of
9937 the formal parameter. */
9940 complain_about_bad_argument (location_t arg_loc
,
9941 tree from_type
, tree to_type
,
9942 tree fndecl
, int parmnum
)
9944 auto_diagnostic_group d
;
9945 range_label_for_type_mismatch
rhs_label (from_type
, to_type
);
9946 range_label
*label
= &rhs_label
;
9947 if (arg_loc
== UNKNOWN_LOCATION
)
9949 arg_loc
= input_location
;
9952 gcc_rich_location
richloc (arg_loc
, label
);
9954 "cannot convert %qH to %qI",
9955 from_type
, to_type
);
9956 maybe_inform_about_fndecl_for_bogus_argument_init (fndecl
,
9960 /* Subroutine of build_new_method_call_1, for where there are no viable
9961 candidates for the call. */
9964 complain_about_no_candidates_for_method_call (tree instance
,
9965 z_candidate
*candidates
,
9966 tree explicit_targs
,
9968 tree optype
, tree name
,
9969 bool skip_first_for_error
,
9970 vec
<tree
, va_gc
> *user_args
)
9972 auto_diagnostic_group d
;
9973 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
9974 cxx_incomplete_type_error (instance
, basetype
);
9976 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9977 basetype
, optype
, build_tree_list_vec (user_args
),
9978 TREE_TYPE (instance
));
9981 /* Special-case for when there's a single candidate that's failing
9982 due to a bad argument type. */
9983 if (z_candidate
*candidate
= single_z_candidate (candidates
))
9984 if (const conversion_info
*conv
9985 = maybe_get_bad_conversion_for_unmatched_call (candidate
))
9987 tree from_type
= conv
->from
;
9988 if (!TYPE_P (conv
->from
))
9989 from_type
= lvalue_type (conv
->from
);
9990 complain_about_bad_argument (conv
->loc
,
9991 from_type
, conv
->to_type
,
9992 candidate
->fn
, conv
->n_arg
);
9996 tree arglist
= build_tree_list_vec (user_args
);
9997 tree errname
= name
;
9998 bool twiddle
= false;
9999 if (IDENTIFIER_CDTOR_P (errname
))
10001 twiddle
= IDENTIFIER_DTOR_P (errname
);
10002 errname
= constructor_name (basetype
);
10004 if (explicit_targs
)
10005 errname
= lookup_template_function (errname
, explicit_targs
);
10006 if (skip_first_for_error
)
10007 arglist
= TREE_CHAIN (arglist
);
10008 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
10009 basetype
, &"~"[!twiddle
], errname
, arglist
,
10010 TREE_TYPE (instance
));
10012 print_z_candidates (location_of (name
), candidates
);
10015 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
10016 be set, upon return, to the function called. ARGS may be NULL.
10017 This may change ARGS. */
10020 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
10021 tree conversion_path
, int flags
,
10022 tree
*fn_p
, tsubst_flags_t complain
)
10024 struct z_candidate
*candidates
= 0, *cand
;
10025 tree explicit_targs
= NULL_TREE
;
10026 tree basetype
= NULL_TREE
;
10029 tree first_mem_arg
= NULL_TREE
;
10031 bool skip_first_for_error
;
10032 vec
<tree
, va_gc
> *user_args
;
10035 int template_only
= 0;
10037 tree orig_instance
;
10039 vec
<tree
, va_gc
> *orig_args
= NULL
;
10042 gcc_assert (instance
!= NULL_TREE
);
10044 /* We don't know what function we're going to call, yet. */
10048 if (error_operand_p (instance
)
10049 || !fns
|| error_operand_p (fns
))
10050 return error_mark_node
;
10052 if (!BASELINK_P (fns
))
10054 if (complain
& tf_error
)
10055 error ("call to non-function %qD", fns
);
10056 return error_mark_node
;
10059 orig_instance
= instance
;
10062 /* Dismantle the baselink to collect all the information we need. */
10063 if (!conversion_path
)
10064 conversion_path
= BASELINK_BINFO (fns
);
10065 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
10066 optype
= BASELINK_OPTYPE (fns
);
10067 fns
= BASELINK_FUNCTIONS (fns
);
10068 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
10070 explicit_targs
= TREE_OPERAND (fns
, 1);
10071 fns
= TREE_OPERAND (fns
, 0);
10074 gcc_assert (OVL_P (fns
));
10075 fn
= OVL_FIRST (fns
);
10076 name
= DECL_NAME (fn
);
10078 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
10079 gcc_assert (CLASS_TYPE_P (basetype
));
10081 user_args
= args
== NULL
? NULL
: *args
;
10082 /* Under DR 147 A::A() is an invalid constructor call,
10083 not a functional cast. */
10084 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
10086 if (! (complain
& tf_error
))
10087 return error_mark_node
;
10089 basetype
= DECL_CONTEXT (fn
);
10090 name
= constructor_name (basetype
);
10091 auto_diagnostic_group d
;
10092 if (permerror (input_location
,
10093 "cannot call constructor %<%T::%D%> directly",
10095 inform (input_location
, "for a function-style cast, remove the "
10096 "redundant %<::%D%>", name
);
10097 call
= build_functional_cast (input_location
, basetype
,
10098 build_tree_list_vec (user_args
),
10103 if (processing_template_decl
)
10105 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
10106 instance
= build_non_dependent_expr (instance
);
10108 make_args_non_dependent (*args
);
10111 /* Process the argument list. */
10112 if (args
!= NULL
&& *args
!= NULL
)
10114 *args
= resolve_args (*args
, complain
);
10116 return error_mark_node
;
10120 /* Consider the object argument to be used even if we end up selecting a
10121 static member function. */
10122 instance
= mark_type_use (instance
);
10124 /* Figure out whether to skip the first argument for the error
10125 message we will display to users if an error occurs. We don't
10126 want to display any compiler-generated arguments. The "this"
10127 pointer hasn't been added yet. However, we must remove the VTT
10128 pointer if this is a call to a base-class constructor or
10130 skip_first_for_error
= false;
10131 if (IDENTIFIER_CDTOR_P (name
))
10133 /* Callers should explicitly indicate whether they want to ctor
10134 the complete object or just the part without virtual bases. */
10135 gcc_assert (name
!= ctor_identifier
);
10137 /* Remove the VTT pointer, if present. */
10138 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
10139 && CLASSTYPE_VBASECLASSES (basetype
))
10140 skip_first_for_error
= true;
10142 /* It's OK to call destructors and constructors on cv-qualified
10143 objects. Therefore, convert the INSTANCE to the unqualified
10144 type, if necessary. */
10145 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
10147 instance
= build_this (instance
);
10148 instance
= build_nop (build_pointer_type (basetype
), instance
);
10149 instance
= build_fold_indirect_ref (instance
);
10153 gcc_assert (!DECL_DESTRUCTOR_P (fn
) && !DECL_CONSTRUCTOR_P (fn
));
10155 /* For the overload resolution we need to find the actual `this`
10156 that would be captured if the call turns out to be to a
10157 non-static member function. Do not actually capture it at this
10159 if (DECL_CONSTRUCTOR_P (fn
))
10160 /* Constructors don't use the enclosing 'this'. */
10161 first_mem_arg
= instance
;
10163 first_mem_arg
= maybe_resolve_dummy (instance
, false);
10165 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10166 p
= conversion_obstack_alloc (0);
10168 /* The number of arguments artificial parms in ARGS; we subtract one because
10169 there's no 'this' in ARGS. */
10170 unsigned skip
= num_artificial_parms_for (fn
) - 1;
10172 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
10173 initializer, not T({ }). */
10174 if (DECL_CONSTRUCTOR_P (fn
)
10175 && vec_safe_length (user_args
) > skip
10176 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
10178 tree init_list
= (*user_args
)[skip
];
10179 tree init
= NULL_TREE
;
10181 gcc_assert (user_args
->length () == skip
+ 1
10182 && !(flags
& LOOKUP_ONLYCONVERTING
));
10184 /* If the initializer list has no elements and T is a class type with
10185 a default constructor, the object is value-initialized. Handle
10186 this here so we don't need to handle it wherever we use
10187 build_special_member_call. */
10188 if (CONSTRUCTOR_NELTS (init_list
) == 0
10189 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
10190 /* For a user-provided default constructor, use the normal
10191 mechanisms so that protected access works. */
10192 && type_has_non_user_provided_default_constructor (basetype
)
10193 && !processing_template_decl
)
10194 init
= build_value_init (basetype
, complain
);
10196 /* If BASETYPE is an aggregate, we need to do aggregate
10198 else if (CP_AGGREGATE_TYPE_P (basetype
))
10200 init
= reshape_init (basetype
, init_list
, complain
);
10201 init
= digest_init (basetype
, init
, complain
);
10206 if (is_dummy_object (instance
))
10207 return get_target_expr_sfinae (init
, complain
);
10208 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
10209 TREE_SIDE_EFFECTS (init
) = true;
10213 /* Otherwise go ahead with overload resolution. */
10214 add_list_candidates (fns
, first_mem_arg
, user_args
,
10215 basetype
, explicit_targs
, template_only
,
10216 conversion_path
, access_binfo
, flags
,
10217 &candidates
, complain
);
10220 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
10221 explicit_targs
, template_only
, conversion_path
,
10222 access_binfo
, flags
, &candidates
, complain
);
10224 any_viable_p
= false;
10225 candidates
= splice_viable (candidates
, false, &any_viable_p
);
10229 /* [dcl.init], 17.6.2.2:
10231 Otherwise, if no constructor is viable, the destination type is
10232 a (possibly cv-qualified) aggregate class A, and the initializer
10233 is a parenthesized expression-list, the object is initialized as
10236 We achieve this by building up a CONSTRUCTOR, as for list-init,
10237 and setting CONSTRUCTOR_IS_PAREN_INIT to distinguish between
10239 if (DECL_CONSTRUCTOR_P (fn
)
10240 && !(flags
& LOOKUP_ONLYCONVERTING
)
10241 && cxx_dialect
>= cxx2a
10242 && CP_AGGREGATE_TYPE_P (basetype
)
10243 && !user_args
->is_empty ())
10245 /* Create a CONSTRUCTOR from ARGS, e.g. {1, 2} from <1, 2>. */
10246 tree list
= build_tree_list_vec (user_args
);
10247 tree ctor
= build_constructor_from_list (init_list_type_node
, list
);
10248 CONSTRUCTOR_IS_DIRECT_INIT (ctor
) = true;
10249 CONSTRUCTOR_IS_PAREN_INIT (ctor
) = true;
10250 if (is_dummy_object (instance
))
10254 ctor
= digest_init (basetype
, ctor
, complain
);
10255 if (ctor
== error_mark_node
)
10256 return error_mark_node
;
10257 ctor
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, ctor
);
10258 TREE_SIDE_EFFECTS (ctor
) = true;
10262 if (complain
& tf_error
)
10263 complain_about_no_candidates_for_method_call (instance
, candidates
,
10264 explicit_targs
, basetype
,
10266 skip_first_for_error
,
10268 call
= error_mark_node
;
10272 cand
= tourney (candidates
, complain
);
10279 if (complain
& tf_error
)
10281 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
10282 arglist
= build_tree_list_vec (user_args
);
10283 if (skip_first_for_error
)
10284 arglist
= TREE_CHAIN (arglist
);
10285 auto_diagnostic_group d
;
10286 if (!any_strictly_viable (candidates
))
10287 error ("no matching function for call to %<%s(%A)%>",
10288 pretty_name
, arglist
);
10290 error ("call of overloaded %<%s(%A)%> is ambiguous",
10291 pretty_name
, arglist
);
10292 print_z_candidates (location_of (name
), candidates
);
10294 free (pretty_name
);
10296 call
= error_mark_node
;
10303 if (!(flags
& LOOKUP_NONVIRTUAL
)
10304 && DECL_PURE_VIRTUAL_P (fn
)
10305 && instance
== current_class_ref
10306 && (complain
& tf_warning
))
10308 /* This is not an error, it is runtime undefined
10310 if (!current_function_decl
)
10311 warning (0, "pure virtual %q#D called from "
10312 "non-static data member initializer", fn
);
10313 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
10314 || DECL_DESTRUCTOR_P (current_function_decl
))
10315 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
10316 ? G_("pure virtual %q#D called from constructor")
10317 : G_("pure virtual %q#D called from destructor")),
10321 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
10322 && !DECL_CONSTRUCTOR_P (fn
)
10323 && is_dummy_object (instance
))
10325 instance
= maybe_resolve_dummy (instance
, true);
10326 if (instance
== error_mark_node
)
10327 call
= error_mark_node
;
10328 else if (!is_dummy_object (instance
))
10330 /* We captured 'this' in the current lambda now that
10331 we know we really need it. */
10332 cand
->first_arg
= instance
;
10334 else if (any_dependent_bases_p ())
10335 /* We can't tell until instantiation time whether we can use
10336 *this as the implicit object argument. */;
10339 if (complain
& tf_error
)
10340 error ("cannot call member function %qD without object",
10342 call
= error_mark_node
;
10346 if (call
!= error_mark_node
)
10348 if (explicit_targs
)
10349 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
10350 /* Now we know what function is being called. */
10353 /* Build the actual CALL_EXPR. */
10354 call
= build_over_call (cand
, flags
, complain
);
10355 /* In an expression of the form `a->f()' where `f' turns
10356 out to be a static member function, `a' is
10357 none-the-less evaluated. */
10358 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
10359 && !is_dummy_object (instance
)
10360 && TREE_SIDE_EFFECTS (instance
))
10362 /* But avoid the implicit lvalue-rvalue conversion when 'a'
10365 if (TREE_THIS_VOLATILE (a
))
10366 a
= build_this (a
);
10367 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
), a
, call
);
10369 else if (call
!= error_mark_node
10370 && DECL_DESTRUCTOR_P (cand
->fn
)
10371 && !VOID_TYPE_P (TREE_TYPE (call
)))
10372 /* An explicit call of the form "x->~X()" has type
10373 "void". However, on platforms where destructors
10374 return "this" (i.e., those where
10375 targetm.cxx.cdtor_returns_this is true), such calls
10376 will appear to have a return value of pointer type
10377 to the low-level call machinery. We do not want to
10378 change the low-level machinery, since we want to be
10379 able to optimize "delete f()" on such platforms as
10380 "operator delete(~X(f()))" (rather than generating
10381 "t = f(), ~X(t), operator delete (t)"). */
10382 call
= build_nop (void_type_node
, call
);
10387 if (processing_template_decl
&& call
!= error_mark_node
)
10389 bool cast_to_void
= false;
10391 if (TREE_CODE (call
) == COMPOUND_EXPR
)
10392 call
= TREE_OPERAND (call
, 1);
10393 else if (TREE_CODE (call
) == NOP_EXPR
)
10395 cast_to_void
= true;
10396 call
= TREE_OPERAND (call
, 0);
10398 if (INDIRECT_REF_P (call
))
10399 call
= TREE_OPERAND (call
, 0);
10400 call
= (build_min_non_dep_call_vec
10402 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
10403 orig_instance
, orig_fns
, NULL_TREE
),
10405 SET_EXPR_LOCATION (call
, input_location
);
10406 call
= convert_from_reference (call
);
10408 call
= build_nop (void_type_node
, call
);
10411 /* Free all the conversions we allocated. */
10412 obstack_free (&conversion_obstack
, p
);
10414 if (orig_args
!= NULL
)
10415 release_tree_vector (orig_args
);
10420 /* Wrapper for above. */
10423 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
10424 tree conversion_path
, int flags
,
10425 tree
*fn_p
, tsubst_flags_t complain
)
10428 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
10429 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
10431 timevar_cond_stop (TV_OVERLOAD
, subtime
);
10435 /* Returns true iff standard conversion sequence ICS1 is a proper
10436 subsequence of ICS2. */
10439 is_subseq (conversion
*ics1
, conversion
*ics2
)
10441 /* We can assume that a conversion of the same code
10442 between the same types indicates a subsequence since we only get
10443 here if the types we are converting from are the same. */
10445 while (ics1
->kind
== ck_rvalue
10446 || ics1
->kind
== ck_lvalue
)
10447 ics1
= next_conversion (ics1
);
10451 while (ics2
->kind
== ck_rvalue
10452 || ics2
->kind
== ck_lvalue
)
10453 ics2
= next_conversion (ics2
);
10455 if (ics2
->kind
== ck_user
10456 || ics2
->kind
== ck_ambig
10457 || ics2
->kind
== ck_aggr
10458 || ics2
->kind
== ck_list
10459 || ics2
->kind
== ck_identity
)
10460 /* At this point, ICS1 cannot be a proper subsequence of
10461 ICS2. We can get a USER_CONV when we are comparing the
10462 second standard conversion sequence of two user conversion
10466 ics2
= next_conversion (ics2
);
10468 while (ics2
->kind
== ck_rvalue
10469 || ics2
->kind
== ck_lvalue
)
10470 ics2
= next_conversion (ics2
);
10472 if (ics2
->kind
== ics1
->kind
10473 && same_type_p (ics2
->type
, ics1
->type
)
10474 && (ics1
->kind
== ck_identity
10475 || same_type_p (next_conversion (ics2
)->type
,
10476 next_conversion (ics1
)->type
)))
10481 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
10482 be any _TYPE nodes. */
10485 is_properly_derived_from (tree derived
, tree base
)
10487 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
10490 /* We only allow proper derivation here. The DERIVED_FROM_P macro
10491 considers every class derived from itself. */
10492 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
10493 && DERIVED_FROM_P (base
, derived
));
10496 /* We build the ICS for an implicit object parameter as a pointer
10497 conversion sequence. However, such a sequence should be compared
10498 as if it were a reference conversion sequence. If ICS is the
10499 implicit conversion sequence for an implicit object parameter,
10500 modify it accordingly. */
10503 maybe_handle_implicit_object (conversion
**ics
)
10505 if ((*ics
)->this_p
)
10507 /* [over.match.funcs]
10509 For non-static member functions, the type of the
10510 implicit object parameter is "reference to cv X"
10511 where X is the class of which the function is a
10512 member and cv is the cv-qualification on the member
10513 function declaration. */
10514 conversion
*t
= *ics
;
10515 tree reference_type
;
10517 /* The `this' parameter is a pointer to a class type. Make the
10518 implicit conversion talk about a reference to that same class
10520 reference_type
= TREE_TYPE (t
->type
);
10521 reference_type
= build_reference_type (reference_type
);
10523 if (t
->kind
== ck_qual
)
10524 t
= next_conversion (t
);
10525 if (t
->kind
== ck_ptr
)
10526 t
= next_conversion (t
);
10527 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
10528 t
= direct_reference_binding (reference_type
, t
);
10530 t
->rvaluedness_matches_p
= 0;
10535 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
10536 and return the initial reference binding conversion. Otherwise,
10537 leave *ICS unchanged and return NULL. */
10539 static conversion
*
10540 maybe_handle_ref_bind (conversion
**ics
)
10542 if ((*ics
)->kind
== ck_ref_bind
)
10544 conversion
*old_ics
= *ics
;
10545 *ics
= next_conversion (old_ics
);
10546 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
10553 /* Get the expression at the beginning of the conversion chain C. */
10556 conv_get_original_expr (conversion
*c
)
10558 for (; c
; c
= next_conversion (c
))
10559 if (c
->kind
== ck_identity
|| c
->kind
== ck_ambig
|| c
->kind
== ck_aggr
)
10564 /* Return a tree representing the number of elements initialized by the
10565 list-initialization C. The caller must check that C converts to an
10569 nelts_initialized_by_list_init (conversion
*c
)
10571 /* If the array we're converting to has a dimension, we'll use that. */
10572 if (TYPE_DOMAIN (c
->type
))
10573 return array_type_nelts_top (c
->type
);
10576 /* Otherwise, we look at how many elements the constructor we're
10577 initializing from has. */
10578 tree ctor
= conv_get_original_expr (c
);
10579 return size_int (CONSTRUCTOR_NELTS (ctor
));
10583 /* True iff C is a conversion that binds a reference or a pointer to
10584 an array of unknown bound. */
10587 conv_binds_to_array_of_unknown_bound (conversion
*c
)
10589 /* ck_ref_bind won't have the reference stripped. */
10590 tree type
= non_reference (c
->type
);
10591 /* ck_qual won't have the pointer stripped. */
10592 type
= strip_pointer_operator (type
);
10593 return (TREE_CODE (type
) == ARRAY_TYPE
10594 && TYPE_DOMAIN (type
) == NULL_TREE
);
10597 /* Compare two implicit conversion sequences according to the rules set out in
10598 [over.ics.rank]. Return values:
10600 1: ics1 is better than ics2
10601 -1: ics2 is better than ics1
10602 0: ics1 and ics2 are indistinguishable */
10605 compare_ics (conversion
*ics1
, conversion
*ics2
)
10611 tree deref_from_type1
= NULL_TREE
;
10612 tree deref_from_type2
= NULL_TREE
;
10613 tree deref_to_type1
= NULL_TREE
;
10614 tree deref_to_type2
= NULL_TREE
;
10615 conversion_rank rank1
, rank2
;
10617 /* REF_BINDING is nonzero if the result of the conversion sequence
10618 is a reference type. In that case REF_CONV is the reference
10619 binding conversion. */
10620 conversion
*ref_conv1
;
10621 conversion
*ref_conv2
;
10623 /* Compare badness before stripping the reference conversion. */
10624 if (ics1
->bad_p
> ics2
->bad_p
)
10626 else if (ics1
->bad_p
< ics2
->bad_p
)
10629 /* Handle implicit object parameters. */
10630 maybe_handle_implicit_object (&ics1
);
10631 maybe_handle_implicit_object (&ics2
);
10633 /* Handle reference parameters. */
10634 ref_conv1
= maybe_handle_ref_bind (&ics1
);
10635 ref_conv2
= maybe_handle_ref_bind (&ics2
);
10637 /* List-initialization sequence L1 is a better conversion sequence than
10638 list-initialization sequence L2 if L1 converts to
10639 std::initializer_list<X> for some X and L2 does not. */
10640 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
10642 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
10647 When comparing the basic forms of implicit conversion sequences (as
10648 defined in _over.best.ics_)
10650 --a standard conversion sequence (_over.ics.scs_) is a better
10651 conversion sequence than a user-defined conversion sequence
10652 or an ellipsis conversion sequence, and
10654 --a user-defined conversion sequence (_over.ics.user_) is a
10655 better conversion sequence than an ellipsis conversion sequence
10656 (_over.ics.ellipsis_). */
10657 /* Use BAD_CONVERSION_RANK because we already checked for a badness
10658 mismatch. If both ICS are bad, we try to make a decision based on
10659 what would have happened if they'd been good. This is not an
10660 extension, we'll still give an error when we build up the call; this
10661 just helps us give a more helpful error message. */
10662 rank1
= BAD_CONVERSION_RANK (ics1
);
10663 rank2
= BAD_CONVERSION_RANK (ics2
);
10667 else if (rank1
< rank2
)
10670 if (ics1
->ellipsis_p
)
10671 /* Both conversions are ellipsis conversions. */
10674 /* User-defined conversion sequence U1 is a better conversion sequence
10675 than another user-defined conversion sequence U2 if they contain the
10676 same user-defined conversion operator or constructor and if the sec-
10677 ond standard conversion sequence of U1 is better than the second
10678 standard conversion sequence of U2. */
10680 /* Handle list-conversion with the same code even though it isn't always
10681 ranked as a user-defined conversion and it doesn't have a second
10682 standard conversion sequence; it will still have the desired effect.
10683 Specifically, we need to do the reference binding comparison at the
10684 end of this function. */
10686 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
10687 || ics1
->kind
== ck_aggr
|| ics2
->kind
== ck_aggr
)
10689 conversion
*t1
= strip_standard_conversion (ics1
);
10690 conversion
*t2
= strip_standard_conversion (ics2
);
10692 if (!t1
|| !t2
|| t1
->kind
!= t2
->kind
)
10694 else if (t1
->kind
== ck_user
)
10696 tree f1
= t1
->cand
? t1
->cand
->fn
: t1
->type
;
10697 tree f2
= t2
->cand
? t2
->cand
->fn
: t2
->type
;
10701 /* List-initialization sequence L1 is a better conversion sequence than
10702 list-initialization sequence L2 if
10704 -- L1 and L2 convert to arrays of the same element type, and either
10705 the number of elements n1 initialized by L1 is less than the number
10706 of elements n2 initialized by L2, or n1=n2 and L2 converts to an array
10707 of unknown bound and L1 does not. (Added in CWG 1307 and extended by
10709 else if (t1
->kind
== ck_aggr
10710 && TREE_CODE (t1
->type
) == ARRAY_TYPE
10711 && TREE_CODE (t2
->type
) == ARRAY_TYPE
)
10713 /* The type of the array elements must be the same. */
10714 if (!same_type_p (TREE_TYPE (t1
->type
), TREE_TYPE (t2
->type
)))
10717 tree n1
= nelts_initialized_by_list_init (t1
);
10718 tree n2
= nelts_initialized_by_list_init (t2
);
10719 if (tree_int_cst_lt (n1
, n2
))
10721 else if (tree_int_cst_lt (n2
, n1
))
10723 /* The n1 == n2 case. */
10724 bool c1
= conv_binds_to_array_of_unknown_bound (t1
);
10725 bool c2
= conv_binds_to_array_of_unknown_bound (t2
);
10728 else if (!c1
&& c2
)
10735 /* For ambiguous or aggregate conversions, use the target type as
10736 a proxy for the conversion function. */
10737 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
10741 /* We can just fall through here, after setting up
10742 FROM_TYPE1 and FROM_TYPE2. */
10743 from_type1
= t1
->type
;
10744 from_type2
= t2
->type
;
10751 /* We're dealing with two standard conversion sequences.
10755 Standard conversion sequence S1 is a better conversion
10756 sequence than standard conversion sequence S2 if
10758 --S1 is a proper subsequence of S2 (comparing the conversion
10759 sequences in the canonical form defined by _over.ics.scs_,
10760 excluding any Lvalue Transformation; the identity
10761 conversion sequence is considered to be a subsequence of
10762 any non-identity conversion sequence */
10765 while (t1
->kind
!= ck_identity
)
10766 t1
= next_conversion (t1
);
10767 from_type1
= t1
->type
;
10770 while (t2
->kind
!= ck_identity
)
10771 t2
= next_conversion (t2
);
10772 from_type2
= t2
->type
;
10775 /* One sequence can only be a subsequence of the other if they start with
10776 the same type. They can start with different types when comparing the
10777 second standard conversion sequence in two user-defined conversion
10779 if (same_type_p (from_type1
, from_type2
))
10781 if (is_subseq (ics1
, ics2
))
10783 if (is_subseq (ics2
, ics1
))
10791 --the rank of S1 is better than the rank of S2 (by the rules
10794 Standard conversion sequences are ordered by their ranks: an Exact
10795 Match is a better conversion than a Promotion, which is a better
10796 conversion than a Conversion.
10798 Two conversion sequences with the same rank are indistinguishable
10799 unless one of the following rules applies:
10801 --A conversion that does not a convert a pointer, pointer to member,
10802 or std::nullptr_t to bool is better than one that does.
10804 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
10805 so that we do not have to check it explicitly. */
10806 if (ics1
->rank
< ics2
->rank
)
10808 else if (ics2
->rank
< ics1
->rank
)
10811 to_type1
= ics1
->type
;
10812 to_type2
= ics2
->type
;
10814 /* A conversion from scalar arithmetic type to complex is worse than a
10815 conversion between scalar arithmetic types. */
10816 if (same_type_p (from_type1
, from_type2
)
10817 && ARITHMETIC_TYPE_P (from_type1
)
10818 && ARITHMETIC_TYPE_P (to_type1
)
10819 && ARITHMETIC_TYPE_P (to_type2
)
10820 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
10821 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
10823 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
10829 if (TYPE_PTR_P (from_type1
)
10830 && TYPE_PTR_P (from_type2
)
10831 && TYPE_PTR_P (to_type1
)
10832 && TYPE_PTR_P (to_type2
))
10834 deref_from_type1
= TREE_TYPE (from_type1
);
10835 deref_from_type2
= TREE_TYPE (from_type2
);
10836 deref_to_type1
= TREE_TYPE (to_type1
);
10837 deref_to_type2
= TREE_TYPE (to_type2
);
10839 /* The rules for pointers to members A::* are just like the rules
10840 for pointers A*, except opposite: if B is derived from A then
10841 A::* converts to B::*, not vice versa. For that reason, we
10842 switch the from_ and to_ variables here. */
10843 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
10844 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
10845 || (TYPE_PTRMEMFUNC_P (from_type1
)
10846 && TYPE_PTRMEMFUNC_P (from_type2
)
10847 && TYPE_PTRMEMFUNC_P (to_type1
)
10848 && TYPE_PTRMEMFUNC_P (to_type2
)))
10850 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
10851 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
10852 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
10853 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
10856 if (deref_from_type1
!= NULL_TREE
10857 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
10858 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
10860 /* This was one of the pointer or pointer-like conversions.
10864 --If class B is derived directly or indirectly from class A,
10865 conversion of B* to A* is better than conversion of B* to
10866 void*, and conversion of A* to void* is better than
10867 conversion of B* to void*. */
10868 if (VOID_TYPE_P (deref_to_type1
)
10869 && VOID_TYPE_P (deref_to_type2
))
10871 if (is_properly_derived_from (deref_from_type1
,
10874 else if (is_properly_derived_from (deref_from_type2
,
10878 else if (VOID_TYPE_P (deref_to_type1
)
10879 || VOID_TYPE_P (deref_to_type2
))
10881 if (same_type_p (deref_from_type1
, deref_from_type2
))
10883 if (VOID_TYPE_P (deref_to_type2
))
10885 if (is_properly_derived_from (deref_from_type1
,
10889 /* We know that DEREF_TO_TYPE1 is `void' here. */
10890 else if (is_properly_derived_from (deref_from_type1
,
10895 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
10896 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
10900 --If class B is derived directly or indirectly from class A
10901 and class C is derived directly or indirectly from B,
10903 --conversion of C* to B* is better than conversion of C* to
10906 --conversion of B* to A* is better than conversion of C* to
10908 if (same_type_p (deref_from_type1
, deref_from_type2
))
10910 if (is_properly_derived_from (deref_to_type1
,
10913 else if (is_properly_derived_from (deref_to_type2
,
10917 else if (same_type_p (deref_to_type1
, deref_to_type2
))
10919 if (is_properly_derived_from (deref_from_type2
,
10922 else if (is_properly_derived_from (deref_from_type1
,
10928 else if (CLASS_TYPE_P (non_reference (from_type1
))
10929 && same_type_p (from_type1
, from_type2
))
10931 tree from
= non_reference (from_type1
);
10935 --binding of an expression of type C to a reference of type
10936 B& is better than binding an expression of type C to a
10937 reference of type A&
10939 --conversion of C to B is better than conversion of C to A, */
10940 if (is_properly_derived_from (from
, to_type1
)
10941 && is_properly_derived_from (from
, to_type2
))
10943 if (is_properly_derived_from (to_type1
, to_type2
))
10945 else if (is_properly_derived_from (to_type2
, to_type1
))
10949 else if (CLASS_TYPE_P (non_reference (to_type1
))
10950 && same_type_p (to_type1
, to_type2
))
10952 tree to
= non_reference (to_type1
);
10956 --binding of an expression of type B to a reference of type
10957 A& is better than binding an expression of type C to a
10958 reference of type A&,
10960 --conversion of B to A is better than conversion of C to A */
10961 if (is_properly_derived_from (from_type1
, to
)
10962 && is_properly_derived_from (from_type2
, to
))
10964 if (is_properly_derived_from (from_type2
, from_type1
))
10966 else if (is_properly_derived_from (from_type1
, from_type2
))
10973 --S1 and S2 differ only in their qualification conversion and yield
10974 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
10975 qualification signature of type T1 is a proper subset of the cv-
10976 qualification signature of type T2 */
10977 if (ics1
->kind
== ck_qual
10978 && ics2
->kind
== ck_qual
10979 && same_type_p (from_type1
, from_type2
))
10981 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
10988 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
10989 to an implicit object parameter of a non-static member function
10990 declared without a ref-qualifier, and either S1 binds an lvalue
10991 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
10992 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
10993 draft standard, 13.3.3.2)
10995 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
10996 types to which the references refer are the same type except for
10997 top-level cv-qualifiers, and the type to which the reference
10998 initialized by S2 refers is more cv-qualified than the type to
10999 which the reference initialized by S1 refers.
11001 DR 1328 [over.match.best]: the context is an initialization by
11002 conversion function for direct reference binding (13.3.1.6) of a
11003 reference to function type, the return type of F1 is the same kind of
11004 reference (i.e. lvalue or rvalue) as the reference being initialized,
11005 and the return type of F2 is not. */
11007 if (ref_conv1
&& ref_conv2
)
11009 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
11010 && (ref_conv1
->rvaluedness_matches_p
11011 != ref_conv2
->rvaluedness_matches_p
)
11012 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
11013 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
11014 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
11016 if (ref_conv1
->bad_p
11017 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
11018 TREE_TYPE (ref_conv2
->type
)))
11019 /* Don't prefer a bad conversion that drops cv-quals to a bad
11020 conversion with the wrong rvalueness. */
11022 return (ref_conv1
->rvaluedness_matches_p
11023 - ref_conv2
->rvaluedness_matches_p
);
11026 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
11030 void f (int(&)[]), // (1)
11031 f (int(&)[1]), // (2)
11034 (2) is better than (1), but (3) should be equal to (1) and to
11035 (2). For that reason we don't use ck_qual for (1) which would
11036 give it the cr_exact rank while (3) remains ck_identity.
11037 Therefore we compare (1) and (2) here. For (1) we'll have
11039 ck_ref_bind <- ck_identity
11042 so to handle this we must look at ref_conv. */
11043 bool c1
= conv_binds_to_array_of_unknown_bound (ref_conv1
);
11044 bool c2
= conv_binds_to_array_of_unknown_bound (ref_conv2
);
11047 else if (!c1
&& c2
)
11050 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
11051 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
11052 if (ref_conv1
->bad_p
)
11054 /* Prefer the one that drops fewer cv-quals. */
11055 tree ftype
= next_conversion (ref_conv1
)->type
;
11056 int fquals
= cp_type_quals (ftype
);
11060 return comp_cv_qualification (q2
, q1
);
11067 -- A conversion that promotes an enumeration whose underlying type
11068 is fixed to its underlying type is better than one that promotes to
11069 the promoted underlying type, if the two are different. */
11070 if (ics1
->rank
== cr_promotion
11071 && ics2
->rank
== cr_promotion
11072 && UNSCOPED_ENUM_P (from_type1
)
11073 && ENUM_FIXED_UNDERLYING_TYPE_P (from_type1
)
11074 && same_type_p (from_type1
, from_type2
))
11076 tree utype
= ENUM_UNDERLYING_TYPE (from_type1
);
11077 tree prom
= type_promotes_to (from_type1
);
11078 if (!same_type_p (utype
, prom
))
11080 if (same_type_p (to_type1
, utype
)
11081 && same_type_p (to_type2
, prom
))
11083 else if (same_type_p (to_type2
, utype
)
11084 && same_type_p (to_type1
, prom
))
11089 /* Neither conversion sequence is better than the other. */
11093 /* The source type for this standard conversion sequence. */
11096 source_type (conversion
*t
)
11098 return strip_standard_conversion (t
)->type
;
11101 /* Note a warning about preferring WINNER to LOSER. We do this by storing
11102 a pointer to LOSER and re-running joust to produce the warning if WINNER
11103 is actually used. */
11106 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
11108 candidate_warning
*cw
= (candidate_warning
*)
11109 conversion_obstack_alloc (sizeof (candidate_warning
));
11111 cw
->next
= winner
->warnings
;
11112 winner
->warnings
= cw
;
11115 /* CAND is a constructor candidate in joust in C++17 and up. If it copies a
11116 prvalue returned from a conversion function, replace CAND with the candidate
11117 for the conversion and return true. Otherwise, return false. */
11120 joust_maybe_elide_copy (z_candidate
*&cand
)
11122 tree fn
= cand
->fn
;
11123 if (!DECL_COPY_CONSTRUCTOR_P (fn
) && !DECL_MOVE_CONSTRUCTOR_P (fn
))
11125 conversion
*conv
= cand
->convs
[0];
11126 gcc_checking_assert (conv
->kind
== ck_ref_bind
);
11127 conv
= next_conversion (conv
);
11128 if (conv
->kind
== ck_user
&& !TYPE_REF_P (conv
->type
))
11130 gcc_checking_assert (same_type_ignoring_top_level_qualifiers_p
11131 (conv
->type
, DECL_CONTEXT (fn
)));
11132 z_candidate
*uc
= conv
->cand
;
11133 if (DECL_CONV_FN_P (uc
->fn
))
11142 /* True if the defining declarations of the two candidates have equivalent
11146 cand_parms_match (z_candidate
*c1
, z_candidate
*c2
)
11152 if (identifier_p (fn1
) || identifier_p (fn2
))
11154 /* We don't look at c1->template_decl because that's only set for primary
11155 templates, not e.g. non-template member functions of class templates. */
11156 tree t1
= most_general_template (fn1
);
11157 tree t2
= most_general_template (fn2
);
11164 fn1
= DECL_TEMPLATE_RESULT (t1
);
11165 fn2
= DECL_TEMPLATE_RESULT (t2
);
11167 return compparms (TYPE_ARG_TYPES (TREE_TYPE (fn1
)),
11168 TYPE_ARG_TYPES (TREE_TYPE (fn2
)));
11171 /* Compare two candidates for overloading as described in
11172 [over.match.best]. Return values:
11174 1: cand1 is better than cand2
11175 -1: cand2 is better than cand1
11176 0: cand1 and cand2 are indistinguishable */
11179 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
11180 tsubst_flags_t complain
)
11183 int off1
= 0, off2
= 0;
11187 /* Candidates that involve bad conversions are always worse than those
11189 if (cand1
->viable
> cand2
->viable
)
11191 if (cand1
->viable
< cand2
->viable
)
11194 /* If we have two pseudo-candidates for conversions to the same type,
11195 or two candidates for the same function, arbitrarily pick one. */
11196 if (cand1
->fn
== cand2
->fn
11197 && cand1
->reversed () == cand2
->reversed ()
11198 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
11201 /* Prefer a non-deleted function over an implicitly deleted move
11202 constructor or assignment operator. This differs slightly from the
11203 wording for issue 1402 (which says the move op is ignored by overload
11204 resolution), but this way produces better error messages. */
11205 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
11206 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
11207 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
11209 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
11210 && move_fn_p (cand1
->fn
))
11212 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
11213 && move_fn_p (cand2
->fn
))
11217 /* a viable function F1
11218 is defined to be a better function than another viable function F2 if
11219 for all arguments i, ICSi(F1) is not a worse conversion sequence than
11220 ICSi(F2), and then */
11222 /* for some argument j, ICSj(F1) is a better conversion sequence than
11225 /* For comparing static and non-static member functions, we ignore
11226 the implicit object parameter of the non-static function. The
11227 standard says to pretend that the static function has an object
11228 parm, but that won't work with operator overloading. */
11229 len
= cand1
->num_convs
;
11230 if (len
!= cand2
->num_convs
)
11232 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
11233 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
11235 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
11236 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
11237 /* We're comparing a near-match list constructor and a near-match
11238 non-list constructor. Just treat them as unordered. */
11241 gcc_assert (static_1
!= static_2
);
11252 /* Handle C++17 copy elision in [over.match.ctor] (direct-init) context. The
11253 standard currently says that only constructors are candidates, but if one
11254 copies a prvalue returned by a conversion function we want to treat the
11255 conversion as the candidate instead.
11257 Clang does something similar, as discussed at
11258 http://lists.isocpp.org/core/2017/10/3166.php
11259 http://lists.isocpp.org/core/2019/03/5721.php */
11260 int elided_tiebreaker
= 0;
11261 if (len
== 1 && cxx_dialect
>= cxx17
11262 && DECL_P (cand1
->fn
)
11263 && DECL_COMPLETE_CONSTRUCTOR_P (cand1
->fn
)
11264 && !(cand1
->flags
& LOOKUP_ONLYCONVERTING
))
11266 bool elided1
= joust_maybe_elide_copy (cand1
);
11267 bool elided2
= joust_maybe_elide_copy (cand2
);
11268 /* As a tiebreaker below we will prefer a constructor to a conversion
11269 operator exposed this way. */
11270 elided_tiebreaker
= elided2
- elided1
;
11273 for (i
= 0; i
< len
; ++i
)
11275 conversion
*t1
= cand1
->convs
[i
+ off1
];
11276 conversion
*t2
= cand2
->convs
[i
+ off2
];
11277 int comp
= compare_ics (t1
, t2
);
11281 if ((complain
& tf_warning
)
11283 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
11284 == cr_std
+ cr_promotion
)
11285 && t1
->kind
== ck_std
11286 && t2
->kind
== ck_std
11287 && TREE_CODE (t1
->type
) == INTEGER_TYPE
11288 && TREE_CODE (t2
->type
) == INTEGER_TYPE
11289 && (TYPE_PRECISION (t1
->type
)
11290 == TYPE_PRECISION (t2
->type
))
11291 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
11292 || (TREE_CODE (next_conversion (t1
)->type
)
11293 == ENUMERAL_TYPE
)))
11295 tree type
= next_conversion (t1
)->type
;
11297 struct z_candidate
*w
, *l
;
11299 type1
= t1
->type
, type2
= t2
->type
,
11300 w
= cand1
, l
= cand2
;
11302 type1
= t2
->type
, type2
= t1
->type
,
11303 w
= cand2
, l
= cand1
;
11307 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
11308 type
, type1
, type2
);
11309 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
11312 add_warning (w
, l
);
11315 if (winner
&& comp
!= winner
)
11317 /* Ambiguity between normal and reversed comparison operators
11318 with the same parameter types; prefer the normal one. */
11319 if ((cand1
->reversed () != cand2
->reversed ())
11320 && cand_parms_match (cand1
, cand2
))
11321 return cand1
->reversed () ? -1 : 1;
11330 /* warn about confusing overload resolution for user-defined conversions,
11331 either between a constructor and a conversion op, or between two
11333 if ((complain
& tf_warning
)
11334 /* In C++17, the constructor might have been elided, which means that
11335 an originally null ->second_conv could become non-null. */
11336 && winner
&& warn_conversion
&& cand1
->second_conv
&& cand2
->second_conv
11337 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
11338 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
11340 struct z_candidate
*w
, *l
;
11341 bool give_warning
= false;
11344 w
= cand1
, l
= cand2
;
11346 w
= cand2
, l
= cand1
;
11348 /* We don't want to complain about `X::operator T1 ()'
11349 beating `X::operator T2 () const', when T2 is a no less
11350 cv-qualified version of T1. */
11351 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
11352 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
11354 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
11355 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
11357 if (TREE_CODE (t
) == TREE_CODE (f
) && INDIRECT_TYPE_P (t
))
11362 if (!comp_ptr_ttypes (t
, f
))
11363 give_warning
= true;
11366 give_warning
= true;
11372 tree source
= source_type (w
->convs
[0]);
11373 if (INDIRECT_TYPE_P (source
))
11374 source
= TREE_TYPE (source
);
11375 auto_diagnostic_group d
;
11376 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
11377 && warning (OPT_Wconversion
, " for conversion from %qH to %qI",
11378 source
, w
->second_conv
->type
))
11380 inform (input_location
, " because conversion sequence "
11381 "for the argument is better");
11385 add_warning (w
, l
);
11391 /* Put this tiebreaker first, so that we don't try to look at second_conv of
11392 a constructor candidate that doesn't have one. */
11393 if (elided_tiebreaker
)
11394 return elided_tiebreaker
;
11396 /* DR 495 moved this tiebreaker above the template ones. */
11397 /* or, if not that,
11398 the context is an initialization by user-defined conversion (see
11399 _dcl.init_ and _over.match.user_) and the standard conversion
11400 sequence from the return type of F1 to the destination type (i.e.,
11401 the type of the entity being initialized) is a better conversion
11402 sequence than the standard conversion sequence from the return type
11403 of F2 to the destination type. */
11405 if (cand1
->second_conv
)
11407 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
11412 /* or, if not that,
11413 F1 is a non-template function and F2 is a template function
11416 if (!cand1
->template_decl
&& cand2
->template_decl
)
11418 else if (cand1
->template_decl
&& !cand2
->template_decl
)
11421 /* or, if not that,
11422 F1 and F2 are template functions and the function template for F1 is
11423 more specialized than the template for F2 according to the partial
11426 if (cand1
->template_decl
&& cand2
->template_decl
)
11428 winner
= more_specialized_fn
11429 (TI_TEMPLATE (cand1
->template_decl
),
11430 TI_TEMPLATE (cand2
->template_decl
),
11431 /* [temp.func.order]: The presence of unused ellipsis and default
11432 arguments has no effect on the partial ordering of function
11433 templates. add_function_candidate() will not have
11434 counted the "this" argument for constructors. */
11435 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
11440 /* Concepts: ... or, if not that, F1 is more constrained than F2.
11442 FIXME: For function templates with no winner, this subsumption may
11443 be computed a separate time. This needs to be validated, and if
11444 so, the redundant check removed. */
11445 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
11447 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
11452 /* F2 is a rewritten candidate (12.4.1.2) and F1 is not, or F1 and F2 are
11453 rewritten candidates, and F2 is a synthesized candidate with reversed
11454 order of parameters and F1 is not. */
11455 if (cand1
->rewritten ())
11457 if (!cand2
->rewritten ())
11459 if (!cand1
->reversed () && cand2
->reversed ())
11461 if (cand1
->reversed () && !cand2
->reversed ())
11464 else if (cand2
->rewritten ())
11467 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
11468 if (deduction_guide_p (cand1
->fn
))
11470 gcc_assert (deduction_guide_p (cand2
->fn
));
11471 /* We distinguish between candidates from an explicit deduction guide and
11472 candidates built from a constructor based on DECL_ARTIFICIAL. */
11473 int art1
= DECL_ARTIFICIAL (cand1
->fn
);
11474 int art2
= DECL_ARTIFICIAL (cand2
->fn
);
11476 return art2
- art1
;
11480 /* Prefer the special copy guide over a declared copy/move
11482 if (copy_guide_p (cand1
->fn
))
11484 if (copy_guide_p (cand2
->fn
))
11487 /* Prefer a candidate generated from a non-template constructor. */
11488 int tg1
= template_guide_p (cand1
->fn
);
11489 int tg2
= template_guide_p (cand2
->fn
);
11495 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
11496 for all arguments the corresponding parameters of F1 and F2 have the same
11497 type (CWG 2273/2277). */
11498 if (DECL_P (cand1
->fn
) && DECL_CLASS_SCOPE_P (cand1
->fn
)
11499 && !DECL_CONV_FN_P (cand1
->fn
)
11500 && DECL_P (cand2
->fn
) && DECL_CLASS_SCOPE_P (cand2
->fn
)
11501 && !DECL_CONV_FN_P (cand2
->fn
))
11503 tree base1
= DECL_CONTEXT (strip_inheriting_ctors (cand1
->fn
));
11504 tree base2
= DECL_CONTEXT (strip_inheriting_ctors (cand2
->fn
));
11506 bool used1
= false;
11507 bool used2
= false;
11508 if (base1
== base2
)
11509 /* No difference. */;
11510 else if (DERIVED_FROM_P (base1
, base2
))
11512 else if (DERIVED_FROM_P (base2
, base1
))
11515 if (int diff
= used2
- used1
)
11517 for (i
= 0; i
< len
; ++i
)
11519 conversion
*t1
= cand1
->convs
[i
+ off1
];
11520 conversion
*t2
= cand2
->convs
[i
+ off2
];
11521 if (!same_type_p (t1
->type
, t2
->type
))
11529 /* Check whether we can discard a builtin candidate, either because we
11530 have two identical ones or matching builtin and non-builtin candidates.
11532 (Pedantically in the latter case the builtin which matched the user
11533 function should not be added to the overload set, but we spot it here.
11536 ... the builtin candidates include ...
11537 - do not have the same parameter type list as any non-template
11538 non-member candidate. */
11540 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
11542 for (i
= 0; i
< len
; ++i
)
11543 if (!same_type_p (cand1
->convs
[i
]->type
,
11544 cand2
->convs
[i
]->type
))
11546 if (i
== cand1
->num_convs
)
11548 if (cand1
->fn
== cand2
->fn
)
11549 /* Two built-in candidates; arbitrarily pick one. */
11551 else if (identifier_p (cand1
->fn
))
11552 /* cand1 is built-in; prefer cand2. */
11555 /* cand2 is built-in; prefer cand1. */
11560 /* For candidates of a multi-versioned function, make the version with
11561 the highest priority win. This version will be checked for dispatching
11562 first. If this version can be inlined into the caller, the front-end
11563 will simply make a direct call to this function. */
11565 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
11566 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
11567 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
11568 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
11570 tree f1
= TREE_TYPE (cand1
->fn
);
11571 tree f2
= TREE_TYPE (cand2
->fn
);
11572 tree p1
= TYPE_ARG_TYPES (f1
);
11573 tree p2
= TYPE_ARG_TYPES (f2
);
11575 /* Check if cand1->fn and cand2->fn are versions of the same function. It
11576 is possible that cand1->fn and cand2->fn are function versions but of
11577 different functions. Check types to see if they are versions of the same
11579 if (compparms (p1
, p2
)
11580 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
11582 /* Always make the version with the higher priority, more
11583 specialized, win. */
11584 gcc_assert (targetm
.compare_version_priority
);
11585 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
11592 /* If the two function declarations represent the same function (this can
11593 happen with declarations in multiple scopes and arg-dependent lookup),
11594 arbitrarily choose one. But first make sure the default args we're
11596 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
11597 && equal_functions (cand1
->fn
, cand2
->fn
))
11599 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
11600 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
11602 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
11604 for (i
= 0; i
< len
; ++i
)
11606 /* Don't crash if the fn is variadic. */
11609 parms1
= TREE_CHAIN (parms1
);
11610 parms2
= TREE_CHAIN (parms2
);
11614 parms1
= TREE_CHAIN (parms1
);
11616 parms2
= TREE_CHAIN (parms2
);
11618 for (; parms1
; ++i
)
11620 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
11621 TREE_PURPOSE (parms2
)))
11625 if (complain
& tf_error
)
11627 auto_diagnostic_group d
;
11628 if (permerror (input_location
,
11629 "default argument mismatch in "
11630 "overload resolution"))
11632 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
11633 " candidate 1: %q#F", cand1
->fn
);
11634 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
11635 " candidate 2: %q#F", cand2
->fn
);
11642 add_warning (cand1
, cand2
);
11645 parms1
= TREE_CHAIN (parms1
);
11646 parms2
= TREE_CHAIN (parms2
);
11654 /* Extension: If the worst conversion for one candidate is better than the
11655 worst conversion for the other, take the first. */
11656 if (!pedantic
&& (complain
& tf_warning_or_error
))
11658 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
11659 struct z_candidate
*w
= 0, *l
= 0;
11661 for (i
= 0; i
< len
; ++i
)
11663 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
11664 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
11665 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
11666 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
11669 winner
= 1, w
= cand1
, l
= cand2
;
11671 winner
= -1, w
= cand2
, l
= cand1
;
11674 /* Don't choose a deleted function over ambiguity. */
11675 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
11679 auto_diagnostic_group d
;
11680 if (pedwarn (input_location
, 0,
11681 "ISO C++ says that these are ambiguous, even "
11682 "though the worst conversion for the first is "
11683 "better than the worst conversion for the second:"))
11685 print_z_candidate (input_location
, N_("candidate 1:"), w
);
11686 print_z_candidate (input_location
, N_("candidate 2:"), l
);
11690 add_warning (w
, l
);
11695 gcc_assert (!winner
);
11699 /* Given a list of candidates for overloading, find the best one, if any.
11700 This algorithm has a worst case of O(2n) (winner is last), and a best
11701 case of O(n/2) (totally ambiguous); much better than a sorting
11704 static struct z_candidate
*
11705 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
11707 struct z_candidate
*champ
= candidates
, *challenger
;
11709 int champ_compared_to_predecessor
= 0;
11711 /* Walk through the list once, comparing each current champ to the next
11712 candidate, knocking out a candidate or two with each comparison. */
11714 for (challenger
= champ
->next
; challenger
; )
11716 fate
= joust (champ
, challenger
, 0, complain
);
11718 challenger
= challenger
->next
;
11723 champ
= challenger
->next
;
11726 champ_compared_to_predecessor
= 0;
11730 champ
= challenger
;
11731 champ_compared_to_predecessor
= 1;
11734 challenger
= champ
->next
;
11738 /* Make sure the champ is better than all the candidates it hasn't yet
11739 been compared to. */
11741 for (challenger
= candidates
;
11742 challenger
!= champ
11743 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
11744 challenger
= challenger
->next
)
11746 fate
= joust (champ
, challenger
, 0, complain
);
11754 /* Returns nonzero if things of type FROM can be converted to TO. */
11757 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
11759 tree arg
= NULL_TREE
;
11760 /* implicit_conversion only considers user-defined conversions
11761 if it has an expression for the call argument list. */
11762 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
11763 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
11764 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
11767 /* Returns nonzero if things of type FROM can be converted to TO with a
11768 standard conversion. */
11771 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
11773 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
11776 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
11779 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
11780 tsubst_flags_t complain
)
11786 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11787 p
= conversion_obstack_alloc (0);
11788 /* We want to discard any access checks done for this test,
11789 as we might not be in the appropriate access context and
11790 we'll do the check again when we actually perform the
11792 push_deferring_access_checks (dk_deferred
);
11794 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
11796 ok_p
= (t
&& !t
->bad_p
);
11798 /* Discard the access checks now. */
11799 pop_deferring_access_checks ();
11800 /* Free all the conversions we allocated. */
11801 obstack_free (&conversion_obstack
, p
);
11806 /* Like can_convert_arg, but allows dubious conversions as well. */
11809 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
11810 tsubst_flags_t complain
)
11815 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11816 p
= conversion_obstack_alloc (0);
11817 /* Try to perform the conversion. */
11818 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
11820 /* Free all the conversions we allocated. */
11821 obstack_free (&conversion_obstack
, p
);
11826 /* Convert EXPR to TYPE. Return the converted expression.
11828 Note that we allow bad conversions here because by the time we get to
11829 this point we are committed to doing the conversion. If we end up
11830 doing a bad conversion, convert_like will complain. */
11833 perform_implicit_conversion_flags (tree type
, tree expr
,
11834 tsubst_flags_t complain
, int flags
)
11838 location_t loc
= cp_expr_loc_or_input_loc (expr
);
11840 if (TYPE_REF_P (type
))
11841 expr
= mark_lvalue_use (expr
);
11843 expr
= mark_rvalue_use (expr
);
11845 if (error_operand_p (expr
))
11846 return error_mark_node
;
11848 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11849 p
= conversion_obstack_alloc (0);
11851 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
11852 /*c_cast_p=*/false,
11857 if (complain
& tf_error
)
11859 /* If expr has unknown type, then it is an overloaded function.
11860 Call instantiate_type to get good error messages. */
11861 if (TREE_TYPE (expr
) == unknown_type_node
)
11862 instantiate_type (type
, expr
, complain
);
11863 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
11864 /* We gave an error. */;
11867 range_label_for_type_mismatch
label (TREE_TYPE (expr
), type
);
11868 gcc_rich_location
rich_loc (loc
, &label
);
11869 error_at (&rich_loc
, "could not convert %qE from %qH to %qI",
11870 expr
, TREE_TYPE (expr
), type
);
11873 expr
= error_mark_node
;
11875 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
11877 /* In a template, we are only concerned about determining the
11878 type of non-dependent expressions, so we do not have to
11879 perform the actual conversion. But for initializers, we
11880 need to be able to perform it at instantiation
11881 (or instantiate_non_dependent_expr) time. */
11882 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
11883 if (!(flags
& LOOKUP_ONLYCONVERTING
))
11884 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
11885 if (flags
& LOOKUP_NO_NARROWING
)
11886 IMPLICIT_CONV_EXPR_BRACED_INIT (expr
) = true;
11889 expr
= convert_like (conv
, expr
, complain
);
11891 /* Free all the conversions we allocated. */
11892 obstack_free (&conversion_obstack
, p
);
11898 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
11900 return perform_implicit_conversion_flags (type
, expr
, complain
,
11904 /* Convert EXPR to TYPE (as a direct-initialization) if that is
11905 permitted. If the conversion is valid, the converted expression is
11906 returned. Otherwise, NULL_TREE is returned, except in the case
11907 that TYPE is a class type; in that case, an error is issued. If
11908 C_CAST_P is true, then this direct-initialization is taking
11909 place as part of a static_cast being attempted as part of a C-style
11913 perform_direct_initialization_if_possible (tree type
,
11916 tsubst_flags_t complain
)
11921 if (type
== error_mark_node
|| error_operand_p (expr
))
11922 return error_mark_node
;
11925 If the destination type is a (possibly cv-qualified) class type:
11927 -- If the initialization is direct-initialization ...,
11928 constructors are considered.
11930 -- If overload resolution is successful, the selected constructor
11931 is called to initialize the object, with the initializer expression
11932 or expression-list as its argument(s).
11934 -- Otherwise, if no constructor is viable, the destination type is
11935 a (possibly cv-qualified) aggregate class A, and the initializer is
11936 a parenthesized expression-list, the object is initialized as
11938 if (CLASS_TYPE_P (type
))
11940 releasing_vec
args (make_tree_vector_single (expr
));
11941 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
11942 &args
, type
, LOOKUP_NORMAL
, complain
);
11943 return build_cplus_new (type
, expr
, complain
);
11946 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11947 p
= conversion_obstack_alloc (0);
11949 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
11951 LOOKUP_NORMAL
, complain
);
11952 if (!conv
|| conv
->bad_p
)
11954 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
11956 /* In a template, we are only concerned about determining the
11957 type of non-dependent expressions, so we do not have to
11958 perform the actual conversion. But for initializers, we
11959 need to be able to perform it at instantiation
11960 (or instantiate_non_dependent_expr) time. */
11961 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
11962 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
11965 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0,
11966 /*issue_conversion_warnings=*/false,
11970 /* Free all the conversions we allocated. */
11971 obstack_free (&conversion_obstack
, p
);
11976 /* When initializing a reference that lasts longer than a full-expression,
11977 this special rule applies:
11981 The temporary to which the reference is bound or the temporary
11982 that is the complete object to which the reference is bound
11983 persists for the lifetime of the reference.
11985 The temporaries created during the evaluation of the expression
11986 initializing the reference, except the temporary to which the
11987 reference is bound, are destroyed at the end of the
11988 full-expression in which they are created.
11990 In that case, we store the converted expression into a new
11991 VAR_DECL in a new scope.
11993 However, we want to be careful not to create temporaries when
11994 they are not required. For example, given:
11997 struct D : public B {};
12001 there is no need to copy the return value from "f"; we can just
12002 extend its lifetime. Similarly, given:
12005 struct T { operator S(); };
12009 we can extend the lifetime of the return value of the conversion
12012 The next several functions are involved in this lifetime extension. */
12014 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
12015 reference is being bound to a temporary. Create and return a new
12016 VAR_DECL with the indicated TYPE; this variable will store the value to
12017 which the reference is bound. */
12020 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
12022 tree var
= create_temporary_var (type
);
12024 /* Register the variable. */
12026 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
12028 /* Namespace-scope or local static; give it a mangled name. */
12030 /* If an initializer is visible to multiple translation units, those
12031 translation units must agree on the addresses of the
12032 temporaries. Therefore the temporaries must be given a consistent name
12033 and vague linkage. The mangled name of a temporary is the name of the
12034 non-temporary object in whose initializer they appear, prefixed with
12035 GR and suffixed with a sequence number mangled using the usual rules
12036 for a seq-id. Temporaries are numbered with a pre-order, depth-first,
12037 left-to-right walk of the complete initializer. */
12038 copy_linkage (var
, decl
);
12040 tree name
= mangle_ref_init_variable (decl
);
12041 DECL_NAME (var
) = name
;
12042 SET_DECL_ASSEMBLER_NAME (var
, name
);
12045 /* Create a new cleanup level if necessary. */
12046 maybe_push_cleanup_level (type
);
12048 return pushdecl (var
);
12051 /* EXPR is the initializer for a variable DECL of reference or
12052 std::initializer_list type. Create, push and return a new VAR_DECL
12053 for the initializer so that it will live as long as DECL. Any
12054 cleanup for the new variable is returned through CLEANUP, and the
12055 code to initialize the new variable is returned through INITP. */
12058 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
12059 tree
*initp
, tree
*cond_guard
)
12065 /* Create the temporary variable. */
12066 type
= TREE_TYPE (expr
);
12067 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
12068 layout_decl (var
, 0);
12069 /* If the rvalue is the result of a function call it will be
12070 a TARGET_EXPR. If it is some other construct (such as a
12071 member access expression where the underlying object is
12072 itself the result of a function call), turn it into a
12073 TARGET_EXPR here. It is important that EXPR be a
12074 TARGET_EXPR below since otherwise the INIT_EXPR will
12075 attempt to make a bitwise copy of EXPR to initialize
12077 if (TREE_CODE (expr
) != TARGET_EXPR
)
12078 expr
= get_target_expr (expr
);
12080 if (TREE_CODE (decl
) == FIELD_DECL
12081 && extra_warnings
&& !TREE_NO_WARNING (decl
))
12083 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
12084 "until the constructor exits", decl
);
12085 TREE_NO_WARNING (decl
) = true;
12088 /* Recursively extend temps in this initializer. */
12089 TARGET_EXPR_INITIAL (expr
)
12090 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
,
12093 /* Any reference temp has a non-trivial initializer. */
12094 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
12096 /* If the initializer is constant, put it in DECL_INITIAL so we get
12097 static initialization and use in constant expressions. */
12098 init
= maybe_constant_init (expr
);
12099 /* As in store_init_value. */
12100 init
= cp_fully_fold (init
);
12101 if (TREE_CONSTANT (init
))
12103 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
12105 /* 5.19 says that a constant expression can include an
12106 lvalue-rvalue conversion applied to "a glvalue of literal type
12107 that refers to a non-volatile temporary object initialized
12108 with a constant expression". Rather than try to communicate
12109 that this VAR_DECL is a temporary, just mark it constexpr. */
12110 DECL_DECLARED_CONSTEXPR_P (var
) = true;
12111 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
12112 TREE_CONSTANT (var
) = true;
12113 TREE_READONLY (var
) = true;
12115 DECL_INITIAL (var
) = init
;
12119 /* Create the INIT_EXPR that will initialize the temporary
12121 init
= split_nonconstant_init (var
, expr
);
12122 if (at_function_scope_p ())
12124 add_decl_expr (var
);
12126 if (TREE_STATIC (var
))
12127 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
12130 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
12133 if (cond_guard
&& cleanup
!= error_mark_node
)
12135 if (*cond_guard
== NULL_TREE
)
12137 *cond_guard
= build_local_temp (boolean_type_node
);
12138 add_decl_expr (*cond_guard
);
12139 tree set
= cp_build_modify_expr (UNKNOWN_LOCATION
,
12140 *cond_guard
, NOP_EXPR
,
12141 boolean_false_node
,
12142 tf_warning_or_error
);
12143 finish_expr_stmt (set
);
12145 cleanup
= build3 (COND_EXPR
, void_type_node
,
12146 *cond_guard
, cleanup
, NULL_TREE
);
12148 vec_safe_push (*cleanups
, cleanup
);
12152 /* We must be careful to destroy the temporary only
12153 after its initialization has taken place. If the
12154 initialization throws an exception, then the
12155 destructor should not be run. We cannot simply
12156 transform INIT into something like:
12158 (INIT, ({ CLEANUP_STMT; }))
12160 because emit_local_var always treats the
12161 initializer as a full-expression. Thus, the
12162 destructor would run too early; it would run at the
12163 end of initializing the reference variable, rather
12164 than at the end of the block enclosing the
12165 reference variable.
12167 The solution is to pass back a cleanup expression
12168 which the caller is responsible for attaching to
12169 the statement tree. */
12173 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
12174 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
12176 if (CP_DECL_THREAD_LOCAL_P (var
))
12177 tls_aggregates
= tree_cons (NULL_TREE
, var
,
12180 static_aggregates
= tree_cons (NULL_TREE
, var
,
12181 static_aggregates
);
12184 /* Check whether the dtor is callable. */
12185 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
12187 /* Avoid -Wunused-variable warning (c++/38958). */
12188 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
12190 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
12196 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
12197 initializing a variable of that TYPE. */
12200 initialize_reference (tree type
, tree expr
,
12201 int flags
, tsubst_flags_t complain
)
12205 location_t loc
= cp_expr_loc_or_input_loc (expr
);
12207 if (type
== error_mark_node
|| error_operand_p (expr
))
12208 return error_mark_node
;
12210 /* Get the high-water mark for the CONVERSION_OBSTACK. */
12211 p
= conversion_obstack_alloc (0);
12213 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
12215 /* If this conversion failed, we're in C++20, and we have something like
12216 A& a(b) where A is an aggregate, try again, this time as A& a{b}. */
12217 if ((!conv
|| conv
->bad_p
)
12218 && (flags
& LOOKUP_AGGREGATE_PAREN_INIT
))
12220 tree e
= build_constructor_single (init_list_type_node
, NULL_TREE
, expr
);
12221 CONSTRUCTOR_IS_DIRECT_INIT (e
) = true;
12222 CONSTRUCTOR_IS_PAREN_INIT (e
) = true;
12223 conversion
*c
= reference_binding (type
, TREE_TYPE (e
), e
,
12224 /*c_cast_p=*/false, flags
, complain
);
12225 /* If this worked, use it. */
12226 if (c
&& !c
->bad_p
)
12227 expr
= e
, conv
= c
;
12229 if (!conv
|| conv
->bad_p
)
12231 if (complain
& tf_error
)
12234 convert_like (conv
, expr
, complain
);
12235 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
12236 && !TYPE_REF_IS_RVALUE (type
)
12237 && !lvalue_p (expr
))
12238 error_at (loc
, "invalid initialization of non-const reference of "
12239 "type %qH from an rvalue of type %qI",
12240 type
, TREE_TYPE (expr
));
12242 error_at (loc
, "invalid initialization of reference of type "
12243 "%qH from expression of type %qI", type
,
12246 return error_mark_node
;
12249 if (conv
->kind
== ck_ref_bind
)
12250 /* Perform the conversion. */
12251 expr
= convert_like (conv
, expr
, complain
);
12252 else if (conv
->kind
== ck_ambig
)
12253 /* We gave an error in build_user_type_conversion_1. */
12254 expr
= error_mark_node
;
12256 gcc_unreachable ();
12258 /* Free all the conversions we allocated. */
12259 obstack_free (&conversion_obstack
, p
);
12264 /* If *P is an xvalue expression, prevent temporary lifetime extension if it
12265 gets used to initialize a reference. */
12268 prevent_lifetime_extension (tree t
)
12271 while (TREE_CODE (*p
) == COMPOUND_EXPR
)
12272 p
= &TREE_OPERAND (*p
, 1);
12273 while (handled_component_p (*p
))
12274 p
= &TREE_OPERAND (*p
, 0);
12275 /* Change a TARGET_EXPR from prvalue to xvalue. */
12276 if (TREE_CODE (*p
) == TARGET_EXPR
)
12277 *p
= build2 (COMPOUND_EXPR
, TREE_TYPE (*p
), *p
,
12278 move (TARGET_EXPR_SLOT (*p
)));
12282 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
12283 which is bound either to a reference or a std::initializer_list. */
12286 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
,
12292 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
12294 TREE_OPERAND (sub
, 1)
12295 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
,
12299 if (TREE_CODE (sub
) == COND_EXPR
)
12301 tree cur_cond_guard
= NULL_TREE
;
12302 if (TREE_OPERAND (sub
, 1))
12303 TREE_OPERAND (sub
, 1)
12304 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
,
12306 if (cur_cond_guard
)
12308 tree set
= cp_build_modify_expr (UNKNOWN_LOCATION
, cur_cond_guard
,
12309 NOP_EXPR
, boolean_true_node
,
12310 tf_warning_or_error
);
12311 TREE_OPERAND (sub
, 1)
12312 = cp_build_compound_expr (set
, TREE_OPERAND (sub
, 1),
12313 tf_warning_or_error
);
12315 cur_cond_guard
= NULL_TREE
;
12316 if (TREE_OPERAND (sub
, 2))
12317 TREE_OPERAND (sub
, 2)
12318 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 2), cleanups
,
12320 if (cur_cond_guard
)
12322 tree set
= cp_build_modify_expr (UNKNOWN_LOCATION
, cur_cond_guard
,
12323 NOP_EXPR
, boolean_true_node
,
12324 tf_warning_or_error
);
12325 TREE_OPERAND (sub
, 2)
12326 = cp_build_compound_expr (set
, TREE_OPERAND (sub
, 2),
12327 tf_warning_or_error
);
12331 if (TREE_CODE (sub
) != ADDR_EXPR
)
12333 /* Deal with binding to a subobject. */
12334 for (p
= &TREE_OPERAND (sub
, 0);
12335 TREE_CODE (*p
) == COMPONENT_REF
|| TREE_CODE (*p
) == ARRAY_REF
; )
12336 p
= &TREE_OPERAND (*p
, 0);
12337 if (TREE_CODE (*p
) == TARGET_EXPR
)
12339 tree subinit
= NULL_TREE
;
12340 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
, cond_guard
);
12341 recompute_tree_invariant_for_addr_expr (sub
);
12343 init
= fold_convert (TREE_TYPE (init
), sub
);
12345 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
12350 /* INIT is part of the initializer for DECL. If there are any
12351 reference or initializer lists being initialized, extend their
12352 lifetime to match that of DECL. */
12355 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
,
12358 tree type
= TREE_TYPE (init
);
12359 if (processing_template_decl
)
12361 if (TYPE_REF_P (type
))
12362 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
, cond_guard
);
12366 if (TREE_CODE (ctor
) == TARGET_EXPR
)
12367 ctor
= TARGET_EXPR_INITIAL (ctor
);
12368 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
12370 /* [dcl.init] When initializing an aggregate from a parenthesized list
12371 of values... a temporary object bound to a reference does not have
12372 its lifetime extended. */
12373 if (CONSTRUCTOR_IS_PAREN_INIT (ctor
))
12376 if (is_std_init_list (type
))
12378 /* The temporary array underlying a std::initializer_list
12379 is handled like a reference temporary. */
12380 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
12381 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
,
12383 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
12388 constructor_elt
*p
;
12389 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (ctor
);
12390 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
12391 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
,
12394 recompute_constructor_flags (ctor
);
12395 if (decl_maybe_constant_var_p (decl
) && TREE_CONSTANT (ctor
))
12396 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
12403 /* Returns true iff an initializer for TYPE could contain temporaries that
12404 need to be extended because they are bound to references or
12405 std::initializer_list. */
12408 type_has_extended_temps (tree type
)
12410 type
= strip_array_types (type
);
12411 if (TYPE_REF_P (type
))
12413 if (CLASS_TYPE_P (type
))
12415 if (is_std_init_list (type
))
12417 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
12418 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
12419 if (type_has_extended_temps (TREE_TYPE (f
)))
12425 /* Returns true iff TYPE is some variant of std::initializer_list. */
12428 is_std_init_list (tree type
)
12430 if (!TYPE_P (type
))
12432 if (cxx_dialect
== cxx98
)
12434 /* Look through typedefs. */
12435 type
= TYPE_MAIN_VARIANT (type
);
12436 return (CLASS_TYPE_P (type
)
12437 && CP_TYPE_CONTEXT (type
) == std_node
12438 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
)));
12441 /* Returns true iff DECL is a list constructor: i.e. a constructor which
12442 will accept an argument list of a single std::initializer_list<T>. */
12445 is_list_ctor (tree decl
)
12447 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
12450 if (!args
|| args
== void_list_node
)
12453 arg
= non_reference (TREE_VALUE (args
));
12454 if (!is_std_init_list (arg
))
12457 args
= TREE_CHAIN (args
);
12459 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
12460 /* There are more non-defaulted parms. */
12466 #include "gt-cp-call.h"