1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2019 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com) and
4 modified by Brendan Kehoe (brendan@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
27 #include "coretypes.h"
31 #include "stringpool.h"
33 #include "stor-layout.h"
34 #include "trans-mem.h"
39 #include "langhooks.h"
40 #include "c-family/c-objc.h"
41 #include "internal-fn.h"
42 #include "stringpool.h"
44 #include "gcc-rich-location.h"
46 /* The various kinds of conversion. */
48 enum conversion_kind
{
65 /* The rank of the conversion. Order of the enumerals matters; better
66 conversions should come earlier in the list. */
68 enum conversion_rank
{
79 /* An implicit conversion sequence, in the sense of [over.best.ics].
80 The first conversion to be performed is at the end of the chain.
81 That conversion is always a cr_identity conversion. */
84 /* The kind of conversion represented by this step. */
86 /* The rank of this conversion. */
88 BOOL_BITFIELD user_conv_p
: 1;
89 BOOL_BITFIELD ellipsis_p
: 1;
90 BOOL_BITFIELD this_p
: 1;
91 /* True if this conversion would be permitted with a bending of
92 language standards, e.g. disregarding pointer qualifiers or
93 converting integers to pointers. */
94 BOOL_BITFIELD bad_p
: 1;
95 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
96 temporary should be created to hold the result of the
97 conversion. If KIND is ck_ambig or ck_user, true means force
98 copy-initialization. */
99 BOOL_BITFIELD need_temporary_p
: 1;
100 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
101 from a pointer-to-derived to pointer-to-base is being performed. */
102 BOOL_BITFIELD base_p
: 1;
103 /* If KIND is ck_ref_bind, true when either an lvalue reference is
104 being bound to an lvalue expression or an rvalue reference is
105 being bound to an rvalue expression. If KIND is ck_rvalue or ck_base,
106 true when we are treating an lvalue as an rvalue (12.8p33). If
107 ck_identity, we will be binding a reference directly or decaying to
109 BOOL_BITFIELD rvaluedness_matches_p
: 1;
110 BOOL_BITFIELD check_narrowing
: 1;
111 /* Whether check_narrowing should only check TREE_CONSTANTs; used
112 in build_converted_constant_expr. */
113 BOOL_BITFIELD check_narrowing_const_only
: 1;
114 /* The type of the expression resulting from the conversion. */
117 /* The next conversion in the chain. Since the conversions are
118 arranged from outermost to innermost, the NEXT conversion will
119 actually be performed before this conversion. This variant is
120 used only when KIND is neither ck_identity, ck_ambig nor
121 ck_list. Please use the next_conversion function instead
122 of using this field directly. */
124 /* The expression at the beginning of the conversion chain. This
125 variant is used only if KIND is ck_identity or ck_ambig. You can
126 use conv_get_original_expr to get this expression. */
128 /* The array of conversions for an initializer_list, so this
129 variant is used only when KIN D is ck_list. */
132 /* The function candidate corresponding to this conversion
133 sequence. This field is only used if KIND is ck_user. */
134 struct z_candidate
*cand
;
137 #define CONVERSION_RANK(NODE) \
138 ((NODE)->bad_p ? cr_bad \
139 : (NODE)->ellipsis_p ? cr_ellipsis \
140 : (NODE)->user_conv_p ? cr_user \
143 #define BAD_CONVERSION_RANK(NODE) \
144 ((NODE)->ellipsis_p ? cr_ellipsis \
145 : (NODE)->user_conv_p ? cr_user \
148 static struct obstack conversion_obstack
;
149 static bool conversion_obstack_initialized
;
150 struct rejection_reason
;
152 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
153 static int equal_functions (tree
, tree
);
154 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
156 static int compare_ics (conversion
*, conversion
*);
157 static void maybe_warn_class_memaccess (location_t
, tree
,
158 const vec
<tree
, va_gc
> *);
159 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
160 #define convert_like(CONV, EXPR, COMPLAIN) \
161 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
162 /*issue_conversion_warnings=*/true, \
163 /*c_cast_p=*/false, (COMPLAIN))
164 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
165 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
166 /*issue_conversion_warnings=*/true, \
167 /*c_cast_p=*/false, (COMPLAIN))
168 static tree
convert_like_real (conversion
*, tree
, tree
, int, bool,
169 bool, tsubst_flags_t
);
170 static void op_error (const op_location_t
&, enum tree_code
, enum tree_code
,
171 tree
, tree
, tree
, bool);
172 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
174 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
175 static void print_z_candidates (location_t
, struct z_candidate
*);
176 static tree
build_this (tree
);
177 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
178 static bool any_strictly_viable (struct z_candidate
*);
179 static struct z_candidate
*add_template_candidate
180 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
181 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
182 static struct z_candidate
*add_template_candidate_real
183 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
184 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
185 static bool is_complete (tree
);
186 static struct z_candidate
*add_conv_candidate
187 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
188 tree
, tsubst_flags_t
);
189 static struct z_candidate
*add_function_candidate
190 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
191 tree
, int, conversion
**, tsubst_flags_t
);
192 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
194 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
196 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
197 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
198 static conversion
*next_conversion (conversion
*);
199 static bool is_subseq (conversion
*, conversion
*);
200 static conversion
*maybe_handle_ref_bind (conversion
**);
201 static void maybe_handle_implicit_object (conversion
**);
202 static struct z_candidate
*add_candidate
203 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
204 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
205 static tree
source_type (conversion
*);
206 static void add_warning (struct z_candidate
*, struct z_candidate
*);
207 static bool reference_compatible_p (tree
, tree
);
208 static conversion
*direct_reference_binding (tree
, conversion
*);
209 static bool promoted_arithmetic_type_p (tree
);
210 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
211 static char *name_as_c_string (tree
, tree
, bool *);
212 static tree
prep_operand (tree
);
213 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
214 bool, tree
, tree
, int, struct z_candidate
**,
216 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
217 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
218 static conversion
*build_identity_conv (tree
, tree
);
219 static inline bool conv_binds_to_array_of_unknown_bound (conversion
*);
221 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
222 NAME can take many forms... */
225 check_dtor_name (tree basetype
, tree name
)
227 /* Just accept something we've already complained about. */
228 if (name
== error_mark_node
)
231 if (TREE_CODE (name
) == TYPE_DECL
)
232 name
= TREE_TYPE (name
);
233 else if (TYPE_P (name
))
235 else if (identifier_p (name
))
237 if ((MAYBE_CLASS_TYPE_P (basetype
)
238 || TREE_CODE (basetype
) == ENUMERAL_TYPE
)
239 && name
== constructor_name (basetype
))
242 name
= get_type_value (name
);
248 template <class T> struct S { ~S(); };
252 NAME will be a class template. */
253 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
257 if (!name
|| name
== error_mark_node
)
259 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
262 /* We want the address of a function or method. We avoid creating a
263 pointer-to-member function. */
266 build_addr_func (tree function
, tsubst_flags_t complain
)
268 tree type
= TREE_TYPE (function
);
270 /* We have to do these by hand to avoid real pointer to member
272 if (TREE_CODE (type
) == METHOD_TYPE
)
274 if (TREE_CODE (function
) == OFFSET_REF
)
276 tree object
= build_address (TREE_OPERAND (function
, 0));
277 return get_member_function_from_ptrfunc (&object
,
278 TREE_OPERAND (function
, 1),
281 function
= build_address (function
);
283 else if (TREE_CODE (function
) == FUNCTION_DECL
284 && DECL_IMMEDIATE_FUNCTION_P (function
))
285 function
= build_address (function
);
287 function
= decay_conversion (function
, complain
, /*reject_builtin=*/false);
292 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
293 POINTER_TYPE to those. Note, pointer to member function types
294 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
295 two variants. build_call_a is the primitive taking an array of
296 arguments, while build_call_n is a wrapper that handles varargs. */
299 build_call_n (tree function
, int n
, ...)
302 return build_call_a (function
, 0, NULL
);
305 tree
*argarray
= XALLOCAVEC (tree
, n
);
310 for (i
= 0; i
< n
; i
++)
311 argarray
[i
] = va_arg (ap
, tree
);
313 return build_call_a (function
, n
, argarray
);
317 /* Update various flags in cfun and the call itself based on what is being
318 called. Split out of build_call_a so that bot_manip can use it too. */
321 set_flags_from_callee (tree call
)
323 /* Handle both CALL_EXPRs and AGGR_INIT_EXPRs. */
324 tree decl
= cp_get_callee_fndecl_nofold (call
);
326 /* We check both the decl and the type; a function may be known not to
327 throw without being declared throw(). */
328 bool nothrow
= decl
&& TREE_NOTHROW (decl
);
329 tree callee
= cp_get_callee (call
);
331 nothrow
|= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (callee
)));
332 else if (TREE_CODE (call
) == CALL_EXPR
333 && internal_fn_flags (CALL_EXPR_IFN (call
)) & ECF_NOTHROW
)
336 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
337 cp_function_chain
->can_throw
= 1;
339 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
340 current_function_returns_abnormally
= 1;
342 TREE_NOTHROW (call
) = nothrow
;
346 build_call_a (tree function
, int n
, tree
*argarray
)
353 function
= build_addr_func (function
, tf_warning_or_error
);
355 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
356 fntype
= TREE_TYPE (TREE_TYPE (function
));
357 gcc_assert (FUNC_OR_METHOD_TYPE_P (fntype
));
358 result_type
= TREE_TYPE (fntype
);
359 /* An rvalue has no cv-qualifiers. */
360 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
361 result_type
= cv_unqualified (result_type
);
363 function
= build_call_array_loc (input_location
,
364 result_type
, function
, n
, argarray
);
365 set_flags_from_callee (function
);
367 decl
= get_callee_fndecl (function
);
369 if (decl
&& !TREE_USED (decl
))
371 /* We invoke build_call directly for several library
372 functions. These may have been declared normally if
373 we're building libgcc, so we can't just check
375 gcc_assert (DECL_ARTIFICIAL (decl
)
376 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
381 require_complete_eh_spec_types (fntype
, decl
);
383 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
385 /* Don't pass empty class objects by value. This is useful
386 for tags in STL, which are used to control overload resolution.
387 We don't need to handle other cases of copying empty classes. */
388 if (!decl
|| !fndecl_built_in_p (decl
))
389 for (i
= 0; i
< n
; i
++)
391 tree arg
= CALL_EXPR_ARG (function
, i
);
392 if (is_empty_class (TREE_TYPE (arg
))
393 && simple_empty_class_p (TREE_TYPE (arg
), arg
, INIT_EXPR
))
395 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
396 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
397 CALL_EXPR_ARG (function
, i
) = arg
;
404 /* New overloading code. */
408 struct candidate_warning
{
410 candidate_warning
*next
;
413 /* Information for providing diagnostics about why overloading failed. */
415 enum rejection_reason_code
{
418 rr_explicit_conversion
,
419 rr_template_conversion
,
421 rr_bad_arg_conversion
,
422 rr_template_unification
,
425 rr_constraint_failure
428 struct conversion_info
{
429 /* The index of the argument, 0-based. */
431 /* The actual argument or its type. */
433 /* The type of the parameter. */
435 /* The location of the argument. */
439 struct rejection_reason
{
440 enum rejection_reason_code code
;
442 /* Information about an arity mismatch. */
444 /* The expected number of arguments. */
446 /* The actual number of arguments in the call. */
448 /* Whether the call was a varargs call. */
451 /* Information about an argument conversion mismatch. */
452 struct conversion_info conversion
;
453 /* Same, but for bad argument conversions. */
454 struct conversion_info bad_conversion
;
455 /* Information about template unification failures. These are the
456 parameters passed to fn_type_unification. */
464 unification_kind_t strict
;
466 } template_unification
;
467 /* Information about template instantiation failures. These are the
468 parameters passed to instantiate_template. */
472 } template_instantiation
;
477 /* The FUNCTION_DECL that will be called if this candidate is
478 selected by overload resolution. */
480 /* If not NULL_TREE, the first argument to use when calling this
483 /* The rest of the arguments to use when calling this function. If
484 there are no further arguments this may be NULL or it may be an
486 const vec
<tree
, va_gc
> *args
;
487 /* The implicit conversion sequences for each of the arguments to
490 /* The number of implicit conversion sequences. */
492 /* If FN is a user-defined conversion, the standard conversion
493 sequence from the type returned by FN to the desired destination
495 conversion
*second_conv
;
496 struct rejection_reason
*reason
;
497 /* If FN is a member function, the binfo indicating the path used to
498 qualify the name of FN at the call site. This path is used to
499 determine whether or not FN is accessible if it is selected by
500 overload resolution. The DECL_CONTEXT of FN will always be a
501 (possibly improper) base of this binfo. */
503 /* If FN is a non-static member function, the binfo indicating the
504 subobject to which the `this' pointer should be converted if FN
505 is selected by overload resolution. The type pointed to by
506 the `this' pointer must correspond to the most derived class
507 indicated by the CONVERSION_PATH. */
508 tree conversion_path
;
511 candidate_warning
*warnings
;
515 /* The flags active in add_candidate. */
518 bool rewritten () { return (flags
& LOOKUP_REWRITTEN
); }
519 bool reversed () { return (flags
& LOOKUP_REVERSED
); }
522 /* Returns true iff T is a null pointer constant in the sense of
526 null_ptr_cst_p (tree t
)
528 tree type
= TREE_TYPE (t
);
532 A null pointer constant is an integer literal ([lex.icon]) with value
533 zero or a prvalue of type std::nullptr_t. */
534 if (NULLPTR_TYPE_P (type
))
537 if (cxx_dialect
>= cxx11
)
539 STRIP_ANY_LOCATION_WRAPPER (t
);
541 /* Core issue 903 says only literal 0 is a null pointer constant. */
542 if (TREE_CODE (t
) == INTEGER_CST
543 && !TREE_OVERFLOW (t
)
544 && TREE_CODE (type
) == INTEGER_TYPE
546 && !char_type_p (type
))
549 else if (CP_INTEGRAL_TYPE_P (type
))
551 t
= fold_non_dependent_expr (t
, tf_none
);
553 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
560 /* Returns true iff T is a null member pointer value (4.11). */
563 null_member_pointer_value_p (tree t
)
565 tree type
= TREE_TYPE (t
);
568 else if (TYPE_PTRMEMFUNC_P (type
))
569 return (TREE_CODE (t
) == CONSTRUCTOR
570 && CONSTRUCTOR_NELTS (t
)
571 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
572 else if (TYPE_PTRDATAMEM_P (type
))
573 return integer_all_onesp (t
);
578 /* Returns nonzero if PARMLIST consists of only default parms,
579 ellipsis, and/or undeduced parameter packs. */
582 sufficient_parms_p (const_tree parmlist
)
584 for (; parmlist
&& parmlist
!= void_list_node
;
585 parmlist
= TREE_CHAIN (parmlist
))
586 if (!TREE_PURPOSE (parmlist
)
587 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
592 /* Allocate N bytes of memory from the conversion obstack. The memory
593 is zeroed before being returned. */
596 conversion_obstack_alloc (size_t n
)
599 if (!conversion_obstack_initialized
)
601 gcc_obstack_init (&conversion_obstack
);
602 conversion_obstack_initialized
= true;
604 p
= obstack_alloc (&conversion_obstack
, n
);
609 /* Allocate rejection reasons. */
611 static struct rejection_reason
*
612 alloc_rejection (enum rejection_reason_code code
)
614 struct rejection_reason
*p
;
615 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
620 static struct rejection_reason
*
621 arity_rejection (tree first_arg
, int expected
, int actual
)
623 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
624 int adjust
= first_arg
!= NULL_TREE
;
625 r
->u
.arity
.expected
= expected
- adjust
;
626 r
->u
.arity
.actual
= actual
- adjust
;
630 static struct rejection_reason
*
631 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
,
634 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
635 int adjust
= first_arg
!= NULL_TREE
;
636 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
637 r
->u
.conversion
.from
= from
;
638 r
->u
.conversion
.to_type
= to
;
639 r
->u
.conversion
.loc
= loc
;
643 static struct rejection_reason
*
644 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
,
647 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
648 int adjust
= first_arg
!= NULL_TREE
;
649 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
650 r
->u
.bad_conversion
.from
= from
;
651 r
->u
.bad_conversion
.to_type
= to
;
652 r
->u
.bad_conversion
.loc
= loc
;
656 static struct rejection_reason
*
657 explicit_conversion_rejection (tree from
, tree to
)
659 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
660 r
->u
.conversion
.n_arg
= 0;
661 r
->u
.conversion
.from
= from
;
662 r
->u
.conversion
.to_type
= to
;
663 r
->u
.conversion
.loc
= UNKNOWN_LOCATION
;
667 static struct rejection_reason
*
668 template_conversion_rejection (tree from
, tree to
)
670 struct rejection_reason
*r
= alloc_rejection (rr_template_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_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
680 const tree
*args
, unsigned int nargs
,
681 tree return_type
, unification_kind_t strict
,
684 size_t args_n_bytes
= sizeof (*args
) * nargs
;
685 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
686 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
687 r
->u
.template_unification
.tmpl
= tmpl
;
688 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
689 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
690 /* Copy args to our own storage. */
691 memcpy (args1
, args
, args_n_bytes
);
692 r
->u
.template_unification
.args
= args1
;
693 r
->u
.template_unification
.nargs
= nargs
;
694 r
->u
.template_unification
.return_type
= return_type
;
695 r
->u
.template_unification
.strict
= strict
;
696 r
->u
.template_unification
.flags
= flags
;
700 static struct rejection_reason
*
701 template_unification_error_rejection (void)
703 return alloc_rejection (rr_template_unification
);
706 static struct rejection_reason
*
707 invalid_copy_with_fn_template_rejection (void)
709 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
713 static struct rejection_reason
*
714 inherited_ctor_rejection (void)
716 struct rejection_reason
*r
= alloc_rejection (rr_inherited_ctor
);
720 /* Build a constraint failure record. */
722 static struct rejection_reason
*
723 constraint_failure (void)
725 struct rejection_reason
*r
= alloc_rejection (rr_constraint_failure
);
729 /* Dynamically allocate a conversion. */
732 alloc_conversion (conversion_kind kind
)
735 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
740 /* Make sure that all memory on the conversion obstack has been
744 validate_conversion_obstack (void)
746 if (conversion_obstack_initialized
)
747 gcc_assert ((obstack_next_free (&conversion_obstack
)
748 == obstack_base (&conversion_obstack
)));
751 /* Dynamically allocate an array of N conversions. */
754 alloc_conversions (size_t n
)
756 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
760 build_conv (conversion_kind code
, tree type
, conversion
*from
)
763 conversion_rank rank
= CONVERSION_RANK (from
);
765 /* Note that the caller is responsible for filling in t->cand for
766 user-defined conversions. */
767 t
= alloc_conversion (code
);
791 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
792 t
->bad_p
= from
->bad_p
;
797 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
798 specialization of std::initializer_list<T>, if such a conversion is
802 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
804 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
805 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
806 conversion
**subconvs
= alloc_conversions (len
);
811 /* Within a list-initialization we can have more user-defined
813 flags
&= ~LOOKUP_NO_CONVERSION
;
814 /* But no narrowing conversions. */
815 flags
|= LOOKUP_NO_NARROWING
;
817 /* Can't make an array of these types. */
818 if (TYPE_REF_P (elttype
)
819 || TREE_CODE (elttype
) == FUNCTION_TYPE
820 || VOID_TYPE_P (elttype
))
823 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
826 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
827 false, flags
, complain
);
834 t
= alloc_conversion (ck_list
);
836 t
->u
.list
= subconvs
;
839 for (i
= 0; i
< len
; ++i
)
841 conversion
*sub
= subconvs
[i
];
842 if (sub
->rank
> t
->rank
)
844 if (sub
->user_conv_p
)
845 t
->user_conv_p
= true;
853 /* Return the next conversion of the conversion chain (if applicable),
854 or NULL otherwise. Please use this function instead of directly
855 accessing fields of struct conversion. */
858 next_conversion (conversion
*conv
)
861 || conv
->kind
== ck_identity
862 || conv
->kind
== ck_ambig
863 || conv
->kind
== ck_list
)
868 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
869 is a valid aggregate initializer for array type ATYPE. */
872 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
875 tree elttype
= TREE_TYPE (atype
);
876 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
878 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
880 if (TREE_CODE (elttype
) == ARRAY_TYPE
881 && TREE_CODE (val
) == CONSTRUCTOR
)
882 ok
= can_convert_array (elttype
, val
, flags
, complain
);
884 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
892 /* Helper for build_aggr_conv. Return true if FIELD is in PSET, or if
893 FIELD has ANON_AGGR_TYPE_P and any initializable field in there recursively
897 field_in_pset (hash_set
<tree
, true> &pset
, tree field
)
899 if (pset
.contains (field
))
901 if (ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
902 for (field
= TYPE_FIELDS (TREE_TYPE (field
));
903 field
; field
= DECL_CHAIN (field
))
905 field
= next_initializable_field (field
);
906 if (field
== NULL_TREE
)
908 if (field_in_pset (pset
, field
))
914 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
915 aggregate class, if such a conversion is possible. */
918 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
920 unsigned HOST_WIDE_INT i
= 0;
922 tree field
= next_initializable_field (TYPE_FIELDS (type
));
923 tree empty_ctor
= NULL_TREE
;
924 hash_set
<tree
, true> pset
;
926 /* We already called reshape_init in implicit_conversion. */
928 /* The conversions within the init-list aren't affected by the enclosing
929 context; they're always simple copy-initialization. */
930 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
932 /* For designated initializers, verify that each initializer is convertible
933 to corresponding TREE_TYPE (ce->index) and mark those FIELD_DECLs as
934 visited. In the following loop then ignore already visited
936 if (CONSTRUCTOR_IS_DESIGNATED_INIT (ctor
))
939 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), i
, idx
, val
)
941 if (idx
&& TREE_CODE (idx
) == FIELD_DECL
)
943 tree ftype
= TREE_TYPE (idx
);
946 if (TREE_CODE (ftype
) == ARRAY_TYPE
947 && TREE_CODE (val
) == CONSTRUCTOR
)
948 ok
= can_convert_array (ftype
, val
, flags
, complain
);
950 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
955 /* For unions, there should be just one initializer. */
956 if (TREE_CODE (type
) == UNION_TYPE
)
969 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
971 tree ftype
= TREE_TYPE (field
);
975 if (!pset
.is_empty () && field_in_pset (pset
, field
))
977 if (i
< CONSTRUCTOR_NELTS (ctor
))
979 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
982 else if (DECL_INITIAL (field
))
983 val
= get_nsdmi (field
, /*ctor*/false, complain
);
984 else if (TYPE_REF_P (ftype
))
985 /* Value-initialization of reference is ill-formed. */
989 if (empty_ctor
== NULL_TREE
)
990 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
994 if (TREE_CODE (ftype
) == ARRAY_TYPE
995 && TREE_CODE (val
) == CONSTRUCTOR
)
996 ok
= can_convert_array (ftype
, val
, flags
, complain
);
998 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
1004 if (TREE_CODE (type
) == UNION_TYPE
)
1008 if (i
< CONSTRUCTOR_NELTS (ctor
))
1011 c
= alloc_conversion (ck_aggr
);
1014 c
->user_conv_p
= true;
1015 c
->check_narrowing
= true;
1020 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
1021 array type, if such a conversion is possible. */
1024 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
1027 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1028 tree elttype
= TREE_TYPE (type
);
1033 enum conversion_rank rank
= cr_exact
;
1035 /* We might need to propagate the size from the element to the array. */
1036 complete_type (type
);
1038 if (TYPE_DOMAIN (type
)
1039 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
1041 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
1046 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1048 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1051 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1052 false, flags
, complain
);
1056 if (sub
->rank
> rank
)
1058 if (sub
->user_conv_p
)
1064 c
= alloc_conversion (ck_aggr
);
1067 c
->user_conv_p
= user
;
1069 c
->u
.next
= build_identity_conv (TREE_TYPE (ctor
), ctor
);
1073 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1074 complex type, if such a conversion is possible. */
1077 build_complex_conv (tree type
, tree ctor
, int flags
,
1078 tsubst_flags_t complain
)
1081 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1082 tree elttype
= TREE_TYPE (type
);
1087 enum conversion_rank rank
= cr_exact
;
1092 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1094 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1097 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1098 false, flags
, complain
);
1102 if (sub
->rank
> rank
)
1104 if (sub
->user_conv_p
)
1110 c
= alloc_conversion (ck_aggr
);
1113 c
->user_conv_p
= user
;
1119 /* Build a representation of the identity conversion from EXPR to
1120 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1123 build_identity_conv (tree type
, tree expr
)
1127 c
= alloc_conversion (ck_identity
);
1134 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1135 were multiple user-defined conversions to accomplish the job.
1136 Build a conversion that indicates that ambiguity. */
1139 build_ambiguous_conv (tree type
, tree expr
)
1143 c
= alloc_conversion (ck_ambig
);
1151 strip_top_quals (tree t
)
1153 if (TREE_CODE (t
) == ARRAY_TYPE
)
1155 return cp_build_qualified_type (t
, 0);
1158 /* Returns the standard conversion path (see [conv]) from type FROM to type
1159 TO, if any. For proper handling of null pointer constants, you must
1160 also pass the expression EXPR to convert from. If C_CAST_P is true,
1161 this conversion is coming from a C-style cast. */
1164 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1165 int flags
, tsubst_flags_t complain
)
1167 enum tree_code fcode
, tcode
;
1169 bool fromref
= false;
1172 to
= non_reference (to
);
1173 if (TYPE_REF_P (from
))
1176 from
= TREE_TYPE (from
);
1179 to
= strip_top_quals (to
);
1180 from
= strip_top_quals (from
);
1182 if (expr
&& type_unknown_p (expr
))
1184 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1186 tsubst_flags_t tflags
= tf_conv
;
1187 expr
= instantiate_type (to
, expr
, tflags
);
1188 if (expr
== error_mark_node
)
1190 from
= TREE_TYPE (expr
);
1192 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1194 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1195 expr
= resolve_nondeduced_context (expr
, complain
);
1196 from
= TREE_TYPE (expr
);
1200 fcode
= TREE_CODE (from
);
1201 tcode
= TREE_CODE (to
);
1203 conv
= build_identity_conv (from
, expr
);
1204 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1206 from
= type_decays_to (from
);
1207 fcode
= TREE_CODE (from
);
1208 /* Tell convert_like_real that we're using the address. */
1209 conv
->rvaluedness_matches_p
= true;
1210 conv
= build_conv (ck_lvalue
, from
, conv
);
1212 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1213 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1214 express the copy constructor call required by copy-initialization. */
1215 else if (fromref
|| (expr
&& obvalue_p (expr
)))
1220 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1223 from
= strip_top_quals (bitfield_type
);
1224 fcode
= TREE_CODE (from
);
1227 conv
= build_conv (ck_rvalue
, from
, conv
);
1228 if (flags
& LOOKUP_PREFER_RVALUE
)
1229 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1230 conv
->rvaluedness_matches_p
= true;
1233 /* Allow conversion between `__complex__' data types. */
1234 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1236 /* The standard conversion sequence to convert FROM to TO is
1237 the standard conversion sequence to perform componentwise
1239 conversion
*part_conv
= standard_conversion
1240 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
,
1245 conv
= build_conv (part_conv
->kind
, to
, conv
);
1246 conv
->rank
= part_conv
->rank
;
1254 if (same_type_p (from
, to
))
1256 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1257 conv
->type
= qualified_to
;
1262 A null pointer constant can be converted to a pointer type; ... A
1263 null pointer constant of integral type can be converted to an
1264 rvalue of type std::nullptr_t. */
1265 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1266 || NULLPTR_TYPE_P (to
))
1267 && ((expr
&& null_ptr_cst_p (expr
))
1268 || NULLPTR_TYPE_P (from
)))
1269 conv
= build_conv (ck_std
, to
, conv
);
1270 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1271 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1273 /* For backwards brain damage compatibility, allow interconversion of
1274 pointers and integers with a pedwarn. */
1275 conv
= build_conv (ck_std
, to
, conv
);
1278 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1280 /* For backwards brain damage compatibility, allow interconversion of
1281 enums and integers with a pedwarn. */
1282 conv
= build_conv (ck_std
, to
, conv
);
1285 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1286 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1291 if (tcode
== POINTER_TYPE
)
1293 to_pointee
= TREE_TYPE (to
);
1294 from_pointee
= TREE_TYPE (from
);
1296 /* Since this is the target of a pointer, it can't have function
1297 qualifiers, so any TYPE_QUALS must be for attributes const or
1298 noreturn. Strip them. */
1299 if (TREE_CODE (to_pointee
) == FUNCTION_TYPE
1300 && TYPE_QUALS (to_pointee
))
1301 to_pointee
= build_qualified_type (to_pointee
, TYPE_UNQUALIFIED
);
1302 if (TREE_CODE (from_pointee
) == FUNCTION_TYPE
1303 && TYPE_QUALS (from_pointee
))
1304 from_pointee
= build_qualified_type (from_pointee
, TYPE_UNQUALIFIED
);
1308 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1309 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1312 if (tcode
== POINTER_TYPE
1313 && same_type_ignoring_top_level_qualifiers_p (from_pointee
,
1316 else if (VOID_TYPE_P (to_pointee
)
1317 && !TYPE_PTRDATAMEM_P (from
)
1318 && TREE_CODE (from_pointee
) != FUNCTION_TYPE
)
1320 tree nfrom
= TREE_TYPE (from
);
1321 /* Don't try to apply restrict to void. */
1322 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1323 from_pointee
= cp_build_qualified_type (void_type_node
, quals
);
1324 from
= build_pointer_type (from_pointee
);
1325 conv
= build_conv (ck_ptr
, from
, conv
);
1327 else if (TYPE_PTRDATAMEM_P (from
))
1329 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1330 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1332 if (same_type_p (fbase
, tbase
))
1333 /* No base conversion needed. */;
1334 else if (DERIVED_FROM_P (fbase
, tbase
)
1335 && (same_type_ignoring_top_level_qualifiers_p
1336 (from_pointee
, to_pointee
)))
1338 from
= build_ptrmem_type (tbase
, from_pointee
);
1339 conv
= build_conv (ck_pmem
, from
, conv
);
1344 else if (CLASS_TYPE_P (from_pointee
)
1345 && CLASS_TYPE_P (to_pointee
)
1348 An rvalue of type "pointer to cv D," where D is a
1349 class type, can be converted to an rvalue of type
1350 "pointer to cv B," where B is a base class (clause
1351 _class.derived_) of D. If B is an inaccessible
1352 (clause _class.access_) or ambiguous
1353 (_class.member.lookup_) base class of D, a program
1354 that necessitates this conversion is ill-formed.
1355 Therefore, we use DERIVED_FROM_P, and do not check
1356 access or uniqueness. */
1357 && DERIVED_FROM_P (to_pointee
, from_pointee
))
1360 = cp_build_qualified_type (to_pointee
,
1361 cp_type_quals (from_pointee
));
1362 from
= build_pointer_type (from_pointee
);
1363 conv
= build_conv (ck_ptr
, from
, conv
);
1364 conv
->base_p
= true;
1367 if (same_type_p (from
, to
))
1369 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
, bounds_either
))
1370 /* In a C-style cast, we ignore CV-qualification because we
1371 are allowed to perform a static_cast followed by a
1373 conv
= build_conv (ck_qual
, to
, conv
);
1374 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1375 conv
= build_conv (ck_qual
, to
, conv
);
1376 else if (expr
&& string_conv_p (to
, expr
, 0))
1377 /* converting from string constant to char *. */
1378 conv
= build_conv (ck_qual
, to
, conv
);
1379 else if (fnptr_conv_p (to
, from
))
1380 conv
= build_conv (ck_fnptr
, to
, conv
);
1381 /* Allow conversions among compatible ObjC pointer types (base
1382 conversions have been already handled above). */
1383 else if (c_dialect_objc ()
1384 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1385 conv
= build_conv (ck_ptr
, to
, conv
);
1386 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1388 conv
= build_conv (ck_ptr
, to
, conv
);
1396 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1398 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1399 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1400 tree fbase
= class_of_this_parm (fromfn
);
1401 tree tbase
= class_of_this_parm (tofn
);
1403 if (!DERIVED_FROM_P (fbase
, tbase
))
1406 tree fstat
= static_fn_type (fromfn
);
1407 tree tstat
= static_fn_type (tofn
);
1408 if (same_type_p (tstat
, fstat
)
1409 || fnptr_conv_p (tstat
, fstat
))
1414 if (!same_type_p (fbase
, tbase
))
1416 from
= build_memfn_type (fstat
,
1418 cp_type_quals (tbase
),
1419 type_memfn_rqual (tofn
));
1420 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1421 conv
= build_conv (ck_pmem
, from
, conv
);
1422 conv
->base_p
= true;
1424 if (fnptr_conv_p (tstat
, fstat
))
1425 conv
= build_conv (ck_fnptr
, to
, conv
);
1427 else if (tcode
== BOOLEAN_TYPE
)
1431 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1432 to member type can be converted to a prvalue of type bool. ...
1433 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1434 std::nullptr_t can be converted to a prvalue of type bool; */
1435 if (ARITHMETIC_TYPE_P (from
)
1436 || UNSCOPED_ENUM_P (from
)
1437 || fcode
== POINTER_TYPE
1438 || TYPE_PTRMEM_P (from
)
1439 || NULLPTR_TYPE_P (from
))
1441 conv
= build_conv (ck_std
, to
, conv
);
1442 if (fcode
== POINTER_TYPE
1443 || TYPE_PTRDATAMEM_P (from
)
1444 || (TYPE_PTRMEMFUNC_P (from
)
1445 && conv
->rank
< cr_pbool
)
1446 || NULLPTR_TYPE_P (from
))
1447 conv
->rank
= cr_pbool
;
1448 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1450 if (flags
& LOOKUP_NO_NARROWING
)
1451 conv
->check_narrowing
= true;
1457 /* We don't check for ENUMERAL_TYPE here because there are no standard
1458 conversions to enum type. */
1459 /* As an extension, allow conversion to complex type. */
1460 else if (ARITHMETIC_TYPE_P (to
))
1462 if (! (INTEGRAL_CODE_P (fcode
)
1463 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1464 || SCOPED_ENUM_P (from
))
1467 /* If we're parsing an enum with no fixed underlying type, we're
1468 dealing with an incomplete type, which renders the conversion
1470 if (!COMPLETE_TYPE_P (from
))
1473 conv
= build_conv (ck_std
, to
, conv
);
1475 tree underlying_type
= NULL_TREE
;
1476 if (TREE_CODE (from
) == ENUMERAL_TYPE
1477 && ENUM_FIXED_UNDERLYING_TYPE_P (from
))
1478 underlying_type
= ENUM_UNDERLYING_TYPE (from
);
1480 /* Give this a better rank if it's a promotion.
1482 To handle CWG 1601, also bump the rank if we are converting
1483 an enumeration with a fixed underlying type to the underlying
1485 if ((same_type_p (to
, type_promotes_to (from
))
1486 || (underlying_type
&& same_type_p (to
, underlying_type
)))
1487 && next_conversion (conv
)->rank
<= cr_promotion
)
1488 conv
->rank
= cr_promotion
;
1490 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1491 && vector_types_convertible_p (from
, to
, false))
1492 return build_conv (ck_std
, to
, conv
);
1493 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1494 && is_properly_derived_from (from
, to
))
1496 if (conv
->kind
== ck_rvalue
)
1497 conv
= next_conversion (conv
);
1498 conv
= build_conv (ck_base
, to
, conv
);
1499 /* The derived-to-base conversion indicates the initialization
1500 of a parameter with base type from an object of a derived
1501 type. A temporary object is created to hold the result of
1502 the conversion unless we're binding directly to a reference. */
1503 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1504 if (flags
& LOOKUP_PREFER_RVALUE
)
1505 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1506 conv
->rvaluedness_matches_p
= true;
1511 if (flags
& LOOKUP_NO_NARROWING
)
1512 conv
->check_narrowing
= true;
1517 /* Returns nonzero if T1 is reference-related to T2. */
1520 reference_related_p (tree t1
, tree t2
)
1522 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1525 t1
= TYPE_MAIN_VARIANT (t1
);
1526 t2
= TYPE_MAIN_VARIANT (t2
);
1530 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1531 to "cv2 T2" if T1 is similar to T2, or T1 is a base class of T2. */
1532 return (similar_type_p (t1
, t2
)
1533 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1534 && DERIVED_FROM_P (t1
, t2
)));
1537 /* Returns nonzero if T1 is reference-compatible with T2. */
1540 reference_compatible_p (tree t1
, tree t2
)
1544 "cv1 T1" is reference compatible with "cv2 T2" if
1545 a prvalue of type "pointer to cv2 T2" can be converted to the type
1546 "pointer to cv1 T1" via a standard conversion sequence. */
1547 tree ptype1
= build_pointer_type (t1
);
1548 tree ptype2
= build_pointer_type (t2
);
1549 conversion
*conv
= standard_conversion (ptype1
, ptype2
, NULL_TREE
,
1550 /*c_cast_p=*/false, 0, tf_none
);
1551 if (!conv
|| conv
->bad_p
)
1556 /* Return true if converting FROM to TO would involve a qualification
1560 involves_qualification_conversion_p (tree to
, tree from
)
1562 /* If we're not convering a pointer to another one, we won't get
1563 a qualification conversion. */
1564 if (!((TYPE_PTR_P (to
) && TYPE_PTR_P (from
))
1565 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
))))
1568 conversion
*conv
= standard_conversion (to
, from
, NULL_TREE
,
1569 /*c_cast_p=*/false, 0, tf_none
);
1570 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1571 if (t
->kind
== ck_qual
)
1577 /* A reference of the indicated TYPE is being bound directly to the
1578 expression represented by the implicit conversion sequence CONV.
1579 Return a conversion sequence for this binding. */
1582 direct_reference_binding (tree type
, conversion
*conv
)
1586 gcc_assert (TYPE_REF_P (type
));
1587 gcc_assert (!TYPE_REF_P (conv
->type
));
1589 t
= TREE_TYPE (type
);
1591 if (conv
->kind
== ck_identity
)
1592 /* Mark the identity conv as to not decay to rvalue. */
1593 conv
->rvaluedness_matches_p
= true;
1597 When a parameter of reference type binds directly
1598 (_dcl.init.ref_) to an argument expression, the implicit
1599 conversion sequence is the identity conversion, unless the
1600 argument expression has a type that is a derived class of the
1601 parameter type, in which case the implicit conversion sequence is
1602 a derived-to-base Conversion.
1604 If the parameter binds directly to the result of applying a
1605 conversion function to the argument expression, the implicit
1606 conversion sequence is a user-defined conversion sequence
1607 (_over.ics.user_), with the second standard conversion sequence
1608 either an identity conversion or, if the conversion function
1609 returns an entity of a type that is a derived class of the
1610 parameter type, a derived-to-base conversion. */
1611 if (is_properly_derived_from (conv
->type
, t
))
1613 /* Represent the derived-to-base conversion. */
1614 conv
= build_conv (ck_base
, t
, conv
);
1615 /* We will actually be binding to the base-class subobject in
1616 the derived class, so we mark this conversion appropriately.
1617 That way, convert_like knows not to generate a temporary. */
1618 conv
->need_temporary_p
= false;
1620 else if (involves_qualification_conversion_p (t
, conv
->type
))
1621 /* Represent the qualification conversion. After DR 2352
1622 #1 and #2 were indistinguishable conversion sequences:
1625 void f(const int* const &); // #2
1626 void g(int* p) { f(p); }
1628 because the types "int *" and "const int *const" are
1629 reference-related and we were binding both directly and they
1630 had the same rank. To break it up, we add a ck_qual under the
1631 ck_ref_bind so that conversion sequence ranking chooses #1. */
1632 conv
= build_conv (ck_qual
, t
, conv
);
1634 return build_conv (ck_ref_bind
, type
, conv
);
1637 /* Returns the conversion path from type FROM to reference type TO for
1638 purposes of reference binding. For lvalue binding, either pass a
1639 reference type to FROM or an lvalue expression to EXPR. If the
1640 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1641 the conversion returned. If C_CAST_P is true, this
1642 conversion is coming from a C-style cast. */
1645 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1646 tsubst_flags_t complain
)
1648 conversion
*conv
= NULL
;
1649 tree to
= TREE_TYPE (rto
);
1654 cp_lvalue_kind gl_kind
;
1657 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1659 expr
= instantiate_type (to
, expr
, tf_none
);
1660 if (expr
== error_mark_node
)
1662 from
= TREE_TYPE (expr
);
1665 bool copy_list_init
= false;
1666 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1668 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1669 /* DR 1288: Otherwise, if the initializer list has a single element
1670 of type E and ... [T's] referenced type is reference-related to E,
1671 the object or reference is initialized from that element...
1673 ??? With P0388R4, we should bind 't' directly to U{}:
1676 because A[] and A[2] are reference-related. But we don't do it
1677 because grok_reference_init has deduced the array size (to 1), and
1678 A[1] and A[2] aren't reference-related. */
1679 if (CONSTRUCTOR_NELTS (expr
) == 1)
1681 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1682 if (error_operand_p (elt
))
1684 tree etype
= TREE_TYPE (elt
);
1685 if (reference_related_p (to
, etype
))
1692 /* Otherwise, if T is a reference type, a prvalue temporary of the type
1693 referenced by T is copy-list-initialized, and the reference is bound
1694 to that temporary. */
1695 copy_list_init
= true;
1699 if (TYPE_REF_P (from
))
1701 from
= TREE_TYPE (from
);
1702 if (!TYPE_REF_IS_RVALUE (rfrom
)
1703 || TREE_CODE (from
) == FUNCTION_TYPE
)
1704 gl_kind
= clk_ordinary
;
1706 gl_kind
= clk_rvalueref
;
1709 gl_kind
= lvalue_kind (expr
);
1710 else if (CLASS_TYPE_P (from
)
1711 || TREE_CODE (from
) == ARRAY_TYPE
)
1712 gl_kind
= clk_class
;
1716 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1717 if ((flags
& LOOKUP_NO_TEMP_BIND
)
1718 && (gl_kind
& clk_class
))
1721 /* Same mask as real_lvalue_p. */
1722 is_lvalue
= gl_kind
&& !(gl_kind
& (clk_rvalueref
|clk_class
));
1725 if ((gl_kind
& clk_bitfield
) != 0)
1726 tfrom
= unlowered_expr_type (expr
);
1728 /* Figure out whether or not the types are reference-related and
1729 reference compatible. We have to do this after stripping
1730 references from FROM. */
1731 related_p
= reference_related_p (to
, tfrom
);
1732 /* If this is a C cast, first convert to an appropriately qualified
1733 type, so that we can later do a const_cast to the desired type. */
1734 if (related_p
&& c_cast_p
1735 && !at_least_as_qualified_p (to
, tfrom
))
1736 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1737 compatible_p
= reference_compatible_p (to
, tfrom
);
1739 /* Directly bind reference when target expression's type is compatible with
1740 the reference and expression is an lvalue. In DR391, the wording in
1741 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1742 const and rvalue references to rvalues of compatible class type.
1743 We should also do direct bindings for non-class xvalues. */
1744 if ((related_p
|| compatible_p
) && gl_kind
)
1748 If the initializer expression
1750 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1751 is reference-compatible with "cv2 T2,"
1753 the reference is bound directly to the initializer expression
1757 If the initializer expression is an rvalue, with T2 a class type,
1758 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1759 is bound to the object represented by the rvalue or to a sub-object
1760 within that object. */
1762 conv
= build_identity_conv (tfrom
, expr
);
1763 conv
= direct_reference_binding (rto
, conv
);
1765 if (TYPE_REF_P (rfrom
))
1766 /* Handle rvalue reference to function properly. */
1767 conv
->rvaluedness_matches_p
1768 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1770 conv
->rvaluedness_matches_p
1771 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1773 if ((gl_kind
& clk_bitfield
) != 0
1774 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1775 /* For the purposes of overload resolution, we ignore the fact
1776 this expression is a bitfield or packed field. (In particular,
1777 [over.ics.ref] says specifically that a function with a
1778 non-const reference parameter is viable even if the
1779 argument is a bitfield.)
1781 However, when we actually call the function we must create
1782 a temporary to which to bind the reference. If the
1783 reference is volatile, or isn't const, then we cannot make
1784 a temporary, so we just issue an error when the conversion
1786 conv
->need_temporary_p
= true;
1788 /* Don't allow binding of lvalues (other than function lvalues) to
1789 rvalue references. */
1790 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1791 && TREE_CODE (to
) != FUNCTION_TYPE
)
1794 /* Nor the reverse. */
1795 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1796 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1797 || (flags
& LOOKUP_NO_RVAL_BIND
))
1798 && TREE_CODE (to
) != FUNCTION_TYPE
)
1806 /* [class.conv.fct] A conversion function is never used to convert a
1807 (possibly cv-qualified) object to the (possibly cv-qualified) same
1808 object type (or a reference to it), to a (possibly cv-qualified) base
1809 class of that type (or a reference to it).... */
1810 else if (CLASS_TYPE_P (from
) && !related_p
1811 && !(flags
& LOOKUP_NO_CONVERSION
))
1815 If the initializer expression
1817 -- has a class type (i.e., T2 is a class type) can be
1818 implicitly converted to an lvalue of type "cv3 T3," where
1819 "cv1 T1" is reference-compatible with "cv3 T3". (this
1820 conversion is selected by enumerating the applicable
1821 conversion functions (_over.match.ref_) and choosing the
1822 best one through overload resolution. (_over.match_).
1824 the reference is bound to the lvalue result of the conversion
1825 in the second case. */
1826 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1829 return cand
->second_conv
;
1832 /* From this point on, we conceptually need temporaries, even if we
1833 elide them. Only the cases above are "direct bindings". */
1834 if (flags
& LOOKUP_NO_TEMP_BIND
)
1839 When a parameter of reference type is not bound directly to an
1840 argument expression, the conversion sequence is the one required
1841 to convert the argument expression to the underlying type of the
1842 reference according to _over.best.ics_. Conceptually, this
1843 conversion sequence corresponds to copy-initializing a temporary
1844 of the underlying type with the argument expression. Any
1845 difference in top-level cv-qualification is subsumed by the
1846 initialization itself and does not constitute a conversion. */
1850 Otherwise, the reference shall be an lvalue reference to a
1851 non-volatile const type, or the reference shall be an rvalue
1854 We try below to treat this as a bad conversion to improve diagnostics,
1855 but if TO is an incomplete class, we need to reject this conversion
1856 now to avoid unnecessary instantiation. */
1857 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1858 && !COMPLETE_TYPE_P (to
))
1861 /* We're generating a temporary now, but don't bind any more in the
1862 conversion (specifically, don't slice the temporary returned by a
1863 conversion operator). */
1864 flags
|= LOOKUP_NO_TEMP_BIND
;
1866 /* Core issue 899: When [copy-]initializing a temporary to be bound
1867 to the first parameter of a copy constructor (12.8) called with
1868 a single argument in the context of direct-initialization,
1869 explicit conversion functions are also considered.
1871 So don't set LOOKUP_ONLYCONVERTING in that case. */
1872 if (!(flags
& LOOKUP_COPY_PARM
))
1873 flags
|= LOOKUP_ONLYCONVERTING
;
1876 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1881 if (conv
->user_conv_p
)
1884 /* Remember this was copy-list-initialization. */
1885 conv
->need_temporary_p
= true;
1887 /* If initializing the temporary used a conversion function,
1888 recalculate the second conversion sequence. */
1889 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1890 if (t
->kind
== ck_user
1891 && DECL_CONV_FN_P (t
->cand
->fn
))
1893 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1894 /* A prvalue of non-class type is cv-unqualified. */
1895 if (!TYPE_REF_P (ftype
) && !CLASS_TYPE_P (ftype
))
1896 ftype
= cv_unqualified (ftype
);
1897 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1898 conversion
*new_second
1899 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1903 return merge_conversion_sequences (t
, new_second
);
1907 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1908 /* This reference binding, unlike those above, requires the
1909 creation of a temporary. */
1910 conv
->need_temporary_p
= true;
1911 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1915 Otherwise, the reference shall be an lvalue reference to a
1916 non-volatile const type, or the reference shall be an rvalue
1918 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1923 Otherwise, a temporary of type "cv1 T1" is created and
1924 initialized from the initializer expression using the rules for a
1925 non-reference copy initialization. If T1 is reference-related to
1926 T2, cv1 must be the same cv-qualification as, or greater
1927 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1928 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1934 /* Returns the implicit conversion sequence (see [over.ics]) from type
1935 FROM to type TO. The optional expression EXPR may affect the
1936 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1937 true, this conversion is coming from a C-style cast. */
1940 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1941 int flags
, tsubst_flags_t complain
)
1945 if (from
== error_mark_node
|| to
== error_mark_node
1946 || expr
== error_mark_node
)
1949 /* Other flags only apply to the primary function in overload
1950 resolution, or after we've chosen one. */
1951 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1952 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1953 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1955 /* FIXME: actually we don't want warnings either, but we can't just
1956 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1957 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1958 We really ought not to issue that warning until we've committed
1959 to that conversion. */
1960 complain
&= ~tf_error
;
1962 /* Call reshape_init early to remove redundant braces. */
1963 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1964 && CLASS_TYPE_P (to
)
1965 && COMPLETE_TYPE_P (complete_type (to
))
1966 && !CLASSTYPE_NON_AGGREGATE (to
))
1968 expr
= reshape_init (to
, expr
, complain
);
1969 if (expr
== error_mark_node
)
1971 from
= TREE_TYPE (expr
);
1974 if (TYPE_REF_P (to
))
1975 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1977 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
1982 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1984 if (is_std_init_list (to
) && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr
))
1985 return build_list_conv (to
, expr
, flags
, complain
);
1987 /* As an extension, allow list-initialization of _Complex. */
1988 if (TREE_CODE (to
) == COMPLEX_TYPE
1989 && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr
))
1991 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1996 /* Allow conversion from an initializer-list with one element to a
1998 if (SCALAR_TYPE_P (to
))
2000 int nelts
= CONSTRUCTOR_NELTS (expr
);
2004 elt
= build_value_init (to
, tf_none
);
2005 else if (nelts
== 1 && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr
))
2006 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
2008 elt
= error_mark_node
;
2010 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
2011 c_cast_p
, flags
, complain
);
2014 conv
->check_narrowing
= true;
2015 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
2016 /* Too many levels of braces, i.e. '{{1}}'. */
2021 else if (TREE_CODE (to
) == ARRAY_TYPE
)
2022 return build_array_conv (to
, expr
, flags
, complain
);
2025 if (expr
!= NULL_TREE
2026 && (MAYBE_CLASS_TYPE_P (from
)
2027 || MAYBE_CLASS_TYPE_P (to
))
2028 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
2030 struct z_candidate
*cand
;
2032 if (CLASS_TYPE_P (to
)
2033 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
2034 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
2035 return build_aggr_conv (to
, expr
, flags
, complain
);
2037 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
2040 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
2041 && CONSTRUCTOR_NELTS (expr
) == 1
2042 && !is_list_ctor (cand
->fn
))
2044 /* "If C is not an initializer-list constructor and the
2045 initializer list has a single element of type cv U, where U is
2046 X or a class derived from X, the implicit conversion sequence
2047 has Exact Match rank if U is X, or Conversion rank if U is
2049 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
2050 tree elttype
= TREE_TYPE (elt
);
2051 if (reference_related_p (to
, elttype
))
2052 return implicit_conversion (to
, elttype
, elt
,
2053 c_cast_p
, flags
, complain
);
2055 conv
= cand
->second_conv
;
2058 /* We used to try to bind a reference to a temporary here, but that
2059 is now handled after the recursive call to this function at the end
2060 of reference_binding. */
2067 /* Like implicit_conversion, but return NULL if the conversion is bad.
2069 This is not static so that check_non_deducible_conversion can call it within
2070 add_template_candidate_real as part of overload resolution; it should not be
2071 called outside of overload resolution. */
2074 good_conversion (tree to
, tree from
, tree expr
,
2075 int flags
, tsubst_flags_t complain
)
2077 conversion
*c
= implicit_conversion (to
, from
, expr
, /*cast*/false,
2084 /* Add a new entry to the list of candidates. Used by the add_*_candidate
2085 functions. ARGS will not be changed until a single candidate is
2088 static struct z_candidate
*
2089 add_candidate (struct z_candidate
**candidates
,
2090 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
2091 size_t num_convs
, conversion
**convs
,
2092 tree access_path
, tree conversion_path
,
2093 int viable
, struct rejection_reason
*reason
,
2096 struct z_candidate
*cand
= (struct z_candidate
*)
2097 conversion_obstack_alloc (sizeof (struct z_candidate
));
2100 cand
->first_arg
= first_arg
;
2102 cand
->convs
= convs
;
2103 cand
->num_convs
= num_convs
;
2104 cand
->access_path
= access_path
;
2105 cand
->conversion_path
= conversion_path
;
2106 cand
->viable
= viable
;
2107 cand
->reason
= reason
;
2108 cand
->next
= *candidates
;
2109 cand
->flags
= flags
;
2112 if (convs
&& cand
->reversed ())
2113 /* Swap the conversions for comparison in joust; we'll swap them back
2114 before build_over_call. */
2115 std::swap (convs
[0], convs
[1]);
2120 /* Return the number of remaining arguments in the parameter list
2121 beginning with ARG. */
2124 remaining_arguments (tree arg
)
2128 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
2129 arg
= TREE_CHAIN (arg
))
2135 /* [over.match.copy]: When initializing a temporary object (12.2) to be bound
2136 to the first parameter of a constructor where the parameter is of type
2137 "reference to possibly cv-qualified T" and the constructor is called with a
2138 single argument in the context of direct-initialization of an object of type
2139 "cv2 T", explicit conversion functions are also considered.
2141 So set LOOKUP_COPY_PARM to let reference_binding know that
2142 it's being called in that context. */
2145 conv_flags (int i
, int nargs
, tree fn
, tree arg
, int flags
)
2149 if (i
== 0 && nargs
== 1 && DECL_CONSTRUCTOR_P (fn
)
2150 && (t
= FUNCTION_FIRST_USER_PARMTYPE (fn
))
2151 && (same_type_ignoring_top_level_qualifiers_p
2152 (non_reference (TREE_VALUE (t
)), DECL_CONTEXT (fn
))))
2154 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2155 lflags
|= LOOKUP_COPY_PARM
;
2156 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2157 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2158 lflags
|= LOOKUP_NO_CONVERSION
;
2161 lflags
|= LOOKUP_ONLYCONVERTING
;
2166 /* Create an overload candidate for the function or method FN called
2167 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
2168 FLAGS is passed on to implicit_conversion.
2170 This does not change ARGS.
2172 CTYPE, if non-NULL, is the type we want to pretend this function
2173 comes from for purposes of overload resolution. */
2175 static struct z_candidate
*
2176 add_function_candidate (struct z_candidate
**candidates
,
2177 tree fn
, tree ctype
, tree first_arg
,
2178 const vec
<tree
, va_gc
> *args
, tree access_path
,
2179 tree conversion_path
, int flags
,
2181 tsubst_flags_t complain
)
2183 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2186 tree orig_first_arg
= first_arg
;
2189 struct rejection_reason
*reason
= NULL
;
2191 /* At this point we should not see any functions which haven't been
2192 explicitly declared, except for friend functions which will have
2193 been found using argument dependent lookup. */
2194 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
2196 /* The `this', `in_chrg' and VTT arguments to constructors are not
2197 considered in overload resolution. */
2198 if (DECL_CONSTRUCTOR_P (fn
))
2200 if (ctor_omit_inherited_parms (fn
))
2201 /* Bring back parameters omitted from an inherited ctor. */
2202 parmlist
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn
));
2204 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
2205 skip
= num_artificial_parms_for (fn
);
2206 if (skip
> 0 && first_arg
!= NULL_TREE
)
2209 first_arg
= NULL_TREE
;
2215 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
2217 convs
= alloc_conversions (len
);
2219 /* 13.3.2 - Viable functions [over.match.viable]
2220 First, to be a viable function, a candidate function shall have enough
2221 parameters to agree in number with the arguments in the list.
2223 We need to check this first; otherwise, checking the ICSes might cause
2224 us to produce an ill-formed template instantiation. */
2226 parmnode
= parmlist
;
2227 for (i
= 0; i
< len
; ++i
)
2229 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
2231 parmnode
= TREE_CHAIN (parmnode
);
2234 if ((i
< len
&& parmnode
)
2235 || !sufficient_parms_p (parmnode
))
2237 int remaining
= remaining_arguments (parmnode
);
2239 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2242 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2243 parameter of type "reference to cv C" (including such a constructor
2244 instantiated from a template) is excluded from the set of candidate
2245 functions when used to construct an object of type D with an argument list
2246 containing a single argument if C is reference-related to D. */
2247 if (viable
&& len
== 1 && parmlist
&& DECL_CONSTRUCTOR_P (fn
)
2248 && flag_new_inheriting_ctors
2249 && DECL_INHERITED_CTOR (fn
))
2251 tree ptype
= non_reference (TREE_VALUE (parmlist
));
2252 tree dtype
= DECL_CONTEXT (fn
);
2253 tree btype
= DECL_INHERITED_CTOR_BASE (fn
);
2254 if (reference_related_p (ptype
, dtype
)
2255 && reference_related_p (btype
, ptype
))
2258 reason
= inherited_ctor_rejection ();
2262 /* Second, for a function to be viable, its constraints must be
2264 if (flag_concepts
&& viable
&& !constraints_satisfied_p (fn
))
2266 reason
= constraint_failure ();
2270 /* When looking for a function from a subobject from an implicit
2271 copy/move constructor/operator=, don't consider anything that takes (a
2272 reference to) an unrelated type. See c++/44909 and core 1092. */
2273 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2275 if (DECL_CONSTRUCTOR_P (fn
))
2277 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2278 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
))
2284 parmnode
= chain_index (i
-1, parmlist
);
2285 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2290 /* This only applies at the top level. */
2291 flags
&= ~LOOKUP_DEFAULTED
;
2297 /* Third, for F to be a viable function, there shall exist for each
2298 argument an implicit conversion sequence that converts that argument
2299 to the corresponding parameter of F. */
2301 parmnode
= parmlist
;
2303 for (i
= 0; i
< len
; ++i
)
2305 tree argtype
, to_type
;
2310 if (parmnode
== void_list_node
)
2315 /* Already set during deduction. */
2316 parmnode
= TREE_CHAIN (parmnode
);
2320 if (i
== 0 && first_arg
!= NULL_TREE
)
2323 arg
= CONST_CAST_TREE (
2324 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2325 argtype
= lvalue_type (arg
);
2327 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2328 && ! DECL_CONSTRUCTOR_P (fn
));
2332 tree parmtype
= TREE_VALUE (parmnode
);
2334 parmnode
= TREE_CHAIN (parmnode
);
2336 /* The type of the implicit object parameter ('this') for
2337 overload resolution is not always the same as for the
2338 function itself; conversion functions are considered to
2339 be members of the class being converted, and functions
2340 introduced by a using-declaration are considered to be
2341 members of the class that uses them.
2343 Since build_over_call ignores the ICS for the `this'
2344 parameter, we can just change the parm type. */
2345 if (ctype
&& is_this
)
2347 parmtype
= cp_build_qualified_type
2348 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2349 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2351 /* If the function has a ref-qualifier, the implicit
2352 object parameter has reference type. */
2353 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2354 parmtype
= cp_build_reference_type (parmtype
, rv
);
2355 /* The special handling of 'this' conversions in compare_ics
2356 does not apply if there is a ref-qualifier. */
2361 parmtype
= build_pointer_type (parmtype
);
2362 /* We don't use build_this here because we don't want to
2363 capture the object argument until we've chosen a
2364 non-static member function. */
2365 arg
= build_address (arg
);
2366 argtype
= lvalue_type (arg
);
2370 int lflags
= conv_flags (i
, len
-skip
, fn
, arg
, flags
);
2372 t
= implicit_conversion (parmtype
, argtype
, arg
,
2373 /*c_cast_p=*/false, lflags
, complain
);
2378 t
= build_identity_conv (argtype
, arg
);
2379 t
->ellipsis_p
= true;
2390 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
,
2391 EXPR_LOCATION (arg
));
2398 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
,
2399 EXPR_LOCATION (arg
));
2405 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2406 access_path
, conversion_path
, viable
, reason
, flags
);
2409 /* Create an overload candidate for the conversion function FN which will
2410 be invoked for expression OBJ, producing a pointer-to-function which
2411 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2412 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2413 passed on to implicit_conversion.
2415 Actually, we don't really care about FN; we care about the type it
2416 converts to. There may be multiple conversion functions that will
2417 convert to that type, and we rely on build_user_type_conversion_1 to
2418 choose the best one; so when we create our candidate, we record the type
2419 instead of the function. */
2421 static struct z_candidate
*
2422 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2423 const vec
<tree
, va_gc
> *arglist
,
2424 tree access_path
, tree conversion_path
,
2425 tsubst_flags_t complain
)
2427 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2428 int i
, len
, viable
, flags
;
2429 tree parmlist
, parmnode
;
2431 struct rejection_reason
*reason
;
2433 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2434 parmlist
= TREE_TYPE (parmlist
);
2435 parmlist
= TYPE_ARG_TYPES (parmlist
);
2437 len
= vec_safe_length (arglist
) + 1;
2438 convs
= alloc_conversions (len
);
2439 parmnode
= parmlist
;
2441 flags
= LOOKUP_IMPLICIT
;
2444 /* Don't bother looking up the same type twice. */
2445 if (*candidates
&& (*candidates
)->fn
== totype
)
2448 for (i
= 0; i
< len
; ++i
)
2450 tree arg
, argtype
, convert_type
= NULL_TREE
;
2456 arg
= (*arglist
)[i
- 1];
2457 argtype
= lvalue_type (arg
);
2461 t
= build_identity_conv (argtype
, NULL_TREE
);
2462 t
= build_conv (ck_user
, totype
, t
);
2463 /* Leave the 'cand' field null; we'll figure out the conversion in
2464 convert_like_real if this candidate is chosen. */
2465 convert_type
= totype
;
2467 else if (parmnode
== void_list_node
)
2471 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2472 /*c_cast_p=*/false, flags
, complain
);
2473 convert_type
= TREE_VALUE (parmnode
);
2477 t
= build_identity_conv (argtype
, arg
);
2478 t
->ellipsis_p
= true;
2479 convert_type
= argtype
;
2489 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
,
2490 EXPR_LOCATION (arg
));
2497 parmnode
= TREE_CHAIN (parmnode
);
2501 || ! sufficient_parms_p (parmnode
))
2503 int remaining
= remaining_arguments (parmnode
);
2505 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2508 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2509 access_path
, conversion_path
, viable
, reason
, flags
);
2513 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2514 tree type1
, tree type2
, const vec
<tree
,va_gc
> &args
,
2515 tree
*argtypes
, int flags
, tsubst_flags_t complain
)
2522 struct rejection_reason
*reason
= NULL
;
2527 num_convs
= args
.length ();
2528 convs
= alloc_conversions (num_convs
);
2530 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2531 conversion ops are allowed. We handle that here by just checking for
2532 boolean_type_node because other operators don't ask for it. COND_EXPR
2533 also does contextual conversion to bool for the first operand, but we
2534 handle that in build_conditional_expr, and type1 here is operand 2. */
2535 if (type1
!= boolean_type_node
)
2536 flags
|= LOOKUP_ONLYCONVERTING
;
2538 for (unsigned i
= 0; i
< 2 && i
< num_convs
; ++i
)
2540 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2541 /*c_cast_p=*/false, flags
, complain
);
2545 /* We need something for printing the candidate. */
2546 t
= build_identity_conv (types
[i
], NULL_TREE
);
2547 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2548 types
[i
], EXPR_LOCATION (args
[i
]));
2553 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2555 EXPR_LOCATION (args
[i
]));
2560 /* For COND_EXPR we rearranged the arguments; undo that now. */
2563 convs
[2] = convs
[1];
2564 convs
[1] = convs
[0];
2565 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2566 /*c_cast_p=*/false, flags
,
2573 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2575 EXPR_LOCATION (args
[2]));
2579 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2581 /*access_path=*/NULL_TREE
,
2582 /*conversion_path=*/NULL_TREE
,
2583 viable
, reason
, flags
);
2587 is_complete (tree t
)
2589 return COMPLETE_TYPE_P (complete_type (t
));
2592 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2595 promoted_arithmetic_type_p (tree type
)
2599 In this section, the term promoted integral type is used to refer
2600 to those integral types which are preserved by integral promotion
2601 (including e.g. int and long but excluding e.g. char).
2602 Similarly, the term promoted arithmetic type refers to promoted
2603 integral types plus floating types. */
2604 return ((CP_INTEGRAL_TYPE_P (type
)
2605 && same_type_p (type_promotes_to (type
), type
))
2606 || TREE_CODE (type
) == REAL_TYPE
);
2609 /* Create any builtin operator overload candidates for the operator in
2610 question given the converted operand types TYPE1 and TYPE2. The other
2611 args are passed through from add_builtin_candidates to
2612 build_builtin_candidate.
2614 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2615 If CODE is requires candidates operands of the same type of the kind
2616 of which TYPE1 and TYPE2 are, we add both candidates
2617 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2620 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2621 enum tree_code code2
, tree fnname
, tree type1
,
2622 tree type2
, vec
<tree
,va_gc
> &args
, tree
*argtypes
,
2623 int flags
, tsubst_flags_t complain
)
2627 case POSTINCREMENT_EXPR
:
2628 case POSTDECREMENT_EXPR
:
2629 args
[1] = integer_zero_node
;
2630 type2
= integer_type_node
;
2639 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2640 and VQ is either volatile or empty, there exist candidate operator
2641 functions of the form
2642 VQ T& operator++(VQ T&);
2643 T operator++(VQ T&, int);
2644 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2645 type other than bool, and VQ is either volatile or empty, there exist
2646 candidate operator functions of the form
2647 VQ T& operator--(VQ T&);
2648 T operator--(VQ T&, int);
2649 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2650 complete object type, and VQ is either volatile or empty, there exist
2651 candidate operator functions of the form
2652 T*VQ& operator++(T*VQ&);
2653 T*VQ& operator--(T*VQ&);
2654 T* operator++(T*VQ&, int);
2655 T* operator--(T*VQ&, int); */
2657 case POSTDECREMENT_EXPR
:
2658 case PREDECREMENT_EXPR
:
2659 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2662 case POSTINCREMENT_EXPR
:
2663 case PREINCREMENT_EXPR
:
2664 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2666 type1
= build_reference_type (type1
);
2671 /* 7 For every cv-qualified or cv-unqualified object type T, there
2672 exist candidate operator functions of the form
2676 8 For every function type T, there exist candidate operator functions of
2678 T& operator*(T*); */
2681 if (TYPE_PTR_P (type1
)
2682 && (TYPE_PTROB_P (type1
)
2683 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2687 /* 9 For every type T, there exist candidate operator functions of the form
2690 10For every promoted arithmetic type T, there exist candidate operator
2691 functions of the form
2695 case UNARY_PLUS_EXPR
: /* unary + */
2696 if (TYPE_PTR_P (type1
))
2700 if (ARITHMETIC_TYPE_P (type1
))
2704 /* 11For every promoted integral type T, there exist candidate operator
2705 functions of the form
2709 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2713 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2714 is the same type as C2 or is a derived class of C2, T is a complete
2715 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2716 there exist candidate operator functions of the form
2717 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2718 where CV12 is the union of CV1 and CV2. */
2721 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2723 tree c1
= TREE_TYPE (type1
);
2724 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2726 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2727 && (TYPE_PTRMEMFUNC_P (type2
)
2728 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2733 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2734 didate operator functions of the form
2739 bool operator<(L, R);
2740 bool operator>(L, R);
2741 bool operator<=(L, R);
2742 bool operator>=(L, R);
2743 bool operator==(L, R);
2744 bool operator!=(L, R);
2745 where LR is the result of the usual arithmetic conversions between
2748 For every integral type T there exists a candidate operator function of
2751 std::strong_ordering operator<=>(T, T);
2753 For every pair of floating-point types L and R, there exists a candidate
2754 operator function of the form
2756 std::partial_ordering operator<=>(L, R);
2758 14For every pair of types T and I, where T is a cv-qualified or cv-
2759 unqualified complete object type and I is a promoted integral type,
2760 there exist candidate operator functions of the form
2761 T* operator+(T*, I);
2762 T& operator[](T*, I);
2763 T* operator-(T*, I);
2764 T* operator+(I, T*);
2765 T& operator[](I, T*);
2767 15For every T, where T is a pointer to complete object type, there exist
2768 candidate operator functions of the form112)
2769 ptrdiff_t operator-(T, T);
2771 16For every pointer or enumeration type T, there exist candidate operator
2772 functions of the form
2773 bool operator<(T, T);
2774 bool operator>(T, T);
2775 bool operator<=(T, T);
2776 bool operator>=(T, T);
2777 bool operator==(T, T);
2778 bool operator!=(T, T);
2779 R operator<=>(T, T);
2781 where R is the result type specified in [expr.spaceship].
2783 17For every pointer to member type T, there exist candidate operator
2784 functions of the form
2785 bool operator==(T, T);
2786 bool operator!=(T, T);
2787 std::strong_equality operator<=>(T, T); */
2790 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2792 if (TYPE_PTROB_P (type1
)
2793 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2795 type2
= ptrdiff_type_node
;
2800 case TRUNC_DIV_EXPR
:
2801 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2805 /* This isn't exactly what's specified above for operator<=>, but it's
2806 close enough. In particular, we don't care about the return type
2807 specified above; it doesn't participate in overload resolution and it
2808 doesn't affect the semantics of the built-in operator. */
2809 case SPACESHIP_EXPR
:
2812 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2813 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2815 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2820 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2832 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2834 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2836 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2837 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2839 if (TYPE_PTR_P (type1
)
2840 && null_ptr_cst_p (args
[1]))
2845 if (null_ptr_cst_p (args
[0])
2846 && TYPE_PTR_P (type2
))
2854 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2858 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2860 type1
= ptrdiff_type_node
;
2863 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2865 type2
= ptrdiff_type_node
;
2870 /* 18For every pair of promoted integral types L and R, there exist candi-
2871 date operator functions of the form
2878 where LR is the result of the usual arithmetic conversions between
2881 case TRUNC_MOD_EXPR
:
2887 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2891 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2892 type, VQ is either volatile or empty, and R is a promoted arithmetic
2893 type, there exist candidate operator functions of the form
2894 VQ L& operator=(VQ L&, R);
2895 VQ L& operator*=(VQ L&, R);
2896 VQ L& operator/=(VQ L&, R);
2897 VQ L& operator+=(VQ L&, R);
2898 VQ L& operator-=(VQ L&, R);
2900 20For every pair T, VQ), where T is any type and VQ is either volatile
2901 or empty, there exist candidate operator functions of the form
2902 T*VQ& operator=(T*VQ&, T*);
2904 21For every pair T, VQ), where T is a pointer to member type and VQ is
2905 either volatile or empty, there exist candidate operator functions of
2907 VQ T& operator=(VQ T&, T);
2909 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2910 unqualified complete object type, VQ is either volatile or empty, and
2911 I is a promoted integral type, there exist candidate operator func-
2913 T*VQ& operator+=(T*VQ&, I);
2914 T*VQ& operator-=(T*VQ&, I);
2916 23For every triple L, VQ, R), where L is an integral or enumeration
2917 type, VQ is either volatile or empty, and R is a promoted integral
2918 type, there exist candidate operator functions of the form
2920 VQ L& operator%=(VQ L&, R);
2921 VQ L& operator<<=(VQ L&, R);
2922 VQ L& operator>>=(VQ L&, R);
2923 VQ L& operator&=(VQ L&, R);
2924 VQ L& operator^=(VQ L&, R);
2925 VQ L& operator|=(VQ L&, R); */
2932 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2934 type2
= ptrdiff_type_node
;
2939 case TRUNC_DIV_EXPR
:
2940 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2944 case TRUNC_MOD_EXPR
:
2950 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2955 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2957 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2958 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2959 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2960 || ((TYPE_PTRMEMFUNC_P (type1
)
2961 || TYPE_PTR_P (type1
))
2962 && null_ptr_cst_p (args
[1])))
2972 type1
= build_reference_type (type1
);
2978 For every pair of promoted arithmetic types L and R, there
2979 exist candidate operator functions of the form
2981 LR operator?(bool, L, R);
2983 where LR is the result of the usual arithmetic conversions
2984 between types L and R.
2986 For every type T, where T is a pointer or pointer-to-member
2987 type, there exist candidate operator functions of the form T
2988 operator?(bool, T, T); */
2990 if (promoted_arithmetic_type_p (type1
)
2991 && promoted_arithmetic_type_p (type2
))
2995 /* Otherwise, the types should be pointers. */
2996 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2999 /* We don't check that the two types are the same; the logic
3000 below will actually create two candidates; one in which both
3001 parameter types are TYPE1, and one in which both parameter
3007 if (ARITHMETIC_TYPE_P (type1
))
3015 /* Make sure we don't create builtin candidates with dependent types. */
3016 bool u1
= uses_template_parms (type1
);
3017 bool u2
= type2
? uses_template_parms (type2
) : false;
3020 /* Try to recover if one of the types is non-dependent. But if
3021 there's only one type, there's nothing we can do. */
3024 /* And we lose if both are dependent. */
3027 /* Or if they have different forms. */
3028 if (TREE_CODE (type1
) != TREE_CODE (type2
))
3037 /* If we're dealing with two pointer types or two enumeral types,
3038 we need candidates for both of them. */
3039 if (type2
&& !same_type_p (type1
, type2
)
3040 && TREE_CODE (type1
) == TREE_CODE (type2
)
3041 && (TYPE_REF_P (type1
)
3042 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
3043 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
3044 || TYPE_PTRMEMFUNC_P (type1
)
3045 || MAYBE_CLASS_TYPE_P (type1
)
3046 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
3048 if (TYPE_PTR_OR_PTRMEM_P (type1
))
3050 tree cptype
= composite_pointer_type (input_location
,
3056 if (cptype
!= error_mark_node
)
3058 build_builtin_candidate
3059 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
3065 build_builtin_candidate
3066 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
3067 build_builtin_candidate
3068 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
3072 build_builtin_candidate
3073 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
3077 type_decays_to (tree type
)
3079 if (TREE_CODE (type
) == ARRAY_TYPE
)
3080 return build_pointer_type (TREE_TYPE (type
));
3081 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3082 return build_pointer_type (type
);
3086 /* There are three conditions of builtin candidates:
3088 1) bool-taking candidates. These are the same regardless of the input.
3089 2) pointer-pair taking candidates. These are generated for each type
3090 one of the input types converts to.
3091 3) arithmetic candidates. According to the standard, we should generate
3092 all of these, but I'm trying not to...
3094 Here we generate a superset of the possible candidates for this particular
3095 case. That is a subset of the full set the standard defines, plus some
3096 other cases which the standard disallows. add_builtin_candidate will
3097 filter out the invalid set. */
3100 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
3101 enum tree_code code2
, tree fnname
,
3102 vec
<tree
, va_gc
> *argv
,
3103 int flags
, tsubst_flags_t complain
)
3107 tree type
, argtypes
[3], t
;
3108 /* TYPES[i] is the set of possible builtin-operator parameter types
3109 we will consider for the Ith argument. */
3110 vec
<tree
, va_gc
> *types
[2];
3112 vec
<tree
, va_gc
> &args
= *argv
;
3113 unsigned len
= args
.length ();
3115 for (unsigned i
= 0; i
< len
; ++i
)
3118 argtypes
[i
] = unlowered_expr_type (args
[i
]);
3120 argtypes
[i
] = NULL_TREE
;
3125 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
3126 and VQ is either volatile or empty, there exist candidate operator
3127 functions of the form
3128 VQ T& operator++(VQ T&); */
3130 case POSTINCREMENT_EXPR
:
3131 case PREINCREMENT_EXPR
:
3132 case POSTDECREMENT_EXPR
:
3133 case PREDECREMENT_EXPR
:
3138 /* 24There also exist candidate operator functions of the form
3139 bool operator!(bool);
3140 bool operator&&(bool, bool);
3141 bool operator||(bool, bool); */
3143 case TRUTH_NOT_EXPR
:
3144 build_builtin_candidate
3145 (candidates
, fnname
, boolean_type_node
,
3146 NULL_TREE
, args
, argtypes
, flags
, complain
);
3149 case TRUTH_ORIF_EXPR
:
3150 case TRUTH_ANDIF_EXPR
:
3151 build_builtin_candidate
3152 (candidates
, fnname
, boolean_type_node
,
3153 boolean_type_node
, args
, argtypes
, flags
, complain
);
3168 case SPACESHIP_EXPR
:
3176 types
[0] = make_tree_vector ();
3177 types
[1] = make_tree_vector ();
3181 for (unsigned i
= 0; i
< len
; ++i
)
3183 if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
3187 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
3190 convs
= lookup_conversions (argtypes
[i
]);
3192 if (code
== COND_EXPR
)
3194 if (lvalue_p (args
[i
]))
3195 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3197 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
3203 for (; convs
; convs
= TREE_CHAIN (convs
))
3205 type
= TREE_TYPE (convs
);
3208 && (!TYPE_REF_P (type
)
3209 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
3212 if (code
== COND_EXPR
&& TYPE_REF_P (type
))
3213 vec_safe_push (types
[i
], type
);
3215 type
= non_reference (type
);
3216 if (i
!= 0 || ! ref1
)
3218 type
= cv_unqualified (type_decays_to (type
));
3219 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
3220 vec_safe_push (types
[i
], type
);
3221 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3222 type
= type_promotes_to (type
);
3225 if (! vec_member (type
, types
[i
]))
3226 vec_safe_push (types
[i
], type
);
3231 if (code
== COND_EXPR
&& lvalue_p (args
[i
]))
3232 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3233 type
= non_reference (argtypes
[i
]);
3234 if (i
!= 0 || ! ref1
)
3236 type
= cv_unqualified (type_decays_to (type
));
3237 if (enum_p
&& UNSCOPED_ENUM_P (type
))
3238 vec_safe_push (types
[i
], type
);
3239 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3240 type
= type_promotes_to (type
);
3242 vec_safe_push (types
[i
], type
);
3246 /* Run through the possible parameter types of both arguments,
3247 creating candidates with those parameter types. */
3248 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
3253 if (!types
[1]->is_empty ())
3254 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
3255 add_builtin_candidate
3256 (candidates
, code
, code2
, fnname
, t
,
3257 u
, args
, argtypes
, flags
, complain
);
3259 add_builtin_candidate
3260 (candidates
, code
, code2
, fnname
, t
,
3261 NULL_TREE
, args
, argtypes
, flags
, complain
);
3264 release_tree_vector (types
[0]);
3265 release_tree_vector (types
[1]);
3269 /* If TMPL can be successfully instantiated as indicated by
3270 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3272 TMPL is the template. EXPLICIT_TARGS are any explicit template
3273 arguments. ARGLIST is the arguments provided at the call-site.
3274 This does not change ARGLIST. The RETURN_TYPE is the desired type
3275 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3276 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3277 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3279 static struct z_candidate
*
3280 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3281 tree ctype
, tree explicit_targs
, tree first_arg
,
3282 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3283 tree access_path
, tree conversion_path
,
3284 int flags
, tree obj
, unification_kind_t strict
,
3285 tsubst_flags_t complain
)
3287 int ntparms
= DECL_NTPARMS (tmpl
);
3288 tree targs
= make_tree_vec (ntparms
);
3289 unsigned int len
= vec_safe_length (arglist
);
3290 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3291 unsigned int skip_without_in_chrg
= 0;
3292 tree first_arg_without_in_chrg
= first_arg
;
3293 tree
*args_without_in_chrg
;
3294 unsigned int nargs_without_in_chrg
;
3295 unsigned int ia
, ix
;
3297 struct z_candidate
*cand
;
3299 struct rejection_reason
*reason
= NULL
;
3301 conversion
**convs
= NULL
;
3303 /* We don't do deduction on the in-charge parameter, the VTT
3304 parameter or 'this'. */
3305 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3307 if (first_arg_without_in_chrg
!= NULL_TREE
)
3308 first_arg_without_in_chrg
= NULL_TREE
;
3309 else if (return_type
&& strict
== DEDUCE_CALL
)
3310 /* We're deducing for a call to the result of a template conversion
3311 function, so the args don't contain 'this'; leave them alone. */;
3313 ++skip_without_in_chrg
;
3316 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3317 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3318 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3320 if (first_arg_without_in_chrg
!= NULL_TREE
)
3321 first_arg_without_in_chrg
= NULL_TREE
;
3323 ++skip_without_in_chrg
;
3326 if (len
< skip_without_in_chrg
)
3329 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3330 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3331 TREE_TYPE ((*arglist
)[0])))
3333 /* 12.8/6 says, "A declaration of a constructor for a class X is
3334 ill-formed if its first parameter is of type (optionally cv-qualified)
3335 X and either there are no other parameters or else all other
3336 parameters have default arguments. A member function template is never
3337 instantiated to produce such a constructor signature."
3339 So if we're trying to copy an object of the containing class, don't
3340 consider a template constructor that has a first parameter type that
3341 is just a template parameter, as we would deduce a signature that we
3342 would then reject in the code below. */
3343 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3345 firstparm
= TREE_VALUE (firstparm
);
3346 if (PACK_EXPANSION_P (firstparm
))
3347 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3348 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3350 gcc_assert (!explicit_targs
);
3351 reason
= invalid_copy_with_fn_template_rejection ();
3357 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3358 + (len
- skip_without_in_chrg
));
3359 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3361 if (first_arg_without_in_chrg
!= NULL_TREE
)
3363 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3366 for (ix
= skip_without_in_chrg
;
3367 vec_safe_iterate (arglist
, ix
, &arg
);
3370 args_without_in_chrg
[ia
] = arg
;
3373 gcc_assert (ia
== nargs_without_in_chrg
);
3375 errs
= errorcount
+sorrycount
;
3377 convs
= alloc_conversions (nargs
);
3378 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3379 args_without_in_chrg
,
3380 nargs_without_in_chrg
,
3381 return_type
, strict
, flags
, convs
,
3382 false, complain
& tf_decltype
);
3384 if (fn
== error_mark_node
)
3386 /* Don't repeat unification later if it already resulted in errors. */
3387 if (errorcount
+sorrycount
== errs
)
3388 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3389 targs
, args_without_in_chrg
,
3390 nargs_without_in_chrg
,
3391 return_type
, strict
, flags
);
3393 reason
= template_unification_error_rejection ();
3397 /* Now the explicit specifier might have been deduced; check if this
3398 declaration is explicit. If it is and we're ignoring non-converting
3399 constructors, don't add this function to the set of candidates. */
3400 if ((flags
& LOOKUP_ONLYCONVERTING
) && DECL_NONCONVERTING_P (fn
))
3403 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3405 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3406 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3409 /* We're trying to produce a constructor with a prohibited signature,
3410 as discussed above; handle here any cases we didn't catch then,
3412 reason
= invalid_copy_with_fn_template_rejection ();
3417 if (obj
!= NULL_TREE
)
3418 /* Aha, this is a conversion function. */
3419 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3420 access_path
, conversion_path
, complain
);
3422 cand
= add_function_candidate (candidates
, fn
, ctype
,
3423 first_arg
, arglist
, access_path
,
3424 conversion_path
, flags
, convs
, complain
);
3425 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3426 /* This situation can occur if a member template of a template
3427 class is specialized. Then, instantiate_template might return
3428 an instantiation of the specialization, in which case the
3429 DECL_TI_TEMPLATE field will point at the original
3430 specialization. For example:
3432 template <class T> struct S { template <class U> void f(U);
3433 template <> void f(int) {}; };
3437 Here, TMPL will be template <class U> S<double>::f(U).
3438 And, instantiate template will give us the specialization
3439 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3440 for this will point at template <class T> template <> S<T>::f(int),
3441 so that we can find the definition. For the purposes of
3442 overload resolution, however, we want the original TMPL. */
3443 cand
->template_decl
= build_template_info (tmpl
, targs
);
3445 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3446 cand
->explicit_targs
= explicit_targs
;
3450 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3451 access_path
, conversion_path
, 0, reason
, flags
);
3455 static struct z_candidate
*
3456 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3457 tree explicit_targs
, tree first_arg
,
3458 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3459 tree access_path
, tree conversion_path
, int flags
,
3460 unification_kind_t strict
, tsubst_flags_t complain
)
3463 add_template_candidate_real (candidates
, tmpl
, ctype
,
3464 explicit_targs
, first_arg
, arglist
,
3465 return_type
, access_path
, conversion_path
,
3466 flags
, NULL_TREE
, strict
, complain
);
3469 /* Create an overload candidate for the conversion function template TMPL,
3470 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3471 pointer-to-function which will in turn be called with the argument list
3472 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3473 passed on to implicit_conversion. */
3475 static struct z_candidate
*
3476 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3478 const vec
<tree
, va_gc
> *arglist
,
3479 tree return_type
, tree access_path
,
3480 tree conversion_path
, tsubst_flags_t complain
)
3482 /* Making this work broke PR 71117 and 85118, so until the committee resolves
3483 core issue 2189, let's disable this candidate if there are any call
3489 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3490 NULL_TREE
, arglist
, return_type
, access_path
,
3491 conversion_path
, 0, obj
, DEDUCE_CALL
,
3495 /* The CANDS are the set of candidates that were considered for
3496 overload resolution. Return the set of viable candidates, or CANDS
3497 if none are viable. If any of the candidates were viable, set
3498 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3499 considered viable only if it is strictly viable. */
3501 static struct z_candidate
*
3502 splice_viable (struct z_candidate
*cands
,
3506 struct z_candidate
*viable
;
3507 struct z_candidate
**last_viable
;
3508 struct z_candidate
**cand
;
3509 bool found_strictly_viable
= false;
3511 /* Be strict inside templates, since build_over_call won't actually
3512 do the conversions to get pedwarns. */
3513 if (processing_template_decl
)
3517 last_viable
= &viable
;
3518 *any_viable_p
= false;
3523 struct z_candidate
*c
= *cand
;
3525 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3527 /* Be strict in the presence of a viable candidate. Also if
3528 there are template candidates, so that we get deduction errors
3529 for them instead of silently preferring a bad conversion. */
3531 if (viable
&& !found_strictly_viable
)
3533 /* Put any spliced near matches back onto the main list so
3534 that we see them if there is no strict match. */
3535 *any_viable_p
= false;
3536 *last_viable
= cands
;
3539 last_viable
= &viable
;
3543 if (strict_p
? c
->viable
== 1 : c
->viable
)
3548 last_viable
= &c
->next
;
3549 *any_viable_p
= true;
3551 found_strictly_viable
= true;
3557 return viable
? viable
: cands
;
3561 any_strictly_viable (struct z_candidate
*cands
)
3563 for (; cands
; cands
= cands
->next
)
3564 if (cands
->viable
== 1)
3569 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3570 words, it is about to become the "this" pointer for a member
3571 function call. Take the address of the object. */
3574 build_this (tree obj
)
3576 /* In a template, we are only concerned about the type of the
3577 expression, so we can take a shortcut. */
3578 if (processing_template_decl
)
3579 return build_address (obj
);
3581 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3584 /* Returns true iff functions are equivalent. Equivalent functions are
3585 not '==' only if one is a function-local extern function or if
3586 both are extern "C". */
3589 equal_functions (tree fn1
, tree fn2
)
3591 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3593 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3595 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3596 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3597 return decls_match (fn1
, fn2
);
3601 /* Print information about a candidate FN being rejected due to INFO. */
3604 print_conversion_rejection (location_t loc
, struct conversion_info
*info
,
3607 tree from
= info
->from
;
3609 from
= lvalue_type (from
);
3610 if (info
->n_arg
== -1)
3612 /* Conversion of implicit `this' argument failed. */
3613 if (!TYPE_P (info
->from
))
3614 /* A bad conversion for 'this' must be discarding cv-quals. */
3615 inform (loc
, " passing %qT as %<this%> "
3616 "argument discards qualifiers",
3619 inform (loc
, " no known conversion for implicit "
3620 "%<this%> parameter from %qH to %qI",
3621 from
, info
->to_type
);
3623 else if (!TYPE_P (info
->from
))
3625 if (info
->n_arg
>= 0)
3626 inform (loc
, " conversion of argument %d would be ill-formed:",
3628 perform_implicit_conversion (info
->to_type
, info
->from
,
3629 tf_warning_or_error
);
3631 else if (info
->n_arg
== -2)
3632 /* Conversion of conversion function return value failed. */
3633 inform (loc
, " no known conversion from %qH to %qI",
3634 from
, info
->to_type
);
3637 if (TREE_CODE (fn
) == FUNCTION_DECL
)
3638 loc
= get_fndecl_argument_location (fn
, info
->n_arg
);
3639 inform (loc
, " no known conversion for argument %d from %qH to %qI",
3640 info
->n_arg
+ 1, from
, info
->to_type
);
3644 /* Print information about a candidate with WANT parameters and we found
3648 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3650 inform_n (loc
, want
,
3651 " candidate expects %d argument, %d provided",
3652 " candidate expects %d arguments, %d provided",
3656 /* Print information about one overload candidate CANDIDATE. MSGSTR
3657 is the text to print before the candidate itself.
3659 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3660 to have been run through gettext by the caller. This wart makes
3661 life simpler in print_z_candidates and for the translators. */
3664 print_z_candidate (location_t loc
, const char *msgstr
,
3665 struct z_candidate
*candidate
)
3667 const char *msg
= (msgstr
== NULL
3669 : ACONCAT ((_(msgstr
), " ", NULL
)));
3670 tree fn
= candidate
->fn
;
3671 if (flag_new_inheriting_ctors
)
3672 fn
= strip_inheriting_ctors (fn
);
3673 location_t cloc
= location_of (fn
);
3675 if (identifier_p (fn
))
3678 if (candidate
->num_convs
== 3)
3679 inform (cloc
, "%s%<%D(%T, %T, %T)%> (built-in)", msg
, fn
,
3680 candidate
->convs
[0]->type
,
3681 candidate
->convs
[1]->type
,
3682 candidate
->convs
[2]->type
);
3683 else if (candidate
->num_convs
== 2)
3684 inform (cloc
, "%s%<%D(%T, %T)%> (built-in)", msg
, fn
,
3685 candidate
->convs
[0]->type
,
3686 candidate
->convs
[1]->type
);
3688 inform (cloc
, "%s%<%D(%T)%> (built-in)", msg
, fn
,
3689 candidate
->convs
[0]->type
);
3691 else if (TYPE_P (fn
))
3692 inform (cloc
, "%s%qT (conversion)", msg
, fn
);
3693 else if (candidate
->viable
== -1)
3694 inform (cloc
, "%s%#qD (near match)", msg
, fn
);
3695 else if (DECL_DELETED_FN (fn
))
3696 inform (cloc
, "%s%#qD (deleted)", msg
, fn
);
3698 inform (cloc
, "%s%#qD", msg
, fn
);
3699 if (fn
!= candidate
->fn
)
3701 cloc
= location_of (candidate
->fn
);
3702 inform (cloc
, " inherited here");
3704 /* Give the user some information about why this candidate failed. */
3705 if (candidate
->reason
!= NULL
)
3707 struct rejection_reason
*r
= candidate
->reason
;
3712 print_arity_information (cloc
, r
->u
.arity
.actual
,
3713 r
->u
.arity
.expected
);
3715 case rr_arg_conversion
:
3716 print_conversion_rejection (cloc
, &r
->u
.conversion
, fn
);
3718 case rr_bad_arg_conversion
:
3719 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
, fn
);
3721 case rr_explicit_conversion
:
3722 inform (cloc
, " return type %qT of explicit conversion function "
3723 "cannot be converted to %qT with a qualification "
3724 "conversion", r
->u
.conversion
.from
,
3725 r
->u
.conversion
.to_type
);
3727 case rr_template_conversion
:
3728 inform (cloc
, " conversion from return type %qT of template "
3729 "conversion function specialization to %qT is not an "
3730 "exact match", r
->u
.conversion
.from
,
3731 r
->u
.conversion
.to_type
);
3733 case rr_template_unification
:
3734 /* We use template_unification_error_rejection if unification caused
3735 actual non-SFINAE errors, in which case we don't need to repeat
3737 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3739 inform (cloc
, " substitution of deduced template arguments "
3740 "resulted in errors seen above");
3743 /* Re-run template unification with diagnostics. */
3744 inform (cloc
, " template argument deduction/substitution failed:");
3745 fn_type_unification (r
->u
.template_unification
.tmpl
,
3746 r
->u
.template_unification
.explicit_targs
,
3748 (r
->u
.template_unification
.num_targs
)),
3749 r
->u
.template_unification
.args
,
3750 r
->u
.template_unification
.nargs
,
3751 r
->u
.template_unification
.return_type
,
3752 r
->u
.template_unification
.strict
,
3753 r
->u
.template_unification
.flags
,
3756 case rr_invalid_copy
:
3758 " a constructor taking a single argument of its own "
3759 "class type is invalid");
3761 case rr_constraint_failure
:
3762 diagnose_constraints (cloc
, fn
, NULL_TREE
);
3764 case rr_inherited_ctor
:
3765 inform (cloc
, " an inherited constructor is not a candidate for "
3766 "initialization from an expression of the same or derived "
3771 /* This candidate didn't have any issues or we failed to
3772 handle a particular code. Either way... */
3779 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3781 struct z_candidate
*cand1
;
3782 struct z_candidate
**cand2
;
3787 /* Remove non-viable deleted candidates. */
3789 for (cand2
= &cand1
; *cand2
; )
3791 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3792 && !(*cand2
)->viable
3793 && DECL_DELETED_FN ((*cand2
)->fn
))
3794 *cand2
= (*cand2
)->next
;
3796 cand2
= &(*cand2
)->next
;
3798 /* ...if there are any non-deleted ones. */
3802 /* There may be duplicates in the set of candidates. We put off
3803 checking this condition as long as possible, since we have no way
3804 to eliminate duplicates from a set of functions in less than n^2
3805 time. Now we are about to emit an error message, so it is more
3806 permissible to go slowly. */
3807 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3809 tree fn
= cand1
->fn
;
3810 /* Skip builtin candidates and conversion functions. */
3813 cand2
= &cand1
->next
;
3816 if (DECL_P ((*cand2
)->fn
)
3817 && equal_functions (fn
, (*cand2
)->fn
))
3818 *cand2
= (*cand2
)->next
;
3820 cand2
= &(*cand2
)->next
;
3824 for (; candidates
; candidates
= candidates
->next
)
3825 print_z_candidate (loc
, N_("candidate:"), candidates
);
3828 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3829 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3830 the result of the conversion function to convert it to the final
3831 desired type. Merge the two sequences into a single sequence,
3832 and return the merged sequence. */
3835 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3838 bool bad
= user_seq
->bad_p
;
3840 gcc_assert (user_seq
->kind
== ck_user
);
3842 /* Find the end of the second conversion sequence. */
3843 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3845 /* The entire sequence is a user-conversion sequence. */
3846 (*t
)->user_conv_p
= true;
3851 if ((*t
)->rvaluedness_matches_p
)
3852 /* We're binding a reference directly to the result of the conversion.
3853 build_user_type_conversion_1 stripped the REFERENCE_TYPE from the return
3854 type, but we want it back. */
3855 user_seq
->type
= TREE_TYPE (TREE_TYPE (user_seq
->cand
->fn
));
3857 /* Replace the identity conversion with the user conversion
3864 /* Handle overload resolution for initializing an object of class type from
3865 an initializer list. First we look for a suitable constructor that
3866 takes a std::initializer_list; if we don't find one, we then look for a
3867 non-list constructor.
3869 Parameters are as for add_candidates, except that the arguments are in
3870 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3871 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3874 add_list_candidates (tree fns
, tree first_arg
,
3875 const vec
<tree
, va_gc
> *args
, tree totype
,
3876 tree explicit_targs
, bool template_only
,
3877 tree conversion_path
, tree access_path
,
3879 struct z_candidate
**candidates
,
3880 tsubst_flags_t complain
)
3882 gcc_assert (*candidates
== NULL
);
3884 /* We're looking for a ctor for list-initialization. */
3885 flags
|= LOOKUP_LIST_INIT_CTOR
;
3886 /* And we don't allow narrowing conversions. We also use this flag to
3887 avoid the copy constructor call for copy-list-initialization. */
3888 flags
|= LOOKUP_NO_NARROWING
;
3890 unsigned nart
= num_artificial_parms_for (OVL_FIRST (fns
)) - 1;
3891 tree init_list
= (*args
)[nart
];
3893 /* Always use the default constructor if the list is empty (DR 990). */
3894 if (CONSTRUCTOR_NELTS (init_list
) == 0
3895 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3897 /* If the class has a list ctor, try passing the list as a single
3898 argument first, but only consider list ctors. */
3899 else if (TYPE_HAS_LIST_CTOR (totype
))
3901 flags
|= LOOKUP_LIST_ONLY
;
3902 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3903 explicit_targs
, template_only
, conversion_path
,
3904 access_path
, flags
, candidates
, complain
);
3905 if (any_strictly_viable (*candidates
))
3909 /* Expand the CONSTRUCTOR into a new argument vec. */
3910 vec
<tree
, va_gc
> *new_args
;
3911 vec_alloc (new_args
, nart
+ CONSTRUCTOR_NELTS (init_list
));
3912 for (unsigned i
= 0; i
< nart
; ++i
)
3913 new_args
->quick_push ((*args
)[i
]);
3914 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (init_list
); ++i
)
3915 new_args
->quick_push (CONSTRUCTOR_ELT (init_list
, i
)->value
);
3917 /* We aren't looking for list-ctors anymore. */
3918 flags
&= ~LOOKUP_LIST_ONLY
;
3919 /* We allow more user-defined conversions within an init-list. */
3920 flags
&= ~LOOKUP_NO_CONVERSION
;
3922 add_candidates (fns
, first_arg
, new_args
, NULL_TREE
,
3923 explicit_targs
, template_only
, conversion_path
,
3924 access_path
, flags
, candidates
, complain
);
3927 /* Returns the best overload candidate to perform the requested
3928 conversion. This function is used for three the overloading situations
3929 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3930 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3931 per [dcl.init.ref], so we ignore temporary bindings. */
3933 static struct z_candidate
*
3934 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3935 tsubst_flags_t complain
)
3937 struct z_candidate
*candidates
, *cand
;
3939 tree ctors
= NULL_TREE
;
3940 tree conv_fns
= NULL_TREE
;
3941 conversion
*conv
= NULL
;
3942 tree first_arg
= NULL_TREE
;
3943 vec
<tree
, va_gc
> *args
= NULL
;
3950 fromtype
= TREE_TYPE (expr
);
3952 /* We represent conversion within a hierarchy using RVALUE_CONV and
3953 BASE_CONV, as specified by [over.best.ics]; these become plain
3954 constructor calls, as specified in [dcl.init]. */
3955 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3956 || !DERIVED_FROM_P (totype
, fromtype
));
3958 if (CLASS_TYPE_P (totype
))
3959 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3960 creating a garbage BASELINK; constructors can't be inherited. */
3961 ctors
= get_class_binding (totype
, complete_ctor_identifier
);
3963 if (MAYBE_CLASS_TYPE_P (fromtype
))
3965 tree to_nonref
= non_reference (totype
);
3966 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3967 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3968 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3970 /* [class.conv.fct] A conversion function is never used to
3971 convert a (possibly cv-qualified) object to the (possibly
3972 cv-qualified) same object type (or a reference to it), to a
3973 (possibly cv-qualified) base class of that type (or a
3974 reference to it)... */
3977 conv_fns
= lookup_conversions (fromtype
);
3981 flags
|= LOOKUP_NO_CONVERSION
;
3982 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3983 flags
|= LOOKUP_NO_NARROWING
;
3985 /* It's OK to bind a temporary for converting constructor arguments, but
3986 not in converting the return value of a conversion operator. */
3987 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3988 | (flags
& LOOKUP_NO_NARROWING
));
3989 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3993 int ctorflags
= flags
;
3995 first_arg
= build_dummy_object (totype
);
3997 /* We should never try to call the abstract or base constructor
3999 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors
))
4000 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors
)));
4002 args
= make_tree_vector_single (expr
);
4003 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
4005 /* List-initialization. */
4006 add_list_candidates (ctors
, first_arg
, args
, totype
, NULL_TREE
,
4007 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
4008 ctorflags
, &candidates
, complain
);
4012 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
4013 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
4014 ctorflags
, &candidates
, complain
);
4017 for (cand
= candidates
; cand
; cand
= cand
->next
)
4019 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
4021 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
4022 set, then this is copy-initialization. In that case, "The
4023 result of the call is then used to direct-initialize the
4024 object that is the destination of the copy-initialization."
4027 We represent this in the conversion sequence with an
4028 rvalue conversion, which means a constructor call. */
4029 if (!TYPE_REF_P (totype
)
4030 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
4032 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
4038 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
4039 first_arg
= CONSTRUCTOR_ELT (expr
, 0)->value
;
4044 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
4046 tree conversion_path
= TREE_PURPOSE (conv_fns
);
4047 struct z_candidate
*old_candidates
;
4049 /* If we are called to convert to a reference type, we are trying to
4050 find a direct binding, so don't even consider temporaries. If
4051 we don't find a direct binding, the caller will try again to
4052 look for a temporary binding. */
4053 if (TYPE_REF_P (totype
))
4054 convflags
|= LOOKUP_NO_TEMP_BIND
;
4056 old_candidates
= candidates
;
4057 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
4059 conversion_path
, TYPE_BINFO (fromtype
),
4060 flags
, &candidates
, complain
);
4062 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
4064 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
4066 = implicit_conversion (totype
,
4069 /*c_cast_p=*/false, convflags
,
4072 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
4073 copy-initialization. In that case, "The result of the
4074 call is then used to direct-initialize the object that is
4075 the destination of the copy-initialization." [dcl.init]
4077 We represent this in the conversion sequence with an
4078 rvalue conversion, which means a constructor call. But
4079 don't add a second rvalue conversion if there's already
4080 one there. Which there really shouldn't be, but it's
4081 harmless since we'd add it here anyway. */
4082 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
4083 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
4084 ics
= build_conv (ck_rvalue
, totype
, ics
);
4086 cand
->second_conv
= ics
;
4091 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
4093 EXPR_LOCATION (expr
));
4095 else if (TYPE_REF_P (totype
) && !ics
->rvaluedness_matches_p
4096 && TREE_CODE (TREE_TYPE (totype
)) != FUNCTION_TYPE
)
4098 /* If we are called to convert to a reference type, we are trying
4099 to find a direct binding per [over.match.ref], so rvaluedness
4100 must match for non-functions. */
4103 else if (DECL_NONCONVERTING_P (cand
->fn
)
4104 && ics
->rank
> cr_exact
)
4106 /* 13.3.1.5: For direct-initialization, those explicit
4107 conversion functions that are not hidden within S and
4108 yield type T or a type that can be converted to type T
4109 with a qualification conversion (4.4) are also candidate
4111 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
4112 I've raised this issue with the committee. --jason 9/2011 */
4114 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
4116 else if (cand
->viable
== 1 && ics
->bad_p
)
4120 = bad_arg_conversion_rejection (NULL_TREE
, -2,
4122 EXPR_LOCATION (expr
));
4124 else if (primary_template_specialization_p (cand
->fn
)
4125 && ics
->rank
> cr_exact
)
4127 /* 13.3.3.1.2: If the user-defined conversion is specified by
4128 a specialization of a conversion function template, the
4129 second standard conversion sequence shall have exact match
4132 cand
->reason
= template_conversion_rejection (rettype
, totype
);
4137 candidates
= splice_viable (candidates
, false, &any_viable_p
);
4141 release_tree_vector (args
);
4145 cand
= tourney (candidates
, complain
);
4148 if (complain
& tf_error
)
4150 auto_diagnostic_group d
;
4151 error ("conversion from %qH to %qI is ambiguous",
4153 print_z_candidates (location_of (expr
), candidates
);
4156 cand
= candidates
; /* any one will do */
4157 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
4158 cand
->second_conv
->user_conv_p
= true;
4159 if (!any_strictly_viable (candidates
))
4160 cand
->second_conv
->bad_p
= true;
4161 if (flags
& LOOKUP_ONLYCONVERTING
)
4162 cand
->second_conv
->need_temporary_p
= true;
4163 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
4164 ambiguous conversion is no worse than another user-defined
4171 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
4172 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
4173 else if (cand
->second_conv
->kind
== ck_rvalue
)
4174 /* DR 5: [in the first step of copy-initialization]...if the function
4175 is a constructor, the call initializes a temporary of the
4176 cv-unqualified version of the destination type. */
4177 convtype
= cv_unqualified (totype
);
4180 /* Build the user conversion sequence. */
4184 build_identity_conv (TREE_TYPE (expr
), expr
));
4186 if (cand
->viable
== -1)
4189 /* We're performing the maybe-rvalue overload resolution and
4190 a conversion function is in play. Reject converting the return
4191 value of the conversion function to a base class. */
4192 if ((flags
& LOOKUP_PREFER_RVALUE
) && !DECL_CONSTRUCTOR_P (cand
->fn
))
4193 for (conversion
*t
= cand
->second_conv
; t
; t
= next_conversion (t
))
4194 if (t
->kind
== ck_base
)
4197 /* Remember that this was a list-initialization. */
4198 if (flags
& LOOKUP_NO_NARROWING
)
4199 conv
->check_narrowing
= true;
4201 /* Combine it with the second conversion sequence. */
4202 cand
->second_conv
= merge_conversion_sequences (conv
,
4208 /* Wrapper for above. */
4211 build_user_type_conversion (tree totype
, tree expr
, int flags
,
4212 tsubst_flags_t complain
)
4214 struct z_candidate
*cand
;
4217 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4218 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
4222 if (cand
->second_conv
->kind
== ck_ambig
)
4223 ret
= error_mark_node
;
4226 expr
= convert_like (cand
->second_conv
, expr
, complain
);
4227 ret
= convert_from_reference (expr
);
4233 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4237 /* Worker for build_converted_constant_expr. */
4240 build_converted_constant_expr_internal (tree type
, tree expr
,
4241 int flags
, tsubst_flags_t complain
)
4246 location_t loc
= cp_expr_loc_or_input_loc (expr
);
4248 if (error_operand_p (expr
))
4249 return error_mark_node
;
4251 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4252 p
= conversion_obstack_alloc (0);
4254 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
4255 /*c_cast_p=*/false, flags
, complain
);
4257 /* A converted constant expression of type T is an expression, implicitly
4258 converted to type T, where the converted expression is a constant
4259 expression and the implicit conversion sequence contains only
4261 * user-defined conversions,
4262 * lvalue-to-rvalue conversions (7.1),
4263 * array-to-pointer conversions (7.2),
4264 * function-to-pointer conversions (7.3),
4265 * qualification conversions (7.5),
4266 * integral promotions (7.6),
4267 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4268 * null pointer conversions (7.11) from std::nullptr_t,
4269 * null member pointer conversions (7.12) from std::nullptr_t, and
4270 * function pointer conversions (7.13),
4272 and where the reference binding (if any) binds directly. */
4274 for (conversion
*c
= conv
;
4275 conv
&& c
->kind
!= ck_identity
;
4276 c
= next_conversion (c
))
4280 /* A conversion function is OK. If it isn't constexpr, we'll
4281 complain later that the argument isn't constant. */
4283 /* The lvalue-to-rvalue conversion is OK. */
4285 /* Array-to-pointer and function-to-pointer. */
4287 /* Function pointer conversions. */
4289 /* Qualification conversions. */
4294 if (c
->need_temporary_p
)
4296 if (complain
& tf_error
)
4297 error_at (loc
, "initializing %qH with %qI in converted "
4298 "constant expression does not bind directly",
4299 type
, next_conversion (c
)->type
);
4308 t
= next_conversion (c
)->type
;
4309 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
)
4310 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
4311 /* Integral promotion or conversion. */
4313 if (NULLPTR_TYPE_P (t
))
4314 /* Conversion from nullptr to pointer or pointer-to-member. */
4317 if (complain
& tf_error
)
4318 error_at (loc
, "conversion from %qH to %qI in a "
4319 "converted constant expression", t
, type
);
4328 /* Avoid confusing convert_nontype_argument by introducing
4329 a redundant conversion to the same reference type. */
4330 if (conv
&& conv
->kind
== ck_ref_bind
4331 && REFERENCE_REF_P (expr
))
4333 tree ref
= TREE_OPERAND (expr
, 0);
4334 if (same_type_p (type
, TREE_TYPE (ref
)))
4340 /* Don't copy a class in a template. */
4341 if (CLASS_TYPE_P (type
) && conv
->kind
== ck_rvalue
4342 && processing_template_decl
)
4343 conv
= next_conversion (conv
);
4345 conv
->check_narrowing
= true;
4346 conv
->check_narrowing_const_only
= true;
4347 expr
= convert_like (conv
, expr
, complain
);
4351 if (complain
& tf_error
)
4352 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
4353 TREE_TYPE (expr
), type
);
4354 expr
= error_mark_node
;
4357 /* Free all the conversions we allocated. */
4358 obstack_free (&conversion_obstack
, p
);
4363 /* Subroutine of convert_nontype_argument.
4365 EXPR is an expression used in a context that requires a converted
4366 constant-expression, such as a template non-type parameter. Do any
4367 necessary conversions (that are permitted for converted
4368 constant-expressions) to convert it to the desired type.
4370 This function doesn't consider explicit conversion functions. If
4371 you mean to use "a contextually converted constant expression of type
4372 bool", use build_converted_constant_bool_expr.
4374 If conversion is successful, returns the converted expression;
4375 otherwise, returns error_mark_node. */
4378 build_converted_constant_expr (tree type
, tree expr
, tsubst_flags_t complain
)
4380 return build_converted_constant_expr_internal (type
, expr
, LOOKUP_IMPLICIT
,
4384 /* Used to create "a contextually converted constant expression of type
4385 bool". This differs from build_converted_constant_expr in that it
4386 also considers explicit conversion functions. */
4389 build_converted_constant_bool_expr (tree expr
, tsubst_flags_t complain
)
4391 return build_converted_constant_expr_internal (boolean_type_node
, expr
,
4392 LOOKUP_NORMAL
, complain
);
4395 /* Do any initial processing on the arguments to a function call. */
4397 static vec
<tree
, va_gc
> *
4398 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
4403 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4405 if (error_operand_p (arg
))
4407 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4409 if (complain
& tf_error
)
4410 error_at (cp_expr_loc_or_input_loc (arg
),
4411 "invalid use of void expression");
4414 else if (invalid_nonstatic_memfn_p (EXPR_LOCATION (arg
), arg
, complain
))
4420 /* Perform overload resolution on FN, which is called with the ARGS.
4422 Return the candidate function selected by overload resolution, or
4423 NULL if the event that overload resolution failed. In the case
4424 that overload resolution fails, *CANDIDATES will be the set of
4425 candidates considered, and ANY_VIABLE_P will be set to true or
4426 false to indicate whether or not any of the candidates were
4429 The ARGS should already have gone through RESOLVE_ARGS before this
4430 function is called. */
4432 static struct z_candidate
*
4433 perform_overload_resolution (tree fn
,
4434 const vec
<tree
, va_gc
> *args
,
4435 struct z_candidate
**candidates
,
4436 bool *any_viable_p
, tsubst_flags_t complain
)
4438 struct z_candidate
*cand
;
4439 tree explicit_targs
;
4442 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4444 explicit_targs
= NULL_TREE
;
4448 *any_viable_p
= true;
4451 gcc_assert (OVL_P (fn
) || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4453 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4455 explicit_targs
= TREE_OPERAND (fn
, 1);
4456 fn
= TREE_OPERAND (fn
, 0);
4460 /* Add the various candidate functions. */
4461 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4462 explicit_targs
, template_only
,
4463 /*conversion_path=*/NULL_TREE
,
4464 /*access_path=*/NULL_TREE
,
4466 candidates
, complain
);
4468 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4470 cand
= tourney (*candidates
, complain
);
4474 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4478 /* Print an error message about being unable to build a call to FN with
4479 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4480 be located; CANDIDATES is a possibly empty list of such
4484 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4485 struct z_candidate
*candidates
)
4487 tree targs
= NULL_TREE
;
4488 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4490 targs
= TREE_OPERAND (fn
, 1);
4491 fn
= TREE_OPERAND (fn
, 0);
4493 tree name
= OVL_NAME (fn
);
4494 location_t loc
= location_of (name
);
4496 name
= lookup_template_function (name
, targs
);
4498 auto_diagnostic_group d
;
4499 if (!any_strictly_viable (candidates
))
4500 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4501 name
, build_tree_list_vec (args
));
4503 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4504 name
, build_tree_list_vec (args
));
4506 print_z_candidates (loc
, candidates
);
4509 /* Return an expression for a call to FN (a namespace-scope function,
4510 or a static member function) with the ARGS. This may change
4514 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
,
4515 tsubst_flags_t complain
)
4517 struct z_candidate
*candidates
, *cand
;
4522 if (args
!= NULL
&& *args
!= NULL
)
4524 *args
= resolve_args (*args
, complain
);
4526 return error_mark_node
;
4530 tm_malloc_replacement (fn
);
4532 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4533 p
= conversion_obstack_alloc (0);
4535 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4540 if (complain
& tf_error
)
4542 // If there is a single (non-viable) function candidate,
4543 // let the error be diagnosed by cp_build_function_call_vec.
4544 if (!any_viable_p
&& candidates
&& ! candidates
->next
4545 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4546 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4548 // Otherwise, emit notes for non-viable candidates.
4549 print_error_for_call_failure (fn
, *args
, candidates
);
4551 result
= error_mark_node
;
4555 int flags
= LOOKUP_NORMAL
;
4556 /* If fn is template_id_expr, the call has explicit template arguments
4557 (e.g. func<int>(5)), communicate this info to build_over_call
4558 through flags so that later we can use it to decide whether to warn
4559 about peculiar null pointer conversion. */
4560 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4561 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4563 result
= build_over_call (cand
, flags
, complain
);
4566 /* Free all the conversions we allocated. */
4567 obstack_free (&conversion_obstack
, p
);
4572 /* Build a call to a global operator new. FNNAME is the name of the
4573 operator (either "operator new" or "operator new[]") and ARGS are
4574 the arguments provided. This may change ARGS. *SIZE points to the
4575 total number of bytes required by the allocation, and is updated if
4576 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4577 be used. If this function determines that no cookie should be
4578 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4579 is not NULL_TREE, it is evaluated before calculating the final
4580 array size, and if it fails, the array size is replaced with
4581 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4582 is non-NULL, it will be set, upon return, to the allocation
4586 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4587 tree
*size
, tree
*cookie_size
,
4588 tree align_arg
, tree size_check
,
4589 tree
*fn
, tsubst_flags_t complain
)
4591 tree original_size
= *size
;
4593 struct z_candidate
*candidates
;
4594 struct z_candidate
*cand
= NULL
;
4599 /* Set to (size_t)-1 if the size check fails. */
4600 if (size_check
!= NULL_TREE
)
4602 tree errval
= TYPE_MAX_VALUE (sizetype
);
4603 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4604 errval
= throw_bad_array_new_length ();
4605 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4606 original_size
, errval
);
4608 vec_safe_insert (*args
, 0, *size
);
4609 *args
= resolve_args (*args
, complain
);
4611 return error_mark_node
;
4617 If this lookup fails to find the name, or if the allocated type
4618 is not a class type, the allocation function's name is looked
4619 up in the global scope.
4621 we disregard block-scope declarations of "operator new". */
4622 fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/false, 0, 0);
4623 fns
= lookup_arg_dependent (fnname
, fns
, *args
);
4627 vec
<tree
, va_gc
>* align_args
4628 = vec_copy_and_insert (*args
, align_arg
, 1);
4629 cand
= perform_overload_resolution (fns
, align_args
, &candidates
,
4630 &any_viable_p
, tf_none
);
4633 /* If no aligned allocation function matches, try again without the
4637 /* Figure out what function is being called. */
4639 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4642 /* If no suitable function could be found, issue an error message
4646 if (complain
& tf_error
)
4647 print_error_for_call_failure (fns
, *args
, candidates
);
4648 return error_mark_node
;
4651 /* If a cookie is required, add some extra space. Whether
4652 or not a cookie is required cannot be determined until
4653 after we know which function was called. */
4656 bool use_cookie
= true;
4659 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4660 /* Skip the size_t parameter. */
4661 arg_types
= TREE_CHAIN (arg_types
);
4662 /* Check the remaining parameters (if any). */
4664 && TREE_CHAIN (arg_types
) == void_list_node
4665 && same_type_p (TREE_VALUE (arg_types
),
4668 /* If we need a cookie, adjust the number of bytes allocated. */
4671 /* Update the total size. */
4672 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4675 /* Set to (size_t)-1 if the size check fails. */
4676 gcc_assert (size_check
!= NULL_TREE
);
4677 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4678 *size
, TYPE_MAX_VALUE (sizetype
));
4680 /* Update the argument list to reflect the adjusted size. */
4681 (**args
)[0] = *size
;
4684 *cookie_size
= NULL_TREE
;
4687 /* Tell our caller which function we decided to call. */
4691 /* Build the CALL_EXPR. */
4692 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4695 /* Build a new call to operator(). This may change ARGS. */
4698 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4700 struct z_candidate
*candidates
= 0, *cand
;
4701 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4703 tree result
= NULL_TREE
;
4706 obj
= mark_lvalue_use (obj
);
4708 if (error_operand_p (obj
))
4709 return error_mark_node
;
4711 tree type
= TREE_TYPE (obj
);
4713 obj
= prep_operand (obj
);
4715 if (TYPE_PTRMEMFUNC_P (type
))
4717 if (complain
& tf_error
)
4718 /* It's no good looking for an overloaded operator() on a
4719 pointer-to-member-function. */
4720 error ("pointer-to-member function %qE cannot be called without "
4721 "an object; consider using %<.*%> or %<->*%>", obj
);
4722 return error_mark_node
;
4725 if (TYPE_BINFO (type
))
4727 fns
= lookup_fnfields (TYPE_BINFO (type
), call_op_identifier
, 1);
4728 if (fns
== error_mark_node
)
4729 return error_mark_node
;
4734 if (args
!= NULL
&& *args
!= NULL
)
4736 *args
= resolve_args (*args
, complain
);
4738 return error_mark_node
;
4741 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4742 p
= conversion_obstack_alloc (0);
4746 first_mem_arg
= obj
;
4748 add_candidates (BASELINK_FUNCTIONS (fns
),
4749 first_mem_arg
, *args
, NULL_TREE
,
4751 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4752 LOOKUP_NORMAL
, &candidates
, complain
);
4755 convs
= lookup_conversions (type
);
4757 for (; convs
; convs
= TREE_CHAIN (convs
))
4759 tree totype
= TREE_TYPE (convs
);
4761 if (TYPE_PTRFN_P (totype
)
4762 || TYPE_REFFN_P (totype
)
4763 || (TYPE_REF_P (totype
)
4764 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4765 for (ovl_iterator
iter (TREE_VALUE (convs
)); iter
; ++iter
)
4769 if (DECL_NONCONVERTING_P (fn
))
4772 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4773 add_template_conv_candidate
4774 (&candidates
, fn
, obj
, *args
, totype
,
4775 /*access_path=*/NULL_TREE
,
4776 /*conversion_path=*/NULL_TREE
, complain
);
4778 add_conv_candidate (&candidates
, fn
, obj
,
4779 *args
, /*conversion_path=*/NULL_TREE
,
4780 /*access_path=*/NULL_TREE
, complain
);
4784 /* Be strict here because if we choose a bad conversion candidate, the
4785 errors we get won't mention the call context. */
4786 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4789 if (complain
& tf_error
)
4791 auto_diagnostic_group d
;
4792 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4793 build_tree_list_vec (*args
));
4794 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4796 result
= error_mark_node
;
4800 cand
= tourney (candidates
, complain
);
4803 if (complain
& tf_error
)
4805 auto_diagnostic_group d
;
4806 error ("call of %<(%T) (%A)%> is ambiguous",
4807 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4808 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4810 result
= error_mark_node
;
4812 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4813 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
)
4814 && DECL_OVERLOADED_OPERATOR_IS (cand
->fn
, CALL_EXPR
))
4815 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4818 if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4819 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4823 gcc_checking_assert (TYPE_P (cand
->fn
));
4824 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4826 obj
= convert_from_reference (obj
);
4827 result
= cp_build_function_call_vec (obj
, args
, complain
);
4831 /* Free all the conversions we allocated. */
4832 obstack_free (&conversion_obstack
, p
);
4837 /* Wrapper for above. */
4840 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4843 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4844 ret
= build_op_call_1 (obj
, args
, complain
);
4845 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4849 /* Called by op_error to prepare format strings suitable for the error
4850 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4851 and a suffix (controlled by NTYPES). */
4854 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4858 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4859 : G_("no match for "), errmsg
, NULL
);
4862 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4863 else if (ntypes
== 2)
4864 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4866 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4872 op_error (const op_location_t
&loc
,
4873 enum tree_code code
, enum tree_code code2
,
4874 tree arg1
, tree arg2
, tree arg3
, bool match
)
4876 bool assop
= code
== MODIFY_EXPR
;
4877 const char *opname
= OVL_OP_INFO (assop
, assop
? code2
: code
)->name
;
4882 if (flag_diagnostics_show_caret
)
4883 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4885 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4887 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4888 "in %<%E ? %E : %E%>"), 3, match
),
4890 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4893 case POSTINCREMENT_EXPR
:
4894 case POSTDECREMENT_EXPR
:
4895 if (flag_diagnostics_show_caret
)
4896 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4897 opname
, TREE_TYPE (arg1
));
4899 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4901 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4905 if (flag_diagnostics_show_caret
)
4906 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4907 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4909 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4911 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4916 if (flag_diagnostics_show_caret
)
4917 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4918 opname
, TREE_TYPE (arg1
));
4920 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4921 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4926 if (flag_diagnostics_show_caret
)
4928 binary_op_rich_location
richloc (loc
, arg1
, arg2
, true);
4930 op_error_string (G_("%<operator%s%>"), 2, match
),
4931 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4934 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4936 opname
, arg1
, opname
, arg2
,
4937 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4939 if (flag_diagnostics_show_caret
)
4940 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4941 opname
, TREE_TYPE (arg1
));
4943 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4945 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4950 /* Return the implicit conversion sequence that could be used to
4951 convert E1 to E2 in [expr.cond]. */
4954 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4956 tree t1
= non_reference (TREE_TYPE (e1
));
4957 tree t2
= non_reference (TREE_TYPE (e2
));
4963 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4964 implicitly converted (clause _conv_) to the type "lvalue reference to
4965 T2", subject to the constraint that in the conversion the
4966 reference must bind directly (_dcl.init.ref_) to an lvalue.
4968 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4969 implicitly converted to the type "rvalue reference to T2", subject to
4970 the constraint that the reference must bind directly. */
4973 tree rtype
= cp_build_reference_type (t2
, !lvalue_p (e2
));
4974 conv
= implicit_conversion (rtype
,
4978 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4979 |LOOKUP_ONLYCONVERTING
,
4981 if (conv
&& !conv
->bad_p
)
4985 /* If E2 is a prvalue or if neither of the conversions above can be done
4986 and at least one of the operands has (possibly cv-qualified) class
4988 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4993 If E1 and E2 have class type, and the underlying class types are
4994 the same or one is a base class of the other: E1 can be converted
4995 to match E2 if the class of T2 is the same type as, or a base
4996 class of, the class of T1, and the cv-qualification of T2 is the
4997 same cv-qualification as, or a greater cv-qualification than, the
4998 cv-qualification of T1. If the conversion is applied, E1 is
4999 changed to an rvalue of type T2 that still refers to the original
5000 source class object (or the appropriate subobject thereof). */
5001 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
5002 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
5004 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
5006 conv
= build_identity_conv (t1
, e1
);
5007 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
5008 TYPE_MAIN_VARIANT (t2
)))
5009 conv
= build_conv (ck_base
, t2
, conv
);
5011 conv
= build_conv (ck_rvalue
, t2
, conv
);
5020 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
5021 converted to the type that expression E2 would have if E2 were
5022 converted to an rvalue (or the type it has, if E2 is an rvalue). */
5023 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
5024 LOOKUP_IMPLICIT
, complain
);
5027 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
5028 arguments to the conditional expression. */
5031 build_conditional_expr_1 (const op_location_t
&loc
,
5032 tree arg1
, tree arg2
, tree arg3
,
5033 tsubst_flags_t complain
)
5037 tree result
= NULL_TREE
;
5038 tree result_type
= NULL_TREE
;
5039 bool is_glvalue
= true;
5040 struct z_candidate
*candidates
= 0;
5041 struct z_candidate
*cand
;
5043 tree orig_arg2
, orig_arg3
;
5045 /* As a G++ extension, the second argument to the conditional can be
5046 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
5047 c'.) If the second operand is omitted, make sure it is
5048 calculated only once. */
5051 if (complain
& tf_error
)
5052 pedwarn (loc
, OPT_Wpedantic
,
5053 "ISO C++ forbids omitting the middle term of "
5054 "a %<?:%> expression");
5056 if ((complain
& tf_warning
) && !truth_value_p (TREE_CODE (arg1
)))
5057 warn_for_omitted_condop (loc
, arg1
);
5059 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
5060 if (lvalue_p (arg1
))
5061 arg2
= arg1
= cp_stabilize_reference (arg1
);
5063 arg2
= arg1
= cp_save_expr (arg1
);
5066 /* If something has already gone wrong, just pass that fact up the
5068 if (error_operand_p (arg1
)
5069 || error_operand_p (arg2
)
5070 || error_operand_p (arg3
))
5071 return error_mark_node
;
5076 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
5078 tree arg1_type
= TREE_TYPE (arg1
);
5080 /* If arg1 is another cond_expr choosing between -1 and 0,
5081 then we can use its comparison. It may help to avoid
5082 additional comparison, produce more accurate diagnostics
5083 and enables folding. */
5084 if (TREE_CODE (arg1
) == VEC_COND_EXPR
5085 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
5086 && integer_zerop (TREE_OPERAND (arg1
, 2)))
5087 arg1
= TREE_OPERAND (arg1
, 0);
5089 arg1
= force_rvalue (arg1
, complain
);
5090 arg2
= force_rvalue (arg2
, complain
);
5091 arg3
= force_rvalue (arg3
, complain
);
5093 /* force_rvalue can return error_mark on valid arguments. */
5094 if (error_operand_p (arg1
)
5095 || error_operand_p (arg2
)
5096 || error_operand_p (arg3
))
5097 return error_mark_node
;
5099 arg2_type
= TREE_TYPE (arg2
);
5100 arg3_type
= TREE_TYPE (arg3
);
5102 if (!VECTOR_TYPE_P (arg2_type
)
5103 && !VECTOR_TYPE_P (arg3_type
))
5105 /* Rely on the error messages of the scalar version. */
5106 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
5107 orig_arg2
, orig_arg3
, complain
);
5108 if (scal
== error_mark_node
)
5109 return error_mark_node
;
5110 tree stype
= TREE_TYPE (scal
);
5111 tree ctype
= TREE_TYPE (arg1_type
);
5112 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
5113 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
5115 if (complain
& tf_error
)
5116 error_at (loc
, "inferred scalar type %qT is not an integer or "
5117 "floating-point type of the same size as %qT", stype
,
5118 COMPARISON_CLASS_P (arg1
)
5119 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
5121 return error_mark_node
;
5124 tree vtype
= build_opaque_vector_type (stype
,
5125 TYPE_VECTOR_SUBPARTS (arg1_type
));
5126 /* We could pass complain & tf_warning to unsafe_conversion_p,
5127 but the warnings (like Wsign-conversion) have already been
5128 given by the scalar build_conditional_expr_1. We still check
5129 unsafe_conversion_p to forbid truncating long long -> float. */
5130 if (unsafe_conversion_p (loc
, stype
, arg2
, NULL_TREE
, false))
5132 if (complain
& tf_error
)
5133 error_at (loc
, "conversion of scalar %qH to vector %qI "
5134 "involves truncation", arg2_type
, vtype
);
5135 return error_mark_node
;
5137 if (unsafe_conversion_p (loc
, stype
, arg3
, NULL_TREE
, false))
5139 if (complain
& tf_error
)
5140 error_at (loc
, "conversion of scalar %qH to vector %qI "
5141 "involves truncation", arg3_type
, vtype
);
5142 return error_mark_node
;
5145 arg2
= cp_convert (stype
, arg2
, complain
);
5146 arg2
= save_expr (arg2
);
5147 arg2
= build_vector_from_val (vtype
, arg2
);
5149 arg3
= cp_convert (stype
, arg3
, complain
);
5150 arg3
= save_expr (arg3
);
5151 arg3
= build_vector_from_val (vtype
, arg3
);
5155 if (VECTOR_TYPE_P (arg2_type
) != VECTOR_TYPE_P (arg3_type
))
5157 enum stv_conv convert_flag
=
5158 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
5159 complain
& tf_error
);
5161 switch (convert_flag
)
5164 return error_mark_node
;
5167 arg2
= save_expr (arg2
);
5168 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
5169 arg2
= build_vector_from_val (arg3_type
, arg2
);
5170 arg2_type
= TREE_TYPE (arg2
);
5175 arg3
= save_expr (arg3
);
5176 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
5177 arg3
= build_vector_from_val (arg2_type
, arg3
);
5178 arg3_type
= TREE_TYPE (arg3
);
5186 if (!same_type_p (arg2_type
, arg3_type
)
5187 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type
),
5188 TYPE_VECTOR_SUBPARTS (arg2_type
))
5189 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
5191 if (complain
& tf_error
)
5193 "incompatible vector types in conditional expression: "
5194 "%qT, %qT and %qT", TREE_TYPE (arg1
),
5195 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
5196 return error_mark_node
;
5199 if (!COMPARISON_CLASS_P (arg1
))
5201 tree cmp_type
= build_same_sized_truth_vector_type (arg1_type
);
5202 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
5204 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
5209 The first expression is implicitly converted to bool (clause
5211 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
5213 if (error_operand_p (arg1
))
5214 return error_mark_node
;
5218 If either the second or the third operand has type (possibly
5219 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
5220 array-to-pointer (_conv.array_), and function-to-pointer
5221 (_conv.func_) standard conversions are performed on the second
5222 and third operands. */
5223 arg2_type
= unlowered_expr_type (arg2
);
5224 arg3_type
= unlowered_expr_type (arg3
);
5225 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
5227 /* 'void' won't help in resolving an overloaded expression on the
5228 other side, so require it to resolve by itself. */
5229 if (arg2_type
== unknown_type_node
)
5231 arg2
= resolve_nondeduced_context_or_error (arg2
, complain
);
5232 arg2_type
= TREE_TYPE (arg2
);
5234 if (arg3_type
== unknown_type_node
)
5236 arg3
= resolve_nondeduced_context_or_error (arg3
, complain
);
5237 arg3_type
= TREE_TYPE (arg3
);
5242 One of the following shall hold:
5244 --The second or the third operand (but not both) is a
5245 throw-expression (_except.throw_); the result is of the type
5246 and value category of the other.
5248 --Both the second and the third operands have type void; the
5249 result is of type void and is a prvalue. */
5250 if (TREE_CODE (arg2
) == THROW_EXPR
5251 && TREE_CODE (arg3
) != THROW_EXPR
)
5253 result_type
= arg3_type
;
5254 is_glvalue
= glvalue_p (arg3
);
5256 else if (TREE_CODE (arg2
) != THROW_EXPR
5257 && TREE_CODE (arg3
) == THROW_EXPR
)
5259 result_type
= arg2_type
;
5260 is_glvalue
= glvalue_p (arg2
);
5262 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
5264 result_type
= void_type_node
;
5269 if (complain
& tf_error
)
5271 if (VOID_TYPE_P (arg2_type
))
5272 error_at (cp_expr_loc_or_loc (arg3
, loc
),
5273 "second operand to the conditional operator "
5274 "is of type %<void%>, but the third operand is "
5275 "neither a throw-expression nor of type %<void%>");
5277 error_at (cp_expr_loc_or_loc (arg2
, loc
),
5278 "third operand to the conditional operator "
5279 "is of type %<void%>, but the second operand is "
5280 "neither a throw-expression nor of type %<void%>");
5282 return error_mark_node
;
5285 goto valid_operands
;
5289 Otherwise, if the second and third operand have different types,
5290 and either has (possibly cv-qualified) class type, or if both are
5291 glvalues of the same value category and the same type except for
5292 cv-qualification, an attempt is made to convert each of those operands
5293 to the type of the other. */
5294 else if (!same_type_p (arg2_type
, arg3_type
)
5295 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
5296 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
5298 && glvalue_p (arg2
) && glvalue_p (arg3
)
5299 && lvalue_p (arg2
) == lvalue_p (arg3
))))
5303 bool converted
= false;
5305 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5306 p
= conversion_obstack_alloc (0);
5308 conv2
= conditional_conversion (arg2
, arg3
, complain
);
5309 conv3
= conditional_conversion (arg3
, arg2
, complain
);
5313 If both can be converted, or one can be converted but the
5314 conversion is ambiguous, the program is ill-formed. If
5315 neither can be converted, the operands are left unchanged and
5316 further checking is performed as described below. If exactly
5317 one conversion is possible, that conversion is applied to the
5318 chosen operand and the converted operand is used in place of
5319 the original operand for the remainder of this section. */
5320 if ((conv2
&& !conv2
->bad_p
5321 && conv3
&& !conv3
->bad_p
)
5322 || (conv2
&& conv2
->kind
== ck_ambig
)
5323 || (conv3
&& conv3
->kind
== ck_ambig
))
5325 if (complain
& tf_error
)
5327 error_at (loc
, "operands to %<?:%> have different types "
5329 arg2_type
, arg3_type
);
5330 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
5331 inform (loc
, " and each type can be converted to the other");
5332 else if (conv2
&& conv2
->kind
== ck_ambig
)
5333 convert_like (conv2
, arg2
, complain
);
5335 convert_like (conv3
, arg3
, complain
);
5337 result
= error_mark_node
;
5339 else if (conv2
&& !conv2
->bad_p
)
5341 arg2
= convert_like (conv2
, arg2
, complain
);
5342 arg2
= convert_from_reference (arg2
);
5343 arg2_type
= TREE_TYPE (arg2
);
5344 /* Even if CONV2 is a valid conversion, the result of the
5345 conversion may be invalid. For example, if ARG3 has type
5346 "volatile X", and X does not have a copy constructor
5347 accepting a "volatile X&", then even if ARG2 can be
5348 converted to X, the conversion will fail. */
5349 if (error_operand_p (arg2
))
5350 result
= error_mark_node
;
5353 else if (conv3
&& !conv3
->bad_p
)
5355 arg3
= convert_like (conv3
, arg3
, complain
);
5356 arg3
= convert_from_reference (arg3
);
5357 arg3_type
= TREE_TYPE (arg3
);
5358 if (error_operand_p (arg3
))
5359 result
= error_mark_node
;
5363 /* Free all the conversions we allocated. */
5364 obstack_free (&conversion_obstack
, p
);
5369 /* If, after the conversion, both operands have class type,
5370 treat the cv-qualification of both operands as if it were the
5371 union of the cv-qualification of the operands.
5373 The standard is not clear about what to do in this
5374 circumstance. For example, if the first operand has type
5375 "const X" and the second operand has a user-defined
5376 conversion to "volatile X", what is the type of the second
5377 operand after this step? Making it be "const X" (matching
5378 the first operand) seems wrong, as that discards the
5379 qualification without actually performing a copy. Leaving it
5380 as "volatile X" seems wrong as that will result in the
5381 conditional expression failing altogether, even though,
5382 according to this step, the one operand could be converted to
5383 the type of the other. */
5385 && CLASS_TYPE_P (arg2_type
)
5386 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
5387 arg2_type
= arg3_type
=
5388 cp_build_qualified_type (arg2_type
,
5389 cp_type_quals (arg2_type
)
5390 | cp_type_quals (arg3_type
));
5395 If the second and third operands are glvalues of the same value
5396 category and have the same type, the result is of that type and
5398 if (((lvalue_p (arg2
) && lvalue_p (arg3
))
5399 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
5400 && same_type_p (arg2_type
, arg3_type
))
5402 result_type
= arg2_type
;
5403 arg2
= mark_lvalue_use (arg2
);
5404 arg3
= mark_lvalue_use (arg3
);
5405 goto valid_operands
;
5410 Otherwise, the result is an rvalue. If the second and third
5411 operand do not have the same type, and either has (possibly
5412 cv-qualified) class type, overload resolution is used to
5413 determine the conversions (if any) to be applied to the operands
5414 (_over.match.oper_, _over.built_). */
5416 if (!same_type_p (arg2_type
, arg3_type
)
5417 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5423 /* Rearrange the arguments so that add_builtin_candidate only has
5424 to know about two args. In build_builtin_candidate, the
5425 arguments are unscrambled. */
5426 args
->quick_push (arg2
);
5427 args
->quick_push (arg3
);
5428 args
->quick_push (arg1
);
5429 add_builtin_candidates (&candidates
,
5432 ovl_op_identifier (false, COND_EXPR
),
5434 LOOKUP_NORMAL
, complain
);
5438 If the overload resolution fails, the program is
5440 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5443 if (complain
& tf_error
)
5444 error_at (loc
, "operands to %<?:%> have different types %qT and %qT",
5445 arg2_type
, arg3_type
);
5446 return error_mark_node
;
5448 cand
= tourney (candidates
, complain
);
5451 if (complain
& tf_error
)
5453 auto_diagnostic_group d
;
5454 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5455 print_z_candidates (loc
, candidates
);
5457 return error_mark_node
;
5462 Otherwise, the conversions thus determined are applied, and
5463 the converted operands are used in place of the original
5464 operands for the remainder of this section. */
5465 conv
= cand
->convs
[0];
5466 arg1
= convert_like (conv
, arg1
, complain
);
5467 conv
= cand
->convs
[1];
5468 arg2
= convert_like (conv
, arg2
, complain
);
5469 arg2_type
= TREE_TYPE (arg2
);
5470 conv
= cand
->convs
[2];
5471 arg3
= convert_like (conv
, arg3
, complain
);
5472 arg3_type
= TREE_TYPE (arg3
);
5477 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5478 and function-to-pointer (_conv.func_) standard conversions are
5479 performed on the second and third operands.
5481 We need to force the lvalue-to-rvalue conversion here for class types,
5482 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5483 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5486 arg2
= force_rvalue (arg2
, complain
);
5487 if (!CLASS_TYPE_P (arg2_type
))
5488 arg2_type
= TREE_TYPE (arg2
);
5490 arg3
= force_rvalue (arg3
, complain
);
5491 if (!CLASS_TYPE_P (arg3_type
))
5492 arg3_type
= TREE_TYPE (arg3
);
5494 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5495 return error_mark_node
;
5499 After those conversions, one of the following shall hold:
5501 --The second and third operands have the same type; the result is of
5503 if (same_type_p (arg2_type
, arg3_type
))
5504 result_type
= arg2_type
;
5507 --The second and third operands have arithmetic or enumeration
5508 type; the usual arithmetic conversions are performed to bring
5509 them to a common type, and the result is of that type. */
5510 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5511 || UNSCOPED_ENUM_P (arg2_type
))
5512 && (ARITHMETIC_TYPE_P (arg3_type
)
5513 || UNSCOPED_ENUM_P (arg3_type
)))
5515 /* In this case, there is always a common type. */
5516 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5518 if (complain
& tf_warning
)
5519 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5520 "implicit conversion from %qH to %qI to "
5521 "match other result of conditional",
5524 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5525 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5527 tree stripped_orig_arg2
= tree_strip_any_location_wrapper (orig_arg2
);
5528 tree stripped_orig_arg3
= tree_strip_any_location_wrapper (orig_arg3
);
5529 if (TREE_CODE (stripped_orig_arg2
) == CONST_DECL
5530 && TREE_CODE (stripped_orig_arg3
) == CONST_DECL
5531 && (DECL_CONTEXT (stripped_orig_arg2
)
5532 == DECL_CONTEXT (stripped_orig_arg3
)))
5533 /* Two enumerators from the same enumeration can have different
5534 types when the enumeration is still being defined. */;
5535 else if (complain
& tf_warning
)
5536 warning_at (loc
, OPT_Wenum_compare
, "enumerated mismatch "
5537 "in conditional expression: %qT vs %qT",
5538 arg2_type
, arg3_type
);
5540 else if (extra_warnings
5541 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5542 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5543 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5544 && !same_type_p (arg2_type
,
5545 type_promotes_to (arg3_type
)))))
5547 if (complain
& tf_warning
)
5548 warning_at (loc
, OPT_Wextra
, "enumerated and non-enumerated "
5549 "type in conditional expression");
5552 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5553 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5557 --The second and third operands have pointer type, or one has
5558 pointer type and the other is a null pointer constant; pointer
5559 conversions (_conv.ptr_) and qualification conversions
5560 (_conv.qual_) are performed to bring them to their composite
5561 pointer type (_expr.rel_). The result is of the composite
5564 --The second and third operands have pointer to member type, or
5565 one has pointer to member type and the other is a null pointer
5566 constant; pointer to member conversions (_conv.mem_) and
5567 qualification conversions (_conv.qual_) are performed to bring
5568 them to a common type, whose cv-qualification shall match the
5569 cv-qualification of either the second or the third operand.
5570 The result is of the common type. */
5571 else if ((null_ptr_cst_p (arg2
)
5572 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5573 || (null_ptr_cst_p (arg3
)
5574 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5575 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5576 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5577 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5579 result_type
= composite_pointer_type (loc
,
5580 arg2_type
, arg3_type
, arg2
,
5581 arg3
, CPO_CONDITIONAL_EXPR
,
5583 if (result_type
== error_mark_node
)
5584 return error_mark_node
;
5585 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5586 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5591 if (complain
& tf_error
)
5592 error_at (loc
, "operands to %<?:%> have different types %qT and %qT",
5593 arg2_type
, arg3_type
);
5594 return error_mark_node
;
5597 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5598 return error_mark_node
;
5601 if (processing_template_decl
&& is_glvalue
)
5603 /* Let lvalue_kind know this was a glvalue. */
5604 tree arg
= (result_type
== arg2_type
? arg2
: arg3
);
5605 result_type
= cp_build_reference_type (result_type
, xvalue_p (arg
));
5608 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5610 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5611 warn here, because the COND_EXPR will be turned into ARG2. */
5612 if (warn_duplicated_branches
5613 && (complain
& tf_warning
)
5614 && (arg2
== arg3
|| operand_equal_p (arg2
, arg3
, 0)))
5615 warning_at (EXPR_LOCATION (result
), OPT_Wduplicated_branches
,
5616 "this condition has identical branches");
5618 /* We can't use result_type below, as fold might have returned a
5623 /* Expand both sides into the same slot, hopefully the target of
5624 the ?: expression. We used to check for TARGET_EXPRs here,
5625 but now we sometimes wrap them in NOP_EXPRs so the test would
5627 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5628 result
= get_target_expr_sfinae (result
, complain
);
5629 /* If this expression is an rvalue, but might be mistaken for an
5630 lvalue, we must add a NON_LVALUE_EXPR. */
5631 result
= rvalue (result
);
5634 result
= force_paren_expr (result
);
5639 /* Wrapper for above. */
5642 build_conditional_expr (const op_location_t
&loc
,
5643 tree arg1
, tree arg2
, tree arg3
,
5644 tsubst_flags_t complain
)
5647 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5648 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5649 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5653 /* OPERAND is an operand to an expression. Perform necessary steps
5654 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5658 prep_operand (tree operand
)
5662 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5663 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5664 /* Make sure the template type is instantiated now. */
5665 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5671 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5672 OVERLOAD) to the CANDIDATES, returning an updated list of
5673 CANDIDATES. The ARGS are the arguments provided to the call;
5674 if FIRST_ARG is non-null it is the implicit object argument,
5675 otherwise the first element of ARGS is used if needed. The
5676 EXPLICIT_TARGS are explicit template arguments provided.
5677 TEMPLATE_ONLY is true if only template functions should be
5678 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5679 add_function_candidate. */
5682 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5684 tree explicit_targs
, bool template_only
,
5685 tree conversion_path
, tree access_path
,
5687 struct z_candidate
**candidates
,
5688 tsubst_flags_t complain
)
5691 const vec
<tree
, va_gc
> *non_static_args
;
5692 bool check_list_ctor
= false;
5693 bool check_converting
= false;
5694 unification_kind_t strict
;
5699 /* Precalculate special handling of constructors and conversion ops. */
5700 tree fn
= OVL_FIRST (fns
);
5701 if (DECL_CONV_FN_P (fn
))
5703 check_list_ctor
= false;
5704 check_converting
= (flags
& LOOKUP_ONLYCONVERTING
) != 0;
5705 if (flags
& LOOKUP_NO_CONVERSION
)
5706 /* We're doing return_type(x). */
5707 strict
= DEDUCE_CONV
;
5709 /* We're doing x.operator return_type(). */
5710 strict
= DEDUCE_EXACT
;
5711 /* [over.match.funcs] For conversion functions, the function
5712 is considered to be a member of the class of the implicit
5713 object argument for the purpose of defining the type of
5714 the implicit object parameter. */
5715 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5719 if (DECL_CONSTRUCTOR_P (fn
))
5721 check_list_ctor
= (flags
& LOOKUP_LIST_ONLY
) != 0;
5722 /* For list-initialization we consider explicit constructors
5723 and complain if one is chosen. */
5725 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5726 == LOOKUP_ONLYCONVERTING
);
5728 strict
= DEDUCE_CALL
;
5729 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5733 non_static_args
= args
;
5735 /* Delay creating the implicit this parameter until it is needed. */
5736 non_static_args
= NULL
;
5738 for (lkp_iterator
iter (fns
); iter
; ++iter
)
5742 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5744 if (check_list_ctor
&& !is_list_ctor (fn
))
5747 tree fn_first_arg
= NULL_TREE
;
5748 const vec
<tree
, va_gc
> *fn_args
= args
;
5750 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5752 /* Figure out where the object arg comes from. If this
5753 function is a non-static member and we didn't get an
5754 implicit object argument, move it out of args. */
5755 if (first_arg
== NULL_TREE
)
5759 vec
<tree
, va_gc
> *tempvec
;
5760 vec_alloc (tempvec
, args
->length () - 1);
5761 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5762 tempvec
->quick_push (arg
);
5763 non_static_args
= tempvec
;
5764 first_arg
= (*args
)[0];
5767 fn_first_arg
= first_arg
;
5768 fn_args
= non_static_args
;
5771 /* Don't bother reversing an operator with two identical parameters. */
5772 else if (args
->length () == 2 && (flags
& LOOKUP_REVERSED
))
5774 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
5775 if (same_type_p (TREE_VALUE (parmlist
),
5776 TREE_VALUE (TREE_CHAIN (parmlist
))))
5780 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5781 add_template_candidate (candidates
,
5793 else if (!template_only
)
5794 add_function_candidate (candidates
,
5807 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5808 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5811 op_is_ordered (tree_code code
)
5817 return (flag_strong_eval_order
> 1 ? -1 : 0);
5821 return (flag_strong_eval_order
> 1 ? 1 : 0);
5824 // Not overloadable (yet).
5826 // Only one argument.
5833 return (flag_strong_eval_order
? 1 : 0);
5840 /* Subroutine of build_new_op_1: Add to CANDIDATES all candidates for the
5841 operator indicated by CODE/CODE2. This function calls itself recursively to
5842 handle C++20 rewritten comparison operator candidates. */
5845 add_operator_candidates (z_candidate
**candidates
,
5846 tree_code code
, tree_code code2
,
5847 vec
<tree
, va_gc
> *arglist
,
5848 int flags
, tsubst_flags_t complain
)
5850 z_candidate
*start_candidates
= *candidates
;
5851 bool ismodop
= code2
!= ERROR_MARK
;
5852 tree fnname
= ovl_op_identifier (ismodop
, ismodop
? code2
: code
);
5854 /* LOOKUP_REWRITTEN is set when we're looking for the == or <=> operator to
5855 rewrite from, and also when we're looking for the e.g. < operator to use
5856 on the result of <=>. In the latter case, we don't want the flag set in
5857 the candidate, we just want to suppress looking for rewrites. */
5858 bool rewritten
= (flags
& LOOKUP_REWRITTEN
);
5859 if (rewritten
&& code
!= EQ_EXPR
&& code
!= SPACESHIP_EXPR
)
5860 flags
&= ~LOOKUP_REWRITTEN
;
5862 bool memonly
= false;
5865 /* =, ->, [], () must be non-static member functions. */
5867 if (code2
!= NOP_EXPR
)
5879 /* Add namespace-scope operators to the list of functions to
5883 tree fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/true, 0, 0);
5884 fns
= lookup_arg_dependent (fnname
, fns
, arglist
);
5885 add_candidates (fns
, NULL_TREE
, arglist
, NULL_TREE
,
5886 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5887 flags
, candidates
, complain
);
5890 /* Add class-member operators to the candidate set. */
5891 tree arg1_type
= TREE_TYPE ((*arglist
)[0]);
5892 unsigned nargs
= arglist
->length () > 1 ? 2 : 1;
5893 tree arg2_type
= nargs
> 1 ? TREE_TYPE ((*arglist
)[1]) : NULL_TREE
;
5894 if (CLASS_TYPE_P (arg1_type
))
5896 tree fns
= lookup_fnfields (arg1_type
, fnname
, 1);
5897 if (fns
== error_mark_node
)
5898 return error_mark_node
;
5900 add_candidates (BASELINK_FUNCTIONS (fns
),
5901 NULL_TREE
, arglist
, NULL_TREE
,
5903 BASELINK_BINFO (fns
),
5904 BASELINK_ACCESS_BINFO (fns
),
5905 flags
, candidates
, complain
);
5907 /* Per [over.match.oper]3.2, if no operand has a class type, then
5908 only non-member functions that have type T1 or reference to
5909 cv-qualified-opt T1 for the first argument, if the first argument
5910 has an enumeration type, or T2 or reference to cv-qualified-opt
5911 T2 for the second argument, if the second argument has an
5912 enumeration type. Filter out those that don't match. */
5913 else if (! arg2_type
|| ! CLASS_TYPE_P (arg2_type
))
5915 struct z_candidate
**candp
, **next
;
5917 for (candp
= candidates
; *candp
!= start_candidates
; candp
= next
)
5920 z_candidate
*cand
= *candp
;
5923 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5925 for (i
= 0; i
< nargs
; ++i
)
5927 tree parmtype
= TREE_VALUE (parmlist
);
5928 tree argtype
= unlowered_expr_type ((*arglist
)[i
]);
5930 if (TYPE_REF_P (parmtype
))
5931 parmtype
= TREE_TYPE (parmtype
);
5932 if (TREE_CODE (argtype
) == ENUMERAL_TYPE
5933 && (same_type_ignoring_top_level_qualifiers_p
5934 (argtype
, parmtype
)))
5937 parmlist
= TREE_CHAIN (parmlist
);
5940 /* No argument has an appropriate type, so remove this
5941 candidate function from the list. */
5944 *candp
= cand
->next
;
5952 /* The standard says to rewrite built-in candidates, too,
5953 but there's no point. */
5954 add_builtin_candidates (candidates
, code
, code2
, fnname
, arglist
,
5957 /* Maybe add C++20 rewritten comparison candidates. */
5958 tree_code rewrite_code
= ERROR_MARK
;
5959 if (cxx_dialect
>= cxx2a
5961 && (OVERLOAD_TYPE_P (arg1_type
) || OVERLOAD_TYPE_P (arg2_type
)))
5968 case SPACESHIP_EXPR
:
5969 rewrite_code
= SPACESHIP_EXPR
;
5974 rewrite_code
= EQ_EXPR
;
5982 flags
|= LOOKUP_REWRITTEN
;
5983 if (rewrite_code
!= code
)
5984 /* Add rewritten candidates in same order. */
5985 add_operator_candidates (candidates
, rewrite_code
, ERROR_MARK
,
5986 arglist
, flags
, complain
);
5988 z_candidate
*save_cand
= *candidates
;
5990 /* Add rewritten candidates in reverse order. */
5991 flags
|= LOOKUP_REVERSED
;
5992 vec
<tree
,va_gc
> *revlist
= make_tree_vector ();
5993 revlist
->quick_push ((*arglist
)[1]);
5994 revlist
->quick_push ((*arglist
)[0]);
5995 add_operator_candidates (candidates
, rewrite_code
, ERROR_MARK
,
5996 revlist
, flags
, complain
);
5998 /* Release the vec if we didn't add a candidate that uses it. */
5999 for (z_candidate
*c
= *candidates
; c
!= save_cand
; c
= c
->next
)
6000 if (c
->args
== revlist
)
6005 release_tree_vector (revlist
);
6013 build_new_op_1 (const op_location_t
&loc
, enum tree_code code
, int flags
,
6014 tree arg1
, tree arg2
, tree arg3
, tree
*overload
,
6015 tsubst_flags_t complain
)
6017 struct z_candidate
*candidates
= 0, *cand
;
6018 vec
<tree
, va_gc
> *arglist
;
6019 tree result
= NULL_TREE
;
6020 bool result_valid_p
= false;
6021 enum tree_code code2
= ERROR_MARK
;
6022 enum tree_code code_orig_arg1
= ERROR_MARK
;
6023 enum tree_code code_orig_arg2
= ERROR_MARK
;
6029 if (error_operand_p (arg1
)
6030 || error_operand_p (arg2
)
6031 || error_operand_p (arg3
))
6032 return error_mark_node
;
6034 bool ismodop
= code
== MODIFY_EXPR
;
6037 code2
= TREE_CODE (arg3
);
6041 tree arg1_type
= unlowered_expr_type (arg1
);
6042 tree arg2_type
= arg2
? unlowered_expr_type (arg2
) : NULL_TREE
;
6044 arg1
= prep_operand (arg1
);
6050 case VEC_DELETE_EXPR
:
6052 /* Use build_op_new_call and build_op_delete_call instead. */
6056 /* Use build_op_call instead. */
6059 case TRUTH_ORIF_EXPR
:
6060 case TRUTH_ANDIF_EXPR
:
6061 case TRUTH_AND_EXPR
:
6063 /* These are saved for the sake of warn_logical_operator. */
6064 code_orig_arg1
= TREE_CODE (arg1
);
6065 code_orig_arg2
= TREE_CODE (arg2
);
6073 /* These are saved for the sake of maybe_warn_bool_compare. */
6074 code_orig_arg1
= TREE_CODE (arg1_type
);
6075 code_orig_arg2
= TREE_CODE (arg2_type
);
6082 arg2
= prep_operand (arg2
);
6083 arg3
= prep_operand (arg3
);
6085 if (code
== COND_EXPR
)
6086 /* Use build_conditional_expr instead. */
6088 else if (! OVERLOAD_TYPE_P (arg1_type
)
6089 && (! arg2
|| ! OVERLOAD_TYPE_P (arg2_type
)))
6092 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
6094 arg2
= integer_zero_node
;
6095 arg2_type
= integer_type_node
;
6098 vec_alloc (arglist
, 3);
6099 arglist
->quick_push (arg1
);
6100 if (arg2
!= NULL_TREE
)
6101 arglist
->quick_push (arg2
);
6102 if (arg3
!= NULL_TREE
)
6103 arglist
->quick_push (arg3
);
6105 /* Get the high-water mark for the CONVERSION_OBSTACK. */
6106 p
= conversion_obstack_alloc (0);
6108 result
= add_operator_candidates (&candidates
, code
, code2
, arglist
,
6110 if (result
== error_mark_node
)
6111 goto user_defined_result_ready
;
6117 /* For these, the built-in candidates set is empty
6118 [over.match.oper]/3. We don't want non-strict matches
6119 because exact matches are always possible with built-in
6120 operators. The built-in candidate set for COMPONENT_REF
6121 would be empty too, but since there are no such built-in
6122 operators, we accept non-strict matches for them. */
6131 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
6136 case POSTINCREMENT_EXPR
:
6137 case POSTDECREMENT_EXPR
:
6138 /* Don't try anything fancy if we're not allowed to produce
6140 if (!(complain
& tf_error
))
6141 return error_mark_node
;
6143 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
6144 distinguish between prefix and postfix ++ and
6145 operator++() was used for both, so we allow this with
6149 tree fnname
= ovl_op_identifier (ismodop
, ismodop
? code2
: code
);
6150 const char *msg
= (flag_permissive
)
6151 ? G_("no %<%D(int)%> declared for postfix %qs,"
6152 " trying prefix operator instead")
6153 : G_("no %<%D(int)%> declared for postfix %qs");
6154 permerror (loc
, msg
, fnname
, OVL_OP_INFO (false, code
)->name
);
6157 if (!flag_permissive
)
6158 return error_mark_node
;
6160 if (code
== POSTINCREMENT_EXPR
)
6161 code
= PREINCREMENT_EXPR
;
6163 code
= PREDECREMENT_EXPR
;
6164 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
6165 NULL_TREE
, overload
, complain
);
6168 /* The caller will deal with these. */
6173 result_valid_p
= true;
6177 if (complain
& tf_error
)
6179 /* If one of the arguments of the operator represents
6180 an invalid use of member function pointer, try to report
6181 a meaningful error ... */
6182 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
6183 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
6184 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
6185 /* We displayed the error message. */;
6188 /* ... Otherwise, report the more generic
6189 "no matching operator found" error */
6190 auto_diagnostic_group d
;
6191 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
6192 print_z_candidates (loc
, candidates
);
6195 result
= error_mark_node
;
6201 cand
= tourney (candidates
, complain
);
6204 if (complain
& tf_error
)
6206 auto_diagnostic_group d
;
6207 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
6208 print_z_candidates (loc
, candidates
);
6210 result
= error_mark_node
;
6212 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
6215 *overload
= cand
->fn
;
6217 if (resolve_args (arglist
, complain
) == NULL
)
6218 result
= error_mark_node
;
6221 if (cand
->reversed ())
6222 /* We swapped these in add_candidate, swap them back now. */
6223 std::swap (cand
->convs
[0], cand
->convs
[1]);
6224 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
6227 if (trivial_fn_p (cand
->fn
))
6228 /* There won't be a CALL_EXPR. */;
6229 else if (result
&& result
!= error_mark_node
)
6231 tree call
= extract_call_expr (result
);
6232 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
6234 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
6235 /* This prevents build_new_function_call from discarding this
6236 function during instantiation of the enclosing template. */
6237 KOENIG_LOOKUP_P (call
) = 1;
6239 /* Specify evaluation order as per P0145R2. */
6240 CALL_EXPR_ORDERED_ARGS (call
) = false;
6241 switch (op_is_ordered (code
))
6244 CALL_EXPR_REVERSE_ARGS (call
) = true;
6248 CALL_EXPR_ORDERED_ARGS (call
) = true;
6256 /* If this was a C++20 rewritten comparison, adjust the result. */
6257 if (cand
->rewritten ())
6259 /* FIXME build_min_non_dep_op_overload can't handle rewrites. */
6261 *overload
= NULL_TREE
;
6265 gcc_checking_assert (cand
->reversed ());
6268 /* If a rewritten operator== candidate is selected by
6269 overload resolution for an operator @, its return type
6270 shall be cv bool.... */
6271 if (TREE_CODE (TREE_TYPE (result
)) != BOOLEAN_TYPE
)
6273 if (complain
& tf_error
)
6275 auto_diagnostic_group d
;
6276 error_at (loc
, "return type of %qD is not %qs",
6278 inform (loc
, "used as rewritten candidate for "
6279 "comparison of %qT and %qT",
6280 arg1_type
, arg2_type
);
6282 result
= error_mark_node
;
6284 else if (code
== NE_EXPR
)
6285 /* !(y == x) or !(x == y) */
6286 result
= build1_loc (loc
, TRUTH_NOT_EXPR
,
6287 boolean_type_node
, result
);
6290 /* If a rewritten operator<=> candidate is selected by
6291 overload resolution for an operator @, x @ y is
6292 interpreted as 0 @ (y <=> x) if the selected candidate is
6293 a synthesized candidate with reversed order of parameters,
6294 or (x <=> y) @ 0 otherwise, using the selected rewritten
6295 operator<=> candidate. */
6296 case SPACESHIP_EXPR
:
6297 if (!cand
->reversed ())
6298 /* We're in the build_new_op call below for an outer
6299 reversed call; we don't need to do anything more. */
6308 tree rhs
= integer_zero_node
;
6309 if (cand
->reversed ())
6310 std::swap (lhs
, rhs
);
6311 result
= build_new_op (loc
, code
,
6312 LOOKUP_NORMAL
|LOOKUP_REWRITTEN
,
6313 lhs
, rhs
, NULL_TREE
,
6325 /* Give any warnings we noticed during overload resolution. */
6326 if (cand
->warnings
&& (complain
& tf_warning
))
6328 struct candidate_warning
*w
;
6329 for (w
= cand
->warnings
; w
; w
= w
->next
)
6330 joust (cand
, w
->loser
, 1, complain
);
6333 /* Check for comparison of different enum types. */
6342 if (TREE_CODE (arg1_type
) == ENUMERAL_TYPE
6343 && TREE_CODE (arg2_type
) == ENUMERAL_TYPE
6344 && (TYPE_MAIN_VARIANT (arg1_type
)
6345 != TYPE_MAIN_VARIANT (arg2_type
))
6346 && (complain
& tf_warning
))
6348 warning (OPT_Wenum_compare
,
6349 "comparison between %q#T and %q#T",
6350 arg1_type
, arg2_type
);
6357 /* "If a built-in candidate is selected by overload resolution, the
6358 operands of class type are converted to the types of the
6359 corresponding parameters of the selected operation function,
6360 except that the second standard conversion sequence of a
6361 user-defined conversion sequence (12.3.3.1.2) is not applied." */
6362 conv
= cand
->convs
[0];
6363 if (conv
->user_conv_p
)
6365 while (conv
->kind
!= ck_user
)
6366 conv
= next_conversion (conv
);
6367 arg1
= convert_like (conv
, arg1
, complain
);
6372 conv
= cand
->convs
[1];
6373 if (conv
->user_conv_p
)
6375 while (conv
->kind
!= ck_user
)
6376 conv
= next_conversion (conv
);
6377 arg2
= convert_like (conv
, arg2
, complain
);
6383 conv
= cand
->convs
[2];
6384 if (conv
->user_conv_p
)
6386 while (conv
->kind
!= ck_user
)
6387 conv
= next_conversion (conv
);
6388 arg3
= convert_like (conv
, arg3
, complain
);
6394 user_defined_result_ready
:
6396 /* Free all the conversions we allocated. */
6397 obstack_free (&conversion_obstack
, p
);
6399 if (result
|| result_valid_p
)
6406 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
6409 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
6411 case TRUTH_ANDIF_EXPR
:
6412 case TRUTH_ORIF_EXPR
:
6413 case TRUTH_AND_EXPR
:
6415 if (complain
& tf_warning
)
6416 warn_logical_operator (loc
, code
, boolean_type_node
,
6417 code_orig_arg1
, arg1
,
6418 code_orig_arg2
, arg2
);
6426 if ((complain
& tf_warning
)
6427 && ((code_orig_arg1
== BOOLEAN_TYPE
)
6428 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
6429 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
6430 if (complain
& tf_warning
&& warn_tautological_compare
)
6431 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
6433 case SPACESHIP_EXPR
:
6437 case TRUNC_DIV_EXPR
:
6442 case TRUNC_MOD_EXPR
:
6446 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
6448 case UNARY_PLUS_EXPR
:
6451 case TRUTH_NOT_EXPR
:
6452 case PREINCREMENT_EXPR
:
6453 case POSTINCREMENT_EXPR
:
6454 case PREDECREMENT_EXPR
:
6455 case POSTDECREMENT_EXPR
:
6459 return cp_build_unary_op (code
, arg1
, false, complain
);
6462 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
6465 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
6469 /* The caller will deal with these. */
6481 /* Wrapper for above. */
6484 build_new_op (const op_location_t
&loc
, enum tree_code code
, int flags
,
6485 tree arg1
, tree arg2
, tree arg3
,
6486 tree
*overload
, tsubst_flags_t complain
)
6489 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
6490 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
6491 overload
, complain
);
6492 timevar_cond_stop (TV_OVERLOAD
, subtime
);
6496 /* CALL was returned by some call-building function; extract the actual
6497 CALL_EXPR from any bits that have been tacked on, e.g. by
6498 convert_from_reference. */
6501 extract_call_expr (tree call
)
6503 while (TREE_CODE (call
) == COMPOUND_EXPR
)
6504 call
= TREE_OPERAND (call
, 1);
6505 if (REFERENCE_REF_P (call
))
6506 call
= TREE_OPERAND (call
, 0);
6507 if (TREE_CODE (call
) == TARGET_EXPR
)
6508 call
= TARGET_EXPR_INITIAL (call
);
6509 if (cxx_dialect
>= cxx2a
)
6510 switch (TREE_CODE (call
))
6512 /* C++20 rewritten comparison operators. */
6513 case TRUTH_NOT_EXPR
:
6514 call
= TREE_OPERAND (call
, 0);
6520 case SPACESHIP_EXPR
:
6522 tree op0
= TREE_OPERAND (call
, 0);
6523 if (integer_zerop (op0
))
6524 call
= TREE_OPERAND (call
, 1);
6532 gcc_assert (TREE_CODE (call
) == CALL_EXPR
6533 || TREE_CODE (call
) == AGGR_INIT_EXPR
6534 || call
== error_mark_node
);
6538 /* Returns true if FN has two parameters, of which the second has type
6542 second_parm_is_size_t (tree fn
)
6544 tree t
= FUNCTION_ARG_CHAIN (fn
);
6545 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6548 if (t
== void_list_node
)
6553 /* True if T, an allocation function, has std::align_val_t as its second
6557 aligned_allocation_fn_p (tree t
)
6559 if (!aligned_new_threshold
)
6562 tree a
= FUNCTION_ARG_CHAIN (t
);
6563 return (a
&& same_type_p (TREE_VALUE (a
), align_type_node
));
6566 /* True if T is std::destroying_delete_t. */
6569 std_destroying_delete_t_p (tree t
)
6571 return (TYPE_CONTEXT (t
) == std_node
6572 && id_equal (TYPE_IDENTIFIER (t
), "destroying_delete_t"));
6575 /* A deallocation function with at least two parameters whose second parameter
6576 type is of type std::destroying_delete_t is a destroying operator delete. A
6577 destroying operator delete shall be a class member function named operator
6578 delete. [ Note: Array deletion cannot use a destroying operator
6579 delete. --end note ] */
6582 destroying_delete_p (tree t
)
6584 tree a
= TYPE_ARG_TYPES (TREE_TYPE (t
));
6585 if (!a
|| !TREE_CHAIN (a
))
6587 tree type
= TREE_VALUE (TREE_CHAIN (a
));
6588 return std_destroying_delete_t_p (type
) ? type
: NULL_TREE
;
6598 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6599 function (3.7.4.2 [basic.stc.dynamic.deallocation]). If so, and DI is
6600 non-null, also set *DI. */
6603 usual_deallocation_fn_p (tree t
, dealloc_info
*di
)
6605 if (di
) *di
= dealloc_info();
6607 /* A template instance is never a usual deallocation function,
6608 regardless of its signature. */
6609 if (TREE_CODE (t
) == TEMPLATE_DECL
6610 || primary_template_specialization_p (t
))
6613 /* A usual deallocation function is a deallocation function whose parameters
6615 - optionally, a parameter of type std::destroying_delete_t, then
6616 - optionally, a parameter of type std::size_t, then
6617 - optionally, a parameter of type std::align_val_t. */
6618 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
6619 tree chain
= FUNCTION_ARG_CHAIN (t
);
6620 if (chain
&& destroying_delete_p (t
))
6622 if (di
) di
->destroying
= TREE_VALUE (chain
);
6623 chain
= TREE_CHAIN (chain
);
6626 && (!global
|| flag_sized_deallocation
)
6627 && same_type_p (TREE_VALUE (chain
), size_type_node
))
6629 if (di
) di
->sized
= true;
6630 chain
= TREE_CHAIN (chain
);
6632 if (chain
&& aligned_new_threshold
6633 && same_type_p (TREE_VALUE (chain
), align_type_node
))
6635 if (di
) di
->aligned
= true;
6636 chain
= TREE_CHAIN (chain
);
6638 return (chain
== void_list_node
);
6641 /* Just return whether FN is a usual deallocation function. */
6644 usual_deallocation_fn_p (tree fn
)
6646 return usual_deallocation_fn_p (fn
, NULL
);
6649 /* Build a call to operator delete. This has to be handled very specially,
6650 because the restrictions on what signatures match are different from all
6651 other call instances. For a normal delete, only a delete taking (void *)
6652 or (void *, size_t) is accepted. For a placement delete, only an exact
6653 match with the placement new is accepted.
6655 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6656 ADDR is the pointer to be deleted.
6657 SIZE is the size of the memory block to be deleted.
6658 GLOBAL_P is true if the delete-expression should not consider
6659 class-specific delete operators.
6660 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6662 If this call to "operator delete" is being generated as part to
6663 deallocate memory allocated via a new-expression (as per [expr.new]
6664 which requires that if the initialization throws an exception then
6665 we call a deallocation function), then ALLOC_FN is the allocation
6669 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
6670 bool global_p
, tree placement
,
6671 tree alloc_fn
, tsubst_flags_t complain
)
6673 tree fn
= NULL_TREE
;
6674 tree fns
, fnname
, type
, t
;
6675 dealloc_info di_fn
= { };
6677 if (addr
== error_mark_node
)
6678 return error_mark_node
;
6680 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6682 fnname
= ovl_op_identifier (false, code
);
6684 if (CLASS_TYPE_P (type
)
6685 && COMPLETE_TYPE_P (complete_type (type
))
6689 If the result of the lookup is ambiguous or inaccessible, or if
6690 the lookup selects a placement deallocation function, the
6691 program is ill-formed.
6693 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6695 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6696 if (fns
== error_mark_node
)
6697 return error_mark_node
;
6702 if (fns
== NULL_TREE
)
6703 fns
= lookup_name_nonclass (fnname
);
6705 /* Strip const and volatile from addr. */
6707 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6711 /* "A declaration of a placement deallocation function matches the
6712 declaration of a placement allocation function if it has the same
6713 number of parameters and, after parameter transformations (8.3.5),
6714 all parameter types except the first are identical."
6716 So we build up the function type we want and ask instantiate_type
6717 to get it for us. */
6718 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6719 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6720 t
= build_function_type (void_type_node
, t
);
6722 fn
= instantiate_type (t
, fns
, tf_none
);
6723 if (fn
== error_mark_node
)
6726 fn
= MAYBE_BASELINK_FUNCTIONS (fn
);
6728 /* "If the lookup finds the two-parameter form of a usual deallocation
6729 function (3.7.4.2) and that function, considered as a placement
6730 deallocation function, would have been selected as a match for the
6731 allocation function, the program is ill-formed." */
6732 if (second_parm_is_size_t (fn
))
6734 const char *const msg1
6735 = G_("exception cleanup for this placement new selects "
6736 "non-placement %<operator delete%>");
6737 const char *const msg2
6738 = G_("%qD is a usual (non-placement) deallocation "
6739 "function in C++14 (or with %<-fsized-deallocation%>)");
6741 /* But if the class has an operator delete (void *), then that is
6742 the usual deallocation function, so we shouldn't complain
6743 about using the operator delete (void *, size_t). */
6744 if (DECL_CLASS_SCOPE_P (fn
))
6745 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
));
6749 if (usual_deallocation_fn_p (elt
)
6750 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6753 /* Before C++14 a two-parameter global deallocation function is
6754 always a placement deallocation function, but warn if
6756 else if (!flag_sized_deallocation
)
6758 if (complain
& tf_warning
)
6760 auto_diagnostic_group d
;
6761 if (warning (OPT_Wc__14_compat
, msg1
))
6762 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6767 if (complain
& tf_warning_or_error
)
6769 auto_diagnostic_group d
;
6770 if (permerror (input_location
, msg1
))
6772 /* Only mention C++14 for namespace-scope delete. */
6773 if (DECL_NAMESPACE_SCOPE_P (fn
))
6774 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6776 inform (DECL_SOURCE_LOCATION (fn
),
6777 "%qD is a usual (non-placement) deallocation "
6782 return error_mark_node
;
6787 /* "Any non-placement deallocation function matches a non-placement
6788 allocation function. If the lookup finds a single matching
6789 deallocation function, that function will be called; otherwise, no
6790 deallocation function will be called." */
6791 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
)); iter
; ++iter
)
6794 dealloc_info di_elt
;
6795 if (usual_deallocation_fn_p (elt
, &di_elt
))
6804 /* -- If any of the deallocation functions is a destroying
6805 operator delete, all deallocation functions that are not
6806 destroying operator deletes are eliminated from further
6808 if (di_elt
.destroying
!= di_fn
.destroying
)
6810 if (di_elt
.destroying
)
6818 /* -- If the type has new-extended alignment, a function with a
6819 parameter of type std::align_val_t is preferred; otherwise a
6820 function without such a parameter is preferred. If exactly one
6821 preferred function is found, that function is selected and the
6822 selection process terminates. If more than one preferred
6823 function is found, all non-preferred functions are eliminated
6824 from further consideration. */
6825 if (aligned_new_threshold
)
6827 bool want_align
= type_has_new_extended_alignment (type
);
6828 if (di_elt
.aligned
!= di_fn
.aligned
)
6830 if (want_align
== di_elt
.aligned
)
6839 /* -- If the deallocation functions have class scope, the one
6840 without a parameter of type std::size_t is selected. */
6842 if (DECL_CLASS_SCOPE_P (fn
))
6845 /* -- If the type is complete and if, for the second alternative
6846 (delete array) only, the operand is a pointer to a class type
6847 with a non-trivial destructor or a (possibly multi-dimensional)
6848 array thereof, the function with a parameter of type std::size_t
6851 -- Otherwise, it is unspecified whether a deallocation function
6852 with a parameter of type std::size_t is selected. */
6855 want_size
= COMPLETE_TYPE_P (type
);
6856 if (code
== VEC_DELETE_EXPR
6857 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6858 /* We need a cookie to determine the array size. */
6861 gcc_assert (di_fn
.sized
!= di_elt
.sized
);
6862 if (want_size
== di_elt
.sized
)
6870 /* If we have a matching function, call it. */
6873 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6875 /* If the FN is a member function, make sure that it is
6877 if (BASELINK_P (fns
))
6878 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6881 /* Core issue 901: It's ok to new a type with deleted delete. */
6882 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6887 /* The placement args might not be suitable for overload
6888 resolution at this point, so build the call directly. */
6889 int nargs
= call_expr_nargs (placement
);
6890 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6893 for (i
= 1; i
< nargs
; i
++)
6894 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6895 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6896 return error_mark_node
;
6897 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6901 tree destroying
= di_fn
.destroying
;
6904 /* Strip const and volatile from addr but retain the type of the
6906 tree rtype
= TREE_TYPE (TREE_TYPE (oaddr
));
6907 rtype
= cv_unqualified (rtype
);
6908 rtype
= TYPE_POINTER_TO (rtype
);
6909 addr
= cp_convert (rtype
, oaddr
, complain
);
6910 destroying
= build_functional_cast (destroying
, NULL_TREE
,
6916 args
->quick_push (addr
);
6918 args
->quick_push (destroying
);
6920 args
->quick_push (size
);
6923 tree al
= build_int_cst (align_type_node
, TYPE_ALIGN_UNIT (type
));
6924 args
->quick_push (al
);
6926 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6933 If no unambiguous matching deallocation function can be found,
6934 propagating the exception does not cause the object's memory to
6938 if ((complain
& tf_warning
)
6940 warning (0, "no corresponding deallocation function for %qD",
6945 if (complain
& tf_error
)
6946 error ("no suitable %<operator %s%> for %qT",
6947 OVL_OP_INFO (false, code
)->name
, type
);
6948 return error_mark_node
;
6951 /* Issue diagnostics about a disallowed access of DECL, using DIAG_DECL
6954 If ISSUE_ERROR is true, then issue an error about the
6955 access, followed by a note showing the declaration.
6956 Otherwise, just show the note. */
6959 complain_about_access (tree decl
, tree diag_decl
, bool issue_error
)
6961 if (TREE_PRIVATE (decl
))
6964 error ("%q#D is private within this context", diag_decl
);
6965 inform (DECL_SOURCE_LOCATION (diag_decl
),
6966 "declared private here");
6968 else if (TREE_PROTECTED (decl
))
6971 error ("%q#D is protected within this context", diag_decl
);
6972 inform (DECL_SOURCE_LOCATION (diag_decl
),
6973 "declared protected here");
6978 error ("%q#D is inaccessible within this context", diag_decl
);
6979 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6983 /* If the current scope isn't allowed to access DECL along
6984 BASETYPE_PATH, give an error. The most derived class in
6985 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6986 the declaration to use in the error diagnostic. */
6989 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6990 tsubst_flags_t complain
, access_failure_info
*afi
)
6992 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6994 if (flag_new_inheriting_ctors
6995 && DECL_INHERITED_CTOR (decl
))
6997 /* 7.3.3/18: The additional constructors are accessible if they would be
6998 accessible when used to construct an object of the corresponding base
7000 decl
= strip_inheriting_ctors (decl
);
7001 basetype_path
= lookup_base (basetype_path
, DECL_CONTEXT (decl
),
7002 ba_any
, NULL
, complain
);
7005 if (!accessible_p (basetype_path
, decl
, true))
7007 if (flag_new_inheriting_ctors
)
7008 diag_decl
= strip_inheriting_ctors (diag_decl
);
7009 if (complain
& tf_error
)
7010 complain_about_access (decl
, diag_decl
, true);
7012 afi
->record_access_failure (basetype_path
, decl
, diag_decl
);
7019 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
7020 bitwise or of LOOKUP_* values. If any errors are warnings are
7021 generated, set *DIAGNOSTIC_FN to "error" or "warning",
7022 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
7026 build_temp (tree expr
, tree type
, int flags
,
7027 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
7031 *diagnostic_kind
= DK_UNSPECIFIED
;
7033 /* If the source is a packed field, calling the copy constructor will require
7034 binding the field to the reference parameter to the copy constructor, and
7035 we'll end up with an infinite loop. If we can use a bitwise copy, then
7037 if ((lvalue_kind (expr
) & clk_packed
)
7038 && CLASS_TYPE_P (TREE_TYPE (expr
))
7039 && !type_has_nontrivial_copy_init (TREE_TYPE (expr
)))
7040 return get_target_expr_sfinae (expr
, complain
);
7042 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
7043 releasing_vec
args (make_tree_vector_single (expr
));
7044 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
7045 &args
, type
, flags
, complain
);
7046 if (warningcount
+ werrorcount
> savew
)
7047 *diagnostic_kind
= DK_WARNING
;
7048 else if (errorcount
> savee
)
7049 *diagnostic_kind
= DK_ERROR
;
7053 /* Get any location for EXPR, falling back to input_location.
7055 If the result is in a system header and is the virtual location for
7056 a token coming from the expansion of a macro, unwind it to the
7057 location of the expansion point of the macro (e.g. to avoid the
7058 diagnostic being suppressed for expansions of NULL where "NULL" is
7059 in a system header). */
7062 get_location_for_expr_unwinding_for_system_header (tree expr
)
7064 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
7065 loc
= expansion_point_location_if_in_system_header (loc
);
7069 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
7070 Also handle a subset of zero as null warnings.
7071 EXPR is implicitly converted to type TOTYPE.
7072 FN and ARGNUM are used for diagnostics. */
7075 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
7077 /* Issue warnings about peculiar, but valid, uses of NULL. */
7078 if (TREE_CODE (totype
) != BOOLEAN_TYPE
7079 && ARITHMETIC_TYPE_P (totype
)
7080 && null_node_p (expr
))
7082 location_t loc
= get_location_for_expr_unwinding_for_system_header (expr
);
7085 auto_diagnostic_group d
;
7086 if (warning_at (loc
, OPT_Wconversion_null
,
7087 "passing NULL to non-pointer argument %P of %qD",
7089 inform (get_fndecl_argument_location (fn
, argnum
),
7093 warning_at (loc
, OPT_Wconversion_null
,
7094 "converting to non-pointer type %qT from NULL", totype
);
7097 /* Issue warnings if "false" is converted to a NULL pointer */
7098 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
7099 && TYPE_PTR_P (totype
))
7101 location_t loc
= get_location_for_expr_unwinding_for_system_header (expr
);
7104 auto_diagnostic_group d
;
7105 if (warning_at (loc
, OPT_Wconversion_null
,
7106 "converting %<false%> to pointer type for argument "
7107 "%P of %qD", argnum
, fn
))
7108 inform (get_fndecl_argument_location (fn
, argnum
),
7112 warning_at (loc
, OPT_Wconversion_null
,
7113 "converting %<false%> to pointer type %qT", totype
);
7115 /* Handle zero as null pointer warnings for cases other
7116 than EQ_EXPR and NE_EXPR */
7117 else if ((TYPE_PTR_OR_PTRMEM_P (totype
) || NULLPTR_TYPE_P (totype
))
7118 && null_ptr_cst_p (expr
))
7120 location_t loc
= get_location_for_expr_unwinding_for_system_header (expr
);
7121 maybe_warn_zero_as_null_pointer_constant (expr
, loc
);
7125 /* We gave a diagnostic during a conversion. If this was in the second
7126 standard conversion sequence of a user-defined conversion sequence, say
7127 which user-defined conversion. */
7130 maybe_print_user_conv_context (conversion
*convs
)
7132 if (convs
->user_conv_p
)
7133 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
7134 if (t
->kind
== ck_user
)
7136 print_z_candidate (0, N_(" after user-defined conversion:"),
7142 /* Locate the parameter with the given index within FNDECL.
7143 ARGNUM is zero based, -1 indicates the `this' argument of a method.
7144 Return the location of the FNDECL itself if there are problems. */
7147 get_fndecl_argument_location (tree fndecl
, int argnum
)
7149 /* The locations of implicitly-declared functions are likely to be
7150 more meaningful than those of their parameters. */
7151 if (DECL_ARTIFICIAL (fndecl
))
7152 return DECL_SOURCE_LOCATION (fndecl
);
7157 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
7158 for (i
= 0, param
= FUNCTION_FIRST_USER_PARM (fndecl
);
7159 i
< argnum
&& param
;
7160 i
++, param
= TREE_CHAIN (param
))
7163 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
7164 return the location of FNDECL. */
7166 return DECL_SOURCE_LOCATION (fndecl
);
7168 return DECL_SOURCE_LOCATION (param
);
7171 /* If FNDECL is non-NULL, issue a note highlighting ARGNUM
7172 within its declaration (or the fndecl itself if something went
7176 maybe_inform_about_fndecl_for_bogus_argument_init (tree fn
, int argnum
)
7179 inform (get_fndecl_argument_location (fn
, argnum
),
7180 " initializing argument %P of %qD", argnum
, fn
);
7183 /* Maybe warn about C++20 Conversions to arrays of unknown bound. C is
7184 the conversion, EXPR is the expression we're converting. */
7187 maybe_warn_array_conv (location_t loc
, conversion
*c
, tree expr
)
7189 if (cxx_dialect
>= cxx2a
)
7192 tree type
= TREE_TYPE (expr
);
7193 type
= strip_pointer_operator (type
);
7195 if (TREE_CODE (type
) != ARRAY_TYPE
7196 || TYPE_DOMAIN (type
) == NULL_TREE
)
7199 if (conv_binds_to_array_of_unknown_bound (c
))
7200 pedwarn (loc
, OPT_Wpedantic
, "conversions to arrays of unknown bound "
7201 "are only available with %<-std=c++2a%> or %<-std=gnu++2a%>");
7204 /* Perform the conversions in CONVS on the expression EXPR. FN and
7205 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
7206 indicates the `this' argument of a method. INNER is nonzero when
7207 being called to continue a conversion chain. It is negative when a
7208 reference binding will be applied, positive otherwise. If
7209 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
7210 conversions will be emitted if appropriate. If C_CAST_P is true,
7211 this conversion is coming from a C-style cast; in that case,
7212 conversions to inaccessible bases are permitted. */
7215 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
7216 bool issue_conversion_warnings
,
7217 bool c_cast_p
, tsubst_flags_t complain
)
7219 tree totype
= convs
->type
;
7220 diagnostic_t diag_kind
;
7222 location_t loc
= cp_expr_loc_or_input_loc (expr
);
7224 if (convs
->bad_p
&& !(complain
& tf_error
))
7225 return error_mark_node
;
7228 && convs
->kind
!= ck_user
7229 && convs
->kind
!= ck_list
7230 && convs
->kind
!= ck_ambig
7231 && (convs
->kind
!= ck_ref_bind
7232 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
7233 && (convs
->kind
!= ck_rvalue
7234 || SCALAR_TYPE_P (totype
))
7235 && convs
->kind
!= ck_base
)
7237 bool complained
= false;
7238 conversion
*t
= convs
;
7240 /* Give a helpful error if this is bad because of excess braces. */
7241 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
7242 && SCALAR_TYPE_P (totype
)
7243 && CONSTRUCTOR_NELTS (expr
) > 0
7244 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
7246 complained
= permerror (loc
, "too many braces around initializer "
7248 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
7249 && CONSTRUCTOR_NELTS (expr
) == 1)
7250 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7253 /* Give a helpful error if this is bad because a conversion to bool
7254 from std::nullptr_t requires direct-initialization. */
7255 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
7256 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
7257 complained
= permerror (loc
, "converting to %qH from %qI requires "
7258 "direct-initialization",
7259 totype
, TREE_TYPE (expr
));
7261 for (; t
; t
= next_conversion (t
))
7263 if (t
->kind
== ck_user
&& t
->cand
->reason
)
7265 auto_diagnostic_group d
;
7266 complained
= permerror (loc
, "invalid user-defined conversion "
7267 "from %qH to %qI", TREE_TYPE (expr
),
7270 print_z_candidate (loc
, N_("candidate is:"), t
->cand
);
7271 expr
= convert_like_real (t
, expr
, fn
, argnum
,
7272 /*issue_conversion_warnings=*/false,
7275 if (convs
->kind
== ck_ref_bind
)
7276 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
7277 LOOKUP_NORMAL
, NULL_TREE
,
7280 expr
= cp_convert (totype
, expr
, complain
);
7282 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7285 else if (t
->kind
== ck_user
|| !t
->bad_p
)
7287 expr
= convert_like_real (t
, expr
, fn
, argnum
,
7288 /*issue_conversion_warnings=*/false,
7293 else if (t
->kind
== ck_ambig
)
7294 return convert_like_real (t
, expr
, fn
, argnum
,
7295 /*issue_conversion_warnings=*/false,
7298 else if (t
->kind
== ck_identity
)
7303 range_label_for_type_mismatch
label (TREE_TYPE (expr
), totype
);
7304 gcc_rich_location
richloc (loc
, &label
);
7305 complained
= permerror (&richloc
,
7306 "invalid conversion from %qH to %qI",
7307 TREE_TYPE (expr
), totype
);
7310 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7312 return cp_convert (totype
, expr
, complain
);
7315 if (issue_conversion_warnings
&& (complain
& tf_warning
))
7316 conversion_null_warnings (totype
, expr
, fn
, argnum
);
7318 switch (convs
->kind
)
7322 struct z_candidate
*cand
= convs
->cand
;
7325 /* We chose the surrogate function from add_conv_candidate, now we
7326 actually need to build the conversion. */
7327 cand
= build_user_type_conversion_1 (totype
, expr
,
7328 LOOKUP_NO_CONVERSION
, complain
);
7330 tree convfn
= cand
->fn
;
7332 /* When converting from an init list we consider explicit
7333 constructors, but actually trying to call one is an error. */
7334 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
7335 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
7336 /* Unless this is for direct-list-initialization. */
7337 && (!CONSTRUCTOR_IS_DIRECT_INIT (expr
) || convs
->need_temporary_p
)
7338 /* And in C++98 a default constructor can't be explicit. */
7339 && cxx_dialect
>= cxx11
)
7341 if (!(complain
& tf_error
))
7342 return error_mark_node
;
7343 location_t loc
= location_of (expr
);
7344 if (CONSTRUCTOR_NELTS (expr
) == 0
7345 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
7347 auto_diagnostic_group d
;
7348 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
7349 "would use explicit constructor %qD",
7351 inform (loc
, "in C++11 and above a default constructor "
7355 error ("converting to %qT from initializer list would use "
7356 "explicit constructor %qD", totype
, convfn
);
7359 /* If we're initializing from {}, it's value-initialization. */
7360 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
7361 && CONSTRUCTOR_NELTS (expr
) == 0
7362 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
)
7363 && !processing_template_decl
)
7365 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
7366 if (abstract_virtuals_error_sfinae (NULL_TREE
, totype
, complain
))
7367 return error_mark_node
;
7368 expr
= build_value_init (totype
, complain
);
7369 expr
= get_target_expr_sfinae (expr
, complain
);
7370 if (expr
!= error_mark_node
)
7372 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7373 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
7378 /* We don't know here whether EXPR is being used as an lvalue or
7379 rvalue, but we know it's read. */
7380 mark_exp_read (expr
);
7382 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
7384 expr
= build_over_call (cand
, LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
,
7387 /* If this is a constructor or a function returning an aggr type,
7388 we need to build up a TARGET_EXPR. */
7389 if (DECL_CONSTRUCTOR_P (convfn
))
7391 expr
= build_cplus_new (totype
, expr
, complain
);
7393 /* Remember that this was list-initialization. */
7394 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
7395 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7401 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
7403 int nelts
= CONSTRUCTOR_NELTS (expr
);
7405 expr
= build_value_init (totype
, complain
);
7406 else if (nelts
== 1)
7407 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7411 expr
= mark_use (expr
, /*rvalue_p=*/!convs
->rvaluedness_matches_p
,
7412 /*read_p=*/true, UNKNOWN_LOCATION
,
7413 /*reject_builtin=*/true);
7415 if (type_unknown_p (expr
))
7416 expr
= instantiate_type (totype
, expr
, complain
);
7417 if (expr
== null_node
7418 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
7419 /* If __null has been converted to an integer type, we do not want to
7420 continue to warn about uses of EXPR as an integer, rather than as a
7422 expr
= build_int_cst (totype
, 0);
7425 /* We leave bad_p off ck_ambig because overload resolution considers
7426 it valid, it just fails when we try to perform it. So we need to
7427 check complain here, too. */
7428 if (complain
& tf_error
)
7430 /* Call build_user_type_conversion again for the error. */
7431 int flags
= (convs
->need_temporary_p
7432 ? LOOKUP_IMPLICIT
: LOOKUP_NORMAL
);
7433 build_user_type_conversion (totype
, convs
->u
.expr
, flags
, complain
);
7434 gcc_assert (seen_error ());
7435 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7437 return error_mark_node
;
7441 /* Conversion to std::initializer_list<T>. */
7442 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
7443 unsigned len
= CONSTRUCTOR_NELTS (expr
);
7448 tree val
; unsigned ix
;
7450 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
7452 /* Convert all the elements. */
7453 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
7455 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
,
7456 argnum
, false, false, complain
);
7457 if (sub
== error_mark_node
)
7459 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
7460 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
7461 return error_mark_node
;
7462 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
),
7464 if (!TREE_CONSTANT (sub
))
7465 TREE_CONSTANT (new_ctor
) = false;
7467 /* Build up the array. */
7468 elttype
= cp_build_qualified_type
7469 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
7470 array
= build_array_of_n_type (elttype
, len
);
7471 array
= finish_compound_literal (array
, new_ctor
, complain
);
7472 /* Take the address explicitly rather than via decay_conversion
7473 to avoid the error about taking the address of a temporary. */
7474 array
= cp_build_addr_expr (array
, complain
);
7477 array
= nullptr_node
;
7479 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
7480 if (array
== error_mark_node
)
7481 return error_mark_node
;
7483 /* Build up the initializer_list object. Note: fail gracefully
7484 if the object cannot be completed because, for example, no
7485 definition is provided (c++/80956). */
7486 totype
= complete_type_or_maybe_complain (totype
, NULL_TREE
, complain
);
7488 return error_mark_node
;
7489 tree field
= next_initializable_field (TYPE_FIELDS (totype
));
7490 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
7491 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
7492 field
= next_initializable_field (DECL_CHAIN (field
));
7493 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
7494 tree new_ctor
= build_constructor (totype
, vec
);
7495 return get_target_expr_sfinae (new_ctor
, complain
);
7499 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
7501 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7502 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
7503 real
= perform_implicit_conversion (TREE_TYPE (totype
),
7505 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
7507 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
7510 expr
= reshape_init (totype
, expr
, complain
);
7511 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
7513 if (expr
!= error_mark_node
)
7514 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7521 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
7522 convs
->kind
== ck_ref_bind
7523 ? issue_conversion_warnings
: false,
7524 c_cast_p
, complain
);
7525 if (expr
== error_mark_node
)
7526 return error_mark_node
;
7528 switch (convs
->kind
)
7531 expr
= decay_conversion (expr
, complain
);
7532 if (expr
== error_mark_node
)
7534 if (complain
& tf_error
)
7536 auto_diagnostic_group d
;
7537 maybe_print_user_conv_context (convs
);
7538 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7540 return error_mark_node
;
7543 if (! MAYBE_CLASS_TYPE_P (totype
))
7546 /* Don't introduce copies when passing arguments along to the inherited
7548 if (current_function_decl
7549 && flag_new_inheriting_ctors
7550 && DECL_INHERITED_CTOR (current_function_decl
))
7553 if (TREE_CODE (expr
) == TARGET_EXPR
7554 && TARGET_EXPR_LIST_INIT_P (expr
))
7555 /* Copy-list-initialization doesn't actually involve a copy. */
7560 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
7562 /* We are going to bind a reference directly to a base-class
7563 subobject of EXPR. */
7564 /* Build an expression for `*((base*) &expr)'. */
7565 expr
= convert_to_base (expr
, totype
,
7566 !c_cast_p
, /*nonnull=*/true, complain
);
7570 /* Copy-initialization where the cv-unqualified version of the source
7571 type is the same class as, or a derived class of, the class of the
7572 destination [is treated as direct-initialization]. [dcl.init] */
7573 flags
= LOOKUP_NORMAL
;
7574 if (convs
->user_conv_p
)
7575 /* This conversion is being done in the context of a user-defined
7576 conversion (i.e. the second step of copy-initialization), so
7577 don't allow any more. */
7578 flags
|= LOOKUP_NO_CONVERSION
;
7580 flags
|= LOOKUP_ONLYCONVERTING
;
7581 if (convs
->rvaluedness_matches_p
)
7582 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
7583 flags
|= LOOKUP_PREFER_RVALUE
;
7584 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
7585 if (diag_kind
&& complain
)
7587 auto_diagnostic_group d
;
7588 maybe_print_user_conv_context (convs
);
7589 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7592 return build_cplus_new (totype
, expr
, complain
);
7596 tree ref_type
= totype
;
7598 /* direct_reference_binding might have inserted a ck_qual under
7599 this ck_ref_bind for the benefit of conversion sequence ranking.
7600 Ignore the conversion; we'll create our own below. */
7601 if (next_conversion (convs
)->kind
== ck_qual
)
7603 gcc_assert (same_type_p (TREE_TYPE (expr
),
7604 next_conversion (convs
)->type
));
7605 /* Strip the cast created by the ck_qual; cp_build_addr_expr
7606 below expects an lvalue. */
7610 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
7612 tree extype
= TREE_TYPE (expr
);
7613 auto_diagnostic_group d
;
7614 if (TYPE_REF_IS_RVALUE (ref_type
)
7616 error_at (loc
, "cannot bind rvalue reference of type %qH to "
7617 "lvalue of type %qI", totype
, extype
);
7618 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
7619 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
7620 error_at (loc
, "cannot bind non-const lvalue reference of "
7621 "type %qH to an rvalue of type %qI", totype
, extype
);
7622 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
7624 /* If we're converting from T[] to T[N], don't talk
7625 about discarding qualifiers. (Converting from T[N] to
7626 T[] is allowed by P0388R4.) */
7627 if (TREE_CODE (extype
) == ARRAY_TYPE
7628 && TYPE_DOMAIN (extype
) == NULL_TREE
7629 && TREE_CODE (TREE_TYPE (totype
)) == ARRAY_TYPE
7630 && TYPE_DOMAIN (TREE_TYPE (totype
)) != NULL_TREE
)
7631 error_at (loc
, "cannot bind reference of type %qH to %qI "
7632 "due to different array bounds", totype
, extype
);
7634 error_at (loc
, "binding reference of type %qH to %qI "
7635 "discards qualifiers", totype
, extype
);
7639 maybe_print_user_conv_context (convs
);
7640 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7642 return error_mark_node
;
7644 else if (complain
& tf_warning
)
7645 maybe_warn_array_conv (loc
, convs
, expr
);
7647 /* If necessary, create a temporary.
7649 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7650 that need temporaries, even when their types are reference
7651 compatible with the type of reference being bound, so the
7652 upcoming call to cp_build_addr_expr doesn't fail. */
7653 if (convs
->need_temporary_p
7654 || TREE_CODE (expr
) == CONSTRUCTOR
7655 || TREE_CODE (expr
) == VA_ARG_EXPR
)
7657 /* Otherwise, a temporary of type "cv1 T1" is created and
7658 initialized from the initializer expression using the rules
7659 for a non-reference copy-initialization (8.5). */
7661 tree type
= TREE_TYPE (ref_type
);
7662 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
7664 gcc_assert (similar_type_p (type
, next_conversion (convs
)->type
));
7665 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
7666 && !TYPE_REF_IS_RVALUE (ref_type
))
7668 /* If the reference is volatile or non-const, we
7669 cannot create a temporary. */
7670 if (lvalue
& clk_bitfield
)
7671 error_at (loc
, "cannot bind bit-field %qE to %qT",
7673 else if (lvalue
& clk_packed
)
7674 error_at (loc
, "cannot bind packed field %qE to %qT",
7677 error_at (loc
, "cannot bind rvalue %qE to %qT",
7679 return error_mark_node
;
7681 /* If the source is a packed field, and we must use a copy
7682 constructor, then building the target expr will require
7683 binding the field to the reference parameter to the
7684 copy constructor, and we'll end up with an infinite
7685 loop. If we can use a bitwise copy, then we'll be
7687 if ((lvalue
& clk_packed
)
7688 && CLASS_TYPE_P (type
)
7689 && type_has_nontrivial_copy_init (type
))
7691 error_at (loc
, "cannot bind packed field %qE to %qT",
7693 return error_mark_node
;
7695 if (lvalue
& clk_bitfield
)
7697 expr
= convert_bitfield_to_declared_type (expr
);
7698 expr
= fold_convert (type
, expr
);
7700 expr
= build_target_expr_with_type (expr
, type
, complain
);
7703 /* Take the address of the thing to which we will bind the
7705 expr
= cp_build_addr_expr (expr
, complain
);
7706 if (expr
== error_mark_node
)
7707 return error_mark_node
;
7709 /* Convert it to a pointer to the type referred to by the
7710 reference. This will adjust the pointer if a derived to
7711 base conversion is being performed. */
7712 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
7714 /* Convert the pointer to the desired reference type. */
7715 return build_nop (ref_type
, expr
);
7719 return decay_conversion (expr
, complain
);
7722 /* ??? Should the address of a transaction-safe pointer point to the TM
7723 clone, and this conversion look up the primary function? */
7724 return build_nop (totype
, expr
);
7727 /* Warn about deprecated conversion if appropriate. */
7728 if (complain
& tf_warning
)
7730 string_conv_p (totype
, expr
, 1);
7731 maybe_warn_array_conv (loc
, convs
, expr
);
7737 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
7738 /*nonnull=*/false, complain
);
7739 return build_nop (totype
, expr
);
7742 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
7743 c_cast_p
, complain
);
7749 if (convs
->check_narrowing
7750 && !check_narrowing (totype
, expr
, complain
,
7751 convs
->check_narrowing_const_only
))
7752 return error_mark_node
;
7754 warning_sentinel
w (warn_zero_as_null_pointer_constant
);
7755 if (issue_conversion_warnings
)
7756 expr
= cp_convert_and_check (totype
, expr
, complain
);
7758 expr
= cp_convert (totype
, expr
, complain
);
7763 /* ARG is being passed to a varargs function. Perform any conversions
7764 required. Return the converted value. */
7767 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
7769 tree arg_type
= TREE_TYPE (arg
);
7770 location_t loc
= cp_expr_loc_or_input_loc (arg
);
7774 If the argument has integral or enumeration type that is subject
7775 to the integral promotions (_conv.prom_), or a floating-point
7776 type that is subject to the floating-point promotion
7777 (_conv.fpprom_), the value of the argument is converted to the
7778 promoted type before the call. */
7779 if (TREE_CODE (arg_type
) == REAL_TYPE
7780 && (TYPE_PRECISION (arg_type
)
7781 < TYPE_PRECISION (double_type_node
))
7782 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
7784 if ((complain
& tf_warning
)
7785 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
7786 warning_at (loc
, OPT_Wdouble_promotion
,
7787 "implicit conversion from %qH to %qI when passing "
7788 "argument to function",
7789 arg_type
, double_type_node
);
7790 arg
= convert_to_real_nofold (double_type_node
, arg
);
7792 else if (NULLPTR_TYPE_P (arg_type
))
7793 arg
= null_pointer_node
;
7794 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
7796 if (SCOPED_ENUM_P (arg_type
))
7798 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
7800 prom
= cp_perform_integral_promotions (prom
, complain
);
7801 if (abi_version_crosses (6)
7802 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
7803 && (complain
& tf_warning
))
7804 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through %<...%>"
7805 " as %qT before %<-fabi-version=6%>, %qT after",
7807 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
7808 if (!abi_version_at_least (6))
7812 arg
= cp_perform_integral_promotions (arg
, complain
);
7817 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7818 standard conversions are performed. */
7819 arg
= decay_conversion (arg
, complain
);
7821 arg
= require_complete_type_sfinae (arg
, complain
);
7822 arg_type
= TREE_TYPE (arg
);
7824 if (arg
!= error_mark_node
7825 /* In a template (or ill-formed code), we can have an incomplete type
7826 even after require_complete_type_sfinae, in which case we don't know
7827 whether it has trivial copy or not. */
7828 && COMPLETE_TYPE_P (arg_type
)
7829 && !cp_unevaluated_operand
)
7831 /* [expr.call] 5.2.2/7:
7832 Passing a potentially-evaluated argument of class type (Clause 9)
7833 with a non-trivial copy constructor or a non-trivial destructor
7834 with no corresponding parameter is conditionally-supported, with
7835 implementation-defined semantics.
7837 We support it as pass-by-invisible-reference, just like a normal
7840 If the call appears in the context of a sizeof expression,
7841 it is not potentially-evaluated. */
7842 if (type_has_nontrivial_copy_init (arg_type
)
7843 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
))
7845 arg
= force_rvalue (arg
, complain
);
7846 if (complain
& tf_warning
)
7847 warning (OPT_Wconditionally_supported
,
7848 "passing objects of non-trivially-copyable "
7849 "type %q#T through %<...%> is conditionally supported",
7851 return build1 (ADDR_EXPR
, build_reference_type (arg_type
), arg
);
7853 /* Build up a real lvalue-to-rvalue conversion in case the
7854 copy constructor is trivial but not callable. */
7855 else if (CLASS_TYPE_P (arg_type
))
7856 force_rvalue (arg
, complain
);
7863 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7866 build_x_va_arg (location_t loc
, tree expr
, tree type
)
7868 if (processing_template_decl
)
7870 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
7871 SET_EXPR_LOCATION (r
, loc
);
7875 type
= complete_type_or_else (type
, NULL_TREE
);
7877 if (expr
== error_mark_node
|| !type
)
7878 return error_mark_node
;
7880 expr
= mark_lvalue_use (expr
);
7882 if (TYPE_REF_P (type
))
7884 error ("cannot receive reference type %qT through %<...%>", type
);
7885 return error_mark_node
;
7888 if (type_has_nontrivial_copy_init (type
)
7889 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7891 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7892 it as pass by invisible reference. */
7893 warning_at (loc
, OPT_Wconditionally_supported
,
7894 "receiving objects of non-trivially-copyable type %q#T "
7895 "through %<...%> is conditionally-supported", type
);
7897 tree ref
= cp_build_reference_type (type
, false);
7898 expr
= build_va_arg (loc
, expr
, ref
);
7899 return convert_from_reference (expr
);
7902 tree ret
= build_va_arg (loc
, expr
, type
);
7903 if (CLASS_TYPE_P (type
))
7904 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7905 know how to handle it. */
7906 ret
= get_target_expr (ret
);
7910 /* TYPE has been given to va_arg. Apply the default conversions which
7911 would have happened when passed via ellipsis. Return the promoted
7912 type, or the passed type if there is no change. */
7915 cxx_type_promotes_to (tree type
)
7919 /* Perform the array-to-pointer and function-to-pointer
7921 type
= type_decays_to (type
);
7923 promote
= type_promotes_to (type
);
7924 if (same_type_p (type
, promote
))
7930 /* ARG is a default argument expression being passed to a parameter of
7931 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7932 zero-based argument number. Do any required conversions. Return
7933 the converted value. */
7935 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
7937 push_defarg_context (tree fn
)
7938 { vec_safe_push (default_arg_context
, fn
); }
7941 pop_defarg_context (void)
7942 { default_arg_context
->pop (); }
7945 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
7946 tsubst_flags_t complain
)
7951 /* See through clones. */
7952 fn
= DECL_ORIGIN (fn
);
7953 /* And inheriting ctors. */
7954 if (flag_new_inheriting_ctors
)
7955 fn
= strip_inheriting_ctors (fn
);
7957 /* Detect recursion. */
7958 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
7961 if (complain
& tf_error
)
7962 error ("recursive evaluation of default argument for %q#D", fn
);
7963 return error_mark_node
;
7966 /* If the ARG is an unparsed default argument expression, the
7967 conversion cannot be performed. */
7968 if (TREE_CODE (arg
) == DEFERRED_PARSE
)
7970 if (complain
& tf_error
)
7971 error ("call to %qD uses the default argument for parameter %P, which "
7972 "is not yet defined", fn
, parmnum
);
7973 return error_mark_node
;
7976 push_defarg_context (fn
);
7978 if (fn
&& DECL_TEMPLATE_INFO (fn
))
7979 arg
= tsubst_default_argument (fn
, parmnum
, type
, arg
, complain
);
7985 The names in the expression are bound, and the semantic
7986 constraints are checked, at the point where the default
7987 expressions appears.
7989 we must not perform access checks here. */
7990 push_deferring_access_checks (dk_no_check
);
7991 /* We must make a copy of ARG, in case subsequent processing
7992 alters any part of it. */
7993 arg
= break_out_target_exprs (arg
, /*clear location*/true);
7995 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
7996 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
7998 arg
= convert_for_arg_passing (type
, arg
, complain
);
7999 pop_deferring_access_checks();
8001 pop_defarg_context ();
8006 /* Returns the type which will really be used for passing an argument of
8010 type_passed_as (tree type
)
8012 /* Pass classes with copy ctors by invisible reference. */
8013 if (TREE_ADDRESSABLE (type
))
8015 type
= build_reference_type (type
);
8016 /* There are no other pointers to this temporary. */
8017 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
8019 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
8020 && INTEGRAL_TYPE_P (type
)
8021 && COMPLETE_TYPE_P (type
)
8022 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
8023 type
= integer_type_node
;
8028 /* Actually perform the appropriate conversion. */
8031 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
8035 /* If VAL is a bitfield, then -- since it has already been converted
8036 to TYPE -- it cannot have a precision greater than TYPE.
8038 If it has a smaller precision, we must widen it here. For
8039 example, passing "int f:3;" to a function expecting an "int" will
8040 not result in any conversion before this point.
8042 If the precision is the same we must not risk widening. For
8043 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
8044 often have type "int", even though the C++ type for the field is
8045 "long long". If the value is being passed to a function
8046 expecting an "int", then no conversions will be required. But,
8047 if we call convert_bitfield_to_declared_type, the bitfield will
8048 be converted to "long long". */
8049 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
8051 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
8052 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
8054 if (val
== error_mark_node
)
8056 /* Pass classes with copy ctors by invisible reference. */
8057 else if (TREE_ADDRESSABLE (type
))
8058 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
8059 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
8060 && INTEGRAL_TYPE_P (type
)
8061 && COMPLETE_TYPE_P (type
)
8062 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
8063 val
= cp_perform_integral_promotions (val
, complain
);
8064 if (complain
& tf_warning
)
8066 if (warn_suggest_attribute_format
)
8068 tree rhstype
= TREE_TYPE (val
);
8069 const enum tree_code coder
= TREE_CODE (rhstype
);
8070 const enum tree_code codel
= TREE_CODE (type
);
8071 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
8073 && check_missing_format_attribute (type
, rhstype
))
8074 warning (OPT_Wsuggest_attribute_format
,
8075 "argument of function call might be a candidate "
8076 "for a format attribute");
8078 maybe_warn_parm_abi (type
, cp_expr_loc_or_input_loc (val
));
8081 if (complain
& tf_warning
)
8082 warn_for_address_or_pointer_of_packed_member (type
, val
);
8087 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
8088 which just decay_conversion or no conversions at all should be done.
8089 This is true for some builtins which don't act like normal functions.
8090 Return 2 if no conversions at all should be done, 1 if just
8091 decay_conversion. Return 3 for special treatment of the 3rd argument
8092 for __builtin_*_overflow_p. */
8095 magic_varargs_p (tree fn
)
8097 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8098 switch (DECL_FUNCTION_CODE (fn
))
8100 case BUILT_IN_CLASSIFY_TYPE
:
8101 case BUILT_IN_CONSTANT_P
:
8102 case BUILT_IN_NEXT_ARG
:
8103 case BUILT_IN_VA_START
:
8106 case BUILT_IN_ADD_OVERFLOW_P
:
8107 case BUILT_IN_SUB_OVERFLOW_P
:
8108 case BUILT_IN_MUL_OVERFLOW_P
:
8112 return lookup_attribute ("type generic",
8113 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
8119 /* Returns the decl of the dispatcher function if FN is a function version. */
8122 get_function_version_dispatcher (tree fn
)
8124 tree dispatcher_decl
= NULL
;
8126 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
8127 && DECL_FUNCTION_VERSIONED (fn
));
8129 gcc_assert (targetm
.get_function_versions_dispatcher
);
8130 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
8132 if (dispatcher_decl
== NULL
)
8134 error_at (input_location
, "use of multiversioned function "
8135 "without a default");
8139 retrofit_lang_decl (dispatcher_decl
);
8140 gcc_assert (dispatcher_decl
!= NULL
);
8141 return dispatcher_decl
;
8144 /* fn is a function version dispatcher that is marked used. Mark all the
8145 semantically identical function versions it will dispatch as used. */
8148 mark_versions_used (tree fn
)
8150 struct cgraph_node
*node
;
8151 struct cgraph_function_version_info
*node_v
;
8152 struct cgraph_function_version_info
*it_v
;
8154 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
8156 node
= cgraph_node::get (fn
);
8160 gcc_assert (node
->dispatcher_function
);
8162 node_v
= node
->function_version ();
8166 /* All semantically identical versions are chained. Traverse and mark each
8167 one of them as used. */
8168 it_v
= node_v
->next
;
8169 while (it_v
!= NULL
)
8171 mark_used (it_v
->this_node
->decl
);
8176 /* Build a call to "the copy constructor" for the type of A, even if it
8177 wouldn't be selected by normal overload resolution. Used for
8181 call_copy_ctor (tree a
, tsubst_flags_t complain
)
8183 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
8184 tree binfo
= TYPE_BINFO (ctype
);
8185 tree copy
= get_copy_ctor (ctype
, complain
);
8186 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
8187 tree ob
= build_dummy_object (ctype
);
8188 releasing_vec
args (make_tree_vector_single (a
));
8189 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
8190 LOOKUP_NORMAL
, NULL
, complain
);
8194 /* Return true iff T refers to a base field. */
8197 is_base_field_ref (tree t
)
8200 if (TREE_CODE (t
) == ADDR_EXPR
)
8201 t
= TREE_OPERAND (t
, 0);
8202 if (TREE_CODE (t
) == COMPONENT_REF
)
8203 t
= TREE_OPERAND (t
, 1);
8204 if (TREE_CODE (t
) == FIELD_DECL
)
8205 return DECL_FIELD_IS_BASE (t
);
8209 /* We can't elide a copy from a function returning by value to a base
8210 subobject, as the callee might clobber tail padding. Return true iff this
8211 could be that case. */
8214 unsafe_copy_elision_p (tree target
, tree exp
)
8216 /* Copy elision only happens with a TARGET_EXPR. */
8217 if (TREE_CODE (exp
) != TARGET_EXPR
)
8219 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
8220 /* It's safe to elide the copy for a class with no tail padding. */
8221 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
8223 /* It's safe to elide the copy if we aren't initializing a base object. */
8224 if (!is_base_field_ref (target
))
8226 tree init
= TARGET_EXPR_INITIAL (exp
);
8227 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
8228 while (TREE_CODE (init
) == COMPOUND_EXPR
)
8229 init
= TREE_OPERAND (init
, 1);
8230 if (TREE_CODE (init
) == COND_EXPR
)
8232 /* We'll end up copying from each of the arms of the COND_EXPR directly
8233 into the target, so look at them. */
8234 if (tree op
= TREE_OPERAND (init
, 1))
8235 if (unsafe_copy_elision_p (target
, op
))
8237 return unsafe_copy_elision_p (target
, TREE_OPERAND (init
, 2));
8239 return (TREE_CODE (init
) == AGGR_INIT_EXPR
8240 && !AGGR_INIT_VIA_CTOR_P (init
));
8243 /* True iff C is a conversion that binds a reference to a prvalue. */
8246 conv_binds_ref_to_prvalue (conversion
*c
)
8248 if (c
->kind
!= ck_ref_bind
)
8250 if (c
->need_temporary_p
)
8253 c
= next_conversion (c
);
8255 if (c
->kind
== ck_rvalue
)
8257 if (c
->kind
== ck_user
&& !TYPE_REF_P (c
->type
))
8259 if (c
->kind
== ck_identity
&& c
->u
.expr
8260 && TREE_CODE (c
->u
.expr
) == TARGET_EXPR
)
8266 /* Call the trivial destructor for INSTANCE, which can be either an lvalue of
8267 class type or a pointer to class type. */
8270 build_trivial_dtor_call (tree instance
)
8272 gcc_assert (!is_dummy_object (instance
));
8274 if (!flag_lifetime_dse
)
8277 return fold_convert (void_type_node
, instance
);
8280 if (INDIRECT_TYPE_P (TREE_TYPE (instance
)))
8282 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
8284 instance
= cp_build_fold_indirect_ref (instance
);
8287 /* A trivial destructor should still clobber the object. */
8288 tree clobber
= build_clobber (TREE_TYPE (instance
));
8289 return build2 (MODIFY_EXPR
, void_type_node
,
8293 /* Subroutine of the various build_*_call functions. Overload resolution
8294 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
8295 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
8296 bitmask of various LOOKUP_* flags which apply to the call itself. */
8299 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
8302 const vec
<tree
, va_gc
> *args
= cand
->args
;
8303 tree first_arg
= cand
->first_arg
;
8304 conversion
**convs
= cand
->convs
;
8306 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
8311 unsigned int arg_index
= 0;
8315 bool already_used
= false;
8317 /* In a template, there is no need to perform all of the work that
8318 is normally done. We are only interested in the type of the call
8319 expression, i.e., the return type of the function. Any semantic
8320 errors will be deferred until the template is instantiated. */
8321 if (processing_template_decl
)
8325 const tree
*argarray
;
8328 if (undeduced_auto_decl (fn
))
8329 mark_used (fn
, complain
);
8331 /* Otherwise set TREE_USED for the benefit of -Wunused-function.
8335 return_type
= TREE_TYPE (TREE_TYPE (fn
));
8336 nargs
= vec_safe_length (args
);
8337 if (first_arg
== NULL_TREE
)
8338 argarray
= args
->address ();
8346 alcarray
= XALLOCAVEC (tree
, nargs
);
8347 alcarray
[0] = build_this (first_arg
);
8348 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
8349 alcarray
[ix
+ 1] = arg
;
8350 argarray
= alcarray
;
8353 addr
= build_addr_func (fn
, complain
);
8354 if (addr
== error_mark_node
)
8355 return error_mark_node
;
8356 expr
= build_call_array_loc (input_location
, return_type
,
8357 addr
, nargs
, argarray
);
8358 if (TREE_THIS_VOLATILE (fn
) && cfun
)
8359 current_function_returns_abnormally
= 1;
8360 if (TREE_CODE (fn
) == FUNCTION_DECL
8361 && DECL_IMMEDIATE_FUNCTION_P (fn
)
8362 && (current_function_decl
== NULL_TREE
8363 || !DECL_IMMEDIATE_FUNCTION_P (current_function_decl
))
8364 && (current_binding_level
->kind
!= sk_function_parms
8365 || !current_binding_level
->immediate_fn_ctx_p
))
8367 tree obj_arg
= NULL_TREE
, exprimm
= expr
;
8368 if (DECL_CONSTRUCTOR_P (fn
))
8369 obj_arg
= first_arg
;
8371 && is_dummy_object (obj_arg
)
8372 && !type_dependent_expression_p (obj_arg
))
8374 exprimm
= build_cplus_new (DECL_CONTEXT (fn
), expr
, complain
);
8375 obj_arg
= NULL_TREE
;
8377 /* Look through *(const T *)&obj. */
8378 else if (obj_arg
&& TREE_CODE (obj_arg
) == INDIRECT_REF
)
8380 tree addr
= TREE_OPERAND (obj_arg
, 0);
8382 if (TREE_CODE (addr
) == ADDR_EXPR
)
8384 tree typeo
= TREE_TYPE (obj_arg
);
8385 tree typei
= TREE_TYPE (TREE_OPERAND (addr
, 0));
8386 if (same_type_ignoring_top_level_qualifiers_p (typeo
, typei
))
8387 obj_arg
= TREE_OPERAND (addr
, 0);
8390 fold_non_dependent_expr (exprimm
, complain
,
8391 /*manifestly_const_eval=*/true,
8394 return convert_from_reference (expr
);
8397 /* Give any warnings we noticed during overload resolution. */
8398 if (cand
->warnings
&& (complain
& tf_warning
))
8400 struct candidate_warning
*w
;
8401 for (w
= cand
->warnings
; w
; w
= w
->next
)
8402 joust (cand
, w
->loser
, 1, complain
);
8405 /* Core issue 2327: P0135 doesn't say how to handle the case where the
8406 argument to the copy constructor ends up being a prvalue after
8407 conversion. Let's do the normal processing, but pretend we aren't
8408 actually using the copy constructor. */
8409 bool force_elide
= false;
8410 if (cxx_dialect
>= cxx17
8411 && cand
->num_convs
== 1
8412 && DECL_COMPLETE_CONSTRUCTOR_P (fn
)
8413 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8414 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8415 && conv_binds_ref_to_prvalue (convs
[0]))
8418 goto not_really_used
;
8421 /* OK, we're actually calling this inherited constructor; set its deletedness
8422 appropriately. We can get away with doing this here because calling is
8423 the only way to refer to a constructor. */
8424 if (DECL_INHERITED_CTOR (fn
))
8425 deduce_inheriting_ctor (fn
);
8427 /* Make =delete work with SFINAE. */
8428 if (DECL_DELETED_FN (fn
))
8430 if (complain
& tf_error
)
8432 return error_mark_node
;
8435 if (DECL_FUNCTION_MEMBER_P (fn
))
8438 /* If FN is a template function, two cases must be considered.
8443 template <class T> void f();
8445 template <class T> struct B {
8449 struct C : A, B<int> {
8451 using B<int>::g; // #2
8454 In case #1 where `A::f' is a member template, DECL_ACCESS is
8455 recorded in the primary template but not in its specialization.
8456 We check access of FN using its primary template.
8458 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
8459 because it is a member of class template B, DECL_ACCESS is
8460 recorded in the specialization `B<int>::g'. We cannot use its
8461 primary template because `B<T>::g' and `B<int>::g' may have
8462 different access. */
8463 if (DECL_TEMPLATE_INFO (fn
)
8464 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
8465 access_fn
= DECL_TI_TEMPLATE (fn
);
8468 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
8470 return error_mark_node
;
8473 /* If we're checking for implicit delete, don't bother with argument
8475 if (flags
& LOOKUP_SPECULATIVE
)
8477 if (cand
->viable
== 1)
8479 else if (!(complain
& tf_error
))
8480 /* Reject bad conversions now. */
8481 return error_mark_node
;
8482 /* else continue to get conversion error. */
8487 /* N3276 magic doesn't apply to nested calls. */
8488 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
8489 complain
&= ~tf_decltype
;
8490 /* No-Cleanup doesn't apply to nested calls either. */
8491 tsubst_flags_t no_cleanup_complain
= complain
;
8492 complain
&= ~tf_no_cleanup
;
8494 /* Find maximum size of vector to hold converted arguments. */
8495 parmlen
= list_length (parm
);
8496 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
8497 if (parmlen
> nargs
)
8499 argarray
= XALLOCAVEC (tree
, nargs
);
8501 /* The implicit parameters to a constructor are not considered by overload
8502 resolution, and must be of the proper type. */
8503 if (DECL_CONSTRUCTOR_P (fn
))
8506 if (first_arg
!= NULL_TREE
)
8508 object_arg
= first_arg
;
8509 first_arg
= NULL_TREE
;
8513 object_arg
= (*args
)[arg_index
];
8516 argarray
[j
++] = build_this (object_arg
);
8517 parm
= TREE_CHAIN (parm
);
8518 /* We should never try to call the abstract constructor. */
8519 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
8521 if (DECL_HAS_VTT_PARM_P (fn
))
8523 argarray
[j
++] = (*args
)[arg_index
];
8525 parm
= TREE_CHAIN (parm
);
8528 if (flags
& LOOKUP_PREFER_RVALUE
)
8530 /* The implicit move specified in 15.8.3/3 fails "...if the type of
8531 the first parameter of the selected constructor is not an rvalue
8532 reference to the object's type (possibly cv-qualified)...." */
8533 gcc_assert (!(complain
& tf_error
));
8534 tree ptype
= convs
[0]->type
;
8535 if (!TYPE_REF_P (ptype
)
8536 || !TYPE_REF_IS_RVALUE (ptype
)
8537 || CONVERSION_RANK (convs
[0]) > cr_exact
)
8538 return error_mark_node
;
8541 /* Bypass access control for 'this' parameter. */
8542 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
8544 tree parmtype
= TREE_VALUE (parm
);
8545 tree arg
= build_this (first_arg
!= NULL_TREE
8547 : (*args
)[arg_index
]);
8548 tree argtype
= TREE_TYPE (arg
);
8552 if (arg
== error_mark_node
)
8553 return error_mark_node
;
8555 if (convs
[i
]->bad_p
)
8557 if (complain
& tf_error
)
8559 auto_diagnostic_group d
;
8560 if (permerror (input_location
, "passing %qT as %<this%> "
8561 "argument discards qualifiers",
8562 TREE_TYPE (argtype
)))
8563 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
8566 return error_mark_node
;
8569 /* Optimize away vtable lookup if we know that this
8570 function can't be overridden. We need to check if
8571 the context and the type where we found fn are the same,
8572 actually FN might be defined in a different class
8573 type because of a using-declaration. In this case, we
8574 do not want to perform a non-virtual call. Note that
8575 resolves_to_fixed_type_p checks CLASSTYPE_FINAL too. */
8576 if (DECL_FINAL_P (fn
)
8577 || (resolves_to_fixed_type_p (arg
, 0)
8578 && same_type_ignoring_top_level_qualifiers_p
8579 (DECL_CONTEXT (fn
), BINFO_TYPE (cand
->conversion_path
))))
8580 flags
|= LOOKUP_NONVIRTUAL
;
8582 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
8583 X is called for an object that is not of type X, or of a type
8584 derived from X, the behavior is undefined.
8586 So we can assume that anything passed as 'this' is non-null, and
8587 optimize accordingly. */
8588 gcc_assert (TYPE_PTR_P (parmtype
));
8589 /* Convert to the base in which the function was declared. */
8590 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
8591 converted_arg
= build_base_path (PLUS_EXPR
,
8593 cand
->conversion_path
,
8595 /* Check that the base class is accessible. */
8596 if (!accessible_base_p (TREE_TYPE (argtype
),
8597 BINFO_TYPE (cand
->conversion_path
), true))
8599 if (complain
& tf_error
)
8600 error ("%qT is not an accessible base of %qT",
8601 BINFO_TYPE (cand
->conversion_path
),
8602 TREE_TYPE (argtype
));
8604 return error_mark_node
;
8606 /* If fn was found by a using declaration, the conversion path
8607 will be to the derived class, not the base declaring fn. We
8608 must convert from derived to base. */
8609 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
8610 TREE_TYPE (parmtype
), ba_unique
,
8612 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
8613 base_binfo
, 1, complain
);
8615 argarray
[j
++] = converted_arg
;
8616 parm
= TREE_CHAIN (parm
);
8617 if (first_arg
!= NULL_TREE
)
8618 first_arg
= NULL_TREE
;
8625 gcc_assert (first_arg
== NULL_TREE
);
8626 for (; arg_index
< vec_safe_length (args
) && parm
;
8627 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
8629 tree type
= TREE_VALUE (parm
);
8630 tree arg
= (*args
)[arg_index
];
8631 bool conversion_warning
= true;
8635 /* If the argument is NULL and used to (implicitly) instantiate a
8636 template function (and bind one of the template arguments to
8637 the type of 'long int'), we don't want to warn about passing NULL
8638 to non-pointer argument.
8639 For example, if we have this template function:
8641 template<typename T> void func(T x) {}
8643 we want to warn (when -Wconversion is enabled) in this case:
8649 but not in this case:
8655 if (null_node_p (arg
)
8656 && DECL_TEMPLATE_INFO (fn
)
8657 && cand
->template_decl
8658 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
8659 conversion_warning
= false;
8661 /* Set user_conv_p on the argument conversions, so rvalue/base handling
8662 knows not to allow any more UDCs. This needs to happen after we
8663 process cand->warnings. */
8664 if (flags
& LOOKUP_NO_CONVERSION
)
8665 conv
->user_conv_p
= true;
8667 tsubst_flags_t arg_complain
= complain
;
8668 if (!conversion_warning
)
8669 arg_complain
&= ~tf_warning
;
8671 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
8673 val
= convert_for_arg_passing (type
, val
, arg_complain
);
8675 if (val
== error_mark_node
)
8676 return error_mark_node
;
8678 argarray
[j
++] = val
;
8681 /* Default arguments */
8682 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
8684 if (TREE_VALUE (parm
) == error_mark_node
)
8685 return error_mark_node
;
8686 val
= convert_default_arg (TREE_VALUE (parm
),
8687 TREE_PURPOSE (parm
),
8690 if (val
== error_mark_node
)
8691 return error_mark_node
;
8692 argarray
[j
++] = val
;
8696 int magic
= magic_varargs_p (fn
);
8697 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
8699 tree a
= (*args
)[arg_index
];
8700 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
8702 /* Do no conversions for certain magic varargs. */
8703 a
= mark_type_use (a
);
8704 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
8705 return error_mark_node
;
8707 else if (magic
!= 0)
8708 /* For other magic varargs only do decay_conversion. */
8709 a
= decay_conversion (a
, complain
);
8710 else if (DECL_CONSTRUCTOR_P (fn
)
8711 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
8714 /* Avoid infinite recursion trying to call A(...). */
8715 if (complain
& tf_error
)
8716 /* Try to call the actual copy constructor for a good error. */
8717 call_copy_ctor (a
, complain
);
8718 return error_mark_node
;
8721 a
= convert_arg_to_ellipsis (a
, complain
);
8722 if (a
== error_mark_node
)
8723 return error_mark_node
;
8727 gcc_assert (j
<= nargs
);
8730 /* Avoid to do argument-transformation, if warnings for format, and for
8731 nonnull are disabled. Just in case that at least one of them is active
8732 the check_function_arguments function might warn about something. */
8734 bool warned_p
= false;
8737 || warn_suggest_attribute_format
8740 tree
*fargs
= (!nargs
? argarray
8741 : (tree
*) alloca (nargs
* sizeof (tree
)));
8742 for (j
= 0; j
< nargs
; j
++)
8744 /* For -Wformat undo the implicit passing by hidden reference
8745 done by convert_arg_to_ellipsis. */
8746 if (TREE_CODE (argarray
[j
]) == ADDR_EXPR
8747 && TYPE_REF_P (TREE_TYPE (argarray
[j
])))
8748 fargs
[j
] = TREE_OPERAND (argarray
[j
], 0);
8750 fargs
[j
] = argarray
[j
];
8753 warned_p
= check_function_arguments (input_location
, fn
, TREE_TYPE (fn
),
8754 nargs
, fargs
, NULL
);
8757 if (DECL_INHERITED_CTOR (fn
))
8759 /* Check for passing ellipsis arguments to an inherited constructor. We
8760 could handle this by open-coding the inherited constructor rather than
8761 defining it, but let's not bother now. */
8762 if (!cp_unevaluated_operand
8764 && cand
->convs
[cand
->num_convs
-1]->ellipsis_p
)
8766 if (complain
& tf_error
)
8768 sorry ("passing arguments to ellipsis of inherited constructor "
8770 inform (DECL_SOURCE_LOCATION (cand
->fn
), "declared here");
8772 return error_mark_node
;
8775 /* A base constructor inheriting from a virtual base doesn't get the
8776 inherited arguments, just this and __vtt. */
8777 if (ctor_omit_inherited_parms (fn
))
8781 /* Avoid actually calling copy constructors and copy assignment operators,
8784 if (! flag_elide_constructors
&& !force_elide
)
8785 /* Do things the hard way. */;
8786 else if (cand
->num_convs
== 1
8787 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8788 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8789 /* It's unsafe to elide the constructor when handling
8790 a noexcept-expression, it may evaluate to the wrong
8791 value (c++/53025). */
8792 && (force_elide
|| cp_noexcept_operand
== 0))
8795 tree arg
= argarray
[num_artificial_parms_for (fn
)];
8797 bool trivial
= trivial_fn_p (fn
);
8799 /* Pull out the real argument, disregarding const-correctness. */
8801 /* Strip the reference binding for the constructor parameter. */
8802 if (CONVERT_EXPR_P (targ
)
8803 && TYPE_REF_P (TREE_TYPE (targ
)))
8804 targ
= TREE_OPERAND (targ
, 0);
8805 /* But don't strip any other reference bindings; binding a temporary to a
8806 reference prevents copy elision. */
8807 while ((CONVERT_EXPR_P (targ
)
8808 && !TYPE_REF_P (TREE_TYPE (targ
)))
8809 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
8810 targ
= TREE_OPERAND (targ
, 0);
8811 if (TREE_CODE (targ
) == ADDR_EXPR
)
8813 targ
= TREE_OPERAND (targ
, 0);
8814 if (!same_type_ignoring_top_level_qualifiers_p
8815 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
8824 arg
= cp_build_fold_indirect_ref (arg
);
8826 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8828 if (CHECKING_P
&& cxx_dialect
>= cxx17
)
8829 gcc_assert (TREE_CODE (arg
) != TARGET_EXPR
8831 /* It's from binding the ref parm to a packed field. */
8832 || convs
[0]->need_temporary_p
8834 /* See unsafe_copy_elision_p. */
8835 || DECL_BASE_CONSTRUCTOR_P (fn
));
8838 bool unsafe
= unsafe_copy_elision_p (fa
, arg
);
8839 bool eliding_temp
= (TREE_CODE (arg
) == TARGET_EXPR
&& !unsafe
);
8841 /* [class.copy]: the copy constructor is implicitly defined even if the
8842 implementation elided its use. But don't warn about deprecation when
8843 eliding a temporary, as then no copy is actually performed. */
8844 warning_sentinel
s (warn_deprecated_copy
, eliding_temp
);
8846 /* The language says this isn't called. */;
8849 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
8850 return error_mark_node
;
8851 already_used
= true;
8854 cp_warn_deprecated_use (fn
, complain
);
8856 /* If we're creating a temp and we already have one, don't create a
8857 new one. If we're not creating a temp but we get one, use
8858 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8859 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8860 temp or an INIT_EXPR otherwise. */
8861 if (is_dummy_object (fa
))
8863 if (TREE_CODE (arg
) == TARGET_EXPR
)
8866 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
8868 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
8871 tree to
= cp_stabilize_reference (cp_build_fold_indirect_ref (fa
));
8873 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
8877 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
8878 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
)
8879 && trivial_fn_p (fn
))
8881 tree to
= cp_stabilize_reference
8882 (cp_build_fold_indirect_ref (argarray
[0]));
8883 tree type
= TREE_TYPE (to
);
8884 tree as_base
= CLASSTYPE_AS_BASE (type
);
8885 tree arg
= argarray
[1];
8886 location_t loc
= cp_expr_loc_or_input_loc (arg
);
8888 if (is_really_empty_class (type
, /*ignore_vptr*/true))
8890 /* Avoid copying empty classes. */
8891 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
8892 TREE_NO_WARNING (val
) = 1;
8894 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
8896 if (is_std_init_list (type
)
8897 && conv_binds_ref_to_prvalue (convs
[1]))
8898 warning_at (loc
, OPT_Winit_list_lifetime
,
8899 "assignment from temporary %<initializer_list%> does "
8900 "not extend the lifetime of the underlying array");
8901 arg
= cp_build_fold_indirect_ref (arg
);
8902 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
8906 /* We must only copy the non-tail padding parts. */
8908 tree array_type
, alias_set
;
8910 arg2
= TYPE_SIZE_UNIT (as_base
);
8911 arg0
= cp_build_addr_expr (to
, complain
);
8913 array_type
= build_array_type (unsigned_char_type_node
,
8915 (size_binop (MINUS_EXPR
,
8916 arg2
, size_int (1))));
8917 alias_set
= build_int_cst (build_pointer_type (type
), 0);
8918 t
= build2 (MODIFY_EXPR
, void_type_node
,
8919 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
8920 build2 (MEM_REF
, array_type
, arg
, alias_set
));
8921 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
8922 TREE_NO_WARNING (val
) = 1;
8925 cp_warn_deprecated_use (fn
, complain
);
8929 else if (trivial_fn_p (fn
))
8931 if (DECL_DESTRUCTOR_P (fn
))
8932 return build_trivial_dtor_call (argarray
[0]);
8933 else if (default_ctor_p (fn
))
8935 if (is_dummy_object (argarray
[0]))
8936 return force_target_expr (DECL_CONTEXT (fn
), void_node
,
8937 no_cleanup_complain
);
8939 return cp_build_fold_indirect_ref (argarray
[0]);
8943 gcc_assert (!force_elide
);
8946 && !mark_used (fn
, complain
))
8947 return error_mark_node
;
8949 /* Warn if the built-in writes to an object of a non-trivial type. */
8950 if (warn_class_memaccess
8951 && vec_safe_length (args
) >= 2
8952 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8953 maybe_warn_class_memaccess (input_location
, fn
, args
);
8955 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
8958 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
8960 ba_any
, NULL
, complain
);
8961 gcc_assert (binfo
&& binfo
!= error_mark_node
);
8963 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
8965 if (TREE_SIDE_EFFECTS (argarray
[0]))
8966 argarray
[0] = save_expr (argarray
[0]);
8967 t
= build_pointer_type (TREE_TYPE (fn
));
8968 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
8973 fn
= build_addr_func (fn
, complain
);
8974 if (fn
== error_mark_node
)
8975 return error_mark_node
;
8978 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
8979 if (call
== error_mark_node
)
8981 if (cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
8983 tree c
= extract_call_expr (call
);
8984 /* build_new_op_1 will clear this when appropriate. */
8985 CALL_EXPR_ORDERED_ARGS (c
) = true;
8989 tree c
= extract_call_expr (call
);
8990 if (TREE_CODE (c
) == CALL_EXPR
)
8991 TREE_NO_WARNING (c
) = 1;
8993 if (TREE_CODE (fn
) == ADDR_EXPR
)
8995 tree fndecl
= STRIP_TEMPLATE (TREE_OPERAND (fn
, 0));
8996 if (TREE_CODE (fndecl
) == FUNCTION_DECL
8997 && DECL_IMMEDIATE_FUNCTION_P (fndecl
)
8998 && (current_function_decl
== NULL_TREE
8999 || !DECL_IMMEDIATE_FUNCTION_P (current_function_decl
))
9000 && (current_binding_level
->kind
!= sk_function_parms
9001 || !current_binding_level
->immediate_fn_ctx_p
))
9003 tree obj_arg
= NULL_TREE
;
9004 if (DECL_CONSTRUCTOR_P (fndecl
))
9005 obj_arg
= cand
->first_arg
? cand
->first_arg
: (*args
)[0];
9006 if (obj_arg
&& is_dummy_object (obj_arg
))
9008 call
= build_cplus_new (DECL_CONTEXT (fndecl
), call
, complain
);
9009 obj_arg
= NULL_TREE
;
9011 /* Look through *(const T *)&obj. */
9012 else if (obj_arg
&& TREE_CODE (obj_arg
) == INDIRECT_REF
)
9014 tree addr
= TREE_OPERAND (obj_arg
, 0);
9016 if (TREE_CODE (addr
) == ADDR_EXPR
)
9018 tree typeo
= TREE_TYPE (obj_arg
);
9019 tree typei
= TREE_TYPE (TREE_OPERAND (addr
, 0));
9020 if (same_type_ignoring_top_level_qualifiers_p (typeo
, typei
))
9021 obj_arg
= TREE_OPERAND (addr
, 0);
9024 call
= cxx_constant_value (call
, obj_arg
);
9033 /* Return the DECL of the first non-static subobject of class TYPE
9034 that satisfies the predicate PRED or null if none can be found. */
9036 template <class Predicate
>
9038 first_non_static_field (tree type
, Predicate pred
)
9040 if (!type
|| !CLASS_TYPE_P (type
))
9043 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
9045 if (TREE_CODE (field
) != FIELD_DECL
)
9047 if (TREE_STATIC (field
))
9055 for (tree base_binfo
, binfo
= TYPE_BINFO (type
);
9056 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
9058 tree base
= TREE_TYPE (base_binfo
);
9061 if (tree field
= first_non_static_field (base
, pred
))
9068 struct NonPublicField
9070 bool operator() (const_tree t
)
9072 return DECL_P (t
) && (TREE_PRIVATE (t
) || TREE_PROTECTED (t
));
9076 /* Return the DECL of the first non-public subobject of class TYPE
9077 or null if none can be found. */
9080 first_non_public_field (tree type
)
9082 return first_non_static_field (type
, NonPublicField ());
9085 struct NonTrivialField
9087 bool operator() (const_tree t
)
9089 return !trivial_type_p (DECL_P (t
) ? TREE_TYPE (t
) : t
);
9093 /* Return the DECL of the first non-trivial subobject of class TYPE
9094 or null if none can be found. */
9097 first_non_trivial_field (tree type
)
9099 return first_non_static_field (type
, NonTrivialField ());
9102 } /* unnamed namespace */
9104 /* Return true if all copy and move assignment operator overloads for
9105 class TYPE are trivial and at least one of them is not deleted and,
9106 when ACCESS is set, accessible. Return false otherwise. Set
9107 HASASSIGN to true when the TYPE has a (not necessarily trivial)
9108 copy or move assignment. */
9111 has_trivial_copy_assign_p (tree type
, bool access
, bool *hasassign
)
9113 tree fns
= get_class_binding (type
, assign_op_identifier
);
9114 bool all_trivial
= true;
9116 /* Iterate over overloads of the assignment operator, checking
9117 accessible copy assignments for triviality. */
9119 for (ovl_iterator
oi (fns
); oi
; ++oi
)
9123 /* Skip operators that aren't copy assignments. */
9127 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
9128 || accessible_p (TYPE_BINFO (type
), f
, true));
9130 /* Skip template assignment operators and deleted functions. */
9131 if (TREE_CODE (f
) != FUNCTION_DECL
|| DECL_DELETED_FN (f
))
9137 if (!accessible
|| !trivial_fn_p (f
))
9138 all_trivial
= false;
9140 /* Break early when both properties have been determined. */
9141 if (*hasassign
&& !all_trivial
)
9145 /* Return true if they're all trivial and one of the expressions
9146 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
9147 tree ref
= cp_build_reference_type (type
, false);
9149 && (is_trivially_xible (MODIFY_EXPR
, type
, type
)
9150 || is_trivially_xible (MODIFY_EXPR
, type
, ref
)));
9153 /* Return true if all copy and move ctor overloads for class TYPE are
9154 trivial and at least one of them is not deleted and, when ACCESS is
9155 set, accessible. Return false otherwise. Set each element of HASCTOR[]
9156 to true when the TYPE has a (not necessarily trivial) default and copy
9157 (or move) ctor, respectively. */
9160 has_trivial_copy_p (tree type
, bool access
, bool hasctor
[2])
9162 tree fns
= get_class_binding (type
, complete_ctor_identifier
);
9163 bool all_trivial
= true;
9165 for (ovl_iterator
oi (fns
); oi
; ++oi
)
9169 /* Skip template constructors. */
9170 if (TREE_CODE (f
) != FUNCTION_DECL
)
9173 bool cpy_or_move_ctor_p
= copy_fn_p (f
);
9175 /* Skip ctors other than default, copy, and move. */
9176 if (!cpy_or_move_ctor_p
&& !default_ctor_p (f
))
9179 if (DECL_DELETED_FN (f
))
9182 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
9183 || accessible_p (TYPE_BINFO (type
), f
, true));
9186 hasctor
[cpy_or_move_ctor_p
] = true;
9188 if (cpy_or_move_ctor_p
&& (!accessible
|| !trivial_fn_p (f
)))
9189 all_trivial
= false;
9191 /* Break early when both properties have been determined. */
9192 if (hasctor
[0] && hasctor
[1] && !all_trivial
)
9199 /* Issue a warning on a call to the built-in function FNDECL if it is
9200 a raw memory write whose destination is not an object of (something
9201 like) trivial or standard layout type with a non-deleted assignment
9202 and copy ctor. Detects const correctness violations, corrupting
9203 references, virtual table pointers, and bypassing non-trivial
9207 maybe_warn_class_memaccess (location_t loc
, tree fndecl
,
9208 const vec
<tree
, va_gc
> *args
)
9210 /* Except for bcopy where it's second, the destination pointer is
9211 the first argument for all functions handled here. Compute
9212 the index of the destination and source arguments. */
9213 unsigned dstidx
= DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_BCOPY
;
9214 unsigned srcidx
= !dstidx
;
9216 tree dest
= (*args
)[dstidx
];
9217 if (!TREE_TYPE (dest
)
9218 || (TREE_CODE (TREE_TYPE (dest
)) != ARRAY_TYPE
9219 && !INDIRECT_TYPE_P (TREE_TYPE (dest
))))
9222 tree srctype
= NULL_TREE
;
9224 /* Determine the type of the pointed-to object and whether it's
9225 a complete class type. */
9226 tree desttype
= TREE_TYPE (TREE_TYPE (dest
));
9228 if (!desttype
|| !COMPLETE_TYPE_P (desttype
) || !CLASS_TYPE_P (desttype
))
9231 /* Check to see if the raw memory call is made by a non-static member
9232 function with THIS as the destination argument for the destination
9233 type. If so, and if the class has no non-trivial bases or members,
9234 be more permissive. */
9235 if (current_function_decl
9236 && DECL_NONSTATIC_MEMBER_FUNCTION_P (current_function_decl
)
9237 && is_this_parameter (tree_strip_nop_conversions (dest
)))
9239 tree ctx
= DECL_CONTEXT (current_function_decl
);
9240 bool special
= same_type_ignoring_top_level_qualifiers_p (ctx
, desttype
);
9241 tree binfo
= TYPE_BINFO (ctx
);
9244 && !BINFO_VTABLE (binfo
)
9245 && !first_non_trivial_field (desttype
))
9249 /* True if the class is trivial. */
9250 bool trivial
= trivial_type_p (desttype
);
9252 /* Set to true if DESTYPE has an accessible copy assignment. */
9253 bool hasassign
= false;
9254 /* True if all of the class' overloaded copy assignment operators
9255 are all trivial (and not deleted) and at least one of them is
9257 bool trivassign
= has_trivial_copy_assign_p (desttype
, true, &hasassign
);
9259 /* Set to true if DESTTYPE has an accessible default and copy ctor,
9261 bool hasctors
[2] = { false, false };
9263 /* True if all of the class' overloaded copy constructors are all
9264 trivial (and not deleted) and at least one of them is accessible. */
9265 bool trivcopy
= has_trivial_copy_p (desttype
, true, hasctors
);
9267 /* Set FLD to the first private/protected member of the class. */
9268 tree fld
= trivial
? first_non_public_field (desttype
) : NULL_TREE
;
9270 /* The warning format string. */
9271 const char *warnfmt
= NULL
;
9272 /* A suggested alternative to offer instead of the raw memory call.
9273 Empty string when none can be come up with. */
9274 const char *suggest
= "";
9275 bool warned
= false;
9277 switch (DECL_FUNCTION_CODE (fndecl
))
9279 case BUILT_IN_MEMSET
:
9280 if (!integer_zerop (maybe_constant_value ((*args
)[1])))
9282 /* Diagnose setting non-copy-assignable or non-trivial types,
9283 or types with a private member, to (potentially) non-zero
9284 bytes. Since the value of the bytes being written is unknown,
9285 suggest using assignment instead (if one exists). Also warn
9286 for writes into objects for which zero-initialization doesn't
9287 mean all bits clear (pointer-to-member data, where null is all
9288 bits set). Since the value being written is (most likely)
9289 non-zero, simply suggest assignment (but not copy assignment). */
9290 suggest
= "; use assignment instead";
9292 warnfmt
= G_("%qD writing to an object of type %#qT with "
9293 "no trivial copy-assignment");
9295 warnfmt
= G_("%qD writing to an object of non-trivial type %#qT%s");
9298 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
9299 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9300 "%qD writing to an object of type %#qT with "
9302 fndecl
, desttype
, access
, fld
);
9304 else if (!zero_init_p (desttype
))
9305 warnfmt
= G_("%qD writing to an object of type %#qT containing "
9306 "a pointer to data member%s");
9312 case BUILT_IN_BZERO
:
9313 /* Similarly to the above, diagnose clearing non-trivial or non-
9314 standard layout objects, or objects of types with no assignmenmt.
9315 Since the value being written is known to be zero, suggest either
9316 copy assignment, copy ctor, or default ctor as an alternative,
9317 depending on what's available. */
9319 if (hasassign
&& hasctors
[0])
9320 suggest
= G_("; use assignment or value-initialization instead");
9322 suggest
= G_("; use assignment instead");
9323 else if (hasctors
[0])
9324 suggest
= G_("; use value-initialization instead");
9327 warnfmt
= G_("%qD clearing an object of type %#qT with "
9328 "no trivial copy-assignment%s");
9330 warnfmt
= G_("%qD clearing an object of non-trivial type %#qT%s");
9331 else if (!zero_init_p (desttype
))
9332 warnfmt
= G_("%qD clearing an object of type %#qT containing "
9333 "a pointer-to-member%s");
9336 case BUILT_IN_BCOPY
:
9337 case BUILT_IN_MEMCPY
:
9338 case BUILT_IN_MEMMOVE
:
9339 case BUILT_IN_MEMPCPY
:
9340 /* Determine the type of the source object. */
9341 srctype
= TREE_TYPE ((*args
)[srcidx
]);
9342 if (!srctype
|| !INDIRECT_TYPE_P (srctype
))
9343 srctype
= void_type_node
;
9345 srctype
= TREE_TYPE (srctype
);
9347 /* Since it's impossible to determine wheter the byte copy is
9348 being used in place of assignment to an existing object or
9349 as a substitute for initialization, assume it's the former.
9350 Determine the best alternative to use instead depending on
9351 what's not deleted. */
9352 if (hasassign
&& hasctors
[1])
9353 suggest
= G_("; use copy-assignment or copy-initialization instead");
9355 suggest
= G_("; use copy-assignment instead");
9356 else if (hasctors
[1])
9357 suggest
= G_("; use copy-initialization instead");
9360 warnfmt
= G_("%qD writing to an object of type %#qT with no trivial "
9361 "copy-assignment%s");
9362 else if (!trivially_copyable_p (desttype
))
9363 warnfmt
= G_("%qD writing to an object of non-trivially copyable "
9366 warnfmt
= G_("%qD writing to an object with a deleted copy constructor");
9369 && !VOID_TYPE_P (srctype
)
9370 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
9371 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
9374 /* Warn when copying into a non-trivial object from an object
9375 of a different type other than void or char. */
9376 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9377 "%qD copying an object of non-trivial type "
9378 "%#qT from an array of %#qT",
9379 fndecl
, desttype
, srctype
);
9382 && !VOID_TYPE_P (srctype
)
9383 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
9384 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
9387 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
9388 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9389 "%qD copying an object of type %#qT with "
9390 "%qs member %qD from an array of %#qT; use "
9391 "assignment or copy-initialization instead",
9392 fndecl
, desttype
, access
, fld
, srctype
);
9394 else if (!trivial
&& vec_safe_length (args
) > 2)
9396 tree sz
= maybe_constant_value ((*args
)[2]);
9397 if (!tree_fits_uhwi_p (sz
))
9400 /* Finally, warn on partial copies. */
9401 unsigned HOST_WIDE_INT typesize
9402 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype
));
9403 if (unsigned HOST_WIDE_INT partial
= tree_to_uhwi (sz
) % typesize
)
9404 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9405 (typesize
- partial
> 1
9406 ? G_("%qD writing to an object of "
9407 "a non-trivial type %#qT leaves %wu "
9409 : G_("%qD writing to an object of "
9410 "a non-trivial type %#qT leaves %wu "
9412 fndecl
, desttype
, typesize
- partial
);
9416 case BUILT_IN_REALLOC
:
9418 if (!trivially_copyable_p (desttype
))
9419 warnfmt
= G_("%qD moving an object of non-trivially copyable type "
9420 "%#qT; use %<new%> and %<delete%> instead");
9422 warnfmt
= G_("%qD moving an object of type %#qT with deleted copy "
9423 "constructor; use %<new%> and %<delete%> instead");
9424 else if (!get_dtor (desttype
, tf_none
))
9425 warnfmt
= G_("%qD moving an object of type %#qT with deleted "
9429 tree sz
= maybe_constant_value ((*args
)[1]);
9430 if (TREE_CODE (sz
) == INTEGER_CST
9431 && tree_int_cst_lt (sz
, TYPE_SIZE_UNIT (desttype
)))
9432 /* Finally, warn on reallocation into insufficient space. */
9433 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9434 "%qD moving an object of non-trivial type "
9435 "%#qT and size %E into a region of size %E",
9436 fndecl
, desttype
, TYPE_SIZE_UNIT (desttype
),
9448 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9449 warnfmt
, fndecl
, desttype
, suggest
);
9451 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9452 warnfmt
, fndecl
, desttype
);
9456 inform (location_of (desttype
), "%#qT declared here", desttype
);
9459 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
9460 If FN is the result of resolving an overloaded target built-in,
9461 ORIG_FNDECL is the original function decl, otherwise it is null.
9462 This function performs no overload resolution, conversion, or other
9463 high-level operations. */
9466 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
9467 tsubst_flags_t complain
, tree orig_fndecl
)
9471 /* Remember roughly where this call is. */
9472 location_t loc
= cp_expr_loc_or_input_loc (fn
);
9473 fn
= build_call_a (fn
, nargs
, argarray
);
9474 SET_EXPR_LOCATION (fn
, loc
);
9476 fndecl
= get_callee_fndecl (fn
);
9478 orig_fndecl
= fndecl
;
9480 /* Check that arguments to builtin functions match the expectations. */
9482 && !processing_template_decl
9483 && fndecl_built_in_p (fndecl
))
9487 /* We need to take care that values to BUILT_IN_NORMAL
9489 for (i
= 0; i
< nargs
; i
++)
9490 argarray
[i
] = maybe_constant_value (argarray
[i
]);
9492 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
9493 orig_fndecl
, nargs
, argarray
))
9494 return error_mark_node
;
9497 if (VOID_TYPE_P (TREE_TYPE (fn
)))
9500 /* 5.2.2/11: If a function call is a prvalue of object type: if the
9501 function call is either the operand of a decltype-specifier or the
9502 right operand of a comma operator that is the operand of a
9503 decltype-specifier, a temporary object is not introduced for the
9504 prvalue. The type of the prvalue may be incomplete. */
9505 if (!(complain
& tf_decltype
))
9507 fn
= require_complete_type_sfinae (fn
, complain
);
9508 if (fn
== error_mark_node
)
9509 return error_mark_node
;
9511 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
9513 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
9514 maybe_warn_parm_abi (TREE_TYPE (fn
), loc
);
9517 return convert_from_reference (fn
);
9520 /* Returns the value to use for the in-charge parameter when making a
9521 call to a function with the indicated NAME.
9523 FIXME:Can't we find a neater way to do this mapping? */
9526 in_charge_arg_for_name (tree name
)
9528 if (IDENTIFIER_CTOR_P (name
))
9530 if (name
== complete_ctor_identifier
)
9531 return integer_one_node
;
9532 gcc_checking_assert (name
== base_ctor_identifier
);
9536 if (name
== complete_dtor_identifier
)
9537 return integer_two_node
;
9538 else if (name
== deleting_dtor_identifier
)
9539 return integer_three_node
;
9540 gcc_checking_assert (name
== base_dtor_identifier
);
9543 return integer_zero_node
;
9546 /* We've built up a constructor call RET. Complain if it delegates to the
9547 constructor we're currently compiling. */
9550 check_self_delegation (tree ret
)
9552 if (TREE_CODE (ret
) == TARGET_EXPR
)
9553 ret
= TARGET_EXPR_INITIAL (ret
);
9554 tree fn
= cp_get_callee_fndecl_nofold (ret
);
9555 if (fn
&& DECL_ABSTRACT_ORIGIN (fn
) == current_function_decl
)
9556 error ("constructor delegates to itself");
9559 /* Build a call to a constructor, destructor, or an assignment
9560 operator for INSTANCE, an expression with class type. NAME
9561 indicates the special member function to call; *ARGS are the
9562 arguments. ARGS may be NULL. This may change ARGS. BINFO
9563 indicates the base of INSTANCE that is to be passed as the `this'
9564 parameter to the member function called.
9566 FLAGS are the LOOKUP_* flags to use when processing the call.
9568 If NAME indicates a complete object constructor, INSTANCE may be
9569 NULL_TREE. In this case, the caller will call build_cplus_new to
9570 store the newly constructed object into a VAR_DECL. */
9573 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
9574 tree binfo
, int flags
, tsubst_flags_t complain
)
9577 /* The type of the subobject to be constructed or destroyed. */
9579 vec
<tree
, va_gc
> *allocated
= NULL
;
9582 gcc_assert (IDENTIFIER_CDTOR_P (name
) || name
== assign_op_identifier
);
9584 if (error_operand_p (instance
))
9585 return error_mark_node
;
9587 if (IDENTIFIER_DTOR_P (name
))
9589 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
9590 if (!type_build_dtor_call (TREE_TYPE (instance
)))
9591 /* Shortcut to avoid lazy destructor declaration. */
9592 return build_trivial_dtor_call (instance
);
9597 /* Resolve the name. */
9598 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
9599 return error_mark_node
;
9601 binfo
= TYPE_BINFO (binfo
);
9604 gcc_assert (binfo
!= NULL_TREE
);
9606 class_type
= BINFO_TYPE (binfo
);
9608 /* Handle the special case where INSTANCE is NULL_TREE. */
9609 if (name
== complete_ctor_identifier
&& !instance
)
9610 instance
= build_dummy_object (class_type
);
9613 /* Convert to the base class, if necessary. */
9614 if (!same_type_ignoring_top_level_qualifiers_p
9615 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
9617 if (IDENTIFIER_CDTOR_P (name
))
9618 /* For constructors and destructors, either the base is
9619 non-virtual, or it is virtual but we are doing the
9620 conversion from a constructor or destructor for the
9621 complete object. In either case, we can convert
9623 instance
= convert_to_base_statically (instance
, binfo
);
9626 /* However, for assignment operators, we must convert
9627 dynamically if the base is virtual. */
9628 gcc_checking_assert (name
== assign_op_identifier
);
9629 instance
= build_base_path (PLUS_EXPR
, instance
,
9630 binfo
, /*nonnull=*/1, complain
);
9635 gcc_assert (instance
!= NULL_TREE
);
9637 /* In C++17, "If the initializer expression is a prvalue and the
9638 cv-unqualified version of the source type is the same class as the class
9639 of the destination, the initializer expression is used to initialize the
9640 destination object." Handle that here to avoid doing overload
9642 if (cxx_dialect
>= cxx17
9643 && args
&& vec_safe_length (*args
) == 1
9644 && name
== complete_ctor_identifier
)
9646 tree arg
= (**args
)[0];
9648 if (BRACE_ENCLOSED_INITIALIZER_P (arg
)
9649 && !TYPE_HAS_LIST_CTOR (class_type
)
9650 && CONSTRUCTOR_NELTS (arg
) == 1)
9651 arg
= CONSTRUCTOR_ELT (arg
, 0)->value
;
9653 if ((TREE_CODE (arg
) == TARGET_EXPR
9654 || TREE_CODE (arg
) == CONSTRUCTOR
)
9655 && (same_type_ignoring_top_level_qualifiers_p
9656 (class_type
, TREE_TYPE (arg
))))
9658 if (is_dummy_object (instance
))
9660 else if (TREE_CODE (arg
) == TARGET_EXPR
)
9661 TARGET_EXPR_DIRECT_INIT_P (arg
) = true;
9663 if ((complain
& tf_error
)
9664 && (flags
& LOOKUP_DELEGATING_CONS
))
9665 check_self_delegation (arg
);
9666 /* Avoid change of behavior on Wunused-var-2.C. */
9667 instance
= mark_lvalue_use (instance
);
9668 return build2 (INIT_EXPR
, class_type
, instance
, arg
);
9672 fns
= lookup_fnfields (binfo
, name
, 1);
9674 /* When making a call to a constructor or destructor for a subobject
9675 that uses virtual base classes, pass down a pointer to a VTT for
9677 if ((name
== base_ctor_identifier
9678 || name
== base_dtor_identifier
)
9679 && CLASSTYPE_VBASECLASSES (class_type
))
9684 /* If the current function is a complete object constructor
9685 or destructor, then we fetch the VTT directly.
9686 Otherwise, we look it up using the VTT we were given. */
9687 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
9688 vtt
= decay_conversion (vtt
, complain
);
9689 if (vtt
== error_mark_node
)
9690 return error_mark_node
;
9691 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
9692 if (BINFO_SUBVTT_INDEX (binfo
))
9693 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
9699 allocated
= make_tree_vector ();
9703 vec_safe_insert (*args
, 0, sub_vtt
);
9706 ret
= build_new_method_call (instance
, fns
, args
,
9707 TYPE_BINFO (BINFO_TYPE (binfo
)),
9711 if (allocated
!= NULL
)
9712 release_tree_vector (allocated
);
9714 if ((complain
& tf_error
)
9715 && (flags
& LOOKUP_DELEGATING_CONS
)
9716 && name
== complete_ctor_identifier
)
9717 check_self_delegation (ret
);
9722 /* Return the NAME, as a C string. The NAME indicates a function that
9723 is a member of TYPE. *FREE_P is set to true if the caller must
9724 free the memory returned.
9726 Rather than go through all of this, we should simply set the names
9727 of constructors and destructors appropriately, and dispense with
9728 ctor_identifier, dtor_identifier, etc. */
9731 name_as_c_string (tree name
, tree type
, bool *free_p
)
9733 const char *pretty_name
;
9735 /* Assume that we will not allocate memory. */
9737 /* Constructors and destructors are special. */
9738 if (IDENTIFIER_CDTOR_P (name
))
9741 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
)));
9742 /* For a destructor, add the '~'. */
9743 if (IDENTIFIER_DTOR_P (name
))
9745 pretty_name
= concat ("~", pretty_name
, NULL
);
9746 /* Remember that we need to free the memory allocated. */
9750 else if (IDENTIFIER_CONV_OP_P (name
))
9752 pretty_name
= concat ("operator ",
9753 type_as_string_translate (TREE_TYPE (name
),
9754 TFF_PLAIN_IDENTIFIER
),
9756 /* Remember that we need to free the memory allocated. */
9760 pretty_name
= identifier_to_locale (IDENTIFIER_POINTER (name
));
9762 return CONST_CAST (char *, pretty_name
);
9765 /* If CANDIDATES contains exactly one candidate, return it, otherwise
9768 static z_candidate
*
9769 single_z_candidate (z_candidate
*candidates
)
9771 if (candidates
== NULL
)
9774 if (candidates
->next
)
9780 /* If CANDIDATE is invalid due to a bad argument type, return the
9781 pertinent conversion_info.
9783 Otherwise, return NULL. */
9785 static const conversion_info
*
9786 maybe_get_bad_conversion_for_unmatched_call (const z_candidate
*candidate
)
9788 /* Must be an rr_arg_conversion or rr_bad_arg_conversion. */
9789 rejection_reason
*r
= candidate
->reason
;
9799 case rr_arg_conversion
:
9800 return &r
->u
.conversion
;
9802 case rr_bad_arg_conversion
:
9803 return &r
->u
.bad_conversion
;
9807 /* Issue an error and note complaining about a bad argument type at a
9808 callsite with a single candidate FNDECL.
9810 ARG_LOC is the location of the argument (or UNKNOWN_LOCATION, in which
9811 case input_location is used).
9812 FROM_TYPE is the type of the actual argument; TO_TYPE is the type of
9813 the formal parameter. */
9816 complain_about_bad_argument (location_t arg_loc
,
9817 tree from_type
, tree to_type
,
9818 tree fndecl
, int parmnum
)
9820 auto_diagnostic_group d
;
9821 range_label_for_type_mismatch
rhs_label (from_type
, to_type
);
9822 range_label
*label
= &rhs_label
;
9823 if (arg_loc
== UNKNOWN_LOCATION
)
9825 arg_loc
= input_location
;
9828 gcc_rich_location
richloc (arg_loc
, label
);
9830 "cannot convert %qH to %qI",
9831 from_type
, to_type
);
9832 maybe_inform_about_fndecl_for_bogus_argument_init (fndecl
,
9836 /* Subroutine of build_new_method_call_1, for where there are no viable
9837 candidates for the call. */
9840 complain_about_no_candidates_for_method_call (tree instance
,
9841 z_candidate
*candidates
,
9842 tree explicit_targs
,
9844 tree optype
, tree name
,
9845 bool skip_first_for_error
,
9846 vec
<tree
, va_gc
> *user_args
)
9848 auto_diagnostic_group d
;
9849 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
9850 cxx_incomplete_type_error (instance
, basetype
);
9852 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9853 basetype
, optype
, build_tree_list_vec (user_args
),
9854 TREE_TYPE (instance
));
9857 /* Special-case for when there's a single candidate that's failing
9858 due to a bad argument type. */
9859 if (z_candidate
*candidate
= single_z_candidate (candidates
))
9860 if (const conversion_info
*conv
9861 = maybe_get_bad_conversion_for_unmatched_call (candidate
))
9863 complain_about_bad_argument (conv
->loc
,
9864 conv
->from
, conv
->to_type
,
9865 candidate
->fn
, conv
->n_arg
);
9869 tree arglist
= build_tree_list_vec (user_args
);
9870 tree errname
= name
;
9871 bool twiddle
= false;
9872 if (IDENTIFIER_CDTOR_P (errname
))
9874 twiddle
= IDENTIFIER_DTOR_P (errname
);
9875 errname
= constructor_name (basetype
);
9878 errname
= lookup_template_function (errname
, explicit_targs
);
9879 if (skip_first_for_error
)
9880 arglist
= TREE_CHAIN (arglist
);
9881 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9882 basetype
, &"~"[!twiddle
], errname
, arglist
,
9883 TREE_TYPE (instance
));
9885 print_z_candidates (location_of (name
), candidates
);
9888 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
9889 be set, upon return, to the function called. ARGS may be NULL.
9890 This may change ARGS. */
9893 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9894 tree conversion_path
, int flags
,
9895 tree
*fn_p
, tsubst_flags_t complain
)
9897 struct z_candidate
*candidates
= 0, *cand
;
9898 tree explicit_targs
= NULL_TREE
;
9899 tree basetype
= NULL_TREE
;
9902 tree first_mem_arg
= NULL_TREE
;
9904 bool skip_first_for_error
;
9905 vec
<tree
, va_gc
> *user_args
;
9908 int template_only
= 0;
9912 vec
<tree
, va_gc
> *orig_args
= NULL
;
9915 gcc_assert (instance
!= NULL_TREE
);
9917 /* We don't know what function we're going to call, yet. */
9921 if (error_operand_p (instance
)
9922 || !fns
|| error_operand_p (fns
))
9923 return error_mark_node
;
9925 if (!BASELINK_P (fns
))
9927 if (complain
& tf_error
)
9928 error ("call to non-function %qD", fns
);
9929 return error_mark_node
;
9932 orig_instance
= instance
;
9935 /* Dismantle the baselink to collect all the information we need. */
9936 if (!conversion_path
)
9937 conversion_path
= BASELINK_BINFO (fns
);
9938 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
9939 optype
= BASELINK_OPTYPE (fns
);
9940 fns
= BASELINK_FUNCTIONS (fns
);
9941 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
9943 explicit_targs
= TREE_OPERAND (fns
, 1);
9944 fns
= TREE_OPERAND (fns
, 0);
9947 gcc_assert (OVL_P (fns
));
9948 fn
= OVL_FIRST (fns
);
9949 name
= DECL_NAME (fn
);
9951 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
9952 gcc_assert (CLASS_TYPE_P (basetype
));
9954 user_args
= args
== NULL
? NULL
: *args
;
9955 /* Under DR 147 A::A() is an invalid constructor call,
9956 not a functional cast. */
9957 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
9959 if (! (complain
& tf_error
))
9960 return error_mark_node
;
9962 basetype
= DECL_CONTEXT (fn
);
9963 name
= constructor_name (basetype
);
9964 auto_diagnostic_group d
;
9965 if (permerror (input_location
,
9966 "cannot call constructor %<%T::%D%> directly",
9968 inform (input_location
, "for a function-style cast, remove the "
9969 "redundant %<::%D%>", name
);
9970 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
9975 if (processing_template_decl
)
9977 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
9978 instance
= build_non_dependent_expr (instance
);
9980 make_args_non_dependent (*args
);
9983 /* Process the argument list. */
9984 if (args
!= NULL
&& *args
!= NULL
)
9986 *args
= resolve_args (*args
, complain
);
9988 return error_mark_node
;
9992 /* Consider the object argument to be used even if we end up selecting a
9993 static member function. */
9994 instance
= mark_type_use (instance
);
9996 /* Figure out whether to skip the first argument for the error
9997 message we will display to users if an error occurs. We don't
9998 want to display any compiler-generated arguments. The "this"
9999 pointer hasn't been added yet. However, we must remove the VTT
10000 pointer if this is a call to a base-class constructor or
10002 skip_first_for_error
= false;
10003 if (IDENTIFIER_CDTOR_P (name
))
10005 /* Callers should explicitly indicate whether they want to ctor
10006 the complete object or just the part without virtual bases. */
10007 gcc_assert (name
!= ctor_identifier
);
10009 /* Remove the VTT pointer, if present. */
10010 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
10011 && CLASSTYPE_VBASECLASSES (basetype
))
10012 skip_first_for_error
= true;
10014 /* It's OK to call destructors and constructors on cv-qualified
10015 objects. Therefore, convert the INSTANCE to the unqualified
10016 type, if necessary. */
10017 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
10019 instance
= build_this (instance
);
10020 instance
= build_nop (build_pointer_type (basetype
), instance
);
10021 instance
= build_fold_indirect_ref (instance
);
10025 gcc_assert (!DECL_DESTRUCTOR_P (fn
) && !DECL_CONSTRUCTOR_P (fn
));
10027 /* For the overload resolution we need to find the actual `this`
10028 that would be captured if the call turns out to be to a
10029 non-static member function. Do not actually capture it at this
10031 if (DECL_CONSTRUCTOR_P (fn
))
10032 /* Constructors don't use the enclosing 'this'. */
10033 first_mem_arg
= instance
;
10035 first_mem_arg
= maybe_resolve_dummy (instance
, false);
10037 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10038 p
= conversion_obstack_alloc (0);
10040 /* The number of arguments artificial parms in ARGS; we subtract one because
10041 there's no 'this' in ARGS. */
10042 unsigned skip
= num_artificial_parms_for (fn
) - 1;
10044 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
10045 initializer, not T({ }). */
10046 if (DECL_CONSTRUCTOR_P (fn
)
10047 && vec_safe_length (user_args
) > skip
10048 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
10050 tree init_list
= (*user_args
)[skip
];
10051 tree init
= NULL_TREE
;
10053 gcc_assert (user_args
->length () == skip
+ 1
10054 && !(flags
& LOOKUP_ONLYCONVERTING
));
10056 /* If the initializer list has no elements and T is a class type with
10057 a default constructor, the object is value-initialized. Handle
10058 this here so we don't need to handle it wherever we use
10059 build_special_member_call. */
10060 if (CONSTRUCTOR_NELTS (init_list
) == 0
10061 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
10062 /* For a user-provided default constructor, use the normal
10063 mechanisms so that protected access works. */
10064 && type_has_non_user_provided_default_constructor (basetype
)
10065 && !processing_template_decl
)
10066 init
= build_value_init (basetype
, complain
);
10068 /* If BASETYPE is an aggregate, we need to do aggregate
10070 else if (CP_AGGREGATE_TYPE_P (basetype
))
10072 init
= reshape_init (basetype
, init_list
, complain
);
10073 init
= digest_init (basetype
, init
, complain
);
10078 if (is_dummy_object (instance
))
10079 return get_target_expr_sfinae (init
, complain
);
10080 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
10081 TREE_SIDE_EFFECTS (init
) = true;
10085 /* Otherwise go ahead with overload resolution. */
10086 add_list_candidates (fns
, first_mem_arg
, user_args
,
10087 basetype
, explicit_targs
, template_only
,
10088 conversion_path
, access_binfo
, flags
,
10089 &candidates
, complain
);
10092 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
10093 explicit_targs
, template_only
, conversion_path
,
10094 access_binfo
, flags
, &candidates
, complain
);
10096 any_viable_p
= false;
10097 candidates
= splice_viable (candidates
, false, &any_viable_p
);
10101 if (complain
& tf_error
)
10102 complain_about_no_candidates_for_method_call (instance
, candidates
,
10103 explicit_targs
, basetype
,
10105 skip_first_for_error
,
10107 call
= error_mark_node
;
10111 cand
= tourney (candidates
, complain
);
10118 if (complain
& tf_error
)
10120 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
10121 arglist
= build_tree_list_vec (user_args
);
10122 if (skip_first_for_error
)
10123 arglist
= TREE_CHAIN (arglist
);
10124 auto_diagnostic_group d
;
10125 if (!any_strictly_viable (candidates
))
10126 error ("no matching function for call to %<%s(%A)%>",
10127 pretty_name
, arglist
);
10129 error ("call of overloaded %<%s(%A)%> is ambiguous",
10130 pretty_name
, arglist
);
10131 print_z_candidates (location_of (name
), candidates
);
10133 free (pretty_name
);
10135 call
= error_mark_node
;
10142 if (!(flags
& LOOKUP_NONVIRTUAL
)
10143 && DECL_PURE_VIRTUAL_P (fn
)
10144 && instance
== current_class_ref
10145 && (complain
& tf_warning
))
10147 /* This is not an error, it is runtime undefined
10149 if (!current_function_decl
)
10150 warning (0, "pure virtual %q#D called from "
10151 "non-static data member initializer", fn
);
10152 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
10153 || DECL_DESTRUCTOR_P (current_function_decl
))
10154 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
10155 ? G_("pure virtual %q#D called from constructor")
10156 : G_("pure virtual %q#D called from destructor")),
10160 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
10161 && !DECL_CONSTRUCTOR_P (fn
)
10162 && is_dummy_object (instance
))
10164 instance
= maybe_resolve_dummy (instance
, true);
10165 if (instance
== error_mark_node
)
10166 call
= error_mark_node
;
10167 else if (!is_dummy_object (instance
))
10169 /* We captured 'this' in the current lambda now that
10170 we know we really need it. */
10171 cand
->first_arg
= instance
;
10173 else if (any_dependent_bases_p ())
10174 /* We can't tell until instantiation time whether we can use
10175 *this as the implicit object argument. */;
10178 if (complain
& tf_error
)
10179 error ("cannot call member function %qD without object",
10181 call
= error_mark_node
;
10185 if (call
!= error_mark_node
)
10187 if (explicit_targs
)
10188 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
10189 /* Now we know what function is being called. */
10192 /* Build the actual CALL_EXPR. */
10193 call
= build_over_call (cand
, flags
, complain
);
10194 /* In an expression of the form `a->f()' where `f' turns
10195 out to be a static member function, `a' is
10196 none-the-less evaluated. */
10197 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
10198 && !is_dummy_object (instance
)
10199 && TREE_SIDE_EFFECTS (instance
))
10201 /* But avoid the implicit lvalue-rvalue conversion when 'a'
10204 if (TREE_THIS_VOLATILE (a
))
10205 a
= build_this (a
);
10206 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
), a
, call
);
10208 else if (call
!= error_mark_node
10209 && DECL_DESTRUCTOR_P (cand
->fn
)
10210 && !VOID_TYPE_P (TREE_TYPE (call
)))
10211 /* An explicit call of the form "x->~X()" has type
10212 "void". However, on platforms where destructors
10213 return "this" (i.e., those where
10214 targetm.cxx.cdtor_returns_this is true), such calls
10215 will appear to have a return value of pointer type
10216 to the low-level call machinery. We do not want to
10217 change the low-level machinery, since we want to be
10218 able to optimize "delete f()" on such platforms as
10219 "operator delete(~X(f()))" (rather than generating
10220 "t = f(), ~X(t), operator delete (t)"). */
10221 call
= build_nop (void_type_node
, call
);
10226 if (processing_template_decl
&& call
!= error_mark_node
)
10228 bool cast_to_void
= false;
10230 if (TREE_CODE (call
) == COMPOUND_EXPR
)
10231 call
= TREE_OPERAND (call
, 1);
10232 else if (TREE_CODE (call
) == NOP_EXPR
)
10234 cast_to_void
= true;
10235 call
= TREE_OPERAND (call
, 0);
10237 if (INDIRECT_REF_P (call
))
10238 call
= TREE_OPERAND (call
, 0);
10239 call
= (build_min_non_dep_call_vec
10241 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
10242 orig_instance
, orig_fns
, NULL_TREE
),
10244 SET_EXPR_LOCATION (call
, input_location
);
10245 call
= convert_from_reference (call
);
10247 call
= build_nop (void_type_node
, call
);
10250 /* Free all the conversions we allocated. */
10251 obstack_free (&conversion_obstack
, p
);
10253 if (orig_args
!= NULL
)
10254 release_tree_vector (orig_args
);
10259 /* Wrapper for above. */
10262 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
10263 tree conversion_path
, int flags
,
10264 tree
*fn_p
, tsubst_flags_t complain
)
10267 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
10268 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
10270 timevar_cond_stop (TV_OVERLOAD
, subtime
);
10274 /* Returns true iff standard conversion sequence ICS1 is a proper
10275 subsequence of ICS2. */
10278 is_subseq (conversion
*ics1
, conversion
*ics2
)
10280 /* We can assume that a conversion of the same code
10281 between the same types indicates a subsequence since we only get
10282 here if the types we are converting from are the same. */
10284 while (ics1
->kind
== ck_rvalue
10285 || ics1
->kind
== ck_lvalue
)
10286 ics1
= next_conversion (ics1
);
10290 while (ics2
->kind
== ck_rvalue
10291 || ics2
->kind
== ck_lvalue
)
10292 ics2
= next_conversion (ics2
);
10294 if (ics2
->kind
== ck_user
10295 || ics2
->kind
== ck_ambig
10296 || ics2
->kind
== ck_aggr
10297 || ics2
->kind
== ck_list
10298 || ics2
->kind
== ck_identity
)
10299 /* At this point, ICS1 cannot be a proper subsequence of
10300 ICS2. We can get a USER_CONV when we are comparing the
10301 second standard conversion sequence of two user conversion
10305 ics2
= next_conversion (ics2
);
10307 while (ics2
->kind
== ck_rvalue
10308 || ics2
->kind
== ck_lvalue
)
10309 ics2
= next_conversion (ics2
);
10311 if (ics2
->kind
== ics1
->kind
10312 && same_type_p (ics2
->type
, ics1
->type
)
10313 && (ics1
->kind
== ck_identity
10314 || same_type_p (next_conversion (ics2
)->type
,
10315 next_conversion (ics1
)->type
)))
10320 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
10321 be any _TYPE nodes. */
10324 is_properly_derived_from (tree derived
, tree base
)
10326 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
10329 /* We only allow proper derivation here. The DERIVED_FROM_P macro
10330 considers every class derived from itself. */
10331 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
10332 && DERIVED_FROM_P (base
, derived
));
10335 /* We build the ICS for an implicit object parameter as a pointer
10336 conversion sequence. However, such a sequence should be compared
10337 as if it were a reference conversion sequence. If ICS is the
10338 implicit conversion sequence for an implicit object parameter,
10339 modify it accordingly. */
10342 maybe_handle_implicit_object (conversion
**ics
)
10344 if ((*ics
)->this_p
)
10346 /* [over.match.funcs]
10348 For non-static member functions, the type of the
10349 implicit object parameter is "reference to cv X"
10350 where X is the class of which the function is a
10351 member and cv is the cv-qualification on the member
10352 function declaration. */
10353 conversion
*t
= *ics
;
10354 tree reference_type
;
10356 /* The `this' parameter is a pointer to a class type. Make the
10357 implicit conversion talk about a reference to that same class
10359 reference_type
= TREE_TYPE (t
->type
);
10360 reference_type
= build_reference_type (reference_type
);
10362 if (t
->kind
== ck_qual
)
10363 t
= next_conversion (t
);
10364 if (t
->kind
== ck_ptr
)
10365 t
= next_conversion (t
);
10366 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
10367 t
= direct_reference_binding (reference_type
, t
);
10369 t
->rvaluedness_matches_p
= 0;
10374 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
10375 and return the initial reference binding conversion. Otherwise,
10376 leave *ICS unchanged and return NULL. */
10378 static conversion
*
10379 maybe_handle_ref_bind (conversion
**ics
)
10381 if ((*ics
)->kind
== ck_ref_bind
)
10383 conversion
*old_ics
= *ics
;
10384 *ics
= next_conversion (old_ics
);
10385 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
10392 /* Get the expression at the beginning of the conversion chain C. */
10395 conv_get_original_expr (conversion
*c
)
10397 for (; c
; c
= next_conversion (c
))
10398 if (c
->kind
== ck_identity
|| c
->kind
== ck_ambig
)
10403 /* Return a tree representing the number of elements initialized by the
10404 list-initialization C. The caller must check that C converts to an
10408 nelts_initialized_by_list_init (conversion
*c
)
10410 /* If the array we're converting to has a dimension, we'll use that. */
10411 if (TYPE_DOMAIN (c
->type
))
10412 return array_type_nelts_top (c
->type
);
10415 /* Otherwise, we look at how many elements the constructor we're
10416 initializing from has. */
10417 tree ctor
= conv_get_original_expr (c
);
10418 return size_int (CONSTRUCTOR_NELTS (ctor
));
10422 /* True iff C is a conversion that binds a reference or a pointer to
10423 an array of unknown bound. */
10426 conv_binds_to_array_of_unknown_bound (conversion
*c
)
10428 /* ck_ref_bind won't have the reference stripped. */
10429 tree type
= non_reference (c
->type
);
10430 /* ck_qual won't have the pointer stripped. */
10431 type
= strip_pointer_operator (type
);
10432 return (TREE_CODE (type
) == ARRAY_TYPE
10433 && TYPE_DOMAIN (type
) == NULL_TREE
);
10436 /* Compare two implicit conversion sequences according to the rules set out in
10437 [over.ics.rank]. Return values:
10439 1: ics1 is better than ics2
10440 -1: ics2 is better than ics1
10441 0: ics1 and ics2 are indistinguishable */
10444 compare_ics (conversion
*ics1
, conversion
*ics2
)
10450 tree deref_from_type1
= NULL_TREE
;
10451 tree deref_from_type2
= NULL_TREE
;
10452 tree deref_to_type1
= NULL_TREE
;
10453 tree deref_to_type2
= NULL_TREE
;
10454 conversion_rank rank1
, rank2
;
10456 /* REF_BINDING is nonzero if the result of the conversion sequence
10457 is a reference type. In that case REF_CONV is the reference
10458 binding conversion. */
10459 conversion
*ref_conv1
;
10460 conversion
*ref_conv2
;
10462 /* Compare badness before stripping the reference conversion. */
10463 if (ics1
->bad_p
> ics2
->bad_p
)
10465 else if (ics1
->bad_p
< ics2
->bad_p
)
10468 /* Handle implicit object parameters. */
10469 maybe_handle_implicit_object (&ics1
);
10470 maybe_handle_implicit_object (&ics2
);
10472 /* Handle reference parameters. */
10473 ref_conv1
= maybe_handle_ref_bind (&ics1
);
10474 ref_conv2
= maybe_handle_ref_bind (&ics2
);
10476 /* List-initialization sequence L1 is a better conversion sequence than
10477 list-initialization sequence L2 if L1 converts to
10478 std::initializer_list<X> for some X and L2 does not. */
10479 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
10481 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
10486 When comparing the basic forms of implicit conversion sequences (as
10487 defined in _over.best.ics_)
10489 --a standard conversion sequence (_over.ics.scs_) is a better
10490 conversion sequence than a user-defined conversion sequence
10491 or an ellipsis conversion sequence, and
10493 --a user-defined conversion sequence (_over.ics.user_) is a
10494 better conversion sequence than an ellipsis conversion sequence
10495 (_over.ics.ellipsis_). */
10496 /* Use BAD_CONVERSION_RANK because we already checked for a badness
10497 mismatch. If both ICS are bad, we try to make a decision based on
10498 what would have happened if they'd been good. This is not an
10499 extension, we'll still give an error when we build up the call; this
10500 just helps us give a more helpful error message. */
10501 rank1
= BAD_CONVERSION_RANK (ics1
);
10502 rank2
= BAD_CONVERSION_RANK (ics2
);
10506 else if (rank1
< rank2
)
10509 if (ics1
->ellipsis_p
)
10510 /* Both conversions are ellipsis conversions. */
10513 /* User-defined conversion sequence U1 is a better conversion sequence
10514 than another user-defined conversion sequence U2 if they contain the
10515 same user-defined conversion operator or constructor and if the sec-
10516 ond standard conversion sequence of U1 is better than the second
10517 standard conversion sequence of U2. */
10519 /* Handle list-conversion with the same code even though it isn't always
10520 ranked as a user-defined conversion and it doesn't have a second
10521 standard conversion sequence; it will still have the desired effect.
10522 Specifically, we need to do the reference binding comparison at the
10523 end of this function. */
10525 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
10526 || ics1
->kind
== ck_aggr
|| ics2
->kind
== ck_aggr
)
10531 for (t1
= ics1
; t1
&& t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
10532 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
10533 || t1
->kind
== ck_list
)
10535 for (t2
= ics2
; t2
&& t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
10536 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
10537 || t2
->kind
== ck_list
)
10540 if (!t1
|| !t2
|| t1
->kind
!= t2
->kind
)
10542 else if (t1
->kind
== ck_user
)
10544 tree f1
= t1
->cand
? t1
->cand
->fn
: t1
->type
;
10545 tree f2
= t2
->cand
? t2
->cand
->fn
: t2
->type
;
10549 /* List-initialization sequence L1 is a better conversion sequence than
10550 list-initialization sequence L2 if
10552 -- L1 and L2 convert to arrays of the same element type, and either
10553 the number of elements n1 initialized by L1 is less than the number
10554 of elements n2 initialized by L2, or n1=n2 and L2 converts to an array
10555 of unknown bound and L1 does not. (Added in CWG 1307 and extended by
10557 else if (t1
->kind
== ck_aggr
10558 && TREE_CODE (t1
->type
) == ARRAY_TYPE
10559 && TREE_CODE (t2
->type
) == ARRAY_TYPE
)
10561 /* The type of the array elements must be the same. */
10562 if (!same_type_p (TREE_TYPE (t1
->type
), TREE_TYPE (t2
->type
)))
10565 tree n1
= nelts_initialized_by_list_init (t1
);
10566 tree n2
= nelts_initialized_by_list_init (t2
);
10567 if (tree_int_cst_lt (n1
, n2
))
10569 else if (tree_int_cst_lt (n2
, n1
))
10571 /* The n1 == n2 case. */
10572 bool c1
= conv_binds_to_array_of_unknown_bound (t1
);
10573 bool c2
= conv_binds_to_array_of_unknown_bound (t2
);
10576 else if (!c1
&& c2
)
10583 /* For ambiguous or aggregate conversions, use the target type as
10584 a proxy for the conversion function. */
10585 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
10589 /* We can just fall through here, after setting up
10590 FROM_TYPE1 and FROM_TYPE2. */
10591 from_type1
= t1
->type
;
10592 from_type2
= t2
->type
;
10599 /* We're dealing with two standard conversion sequences.
10603 Standard conversion sequence S1 is a better conversion
10604 sequence than standard conversion sequence S2 if
10606 --S1 is a proper subsequence of S2 (comparing the conversion
10607 sequences in the canonical form defined by _over.ics.scs_,
10608 excluding any Lvalue Transformation; the identity
10609 conversion sequence is considered to be a subsequence of
10610 any non-identity conversion sequence */
10613 while (t1
->kind
!= ck_identity
)
10614 t1
= next_conversion (t1
);
10615 from_type1
= t1
->type
;
10618 while (t2
->kind
!= ck_identity
)
10619 t2
= next_conversion (t2
);
10620 from_type2
= t2
->type
;
10623 /* One sequence can only be a subsequence of the other if they start with
10624 the same type. They can start with different types when comparing the
10625 second standard conversion sequence in two user-defined conversion
10627 if (same_type_p (from_type1
, from_type2
))
10629 if (is_subseq (ics1
, ics2
))
10631 if (is_subseq (ics2
, ics1
))
10639 --the rank of S1 is better than the rank of S2 (by the rules
10642 Standard conversion sequences are ordered by their ranks: an Exact
10643 Match is a better conversion than a Promotion, which is a better
10644 conversion than a Conversion.
10646 Two conversion sequences with the same rank are indistinguishable
10647 unless one of the following rules applies:
10649 --A conversion that does not a convert a pointer, pointer to member,
10650 or std::nullptr_t to bool is better than one that does.
10652 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
10653 so that we do not have to check it explicitly. */
10654 if (ics1
->rank
< ics2
->rank
)
10656 else if (ics2
->rank
< ics1
->rank
)
10659 to_type1
= ics1
->type
;
10660 to_type2
= ics2
->type
;
10662 /* A conversion from scalar arithmetic type to complex is worse than a
10663 conversion between scalar arithmetic types. */
10664 if (same_type_p (from_type1
, from_type2
)
10665 && ARITHMETIC_TYPE_P (from_type1
)
10666 && ARITHMETIC_TYPE_P (to_type1
)
10667 && ARITHMETIC_TYPE_P (to_type2
)
10668 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
10669 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
10671 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
10677 if (TYPE_PTR_P (from_type1
)
10678 && TYPE_PTR_P (from_type2
)
10679 && TYPE_PTR_P (to_type1
)
10680 && TYPE_PTR_P (to_type2
))
10682 deref_from_type1
= TREE_TYPE (from_type1
);
10683 deref_from_type2
= TREE_TYPE (from_type2
);
10684 deref_to_type1
= TREE_TYPE (to_type1
);
10685 deref_to_type2
= TREE_TYPE (to_type2
);
10687 /* The rules for pointers to members A::* are just like the rules
10688 for pointers A*, except opposite: if B is derived from A then
10689 A::* converts to B::*, not vice versa. For that reason, we
10690 switch the from_ and to_ variables here. */
10691 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
10692 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
10693 || (TYPE_PTRMEMFUNC_P (from_type1
)
10694 && TYPE_PTRMEMFUNC_P (from_type2
)
10695 && TYPE_PTRMEMFUNC_P (to_type1
)
10696 && TYPE_PTRMEMFUNC_P (to_type2
)))
10698 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
10699 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
10700 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
10701 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
10704 if (deref_from_type1
!= NULL_TREE
10705 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
10706 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
10708 /* This was one of the pointer or pointer-like conversions.
10712 --If class B is derived directly or indirectly from class A,
10713 conversion of B* to A* is better than conversion of B* to
10714 void*, and conversion of A* to void* is better than
10715 conversion of B* to void*. */
10716 if (VOID_TYPE_P (deref_to_type1
)
10717 && VOID_TYPE_P (deref_to_type2
))
10719 if (is_properly_derived_from (deref_from_type1
,
10722 else if (is_properly_derived_from (deref_from_type2
,
10726 else if (VOID_TYPE_P (deref_to_type1
)
10727 || VOID_TYPE_P (deref_to_type2
))
10729 if (same_type_p (deref_from_type1
, deref_from_type2
))
10731 if (VOID_TYPE_P (deref_to_type2
))
10733 if (is_properly_derived_from (deref_from_type1
,
10737 /* We know that DEREF_TO_TYPE1 is `void' here. */
10738 else if (is_properly_derived_from (deref_from_type1
,
10743 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
10744 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
10748 --If class B is derived directly or indirectly from class A
10749 and class C is derived directly or indirectly from B,
10751 --conversion of C* to B* is better than conversion of C* to
10754 --conversion of B* to A* is better than conversion of C* to
10756 if (same_type_p (deref_from_type1
, deref_from_type2
))
10758 if (is_properly_derived_from (deref_to_type1
,
10761 else if (is_properly_derived_from (deref_to_type2
,
10765 else if (same_type_p (deref_to_type1
, deref_to_type2
))
10767 if (is_properly_derived_from (deref_from_type2
,
10770 else if (is_properly_derived_from (deref_from_type1
,
10776 else if (CLASS_TYPE_P (non_reference (from_type1
))
10777 && same_type_p (from_type1
, from_type2
))
10779 tree from
= non_reference (from_type1
);
10783 --binding of an expression of type C to a reference of type
10784 B& is better than binding an expression of type C to a
10785 reference of type A&
10787 --conversion of C to B is better than conversion of C to A, */
10788 if (is_properly_derived_from (from
, to_type1
)
10789 && is_properly_derived_from (from
, to_type2
))
10791 if (is_properly_derived_from (to_type1
, to_type2
))
10793 else if (is_properly_derived_from (to_type2
, to_type1
))
10797 else if (CLASS_TYPE_P (non_reference (to_type1
))
10798 && same_type_p (to_type1
, to_type2
))
10800 tree to
= non_reference (to_type1
);
10804 --binding of an expression of type B to a reference of type
10805 A& is better than binding an expression of type C to a
10806 reference of type A&,
10808 --conversion of B to A is better than conversion of C to A */
10809 if (is_properly_derived_from (from_type1
, to
)
10810 && is_properly_derived_from (from_type2
, to
))
10812 if (is_properly_derived_from (from_type2
, from_type1
))
10814 else if (is_properly_derived_from (from_type1
, from_type2
))
10821 --S1 and S2 differ only in their qualification conversion and yield
10822 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
10823 qualification signature of type T1 is a proper subset of the cv-
10824 qualification signature of type T2 */
10825 if (ics1
->kind
== ck_qual
10826 && ics2
->kind
== ck_qual
10827 && same_type_p (from_type1
, from_type2
))
10829 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
10836 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
10837 to an implicit object parameter of a non-static member function
10838 declared without a ref-qualifier, and either S1 binds an lvalue
10839 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
10840 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
10841 draft standard, 13.3.3.2)
10843 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
10844 types to which the references refer are the same type except for
10845 top-level cv-qualifiers, and the type to which the reference
10846 initialized by S2 refers is more cv-qualified than the type to
10847 which the reference initialized by S1 refers.
10849 DR 1328 [over.match.best]: the context is an initialization by
10850 conversion function for direct reference binding (13.3.1.6) of a
10851 reference to function type, the return type of F1 is the same kind of
10852 reference (i.e. lvalue or rvalue) as the reference being initialized,
10853 and the return type of F2 is not. */
10855 if (ref_conv1
&& ref_conv2
)
10857 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
10858 && (ref_conv1
->rvaluedness_matches_p
10859 != ref_conv2
->rvaluedness_matches_p
)
10860 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
10861 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
10862 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
10864 if (ref_conv1
->bad_p
10865 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
10866 TREE_TYPE (ref_conv2
->type
)))
10867 /* Don't prefer a bad conversion that drops cv-quals to a bad
10868 conversion with the wrong rvalueness. */
10870 return (ref_conv1
->rvaluedness_matches_p
10871 - ref_conv2
->rvaluedness_matches_p
);
10874 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
10878 void f (int(&)[]), // (1)
10879 f (int(&)[1]), // (2)
10882 (2) is better than (1), but (3) should be equal to (1) and to
10883 (2). For that reason we don't use ck_qual for (1) which would
10884 give it the cr_exact rank while (3) remains ck_identity.
10885 Therefore we compare (1) and (2) here. For (1) we'll have
10887 ck_ref_bind <- ck_identity
10890 so to handle this we must look at ref_conv. */
10891 bool c1
= conv_binds_to_array_of_unknown_bound (ref_conv1
);
10892 bool c2
= conv_binds_to_array_of_unknown_bound (ref_conv2
);
10895 else if (!c1
&& c2
)
10898 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
10899 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
10900 if (ref_conv1
->bad_p
)
10902 /* Prefer the one that drops fewer cv-quals. */
10903 tree ftype
= next_conversion (ref_conv1
)->type
;
10904 int fquals
= cp_type_quals (ftype
);
10908 return comp_cv_qualification (q2
, q1
);
10915 -- A conversion that promotes an enumeration whose underlying type
10916 is fixed to its underlying type is better than one that promotes to
10917 the promoted underlying type, if the two are different. */
10918 if (ics1
->rank
== cr_promotion
10919 && ics2
->rank
== cr_promotion
10920 && UNSCOPED_ENUM_P (from_type1
)
10921 && ENUM_FIXED_UNDERLYING_TYPE_P (from_type1
)
10922 && same_type_p (from_type1
, from_type2
))
10924 tree utype
= ENUM_UNDERLYING_TYPE (from_type1
);
10925 tree prom
= type_promotes_to (from_type1
);
10926 if (!same_type_p (utype
, prom
))
10928 if (same_type_p (to_type1
, utype
)
10929 && same_type_p (to_type2
, prom
))
10931 else if (same_type_p (to_type2
, utype
)
10932 && same_type_p (to_type1
, prom
))
10937 /* Neither conversion sequence is better than the other. */
10941 /* The source type for this standard conversion sequence. */
10944 source_type (conversion
*t
)
10946 for (;; t
= next_conversion (t
))
10948 if (t
->kind
== ck_user
10949 || t
->kind
== ck_ambig
10950 || t
->kind
== ck_identity
)
10953 gcc_unreachable ();
10956 /* Note a warning about preferring WINNER to LOSER. We do this by storing
10957 a pointer to LOSER and re-running joust to produce the warning if WINNER
10958 is actually used. */
10961 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
10963 candidate_warning
*cw
= (candidate_warning
*)
10964 conversion_obstack_alloc (sizeof (candidate_warning
));
10966 cw
->next
= winner
->warnings
;
10967 winner
->warnings
= cw
;
10970 /* CAND is a constructor candidate in joust in C++17 and up. If it copies a
10971 prvalue returned from a conversion function, replace CAND with the candidate
10972 for the conversion and return true. Otherwise, return false. */
10975 joust_maybe_elide_copy (z_candidate
*&cand
)
10977 tree fn
= cand
->fn
;
10978 if (!DECL_COPY_CONSTRUCTOR_P (fn
) && !DECL_MOVE_CONSTRUCTOR_P (fn
))
10980 conversion
*conv
= cand
->convs
[0];
10981 gcc_checking_assert (conv
->kind
== ck_ref_bind
);
10982 conv
= next_conversion (conv
);
10983 if (conv
->kind
== ck_user
&& !TYPE_REF_P (conv
->type
))
10985 gcc_checking_assert (same_type_ignoring_top_level_qualifiers_p
10986 (conv
->type
, DECL_CONTEXT (fn
)));
10987 z_candidate
*uc
= conv
->cand
;
10988 if (DECL_CONV_FN_P (uc
->fn
))
10997 /* True if cand1 and cand2 represent the same function or function
11001 same_fn_or_template (z_candidate
*cand1
, z_candidate
*cand2
)
11003 if (cand1
->fn
== cand2
->fn
)
11005 if (!cand1
->template_decl
|| !cand2
->template_decl
)
11007 return (most_general_template (TI_TEMPLATE (cand1
->template_decl
))
11008 == most_general_template (TI_TEMPLATE (cand2
->template_decl
)));
11011 /* Compare two candidates for overloading as described in
11012 [over.match.best]. Return values:
11014 1: cand1 is better than cand2
11015 -1: cand2 is better than cand1
11016 0: cand1 and cand2 are indistinguishable */
11019 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
11020 tsubst_flags_t complain
)
11023 int off1
= 0, off2
= 0;
11027 /* Candidates that involve bad conversions are always worse than those
11029 if (cand1
->viable
> cand2
->viable
)
11031 if (cand1
->viable
< cand2
->viable
)
11034 /* If we have two pseudo-candidates for conversions to the same type,
11035 or two candidates for the same function, arbitrarily pick one. */
11036 if (cand1
->fn
== cand2
->fn
11037 && cand1
->reversed () == cand2
->reversed ()
11038 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
11041 /* Prefer a non-deleted function over an implicitly deleted move
11042 constructor or assignment operator. This differs slightly from the
11043 wording for issue 1402 (which says the move op is ignored by overload
11044 resolution), but this way produces better error messages. */
11045 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
11046 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
11047 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
11049 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
11050 && move_fn_p (cand1
->fn
))
11052 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
11053 && move_fn_p (cand2
->fn
))
11057 /* a viable function F1
11058 is defined to be a better function than another viable function F2 if
11059 for all arguments i, ICSi(F1) is not a worse conversion sequence than
11060 ICSi(F2), and then */
11062 /* for some argument j, ICSj(F1) is a better conversion sequence than
11065 /* For comparing static and non-static member functions, we ignore
11066 the implicit object parameter of the non-static function. The
11067 standard says to pretend that the static function has an object
11068 parm, but that won't work with operator overloading. */
11069 len
= cand1
->num_convs
;
11070 if (len
!= cand2
->num_convs
)
11072 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
11073 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
11075 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
11076 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
11077 /* We're comparing a near-match list constructor and a near-match
11078 non-list constructor. Just treat them as unordered. */
11081 gcc_assert (static_1
!= static_2
);
11092 /* Handle C++17 copy elision in [over.match.ctor] (direct-init) context. The
11093 standard currently says that only constructors are candidates, but if one
11094 copies a prvalue returned by a conversion function we want to treat the
11095 conversion as the candidate instead.
11097 Clang does something similar, as discussed at
11098 http://lists.isocpp.org/core/2017/10/3166.php
11099 http://lists.isocpp.org/core/2019/03/5721.php */
11100 int elided_tiebreaker
= 0;
11101 if (len
== 1 && cxx_dialect
>= cxx17
11102 && DECL_P (cand1
->fn
)
11103 && DECL_COMPLETE_CONSTRUCTOR_P (cand1
->fn
)
11104 && !(cand1
->flags
& LOOKUP_ONLYCONVERTING
))
11106 bool elided1
= joust_maybe_elide_copy (cand1
);
11107 bool elided2
= joust_maybe_elide_copy (cand2
);
11108 /* As a tiebreaker below we will prefer a constructor to a conversion
11109 operator exposed this way. */
11110 elided_tiebreaker
= elided2
- elided1
;
11113 for (i
= 0; i
< len
; ++i
)
11115 conversion
*t1
= cand1
->convs
[i
+ off1
];
11116 conversion
*t2
= cand2
->convs
[i
+ off2
];
11117 int comp
= compare_ics (t1
, t2
);
11121 if ((complain
& tf_warning
)
11123 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
11124 == cr_std
+ cr_promotion
)
11125 && t1
->kind
== ck_std
11126 && t2
->kind
== ck_std
11127 && TREE_CODE (t1
->type
) == INTEGER_TYPE
11128 && TREE_CODE (t2
->type
) == INTEGER_TYPE
11129 && (TYPE_PRECISION (t1
->type
)
11130 == TYPE_PRECISION (t2
->type
))
11131 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
11132 || (TREE_CODE (next_conversion (t1
)->type
)
11133 == ENUMERAL_TYPE
)))
11135 tree type
= next_conversion (t1
)->type
;
11137 struct z_candidate
*w
, *l
;
11139 type1
= t1
->type
, type2
= t2
->type
,
11140 w
= cand1
, l
= cand2
;
11142 type1
= t2
->type
, type2
= t1
->type
,
11143 w
= cand2
, l
= cand1
;
11147 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
11148 type
, type1
, type2
);
11149 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
11152 add_warning (w
, l
);
11155 if (winner
&& comp
!= winner
)
11157 if (same_fn_or_template (cand1
, cand2
))
11159 /* Ambiguity between normal and reversed versions of the
11160 same comparison operator; prefer the normal one.
11161 https://lists.isocpp.org/core/2019/10/7438.php */
11162 if (cand1
->reversed ())
11166 gcc_checking_assert (cand2
->reversed ());
11179 /* warn about confusing overload resolution for user-defined conversions,
11180 either between a constructor and a conversion op, or between two
11182 if ((complain
& tf_warning
)
11183 /* In C++17, the constructor might have been elided, which means that
11184 an originally null ->second_conv could become non-null. */
11185 && winner
&& warn_conversion
&& cand1
->second_conv
&& cand2
->second_conv
11186 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
11187 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
11189 struct z_candidate
*w
, *l
;
11190 bool give_warning
= false;
11193 w
= cand1
, l
= cand2
;
11195 w
= cand2
, l
= cand1
;
11197 /* We don't want to complain about `X::operator T1 ()'
11198 beating `X::operator T2 () const', when T2 is a no less
11199 cv-qualified version of T1. */
11200 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
11201 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
11203 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
11204 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
11206 if (TREE_CODE (t
) == TREE_CODE (f
) && INDIRECT_TYPE_P (t
))
11211 if (!comp_ptr_ttypes (t
, f
))
11212 give_warning
= true;
11215 give_warning
= true;
11221 tree source
= source_type (w
->convs
[0]);
11222 if (INDIRECT_TYPE_P (source
))
11223 source
= TREE_TYPE (source
);
11224 auto_diagnostic_group d
;
11225 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
11226 && warning (OPT_Wconversion
, " for conversion from %qH to %qI",
11227 source
, w
->second_conv
->type
))
11229 inform (input_location
, " because conversion sequence "
11230 "for the argument is better");
11234 add_warning (w
, l
);
11240 /* Put this tiebreaker first, so that we don't try to look at second_conv of
11241 a constructor candidate that doesn't have one. */
11242 if (elided_tiebreaker
)
11243 return elided_tiebreaker
;
11245 /* DR 495 moved this tiebreaker above the template ones. */
11246 /* or, if not that,
11247 the context is an initialization by user-defined conversion (see
11248 _dcl.init_ and _over.match.user_) and the standard conversion
11249 sequence from the return type of F1 to the destination type (i.e.,
11250 the type of the entity being initialized) is a better conversion
11251 sequence than the standard conversion sequence from the return type
11252 of F2 to the destination type. */
11254 if (cand1
->second_conv
)
11256 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
11261 /* or, if not that,
11262 F1 is a non-template function and F2 is a template function
11265 if (!cand1
->template_decl
&& cand2
->template_decl
)
11267 else if (cand1
->template_decl
&& !cand2
->template_decl
)
11270 /* or, if not that,
11271 F1 and F2 are template functions and the function template for F1 is
11272 more specialized than the template for F2 according to the partial
11275 if (cand1
->template_decl
&& cand2
->template_decl
)
11277 winner
= more_specialized_fn
11278 (TI_TEMPLATE (cand1
->template_decl
),
11279 TI_TEMPLATE (cand2
->template_decl
),
11280 /* [temp.func.order]: The presence of unused ellipsis and default
11281 arguments has no effect on the partial ordering of function
11282 templates. add_function_candidate() will not have
11283 counted the "this" argument for constructors. */
11284 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
11289 /* Concepts: ... or, if not that, F1 is more constrained than F2.
11291 FIXME: For function templates with no winner, this subsumption may
11292 be computed a separate time. This needs to be validated, and if
11293 so, the redundant check removed. */
11294 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
11296 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
11301 /* F2 is a rewritten candidate (12.4.1.2) and F1 is not, or F1 and F2 are
11302 rewritten candidates, and F2 is a synthesized candidate with reversed
11303 order of parameters and F1 is not. */
11304 if (cand1
->rewritten ())
11306 if (!cand2
->rewritten ())
11308 if (!cand1
->reversed () && cand2
->reversed ())
11310 if (cand1
->reversed () && !cand2
->reversed ())
11313 else if (cand2
->rewritten ())
11316 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
11317 if (deduction_guide_p (cand1
->fn
))
11319 gcc_assert (deduction_guide_p (cand2
->fn
));
11320 /* We distinguish between candidates from an explicit deduction guide and
11321 candidates built from a constructor based on DECL_ARTIFICIAL. */
11322 int art1
= DECL_ARTIFICIAL (cand1
->fn
);
11323 int art2
= DECL_ARTIFICIAL (cand2
->fn
);
11325 return art2
- art1
;
11329 /* Prefer the special copy guide over a declared copy/move
11331 if (copy_guide_p (cand1
->fn
))
11333 if (copy_guide_p (cand2
->fn
))
11336 /* Prefer a candidate generated from a non-template constructor. */
11337 int tg1
= template_guide_p (cand1
->fn
);
11338 int tg2
= template_guide_p (cand2
->fn
);
11344 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
11345 for all arguments the corresponding parameters of F1 and F2 have the same
11346 type (CWG 2273/2277). */
11347 if (DECL_P (cand1
->fn
) && DECL_CLASS_SCOPE_P (cand1
->fn
)
11348 && !DECL_CONV_FN_P (cand1
->fn
)
11349 && DECL_P (cand2
->fn
) && DECL_CLASS_SCOPE_P (cand2
->fn
)
11350 && !DECL_CONV_FN_P (cand2
->fn
))
11352 tree base1
= DECL_CONTEXT (strip_inheriting_ctors (cand1
->fn
));
11353 tree base2
= DECL_CONTEXT (strip_inheriting_ctors (cand2
->fn
));
11355 bool used1
= false;
11356 bool used2
= false;
11357 if (base1
== base2
)
11358 /* No difference. */;
11359 else if (DERIVED_FROM_P (base1
, base2
))
11361 else if (DERIVED_FROM_P (base2
, base1
))
11364 if (int diff
= used2
- used1
)
11366 for (i
= 0; i
< len
; ++i
)
11368 conversion
*t1
= cand1
->convs
[i
+ off1
];
11369 conversion
*t2
= cand2
->convs
[i
+ off2
];
11370 if (!same_type_p (t1
->type
, t2
->type
))
11378 /* Check whether we can discard a builtin candidate, either because we
11379 have two identical ones or matching builtin and non-builtin candidates.
11381 (Pedantically in the latter case the builtin which matched the user
11382 function should not be added to the overload set, but we spot it here.
11385 ... the builtin candidates include ...
11386 - do not have the same parameter type list as any non-template
11387 non-member candidate. */
11389 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
11391 for (i
= 0; i
< len
; ++i
)
11392 if (!same_type_p (cand1
->convs
[i
]->type
,
11393 cand2
->convs
[i
]->type
))
11395 if (i
== cand1
->num_convs
)
11397 if (cand1
->fn
== cand2
->fn
)
11398 /* Two built-in candidates; arbitrarily pick one. */
11400 else if (identifier_p (cand1
->fn
))
11401 /* cand1 is built-in; prefer cand2. */
11404 /* cand2 is built-in; prefer cand1. */
11409 /* For candidates of a multi-versioned function, make the version with
11410 the highest priority win. This version will be checked for dispatching
11411 first. If this version can be inlined into the caller, the front-end
11412 will simply make a direct call to this function. */
11414 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
11415 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
11416 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
11417 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
11419 tree f1
= TREE_TYPE (cand1
->fn
);
11420 tree f2
= TREE_TYPE (cand2
->fn
);
11421 tree p1
= TYPE_ARG_TYPES (f1
);
11422 tree p2
= TYPE_ARG_TYPES (f2
);
11424 /* Check if cand1->fn and cand2->fn are versions of the same function. It
11425 is possible that cand1->fn and cand2->fn are function versions but of
11426 different functions. Check types to see if they are versions of the same
11428 if (compparms (p1
, p2
)
11429 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
11431 /* Always make the version with the higher priority, more
11432 specialized, win. */
11433 gcc_assert (targetm
.compare_version_priority
);
11434 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
11441 /* If the two function declarations represent the same function (this can
11442 happen with declarations in multiple scopes and arg-dependent lookup),
11443 arbitrarily choose one. But first make sure the default args we're
11445 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
11446 && equal_functions (cand1
->fn
, cand2
->fn
))
11448 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
11449 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
11451 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
11453 for (i
= 0; i
< len
; ++i
)
11455 /* Don't crash if the fn is variadic. */
11458 parms1
= TREE_CHAIN (parms1
);
11459 parms2
= TREE_CHAIN (parms2
);
11463 parms1
= TREE_CHAIN (parms1
);
11465 parms2
= TREE_CHAIN (parms2
);
11467 for (; parms1
; ++i
)
11469 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
11470 TREE_PURPOSE (parms2
)))
11474 if (complain
& tf_error
)
11476 auto_diagnostic_group d
;
11477 if (permerror (input_location
,
11478 "default argument mismatch in "
11479 "overload resolution"))
11481 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
11482 " candidate 1: %q#F", cand1
->fn
);
11483 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
11484 " candidate 2: %q#F", cand2
->fn
);
11491 add_warning (cand1
, cand2
);
11494 parms1
= TREE_CHAIN (parms1
);
11495 parms2
= TREE_CHAIN (parms2
);
11503 /* Extension: If the worst conversion for one candidate is better than the
11504 worst conversion for the other, take the first. */
11505 if (!pedantic
&& (complain
& tf_warning_or_error
))
11507 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
11508 struct z_candidate
*w
= 0, *l
= 0;
11510 for (i
= 0; i
< len
; ++i
)
11512 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
11513 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
11514 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
11515 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
11518 winner
= 1, w
= cand1
, l
= cand2
;
11520 winner
= -1, w
= cand2
, l
= cand1
;
11523 /* Don't choose a deleted function over ambiguity. */
11524 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
11528 auto_diagnostic_group d
;
11529 if (pedwarn (input_location
, 0,
11530 "ISO C++ says that these are ambiguous, even "
11531 "though the worst conversion for the first is "
11532 "better than the worst conversion for the second:"))
11534 print_z_candidate (input_location
, N_("candidate 1:"), w
);
11535 print_z_candidate (input_location
, N_("candidate 2:"), l
);
11539 add_warning (w
, l
);
11544 gcc_assert (!winner
);
11548 /* Given a list of candidates for overloading, find the best one, if any.
11549 This algorithm has a worst case of O(2n) (winner is last), and a best
11550 case of O(n/2) (totally ambiguous); much better than a sorting
11553 static struct z_candidate
*
11554 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
11556 struct z_candidate
*champ
= candidates
, *challenger
;
11558 int champ_compared_to_predecessor
= 0;
11560 /* Walk through the list once, comparing each current champ to the next
11561 candidate, knocking out a candidate or two with each comparison. */
11563 for (challenger
= champ
->next
; challenger
; )
11565 fate
= joust (champ
, challenger
, 0, complain
);
11567 challenger
= challenger
->next
;
11572 champ
= challenger
->next
;
11575 champ_compared_to_predecessor
= 0;
11579 champ
= challenger
;
11580 champ_compared_to_predecessor
= 1;
11583 challenger
= champ
->next
;
11587 /* Make sure the champ is better than all the candidates it hasn't yet
11588 been compared to. */
11590 for (challenger
= candidates
;
11591 challenger
!= champ
11592 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
11593 challenger
= challenger
->next
)
11595 fate
= joust (champ
, challenger
, 0, complain
);
11603 /* Returns nonzero if things of type FROM can be converted to TO. */
11606 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
11608 tree arg
= NULL_TREE
;
11609 /* implicit_conversion only considers user-defined conversions
11610 if it has an expression for the call argument list. */
11611 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
11612 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
11613 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
11616 /* Returns nonzero if things of type FROM can be converted to TO with a
11617 standard conversion. */
11620 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
11622 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
11625 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
11628 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
11629 tsubst_flags_t complain
)
11635 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11636 p
= conversion_obstack_alloc (0);
11637 /* We want to discard any access checks done for this test,
11638 as we might not be in the appropriate access context and
11639 we'll do the check again when we actually perform the
11641 push_deferring_access_checks (dk_deferred
);
11643 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
11645 ok_p
= (t
&& !t
->bad_p
);
11647 /* Discard the access checks now. */
11648 pop_deferring_access_checks ();
11649 /* Free all the conversions we allocated. */
11650 obstack_free (&conversion_obstack
, p
);
11655 /* Like can_convert_arg, but allows dubious conversions as well. */
11658 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
11659 tsubst_flags_t complain
)
11664 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11665 p
= conversion_obstack_alloc (0);
11666 /* Try to perform the conversion. */
11667 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
11669 /* Free all the conversions we allocated. */
11670 obstack_free (&conversion_obstack
, p
);
11675 /* Convert EXPR to TYPE. Return the converted expression.
11677 Note that we allow bad conversions here because by the time we get to
11678 this point we are committed to doing the conversion. If we end up
11679 doing a bad conversion, convert_like will complain. */
11682 perform_implicit_conversion_flags (tree type
, tree expr
,
11683 tsubst_flags_t complain
, int flags
)
11687 location_t loc
= cp_expr_loc_or_input_loc (expr
);
11689 if (TYPE_REF_P (type
))
11690 expr
= mark_lvalue_use (expr
);
11692 expr
= mark_rvalue_use (expr
);
11694 if (error_operand_p (expr
))
11695 return error_mark_node
;
11697 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11698 p
= conversion_obstack_alloc (0);
11700 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
11701 /*c_cast_p=*/false,
11706 if (complain
& tf_error
)
11708 /* If expr has unknown type, then it is an overloaded function.
11709 Call instantiate_type to get good error messages. */
11710 if (TREE_TYPE (expr
) == unknown_type_node
)
11711 instantiate_type (type
, expr
, complain
);
11712 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
11713 /* We gave an error. */;
11716 range_label_for_type_mismatch
label (TREE_TYPE (expr
), type
);
11717 gcc_rich_location
rich_loc (loc
, &label
);
11718 error_at (&rich_loc
, "could not convert %qE from %qH to %qI",
11719 expr
, TREE_TYPE (expr
), type
);
11722 expr
= error_mark_node
;
11724 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
11726 /* In a template, we are only concerned about determining the
11727 type of non-dependent expressions, so we do not have to
11728 perform the actual conversion. But for initializers, we
11729 need to be able to perform it at instantiation
11730 (or instantiate_non_dependent_expr) time. */
11731 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
11732 if (!(flags
& LOOKUP_ONLYCONVERTING
))
11733 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
11734 if (flags
& LOOKUP_NO_NARROWING
)
11735 IMPLICIT_CONV_EXPR_BRACED_INIT (expr
) = true;
11738 expr
= convert_like (conv
, expr
, complain
);
11740 /* Free all the conversions we allocated. */
11741 obstack_free (&conversion_obstack
, p
);
11747 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
11749 return perform_implicit_conversion_flags (type
, expr
, complain
,
11753 /* Convert EXPR to TYPE (as a direct-initialization) if that is
11754 permitted. If the conversion is valid, the converted expression is
11755 returned. Otherwise, NULL_TREE is returned, except in the case
11756 that TYPE is a class type; in that case, an error is issued. If
11757 C_CAST_P is true, then this direct-initialization is taking
11758 place as part of a static_cast being attempted as part of a C-style
11762 perform_direct_initialization_if_possible (tree type
,
11765 tsubst_flags_t complain
)
11770 if (type
== error_mark_node
|| error_operand_p (expr
))
11771 return error_mark_node
;
11774 If the destination type is a (possibly cv-qualified) class type:
11776 -- If the initialization is direct-initialization ...,
11777 constructors are considered. ... If no constructor applies, or
11778 the overload resolution is ambiguous, the initialization is
11780 if (CLASS_TYPE_P (type
))
11782 releasing_vec
args (make_tree_vector_single (expr
));
11783 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
11784 &args
, type
, LOOKUP_NORMAL
, complain
);
11785 return build_cplus_new (type
, expr
, complain
);
11788 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11789 p
= conversion_obstack_alloc (0);
11791 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
11793 LOOKUP_NORMAL
, complain
);
11794 if (!conv
|| conv
->bad_p
)
11796 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
11798 /* In a template, we are only concerned about determining the
11799 type of non-dependent expressions, so we do not have to
11800 perform the actual conversion. But for initializers, we
11801 need to be able to perform it at instantiation
11802 (or instantiate_non_dependent_expr) time. */
11803 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
11804 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
11807 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0,
11808 /*issue_conversion_warnings=*/false,
11812 /* Free all the conversions we allocated. */
11813 obstack_free (&conversion_obstack
, p
);
11818 /* When initializing a reference that lasts longer than a full-expression,
11819 this special rule applies:
11823 The temporary to which the reference is bound or the temporary
11824 that is the complete object to which the reference is bound
11825 persists for the lifetime of the reference.
11827 The temporaries created during the evaluation of the expression
11828 initializing the reference, except the temporary to which the
11829 reference is bound, are destroyed at the end of the
11830 full-expression in which they are created.
11832 In that case, we store the converted expression into a new
11833 VAR_DECL in a new scope.
11835 However, we want to be careful not to create temporaries when
11836 they are not required. For example, given:
11839 struct D : public B {};
11843 there is no need to copy the return value from "f"; we can just
11844 extend its lifetime. Similarly, given:
11847 struct T { operator S(); };
11851 we can extend the lifetime of the return value of the conversion
11854 The next several functions are involved in this lifetime extension. */
11856 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
11857 reference is being bound to a temporary. Create and return a new
11858 VAR_DECL with the indicated TYPE; this variable will store the value to
11859 which the reference is bound. */
11862 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
11864 tree var
= create_temporary_var (type
);
11866 /* Register the variable. */
11868 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
11870 /* Namespace-scope or local static; give it a mangled name. */
11872 /* If an initializer is visible to multiple translation units, those
11873 translation units must agree on the addresses of the
11874 temporaries. Therefore the temporaries must be given a consistent name
11875 and vague linkage. The mangled name of a temporary is the name of the
11876 non-temporary object in whose initializer they appear, prefixed with
11877 GR and suffixed with a sequence number mangled using the usual rules
11878 for a seq-id. Temporaries are numbered with a pre-order, depth-first,
11879 left-to-right walk of the complete initializer. */
11881 TREE_STATIC (var
) = TREE_STATIC (decl
);
11882 TREE_PUBLIC (var
) = TREE_PUBLIC (decl
);
11883 if (vague_linkage_p (decl
))
11884 comdat_linkage (var
);
11886 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
11887 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
11889 tree name
= mangle_ref_init_variable (decl
);
11890 DECL_NAME (var
) = name
;
11891 SET_DECL_ASSEMBLER_NAME (var
, name
);
11894 /* Create a new cleanup level if necessary. */
11895 maybe_push_cleanup_level (type
);
11897 return pushdecl (var
);
11900 /* EXPR is the initializer for a variable DECL of reference or
11901 std::initializer_list type. Create, push and return a new VAR_DECL
11902 for the initializer so that it will live as long as DECL. Any
11903 cleanup for the new variable is returned through CLEANUP, and the
11904 code to initialize the new variable is returned through INITP. */
11907 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
11914 /* Create the temporary variable. */
11915 type
= TREE_TYPE (expr
);
11916 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
11917 layout_decl (var
, 0);
11918 /* If the rvalue is the result of a function call it will be
11919 a TARGET_EXPR. If it is some other construct (such as a
11920 member access expression where the underlying object is
11921 itself the result of a function call), turn it into a
11922 TARGET_EXPR here. It is important that EXPR be a
11923 TARGET_EXPR below since otherwise the INIT_EXPR will
11924 attempt to make a bitwise copy of EXPR to initialize
11926 if (TREE_CODE (expr
) != TARGET_EXPR
)
11927 expr
= get_target_expr (expr
);
11929 if (TREE_CODE (decl
) == FIELD_DECL
11930 && extra_warnings
&& !TREE_NO_WARNING (decl
))
11932 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
11933 "until the constructor exits", decl
);
11934 TREE_NO_WARNING (decl
) = true;
11937 /* Recursively extend temps in this initializer. */
11938 TARGET_EXPR_INITIAL (expr
)
11939 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
11941 /* Any reference temp has a non-trivial initializer. */
11942 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
11944 /* If the initializer is constant, put it in DECL_INITIAL so we get
11945 static initialization and use in constant expressions. */
11946 init
= maybe_constant_init (expr
);
11947 /* As in store_init_value. */
11948 init
= cp_fully_fold (init
);
11949 if (TREE_CONSTANT (init
))
11951 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
11953 /* 5.19 says that a constant expression can include an
11954 lvalue-rvalue conversion applied to "a glvalue of literal type
11955 that refers to a non-volatile temporary object initialized
11956 with a constant expression". Rather than try to communicate
11957 that this VAR_DECL is a temporary, just mark it constexpr. */
11958 DECL_DECLARED_CONSTEXPR_P (var
) = true;
11959 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
11960 TREE_CONSTANT (var
) = true;
11961 TREE_READONLY (var
) = true;
11963 DECL_INITIAL (var
) = init
;
11967 /* Create the INIT_EXPR that will initialize the temporary
11969 init
= split_nonconstant_init (var
, expr
);
11970 if (at_function_scope_p ())
11972 add_decl_expr (var
);
11974 if (TREE_STATIC (var
))
11975 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
11978 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11980 vec_safe_push (*cleanups
, cleanup
);
11983 /* We must be careful to destroy the temporary only
11984 after its initialization has taken place. If the
11985 initialization throws an exception, then the
11986 destructor should not be run. We cannot simply
11987 transform INIT into something like:
11989 (INIT, ({ CLEANUP_STMT; }))
11991 because emit_local_var always treats the
11992 initializer as a full-expression. Thus, the
11993 destructor would run too early; it would run at the
11994 end of initializing the reference variable, rather
11995 than at the end of the block enclosing the
11996 reference variable.
11998 The solution is to pass back a cleanup expression
11999 which the caller is responsible for attaching to
12000 the statement tree. */
12004 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
12005 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
12007 if (CP_DECL_THREAD_LOCAL_P (var
))
12008 tls_aggregates
= tree_cons (NULL_TREE
, var
,
12011 static_aggregates
= tree_cons (NULL_TREE
, var
,
12012 static_aggregates
);
12015 /* Check whether the dtor is callable. */
12016 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
12018 /* Avoid -Wunused-variable warning (c++/38958). */
12019 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
12021 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
12027 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
12028 initializing a variable of that TYPE. */
12031 initialize_reference (tree type
, tree expr
,
12032 int flags
, tsubst_flags_t complain
)
12036 location_t loc
= cp_expr_loc_or_input_loc (expr
);
12038 if (type
== error_mark_node
|| error_operand_p (expr
))
12039 return error_mark_node
;
12041 /* Get the high-water mark for the CONVERSION_OBSTACK. */
12042 p
= conversion_obstack_alloc (0);
12044 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
12046 if (!conv
|| conv
->bad_p
)
12048 if (complain
& tf_error
)
12051 convert_like (conv
, expr
, complain
);
12052 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
12053 && !TYPE_REF_IS_RVALUE (type
)
12054 && !lvalue_p (expr
))
12055 error_at (loc
, "invalid initialization of non-const reference of "
12056 "type %qH from an rvalue of type %qI",
12057 type
, TREE_TYPE (expr
));
12059 error_at (loc
, "invalid initialization of reference of type "
12060 "%qH from expression of type %qI", type
,
12063 return error_mark_node
;
12066 if (conv
->kind
== ck_ref_bind
)
12067 /* Perform the conversion. */
12068 expr
= convert_like (conv
, expr
, complain
);
12069 else if (conv
->kind
== ck_ambig
)
12070 /* We gave an error in build_user_type_conversion_1. */
12071 expr
= error_mark_node
;
12073 gcc_unreachable ();
12075 /* Free all the conversions we allocated. */
12076 obstack_free (&conversion_obstack
, p
);
12081 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
12082 which is bound either to a reference or a std::initializer_list. */
12085 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
12090 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
12092 TREE_OPERAND (sub
, 1)
12093 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
12096 if (TREE_CODE (sub
) != ADDR_EXPR
)
12098 /* Deal with binding to a subobject. */
12099 for (p
= &TREE_OPERAND (sub
, 0);
12100 (TREE_CODE (*p
) == COMPONENT_REF
12101 || TREE_CODE (*p
) == ARRAY_REF
); )
12102 p
= &TREE_OPERAND (*p
, 0);
12103 if (TREE_CODE (*p
) == TARGET_EXPR
)
12105 tree subinit
= NULL_TREE
;
12106 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
12107 recompute_tree_invariant_for_addr_expr (sub
);
12109 init
= fold_convert (TREE_TYPE (init
), sub
);
12111 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
12116 /* INIT is part of the initializer for DECL. If there are any
12117 reference or initializer lists being initialized, extend their
12118 lifetime to match that of DECL. */
12121 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
12123 tree type
= TREE_TYPE (init
);
12124 if (processing_template_decl
)
12126 if (TYPE_REF_P (type
))
12127 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
12131 if (TREE_CODE (ctor
) == TARGET_EXPR
)
12132 ctor
= TARGET_EXPR_INITIAL (ctor
);
12133 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
12135 if (is_std_init_list (type
))
12137 /* The temporary array underlying a std::initializer_list
12138 is handled like a reference temporary. */
12139 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
12140 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
12141 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
12146 constructor_elt
*p
;
12147 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (ctor
);
12148 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
12149 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
12151 recompute_constructor_flags (ctor
);
12152 if (decl_maybe_constant_var_p (decl
) && TREE_CONSTANT (ctor
))
12153 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
12160 /* Returns true iff an initializer for TYPE could contain temporaries that
12161 need to be extended because they are bound to references or
12162 std::initializer_list. */
12165 type_has_extended_temps (tree type
)
12167 type
= strip_array_types (type
);
12168 if (TYPE_REF_P (type
))
12170 if (CLASS_TYPE_P (type
))
12172 if (is_std_init_list (type
))
12174 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
12175 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
12176 if (type_has_extended_temps (TREE_TYPE (f
)))
12182 /* Returns true iff TYPE is some variant of std::initializer_list. */
12185 is_std_init_list (tree type
)
12187 if (!TYPE_P (type
))
12189 if (cxx_dialect
== cxx98
)
12191 /* Look through typedefs. */
12192 type
= TYPE_MAIN_VARIANT (type
);
12193 return (CLASS_TYPE_P (type
)
12194 && CP_TYPE_CONTEXT (type
) == std_node
12195 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
)));
12198 /* Returns true iff DECL is a list constructor: i.e. a constructor which
12199 will accept an argument list of a single std::initializer_list<T>. */
12202 is_list_ctor (tree decl
)
12204 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
12207 if (!args
|| args
== void_list_node
)
12210 arg
= non_reference (TREE_VALUE (args
));
12211 if (!is_std_init_list (arg
))
12214 args
= TREE_CHAIN (args
);
12216 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
12217 /* There are more non-defaulted parms. */
12223 #include "gt-cp-call.h"