1 /* Functions related to invoking -*- C++ -*- methods and overloaded functions.
2 Copyright (C) 1987-2019 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com) and
4 modified by Brendan Kehoe (brendan@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
23 /* High-level class interface. */
27 #include "coretypes.h"
31 #include "stringpool.h"
33 #include "stor-layout.h"
34 #include "trans-mem.h"
39 #include "langhooks.h"
40 #include "c-family/c-objc.h"
41 #include "internal-fn.h"
42 #include "stringpool.h"
44 #include "gcc-rich-location.h"
46 /* The various kinds of conversion. */
48 enum conversion_kind
{
65 /* The rank of the conversion. Order of the enumerals matters; better
66 conversions should come earlier in the list. */
68 enum conversion_rank
{
79 /* An implicit conversion sequence, in the sense of [over.best.ics].
80 The first conversion to be performed is at the end of the chain.
81 That conversion is always a cr_identity conversion. */
84 /* The kind of conversion represented by this step. */
86 /* The rank of this conversion. */
88 BOOL_BITFIELD user_conv_p
: 1;
89 BOOL_BITFIELD ellipsis_p
: 1;
90 BOOL_BITFIELD this_p
: 1;
91 /* True if this conversion would be permitted with a bending of
92 language standards, e.g. disregarding pointer qualifiers or
93 converting integers to pointers. */
94 BOOL_BITFIELD bad_p
: 1;
95 /* If KIND is ck_ref_bind ck_base_conv, true to indicate that a
96 temporary should be created to hold the result of the
97 conversion. If KIND is ck_ambig or ck_user, true means force
98 copy-initialization. */
99 BOOL_BITFIELD need_temporary_p
: 1;
100 /* If KIND is ck_ptr or ck_pmem, true to indicate that a conversion
101 from a pointer-to-derived to pointer-to-base is being performed. */
102 BOOL_BITFIELD base_p
: 1;
103 /* If KIND is ck_ref_bind, true when either an lvalue reference is
104 being bound to an lvalue expression or an rvalue reference is
105 being bound to an rvalue expression. If KIND is ck_rvalue or ck_base,
106 true when we are treating an lvalue as an rvalue (12.8p33). If
107 ck_identity, we will be binding a reference directly or decaying to
109 BOOL_BITFIELD rvaluedness_matches_p
: 1;
110 BOOL_BITFIELD check_narrowing
: 1;
111 /* Whether check_narrowing should only check TREE_CONSTANTs; used
112 in build_converted_constant_expr. */
113 BOOL_BITFIELD check_narrowing_const_only
: 1;
114 /* The type of the expression resulting from the conversion. */
117 /* The next conversion in the chain. Since the conversions are
118 arranged from outermost to innermost, the NEXT conversion will
119 actually be performed before this conversion. This variant is
120 used only when KIND is neither ck_identity, ck_ambig nor
121 ck_list. Please use the next_conversion function instead
122 of using this field directly. */
124 /* The expression at the beginning of the conversion chain. This
125 variant is used only if KIND is ck_identity or ck_ambig. */
127 /* The array of conversions for an initializer_list, so this
128 variant is used only when KIN D is ck_list. */
131 /* The function candidate corresponding to this conversion
132 sequence. This field is only used if KIND is ck_user. */
133 struct z_candidate
*cand
;
136 #define CONVERSION_RANK(NODE) \
137 ((NODE)->bad_p ? cr_bad \
138 : (NODE)->ellipsis_p ? cr_ellipsis \
139 : (NODE)->user_conv_p ? cr_user \
142 #define BAD_CONVERSION_RANK(NODE) \
143 ((NODE)->ellipsis_p ? cr_ellipsis \
144 : (NODE)->user_conv_p ? cr_user \
147 static struct obstack conversion_obstack
;
148 static bool conversion_obstack_initialized
;
149 struct rejection_reason
;
151 static struct z_candidate
* tourney (struct z_candidate
*, tsubst_flags_t
);
152 static int equal_functions (tree
, tree
);
153 static int joust (struct z_candidate
*, struct z_candidate
*, bool,
155 static int compare_ics (conversion
*, conversion
*);
156 static void maybe_warn_class_memaccess (location_t
, tree
,
157 const vec
<tree
, va_gc
> *);
158 static tree
build_over_call (struct z_candidate
*, int, tsubst_flags_t
);
159 #define convert_like(CONV, EXPR, COMPLAIN) \
160 convert_like_real ((CONV), (EXPR), NULL_TREE, 0, \
161 /*issue_conversion_warnings=*/true, \
162 /*c_cast_p=*/false, (COMPLAIN))
163 #define convert_like_with_context(CONV, EXPR, FN, ARGNO, COMPLAIN ) \
164 convert_like_real ((CONV), (EXPR), (FN), (ARGNO), \
165 /*issue_conversion_warnings=*/true, \
166 /*c_cast_p=*/false, (COMPLAIN))
167 static tree
convert_like_real (conversion
*, tree
, tree
, int, bool,
168 bool, tsubst_flags_t
);
169 static void op_error (const op_location_t
&, enum tree_code
, enum tree_code
,
170 tree
, tree
, tree
, bool);
171 static struct z_candidate
*build_user_type_conversion_1 (tree
, tree
, int,
173 static void print_z_candidate (location_t
, const char *, struct z_candidate
*);
174 static void print_z_candidates (location_t
, struct z_candidate
*);
175 static tree
build_this (tree
);
176 static struct z_candidate
*splice_viable (struct z_candidate
*, bool, bool *);
177 static bool any_strictly_viable (struct z_candidate
*);
178 static struct z_candidate
*add_template_candidate
179 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
180 tree
, tree
, tree
, int, unification_kind_t
, tsubst_flags_t
);
181 static struct z_candidate
*add_template_candidate_real
182 (struct z_candidate
**, tree
, tree
, tree
, tree
, const vec
<tree
, va_gc
> *,
183 tree
, tree
, tree
, int, tree
, unification_kind_t
, tsubst_flags_t
);
184 static void add_builtin_candidates
185 (struct z_candidate
**, enum tree_code
, enum tree_code
,
186 tree
, tree
*, int, tsubst_flags_t
);
187 static void add_builtin_candidate
188 (struct z_candidate
**, enum tree_code
, enum tree_code
,
189 tree
, tree
, tree
, tree
*, tree
*, int, tsubst_flags_t
);
190 static bool is_complete (tree
);
191 static void build_builtin_candidate
192 (struct z_candidate
**, tree
, tree
, tree
, tree
*, tree
*,
193 int, tsubst_flags_t
);
194 static struct z_candidate
*add_conv_candidate
195 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
196 tree
, tsubst_flags_t
);
197 static struct z_candidate
*add_function_candidate
198 (struct z_candidate
**, tree
, tree
, tree
, const vec
<tree
, va_gc
> *, tree
,
199 tree
, int, conversion
**, tsubst_flags_t
);
200 static conversion
*implicit_conversion (tree
, tree
, tree
, bool, int,
202 static conversion
*reference_binding (tree
, tree
, tree
, bool, int,
204 static conversion
*build_conv (conversion_kind
, tree
, conversion
*);
205 static conversion
*build_list_conv (tree
, tree
, int, tsubst_flags_t
);
206 static conversion
*next_conversion (conversion
*);
207 static bool is_subseq (conversion
*, conversion
*);
208 static conversion
*maybe_handle_ref_bind (conversion
**);
209 static void maybe_handle_implicit_object (conversion
**);
210 static struct z_candidate
*add_candidate
211 (struct z_candidate
**, tree
, tree
, const vec
<tree
, va_gc
> *, size_t,
212 conversion
**, tree
, tree
, int, struct rejection_reason
*, int);
213 static tree
source_type (conversion
*);
214 static void add_warning (struct z_candidate
*, struct z_candidate
*);
215 static bool reference_compatible_p (tree
, tree
);
216 static conversion
*direct_reference_binding (tree
, conversion
*);
217 static bool promoted_arithmetic_type_p (tree
);
218 static conversion
*conditional_conversion (tree
, tree
, tsubst_flags_t
);
219 static char *name_as_c_string (tree
, tree
, bool *);
220 static tree
prep_operand (tree
);
221 static void add_candidates (tree
, tree
, const vec
<tree
, va_gc
> *, tree
, tree
,
222 bool, tree
, tree
, int, struct z_candidate
**,
224 static conversion
*merge_conversion_sequences (conversion
*, conversion
*);
225 static tree
build_temp (tree
, tree
, int, diagnostic_t
*, tsubst_flags_t
);
227 /* Returns nonzero iff the destructor name specified in NAME matches BASETYPE.
228 NAME can take many forms... */
231 check_dtor_name (tree basetype
, tree name
)
233 /* Just accept something we've already complained about. */
234 if (name
== error_mark_node
)
237 if (TREE_CODE (name
) == TYPE_DECL
)
238 name
= TREE_TYPE (name
);
239 else if (TYPE_P (name
))
241 else if (identifier_p (name
))
243 if ((MAYBE_CLASS_TYPE_P (basetype
)
244 || TREE_CODE (basetype
) == ENUMERAL_TYPE
)
245 && name
== constructor_name (basetype
))
248 name
= get_type_value (name
);
254 template <class T> struct S { ~S(); };
258 NAME will be a class template. */
259 gcc_assert (DECL_CLASS_TEMPLATE_P (name
));
263 if (!name
|| name
== error_mark_node
)
265 return same_type_p (TYPE_MAIN_VARIANT (basetype
), TYPE_MAIN_VARIANT (name
));
268 /* We want the address of a function or method. We avoid creating a
269 pointer-to-member function. */
272 build_addr_func (tree function
, tsubst_flags_t complain
)
274 tree type
= TREE_TYPE (function
);
276 /* We have to do these by hand to avoid real pointer to member
278 if (TREE_CODE (type
) == METHOD_TYPE
)
280 if (TREE_CODE (function
) == OFFSET_REF
)
282 tree object
= build_address (TREE_OPERAND (function
, 0));
283 return get_member_function_from_ptrfunc (&object
,
284 TREE_OPERAND (function
, 1),
287 function
= build_address (function
);
290 function
= decay_conversion (function
, complain
, /*reject_builtin=*/false);
295 /* Build a CALL_EXPR, we can handle FUNCTION_TYPEs, METHOD_TYPEs, or
296 POINTER_TYPE to those. Note, pointer to member function types
297 (TYPE_PTRMEMFUNC_P) must be handled by our callers. There are
298 two variants. build_call_a is the primitive taking an array of
299 arguments, while build_call_n is a wrapper that handles varargs. */
302 build_call_n (tree function
, int n
, ...)
305 return build_call_a (function
, 0, NULL
);
308 tree
*argarray
= XALLOCAVEC (tree
, n
);
313 for (i
= 0; i
< n
; i
++)
314 argarray
[i
] = va_arg (ap
, tree
);
316 return build_call_a (function
, n
, argarray
);
320 /* Update various flags in cfun and the call itself based on what is being
321 called. Split out of build_call_a so that bot_manip can use it too. */
324 set_flags_from_callee (tree call
)
326 /* Handle both CALL_EXPRs and AGGR_INIT_EXPRs. */
327 tree decl
= cp_get_callee_fndecl_nofold (call
);
329 /* We check both the decl and the type; a function may be known not to
330 throw without being declared throw(). */
331 bool nothrow
= decl
&& TREE_NOTHROW (decl
);
332 tree callee
= cp_get_callee (call
);
334 nothrow
|= TYPE_NOTHROW_P (TREE_TYPE (TREE_TYPE (callee
)));
335 else if (TREE_CODE (call
) == CALL_EXPR
336 && internal_fn_flags (CALL_EXPR_IFN (call
)) & ECF_NOTHROW
)
339 if (!nothrow
&& at_function_scope_p () && cfun
&& cp_function_chain
)
340 cp_function_chain
->can_throw
= 1;
342 if (decl
&& TREE_THIS_VOLATILE (decl
) && cfun
&& cp_function_chain
)
343 current_function_returns_abnormally
= 1;
345 TREE_NOTHROW (call
) = nothrow
;
349 build_call_a (tree function
, int n
, tree
*argarray
)
356 function
= build_addr_func (function
, tf_warning_or_error
);
358 gcc_assert (TYPE_PTR_P (TREE_TYPE (function
)));
359 fntype
= TREE_TYPE (TREE_TYPE (function
));
360 gcc_assert (TREE_CODE (fntype
) == FUNCTION_TYPE
361 || TREE_CODE (fntype
) == METHOD_TYPE
);
362 result_type
= TREE_TYPE (fntype
);
363 /* An rvalue has no cv-qualifiers. */
364 if (SCALAR_TYPE_P (result_type
) || VOID_TYPE_P (result_type
))
365 result_type
= cv_unqualified (result_type
);
367 function
= build_call_array_loc (input_location
,
368 result_type
, function
, n
, argarray
);
369 set_flags_from_callee (function
);
371 decl
= get_callee_fndecl (function
);
373 if (decl
&& !TREE_USED (decl
))
375 /* We invoke build_call directly for several library
376 functions. These may have been declared normally if
377 we're building libgcc, so we can't just check
379 gcc_assert (DECL_ARTIFICIAL (decl
)
380 || !strncmp (IDENTIFIER_POINTER (DECL_NAME (decl
)),
385 require_complete_eh_spec_types (fntype
, decl
);
387 TREE_HAS_CONSTRUCTOR (function
) = (decl
&& DECL_CONSTRUCTOR_P (decl
));
389 /* Don't pass empty class objects by value. This is useful
390 for tags in STL, which are used to control overload resolution.
391 We don't need to handle other cases of copying empty classes. */
392 if (!decl
|| !fndecl_built_in_p (decl
))
393 for (i
= 0; i
< n
; i
++)
395 tree arg
= CALL_EXPR_ARG (function
, i
);
396 if (is_empty_class (TREE_TYPE (arg
))
397 && ! TREE_ADDRESSABLE (TREE_TYPE (arg
)))
399 tree t
= build0 (EMPTY_CLASS_EXPR
, TREE_TYPE (arg
));
400 arg
= build2 (COMPOUND_EXPR
, TREE_TYPE (t
), arg
, t
);
401 CALL_EXPR_ARG (function
, i
) = arg
;
408 /* New overloading code. */
412 struct candidate_warning
{
414 candidate_warning
*next
;
417 /* Information for providing diagnostics about why overloading failed. */
419 enum rejection_reason_code
{
422 rr_explicit_conversion
,
423 rr_template_conversion
,
425 rr_bad_arg_conversion
,
426 rr_template_unification
,
429 rr_constraint_failure
432 struct conversion_info
{
433 /* The index of the argument, 0-based. */
435 /* The actual argument or its type. */
437 /* The type of the parameter. */
439 /* The location of the argument. */
443 struct rejection_reason
{
444 enum rejection_reason_code code
;
446 /* Information about an arity mismatch. */
448 /* The expected number of arguments. */
450 /* The actual number of arguments in the call. */
452 /* Whether the call was a varargs call. */
455 /* Information about an argument conversion mismatch. */
456 struct conversion_info conversion
;
457 /* Same, but for bad argument conversions. */
458 struct conversion_info bad_conversion
;
459 /* Information about template unification failures. These are the
460 parameters passed to fn_type_unification. */
468 unification_kind_t strict
;
470 } template_unification
;
471 /* Information about template instantiation failures. These are the
472 parameters passed to instantiate_template. */
476 } template_instantiation
;
481 /* The FUNCTION_DECL that will be called if this candidate is
482 selected by overload resolution. */
484 /* If not NULL_TREE, the first argument to use when calling this
487 /* The rest of the arguments to use when calling this function. If
488 there are no further arguments this may be NULL or it may be an
490 const vec
<tree
, va_gc
> *args
;
491 /* The implicit conversion sequences for each of the arguments to
494 /* The number of implicit conversion sequences. */
496 /* If FN is a user-defined conversion, the standard conversion
497 sequence from the type returned by FN to the desired destination
499 conversion
*second_conv
;
500 struct rejection_reason
*reason
;
501 /* If FN is a member function, the binfo indicating the path used to
502 qualify the name of FN at the call site. This path is used to
503 determine whether or not FN is accessible if it is selected by
504 overload resolution. The DECL_CONTEXT of FN will always be a
505 (possibly improper) base of this binfo. */
507 /* If FN is a non-static member function, the binfo indicating the
508 subobject to which the `this' pointer should be converted if FN
509 is selected by overload resolution. The type pointed to by
510 the `this' pointer must correspond to the most derived class
511 indicated by the CONVERSION_PATH. */
512 tree conversion_path
;
515 candidate_warning
*warnings
;
519 /* The flags active in add_candidate. */
523 /* Returns true iff T is a null pointer constant in the sense of
527 null_ptr_cst_p (tree t
)
529 tree type
= TREE_TYPE (t
);
533 A null pointer constant is an integral constant expression
534 (_expr.const_) rvalue of integer type that evaluates to zero or
535 an rvalue of type std::nullptr_t. */
536 if (NULLPTR_TYPE_P (type
))
539 if (cxx_dialect
>= cxx11
)
541 STRIP_ANY_LOCATION_WRAPPER (t
);
543 /* Core issue 903 says only literal 0 is a null pointer constant. */
544 if (TREE_CODE (type
) == INTEGER_TYPE
545 && !char_type_p (type
)
546 && TREE_CODE (t
) == INTEGER_CST
548 && !TREE_OVERFLOW (t
))
551 else if (CP_INTEGRAL_TYPE_P (type
))
553 t
= fold_non_dependent_expr (t
, tf_none
);
555 if (integer_zerop (t
) && !TREE_OVERFLOW (t
))
562 /* Returns true iff T is a null member pointer value (4.11). */
565 null_member_pointer_value_p (tree t
)
567 tree type
= TREE_TYPE (t
);
570 else if (TYPE_PTRMEMFUNC_P (type
))
571 return (TREE_CODE (t
) == CONSTRUCTOR
572 && integer_zerop (CONSTRUCTOR_ELT (t
, 0)->value
));
573 else if (TYPE_PTRDATAMEM_P (type
))
574 return integer_all_onesp (t
);
579 /* Returns nonzero if PARMLIST consists of only default parms,
580 ellipsis, and/or undeduced parameter packs. */
583 sufficient_parms_p (const_tree parmlist
)
585 for (; parmlist
&& parmlist
!= void_list_node
;
586 parmlist
= TREE_CHAIN (parmlist
))
587 if (!TREE_PURPOSE (parmlist
)
588 && !PACK_EXPANSION_P (TREE_VALUE (parmlist
)))
593 /* Allocate N bytes of memory from the conversion obstack. The memory
594 is zeroed before being returned. */
597 conversion_obstack_alloc (size_t n
)
600 if (!conversion_obstack_initialized
)
602 gcc_obstack_init (&conversion_obstack
);
603 conversion_obstack_initialized
= true;
605 p
= obstack_alloc (&conversion_obstack
, n
);
610 /* Allocate rejection reasons. */
612 static struct rejection_reason
*
613 alloc_rejection (enum rejection_reason_code code
)
615 struct rejection_reason
*p
;
616 p
= (struct rejection_reason
*) conversion_obstack_alloc (sizeof *p
);
621 static struct rejection_reason
*
622 arity_rejection (tree first_arg
, int expected
, int actual
)
624 struct rejection_reason
*r
= alloc_rejection (rr_arity
);
625 int adjust
= first_arg
!= NULL_TREE
;
626 r
->u
.arity
.expected
= expected
- adjust
;
627 r
->u
.arity
.actual
= actual
- adjust
;
631 static struct rejection_reason
*
632 arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
,
635 struct rejection_reason
*r
= alloc_rejection (rr_arg_conversion
);
636 int adjust
= first_arg
!= NULL_TREE
;
637 r
->u
.conversion
.n_arg
= n_arg
- adjust
;
638 r
->u
.conversion
.from
= from
;
639 r
->u
.conversion
.to_type
= to
;
640 r
->u
.conversion
.loc
= loc
;
644 static struct rejection_reason
*
645 bad_arg_conversion_rejection (tree first_arg
, int n_arg
, tree from
, tree to
,
648 struct rejection_reason
*r
= alloc_rejection (rr_bad_arg_conversion
);
649 int adjust
= first_arg
!= NULL_TREE
;
650 r
->u
.bad_conversion
.n_arg
= n_arg
- adjust
;
651 r
->u
.bad_conversion
.from
= from
;
652 r
->u
.bad_conversion
.to_type
= to
;
653 r
->u
.bad_conversion
.loc
= loc
;
657 static struct rejection_reason
*
658 explicit_conversion_rejection (tree from
, tree to
)
660 struct rejection_reason
*r
= alloc_rejection (rr_explicit_conversion
);
661 r
->u
.conversion
.n_arg
= 0;
662 r
->u
.conversion
.from
= from
;
663 r
->u
.conversion
.to_type
= to
;
664 r
->u
.conversion
.loc
= UNKNOWN_LOCATION
;
668 static struct rejection_reason
*
669 template_conversion_rejection (tree from
, tree to
)
671 struct rejection_reason
*r
= alloc_rejection (rr_template_conversion
);
672 r
->u
.conversion
.n_arg
= 0;
673 r
->u
.conversion
.from
= from
;
674 r
->u
.conversion
.to_type
= to
;
675 r
->u
.conversion
.loc
= UNKNOWN_LOCATION
;
679 static struct rejection_reason
*
680 template_unification_rejection (tree tmpl
, tree explicit_targs
, tree targs
,
681 const tree
*args
, unsigned int nargs
,
682 tree return_type
, unification_kind_t strict
,
685 size_t args_n_bytes
= sizeof (*args
) * nargs
;
686 tree
*args1
= (tree
*) conversion_obstack_alloc (args_n_bytes
);
687 struct rejection_reason
*r
= alloc_rejection (rr_template_unification
);
688 r
->u
.template_unification
.tmpl
= tmpl
;
689 r
->u
.template_unification
.explicit_targs
= explicit_targs
;
690 r
->u
.template_unification
.num_targs
= TREE_VEC_LENGTH (targs
);
691 /* Copy args to our own storage. */
692 memcpy (args1
, args
, args_n_bytes
);
693 r
->u
.template_unification
.args
= args1
;
694 r
->u
.template_unification
.nargs
= nargs
;
695 r
->u
.template_unification
.return_type
= return_type
;
696 r
->u
.template_unification
.strict
= strict
;
697 r
->u
.template_unification
.flags
= flags
;
701 static struct rejection_reason
*
702 template_unification_error_rejection (void)
704 return alloc_rejection (rr_template_unification
);
707 static struct rejection_reason
*
708 invalid_copy_with_fn_template_rejection (void)
710 struct rejection_reason
*r
= alloc_rejection (rr_invalid_copy
);
714 static struct rejection_reason
*
715 inherited_ctor_rejection (void)
717 struct rejection_reason
*r
= alloc_rejection (rr_inherited_ctor
);
721 // Build a constraint failure record, saving information into the
722 // template_instantiation field of the rejection. If FN is not a template
723 // declaration, the TMPL member is the FN declaration and TARGS is empty.
725 static struct rejection_reason
*
726 constraint_failure (tree fn
)
728 struct rejection_reason
*r
= alloc_rejection (rr_constraint_failure
);
729 if (tree ti
= DECL_TEMPLATE_INFO (fn
))
731 r
->u
.template_instantiation
.tmpl
= TI_TEMPLATE (ti
);
732 r
->u
.template_instantiation
.targs
= TI_ARGS (ti
);
736 r
->u
.template_instantiation
.tmpl
= fn
;
737 r
->u
.template_instantiation
.targs
= NULL_TREE
;
742 /* Dynamically allocate a conversion. */
745 alloc_conversion (conversion_kind kind
)
748 c
= (conversion
*) conversion_obstack_alloc (sizeof (conversion
));
753 /* Make sure that all memory on the conversion obstack has been
757 validate_conversion_obstack (void)
759 if (conversion_obstack_initialized
)
760 gcc_assert ((obstack_next_free (&conversion_obstack
)
761 == obstack_base (&conversion_obstack
)));
764 /* Dynamically allocate an array of N conversions. */
767 alloc_conversions (size_t n
)
769 return (conversion
**) conversion_obstack_alloc (n
* sizeof (conversion
*));
773 build_conv (conversion_kind code
, tree type
, conversion
*from
)
776 conversion_rank rank
= CONVERSION_RANK (from
);
778 /* Note that the caller is responsible for filling in t->cand for
779 user-defined conversions. */
780 t
= alloc_conversion (code
);
804 t
->user_conv_p
= (code
== ck_user
|| from
->user_conv_p
);
805 t
->bad_p
= from
->bad_p
;
810 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
811 specialization of std::initializer_list<T>, if such a conversion is
815 build_list_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
817 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (type
), 0);
818 unsigned len
= CONSTRUCTOR_NELTS (ctor
);
819 conversion
**subconvs
= alloc_conversions (len
);
824 /* Within a list-initialization we can have more user-defined
826 flags
&= ~LOOKUP_NO_CONVERSION
;
827 /* But no narrowing conversions. */
828 flags
|= LOOKUP_NO_NARROWING
;
830 /* Can't make an array of these types. */
831 if (TYPE_REF_P (elttype
)
832 || TREE_CODE (elttype
) == FUNCTION_TYPE
833 || VOID_TYPE_P (elttype
))
836 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
839 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
840 false, flags
, complain
);
847 t
= alloc_conversion (ck_list
);
849 t
->u
.list
= subconvs
;
852 for (i
= 0; i
< len
; ++i
)
854 conversion
*sub
= subconvs
[i
];
855 if (sub
->rank
> t
->rank
)
857 if (sub
->user_conv_p
)
858 t
->user_conv_p
= true;
866 /* Return the next conversion of the conversion chain (if applicable),
867 or NULL otherwise. Please use this function instead of directly
868 accessing fields of struct conversion. */
871 next_conversion (conversion
*conv
)
874 || conv
->kind
== ck_identity
875 || conv
->kind
== ck_ambig
876 || conv
->kind
== ck_list
)
881 /* Subroutine of build_aggr_conv: check whether CTOR, a braced-init-list,
882 is a valid aggregate initializer for array type ATYPE. */
885 can_convert_array (tree atype
, tree ctor
, int flags
, tsubst_flags_t complain
)
888 tree elttype
= TREE_TYPE (atype
);
889 for (i
= 0; i
< CONSTRUCTOR_NELTS (ctor
); ++i
)
891 tree val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
893 if (TREE_CODE (elttype
) == ARRAY_TYPE
894 && TREE_CODE (val
) == CONSTRUCTOR
)
895 ok
= can_convert_array (elttype
, val
, flags
, complain
);
897 ok
= can_convert_arg (elttype
, TREE_TYPE (val
), val
, flags
,
905 /* Helper for build_aggr_conv. Return true if FIELD is in PSET, or if
906 FIELD has ANON_AGGR_TYPE_P and any initializable field in there recursively
910 field_in_pset (hash_set
<tree
> *pset
, tree field
)
912 if (pset
->contains (field
))
914 if (ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
915 for (field
= TYPE_FIELDS (TREE_TYPE (field
));
916 field
; field
= DECL_CHAIN (field
))
918 field
= next_initializable_field (field
);
919 if (field
== NULL_TREE
)
921 if (field_in_pset (pset
, field
))
927 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
928 aggregate class, if such a conversion is possible. */
931 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
933 unsigned HOST_WIDE_INT i
= 0;
935 tree field
= next_initializable_field (TYPE_FIELDS (type
));
936 tree empty_ctor
= NULL_TREE
;
937 hash_set
<tree
> *pset
= NULL
;
939 /* We already called reshape_init in implicit_conversion. */
941 /* The conversions within the init-list aren't affected by the enclosing
942 context; they're always simple copy-initialization. */
943 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
945 /* For designated initializers, verify that each initializer is convertible
946 to corresponding TREE_TYPE (ce->index) and mark those FIELD_DECLs as
947 visited. In the following loop then ignore already visited
949 if (CONSTRUCTOR_IS_DESIGNATED_INIT (ctor
))
952 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (ctor
), i
, idx
, val
)
954 if (idx
&& TREE_CODE (idx
) == FIELD_DECL
)
956 tree ftype
= TREE_TYPE (idx
);
959 if (TREE_CODE (ftype
) == ARRAY_TYPE
960 && TREE_CODE (val
) == CONSTRUCTOR
)
961 ok
= can_convert_array (ftype
, val
, flags
, complain
);
963 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
968 /* For unions, there should be just one initializer. */
969 if (TREE_CODE (type
) == UNION_TYPE
)
976 pset
= new hash_set
<tree
>;
984 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
986 tree ftype
= TREE_TYPE (field
);
990 if (pset
&& field_in_pset (pset
, field
))
992 if (i
< CONSTRUCTOR_NELTS (ctor
))
994 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
997 else if (DECL_INITIAL (field
))
998 val
= get_nsdmi (field
, /*ctor*/false, complain
);
999 else if (TYPE_REF_P (ftype
))
1000 /* Value-initialization of reference is ill-formed. */
1004 if (empty_ctor
== NULL_TREE
)
1005 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
1009 if (TREE_CODE (ftype
) == ARRAY_TYPE
1010 && TREE_CODE (val
) == CONSTRUCTOR
)
1011 ok
= can_convert_array (ftype
, val
, flags
, complain
);
1013 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
1019 if (TREE_CODE (type
) == UNION_TYPE
)
1023 if (i
< CONSTRUCTOR_NELTS (ctor
))
1033 c
= alloc_conversion (ck_aggr
);
1036 c
->user_conv_p
= true;
1037 c
->check_narrowing
= true;
1042 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
1043 array type, if such a conversion is possible. */
1046 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
1049 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1050 tree elttype
= TREE_TYPE (type
);
1055 enum conversion_rank rank
= cr_exact
;
1057 /* We might need to propagate the size from the element to the array. */
1058 complete_type (type
);
1060 if (TYPE_DOMAIN (type
)
1061 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
1063 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
1068 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1070 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1073 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1074 false, flags
, complain
);
1078 if (sub
->rank
> rank
)
1080 if (sub
->user_conv_p
)
1086 c
= alloc_conversion (ck_aggr
);
1089 c
->user_conv_p
= user
;
1095 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1096 complex type, if such a conversion is possible. */
1099 build_complex_conv (tree type
, tree ctor
, int flags
,
1100 tsubst_flags_t complain
)
1103 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1104 tree elttype
= TREE_TYPE (type
);
1109 enum conversion_rank rank
= cr_exact
;
1114 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1116 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1119 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1120 false, flags
, complain
);
1124 if (sub
->rank
> rank
)
1126 if (sub
->user_conv_p
)
1132 c
= alloc_conversion (ck_aggr
);
1135 c
->user_conv_p
= user
;
1141 /* Build a representation of the identity conversion from EXPR to
1142 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1145 build_identity_conv (tree type
, tree expr
)
1149 c
= alloc_conversion (ck_identity
);
1156 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1157 were multiple user-defined conversions to accomplish the job.
1158 Build a conversion that indicates that ambiguity. */
1161 build_ambiguous_conv (tree type
, tree expr
)
1165 c
= alloc_conversion (ck_ambig
);
1173 strip_top_quals (tree t
)
1175 if (TREE_CODE (t
) == ARRAY_TYPE
)
1177 return cp_build_qualified_type (t
, 0);
1180 /* Returns the standard conversion path (see [conv]) from type FROM to type
1181 TO, if any. For proper handling of null pointer constants, you must
1182 also pass the expression EXPR to convert from. If C_CAST_P is true,
1183 this conversion is coming from a C-style cast. */
1186 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1187 int flags
, tsubst_flags_t complain
)
1189 enum tree_code fcode
, tcode
;
1191 bool fromref
= false;
1194 to
= non_reference (to
);
1195 if (TYPE_REF_P (from
))
1198 from
= TREE_TYPE (from
);
1201 to
= strip_top_quals (to
);
1202 from
= strip_top_quals (from
);
1204 if (expr
&& type_unknown_p (expr
))
1206 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1208 tsubst_flags_t tflags
= tf_conv
;
1209 expr
= instantiate_type (to
, expr
, tflags
);
1210 if (expr
== error_mark_node
)
1212 from
= TREE_TYPE (expr
);
1214 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1216 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1217 expr
= resolve_nondeduced_context (expr
, complain
);
1218 from
= TREE_TYPE (expr
);
1222 fcode
= TREE_CODE (from
);
1223 tcode
= TREE_CODE (to
);
1225 conv
= build_identity_conv (from
, expr
);
1226 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1228 from
= type_decays_to (from
);
1229 fcode
= TREE_CODE (from
);
1230 /* Tell convert_like_real that we're using the address. */
1231 conv
->rvaluedness_matches_p
= true;
1232 conv
= build_conv (ck_lvalue
, from
, conv
);
1234 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1235 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1236 express the copy constructor call required by copy-initialization. */
1237 else if (fromref
|| (expr
&& obvalue_p (expr
)))
1242 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1245 from
= strip_top_quals (bitfield_type
);
1246 fcode
= TREE_CODE (from
);
1249 conv
= build_conv (ck_rvalue
, from
, conv
);
1250 if (flags
& LOOKUP_PREFER_RVALUE
)
1251 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1252 conv
->rvaluedness_matches_p
= true;
1255 /* Allow conversion between `__complex__' data types. */
1256 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1258 /* The standard conversion sequence to convert FROM to TO is
1259 the standard conversion sequence to perform componentwise
1261 conversion
*part_conv
= standard_conversion
1262 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
,
1267 conv
= build_conv (part_conv
->kind
, to
, conv
);
1268 conv
->rank
= part_conv
->rank
;
1276 if (same_type_p (from
, to
))
1278 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1279 conv
->type
= qualified_to
;
1284 A null pointer constant can be converted to a pointer type; ... A
1285 null pointer constant of integral type can be converted to an
1286 rvalue of type std::nullptr_t. */
1287 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1288 || NULLPTR_TYPE_P (to
))
1289 && ((expr
&& null_ptr_cst_p (expr
))
1290 || NULLPTR_TYPE_P (from
)))
1291 conv
= build_conv (ck_std
, to
, conv
);
1292 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1293 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1295 /* For backwards brain damage compatibility, allow interconversion of
1296 pointers and integers with a pedwarn. */
1297 conv
= build_conv (ck_std
, to
, conv
);
1300 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1302 /* For backwards brain damage compatibility, allow interconversion of
1303 enums and integers with a pedwarn. */
1304 conv
= build_conv (ck_std
, to
, conv
);
1307 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1308 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1313 if (tcode
== POINTER_TYPE
)
1315 to_pointee
= TREE_TYPE (to
);
1316 from_pointee
= TREE_TYPE (from
);
1318 /* Since this is the target of a pointer, it can't have function
1319 qualifiers, so any TYPE_QUALS must be for attributes const or
1320 noreturn. Strip them. */
1321 if (TREE_CODE (to_pointee
) == FUNCTION_TYPE
1322 && TYPE_QUALS (to_pointee
))
1323 to_pointee
= build_qualified_type (to_pointee
, TYPE_UNQUALIFIED
);
1324 if (TREE_CODE (from_pointee
) == FUNCTION_TYPE
1325 && TYPE_QUALS (from_pointee
))
1326 from_pointee
= build_qualified_type (from_pointee
, TYPE_UNQUALIFIED
);
1330 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1331 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1334 if (tcode
== POINTER_TYPE
1335 && same_type_ignoring_top_level_qualifiers_p (from_pointee
,
1338 else if (VOID_TYPE_P (to_pointee
)
1339 && !TYPE_PTRDATAMEM_P (from
)
1340 && TREE_CODE (from_pointee
) != FUNCTION_TYPE
)
1342 tree nfrom
= TREE_TYPE (from
);
1343 /* Don't try to apply restrict to void. */
1344 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1345 from_pointee
= cp_build_qualified_type (void_type_node
, quals
);
1346 from
= build_pointer_type (from_pointee
);
1347 conv
= build_conv (ck_ptr
, from
, conv
);
1349 else if (TYPE_PTRDATAMEM_P (from
))
1351 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1352 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1354 if (same_type_p (fbase
, tbase
))
1355 /* No base conversion needed. */;
1356 else if (DERIVED_FROM_P (fbase
, tbase
)
1357 && (same_type_ignoring_top_level_qualifiers_p
1358 (from_pointee
, to_pointee
)))
1360 from
= build_ptrmem_type (tbase
, from_pointee
);
1361 conv
= build_conv (ck_pmem
, from
, conv
);
1366 else if (CLASS_TYPE_P (from_pointee
)
1367 && CLASS_TYPE_P (to_pointee
)
1370 An rvalue of type "pointer to cv D," where D is a
1371 class type, can be converted to an rvalue of type
1372 "pointer to cv B," where B is a base class (clause
1373 _class.derived_) of D. If B is an inaccessible
1374 (clause _class.access_) or ambiguous
1375 (_class.member.lookup_) base class of D, a program
1376 that necessitates this conversion is ill-formed.
1377 Therefore, we use DERIVED_FROM_P, and do not check
1378 access or uniqueness. */
1379 && DERIVED_FROM_P (to_pointee
, from_pointee
))
1382 = cp_build_qualified_type (to_pointee
,
1383 cp_type_quals (from_pointee
));
1384 from
= build_pointer_type (from_pointee
);
1385 conv
= build_conv (ck_ptr
, from
, conv
);
1386 conv
->base_p
= true;
1389 if (same_type_p (from
, to
))
1391 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1392 /* In a C-style cast, we ignore CV-qualification because we
1393 are allowed to perform a static_cast followed by a
1395 conv
= build_conv (ck_qual
, to
, conv
);
1396 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1397 conv
= build_conv (ck_qual
, to
, conv
);
1398 else if (expr
&& string_conv_p (to
, expr
, 0))
1399 /* converting from string constant to char *. */
1400 conv
= build_conv (ck_qual
, to
, conv
);
1401 else if (fnptr_conv_p (to
, from
))
1402 conv
= build_conv (ck_fnptr
, to
, conv
);
1403 /* Allow conversions among compatible ObjC pointer types (base
1404 conversions have been already handled above). */
1405 else if (c_dialect_objc ()
1406 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1407 conv
= build_conv (ck_ptr
, to
, conv
);
1408 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1410 conv
= build_conv (ck_ptr
, to
, conv
);
1418 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1420 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1421 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1422 tree fbase
= class_of_this_parm (fromfn
);
1423 tree tbase
= class_of_this_parm (tofn
);
1425 if (!DERIVED_FROM_P (fbase
, tbase
))
1428 tree fstat
= static_fn_type (fromfn
);
1429 tree tstat
= static_fn_type (tofn
);
1430 if (same_type_p (tstat
, fstat
)
1431 || fnptr_conv_p (tstat
, fstat
))
1436 if (!same_type_p (fbase
, tbase
))
1438 from
= build_memfn_type (fstat
,
1440 cp_type_quals (tbase
),
1441 type_memfn_rqual (tofn
));
1442 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1443 conv
= build_conv (ck_pmem
, from
, conv
);
1444 conv
->base_p
= true;
1446 if (fnptr_conv_p (tstat
, fstat
))
1447 conv
= build_conv (ck_fnptr
, to
, conv
);
1449 else if (tcode
== BOOLEAN_TYPE
)
1453 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1454 to member type can be converted to a prvalue of type bool. ...
1455 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1456 std::nullptr_t can be converted to a prvalue of type bool; */
1457 if (ARITHMETIC_TYPE_P (from
)
1458 || UNSCOPED_ENUM_P (from
)
1459 || fcode
== POINTER_TYPE
1460 || TYPE_PTRMEM_P (from
)
1461 || NULLPTR_TYPE_P (from
))
1463 conv
= build_conv (ck_std
, to
, conv
);
1464 if (fcode
== POINTER_TYPE
1465 || TYPE_PTRDATAMEM_P (from
)
1466 || (TYPE_PTRMEMFUNC_P (from
)
1467 && conv
->rank
< cr_pbool
)
1468 || NULLPTR_TYPE_P (from
))
1469 conv
->rank
= cr_pbool
;
1470 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1472 if (flags
& LOOKUP_NO_NARROWING
)
1473 conv
->check_narrowing
= true;
1479 /* We don't check for ENUMERAL_TYPE here because there are no standard
1480 conversions to enum type. */
1481 /* As an extension, allow conversion to complex type. */
1482 else if (ARITHMETIC_TYPE_P (to
))
1484 if (! (INTEGRAL_CODE_P (fcode
)
1485 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1486 || SCOPED_ENUM_P (from
))
1489 /* If we're parsing an enum with no fixed underlying type, we're
1490 dealing with an incomplete type, which renders the conversion
1492 if (!COMPLETE_TYPE_P (from
))
1495 conv
= build_conv (ck_std
, to
, conv
);
1497 /* Give this a better rank if it's a promotion. */
1498 if (same_type_p (to
, type_promotes_to (from
))
1499 && next_conversion (conv
)->rank
<= cr_promotion
)
1500 conv
->rank
= cr_promotion
;
1502 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1503 && vector_types_convertible_p (from
, to
, false))
1504 return build_conv (ck_std
, to
, conv
);
1505 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1506 && is_properly_derived_from (from
, to
))
1508 if (conv
->kind
== ck_rvalue
)
1509 conv
= next_conversion (conv
);
1510 conv
= build_conv (ck_base
, to
, conv
);
1511 /* The derived-to-base conversion indicates the initialization
1512 of a parameter with base type from an object of a derived
1513 type. A temporary object is created to hold the result of
1514 the conversion unless we're binding directly to a reference. */
1515 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1516 if (flags
& LOOKUP_PREFER_RVALUE
)
1517 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1518 conv
->rvaluedness_matches_p
= true;
1523 if (flags
& LOOKUP_NO_NARROWING
)
1524 conv
->check_narrowing
= true;
1529 /* Returns nonzero if T1 is reference-related to T2. */
1532 reference_related_p (tree t1
, tree t2
)
1534 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1537 t1
= TYPE_MAIN_VARIANT (t1
);
1538 t2
= TYPE_MAIN_VARIANT (t2
);
1542 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1543 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1545 return (same_type_p (t1
, t2
)
1546 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1547 && DERIVED_FROM_P (t1
, t2
)));
1550 /* Returns nonzero if T1 is reference-compatible with T2. */
1553 reference_compatible_p (tree t1
, tree t2
)
1557 "cv1 T1" is reference compatible with "cv2 T2" if
1558 * T1 is reference-related to T2 or
1559 * T2 is "noexcept function" and T1 is "function", where the
1560 function types are otherwise the same,
1561 and cv1 is the same cv-qualification as, or greater cv-qualification
1563 return ((reference_related_p (t1
, t2
)
1564 || fnptr_conv_p (t1
, t2
))
1565 && at_least_as_qualified_p (t1
, t2
));
1568 /* A reference of the indicated TYPE is being bound directly to the
1569 expression represented by the implicit conversion sequence CONV.
1570 Return a conversion sequence for this binding. */
1573 direct_reference_binding (tree type
, conversion
*conv
)
1577 gcc_assert (TYPE_REF_P (type
));
1578 gcc_assert (!TYPE_REF_P (conv
->type
));
1580 t
= TREE_TYPE (type
);
1582 if (conv
->kind
== ck_identity
)
1583 /* Mark the identity conv as to not decay to rvalue. */
1584 conv
->rvaluedness_matches_p
= true;
1588 When a parameter of reference type binds directly
1589 (_dcl.init.ref_) to an argument expression, the implicit
1590 conversion sequence is the identity conversion, unless the
1591 argument expression has a type that is a derived class of the
1592 parameter type, in which case the implicit conversion sequence is
1593 a derived-to-base Conversion.
1595 If the parameter binds directly to the result of applying a
1596 conversion function to the argument expression, the implicit
1597 conversion sequence is a user-defined conversion sequence
1598 (_over.ics.user_), with the second standard conversion sequence
1599 either an identity conversion or, if the conversion function
1600 returns an entity of a type that is a derived class of the
1601 parameter type, a derived-to-base conversion. */
1602 if (is_properly_derived_from (conv
->type
, t
))
1604 /* Represent the derived-to-base conversion. */
1605 conv
= build_conv (ck_base
, t
, conv
);
1606 /* We will actually be binding to the base-class subobject in
1607 the derived class, so we mark this conversion appropriately.
1608 That way, convert_like knows not to generate a temporary. */
1609 conv
->need_temporary_p
= false;
1612 return build_conv (ck_ref_bind
, type
, conv
);
1615 /* Returns the conversion path from type FROM to reference type TO for
1616 purposes of reference binding. For lvalue binding, either pass a
1617 reference type to FROM or an lvalue expression to EXPR. If the
1618 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1619 the conversion returned. If C_CAST_P is true, this
1620 conversion is coming from a C-style cast. */
1623 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1624 tsubst_flags_t complain
)
1626 conversion
*conv
= NULL
;
1627 tree to
= TREE_TYPE (rto
);
1632 cp_lvalue_kind gl_kind
;
1635 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1637 expr
= instantiate_type (to
, expr
, tf_none
);
1638 if (expr
== error_mark_node
)
1640 from
= TREE_TYPE (expr
);
1643 bool copy_list_init
= false;
1644 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1646 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1647 /* DR 1288: Otherwise, if the initializer list has a single element
1648 of type E and ... [T's] referenced type is reference-related to E,
1649 the object or reference is initialized from that element... */
1650 if (CONSTRUCTOR_NELTS (expr
) == 1)
1652 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1653 if (error_operand_p (elt
))
1655 tree etype
= TREE_TYPE (elt
);
1656 if (reference_related_p (to
, etype
))
1663 /* Otherwise, if T is a reference type, a prvalue temporary of the type
1664 referenced by T is copy-list-initialized, and the reference is bound
1665 to that temporary. */
1666 copy_list_init
= true;
1670 if (TYPE_REF_P (from
))
1672 from
= TREE_TYPE (from
);
1673 if (!TYPE_REF_IS_RVALUE (rfrom
)
1674 || TREE_CODE (from
) == FUNCTION_TYPE
)
1675 gl_kind
= clk_ordinary
;
1677 gl_kind
= clk_rvalueref
;
1680 gl_kind
= lvalue_kind (expr
);
1681 else if (CLASS_TYPE_P (from
)
1682 || TREE_CODE (from
) == ARRAY_TYPE
)
1683 gl_kind
= clk_class
;
1687 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1688 if ((flags
& LOOKUP_NO_TEMP_BIND
)
1689 && (gl_kind
& clk_class
))
1692 /* Same mask as real_lvalue_p. */
1693 is_lvalue
= gl_kind
&& !(gl_kind
& (clk_rvalueref
|clk_class
));
1696 if ((gl_kind
& clk_bitfield
) != 0)
1697 tfrom
= unlowered_expr_type (expr
);
1699 /* Figure out whether or not the types are reference-related and
1700 reference compatible. We have to do this after stripping
1701 references from FROM. */
1702 related_p
= reference_related_p (to
, tfrom
);
1703 /* If this is a C cast, first convert to an appropriately qualified
1704 type, so that we can later do a const_cast to the desired type. */
1705 if (related_p
&& c_cast_p
1706 && !at_least_as_qualified_p (to
, tfrom
))
1707 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1708 compatible_p
= reference_compatible_p (to
, tfrom
);
1710 /* Directly bind reference when target expression's type is compatible with
1711 the reference and expression is an lvalue. In DR391, the wording in
1712 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1713 const and rvalue references to rvalues of compatible class type.
1714 We should also do direct bindings for non-class xvalues. */
1715 if ((related_p
|| compatible_p
) && gl_kind
)
1719 If the initializer expression
1721 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1722 is reference-compatible with "cv2 T2,"
1724 the reference is bound directly to the initializer expression
1728 If the initializer expression is an rvalue, with T2 a class type,
1729 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1730 is bound to the object represented by the rvalue or to a sub-object
1731 within that object. */
1733 conv
= build_identity_conv (tfrom
, expr
);
1734 conv
= direct_reference_binding (rto
, conv
);
1736 if (TYPE_REF_P (rfrom
))
1737 /* Handle rvalue reference to function properly. */
1738 conv
->rvaluedness_matches_p
1739 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1741 conv
->rvaluedness_matches_p
1742 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1744 if ((gl_kind
& clk_bitfield
) != 0
1745 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1746 /* For the purposes of overload resolution, we ignore the fact
1747 this expression is a bitfield or packed field. (In particular,
1748 [over.ics.ref] says specifically that a function with a
1749 non-const reference parameter is viable even if the
1750 argument is a bitfield.)
1752 However, when we actually call the function we must create
1753 a temporary to which to bind the reference. If the
1754 reference is volatile, or isn't const, then we cannot make
1755 a temporary, so we just issue an error when the conversion
1757 conv
->need_temporary_p
= true;
1759 /* Don't allow binding of lvalues (other than function lvalues) to
1760 rvalue references. */
1761 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1762 && TREE_CODE (to
) != FUNCTION_TYPE
)
1765 /* Nor the reverse. */
1766 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1767 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1768 || (flags
& LOOKUP_NO_RVAL_BIND
))
1769 && TREE_CODE (to
) != FUNCTION_TYPE
)
1777 /* [class.conv.fct] A conversion function is never used to convert a
1778 (possibly cv-qualified) object to the (possibly cv-qualified) same
1779 object type (or a reference to it), to a (possibly cv-qualified) base
1780 class of that type (or a reference to it).... */
1781 else if (CLASS_TYPE_P (from
) && !related_p
1782 && !(flags
& LOOKUP_NO_CONVERSION
))
1786 If the initializer expression
1788 -- has a class type (i.e., T2 is a class type) can be
1789 implicitly converted to an lvalue of type "cv3 T3," where
1790 "cv1 T1" is reference-compatible with "cv3 T3". (this
1791 conversion is selected by enumerating the applicable
1792 conversion functions (_over.match.ref_) and choosing the
1793 best one through overload resolution. (_over.match_).
1795 the reference is bound to the lvalue result of the conversion
1796 in the second case. */
1797 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1800 return cand
->second_conv
;
1803 /* From this point on, we conceptually need temporaries, even if we
1804 elide them. Only the cases above are "direct bindings". */
1805 if (flags
& LOOKUP_NO_TEMP_BIND
)
1810 When a parameter of reference type is not bound directly to an
1811 argument expression, the conversion sequence is the one required
1812 to convert the argument expression to the underlying type of the
1813 reference according to _over.best.ics_. Conceptually, this
1814 conversion sequence corresponds to copy-initializing a temporary
1815 of the underlying type with the argument expression. Any
1816 difference in top-level cv-qualification is subsumed by the
1817 initialization itself and does not constitute a conversion. */
1821 Otherwise, the reference shall be an lvalue reference to a
1822 non-volatile const type, or the reference shall be an rvalue
1825 We try below to treat this as a bad conversion to improve diagnostics,
1826 but if TO is an incomplete class, we need to reject this conversion
1827 now to avoid unnecessary instantiation. */
1828 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1829 && !COMPLETE_TYPE_P (to
))
1832 /* We're generating a temporary now, but don't bind any more in the
1833 conversion (specifically, don't slice the temporary returned by a
1834 conversion operator). */
1835 flags
|= LOOKUP_NO_TEMP_BIND
;
1837 /* Core issue 899: When [copy-]initializing a temporary to be bound
1838 to the first parameter of a copy constructor (12.8) called with
1839 a single argument in the context of direct-initialization,
1840 explicit conversion functions are also considered.
1842 So don't set LOOKUP_ONLYCONVERTING in that case. */
1843 if (!(flags
& LOOKUP_COPY_PARM
))
1844 flags
|= LOOKUP_ONLYCONVERTING
;
1847 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1852 if (conv
->user_conv_p
)
1855 /* Remember this was copy-list-initialization. */
1856 conv
->need_temporary_p
= true;
1858 /* If initializing the temporary used a conversion function,
1859 recalculate the second conversion sequence. */
1860 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1861 if (t
->kind
== ck_user
1862 && DECL_CONV_FN_P (t
->cand
->fn
))
1864 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1865 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1866 conversion
*new_second
1867 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1871 return merge_conversion_sequences (t
, new_second
);
1875 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1876 /* This reference binding, unlike those above, requires the
1877 creation of a temporary. */
1878 conv
->need_temporary_p
= true;
1879 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1883 Otherwise, the reference shall be an lvalue reference to a
1884 non-volatile const type, or the reference shall be an rvalue
1886 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1891 Otherwise, a temporary of type "cv1 T1" is created and
1892 initialized from the initializer expression using the rules for a
1893 non-reference copy initialization. If T1 is reference-related to
1894 T2, cv1 must be the same cv-qualification as, or greater
1895 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1896 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1902 /* Returns the implicit conversion sequence (see [over.ics]) from type
1903 FROM to type TO. The optional expression EXPR may affect the
1904 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1905 true, this conversion is coming from a C-style cast. */
1908 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1909 int flags
, tsubst_flags_t complain
)
1913 if (from
== error_mark_node
|| to
== error_mark_node
1914 || expr
== error_mark_node
)
1917 /* Other flags only apply to the primary function in overload
1918 resolution, or after we've chosen one. */
1919 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1920 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1921 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1923 /* FIXME: actually we don't want warnings either, but we can't just
1924 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1925 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1926 We really ought not to issue that warning until we've committed
1927 to that conversion. */
1928 complain
&= ~tf_error
;
1930 /* Call reshape_init early to remove redundant braces. */
1931 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1932 && CLASS_TYPE_P (to
)
1933 && COMPLETE_TYPE_P (complete_type (to
))
1934 && !CLASSTYPE_NON_AGGREGATE (to
))
1936 expr
= reshape_init (to
, expr
, complain
);
1937 if (expr
== error_mark_node
)
1939 from
= TREE_TYPE (expr
);
1942 if (TYPE_REF_P (to
))
1943 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1945 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
1950 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1952 if (is_std_init_list (to
) && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr
))
1953 return build_list_conv (to
, expr
, flags
, complain
);
1955 /* As an extension, allow list-initialization of _Complex. */
1956 if (TREE_CODE (to
) == COMPLEX_TYPE
1957 && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr
))
1959 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1964 /* Allow conversion from an initializer-list with one element to a
1966 if (SCALAR_TYPE_P (to
))
1968 int nelts
= CONSTRUCTOR_NELTS (expr
);
1972 elt
= build_value_init (to
, tf_none
);
1973 else if (nelts
== 1 && !CONSTRUCTOR_IS_DESIGNATED_INIT (expr
))
1974 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1976 elt
= error_mark_node
;
1978 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1979 c_cast_p
, flags
, complain
);
1982 conv
->check_narrowing
= true;
1983 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1984 /* Too many levels of braces, i.e. '{{1}}'. */
1989 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1990 return build_array_conv (to
, expr
, flags
, complain
);
1993 if (expr
!= NULL_TREE
1994 && (MAYBE_CLASS_TYPE_P (from
)
1995 || MAYBE_CLASS_TYPE_P (to
))
1996 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1998 struct z_candidate
*cand
;
2000 if (CLASS_TYPE_P (to
)
2001 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
2002 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
2003 return build_aggr_conv (to
, expr
, flags
, complain
);
2005 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
2008 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
2009 && CONSTRUCTOR_NELTS (expr
) == 1
2010 && !is_list_ctor (cand
->fn
))
2012 /* "If C is not an initializer-list constructor and the
2013 initializer list has a single element of type cv U, where U is
2014 X or a class derived from X, the implicit conversion sequence
2015 has Exact Match rank if U is X, or Conversion rank if U is
2017 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
2018 tree elttype
= TREE_TYPE (elt
);
2019 if (reference_related_p (to
, elttype
))
2020 return implicit_conversion (to
, elttype
, elt
,
2021 c_cast_p
, flags
, complain
);
2023 conv
= cand
->second_conv
;
2026 /* We used to try to bind a reference to a temporary here, but that
2027 is now handled after the recursive call to this function at the end
2028 of reference_binding. */
2035 /* Like implicit_conversion, but return NULL if the conversion is bad.
2037 This is not static so that check_non_deducible_conversion can call it within
2038 add_template_candidate_real as part of overload resolution; it should not be
2039 called outside of overload resolution. */
2042 good_conversion (tree to
, tree from
, tree expr
,
2043 int flags
, tsubst_flags_t complain
)
2045 conversion
*c
= implicit_conversion (to
, from
, expr
, /*cast*/false,
2052 /* Add a new entry to the list of candidates. Used by the add_*_candidate
2053 functions. ARGS will not be changed until a single candidate is
2056 static struct z_candidate
*
2057 add_candidate (struct z_candidate
**candidates
,
2058 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
2059 size_t num_convs
, conversion
**convs
,
2060 tree access_path
, tree conversion_path
,
2061 int viable
, struct rejection_reason
*reason
,
2064 struct z_candidate
*cand
= (struct z_candidate
*)
2065 conversion_obstack_alloc (sizeof (struct z_candidate
));
2068 cand
->first_arg
= first_arg
;
2070 cand
->convs
= convs
;
2071 cand
->num_convs
= num_convs
;
2072 cand
->access_path
= access_path
;
2073 cand
->conversion_path
= conversion_path
;
2074 cand
->viable
= viable
;
2075 cand
->reason
= reason
;
2076 cand
->next
= *candidates
;
2077 cand
->flags
= flags
;
2083 /* Return the number of remaining arguments in the parameter list
2084 beginning with ARG. */
2087 remaining_arguments (tree arg
)
2091 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
2092 arg
= TREE_CHAIN (arg
))
2098 /* [over.match.copy]: When initializing a temporary object (12.2) to be bound
2099 to the first parameter of a constructor where the parameter is of type
2100 "reference to possibly cv-qualified T" and the constructor is called with a
2101 single argument in the context of direct-initialization of an object of type
2102 "cv2 T", explicit conversion functions are also considered.
2104 So set LOOKUP_COPY_PARM to let reference_binding know that
2105 it's being called in that context. */
2108 conv_flags (int i
, int nargs
, tree fn
, tree arg
, int flags
)
2112 if (i
== 0 && nargs
== 1 && DECL_CONSTRUCTOR_P (fn
)
2113 && (t
= FUNCTION_FIRST_USER_PARMTYPE (fn
))
2114 && (same_type_ignoring_top_level_qualifiers_p
2115 (non_reference (TREE_VALUE (t
)), DECL_CONTEXT (fn
))))
2117 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2118 lflags
|= LOOKUP_COPY_PARM
;
2119 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2120 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2121 lflags
|= LOOKUP_NO_CONVERSION
;
2124 lflags
|= LOOKUP_ONLYCONVERTING
;
2129 /* Create an overload candidate for the function or method FN called
2130 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
2131 FLAGS is passed on to implicit_conversion.
2133 This does not change ARGS.
2135 CTYPE, if non-NULL, is the type we want to pretend this function
2136 comes from for purposes of overload resolution. */
2138 static struct z_candidate
*
2139 add_function_candidate (struct z_candidate
**candidates
,
2140 tree fn
, tree ctype
, tree first_arg
,
2141 const vec
<tree
, va_gc
> *args
, tree access_path
,
2142 tree conversion_path
, int flags
,
2144 tsubst_flags_t complain
)
2146 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2149 tree orig_first_arg
= first_arg
;
2152 struct rejection_reason
*reason
= NULL
;
2154 /* At this point we should not see any functions which haven't been
2155 explicitly declared, except for friend functions which will have
2156 been found using argument dependent lookup. */
2157 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
2159 /* The `this', `in_chrg' and VTT arguments to constructors are not
2160 considered in overload resolution. */
2161 if (DECL_CONSTRUCTOR_P (fn
))
2163 if (ctor_omit_inherited_parms (fn
))
2164 /* Bring back parameters omitted from an inherited ctor. */
2165 parmlist
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn
));
2167 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
2168 skip
= num_artificial_parms_for (fn
);
2169 if (skip
> 0 && first_arg
!= NULL_TREE
)
2172 first_arg
= NULL_TREE
;
2178 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
2180 convs
= alloc_conversions (len
);
2182 /* 13.3.2 - Viable functions [over.match.viable]
2183 First, to be a viable function, a candidate function shall have enough
2184 parameters to agree in number with the arguments in the list.
2186 We need to check this first; otherwise, checking the ICSes might cause
2187 us to produce an ill-formed template instantiation. */
2189 parmnode
= parmlist
;
2190 for (i
= 0; i
< len
; ++i
)
2192 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
2194 parmnode
= TREE_CHAIN (parmnode
);
2197 if ((i
< len
&& parmnode
)
2198 || !sufficient_parms_p (parmnode
))
2200 int remaining
= remaining_arguments (parmnode
);
2202 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2205 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2206 parameter of type "reference to cv C" (including such a constructor
2207 instantiated from a template) is excluded from the set of candidate
2208 functions when used to construct an object of type D with an argument list
2209 containing a single argument if C is reference-related to D. */
2210 if (viable
&& len
== 1 && parmlist
&& DECL_CONSTRUCTOR_P (fn
)
2211 && flag_new_inheriting_ctors
2212 && DECL_INHERITED_CTOR (fn
))
2214 tree ptype
= non_reference (TREE_VALUE (parmlist
));
2215 tree dtype
= DECL_CONTEXT (fn
);
2216 tree btype
= DECL_INHERITED_CTOR_BASE (fn
);
2217 if (reference_related_p (ptype
, dtype
)
2218 && reference_related_p (btype
, ptype
))
2221 reason
= inherited_ctor_rejection ();
2225 /* Second, for a function to be viable, its constraints must be
2227 if (flag_concepts
&& viable
2228 && !constraints_satisfied_p (fn
))
2230 reason
= constraint_failure (fn
);
2234 /* When looking for a function from a subobject from an implicit
2235 copy/move constructor/operator=, don't consider anything that takes (a
2236 reference to) an unrelated type. See c++/44909 and core 1092. */
2237 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2239 if (DECL_CONSTRUCTOR_P (fn
))
2241 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2242 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
))
2248 parmnode
= chain_index (i
-1, parmlist
);
2249 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2254 /* This only applies at the top level. */
2255 flags
&= ~LOOKUP_DEFAULTED
;
2261 /* Third, for F to be a viable function, there shall exist for each
2262 argument an implicit conversion sequence that converts that argument
2263 to the corresponding parameter of F. */
2265 parmnode
= parmlist
;
2267 for (i
= 0; i
< len
; ++i
)
2269 tree argtype
, to_type
;
2274 if (parmnode
== void_list_node
)
2279 /* Already set during deduction. */
2280 parmnode
= TREE_CHAIN (parmnode
);
2284 if (i
== 0 && first_arg
!= NULL_TREE
)
2287 arg
= CONST_CAST_TREE (
2288 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2289 argtype
= lvalue_type (arg
);
2291 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2292 && ! DECL_CONSTRUCTOR_P (fn
));
2296 tree parmtype
= TREE_VALUE (parmnode
);
2298 parmnode
= TREE_CHAIN (parmnode
);
2300 /* The type of the implicit object parameter ('this') for
2301 overload resolution is not always the same as for the
2302 function itself; conversion functions are considered to
2303 be members of the class being converted, and functions
2304 introduced by a using-declaration are considered to be
2305 members of the class that uses them.
2307 Since build_over_call ignores the ICS for the `this'
2308 parameter, we can just change the parm type. */
2309 if (ctype
&& is_this
)
2311 parmtype
= cp_build_qualified_type
2312 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2313 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2315 /* If the function has a ref-qualifier, the implicit
2316 object parameter has reference type. */
2317 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2318 parmtype
= cp_build_reference_type (parmtype
, rv
);
2319 /* The special handling of 'this' conversions in compare_ics
2320 does not apply if there is a ref-qualifier. */
2325 parmtype
= build_pointer_type (parmtype
);
2326 /* We don't use build_this here because we don't want to
2327 capture the object argument until we've chosen a
2328 non-static member function. */
2329 arg
= build_address (arg
);
2330 argtype
= lvalue_type (arg
);
2334 int lflags
= conv_flags (i
, len
-skip
, fn
, arg
, flags
);
2336 t
= implicit_conversion (parmtype
, argtype
, arg
,
2337 /*c_cast_p=*/false, lflags
, complain
);
2342 t
= build_identity_conv (argtype
, arg
);
2343 t
->ellipsis_p
= true;
2354 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
,
2355 EXPR_LOCATION (arg
));
2362 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
,
2363 EXPR_LOCATION (arg
));
2369 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2370 access_path
, conversion_path
, viable
, reason
, flags
);
2373 /* Create an overload candidate for the conversion function FN which will
2374 be invoked for expression OBJ, producing a pointer-to-function which
2375 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2376 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2377 passed on to implicit_conversion.
2379 Actually, we don't really care about FN; we care about the type it
2380 converts to. There may be multiple conversion functions that will
2381 convert to that type, and we rely on build_user_type_conversion_1 to
2382 choose the best one; so when we create our candidate, we record the type
2383 instead of the function. */
2385 static struct z_candidate
*
2386 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2387 const vec
<tree
, va_gc
> *arglist
,
2388 tree access_path
, tree conversion_path
,
2389 tsubst_flags_t complain
)
2391 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2392 int i
, len
, viable
, flags
;
2393 tree parmlist
, parmnode
;
2395 struct rejection_reason
*reason
;
2397 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2398 parmlist
= TREE_TYPE (parmlist
);
2399 parmlist
= TYPE_ARG_TYPES (parmlist
);
2401 len
= vec_safe_length (arglist
) + 1;
2402 convs
= alloc_conversions (len
);
2403 parmnode
= parmlist
;
2405 flags
= LOOKUP_IMPLICIT
;
2408 /* Don't bother looking up the same type twice. */
2409 if (*candidates
&& (*candidates
)->fn
== totype
)
2412 for (i
= 0; i
< len
; ++i
)
2414 tree arg
, argtype
, convert_type
= NULL_TREE
;
2420 arg
= (*arglist
)[i
- 1];
2421 argtype
= lvalue_type (arg
);
2425 t
= build_identity_conv (argtype
, NULL_TREE
);
2426 t
= build_conv (ck_user
, totype
, t
);
2427 /* Leave the 'cand' field null; we'll figure out the conversion in
2428 convert_like_real if this candidate is chosen. */
2429 convert_type
= totype
;
2431 else if (parmnode
== void_list_node
)
2435 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2436 /*c_cast_p=*/false, flags
, complain
);
2437 convert_type
= TREE_VALUE (parmnode
);
2441 t
= build_identity_conv (argtype
, arg
);
2442 t
->ellipsis_p
= true;
2443 convert_type
= argtype
;
2453 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
,
2454 EXPR_LOCATION (arg
));
2461 parmnode
= TREE_CHAIN (parmnode
);
2465 || ! sufficient_parms_p (parmnode
))
2467 int remaining
= remaining_arguments (parmnode
);
2469 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2472 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2473 access_path
, conversion_path
, viable
, reason
, flags
);
2477 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2478 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2479 int flags
, tsubst_flags_t complain
)
2486 struct rejection_reason
*reason
= NULL
;
2491 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2492 convs
= alloc_conversions (num_convs
);
2494 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2495 conversion ops are allowed. We handle that here by just checking for
2496 boolean_type_node because other operators don't ask for it. COND_EXPR
2497 also does contextual conversion to bool for the first operand, but we
2498 handle that in build_conditional_expr, and type1 here is operand 2. */
2499 if (type1
!= boolean_type_node
)
2500 flags
|= LOOKUP_ONLYCONVERTING
;
2502 for (i
= 0; i
< 2; ++i
)
2507 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2508 /*c_cast_p=*/false, flags
, complain
);
2512 /* We need something for printing the candidate. */
2513 t
= build_identity_conv (types
[i
], NULL_TREE
);
2514 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2515 types
[i
], EXPR_LOCATION (args
[i
]));
2520 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2522 EXPR_LOCATION (args
[i
]));
2527 /* For COND_EXPR we rearranged the arguments; undo that now. */
2530 convs
[2] = convs
[1];
2531 convs
[1] = convs
[0];
2532 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2533 /*c_cast_p=*/false, flags
,
2540 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2542 EXPR_LOCATION (args
[2]));
2546 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2548 /*access_path=*/NULL_TREE
,
2549 /*conversion_path=*/NULL_TREE
,
2550 viable
, reason
, flags
);
2554 is_complete (tree t
)
2556 return COMPLETE_TYPE_P (complete_type (t
));
2559 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2562 promoted_arithmetic_type_p (tree type
)
2566 In this section, the term promoted integral type is used to refer
2567 to those integral types which are preserved by integral promotion
2568 (including e.g. int and long but excluding e.g. char).
2569 Similarly, the term promoted arithmetic type refers to promoted
2570 integral types plus floating types. */
2571 return ((CP_INTEGRAL_TYPE_P (type
)
2572 && same_type_p (type_promotes_to (type
), type
))
2573 || TREE_CODE (type
) == REAL_TYPE
);
2576 /* Create any builtin operator overload candidates for the operator in
2577 question given the converted operand types TYPE1 and TYPE2. The other
2578 args are passed through from add_builtin_candidates to
2579 build_builtin_candidate.
2581 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2582 If CODE is requires candidates operands of the same type of the kind
2583 of which TYPE1 and TYPE2 are, we add both candidates
2584 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2587 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2588 enum tree_code code2
, tree fnname
, tree type1
,
2589 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2590 tsubst_flags_t complain
)
2594 case POSTINCREMENT_EXPR
:
2595 case POSTDECREMENT_EXPR
:
2596 args
[1] = integer_zero_node
;
2597 type2
= integer_type_node
;
2606 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2607 and VQ is either volatile or empty, there exist candidate operator
2608 functions of the form
2609 VQ T& operator++(VQ T&);
2610 T operator++(VQ T&, int);
2611 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2612 type other than bool, and VQ is either volatile or empty, there exist
2613 candidate operator functions of the form
2614 VQ T& operator--(VQ T&);
2615 T operator--(VQ T&, int);
2616 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2617 complete object type, and VQ is either volatile or empty, there exist
2618 candidate operator functions of the form
2619 T*VQ& operator++(T*VQ&);
2620 T*VQ& operator--(T*VQ&);
2621 T* operator++(T*VQ&, int);
2622 T* operator--(T*VQ&, int); */
2624 case POSTDECREMENT_EXPR
:
2625 case PREDECREMENT_EXPR
:
2626 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2629 case POSTINCREMENT_EXPR
:
2630 case PREINCREMENT_EXPR
:
2631 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2633 type1
= build_reference_type (type1
);
2638 /* 7 For every cv-qualified or cv-unqualified object type T, there
2639 exist candidate operator functions of the form
2643 8 For every function type T, there exist candidate operator functions of
2645 T& operator*(T*); */
2648 if (TYPE_PTR_P (type1
)
2649 && (TYPE_PTROB_P (type1
)
2650 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2654 /* 9 For every type T, there exist candidate operator functions of the form
2657 10For every promoted arithmetic type T, there exist candidate operator
2658 functions of the form
2662 case UNARY_PLUS_EXPR
: /* unary + */
2663 if (TYPE_PTR_P (type1
))
2667 if (ARITHMETIC_TYPE_P (type1
))
2671 /* 11For every promoted integral type T, there exist candidate operator
2672 functions of the form
2676 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2680 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2681 is the same type as C2 or is a derived class of C2, T is a complete
2682 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2683 there exist candidate operator functions of the form
2684 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2685 where CV12 is the union of CV1 and CV2. */
2688 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2690 tree c1
= TREE_TYPE (type1
);
2691 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2693 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2694 && (TYPE_PTRMEMFUNC_P (type2
)
2695 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2700 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2701 didate operator functions of the form
2706 bool operator<(L, R);
2707 bool operator>(L, R);
2708 bool operator<=(L, R);
2709 bool operator>=(L, R);
2710 bool operator==(L, R);
2711 bool operator!=(L, R);
2712 where LR is the result of the usual arithmetic conversions between
2715 14For every pair of types T and I, where T is a cv-qualified or cv-
2716 unqualified complete object type and I is a promoted integral type,
2717 there exist candidate operator functions of the form
2718 T* operator+(T*, I);
2719 T& operator[](T*, I);
2720 T* operator-(T*, I);
2721 T* operator+(I, T*);
2722 T& operator[](I, T*);
2724 15For every T, where T is a pointer to complete object type, there exist
2725 candidate operator functions of the form112)
2726 ptrdiff_t operator-(T, T);
2728 16For every pointer or enumeration type T, there exist candidate operator
2729 functions of the form
2730 bool operator<(T, T);
2731 bool operator>(T, T);
2732 bool operator<=(T, T);
2733 bool operator>=(T, T);
2734 bool operator==(T, T);
2735 bool operator!=(T, T);
2737 17For every pointer to member type T, there exist candidate operator
2738 functions of the form
2739 bool operator==(T, T);
2740 bool operator!=(T, T); */
2743 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2745 if (TYPE_PTROB_P (type1
)
2746 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2748 type2
= ptrdiff_type_node
;
2753 case TRUNC_DIV_EXPR
:
2754 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2760 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2761 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2763 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2768 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2780 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2782 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2784 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2785 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2787 if (TYPE_PTR_P (type1
)
2788 && null_ptr_cst_p (args
[1]))
2793 if (null_ptr_cst_p (args
[0])
2794 && TYPE_PTR_P (type2
))
2802 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2806 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2808 type1
= ptrdiff_type_node
;
2811 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2813 type2
= ptrdiff_type_node
;
2818 /* 18For every pair of promoted integral types L and R, there exist candi-
2819 date operator functions of the form
2826 where LR is the result of the usual arithmetic conversions between
2829 case TRUNC_MOD_EXPR
:
2835 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2839 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2840 type, VQ is either volatile or empty, and R is a promoted arithmetic
2841 type, there exist candidate operator functions of the form
2842 VQ L& operator=(VQ L&, R);
2843 VQ L& operator*=(VQ L&, R);
2844 VQ L& operator/=(VQ L&, R);
2845 VQ L& operator+=(VQ L&, R);
2846 VQ L& operator-=(VQ L&, R);
2848 20For every pair T, VQ), where T is any type and VQ is either volatile
2849 or empty, there exist candidate operator functions of the form
2850 T*VQ& operator=(T*VQ&, T*);
2852 21For every pair T, VQ), where T is a pointer to member type and VQ is
2853 either volatile or empty, there exist candidate operator functions of
2855 VQ T& operator=(VQ T&, T);
2857 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2858 unqualified complete object type, VQ is either volatile or empty, and
2859 I is a promoted integral type, there exist candidate operator func-
2861 T*VQ& operator+=(T*VQ&, I);
2862 T*VQ& operator-=(T*VQ&, I);
2864 23For every triple L, VQ, R), where L is an integral or enumeration
2865 type, VQ is either volatile or empty, and R is a promoted integral
2866 type, there exist candidate operator functions of the form
2868 VQ L& operator%=(VQ L&, R);
2869 VQ L& operator<<=(VQ L&, R);
2870 VQ L& operator>>=(VQ L&, R);
2871 VQ L& operator&=(VQ L&, R);
2872 VQ L& operator^=(VQ L&, R);
2873 VQ L& operator|=(VQ L&, R); */
2880 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2882 type2
= ptrdiff_type_node
;
2887 case TRUNC_DIV_EXPR
:
2888 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2892 case TRUNC_MOD_EXPR
:
2898 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2903 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2905 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2906 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2907 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2908 || ((TYPE_PTRMEMFUNC_P (type1
)
2909 || TYPE_PTR_P (type1
))
2910 && null_ptr_cst_p (args
[1])))
2920 type1
= build_reference_type (type1
);
2926 For every pair of promoted arithmetic types L and R, there
2927 exist candidate operator functions of the form
2929 LR operator?(bool, L, R);
2931 where LR is the result of the usual arithmetic conversions
2932 between types L and R.
2934 For every type T, where T is a pointer or pointer-to-member
2935 type, there exist candidate operator functions of the form T
2936 operator?(bool, T, T); */
2938 if (promoted_arithmetic_type_p (type1
)
2939 && promoted_arithmetic_type_p (type2
))
2943 /* Otherwise, the types should be pointers. */
2944 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2947 /* We don't check that the two types are the same; the logic
2948 below will actually create two candidates; one in which both
2949 parameter types are TYPE1, and one in which both parameter
2955 if (ARITHMETIC_TYPE_P (type1
))
2963 /* Make sure we don't create builtin candidates with dependent types. */
2964 bool u1
= uses_template_parms (type1
);
2965 bool u2
= type2
? uses_template_parms (type2
) : false;
2968 /* Try to recover if one of the types is non-dependent. But if
2969 there's only one type, there's nothing we can do. */
2972 /* And we lose if both are dependent. */
2975 /* Or if they have different forms. */
2976 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2985 /* If we're dealing with two pointer types or two enumeral types,
2986 we need candidates for both of them. */
2987 if (type2
&& !same_type_p (type1
, type2
)
2988 && TREE_CODE (type1
) == TREE_CODE (type2
)
2989 && (TYPE_REF_P (type1
)
2990 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2991 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2992 || TYPE_PTRMEMFUNC_P (type1
)
2993 || MAYBE_CLASS_TYPE_P (type1
)
2994 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2996 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2998 tree cptype
= composite_pointer_type (type1
, type2
,
3003 if (cptype
!= error_mark_node
)
3005 build_builtin_candidate
3006 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
3012 build_builtin_candidate
3013 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
3014 build_builtin_candidate
3015 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
3019 build_builtin_candidate
3020 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
3024 type_decays_to (tree type
)
3026 if (TREE_CODE (type
) == ARRAY_TYPE
)
3027 return build_pointer_type (TREE_TYPE (type
));
3028 if (TREE_CODE (type
) == FUNCTION_TYPE
)
3029 return build_pointer_type (type
);
3033 /* There are three conditions of builtin candidates:
3035 1) bool-taking candidates. These are the same regardless of the input.
3036 2) pointer-pair taking candidates. These are generated for each type
3037 one of the input types converts to.
3038 3) arithmetic candidates. According to the standard, we should generate
3039 all of these, but I'm trying not to...
3041 Here we generate a superset of the possible candidates for this particular
3042 case. That is a subset of the full set the standard defines, plus some
3043 other cases which the standard disallows. add_builtin_candidate will
3044 filter out the invalid set. */
3047 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
3048 enum tree_code code2
, tree fnname
, tree
*args
,
3049 int flags
, tsubst_flags_t complain
)
3053 tree type
, argtypes
[3], t
;
3054 /* TYPES[i] is the set of possible builtin-operator parameter types
3055 we will consider for the Ith argument. */
3056 vec
<tree
, va_gc
> *types
[2];
3059 for (i
= 0; i
< 3; ++i
)
3062 argtypes
[i
] = unlowered_expr_type (args
[i
]);
3064 argtypes
[i
] = NULL_TREE
;
3069 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
3070 and VQ is either volatile or empty, there exist candidate operator
3071 functions of the form
3072 VQ T& operator++(VQ T&); */
3074 case POSTINCREMENT_EXPR
:
3075 case PREINCREMENT_EXPR
:
3076 case POSTDECREMENT_EXPR
:
3077 case PREDECREMENT_EXPR
:
3082 /* 24There also exist candidate operator functions of the form
3083 bool operator!(bool);
3084 bool operator&&(bool, bool);
3085 bool operator||(bool, bool); */
3087 case TRUTH_NOT_EXPR
:
3088 build_builtin_candidate
3089 (candidates
, fnname
, boolean_type_node
,
3090 NULL_TREE
, args
, argtypes
, flags
, complain
);
3093 case TRUTH_ORIF_EXPR
:
3094 case TRUTH_ANDIF_EXPR
:
3095 build_builtin_candidate
3096 (candidates
, fnname
, boolean_type_node
,
3097 boolean_type_node
, args
, argtypes
, flags
, complain
);
3119 types
[0] = make_tree_vector ();
3120 types
[1] = make_tree_vector ();
3122 for (i
= 0; i
< 2; ++i
)
3126 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
3130 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
3133 convs
= lookup_conversions (argtypes
[i
]);
3135 if (code
== COND_EXPR
)
3137 if (lvalue_p (args
[i
]))
3138 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3140 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
3146 for (; convs
; convs
= TREE_CHAIN (convs
))
3148 type
= TREE_TYPE (convs
);
3151 && (!TYPE_REF_P (type
)
3152 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
3155 if (code
== COND_EXPR
&& TYPE_REF_P (type
))
3156 vec_safe_push (types
[i
], type
);
3158 type
= non_reference (type
);
3159 if (i
!= 0 || ! ref1
)
3161 type
= cv_unqualified (type_decays_to (type
));
3162 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
3163 vec_safe_push (types
[i
], type
);
3164 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3165 type
= type_promotes_to (type
);
3168 if (! vec_member (type
, types
[i
]))
3169 vec_safe_push (types
[i
], type
);
3174 if (code
== COND_EXPR
&& lvalue_p (args
[i
]))
3175 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3176 type
= non_reference (argtypes
[i
]);
3177 if (i
!= 0 || ! ref1
)
3179 type
= cv_unqualified (type_decays_to (type
));
3180 if (enum_p
&& UNSCOPED_ENUM_P (type
))
3181 vec_safe_push (types
[i
], type
);
3182 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3183 type
= type_promotes_to (type
);
3185 vec_safe_push (types
[i
], type
);
3189 /* Run through the possible parameter types of both arguments,
3190 creating candidates with those parameter types. */
3191 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
3196 if (!types
[1]->is_empty ())
3197 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
3198 add_builtin_candidate
3199 (candidates
, code
, code2
, fnname
, t
,
3200 u
, args
, argtypes
, flags
, complain
);
3202 add_builtin_candidate
3203 (candidates
, code
, code2
, fnname
, t
,
3204 NULL_TREE
, args
, argtypes
, flags
, complain
);
3207 release_tree_vector (types
[0]);
3208 release_tree_vector (types
[1]);
3212 /* If TMPL can be successfully instantiated as indicated by
3213 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3215 TMPL is the template. EXPLICIT_TARGS are any explicit template
3216 arguments. ARGLIST is the arguments provided at the call-site.
3217 This does not change ARGLIST. The RETURN_TYPE is the desired type
3218 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3219 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3220 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3222 static struct z_candidate
*
3223 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3224 tree ctype
, tree explicit_targs
, tree first_arg
,
3225 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3226 tree access_path
, tree conversion_path
,
3227 int flags
, tree obj
, unification_kind_t strict
,
3228 tsubst_flags_t complain
)
3230 int ntparms
= DECL_NTPARMS (tmpl
);
3231 tree targs
= make_tree_vec (ntparms
);
3232 unsigned int len
= vec_safe_length (arglist
);
3233 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3234 unsigned int skip_without_in_chrg
= 0;
3235 tree first_arg_without_in_chrg
= first_arg
;
3236 tree
*args_without_in_chrg
;
3237 unsigned int nargs_without_in_chrg
;
3238 unsigned int ia
, ix
;
3240 struct z_candidate
*cand
;
3242 struct rejection_reason
*reason
= NULL
;
3244 conversion
**convs
= NULL
;
3246 /* We don't do deduction on the in-charge parameter, the VTT
3247 parameter or 'this'. */
3248 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3250 if (first_arg_without_in_chrg
!= NULL_TREE
)
3251 first_arg_without_in_chrg
= NULL_TREE
;
3252 else if (return_type
&& strict
== DEDUCE_CALL
)
3253 /* We're deducing for a call to the result of a template conversion
3254 function, so the args don't contain 'this'; leave them alone. */;
3256 ++skip_without_in_chrg
;
3259 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3260 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3261 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3263 if (first_arg_without_in_chrg
!= NULL_TREE
)
3264 first_arg_without_in_chrg
= NULL_TREE
;
3266 ++skip_without_in_chrg
;
3269 if (len
< skip_without_in_chrg
)
3272 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3273 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3274 TREE_TYPE ((*arglist
)[0])))
3276 /* 12.8/6 says, "A declaration of a constructor for a class X is
3277 ill-formed if its first parameter is of type (optionally cv-qualified)
3278 X and either there are no other parameters or else all other
3279 parameters have default arguments. A member function template is never
3280 instantiated to produce such a constructor signature."
3282 So if we're trying to copy an object of the containing class, don't
3283 consider a template constructor that has a first parameter type that
3284 is just a template parameter, as we would deduce a signature that we
3285 would then reject in the code below. */
3286 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3288 firstparm
= TREE_VALUE (firstparm
);
3289 if (PACK_EXPANSION_P (firstparm
))
3290 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3291 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3293 gcc_assert (!explicit_targs
);
3294 reason
= invalid_copy_with_fn_template_rejection ();
3300 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3301 + (len
- skip_without_in_chrg
));
3302 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3304 if (first_arg_without_in_chrg
!= NULL_TREE
)
3306 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3309 for (ix
= skip_without_in_chrg
;
3310 vec_safe_iterate (arglist
, ix
, &arg
);
3313 args_without_in_chrg
[ia
] = arg
;
3316 gcc_assert (ia
== nargs_without_in_chrg
);
3318 errs
= errorcount
+sorrycount
;
3320 convs
= alloc_conversions (nargs
);
3321 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3322 args_without_in_chrg
,
3323 nargs_without_in_chrg
,
3324 return_type
, strict
, flags
, convs
,
3325 false, complain
& tf_decltype
);
3327 if (fn
== error_mark_node
)
3329 /* Don't repeat unification later if it already resulted in errors. */
3330 if (errorcount
+sorrycount
== errs
)
3331 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3332 targs
, args_without_in_chrg
,
3333 nargs_without_in_chrg
,
3334 return_type
, strict
, flags
);
3336 reason
= template_unification_error_rejection ();
3340 /* Now the explicit specifier might have been deduced; check if this
3341 declaration is explicit. If it is and we're ignoring non-converting
3342 constructors, don't add this function to the set of candidates. */
3343 if ((flags
& LOOKUP_ONLYCONVERTING
) && DECL_NONCONVERTING_P (fn
))
3346 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3348 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3349 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3352 /* We're trying to produce a constructor with a prohibited signature,
3353 as discussed above; handle here any cases we didn't catch then,
3355 reason
= invalid_copy_with_fn_template_rejection ();
3360 if (obj
!= NULL_TREE
)
3361 /* Aha, this is a conversion function. */
3362 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3363 access_path
, conversion_path
, complain
);
3365 cand
= add_function_candidate (candidates
, fn
, ctype
,
3366 first_arg
, arglist
, access_path
,
3367 conversion_path
, flags
, convs
, complain
);
3368 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3369 /* This situation can occur if a member template of a template
3370 class is specialized. Then, instantiate_template might return
3371 an instantiation of the specialization, in which case the
3372 DECL_TI_TEMPLATE field will point at the original
3373 specialization. For example:
3375 template <class T> struct S { template <class U> void f(U);
3376 template <> void f(int) {}; };
3380 Here, TMPL will be template <class U> S<double>::f(U).
3381 And, instantiate template will give us the specialization
3382 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3383 for this will point at template <class T> template <> S<T>::f(int),
3384 so that we can find the definition. For the purposes of
3385 overload resolution, however, we want the original TMPL. */
3386 cand
->template_decl
= build_template_info (tmpl
, targs
);
3388 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3389 cand
->explicit_targs
= explicit_targs
;
3393 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3394 access_path
, conversion_path
, 0, reason
, flags
);
3398 static struct z_candidate
*
3399 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3400 tree explicit_targs
, tree first_arg
,
3401 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3402 tree access_path
, tree conversion_path
, int flags
,
3403 unification_kind_t strict
, tsubst_flags_t complain
)
3406 add_template_candidate_real (candidates
, tmpl
, ctype
,
3407 explicit_targs
, first_arg
, arglist
,
3408 return_type
, access_path
, conversion_path
,
3409 flags
, NULL_TREE
, strict
, complain
);
3412 /* Create an overload candidate for the conversion function template TMPL,
3413 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3414 pointer-to-function which will in turn be called with the argument list
3415 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3416 passed on to implicit_conversion. */
3418 static struct z_candidate
*
3419 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3421 const vec
<tree
, va_gc
> *arglist
,
3422 tree return_type
, tree access_path
,
3423 tree conversion_path
, tsubst_flags_t complain
)
3425 /* Making this work broke PR 71117 and 85118, so until the committee resolves
3426 core issue 2189, let's disable this candidate if there are any call
3432 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3433 NULL_TREE
, arglist
, return_type
, access_path
,
3434 conversion_path
, 0, obj
, DEDUCE_CALL
,
3438 /* The CANDS are the set of candidates that were considered for
3439 overload resolution. Return the set of viable candidates, or CANDS
3440 if none are viable. If any of the candidates were viable, set
3441 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3442 considered viable only if it is strictly viable. */
3444 static struct z_candidate
*
3445 splice_viable (struct z_candidate
*cands
,
3449 struct z_candidate
*viable
;
3450 struct z_candidate
**last_viable
;
3451 struct z_candidate
**cand
;
3452 bool found_strictly_viable
= false;
3454 /* Be strict inside templates, since build_over_call won't actually
3455 do the conversions to get pedwarns. */
3456 if (processing_template_decl
)
3460 last_viable
= &viable
;
3461 *any_viable_p
= false;
3466 struct z_candidate
*c
= *cand
;
3468 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3470 /* Be strict in the presence of a viable candidate. Also if
3471 there are template candidates, so that we get deduction errors
3472 for them instead of silently preferring a bad conversion. */
3474 if (viable
&& !found_strictly_viable
)
3476 /* Put any spliced near matches back onto the main list so
3477 that we see them if there is no strict match. */
3478 *any_viable_p
= false;
3479 *last_viable
= cands
;
3482 last_viable
= &viable
;
3486 if (strict_p
? c
->viable
== 1 : c
->viable
)
3491 last_viable
= &c
->next
;
3492 *any_viable_p
= true;
3494 found_strictly_viable
= true;
3500 return viable
? viable
: cands
;
3504 any_strictly_viable (struct z_candidate
*cands
)
3506 for (; cands
; cands
= cands
->next
)
3507 if (cands
->viable
== 1)
3512 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3513 words, it is about to become the "this" pointer for a member
3514 function call. Take the address of the object. */
3517 build_this (tree obj
)
3519 /* In a template, we are only concerned about the type of the
3520 expression, so we can take a shortcut. */
3521 if (processing_template_decl
)
3522 return build_address (obj
);
3524 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3527 /* Returns true iff functions are equivalent. Equivalent functions are
3528 not '==' only if one is a function-local extern function or if
3529 both are extern "C". */
3532 equal_functions (tree fn1
, tree fn2
)
3534 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3536 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3538 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3539 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3540 return decls_match (fn1
, fn2
);
3544 /* Print information about a candidate FN being rejected due to INFO. */
3547 print_conversion_rejection (location_t loc
, struct conversion_info
*info
,
3550 tree from
= info
->from
;
3552 from
= lvalue_type (from
);
3553 if (info
->n_arg
== -1)
3555 /* Conversion of implicit `this' argument failed. */
3556 if (!TYPE_P (info
->from
))
3557 /* A bad conversion for 'this' must be discarding cv-quals. */
3558 inform (loc
, " passing %qT as %<this%> "
3559 "argument discards qualifiers",
3562 inform (loc
, " no known conversion for implicit "
3563 "%<this%> parameter from %qH to %qI",
3564 from
, info
->to_type
);
3566 else if (!TYPE_P (info
->from
))
3568 if (info
->n_arg
>= 0)
3569 inform (loc
, " conversion of argument %d would be ill-formed:",
3571 perform_implicit_conversion (info
->to_type
, info
->from
,
3572 tf_warning_or_error
);
3574 else if (info
->n_arg
== -2)
3575 /* Conversion of conversion function return value failed. */
3576 inform (loc
, " no known conversion from %qH to %qI",
3577 from
, info
->to_type
);
3580 if (TREE_CODE (fn
) == FUNCTION_DECL
)
3581 loc
= get_fndecl_argument_location (fn
, info
->n_arg
);
3582 inform (loc
, " no known conversion for argument %d from %qH to %qI",
3583 info
->n_arg
+ 1, from
, info
->to_type
);
3587 /* Print information about a candidate with WANT parameters and we found
3591 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3593 inform_n (loc
, want
,
3594 " candidate expects %d argument, %d provided",
3595 " candidate expects %d arguments, %d provided",
3599 /* Print information about one overload candidate CANDIDATE. MSGSTR
3600 is the text to print before the candidate itself.
3602 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3603 to have been run through gettext by the caller. This wart makes
3604 life simpler in print_z_candidates and for the translators. */
3607 print_z_candidate (location_t loc
, const char *msgstr
,
3608 struct z_candidate
*candidate
)
3610 const char *msg
= (msgstr
== NULL
3612 : ACONCAT ((msgstr
, " ", NULL
)));
3613 tree fn
= candidate
->fn
;
3614 if (flag_new_inheriting_ctors
)
3615 fn
= strip_inheriting_ctors (fn
);
3616 location_t cloc
= location_of (fn
);
3618 if (identifier_p (fn
))
3621 if (candidate
->num_convs
== 3)
3622 inform (cloc
, "%s%<%D(%T, %T, %T)%> <built-in>", msg
, fn
,
3623 candidate
->convs
[0]->type
,
3624 candidate
->convs
[1]->type
,
3625 candidate
->convs
[2]->type
);
3626 else if (candidate
->num_convs
== 2)
3627 inform (cloc
, "%s%<%D(%T, %T)%> <built-in>", msg
, fn
,
3628 candidate
->convs
[0]->type
,
3629 candidate
->convs
[1]->type
);
3631 inform (cloc
, "%s%<%D(%T)%> <built-in>", msg
, fn
,
3632 candidate
->convs
[0]->type
);
3634 else if (TYPE_P (fn
))
3635 inform (cloc
, "%s%qT <conversion>", msg
, fn
);
3636 else if (candidate
->viable
== -1)
3637 inform (cloc
, "%s%#qD <near match>", msg
, fn
);
3638 else if (DECL_DELETED_FN (fn
))
3639 inform (cloc
, "%s%#qD <deleted>", msg
, fn
);
3641 inform (cloc
, "%s%#qD", msg
, fn
);
3642 if (fn
!= candidate
->fn
)
3644 cloc
= location_of (candidate
->fn
);
3645 inform (cloc
, " inherited here");
3647 /* Give the user some information about why this candidate failed. */
3648 if (candidate
->reason
!= NULL
)
3650 struct rejection_reason
*r
= candidate
->reason
;
3655 print_arity_information (cloc
, r
->u
.arity
.actual
,
3656 r
->u
.arity
.expected
);
3658 case rr_arg_conversion
:
3659 print_conversion_rejection (cloc
, &r
->u
.conversion
, fn
);
3661 case rr_bad_arg_conversion
:
3662 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
, fn
);
3664 case rr_explicit_conversion
:
3665 inform (cloc
, " return type %qT of explicit conversion function "
3666 "cannot be converted to %qT with a qualification "
3667 "conversion", r
->u
.conversion
.from
,
3668 r
->u
.conversion
.to_type
);
3670 case rr_template_conversion
:
3671 inform (cloc
, " conversion from return type %qT of template "
3672 "conversion function specialization to %qT is not an "
3673 "exact match", r
->u
.conversion
.from
,
3674 r
->u
.conversion
.to_type
);
3676 case rr_template_unification
:
3677 /* We use template_unification_error_rejection if unification caused
3678 actual non-SFINAE errors, in which case we don't need to repeat
3680 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3682 inform (cloc
, " substitution of deduced template arguments "
3683 "resulted in errors seen above");
3686 /* Re-run template unification with diagnostics. */
3687 inform (cloc
, " template argument deduction/substitution failed:");
3688 fn_type_unification (r
->u
.template_unification
.tmpl
,
3689 r
->u
.template_unification
.explicit_targs
,
3691 (r
->u
.template_unification
.num_targs
)),
3692 r
->u
.template_unification
.args
,
3693 r
->u
.template_unification
.nargs
,
3694 r
->u
.template_unification
.return_type
,
3695 r
->u
.template_unification
.strict
,
3696 r
->u
.template_unification
.flags
,
3699 case rr_invalid_copy
:
3701 " a constructor taking a single argument of its own "
3702 "class type is invalid");
3704 case rr_constraint_failure
:
3706 tree tmpl
= r
->u
.template_instantiation
.tmpl
;
3707 tree args
= r
->u
.template_instantiation
.targs
;
3708 diagnose_constraints (cloc
, tmpl
, args
);
3711 case rr_inherited_ctor
:
3712 inform (cloc
, " an inherited constructor is not a candidate for "
3713 "initialization from an expression of the same or derived "
3718 /* This candidate didn't have any issues or we failed to
3719 handle a particular code. Either way... */
3726 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3728 struct z_candidate
*cand1
;
3729 struct z_candidate
**cand2
;
3734 /* Remove non-viable deleted candidates. */
3736 for (cand2
= &cand1
; *cand2
; )
3738 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3739 && !(*cand2
)->viable
3740 && DECL_DELETED_FN ((*cand2
)->fn
))
3741 *cand2
= (*cand2
)->next
;
3743 cand2
= &(*cand2
)->next
;
3745 /* ...if there are any non-deleted ones. */
3749 /* There may be duplicates in the set of candidates. We put off
3750 checking this condition as long as possible, since we have no way
3751 to eliminate duplicates from a set of functions in less than n^2
3752 time. Now we are about to emit an error message, so it is more
3753 permissible to go slowly. */
3754 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3756 tree fn
= cand1
->fn
;
3757 /* Skip builtin candidates and conversion functions. */
3760 cand2
= &cand1
->next
;
3763 if (DECL_P ((*cand2
)->fn
)
3764 && equal_functions (fn
, (*cand2
)->fn
))
3765 *cand2
= (*cand2
)->next
;
3767 cand2
= &(*cand2
)->next
;
3771 for (; candidates
; candidates
= candidates
->next
)
3772 print_z_candidate (loc
, "candidate:", candidates
);
3775 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3776 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3777 the result of the conversion function to convert it to the final
3778 desired type. Merge the two sequences into a single sequence,
3779 and return the merged sequence. */
3782 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3785 bool bad
= user_seq
->bad_p
;
3787 gcc_assert (user_seq
->kind
== ck_user
);
3789 /* Find the end of the second conversion sequence. */
3790 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3792 /* The entire sequence is a user-conversion sequence. */
3793 (*t
)->user_conv_p
= true;
3798 if ((*t
)->rvaluedness_matches_p
)
3799 /* We're binding a reference directly to the result of the conversion.
3800 build_user_type_conversion_1 stripped the REFERENCE_TYPE from the return
3801 type, but we want it back. */
3802 user_seq
->type
= TREE_TYPE (TREE_TYPE (user_seq
->cand
->fn
));
3804 /* Replace the identity conversion with the user conversion
3811 /* Handle overload resolution for initializing an object of class type from
3812 an initializer list. First we look for a suitable constructor that
3813 takes a std::initializer_list; if we don't find one, we then look for a
3814 non-list constructor.
3816 Parameters are as for add_candidates, except that the arguments are in
3817 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3818 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3821 add_list_candidates (tree fns
, tree first_arg
,
3822 const vec
<tree
, va_gc
> *args
, tree totype
,
3823 tree explicit_targs
, bool template_only
,
3824 tree conversion_path
, tree access_path
,
3826 struct z_candidate
**candidates
,
3827 tsubst_flags_t complain
)
3829 gcc_assert (*candidates
== NULL
);
3831 /* We're looking for a ctor for list-initialization. */
3832 flags
|= LOOKUP_LIST_INIT_CTOR
;
3833 /* And we don't allow narrowing conversions. We also use this flag to
3834 avoid the copy constructor call for copy-list-initialization. */
3835 flags
|= LOOKUP_NO_NARROWING
;
3837 unsigned nart
= num_artificial_parms_for (OVL_FIRST (fns
)) - 1;
3838 tree init_list
= (*args
)[nart
];
3840 /* Always use the default constructor if the list is empty (DR 990). */
3841 if (CONSTRUCTOR_NELTS (init_list
) == 0
3842 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3844 /* If the class has a list ctor, try passing the list as a single
3845 argument first, but only consider list ctors. */
3846 else if (TYPE_HAS_LIST_CTOR (totype
))
3848 flags
|= LOOKUP_LIST_ONLY
;
3849 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3850 explicit_targs
, template_only
, conversion_path
,
3851 access_path
, flags
, candidates
, complain
);
3852 if (any_strictly_viable (*candidates
))
3856 /* Expand the CONSTRUCTOR into a new argument vec. */
3857 vec
<tree
, va_gc
> *new_args
;
3858 vec_alloc (new_args
, nart
+ CONSTRUCTOR_NELTS (init_list
));
3859 for (unsigned i
= 0; i
< nart
; ++i
)
3860 new_args
->quick_push ((*args
)[i
]);
3861 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (init_list
); ++i
)
3862 new_args
->quick_push (CONSTRUCTOR_ELT (init_list
, i
)->value
);
3864 /* We aren't looking for list-ctors anymore. */
3865 flags
&= ~LOOKUP_LIST_ONLY
;
3866 /* We allow more user-defined conversions within an init-list. */
3867 flags
&= ~LOOKUP_NO_CONVERSION
;
3869 add_candidates (fns
, first_arg
, new_args
, NULL_TREE
,
3870 explicit_targs
, template_only
, conversion_path
,
3871 access_path
, flags
, candidates
, complain
);
3874 /* Returns the best overload candidate to perform the requested
3875 conversion. This function is used for three the overloading situations
3876 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3877 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3878 per [dcl.init.ref], so we ignore temporary bindings. */
3880 static struct z_candidate
*
3881 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3882 tsubst_flags_t complain
)
3884 struct z_candidate
*candidates
, *cand
;
3886 tree ctors
= NULL_TREE
;
3887 tree conv_fns
= NULL_TREE
;
3888 conversion
*conv
= NULL
;
3889 tree first_arg
= NULL_TREE
;
3890 vec
<tree
, va_gc
> *args
= NULL
;
3897 fromtype
= TREE_TYPE (expr
);
3899 /* We represent conversion within a hierarchy using RVALUE_CONV and
3900 BASE_CONV, as specified by [over.best.ics]; these become plain
3901 constructor calls, as specified in [dcl.init]. */
3902 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3903 || !DERIVED_FROM_P (totype
, fromtype
));
3905 if (CLASS_TYPE_P (totype
))
3906 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3907 creating a garbage BASELINK; constructors can't be inherited. */
3908 ctors
= get_class_binding (totype
, complete_ctor_identifier
);
3910 if (MAYBE_CLASS_TYPE_P (fromtype
))
3912 tree to_nonref
= non_reference (totype
);
3913 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3914 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3915 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3917 /* [class.conv.fct] A conversion function is never used to
3918 convert a (possibly cv-qualified) object to the (possibly
3919 cv-qualified) same object type (or a reference to it), to a
3920 (possibly cv-qualified) base class of that type (or a
3921 reference to it)... */
3924 conv_fns
= lookup_conversions (fromtype
);
3928 flags
|= LOOKUP_NO_CONVERSION
;
3929 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3930 flags
|= LOOKUP_NO_NARROWING
;
3932 /* It's OK to bind a temporary for converting constructor arguments, but
3933 not in converting the return value of a conversion operator. */
3934 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3935 | (flags
& LOOKUP_NO_NARROWING
));
3936 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3940 int ctorflags
= flags
;
3942 first_arg
= build_dummy_object (totype
);
3944 /* We should never try to call the abstract or base constructor
3946 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors
))
3947 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors
)));
3949 args
= make_tree_vector_single (expr
);
3950 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3952 /* List-initialization. */
3953 add_list_candidates (ctors
, first_arg
, args
, totype
, NULL_TREE
,
3954 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3955 ctorflags
, &candidates
, complain
);
3959 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3960 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3961 ctorflags
, &candidates
, complain
);
3964 for (cand
= candidates
; cand
; cand
= cand
->next
)
3966 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3968 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3969 set, then this is copy-initialization. In that case, "The
3970 result of the call is then used to direct-initialize the
3971 object that is the destination of the copy-initialization."
3974 We represent this in the conversion sequence with an
3975 rvalue conversion, which means a constructor call. */
3976 if (!TYPE_REF_P (totype
)
3977 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3979 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3985 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3986 first_arg
= CONSTRUCTOR_ELT (expr
, 0)->value
;
3991 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3993 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3994 struct z_candidate
*old_candidates
;
3996 /* If we are called to convert to a reference type, we are trying to
3997 find a direct binding, so don't even consider temporaries. If
3998 we don't find a direct binding, the caller will try again to
3999 look for a temporary binding. */
4000 if (TYPE_REF_P (totype
))
4001 convflags
|= LOOKUP_NO_TEMP_BIND
;
4003 old_candidates
= candidates
;
4004 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
4006 conversion_path
, TYPE_BINFO (fromtype
),
4007 flags
, &candidates
, complain
);
4009 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
4011 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
4013 = implicit_conversion (totype
,
4016 /*c_cast_p=*/false, convflags
,
4019 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
4020 copy-initialization. In that case, "The result of the
4021 call is then used to direct-initialize the object that is
4022 the destination of the copy-initialization." [dcl.init]
4024 We represent this in the conversion sequence with an
4025 rvalue conversion, which means a constructor call. But
4026 don't add a second rvalue conversion if there's already
4027 one there. Which there really shouldn't be, but it's
4028 harmless since we'd add it here anyway. */
4029 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
4030 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
4031 ics
= build_conv (ck_rvalue
, totype
, ics
);
4033 cand
->second_conv
= ics
;
4038 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
4040 EXPR_LOCATION (expr
));
4042 else if (DECL_NONCONVERTING_P (cand
->fn
)
4043 && ics
->rank
> cr_exact
)
4045 /* 13.3.1.5: For direct-initialization, those explicit
4046 conversion functions that are not hidden within S and
4047 yield type T or a type that can be converted to type T
4048 with a qualification conversion (4.4) are also candidate
4050 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
4051 I've raised this issue with the committee. --jason 9/2011 */
4053 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
4055 else if (cand
->viable
== 1 && ics
->bad_p
)
4059 = bad_arg_conversion_rejection (NULL_TREE
, -2,
4061 EXPR_LOCATION (expr
));
4063 else if (primary_template_specialization_p (cand
->fn
)
4064 && ics
->rank
> cr_exact
)
4066 /* 13.3.3.1.2: If the user-defined conversion is specified by
4067 a specialization of a conversion function template, the
4068 second standard conversion sequence shall have exact match
4071 cand
->reason
= template_conversion_rejection (rettype
, totype
);
4076 candidates
= splice_viable (candidates
, false, &any_viable_p
);
4080 release_tree_vector (args
);
4084 cand
= tourney (candidates
, complain
);
4087 if (complain
& tf_error
)
4089 auto_diagnostic_group d
;
4090 error ("conversion from %qH to %qI is ambiguous",
4092 print_z_candidates (location_of (expr
), candidates
);
4095 cand
= candidates
; /* any one will do */
4096 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
4097 cand
->second_conv
->user_conv_p
= true;
4098 if (!any_strictly_viable (candidates
))
4099 cand
->second_conv
->bad_p
= true;
4100 if (flags
& LOOKUP_ONLYCONVERTING
)
4101 cand
->second_conv
->need_temporary_p
= true;
4102 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
4103 ambiguous conversion is no worse than another user-defined
4110 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
4111 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
4112 else if (cand
->second_conv
->kind
== ck_rvalue
)
4113 /* DR 5: [in the first step of copy-initialization]...if the function
4114 is a constructor, the call initializes a temporary of the
4115 cv-unqualified version of the destination type. */
4116 convtype
= cv_unqualified (totype
);
4119 /* Build the user conversion sequence. */
4123 build_identity_conv (TREE_TYPE (expr
), expr
));
4125 if (cand
->viable
== -1)
4128 /* We're performing the maybe-rvalue overload resolution and
4129 a conversion function is in play. Reject converting the return
4130 value of the conversion function to a base class. */
4131 if ((flags
& LOOKUP_PREFER_RVALUE
) && !DECL_CONSTRUCTOR_P (cand
->fn
))
4132 for (conversion
*t
= cand
->second_conv
; t
; t
= next_conversion (t
))
4133 if (t
->kind
== ck_base
)
4136 /* Remember that this was a list-initialization. */
4137 if (flags
& LOOKUP_NO_NARROWING
)
4138 conv
->check_narrowing
= true;
4140 /* Combine it with the second conversion sequence. */
4141 cand
->second_conv
= merge_conversion_sequences (conv
,
4147 /* Wrapper for above. */
4150 build_user_type_conversion (tree totype
, tree expr
, int flags
,
4151 tsubst_flags_t complain
)
4153 struct z_candidate
*cand
;
4156 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4157 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
4161 if (cand
->second_conv
->kind
== ck_ambig
)
4162 ret
= error_mark_node
;
4165 expr
= convert_like (cand
->second_conv
, expr
, complain
);
4166 ret
= convert_from_reference (expr
);
4172 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4176 /* Subroutine of convert_nontype_argument.
4178 EXPR is an expression used in a context that requires a converted
4179 constant-expression, such as a template non-type parameter. Do any
4180 necessary conversions (that are permitted for converted
4181 constant-expressions) to convert it to the desired type.
4183 If conversion is successful, returns the converted expression;
4184 otherwise, returns error_mark_node. */
4187 build_converted_constant_expr (tree type
, tree expr
, tsubst_flags_t complain
)
4192 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
4194 if (error_operand_p (expr
))
4195 return error_mark_node
;
4197 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4198 p
= conversion_obstack_alloc (0);
4200 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
4202 LOOKUP_IMPLICIT
, complain
);
4204 /* A converted constant expression of type T is an expression, implicitly
4205 converted to type T, where the converted expression is a constant
4206 expression and the implicit conversion sequence contains only
4208 * user-defined conversions,
4209 * lvalue-to-rvalue conversions (7.1),
4210 * array-to-pointer conversions (7.2),
4211 * function-to-pointer conversions (7.3),
4212 * qualification conversions (7.5),
4213 * integral promotions (7.6),
4214 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4215 * null pointer conversions (7.11) from std::nullptr_t,
4216 * null member pointer conversions (7.12) from std::nullptr_t, and
4217 * function pointer conversions (7.13),
4219 and where the reference binding (if any) binds directly. */
4221 for (conversion
*c
= conv
;
4222 conv
&& c
->kind
!= ck_identity
;
4223 c
= next_conversion (c
))
4227 /* A conversion function is OK. If it isn't constexpr, we'll
4228 complain later that the argument isn't constant. */
4230 /* The lvalue-to-rvalue conversion is OK. */
4232 /* Array-to-pointer and function-to-pointer. */
4234 /* Function pointer conversions. */
4236 /* Qualification conversions. */
4241 if (c
->need_temporary_p
)
4243 if (complain
& tf_error
)
4244 error_at (loc
, "initializing %qH with %qI in converted "
4245 "constant expression does not bind directly",
4246 type
, next_conversion (c
)->type
);
4255 t
= next_conversion (c
)->type
;
4256 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
)
4257 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
4258 /* Integral promotion or conversion. */
4260 if (NULLPTR_TYPE_P (t
))
4261 /* Conversion from nullptr to pointer or pointer-to-member. */
4264 if (complain
& tf_error
)
4265 error_at (loc
, "conversion from %qH to %qI in a "
4266 "converted constant expression", t
, type
);
4275 /* Avoid confusing convert_nontype_argument by introducing
4276 a redundant conversion to the same reference type. */
4277 if (conv
&& conv
->kind
== ck_ref_bind
4278 && REFERENCE_REF_P (expr
))
4280 tree ref
= TREE_OPERAND (expr
, 0);
4281 if (same_type_p (type
, TREE_TYPE (ref
)))
4287 conv
->check_narrowing
= true;
4288 conv
->check_narrowing_const_only
= true;
4289 expr
= convert_like (conv
, expr
, complain
);
4293 if (complain
& tf_error
)
4294 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
4295 TREE_TYPE (expr
), type
);
4296 expr
= error_mark_node
;
4299 /* Free all the conversions we allocated. */
4300 obstack_free (&conversion_obstack
, p
);
4305 /* Do any initial processing on the arguments to a function call. */
4307 static vec
<tree
, va_gc
> *
4308 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
4313 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4315 if (error_operand_p (arg
))
4317 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4319 if (complain
& tf_error
)
4320 error ("invalid use of void expression");
4323 else if (invalid_nonstatic_memfn_p (EXPR_LOCATION (arg
), arg
, complain
))
4329 /* Perform overload resolution on FN, which is called with the ARGS.
4331 Return the candidate function selected by overload resolution, or
4332 NULL if the event that overload resolution failed. In the case
4333 that overload resolution fails, *CANDIDATES will be the set of
4334 candidates considered, and ANY_VIABLE_P will be set to true or
4335 false to indicate whether or not any of the candidates were
4338 The ARGS should already have gone through RESOLVE_ARGS before this
4339 function is called. */
4341 static struct z_candidate
*
4342 perform_overload_resolution (tree fn
,
4343 const vec
<tree
, va_gc
> *args
,
4344 struct z_candidate
**candidates
,
4345 bool *any_viable_p
, tsubst_flags_t complain
)
4347 struct z_candidate
*cand
;
4348 tree explicit_targs
;
4351 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4353 explicit_targs
= NULL_TREE
;
4357 *any_viable_p
= true;
4360 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4361 || TREE_CODE (fn
) == TEMPLATE_DECL
4362 || TREE_CODE (fn
) == OVERLOAD
4363 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4365 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4367 explicit_targs
= TREE_OPERAND (fn
, 1);
4368 fn
= TREE_OPERAND (fn
, 0);
4372 /* Add the various candidate functions. */
4373 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4374 explicit_targs
, template_only
,
4375 /*conversion_path=*/NULL_TREE
,
4376 /*access_path=*/NULL_TREE
,
4378 candidates
, complain
);
4380 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4382 cand
= tourney (*candidates
, complain
);
4386 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4390 /* Print an error message about being unable to build a call to FN with
4391 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4392 be located; CANDIDATES is a possibly empty list of such
4396 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4397 struct z_candidate
*candidates
)
4399 tree targs
= NULL_TREE
;
4400 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4402 targs
= TREE_OPERAND (fn
, 1);
4403 fn
= TREE_OPERAND (fn
, 0);
4405 tree name
= OVL_NAME (fn
);
4406 location_t loc
= location_of (name
);
4408 name
= lookup_template_function (name
, targs
);
4410 auto_diagnostic_group d
;
4411 if (!any_strictly_viable (candidates
))
4412 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4413 name
, build_tree_list_vec (args
));
4415 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4416 name
, build_tree_list_vec (args
));
4418 print_z_candidates (loc
, candidates
);
4421 /* Return an expression for a call to FN (a namespace-scope function,
4422 or a static member function) with the ARGS. This may change
4426 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
,
4427 tsubst_flags_t complain
)
4429 struct z_candidate
*candidates
, *cand
;
4434 if (args
!= NULL
&& *args
!= NULL
)
4436 *args
= resolve_args (*args
, complain
);
4438 return error_mark_node
;
4442 tm_malloc_replacement (fn
);
4444 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4445 p
= conversion_obstack_alloc (0);
4447 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4452 if (complain
& tf_error
)
4454 // If there is a single (non-viable) function candidate,
4455 // let the error be diagnosed by cp_build_function_call_vec.
4456 if (!any_viable_p
&& candidates
&& ! candidates
->next
4457 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4458 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4460 // Otherwise, emit notes for non-viable candidates.
4461 print_error_for_call_failure (fn
, *args
, candidates
);
4463 result
= error_mark_node
;
4467 int flags
= LOOKUP_NORMAL
;
4468 /* If fn is template_id_expr, the call has explicit template arguments
4469 (e.g. func<int>(5)), communicate this info to build_over_call
4470 through flags so that later we can use it to decide whether to warn
4471 about peculiar null pointer conversion. */
4472 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4474 /* If overload resolution selects a specialization of a
4475 function concept for non-dependent template arguments,
4476 the expression is true if the constraints are satisfied
4477 and false otherwise.
4479 NOTE: This is an extension of Concepts Lite TS that
4480 allows constraints to be used in expressions. */
4481 if (flag_concepts
&& !processing_template_decl
)
4483 tree tmpl
= DECL_TI_TEMPLATE (cand
->fn
);
4484 tree targs
= DECL_TI_ARGS (cand
->fn
);
4485 tree decl
= DECL_TEMPLATE_RESULT (tmpl
);
4486 if (DECL_DECLARED_CONCEPT_P (decl
))
4487 return evaluate_function_concept (decl
, targs
);
4490 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4493 result
= build_over_call (cand
, flags
, complain
);
4496 /* Free all the conversions we allocated. */
4497 obstack_free (&conversion_obstack
, p
);
4502 /* Build a call to a global operator new. FNNAME is the name of the
4503 operator (either "operator new" or "operator new[]") and ARGS are
4504 the arguments provided. This may change ARGS. *SIZE points to the
4505 total number of bytes required by the allocation, and is updated if
4506 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4507 be used. If this function determines that no cookie should be
4508 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4509 is not NULL_TREE, it is evaluated before calculating the final
4510 array size, and if it fails, the array size is replaced with
4511 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4512 is non-NULL, it will be set, upon return, to the allocation
4516 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4517 tree
*size
, tree
*cookie_size
,
4518 tree align_arg
, tree size_check
,
4519 tree
*fn
, tsubst_flags_t complain
)
4521 tree original_size
= *size
;
4523 struct z_candidate
*candidates
;
4524 struct z_candidate
*cand
= NULL
;
4529 /* Set to (size_t)-1 if the size check fails. */
4530 if (size_check
!= NULL_TREE
)
4532 tree errval
= TYPE_MAX_VALUE (sizetype
);
4533 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4534 errval
= throw_bad_array_new_length ();
4535 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4536 original_size
, errval
);
4538 vec_safe_insert (*args
, 0, *size
);
4539 *args
= resolve_args (*args
, complain
);
4541 return error_mark_node
;
4547 If this lookup fails to find the name, or if the allocated type
4548 is not a class type, the allocation function's name is looked
4549 up in the global scope.
4551 we disregard block-scope declarations of "operator new". */
4552 fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/false, 0, 0);
4553 fns
= lookup_arg_dependent (fnname
, fns
, *args
);
4557 vec
<tree
, va_gc
>* align_args
4558 = vec_copy_and_insert (*args
, align_arg
, 1);
4559 cand
= perform_overload_resolution (fns
, align_args
, &candidates
,
4560 &any_viable_p
, tf_none
);
4563 /* If no aligned allocation function matches, try again without the
4567 /* Figure out what function is being called. */
4569 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4572 /* If no suitable function could be found, issue an error message
4576 if (complain
& tf_error
)
4577 print_error_for_call_failure (fns
, *args
, candidates
);
4578 return error_mark_node
;
4581 /* If a cookie is required, add some extra space. Whether
4582 or not a cookie is required cannot be determined until
4583 after we know which function was called. */
4586 bool use_cookie
= true;
4589 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4590 /* Skip the size_t parameter. */
4591 arg_types
= TREE_CHAIN (arg_types
);
4592 /* Check the remaining parameters (if any). */
4594 && TREE_CHAIN (arg_types
) == void_list_node
4595 && same_type_p (TREE_VALUE (arg_types
),
4598 /* If we need a cookie, adjust the number of bytes allocated. */
4601 /* Update the total size. */
4602 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4605 /* Set to (size_t)-1 if the size check fails. */
4606 gcc_assert (size_check
!= NULL_TREE
);
4607 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4608 *size
, TYPE_MAX_VALUE (sizetype
));
4610 /* Update the argument list to reflect the adjusted size. */
4611 (**args
)[0] = *size
;
4614 *cookie_size
= NULL_TREE
;
4617 /* Tell our caller which function we decided to call. */
4621 /* Build the CALL_EXPR. */
4622 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4625 /* Build a new call to operator(). This may change ARGS. */
4628 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4630 struct z_candidate
*candidates
= 0, *cand
;
4631 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4633 tree result
= NULL_TREE
;
4636 obj
= mark_lvalue_use (obj
);
4638 if (error_operand_p (obj
))
4639 return error_mark_node
;
4641 tree type
= TREE_TYPE (obj
);
4643 obj
= prep_operand (obj
);
4645 if (TYPE_PTRMEMFUNC_P (type
))
4647 if (complain
& tf_error
)
4648 /* It's no good looking for an overloaded operator() on a
4649 pointer-to-member-function. */
4650 error ("pointer-to-member function %qE cannot be called without "
4651 "an object; consider using %<.*%> or %<->*%>", obj
);
4652 return error_mark_node
;
4655 if (TYPE_BINFO (type
))
4657 fns
= lookup_fnfields (TYPE_BINFO (type
), call_op_identifier
, 1);
4658 if (fns
== error_mark_node
)
4659 return error_mark_node
;
4664 if (args
!= NULL
&& *args
!= NULL
)
4666 *args
= resolve_args (*args
, complain
);
4668 return error_mark_node
;
4671 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4672 p
= conversion_obstack_alloc (0);
4676 first_mem_arg
= obj
;
4678 add_candidates (BASELINK_FUNCTIONS (fns
),
4679 first_mem_arg
, *args
, NULL_TREE
,
4681 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4682 LOOKUP_NORMAL
, &candidates
, complain
);
4685 convs
= lookup_conversions (type
);
4687 for (; convs
; convs
= TREE_CHAIN (convs
))
4689 tree totype
= TREE_TYPE (convs
);
4691 if (TYPE_PTRFN_P (totype
)
4692 || TYPE_REFFN_P (totype
)
4693 || (TYPE_REF_P (totype
)
4694 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4695 for (ovl_iterator
iter (TREE_VALUE (convs
)); iter
; ++iter
)
4699 if (DECL_NONCONVERTING_P (fn
))
4702 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4703 add_template_conv_candidate
4704 (&candidates
, fn
, obj
, *args
, totype
,
4705 /*access_path=*/NULL_TREE
,
4706 /*conversion_path=*/NULL_TREE
, complain
);
4708 add_conv_candidate (&candidates
, fn
, obj
,
4709 *args
, /*conversion_path=*/NULL_TREE
,
4710 /*access_path=*/NULL_TREE
, complain
);
4714 /* Be strict here because if we choose a bad conversion candidate, the
4715 errors we get won't mention the call context. */
4716 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4719 if (complain
& tf_error
)
4721 auto_diagnostic_group d
;
4722 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4723 build_tree_list_vec (*args
));
4724 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4726 result
= error_mark_node
;
4730 cand
= tourney (candidates
, complain
);
4733 if (complain
& tf_error
)
4735 auto_diagnostic_group d
;
4736 error ("call of %<(%T) (%A)%> is ambiguous",
4737 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4738 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4740 result
= error_mark_node
;
4742 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4743 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
)
4744 && DECL_OVERLOADED_OPERATOR_IS (cand
->fn
, CALL_EXPR
))
4745 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4748 if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4749 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4753 gcc_checking_assert (TYPE_P (cand
->fn
));
4754 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4756 obj
= convert_from_reference (obj
);
4757 result
= cp_build_function_call_vec (obj
, args
, complain
);
4761 /* Free all the conversions we allocated. */
4762 obstack_free (&conversion_obstack
, p
);
4767 /* Wrapper for above. */
4770 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4773 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4774 ret
= build_op_call_1 (obj
, args
, complain
);
4775 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4779 /* Called by op_error to prepare format strings suitable for the error
4780 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4781 and a suffix (controlled by NTYPES). */
4784 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4788 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4789 : G_("no match for "), errmsg
, NULL
);
4792 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4793 else if (ntypes
== 2)
4794 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4796 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4802 op_error (const op_location_t
&loc
,
4803 enum tree_code code
, enum tree_code code2
,
4804 tree arg1
, tree arg2
, tree arg3
, bool match
)
4806 bool assop
= code
== MODIFY_EXPR
;
4807 const char *opname
= OVL_OP_INFO (assop
, assop
? code2
: code
)->name
;
4812 if (flag_diagnostics_show_caret
)
4813 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4815 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4817 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4818 "in %<%E ? %E : %E%>"), 3, match
),
4820 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4823 case POSTINCREMENT_EXPR
:
4824 case POSTDECREMENT_EXPR
:
4825 if (flag_diagnostics_show_caret
)
4826 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4827 opname
, TREE_TYPE (arg1
));
4829 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4831 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4835 if (flag_diagnostics_show_caret
)
4836 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4837 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4839 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4841 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4846 if (flag_diagnostics_show_caret
)
4847 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4848 opname
, TREE_TYPE (arg1
));
4850 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4851 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4856 if (flag_diagnostics_show_caret
)
4858 binary_op_rich_location
richloc (loc
, arg1
, arg2
, true);
4860 op_error_string (G_("%<operator%s%>"), 2, match
),
4861 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4864 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4866 opname
, arg1
, opname
, arg2
,
4867 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4869 if (flag_diagnostics_show_caret
)
4870 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4871 opname
, TREE_TYPE (arg1
));
4873 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4875 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4880 /* Return the implicit conversion sequence that could be used to
4881 convert E1 to E2 in [expr.cond]. */
4884 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4886 tree t1
= non_reference (TREE_TYPE (e1
));
4887 tree t2
= non_reference (TREE_TYPE (e2
));
4893 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4894 implicitly converted (clause _conv_) to the type "lvalue reference to
4895 T2", subject to the constraint that in the conversion the
4896 reference must bind directly (_dcl.init.ref_) to an lvalue.
4898 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4899 implicitly converted to the type "rvalue reference to T2", subject to
4900 the constraint that the reference must bind directly. */
4903 tree rtype
= cp_build_reference_type (t2
, !lvalue_p (e2
));
4904 conv
= implicit_conversion (rtype
,
4908 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4909 |LOOKUP_ONLYCONVERTING
,
4911 if (conv
&& !conv
->bad_p
)
4915 /* If E2 is a prvalue or if neither of the conversions above can be done
4916 and at least one of the operands has (possibly cv-qualified) class
4918 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4923 If E1 and E2 have class type, and the underlying class types are
4924 the same or one is a base class of the other: E1 can be converted
4925 to match E2 if the class of T2 is the same type as, or a base
4926 class of, the class of T1, and the cv-qualification of T2 is the
4927 same cv-qualification as, or a greater cv-qualification than, the
4928 cv-qualification of T1. If the conversion is applied, E1 is
4929 changed to an rvalue of type T2 that still refers to the original
4930 source class object (or the appropriate subobject thereof). */
4931 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4932 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4934 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4936 conv
= build_identity_conv (t1
, e1
);
4937 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4938 TYPE_MAIN_VARIANT (t2
)))
4939 conv
= build_conv (ck_base
, t2
, conv
);
4941 conv
= build_conv (ck_rvalue
, t2
, conv
);
4950 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4951 converted to the type that expression E2 would have if E2 were
4952 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4953 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4954 LOOKUP_IMPLICIT
, complain
);
4957 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4958 arguments to the conditional expression. */
4961 build_conditional_expr_1 (const op_location_t
&loc
,
4962 tree arg1
, tree arg2
, tree arg3
,
4963 tsubst_flags_t complain
)
4967 tree result
= NULL_TREE
;
4968 tree result_type
= NULL_TREE
;
4969 bool is_glvalue
= true;
4970 struct z_candidate
*candidates
= 0;
4971 struct z_candidate
*cand
;
4973 tree orig_arg2
, orig_arg3
;
4975 /* As a G++ extension, the second argument to the conditional can be
4976 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4977 c'.) If the second operand is omitted, make sure it is
4978 calculated only once. */
4981 if (complain
& tf_error
)
4982 pedwarn (loc
, OPT_Wpedantic
,
4983 "ISO C++ forbids omitting the middle term of a ?: expression");
4985 if ((complain
& tf_warning
) && !truth_value_p (TREE_CODE (arg1
)))
4986 warn_for_omitted_condop (loc
, arg1
);
4988 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4989 if (lvalue_p (arg1
))
4990 arg2
= arg1
= cp_stabilize_reference (arg1
);
4992 arg2
= arg1
= cp_save_expr (arg1
);
4995 /* If something has already gone wrong, just pass that fact up the
4997 if (error_operand_p (arg1
)
4998 || error_operand_p (arg2
)
4999 || error_operand_p (arg3
))
5000 return error_mark_node
;
5005 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
5007 tree arg1_type
= TREE_TYPE (arg1
);
5009 /* If arg1 is another cond_expr choosing between -1 and 0,
5010 then we can use its comparison. It may help to avoid
5011 additional comparison, produce more accurate diagnostics
5012 and enables folding. */
5013 if (TREE_CODE (arg1
) == VEC_COND_EXPR
5014 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
5015 && integer_zerop (TREE_OPERAND (arg1
, 2)))
5016 arg1
= TREE_OPERAND (arg1
, 0);
5018 arg1
= force_rvalue (arg1
, complain
);
5019 arg2
= force_rvalue (arg2
, complain
);
5020 arg3
= force_rvalue (arg3
, complain
);
5022 /* force_rvalue can return error_mark on valid arguments. */
5023 if (error_operand_p (arg1
)
5024 || error_operand_p (arg2
)
5025 || error_operand_p (arg3
))
5026 return error_mark_node
;
5028 arg2_type
= TREE_TYPE (arg2
);
5029 arg3_type
= TREE_TYPE (arg3
);
5031 if (!VECTOR_TYPE_P (arg2_type
)
5032 && !VECTOR_TYPE_P (arg3_type
))
5034 /* Rely on the error messages of the scalar version. */
5035 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
5036 orig_arg2
, orig_arg3
, complain
);
5037 if (scal
== error_mark_node
)
5038 return error_mark_node
;
5039 tree stype
= TREE_TYPE (scal
);
5040 tree ctype
= TREE_TYPE (arg1_type
);
5041 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
5042 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
5044 if (complain
& tf_error
)
5045 error_at (loc
, "inferred scalar type %qT is not an integer or "
5046 "floating point type of the same size as %qT", stype
,
5047 COMPARISON_CLASS_P (arg1
)
5048 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
5050 return error_mark_node
;
5053 tree vtype
= build_opaque_vector_type (stype
,
5054 TYPE_VECTOR_SUBPARTS (arg1_type
));
5055 /* We could pass complain & tf_warning to unsafe_conversion_p,
5056 but the warnings (like Wsign-conversion) have already been
5057 given by the scalar build_conditional_expr_1. We still check
5058 unsafe_conversion_p to forbid truncating long long -> float. */
5059 if (unsafe_conversion_p (loc
, stype
, arg2
, NULL_TREE
, false))
5061 if (complain
& tf_error
)
5062 error_at (loc
, "conversion of scalar %qH to vector %qI "
5063 "involves truncation", arg2_type
, vtype
);
5064 return error_mark_node
;
5066 if (unsafe_conversion_p (loc
, stype
, arg3
, NULL_TREE
, false))
5068 if (complain
& tf_error
)
5069 error_at (loc
, "conversion of scalar %qH to vector %qI "
5070 "involves truncation", arg3_type
, vtype
);
5071 return error_mark_node
;
5074 arg2
= cp_convert (stype
, arg2
, complain
);
5075 arg2
= save_expr (arg2
);
5076 arg2
= build_vector_from_val (vtype
, arg2
);
5078 arg3
= cp_convert (stype
, arg3
, complain
);
5079 arg3
= save_expr (arg3
);
5080 arg3
= build_vector_from_val (vtype
, arg3
);
5084 if (VECTOR_TYPE_P (arg2_type
) != VECTOR_TYPE_P (arg3_type
))
5086 enum stv_conv convert_flag
=
5087 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
5088 complain
& tf_error
);
5090 switch (convert_flag
)
5093 return error_mark_node
;
5096 arg2
= save_expr (arg2
);
5097 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
5098 arg2
= build_vector_from_val (arg3_type
, arg2
);
5099 arg2_type
= TREE_TYPE (arg2
);
5104 arg3
= save_expr (arg3
);
5105 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
5106 arg3
= build_vector_from_val (arg2_type
, arg3
);
5107 arg3_type
= TREE_TYPE (arg3
);
5115 if (!same_type_p (arg2_type
, arg3_type
)
5116 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type
),
5117 TYPE_VECTOR_SUBPARTS (arg2_type
))
5118 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
5120 if (complain
& tf_error
)
5122 "incompatible vector types in conditional expression: "
5123 "%qT, %qT and %qT", TREE_TYPE (arg1
),
5124 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
5125 return error_mark_node
;
5128 if (!COMPARISON_CLASS_P (arg1
))
5130 tree cmp_type
= build_same_sized_truth_vector_type (arg1_type
);
5131 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
5133 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
5138 The first expression is implicitly converted to bool (clause
5140 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
5142 if (error_operand_p (arg1
))
5143 return error_mark_node
;
5147 If either the second or the third operand has type (possibly
5148 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
5149 array-to-pointer (_conv.array_), and function-to-pointer
5150 (_conv.func_) standard conversions are performed on the second
5151 and third operands. */
5152 arg2_type
= unlowered_expr_type (arg2
);
5153 arg3_type
= unlowered_expr_type (arg3
);
5154 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
5156 /* 'void' won't help in resolving an overloaded expression on the
5157 other side, so require it to resolve by itself. */
5158 if (arg2_type
== unknown_type_node
)
5160 arg2
= resolve_nondeduced_context_or_error (arg2
, complain
);
5161 arg2_type
= TREE_TYPE (arg2
);
5163 if (arg3_type
== unknown_type_node
)
5165 arg3
= resolve_nondeduced_context_or_error (arg3
, complain
);
5166 arg3_type
= TREE_TYPE (arg3
);
5171 One of the following shall hold:
5173 --The second or the third operand (but not both) is a
5174 throw-expression (_except.throw_); the result is of the type
5175 and value category of the other.
5177 --Both the second and the third operands have type void; the
5178 result is of type void and is a prvalue. */
5179 if (TREE_CODE (arg2
) == THROW_EXPR
5180 && TREE_CODE (arg3
) != THROW_EXPR
)
5182 result_type
= arg3_type
;
5183 is_glvalue
= glvalue_p (arg3
);
5185 else if (TREE_CODE (arg2
) != THROW_EXPR
5186 && TREE_CODE (arg3
) == THROW_EXPR
)
5188 result_type
= arg2_type
;
5189 is_glvalue
= glvalue_p (arg2
);
5191 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
5193 result_type
= void_type_node
;
5198 if (complain
& tf_error
)
5200 if (VOID_TYPE_P (arg2_type
))
5201 error_at (cp_expr_loc_or_loc (arg3
, loc
),
5202 "second operand to the conditional operator "
5203 "is of type %<void%>, but the third operand is "
5204 "neither a throw-expression nor of type %<void%>");
5206 error_at (cp_expr_loc_or_loc (arg2
, loc
),
5207 "third operand to the conditional operator "
5208 "is of type %<void%>, but the second operand is "
5209 "neither a throw-expression nor of type %<void%>");
5211 return error_mark_node
;
5214 goto valid_operands
;
5218 Otherwise, if the second and third operand have different types,
5219 and either has (possibly cv-qualified) class type, or if both are
5220 glvalues of the same value category and the same type except for
5221 cv-qualification, an attempt is made to convert each of those operands
5222 to the type of the other. */
5223 else if (!same_type_p (arg2_type
, arg3_type
)
5224 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
5225 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
5227 && glvalue_p (arg2
) && glvalue_p (arg3
)
5228 && lvalue_p (arg2
) == lvalue_p (arg3
))))
5232 bool converted
= false;
5234 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5235 p
= conversion_obstack_alloc (0);
5237 conv2
= conditional_conversion (arg2
, arg3
, complain
);
5238 conv3
= conditional_conversion (arg3
, arg2
, complain
);
5242 If both can be converted, or one can be converted but the
5243 conversion is ambiguous, the program is ill-formed. If
5244 neither can be converted, the operands are left unchanged and
5245 further checking is performed as described below. If exactly
5246 one conversion is possible, that conversion is applied to the
5247 chosen operand and the converted operand is used in place of
5248 the original operand for the remainder of this section. */
5249 if ((conv2
&& !conv2
->bad_p
5250 && conv3
&& !conv3
->bad_p
)
5251 || (conv2
&& conv2
->kind
== ck_ambig
)
5252 || (conv3
&& conv3
->kind
== ck_ambig
))
5254 if (complain
& tf_error
)
5256 error_at (loc
, "operands to ?: have different types %qT and %qT",
5257 arg2_type
, arg3_type
);
5258 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
5259 inform (loc
, " and each type can be converted to the other");
5260 else if (conv2
&& conv2
->kind
== ck_ambig
)
5261 convert_like (conv2
, arg2
, complain
);
5263 convert_like (conv3
, arg3
, complain
);
5265 result
= error_mark_node
;
5267 else if (conv2
&& !conv2
->bad_p
)
5269 arg2
= convert_like (conv2
, arg2
, complain
);
5270 arg2
= convert_from_reference (arg2
);
5271 arg2_type
= TREE_TYPE (arg2
);
5272 /* Even if CONV2 is a valid conversion, the result of the
5273 conversion may be invalid. For example, if ARG3 has type
5274 "volatile X", and X does not have a copy constructor
5275 accepting a "volatile X&", then even if ARG2 can be
5276 converted to X, the conversion will fail. */
5277 if (error_operand_p (arg2
))
5278 result
= error_mark_node
;
5281 else if (conv3
&& !conv3
->bad_p
)
5283 arg3
= convert_like (conv3
, arg3
, complain
);
5284 arg3
= convert_from_reference (arg3
);
5285 arg3_type
= TREE_TYPE (arg3
);
5286 if (error_operand_p (arg3
))
5287 result
= error_mark_node
;
5291 /* Free all the conversions we allocated. */
5292 obstack_free (&conversion_obstack
, p
);
5297 /* If, after the conversion, both operands have class type,
5298 treat the cv-qualification of both operands as if it were the
5299 union of the cv-qualification of the operands.
5301 The standard is not clear about what to do in this
5302 circumstance. For example, if the first operand has type
5303 "const X" and the second operand has a user-defined
5304 conversion to "volatile X", what is the type of the second
5305 operand after this step? Making it be "const X" (matching
5306 the first operand) seems wrong, as that discards the
5307 qualification without actually performing a copy. Leaving it
5308 as "volatile X" seems wrong as that will result in the
5309 conditional expression failing altogether, even though,
5310 according to this step, the one operand could be converted to
5311 the type of the other. */
5313 && CLASS_TYPE_P (arg2_type
)
5314 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
5315 arg2_type
= arg3_type
=
5316 cp_build_qualified_type (arg2_type
,
5317 cp_type_quals (arg2_type
)
5318 | cp_type_quals (arg3_type
));
5323 If the second and third operands are glvalues of the same value
5324 category and have the same type, the result is of that type and
5326 if (((lvalue_p (arg2
) && lvalue_p (arg3
))
5327 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
5328 && same_type_p (arg2_type
, arg3_type
))
5330 result_type
= arg2_type
;
5331 arg2
= mark_lvalue_use (arg2
);
5332 arg3
= mark_lvalue_use (arg3
);
5333 goto valid_operands
;
5338 Otherwise, the result is an rvalue. If the second and third
5339 operand do not have the same type, and either has (possibly
5340 cv-qualified) class type, overload resolution is used to
5341 determine the conversions (if any) to be applied to the operands
5342 (_over.match.oper_, _over.built_). */
5344 if (!same_type_p (arg2_type
, arg3_type
)
5345 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5351 /* Rearrange the arguments so that add_builtin_candidate only has
5352 to know about two args. In build_builtin_candidate, the
5353 arguments are unscrambled. */
5357 add_builtin_candidates (&candidates
,
5360 ovl_op_identifier (false, COND_EXPR
),
5362 LOOKUP_NORMAL
, complain
);
5366 If the overload resolution fails, the program is
5368 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5371 if (complain
& tf_error
)
5372 error_at (loc
, "operands to ?: have different types %qT and %qT",
5373 arg2_type
, arg3_type
);
5374 return error_mark_node
;
5376 cand
= tourney (candidates
, complain
);
5379 if (complain
& tf_error
)
5381 auto_diagnostic_group d
;
5382 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5383 print_z_candidates (loc
, candidates
);
5385 return error_mark_node
;
5390 Otherwise, the conversions thus determined are applied, and
5391 the converted operands are used in place of the original
5392 operands for the remainder of this section. */
5393 conv
= cand
->convs
[0];
5394 arg1
= convert_like (conv
, arg1
, complain
);
5395 conv
= cand
->convs
[1];
5396 arg2
= convert_like (conv
, arg2
, complain
);
5397 arg2_type
= TREE_TYPE (arg2
);
5398 conv
= cand
->convs
[2];
5399 arg3
= convert_like (conv
, arg3
, complain
);
5400 arg3_type
= TREE_TYPE (arg3
);
5405 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5406 and function-to-pointer (_conv.func_) standard conversions are
5407 performed on the second and third operands.
5409 We need to force the lvalue-to-rvalue conversion here for class types,
5410 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5411 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5414 arg2
= force_rvalue (arg2
, complain
);
5415 if (!CLASS_TYPE_P (arg2_type
))
5416 arg2_type
= TREE_TYPE (arg2
);
5418 arg3
= force_rvalue (arg3
, complain
);
5419 if (!CLASS_TYPE_P (arg3_type
))
5420 arg3_type
= TREE_TYPE (arg3
);
5422 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5423 return error_mark_node
;
5427 After those conversions, one of the following shall hold:
5429 --The second and third operands have the same type; the result is of
5431 if (same_type_p (arg2_type
, arg3_type
))
5432 result_type
= arg2_type
;
5435 --The second and third operands have arithmetic or enumeration
5436 type; the usual arithmetic conversions are performed to bring
5437 them to a common type, and the result is of that type. */
5438 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5439 || UNSCOPED_ENUM_P (arg2_type
))
5440 && (ARITHMETIC_TYPE_P (arg3_type
)
5441 || UNSCOPED_ENUM_P (arg3_type
)))
5443 /* In this case, there is always a common type. */
5444 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5446 if (complain
& tf_warning
)
5447 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5448 "implicit conversion from %qH to %qI to "
5449 "match other result of conditional",
5452 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5453 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5455 tree stripped_orig_arg2
= tree_strip_any_location_wrapper (orig_arg2
);
5456 tree stripped_orig_arg3
= tree_strip_any_location_wrapper (orig_arg3
);
5457 if (TREE_CODE (stripped_orig_arg2
) == CONST_DECL
5458 && TREE_CODE (stripped_orig_arg3
) == CONST_DECL
5459 && (DECL_CONTEXT (stripped_orig_arg2
)
5460 == DECL_CONTEXT (stripped_orig_arg3
)))
5461 /* Two enumerators from the same enumeration can have different
5462 types when the enumeration is still being defined. */;
5463 else if (complain
& tf_warning
)
5464 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5465 "conditional expression: %qT vs %qT",
5466 arg2_type
, arg3_type
);
5468 else if (extra_warnings
5469 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5470 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5471 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5472 && !same_type_p (arg2_type
,
5473 type_promotes_to (arg3_type
)))))
5475 if (complain
& tf_warning
)
5476 warning_at (loc
, OPT_Wextra
, "enumeral and non-enumeral type in "
5477 "conditional expression");
5480 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5481 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5485 --The second and third operands have pointer type, or one has
5486 pointer type and the other is a null pointer constant; pointer
5487 conversions (_conv.ptr_) and qualification conversions
5488 (_conv.qual_) are performed to bring them to their composite
5489 pointer type (_expr.rel_). The result is of the composite
5492 --The second and third operands have pointer to member type, or
5493 one has pointer to member type and the other is a null pointer
5494 constant; pointer to member conversions (_conv.mem_) and
5495 qualification conversions (_conv.qual_) are performed to bring
5496 them to a common type, whose cv-qualification shall match the
5497 cv-qualification of either the second or the third operand.
5498 The result is of the common type. */
5499 else if ((null_ptr_cst_p (arg2
)
5500 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5501 || (null_ptr_cst_p (arg3
)
5502 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5503 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5504 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5505 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5507 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5508 arg3
, CPO_CONDITIONAL_EXPR
,
5510 if (result_type
== error_mark_node
)
5511 return error_mark_node
;
5512 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5513 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5518 if (complain
& tf_error
)
5519 error_at (loc
, "operands to ?: have different types %qT and %qT",
5520 arg2_type
, arg3_type
);
5521 return error_mark_node
;
5524 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5525 return error_mark_node
;
5528 if (processing_template_decl
&& is_glvalue
)
5530 /* Let lvalue_kind know this was a glvalue. */
5531 tree arg
= (result_type
== arg2_type
? arg2
: arg3
);
5532 result_type
= cp_build_reference_type (result_type
, xvalue_p (arg
));
5535 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5537 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5538 warn here, because the COND_EXPR will be turned into ARG2. */
5539 if (warn_duplicated_branches
5540 && (complain
& tf_warning
)
5541 && (arg2
== arg3
|| operand_equal_p (arg2
, arg3
, 0)))
5542 warning_at (EXPR_LOCATION (result
), OPT_Wduplicated_branches
,
5543 "this condition has identical branches");
5545 /* We can't use result_type below, as fold might have returned a
5550 /* Expand both sides into the same slot, hopefully the target of
5551 the ?: expression. We used to check for TARGET_EXPRs here,
5552 but now we sometimes wrap them in NOP_EXPRs so the test would
5554 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5555 result
= get_target_expr_sfinae (result
, complain
);
5556 /* If this expression is an rvalue, but might be mistaken for an
5557 lvalue, we must add a NON_LVALUE_EXPR. */
5558 result
= rvalue (result
);
5561 result
= force_paren_expr (result
);
5566 /* Wrapper for above. */
5569 build_conditional_expr (const op_location_t
&loc
,
5570 tree arg1
, tree arg2
, tree arg3
,
5571 tsubst_flags_t complain
)
5574 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5575 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5576 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5580 /* OPERAND is an operand to an expression. Perform necessary steps
5581 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5585 prep_operand (tree operand
)
5589 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5590 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5591 /* Make sure the template type is instantiated now. */
5592 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5598 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5599 OVERLOAD) to the CANDIDATES, returning an updated list of
5600 CANDIDATES. The ARGS are the arguments provided to the call;
5601 if FIRST_ARG is non-null it is the implicit object argument,
5602 otherwise the first element of ARGS is used if needed. The
5603 EXPLICIT_TARGS are explicit template arguments provided.
5604 TEMPLATE_ONLY is true if only template functions should be
5605 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5606 add_function_candidate. */
5609 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5611 tree explicit_targs
, bool template_only
,
5612 tree conversion_path
, tree access_path
,
5614 struct z_candidate
**candidates
,
5615 tsubst_flags_t complain
)
5618 const vec
<tree
, va_gc
> *non_static_args
;
5619 bool check_list_ctor
= false;
5620 bool check_converting
= false;
5621 unification_kind_t strict
;
5626 /* Precalculate special handling of constructors and conversion ops. */
5627 tree fn
= OVL_FIRST (fns
);
5628 if (DECL_CONV_FN_P (fn
))
5630 check_list_ctor
= false;
5631 check_converting
= (flags
& LOOKUP_ONLYCONVERTING
) != 0;
5632 if (flags
& LOOKUP_NO_CONVERSION
)
5633 /* We're doing return_type(x). */
5634 strict
= DEDUCE_CONV
;
5636 /* We're doing x.operator return_type(). */
5637 strict
= DEDUCE_EXACT
;
5638 /* [over.match.funcs] For conversion functions, the function
5639 is considered to be a member of the class of the implicit
5640 object argument for the purpose of defining the type of
5641 the implicit object parameter. */
5642 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5646 if (DECL_CONSTRUCTOR_P (fn
))
5648 check_list_ctor
= (flags
& LOOKUP_LIST_ONLY
) != 0;
5649 /* For list-initialization we consider explicit constructors
5650 and complain if one is chosen. */
5652 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5653 == LOOKUP_ONLYCONVERTING
);
5655 strict
= DEDUCE_CALL
;
5656 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5660 non_static_args
= args
;
5662 /* Delay creating the implicit this parameter until it is needed. */
5663 non_static_args
= NULL
;
5665 for (lkp_iterator
iter (fns
); iter
; ++iter
)
5669 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5671 if (check_list_ctor
&& !is_list_ctor (fn
))
5674 tree fn_first_arg
= NULL_TREE
;
5675 const vec
<tree
, va_gc
> *fn_args
= args
;
5677 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5679 /* Figure out where the object arg comes from. If this
5680 function is a non-static member and we didn't get an
5681 implicit object argument, move it out of args. */
5682 if (first_arg
== NULL_TREE
)
5686 vec
<tree
, va_gc
> *tempvec
;
5687 vec_alloc (tempvec
, args
->length () - 1);
5688 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5689 tempvec
->quick_push (arg
);
5690 non_static_args
= tempvec
;
5691 first_arg
= (*args
)[0];
5694 fn_first_arg
= first_arg
;
5695 fn_args
= non_static_args
;
5698 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5699 add_template_candidate (candidates
,
5711 else if (!template_only
)
5712 add_function_candidate (candidates
,
5725 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5726 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5729 op_is_ordered (tree_code code
)
5735 return (flag_strong_eval_order
> 1 ? -1 : 0);
5739 return (flag_strong_eval_order
> 1 ? 1 : 0);
5742 // Not overloadable (yet).
5744 // Only one argument.
5751 return (flag_strong_eval_order
? 1 : 0);
5759 build_new_op_1 (const op_location_t
&loc
, enum tree_code code
, int flags
,
5760 tree arg1
, tree arg2
, tree arg3
, tree
*overload
,
5761 tsubst_flags_t complain
)
5763 struct z_candidate
*candidates
= 0, *cand
;
5764 vec
<tree
, va_gc
> *arglist
;
5766 tree result
= NULL_TREE
;
5767 bool result_valid_p
= false;
5768 enum tree_code code2
= NOP_EXPR
;
5769 enum tree_code code_orig_arg1
= ERROR_MARK
;
5770 enum tree_code code_orig_arg2
= ERROR_MARK
;
5776 if (error_operand_p (arg1
)
5777 || error_operand_p (arg2
)
5778 || error_operand_p (arg3
))
5779 return error_mark_node
;
5781 bool ismodop
= code
== MODIFY_EXPR
;
5784 code2
= TREE_CODE (arg3
);
5787 tree fnname
= ovl_op_identifier (ismodop
, ismodop
? code2
: code
);
5789 arg1
= prep_operand (arg1
);
5791 bool memonly
= false;
5796 case VEC_DELETE_EXPR
:
5798 /* Use build_op_new_call and build_op_delete_call instead. */
5802 /* Use build_op_call instead. */
5805 case TRUTH_ORIF_EXPR
:
5806 case TRUTH_ANDIF_EXPR
:
5807 case TRUTH_AND_EXPR
:
5809 /* These are saved for the sake of warn_logical_operator. */
5810 code_orig_arg1
= TREE_CODE (arg1
);
5811 code_orig_arg2
= TREE_CODE (arg2
);
5819 /* These are saved for the sake of maybe_warn_bool_compare. */
5820 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5821 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5824 /* =, ->, [], () must be non-static member functions. */
5826 if (code2
!= NOP_EXPR
)
5838 arg2
= prep_operand (arg2
);
5839 arg3
= prep_operand (arg3
);
5841 if (code
== COND_EXPR
)
5842 /* Use build_conditional_expr instead. */
5844 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5845 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5848 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5849 arg2
= integer_zero_node
;
5851 vec_alloc (arglist
, 3);
5852 arglist
->quick_push (arg1
);
5853 if (arg2
!= NULL_TREE
)
5854 arglist
->quick_push (arg2
);
5855 if (arg3
!= NULL_TREE
)
5856 arglist
->quick_push (arg3
);
5858 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5859 p
= conversion_obstack_alloc (0);
5861 /* Add namespace-scope operators to the list of functions to
5865 tree fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/true, 0, 0);
5866 fns
= lookup_arg_dependent (fnname
, fns
, arglist
);
5867 add_candidates (fns
, NULL_TREE
, arglist
, NULL_TREE
,
5868 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5869 flags
, &candidates
, complain
);
5874 args
[2] = NULL_TREE
;
5876 /* Add class-member operators to the candidate set. */
5877 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5881 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5882 if (fns
== error_mark_node
)
5884 result
= error_mark_node
;
5885 goto user_defined_result_ready
;
5888 add_candidates (BASELINK_FUNCTIONS (fns
),
5889 NULL_TREE
, arglist
, NULL_TREE
,
5891 BASELINK_BINFO (fns
),
5892 BASELINK_ACCESS_BINFO (fns
),
5893 flags
, &candidates
, complain
);
5895 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5896 only non-member functions that have type T1 or reference to
5897 cv-qualified-opt T1 for the first argument, if the first argument
5898 has an enumeration type, or T2 or reference to cv-qualified-opt
5899 T2 for the second argument, if the second argument has an
5900 enumeration type. Filter out those that don't match. */
5901 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5903 struct z_candidate
**candp
, **next
;
5905 for (candp
= &candidates
; *candp
; candp
= next
)
5907 tree parmlist
, parmtype
;
5908 int i
, nargs
= (arg2
? 2 : 1);
5913 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5915 for (i
= 0; i
< nargs
; ++i
)
5917 parmtype
= TREE_VALUE (parmlist
);
5919 if (TYPE_REF_P (parmtype
))
5920 parmtype
= TREE_TYPE (parmtype
);
5921 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5922 && (same_type_ignoring_top_level_qualifiers_p
5923 (TREE_TYPE (args
[i
]), parmtype
)))
5926 parmlist
= TREE_CHAIN (parmlist
);
5929 /* No argument has an appropriate type, so remove this
5930 candidate function from the list. */
5933 *candp
= cand
->next
;
5939 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5946 /* For these, the built-in candidates set is empty
5947 [over.match.oper]/3. We don't want non-strict matches
5948 because exact matches are always possible with built-in
5949 operators. The built-in candidate set for COMPONENT_REF
5950 would be empty too, but since there are no such built-in
5951 operators, we accept non-strict matches for them. */
5960 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5965 case POSTINCREMENT_EXPR
:
5966 case POSTDECREMENT_EXPR
:
5967 /* Don't try anything fancy if we're not allowed to produce
5969 if (!(complain
& tf_error
))
5970 return error_mark_node
;
5972 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5973 distinguish between prefix and postfix ++ and
5974 operator++() was used for both, so we allow this with
5978 const char *msg
= (flag_permissive
)
5979 ? G_("no %<%D(int)%> declared for postfix %qs,"
5980 " trying prefix operator instead")
5981 : G_("no %<%D(int)%> declared for postfix %qs");
5982 permerror (loc
, msg
, fnname
, OVL_OP_INFO (false, code
)->name
);
5985 if (!flag_permissive
)
5986 return error_mark_node
;
5988 if (code
== POSTINCREMENT_EXPR
)
5989 code
= PREINCREMENT_EXPR
;
5991 code
= PREDECREMENT_EXPR
;
5992 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5993 NULL_TREE
, overload
, complain
);
5996 /* The caller will deal with these. */
6001 result_valid_p
= true;
6005 if (complain
& tf_error
)
6007 /* If one of the arguments of the operator represents
6008 an invalid use of member function pointer, try to report
6009 a meaningful error ... */
6010 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
6011 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
6012 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
6013 /* We displayed the error message. */;
6016 /* ... Otherwise, report the more generic
6017 "no matching operator found" error */
6018 auto_diagnostic_group d
;
6019 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
6020 print_z_candidates (loc
, candidates
);
6023 result
= error_mark_node
;
6029 cand
= tourney (candidates
, complain
);
6032 if (complain
& tf_error
)
6034 auto_diagnostic_group d
;
6035 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
6036 print_z_candidates (loc
, candidates
);
6038 result
= error_mark_node
;
6040 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
6043 *overload
= cand
->fn
;
6045 if (resolve_args (arglist
, complain
) == NULL
)
6046 result
= error_mark_node
;
6048 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
6050 if (trivial_fn_p (cand
->fn
))
6051 /* There won't be a CALL_EXPR. */;
6052 else if (result
&& result
!= error_mark_node
)
6054 tree call
= extract_call_expr (result
);
6055 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
6057 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
6058 /* This prevents build_new_function_call from discarding this
6059 function during instantiation of the enclosing template. */
6060 KOENIG_LOOKUP_P (call
) = 1;
6062 /* Specify evaluation order as per P0145R2. */
6063 CALL_EXPR_ORDERED_ARGS (call
) = false;
6064 switch (op_is_ordered (code
))
6067 CALL_EXPR_REVERSE_ARGS (call
) = true;
6071 CALL_EXPR_ORDERED_ARGS (call
) = true;
6081 /* Give any warnings we noticed during overload resolution. */
6082 if (cand
->warnings
&& (complain
& tf_warning
))
6084 struct candidate_warning
*w
;
6085 for (w
= cand
->warnings
; w
; w
= w
->next
)
6086 joust (cand
, w
->loser
, 1, complain
);
6089 /* Check for comparison of different enum types. */
6098 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
6099 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
6100 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
6101 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
6102 && (complain
& tf_warning
))
6104 warning (OPT_Wenum_compare
,
6105 "comparison between %q#T and %q#T",
6106 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
6113 /* We need to strip any leading REF_BIND so that bitfields
6114 don't cause errors. This should not remove any important
6115 conversions, because builtins don't apply to class
6116 objects directly. */
6117 conv
= cand
->convs
[0];
6118 if (conv
->kind
== ck_ref_bind
)
6119 conv
= next_conversion (conv
);
6120 arg1
= convert_like (conv
, arg1
, complain
);
6124 conv
= cand
->convs
[1];
6125 if (conv
->kind
== ck_ref_bind
)
6126 conv
= next_conversion (conv
);
6128 arg2
= decay_conversion (arg2
, complain
);
6130 /* We need to call warn_logical_operator before
6131 converting arg2 to a boolean_type, but after
6132 decaying an enumerator to its value. */
6133 if (complain
& tf_warning
)
6134 warn_logical_operator (loc
, code
, boolean_type_node
,
6135 code_orig_arg1
, arg1
,
6136 code_orig_arg2
, arg2
);
6138 arg2
= convert_like (conv
, arg2
, complain
);
6142 conv
= cand
->convs
[2];
6143 if (conv
->kind
== ck_ref_bind
)
6144 conv
= next_conversion (conv
);
6145 arg3
= convert_like (conv
, arg3
, complain
);
6151 user_defined_result_ready
:
6153 /* Free all the conversions we allocated. */
6154 obstack_free (&conversion_obstack
, p
);
6156 if (result
|| result_valid_p
)
6163 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
6166 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
6168 case TRUTH_ANDIF_EXPR
:
6169 case TRUTH_ORIF_EXPR
:
6170 case TRUTH_AND_EXPR
:
6172 if (complain
& tf_warning
)
6173 warn_logical_operator (loc
, code
, boolean_type_node
,
6174 code_orig_arg1
, arg1
,
6175 code_orig_arg2
, arg2
);
6183 if ((complain
& tf_warning
)
6184 && ((code_orig_arg1
== BOOLEAN_TYPE
)
6185 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
6186 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
6187 if (complain
& tf_warning
&& warn_tautological_compare
)
6188 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
6193 case TRUNC_DIV_EXPR
:
6198 case TRUNC_MOD_EXPR
:
6202 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
6204 case UNARY_PLUS_EXPR
:
6207 case TRUTH_NOT_EXPR
:
6208 case PREINCREMENT_EXPR
:
6209 case POSTINCREMENT_EXPR
:
6210 case PREDECREMENT_EXPR
:
6211 case POSTDECREMENT_EXPR
:
6215 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
6218 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
6221 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
6225 /* The caller will deal with these. */
6237 /* Wrapper for above. */
6240 build_new_op (const op_location_t
&loc
, enum tree_code code
, int flags
,
6241 tree arg1
, tree arg2
, tree arg3
,
6242 tree
*overload
, tsubst_flags_t complain
)
6245 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
6246 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
6247 overload
, complain
);
6248 timevar_cond_stop (TV_OVERLOAD
, subtime
);
6252 /* CALL was returned by some call-building function; extract the actual
6253 CALL_EXPR from any bits that have been tacked on, e.g. by
6254 convert_from_reference. */
6257 extract_call_expr (tree call
)
6259 while (TREE_CODE (call
) == COMPOUND_EXPR
)
6260 call
= TREE_OPERAND (call
, 1);
6261 if (REFERENCE_REF_P (call
))
6262 call
= TREE_OPERAND (call
, 0);
6263 if (TREE_CODE (call
) == TARGET_EXPR
)
6264 call
= TARGET_EXPR_INITIAL (call
);
6265 gcc_assert (TREE_CODE (call
) == CALL_EXPR
6266 || TREE_CODE (call
) == AGGR_INIT_EXPR
6267 || call
== error_mark_node
);
6271 /* Returns true if FN has two parameters, of which the second has type
6275 second_parm_is_size_t (tree fn
)
6277 tree t
= FUNCTION_ARG_CHAIN (fn
);
6278 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6281 if (t
== void_list_node
)
6283 if (aligned_new_threshold
&& t
6284 && same_type_p (TREE_VALUE (t
), align_type_node
)
6285 && TREE_CHAIN (t
) == void_list_node
)
6290 /* True if T, an allocation function, has std::align_val_t as its second
6294 aligned_allocation_fn_p (tree t
)
6296 if (!aligned_new_threshold
)
6299 tree a
= FUNCTION_ARG_CHAIN (t
);
6300 return (a
&& same_type_p (TREE_VALUE (a
), align_type_node
));
6303 /* True if T is std::destroying_delete_t. */
6306 std_destroying_delete_t_p (tree t
)
6308 return (TYPE_CONTEXT (t
) == std_node
6309 && id_equal (TYPE_IDENTIFIER (t
), "destroying_delete_t"));
6312 /* A deallocation function with at least two parameters whose second parameter
6313 type is of type std::destroying_delete_t is a destroying operator delete. A
6314 destroying operator delete shall be a class member function named operator
6315 delete. [ Note: Array deletion cannot use a destroying operator
6316 delete. --end note ] */
6319 destroying_delete_p (tree t
)
6321 tree a
= TYPE_ARG_TYPES (TREE_TYPE (t
));
6322 if (!a
|| !TREE_CHAIN (a
))
6324 tree type
= TREE_VALUE (TREE_CHAIN (a
));
6325 return std_destroying_delete_t_p (type
) ? type
: NULL_TREE
;
6328 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6329 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6330 std::align_val_t. */
6333 aligned_deallocation_fn_p (tree t
)
6335 if (!aligned_new_threshold
)
6338 /* A template instance is never a usual deallocation function,
6339 regardless of its signature. */
6340 if (TREE_CODE (t
) == TEMPLATE_DECL
6341 || primary_template_specialization_p (t
))
6344 tree a
= FUNCTION_ARG_CHAIN (t
);
6345 if (destroying_delete_p (t
))
6347 if (same_type_p (TREE_VALUE (a
), align_type_node
)
6348 && TREE_CHAIN (a
) == void_list_node
)
6350 if (!same_type_p (TREE_VALUE (a
), size_type_node
))
6353 if (a
&& same_type_p (TREE_VALUE (a
), align_type_node
)
6354 && TREE_CHAIN (a
) == void_list_node
)
6359 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6360 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6363 usual_deallocation_fn_p (tree t
)
6365 /* A template instance is never a usual deallocation function,
6366 regardless of its signature. */
6367 if (TREE_CODE (t
) == TEMPLATE_DECL
6368 || primary_template_specialization_p (t
))
6371 /* If a class T has a member deallocation function named operator delete
6372 with exactly one parameter, then that function is a usual
6373 (non-placement) deallocation function. If class T does not declare
6374 such an operator delete but does declare a member deallocation
6375 function named operator delete with exactly two parameters, the second
6376 of which has type std::size_t (18.2), then this function is a usual
6377 deallocation function. */
6378 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
6379 tree chain
= FUNCTION_ARG_CHAIN (t
);
6382 if (destroying_delete_p (t
))
6383 chain
= TREE_CHAIN (chain
);
6384 if (chain
== void_list_node
6385 || ((!global
|| flag_sized_deallocation
)
6386 && second_parm_is_size_t (t
)))
6388 if (aligned_deallocation_fn_p (t
))
6393 /* Build a call to operator delete. This has to be handled very specially,
6394 because the restrictions on what signatures match are different from all
6395 other call instances. For a normal delete, only a delete taking (void *)
6396 or (void *, size_t) is accepted. For a placement delete, only an exact
6397 match with the placement new is accepted.
6399 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6400 ADDR is the pointer to be deleted.
6401 SIZE is the size of the memory block to be deleted.
6402 GLOBAL_P is true if the delete-expression should not consider
6403 class-specific delete operators.
6404 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6406 If this call to "operator delete" is being generated as part to
6407 deallocate memory allocated via a new-expression (as per [expr.new]
6408 which requires that if the initialization throws an exception then
6409 we call a deallocation function), then ALLOC_FN is the allocation
6413 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
6414 bool global_p
, tree placement
,
6415 tree alloc_fn
, tsubst_flags_t complain
)
6417 tree fn
= NULL_TREE
;
6418 tree fns
, fnname
, type
, t
;
6420 if (addr
== error_mark_node
)
6421 return error_mark_node
;
6423 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6425 fnname
= ovl_op_identifier (false, code
);
6427 if (CLASS_TYPE_P (type
)
6428 && COMPLETE_TYPE_P (complete_type (type
))
6432 If the result of the lookup is ambiguous or inaccessible, or if
6433 the lookup selects a placement deallocation function, the
6434 program is ill-formed.
6436 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6438 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6439 if (fns
== error_mark_node
)
6440 return error_mark_node
;
6445 if (fns
== NULL_TREE
)
6446 fns
= lookup_name_nonclass (fnname
);
6448 /* Strip const and volatile from addr. */
6450 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6454 /* "A declaration of a placement deallocation function matches the
6455 declaration of a placement allocation function if it has the same
6456 number of parameters and, after parameter transformations (8.3.5),
6457 all parameter types except the first are identical."
6459 So we build up the function type we want and ask instantiate_type
6460 to get it for us. */
6461 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6462 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6463 t
= build_function_type (void_type_node
, t
);
6465 fn
= instantiate_type (t
, fns
, tf_none
);
6466 if (fn
== error_mark_node
)
6469 fn
= MAYBE_BASELINK_FUNCTIONS (fn
);
6471 /* "If the lookup finds the two-parameter form of a usual deallocation
6472 function (3.7.4.2) and that function, considered as a placement
6473 deallocation function, would have been selected as a match for the
6474 allocation function, the program is ill-formed." */
6475 if (second_parm_is_size_t (fn
))
6477 const char *const msg1
6478 = G_("exception cleanup for this placement new selects "
6479 "non-placement operator delete");
6480 const char *const msg2
6481 = G_("%qD is a usual (non-placement) deallocation "
6482 "function in C++14 (or with -fsized-deallocation)");
6484 /* But if the class has an operator delete (void *), then that is
6485 the usual deallocation function, so we shouldn't complain
6486 about using the operator delete (void *, size_t). */
6487 if (DECL_CLASS_SCOPE_P (fn
))
6488 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
));
6492 if (usual_deallocation_fn_p (elt
)
6493 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6496 /* Before C++14 a two-parameter global deallocation function is
6497 always a placement deallocation function, but warn if
6499 else if (!flag_sized_deallocation
)
6501 if (complain
& tf_warning
)
6503 auto_diagnostic_group d
;
6504 if (warning (OPT_Wc__14_compat
, msg1
))
6505 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6510 if (complain
& tf_warning_or_error
)
6512 auto_diagnostic_group d
;
6513 if (permerror (input_location
, msg1
))
6515 /* Only mention C++14 for namespace-scope delete. */
6516 if (DECL_NAMESPACE_SCOPE_P (fn
))
6517 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6519 inform (DECL_SOURCE_LOCATION (fn
),
6520 "%qD is a usual (non-placement) deallocation "
6525 return error_mark_node
;
6530 /* "Any non-placement deallocation function matches a non-placement
6531 allocation function. If the lookup finds a single matching
6532 deallocation function, that function will be called; otherwise, no
6533 deallocation function will be called." */
6534 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
)); iter
; ++iter
)
6537 if (usual_deallocation_fn_p (elt
))
6545 /* -- If any of the deallocation functions is a destroying
6546 operator delete, all deallocation functions that are not
6547 destroying operator deletes are eliminated from further
6549 bool fn_destroying
= destroying_delete_p (fn
);
6550 bool elt_destroying
= destroying_delete_p (elt
);
6551 if (elt_destroying
!= fn_destroying
)
6558 /* -- If the type has new-extended alignment, a function with a
6559 parameter of type std::align_val_t is preferred; otherwise a
6560 function without such a parameter is preferred. If exactly one
6561 preferred function is found, that function is selected and the
6562 selection process terminates. If more than one preferred
6563 function is found, all non-preferred functions are eliminated
6564 from further consideration. */
6565 if (aligned_new_threshold
)
6567 bool want_align
= type_has_new_extended_alignment (type
);
6568 bool fn_align
= aligned_deallocation_fn_p (fn
);
6569 bool elt_align
= aligned_deallocation_fn_p (elt
);
6571 if (elt_align
!= fn_align
)
6573 if (want_align
== elt_align
)
6579 /* -- If the deallocation functions have class scope, the one
6580 without a parameter of type std::size_t is selected. */
6582 if (DECL_CLASS_SCOPE_P (fn
))
6585 /* -- If the type is complete and if, for the second alternative
6586 (delete array) only, the operand is a pointer to a class type
6587 with a non-trivial destructor or a (possibly multi-dimensional)
6588 array thereof, the function with a parameter of type std::size_t
6591 -- Otherwise, it is unspecified whether a deallocation function
6592 with a parameter of type std::size_t is selected. */
6595 want_size
= COMPLETE_TYPE_P (type
);
6596 if (code
== VEC_DELETE_EXPR
6597 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6598 /* We need a cookie to determine the array size. */
6601 bool fn_size
= second_parm_is_size_t (fn
);
6602 bool elt_size
= second_parm_is_size_t (elt
);
6603 gcc_assert (fn_size
!= elt_size
);
6604 if (want_size
== elt_size
)
6609 /* If we have a matching function, call it. */
6612 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6614 /* If the FN is a member function, make sure that it is
6616 if (BASELINK_P (fns
))
6617 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6620 /* Core issue 901: It's ok to new a type with deleted delete. */
6621 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6626 /* The placement args might not be suitable for overload
6627 resolution at this point, so build the call directly. */
6628 int nargs
= call_expr_nargs (placement
);
6629 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6632 for (i
= 1; i
< nargs
; i
++)
6633 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6634 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6635 return error_mark_node
;
6636 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6640 tree destroying
= destroying_delete_p (fn
);
6643 /* Strip const and volatile from addr but retain the type of the
6645 tree rtype
= TREE_TYPE (TREE_TYPE (oaddr
));
6646 rtype
= cv_unqualified (rtype
);
6647 rtype
= TYPE_POINTER_TO (rtype
);
6648 addr
= cp_convert (rtype
, oaddr
, complain
);
6649 destroying
= build_functional_cast (destroying
, NULL_TREE
,
6654 vec
<tree
, va_gc
> *args
= make_tree_vector ();
6655 args
->quick_push (addr
);
6657 args
->quick_push (destroying
);
6658 if (second_parm_is_size_t (fn
))
6659 args
->quick_push (size
);
6660 if (aligned_deallocation_fn_p (fn
))
6662 tree al
= build_int_cst (align_type_node
, TYPE_ALIGN_UNIT (type
));
6663 args
->quick_push (al
);
6665 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6666 release_tree_vector (args
);
6673 If no unambiguous matching deallocation function can be found,
6674 propagating the exception does not cause the object's memory to
6678 if ((complain
& tf_warning
)
6680 warning (0, "no corresponding deallocation function for %qD",
6685 if (complain
& tf_error
)
6686 error ("no suitable %<operator %s%> for %qT",
6687 OVL_OP_INFO (false, code
)->name
, type
);
6688 return error_mark_node
;
6691 /* Issue diagnostics about a disallowed access of DECL, using DIAG_DECL
6694 If ISSUE_ERROR is true, then issue an error about the
6695 access, followed by a note showing the declaration.
6696 Otherwise, just show the note. */
6699 complain_about_access (tree decl
, tree diag_decl
, bool issue_error
)
6701 if (TREE_PRIVATE (decl
))
6704 error ("%q#D is private within this context", diag_decl
);
6705 inform (DECL_SOURCE_LOCATION (diag_decl
),
6706 "declared private here");
6708 else if (TREE_PROTECTED (decl
))
6711 error ("%q#D is protected within this context", diag_decl
);
6712 inform (DECL_SOURCE_LOCATION (diag_decl
),
6713 "declared protected here");
6718 error ("%q#D is inaccessible within this context", diag_decl
);
6719 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6723 /* If the current scope isn't allowed to access DECL along
6724 BASETYPE_PATH, give an error. The most derived class in
6725 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6726 the declaration to use in the error diagnostic. */
6729 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6730 tsubst_flags_t complain
, access_failure_info
*afi
)
6732 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6734 if (flag_new_inheriting_ctors
6735 && DECL_INHERITED_CTOR (decl
))
6737 /* 7.3.3/18: The additional constructors are accessible if they would be
6738 accessible when used to construct an object of the corresponding base
6740 decl
= strip_inheriting_ctors (decl
);
6741 basetype_path
= lookup_base (basetype_path
, DECL_CONTEXT (decl
),
6742 ba_any
, NULL
, complain
);
6745 if (!accessible_p (basetype_path
, decl
, true))
6747 if (flag_new_inheriting_ctors
)
6748 diag_decl
= strip_inheriting_ctors (diag_decl
);
6749 if (complain
& tf_error
)
6750 complain_about_access (decl
, diag_decl
, true);
6752 afi
->record_access_failure (basetype_path
, decl
, diag_decl
);
6759 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6760 bitwise or of LOOKUP_* values. If any errors are warnings are
6761 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6762 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6766 build_temp (tree expr
, tree type
, int flags
,
6767 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6770 vec
<tree
, va_gc
> *args
;
6772 *diagnostic_kind
= DK_UNSPECIFIED
;
6774 /* If the source is a packed field, calling the copy constructor will require
6775 binding the field to the reference parameter to the copy constructor, and
6776 we'll end up with an infinite loop. If we can use a bitwise copy, then
6778 if ((lvalue_kind (expr
) & clk_packed
)
6779 && CLASS_TYPE_P (TREE_TYPE (expr
))
6780 && !type_has_nontrivial_copy_init (TREE_TYPE (expr
)))
6781 return get_target_expr_sfinae (expr
, complain
);
6783 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6784 args
= make_tree_vector_single (expr
);
6785 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6786 &args
, type
, flags
, complain
);
6787 release_tree_vector (args
);
6788 if (warningcount
+ werrorcount
> savew
)
6789 *diagnostic_kind
= DK_WARNING
;
6790 else if (errorcount
> savee
)
6791 *diagnostic_kind
= DK_ERROR
;
6795 /* Get any location for EXPR, falling back to input_location.
6797 If the result is in a system header and is the virtual location for
6798 a token coming from the expansion of a macro, unwind it to the
6799 location of the expansion point of the macro (e.g. to avoid the
6800 diagnostic being suppressed for expansions of NULL where "NULL" is
6801 in a system header). */
6804 get_location_for_expr_unwinding_for_system_header (tree expr
)
6806 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6807 loc
= expansion_point_location_if_in_system_header (loc
);
6811 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6812 Also handle a subset of zero as null warnings.
6813 EXPR is implicitly converted to type TOTYPE.
6814 FN and ARGNUM are used for diagnostics. */
6817 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6819 /* Issue warnings about peculiar, but valid, uses of NULL. */
6820 if (null_node_p (expr
) && TREE_CODE (totype
) != BOOLEAN_TYPE
6821 && ARITHMETIC_TYPE_P (totype
))
6823 location_t loc
= get_location_for_expr_unwinding_for_system_header (expr
);
6826 auto_diagnostic_group d
;
6827 if (warning_at (loc
, OPT_Wconversion_null
,
6828 "passing NULL to non-pointer argument %P of %qD",
6830 inform (get_fndecl_argument_location (fn
, argnum
),
6834 warning_at (loc
, OPT_Wconversion_null
,
6835 "converting to non-pointer type %qT from NULL", totype
);
6838 /* Issue warnings if "false" is converted to a NULL pointer */
6839 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6840 && TYPE_PTR_P (totype
))
6842 location_t loc
= get_location_for_expr_unwinding_for_system_header (expr
);
6845 auto_diagnostic_group d
;
6846 if (warning_at (loc
, OPT_Wconversion_null
,
6847 "converting %<false%> to pointer type for argument "
6848 "%P of %qD", argnum
, fn
))
6849 inform (get_fndecl_argument_location (fn
, argnum
),
6853 warning_at (loc
, OPT_Wconversion_null
,
6854 "converting %<false%> to pointer type %qT", totype
);
6856 /* Handle zero as null pointer warnings for cases other
6857 than EQ_EXPR and NE_EXPR */
6858 else if (null_ptr_cst_p (expr
) &&
6859 (TYPE_PTR_OR_PTRMEM_P (totype
) || NULLPTR_TYPE_P (totype
)))
6861 location_t loc
= get_location_for_expr_unwinding_for_system_header (expr
);
6862 maybe_warn_zero_as_null_pointer_constant (expr
, loc
);
6866 /* We gave a diagnostic during a conversion. If this was in the second
6867 standard conversion sequence of a user-defined conversion sequence, say
6868 which user-defined conversion. */
6871 maybe_print_user_conv_context (conversion
*convs
)
6873 if (convs
->user_conv_p
)
6874 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6875 if (t
->kind
== ck_user
)
6877 print_z_candidate (0, " after user-defined conversion:",
6883 /* Locate the parameter with the given index within FNDECL.
6884 ARGNUM is zero based, -1 indicates the `this' argument of a method.
6885 Return the location of the FNDECL itself if there are problems. */
6888 get_fndecl_argument_location (tree fndecl
, int argnum
)
6890 /* The locations of implicitly-declared functions are likely to be
6891 more meaningful than those of their parameters. */
6892 if (DECL_ARTIFICIAL (fndecl
))
6893 return DECL_SOURCE_LOCATION (fndecl
);
6898 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6899 for (i
= 0, param
= FUNCTION_FIRST_USER_PARM (fndecl
);
6900 i
< argnum
&& param
;
6901 i
++, param
= TREE_CHAIN (param
))
6904 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6905 return the location of FNDECL. */
6907 return DECL_SOURCE_LOCATION (fndecl
);
6909 return DECL_SOURCE_LOCATION (param
);
6912 /* If FNDECL is non-NULL, issue a note highlighting ARGNUM
6913 within its declaration (or the fndecl itself if something went
6917 maybe_inform_about_fndecl_for_bogus_argument_init (tree fn
, int argnum
)
6920 inform (get_fndecl_argument_location (fn
, argnum
),
6921 " initializing argument %P of %qD", argnum
, fn
);
6924 /* Perform the conversions in CONVS on the expression EXPR. FN and
6925 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6926 indicates the `this' argument of a method. INNER is nonzero when
6927 being called to continue a conversion chain. It is negative when a
6928 reference binding will be applied, positive otherwise. If
6929 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6930 conversions will be emitted if appropriate. If C_CAST_P is true,
6931 this conversion is coming from a C-style cast; in that case,
6932 conversions to inaccessible bases are permitted. */
6935 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6936 bool issue_conversion_warnings
,
6937 bool c_cast_p
, tsubst_flags_t complain
)
6939 tree totype
= convs
->type
;
6940 diagnostic_t diag_kind
;
6942 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
6944 if (convs
->bad_p
&& !(complain
& tf_error
))
6945 return error_mark_node
;
6948 && convs
->kind
!= ck_user
6949 && convs
->kind
!= ck_list
6950 && convs
->kind
!= ck_ambig
6951 && (convs
->kind
!= ck_ref_bind
6952 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6953 && (convs
->kind
!= ck_rvalue
6954 || SCALAR_TYPE_P (totype
))
6955 && convs
->kind
!= ck_base
)
6957 bool complained
= false;
6958 conversion
*t
= convs
;
6960 /* Give a helpful error if this is bad because of excess braces. */
6961 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6962 && SCALAR_TYPE_P (totype
)
6963 && CONSTRUCTOR_NELTS (expr
) > 0
6964 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6966 complained
= permerror (loc
, "too many braces around initializer "
6968 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6969 && CONSTRUCTOR_NELTS (expr
) == 1)
6970 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6973 /* Give a helpful error if this is bad because a conversion to bool
6974 from std::nullptr_t requires direct-initialization. */
6975 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6976 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6977 complained
= permerror (loc
, "converting to %qH from %qI requires "
6978 "direct-initialization",
6979 totype
, TREE_TYPE (expr
));
6981 for (; t
; t
= next_conversion (t
))
6983 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6985 auto_diagnostic_group d
;
6986 complained
= permerror (loc
, "invalid user-defined conversion "
6987 "from %qH to %qI", TREE_TYPE (expr
),
6990 print_z_candidate (loc
, "candidate is:", t
->cand
);
6991 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6992 /*issue_conversion_warnings=*/false,
6995 if (convs
->kind
== ck_ref_bind
)
6996 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6997 LOOKUP_NORMAL
, NULL_TREE
,
7000 expr
= cp_convert (totype
, expr
, complain
);
7002 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7005 else if (t
->kind
== ck_user
|| !t
->bad_p
)
7007 expr
= convert_like_real (t
, expr
, fn
, argnum
,
7008 /*issue_conversion_warnings=*/false,
7013 else if (t
->kind
== ck_ambig
)
7014 return convert_like_real (t
, expr
, fn
, argnum
,
7015 /*issue_conversion_warnings=*/false,
7018 else if (t
->kind
== ck_identity
)
7023 range_label_for_type_mismatch
label (TREE_TYPE (expr
), totype
);
7024 gcc_rich_location
richloc (loc
, &label
);
7025 complained
= permerror (&richloc
,
7026 "invalid conversion from %qH to %qI",
7027 TREE_TYPE (expr
), totype
);
7030 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7032 return cp_convert (totype
, expr
, complain
);
7035 if (issue_conversion_warnings
&& (complain
& tf_warning
))
7036 conversion_null_warnings (totype
, expr
, fn
, argnum
);
7038 switch (convs
->kind
)
7042 struct z_candidate
*cand
= convs
->cand
;
7045 /* We chose the surrogate function from add_conv_candidate, now we
7046 actually need to build the conversion. */
7047 cand
= build_user_type_conversion_1 (totype
, expr
,
7048 LOOKUP_NO_CONVERSION
, complain
);
7050 tree convfn
= cand
->fn
;
7052 /* When converting from an init list we consider explicit
7053 constructors, but actually trying to call one is an error. */
7054 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
7055 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
7056 /* Unless this is for direct-list-initialization. */
7057 && (!CONSTRUCTOR_IS_DIRECT_INIT (expr
) || convs
->need_temporary_p
)
7058 /* And in C++98 a default constructor can't be explicit. */
7059 && cxx_dialect
>= cxx11
)
7061 if (!(complain
& tf_error
))
7062 return error_mark_node
;
7063 location_t loc
= location_of (expr
);
7064 if (CONSTRUCTOR_NELTS (expr
) == 0
7065 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
7067 auto_diagnostic_group d
;
7068 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
7069 "would use explicit constructor %qD",
7071 inform (loc
, "in C++11 and above a default constructor "
7075 error ("converting to %qT from initializer list would use "
7076 "explicit constructor %qD", totype
, convfn
);
7079 /* If we're initializing from {}, it's value-initialization. */
7080 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
7081 && CONSTRUCTOR_NELTS (expr
) == 0
7082 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
)
7083 && !processing_template_decl
)
7085 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
7086 if (abstract_virtuals_error_sfinae (NULL_TREE
, totype
, complain
))
7087 return error_mark_node
;
7088 expr
= build_value_init (totype
, complain
);
7089 expr
= get_target_expr_sfinae (expr
, complain
);
7090 if (expr
!= error_mark_node
)
7092 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7093 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
7098 /* We don't know here whether EXPR is being used as an lvalue or
7099 rvalue, but we know it's read. */
7100 mark_exp_read (expr
);
7102 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
7104 expr
= build_over_call (cand
, LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
,
7107 /* If this is a constructor or a function returning an aggr type,
7108 we need to build up a TARGET_EXPR. */
7109 if (DECL_CONSTRUCTOR_P (convfn
))
7111 expr
= build_cplus_new (totype
, expr
, complain
);
7113 /* Remember that this was list-initialization. */
7114 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
7115 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7121 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
7123 int nelts
= CONSTRUCTOR_NELTS (expr
);
7125 expr
= build_value_init (totype
, complain
);
7126 else if (nelts
== 1)
7127 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7131 expr
= mark_use (expr
, /*rvalue_p=*/!convs
->rvaluedness_matches_p
,
7132 /*read_p=*/true, UNKNOWN_LOCATION
,
7133 /*reject_builtin=*/true);
7135 if (type_unknown_p (expr
))
7136 expr
= instantiate_type (totype
, expr
, complain
);
7137 if (expr
== null_node
7138 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
7139 /* If __null has been converted to an integer type, we do not want to
7140 continue to warn about uses of EXPR as an integer, rather than as a
7142 expr
= build_int_cst (totype
, 0);
7145 /* We leave bad_p off ck_ambig because overload resolution considers
7146 it valid, it just fails when we try to perform it. So we need to
7147 check complain here, too. */
7148 if (complain
& tf_error
)
7150 /* Call build_user_type_conversion again for the error. */
7151 int flags
= (convs
->need_temporary_p
7152 ? LOOKUP_IMPLICIT
: LOOKUP_NORMAL
);
7153 build_user_type_conversion (totype
, convs
->u
.expr
, flags
, complain
);
7154 gcc_assert (seen_error ());
7155 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7157 return error_mark_node
;
7161 /* Conversion to std::initializer_list<T>. */
7162 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
7163 unsigned len
= CONSTRUCTOR_NELTS (expr
);
7168 tree val
; unsigned ix
;
7170 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
7172 /* Convert all the elements. */
7173 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
7175 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
,
7176 argnum
, false, false, complain
);
7177 if (sub
== error_mark_node
)
7179 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
7180 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
7181 return error_mark_node
;
7182 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
),
7184 if (!TREE_CONSTANT (sub
))
7185 TREE_CONSTANT (new_ctor
) = false;
7187 /* Build up the array. */
7188 elttype
= cp_build_qualified_type
7189 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
7190 array
= build_array_of_n_type (elttype
, len
);
7191 array
= finish_compound_literal (array
, new_ctor
, complain
);
7192 /* Take the address explicitly rather than via decay_conversion
7193 to avoid the error about taking the address of a temporary. */
7194 array
= cp_build_addr_expr (array
, complain
);
7197 array
= nullptr_node
;
7199 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
7200 if (array
== error_mark_node
)
7201 return error_mark_node
;
7203 /* Build up the initializer_list object. Note: fail gracefully
7204 if the object cannot be completed because, for example, no
7205 definition is provided (c++/80956). */
7206 totype
= complete_type_or_maybe_complain (totype
, NULL_TREE
, complain
);
7208 return error_mark_node
;
7209 tree field
= next_initializable_field (TYPE_FIELDS (totype
));
7210 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
7211 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
7212 field
= next_initializable_field (DECL_CHAIN (field
));
7213 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
7214 tree new_ctor
= build_constructor (totype
, vec
);
7215 return get_target_expr_sfinae (new_ctor
, complain
);
7219 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
7221 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7222 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
7223 real
= perform_implicit_conversion (TREE_TYPE (totype
),
7225 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
7227 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
7230 expr
= reshape_init (totype
, expr
, complain
);
7231 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
7233 if (expr
!= error_mark_node
)
7234 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7241 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
7242 convs
->kind
== ck_ref_bind
7243 ? issue_conversion_warnings
: false,
7244 c_cast_p
, complain
);
7245 if (expr
== error_mark_node
)
7246 return error_mark_node
;
7248 switch (convs
->kind
)
7251 expr
= decay_conversion (expr
, complain
);
7252 if (expr
== error_mark_node
)
7254 if (complain
& tf_error
)
7256 auto_diagnostic_group d
;
7257 maybe_print_user_conv_context (convs
);
7258 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7260 return error_mark_node
;
7263 if (! MAYBE_CLASS_TYPE_P (totype
))
7266 /* Don't introduce copies when passing arguments along to the inherited
7268 if (current_function_decl
7269 && flag_new_inheriting_ctors
7270 && DECL_INHERITED_CTOR (current_function_decl
))
7273 if (TREE_CODE (expr
) == TARGET_EXPR
7274 && TARGET_EXPR_LIST_INIT_P (expr
))
7275 /* Copy-list-initialization doesn't actually involve a copy. */
7280 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
7282 /* We are going to bind a reference directly to a base-class
7283 subobject of EXPR. */
7284 /* Build an expression for `*((base*) &expr)'. */
7285 expr
= convert_to_base (expr
, totype
,
7286 !c_cast_p
, /*nonnull=*/true, complain
);
7290 /* Copy-initialization where the cv-unqualified version of the source
7291 type is the same class as, or a derived class of, the class of the
7292 destination [is treated as direct-initialization]. [dcl.init] */
7293 flags
= LOOKUP_NORMAL
;
7294 if (convs
->user_conv_p
)
7295 /* This conversion is being done in the context of a user-defined
7296 conversion (i.e. the second step of copy-initialization), so
7297 don't allow any more. */
7298 flags
|= LOOKUP_NO_CONVERSION
;
7300 flags
|= LOOKUP_ONLYCONVERTING
;
7301 if (convs
->rvaluedness_matches_p
)
7302 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
7303 flags
|= LOOKUP_PREFER_RVALUE
;
7304 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
7305 if (diag_kind
&& complain
)
7307 auto_diagnostic_group d
;
7308 maybe_print_user_conv_context (convs
);
7309 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7312 return build_cplus_new (totype
, expr
, complain
);
7316 tree ref_type
= totype
;
7318 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
7320 tree extype
= TREE_TYPE (expr
);
7321 auto_diagnostic_group d
;
7322 if (TYPE_REF_IS_RVALUE (ref_type
)
7324 error_at (loc
, "cannot bind rvalue reference of type %qH to "
7325 "lvalue of type %qI", totype
, extype
);
7326 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
7327 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
7328 error_at (loc
, "cannot bind non-const lvalue reference of "
7329 "type %qH to an rvalue of type %qI", totype
, extype
);
7330 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
7331 error_at (loc
, "binding reference of type %qH to %qI "
7332 "discards qualifiers", totype
, extype
);
7335 maybe_print_user_conv_context (convs
);
7336 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7338 return error_mark_node
;
7341 /* If necessary, create a temporary.
7343 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7344 that need temporaries, even when their types are reference
7345 compatible with the type of reference being bound, so the
7346 upcoming call to cp_build_addr_expr doesn't fail. */
7347 if (convs
->need_temporary_p
7348 || TREE_CODE (expr
) == CONSTRUCTOR
7349 || TREE_CODE (expr
) == VA_ARG_EXPR
)
7351 /* Otherwise, a temporary of type "cv1 T1" is created and
7352 initialized from the initializer expression using the rules
7353 for a non-reference copy-initialization (8.5). */
7355 tree type
= TREE_TYPE (ref_type
);
7356 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
7358 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7359 (type
, next_conversion (convs
)->type
));
7360 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
7361 && !TYPE_REF_IS_RVALUE (ref_type
))
7363 /* If the reference is volatile or non-const, we
7364 cannot create a temporary. */
7365 if (lvalue
& clk_bitfield
)
7366 error_at (loc
, "cannot bind bitfield %qE to %qT",
7368 else if (lvalue
& clk_packed
)
7369 error_at (loc
, "cannot bind packed field %qE to %qT",
7372 error_at (loc
, "cannot bind rvalue %qE to %qT",
7374 return error_mark_node
;
7376 /* If the source is a packed field, and we must use a copy
7377 constructor, then building the target expr will require
7378 binding the field to the reference parameter to the
7379 copy constructor, and we'll end up with an infinite
7380 loop. If we can use a bitwise copy, then we'll be
7382 if ((lvalue
& clk_packed
)
7383 && CLASS_TYPE_P (type
)
7384 && type_has_nontrivial_copy_init (type
))
7386 error_at (loc
, "cannot bind packed field %qE to %qT",
7388 return error_mark_node
;
7390 if (lvalue
& clk_bitfield
)
7392 expr
= convert_bitfield_to_declared_type (expr
);
7393 expr
= fold_convert (type
, expr
);
7395 expr
= build_target_expr_with_type (expr
, type
, complain
);
7398 /* Take the address of the thing to which we will bind the
7400 expr
= cp_build_addr_expr (expr
, complain
);
7401 if (expr
== error_mark_node
)
7402 return error_mark_node
;
7404 /* Convert it to a pointer to the type referred to by the
7405 reference. This will adjust the pointer if a derived to
7406 base conversion is being performed. */
7407 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
7409 /* Convert the pointer to the desired reference type. */
7410 return build_nop (ref_type
, expr
);
7414 return decay_conversion (expr
, complain
);
7417 /* ??? Should the address of a transaction-safe pointer point to the TM
7418 clone, and this conversion look up the primary function? */
7419 return build_nop (totype
, expr
);
7422 /* Warn about deprecated conversion if appropriate. */
7423 string_conv_p (totype
, expr
, 1);
7428 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
7429 /*nonnull=*/false, complain
);
7430 return build_nop (totype
, expr
);
7433 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
7434 c_cast_p
, complain
);
7440 if (convs
->check_narrowing
7441 && !check_narrowing (totype
, expr
, complain
,
7442 convs
->check_narrowing_const_only
))
7443 return error_mark_node
;
7445 warning_sentinel
w (warn_zero_as_null_pointer_constant
);
7446 if (issue_conversion_warnings
)
7447 expr
= cp_convert_and_check (totype
, expr
, complain
);
7449 expr
= cp_convert (totype
, expr
, complain
);
7454 /* ARG is being passed to a varargs function. Perform any conversions
7455 required. Return the converted value. */
7458 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
7461 location_t loc
= cp_expr_loc_or_loc (arg
, input_location
);
7465 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7466 standard conversions are performed. */
7467 arg
= decay_conversion (arg
, complain
);
7468 arg_type
= TREE_TYPE (arg
);
7471 If the argument has integral or enumeration type that is subject
7472 to the integral promotions (_conv.prom_), or a floating point
7473 type that is subject to the floating point promotion
7474 (_conv.fpprom_), the value of the argument is converted to the
7475 promoted type before the call. */
7476 if (TREE_CODE (arg_type
) == REAL_TYPE
7477 && (TYPE_PRECISION (arg_type
)
7478 < TYPE_PRECISION (double_type_node
))
7479 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
7481 if ((complain
& tf_warning
)
7482 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
7483 warning_at (loc
, OPT_Wdouble_promotion
,
7484 "implicit conversion from %qH to %qI when passing "
7485 "argument to function",
7486 arg_type
, double_type_node
);
7487 arg
= convert_to_real_nofold (double_type_node
, arg
);
7489 else if (NULLPTR_TYPE_P (arg_type
))
7490 arg
= null_pointer_node
;
7491 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
7493 if (SCOPED_ENUM_P (arg_type
))
7495 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
7497 prom
= cp_perform_integral_promotions (prom
, complain
);
7498 if (abi_version_crosses (6)
7499 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
7500 && (complain
& tf_warning
))
7501 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
7502 "%qT before %<-fabi-version=6%>, %qT after", arg_type
,
7503 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
7504 if (!abi_version_at_least (6))
7508 arg
= cp_perform_integral_promotions (arg
, complain
);
7511 arg
= require_complete_type_sfinae (arg
, complain
);
7512 arg_type
= TREE_TYPE (arg
);
7514 if (arg
!= error_mark_node
7515 /* In a template (or ill-formed code), we can have an incomplete type
7516 even after require_complete_type_sfinae, in which case we don't know
7517 whether it has trivial copy or not. */
7518 && COMPLETE_TYPE_P (arg_type
)
7519 && !cp_unevaluated_operand
)
7521 /* [expr.call] 5.2.2/7:
7522 Passing a potentially-evaluated argument of class type (Clause 9)
7523 with a non-trivial copy constructor or a non-trivial destructor
7524 with no corresponding parameter is conditionally-supported, with
7525 implementation-defined semantics.
7527 We support it as pass-by-invisible-reference, just like a normal
7530 If the call appears in the context of a sizeof expression,
7531 it is not potentially-evaluated. */
7532 if (type_has_nontrivial_copy_init (arg_type
)
7533 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
))
7535 arg
= force_rvalue (arg
, complain
);
7536 if (complain
& tf_warning
)
7537 warning (OPT_Wconditionally_supported
,
7538 "passing objects of non-trivially-copyable "
7539 "type %q#T through %<...%> is conditionally supported",
7541 return build1 (ADDR_EXPR
, build_reference_type (arg_type
), arg
);
7543 /* Build up a real lvalue-to-rvalue conversion in case the
7544 copy constructor is trivial but not callable. */
7545 else if (CLASS_TYPE_P (arg_type
))
7546 force_rvalue (arg
, complain
);
7553 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7556 build_x_va_arg (location_t loc
, tree expr
, tree type
)
7558 if (processing_template_decl
)
7560 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
7561 SET_EXPR_LOCATION (r
, loc
);
7565 type
= complete_type_or_else (type
, NULL_TREE
);
7567 if (expr
== error_mark_node
|| !type
)
7568 return error_mark_node
;
7570 expr
= mark_lvalue_use (expr
);
7572 if (TYPE_REF_P (type
))
7574 error ("cannot receive reference type %qT through %<...%>", type
);
7575 return error_mark_node
;
7578 if (type_has_nontrivial_copy_init (type
)
7579 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7581 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7582 it as pass by invisible reference. */
7583 warning_at (loc
, OPT_Wconditionally_supported
,
7584 "receiving objects of non-trivially-copyable type %q#T "
7585 "through %<...%> is conditionally-supported", type
);
7587 tree ref
= cp_build_reference_type (type
, false);
7588 expr
= build_va_arg (loc
, expr
, ref
);
7589 return convert_from_reference (expr
);
7592 tree ret
= build_va_arg (loc
, expr
, type
);
7593 if (CLASS_TYPE_P (type
))
7594 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7595 know how to handle it. */
7596 ret
= get_target_expr (ret
);
7600 /* TYPE has been given to va_arg. Apply the default conversions which
7601 would have happened when passed via ellipsis. Return the promoted
7602 type, or the passed type if there is no change. */
7605 cxx_type_promotes_to (tree type
)
7609 /* Perform the array-to-pointer and function-to-pointer
7611 type
= type_decays_to (type
);
7613 promote
= type_promotes_to (type
);
7614 if (same_type_p (type
, promote
))
7620 /* ARG is a default argument expression being passed to a parameter of
7621 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7622 zero-based argument number. Do any required conversions. Return
7623 the converted value. */
7625 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
7627 push_defarg_context (tree fn
)
7628 { vec_safe_push (default_arg_context
, fn
); }
7631 pop_defarg_context (void)
7632 { default_arg_context
->pop (); }
7635 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
7636 tsubst_flags_t complain
)
7641 /* See through clones. */
7642 fn
= DECL_ORIGIN (fn
);
7643 /* And inheriting ctors. */
7644 if (flag_new_inheriting_ctors
)
7645 fn
= strip_inheriting_ctors (fn
);
7647 /* Detect recursion. */
7648 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
7651 if (complain
& tf_error
)
7652 error ("recursive evaluation of default argument for %q#D", fn
);
7653 return error_mark_node
;
7656 /* If the ARG is an unparsed default argument expression, the
7657 conversion cannot be performed. */
7658 if (TREE_CODE (arg
) == DEFAULT_ARG
)
7660 if (complain
& tf_error
)
7661 error ("call to %qD uses the default argument for parameter %P, which "
7662 "is not yet defined", fn
, parmnum
);
7663 return error_mark_node
;
7666 push_defarg_context (fn
);
7668 if (fn
&& DECL_TEMPLATE_INFO (fn
))
7669 arg
= tsubst_default_argument (fn
, parmnum
, type
, arg
, complain
);
7675 The names in the expression are bound, and the semantic
7676 constraints are checked, at the point where the default
7677 expressions appears.
7679 we must not perform access checks here. */
7680 push_deferring_access_checks (dk_no_check
);
7681 /* We must make a copy of ARG, in case subsequent processing
7682 alters any part of it. */
7683 arg
= break_out_target_exprs (arg
, /*clear location*/true);
7685 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
7686 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
7688 arg
= convert_for_arg_passing (type
, arg
, complain
);
7689 pop_deferring_access_checks();
7691 pop_defarg_context ();
7696 /* Returns the type which will really be used for passing an argument of
7700 type_passed_as (tree type
)
7702 /* Pass classes with copy ctors by invisible reference. */
7703 if (TREE_ADDRESSABLE (type
))
7705 type
= build_reference_type (type
);
7706 /* There are no other pointers to this temporary. */
7707 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
7709 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7710 && INTEGRAL_TYPE_P (type
)
7711 && COMPLETE_TYPE_P (type
)
7712 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7713 type
= integer_type_node
;
7718 /* Actually perform the appropriate conversion. */
7721 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
7725 /* If VAL is a bitfield, then -- since it has already been converted
7726 to TYPE -- it cannot have a precision greater than TYPE.
7728 If it has a smaller precision, we must widen it here. For
7729 example, passing "int f:3;" to a function expecting an "int" will
7730 not result in any conversion before this point.
7732 If the precision is the same we must not risk widening. For
7733 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7734 often have type "int", even though the C++ type for the field is
7735 "long long". If the value is being passed to a function
7736 expecting an "int", then no conversions will be required. But,
7737 if we call convert_bitfield_to_declared_type, the bitfield will
7738 be converted to "long long". */
7739 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
7741 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
7742 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
7744 if (val
== error_mark_node
)
7746 /* Pass classes with copy ctors by invisible reference. */
7747 else if (TREE_ADDRESSABLE (type
))
7748 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
7749 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7750 && INTEGRAL_TYPE_P (type
)
7751 && COMPLETE_TYPE_P (type
)
7752 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7753 val
= cp_perform_integral_promotions (val
, complain
);
7754 if (complain
& tf_warning
)
7756 if (warn_suggest_attribute_format
)
7758 tree rhstype
= TREE_TYPE (val
);
7759 const enum tree_code coder
= TREE_CODE (rhstype
);
7760 const enum tree_code codel
= TREE_CODE (type
);
7761 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7763 && check_missing_format_attribute (type
, rhstype
))
7764 warning (OPT_Wsuggest_attribute_format
,
7765 "argument of function call might be a candidate "
7766 "for a format attribute");
7768 maybe_warn_parm_abi (type
, cp_expr_loc_or_loc (val
, input_location
));
7771 if (complain
& tf_warning
)
7772 warn_for_address_or_pointer_of_packed_member (type
, val
);
7777 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7778 which just decay_conversion or no conversions at all should be done.
7779 This is true for some builtins which don't act like normal functions.
7780 Return 2 if no conversions at all should be done, 1 if just
7781 decay_conversion. Return 3 for special treatment of the 3rd argument
7782 for __builtin_*_overflow_p. */
7785 magic_varargs_p (tree fn
)
7787 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
7788 switch (DECL_FUNCTION_CODE (fn
))
7790 case BUILT_IN_CLASSIFY_TYPE
:
7791 case BUILT_IN_CONSTANT_P
:
7792 case BUILT_IN_NEXT_ARG
:
7793 case BUILT_IN_VA_START
:
7796 case BUILT_IN_ADD_OVERFLOW_P
:
7797 case BUILT_IN_SUB_OVERFLOW_P
:
7798 case BUILT_IN_MUL_OVERFLOW_P
:
7802 return lookup_attribute ("type generic",
7803 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
7809 /* Returns the decl of the dispatcher function if FN is a function version. */
7812 get_function_version_dispatcher (tree fn
)
7814 tree dispatcher_decl
= NULL
;
7816 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7817 && DECL_FUNCTION_VERSIONED (fn
));
7819 gcc_assert (targetm
.get_function_versions_dispatcher
);
7820 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
7822 if (dispatcher_decl
== NULL
)
7824 error_at (input_location
, "use of multiversioned function "
7825 "without a default");
7829 retrofit_lang_decl (dispatcher_decl
);
7830 gcc_assert (dispatcher_decl
!= NULL
);
7831 return dispatcher_decl
;
7834 /* fn is a function version dispatcher that is marked used. Mark all the
7835 semantically identical function versions it will dispatch as used. */
7838 mark_versions_used (tree fn
)
7840 struct cgraph_node
*node
;
7841 struct cgraph_function_version_info
*node_v
;
7842 struct cgraph_function_version_info
*it_v
;
7844 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7846 node
= cgraph_node::get (fn
);
7850 gcc_assert (node
->dispatcher_function
);
7852 node_v
= node
->function_version ();
7856 /* All semantically identical versions are chained. Traverse and mark each
7857 one of them as used. */
7858 it_v
= node_v
->next
;
7859 while (it_v
!= NULL
)
7861 mark_used (it_v
->this_node
->decl
);
7866 /* Build a call to "the copy constructor" for the type of A, even if it
7867 wouldn't be selected by normal overload resolution. Used for
7871 call_copy_ctor (tree a
, tsubst_flags_t complain
)
7873 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
7874 tree binfo
= TYPE_BINFO (ctype
);
7875 tree copy
= get_copy_ctor (ctype
, complain
);
7876 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7877 tree ob
= build_dummy_object (ctype
);
7878 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7879 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7880 LOOKUP_NORMAL
, NULL
, complain
);
7881 release_tree_vector (args
);
7885 /* Return true iff T refers to a base field. */
7888 is_base_field_ref (tree t
)
7891 if (TREE_CODE (t
) == ADDR_EXPR
)
7892 t
= TREE_OPERAND (t
, 0);
7893 if (TREE_CODE (t
) == COMPONENT_REF
)
7894 t
= TREE_OPERAND (t
, 1);
7895 if (TREE_CODE (t
) == FIELD_DECL
)
7896 return DECL_FIELD_IS_BASE (t
);
7900 /* We can't elide a copy from a function returning by value to a base
7901 subobject, as the callee might clobber tail padding. Return true iff this
7902 could be that case. */
7905 unsafe_copy_elision_p (tree target
, tree exp
)
7907 /* Copy elision only happens with a TARGET_EXPR. */
7908 if (TREE_CODE (exp
) != TARGET_EXPR
)
7910 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
7911 /* It's safe to elide the copy for a class with no tail padding. */
7912 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
7914 /* It's safe to elide the copy if we aren't initializing a base object. */
7915 if (!is_base_field_ref (target
))
7917 tree init
= TARGET_EXPR_INITIAL (exp
);
7918 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7919 while (TREE_CODE (init
) == COMPOUND_EXPR
)
7920 init
= TREE_OPERAND (init
, 1);
7921 if (TREE_CODE (init
) == COND_EXPR
)
7923 /* We'll end up copying from each of the arms of the COND_EXPR directly
7924 into the target, so look at them. */
7925 if (tree op
= TREE_OPERAND (init
, 1))
7926 if (unsafe_copy_elision_p (target
, op
))
7928 return unsafe_copy_elision_p (target
, TREE_OPERAND (init
, 2));
7930 return (TREE_CODE (init
) == AGGR_INIT_EXPR
7931 && !AGGR_INIT_VIA_CTOR_P (init
));
7934 /* True iff C is a conversion that binds a reference to a prvalue. */
7937 conv_binds_ref_to_prvalue (conversion
*c
)
7939 if (c
->kind
!= ck_ref_bind
)
7941 if (c
->need_temporary_p
)
7944 c
= next_conversion (c
);
7946 if (c
->kind
== ck_rvalue
)
7948 if (c
->kind
== ck_user
&& !TYPE_REF_P (c
->type
))
7950 if (c
->kind
== ck_identity
&& c
->u
.expr
7951 && TREE_CODE (c
->u
.expr
) == TARGET_EXPR
)
7957 /* Call the trivial destructor for INSTANCE, which can be either an lvalue of
7958 class type or a pointer to class type. */
7961 build_trivial_dtor_call (tree instance
)
7963 gcc_assert (!is_dummy_object (instance
));
7965 if (!flag_lifetime_dse
)
7968 return fold_convert (void_type_node
, instance
);
7971 if (INDIRECT_TYPE_P (TREE_TYPE (instance
)))
7973 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
7975 instance
= cp_build_fold_indirect_ref (instance
);
7978 /* A trivial destructor should still clobber the object. */
7979 tree clobber
= build_clobber (TREE_TYPE (instance
));
7980 return build2 (MODIFY_EXPR
, void_type_node
,
7984 /* Subroutine of the various build_*_call functions. Overload resolution
7985 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7986 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7987 bitmask of various LOOKUP_* flags which apply to the call itself. */
7990 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
7993 const vec
<tree
, va_gc
> *args
= cand
->args
;
7994 tree first_arg
= cand
->first_arg
;
7995 conversion
**convs
= cand
->convs
;
7997 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
8002 unsigned int arg_index
= 0;
8006 bool already_used
= false;
8008 /* In a template, there is no need to perform all of the work that
8009 is normally done. We are only interested in the type of the call
8010 expression, i.e., the return type of the function. Any semantic
8011 errors will be deferred until the template is instantiated. */
8012 if (processing_template_decl
)
8016 const tree
*argarray
;
8019 if (undeduced_auto_decl (fn
))
8020 mark_used (fn
, complain
);
8022 /* Otherwise set TREE_USED for the benefit of -Wunused-function.
8026 return_type
= TREE_TYPE (TREE_TYPE (fn
));
8027 nargs
= vec_safe_length (args
);
8028 if (first_arg
== NULL_TREE
)
8029 argarray
= args
->address ();
8037 alcarray
= XALLOCAVEC (tree
, nargs
);
8038 alcarray
[0] = build_this (first_arg
);
8039 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
8040 alcarray
[ix
+ 1] = arg
;
8041 argarray
= alcarray
;
8044 addr
= build_addr_func (fn
, complain
);
8045 if (addr
== error_mark_node
)
8046 return error_mark_node
;
8047 expr
= build_call_array_loc (input_location
, return_type
,
8048 addr
, nargs
, argarray
);
8049 if (TREE_THIS_VOLATILE (fn
) && cfun
)
8050 current_function_returns_abnormally
= 1;
8051 return convert_from_reference (expr
);
8054 /* Give any warnings we noticed during overload resolution. */
8055 if (cand
->warnings
&& (complain
& tf_warning
))
8057 struct candidate_warning
*w
;
8058 for (w
= cand
->warnings
; w
; w
= w
->next
)
8059 joust (cand
, w
->loser
, 1, complain
);
8062 /* Core issue 2327: P0135 doesn't say how to handle the case where the
8063 argument to the copy constructor ends up being a prvalue after
8064 conversion. Let's do the normal processing, but pretend we aren't
8065 actually using the copy constructor. */
8066 bool force_elide
= false;
8067 if (cxx_dialect
>= cxx17
8068 && cand
->num_convs
== 1
8069 && DECL_COMPLETE_CONSTRUCTOR_P (fn
)
8070 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8071 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8072 && conv_binds_ref_to_prvalue (convs
[0]))
8075 goto not_really_used
;
8078 /* OK, we're actually calling this inherited constructor; set its deletedness
8079 appropriately. We can get away with doing this here because calling is
8080 the only way to refer to a constructor. */
8081 if (DECL_INHERITED_CTOR (fn
))
8082 deduce_inheriting_ctor (fn
);
8084 /* Make =delete work with SFINAE. */
8085 if (DECL_DELETED_FN (fn
))
8087 if (complain
& tf_error
)
8089 return error_mark_node
;
8092 if (DECL_FUNCTION_MEMBER_P (fn
))
8095 /* If FN is a template function, two cases must be considered.
8100 template <class T> void f();
8102 template <class T> struct B {
8106 struct C : A, B<int> {
8108 using B<int>::g; // #2
8111 In case #1 where `A::f' is a member template, DECL_ACCESS is
8112 recorded in the primary template but not in its specialization.
8113 We check access of FN using its primary template.
8115 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
8116 because it is a member of class template B, DECL_ACCESS is
8117 recorded in the specialization `B<int>::g'. We cannot use its
8118 primary template because `B<T>::g' and `B<int>::g' may have
8119 different access. */
8120 if (DECL_TEMPLATE_INFO (fn
)
8121 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
8122 access_fn
= DECL_TI_TEMPLATE (fn
);
8125 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
8127 return error_mark_node
;
8130 /* If we're checking for implicit delete, don't bother with argument
8132 if (flags
& LOOKUP_SPECULATIVE
)
8134 if (cand
->viable
== 1)
8136 else if (!(complain
& tf_error
))
8137 /* Reject bad conversions now. */
8138 return error_mark_node
;
8139 /* else continue to get conversion error. */
8144 /* N3276 magic doesn't apply to nested calls. */
8145 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
8146 complain
&= ~tf_decltype
;
8147 /* No-Cleanup doesn't apply to nested calls either. */
8148 tsubst_flags_t no_cleanup_complain
= complain
;
8149 complain
&= ~tf_no_cleanup
;
8151 /* Find maximum size of vector to hold converted arguments. */
8152 parmlen
= list_length (parm
);
8153 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
8154 if (parmlen
> nargs
)
8156 argarray
= XALLOCAVEC (tree
, nargs
);
8158 /* The implicit parameters to a constructor are not considered by overload
8159 resolution, and must be of the proper type. */
8160 if (DECL_CONSTRUCTOR_P (fn
))
8163 if (first_arg
!= NULL_TREE
)
8165 object_arg
= first_arg
;
8166 first_arg
= NULL_TREE
;
8170 object_arg
= (*args
)[arg_index
];
8173 argarray
[j
++] = build_this (object_arg
);
8174 parm
= TREE_CHAIN (parm
);
8175 /* We should never try to call the abstract constructor. */
8176 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
8178 if (DECL_HAS_VTT_PARM_P (fn
))
8180 argarray
[j
++] = (*args
)[arg_index
];
8182 parm
= TREE_CHAIN (parm
);
8185 if (flags
& LOOKUP_PREFER_RVALUE
)
8187 /* The implicit move specified in 15.8.3/3 fails "...if the type of
8188 the first parameter of the selected constructor is not an rvalue
8189 reference to the object's type (possibly cv-qualified)...." */
8190 gcc_assert (!(complain
& tf_error
));
8191 tree ptype
= convs
[0]->type
;
8192 if (!TYPE_REF_P (ptype
)
8193 || !TYPE_REF_IS_RVALUE (ptype
)
8194 || CONVERSION_RANK (convs
[0]) > cr_exact
)
8195 return error_mark_node
;
8198 /* Bypass access control for 'this' parameter. */
8199 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
8201 tree parmtype
= TREE_VALUE (parm
);
8202 tree arg
= build_this (first_arg
!= NULL_TREE
8204 : (*args
)[arg_index
]);
8205 tree argtype
= TREE_TYPE (arg
);
8209 if (arg
== error_mark_node
)
8210 return error_mark_node
;
8212 if (convs
[i
]->bad_p
)
8214 if (complain
& tf_error
)
8216 auto_diagnostic_group d
;
8217 if (permerror (input_location
, "passing %qT as %<this%> "
8218 "argument discards qualifiers",
8219 TREE_TYPE (argtype
)))
8220 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
8223 return error_mark_node
;
8226 /* See if the function member or the whole class type is declared
8227 final and the call can be devirtualized. */
8228 if (DECL_FINAL_P (fn
)
8229 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
8230 flags
|= LOOKUP_NONVIRTUAL
;
8232 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
8233 X is called for an object that is not of type X, or of a type
8234 derived from X, the behavior is undefined.
8236 So we can assume that anything passed as 'this' is non-null, and
8237 optimize accordingly. */
8238 gcc_assert (TYPE_PTR_P (parmtype
));
8239 /* Convert to the base in which the function was declared. */
8240 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
8241 converted_arg
= build_base_path (PLUS_EXPR
,
8243 cand
->conversion_path
,
8245 /* Check that the base class is accessible. */
8246 if (!accessible_base_p (TREE_TYPE (argtype
),
8247 BINFO_TYPE (cand
->conversion_path
), true))
8249 if (complain
& tf_error
)
8250 error ("%qT is not an accessible base of %qT",
8251 BINFO_TYPE (cand
->conversion_path
),
8252 TREE_TYPE (argtype
));
8254 return error_mark_node
;
8256 /* If fn was found by a using declaration, the conversion path
8257 will be to the derived class, not the base declaring fn. We
8258 must convert from derived to base. */
8259 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
8260 TREE_TYPE (parmtype
), ba_unique
,
8262 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
8263 base_binfo
, 1, complain
);
8265 argarray
[j
++] = converted_arg
;
8266 parm
= TREE_CHAIN (parm
);
8267 if (first_arg
!= NULL_TREE
)
8268 first_arg
= NULL_TREE
;
8275 gcc_assert (first_arg
== NULL_TREE
);
8276 for (; arg_index
< vec_safe_length (args
) && parm
;
8277 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
8279 tree type
= TREE_VALUE (parm
);
8280 tree arg
= (*args
)[arg_index
];
8281 bool conversion_warning
= true;
8285 /* If the argument is NULL and used to (implicitly) instantiate a
8286 template function (and bind one of the template arguments to
8287 the type of 'long int'), we don't want to warn about passing NULL
8288 to non-pointer argument.
8289 For example, if we have this template function:
8291 template<typename T> void func(T x) {}
8293 we want to warn (when -Wconversion is enabled) in this case:
8299 but not in this case:
8305 if (null_node_p (arg
)
8306 && DECL_TEMPLATE_INFO (fn
)
8307 && cand
->template_decl
8308 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
8309 conversion_warning
= false;
8311 /* Warn about initializer_list deduction that isn't currently in the
8313 if (cxx_dialect
> cxx98
8314 && flag_deduce_init_list
8315 && cand
->template_decl
8316 && is_std_init_list (non_reference (type
))
8317 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
8319 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
8320 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
8321 tree patparm
= get_pattern_parm (realparm
, tmpl
);
8322 tree pattype
= TREE_TYPE (patparm
);
8323 if (PACK_EXPANSION_P (pattype
))
8324 pattype
= PACK_EXPANSION_PATTERN (pattype
);
8325 pattype
= non_reference (pattype
);
8327 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
8328 && (cand
->explicit_targs
== NULL_TREE
8329 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
8330 <= TEMPLATE_TYPE_IDX (pattype
))))
8332 pedwarn (input_location
, 0, "deducing %qT as %qT",
8333 non_reference (TREE_TYPE (patparm
)),
8334 non_reference (type
));
8335 pedwarn (DECL_SOURCE_LOCATION (cand
->fn
), 0,
8336 " in call to %qD", cand
->fn
);
8337 pedwarn (input_location
, 0,
8338 " (you can disable this with "
8339 "%<-fno-deduce-init-list%>)");
8343 /* Set user_conv_p on the argument conversions, so rvalue/base handling
8344 knows not to allow any more UDCs. This needs to happen after we
8345 process cand->warnings. */
8346 if (flags
& LOOKUP_NO_CONVERSION
)
8347 conv
->user_conv_p
= true;
8349 tsubst_flags_t arg_complain
= complain
;
8350 if (!conversion_warning
)
8351 arg_complain
&= ~tf_warning
;
8353 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
8355 val
= convert_for_arg_passing (type
, val
, arg_complain
);
8357 if (val
== error_mark_node
)
8358 return error_mark_node
;
8360 argarray
[j
++] = val
;
8363 /* Default arguments */
8364 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
8366 if (TREE_VALUE (parm
) == error_mark_node
)
8367 return error_mark_node
;
8368 val
= convert_default_arg (TREE_VALUE (parm
),
8369 TREE_PURPOSE (parm
),
8372 if (val
== error_mark_node
)
8373 return error_mark_node
;
8374 argarray
[j
++] = val
;
8378 int magic
= magic_varargs_p (fn
);
8379 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
8381 tree a
= (*args
)[arg_index
];
8382 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
8384 /* Do no conversions for certain magic varargs. */
8385 a
= mark_type_use (a
);
8386 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
8387 return error_mark_node
;
8389 else if (magic
!= 0)
8390 /* For other magic varargs only do decay_conversion. */
8391 a
= decay_conversion (a
, complain
);
8392 else if (DECL_CONSTRUCTOR_P (fn
)
8393 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
8396 /* Avoid infinite recursion trying to call A(...). */
8397 if (complain
& tf_error
)
8398 /* Try to call the actual copy constructor for a good error. */
8399 call_copy_ctor (a
, complain
);
8400 return error_mark_node
;
8403 a
= convert_arg_to_ellipsis (a
, complain
);
8404 if (a
== error_mark_node
)
8405 return error_mark_node
;
8409 gcc_assert (j
<= nargs
);
8412 /* Avoid to do argument-transformation, if warnings for format, and for
8413 nonnull are disabled. Just in case that at least one of them is active
8414 the check_function_arguments function might warn about something. */
8416 bool warned_p
= false;
8419 || warn_suggest_attribute_format
8422 tree
*fargs
= (!nargs
? argarray
8423 : (tree
*) alloca (nargs
* sizeof (tree
)));
8424 for (j
= 0; j
< nargs
; j
++)
8426 /* For -Wformat undo the implicit passing by hidden reference
8427 done by convert_arg_to_ellipsis. */
8428 if (TREE_CODE (argarray
[j
]) == ADDR_EXPR
8429 && TYPE_REF_P (TREE_TYPE (argarray
[j
])))
8430 fargs
[j
] = TREE_OPERAND (argarray
[j
], 0);
8432 fargs
[j
] = argarray
[j
];
8435 warned_p
= check_function_arguments (input_location
, fn
, TREE_TYPE (fn
),
8436 nargs
, fargs
, NULL
);
8439 if (DECL_INHERITED_CTOR (fn
))
8441 /* Check for passing ellipsis arguments to an inherited constructor. We
8442 could handle this by open-coding the inherited constructor rather than
8443 defining it, but let's not bother now. */
8444 if (!cp_unevaluated_operand
8446 && cand
->convs
[cand
->num_convs
-1]->ellipsis_p
)
8448 if (complain
& tf_error
)
8450 sorry ("passing arguments to ellipsis of inherited constructor "
8452 inform (DECL_SOURCE_LOCATION (cand
->fn
), "declared here");
8454 return error_mark_node
;
8457 /* A base constructor inheriting from a virtual base doesn't get the
8458 inherited arguments, just this and __vtt. */
8459 if (ctor_omit_inherited_parms (fn
))
8463 /* Avoid actually calling copy constructors and copy assignment operators,
8466 if (! flag_elide_constructors
&& !force_elide
)
8467 /* Do things the hard way. */;
8468 else if (cand
->num_convs
== 1
8469 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8470 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8471 /* It's unsafe to elide the constructor when handling
8472 a noexcept-expression, it may evaluate to the wrong
8473 value (c++/53025). */
8474 && (force_elide
|| cp_noexcept_operand
== 0))
8477 tree arg
= argarray
[num_artificial_parms_for (fn
)];
8479 bool trivial
= trivial_fn_p (fn
);
8481 /* Pull out the real argument, disregarding const-correctness. */
8483 /* Strip the reference binding for the constructor parameter. */
8484 if (CONVERT_EXPR_P (targ
)
8485 && TYPE_REF_P (TREE_TYPE (targ
)))
8486 targ
= TREE_OPERAND (targ
, 0);
8487 /* But don't strip any other reference bindings; binding a temporary to a
8488 reference prevents copy elision. */
8489 while ((CONVERT_EXPR_P (targ
)
8490 && !TYPE_REF_P (TREE_TYPE (targ
)))
8491 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
8492 targ
= TREE_OPERAND (targ
, 0);
8493 if (TREE_CODE (targ
) == ADDR_EXPR
)
8495 targ
= TREE_OPERAND (targ
, 0);
8496 if (!same_type_ignoring_top_level_qualifiers_p
8497 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
8506 arg
= cp_build_fold_indirect_ref (arg
);
8508 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8510 if (CHECKING_P
&& cxx_dialect
>= cxx17
)
8511 gcc_assert (TREE_CODE (arg
) != TARGET_EXPR
8513 /* It's from binding the ref parm to a packed field. */
8514 || convs
[0]->need_temporary_p
8516 /* See unsafe_copy_elision_p. */
8517 || DECL_BASE_CONSTRUCTOR_P (fn
));
8520 bool unsafe
= unsafe_copy_elision_p (fa
, arg
);
8521 bool eliding_temp
= (TREE_CODE (arg
) == TARGET_EXPR
&& !unsafe
);
8523 /* [class.copy]: the copy constructor is implicitly defined even if the
8524 implementation elided its use. But don't warn about deprecation when
8525 eliding a temporary, as then no copy is actually performed. */
8526 warning_sentinel
s (warn_deprecated_copy
, eliding_temp
);
8528 /* The language says this isn't called. */;
8531 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
8532 return error_mark_node
;
8533 already_used
= true;
8536 cp_warn_deprecated_use (fn
, complain
);
8538 /* If we're creating a temp and we already have one, don't create a
8539 new one. If we're not creating a temp but we get one, use
8540 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8541 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8542 temp or an INIT_EXPR otherwise. */
8543 if (is_dummy_object (fa
))
8545 if (TREE_CODE (arg
) == TARGET_EXPR
)
8548 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
8550 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
8553 tree to
= cp_stabilize_reference (cp_build_fold_indirect_ref (fa
));
8555 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
8559 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
8560 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
)
8561 && trivial_fn_p (fn
))
8563 tree to
= cp_stabilize_reference
8564 (cp_build_fold_indirect_ref (argarray
[0]));
8565 tree type
= TREE_TYPE (to
);
8566 tree as_base
= CLASSTYPE_AS_BASE (type
);
8567 tree arg
= argarray
[1];
8568 location_t loc
= cp_expr_loc_or_loc (arg
, input_location
);
8570 if (is_really_empty_class (type
, /*ignore_vptr*/true))
8572 /* Avoid copying empty classes. */
8573 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
8574 TREE_NO_WARNING (val
) = 1;
8576 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
8578 if (is_std_init_list (type
)
8579 && conv_binds_ref_to_prvalue (convs
[1]))
8580 warning_at (loc
, OPT_Winit_list_lifetime
,
8581 "assignment from temporary initializer_list does not "
8582 "extend the lifetime of the underlying array");
8583 arg
= cp_build_fold_indirect_ref (arg
);
8584 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
8588 /* We must only copy the non-tail padding parts. */
8590 tree array_type
, alias_set
;
8592 arg2
= TYPE_SIZE_UNIT (as_base
);
8593 arg0
= cp_build_addr_expr (to
, complain
);
8595 array_type
= build_array_type (unsigned_char_type_node
,
8597 (size_binop (MINUS_EXPR
,
8598 arg2
, size_int (1))));
8599 alias_set
= build_int_cst (build_pointer_type (type
), 0);
8600 t
= build2 (MODIFY_EXPR
, void_type_node
,
8601 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
8602 build2 (MEM_REF
, array_type
, arg
, alias_set
));
8603 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
8604 TREE_NO_WARNING (val
) = 1;
8607 cp_warn_deprecated_use (fn
, complain
);
8611 else if (trivial_fn_p (fn
))
8613 if (DECL_DESTRUCTOR_P (fn
))
8614 return build_trivial_dtor_call (argarray
[0]);
8615 else if (default_ctor_p (fn
))
8617 if (is_dummy_object (argarray
[0]))
8618 return force_target_expr (DECL_CONTEXT (fn
), void_node
,
8619 no_cleanup_complain
);
8621 return cp_build_fold_indirect_ref (argarray
[0]);
8625 gcc_assert (!force_elide
);
8628 && !mark_used (fn
, complain
))
8629 return error_mark_node
;
8631 /* Warn if the built-in writes to an object of a non-trivial type. */
8632 if (warn_class_memaccess
8633 && vec_safe_length (args
) >= 2
8634 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8635 maybe_warn_class_memaccess (input_location
, fn
, args
);
8637 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
8640 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
8642 ba_any
, NULL
, complain
);
8643 gcc_assert (binfo
&& binfo
!= error_mark_node
);
8645 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
8647 if (TREE_SIDE_EFFECTS (argarray
[0]))
8648 argarray
[0] = save_expr (argarray
[0]);
8649 t
= build_pointer_type (TREE_TYPE (fn
));
8650 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
8655 fn
= build_addr_func (fn
, complain
);
8656 if (fn
== error_mark_node
)
8657 return error_mark_node
;
8660 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
8661 if (call
== error_mark_node
)
8663 if (cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
8665 tree c
= extract_call_expr (call
);
8666 /* build_new_op_1 will clear this when appropriate. */
8667 CALL_EXPR_ORDERED_ARGS (c
) = true;
8671 tree c
= extract_call_expr (call
);
8672 if (TREE_CODE (c
) == CALL_EXPR
)
8673 TREE_NO_WARNING (c
) = 1;
8681 /* Return the DECL of the first non-static subobject of class TYPE
8682 that satisfies the predicate PRED or null if none can be found. */
8684 template <class Predicate
>
8686 first_non_static_field (tree type
, Predicate pred
)
8688 if (!type
|| !CLASS_TYPE_P (type
))
8691 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8693 if (TREE_CODE (field
) != FIELD_DECL
)
8695 if (TREE_STATIC (field
))
8703 for (tree base_binfo
, binfo
= TYPE_BINFO (type
);
8704 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8706 tree base
= TREE_TYPE (base_binfo
);
8709 if (tree field
= first_non_static_field (base
, pred
))
8716 struct NonPublicField
8718 bool operator() (const_tree t
)
8720 return DECL_P (t
) && (TREE_PRIVATE (t
) || TREE_PROTECTED (t
));
8724 /* Return the DECL of the first non-public subobject of class TYPE
8725 or null if none can be found. */
8728 first_non_public_field (tree type
)
8730 return first_non_static_field (type
, NonPublicField ());
8733 struct NonTrivialField
8735 bool operator() (const_tree t
)
8737 return !trivial_type_p (DECL_P (t
) ? TREE_TYPE (t
) : t
);
8741 /* Return the DECL of the first non-trivial subobject of class TYPE
8742 or null if none can be found. */
8745 first_non_trivial_field (tree type
)
8747 return first_non_static_field (type
, NonTrivialField ());
8750 } /* unnamed namespace */
8752 /* Return true if all copy and move assignment operator overloads for
8753 class TYPE are trivial and at least one of them is not deleted and,
8754 when ACCESS is set, accessible. Return false otherwise. Set
8755 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8756 copy or move assignment. */
8759 has_trivial_copy_assign_p (tree type
, bool access
, bool *hasassign
)
8761 tree fns
= get_class_binding (type
, assign_op_identifier
);
8762 bool all_trivial
= true;
8764 /* Iterate over overloads of the assignment operator, checking
8765 accessible copy assignments for triviality. */
8767 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8771 /* Skip operators that aren't copy assignments. */
8775 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8776 || accessible_p (TYPE_BINFO (type
), f
, true));
8778 /* Skip template assignment operators and deleted functions. */
8779 if (TREE_CODE (f
) != FUNCTION_DECL
|| DECL_DELETED_FN (f
))
8785 if (!accessible
|| !trivial_fn_p (f
))
8786 all_trivial
= false;
8788 /* Break early when both properties have been determined. */
8789 if (*hasassign
&& !all_trivial
)
8793 /* Return true if they're all trivial and one of the expressions
8794 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8795 tree ref
= cp_build_reference_type (type
, false);
8797 && (is_trivially_xible (MODIFY_EXPR
, type
, type
)
8798 || is_trivially_xible (MODIFY_EXPR
, type
, ref
)));
8801 /* Return true if all copy and move ctor overloads for class TYPE are
8802 trivial and at least one of them is not deleted and, when ACCESS is
8803 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8804 to true when the TYPE has a (not necessarily trivial) default and copy
8805 (or move) ctor, respectively. */
8808 has_trivial_copy_p (tree type
, bool access
, bool hasctor
[2])
8810 tree fns
= get_class_binding (type
, complete_ctor_identifier
);
8811 bool all_trivial
= true;
8813 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8817 /* Skip template constructors. */
8818 if (TREE_CODE (f
) != FUNCTION_DECL
)
8821 bool cpy_or_move_ctor_p
= copy_fn_p (f
);
8823 /* Skip ctors other than default, copy, and move. */
8824 if (!cpy_or_move_ctor_p
&& !default_ctor_p (f
))
8827 if (DECL_DELETED_FN (f
))
8830 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8831 || accessible_p (TYPE_BINFO (type
), f
, true));
8834 hasctor
[cpy_or_move_ctor_p
] = true;
8836 if (cpy_or_move_ctor_p
&& (!accessible
|| !trivial_fn_p (f
)))
8837 all_trivial
= false;
8839 /* Break early when both properties have been determined. */
8840 if (hasctor
[0] && hasctor
[1] && !all_trivial
)
8847 /* Issue a warning on a call to the built-in function FNDECL if it is
8848 a raw memory write whose destination is not an object of (something
8849 like) trivial or standard layout type with a non-deleted assignment
8850 and copy ctor. Detects const correctness violations, corrupting
8851 references, virtual table pointers, and bypassing non-trivial
8855 maybe_warn_class_memaccess (location_t loc
, tree fndecl
,
8856 const vec
<tree
, va_gc
> *args
)
8858 /* Except for bcopy where it's second, the destination pointer is
8859 the first argument for all functions handled here. Compute
8860 the index of the destination and source arguments. */
8861 unsigned dstidx
= DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_BCOPY
;
8862 unsigned srcidx
= !dstidx
;
8864 tree dest
= (*args
)[dstidx
];
8865 if (!TREE_TYPE (dest
) || !INDIRECT_TYPE_P (TREE_TYPE (dest
)))
8868 tree srctype
= NULL_TREE
;
8870 /* Determine the type of the pointed-to object and whether it's
8871 a complete class type. */
8872 tree desttype
= TREE_TYPE (TREE_TYPE (dest
));
8874 if (!desttype
|| !COMPLETE_TYPE_P (desttype
) || !CLASS_TYPE_P (desttype
))
8877 /* Check to see if the raw memory call is made by a non-static member
8878 function with THIS as the destination argument for the destination
8879 type. If so, and if the class has no non-trivial bases or members,
8880 be more permissive. */
8881 if (current_function_decl
8882 && DECL_NONSTATIC_MEMBER_FUNCTION_P (current_function_decl
)
8883 && is_this_parameter (tree_strip_nop_conversions (dest
)))
8885 tree ctx
= DECL_CONTEXT (current_function_decl
);
8886 bool special
= same_type_ignoring_top_level_qualifiers_p (ctx
, desttype
);
8887 tree binfo
= TYPE_BINFO (ctx
);
8890 && !BINFO_VTABLE (binfo
)
8891 && !first_non_trivial_field (desttype
))
8895 /* True if the class is trivial. */
8896 bool trivial
= trivial_type_p (desttype
);
8898 /* Set to true if DESTYPE has an accessible copy assignment. */
8899 bool hasassign
= false;
8900 /* True if all of the class' overloaded copy assignment operators
8901 are all trivial (and not deleted) and at least one of them is
8903 bool trivassign
= has_trivial_copy_assign_p (desttype
, true, &hasassign
);
8905 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8907 bool hasctors
[2] = { false, false };
8909 /* True if all of the class' overloaded copy constructors are all
8910 trivial (and not deleted) and at least one of them is accessible. */
8911 bool trivcopy
= has_trivial_copy_p (desttype
, true, hasctors
);
8913 /* Set FLD to the first private/protected member of the class. */
8914 tree fld
= trivial
? first_non_public_field (desttype
) : NULL_TREE
;
8916 /* The warning format string. */
8917 const char *warnfmt
= NULL
;
8918 /* A suggested alternative to offer instead of the raw memory call.
8919 Empty string when none can be come up with. */
8920 const char *suggest
= "";
8921 bool warned
= false;
8923 switch (DECL_FUNCTION_CODE (fndecl
))
8925 case BUILT_IN_MEMSET
:
8926 if (!integer_zerop (maybe_constant_value ((*args
)[1])))
8928 /* Diagnose setting non-copy-assignable or non-trivial types,
8929 or types with a private member, to (potentially) non-zero
8930 bytes. Since the value of the bytes being written is unknown,
8931 suggest using assignment instead (if one exists). Also warn
8932 for writes into objects for which zero-initialization doesn't
8933 mean all bits clear (pointer-to-member data, where null is all
8934 bits set). Since the value being written is (most likely)
8935 non-zero, simply suggest assignment (but not copy assignment). */
8936 suggest
= "; use assignment instead";
8938 warnfmt
= G_("%qD writing to an object of type %#qT with "
8939 "no trivial copy-assignment");
8941 warnfmt
= G_("%qD writing to an object of non-trivial type %#qT%s");
8944 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8945 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8946 "%qD writing to an object of type %#qT with "
8948 fndecl
, desttype
, access
, fld
);
8950 else if (!zero_init_p (desttype
))
8951 warnfmt
= G_("%qD writing to an object of type %#qT containing "
8952 "a pointer to data member%s");
8958 case BUILT_IN_BZERO
:
8959 /* Similarly to the above, diagnose clearing non-trivial or non-
8960 standard layout objects, or objects of types with no assignmenmt.
8961 Since the value being written is known to be zero, suggest either
8962 copy assignment, copy ctor, or default ctor as an alternative,
8963 depending on what's available. */
8965 if (hasassign
&& hasctors
[0])
8966 suggest
= G_("; use assignment or value-initialization instead");
8968 suggest
= G_("; use assignment instead");
8969 else if (hasctors
[0])
8970 suggest
= G_("; use value-initialization instead");
8973 warnfmt
= G_("%qD clearing an object of type %#qT with "
8974 "no trivial copy-assignment%s");
8976 warnfmt
= G_("%qD clearing an object of non-trivial type %#qT%s");
8977 else if (!zero_init_p (desttype
))
8978 warnfmt
= G_("%qD clearing an object of type %#qT containing "
8979 "a pointer-to-member%s");
8982 case BUILT_IN_BCOPY
:
8983 case BUILT_IN_MEMCPY
:
8984 case BUILT_IN_MEMMOVE
:
8985 case BUILT_IN_MEMPCPY
:
8986 /* Determine the type of the source object. */
8987 srctype
= TREE_TYPE ((*args
)[srcidx
]);
8988 if (!srctype
|| !INDIRECT_TYPE_P (srctype
))
8989 srctype
= void_type_node
;
8991 srctype
= TREE_TYPE (srctype
);
8993 /* Since it's impossible to determine wheter the byte copy is
8994 being used in place of assignment to an existing object or
8995 as a substitute for initialization, assume it's the former.
8996 Determine the best alternative to use instead depending on
8997 what's not deleted. */
8998 if (hasassign
&& hasctors
[1])
8999 suggest
= G_("; use copy-assignment or copy-initialization instead");
9001 suggest
= G_("; use copy-assignment instead");
9002 else if (hasctors
[1])
9003 suggest
= G_("; use copy-initialization instead");
9006 warnfmt
= G_("%qD writing to an object of type %#qT with no trivial "
9007 "copy-assignment%s");
9008 else if (!trivially_copyable_p (desttype
))
9009 warnfmt
= G_("%qD writing to an object of non-trivially copyable "
9012 warnfmt
= G_("%qD writing to an object with a deleted copy constructor");
9015 && !VOID_TYPE_P (srctype
)
9016 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
9017 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
9020 /* Warn when copying into a non-trivial object from an object
9021 of a different type other than void or char. */
9022 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9023 "%qD copying an object of non-trivial type "
9024 "%#qT from an array of %#qT",
9025 fndecl
, desttype
, srctype
);
9028 && !VOID_TYPE_P (srctype
)
9029 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
9030 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
9033 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
9034 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9035 "%qD copying an object of type %#qT with "
9036 "%qs member %qD from an array of %#qT; use "
9037 "assignment or copy-initialization instead",
9038 fndecl
, desttype
, access
, fld
, srctype
);
9040 else if (!trivial
&& vec_safe_length (args
) > 2)
9042 tree sz
= maybe_constant_value ((*args
)[2]);
9043 if (!tree_fits_uhwi_p (sz
))
9046 /* Finally, warn on partial copies. */
9047 unsigned HOST_WIDE_INT typesize
9048 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype
));
9049 if (unsigned HOST_WIDE_INT partial
= tree_to_uhwi (sz
) % typesize
)
9050 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9051 (typesize
- partial
> 1
9052 ? G_("%qD writing to an object of "
9053 "a non-trivial type %#qT leaves %wu "
9055 : G_("%qD writing to an object of "
9056 "a non-trivial type %#qT leaves %wu "
9058 fndecl
, desttype
, typesize
- partial
);
9062 case BUILT_IN_REALLOC
:
9064 if (!trivially_copyable_p (desttype
))
9065 warnfmt
= G_("%qD moving an object of non-trivially copyable type "
9066 "%#qT; use %<new%> and %<delete%> instead");
9068 warnfmt
= G_("%qD moving an object of type %#qT with deleted copy "
9069 "constructor; use %<new%> and %<delete%> instead");
9070 else if (!get_dtor (desttype
, tf_none
))
9071 warnfmt
= G_("%qD moving an object of type %#qT with deleted "
9075 tree sz
= maybe_constant_value ((*args
)[1]);
9076 if (TREE_CODE (sz
) == INTEGER_CST
9077 && tree_int_cst_lt (sz
, TYPE_SIZE_UNIT (desttype
)))
9078 /* Finally, warn on reallocation into insufficient space. */
9079 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9080 "%qD moving an object of non-trivial type "
9081 "%#qT and size %E into a region of size %E",
9082 fndecl
, desttype
, TYPE_SIZE_UNIT (desttype
),
9094 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9095 warnfmt
, fndecl
, desttype
, suggest
);
9097 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
9098 warnfmt
, fndecl
, desttype
);
9102 inform (location_of (desttype
), "%#qT declared here", desttype
);
9105 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
9106 This function performs no overload resolution, conversion, or other
9107 high-level operations. */
9110 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
9111 tsubst_flags_t complain
)
9115 /* Remember roughly where this call is. */
9116 location_t loc
= cp_expr_loc_or_loc (fn
, input_location
);
9117 fn
= build_call_a (fn
, nargs
, argarray
);
9118 SET_EXPR_LOCATION (fn
, loc
);
9120 fndecl
= get_callee_fndecl (fn
);
9122 /* Check that arguments to builtin functions match the expectations. */
9124 && !processing_template_decl
9125 && fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
9129 /* We need to take care that values to BUILT_IN_NORMAL
9131 for (i
= 0; i
< nargs
; i
++)
9132 argarray
[i
] = maybe_constant_value (argarray
[i
]);
9134 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
9136 return error_mark_node
;
9139 if (VOID_TYPE_P (TREE_TYPE (fn
)))
9142 /* 5.2.2/11: If a function call is a prvalue of object type: if the
9143 function call is either the operand of a decltype-specifier or the
9144 right operand of a comma operator that is the operand of a
9145 decltype-specifier, a temporary object is not introduced for the
9146 prvalue. The type of the prvalue may be incomplete. */
9147 if (!(complain
& tf_decltype
))
9149 fn
= require_complete_type_sfinae (fn
, complain
);
9150 if (fn
== error_mark_node
)
9151 return error_mark_node
;
9153 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
9155 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
9156 maybe_warn_parm_abi (TREE_TYPE (fn
), loc
);
9159 return convert_from_reference (fn
);
9162 /* Returns the value to use for the in-charge parameter when making a
9163 call to a function with the indicated NAME.
9165 FIXME:Can't we find a neater way to do this mapping? */
9168 in_charge_arg_for_name (tree name
)
9170 if (IDENTIFIER_CTOR_P (name
))
9172 if (name
== complete_ctor_identifier
)
9173 return integer_one_node
;
9174 gcc_checking_assert (name
== base_ctor_identifier
);
9178 if (name
== complete_dtor_identifier
)
9179 return integer_two_node
;
9180 else if (name
== deleting_dtor_identifier
)
9181 return integer_three_node
;
9182 gcc_checking_assert (name
== base_dtor_identifier
);
9185 return integer_zero_node
;
9188 /* We've built up a constructor call RET. Complain if it delegates to the
9189 constructor we're currently compiling. */
9192 check_self_delegation (tree ret
)
9194 if (TREE_CODE (ret
) == TARGET_EXPR
)
9195 ret
= TARGET_EXPR_INITIAL (ret
);
9196 tree fn
= cp_get_callee_fndecl_nofold (ret
);
9197 if (fn
&& DECL_ABSTRACT_ORIGIN (fn
) == current_function_decl
)
9198 error ("constructor delegates to itself");
9201 /* Build a call to a constructor, destructor, or an assignment
9202 operator for INSTANCE, an expression with class type. NAME
9203 indicates the special member function to call; *ARGS are the
9204 arguments. ARGS may be NULL. This may change ARGS. BINFO
9205 indicates the base of INSTANCE that is to be passed as the `this'
9206 parameter to the member function called.
9208 FLAGS are the LOOKUP_* flags to use when processing the call.
9210 If NAME indicates a complete object constructor, INSTANCE may be
9211 NULL_TREE. In this case, the caller will call build_cplus_new to
9212 store the newly constructed object into a VAR_DECL. */
9215 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
9216 tree binfo
, int flags
, tsubst_flags_t complain
)
9219 /* The type of the subobject to be constructed or destroyed. */
9221 vec
<tree
, va_gc
> *allocated
= NULL
;
9224 gcc_assert (IDENTIFIER_CDTOR_P (name
) || name
== assign_op_identifier
);
9226 if (error_operand_p (instance
))
9227 return error_mark_node
;
9229 if (IDENTIFIER_DTOR_P (name
))
9231 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
9232 if (!type_build_dtor_call (TREE_TYPE (instance
)))
9233 /* Shortcut to avoid lazy destructor declaration. */
9234 return build_trivial_dtor_call (instance
);
9239 /* Resolve the name. */
9240 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
9241 return error_mark_node
;
9243 binfo
= TYPE_BINFO (binfo
);
9246 gcc_assert (binfo
!= NULL_TREE
);
9248 class_type
= BINFO_TYPE (binfo
);
9250 /* Handle the special case where INSTANCE is NULL_TREE. */
9251 if (name
== complete_ctor_identifier
&& !instance
)
9252 instance
= build_dummy_object (class_type
);
9255 /* Convert to the base class, if necessary. */
9256 if (!same_type_ignoring_top_level_qualifiers_p
9257 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
9259 if (IDENTIFIER_CDTOR_P (name
))
9260 /* For constructors and destructors, either the base is
9261 non-virtual, or it is virtual but we are doing the
9262 conversion from a constructor or destructor for the
9263 complete object. In either case, we can convert
9265 instance
= convert_to_base_statically (instance
, binfo
);
9268 /* However, for assignment operators, we must convert
9269 dynamically if the base is virtual. */
9270 gcc_checking_assert (name
== assign_op_identifier
);
9271 instance
= build_base_path (PLUS_EXPR
, instance
,
9272 binfo
, /*nonnull=*/1, complain
);
9277 gcc_assert (instance
!= NULL_TREE
);
9279 /* In C++17, "If the initializer expression is a prvalue and the
9280 cv-unqualified version of the source type is the same class as the class
9281 of the destination, the initializer expression is used to initialize the
9282 destination object." Handle that here to avoid doing overload
9284 if (cxx_dialect
>= cxx17
9285 && args
&& vec_safe_length (*args
) == 1
9286 && name
== complete_ctor_identifier
)
9288 tree arg
= (**args
)[0];
9290 if (BRACE_ENCLOSED_INITIALIZER_P (arg
)
9291 && !TYPE_HAS_LIST_CTOR (class_type
)
9292 && CONSTRUCTOR_NELTS (arg
) == 1)
9293 arg
= CONSTRUCTOR_ELT (arg
, 0)->value
;
9295 if ((TREE_CODE (arg
) == TARGET_EXPR
9296 || TREE_CODE (arg
) == CONSTRUCTOR
)
9297 && (same_type_ignoring_top_level_qualifiers_p
9298 (class_type
, TREE_TYPE (arg
))))
9300 if (is_dummy_object (instance
))
9302 else if (TREE_CODE (arg
) == TARGET_EXPR
)
9303 TARGET_EXPR_DIRECT_INIT_P (arg
) = true;
9305 if ((complain
& tf_error
)
9306 && (flags
& LOOKUP_DELEGATING_CONS
))
9307 check_self_delegation (arg
);
9308 /* Avoid change of behavior on Wunused-var-2.C. */
9309 instance
= mark_lvalue_use (instance
);
9310 return build2 (INIT_EXPR
, class_type
, instance
, arg
);
9314 fns
= lookup_fnfields (binfo
, name
, 1);
9316 /* When making a call to a constructor or destructor for a subobject
9317 that uses virtual base classes, pass down a pointer to a VTT for
9319 if ((name
== base_ctor_identifier
9320 || name
== base_dtor_identifier
)
9321 && CLASSTYPE_VBASECLASSES (class_type
))
9326 /* If the current function is a complete object constructor
9327 or destructor, then we fetch the VTT directly.
9328 Otherwise, we look it up using the VTT we were given. */
9329 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
9330 vtt
= decay_conversion (vtt
, complain
);
9331 if (vtt
== error_mark_node
)
9332 return error_mark_node
;
9333 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
9334 if (BINFO_SUBVTT_INDEX (binfo
))
9335 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
9341 allocated
= make_tree_vector ();
9345 vec_safe_insert (*args
, 0, sub_vtt
);
9348 ret
= build_new_method_call (instance
, fns
, args
,
9349 TYPE_BINFO (BINFO_TYPE (binfo
)),
9353 if (allocated
!= NULL
)
9354 release_tree_vector (allocated
);
9356 if ((complain
& tf_error
)
9357 && (flags
& LOOKUP_DELEGATING_CONS
)
9358 && name
== complete_ctor_identifier
)
9359 check_self_delegation (ret
);
9364 /* Return the NAME, as a C string. The NAME indicates a function that
9365 is a member of TYPE. *FREE_P is set to true if the caller must
9366 free the memory returned.
9368 Rather than go through all of this, we should simply set the names
9369 of constructors and destructors appropriately, and dispense with
9370 ctor_identifier, dtor_identifier, etc. */
9373 name_as_c_string (tree name
, tree type
, bool *free_p
)
9375 const char *pretty_name
;
9377 /* Assume that we will not allocate memory. */
9379 /* Constructors and destructors are special. */
9380 if (IDENTIFIER_CDTOR_P (name
))
9383 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
)));
9384 /* For a destructor, add the '~'. */
9385 if (IDENTIFIER_DTOR_P (name
))
9387 pretty_name
= concat ("~", pretty_name
, NULL
);
9388 /* Remember that we need to free the memory allocated. */
9392 else if (IDENTIFIER_CONV_OP_P (name
))
9394 pretty_name
= concat ("operator ",
9395 type_as_string_translate (TREE_TYPE (name
),
9396 TFF_PLAIN_IDENTIFIER
),
9398 /* Remember that we need to free the memory allocated. */
9402 pretty_name
= identifier_to_locale (IDENTIFIER_POINTER (name
));
9404 return CONST_CAST (char *, pretty_name
);
9407 /* If CANDIDATES contains exactly one candidate, return it, otherwise
9410 static z_candidate
*
9411 single_z_candidate (z_candidate
*candidates
)
9413 if (candidates
== NULL
)
9416 if (candidates
->next
)
9422 /* If CANDIDATE is invalid due to a bad argument type, return the
9423 pertinent conversion_info.
9425 Otherwise, return NULL. */
9427 static const conversion_info
*
9428 maybe_get_bad_conversion_for_unmatched_call (const z_candidate
*candidate
)
9430 /* Must be an rr_arg_conversion or rr_bad_arg_conversion. */
9431 rejection_reason
*r
= candidate
->reason
;
9441 case rr_arg_conversion
:
9442 return &r
->u
.conversion
;
9444 case rr_bad_arg_conversion
:
9445 return &r
->u
.bad_conversion
;
9449 /* Issue an error and note complaining about a bad argument type at a
9450 callsite with a single candidate FNDECL.
9452 ARG_LOC is the location of the argument (or UNKNOWN_LOCATION, in which
9453 case input_location is used).
9454 FROM_TYPE is the type of the actual argument; TO_TYPE is the type of
9455 the formal parameter. */
9458 complain_about_bad_argument (location_t arg_loc
,
9459 tree from_type
, tree to_type
,
9460 tree fndecl
, int parmnum
)
9462 auto_diagnostic_group d
;
9463 range_label_for_type_mismatch
rhs_label (from_type
, to_type
);
9464 range_label
*label
= &rhs_label
;
9465 if (arg_loc
== UNKNOWN_LOCATION
)
9467 arg_loc
= input_location
;
9470 gcc_rich_location
richloc (arg_loc
, label
);
9472 "cannot convert %qH to %qI",
9473 from_type
, to_type
);
9474 maybe_inform_about_fndecl_for_bogus_argument_init (fndecl
,
9478 /* Subroutine of build_new_method_call_1, for where there are no viable
9479 candidates for the call. */
9482 complain_about_no_candidates_for_method_call (tree instance
,
9483 z_candidate
*candidates
,
9484 tree explicit_targs
,
9486 tree optype
, tree name
,
9487 bool skip_first_for_error
,
9488 vec
<tree
, va_gc
> *user_args
)
9490 auto_diagnostic_group d
;
9491 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
9492 cxx_incomplete_type_error (instance
, basetype
);
9494 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9495 basetype
, optype
, build_tree_list_vec (user_args
),
9496 TREE_TYPE (instance
));
9499 /* Special-case for when there's a single candidate that's failing
9500 due to a bad argument type. */
9501 if (z_candidate
*candidate
= single_z_candidate (candidates
))
9502 if (const conversion_info
*conv
9503 = maybe_get_bad_conversion_for_unmatched_call (candidate
))
9505 complain_about_bad_argument (conv
->loc
,
9506 conv
->from
, conv
->to_type
,
9507 candidate
->fn
, conv
->n_arg
);
9511 tree arglist
= build_tree_list_vec (user_args
);
9512 tree errname
= name
;
9513 bool twiddle
= false;
9514 if (IDENTIFIER_CDTOR_P (errname
))
9516 twiddle
= IDENTIFIER_DTOR_P (errname
);
9517 errname
= constructor_name (basetype
);
9520 errname
= lookup_template_function (errname
, explicit_targs
);
9521 if (skip_first_for_error
)
9522 arglist
= TREE_CHAIN (arglist
);
9523 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9524 basetype
, &"~"[!twiddle
], errname
, arglist
,
9525 TREE_TYPE (instance
));
9527 print_z_candidates (location_of (name
), candidates
);
9530 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
9531 be set, upon return, to the function called. ARGS may be NULL.
9532 This may change ARGS. */
9535 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9536 tree conversion_path
, int flags
,
9537 tree
*fn_p
, tsubst_flags_t complain
)
9539 struct z_candidate
*candidates
= 0, *cand
;
9540 tree explicit_targs
= NULL_TREE
;
9541 tree basetype
= NULL_TREE
;
9542 tree access_binfo
, binfo
;
9544 tree first_mem_arg
= NULL_TREE
;
9546 bool skip_first_for_error
;
9547 vec
<tree
, va_gc
> *user_args
;
9550 int template_only
= 0;
9554 vec
<tree
, va_gc
> *orig_args
= NULL
;
9557 gcc_assert (instance
!= NULL_TREE
);
9559 /* We don't know what function we're going to call, yet. */
9563 if (error_operand_p (instance
)
9564 || !fns
|| error_operand_p (fns
))
9565 return error_mark_node
;
9567 if (!BASELINK_P (fns
))
9569 if (complain
& tf_error
)
9570 error ("call to non-function %qD", fns
);
9571 return error_mark_node
;
9574 orig_instance
= instance
;
9577 /* Dismantle the baselink to collect all the information we need. */
9578 if (!conversion_path
)
9579 conversion_path
= BASELINK_BINFO (fns
);
9580 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
9581 binfo
= BASELINK_BINFO (fns
);
9582 optype
= BASELINK_OPTYPE (fns
);
9583 fns
= BASELINK_FUNCTIONS (fns
);
9584 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
9586 explicit_targs
= TREE_OPERAND (fns
, 1);
9587 fns
= TREE_OPERAND (fns
, 0);
9590 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
9591 || TREE_CODE (fns
) == TEMPLATE_DECL
9592 || TREE_CODE (fns
) == OVERLOAD
);
9593 fn
= OVL_FIRST (fns
);
9594 name
= DECL_NAME (fn
);
9596 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
9597 gcc_assert (CLASS_TYPE_P (basetype
));
9599 user_args
= args
== NULL
? NULL
: *args
;
9600 /* Under DR 147 A::A() is an invalid constructor call,
9601 not a functional cast. */
9602 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
9604 if (! (complain
& tf_error
))
9605 return error_mark_node
;
9607 basetype
= DECL_CONTEXT (fn
);
9608 name
= constructor_name (basetype
);
9609 auto_diagnostic_group d
;
9610 if (permerror (input_location
,
9611 "cannot call constructor %<%T::%D%> directly",
9613 inform (input_location
, "for a function-style cast, remove the "
9614 "redundant %<::%D%>", name
);
9615 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
9620 if (processing_template_decl
)
9622 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
9623 instance
= build_non_dependent_expr (instance
);
9625 make_args_non_dependent (*args
);
9628 /* Process the argument list. */
9629 if (args
!= NULL
&& *args
!= NULL
)
9631 *args
= resolve_args (*args
, complain
);
9633 return error_mark_node
;
9637 /* Consider the object argument to be used even if we end up selecting a
9638 static member function. */
9639 instance
= mark_type_use (instance
);
9641 /* Figure out whether to skip the first argument for the error
9642 message we will display to users if an error occurs. We don't
9643 want to display any compiler-generated arguments. The "this"
9644 pointer hasn't been added yet. However, we must remove the VTT
9645 pointer if this is a call to a base-class constructor or
9647 skip_first_for_error
= false;
9648 if (IDENTIFIER_CDTOR_P (name
))
9650 /* Callers should explicitly indicate whether they want to ctor
9651 the complete object or just the part without virtual bases. */
9652 gcc_assert (name
!= ctor_identifier
);
9654 /* Remove the VTT pointer, if present. */
9655 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
9656 && CLASSTYPE_VBASECLASSES (basetype
))
9657 skip_first_for_error
= true;
9659 /* It's OK to call destructors and constructors on cv-qualified
9660 objects. Therefore, convert the INSTANCE to the unqualified
9661 type, if necessary. */
9662 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
9664 instance
= build_this (instance
);
9665 instance
= build_nop (build_pointer_type (basetype
), instance
);
9666 instance
= build_fold_indirect_ref (instance
);
9670 gcc_assert (!DECL_DESTRUCTOR_P (fn
) && !DECL_CONSTRUCTOR_P (fn
));
9672 /* For the overload resolution we need to find the actual `this`
9673 that would be captured if the call turns out to be to a
9674 non-static member function. Do not actually capture it at this
9676 if (DECL_CONSTRUCTOR_P (fn
))
9677 /* Constructors don't use the enclosing 'this'. */
9678 first_mem_arg
= instance
;
9680 first_mem_arg
= maybe_resolve_dummy (instance
, false);
9682 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9683 p
= conversion_obstack_alloc (0);
9685 /* The number of arguments artificial parms in ARGS; we subtract one because
9686 there's no 'this' in ARGS. */
9687 unsigned skip
= num_artificial_parms_for (fn
) - 1;
9689 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9690 initializer, not T({ }). */
9691 if (DECL_CONSTRUCTOR_P (fn
)
9692 && vec_safe_length (user_args
) > skip
9693 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
9695 tree init_list
= (*user_args
)[skip
];
9696 tree init
= NULL_TREE
;
9698 gcc_assert (user_args
->length () == skip
+ 1
9699 && !(flags
& LOOKUP_ONLYCONVERTING
));
9701 /* If the initializer list has no elements and T is a class type with
9702 a default constructor, the object is value-initialized. Handle
9703 this here so we don't need to handle it wherever we use
9704 build_special_member_call. */
9705 if (CONSTRUCTOR_NELTS (init_list
) == 0
9706 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
9707 /* For a user-provided default constructor, use the normal
9708 mechanisms so that protected access works. */
9709 && type_has_non_user_provided_default_constructor (basetype
)
9710 && !processing_template_decl
)
9711 init
= build_value_init (basetype
, complain
);
9713 /* If BASETYPE is an aggregate, we need to do aggregate
9715 else if (CP_AGGREGATE_TYPE_P (basetype
))
9717 init
= reshape_init (basetype
, init_list
, complain
);
9718 init
= digest_init (basetype
, init
, complain
);
9723 if (is_dummy_object (instance
))
9724 return get_target_expr_sfinae (init
, complain
);
9725 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
9726 TREE_SIDE_EFFECTS (init
) = true;
9730 /* Otherwise go ahead with overload resolution. */
9731 add_list_candidates (fns
, first_mem_arg
, user_args
,
9732 basetype
, explicit_targs
, template_only
,
9733 conversion_path
, access_binfo
, flags
,
9734 &candidates
, complain
);
9737 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
9738 explicit_targs
, template_only
, conversion_path
,
9739 access_binfo
, flags
, &candidates
, complain
);
9741 any_viable_p
= false;
9742 candidates
= splice_viable (candidates
, false, &any_viable_p
);
9746 if (complain
& tf_error
)
9747 complain_about_no_candidates_for_method_call (instance
, candidates
,
9748 explicit_targs
, basetype
,
9750 skip_first_for_error
,
9752 call
= error_mark_node
;
9756 cand
= tourney (candidates
, complain
);
9763 if (complain
& tf_error
)
9765 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
9766 arglist
= build_tree_list_vec (user_args
);
9767 if (skip_first_for_error
)
9768 arglist
= TREE_CHAIN (arglist
);
9769 auto_diagnostic_group d
;
9770 if (!any_strictly_viable (candidates
))
9771 error ("no matching function for call to %<%s(%A)%>",
9772 pretty_name
, arglist
);
9774 error ("call of overloaded %<%s(%A)%> is ambiguous",
9775 pretty_name
, arglist
);
9776 print_z_candidates (location_of (name
), candidates
);
9780 call
= error_mark_node
;
9787 if (!(flags
& LOOKUP_NONVIRTUAL
)
9788 && DECL_PURE_VIRTUAL_P (fn
)
9789 && instance
== current_class_ref
9790 && (complain
& tf_warning
))
9792 /* This is not an error, it is runtime undefined
9794 if (!current_function_decl
)
9795 warning (0, "pure virtual %q#D called from "
9796 "non-static data member initializer", fn
);
9797 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
9798 || DECL_DESTRUCTOR_P (current_function_decl
))
9799 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
9800 ? G_("pure virtual %q#D called from constructor")
9801 : G_("pure virtual %q#D called from destructor")),
9805 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
9806 && !DECL_CONSTRUCTOR_P (fn
)
9807 && is_dummy_object (instance
))
9809 instance
= maybe_resolve_dummy (instance
, true);
9810 if (instance
== error_mark_node
)
9811 call
= error_mark_node
;
9812 else if (!is_dummy_object (instance
))
9814 /* We captured 'this' in the current lambda now that
9815 we know we really need it. */
9816 cand
->first_arg
= instance
;
9818 else if (any_dependent_bases_p ())
9819 /* We can't tell until instantiation time whether we can use
9820 *this as the implicit object argument. */;
9823 if (complain
& tf_error
)
9824 error ("cannot call member function %qD without object",
9826 call
= error_mark_node
;
9830 if (call
!= error_mark_node
)
9832 /* Optimize away vtable lookup if we know that this
9833 function can't be overridden. We need to check if
9834 the context and the type where we found fn are the same,
9835 actually FN might be defined in a different class
9836 type because of a using-declaration. In this case, we
9837 do not want to perform a non-virtual call. */
9838 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
9839 && same_type_ignoring_top_level_qualifiers_p
9840 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
9841 && resolves_to_fixed_type_p (instance
, 0))
9842 flags
|= LOOKUP_NONVIRTUAL
;
9844 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
9845 /* Now we know what function is being called. */
9848 /* Build the actual CALL_EXPR. */
9849 call
= build_over_call (cand
, flags
, complain
);
9850 /* In an expression of the form `a->f()' where `f' turns
9851 out to be a static member function, `a' is
9852 none-the-less evaluated. */
9853 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
9854 && !is_dummy_object (instance
)
9855 && TREE_SIDE_EFFECTS (instance
))
9857 /* But avoid the implicit lvalue-rvalue conversion when 'a'
9860 if (TREE_THIS_VOLATILE (a
))
9862 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
), a
, call
);
9864 else if (call
!= error_mark_node
9865 && DECL_DESTRUCTOR_P (cand
->fn
)
9866 && !VOID_TYPE_P (TREE_TYPE (call
)))
9867 /* An explicit call of the form "x->~X()" has type
9868 "void". However, on platforms where destructors
9869 return "this" (i.e., those where
9870 targetm.cxx.cdtor_returns_this is true), such calls
9871 will appear to have a return value of pointer type
9872 to the low-level call machinery. We do not want to
9873 change the low-level machinery, since we want to be
9874 able to optimize "delete f()" on such platforms as
9875 "operator delete(~X(f()))" (rather than generating
9876 "t = f(), ~X(t), operator delete (t)"). */
9877 call
= build_nop (void_type_node
, call
);
9882 if (processing_template_decl
&& call
!= error_mark_node
)
9884 bool cast_to_void
= false;
9886 if (TREE_CODE (call
) == COMPOUND_EXPR
)
9887 call
= TREE_OPERAND (call
, 1);
9888 else if (TREE_CODE (call
) == NOP_EXPR
)
9890 cast_to_void
= true;
9891 call
= TREE_OPERAND (call
, 0);
9893 if (INDIRECT_REF_P (call
))
9894 call
= TREE_OPERAND (call
, 0);
9895 call
= (build_min_non_dep_call_vec
9897 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
9898 orig_instance
, orig_fns
, NULL_TREE
),
9900 SET_EXPR_LOCATION (call
, input_location
);
9901 call
= convert_from_reference (call
);
9903 call
= build_nop (void_type_node
, call
);
9906 /* Free all the conversions we allocated. */
9907 obstack_free (&conversion_obstack
, p
);
9909 if (orig_args
!= NULL
)
9910 release_tree_vector (orig_args
);
9915 /* Wrapper for above. */
9918 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9919 tree conversion_path
, int flags
,
9920 tree
*fn_p
, tsubst_flags_t complain
)
9923 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
9924 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
9926 timevar_cond_stop (TV_OVERLOAD
, subtime
);
9930 /* Returns true iff standard conversion sequence ICS1 is a proper
9931 subsequence of ICS2. */
9934 is_subseq (conversion
*ics1
, conversion
*ics2
)
9936 /* We can assume that a conversion of the same code
9937 between the same types indicates a subsequence since we only get
9938 here if the types we are converting from are the same. */
9940 while (ics1
->kind
== ck_rvalue
9941 || ics1
->kind
== ck_lvalue
)
9942 ics1
= next_conversion (ics1
);
9946 while (ics2
->kind
== ck_rvalue
9947 || ics2
->kind
== ck_lvalue
)
9948 ics2
= next_conversion (ics2
);
9950 if (ics2
->kind
== ck_user
9951 || ics2
->kind
== ck_ambig
9952 || ics2
->kind
== ck_aggr
9953 || ics2
->kind
== ck_list
9954 || ics2
->kind
== ck_identity
)
9955 /* At this point, ICS1 cannot be a proper subsequence of
9956 ICS2. We can get a USER_CONV when we are comparing the
9957 second standard conversion sequence of two user conversion
9961 ics2
= next_conversion (ics2
);
9963 while (ics2
->kind
== ck_rvalue
9964 || ics2
->kind
== ck_lvalue
)
9965 ics2
= next_conversion (ics2
);
9967 if (ics2
->kind
== ics1
->kind
9968 && same_type_p (ics2
->type
, ics1
->type
)
9969 && (ics1
->kind
== ck_identity
9970 || same_type_p (next_conversion (ics2
)->type
,
9971 next_conversion (ics1
)->type
)))
9976 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9977 be any _TYPE nodes. */
9980 is_properly_derived_from (tree derived
, tree base
)
9982 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
9985 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9986 considers every class derived from itself. */
9987 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
9988 && DERIVED_FROM_P (base
, derived
));
9991 /* We build the ICS for an implicit object parameter as a pointer
9992 conversion sequence. However, such a sequence should be compared
9993 as if it were a reference conversion sequence. If ICS is the
9994 implicit conversion sequence for an implicit object parameter,
9995 modify it accordingly. */
9998 maybe_handle_implicit_object (conversion
**ics
)
10000 if ((*ics
)->this_p
)
10002 /* [over.match.funcs]
10004 For non-static member functions, the type of the
10005 implicit object parameter is "reference to cv X"
10006 where X is the class of which the function is a
10007 member and cv is the cv-qualification on the member
10008 function declaration. */
10009 conversion
*t
= *ics
;
10010 tree reference_type
;
10012 /* The `this' parameter is a pointer to a class type. Make the
10013 implicit conversion talk about a reference to that same class
10015 reference_type
= TREE_TYPE (t
->type
);
10016 reference_type
= build_reference_type (reference_type
);
10018 if (t
->kind
== ck_qual
)
10019 t
= next_conversion (t
);
10020 if (t
->kind
== ck_ptr
)
10021 t
= next_conversion (t
);
10022 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
10023 t
= direct_reference_binding (reference_type
, t
);
10025 t
->rvaluedness_matches_p
= 0;
10030 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
10031 and return the initial reference binding conversion. Otherwise,
10032 leave *ICS unchanged and return NULL. */
10034 static conversion
*
10035 maybe_handle_ref_bind (conversion
**ics
)
10037 if ((*ics
)->kind
== ck_ref_bind
)
10039 conversion
*old_ics
= *ics
;
10040 *ics
= next_conversion (old_ics
);
10041 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
10048 /* Compare two implicit conversion sequences according to the rules set out in
10049 [over.ics.rank]. Return values:
10051 1: ics1 is better than ics2
10052 -1: ics2 is better than ics1
10053 0: ics1 and ics2 are indistinguishable */
10056 compare_ics (conversion
*ics1
, conversion
*ics2
)
10062 tree deref_from_type1
= NULL_TREE
;
10063 tree deref_from_type2
= NULL_TREE
;
10064 tree deref_to_type1
= NULL_TREE
;
10065 tree deref_to_type2
= NULL_TREE
;
10066 conversion_rank rank1
, rank2
;
10068 /* REF_BINDING is nonzero if the result of the conversion sequence
10069 is a reference type. In that case REF_CONV is the reference
10070 binding conversion. */
10071 conversion
*ref_conv1
;
10072 conversion
*ref_conv2
;
10074 /* Compare badness before stripping the reference conversion. */
10075 if (ics1
->bad_p
> ics2
->bad_p
)
10077 else if (ics1
->bad_p
< ics2
->bad_p
)
10080 /* Handle implicit object parameters. */
10081 maybe_handle_implicit_object (&ics1
);
10082 maybe_handle_implicit_object (&ics2
);
10084 /* Handle reference parameters. */
10085 ref_conv1
= maybe_handle_ref_bind (&ics1
);
10086 ref_conv2
= maybe_handle_ref_bind (&ics2
);
10088 /* List-initialization sequence L1 is a better conversion sequence than
10089 list-initialization sequence L2 if L1 converts to
10090 std::initializer_list<X> for some X and L2 does not. */
10091 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
10093 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
10098 When comparing the basic forms of implicit conversion sequences (as
10099 defined in _over.best.ics_)
10101 --a standard conversion sequence (_over.ics.scs_) is a better
10102 conversion sequence than a user-defined conversion sequence
10103 or an ellipsis conversion sequence, and
10105 --a user-defined conversion sequence (_over.ics.user_) is a
10106 better conversion sequence than an ellipsis conversion sequence
10107 (_over.ics.ellipsis_). */
10108 /* Use BAD_CONVERSION_RANK because we already checked for a badness
10109 mismatch. If both ICS are bad, we try to make a decision based on
10110 what would have happened if they'd been good. This is not an
10111 extension, we'll still give an error when we build up the call; this
10112 just helps us give a more helpful error message. */
10113 rank1
= BAD_CONVERSION_RANK (ics1
);
10114 rank2
= BAD_CONVERSION_RANK (ics2
);
10118 else if (rank1
< rank2
)
10121 if (ics1
->ellipsis_p
)
10122 /* Both conversions are ellipsis conversions. */
10125 /* User-defined conversion sequence U1 is a better conversion sequence
10126 than another user-defined conversion sequence U2 if they contain the
10127 same user-defined conversion operator or constructor and if the sec-
10128 ond standard conversion sequence of U1 is better than the second
10129 standard conversion sequence of U2. */
10131 /* Handle list-conversion with the same code even though it isn't always
10132 ranked as a user-defined conversion and it doesn't have a second
10133 standard conversion sequence; it will still have the desired effect.
10134 Specifically, we need to do the reference binding comparison at the
10135 end of this function. */
10137 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
10138 || ics1
->kind
== ck_aggr
|| ics2
->kind
== ck_aggr
)
10143 for (t1
= ics1
; t1
&& t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
10144 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
10145 || t1
->kind
== ck_list
)
10147 for (t2
= ics2
; t2
&& t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
10148 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
10149 || t2
->kind
== ck_list
)
10152 if (!t1
|| !t2
|| t1
->kind
!= t2
->kind
)
10154 else if (t1
->kind
== ck_user
)
10156 tree f1
= t1
->cand
? t1
->cand
->fn
: t1
->type
;
10157 tree f2
= t2
->cand
? t2
->cand
->fn
: t2
->type
;
10163 /* For ambiguous or aggregate conversions, use the target type as
10164 a proxy for the conversion function. */
10165 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
10169 /* We can just fall through here, after setting up
10170 FROM_TYPE1 and FROM_TYPE2. */
10171 from_type1
= t1
->type
;
10172 from_type2
= t2
->type
;
10179 /* We're dealing with two standard conversion sequences.
10183 Standard conversion sequence S1 is a better conversion
10184 sequence than standard conversion sequence S2 if
10186 --S1 is a proper subsequence of S2 (comparing the conversion
10187 sequences in the canonical form defined by _over.ics.scs_,
10188 excluding any Lvalue Transformation; the identity
10189 conversion sequence is considered to be a subsequence of
10190 any non-identity conversion sequence */
10193 while (t1
->kind
!= ck_identity
)
10194 t1
= next_conversion (t1
);
10195 from_type1
= t1
->type
;
10198 while (t2
->kind
!= ck_identity
)
10199 t2
= next_conversion (t2
);
10200 from_type2
= t2
->type
;
10203 /* One sequence can only be a subsequence of the other if they start with
10204 the same type. They can start with different types when comparing the
10205 second standard conversion sequence in two user-defined conversion
10207 if (same_type_p (from_type1
, from_type2
))
10209 if (is_subseq (ics1
, ics2
))
10211 if (is_subseq (ics2
, ics1
))
10219 --the rank of S1 is better than the rank of S2 (by the rules
10222 Standard conversion sequences are ordered by their ranks: an Exact
10223 Match is a better conversion than a Promotion, which is a better
10224 conversion than a Conversion.
10226 Two conversion sequences with the same rank are indistinguishable
10227 unless one of the following rules applies:
10229 --A conversion that does not a convert a pointer, pointer to member,
10230 or std::nullptr_t to bool is better than one that does.
10232 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
10233 so that we do not have to check it explicitly. */
10234 if (ics1
->rank
< ics2
->rank
)
10236 else if (ics2
->rank
< ics1
->rank
)
10239 to_type1
= ics1
->type
;
10240 to_type2
= ics2
->type
;
10242 /* A conversion from scalar arithmetic type to complex is worse than a
10243 conversion between scalar arithmetic types. */
10244 if (same_type_p (from_type1
, from_type2
)
10245 && ARITHMETIC_TYPE_P (from_type1
)
10246 && ARITHMETIC_TYPE_P (to_type1
)
10247 && ARITHMETIC_TYPE_P (to_type2
)
10248 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
10249 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
10251 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
10257 if (TYPE_PTR_P (from_type1
)
10258 && TYPE_PTR_P (from_type2
)
10259 && TYPE_PTR_P (to_type1
)
10260 && TYPE_PTR_P (to_type2
))
10262 deref_from_type1
= TREE_TYPE (from_type1
);
10263 deref_from_type2
= TREE_TYPE (from_type2
);
10264 deref_to_type1
= TREE_TYPE (to_type1
);
10265 deref_to_type2
= TREE_TYPE (to_type2
);
10267 /* The rules for pointers to members A::* are just like the rules
10268 for pointers A*, except opposite: if B is derived from A then
10269 A::* converts to B::*, not vice versa. For that reason, we
10270 switch the from_ and to_ variables here. */
10271 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
10272 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
10273 || (TYPE_PTRMEMFUNC_P (from_type1
)
10274 && TYPE_PTRMEMFUNC_P (from_type2
)
10275 && TYPE_PTRMEMFUNC_P (to_type1
)
10276 && TYPE_PTRMEMFUNC_P (to_type2
)))
10278 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
10279 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
10280 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
10281 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
10284 if (deref_from_type1
!= NULL_TREE
10285 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
10286 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
10288 /* This was one of the pointer or pointer-like conversions.
10292 --If class B is derived directly or indirectly from class A,
10293 conversion of B* to A* is better than conversion of B* to
10294 void*, and conversion of A* to void* is better than
10295 conversion of B* to void*. */
10296 if (VOID_TYPE_P (deref_to_type1
)
10297 && VOID_TYPE_P (deref_to_type2
))
10299 if (is_properly_derived_from (deref_from_type1
,
10302 else if (is_properly_derived_from (deref_from_type2
,
10306 else if (VOID_TYPE_P (deref_to_type1
)
10307 || VOID_TYPE_P (deref_to_type2
))
10309 if (same_type_p (deref_from_type1
, deref_from_type2
))
10311 if (VOID_TYPE_P (deref_to_type2
))
10313 if (is_properly_derived_from (deref_from_type1
,
10317 /* We know that DEREF_TO_TYPE1 is `void' here. */
10318 else if (is_properly_derived_from (deref_from_type1
,
10323 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
10324 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
10328 --If class B is derived directly or indirectly from class A
10329 and class C is derived directly or indirectly from B,
10331 --conversion of C* to B* is better than conversion of C* to
10334 --conversion of B* to A* is better than conversion of C* to
10336 if (same_type_p (deref_from_type1
, deref_from_type2
))
10338 if (is_properly_derived_from (deref_to_type1
,
10341 else if (is_properly_derived_from (deref_to_type2
,
10345 else if (same_type_p (deref_to_type1
, deref_to_type2
))
10347 if (is_properly_derived_from (deref_from_type2
,
10350 else if (is_properly_derived_from (deref_from_type1
,
10356 else if (CLASS_TYPE_P (non_reference (from_type1
))
10357 && same_type_p (from_type1
, from_type2
))
10359 tree from
= non_reference (from_type1
);
10363 --binding of an expression of type C to a reference of type
10364 B& is better than binding an expression of type C to a
10365 reference of type A&
10367 --conversion of C to B is better than conversion of C to A, */
10368 if (is_properly_derived_from (from
, to_type1
)
10369 && is_properly_derived_from (from
, to_type2
))
10371 if (is_properly_derived_from (to_type1
, to_type2
))
10373 else if (is_properly_derived_from (to_type2
, to_type1
))
10377 else if (CLASS_TYPE_P (non_reference (to_type1
))
10378 && same_type_p (to_type1
, to_type2
))
10380 tree to
= non_reference (to_type1
);
10384 --binding of an expression of type B to a reference of type
10385 A& is better than binding an expression of type C to a
10386 reference of type A&,
10388 --conversion of B to A is better than conversion of C to A */
10389 if (is_properly_derived_from (from_type1
, to
)
10390 && is_properly_derived_from (from_type2
, to
))
10392 if (is_properly_derived_from (from_type2
, from_type1
))
10394 else if (is_properly_derived_from (from_type1
, from_type2
))
10401 --S1 and S2 differ only in their qualification conversion and yield
10402 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
10403 qualification signature of type T1 is a proper subset of the cv-
10404 qualification signature of type T2 */
10405 if (ics1
->kind
== ck_qual
10406 && ics2
->kind
== ck_qual
10407 && same_type_p (from_type1
, from_type2
))
10409 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
10416 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
10417 to an implicit object parameter of a non-static member function
10418 declared without a ref-qualifier, and either S1 binds an lvalue
10419 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
10420 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
10421 draft standard, 13.3.3.2)
10423 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
10424 types to which the references refer are the same type except for
10425 top-level cv-qualifiers, and the type to which the reference
10426 initialized by S2 refers is more cv-qualified than the type to
10427 which the reference initialized by S1 refers.
10429 DR 1328 [over.match.best]: the context is an initialization by
10430 conversion function for direct reference binding (13.3.1.6) of a
10431 reference to function type, the return type of F1 is the same kind of
10432 reference (i.e. lvalue or rvalue) as the reference being initialized,
10433 and the return type of F2 is not. */
10435 if (ref_conv1
&& ref_conv2
)
10437 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
10438 && (ref_conv1
->rvaluedness_matches_p
10439 != ref_conv2
->rvaluedness_matches_p
)
10440 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
10441 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
10442 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
10444 if (ref_conv1
->bad_p
10445 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
10446 TREE_TYPE (ref_conv2
->type
)))
10447 /* Don't prefer a bad conversion that drops cv-quals to a bad
10448 conversion with the wrong rvalueness. */
10450 return (ref_conv1
->rvaluedness_matches_p
10451 - ref_conv2
->rvaluedness_matches_p
);
10454 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
10456 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
10457 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
10458 if (ref_conv1
->bad_p
)
10460 /* Prefer the one that drops fewer cv-quals. */
10461 tree ftype
= next_conversion (ref_conv1
)->type
;
10462 int fquals
= cp_type_quals (ftype
);
10466 return comp_cv_qualification (q2
, q1
);
10470 /* Neither conversion sequence is better than the other. */
10474 /* The source type for this standard conversion sequence. */
10477 source_type (conversion
*t
)
10479 for (;; t
= next_conversion (t
))
10481 if (t
->kind
== ck_user
10482 || t
->kind
== ck_ambig
10483 || t
->kind
== ck_identity
)
10486 gcc_unreachable ();
10489 /* Note a warning about preferring WINNER to LOSER. We do this by storing
10490 a pointer to LOSER and re-running joust to produce the warning if WINNER
10491 is actually used. */
10494 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
10496 candidate_warning
*cw
= (candidate_warning
*)
10497 conversion_obstack_alloc (sizeof (candidate_warning
));
10499 cw
->next
= winner
->warnings
;
10500 winner
->warnings
= cw
;
10503 /* Compare two candidates for overloading as described in
10504 [over.match.best]. Return values:
10506 1: cand1 is better than cand2
10507 -1: cand2 is better than cand1
10508 0: cand1 and cand2 are indistinguishable */
10511 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
10512 tsubst_flags_t complain
)
10515 int off1
= 0, off2
= 0;
10519 /* Candidates that involve bad conversions are always worse than those
10521 if (cand1
->viable
> cand2
->viable
)
10523 if (cand1
->viable
< cand2
->viable
)
10526 /* If we have two pseudo-candidates for conversions to the same type,
10527 or two candidates for the same function, arbitrarily pick one. */
10528 if (cand1
->fn
== cand2
->fn
10529 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
10532 /* Prefer a non-deleted function over an implicitly deleted move
10533 constructor or assignment operator. This differs slightly from the
10534 wording for issue 1402 (which says the move op is ignored by overload
10535 resolution), but this way produces better error messages. */
10536 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10537 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10538 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
10540 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
10541 && move_fn_p (cand1
->fn
))
10543 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
10544 && move_fn_p (cand2
->fn
))
10548 /* a viable function F1
10549 is defined to be a better function than another viable function F2 if
10550 for all arguments i, ICSi(F1) is not a worse conversion sequence than
10551 ICSi(F2), and then */
10553 /* for some argument j, ICSj(F1) is a better conversion sequence than
10556 /* For comparing static and non-static member functions, we ignore
10557 the implicit object parameter of the non-static function. The
10558 standard says to pretend that the static function has an object
10559 parm, but that won't work with operator overloading. */
10560 len
= cand1
->num_convs
;
10561 if (len
!= cand2
->num_convs
)
10563 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
10564 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
10566 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
10567 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
10568 /* We're comparing a near-match list constructor and a near-match
10569 non-list constructor. Just treat them as unordered. */
10572 gcc_assert (static_1
!= static_2
);
10583 for (i
= 0; i
< len
; ++i
)
10585 conversion
*t1
= cand1
->convs
[i
+ off1
];
10586 conversion
*t2
= cand2
->convs
[i
+ off2
];
10587 int comp
= compare_ics (t1
, t2
);
10591 if ((complain
& tf_warning
)
10593 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
10594 == cr_std
+ cr_promotion
)
10595 && t1
->kind
== ck_std
10596 && t2
->kind
== ck_std
10597 && TREE_CODE (t1
->type
) == INTEGER_TYPE
10598 && TREE_CODE (t2
->type
) == INTEGER_TYPE
10599 && (TYPE_PRECISION (t1
->type
)
10600 == TYPE_PRECISION (t2
->type
))
10601 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
10602 || (TREE_CODE (next_conversion (t1
)->type
)
10603 == ENUMERAL_TYPE
)))
10605 tree type
= next_conversion (t1
)->type
;
10607 struct z_candidate
*w
, *l
;
10609 type1
= t1
->type
, type2
= t2
->type
,
10610 w
= cand1
, l
= cand2
;
10612 type1
= t2
->type
, type2
= t1
->type
,
10613 w
= cand2
, l
= cand1
;
10617 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
10618 type
, type1
, type2
);
10619 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
10622 add_warning (w
, l
);
10625 if (winner
&& comp
!= winner
)
10634 /* warn about confusing overload resolution for user-defined conversions,
10635 either between a constructor and a conversion op, or between two
10637 if ((complain
& tf_warning
)
10638 && winner
&& warn_conversion
&& cand1
->second_conv
10639 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
10640 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
10642 struct z_candidate
*w
, *l
;
10643 bool give_warning
= false;
10646 w
= cand1
, l
= cand2
;
10648 w
= cand2
, l
= cand1
;
10650 /* We don't want to complain about `X::operator T1 ()'
10651 beating `X::operator T2 () const', when T2 is a no less
10652 cv-qualified version of T1. */
10653 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
10654 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
10656 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
10657 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
10659 if (TREE_CODE (t
) == TREE_CODE (f
) && INDIRECT_TYPE_P (t
))
10664 if (!comp_ptr_ttypes (t
, f
))
10665 give_warning
= true;
10668 give_warning
= true;
10674 tree source
= source_type (w
->convs
[0]);
10675 if (INDIRECT_TYPE_P (source
))
10676 source
= TREE_TYPE (source
);
10677 auto_diagnostic_group d
;
10678 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
10679 && warning (OPT_Wconversion
, " for conversion from %qH to %qI",
10680 source
, w
->second_conv
->type
))
10682 inform (input_location
, " because conversion sequence for the argument is better");
10686 add_warning (w
, l
);
10692 /* DR 495 moved this tiebreaker above the template ones. */
10693 /* or, if not that,
10694 the context is an initialization by user-defined conversion (see
10695 _dcl.init_ and _over.match.user_) and the standard conversion
10696 sequence from the return type of F1 to the destination type (i.e.,
10697 the type of the entity being initialized) is a better conversion
10698 sequence than the standard conversion sequence from the return type
10699 of F2 to the destination type. */
10701 if (cand1
->second_conv
)
10703 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
10708 /* or, if not that,
10709 F1 is a non-template function and F2 is a template function
10712 if (!cand1
->template_decl
&& cand2
->template_decl
)
10714 else if (cand1
->template_decl
&& !cand2
->template_decl
)
10717 /* or, if not that,
10718 F1 and F2 are template functions and the function template for F1 is
10719 more specialized than the template for F2 according to the partial
10722 if (cand1
->template_decl
&& cand2
->template_decl
)
10724 winner
= more_specialized_fn
10725 (TI_TEMPLATE (cand1
->template_decl
),
10726 TI_TEMPLATE (cand2
->template_decl
),
10727 /* [temp.func.order]: The presence of unused ellipsis and default
10728 arguments has no effect on the partial ordering of function
10729 templates. add_function_candidate() will not have
10730 counted the "this" argument for constructors. */
10731 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
10737 // or, if not that, F1 is more constrained than F2.
10738 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
10740 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
10745 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10746 if (deduction_guide_p (cand1
->fn
))
10748 gcc_assert (deduction_guide_p (cand2
->fn
));
10749 /* We distinguish between candidates from an explicit deduction guide and
10750 candidates built from a constructor based on DECL_ARTIFICIAL. */
10751 int art1
= DECL_ARTIFICIAL (cand1
->fn
);
10752 int art2
= DECL_ARTIFICIAL (cand2
->fn
);
10754 return art2
- art1
;
10758 /* Prefer the special copy guide over a declared copy/move
10760 if (copy_guide_p (cand1
->fn
))
10762 if (copy_guide_p (cand2
->fn
))
10765 /* Prefer a candidate generated from a non-template constructor. */
10766 int tg1
= template_guide_p (cand1
->fn
);
10767 int tg2
= template_guide_p (cand2
->fn
);
10773 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10774 for all arguments the corresponding parameters of F1 and F2 have the same
10775 type (CWG 2273/2277). */
10776 if (DECL_P (cand1
->fn
) && DECL_CLASS_SCOPE_P (cand1
->fn
)
10777 && !DECL_CONV_FN_P (cand1
->fn
)
10778 && DECL_P (cand2
->fn
) && DECL_CLASS_SCOPE_P (cand2
->fn
)
10779 && !DECL_CONV_FN_P (cand2
->fn
))
10781 tree base1
= DECL_CONTEXT (strip_inheriting_ctors (cand1
->fn
));
10782 tree base2
= DECL_CONTEXT (strip_inheriting_ctors (cand2
->fn
));
10784 bool used1
= false;
10785 bool used2
= false;
10786 if (base1
== base2
)
10787 /* No difference. */;
10788 else if (DERIVED_FROM_P (base1
, base2
))
10790 else if (DERIVED_FROM_P (base2
, base1
))
10793 if (int diff
= used2
- used1
)
10795 for (i
= 0; i
< len
; ++i
)
10797 conversion
*t1
= cand1
->convs
[i
+ off1
];
10798 conversion
*t2
= cand2
->convs
[i
+ off2
];
10799 if (!same_type_p (t1
->type
, t2
->type
))
10807 /* Check whether we can discard a builtin candidate, either because we
10808 have two identical ones or matching builtin and non-builtin candidates.
10810 (Pedantically in the latter case the builtin which matched the user
10811 function should not be added to the overload set, but we spot it here.
10814 ... the builtin candidates include ...
10815 - do not have the same parameter type list as any non-template
10816 non-member candidate. */
10818 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
10820 for (i
= 0; i
< len
; ++i
)
10821 if (!same_type_p (cand1
->convs
[i
]->type
,
10822 cand2
->convs
[i
]->type
))
10824 if (i
== cand1
->num_convs
)
10826 if (cand1
->fn
== cand2
->fn
)
10827 /* Two built-in candidates; arbitrarily pick one. */
10829 else if (identifier_p (cand1
->fn
))
10830 /* cand1 is built-in; prefer cand2. */
10833 /* cand2 is built-in; prefer cand1. */
10838 /* For candidates of a multi-versioned function, make the version with
10839 the highest priority win. This version will be checked for dispatching
10840 first. If this version can be inlined into the caller, the front-end
10841 will simply make a direct call to this function. */
10843 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10844 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
10845 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10846 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
10848 tree f1
= TREE_TYPE (cand1
->fn
);
10849 tree f2
= TREE_TYPE (cand2
->fn
);
10850 tree p1
= TYPE_ARG_TYPES (f1
);
10851 tree p2
= TYPE_ARG_TYPES (f2
);
10853 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10854 is possible that cand1->fn and cand2->fn are function versions but of
10855 different functions. Check types to see if they are versions of the same
10857 if (compparms (p1
, p2
)
10858 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
10860 /* Always make the version with the higher priority, more
10861 specialized, win. */
10862 gcc_assert (targetm
.compare_version_priority
);
10863 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
10870 /* If the two function declarations represent the same function (this can
10871 happen with declarations in multiple scopes and arg-dependent lookup),
10872 arbitrarily choose one. But first make sure the default args we're
10874 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
10875 && equal_functions (cand1
->fn
, cand2
->fn
))
10877 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
10878 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
10880 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
10882 for (i
= 0; i
< len
; ++i
)
10884 /* Don't crash if the fn is variadic. */
10887 parms1
= TREE_CHAIN (parms1
);
10888 parms2
= TREE_CHAIN (parms2
);
10892 parms1
= TREE_CHAIN (parms1
);
10894 parms2
= TREE_CHAIN (parms2
);
10896 for (; parms1
; ++i
)
10898 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
10899 TREE_PURPOSE (parms2
)))
10903 if (complain
& tf_error
)
10905 auto_diagnostic_group d
;
10906 if (permerror (input_location
,
10907 "default argument mismatch in "
10908 "overload resolution"))
10910 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
10911 " candidate 1: %q#F", cand1
->fn
);
10912 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
10913 " candidate 2: %q#F", cand2
->fn
);
10920 add_warning (cand1
, cand2
);
10923 parms1
= TREE_CHAIN (parms1
);
10924 parms2
= TREE_CHAIN (parms2
);
10932 /* Extension: If the worst conversion for one candidate is better than the
10933 worst conversion for the other, take the first. */
10934 if (!pedantic
&& (complain
& tf_warning_or_error
))
10936 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
10937 struct z_candidate
*w
= 0, *l
= 0;
10939 for (i
= 0; i
< len
; ++i
)
10941 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
10942 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
10943 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
10944 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
10947 winner
= 1, w
= cand1
, l
= cand2
;
10949 winner
= -1, w
= cand2
, l
= cand1
;
10952 /* Don't choose a deleted function over ambiguity. */
10953 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
10957 auto_diagnostic_group d
;
10958 if (pedwarn (input_location
, 0,
10959 "ISO C++ says that these are ambiguous, even "
10960 "though the worst conversion for the first is "
10961 "better than the worst conversion for the second:"))
10963 print_z_candidate (input_location
, _("candidate 1:"), w
);
10964 print_z_candidate (input_location
, _("candidate 2:"), l
);
10968 add_warning (w
, l
);
10973 gcc_assert (!winner
);
10977 /* Given a list of candidates for overloading, find the best one, if any.
10978 This algorithm has a worst case of O(2n) (winner is last), and a best
10979 case of O(n/2) (totally ambiguous); much better than a sorting
10982 static struct z_candidate
*
10983 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
10985 struct z_candidate
*champ
= candidates
, *challenger
;
10987 int champ_compared_to_predecessor
= 0;
10989 /* Walk through the list once, comparing each current champ to the next
10990 candidate, knocking out a candidate or two with each comparison. */
10992 for (challenger
= champ
->next
; challenger
; )
10994 fate
= joust (champ
, challenger
, 0, complain
);
10996 challenger
= challenger
->next
;
11001 champ
= challenger
->next
;
11004 champ_compared_to_predecessor
= 0;
11008 champ
= challenger
;
11009 champ_compared_to_predecessor
= 1;
11012 challenger
= champ
->next
;
11016 /* Make sure the champ is better than all the candidates it hasn't yet
11017 been compared to. */
11019 for (challenger
= candidates
;
11020 challenger
!= champ
11021 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
11022 challenger
= challenger
->next
)
11024 fate
= joust (champ
, challenger
, 0, complain
);
11032 /* Returns nonzero if things of type FROM can be converted to TO. */
11035 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
11037 tree arg
= NULL_TREE
;
11038 /* implicit_conversion only considers user-defined conversions
11039 if it has an expression for the call argument list. */
11040 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
11041 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
11042 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
11045 /* Returns nonzero if things of type FROM can be converted to TO with a
11046 standard conversion. */
11049 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
11051 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
11054 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
11057 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
11058 tsubst_flags_t complain
)
11064 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11065 p
= conversion_obstack_alloc (0);
11066 /* We want to discard any access checks done for this test,
11067 as we might not be in the appropriate access context and
11068 we'll do the check again when we actually perform the
11070 push_deferring_access_checks (dk_deferred
);
11072 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
11074 ok_p
= (t
&& !t
->bad_p
);
11076 /* Discard the access checks now. */
11077 pop_deferring_access_checks ();
11078 /* Free all the conversions we allocated. */
11079 obstack_free (&conversion_obstack
, p
);
11084 /* Like can_convert_arg, but allows dubious conversions as well. */
11087 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
11088 tsubst_flags_t complain
)
11093 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11094 p
= conversion_obstack_alloc (0);
11095 /* Try to perform the conversion. */
11096 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
11098 /* Free all the conversions we allocated. */
11099 obstack_free (&conversion_obstack
, p
);
11104 /* Convert EXPR to TYPE. Return the converted expression.
11106 Note that we allow bad conversions here because by the time we get to
11107 this point we are committed to doing the conversion. If we end up
11108 doing a bad conversion, convert_like will complain. */
11111 perform_implicit_conversion_flags (tree type
, tree expr
,
11112 tsubst_flags_t complain
, int flags
)
11116 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
11118 if (TYPE_REF_P (type
))
11119 expr
= mark_lvalue_use (expr
);
11121 expr
= mark_rvalue_use (expr
);
11123 if (error_operand_p (expr
))
11124 return error_mark_node
;
11126 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11127 p
= conversion_obstack_alloc (0);
11129 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
11130 /*c_cast_p=*/false,
11135 if (complain
& tf_error
)
11137 /* If expr has unknown type, then it is an overloaded function.
11138 Call instantiate_type to get good error messages. */
11139 if (TREE_TYPE (expr
) == unknown_type_node
)
11140 instantiate_type (type
, expr
, complain
);
11141 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
11142 /* We gave an error. */;
11145 range_label_for_type_mismatch
label (TREE_TYPE (expr
), type
);
11146 gcc_rich_location
rich_loc (loc
, &label
);
11147 error_at (&rich_loc
, "could not convert %qE from %qH to %qI",
11148 expr
, TREE_TYPE (expr
), type
);
11151 expr
= error_mark_node
;
11153 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
11155 /* In a template, we are only concerned about determining the
11156 type of non-dependent expressions, so we do not have to
11157 perform the actual conversion. But for initializers, we
11158 need to be able to perform it at instantiation
11159 (or instantiate_non_dependent_expr) time. */
11160 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
11161 if (!(flags
& LOOKUP_ONLYCONVERTING
))
11162 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
11163 if (flags
& LOOKUP_NO_NARROWING
)
11164 IMPLICIT_CONV_EXPR_BRACED_INIT (expr
) = true;
11167 expr
= convert_like (conv
, expr
, complain
);
11169 /* Free all the conversions we allocated. */
11170 obstack_free (&conversion_obstack
, p
);
11176 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
11178 return perform_implicit_conversion_flags (type
, expr
, complain
,
11182 /* Convert EXPR to TYPE (as a direct-initialization) if that is
11183 permitted. If the conversion is valid, the converted expression is
11184 returned. Otherwise, NULL_TREE is returned, except in the case
11185 that TYPE is a class type; in that case, an error is issued. If
11186 C_CAST_P is true, then this direct-initialization is taking
11187 place as part of a static_cast being attempted as part of a C-style
11191 perform_direct_initialization_if_possible (tree type
,
11194 tsubst_flags_t complain
)
11199 if (type
== error_mark_node
|| error_operand_p (expr
))
11200 return error_mark_node
;
11203 If the destination type is a (possibly cv-qualified) class type:
11205 -- If the initialization is direct-initialization ...,
11206 constructors are considered. ... If no constructor applies, or
11207 the overload resolution is ambiguous, the initialization is
11209 if (CLASS_TYPE_P (type
))
11211 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
11212 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
11213 &args
, type
, LOOKUP_NORMAL
, complain
);
11214 release_tree_vector (args
);
11215 return build_cplus_new (type
, expr
, complain
);
11218 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11219 p
= conversion_obstack_alloc (0);
11221 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
11223 LOOKUP_NORMAL
, complain
);
11224 if (!conv
|| conv
->bad_p
)
11226 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
11228 /* In a template, we are only concerned about determining the
11229 type of non-dependent expressions, so we do not have to
11230 perform the actual conversion. But for initializers, we
11231 need to be able to perform it at instantiation
11232 (or instantiate_non_dependent_expr) time. */
11233 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
11234 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
11237 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0,
11238 /*issue_conversion_warnings=*/false,
11242 /* Free all the conversions we allocated. */
11243 obstack_free (&conversion_obstack
, p
);
11248 /* When initializing a reference that lasts longer than a full-expression,
11249 this special rule applies:
11253 The temporary to which the reference is bound or the temporary
11254 that is the complete object to which the reference is bound
11255 persists for the lifetime of the reference.
11257 The temporaries created during the evaluation of the expression
11258 initializing the reference, except the temporary to which the
11259 reference is bound, are destroyed at the end of the
11260 full-expression in which they are created.
11262 In that case, we store the converted expression into a new
11263 VAR_DECL in a new scope.
11265 However, we want to be careful not to create temporaries when
11266 they are not required. For example, given:
11269 struct D : public B {};
11273 there is no need to copy the return value from "f"; we can just
11274 extend its lifetime. Similarly, given:
11277 struct T { operator S(); };
11281 we can extend the lifetime of the return value of the conversion
11284 The next several functions are involved in this lifetime extension. */
11286 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
11287 reference is being bound to a temporary. Create and return a new
11288 VAR_DECL with the indicated TYPE; this variable will store the value to
11289 which the reference is bound. */
11292 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
11294 tree var
= create_temporary_var (type
);
11296 /* Register the variable. */
11298 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
11300 /* Namespace-scope or local static; give it a mangled name. */
11302 /* If an initializer is visible to multiple translation units, those
11303 translation units must agree on the addresses of the
11304 temporaries. Therefore the temporaries must be given a consistent name
11305 and vague linkage. The mangled name of a temporary is the name of the
11306 non-temporary object in whose initializer they appear, prefixed with
11307 GR and suffixed with a sequence number mangled using the usual rules
11308 for a seq-id. Temporaries are numbered with a pre-order, depth-first,
11309 left-to-right walk of the complete initializer. */
11311 TREE_STATIC (var
) = TREE_STATIC (decl
);
11312 TREE_PUBLIC (var
) = TREE_PUBLIC (decl
);
11313 if (vague_linkage_p (decl
))
11314 comdat_linkage (var
);
11316 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
11317 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
11319 tree name
= mangle_ref_init_variable (decl
);
11320 DECL_NAME (var
) = name
;
11321 SET_DECL_ASSEMBLER_NAME (var
, name
);
11324 /* Create a new cleanup level if necessary. */
11325 maybe_push_cleanup_level (type
);
11327 return pushdecl (var
);
11330 /* EXPR is the initializer for a variable DECL of reference or
11331 std::initializer_list type. Create, push and return a new VAR_DECL
11332 for the initializer so that it will live as long as DECL. Any
11333 cleanup for the new variable is returned through CLEANUP, and the
11334 code to initialize the new variable is returned through INITP. */
11337 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
11344 /* Create the temporary variable. */
11345 type
= TREE_TYPE (expr
);
11346 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
11347 layout_decl (var
, 0);
11348 /* If the rvalue is the result of a function call it will be
11349 a TARGET_EXPR. If it is some other construct (such as a
11350 member access expression where the underlying object is
11351 itself the result of a function call), turn it into a
11352 TARGET_EXPR here. It is important that EXPR be a
11353 TARGET_EXPR below since otherwise the INIT_EXPR will
11354 attempt to make a bitwise copy of EXPR to initialize
11356 if (TREE_CODE (expr
) != TARGET_EXPR
)
11357 expr
= get_target_expr (expr
);
11359 if (TREE_CODE (decl
) == FIELD_DECL
11360 && extra_warnings
&& !TREE_NO_WARNING (decl
))
11362 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
11363 "until the constructor exits", decl
);
11364 TREE_NO_WARNING (decl
) = true;
11367 /* Recursively extend temps in this initializer. */
11368 TARGET_EXPR_INITIAL (expr
)
11369 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
11371 /* Any reference temp has a non-trivial initializer. */
11372 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
11374 /* If the initializer is constant, put it in DECL_INITIAL so we get
11375 static initialization and use in constant expressions. */
11376 init
= maybe_constant_init (expr
);
11377 /* As in store_init_value. */
11378 init
= cp_fully_fold (init
);
11379 if (TREE_CONSTANT (init
))
11381 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
11383 /* 5.19 says that a constant expression can include an
11384 lvalue-rvalue conversion applied to "a glvalue of literal type
11385 that refers to a non-volatile temporary object initialized
11386 with a constant expression". Rather than try to communicate
11387 that this VAR_DECL is a temporary, just mark it constexpr. */
11388 DECL_DECLARED_CONSTEXPR_P (var
) = true;
11389 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
11390 TREE_CONSTANT (var
) = true;
11391 TREE_READONLY (var
) = true;
11393 DECL_INITIAL (var
) = init
;
11397 /* Create the INIT_EXPR that will initialize the temporary
11399 init
= split_nonconstant_init (var
, expr
);
11400 if (at_function_scope_p ())
11402 add_decl_expr (var
);
11404 if (TREE_STATIC (var
))
11405 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
11408 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11410 vec_safe_push (*cleanups
, cleanup
);
11413 /* We must be careful to destroy the temporary only
11414 after its initialization has taken place. If the
11415 initialization throws an exception, then the
11416 destructor should not be run. We cannot simply
11417 transform INIT into something like:
11419 (INIT, ({ CLEANUP_STMT; }))
11421 because emit_local_var always treats the
11422 initializer as a full-expression. Thus, the
11423 destructor would run too early; it would run at the
11424 end of initializing the reference variable, rather
11425 than at the end of the block enclosing the
11426 reference variable.
11428 The solution is to pass back a cleanup expression
11429 which the caller is responsible for attaching to
11430 the statement tree. */
11434 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
11435 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
11437 if (CP_DECL_THREAD_LOCAL_P (var
))
11438 tls_aggregates
= tree_cons (NULL_TREE
, var
,
11441 static_aggregates
= tree_cons (NULL_TREE
, var
,
11442 static_aggregates
);
11445 /* Check whether the dtor is callable. */
11446 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11448 /* Avoid -Wunused-variable warning (c++/38958). */
11449 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
11451 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
11457 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
11458 initializing a variable of that TYPE. */
11461 initialize_reference (tree type
, tree expr
,
11462 int flags
, tsubst_flags_t complain
)
11466 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
11468 if (type
== error_mark_node
|| error_operand_p (expr
))
11469 return error_mark_node
;
11471 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11472 p
= conversion_obstack_alloc (0);
11474 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
11476 if (!conv
|| conv
->bad_p
)
11478 if (complain
& tf_error
)
11481 convert_like (conv
, expr
, complain
);
11482 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
11483 && !TYPE_REF_IS_RVALUE (type
)
11484 && !lvalue_p (expr
))
11485 error_at (loc
, "invalid initialization of non-const reference of "
11486 "type %qH from an rvalue of type %qI",
11487 type
, TREE_TYPE (expr
));
11489 error_at (loc
, "invalid initialization of reference of type "
11490 "%qH from expression of type %qI", type
,
11493 return error_mark_node
;
11496 if (conv
->kind
== ck_ref_bind
)
11497 /* Perform the conversion. */
11498 expr
= convert_like (conv
, expr
, complain
);
11499 else if (conv
->kind
== ck_ambig
)
11500 /* We gave an error in build_user_type_conversion_1. */
11501 expr
= error_mark_node
;
11503 gcc_unreachable ();
11505 /* Free all the conversions we allocated. */
11506 obstack_free (&conversion_obstack
, p
);
11511 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
11512 which is bound either to a reference or a std::initializer_list. */
11515 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
11520 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
11522 TREE_OPERAND (sub
, 1)
11523 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
11526 if (TREE_CODE (sub
) != ADDR_EXPR
)
11528 /* Deal with binding to a subobject. */
11529 for (p
= &TREE_OPERAND (sub
, 0);
11530 (TREE_CODE (*p
) == COMPONENT_REF
11531 || TREE_CODE (*p
) == ARRAY_REF
); )
11532 p
= &TREE_OPERAND (*p
, 0);
11533 if (TREE_CODE (*p
) == TARGET_EXPR
)
11535 tree subinit
= NULL_TREE
;
11536 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
11537 recompute_tree_invariant_for_addr_expr (sub
);
11539 init
= fold_convert (TREE_TYPE (init
), sub
);
11541 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
11546 /* INIT is part of the initializer for DECL. If there are any
11547 reference or initializer lists being initialized, extend their
11548 lifetime to match that of DECL. */
11551 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
11553 tree type
= TREE_TYPE (init
);
11554 if (processing_template_decl
)
11556 if (TYPE_REF_P (type
))
11557 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
11561 if (TREE_CODE (ctor
) == TARGET_EXPR
)
11562 ctor
= TARGET_EXPR_INITIAL (ctor
);
11563 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
11565 if (is_std_init_list (type
))
11567 /* The temporary array underlying a std::initializer_list
11568 is handled like a reference temporary. */
11569 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
11570 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
11571 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
11576 constructor_elt
*p
;
11577 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (ctor
);
11578 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
11579 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
11581 recompute_constructor_flags (ctor
);
11582 if (decl_maybe_constant_var_p (decl
) && TREE_CONSTANT (ctor
))
11583 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
11590 /* Returns true iff an initializer for TYPE could contain temporaries that
11591 need to be extended because they are bound to references or
11592 std::initializer_list. */
11595 type_has_extended_temps (tree type
)
11597 type
= strip_array_types (type
);
11598 if (TYPE_REF_P (type
))
11600 if (CLASS_TYPE_P (type
))
11602 if (is_std_init_list (type
))
11604 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
11605 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
11606 if (type_has_extended_temps (TREE_TYPE (f
)))
11612 /* Returns true iff TYPE is some variant of std::initializer_list. */
11615 is_std_init_list (tree type
)
11617 if (!TYPE_P (type
))
11619 if (cxx_dialect
== cxx98
)
11621 /* Look through typedefs. */
11622 type
= TYPE_MAIN_VARIANT (type
);
11623 return (CLASS_TYPE_P (type
)
11624 && CP_TYPE_CONTEXT (type
) == std_node
11625 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
)));
11628 /* Returns true iff DECL is a list constructor: i.e. a constructor which
11629 will accept an argument list of a single std::initializer_list<T>. */
11632 is_list_ctor (tree decl
)
11634 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11637 if (!args
|| args
== void_list_node
)
11640 arg
= non_reference (TREE_VALUE (args
));
11641 if (!is_std_init_list (arg
))
11644 args
= TREE_CHAIN (args
);
11646 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
11647 /* There are more non-defaulted parms. */
11653 #include "gt-cp-call.h"