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 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
906 aggregate class, if such a conversion is possible. */
909 build_aggr_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
911 unsigned HOST_WIDE_INT i
= 0;
913 tree field
= next_initializable_field (TYPE_FIELDS (type
));
914 tree empty_ctor
= NULL_TREE
;
916 /* We already called reshape_init in implicit_conversion. */
918 /* The conversions within the init-list aren't affected by the enclosing
919 context; they're always simple copy-initialization. */
920 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
922 for (; field
; field
= next_initializable_field (DECL_CHAIN (field
)))
924 tree ftype
= TREE_TYPE (field
);
928 if (i
< CONSTRUCTOR_NELTS (ctor
))
929 val
= CONSTRUCTOR_ELT (ctor
, i
)->value
;
930 else if (DECL_INITIAL (field
))
931 val
= get_nsdmi (field
, /*ctor*/false, complain
);
932 else if (TYPE_REF_P (ftype
))
933 /* Value-initialization of reference is ill-formed. */
937 if (empty_ctor
== NULL_TREE
)
938 empty_ctor
= build_constructor (init_list_type_node
, NULL
);
943 if (TREE_CODE (ftype
) == ARRAY_TYPE
944 && TREE_CODE (val
) == CONSTRUCTOR
)
945 ok
= can_convert_array (ftype
, val
, flags
, complain
);
947 ok
= can_convert_arg (ftype
, TREE_TYPE (val
), val
, flags
,
953 if (TREE_CODE (type
) == UNION_TYPE
)
957 if (i
< CONSTRUCTOR_NELTS (ctor
))
960 c
= alloc_conversion (ck_aggr
);
963 c
->user_conv_p
= true;
964 c
->check_narrowing
= true;
969 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, an
970 array type, if such a conversion is possible. */
973 build_array_conv (tree type
, tree ctor
, int flags
, tsubst_flags_t complain
)
976 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
977 tree elttype
= TREE_TYPE (type
);
982 enum conversion_rank rank
= cr_exact
;
984 /* We might need to propagate the size from the element to the array. */
985 complete_type (type
);
987 if (TYPE_DOMAIN (type
)
988 && !variably_modified_type_p (TYPE_DOMAIN (type
), NULL_TREE
))
990 unsigned HOST_WIDE_INT alen
= tree_to_uhwi (array_type_nelts_top (type
));
995 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
997 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1000 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1001 false, flags
, complain
);
1005 if (sub
->rank
> rank
)
1007 if (sub
->user_conv_p
)
1013 c
= alloc_conversion (ck_aggr
);
1016 c
->user_conv_p
= user
;
1022 /* Represent a conversion from CTOR, a braced-init-list, to TYPE, a
1023 complex type, if such a conversion is possible. */
1026 build_complex_conv (tree type
, tree ctor
, int flags
,
1027 tsubst_flags_t complain
)
1030 unsigned HOST_WIDE_INT len
= CONSTRUCTOR_NELTS (ctor
);
1031 tree elttype
= TREE_TYPE (type
);
1036 enum conversion_rank rank
= cr_exact
;
1041 flags
= LOOKUP_IMPLICIT
|LOOKUP_NO_NARROWING
;
1043 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), i
, val
)
1046 = implicit_conversion (elttype
, TREE_TYPE (val
), val
,
1047 false, flags
, complain
);
1051 if (sub
->rank
> rank
)
1053 if (sub
->user_conv_p
)
1059 c
= alloc_conversion (ck_aggr
);
1062 c
->user_conv_p
= user
;
1068 /* Build a representation of the identity conversion from EXPR to
1069 itself. The TYPE should match the type of EXPR, if EXPR is non-NULL. */
1072 build_identity_conv (tree type
, tree expr
)
1076 c
= alloc_conversion (ck_identity
);
1083 /* Converting from EXPR to TYPE was ambiguous in the sense that there
1084 were multiple user-defined conversions to accomplish the job.
1085 Build a conversion that indicates that ambiguity. */
1088 build_ambiguous_conv (tree type
, tree expr
)
1092 c
= alloc_conversion (ck_ambig
);
1100 strip_top_quals (tree t
)
1102 if (TREE_CODE (t
) == ARRAY_TYPE
)
1104 return cp_build_qualified_type (t
, 0);
1107 /* Returns the standard conversion path (see [conv]) from type FROM to type
1108 TO, if any. For proper handling of null pointer constants, you must
1109 also pass the expression EXPR to convert from. If C_CAST_P is true,
1110 this conversion is coming from a C-style cast. */
1113 standard_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1114 int flags
, tsubst_flags_t complain
)
1116 enum tree_code fcode
, tcode
;
1118 bool fromref
= false;
1121 to
= non_reference (to
);
1122 if (TYPE_REF_P (from
))
1125 from
= TREE_TYPE (from
);
1128 to
= strip_top_quals (to
);
1129 from
= strip_top_quals (from
);
1131 if (expr
&& type_unknown_p (expr
))
1133 if (TYPE_PTRFN_P (to
) || TYPE_PTRMEMFUNC_P (to
))
1135 tsubst_flags_t tflags
= tf_conv
;
1136 expr
= instantiate_type (to
, expr
, tflags
);
1137 if (expr
== error_mark_node
)
1139 from
= TREE_TYPE (expr
);
1141 else if (TREE_CODE (to
) == BOOLEAN_TYPE
)
1143 /* Necessary for eg, TEMPLATE_ID_EXPRs (c++/50961). */
1144 expr
= resolve_nondeduced_context (expr
, complain
);
1145 from
= TREE_TYPE (expr
);
1149 fcode
= TREE_CODE (from
);
1150 tcode
= TREE_CODE (to
);
1152 conv
= build_identity_conv (from
, expr
);
1153 if (fcode
== FUNCTION_TYPE
|| fcode
== ARRAY_TYPE
)
1155 from
= type_decays_to (from
);
1156 fcode
= TREE_CODE (from
);
1157 /* Tell convert_like_real that we're using the address. */
1158 conv
->rvaluedness_matches_p
= true;
1159 conv
= build_conv (ck_lvalue
, from
, conv
);
1161 /* Wrapping a ck_rvalue around a class prvalue (as a result of using
1162 obvalue_p) seems odd, since it's already a prvalue, but that's how we
1163 express the copy constructor call required by copy-initialization. */
1164 else if (fromref
|| (expr
&& obvalue_p (expr
)))
1169 bitfield_type
= is_bitfield_expr_with_lowered_type (expr
);
1172 from
= strip_top_quals (bitfield_type
);
1173 fcode
= TREE_CODE (from
);
1176 conv
= build_conv (ck_rvalue
, from
, conv
);
1177 if (flags
& LOOKUP_PREFER_RVALUE
)
1178 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1179 conv
->rvaluedness_matches_p
= true;
1182 /* Allow conversion between `__complex__' data types. */
1183 if (tcode
== COMPLEX_TYPE
&& fcode
== COMPLEX_TYPE
)
1185 /* The standard conversion sequence to convert FROM to TO is
1186 the standard conversion sequence to perform componentwise
1188 conversion
*part_conv
= standard_conversion
1189 (TREE_TYPE (to
), TREE_TYPE (from
), NULL_TREE
, c_cast_p
, flags
,
1194 conv
= build_conv (part_conv
->kind
, to
, conv
);
1195 conv
->rank
= part_conv
->rank
;
1203 if (same_type_p (from
, to
))
1205 if (CLASS_TYPE_P (to
) && conv
->kind
== ck_rvalue
)
1206 conv
->type
= qualified_to
;
1211 A null pointer constant can be converted to a pointer type; ... A
1212 null pointer constant of integral type can be converted to an
1213 rvalue of type std::nullptr_t. */
1214 if ((tcode
== POINTER_TYPE
|| TYPE_PTRMEM_P (to
)
1215 || NULLPTR_TYPE_P (to
))
1216 && ((expr
&& null_ptr_cst_p (expr
))
1217 || NULLPTR_TYPE_P (from
)))
1218 conv
= build_conv (ck_std
, to
, conv
);
1219 else if ((tcode
== INTEGER_TYPE
&& fcode
== POINTER_TYPE
)
1220 || (tcode
== POINTER_TYPE
&& fcode
== INTEGER_TYPE
))
1222 /* For backwards brain damage compatibility, allow interconversion of
1223 pointers and integers with a pedwarn. */
1224 conv
= build_conv (ck_std
, to
, conv
);
1227 else if (UNSCOPED_ENUM_P (to
) && fcode
== INTEGER_TYPE
)
1229 /* For backwards brain damage compatibility, allow interconversion of
1230 enums and integers with a pedwarn. */
1231 conv
= build_conv (ck_std
, to
, conv
);
1234 else if ((tcode
== POINTER_TYPE
&& fcode
== POINTER_TYPE
)
1235 || (TYPE_PTRDATAMEM_P (to
) && TYPE_PTRDATAMEM_P (from
)))
1240 if (tcode
== POINTER_TYPE
)
1242 to_pointee
= TREE_TYPE (to
);
1243 from_pointee
= TREE_TYPE (from
);
1245 /* Since this is the target of a pointer, it can't have function
1246 qualifiers, so any TYPE_QUALS must be for attributes const or
1247 noreturn. Strip them. */
1248 if (TREE_CODE (to_pointee
) == FUNCTION_TYPE
1249 && TYPE_QUALS (to_pointee
))
1250 to_pointee
= build_qualified_type (to_pointee
, TYPE_UNQUALIFIED
);
1251 if (TREE_CODE (from_pointee
) == FUNCTION_TYPE
1252 && TYPE_QUALS (from_pointee
))
1253 from_pointee
= build_qualified_type (from_pointee
, TYPE_UNQUALIFIED
);
1257 to_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (to
);
1258 from_pointee
= TYPE_PTRMEM_POINTED_TO_TYPE (from
);
1261 if (tcode
== POINTER_TYPE
1262 && same_type_ignoring_top_level_qualifiers_p (from_pointee
,
1265 else if (VOID_TYPE_P (to_pointee
)
1266 && !TYPE_PTRDATAMEM_P (from
)
1267 && TREE_CODE (from_pointee
) != FUNCTION_TYPE
)
1269 tree nfrom
= TREE_TYPE (from
);
1270 /* Don't try to apply restrict to void. */
1271 int quals
= cp_type_quals (nfrom
) & ~TYPE_QUAL_RESTRICT
;
1272 from_pointee
= cp_build_qualified_type (void_type_node
, quals
);
1273 from
= build_pointer_type (from_pointee
);
1274 conv
= build_conv (ck_ptr
, from
, conv
);
1276 else if (TYPE_PTRDATAMEM_P (from
))
1278 tree fbase
= TYPE_PTRMEM_CLASS_TYPE (from
);
1279 tree tbase
= TYPE_PTRMEM_CLASS_TYPE (to
);
1281 if (same_type_p (fbase
, tbase
))
1282 /* No base conversion needed. */;
1283 else if (DERIVED_FROM_P (fbase
, tbase
)
1284 && (same_type_ignoring_top_level_qualifiers_p
1285 (from_pointee
, to_pointee
)))
1287 from
= build_ptrmem_type (tbase
, from_pointee
);
1288 conv
= build_conv (ck_pmem
, from
, conv
);
1293 else if (CLASS_TYPE_P (from_pointee
)
1294 && CLASS_TYPE_P (to_pointee
)
1297 An rvalue of type "pointer to cv D," where D is a
1298 class type, can be converted to an rvalue of type
1299 "pointer to cv B," where B is a base class (clause
1300 _class.derived_) of D. If B is an inaccessible
1301 (clause _class.access_) or ambiguous
1302 (_class.member.lookup_) base class of D, a program
1303 that necessitates this conversion is ill-formed.
1304 Therefore, we use DERIVED_FROM_P, and do not check
1305 access or uniqueness. */
1306 && DERIVED_FROM_P (to_pointee
, from_pointee
))
1309 = cp_build_qualified_type (to_pointee
,
1310 cp_type_quals (from_pointee
));
1311 from
= build_pointer_type (from_pointee
);
1312 conv
= build_conv (ck_ptr
, from
, conv
);
1313 conv
->base_p
= true;
1316 if (same_type_p (from
, to
))
1318 else if (c_cast_p
&& comp_ptr_ttypes_const (to
, from
))
1319 /* In a C-style cast, we ignore CV-qualification because we
1320 are allowed to perform a static_cast followed by a
1322 conv
= build_conv (ck_qual
, to
, conv
);
1323 else if (!c_cast_p
&& comp_ptr_ttypes (to_pointee
, from_pointee
))
1324 conv
= build_conv (ck_qual
, to
, conv
);
1325 else if (expr
&& string_conv_p (to
, expr
, 0))
1326 /* converting from string constant to char *. */
1327 conv
= build_conv (ck_qual
, to
, conv
);
1328 else if (fnptr_conv_p (to
, from
))
1329 conv
= build_conv (ck_fnptr
, to
, conv
);
1330 /* Allow conversions among compatible ObjC pointer types (base
1331 conversions have been already handled above). */
1332 else if (c_dialect_objc ()
1333 && objc_compare_types (to
, from
, -4, NULL_TREE
))
1334 conv
= build_conv (ck_ptr
, to
, conv
);
1335 else if (ptr_reasonably_similar (to_pointee
, from_pointee
))
1337 conv
= build_conv (ck_ptr
, to
, conv
);
1345 else if (TYPE_PTRMEMFUNC_P (to
) && TYPE_PTRMEMFUNC_P (from
))
1347 tree fromfn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (from
));
1348 tree tofn
= TREE_TYPE (TYPE_PTRMEMFUNC_FN_TYPE (to
));
1349 tree fbase
= class_of_this_parm (fromfn
);
1350 tree tbase
= class_of_this_parm (tofn
);
1352 if (!DERIVED_FROM_P (fbase
, tbase
))
1355 tree fstat
= static_fn_type (fromfn
);
1356 tree tstat
= static_fn_type (tofn
);
1357 if (same_type_p (tstat
, fstat
)
1358 || fnptr_conv_p (tstat
, fstat
))
1363 if (!same_type_p (fbase
, tbase
))
1365 from
= build_memfn_type (fstat
,
1367 cp_type_quals (tbase
),
1368 type_memfn_rqual (tofn
));
1369 from
= build_ptrmemfunc_type (build_pointer_type (from
));
1370 conv
= build_conv (ck_pmem
, from
, conv
);
1371 conv
->base_p
= true;
1373 if (fnptr_conv_p (tstat
, fstat
))
1374 conv
= build_conv (ck_fnptr
, to
, conv
);
1376 else if (tcode
== BOOLEAN_TYPE
)
1380 A prvalue of arithmetic, unscoped enumeration, pointer, or pointer
1381 to member type can be converted to a prvalue of type bool. ...
1382 For direct-initialization (8.5 [dcl.init]), a prvalue of type
1383 std::nullptr_t can be converted to a prvalue of type bool; */
1384 if (ARITHMETIC_TYPE_P (from
)
1385 || UNSCOPED_ENUM_P (from
)
1386 || fcode
== POINTER_TYPE
1387 || TYPE_PTRMEM_P (from
)
1388 || NULLPTR_TYPE_P (from
))
1390 conv
= build_conv (ck_std
, to
, conv
);
1391 if (fcode
== POINTER_TYPE
1392 || TYPE_PTRDATAMEM_P (from
)
1393 || (TYPE_PTRMEMFUNC_P (from
)
1394 && conv
->rank
< cr_pbool
)
1395 || NULLPTR_TYPE_P (from
))
1396 conv
->rank
= cr_pbool
;
1397 if (NULLPTR_TYPE_P (from
) && (flags
& LOOKUP_ONLYCONVERTING
))
1399 if (flags
& LOOKUP_NO_NARROWING
)
1400 conv
->check_narrowing
= true;
1406 /* We don't check for ENUMERAL_TYPE here because there are no standard
1407 conversions to enum type. */
1408 /* As an extension, allow conversion to complex type. */
1409 else if (ARITHMETIC_TYPE_P (to
))
1411 if (! (INTEGRAL_CODE_P (fcode
)
1412 || (fcode
== REAL_TYPE
&& !(flags
& LOOKUP_NO_NON_INTEGRAL
)))
1413 || SCOPED_ENUM_P (from
))
1416 /* If we're parsing an enum with no fixed underlying type, we're
1417 dealing with an incomplete type, which renders the conversion
1419 if (!COMPLETE_TYPE_P (from
))
1422 conv
= build_conv (ck_std
, to
, conv
);
1424 /* Give this a better rank if it's a promotion. */
1425 if (same_type_p (to
, type_promotes_to (from
))
1426 && next_conversion (conv
)->rank
<= cr_promotion
)
1427 conv
->rank
= cr_promotion
;
1429 else if (fcode
== VECTOR_TYPE
&& tcode
== VECTOR_TYPE
1430 && vector_types_convertible_p (from
, to
, false))
1431 return build_conv (ck_std
, to
, conv
);
1432 else if (MAYBE_CLASS_TYPE_P (to
) && MAYBE_CLASS_TYPE_P (from
)
1433 && is_properly_derived_from (from
, to
))
1435 if (conv
->kind
== ck_rvalue
)
1436 conv
= next_conversion (conv
);
1437 conv
= build_conv (ck_base
, to
, conv
);
1438 /* The derived-to-base conversion indicates the initialization
1439 of a parameter with base type from an object of a derived
1440 type. A temporary object is created to hold the result of
1441 the conversion unless we're binding directly to a reference. */
1442 conv
->need_temporary_p
= !(flags
& LOOKUP_NO_TEMP_BIND
);
1443 if (flags
& LOOKUP_PREFER_RVALUE
)
1444 /* Tell convert_like_real to set LOOKUP_PREFER_RVALUE. */
1445 conv
->rvaluedness_matches_p
= true;
1450 if (flags
& LOOKUP_NO_NARROWING
)
1451 conv
->check_narrowing
= true;
1456 /* Returns nonzero if T1 is reference-related to T2. */
1459 reference_related_p (tree t1
, tree t2
)
1461 if (t1
== error_mark_node
|| t2
== error_mark_node
)
1464 t1
= TYPE_MAIN_VARIANT (t1
);
1465 t2
= TYPE_MAIN_VARIANT (t2
);
1469 Given types "cv1 T1" and "cv2 T2," "cv1 T1" is reference-related
1470 to "cv2 T2" if T1 is the same type as T2, or T1 is a base class
1472 return (same_type_p (t1
, t2
)
1473 || (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
1474 && DERIVED_FROM_P (t1
, t2
)));
1477 /* Returns nonzero if T1 is reference-compatible with T2. */
1480 reference_compatible_p (tree t1
, tree t2
)
1484 "cv1 T1" is reference compatible with "cv2 T2" if
1485 * T1 is reference-related to T2 or
1486 * T2 is "noexcept function" and T1 is "function", where the
1487 function types are otherwise the same,
1488 and cv1 is the same cv-qualification as, or greater cv-qualification
1490 return ((reference_related_p (t1
, t2
)
1491 || fnptr_conv_p (t1
, t2
))
1492 && at_least_as_qualified_p (t1
, t2
));
1495 /* A reference of the indicated TYPE is being bound directly to the
1496 expression represented by the implicit conversion sequence CONV.
1497 Return a conversion sequence for this binding. */
1500 direct_reference_binding (tree type
, conversion
*conv
)
1504 gcc_assert (TYPE_REF_P (type
));
1505 gcc_assert (!TYPE_REF_P (conv
->type
));
1507 t
= TREE_TYPE (type
);
1509 if (conv
->kind
== ck_identity
)
1510 /* Mark the identity conv as to not decay to rvalue. */
1511 conv
->rvaluedness_matches_p
= true;
1515 When a parameter of reference type binds directly
1516 (_dcl.init.ref_) to an argument expression, the implicit
1517 conversion sequence is the identity conversion, unless the
1518 argument expression has a type that is a derived class of the
1519 parameter type, in which case the implicit conversion sequence is
1520 a derived-to-base Conversion.
1522 If the parameter binds directly to the result of applying a
1523 conversion function to the argument expression, the implicit
1524 conversion sequence is a user-defined conversion sequence
1525 (_over.ics.user_), with the second standard conversion sequence
1526 either an identity conversion or, if the conversion function
1527 returns an entity of a type that is a derived class of the
1528 parameter type, a derived-to-base conversion. */
1529 if (is_properly_derived_from (conv
->type
, t
))
1531 /* Represent the derived-to-base conversion. */
1532 conv
= build_conv (ck_base
, t
, conv
);
1533 /* We will actually be binding to the base-class subobject in
1534 the derived class, so we mark this conversion appropriately.
1535 That way, convert_like knows not to generate a temporary. */
1536 conv
->need_temporary_p
= false;
1539 return build_conv (ck_ref_bind
, type
, conv
);
1542 /* Returns the conversion path from type FROM to reference type TO for
1543 purposes of reference binding. For lvalue binding, either pass a
1544 reference type to FROM or an lvalue expression to EXPR. If the
1545 reference will be bound to a temporary, NEED_TEMPORARY_P is set for
1546 the conversion returned. If C_CAST_P is true, this
1547 conversion is coming from a C-style cast. */
1550 reference_binding (tree rto
, tree rfrom
, tree expr
, bool c_cast_p
, int flags
,
1551 tsubst_flags_t complain
)
1553 conversion
*conv
= NULL
;
1554 tree to
= TREE_TYPE (rto
);
1559 cp_lvalue_kind gl_kind
;
1562 if (TREE_CODE (to
) == FUNCTION_TYPE
&& expr
&& type_unknown_p (expr
))
1564 expr
= instantiate_type (to
, expr
, tf_none
);
1565 if (expr
== error_mark_node
)
1567 from
= TREE_TYPE (expr
);
1570 bool copy_list_init
= false;
1571 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1573 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
1574 /* DR 1288: Otherwise, if the initializer list has a single element
1575 of type E and ... [T's] referenced type is reference-related to E,
1576 the object or reference is initialized from that element... */
1577 if (CONSTRUCTOR_NELTS (expr
) == 1)
1579 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1580 if (error_operand_p (elt
))
1582 tree etype
= TREE_TYPE (elt
);
1583 if (reference_related_p (to
, etype
))
1590 /* Otherwise, if T is a reference type, a prvalue temporary of the type
1591 referenced by T is copy-list-initialized, and the reference is bound
1592 to that temporary. */
1593 copy_list_init
= true;
1597 if (TYPE_REF_P (from
))
1599 from
= TREE_TYPE (from
);
1600 if (!TYPE_REF_IS_RVALUE (rfrom
)
1601 || TREE_CODE (from
) == FUNCTION_TYPE
)
1602 gl_kind
= clk_ordinary
;
1604 gl_kind
= clk_rvalueref
;
1607 gl_kind
= lvalue_kind (expr
);
1608 else if (CLASS_TYPE_P (from
)
1609 || TREE_CODE (from
) == ARRAY_TYPE
)
1610 gl_kind
= clk_class
;
1614 /* Don't allow a class prvalue when LOOKUP_NO_TEMP_BIND. */
1615 if ((flags
& LOOKUP_NO_TEMP_BIND
)
1616 && (gl_kind
& clk_class
))
1619 /* Same mask as real_lvalue_p. */
1620 is_lvalue
= gl_kind
&& !(gl_kind
& (clk_rvalueref
|clk_class
));
1623 if ((gl_kind
& clk_bitfield
) != 0)
1624 tfrom
= unlowered_expr_type (expr
);
1626 /* Figure out whether or not the types are reference-related and
1627 reference compatible. We have to do this after stripping
1628 references from FROM. */
1629 related_p
= reference_related_p (to
, tfrom
);
1630 /* If this is a C cast, first convert to an appropriately qualified
1631 type, so that we can later do a const_cast to the desired type. */
1632 if (related_p
&& c_cast_p
1633 && !at_least_as_qualified_p (to
, tfrom
))
1634 to
= cp_build_qualified_type (to
, cp_type_quals (tfrom
));
1635 compatible_p
= reference_compatible_p (to
, tfrom
);
1637 /* Directly bind reference when target expression's type is compatible with
1638 the reference and expression is an lvalue. In DR391, the wording in
1639 [8.5.3/5 dcl.init.ref] is changed to also require direct bindings for
1640 const and rvalue references to rvalues of compatible class type.
1641 We should also do direct bindings for non-class xvalues. */
1642 if ((related_p
|| compatible_p
) && gl_kind
)
1646 If the initializer expression
1648 -- is an lvalue (but not an lvalue for a bit-field), and "cv1 T1"
1649 is reference-compatible with "cv2 T2,"
1651 the reference is bound directly to the initializer expression
1655 If the initializer expression is an rvalue, with T2 a class type,
1656 and "cv1 T1" is reference-compatible with "cv2 T2", the reference
1657 is bound to the object represented by the rvalue or to a sub-object
1658 within that object. */
1660 conv
= build_identity_conv (tfrom
, expr
);
1661 conv
= direct_reference_binding (rto
, conv
);
1663 if (TYPE_REF_P (rfrom
))
1664 /* Handle rvalue reference to function properly. */
1665 conv
->rvaluedness_matches_p
1666 = (TYPE_REF_IS_RVALUE (rto
) == TYPE_REF_IS_RVALUE (rfrom
));
1668 conv
->rvaluedness_matches_p
1669 = (TYPE_REF_IS_RVALUE (rto
) == !is_lvalue
);
1671 if ((gl_kind
& clk_bitfield
) != 0
1672 || ((gl_kind
& clk_packed
) != 0 && !TYPE_PACKED (to
)))
1673 /* For the purposes of overload resolution, we ignore the fact
1674 this expression is a bitfield or packed field. (In particular,
1675 [over.ics.ref] says specifically that a function with a
1676 non-const reference parameter is viable even if the
1677 argument is a bitfield.)
1679 However, when we actually call the function we must create
1680 a temporary to which to bind the reference. If the
1681 reference is volatile, or isn't const, then we cannot make
1682 a temporary, so we just issue an error when the conversion
1684 conv
->need_temporary_p
= true;
1686 /* Don't allow binding of lvalues (other than function lvalues) to
1687 rvalue references. */
1688 if (is_lvalue
&& TYPE_REF_IS_RVALUE (rto
)
1689 && TREE_CODE (to
) != FUNCTION_TYPE
)
1692 /* Nor the reverse. */
1693 if (!is_lvalue
&& !TYPE_REF_IS_RVALUE (rto
)
1694 && (!CP_TYPE_CONST_NON_VOLATILE_P (to
)
1695 || (flags
& LOOKUP_NO_RVAL_BIND
))
1696 && TREE_CODE (to
) != FUNCTION_TYPE
)
1704 /* [class.conv.fct] A conversion function is never used to convert a
1705 (possibly cv-qualified) object to the (possibly cv-qualified) same
1706 object type (or a reference to it), to a (possibly cv-qualified) base
1707 class of that type (or a reference to it).... */
1708 else if (CLASS_TYPE_P (from
) && !related_p
1709 && !(flags
& LOOKUP_NO_CONVERSION
))
1713 If the initializer expression
1715 -- has a class type (i.e., T2 is a class type) can be
1716 implicitly converted to an lvalue of type "cv3 T3," where
1717 "cv1 T1" is reference-compatible with "cv3 T3". (this
1718 conversion is selected by enumerating the applicable
1719 conversion functions (_over.match.ref_) and choosing the
1720 best one through overload resolution. (_over.match_).
1722 the reference is bound to the lvalue result of the conversion
1723 in the second case. */
1724 z_candidate
*cand
= build_user_type_conversion_1 (rto
, expr
, flags
,
1727 return cand
->second_conv
;
1730 /* From this point on, we conceptually need temporaries, even if we
1731 elide them. Only the cases above are "direct bindings". */
1732 if (flags
& LOOKUP_NO_TEMP_BIND
)
1737 When a parameter of reference type is not bound directly to an
1738 argument expression, the conversion sequence is the one required
1739 to convert the argument expression to the underlying type of the
1740 reference according to _over.best.ics_. Conceptually, this
1741 conversion sequence corresponds to copy-initializing a temporary
1742 of the underlying type with the argument expression. Any
1743 difference in top-level cv-qualification is subsumed by the
1744 initialization itself and does not constitute a conversion. */
1748 Otherwise, the reference shall be an lvalue reference to a
1749 non-volatile const type, or the reference shall be an rvalue
1752 We try below to treat this as a bad conversion to improve diagnostics,
1753 but if TO is an incomplete class, we need to reject this conversion
1754 now to avoid unnecessary instantiation. */
1755 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
)
1756 && !COMPLETE_TYPE_P (to
))
1759 /* We're generating a temporary now, but don't bind any more in the
1760 conversion (specifically, don't slice the temporary returned by a
1761 conversion operator). */
1762 flags
|= LOOKUP_NO_TEMP_BIND
;
1764 /* Core issue 899: When [copy-]initializing a temporary to be bound
1765 to the first parameter of a copy constructor (12.8) called with
1766 a single argument in the context of direct-initialization,
1767 explicit conversion functions are also considered.
1769 So don't set LOOKUP_ONLYCONVERTING in that case. */
1770 if (!(flags
& LOOKUP_COPY_PARM
))
1771 flags
|= LOOKUP_ONLYCONVERTING
;
1774 conv
= implicit_conversion (to
, from
, expr
, c_cast_p
,
1779 if (conv
->user_conv_p
)
1782 /* Remember this was copy-list-initialization. */
1783 conv
->need_temporary_p
= true;
1785 /* If initializing the temporary used a conversion function,
1786 recalculate the second conversion sequence. */
1787 for (conversion
*t
= conv
; t
; t
= next_conversion (t
))
1788 if (t
->kind
== ck_user
1789 && DECL_CONV_FN_P (t
->cand
->fn
))
1791 tree ftype
= TREE_TYPE (TREE_TYPE (t
->cand
->fn
));
1792 int sflags
= (flags
|LOOKUP_NO_CONVERSION
)&~LOOKUP_NO_TEMP_BIND
;
1793 conversion
*new_second
1794 = reference_binding (rto
, ftype
, NULL_TREE
, c_cast_p
,
1798 return merge_conversion_sequences (t
, new_second
);
1802 conv
= build_conv (ck_ref_bind
, rto
, conv
);
1803 /* This reference binding, unlike those above, requires the
1804 creation of a temporary. */
1805 conv
->need_temporary_p
= true;
1806 conv
->rvaluedness_matches_p
= TYPE_REF_IS_RVALUE (rto
);
1810 Otherwise, the reference shall be an lvalue reference to a
1811 non-volatile const type, or the reference shall be an rvalue
1813 if (!CP_TYPE_CONST_NON_VOLATILE_P (to
) && !TYPE_REF_IS_RVALUE (rto
))
1818 Otherwise, a temporary of type "cv1 T1" is created and
1819 initialized from the initializer expression using the rules for a
1820 non-reference copy initialization. If T1 is reference-related to
1821 T2, cv1 must be the same cv-qualification as, or greater
1822 cv-qualification than, cv2; otherwise, the program is ill-formed. */
1823 if (related_p
&& !at_least_as_qualified_p (to
, from
))
1829 /* Returns the implicit conversion sequence (see [over.ics]) from type
1830 FROM to type TO. The optional expression EXPR may affect the
1831 conversion. FLAGS are the usual overloading flags. If C_CAST_P is
1832 true, this conversion is coming from a C-style cast. */
1835 implicit_conversion (tree to
, tree from
, tree expr
, bool c_cast_p
,
1836 int flags
, tsubst_flags_t complain
)
1840 if (from
== error_mark_node
|| to
== error_mark_node
1841 || expr
== error_mark_node
)
1844 /* Other flags only apply to the primary function in overload
1845 resolution, or after we've chosen one. */
1846 flags
&= (LOOKUP_ONLYCONVERTING
|LOOKUP_NO_CONVERSION
|LOOKUP_COPY_PARM
1847 |LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
|LOOKUP_PREFER_RVALUE
1848 |LOOKUP_NO_NARROWING
|LOOKUP_PROTECT
|LOOKUP_NO_NON_INTEGRAL
);
1850 /* FIXME: actually we don't want warnings either, but we can't just
1851 have 'complain &= ~(tf_warning|tf_error)' because it would cause
1852 the regression of, eg, g++.old-deja/g++.benjamin/16077.C.
1853 We really ought not to issue that warning until we've committed
1854 to that conversion. */
1855 complain
&= ~tf_error
;
1857 /* Call reshape_init early to remove redundant braces. */
1858 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
)
1859 && CLASS_TYPE_P (to
)
1860 && COMPLETE_TYPE_P (complete_type (to
))
1861 && !CLASSTYPE_NON_AGGREGATE (to
))
1863 expr
= reshape_init (to
, expr
, complain
);
1864 if (expr
== error_mark_node
)
1866 from
= TREE_TYPE (expr
);
1869 if (TYPE_REF_P (to
))
1870 conv
= reference_binding (to
, from
, expr
, c_cast_p
, flags
, complain
);
1872 conv
= standard_conversion (to
, from
, expr
, c_cast_p
, flags
, complain
);
1877 if (expr
&& BRACE_ENCLOSED_INITIALIZER_P (expr
))
1879 if (is_std_init_list (to
))
1880 return build_list_conv (to
, expr
, flags
, complain
);
1882 /* As an extension, allow list-initialization of _Complex. */
1883 if (TREE_CODE (to
) == COMPLEX_TYPE
)
1885 conv
= build_complex_conv (to
, expr
, flags
, complain
);
1890 /* Allow conversion from an initializer-list with one element to a
1892 if (SCALAR_TYPE_P (to
))
1894 int nelts
= CONSTRUCTOR_NELTS (expr
);
1898 elt
= build_value_init (to
, tf_none
);
1899 else if (nelts
== 1)
1900 elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1902 elt
= error_mark_node
;
1904 conv
= implicit_conversion (to
, TREE_TYPE (elt
), elt
,
1905 c_cast_p
, flags
, complain
);
1908 conv
->check_narrowing
= true;
1909 if (BRACE_ENCLOSED_INITIALIZER_P (elt
))
1910 /* Too many levels of braces, i.e. '{{1}}'. */
1915 else if (TREE_CODE (to
) == ARRAY_TYPE
)
1916 return build_array_conv (to
, expr
, flags
, complain
);
1919 if (expr
!= NULL_TREE
1920 && (MAYBE_CLASS_TYPE_P (from
)
1921 || MAYBE_CLASS_TYPE_P (to
))
1922 && (flags
& LOOKUP_NO_CONVERSION
) == 0)
1924 struct z_candidate
*cand
;
1926 if (CLASS_TYPE_P (to
)
1927 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
1928 && !CLASSTYPE_NON_AGGREGATE (complete_type (to
)))
1929 return build_aggr_conv (to
, expr
, flags
, complain
);
1931 cand
= build_user_type_conversion_1 (to
, expr
, flags
, complain
);
1934 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
1935 && CONSTRUCTOR_NELTS (expr
) == 1
1936 && !is_list_ctor (cand
->fn
))
1938 /* "If C is not an initializer-list constructor and the
1939 initializer list has a single element of type cv U, where U is
1940 X or a class derived from X, the implicit conversion sequence
1941 has Exact Match rank if U is X, or Conversion rank if U is
1943 tree elt
= CONSTRUCTOR_ELT (expr
, 0)->value
;
1944 tree elttype
= TREE_TYPE (elt
);
1945 if (reference_related_p (to
, elttype
))
1946 return implicit_conversion (to
, elttype
, elt
,
1947 c_cast_p
, flags
, complain
);
1949 conv
= cand
->second_conv
;
1952 /* We used to try to bind a reference to a temporary here, but that
1953 is now handled after the recursive call to this function at the end
1954 of reference_binding. */
1961 /* Like implicit_conversion, but return NULL if the conversion is bad.
1963 This is not static so that check_non_deducible_conversion can call it within
1964 add_template_candidate_real as part of overload resolution; it should not be
1965 called outside of overload resolution. */
1968 good_conversion (tree to
, tree from
, tree expr
,
1969 int flags
, tsubst_flags_t complain
)
1971 conversion
*c
= implicit_conversion (to
, from
, expr
, /*cast*/false,
1978 /* Add a new entry to the list of candidates. Used by the add_*_candidate
1979 functions. ARGS will not be changed until a single candidate is
1982 static struct z_candidate
*
1983 add_candidate (struct z_candidate
**candidates
,
1984 tree fn
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
1985 size_t num_convs
, conversion
**convs
,
1986 tree access_path
, tree conversion_path
,
1987 int viable
, struct rejection_reason
*reason
,
1990 struct z_candidate
*cand
= (struct z_candidate
*)
1991 conversion_obstack_alloc (sizeof (struct z_candidate
));
1994 cand
->first_arg
= first_arg
;
1996 cand
->convs
= convs
;
1997 cand
->num_convs
= num_convs
;
1998 cand
->access_path
= access_path
;
1999 cand
->conversion_path
= conversion_path
;
2000 cand
->viable
= viable
;
2001 cand
->reason
= reason
;
2002 cand
->next
= *candidates
;
2003 cand
->flags
= flags
;
2009 /* Return the number of remaining arguments in the parameter list
2010 beginning with ARG. */
2013 remaining_arguments (tree arg
)
2017 for (n
= 0; arg
!= NULL_TREE
&& arg
!= void_list_node
;
2018 arg
= TREE_CHAIN (arg
))
2024 /* [over.match.copy]: When initializing a temporary object (12.2) to be bound
2025 to the first parameter of a constructor where the parameter is of type
2026 "reference to possibly cv-qualified T" and the constructor is called with a
2027 single argument in the context of direct-initialization of an object of type
2028 "cv2 T", explicit conversion functions are also considered.
2030 So set LOOKUP_COPY_PARM to let reference_binding know that
2031 it's being called in that context. */
2034 conv_flags (int i
, int nargs
, tree fn
, tree arg
, int flags
)
2038 if (i
== 0 && nargs
== 1 && DECL_CONSTRUCTOR_P (fn
)
2039 && (t
= FUNCTION_FIRST_USER_PARMTYPE (fn
))
2040 && (same_type_ignoring_top_level_qualifiers_p
2041 (non_reference (TREE_VALUE (t
)), DECL_CONTEXT (fn
))))
2043 if (!(flags
& LOOKUP_ONLYCONVERTING
))
2044 lflags
|= LOOKUP_COPY_PARM
;
2045 if ((flags
& LOOKUP_LIST_INIT_CTOR
)
2046 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
2047 lflags
|= LOOKUP_NO_CONVERSION
;
2050 lflags
|= LOOKUP_ONLYCONVERTING
;
2055 /* Create an overload candidate for the function or method FN called
2056 with the argument list FIRST_ARG/ARGS and add it to CANDIDATES.
2057 FLAGS is passed on to implicit_conversion.
2059 This does not change ARGS.
2061 CTYPE, if non-NULL, is the type we want to pretend this function
2062 comes from for purposes of overload resolution. */
2064 static struct z_candidate
*
2065 add_function_candidate (struct z_candidate
**candidates
,
2066 tree fn
, tree ctype
, tree first_arg
,
2067 const vec
<tree
, va_gc
> *args
, tree access_path
,
2068 tree conversion_path
, int flags
,
2070 tsubst_flags_t complain
)
2072 tree parmlist
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
2075 tree orig_first_arg
= first_arg
;
2078 struct rejection_reason
*reason
= NULL
;
2080 /* At this point we should not see any functions which haven't been
2081 explicitly declared, except for friend functions which will have
2082 been found using argument dependent lookup. */
2083 gcc_assert (!DECL_ANTICIPATED (fn
) || DECL_HIDDEN_FRIEND_P (fn
));
2085 /* The `this', `in_chrg' and VTT arguments to constructors are not
2086 considered in overload resolution. */
2087 if (DECL_CONSTRUCTOR_P (fn
))
2089 if (ctor_omit_inherited_parms (fn
))
2090 /* Bring back parameters omitted from an inherited ctor. */
2091 parmlist
= FUNCTION_FIRST_USER_PARMTYPE (DECL_ORIGIN (fn
));
2093 parmlist
= skip_artificial_parms_for (fn
, parmlist
);
2094 skip
= num_artificial_parms_for (fn
);
2095 if (skip
> 0 && first_arg
!= NULL_TREE
)
2098 first_arg
= NULL_TREE
;
2104 len
= vec_safe_length (args
) - skip
+ (first_arg
!= NULL_TREE
? 1 : 0);
2106 convs
= alloc_conversions (len
);
2108 /* 13.3.2 - Viable functions [over.match.viable]
2109 First, to be a viable function, a candidate function shall have enough
2110 parameters to agree in number with the arguments in the list.
2112 We need to check this first; otherwise, checking the ICSes might cause
2113 us to produce an ill-formed template instantiation. */
2115 parmnode
= parmlist
;
2116 for (i
= 0; i
< len
; ++i
)
2118 if (parmnode
== NULL_TREE
|| parmnode
== void_list_node
)
2120 parmnode
= TREE_CHAIN (parmnode
);
2123 if ((i
< len
&& parmnode
)
2124 || !sufficient_parms_p (parmnode
))
2126 int remaining
= remaining_arguments (parmnode
);
2128 reason
= arity_rejection (first_arg
, i
+ remaining
, len
);
2131 /* An inherited constructor (12.6.3 [class.inhctor.init]) that has a first
2132 parameter of type "reference to cv C" (including such a constructor
2133 instantiated from a template) is excluded from the set of candidate
2134 functions when used to construct an object of type D with an argument list
2135 containing a single argument if C is reference-related to D. */
2136 if (viable
&& len
== 1 && parmlist
&& DECL_CONSTRUCTOR_P (fn
)
2137 && flag_new_inheriting_ctors
2138 && DECL_INHERITED_CTOR (fn
))
2140 tree ptype
= non_reference (TREE_VALUE (parmlist
));
2141 tree dtype
= DECL_CONTEXT (fn
);
2142 tree btype
= DECL_INHERITED_CTOR_BASE (fn
);
2143 if (reference_related_p (ptype
, dtype
)
2144 && reference_related_p (btype
, ptype
))
2147 reason
= inherited_ctor_rejection ();
2151 /* Second, for a function to be viable, its constraints must be
2153 if (flag_concepts
&& viable
2154 && !constraints_satisfied_p (fn
))
2156 reason
= constraint_failure (fn
);
2160 /* When looking for a function from a subobject from an implicit
2161 copy/move constructor/operator=, don't consider anything that takes (a
2162 reference to) an unrelated type. See c++/44909 and core 1092. */
2163 if (viable
&& parmlist
&& (flags
& LOOKUP_DEFAULTED
))
2165 if (DECL_CONSTRUCTOR_P (fn
))
2167 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
2168 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
))
2174 parmnode
= chain_index (i
-1, parmlist
);
2175 if (!reference_related_p (non_reference (TREE_VALUE (parmnode
)),
2180 /* This only applies at the top level. */
2181 flags
&= ~LOOKUP_DEFAULTED
;
2187 /* Third, for F to be a viable function, there shall exist for each
2188 argument an implicit conversion sequence that converts that argument
2189 to the corresponding parameter of F. */
2191 parmnode
= parmlist
;
2193 for (i
= 0; i
< len
; ++i
)
2195 tree argtype
, to_type
;
2200 if (parmnode
== void_list_node
)
2205 /* Already set during deduction. */
2206 parmnode
= TREE_CHAIN (parmnode
);
2210 if (i
== 0 && first_arg
!= NULL_TREE
)
2213 arg
= CONST_CAST_TREE (
2214 (*args
)[i
+ skip
- (first_arg
!= NULL_TREE
? 1 : 0)]);
2215 argtype
= lvalue_type (arg
);
2217 is_this
= (i
== 0 && DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
)
2218 && ! DECL_CONSTRUCTOR_P (fn
));
2222 tree parmtype
= TREE_VALUE (parmnode
);
2224 parmnode
= TREE_CHAIN (parmnode
);
2226 /* The type of the implicit object parameter ('this') for
2227 overload resolution is not always the same as for the
2228 function itself; conversion functions are considered to
2229 be members of the class being converted, and functions
2230 introduced by a using-declaration are considered to be
2231 members of the class that uses them.
2233 Since build_over_call ignores the ICS for the `this'
2234 parameter, we can just change the parm type. */
2235 if (ctype
&& is_this
)
2237 parmtype
= cp_build_qualified_type
2238 (ctype
, cp_type_quals (TREE_TYPE (parmtype
)));
2239 if (FUNCTION_REF_QUALIFIED (TREE_TYPE (fn
)))
2241 /* If the function has a ref-qualifier, the implicit
2242 object parameter has reference type. */
2243 bool rv
= FUNCTION_RVALUE_QUALIFIED (TREE_TYPE (fn
));
2244 parmtype
= cp_build_reference_type (parmtype
, rv
);
2245 /* The special handling of 'this' conversions in compare_ics
2246 does not apply if there is a ref-qualifier. */
2251 parmtype
= build_pointer_type (parmtype
);
2252 /* We don't use build_this here because we don't want to
2253 capture the object argument until we've chosen a
2254 non-static member function. */
2255 arg
= build_address (arg
);
2256 argtype
= lvalue_type (arg
);
2260 int lflags
= conv_flags (i
, len
-skip
, fn
, arg
, flags
);
2262 t
= implicit_conversion (parmtype
, argtype
, arg
,
2263 /*c_cast_p=*/false, lflags
, complain
);
2268 t
= build_identity_conv (argtype
, arg
);
2269 t
->ellipsis_p
= true;
2280 reason
= arg_conversion_rejection (first_arg
, i
, argtype
, to_type
,
2281 EXPR_LOCATION (arg
));
2288 reason
= bad_arg_conversion_rejection (first_arg
, i
, arg
, to_type
,
2289 EXPR_LOCATION (arg
));
2295 return add_candidate (candidates
, fn
, orig_first_arg
, args
, len
, convs
,
2296 access_path
, conversion_path
, viable
, reason
, flags
);
2299 /* Create an overload candidate for the conversion function FN which will
2300 be invoked for expression OBJ, producing a pointer-to-function which
2301 will in turn be called with the argument list FIRST_ARG/ARGLIST,
2302 and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
2303 passed on to implicit_conversion.
2305 Actually, we don't really care about FN; we care about the type it
2306 converts to. There may be multiple conversion functions that will
2307 convert to that type, and we rely on build_user_type_conversion_1 to
2308 choose the best one; so when we create our candidate, we record the type
2309 instead of the function. */
2311 static struct z_candidate
*
2312 add_conv_candidate (struct z_candidate
**candidates
, tree fn
, tree obj
,
2313 const vec
<tree
, va_gc
> *arglist
,
2314 tree access_path
, tree conversion_path
,
2315 tsubst_flags_t complain
)
2317 tree totype
= TREE_TYPE (TREE_TYPE (fn
));
2318 int i
, len
, viable
, flags
;
2319 tree parmlist
, parmnode
;
2321 struct rejection_reason
*reason
;
2323 for (parmlist
= totype
; TREE_CODE (parmlist
) != FUNCTION_TYPE
; )
2324 parmlist
= TREE_TYPE (parmlist
);
2325 parmlist
= TYPE_ARG_TYPES (parmlist
);
2327 len
= vec_safe_length (arglist
) + 1;
2328 convs
= alloc_conversions (len
);
2329 parmnode
= parmlist
;
2331 flags
= LOOKUP_IMPLICIT
;
2334 /* Don't bother looking up the same type twice. */
2335 if (*candidates
&& (*candidates
)->fn
== totype
)
2338 for (i
= 0; i
< len
; ++i
)
2340 tree arg
, argtype
, convert_type
= NULL_TREE
;
2346 arg
= (*arglist
)[i
- 1];
2347 argtype
= lvalue_type (arg
);
2351 t
= build_identity_conv (argtype
, NULL_TREE
);
2352 t
= build_conv (ck_user
, totype
, t
);
2353 /* Leave the 'cand' field null; we'll figure out the conversion in
2354 convert_like_real if this candidate is chosen. */
2355 convert_type
= totype
;
2357 else if (parmnode
== void_list_node
)
2361 t
= implicit_conversion (TREE_VALUE (parmnode
), argtype
, arg
,
2362 /*c_cast_p=*/false, flags
, complain
);
2363 convert_type
= TREE_VALUE (parmnode
);
2367 t
= build_identity_conv (argtype
, arg
);
2368 t
->ellipsis_p
= true;
2369 convert_type
= argtype
;
2379 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, arg
, convert_type
,
2380 EXPR_LOCATION (arg
));
2387 parmnode
= TREE_CHAIN (parmnode
);
2391 || ! sufficient_parms_p (parmnode
))
2393 int remaining
= remaining_arguments (parmnode
);
2395 reason
= arity_rejection (NULL_TREE
, i
+ remaining
, len
);
2398 return add_candidate (candidates
, totype
, obj
, arglist
, len
, convs
,
2399 access_path
, conversion_path
, viable
, reason
, flags
);
2403 build_builtin_candidate (struct z_candidate
**candidates
, tree fnname
,
2404 tree type1
, tree type2
, tree
*args
, tree
*argtypes
,
2405 int flags
, tsubst_flags_t complain
)
2412 struct rejection_reason
*reason
= NULL
;
2417 num_convs
= args
[2] ? 3 : (args
[1] ? 2 : 1);
2418 convs
= alloc_conversions (num_convs
);
2420 /* TRUTH_*_EXPR do "contextual conversion to bool", which means explicit
2421 conversion ops are allowed. We handle that here by just checking for
2422 boolean_type_node because other operators don't ask for it. COND_EXPR
2423 also does contextual conversion to bool for the first operand, but we
2424 handle that in build_conditional_expr, and type1 here is operand 2. */
2425 if (type1
!= boolean_type_node
)
2426 flags
|= LOOKUP_ONLYCONVERTING
;
2428 for (i
= 0; i
< 2; ++i
)
2433 t
= implicit_conversion (types
[i
], argtypes
[i
], args
[i
],
2434 /*c_cast_p=*/false, flags
, complain
);
2438 /* We need something for printing the candidate. */
2439 t
= build_identity_conv (types
[i
], NULL_TREE
);
2440 reason
= arg_conversion_rejection (NULL_TREE
, i
, argtypes
[i
],
2441 types
[i
], EXPR_LOCATION (args
[i
]));
2446 reason
= bad_arg_conversion_rejection (NULL_TREE
, i
, args
[i
],
2448 EXPR_LOCATION (args
[i
]));
2453 /* For COND_EXPR we rearranged the arguments; undo that now. */
2456 convs
[2] = convs
[1];
2457 convs
[1] = convs
[0];
2458 t
= implicit_conversion (boolean_type_node
, argtypes
[2], args
[2],
2459 /*c_cast_p=*/false, flags
,
2466 reason
= arg_conversion_rejection (NULL_TREE
, 0, argtypes
[2],
2468 EXPR_LOCATION (args
[2]));
2472 add_candidate (candidates
, fnname
, /*first_arg=*/NULL_TREE
, /*args=*/NULL
,
2474 /*access_path=*/NULL_TREE
,
2475 /*conversion_path=*/NULL_TREE
,
2476 viable
, reason
, flags
);
2480 is_complete (tree t
)
2482 return COMPLETE_TYPE_P (complete_type (t
));
2485 /* Returns nonzero if TYPE is a promoted arithmetic type. */
2488 promoted_arithmetic_type_p (tree type
)
2492 In this section, the term promoted integral type is used to refer
2493 to those integral types which are preserved by integral promotion
2494 (including e.g. int and long but excluding e.g. char).
2495 Similarly, the term promoted arithmetic type refers to promoted
2496 integral types plus floating types. */
2497 return ((CP_INTEGRAL_TYPE_P (type
)
2498 && same_type_p (type_promotes_to (type
), type
))
2499 || TREE_CODE (type
) == REAL_TYPE
);
2502 /* Create any builtin operator overload candidates for the operator in
2503 question given the converted operand types TYPE1 and TYPE2. The other
2504 args are passed through from add_builtin_candidates to
2505 build_builtin_candidate.
2507 TYPE1 and TYPE2 may not be permissible, and we must filter them.
2508 If CODE is requires candidates operands of the same type of the kind
2509 of which TYPE1 and TYPE2 are, we add both candidates
2510 CODE (TYPE1, TYPE1) and CODE (TYPE2, TYPE2). */
2513 add_builtin_candidate (struct z_candidate
**candidates
, enum tree_code code
,
2514 enum tree_code code2
, tree fnname
, tree type1
,
2515 tree type2
, tree
*args
, tree
*argtypes
, int flags
,
2516 tsubst_flags_t complain
)
2520 case POSTINCREMENT_EXPR
:
2521 case POSTDECREMENT_EXPR
:
2522 args
[1] = integer_zero_node
;
2523 type2
= integer_type_node
;
2532 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2533 and VQ is either volatile or empty, there exist candidate operator
2534 functions of the form
2535 VQ T& operator++(VQ T&);
2536 T operator++(VQ T&, int);
2537 5 For every pair T, VQ), where T is an enumeration type or an arithmetic
2538 type other than bool, and VQ is either volatile or empty, there exist
2539 candidate operator functions of the form
2540 VQ T& operator--(VQ T&);
2541 T operator--(VQ T&, int);
2542 6 For every pair T, VQ), where T is a cv-qualified or cv-unqualified
2543 complete object type, and VQ is either volatile or empty, there exist
2544 candidate operator functions of the form
2545 T*VQ& operator++(T*VQ&);
2546 T*VQ& operator--(T*VQ&);
2547 T* operator++(T*VQ&, int);
2548 T* operator--(T*VQ&, int); */
2550 case POSTDECREMENT_EXPR
:
2551 case PREDECREMENT_EXPR
:
2552 if (TREE_CODE (type1
) == BOOLEAN_TYPE
)
2555 case POSTINCREMENT_EXPR
:
2556 case PREINCREMENT_EXPR
:
2557 if (ARITHMETIC_TYPE_P (type1
) || TYPE_PTROB_P (type1
))
2559 type1
= build_reference_type (type1
);
2564 /* 7 For every cv-qualified or cv-unqualified object type T, there
2565 exist candidate operator functions of the form
2569 8 For every function type T, there exist candidate operator functions of
2571 T& operator*(T*); */
2574 if (TYPE_PTR_P (type1
)
2575 && (TYPE_PTROB_P (type1
)
2576 || TREE_CODE (TREE_TYPE (type1
)) == FUNCTION_TYPE
))
2580 /* 9 For every type T, there exist candidate operator functions of the form
2583 10For every promoted arithmetic type T, there exist candidate operator
2584 functions of the form
2588 case UNARY_PLUS_EXPR
: /* unary + */
2589 if (TYPE_PTR_P (type1
))
2593 if (ARITHMETIC_TYPE_P (type1
))
2597 /* 11For every promoted integral type T, there exist candidate operator
2598 functions of the form
2602 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
))
2606 /* 12For every quintuple C1, C2, T, CV1, CV2), where C2 is a class type, C1
2607 is the same type as C2 or is a derived class of C2, T is a complete
2608 object type or a function type, and CV1 and CV2 are cv-qualifier-seqs,
2609 there exist candidate operator functions of the form
2610 CV12 T& operator->*(CV1 C1*, CV2 T C2::*);
2611 where CV12 is the union of CV1 and CV2. */
2614 if (TYPE_PTR_P (type1
) && TYPE_PTRMEM_P (type2
))
2616 tree c1
= TREE_TYPE (type1
);
2617 tree c2
= TYPE_PTRMEM_CLASS_TYPE (type2
);
2619 if (MAYBE_CLASS_TYPE_P (c1
) && DERIVED_FROM_P (c2
, c1
)
2620 && (TYPE_PTRMEMFUNC_P (type2
)
2621 || is_complete (TYPE_PTRMEM_POINTED_TO_TYPE (type2
))))
2626 /* 13For every pair of promoted arithmetic types L and R, there exist can-
2627 didate operator functions of the form
2632 bool operator<(L, R);
2633 bool operator>(L, R);
2634 bool operator<=(L, R);
2635 bool operator>=(L, R);
2636 bool operator==(L, R);
2637 bool operator!=(L, R);
2638 where LR is the result of the usual arithmetic conversions between
2641 14For every pair of types T and I, where T is a cv-qualified or cv-
2642 unqualified complete object type and I is a promoted integral type,
2643 there exist candidate operator functions of the form
2644 T* operator+(T*, I);
2645 T& operator[](T*, I);
2646 T* operator-(T*, I);
2647 T* operator+(I, T*);
2648 T& operator[](I, T*);
2650 15For every T, where T is a pointer to complete object type, there exist
2651 candidate operator functions of the form112)
2652 ptrdiff_t operator-(T, T);
2654 16For every pointer or enumeration type T, there exist candidate operator
2655 functions of the form
2656 bool operator<(T, T);
2657 bool operator>(T, T);
2658 bool operator<=(T, T);
2659 bool operator>=(T, T);
2660 bool operator==(T, T);
2661 bool operator!=(T, T);
2663 17For every pointer to member type T, there exist candidate operator
2664 functions of the form
2665 bool operator==(T, T);
2666 bool operator!=(T, T); */
2669 if (TYPE_PTROB_P (type1
) && TYPE_PTROB_P (type2
))
2671 if (TYPE_PTROB_P (type1
)
2672 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2674 type2
= ptrdiff_type_node
;
2679 case TRUNC_DIV_EXPR
:
2680 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2686 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2687 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
)))
2689 if (TYPE_PTRMEM_P (type1
) && null_ptr_cst_p (args
[1]))
2694 if (TYPE_PTRMEM_P (type2
) && null_ptr_cst_p (args
[0]))
2706 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2708 if (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2710 if (TREE_CODE (type1
) == ENUMERAL_TYPE
2711 && TREE_CODE (type2
) == ENUMERAL_TYPE
)
2713 if (TYPE_PTR_P (type1
)
2714 && null_ptr_cst_p (args
[1]))
2719 if (null_ptr_cst_p (args
[0])
2720 && TYPE_PTR_P (type2
))
2728 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2732 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && TYPE_PTROB_P (type2
))
2734 type1
= ptrdiff_type_node
;
2737 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2739 type2
= ptrdiff_type_node
;
2744 /* 18For every pair of promoted integral types L and R, there exist candi-
2745 date operator functions of the form
2752 where LR is the result of the usual arithmetic conversions between
2755 case TRUNC_MOD_EXPR
:
2761 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2765 /* 19For every triple L, VQ, R), where L is an arithmetic or enumeration
2766 type, VQ is either volatile or empty, and R is a promoted arithmetic
2767 type, there exist candidate operator functions of the form
2768 VQ L& operator=(VQ L&, R);
2769 VQ L& operator*=(VQ L&, R);
2770 VQ L& operator/=(VQ L&, R);
2771 VQ L& operator+=(VQ L&, R);
2772 VQ L& operator-=(VQ L&, R);
2774 20For every pair T, VQ), where T is any type and VQ is either volatile
2775 or empty, there exist candidate operator functions of the form
2776 T*VQ& operator=(T*VQ&, T*);
2778 21For every pair T, VQ), where T is a pointer to member type and VQ is
2779 either volatile or empty, there exist candidate operator functions of
2781 VQ T& operator=(VQ T&, T);
2783 22For every triple T, VQ, I), where T is a cv-qualified or cv-
2784 unqualified complete object type, VQ is either volatile or empty, and
2785 I is a promoted integral type, there exist candidate operator func-
2787 T*VQ& operator+=(T*VQ&, I);
2788 T*VQ& operator-=(T*VQ&, I);
2790 23For every triple L, VQ, R), where L is an integral or enumeration
2791 type, VQ is either volatile or empty, and R is a promoted integral
2792 type, there exist candidate operator functions of the form
2794 VQ L& operator%=(VQ L&, R);
2795 VQ L& operator<<=(VQ L&, R);
2796 VQ L& operator>>=(VQ L&, R);
2797 VQ L& operator&=(VQ L&, R);
2798 VQ L& operator^=(VQ L&, R);
2799 VQ L& operator|=(VQ L&, R); */
2806 if (TYPE_PTROB_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2808 type2
= ptrdiff_type_node
;
2813 case TRUNC_DIV_EXPR
:
2814 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2818 case TRUNC_MOD_EXPR
:
2824 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type1
) && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type2
))
2829 if (ARITHMETIC_TYPE_P (type1
) && ARITHMETIC_TYPE_P (type2
))
2831 if ((TYPE_PTRMEMFUNC_P (type1
) && TYPE_PTRMEMFUNC_P (type2
))
2832 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2833 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2834 || ((TYPE_PTRMEMFUNC_P (type1
)
2835 || TYPE_PTR_P (type1
))
2836 && null_ptr_cst_p (args
[1])))
2846 type1
= build_reference_type (type1
);
2852 For every pair of promoted arithmetic types L and R, there
2853 exist candidate operator functions of the form
2855 LR operator?(bool, L, R);
2857 where LR is the result of the usual arithmetic conversions
2858 between types L and R.
2860 For every type T, where T is a pointer or pointer-to-member
2861 type, there exist candidate operator functions of the form T
2862 operator?(bool, T, T); */
2864 if (promoted_arithmetic_type_p (type1
)
2865 && promoted_arithmetic_type_p (type2
))
2869 /* Otherwise, the types should be pointers. */
2870 if (!TYPE_PTR_OR_PTRMEM_P (type1
) || !TYPE_PTR_OR_PTRMEM_P (type2
))
2873 /* We don't check that the two types are the same; the logic
2874 below will actually create two candidates; one in which both
2875 parameter types are TYPE1, and one in which both parameter
2881 if (ARITHMETIC_TYPE_P (type1
))
2889 /* Make sure we don't create builtin candidates with dependent types. */
2890 bool u1
= uses_template_parms (type1
);
2891 bool u2
= type2
? uses_template_parms (type2
) : false;
2894 /* Try to recover if one of the types is non-dependent. But if
2895 there's only one type, there's nothing we can do. */
2898 /* And we lose if both are dependent. */
2901 /* Or if they have different forms. */
2902 if (TREE_CODE (type1
) != TREE_CODE (type2
))
2911 /* If we're dealing with two pointer types or two enumeral types,
2912 we need candidates for both of them. */
2913 if (type2
&& !same_type_p (type1
, type2
)
2914 && TREE_CODE (type1
) == TREE_CODE (type2
)
2915 && (TYPE_REF_P (type1
)
2916 || (TYPE_PTR_P (type1
) && TYPE_PTR_P (type2
))
2917 || (TYPE_PTRDATAMEM_P (type1
) && TYPE_PTRDATAMEM_P (type2
))
2918 || TYPE_PTRMEMFUNC_P (type1
)
2919 || MAYBE_CLASS_TYPE_P (type1
)
2920 || TREE_CODE (type1
) == ENUMERAL_TYPE
))
2922 if (TYPE_PTR_OR_PTRMEM_P (type1
))
2924 tree cptype
= composite_pointer_type (type1
, type2
,
2929 if (cptype
!= error_mark_node
)
2931 build_builtin_candidate
2932 (candidates
, fnname
, cptype
, cptype
, args
, argtypes
,
2938 build_builtin_candidate
2939 (candidates
, fnname
, type1
, type1
, args
, argtypes
, flags
, complain
);
2940 build_builtin_candidate
2941 (candidates
, fnname
, type2
, type2
, args
, argtypes
, flags
, complain
);
2945 build_builtin_candidate
2946 (candidates
, fnname
, type1
, type2
, args
, argtypes
, flags
, complain
);
2950 type_decays_to (tree type
)
2952 if (TREE_CODE (type
) == ARRAY_TYPE
)
2953 return build_pointer_type (TREE_TYPE (type
));
2954 if (TREE_CODE (type
) == FUNCTION_TYPE
)
2955 return build_pointer_type (type
);
2959 /* There are three conditions of builtin candidates:
2961 1) bool-taking candidates. These are the same regardless of the input.
2962 2) pointer-pair taking candidates. These are generated for each type
2963 one of the input types converts to.
2964 3) arithmetic candidates. According to the standard, we should generate
2965 all of these, but I'm trying not to...
2967 Here we generate a superset of the possible candidates for this particular
2968 case. That is a subset of the full set the standard defines, plus some
2969 other cases which the standard disallows. add_builtin_candidate will
2970 filter out the invalid set. */
2973 add_builtin_candidates (struct z_candidate
**candidates
, enum tree_code code
,
2974 enum tree_code code2
, tree fnname
, tree
*args
,
2975 int flags
, tsubst_flags_t complain
)
2979 tree type
, argtypes
[3], t
;
2980 /* TYPES[i] is the set of possible builtin-operator parameter types
2981 we will consider for the Ith argument. */
2982 vec
<tree
, va_gc
> *types
[2];
2985 for (i
= 0; i
< 3; ++i
)
2988 argtypes
[i
] = unlowered_expr_type (args
[i
]);
2990 argtypes
[i
] = NULL_TREE
;
2995 /* 4 For every pair T, VQ), where T is an arithmetic or enumeration type,
2996 and VQ is either volatile or empty, there exist candidate operator
2997 functions of the form
2998 VQ T& operator++(VQ T&); */
3000 case POSTINCREMENT_EXPR
:
3001 case PREINCREMENT_EXPR
:
3002 case POSTDECREMENT_EXPR
:
3003 case PREDECREMENT_EXPR
:
3008 /* 24There also exist candidate operator functions of the form
3009 bool operator!(bool);
3010 bool operator&&(bool, bool);
3011 bool operator||(bool, bool); */
3013 case TRUTH_NOT_EXPR
:
3014 build_builtin_candidate
3015 (candidates
, fnname
, boolean_type_node
,
3016 NULL_TREE
, args
, argtypes
, flags
, complain
);
3019 case TRUTH_ORIF_EXPR
:
3020 case TRUTH_ANDIF_EXPR
:
3021 build_builtin_candidate
3022 (candidates
, fnname
, boolean_type_node
,
3023 boolean_type_node
, args
, argtypes
, flags
, complain
);
3045 types
[0] = make_tree_vector ();
3046 types
[1] = make_tree_vector ();
3048 for (i
= 0; i
< 2; ++i
)
3052 else if (MAYBE_CLASS_TYPE_P (argtypes
[i
]))
3056 if (i
== 0 && code
== MODIFY_EXPR
&& code2
== NOP_EXPR
)
3059 convs
= lookup_conversions (argtypes
[i
]);
3061 if (code
== COND_EXPR
)
3063 if (lvalue_p (args
[i
]))
3064 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3066 vec_safe_push (types
[i
], TYPE_MAIN_VARIANT (argtypes
[i
]));
3072 for (; convs
; convs
= TREE_CHAIN (convs
))
3074 type
= TREE_TYPE (convs
);
3077 && (!TYPE_REF_P (type
)
3078 || CP_TYPE_CONST_P (TREE_TYPE (type
))))
3081 if (code
== COND_EXPR
&& TYPE_REF_P (type
))
3082 vec_safe_push (types
[i
], type
);
3084 type
= non_reference (type
);
3085 if (i
!= 0 || ! ref1
)
3087 type
= cv_unqualified (type_decays_to (type
));
3088 if (enum_p
&& TREE_CODE (type
) == ENUMERAL_TYPE
)
3089 vec_safe_push (types
[i
], type
);
3090 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3091 type
= type_promotes_to (type
);
3094 if (! vec_member (type
, types
[i
]))
3095 vec_safe_push (types
[i
], type
);
3100 if (code
== COND_EXPR
&& lvalue_p (args
[i
]))
3101 vec_safe_push (types
[i
], build_reference_type (argtypes
[i
]));
3102 type
= non_reference (argtypes
[i
]);
3103 if (i
!= 0 || ! ref1
)
3105 type
= cv_unqualified (type_decays_to (type
));
3106 if (enum_p
&& UNSCOPED_ENUM_P (type
))
3107 vec_safe_push (types
[i
], type
);
3108 if (INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (type
))
3109 type
= type_promotes_to (type
);
3111 vec_safe_push (types
[i
], type
);
3115 /* Run through the possible parameter types of both arguments,
3116 creating candidates with those parameter types. */
3117 FOR_EACH_VEC_ELT_REVERSE (*(types
[0]), ix
, t
)
3122 if (!types
[1]->is_empty ())
3123 FOR_EACH_VEC_ELT_REVERSE (*(types
[1]), jx
, u
)
3124 add_builtin_candidate
3125 (candidates
, code
, code2
, fnname
, t
,
3126 u
, args
, argtypes
, flags
, complain
);
3128 add_builtin_candidate
3129 (candidates
, code
, code2
, fnname
, t
,
3130 NULL_TREE
, args
, argtypes
, flags
, complain
);
3133 release_tree_vector (types
[0]);
3134 release_tree_vector (types
[1]);
3138 /* If TMPL can be successfully instantiated as indicated by
3139 EXPLICIT_TARGS and ARGLIST, adds the instantiation to CANDIDATES.
3141 TMPL is the template. EXPLICIT_TARGS are any explicit template
3142 arguments. ARGLIST is the arguments provided at the call-site.
3143 This does not change ARGLIST. The RETURN_TYPE is the desired type
3144 for conversion operators. If OBJ is NULL_TREE, FLAGS and CTYPE are
3145 as for add_function_candidate. If an OBJ is supplied, FLAGS and
3146 CTYPE are ignored, and OBJ is as for add_conv_candidate. */
3148 static struct z_candidate
*
3149 add_template_candidate_real (struct z_candidate
**candidates
, tree tmpl
,
3150 tree ctype
, tree explicit_targs
, tree first_arg
,
3151 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3152 tree access_path
, tree conversion_path
,
3153 int flags
, tree obj
, unification_kind_t strict
,
3154 tsubst_flags_t complain
)
3156 int ntparms
= DECL_NTPARMS (tmpl
);
3157 tree targs
= make_tree_vec (ntparms
);
3158 unsigned int len
= vec_safe_length (arglist
);
3159 unsigned int nargs
= (first_arg
== NULL_TREE
? 0 : 1) + len
;
3160 unsigned int skip_without_in_chrg
= 0;
3161 tree first_arg_without_in_chrg
= first_arg
;
3162 tree
*args_without_in_chrg
;
3163 unsigned int nargs_without_in_chrg
;
3164 unsigned int ia
, ix
;
3166 struct z_candidate
*cand
;
3168 struct rejection_reason
*reason
= NULL
;
3170 conversion
**convs
= NULL
;
3172 /* We don't do deduction on the in-charge parameter, the VTT
3173 parameter or 'this'. */
3174 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (tmpl
))
3176 if (first_arg_without_in_chrg
!= NULL_TREE
)
3177 first_arg_without_in_chrg
= NULL_TREE
;
3178 else if (return_type
&& strict
== DEDUCE_CALL
)
3179 /* We're deducing for a call to the result of a template conversion
3180 function, so the args don't contain 'this'; leave them alone. */;
3182 ++skip_without_in_chrg
;
3185 if ((DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (tmpl
)
3186 || DECL_BASE_CONSTRUCTOR_P (tmpl
))
3187 && CLASSTYPE_VBASECLASSES (DECL_CONTEXT (tmpl
)))
3189 if (first_arg_without_in_chrg
!= NULL_TREE
)
3190 first_arg_without_in_chrg
= NULL_TREE
;
3192 ++skip_without_in_chrg
;
3195 if (len
< skip_without_in_chrg
)
3198 if (DECL_CONSTRUCTOR_P (tmpl
) && nargs
== 2
3199 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (first_arg
),
3200 TREE_TYPE ((*arglist
)[0])))
3202 /* 12.8/6 says, "A declaration of a constructor for a class X is
3203 ill-formed if its first parameter is of type (optionally cv-qualified)
3204 X and either there are no other parameters or else all other
3205 parameters have default arguments. A member function template is never
3206 instantiated to produce such a constructor signature."
3208 So if we're trying to copy an object of the containing class, don't
3209 consider a template constructor that has a first parameter type that
3210 is just a template parameter, as we would deduce a signature that we
3211 would then reject in the code below. */
3212 if (tree firstparm
= FUNCTION_FIRST_USER_PARMTYPE (tmpl
))
3214 firstparm
= TREE_VALUE (firstparm
);
3215 if (PACK_EXPANSION_P (firstparm
))
3216 firstparm
= PACK_EXPANSION_PATTERN (firstparm
);
3217 if (TREE_CODE (firstparm
) == TEMPLATE_TYPE_PARM
)
3219 gcc_assert (!explicit_targs
);
3220 reason
= invalid_copy_with_fn_template_rejection ();
3226 nargs_without_in_chrg
= ((first_arg_without_in_chrg
!= NULL_TREE
? 1 : 0)
3227 + (len
- skip_without_in_chrg
));
3228 args_without_in_chrg
= XALLOCAVEC (tree
, nargs_without_in_chrg
);
3230 if (first_arg_without_in_chrg
!= NULL_TREE
)
3232 args_without_in_chrg
[ia
] = first_arg_without_in_chrg
;
3235 for (ix
= skip_without_in_chrg
;
3236 vec_safe_iterate (arglist
, ix
, &arg
);
3239 args_without_in_chrg
[ia
] = arg
;
3242 gcc_assert (ia
== nargs_without_in_chrg
);
3244 errs
= errorcount
+sorrycount
;
3246 convs
= alloc_conversions (nargs
);
3247 fn
= fn_type_unification (tmpl
, explicit_targs
, targs
,
3248 args_without_in_chrg
,
3249 nargs_without_in_chrg
,
3250 return_type
, strict
, flags
, convs
,
3251 false, complain
& tf_decltype
);
3253 if (fn
== error_mark_node
)
3255 /* Don't repeat unification later if it already resulted in errors. */
3256 if (errorcount
+sorrycount
== errs
)
3257 reason
= template_unification_rejection (tmpl
, explicit_targs
,
3258 targs
, args_without_in_chrg
,
3259 nargs_without_in_chrg
,
3260 return_type
, strict
, flags
);
3262 reason
= template_unification_error_rejection ();
3266 /* Now the explicit specifier might have been deduced; check if this
3267 declaration is explicit. If it is and we're ignoring non-converting
3268 constructors, don't add this function to the set of candidates. */
3269 if ((flags
& LOOKUP_ONLYCONVERTING
) && DECL_NONCONVERTING_P (fn
))
3272 if (DECL_CONSTRUCTOR_P (fn
) && nargs
== 2)
3274 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (fn
);
3275 if (arg_types
&& same_type_p (TYPE_MAIN_VARIANT (TREE_VALUE (arg_types
)),
3278 /* We're trying to produce a constructor with a prohibited signature,
3279 as discussed above; handle here any cases we didn't catch then,
3281 reason
= invalid_copy_with_fn_template_rejection ();
3286 if (obj
!= NULL_TREE
)
3287 /* Aha, this is a conversion function. */
3288 cand
= add_conv_candidate (candidates
, fn
, obj
, arglist
,
3289 access_path
, conversion_path
, complain
);
3291 cand
= add_function_candidate (candidates
, fn
, ctype
,
3292 first_arg
, arglist
, access_path
,
3293 conversion_path
, flags
, convs
, complain
);
3294 if (DECL_TI_TEMPLATE (fn
) != tmpl
)
3295 /* This situation can occur if a member template of a template
3296 class is specialized. Then, instantiate_template might return
3297 an instantiation of the specialization, in which case the
3298 DECL_TI_TEMPLATE field will point at the original
3299 specialization. For example:
3301 template <class T> struct S { template <class U> void f(U);
3302 template <> void f(int) {}; };
3306 Here, TMPL will be template <class U> S<double>::f(U).
3307 And, instantiate template will give us the specialization
3308 template <> S<double>::f(int). But, the DECL_TI_TEMPLATE field
3309 for this will point at template <class T> template <> S<T>::f(int),
3310 so that we can find the definition. For the purposes of
3311 overload resolution, however, we want the original TMPL. */
3312 cand
->template_decl
= build_template_info (tmpl
, targs
);
3314 cand
->template_decl
= DECL_TEMPLATE_INFO (fn
);
3315 cand
->explicit_targs
= explicit_targs
;
3319 return add_candidate (candidates
, tmpl
, first_arg
, arglist
, nargs
, NULL
,
3320 access_path
, conversion_path
, 0, reason
, flags
);
3324 static struct z_candidate
*
3325 add_template_candidate (struct z_candidate
**candidates
, tree tmpl
, tree ctype
,
3326 tree explicit_targs
, tree first_arg
,
3327 const vec
<tree
, va_gc
> *arglist
, tree return_type
,
3328 tree access_path
, tree conversion_path
, int flags
,
3329 unification_kind_t strict
, tsubst_flags_t complain
)
3332 add_template_candidate_real (candidates
, tmpl
, ctype
,
3333 explicit_targs
, first_arg
, arglist
,
3334 return_type
, access_path
, conversion_path
,
3335 flags
, NULL_TREE
, strict
, complain
);
3338 /* Create an overload candidate for the conversion function template TMPL,
3339 returning RETURN_TYPE, which will be invoked for expression OBJ to produce a
3340 pointer-to-function which will in turn be called with the argument list
3341 ARGLIST, and add it to CANDIDATES. This does not change ARGLIST. FLAGS is
3342 passed on to implicit_conversion. */
3344 static struct z_candidate
*
3345 add_template_conv_candidate (struct z_candidate
**candidates
, tree tmpl
,
3347 const vec
<tree
, va_gc
> *arglist
,
3348 tree return_type
, tree access_path
,
3349 tree conversion_path
, tsubst_flags_t complain
)
3351 /* Making this work broke PR 71117 and 85118, so until the committee resolves
3352 core issue 2189, let's disable this candidate if there are any call
3358 add_template_candidate_real (candidates
, tmpl
, NULL_TREE
, NULL_TREE
,
3359 NULL_TREE
, arglist
, return_type
, access_path
,
3360 conversion_path
, 0, obj
, DEDUCE_CALL
,
3364 /* The CANDS are the set of candidates that were considered for
3365 overload resolution. Return the set of viable candidates, or CANDS
3366 if none are viable. If any of the candidates were viable, set
3367 *ANY_VIABLE_P to true. STRICT_P is true if a candidate should be
3368 considered viable only if it is strictly viable. */
3370 static struct z_candidate
*
3371 splice_viable (struct z_candidate
*cands
,
3375 struct z_candidate
*viable
;
3376 struct z_candidate
**last_viable
;
3377 struct z_candidate
**cand
;
3378 bool found_strictly_viable
= false;
3380 /* Be strict inside templates, since build_over_call won't actually
3381 do the conversions to get pedwarns. */
3382 if (processing_template_decl
)
3386 last_viable
= &viable
;
3387 *any_viable_p
= false;
3392 struct z_candidate
*c
= *cand
;
3394 && (c
->viable
== 1 || TREE_CODE (c
->fn
) == TEMPLATE_DECL
))
3396 /* Be strict in the presence of a viable candidate. Also if
3397 there are template candidates, so that we get deduction errors
3398 for them instead of silently preferring a bad conversion. */
3400 if (viable
&& !found_strictly_viable
)
3402 /* Put any spliced near matches back onto the main list so
3403 that we see them if there is no strict match. */
3404 *any_viable_p
= false;
3405 *last_viable
= cands
;
3408 last_viable
= &viable
;
3412 if (strict_p
? c
->viable
== 1 : c
->viable
)
3417 last_viable
= &c
->next
;
3418 *any_viable_p
= true;
3420 found_strictly_viable
= true;
3426 return viable
? viable
: cands
;
3430 any_strictly_viable (struct z_candidate
*cands
)
3432 for (; cands
; cands
= cands
->next
)
3433 if (cands
->viable
== 1)
3438 /* OBJ is being used in an expression like "OBJ.f (...)". In other
3439 words, it is about to become the "this" pointer for a member
3440 function call. Take the address of the object. */
3443 build_this (tree obj
)
3445 /* In a template, we are only concerned about the type of the
3446 expression, so we can take a shortcut. */
3447 if (processing_template_decl
)
3448 return build_address (obj
);
3450 return cp_build_addr_expr (obj
, tf_warning_or_error
);
3453 /* Returns true iff functions are equivalent. Equivalent functions are
3454 not '==' only if one is a function-local extern function or if
3455 both are extern "C". */
3458 equal_functions (tree fn1
, tree fn2
)
3460 if (TREE_CODE (fn1
) != TREE_CODE (fn2
))
3462 if (TREE_CODE (fn1
) == TEMPLATE_DECL
)
3464 if (DECL_LOCAL_FUNCTION_P (fn1
) || DECL_LOCAL_FUNCTION_P (fn2
)
3465 || DECL_EXTERN_C_FUNCTION_P (fn1
))
3466 return decls_match (fn1
, fn2
);
3470 /* Print information about a candidate FN being rejected due to INFO. */
3473 print_conversion_rejection (location_t loc
, struct conversion_info
*info
,
3476 tree from
= info
->from
;
3478 from
= lvalue_type (from
);
3479 if (info
->n_arg
== -1)
3481 /* Conversion of implicit `this' argument failed. */
3482 if (!TYPE_P (info
->from
))
3483 /* A bad conversion for 'this' must be discarding cv-quals. */
3484 inform (loc
, " passing %qT as %<this%> "
3485 "argument discards qualifiers",
3488 inform (loc
, " no known conversion for implicit "
3489 "%<this%> parameter from %qH to %qI",
3490 from
, info
->to_type
);
3492 else if (!TYPE_P (info
->from
))
3494 if (info
->n_arg
>= 0)
3495 inform (loc
, " conversion of argument %d would be ill-formed:",
3497 perform_implicit_conversion (info
->to_type
, info
->from
,
3498 tf_warning_or_error
);
3500 else if (info
->n_arg
== -2)
3501 /* Conversion of conversion function return value failed. */
3502 inform (loc
, " no known conversion from %qH to %qI",
3503 from
, info
->to_type
);
3506 if (TREE_CODE (fn
) == FUNCTION_DECL
)
3507 loc
= get_fndecl_argument_location (fn
, info
->n_arg
);
3508 inform (loc
, " no known conversion for argument %d from %qH to %qI",
3509 info
->n_arg
+ 1, from
, info
->to_type
);
3513 /* Print information about a candidate with WANT parameters and we found
3517 print_arity_information (location_t loc
, unsigned int have
, unsigned int want
)
3519 inform_n (loc
, want
,
3520 " candidate expects %d argument, %d provided",
3521 " candidate expects %d arguments, %d provided",
3525 /* Print information about one overload candidate CANDIDATE. MSGSTR
3526 is the text to print before the candidate itself.
3528 NOTE: Unlike most diagnostic functions in GCC, MSGSTR is expected
3529 to have been run through gettext by the caller. This wart makes
3530 life simpler in print_z_candidates and for the translators. */
3533 print_z_candidate (location_t loc
, const char *msgstr
,
3534 struct z_candidate
*candidate
)
3536 const char *msg
= (msgstr
== NULL
3538 : ACONCAT ((msgstr
, " ", NULL
)));
3539 tree fn
= candidate
->fn
;
3540 if (flag_new_inheriting_ctors
)
3541 fn
= strip_inheriting_ctors (fn
);
3542 location_t cloc
= location_of (fn
);
3544 if (identifier_p (fn
))
3547 if (candidate
->num_convs
== 3)
3548 inform (cloc
, "%s%<%D(%T, %T, %T)%> <built-in>", msg
, fn
,
3549 candidate
->convs
[0]->type
,
3550 candidate
->convs
[1]->type
,
3551 candidate
->convs
[2]->type
);
3552 else if (candidate
->num_convs
== 2)
3553 inform (cloc
, "%s%<%D(%T, %T)%> <built-in>", msg
, fn
,
3554 candidate
->convs
[0]->type
,
3555 candidate
->convs
[1]->type
);
3557 inform (cloc
, "%s%<%D(%T)%> <built-in>", msg
, fn
,
3558 candidate
->convs
[0]->type
);
3560 else if (TYPE_P (fn
))
3561 inform (cloc
, "%s%qT <conversion>", msg
, fn
);
3562 else if (candidate
->viable
== -1)
3563 inform (cloc
, "%s%#qD <near match>", msg
, fn
);
3564 else if (DECL_DELETED_FN (fn
))
3565 inform (cloc
, "%s%#qD <deleted>", msg
, fn
);
3567 inform (cloc
, "%s%#qD", msg
, fn
);
3568 if (fn
!= candidate
->fn
)
3570 cloc
= location_of (candidate
->fn
);
3571 inform (cloc
, " inherited here");
3573 /* Give the user some information about why this candidate failed. */
3574 if (candidate
->reason
!= NULL
)
3576 struct rejection_reason
*r
= candidate
->reason
;
3581 print_arity_information (cloc
, r
->u
.arity
.actual
,
3582 r
->u
.arity
.expected
);
3584 case rr_arg_conversion
:
3585 print_conversion_rejection (cloc
, &r
->u
.conversion
, fn
);
3587 case rr_bad_arg_conversion
:
3588 print_conversion_rejection (cloc
, &r
->u
.bad_conversion
, fn
);
3590 case rr_explicit_conversion
:
3591 inform (cloc
, " return type %qT of explicit conversion function "
3592 "cannot be converted to %qT with a qualification "
3593 "conversion", r
->u
.conversion
.from
,
3594 r
->u
.conversion
.to_type
);
3596 case rr_template_conversion
:
3597 inform (cloc
, " conversion from return type %qT of template "
3598 "conversion function specialization to %qT is not an "
3599 "exact match", r
->u
.conversion
.from
,
3600 r
->u
.conversion
.to_type
);
3602 case rr_template_unification
:
3603 /* We use template_unification_error_rejection if unification caused
3604 actual non-SFINAE errors, in which case we don't need to repeat
3606 if (r
->u
.template_unification
.tmpl
== NULL_TREE
)
3608 inform (cloc
, " substitution of deduced template arguments "
3609 "resulted in errors seen above");
3612 /* Re-run template unification with diagnostics. */
3613 inform (cloc
, " template argument deduction/substitution failed:");
3614 fn_type_unification (r
->u
.template_unification
.tmpl
,
3615 r
->u
.template_unification
.explicit_targs
,
3617 (r
->u
.template_unification
.num_targs
)),
3618 r
->u
.template_unification
.args
,
3619 r
->u
.template_unification
.nargs
,
3620 r
->u
.template_unification
.return_type
,
3621 r
->u
.template_unification
.strict
,
3622 r
->u
.template_unification
.flags
,
3625 case rr_invalid_copy
:
3627 " a constructor taking a single argument of its own "
3628 "class type is invalid");
3630 case rr_constraint_failure
:
3632 tree tmpl
= r
->u
.template_instantiation
.tmpl
;
3633 tree args
= r
->u
.template_instantiation
.targs
;
3634 diagnose_constraints (cloc
, tmpl
, args
);
3637 case rr_inherited_ctor
:
3638 inform (cloc
, " an inherited constructor is not a candidate for "
3639 "initialization from an expression of the same or derived "
3644 /* This candidate didn't have any issues or we failed to
3645 handle a particular code. Either way... */
3652 print_z_candidates (location_t loc
, struct z_candidate
*candidates
)
3654 struct z_candidate
*cand1
;
3655 struct z_candidate
**cand2
;
3660 /* Remove non-viable deleted candidates. */
3662 for (cand2
= &cand1
; *cand2
; )
3664 if (TREE_CODE ((*cand2
)->fn
) == FUNCTION_DECL
3665 && !(*cand2
)->viable
3666 && DECL_DELETED_FN ((*cand2
)->fn
))
3667 *cand2
= (*cand2
)->next
;
3669 cand2
= &(*cand2
)->next
;
3671 /* ...if there are any non-deleted ones. */
3675 /* There may be duplicates in the set of candidates. We put off
3676 checking this condition as long as possible, since we have no way
3677 to eliminate duplicates from a set of functions in less than n^2
3678 time. Now we are about to emit an error message, so it is more
3679 permissible to go slowly. */
3680 for (cand1
= candidates
; cand1
; cand1
= cand1
->next
)
3682 tree fn
= cand1
->fn
;
3683 /* Skip builtin candidates and conversion functions. */
3686 cand2
= &cand1
->next
;
3689 if (DECL_P ((*cand2
)->fn
)
3690 && equal_functions (fn
, (*cand2
)->fn
))
3691 *cand2
= (*cand2
)->next
;
3693 cand2
= &(*cand2
)->next
;
3697 for (; candidates
; candidates
= candidates
->next
)
3698 print_z_candidate (loc
, "candidate:", candidates
);
3701 /* USER_SEQ is a user-defined conversion sequence, beginning with a
3702 USER_CONV. STD_SEQ is the standard conversion sequence applied to
3703 the result of the conversion function to convert it to the final
3704 desired type. Merge the two sequences into a single sequence,
3705 and return the merged sequence. */
3708 merge_conversion_sequences (conversion
*user_seq
, conversion
*std_seq
)
3711 bool bad
= user_seq
->bad_p
;
3713 gcc_assert (user_seq
->kind
== ck_user
);
3715 /* Find the end of the second conversion sequence. */
3716 for (t
= &std_seq
; (*t
)->kind
!= ck_identity
; t
= &((*t
)->u
.next
))
3718 /* The entire sequence is a user-conversion sequence. */
3719 (*t
)->user_conv_p
= true;
3724 if ((*t
)->rvaluedness_matches_p
)
3725 /* We're binding a reference directly to the result of the conversion.
3726 build_user_type_conversion_1 stripped the REFERENCE_TYPE from the return
3727 type, but we want it back. */
3728 user_seq
->type
= TREE_TYPE (TREE_TYPE (user_seq
->cand
->fn
));
3730 /* Replace the identity conversion with the user conversion
3737 /* Handle overload resolution for initializing an object of class type from
3738 an initializer list. First we look for a suitable constructor that
3739 takes a std::initializer_list; if we don't find one, we then look for a
3740 non-list constructor.
3742 Parameters are as for add_candidates, except that the arguments are in
3743 the form of a CONSTRUCTOR (the initializer list) rather than a vector, and
3744 the RETURN_TYPE parameter is replaced by TOTYPE, the desired type. */
3747 add_list_candidates (tree fns
, tree first_arg
,
3748 const vec
<tree
, va_gc
> *args
, tree totype
,
3749 tree explicit_targs
, bool template_only
,
3750 tree conversion_path
, tree access_path
,
3752 struct z_candidate
**candidates
,
3753 tsubst_flags_t complain
)
3755 gcc_assert (*candidates
== NULL
);
3757 /* We're looking for a ctor for list-initialization. */
3758 flags
|= LOOKUP_LIST_INIT_CTOR
;
3759 /* And we don't allow narrowing conversions. We also use this flag to
3760 avoid the copy constructor call for copy-list-initialization. */
3761 flags
|= LOOKUP_NO_NARROWING
;
3763 unsigned nart
= num_artificial_parms_for (OVL_FIRST (fns
)) - 1;
3764 tree init_list
= (*args
)[nart
];
3766 /* Always use the default constructor if the list is empty (DR 990). */
3767 if (CONSTRUCTOR_NELTS (init_list
) == 0
3768 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
3770 /* If the class has a list ctor, try passing the list as a single
3771 argument first, but only consider list ctors. */
3772 else if (TYPE_HAS_LIST_CTOR (totype
))
3774 flags
|= LOOKUP_LIST_ONLY
;
3775 add_candidates (fns
, first_arg
, args
, NULL_TREE
,
3776 explicit_targs
, template_only
, conversion_path
,
3777 access_path
, flags
, candidates
, complain
);
3778 if (any_strictly_viable (*candidates
))
3782 /* Expand the CONSTRUCTOR into a new argument vec. */
3783 vec
<tree
, va_gc
> *new_args
;
3784 vec_alloc (new_args
, nart
+ CONSTRUCTOR_NELTS (init_list
));
3785 for (unsigned i
= 0; i
< nart
; ++i
)
3786 new_args
->quick_push ((*args
)[i
]);
3787 for (unsigned i
= 0; i
< CONSTRUCTOR_NELTS (init_list
); ++i
)
3788 new_args
->quick_push (CONSTRUCTOR_ELT (init_list
, i
)->value
);
3790 /* We aren't looking for list-ctors anymore. */
3791 flags
&= ~LOOKUP_LIST_ONLY
;
3792 /* We allow more user-defined conversions within an init-list. */
3793 flags
&= ~LOOKUP_NO_CONVERSION
;
3795 add_candidates (fns
, first_arg
, new_args
, NULL_TREE
,
3796 explicit_targs
, template_only
, conversion_path
,
3797 access_path
, flags
, candidates
, complain
);
3800 /* Returns the best overload candidate to perform the requested
3801 conversion. This function is used for three the overloading situations
3802 described in [over.match.copy], [over.match.conv], and [over.match.ref].
3803 If TOTYPE is a REFERENCE_TYPE, we're trying to find a direct binding as
3804 per [dcl.init.ref], so we ignore temporary bindings. */
3806 static struct z_candidate
*
3807 build_user_type_conversion_1 (tree totype
, tree expr
, int flags
,
3808 tsubst_flags_t complain
)
3810 struct z_candidate
*candidates
, *cand
;
3812 tree ctors
= NULL_TREE
;
3813 tree conv_fns
= NULL_TREE
;
3814 conversion
*conv
= NULL
;
3815 tree first_arg
= NULL_TREE
;
3816 vec
<tree
, va_gc
> *args
= NULL
;
3823 fromtype
= TREE_TYPE (expr
);
3825 /* We represent conversion within a hierarchy using RVALUE_CONV and
3826 BASE_CONV, as specified by [over.best.ics]; these become plain
3827 constructor calls, as specified in [dcl.init]. */
3828 gcc_assert (!MAYBE_CLASS_TYPE_P (fromtype
) || !MAYBE_CLASS_TYPE_P (totype
)
3829 || !DERIVED_FROM_P (totype
, fromtype
));
3831 if (CLASS_TYPE_P (totype
))
3832 /* Use lookup_fnfields_slot instead of lookup_fnfields to avoid
3833 creating a garbage BASELINK; constructors can't be inherited. */
3834 ctors
= get_class_binding (totype
, complete_ctor_identifier
);
3836 if (MAYBE_CLASS_TYPE_P (fromtype
))
3838 tree to_nonref
= non_reference (totype
);
3839 if (same_type_ignoring_top_level_qualifiers_p (to_nonref
, fromtype
) ||
3840 (CLASS_TYPE_P (to_nonref
) && CLASS_TYPE_P (fromtype
)
3841 && DERIVED_FROM_P (to_nonref
, fromtype
)))
3843 /* [class.conv.fct] A conversion function is never used to
3844 convert a (possibly cv-qualified) object to the (possibly
3845 cv-qualified) same object type (or a reference to it), to a
3846 (possibly cv-qualified) base class of that type (or a
3847 reference to it)... */
3850 conv_fns
= lookup_conversions (fromtype
);
3854 flags
|= LOOKUP_NO_CONVERSION
;
3855 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3856 flags
|= LOOKUP_NO_NARROWING
;
3858 /* It's OK to bind a temporary for converting constructor arguments, but
3859 not in converting the return value of a conversion operator. */
3860 convflags
= ((flags
& LOOKUP_NO_TEMP_BIND
) | LOOKUP_NO_CONVERSION
3861 | (flags
& LOOKUP_NO_NARROWING
));
3862 flags
&= ~LOOKUP_NO_TEMP_BIND
;
3866 int ctorflags
= flags
;
3868 first_arg
= build_dummy_object (totype
);
3870 /* We should never try to call the abstract or base constructor
3872 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (OVL_FIRST (ctors
))
3873 && !DECL_HAS_VTT_PARM_P (OVL_FIRST (ctors
)));
3875 args
= make_tree_vector_single (expr
);
3876 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3878 /* List-initialization. */
3879 add_list_candidates (ctors
, first_arg
, args
, totype
, NULL_TREE
,
3880 false, TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3881 ctorflags
, &candidates
, complain
);
3885 add_candidates (ctors
, first_arg
, args
, NULL_TREE
, NULL_TREE
, false,
3886 TYPE_BINFO (totype
), TYPE_BINFO (totype
),
3887 ctorflags
, &candidates
, complain
);
3890 for (cand
= candidates
; cand
; cand
= cand
->next
)
3892 cand
->second_conv
= build_identity_conv (totype
, NULL_TREE
);
3894 /* If totype isn't a reference, and LOOKUP_NO_TEMP_BIND isn't
3895 set, then this is copy-initialization. In that case, "The
3896 result of the call is then used to direct-initialize the
3897 object that is the destination of the copy-initialization."
3900 We represent this in the conversion sequence with an
3901 rvalue conversion, which means a constructor call. */
3902 if (!TYPE_REF_P (totype
)
3903 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3905 = build_conv (ck_rvalue
, totype
, cand
->second_conv
);
3911 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
3912 first_arg
= CONSTRUCTOR_ELT (expr
, 0)->value
;
3917 for (; conv_fns
; conv_fns
= TREE_CHAIN (conv_fns
))
3919 tree conversion_path
= TREE_PURPOSE (conv_fns
);
3920 struct z_candidate
*old_candidates
;
3922 /* If we are called to convert to a reference type, we are trying to
3923 find a direct binding, so don't even consider temporaries. If
3924 we don't find a direct binding, the caller will try again to
3925 look for a temporary binding. */
3926 if (TYPE_REF_P (totype
))
3927 convflags
|= LOOKUP_NO_TEMP_BIND
;
3929 old_candidates
= candidates
;
3930 add_candidates (TREE_VALUE (conv_fns
), first_arg
, NULL
, totype
,
3932 conversion_path
, TYPE_BINFO (fromtype
),
3933 flags
, &candidates
, complain
);
3935 for (cand
= candidates
; cand
!= old_candidates
; cand
= cand
->next
)
3937 tree rettype
= TREE_TYPE (TREE_TYPE (cand
->fn
));
3939 = implicit_conversion (totype
,
3942 /*c_cast_p=*/false, convflags
,
3945 /* If LOOKUP_NO_TEMP_BIND isn't set, then this is
3946 copy-initialization. In that case, "The result of the
3947 call is then used to direct-initialize the object that is
3948 the destination of the copy-initialization." [dcl.init]
3950 We represent this in the conversion sequence with an
3951 rvalue conversion, which means a constructor call. But
3952 don't add a second rvalue conversion if there's already
3953 one there. Which there really shouldn't be, but it's
3954 harmless since we'd add it here anyway. */
3955 if (ics
&& MAYBE_CLASS_TYPE_P (totype
) && ics
->kind
!= ck_rvalue
3956 && !(convflags
& LOOKUP_NO_TEMP_BIND
))
3957 ics
= build_conv (ck_rvalue
, totype
, ics
);
3959 cand
->second_conv
= ics
;
3964 cand
->reason
= arg_conversion_rejection (NULL_TREE
, -2,
3966 EXPR_LOCATION (expr
));
3968 else if (DECL_NONCONVERTING_P (cand
->fn
)
3969 && ics
->rank
> cr_exact
)
3971 /* 13.3.1.5: For direct-initialization, those explicit
3972 conversion functions that are not hidden within S and
3973 yield type T or a type that can be converted to type T
3974 with a qualification conversion (4.4) are also candidate
3976 /* 13.3.1.6 doesn't have a parallel restriction, but it should;
3977 I've raised this issue with the committee. --jason 9/2011 */
3979 cand
->reason
= explicit_conversion_rejection (rettype
, totype
);
3981 else if (cand
->viable
== 1 && ics
->bad_p
)
3985 = bad_arg_conversion_rejection (NULL_TREE
, -2,
3987 EXPR_LOCATION (expr
));
3989 else if (primary_template_specialization_p (cand
->fn
)
3990 && ics
->rank
> cr_exact
)
3992 /* 13.3.3.1.2: If the user-defined conversion is specified by
3993 a specialization of a conversion function template, the
3994 second standard conversion sequence shall have exact match
3997 cand
->reason
= template_conversion_rejection (rettype
, totype
);
4002 candidates
= splice_viable (candidates
, false, &any_viable_p
);
4006 release_tree_vector (args
);
4010 cand
= tourney (candidates
, complain
);
4013 if (complain
& tf_error
)
4015 auto_diagnostic_group d
;
4016 error ("conversion from %qH to %qI is ambiguous",
4018 print_z_candidates (location_of (expr
), candidates
);
4021 cand
= candidates
; /* any one will do */
4022 cand
->second_conv
= build_ambiguous_conv (totype
, expr
);
4023 cand
->second_conv
->user_conv_p
= true;
4024 if (!any_strictly_viable (candidates
))
4025 cand
->second_conv
->bad_p
= true;
4026 if (flags
& LOOKUP_ONLYCONVERTING
)
4027 cand
->second_conv
->need_temporary_p
= true;
4028 /* If there are viable candidates, don't set ICS_BAD_FLAG; an
4029 ambiguous conversion is no worse than another user-defined
4036 if (!DECL_CONSTRUCTOR_P (cand
->fn
))
4037 convtype
= non_reference (TREE_TYPE (TREE_TYPE (cand
->fn
)));
4038 else if (cand
->second_conv
->kind
== ck_rvalue
)
4039 /* DR 5: [in the first step of copy-initialization]...if the function
4040 is a constructor, the call initializes a temporary of the
4041 cv-unqualified version of the destination type. */
4042 convtype
= cv_unqualified (totype
);
4045 /* Build the user conversion sequence. */
4049 build_identity_conv (TREE_TYPE (expr
), expr
));
4051 if (cand
->viable
== -1)
4054 /* We're performing the maybe-rvalue overload resolution and
4055 a conversion function is in play. Reject converting the return
4056 value of the conversion function to a base class. */
4057 if ((flags
& LOOKUP_PREFER_RVALUE
) && !DECL_CONSTRUCTOR_P (cand
->fn
))
4058 for (conversion
*t
= cand
->second_conv
; t
; t
= next_conversion (t
))
4059 if (t
->kind
== ck_base
)
4062 /* Remember that this was a list-initialization. */
4063 if (flags
& LOOKUP_NO_NARROWING
)
4064 conv
->check_narrowing
= true;
4066 /* Combine it with the second conversion sequence. */
4067 cand
->second_conv
= merge_conversion_sequences (conv
,
4073 /* Wrapper for above. */
4076 build_user_type_conversion (tree totype
, tree expr
, int flags
,
4077 tsubst_flags_t complain
)
4079 struct z_candidate
*cand
;
4082 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4083 cand
= build_user_type_conversion_1 (totype
, expr
, flags
, complain
);
4087 if (cand
->second_conv
->kind
== ck_ambig
)
4088 ret
= error_mark_node
;
4091 expr
= convert_like (cand
->second_conv
, expr
, complain
);
4092 ret
= convert_from_reference (expr
);
4098 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4102 /* Subroutine of convert_nontype_argument.
4104 EXPR is an expression used in a context that requires a converted
4105 constant-expression, such as a template non-type parameter. Do any
4106 necessary conversions (that are permitted for converted
4107 constant-expressions) to convert it to the desired type.
4109 If conversion is successful, returns the converted expression;
4110 otherwise, returns error_mark_node. */
4113 build_converted_constant_expr (tree type
, tree expr
, tsubst_flags_t complain
)
4118 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
4120 if (error_operand_p (expr
))
4121 return error_mark_node
;
4123 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4124 p
= conversion_obstack_alloc (0);
4126 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
4128 LOOKUP_IMPLICIT
, complain
);
4130 /* A converted constant expression of type T is an expression, implicitly
4131 converted to type T, where the converted expression is a constant
4132 expression and the implicit conversion sequence contains only
4134 * user-defined conversions,
4135 * lvalue-to-rvalue conversions (7.1),
4136 * array-to-pointer conversions (7.2),
4137 * function-to-pointer conversions (7.3),
4138 * qualification conversions (7.5),
4139 * integral promotions (7.6),
4140 * integral conversions (7.8) other than narrowing conversions (11.6.4),
4141 * null pointer conversions (7.11) from std::nullptr_t,
4142 * null member pointer conversions (7.12) from std::nullptr_t, and
4143 * function pointer conversions (7.13),
4145 and where the reference binding (if any) binds directly. */
4147 for (conversion
*c
= conv
;
4148 conv
&& c
->kind
!= ck_identity
;
4149 c
= next_conversion (c
))
4153 /* A conversion function is OK. If it isn't constexpr, we'll
4154 complain later that the argument isn't constant. */
4156 /* The lvalue-to-rvalue conversion is OK. */
4158 /* Array-to-pointer and function-to-pointer. */
4160 /* Function pointer conversions. */
4162 /* Qualification conversions. */
4167 if (c
->need_temporary_p
)
4169 if (complain
& tf_error
)
4170 error_at (loc
, "initializing %qH with %qI in converted "
4171 "constant expression does not bind directly",
4172 type
, next_conversion (c
)->type
);
4181 t
= next_conversion (c
)->type
;
4182 if (INTEGRAL_OR_ENUMERATION_TYPE_P (t
)
4183 && INTEGRAL_OR_ENUMERATION_TYPE_P (type
))
4184 /* Integral promotion or conversion. */
4186 if (NULLPTR_TYPE_P (t
))
4187 /* Conversion from nullptr to pointer or pointer-to-member. */
4190 if (complain
& tf_error
)
4191 error_at (loc
, "conversion from %qH to %qI in a "
4192 "converted constant expression", t
, type
);
4201 /* Avoid confusing convert_nontype_argument by introducing
4202 a redundant conversion to the same reference type. */
4203 if (conv
&& conv
->kind
== ck_ref_bind
4204 && REFERENCE_REF_P (expr
))
4206 tree ref
= TREE_OPERAND (expr
, 0);
4207 if (same_type_p (type
, TREE_TYPE (ref
)))
4213 conv
->check_narrowing
= true;
4214 conv
->check_narrowing_const_only
= true;
4215 expr
= convert_like (conv
, expr
, complain
);
4219 if (complain
& tf_error
)
4220 error_at (loc
, "could not convert %qE from %qH to %qI", expr
,
4221 TREE_TYPE (expr
), type
);
4222 expr
= error_mark_node
;
4225 /* Free all the conversions we allocated. */
4226 obstack_free (&conversion_obstack
, p
);
4231 /* Do any initial processing on the arguments to a function call. */
4233 static vec
<tree
, va_gc
> *
4234 resolve_args (vec
<tree
, va_gc
> *args
, tsubst_flags_t complain
)
4239 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
4241 if (error_operand_p (arg
))
4243 else if (VOID_TYPE_P (TREE_TYPE (arg
)))
4245 if (complain
& tf_error
)
4246 error ("invalid use of void expression");
4249 else if (invalid_nonstatic_memfn_p (arg
->exp
.locus
, arg
, complain
))
4255 /* Perform overload resolution on FN, which is called with the ARGS.
4257 Return the candidate function selected by overload resolution, or
4258 NULL if the event that overload resolution failed. In the case
4259 that overload resolution fails, *CANDIDATES will be the set of
4260 candidates considered, and ANY_VIABLE_P will be set to true or
4261 false to indicate whether or not any of the candidates were
4264 The ARGS should already have gone through RESOLVE_ARGS before this
4265 function is called. */
4267 static struct z_candidate
*
4268 perform_overload_resolution (tree fn
,
4269 const vec
<tree
, va_gc
> *args
,
4270 struct z_candidate
**candidates
,
4271 bool *any_viable_p
, tsubst_flags_t complain
)
4273 struct z_candidate
*cand
;
4274 tree explicit_targs
;
4277 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4279 explicit_targs
= NULL_TREE
;
4283 *any_viable_p
= true;
4286 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
4287 || TREE_CODE (fn
) == TEMPLATE_DECL
4288 || TREE_CODE (fn
) == OVERLOAD
4289 || TREE_CODE (fn
) == TEMPLATE_ID_EXPR
);
4291 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4293 explicit_targs
= TREE_OPERAND (fn
, 1);
4294 fn
= TREE_OPERAND (fn
, 0);
4298 /* Add the various candidate functions. */
4299 add_candidates (fn
, NULL_TREE
, args
, NULL_TREE
,
4300 explicit_targs
, template_only
,
4301 /*conversion_path=*/NULL_TREE
,
4302 /*access_path=*/NULL_TREE
,
4304 candidates
, complain
);
4306 *candidates
= splice_viable (*candidates
, false, any_viable_p
);
4308 cand
= tourney (*candidates
, complain
);
4312 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4316 /* Print an error message about being unable to build a call to FN with
4317 ARGS. ANY_VIABLE_P indicates whether any candidate functions could
4318 be located; CANDIDATES is a possibly empty list of such
4322 print_error_for_call_failure (tree fn
, vec
<tree
, va_gc
> *args
,
4323 struct z_candidate
*candidates
)
4325 tree targs
= NULL_TREE
;
4326 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4328 targs
= TREE_OPERAND (fn
, 1);
4329 fn
= TREE_OPERAND (fn
, 0);
4331 tree name
= OVL_NAME (fn
);
4332 location_t loc
= location_of (name
);
4334 name
= lookup_template_function (name
, targs
);
4336 auto_diagnostic_group d
;
4337 if (!any_strictly_viable (candidates
))
4338 error_at (loc
, "no matching function for call to %<%D(%A)%>",
4339 name
, build_tree_list_vec (args
));
4341 error_at (loc
, "call of overloaded %<%D(%A)%> is ambiguous",
4342 name
, build_tree_list_vec (args
));
4344 print_z_candidates (loc
, candidates
);
4347 /* Return an expression for a call to FN (a namespace-scope function,
4348 or a static member function) with the ARGS. This may change
4352 build_new_function_call (tree fn
, vec
<tree
, va_gc
> **args
,
4353 tsubst_flags_t complain
)
4355 struct z_candidate
*candidates
, *cand
;
4360 if (args
!= NULL
&& *args
!= NULL
)
4362 *args
= resolve_args (*args
, complain
);
4364 return error_mark_node
;
4368 tm_malloc_replacement (fn
);
4370 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4371 p
= conversion_obstack_alloc (0);
4373 cand
= perform_overload_resolution (fn
, *args
, &candidates
, &any_viable_p
,
4378 if (complain
& tf_error
)
4380 // If there is a single (non-viable) function candidate,
4381 // let the error be diagnosed by cp_build_function_call_vec.
4382 if (!any_viable_p
&& candidates
&& ! candidates
->next
4383 && (TREE_CODE (candidates
->fn
) == FUNCTION_DECL
))
4384 return cp_build_function_call_vec (candidates
->fn
, args
, complain
);
4386 // Otherwise, emit notes for non-viable candidates.
4387 print_error_for_call_failure (fn
, *args
, candidates
);
4389 result
= error_mark_node
;
4393 int flags
= LOOKUP_NORMAL
;
4394 /* If fn is template_id_expr, the call has explicit template arguments
4395 (e.g. func<int>(5)), communicate this info to build_over_call
4396 through flags so that later we can use it to decide whether to warn
4397 about peculiar null pointer conversion. */
4398 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4400 /* If overload resolution selects a specialization of a
4401 function concept for non-dependent template arguments,
4402 the expression is true if the constraints are satisfied
4403 and false otherwise.
4405 NOTE: This is an extension of Concepts Lite TS that
4406 allows constraints to be used in expressions. */
4407 if (flag_concepts
&& !processing_template_decl
)
4409 tree tmpl
= DECL_TI_TEMPLATE (cand
->fn
);
4410 tree targs
= DECL_TI_ARGS (cand
->fn
);
4411 tree decl
= DECL_TEMPLATE_RESULT (tmpl
);
4412 if (DECL_DECLARED_CONCEPT_P (decl
))
4413 return evaluate_function_concept (decl
, targs
);
4416 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
4419 result
= build_over_call (cand
, flags
, complain
);
4422 /* Free all the conversions we allocated. */
4423 obstack_free (&conversion_obstack
, p
);
4428 /* Build a call to a global operator new. FNNAME is the name of the
4429 operator (either "operator new" or "operator new[]") and ARGS are
4430 the arguments provided. This may change ARGS. *SIZE points to the
4431 total number of bytes required by the allocation, and is updated if
4432 that is changed here. *COOKIE_SIZE is non-NULL if a cookie should
4433 be used. If this function determines that no cookie should be
4434 used, after all, *COOKIE_SIZE is set to NULL_TREE. If SIZE_CHECK
4435 is not NULL_TREE, it is evaluated before calculating the final
4436 array size, and if it fails, the array size is replaced with
4437 (size_t)-1 (usually triggering a std::bad_alloc exception). If FN
4438 is non-NULL, it will be set, upon return, to the allocation
4442 build_operator_new_call (tree fnname
, vec
<tree
, va_gc
> **args
,
4443 tree
*size
, tree
*cookie_size
,
4444 tree align_arg
, tree size_check
,
4445 tree
*fn
, tsubst_flags_t complain
)
4447 tree original_size
= *size
;
4449 struct z_candidate
*candidates
;
4450 struct z_candidate
*cand
= NULL
;
4455 /* Set to (size_t)-1 if the size check fails. */
4456 if (size_check
!= NULL_TREE
)
4458 tree errval
= TYPE_MAX_VALUE (sizetype
);
4459 if (cxx_dialect
>= cxx11
&& flag_exceptions
)
4460 errval
= throw_bad_array_new_length ();
4461 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4462 original_size
, errval
);
4464 vec_safe_insert (*args
, 0, *size
);
4465 *args
= resolve_args (*args
, complain
);
4467 return error_mark_node
;
4473 If this lookup fails to find the name, or if the allocated type
4474 is not a class type, the allocation function's name is looked
4475 up in the global scope.
4477 we disregard block-scope declarations of "operator new". */
4478 fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/false, 0, 0);
4479 fns
= lookup_arg_dependent (fnname
, fns
, *args
);
4483 vec
<tree
, va_gc
>* align_args
4484 = vec_copy_and_insert (*args
, align_arg
, 1);
4485 cand
= perform_overload_resolution (fns
, align_args
, &candidates
,
4486 &any_viable_p
, tf_none
);
4489 /* If no aligned allocation function matches, try again without the
4493 /* Figure out what function is being called. */
4495 cand
= perform_overload_resolution (fns
, *args
, &candidates
, &any_viable_p
,
4498 /* If no suitable function could be found, issue an error message
4502 if (complain
& tf_error
)
4503 print_error_for_call_failure (fns
, *args
, candidates
);
4504 return error_mark_node
;
4507 /* If a cookie is required, add some extra space. Whether
4508 or not a cookie is required cannot be determined until
4509 after we know which function was called. */
4512 bool use_cookie
= true;
4515 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
4516 /* Skip the size_t parameter. */
4517 arg_types
= TREE_CHAIN (arg_types
);
4518 /* Check the remaining parameters (if any). */
4520 && TREE_CHAIN (arg_types
) == void_list_node
4521 && same_type_p (TREE_VALUE (arg_types
),
4524 /* If we need a cookie, adjust the number of bytes allocated. */
4527 /* Update the total size. */
4528 *size
= size_binop (PLUS_EXPR
, original_size
, *cookie_size
);
4531 /* Set to (size_t)-1 if the size check fails. */
4532 gcc_assert (size_check
!= NULL_TREE
);
4533 *size
= fold_build3 (COND_EXPR
, sizetype
, size_check
,
4534 *size
, TYPE_MAX_VALUE (sizetype
));
4536 /* Update the argument list to reflect the adjusted size. */
4537 (**args
)[0] = *size
;
4540 *cookie_size
= NULL_TREE
;
4543 /* Tell our caller which function we decided to call. */
4547 /* Build the CALL_EXPR. */
4548 return build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4551 /* Build a new call to operator(). This may change ARGS. */
4554 build_op_call_1 (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4556 struct z_candidate
*candidates
= 0, *cand
;
4557 tree fns
, convs
, first_mem_arg
= NULL_TREE
;
4559 tree result
= NULL_TREE
;
4562 obj
= mark_lvalue_use (obj
);
4564 if (error_operand_p (obj
))
4565 return error_mark_node
;
4567 tree type
= TREE_TYPE (obj
);
4569 obj
= prep_operand (obj
);
4571 if (TYPE_PTRMEMFUNC_P (type
))
4573 if (complain
& tf_error
)
4574 /* It's no good looking for an overloaded operator() on a
4575 pointer-to-member-function. */
4576 error ("pointer-to-member function %qE cannot be called without "
4577 "an object; consider using %<.*%> or %<->*%>", obj
);
4578 return error_mark_node
;
4581 if (TYPE_BINFO (type
))
4583 fns
= lookup_fnfields (TYPE_BINFO (type
), call_op_identifier
, 1);
4584 if (fns
== error_mark_node
)
4585 return error_mark_node
;
4590 if (args
!= NULL
&& *args
!= NULL
)
4592 *args
= resolve_args (*args
, complain
);
4594 return error_mark_node
;
4597 /* Get the high-water mark for the CONVERSION_OBSTACK. */
4598 p
= conversion_obstack_alloc (0);
4602 first_mem_arg
= obj
;
4604 add_candidates (BASELINK_FUNCTIONS (fns
),
4605 first_mem_arg
, *args
, NULL_TREE
,
4607 BASELINK_BINFO (fns
), BASELINK_ACCESS_BINFO (fns
),
4608 LOOKUP_NORMAL
, &candidates
, complain
);
4611 convs
= lookup_conversions (type
);
4613 for (; convs
; convs
= TREE_CHAIN (convs
))
4615 tree totype
= TREE_TYPE (convs
);
4617 if (TYPE_PTRFN_P (totype
)
4618 || TYPE_REFFN_P (totype
)
4619 || (TYPE_REF_P (totype
)
4620 && TYPE_PTRFN_P (TREE_TYPE (totype
))))
4621 for (ovl_iterator
iter (TREE_VALUE (convs
)); iter
; ++iter
)
4625 if (DECL_NONCONVERTING_P (fn
))
4628 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
4629 add_template_conv_candidate
4630 (&candidates
, fn
, obj
, *args
, totype
,
4631 /*access_path=*/NULL_TREE
,
4632 /*conversion_path=*/NULL_TREE
, complain
);
4634 add_conv_candidate (&candidates
, fn
, obj
,
4635 *args
, /*conversion_path=*/NULL_TREE
,
4636 /*access_path=*/NULL_TREE
, complain
);
4640 /* Be strict here because if we choose a bad conversion candidate, the
4641 errors we get won't mention the call context. */
4642 candidates
= splice_viable (candidates
, true, &any_viable_p
);
4645 if (complain
& tf_error
)
4647 auto_diagnostic_group d
;
4648 error ("no match for call to %<(%T) (%A)%>", TREE_TYPE (obj
),
4649 build_tree_list_vec (*args
));
4650 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4652 result
= error_mark_node
;
4656 cand
= tourney (candidates
, complain
);
4659 if (complain
& tf_error
)
4661 auto_diagnostic_group d
;
4662 error ("call of %<(%T) (%A)%> is ambiguous",
4663 TREE_TYPE (obj
), build_tree_list_vec (*args
));
4664 print_z_candidates (location_of (TREE_TYPE (obj
)), candidates
);
4666 result
= error_mark_node
;
4668 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
4669 && DECL_OVERLOADED_OPERATOR_P (cand
->fn
)
4670 && DECL_OVERLOADED_OPERATOR_IS (cand
->fn
, CALL_EXPR
))
4671 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
4674 if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
4675 obj
= convert_like_with_context (cand
->convs
[0], obj
, cand
->fn
,
4679 gcc_checking_assert (TYPE_P (cand
->fn
));
4680 obj
= convert_like (cand
->convs
[0], obj
, complain
);
4682 obj
= convert_from_reference (obj
);
4683 result
= cp_build_function_call_vec (obj
, args
, complain
);
4687 /* Free all the conversions we allocated. */
4688 obstack_free (&conversion_obstack
, p
);
4693 /* Wrapper for above. */
4696 build_op_call (tree obj
, vec
<tree
, va_gc
> **args
, tsubst_flags_t complain
)
4699 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
4700 ret
= build_op_call_1 (obj
, args
, complain
);
4701 timevar_cond_stop (TV_OVERLOAD
, subtime
);
4705 /* Called by op_error to prepare format strings suitable for the error
4706 function. It concatenates a prefix (controlled by MATCH), ERRMSG,
4707 and a suffix (controlled by NTYPES). */
4710 op_error_string (const char *errmsg
, int ntypes
, bool match
)
4714 const char *msgp
= concat (match
? G_("ambiguous overload for ")
4715 : G_("no match for "), errmsg
, NULL
);
4718 msg
= concat (msgp
, G_(" (operand types are %qT, %qT, and %qT)"), NULL
);
4719 else if (ntypes
== 2)
4720 msg
= concat (msgp
, G_(" (operand types are %qT and %qT)"), NULL
);
4722 msg
= concat (msgp
, G_(" (operand type is %qT)"), NULL
);
4728 op_error (const op_location_t
&loc
,
4729 enum tree_code code
, enum tree_code code2
,
4730 tree arg1
, tree arg2
, tree arg3
, bool match
)
4732 bool assop
= code
== MODIFY_EXPR
;
4733 const char *opname
= OVL_OP_INFO (assop
, assop
? code2
: code
)->name
;
4738 if (flag_diagnostics_show_caret
)
4739 error_at (loc
, op_error_string (G_("ternary %<operator?:%>"),
4741 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4743 error_at (loc
, op_error_string (G_("ternary %<operator?:%> "
4744 "in %<%E ? %E : %E%>"), 3, match
),
4746 TREE_TYPE (arg1
), TREE_TYPE (arg2
), TREE_TYPE (arg3
));
4749 case POSTINCREMENT_EXPR
:
4750 case POSTDECREMENT_EXPR
:
4751 if (flag_diagnostics_show_caret
)
4752 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4753 opname
, TREE_TYPE (arg1
));
4755 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E%s%>"),
4757 opname
, arg1
, opname
, TREE_TYPE (arg1
));
4761 if (flag_diagnostics_show_caret
)
4762 error_at (loc
, op_error_string (G_("%<operator[]%>"), 2, match
),
4763 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4765 error_at (loc
, op_error_string (G_("%<operator[]%> in %<%E[%E]%>"),
4767 arg1
, arg2
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4772 if (flag_diagnostics_show_caret
)
4773 error_at (loc
, op_error_string (G_("%qs"), 1, match
),
4774 opname
, TREE_TYPE (arg1
));
4776 error_at (loc
, op_error_string (G_("%qs in %<%s %E%>"), 1, match
),
4777 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4782 if (flag_diagnostics_show_caret
)
4784 binary_op_rich_location
richloc (loc
, arg1
, arg2
, true);
4786 op_error_string (G_("%<operator%s%>"), 2, match
),
4787 opname
, TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4790 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%E %s %E%>"),
4792 opname
, arg1
, opname
, arg2
,
4793 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
4795 if (flag_diagnostics_show_caret
)
4796 error_at (loc
, op_error_string (G_("%<operator%s%>"), 1, match
),
4797 opname
, TREE_TYPE (arg1
));
4799 error_at (loc
, op_error_string (G_("%<operator%s%> in %<%s%E%>"),
4801 opname
, opname
, arg1
, TREE_TYPE (arg1
));
4806 /* Return the implicit conversion sequence that could be used to
4807 convert E1 to E2 in [expr.cond]. */
4810 conditional_conversion (tree e1
, tree e2
, tsubst_flags_t complain
)
4812 tree t1
= non_reference (TREE_TYPE (e1
));
4813 tree t2
= non_reference (TREE_TYPE (e2
));
4819 If E2 is an lvalue: E1 can be converted to match E2 if E1 can be
4820 implicitly converted (clause _conv_) to the type "lvalue reference to
4821 T2", subject to the constraint that in the conversion the
4822 reference must bind directly (_dcl.init.ref_) to an lvalue.
4824 If E2 is an xvalue: E1 can be converted to match E2 if E1 can be
4825 implicitly converted to the type "rvalue reference to T2", subject to
4826 the constraint that the reference must bind directly. */
4829 tree rtype
= cp_build_reference_type (t2
, !lvalue_p (e2
));
4830 conv
= implicit_conversion (rtype
,
4834 LOOKUP_NO_TEMP_BIND
|LOOKUP_NO_RVAL_BIND
4835 |LOOKUP_ONLYCONVERTING
,
4837 if (conv
&& !conv
->bad_p
)
4841 /* If E2 is a prvalue or if neither of the conversions above can be done
4842 and at least one of the operands has (possibly cv-qualified) class
4844 if (!CLASS_TYPE_P (t1
) && !CLASS_TYPE_P (t2
))
4849 If E1 and E2 have class type, and the underlying class types are
4850 the same or one is a base class of the other: E1 can be converted
4851 to match E2 if the class of T2 is the same type as, or a base
4852 class of, the class of T1, and the cv-qualification of T2 is the
4853 same cv-qualification as, or a greater cv-qualification than, the
4854 cv-qualification of T1. If the conversion is applied, E1 is
4855 changed to an rvalue of type T2 that still refers to the original
4856 source class object (or the appropriate subobject thereof). */
4857 if (CLASS_TYPE_P (t1
) && CLASS_TYPE_P (t2
)
4858 && ((good_base
= DERIVED_FROM_P (t2
, t1
)) || DERIVED_FROM_P (t1
, t2
)))
4860 if (good_base
&& at_least_as_qualified_p (t2
, t1
))
4862 conv
= build_identity_conv (t1
, e1
);
4863 if (!same_type_p (TYPE_MAIN_VARIANT (t1
),
4864 TYPE_MAIN_VARIANT (t2
)))
4865 conv
= build_conv (ck_base
, t2
, conv
);
4867 conv
= build_conv (ck_rvalue
, t2
, conv
);
4876 Otherwise: E1 can be converted to match E2 if E1 can be implicitly
4877 converted to the type that expression E2 would have if E2 were
4878 converted to an rvalue (or the type it has, if E2 is an rvalue). */
4879 return implicit_conversion (t2
, t1
, e1
, /*c_cast_p=*/false,
4880 LOOKUP_IMPLICIT
, complain
);
4883 /* Implement [expr.cond]. ARG1, ARG2, and ARG3 are the three
4884 arguments to the conditional expression. */
4887 build_conditional_expr_1 (const op_location_t
&loc
,
4888 tree arg1
, tree arg2
, tree arg3
,
4889 tsubst_flags_t complain
)
4893 tree result
= NULL_TREE
;
4894 tree result_type
= NULL_TREE
;
4895 bool is_glvalue
= true;
4896 struct z_candidate
*candidates
= 0;
4897 struct z_candidate
*cand
;
4899 tree orig_arg2
, orig_arg3
;
4901 /* As a G++ extension, the second argument to the conditional can be
4902 omitted. (So that `a ? : c' is roughly equivalent to `a ? a :
4903 c'.) If the second operand is omitted, make sure it is
4904 calculated only once. */
4907 if (complain
& tf_error
)
4908 pedwarn (loc
, OPT_Wpedantic
,
4909 "ISO C++ forbids omitting the middle term of a ?: expression");
4911 if ((complain
& tf_warning
) && !truth_value_p (TREE_CODE (arg1
)))
4912 warn_for_omitted_condop (loc
, arg1
);
4914 /* Make sure that lvalues remain lvalues. See g++.oliva/ext1.C. */
4915 if (lvalue_p (arg1
))
4916 arg2
= arg1
= cp_stabilize_reference (arg1
);
4918 arg2
= arg1
= cp_save_expr (arg1
);
4921 /* If something has already gone wrong, just pass that fact up the
4923 if (error_operand_p (arg1
)
4924 || error_operand_p (arg2
)
4925 || error_operand_p (arg3
))
4926 return error_mark_node
;
4931 if (VECTOR_INTEGER_TYPE_P (TREE_TYPE (arg1
)))
4933 tree arg1_type
= TREE_TYPE (arg1
);
4935 /* If arg1 is another cond_expr choosing between -1 and 0,
4936 then we can use its comparison. It may help to avoid
4937 additional comparison, produce more accurate diagnostics
4938 and enables folding. */
4939 if (TREE_CODE (arg1
) == VEC_COND_EXPR
4940 && integer_minus_onep (TREE_OPERAND (arg1
, 1))
4941 && integer_zerop (TREE_OPERAND (arg1
, 2)))
4942 arg1
= TREE_OPERAND (arg1
, 0);
4944 arg1
= force_rvalue (arg1
, complain
);
4945 arg2
= force_rvalue (arg2
, complain
);
4946 arg3
= force_rvalue (arg3
, complain
);
4948 /* force_rvalue can return error_mark on valid arguments. */
4949 if (error_operand_p (arg1
)
4950 || error_operand_p (arg2
)
4951 || error_operand_p (arg3
))
4952 return error_mark_node
;
4954 arg2_type
= TREE_TYPE (arg2
);
4955 arg3_type
= TREE_TYPE (arg3
);
4957 if (!VECTOR_TYPE_P (arg2_type
)
4958 && !VECTOR_TYPE_P (arg3_type
))
4960 /* Rely on the error messages of the scalar version. */
4961 tree scal
= build_conditional_expr_1 (loc
, integer_one_node
,
4962 orig_arg2
, orig_arg3
, complain
);
4963 if (scal
== error_mark_node
)
4964 return error_mark_node
;
4965 tree stype
= TREE_TYPE (scal
);
4966 tree ctype
= TREE_TYPE (arg1_type
);
4967 if (TYPE_SIZE (stype
) != TYPE_SIZE (ctype
)
4968 || (!INTEGRAL_TYPE_P (stype
) && !SCALAR_FLOAT_TYPE_P (stype
)))
4970 if (complain
& tf_error
)
4971 error_at (loc
, "inferred scalar type %qT is not an integer or "
4972 "floating point type of the same size as %qT", stype
,
4973 COMPARISON_CLASS_P (arg1
)
4974 ? TREE_TYPE (TREE_TYPE (TREE_OPERAND (arg1
, 0)))
4976 return error_mark_node
;
4979 tree vtype
= build_opaque_vector_type (stype
,
4980 TYPE_VECTOR_SUBPARTS (arg1_type
));
4981 /* We could pass complain & tf_warning to unsafe_conversion_p,
4982 but the warnings (like Wsign-conversion) have already been
4983 given by the scalar build_conditional_expr_1. We still check
4984 unsafe_conversion_p to forbid truncating long long -> float. */
4985 if (unsafe_conversion_p (loc
, stype
, arg2
, NULL_TREE
, false))
4987 if (complain
& tf_error
)
4988 error_at (loc
, "conversion of scalar %qH to vector %qI "
4989 "involves truncation", arg2_type
, vtype
);
4990 return error_mark_node
;
4992 if (unsafe_conversion_p (loc
, stype
, arg3
, NULL_TREE
, false))
4994 if (complain
& tf_error
)
4995 error_at (loc
, "conversion of scalar %qH to vector %qI "
4996 "involves truncation", arg3_type
, vtype
);
4997 return error_mark_node
;
5000 arg2
= cp_convert (stype
, arg2
, complain
);
5001 arg2
= save_expr (arg2
);
5002 arg2
= build_vector_from_val (vtype
, arg2
);
5004 arg3
= cp_convert (stype
, arg3
, complain
);
5005 arg3
= save_expr (arg3
);
5006 arg3
= build_vector_from_val (vtype
, arg3
);
5010 if (VECTOR_TYPE_P (arg2_type
) != VECTOR_TYPE_P (arg3_type
))
5012 enum stv_conv convert_flag
=
5013 scalar_to_vector (loc
, VEC_COND_EXPR
, arg2
, arg3
,
5014 complain
& tf_error
);
5016 switch (convert_flag
)
5019 return error_mark_node
;
5022 arg2
= save_expr (arg2
);
5023 arg2
= convert (TREE_TYPE (arg3_type
), arg2
);
5024 arg2
= build_vector_from_val (arg3_type
, arg2
);
5025 arg2_type
= TREE_TYPE (arg2
);
5030 arg3
= save_expr (arg3
);
5031 arg3
= convert (TREE_TYPE (arg2_type
), arg3
);
5032 arg3
= build_vector_from_val (arg2_type
, arg3
);
5033 arg3_type
= TREE_TYPE (arg3
);
5041 if (!same_type_p (arg2_type
, arg3_type
)
5042 || maybe_ne (TYPE_VECTOR_SUBPARTS (arg1_type
),
5043 TYPE_VECTOR_SUBPARTS (arg2_type
))
5044 || TYPE_SIZE (arg1_type
) != TYPE_SIZE (arg2_type
))
5046 if (complain
& tf_error
)
5048 "incompatible vector types in conditional expression: "
5049 "%qT, %qT and %qT", TREE_TYPE (arg1
),
5050 TREE_TYPE (orig_arg2
), TREE_TYPE (orig_arg3
));
5051 return error_mark_node
;
5054 if (!COMPARISON_CLASS_P (arg1
))
5056 tree cmp_type
= build_same_sized_truth_vector_type (arg1_type
);
5057 arg1
= build2 (NE_EXPR
, cmp_type
, arg1
, build_zero_cst (arg1_type
));
5059 return build3_loc (loc
, VEC_COND_EXPR
, arg2_type
, arg1
, arg2
, arg3
);
5064 The first expression is implicitly converted to bool (clause
5066 arg1
= perform_implicit_conversion_flags (boolean_type_node
, arg1
, complain
,
5068 if (error_operand_p (arg1
))
5069 return error_mark_node
;
5073 If either the second or the third operand has type (possibly
5074 cv-qualified) void, then the lvalue-to-rvalue (_conv.lval_),
5075 array-to-pointer (_conv.array_), and function-to-pointer
5076 (_conv.func_) standard conversions are performed on the second
5077 and third operands. */
5078 arg2_type
= unlowered_expr_type (arg2
);
5079 arg3_type
= unlowered_expr_type (arg3
);
5080 if (VOID_TYPE_P (arg2_type
) || VOID_TYPE_P (arg3_type
))
5082 /* 'void' won't help in resolving an overloaded expression on the
5083 other side, so require it to resolve by itself. */
5084 if (arg2_type
== unknown_type_node
)
5086 arg2
= resolve_nondeduced_context_or_error (arg2
, complain
);
5087 arg2_type
= TREE_TYPE (arg2
);
5089 if (arg3_type
== unknown_type_node
)
5091 arg3
= resolve_nondeduced_context_or_error (arg3
, complain
);
5092 arg3_type
= TREE_TYPE (arg3
);
5097 One of the following shall hold:
5099 --The second or the third operand (but not both) is a
5100 throw-expression (_except.throw_); the result is of the type
5101 and value category of the other.
5103 --Both the second and the third operands have type void; the
5104 result is of type void and is a prvalue. */
5105 if (TREE_CODE (arg2
) == THROW_EXPR
5106 && TREE_CODE (arg3
) != THROW_EXPR
)
5108 result_type
= arg3_type
;
5109 is_glvalue
= glvalue_p (arg3
);
5111 else if (TREE_CODE (arg2
) != THROW_EXPR
5112 && TREE_CODE (arg3
) == THROW_EXPR
)
5114 result_type
= arg2_type
;
5115 is_glvalue
= glvalue_p (arg2
);
5117 else if (VOID_TYPE_P (arg2_type
) && VOID_TYPE_P (arg3_type
))
5119 result_type
= void_type_node
;
5124 if (complain
& tf_error
)
5126 if (VOID_TYPE_P (arg2_type
))
5127 error_at (cp_expr_loc_or_loc (arg3
, loc
),
5128 "second operand to the conditional operator "
5129 "is of type %<void%>, but the third operand is "
5130 "neither a throw-expression nor of type %<void%>");
5132 error_at (cp_expr_loc_or_loc (arg2
, loc
),
5133 "third operand to the conditional operator "
5134 "is of type %<void%>, but the second operand is "
5135 "neither a throw-expression nor of type %<void%>");
5137 return error_mark_node
;
5140 goto valid_operands
;
5144 Otherwise, if the second and third operand have different types,
5145 and either has (possibly cv-qualified) class type, or if both are
5146 glvalues of the same value category and the same type except for
5147 cv-qualification, an attempt is made to convert each of those operands
5148 to the type of the other. */
5149 else if (!same_type_p (arg2_type
, arg3_type
)
5150 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)
5151 || (same_type_ignoring_top_level_qualifiers_p (arg2_type
,
5153 && glvalue_p (arg2
) && glvalue_p (arg3
)
5154 && lvalue_p (arg2
) == lvalue_p (arg3
))))
5158 bool converted
= false;
5160 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5161 p
= conversion_obstack_alloc (0);
5163 conv2
= conditional_conversion (arg2
, arg3
, complain
);
5164 conv3
= conditional_conversion (arg3
, arg2
, complain
);
5168 If both can be converted, or one can be converted but the
5169 conversion is ambiguous, the program is ill-formed. If
5170 neither can be converted, the operands are left unchanged and
5171 further checking is performed as described below. If exactly
5172 one conversion is possible, that conversion is applied to the
5173 chosen operand and the converted operand is used in place of
5174 the original operand for the remainder of this section. */
5175 if ((conv2
&& !conv2
->bad_p
5176 && conv3
&& !conv3
->bad_p
)
5177 || (conv2
&& conv2
->kind
== ck_ambig
)
5178 || (conv3
&& conv3
->kind
== ck_ambig
))
5180 if (complain
& tf_error
)
5182 error_at (loc
, "operands to ?: have different types %qT and %qT",
5183 arg2_type
, arg3_type
);
5184 if (conv2
&& !conv2
->bad_p
&& conv3
&& !conv3
->bad_p
)
5185 inform (loc
, " and each type can be converted to the other");
5186 else if (conv2
&& conv2
->kind
== ck_ambig
)
5187 convert_like (conv2
, arg2
, complain
);
5189 convert_like (conv3
, arg3
, complain
);
5191 result
= error_mark_node
;
5193 else if (conv2
&& !conv2
->bad_p
)
5195 arg2
= convert_like (conv2
, arg2
, complain
);
5196 arg2
= convert_from_reference (arg2
);
5197 arg2_type
= TREE_TYPE (arg2
);
5198 /* Even if CONV2 is a valid conversion, the result of the
5199 conversion may be invalid. For example, if ARG3 has type
5200 "volatile X", and X does not have a copy constructor
5201 accepting a "volatile X&", then even if ARG2 can be
5202 converted to X, the conversion will fail. */
5203 if (error_operand_p (arg2
))
5204 result
= error_mark_node
;
5207 else if (conv3
&& !conv3
->bad_p
)
5209 arg3
= convert_like (conv3
, arg3
, complain
);
5210 arg3
= convert_from_reference (arg3
);
5211 arg3_type
= TREE_TYPE (arg3
);
5212 if (error_operand_p (arg3
))
5213 result
= error_mark_node
;
5217 /* Free all the conversions we allocated. */
5218 obstack_free (&conversion_obstack
, p
);
5223 /* If, after the conversion, both operands have class type,
5224 treat the cv-qualification of both operands as if it were the
5225 union of the cv-qualification of the operands.
5227 The standard is not clear about what to do in this
5228 circumstance. For example, if the first operand has type
5229 "const X" and the second operand has a user-defined
5230 conversion to "volatile X", what is the type of the second
5231 operand after this step? Making it be "const X" (matching
5232 the first operand) seems wrong, as that discards the
5233 qualification without actually performing a copy. Leaving it
5234 as "volatile X" seems wrong as that will result in the
5235 conditional expression failing altogether, even though,
5236 according to this step, the one operand could be converted to
5237 the type of the other. */
5239 && CLASS_TYPE_P (arg2_type
)
5240 && cp_type_quals (arg2_type
) != cp_type_quals (arg3_type
))
5241 arg2_type
= arg3_type
=
5242 cp_build_qualified_type (arg2_type
,
5243 cp_type_quals (arg2_type
)
5244 | cp_type_quals (arg3_type
));
5249 If the second and third operands are glvalues of the same value
5250 category and have the same type, the result is of that type and
5252 if (((lvalue_p (arg2
) && lvalue_p (arg3
))
5253 || (xvalue_p (arg2
) && xvalue_p (arg3
)))
5254 && same_type_p (arg2_type
, arg3_type
))
5256 result_type
= arg2_type
;
5257 arg2
= mark_lvalue_use (arg2
);
5258 arg3
= mark_lvalue_use (arg3
);
5259 goto valid_operands
;
5264 Otherwise, the result is an rvalue. If the second and third
5265 operand do not have the same type, and either has (possibly
5266 cv-qualified) class type, overload resolution is used to
5267 determine the conversions (if any) to be applied to the operands
5268 (_over.match.oper_, _over.built_). */
5270 if (!same_type_p (arg2_type
, arg3_type
)
5271 && (CLASS_TYPE_P (arg2_type
) || CLASS_TYPE_P (arg3_type
)))
5277 /* Rearrange the arguments so that add_builtin_candidate only has
5278 to know about two args. In build_builtin_candidate, the
5279 arguments are unscrambled. */
5283 add_builtin_candidates (&candidates
,
5286 ovl_op_identifier (false, COND_EXPR
),
5288 LOOKUP_NORMAL
, complain
);
5292 If the overload resolution fails, the program is
5294 candidates
= splice_viable (candidates
, false, &any_viable_p
);
5297 if (complain
& tf_error
)
5298 error_at (loc
, "operands to ?: have different types %qT and %qT",
5299 arg2_type
, arg3_type
);
5300 return error_mark_node
;
5302 cand
= tourney (candidates
, complain
);
5305 if (complain
& tf_error
)
5307 auto_diagnostic_group d
;
5308 op_error (loc
, COND_EXPR
, NOP_EXPR
, arg1
, arg2
, arg3
, FALSE
);
5309 print_z_candidates (loc
, candidates
);
5311 return error_mark_node
;
5316 Otherwise, the conversions thus determined are applied, and
5317 the converted operands are used in place of the original
5318 operands for the remainder of this section. */
5319 conv
= cand
->convs
[0];
5320 arg1
= convert_like (conv
, arg1
, complain
);
5321 conv
= cand
->convs
[1];
5322 arg2
= convert_like (conv
, arg2
, complain
);
5323 arg2_type
= TREE_TYPE (arg2
);
5324 conv
= cand
->convs
[2];
5325 arg3
= convert_like (conv
, arg3
, complain
);
5326 arg3_type
= TREE_TYPE (arg3
);
5331 Lvalue-to-rvalue (_conv.lval_), array-to-pointer (_conv.array_),
5332 and function-to-pointer (_conv.func_) standard conversions are
5333 performed on the second and third operands.
5335 We need to force the lvalue-to-rvalue conversion here for class types,
5336 so we get TARGET_EXPRs; trying to deal with a COND_EXPR of class rvalues
5337 that isn't wrapped with a TARGET_EXPR plays havoc with exception
5340 arg2
= force_rvalue (arg2
, complain
);
5341 if (!CLASS_TYPE_P (arg2_type
))
5342 arg2_type
= TREE_TYPE (arg2
);
5344 arg3
= force_rvalue (arg3
, complain
);
5345 if (!CLASS_TYPE_P (arg3_type
))
5346 arg3_type
= TREE_TYPE (arg3
);
5348 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5349 return error_mark_node
;
5353 After those conversions, one of the following shall hold:
5355 --The second and third operands have the same type; the result is of
5357 if (same_type_p (arg2_type
, arg3_type
))
5358 result_type
= arg2_type
;
5361 --The second and third operands have arithmetic or enumeration
5362 type; the usual arithmetic conversions are performed to bring
5363 them to a common type, and the result is of that type. */
5364 else if ((ARITHMETIC_TYPE_P (arg2_type
)
5365 || UNSCOPED_ENUM_P (arg2_type
))
5366 && (ARITHMETIC_TYPE_P (arg3_type
)
5367 || UNSCOPED_ENUM_P (arg3_type
)))
5369 /* In this case, there is always a common type. */
5370 result_type
= type_after_usual_arithmetic_conversions (arg2_type
,
5372 if (complain
& tf_warning
)
5373 do_warn_double_promotion (result_type
, arg2_type
, arg3_type
,
5374 "implicit conversion from %qH to %qI to "
5375 "match other result of conditional",
5378 if (TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5379 && TREE_CODE (arg3_type
) == ENUMERAL_TYPE
)
5381 tree stripped_orig_arg2
= tree_strip_any_location_wrapper (orig_arg2
);
5382 tree stripped_orig_arg3
= tree_strip_any_location_wrapper (orig_arg3
);
5383 if (TREE_CODE (stripped_orig_arg2
) == CONST_DECL
5384 && TREE_CODE (stripped_orig_arg3
) == CONST_DECL
5385 && (DECL_CONTEXT (stripped_orig_arg2
)
5386 == DECL_CONTEXT (stripped_orig_arg3
)))
5387 /* Two enumerators from the same enumeration can have different
5388 types when the enumeration is still being defined. */;
5389 else if (complain
& tf_warning
)
5390 warning_at (loc
, OPT_Wenum_compare
, "enumeral mismatch in "
5391 "conditional expression: %qT vs %qT",
5392 arg2_type
, arg3_type
);
5394 else if (extra_warnings
5395 && ((TREE_CODE (arg2_type
) == ENUMERAL_TYPE
5396 && !same_type_p (arg3_type
, type_promotes_to (arg2_type
)))
5397 || (TREE_CODE (arg3_type
) == ENUMERAL_TYPE
5398 && !same_type_p (arg2_type
,
5399 type_promotes_to (arg3_type
)))))
5401 if (complain
& tf_warning
)
5402 warning_at (loc
, OPT_Wextra
, "enumeral and non-enumeral type in "
5403 "conditional expression");
5406 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5407 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5411 --The second and third operands have pointer type, or one has
5412 pointer type and the other is a null pointer constant; pointer
5413 conversions (_conv.ptr_) and qualification conversions
5414 (_conv.qual_) are performed to bring them to their composite
5415 pointer type (_expr.rel_). The result is of the composite
5418 --The second and third operands have pointer to member type, or
5419 one has pointer to member type and the other is a null pointer
5420 constant; pointer to member conversions (_conv.mem_) and
5421 qualification conversions (_conv.qual_) are performed to bring
5422 them to a common type, whose cv-qualification shall match the
5423 cv-qualification of either the second or the third operand.
5424 The result is of the common type. */
5425 else if ((null_ptr_cst_p (arg2
)
5426 && TYPE_PTR_OR_PTRMEM_P (arg3_type
))
5427 || (null_ptr_cst_p (arg3
)
5428 && TYPE_PTR_OR_PTRMEM_P (arg2_type
))
5429 || (TYPE_PTR_P (arg2_type
) && TYPE_PTR_P (arg3_type
))
5430 || (TYPE_PTRDATAMEM_P (arg2_type
) && TYPE_PTRDATAMEM_P (arg3_type
))
5431 || (TYPE_PTRMEMFUNC_P (arg2_type
) && TYPE_PTRMEMFUNC_P (arg3_type
)))
5433 result_type
= composite_pointer_type (arg2_type
, arg3_type
, arg2
,
5434 arg3
, CPO_CONDITIONAL_EXPR
,
5436 if (result_type
== error_mark_node
)
5437 return error_mark_node
;
5438 arg2
= perform_implicit_conversion (result_type
, arg2
, complain
);
5439 arg3
= perform_implicit_conversion (result_type
, arg3
, complain
);
5444 if (complain
& tf_error
)
5445 error_at (loc
, "operands to ?: have different types %qT and %qT",
5446 arg2_type
, arg3_type
);
5447 return error_mark_node
;
5450 if (arg2
== error_mark_node
|| arg3
== error_mark_node
)
5451 return error_mark_node
;
5454 if (processing_template_decl
&& is_glvalue
)
5456 /* Let lvalue_kind know this was a glvalue. */
5457 tree arg
= (result_type
== arg2_type
? arg2
: arg3
);
5458 result_type
= cp_build_reference_type (result_type
, xvalue_p (arg
));
5461 result
= build3_loc (loc
, COND_EXPR
, result_type
, arg1
, arg2
, arg3
);
5463 /* If the ARG2 and ARG3 are the same and don't have side-effects,
5464 warn here, because the COND_EXPR will be turned into ARG2. */
5465 if (warn_duplicated_branches
5466 && (complain
& tf_warning
)
5467 && (arg2
== arg3
|| operand_equal_p (arg2
, arg3
, 0)))
5468 warning_at (EXPR_LOCATION (result
), OPT_Wduplicated_branches
,
5469 "this condition has identical branches");
5471 /* We can't use result_type below, as fold might have returned a
5476 /* Expand both sides into the same slot, hopefully the target of
5477 the ?: expression. We used to check for TARGET_EXPRs here,
5478 but now we sometimes wrap them in NOP_EXPRs so the test would
5480 if (CLASS_TYPE_P (TREE_TYPE (result
)))
5481 result
= get_target_expr_sfinae (result
, complain
);
5482 /* If this expression is an rvalue, but might be mistaken for an
5483 lvalue, we must add a NON_LVALUE_EXPR. */
5484 result
= rvalue (result
);
5487 result
= force_paren_expr (result
);
5492 /* Wrapper for above. */
5495 build_conditional_expr (const op_location_t
&loc
,
5496 tree arg1
, tree arg2
, tree arg3
,
5497 tsubst_flags_t complain
)
5500 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
5501 ret
= build_conditional_expr_1 (loc
, arg1
, arg2
, arg3
, complain
);
5502 timevar_cond_stop (TV_OVERLOAD
, subtime
);
5506 /* OPERAND is an operand to an expression. Perform necessary steps
5507 required before using it. If OPERAND is NULL_TREE, NULL_TREE is
5511 prep_operand (tree operand
)
5515 if (CLASS_TYPE_P (TREE_TYPE (operand
))
5516 && CLASSTYPE_TEMPLATE_INSTANTIATION (TREE_TYPE (operand
)))
5517 /* Make sure the template type is instantiated now. */
5518 instantiate_class_template (TYPE_MAIN_VARIANT (TREE_TYPE (operand
)));
5524 /* Add each of the viable functions in FNS (a FUNCTION_DECL or
5525 OVERLOAD) to the CANDIDATES, returning an updated list of
5526 CANDIDATES. The ARGS are the arguments provided to the call;
5527 if FIRST_ARG is non-null it is the implicit object argument,
5528 otherwise the first element of ARGS is used if needed. The
5529 EXPLICIT_TARGS are explicit template arguments provided.
5530 TEMPLATE_ONLY is true if only template functions should be
5531 considered. CONVERSION_PATH, ACCESS_PATH, and FLAGS are as for
5532 add_function_candidate. */
5535 add_candidates (tree fns
, tree first_arg
, const vec
<tree
, va_gc
> *args
,
5537 tree explicit_targs
, bool template_only
,
5538 tree conversion_path
, tree access_path
,
5540 struct z_candidate
**candidates
,
5541 tsubst_flags_t complain
)
5544 const vec
<tree
, va_gc
> *non_static_args
;
5545 bool check_list_ctor
= false;
5546 bool check_converting
= false;
5547 unification_kind_t strict
;
5552 /* Precalculate special handling of constructors and conversion ops. */
5553 tree fn
= OVL_FIRST (fns
);
5554 if (DECL_CONV_FN_P (fn
))
5556 check_list_ctor
= false;
5557 check_converting
= (flags
& LOOKUP_ONLYCONVERTING
) != 0;
5558 if (flags
& LOOKUP_NO_CONVERSION
)
5559 /* We're doing return_type(x). */
5560 strict
= DEDUCE_CONV
;
5562 /* We're doing x.operator return_type(). */
5563 strict
= DEDUCE_EXACT
;
5564 /* [over.match.funcs] For conversion functions, the function
5565 is considered to be a member of the class of the implicit
5566 object argument for the purpose of defining the type of
5567 the implicit object parameter. */
5568 ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (first_arg
));
5572 if (DECL_CONSTRUCTOR_P (fn
))
5574 check_list_ctor
= (flags
& LOOKUP_LIST_ONLY
) != 0;
5575 /* For list-initialization we consider explicit constructors
5576 and complain if one is chosen. */
5578 = ((flags
& (LOOKUP_ONLYCONVERTING
|LOOKUP_LIST_INIT_CTOR
))
5579 == LOOKUP_ONLYCONVERTING
);
5581 strict
= DEDUCE_CALL
;
5582 ctype
= conversion_path
? BINFO_TYPE (conversion_path
) : NULL_TREE
;
5586 non_static_args
= args
;
5588 /* Delay creating the implicit this parameter until it is needed. */
5589 non_static_args
= NULL
;
5591 for (lkp_iterator
iter (fns
); iter
; ++iter
)
5595 if (check_converting
&& DECL_NONCONVERTING_P (fn
))
5597 if (check_list_ctor
&& !is_list_ctor (fn
))
5600 tree fn_first_arg
= NULL_TREE
;
5601 const vec
<tree
, va_gc
> *fn_args
= args
;
5603 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5605 /* Figure out where the object arg comes from. If this
5606 function is a non-static member and we didn't get an
5607 implicit object argument, move it out of args. */
5608 if (first_arg
== NULL_TREE
)
5612 vec
<tree
, va_gc
> *tempvec
;
5613 vec_alloc (tempvec
, args
->length () - 1);
5614 for (ix
= 1; args
->iterate (ix
, &arg
); ++ix
)
5615 tempvec
->quick_push (arg
);
5616 non_static_args
= tempvec
;
5617 first_arg
= (*args
)[0];
5620 fn_first_arg
= first_arg
;
5621 fn_args
= non_static_args
;
5624 if (TREE_CODE (fn
) == TEMPLATE_DECL
)
5625 add_template_candidate (candidates
,
5637 else if (!template_only
)
5638 add_function_candidate (candidates
,
5651 /* Returns 1 if P0145R2 says that the LHS of operator CODE is evaluated first,
5652 -1 if the RHS is evaluated first, or 0 if the order is unspecified. */
5655 op_is_ordered (tree_code code
)
5661 return (flag_strong_eval_order
> 1 ? -1 : 0);
5665 return (flag_strong_eval_order
> 1 ? 1 : 0);
5668 // Not overloadable (yet).
5670 // Only one argument.
5677 return (flag_strong_eval_order
? 1 : 0);
5685 build_new_op_1 (const op_location_t
&loc
, enum tree_code code
, int flags
,
5686 tree arg1
, tree arg2
, tree arg3
, tree
*overload
,
5687 tsubst_flags_t complain
)
5689 struct z_candidate
*candidates
= 0, *cand
;
5690 vec
<tree
, va_gc
> *arglist
;
5692 tree result
= NULL_TREE
;
5693 bool result_valid_p
= false;
5694 enum tree_code code2
= NOP_EXPR
;
5695 enum tree_code code_orig_arg1
= ERROR_MARK
;
5696 enum tree_code code_orig_arg2
= ERROR_MARK
;
5702 if (error_operand_p (arg1
)
5703 || error_operand_p (arg2
)
5704 || error_operand_p (arg3
))
5705 return error_mark_node
;
5707 bool ismodop
= code
== MODIFY_EXPR
;
5710 code2
= TREE_CODE (arg3
);
5713 tree fnname
= ovl_op_identifier (ismodop
, ismodop
? code2
: code
);
5715 arg1
= prep_operand (arg1
);
5717 bool memonly
= false;
5722 case VEC_DELETE_EXPR
:
5724 /* Use build_op_new_call and build_op_delete_call instead. */
5728 /* Use build_op_call instead. */
5731 case TRUTH_ORIF_EXPR
:
5732 case TRUTH_ANDIF_EXPR
:
5733 case TRUTH_AND_EXPR
:
5735 /* These are saved for the sake of warn_logical_operator. */
5736 code_orig_arg1
= TREE_CODE (arg1
);
5737 code_orig_arg2
= TREE_CODE (arg2
);
5745 /* These are saved for the sake of maybe_warn_bool_compare. */
5746 code_orig_arg1
= TREE_CODE (TREE_TYPE (arg1
));
5747 code_orig_arg2
= TREE_CODE (TREE_TYPE (arg2
));
5750 /* =, ->, [], () must be non-static member functions. */
5752 if (code2
!= NOP_EXPR
)
5764 arg2
= prep_operand (arg2
);
5765 arg3
= prep_operand (arg3
);
5767 if (code
== COND_EXPR
)
5768 /* Use build_conditional_expr instead. */
5770 else if (! OVERLOAD_TYPE_P (TREE_TYPE (arg1
))
5771 && (! arg2
|| ! OVERLOAD_TYPE_P (TREE_TYPE (arg2
))))
5774 if (code
== POSTINCREMENT_EXPR
|| code
== POSTDECREMENT_EXPR
)
5775 arg2
= integer_zero_node
;
5777 vec_alloc (arglist
, 3);
5778 arglist
->quick_push (arg1
);
5779 if (arg2
!= NULL_TREE
)
5780 arglist
->quick_push (arg2
);
5781 if (arg3
!= NULL_TREE
)
5782 arglist
->quick_push (arg3
);
5784 /* Get the high-water mark for the CONVERSION_OBSTACK. */
5785 p
= conversion_obstack_alloc (0);
5787 /* Add namespace-scope operators to the list of functions to
5791 tree fns
= lookup_name_real (fnname
, 0, 1, /*block_p=*/true, 0, 0);
5792 fns
= lookup_arg_dependent (fnname
, fns
, arglist
);
5793 add_candidates (fns
, NULL_TREE
, arglist
, NULL_TREE
,
5794 NULL_TREE
, false, NULL_TREE
, NULL_TREE
,
5795 flags
, &candidates
, complain
);
5800 args
[2] = NULL_TREE
;
5802 /* Add class-member operators to the candidate set. */
5803 if (CLASS_TYPE_P (TREE_TYPE (arg1
)))
5807 fns
= lookup_fnfields (TREE_TYPE (arg1
), fnname
, 1);
5808 if (fns
== error_mark_node
)
5810 result
= error_mark_node
;
5811 goto user_defined_result_ready
;
5814 add_candidates (BASELINK_FUNCTIONS (fns
),
5815 NULL_TREE
, arglist
, NULL_TREE
,
5817 BASELINK_BINFO (fns
),
5818 BASELINK_ACCESS_BINFO (fns
),
5819 flags
, &candidates
, complain
);
5821 /* Per 13.3.1.2/3, 2nd bullet, if no operand has a class type, then
5822 only non-member functions that have type T1 or reference to
5823 cv-qualified-opt T1 for the first argument, if the first argument
5824 has an enumeration type, or T2 or reference to cv-qualified-opt
5825 T2 for the second argument, if the second argument has an
5826 enumeration type. Filter out those that don't match. */
5827 else if (! arg2
|| ! CLASS_TYPE_P (TREE_TYPE (arg2
)))
5829 struct z_candidate
**candp
, **next
;
5831 for (candp
= &candidates
; *candp
; candp
= next
)
5833 tree parmlist
, parmtype
;
5834 int i
, nargs
= (arg2
? 2 : 1);
5839 parmlist
= TYPE_ARG_TYPES (TREE_TYPE (cand
->fn
));
5841 for (i
= 0; i
< nargs
; ++i
)
5843 parmtype
= TREE_VALUE (parmlist
);
5845 if (TYPE_REF_P (parmtype
))
5846 parmtype
= TREE_TYPE (parmtype
);
5847 if (TREE_CODE (TREE_TYPE (args
[i
])) == ENUMERAL_TYPE
5848 && (same_type_ignoring_top_level_qualifiers_p
5849 (TREE_TYPE (args
[i
]), parmtype
)))
5852 parmlist
= TREE_CHAIN (parmlist
);
5855 /* No argument has an appropriate type, so remove this
5856 candidate function from the list. */
5859 *candp
= cand
->next
;
5865 add_builtin_candidates (&candidates
, code
, code2
, fnname
, args
,
5872 /* For these, the built-in candidates set is empty
5873 [over.match.oper]/3. We don't want non-strict matches
5874 because exact matches are always possible with built-in
5875 operators. The built-in candidate set for COMPONENT_REF
5876 would be empty too, but since there are no such built-in
5877 operators, we accept non-strict matches for them. */
5886 candidates
= splice_viable (candidates
, strict_p
, &any_viable_p
);
5891 case POSTINCREMENT_EXPR
:
5892 case POSTDECREMENT_EXPR
:
5893 /* Don't try anything fancy if we're not allowed to produce
5895 if (!(complain
& tf_error
))
5896 return error_mark_node
;
5898 /* Look for an `operator++ (int)'. Pre-1985 C++ didn't
5899 distinguish between prefix and postfix ++ and
5900 operator++() was used for both, so we allow this with
5904 const char *msg
= (flag_permissive
)
5905 ? G_("no %<%D(int)%> declared for postfix %qs,"
5906 " trying prefix operator instead")
5907 : G_("no %<%D(int)%> declared for postfix %qs");
5908 permerror (loc
, msg
, fnname
, OVL_OP_INFO (false, code
)->name
);
5911 if (!flag_permissive
)
5912 return error_mark_node
;
5914 if (code
== POSTINCREMENT_EXPR
)
5915 code
= PREINCREMENT_EXPR
;
5917 code
= PREDECREMENT_EXPR
;
5918 result
= build_new_op_1 (loc
, code
, flags
, arg1
, NULL_TREE
,
5919 NULL_TREE
, overload
, complain
);
5922 /* The caller will deal with these. */
5927 result_valid_p
= true;
5931 if (complain
& tf_error
)
5933 /* If one of the arguments of the operator represents
5934 an invalid use of member function pointer, try to report
5935 a meaningful error ... */
5936 if (invalid_nonstatic_memfn_p (loc
, arg1
, tf_error
)
5937 || invalid_nonstatic_memfn_p (loc
, arg2
, tf_error
)
5938 || invalid_nonstatic_memfn_p (loc
, arg3
, tf_error
))
5939 /* We displayed the error message. */;
5942 /* ... Otherwise, report the more generic
5943 "no matching operator found" error */
5944 auto_diagnostic_group d
;
5945 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, FALSE
);
5946 print_z_candidates (loc
, candidates
);
5949 result
= error_mark_node
;
5955 cand
= tourney (candidates
, complain
);
5958 if (complain
& tf_error
)
5960 auto_diagnostic_group d
;
5961 op_error (loc
, code
, code2
, arg1
, arg2
, arg3
, TRUE
);
5962 print_z_candidates (loc
, candidates
);
5964 result
= error_mark_node
;
5966 else if (TREE_CODE (cand
->fn
) == FUNCTION_DECL
)
5969 *overload
= cand
->fn
;
5971 if (resolve_args (arglist
, complain
) == NULL
)
5972 result
= error_mark_node
;
5974 result
= build_over_call (cand
, LOOKUP_NORMAL
, complain
);
5976 if (trivial_fn_p (cand
->fn
))
5977 /* There won't be a CALL_EXPR. */;
5978 else if (result
&& result
!= error_mark_node
)
5980 tree call
= extract_call_expr (result
);
5981 CALL_EXPR_OPERATOR_SYNTAX (call
) = true;
5983 if (processing_template_decl
&& DECL_HIDDEN_FRIEND_P (cand
->fn
))
5984 /* This prevents build_new_function_call from discarding this
5985 function during instantiation of the enclosing template. */
5986 KOENIG_LOOKUP_P (call
) = 1;
5988 /* Specify evaluation order as per P0145R2. */
5989 CALL_EXPR_ORDERED_ARGS (call
) = false;
5990 switch (op_is_ordered (code
))
5993 CALL_EXPR_REVERSE_ARGS (call
) = true;
5997 CALL_EXPR_ORDERED_ARGS (call
) = true;
6007 /* Give any warnings we noticed during overload resolution. */
6008 if (cand
->warnings
&& (complain
& tf_warning
))
6010 struct candidate_warning
*w
;
6011 for (w
= cand
->warnings
; w
; w
= w
->next
)
6012 joust (cand
, w
->loser
, 1, complain
);
6015 /* Check for comparison of different enum types. */
6024 if (TREE_CODE (TREE_TYPE (arg1
)) == ENUMERAL_TYPE
6025 && TREE_CODE (TREE_TYPE (arg2
)) == ENUMERAL_TYPE
6026 && (TYPE_MAIN_VARIANT (TREE_TYPE (arg1
))
6027 != TYPE_MAIN_VARIANT (TREE_TYPE (arg2
)))
6028 && (complain
& tf_warning
))
6030 warning (OPT_Wenum_compare
,
6031 "comparison between %q#T and %q#T",
6032 TREE_TYPE (arg1
), TREE_TYPE (arg2
));
6039 /* We need to strip any leading REF_BIND so that bitfields
6040 don't cause errors. This should not remove any important
6041 conversions, because builtins don't apply to class
6042 objects directly. */
6043 conv
= cand
->convs
[0];
6044 if (conv
->kind
== ck_ref_bind
)
6045 conv
= next_conversion (conv
);
6046 arg1
= convert_like (conv
, arg1
, complain
);
6050 conv
= cand
->convs
[1];
6051 if (conv
->kind
== ck_ref_bind
)
6052 conv
= next_conversion (conv
);
6054 arg2
= decay_conversion (arg2
, complain
);
6056 /* We need to call warn_logical_operator before
6057 converting arg2 to a boolean_type, but after
6058 decaying an enumerator to its value. */
6059 if (complain
& tf_warning
)
6060 warn_logical_operator (loc
, code
, boolean_type_node
,
6061 code_orig_arg1
, arg1
,
6062 code_orig_arg2
, arg2
);
6064 arg2
= convert_like (conv
, arg2
, complain
);
6068 conv
= cand
->convs
[2];
6069 if (conv
->kind
== ck_ref_bind
)
6070 conv
= next_conversion (conv
);
6071 arg3
= convert_like (conv
, arg3
, complain
);
6077 user_defined_result_ready
:
6079 /* Free all the conversions we allocated. */
6080 obstack_free (&conversion_obstack
, p
);
6082 if (result
|| result_valid_p
)
6089 return cp_build_modify_expr (loc
, arg1
, code2
, arg2
, complain
);
6092 return cp_build_indirect_ref (arg1
, RO_UNARY_STAR
, complain
);
6094 case TRUTH_ANDIF_EXPR
:
6095 case TRUTH_ORIF_EXPR
:
6096 case TRUTH_AND_EXPR
:
6098 if (complain
& tf_warning
)
6099 warn_logical_operator (loc
, code
, boolean_type_node
,
6100 code_orig_arg1
, arg1
,
6101 code_orig_arg2
, arg2
);
6109 if ((complain
& tf_warning
)
6110 && ((code_orig_arg1
== BOOLEAN_TYPE
)
6111 ^ (code_orig_arg2
== BOOLEAN_TYPE
)))
6112 maybe_warn_bool_compare (loc
, code
, arg1
, arg2
);
6113 if (complain
& tf_warning
&& warn_tautological_compare
)
6114 warn_tautological_cmp (loc
, code
, arg1
, arg2
);
6119 case TRUNC_DIV_EXPR
:
6124 case TRUNC_MOD_EXPR
:
6128 return cp_build_binary_op (loc
, code
, arg1
, arg2
, complain
);
6130 case UNARY_PLUS_EXPR
:
6133 case TRUTH_NOT_EXPR
:
6134 case PREINCREMENT_EXPR
:
6135 case POSTINCREMENT_EXPR
:
6136 case PREDECREMENT_EXPR
:
6137 case POSTDECREMENT_EXPR
:
6141 return cp_build_unary_op (code
, arg1
, candidates
!= 0, complain
);
6144 return cp_build_array_ref (input_location
, arg1
, arg2
, complain
);
6147 return build_m_component_ref (cp_build_indirect_ref (arg1
, RO_ARROW_STAR
,
6151 /* The caller will deal with these. */
6163 /* Wrapper for above. */
6166 build_new_op (const op_location_t
&loc
, enum tree_code code
, int flags
,
6167 tree arg1
, tree arg2
, tree arg3
,
6168 tree
*overload
, tsubst_flags_t complain
)
6171 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
6172 ret
= build_new_op_1 (loc
, code
, flags
, arg1
, arg2
, arg3
,
6173 overload
, complain
);
6174 timevar_cond_stop (TV_OVERLOAD
, subtime
);
6178 /* CALL was returned by some call-building function; extract the actual
6179 CALL_EXPR from any bits that have been tacked on, e.g. by
6180 convert_from_reference. */
6183 extract_call_expr (tree call
)
6185 while (TREE_CODE (call
) == COMPOUND_EXPR
)
6186 call
= TREE_OPERAND (call
, 1);
6187 if (REFERENCE_REF_P (call
))
6188 call
= TREE_OPERAND (call
, 0);
6189 if (TREE_CODE (call
) == TARGET_EXPR
)
6190 call
= TARGET_EXPR_INITIAL (call
);
6191 gcc_assert (TREE_CODE (call
) == CALL_EXPR
6192 || TREE_CODE (call
) == AGGR_INIT_EXPR
6193 || call
== error_mark_node
);
6197 /* Returns true if FN has two parameters, of which the second has type
6201 second_parm_is_size_t (tree fn
)
6203 tree t
= FUNCTION_ARG_CHAIN (fn
);
6204 if (!t
|| !same_type_p (TREE_VALUE (t
), size_type_node
))
6207 if (t
== void_list_node
)
6209 if (aligned_new_threshold
&& t
6210 && same_type_p (TREE_VALUE (t
), align_type_node
)
6211 && TREE_CHAIN (t
) == void_list_node
)
6216 /* True if T, an allocation function, has std::align_val_t as its second
6220 aligned_allocation_fn_p (tree t
)
6222 if (!aligned_new_threshold
)
6225 tree a
= FUNCTION_ARG_CHAIN (t
);
6226 return (a
&& same_type_p (TREE_VALUE (a
), align_type_node
));
6229 /* True if T is std::destroying_delete_t. */
6232 std_destroying_delete_t_p (tree t
)
6234 return (TYPE_CONTEXT (t
) == std_node
6235 && id_equal (TYPE_IDENTIFIER (t
), "destroying_delete_t"));
6238 /* A deallocation function with at least two parameters whose second parameter
6239 type is of type std::destroying_delete_t is a destroying operator delete. A
6240 destroying operator delete shall be a class member function named operator
6241 delete. [ Note: Array deletion cannot use a destroying operator
6242 delete. --end note ] */
6245 destroying_delete_p (tree t
)
6247 tree a
= TYPE_ARG_TYPES (TREE_TYPE (t
));
6248 if (!a
|| !TREE_CHAIN (a
))
6250 tree type
= TREE_VALUE (TREE_CHAIN (a
));
6251 return std_destroying_delete_t_p (type
) ? type
: NULL_TREE
;
6254 /* Returns true iff T, an element of an OVERLOAD chain, is a usual deallocation
6255 function (3.7.4.2 [basic.stc.dynamic.deallocation]) with a parameter of
6256 std::align_val_t. */
6259 aligned_deallocation_fn_p (tree t
)
6261 if (!aligned_new_threshold
)
6264 /* A template instance is never a usual deallocation function,
6265 regardless of its signature. */
6266 if (TREE_CODE (t
) == TEMPLATE_DECL
6267 || primary_template_specialization_p (t
))
6270 tree a
= FUNCTION_ARG_CHAIN (t
);
6271 if (destroying_delete_p (t
))
6273 if (same_type_p (TREE_VALUE (a
), align_type_node
)
6274 && TREE_CHAIN (a
) == void_list_node
)
6276 if (!same_type_p (TREE_VALUE (a
), size_type_node
))
6279 if (a
&& same_type_p (TREE_VALUE (a
), align_type_node
)
6280 && TREE_CHAIN (a
) == void_list_node
)
6285 /* Returns true iff T, an element of an OVERLOAD chain, is a usual
6286 deallocation function (3.7.4.2 [basic.stc.dynamic.deallocation]). */
6289 usual_deallocation_fn_p (tree t
)
6291 /* A template instance is never a usual deallocation function,
6292 regardless of its signature. */
6293 if (TREE_CODE (t
) == TEMPLATE_DECL
6294 || primary_template_specialization_p (t
))
6297 /* If a class T has a member deallocation function named operator delete
6298 with exactly one parameter, then that function is a usual
6299 (non-placement) deallocation function. If class T does not declare
6300 such an operator delete but does declare a member deallocation
6301 function named operator delete with exactly two parameters, the second
6302 of which has type std::size_t (18.2), then this function is a usual
6303 deallocation function. */
6304 bool global
= DECL_NAMESPACE_SCOPE_P (t
);
6305 tree chain
= FUNCTION_ARG_CHAIN (t
);
6308 if (destroying_delete_p (t
))
6309 chain
= TREE_CHAIN (chain
);
6310 if (chain
== void_list_node
6311 || ((!global
|| flag_sized_deallocation
)
6312 && second_parm_is_size_t (t
)))
6314 if (aligned_deallocation_fn_p (t
))
6319 /* Build a call to operator delete. This has to be handled very specially,
6320 because the restrictions on what signatures match are different from all
6321 other call instances. For a normal delete, only a delete taking (void *)
6322 or (void *, size_t) is accepted. For a placement delete, only an exact
6323 match with the placement new is accepted.
6325 CODE is either DELETE_EXPR or VEC_DELETE_EXPR.
6326 ADDR is the pointer to be deleted.
6327 SIZE is the size of the memory block to be deleted.
6328 GLOBAL_P is true if the delete-expression should not consider
6329 class-specific delete operators.
6330 PLACEMENT is the corresponding placement new call, or NULL_TREE.
6332 If this call to "operator delete" is being generated as part to
6333 deallocate memory allocated via a new-expression (as per [expr.new]
6334 which requires that if the initialization throws an exception then
6335 we call a deallocation function), then ALLOC_FN is the allocation
6339 build_op_delete_call (enum tree_code code
, tree addr
, tree size
,
6340 bool global_p
, tree placement
,
6341 tree alloc_fn
, tsubst_flags_t complain
)
6343 tree fn
= NULL_TREE
;
6344 tree fns
, fnname
, type
, t
;
6346 if (addr
== error_mark_node
)
6347 return error_mark_node
;
6349 type
= strip_array_types (TREE_TYPE (TREE_TYPE (addr
)));
6351 fnname
= ovl_op_identifier (false, code
);
6353 if (CLASS_TYPE_P (type
)
6354 && COMPLETE_TYPE_P (complete_type (type
))
6358 If the result of the lookup is ambiguous or inaccessible, or if
6359 the lookup selects a placement deallocation function, the
6360 program is ill-formed.
6362 Therefore, we ask lookup_fnfields to complain about ambiguity. */
6364 fns
= lookup_fnfields (TYPE_BINFO (type
), fnname
, 1);
6365 if (fns
== error_mark_node
)
6366 return error_mark_node
;
6371 if (fns
== NULL_TREE
)
6372 fns
= lookup_name_nonclass (fnname
);
6374 /* Strip const and volatile from addr. */
6376 addr
= cp_convert (ptr_type_node
, addr
, complain
);
6380 /* "A declaration of a placement deallocation function matches the
6381 declaration of a placement allocation function if it has the same
6382 number of parameters and, after parameter transformations (8.3.5),
6383 all parameter types except the first are identical."
6385 So we build up the function type we want and ask instantiate_type
6386 to get it for us. */
6387 t
= FUNCTION_ARG_CHAIN (alloc_fn
);
6388 t
= tree_cons (NULL_TREE
, ptr_type_node
, t
);
6389 t
= build_function_type (void_type_node
, t
);
6391 fn
= instantiate_type (t
, fns
, tf_none
);
6392 if (fn
== error_mark_node
)
6395 fn
= MAYBE_BASELINK_FUNCTIONS (fn
);
6397 /* "If the lookup finds the two-parameter form of a usual deallocation
6398 function (3.7.4.2) and that function, considered as a placement
6399 deallocation function, would have been selected as a match for the
6400 allocation function, the program is ill-formed." */
6401 if (second_parm_is_size_t (fn
))
6403 const char *const msg1
6404 = G_("exception cleanup for this placement new selects "
6405 "non-placement operator delete");
6406 const char *const msg2
6407 = G_("%qD is a usual (non-placement) deallocation "
6408 "function in C++14 (or with -fsized-deallocation)");
6410 /* But if the class has an operator delete (void *), then that is
6411 the usual deallocation function, so we shouldn't complain
6412 about using the operator delete (void *, size_t). */
6413 if (DECL_CLASS_SCOPE_P (fn
))
6414 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
));
6418 if (usual_deallocation_fn_p (elt
)
6419 && FUNCTION_ARG_CHAIN (elt
) == void_list_node
)
6422 /* Before C++14 a two-parameter global deallocation function is
6423 always a placement deallocation function, but warn if
6425 else if (!flag_sized_deallocation
)
6427 if (complain
& tf_warning
)
6429 auto_diagnostic_group d
;
6430 if (warning (OPT_Wc__14_compat
, msg1
))
6431 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6436 if (complain
& tf_warning_or_error
)
6438 auto_diagnostic_group d
;
6439 if (permerror (input_location
, msg1
))
6441 /* Only mention C++14 for namespace-scope delete. */
6442 if (DECL_NAMESPACE_SCOPE_P (fn
))
6443 inform (DECL_SOURCE_LOCATION (fn
), msg2
, fn
);
6445 inform (DECL_SOURCE_LOCATION (fn
),
6446 "%qD is a usual (non-placement) deallocation "
6451 return error_mark_node
;
6456 /* "Any non-placement deallocation function matches a non-placement
6457 allocation function. If the lookup finds a single matching
6458 deallocation function, that function will be called; otherwise, no
6459 deallocation function will be called." */
6460 for (lkp_iterator
iter (MAYBE_BASELINK_FUNCTIONS (fns
)); iter
; ++iter
)
6463 if (usual_deallocation_fn_p (elt
))
6471 /* -- If any of the deallocation functions is a destroying
6472 operator delete, all deallocation functions that are not
6473 destroying operator deletes are eliminated from further
6475 bool fn_destroying
= destroying_delete_p (fn
);
6476 bool elt_destroying
= destroying_delete_p (elt
);
6477 if (elt_destroying
!= fn_destroying
)
6484 /* -- If the type has new-extended alignment, a function with a
6485 parameter of type std::align_val_t is preferred; otherwise a
6486 function without such a parameter is preferred. If exactly one
6487 preferred function is found, that function is selected and the
6488 selection process terminates. If more than one preferred
6489 function is found, all non-preferred functions are eliminated
6490 from further consideration. */
6491 if (aligned_new_threshold
)
6493 bool want_align
= type_has_new_extended_alignment (type
);
6494 bool fn_align
= aligned_deallocation_fn_p (fn
);
6495 bool elt_align
= aligned_deallocation_fn_p (elt
);
6497 if (elt_align
!= fn_align
)
6499 if (want_align
== elt_align
)
6505 /* -- If the deallocation functions have class scope, the one
6506 without a parameter of type std::size_t is selected. */
6508 if (DECL_CLASS_SCOPE_P (fn
))
6511 /* -- If the type is complete and if, for the second alternative
6512 (delete array) only, the operand is a pointer to a class type
6513 with a non-trivial destructor or a (possibly multi-dimensional)
6514 array thereof, the function with a parameter of type std::size_t
6517 -- Otherwise, it is unspecified whether a deallocation function
6518 with a parameter of type std::size_t is selected. */
6521 want_size
= COMPLETE_TYPE_P (type
);
6522 if (code
== VEC_DELETE_EXPR
6523 && !TYPE_VEC_NEW_USES_COOKIE (type
))
6524 /* We need a cookie to determine the array size. */
6527 bool fn_size
= second_parm_is_size_t (fn
);
6528 bool elt_size
= second_parm_is_size_t (elt
);
6529 gcc_assert (fn_size
!= elt_size
);
6530 if (want_size
== elt_size
)
6535 /* If we have a matching function, call it. */
6538 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
6540 /* If the FN is a member function, make sure that it is
6542 if (BASELINK_P (fns
))
6543 perform_or_defer_access_check (BASELINK_BINFO (fns
), fn
, fn
,
6546 /* Core issue 901: It's ok to new a type with deleted delete. */
6547 if (DECL_DELETED_FN (fn
) && alloc_fn
)
6552 /* The placement args might not be suitable for overload
6553 resolution at this point, so build the call directly. */
6554 int nargs
= call_expr_nargs (placement
);
6555 tree
*argarray
= XALLOCAVEC (tree
, nargs
);
6558 for (i
= 1; i
< nargs
; i
++)
6559 argarray
[i
] = CALL_EXPR_ARG (placement
, i
);
6560 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
6561 return error_mark_node
;
6562 return build_cxx_call (fn
, nargs
, argarray
, complain
);
6566 tree destroying
= destroying_delete_p (fn
);
6569 /* Strip const and volatile from addr but retain the type of the
6571 tree rtype
= TREE_TYPE (TREE_TYPE (oaddr
));
6572 rtype
= cv_unqualified (rtype
);
6573 rtype
= TYPE_POINTER_TO (rtype
);
6574 addr
= cp_convert (rtype
, oaddr
, complain
);
6575 destroying
= build_functional_cast (destroying
, NULL_TREE
,
6580 vec
<tree
, va_gc
> *args
= make_tree_vector ();
6581 args
->quick_push (addr
);
6583 args
->quick_push (destroying
);
6584 if (second_parm_is_size_t (fn
))
6585 args
->quick_push (size
);
6586 if (aligned_deallocation_fn_p (fn
))
6588 tree al
= build_int_cst (align_type_node
, TYPE_ALIGN_UNIT (type
));
6589 args
->quick_push (al
);
6591 ret
= cp_build_function_call_vec (fn
, &args
, complain
);
6592 release_tree_vector (args
);
6599 If no unambiguous matching deallocation function can be found,
6600 propagating the exception does not cause the object's memory to
6604 if ((complain
& tf_warning
)
6606 warning (0, "no corresponding deallocation function for %qD",
6611 if (complain
& tf_error
)
6612 error ("no suitable %<operator %s%> for %qT",
6613 OVL_OP_INFO (false, code
)->name
, type
);
6614 return error_mark_node
;
6617 /* Issue diagnostics about a disallowed access of DECL, using DIAG_DECL
6620 If ISSUE_ERROR is true, then issue an error about the
6621 access, followed by a note showing the declaration.
6622 Otherwise, just show the note. */
6625 complain_about_access (tree decl
, tree diag_decl
, bool issue_error
)
6627 if (TREE_PRIVATE (decl
))
6630 error ("%q#D is private within this context", diag_decl
);
6631 inform (DECL_SOURCE_LOCATION (diag_decl
),
6632 "declared private here");
6634 else if (TREE_PROTECTED (decl
))
6637 error ("%q#D is protected within this context", diag_decl
);
6638 inform (DECL_SOURCE_LOCATION (diag_decl
),
6639 "declared protected here");
6644 error ("%q#D is inaccessible within this context", diag_decl
);
6645 inform (DECL_SOURCE_LOCATION (diag_decl
), "declared here");
6649 /* If the current scope isn't allowed to access DECL along
6650 BASETYPE_PATH, give an error. The most derived class in
6651 BASETYPE_PATH is the one used to qualify DECL. DIAG_DECL is
6652 the declaration to use in the error diagnostic. */
6655 enforce_access (tree basetype_path
, tree decl
, tree diag_decl
,
6656 tsubst_flags_t complain
, access_failure_info
*afi
)
6658 gcc_assert (TREE_CODE (basetype_path
) == TREE_BINFO
);
6660 if (flag_new_inheriting_ctors
6661 && DECL_INHERITED_CTOR (decl
))
6663 /* 7.3.3/18: The additional constructors are accessible if they would be
6664 accessible when used to construct an object of the corresponding base
6666 decl
= strip_inheriting_ctors (decl
);
6667 basetype_path
= lookup_base (basetype_path
, DECL_CONTEXT (decl
),
6668 ba_any
, NULL
, complain
);
6671 if (!accessible_p (basetype_path
, decl
, true))
6673 if (flag_new_inheriting_ctors
)
6674 diag_decl
= strip_inheriting_ctors (diag_decl
);
6675 if (complain
& tf_error
)
6676 complain_about_access (decl
, diag_decl
, true);
6678 afi
->record_access_failure (basetype_path
, decl
, diag_decl
);
6685 /* Initialize a temporary of type TYPE with EXPR. The FLAGS are a
6686 bitwise or of LOOKUP_* values. If any errors are warnings are
6687 generated, set *DIAGNOSTIC_FN to "error" or "warning",
6688 respectively. If no diagnostics are generated, set *DIAGNOSTIC_FN
6692 build_temp (tree expr
, tree type
, int flags
,
6693 diagnostic_t
*diagnostic_kind
, tsubst_flags_t complain
)
6696 vec
<tree
, va_gc
> *args
;
6698 *diagnostic_kind
= DK_UNSPECIFIED
;
6700 /* If the source is a packed field, calling the copy constructor will require
6701 binding the field to the reference parameter to the copy constructor, and
6702 we'll end up with an infinite loop. If we can use a bitwise copy, then
6704 if ((lvalue_kind (expr
) & clk_packed
)
6705 && CLASS_TYPE_P (TREE_TYPE (expr
))
6706 && !type_has_nontrivial_copy_init (TREE_TYPE (expr
)))
6707 return get_target_expr_sfinae (expr
, complain
);
6709 savew
= warningcount
+ werrorcount
, savee
= errorcount
;
6710 args
= make_tree_vector_single (expr
);
6711 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
6712 &args
, type
, flags
, complain
);
6713 release_tree_vector (args
);
6714 if (warningcount
+ werrorcount
> savew
)
6715 *diagnostic_kind
= DK_WARNING
;
6716 else if (errorcount
> savee
)
6717 *diagnostic_kind
= DK_ERROR
;
6721 /* Perform warnings about peculiar, but valid, conversions from/to NULL.
6722 Also handle a subset of zero as null warnings.
6723 EXPR is implicitly converted to type TOTYPE.
6724 FN and ARGNUM are used for diagnostics. */
6727 conversion_null_warnings (tree totype
, tree expr
, tree fn
, int argnum
)
6729 /* Issue warnings about peculiar, but valid, uses of NULL. */
6730 if (null_node_p (expr
) && TREE_CODE (totype
) != BOOLEAN_TYPE
6731 && ARITHMETIC_TYPE_P (totype
))
6733 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6734 loc
= expansion_point_location_if_in_system_header (loc
);
6737 auto_diagnostic_group d
;
6738 if (warning_at (loc
, OPT_Wconversion_null
,
6739 "passing NULL to non-pointer argument %P of %qD",
6741 inform (get_fndecl_argument_location (fn
, argnum
),
6745 warning_at (loc
, OPT_Wconversion_null
,
6746 "converting to non-pointer type %qT from NULL", totype
);
6749 /* Issue warnings if "false" is converted to a NULL pointer */
6750 else if (TREE_CODE (TREE_TYPE (expr
)) == BOOLEAN_TYPE
6751 && TYPE_PTR_P (totype
))
6753 location_t loc
= EXPR_LOC_OR_LOC (expr
, input_location
);
6756 auto_diagnostic_group d
;
6757 if (warning_at (loc
, OPT_Wconversion_null
,
6758 "converting %<false%> to pointer type for argument "
6759 "%P of %qD", argnum
, fn
))
6760 inform (get_fndecl_argument_location (fn
, argnum
),
6764 warning_at (loc
, OPT_Wconversion_null
,
6765 "converting %<false%> to pointer type %qT", totype
);
6767 /* Handle zero as null pointer warnings for cases other
6768 than EQ_EXPR and NE_EXPR */
6769 else if (null_ptr_cst_p (expr
) &&
6770 (TYPE_PTR_OR_PTRMEM_P (totype
) || NULLPTR_TYPE_P (totype
)))
6773 expansion_point_location_if_in_system_header (input_location
);
6774 maybe_warn_zero_as_null_pointer_constant (expr
, loc
);
6778 /* We gave a diagnostic during a conversion. If this was in the second
6779 standard conversion sequence of a user-defined conversion sequence, say
6780 which user-defined conversion. */
6783 maybe_print_user_conv_context (conversion
*convs
)
6785 if (convs
->user_conv_p
)
6786 for (conversion
*t
= convs
; t
; t
= next_conversion (t
))
6787 if (t
->kind
== ck_user
)
6789 print_z_candidate (0, " after user-defined conversion:",
6795 /* Locate the parameter with the given index within FNDECL.
6796 ARGNUM is zero based, -1 indicates the `this' argument of a method.
6797 Return the location of the FNDECL itself if there are problems. */
6800 get_fndecl_argument_location (tree fndecl
, int argnum
)
6802 /* The locations of implicitly-declared functions are likely to be
6803 more meaningful than those of their parameters. */
6804 if (DECL_ARTIFICIAL (fndecl
))
6805 return DECL_SOURCE_LOCATION (fndecl
);
6810 /* Locate param by index within DECL_ARGUMENTS (fndecl). */
6811 for (i
= 0, param
= FUNCTION_FIRST_USER_PARM (fndecl
);
6812 i
< argnum
&& param
;
6813 i
++, param
= TREE_CHAIN (param
))
6816 /* If something went wrong (e.g. if we have a builtin and thus no arguments),
6817 return the location of FNDECL. */
6819 return DECL_SOURCE_LOCATION (fndecl
);
6821 return DECL_SOURCE_LOCATION (param
);
6824 /* If FNDECL is non-NULL, issue a note highlighting ARGNUM
6825 within its declaration (or the fndecl itself if something went
6829 maybe_inform_about_fndecl_for_bogus_argument_init (tree fn
, int argnum
)
6832 inform (get_fndecl_argument_location (fn
, argnum
),
6833 " initializing argument %P of %qD", argnum
, fn
);
6836 /* Perform the conversions in CONVS on the expression EXPR. FN and
6837 ARGNUM are used for diagnostics. ARGNUM is zero based, -1
6838 indicates the `this' argument of a method. INNER is nonzero when
6839 being called to continue a conversion chain. It is negative when a
6840 reference binding will be applied, positive otherwise. If
6841 ISSUE_CONVERSION_WARNINGS is true, warnings about suspicious
6842 conversions will be emitted if appropriate. If C_CAST_P is true,
6843 this conversion is coming from a C-style cast; in that case,
6844 conversions to inaccessible bases are permitted. */
6847 convert_like_real (conversion
*convs
, tree expr
, tree fn
, int argnum
,
6848 bool issue_conversion_warnings
,
6849 bool c_cast_p
, tsubst_flags_t complain
)
6851 tree totype
= convs
->type
;
6852 diagnostic_t diag_kind
;
6854 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
6856 if (convs
->bad_p
&& !(complain
& tf_error
))
6857 return error_mark_node
;
6860 && convs
->kind
!= ck_user
6861 && convs
->kind
!= ck_list
6862 && convs
->kind
!= ck_ambig
6863 && (convs
->kind
!= ck_ref_bind
6864 || (convs
->user_conv_p
&& next_conversion (convs
)->bad_p
))
6865 && (convs
->kind
!= ck_rvalue
6866 || SCALAR_TYPE_P (totype
))
6867 && convs
->kind
!= ck_base
)
6869 bool complained
= false;
6870 conversion
*t
= convs
;
6872 /* Give a helpful error if this is bad because of excess braces. */
6873 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6874 && SCALAR_TYPE_P (totype
)
6875 && CONSTRUCTOR_NELTS (expr
) > 0
6876 && BRACE_ENCLOSED_INITIALIZER_P (CONSTRUCTOR_ELT (expr
, 0)->value
))
6878 complained
= permerror (loc
, "too many braces around initializer "
6880 while (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6881 && CONSTRUCTOR_NELTS (expr
) == 1)
6882 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
6885 /* Give a helpful error if this is bad because a conversion to bool
6886 from std::nullptr_t requires direct-initialization. */
6887 if (NULLPTR_TYPE_P (TREE_TYPE (expr
))
6888 && TREE_CODE (totype
) == BOOLEAN_TYPE
)
6889 complained
= permerror (loc
, "converting to %qH from %qI requires "
6890 "direct-initialization",
6891 totype
, TREE_TYPE (expr
));
6893 for (; t
; t
= next_conversion (t
))
6895 if (t
->kind
== ck_user
&& t
->cand
->reason
)
6897 auto_diagnostic_group d
;
6898 complained
= permerror (loc
, "invalid user-defined conversion "
6899 "from %qH to %qI", TREE_TYPE (expr
),
6902 print_z_candidate (loc
, "candidate is:", t
->cand
);
6903 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6904 /*issue_conversion_warnings=*/false,
6907 if (convs
->kind
== ck_ref_bind
)
6908 expr
= convert_to_reference (totype
, expr
, CONV_IMPLICIT
,
6909 LOOKUP_NORMAL
, NULL_TREE
,
6912 expr
= cp_convert (totype
, expr
, complain
);
6914 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
6917 else if (t
->kind
== ck_user
|| !t
->bad_p
)
6919 expr
= convert_like_real (t
, expr
, fn
, argnum
,
6920 /*issue_conversion_warnings=*/false,
6925 else if (t
->kind
== ck_ambig
)
6926 return convert_like_real (t
, expr
, fn
, argnum
,
6927 /*issue_conversion_warnings=*/false,
6930 else if (t
->kind
== ck_identity
)
6935 range_label_for_type_mismatch
label (TREE_TYPE (expr
), totype
);
6936 gcc_rich_location
richloc (loc
, &label
);
6937 complained
= permerror (&richloc
,
6938 "invalid conversion from %qH to %qI",
6939 TREE_TYPE (expr
), totype
);
6942 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
6944 return cp_convert (totype
, expr
, complain
);
6947 if (issue_conversion_warnings
&& (complain
& tf_warning
))
6948 conversion_null_warnings (totype
, expr
, fn
, argnum
);
6950 switch (convs
->kind
)
6954 struct z_candidate
*cand
= convs
->cand
;
6957 /* We chose the surrogate function from add_conv_candidate, now we
6958 actually need to build the conversion. */
6959 cand
= build_user_type_conversion_1 (totype
, expr
,
6960 LOOKUP_NO_CONVERSION
, complain
);
6962 tree convfn
= cand
->fn
;
6964 /* When converting from an init list we consider explicit
6965 constructors, but actually trying to call one is an error. */
6966 if (DECL_NONCONVERTING_P (convfn
) && DECL_CONSTRUCTOR_P (convfn
)
6967 && BRACE_ENCLOSED_INITIALIZER_P (expr
)
6968 /* Unless this is for direct-list-initialization. */
6969 && (!CONSTRUCTOR_IS_DIRECT_INIT (expr
) || convs
->need_temporary_p
)
6970 /* And in C++98 a default constructor can't be explicit. */
6971 && cxx_dialect
>= cxx11
)
6973 if (!(complain
& tf_error
))
6974 return error_mark_node
;
6975 location_t loc
= location_of (expr
);
6976 if (CONSTRUCTOR_NELTS (expr
) == 0
6977 && FUNCTION_FIRST_USER_PARMTYPE (convfn
) != void_list_node
)
6979 auto_diagnostic_group d
;
6980 if (pedwarn (loc
, 0, "converting to %qT from initializer list "
6981 "would use explicit constructor %qD",
6983 inform (loc
, "in C++11 and above a default constructor "
6987 error ("converting to %qT from initializer list would use "
6988 "explicit constructor %qD", totype
, convfn
);
6991 /* If we're initializing from {}, it's value-initialization. */
6992 if (BRACE_ENCLOSED_INITIALIZER_P (expr
)
6993 && CONSTRUCTOR_NELTS (expr
) == 0
6994 && TYPE_HAS_DEFAULT_CONSTRUCTOR (totype
))
6996 bool direct
= CONSTRUCTOR_IS_DIRECT_INIT (expr
);
6997 if (abstract_virtuals_error_sfinae (NULL_TREE
, totype
, complain
))
6998 return error_mark_node
;
6999 expr
= build_value_init (totype
, complain
);
7000 expr
= get_target_expr_sfinae (expr
, complain
);
7001 if (expr
!= error_mark_node
)
7003 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7004 TARGET_EXPR_DIRECT_INIT_P (expr
) = direct
;
7009 /* We don't know here whether EXPR is being used as an lvalue or
7010 rvalue, but we know it's read. */
7011 mark_exp_read (expr
);
7013 /* Pass LOOKUP_NO_CONVERSION so rvalue/base handling knows not to allow
7015 expr
= build_over_call (cand
, LOOKUP_NORMAL
|LOOKUP_NO_CONVERSION
,
7018 /* If this is a constructor or a function returning an aggr type,
7019 we need to build up a TARGET_EXPR. */
7020 if (DECL_CONSTRUCTOR_P (convfn
))
7022 expr
= build_cplus_new (totype
, expr
, complain
);
7024 /* Remember that this was list-initialization. */
7025 if (convs
->check_narrowing
&& expr
!= error_mark_node
)
7026 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7032 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
7034 int nelts
= CONSTRUCTOR_NELTS (expr
);
7036 expr
= build_value_init (totype
, complain
);
7037 else if (nelts
== 1)
7038 expr
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7042 expr
= mark_use (expr
, /*rvalue_p=*/!convs
->rvaluedness_matches_p
,
7043 /*read_p=*/true, UNKNOWN_LOCATION
,
7044 /*reject_builtin=*/true);
7046 if (type_unknown_p (expr
))
7047 expr
= instantiate_type (totype
, expr
, complain
);
7048 if (expr
== null_node
7049 && INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (totype
))
7050 /* If __null has been converted to an integer type, we do not want to
7051 continue to warn about uses of EXPR as an integer, rather than as a
7053 expr
= build_int_cst (totype
, 0);
7056 /* We leave bad_p off ck_ambig because overload resolution considers
7057 it valid, it just fails when we try to perform it. So we need to
7058 check complain here, too. */
7059 if (complain
& tf_error
)
7061 /* Call build_user_type_conversion again for the error. */
7062 int flags
= (convs
->need_temporary_p
7063 ? LOOKUP_IMPLICIT
: LOOKUP_NORMAL
);
7064 build_user_type_conversion (totype
, convs
->u
.expr
, flags
, complain
);
7065 gcc_assert (seen_error ());
7066 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7068 return error_mark_node
;
7072 /* Conversion to std::initializer_list<T>. */
7073 tree elttype
= TREE_VEC_ELT (CLASSTYPE_TI_ARGS (totype
), 0);
7074 tree new_ctor
= build_constructor (init_list_type_node
, NULL
);
7075 unsigned len
= CONSTRUCTOR_NELTS (expr
);
7076 tree array
, val
, field
;
7077 vec
<constructor_elt
, va_gc
> *vec
= NULL
;
7080 /* Convert all the elements. */
7081 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (expr
), ix
, val
)
7083 tree sub
= convert_like_real (convs
->u
.list
[ix
], val
, fn
, argnum
,
7084 false, false, complain
);
7085 if (sub
== error_mark_node
)
7087 if (!BRACE_ENCLOSED_INITIALIZER_P (val
)
7088 && !check_narrowing (TREE_TYPE (sub
), val
, complain
))
7089 return error_mark_node
;
7090 CONSTRUCTOR_APPEND_ELT (CONSTRUCTOR_ELTS (new_ctor
), NULL_TREE
, sub
);
7091 if (!TREE_CONSTANT (sub
))
7092 TREE_CONSTANT (new_ctor
) = false;
7094 /* Build up the array. */
7095 elttype
= cp_build_qualified_type
7096 (elttype
, cp_type_quals (elttype
) | TYPE_QUAL_CONST
);
7097 array
= build_array_of_n_type (elttype
, len
);
7098 array
= finish_compound_literal (array
, new_ctor
, complain
);
7099 /* Take the address explicitly rather than via decay_conversion
7100 to avoid the error about taking the address of a temporary. */
7101 array
= cp_build_addr_expr (array
, complain
);
7102 array
= cp_convert (build_pointer_type (elttype
), array
, complain
);
7103 if (array
== error_mark_node
)
7104 return error_mark_node
;
7106 /* Build up the initializer_list object. Note: fail gracefully
7107 if the object cannot be completed because, for example, no
7108 definition is provided (c++/80956). */
7109 totype
= complete_type_or_maybe_complain (totype
, NULL_TREE
, complain
);
7111 return error_mark_node
;
7112 field
= next_initializable_field (TYPE_FIELDS (totype
));
7113 CONSTRUCTOR_APPEND_ELT (vec
, field
, array
);
7114 field
= next_initializable_field (DECL_CHAIN (field
));
7115 CONSTRUCTOR_APPEND_ELT (vec
, field
, size_int (len
));
7116 new_ctor
= build_constructor (totype
, vec
);
7117 return get_target_expr_sfinae (new_ctor
, complain
);
7121 if (TREE_CODE (totype
) == COMPLEX_TYPE
)
7123 tree real
= CONSTRUCTOR_ELT (expr
, 0)->value
;
7124 tree imag
= CONSTRUCTOR_ELT (expr
, 1)->value
;
7125 real
= perform_implicit_conversion (TREE_TYPE (totype
),
7127 imag
= perform_implicit_conversion (TREE_TYPE (totype
),
7129 expr
= build2 (COMPLEX_EXPR
, totype
, real
, imag
);
7132 expr
= reshape_init (totype
, expr
, complain
);
7133 expr
= get_target_expr_sfinae (digest_init (totype
, expr
, complain
),
7135 if (expr
!= error_mark_node
)
7136 TARGET_EXPR_LIST_INIT_P (expr
) = true;
7143 expr
= convert_like_real (next_conversion (convs
), expr
, fn
, argnum
,
7144 convs
->kind
== ck_ref_bind
7145 ? issue_conversion_warnings
: false,
7146 c_cast_p
, complain
);
7147 if (expr
== error_mark_node
)
7148 return error_mark_node
;
7150 switch (convs
->kind
)
7153 expr
= decay_conversion (expr
, complain
);
7154 if (expr
== error_mark_node
)
7156 if (complain
& tf_error
)
7158 auto_diagnostic_group d
;
7159 maybe_print_user_conv_context (convs
);
7160 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7162 return error_mark_node
;
7165 if (! MAYBE_CLASS_TYPE_P (totype
))
7168 /* Don't introduce copies when passing arguments along to the inherited
7170 if (current_function_decl
7171 && flag_new_inheriting_ctors
7172 && DECL_INHERITED_CTOR (current_function_decl
))
7175 if (TREE_CODE (expr
) == TARGET_EXPR
7176 && TARGET_EXPR_LIST_INIT_P (expr
))
7177 /* Copy-list-initialization doesn't actually involve a copy. */
7182 if (convs
->kind
== ck_base
&& !convs
->need_temporary_p
)
7184 /* We are going to bind a reference directly to a base-class
7185 subobject of EXPR. */
7186 /* Build an expression for `*((base*) &expr)'. */
7187 expr
= convert_to_base (expr
, totype
,
7188 !c_cast_p
, /*nonnull=*/true, complain
);
7192 /* Copy-initialization where the cv-unqualified version of the source
7193 type is the same class as, or a derived class of, the class of the
7194 destination [is treated as direct-initialization]. [dcl.init] */
7195 flags
= LOOKUP_NORMAL
;
7196 if (convs
->user_conv_p
)
7197 /* This conversion is being done in the context of a user-defined
7198 conversion (i.e. the second step of copy-initialization), so
7199 don't allow any more. */
7200 flags
|= LOOKUP_NO_CONVERSION
;
7202 flags
|= LOOKUP_ONLYCONVERTING
;
7203 if (convs
->rvaluedness_matches_p
)
7204 /* standard_conversion got LOOKUP_PREFER_RVALUE. */
7205 flags
|= LOOKUP_PREFER_RVALUE
;
7206 expr
= build_temp (expr
, totype
, flags
, &diag_kind
, complain
);
7207 if (diag_kind
&& complain
)
7209 auto_diagnostic_group d
;
7210 maybe_print_user_conv_context (convs
);
7211 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7214 return build_cplus_new (totype
, expr
, complain
);
7218 tree ref_type
= totype
;
7220 if (convs
->bad_p
&& !next_conversion (convs
)->bad_p
)
7222 tree extype
= TREE_TYPE (expr
);
7223 auto_diagnostic_group d
;
7224 if (TYPE_REF_IS_RVALUE (ref_type
)
7226 error_at (loc
, "cannot bind rvalue reference of type %qH to "
7227 "lvalue of type %qI", totype
, extype
);
7228 else if (!TYPE_REF_IS_RVALUE (ref_type
) && !lvalue_p (expr
)
7229 && !CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (ref_type
)))
7230 error_at (loc
, "cannot bind non-const lvalue reference of "
7231 "type %qH to an rvalue of type %qI", totype
, extype
);
7232 else if (!reference_compatible_p (TREE_TYPE (totype
), extype
))
7233 error_at (loc
, "binding reference of type %qH to %qI "
7234 "discards qualifiers", totype
, extype
);
7237 maybe_print_user_conv_context (convs
);
7238 maybe_inform_about_fndecl_for_bogus_argument_init (fn
, argnum
);
7240 return error_mark_node
;
7243 /* If necessary, create a temporary.
7245 VA_ARG_EXPR and CONSTRUCTOR expressions are special cases
7246 that need temporaries, even when their types are reference
7247 compatible with the type of reference being bound, so the
7248 upcoming call to cp_build_addr_expr doesn't fail. */
7249 if (convs
->need_temporary_p
7250 || TREE_CODE (expr
) == CONSTRUCTOR
7251 || TREE_CODE (expr
) == VA_ARG_EXPR
)
7253 /* Otherwise, a temporary of type "cv1 T1" is created and
7254 initialized from the initializer expression using the rules
7255 for a non-reference copy-initialization (8.5). */
7257 tree type
= TREE_TYPE (ref_type
);
7258 cp_lvalue_kind lvalue
= lvalue_kind (expr
);
7260 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7261 (type
, next_conversion (convs
)->type
));
7262 if (!CP_TYPE_CONST_NON_VOLATILE_P (type
)
7263 && !TYPE_REF_IS_RVALUE (ref_type
))
7265 /* If the reference is volatile or non-const, we
7266 cannot create a temporary. */
7267 if (lvalue
& clk_bitfield
)
7268 error_at (loc
, "cannot bind bitfield %qE to %qT",
7270 else if (lvalue
& clk_packed
)
7271 error_at (loc
, "cannot bind packed field %qE to %qT",
7274 error_at (loc
, "cannot bind rvalue %qE to %qT",
7276 return error_mark_node
;
7278 /* If the source is a packed field, and we must use a copy
7279 constructor, then building the target expr will require
7280 binding the field to the reference parameter to the
7281 copy constructor, and we'll end up with an infinite
7282 loop. If we can use a bitwise copy, then we'll be
7284 if ((lvalue
& clk_packed
)
7285 && CLASS_TYPE_P (type
)
7286 && type_has_nontrivial_copy_init (type
))
7288 error_at (loc
, "cannot bind packed field %qE to %qT",
7290 return error_mark_node
;
7292 if (lvalue
& clk_bitfield
)
7294 expr
= convert_bitfield_to_declared_type (expr
);
7295 expr
= fold_convert (type
, expr
);
7297 expr
= build_target_expr_with_type (expr
, type
, complain
);
7300 /* Take the address of the thing to which we will bind the
7302 expr
= cp_build_addr_expr (expr
, complain
);
7303 if (expr
== error_mark_node
)
7304 return error_mark_node
;
7306 /* Convert it to a pointer to the type referred to by the
7307 reference. This will adjust the pointer if a derived to
7308 base conversion is being performed. */
7309 expr
= cp_convert (build_pointer_type (TREE_TYPE (ref_type
)),
7311 /* Convert the pointer to the desired reference type. */
7312 return build_nop (ref_type
, expr
);
7316 return decay_conversion (expr
, complain
);
7319 /* ??? Should the address of a transaction-safe pointer point to the TM
7320 clone, and this conversion look up the primary function? */
7321 return build_nop (totype
, expr
);
7324 /* Warn about deprecated conversion if appropriate. */
7325 string_conv_p (totype
, expr
, 1);
7330 expr
= convert_to_base (expr
, totype
, !c_cast_p
,
7331 /*nonnull=*/false, complain
);
7332 return build_nop (totype
, expr
);
7335 return convert_ptrmem (totype
, expr
, /*allow_inverse_p=*/false,
7336 c_cast_p
, complain
);
7342 if (convs
->check_narrowing
7343 && !check_narrowing (totype
, expr
, complain
,
7344 convs
->check_narrowing_const_only
))
7345 return error_mark_node
;
7347 warning_sentinel
w (warn_zero_as_null_pointer_constant
);
7348 if (issue_conversion_warnings
)
7349 expr
= cp_convert_and_check (totype
, expr
, complain
);
7351 expr
= cp_convert (totype
, expr
, complain
);
7356 /* ARG is being passed to a varargs function. Perform any conversions
7357 required. Return the converted value. */
7360 convert_arg_to_ellipsis (tree arg
, tsubst_flags_t complain
)
7363 location_t loc
= cp_expr_loc_or_loc (arg
, input_location
);
7367 The lvalue-to-rvalue, array-to-pointer, and function-to-pointer
7368 standard conversions are performed. */
7369 arg
= decay_conversion (arg
, complain
);
7370 arg_type
= TREE_TYPE (arg
);
7373 If the argument has integral or enumeration type that is subject
7374 to the integral promotions (_conv.prom_), or a floating point
7375 type that is subject to the floating point promotion
7376 (_conv.fpprom_), the value of the argument is converted to the
7377 promoted type before the call. */
7378 if (TREE_CODE (arg_type
) == REAL_TYPE
7379 && (TYPE_PRECISION (arg_type
)
7380 < TYPE_PRECISION (double_type_node
))
7381 && !DECIMAL_FLOAT_MODE_P (TYPE_MODE (arg_type
)))
7383 if ((complain
& tf_warning
)
7384 && warn_double_promotion
&& !c_inhibit_evaluation_warnings
)
7385 warning_at (loc
, OPT_Wdouble_promotion
,
7386 "implicit conversion from %qH to %qI when passing "
7387 "argument to function",
7388 arg_type
, double_type_node
);
7389 arg
= convert_to_real_nofold (double_type_node
, arg
);
7391 else if (NULLPTR_TYPE_P (arg_type
))
7392 arg
= null_pointer_node
;
7393 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (arg_type
))
7395 if (SCOPED_ENUM_P (arg_type
))
7397 tree prom
= cp_convert (ENUM_UNDERLYING_TYPE (arg_type
), arg
,
7399 prom
= cp_perform_integral_promotions (prom
, complain
);
7400 if (abi_version_crosses (6)
7401 && TYPE_MODE (TREE_TYPE (prom
)) != TYPE_MODE (arg_type
)
7402 && (complain
& tf_warning
))
7403 warning_at (loc
, OPT_Wabi
, "scoped enum %qT passed through ... as "
7404 "%qT before -fabi-version=6, %qT after", arg_type
,
7405 TREE_TYPE (prom
), ENUM_UNDERLYING_TYPE (arg_type
));
7406 if (!abi_version_at_least (6))
7410 arg
= cp_perform_integral_promotions (arg
, complain
);
7413 arg
= require_complete_type_sfinae (arg
, complain
);
7414 arg_type
= TREE_TYPE (arg
);
7416 if (arg
!= error_mark_node
7417 /* In a template (or ill-formed code), we can have an incomplete type
7418 even after require_complete_type_sfinae, in which case we don't know
7419 whether it has trivial copy or not. */
7420 && COMPLETE_TYPE_P (arg_type
)
7421 && !cp_unevaluated_operand
)
7423 /* [expr.call] 5.2.2/7:
7424 Passing a potentially-evaluated argument of class type (Clause 9)
7425 with a non-trivial copy constructor or a non-trivial destructor
7426 with no corresponding parameter is conditionally-supported, with
7427 implementation-defined semantics.
7429 We support it as pass-by-invisible-reference, just like a normal
7432 If the call appears in the context of a sizeof expression,
7433 it is not potentially-evaluated. */
7434 if (type_has_nontrivial_copy_init (arg_type
)
7435 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (arg_type
))
7437 arg
= force_rvalue (arg
, complain
);
7438 if (complain
& tf_warning
)
7439 warning (OPT_Wconditionally_supported
,
7440 "passing objects of non-trivially-copyable "
7441 "type %q#T through %<...%> is conditionally supported",
7443 return build1 (ADDR_EXPR
, build_reference_type (arg_type
), arg
);
7445 /* Build up a real lvalue-to-rvalue conversion in case the
7446 copy constructor is trivial but not callable. */
7447 else if (CLASS_TYPE_P (arg_type
))
7448 force_rvalue (arg
, complain
);
7455 /* va_arg (EXPR, TYPE) is a builtin. Make sure it is not abused. */
7458 build_x_va_arg (location_t loc
, tree expr
, tree type
)
7460 if (processing_template_decl
)
7462 tree r
= build_min (VA_ARG_EXPR
, type
, expr
);
7463 SET_EXPR_LOCATION (r
, loc
);
7467 type
= complete_type_or_else (type
, NULL_TREE
);
7469 if (expr
== error_mark_node
|| !type
)
7470 return error_mark_node
;
7472 expr
= mark_lvalue_use (expr
);
7474 if (TYPE_REF_P (type
))
7476 error ("cannot receive reference type %qT through %<...%>", type
);
7477 return error_mark_node
;
7480 if (type_has_nontrivial_copy_init (type
)
7481 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7483 /* conditionally-supported behavior [expr.call] 5.2.2/7. Let's treat
7484 it as pass by invisible reference. */
7485 warning_at (loc
, OPT_Wconditionally_supported
,
7486 "receiving objects of non-trivially-copyable type %q#T "
7487 "through %<...%> is conditionally-supported", type
);
7489 tree ref
= cp_build_reference_type (type
, false);
7490 expr
= build_va_arg (loc
, expr
, ref
);
7491 return convert_from_reference (expr
);
7494 tree ret
= build_va_arg (loc
, expr
, type
);
7495 if (CLASS_TYPE_P (type
))
7496 /* Wrap the VA_ARG_EXPR in a TARGET_EXPR now so other code doesn't need to
7497 know how to handle it. */
7498 ret
= get_target_expr (ret
);
7502 /* TYPE has been given to va_arg. Apply the default conversions which
7503 would have happened when passed via ellipsis. Return the promoted
7504 type, or the passed type if there is no change. */
7507 cxx_type_promotes_to (tree type
)
7511 /* Perform the array-to-pointer and function-to-pointer
7513 type
= type_decays_to (type
);
7515 promote
= type_promotes_to (type
);
7516 if (same_type_p (type
, promote
))
7522 /* ARG is a default argument expression being passed to a parameter of
7523 the indicated TYPE, which is a parameter to FN. PARMNUM is the
7524 zero-based argument number. Do any required conversions. Return
7525 the converted value. */
7527 static GTY(()) vec
<tree
, va_gc
> *default_arg_context
;
7529 push_defarg_context (tree fn
)
7530 { vec_safe_push (default_arg_context
, fn
); }
7533 pop_defarg_context (void)
7534 { default_arg_context
->pop (); }
7537 convert_default_arg (tree type
, tree arg
, tree fn
, int parmnum
,
7538 tsubst_flags_t complain
)
7543 /* See through clones. */
7544 fn
= DECL_ORIGIN (fn
);
7545 /* And inheriting ctors. */
7546 if (flag_new_inheriting_ctors
)
7547 fn
= strip_inheriting_ctors (fn
);
7549 /* Detect recursion. */
7550 FOR_EACH_VEC_SAFE_ELT (default_arg_context
, i
, t
)
7553 if (complain
& tf_error
)
7554 error ("recursive evaluation of default argument for %q#D", fn
);
7555 return error_mark_node
;
7558 /* If the ARG is an unparsed default argument expression, the
7559 conversion cannot be performed. */
7560 if (TREE_CODE (arg
) == DEFAULT_ARG
)
7562 if (complain
& tf_error
)
7563 error ("call to %qD uses the default argument for parameter %P, which "
7564 "is not yet defined", fn
, parmnum
);
7565 return error_mark_node
;
7568 push_defarg_context (fn
);
7570 if (fn
&& DECL_TEMPLATE_INFO (fn
))
7571 arg
= tsubst_default_argument (fn
, parmnum
, type
, arg
, complain
);
7577 The names in the expression are bound, and the semantic
7578 constraints are checked, at the point where the default
7579 expressions appears.
7581 we must not perform access checks here. */
7582 push_deferring_access_checks (dk_no_check
);
7583 /* We must make a copy of ARG, in case subsequent processing
7584 alters any part of it. */
7585 arg
= break_out_target_exprs (arg
, /*clear location*/true);
7587 arg
= convert_for_initialization (0, type
, arg
, LOOKUP_IMPLICIT
,
7588 ICR_DEFAULT_ARGUMENT
, fn
, parmnum
,
7590 arg
= convert_for_arg_passing (type
, arg
, complain
);
7591 pop_deferring_access_checks();
7593 pop_defarg_context ();
7598 /* Returns the type which will really be used for passing an argument of
7602 type_passed_as (tree type
)
7604 /* Pass classes with copy ctors by invisible reference. */
7605 if (TREE_ADDRESSABLE (type
))
7607 type
= build_reference_type (type
);
7608 /* There are no other pointers to this temporary. */
7609 type
= cp_build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
7611 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7612 && INTEGRAL_TYPE_P (type
)
7613 && COMPLETE_TYPE_P (type
)
7614 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7615 type
= integer_type_node
;
7620 /* Actually perform the appropriate conversion. */
7623 convert_for_arg_passing (tree type
, tree val
, tsubst_flags_t complain
)
7627 /* If VAL is a bitfield, then -- since it has already been converted
7628 to TYPE -- it cannot have a precision greater than TYPE.
7630 If it has a smaller precision, we must widen it here. For
7631 example, passing "int f:3;" to a function expecting an "int" will
7632 not result in any conversion before this point.
7634 If the precision is the same we must not risk widening. For
7635 example, the COMPONENT_REF for a 32-bit "long long" bitfield will
7636 often have type "int", even though the C++ type for the field is
7637 "long long". If the value is being passed to a function
7638 expecting an "int", then no conversions will be required. But,
7639 if we call convert_bitfield_to_declared_type, the bitfield will
7640 be converted to "long long". */
7641 bitfield_type
= is_bitfield_expr_with_lowered_type (val
);
7643 && TYPE_PRECISION (TREE_TYPE (val
)) < TYPE_PRECISION (type
))
7644 val
= convert_to_integer_nofold (TYPE_MAIN_VARIANT (bitfield_type
), val
);
7646 if (val
== error_mark_node
)
7648 /* Pass classes with copy ctors by invisible reference. */
7649 else if (TREE_ADDRESSABLE (type
))
7650 val
= build1 (ADDR_EXPR
, build_reference_type (type
), val
);
7651 else if (targetm
.calls
.promote_prototypes (NULL_TREE
)
7652 && INTEGRAL_TYPE_P (type
)
7653 && COMPLETE_TYPE_P (type
)
7654 && tree_int_cst_lt (TYPE_SIZE (type
), TYPE_SIZE (integer_type_node
)))
7655 val
= cp_perform_integral_promotions (val
, complain
);
7656 if (complain
& tf_warning
)
7658 if (warn_suggest_attribute_format
)
7660 tree rhstype
= TREE_TYPE (val
);
7661 const enum tree_code coder
= TREE_CODE (rhstype
);
7662 const enum tree_code codel
= TREE_CODE (type
);
7663 if ((codel
== POINTER_TYPE
|| codel
== REFERENCE_TYPE
)
7665 && check_missing_format_attribute (type
, rhstype
))
7666 warning (OPT_Wsuggest_attribute_format
,
7667 "argument of function call might be a candidate "
7668 "for a format attribute");
7670 maybe_warn_parm_abi (type
, cp_expr_loc_or_loc (val
, input_location
));
7673 if (complain
& tf_warning
)
7674 warn_for_address_or_pointer_of_packed_member (type
, val
);
7679 /* Returns non-zero iff FN is a function with magic varargs, i.e. ones for
7680 which just decay_conversion or no conversions at all should be done.
7681 This is true for some builtins which don't act like normal functions.
7682 Return 2 if no conversions at all should be done, 1 if just
7683 decay_conversion. Return 3 for special treatment of the 3rd argument
7684 for __builtin_*_overflow_p. */
7687 magic_varargs_p (tree fn
)
7689 if (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
7690 switch (DECL_FUNCTION_CODE (fn
))
7692 case BUILT_IN_CLASSIFY_TYPE
:
7693 case BUILT_IN_CONSTANT_P
:
7694 case BUILT_IN_NEXT_ARG
:
7695 case BUILT_IN_VA_START
:
7698 case BUILT_IN_ADD_OVERFLOW_P
:
7699 case BUILT_IN_SUB_OVERFLOW_P
:
7700 case BUILT_IN_MUL_OVERFLOW_P
:
7704 return lookup_attribute ("type generic",
7705 TYPE_ATTRIBUTES (TREE_TYPE (fn
))) != 0;
7711 /* Returns the decl of the dispatcher function if FN is a function version. */
7714 get_function_version_dispatcher (tree fn
)
7716 tree dispatcher_decl
= NULL
;
7718 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
7719 && DECL_FUNCTION_VERSIONED (fn
));
7721 gcc_assert (targetm
.get_function_versions_dispatcher
);
7722 dispatcher_decl
= targetm
.get_function_versions_dispatcher (fn
);
7724 if (dispatcher_decl
== NULL
)
7726 error_at (input_location
, "use of multiversioned function "
7727 "without a default");
7731 retrofit_lang_decl (dispatcher_decl
);
7732 gcc_assert (dispatcher_decl
!= NULL
);
7733 return dispatcher_decl
;
7736 /* fn is a function version dispatcher that is marked used. Mark all the
7737 semantically identical function versions it will dispatch as used. */
7740 mark_versions_used (tree fn
)
7742 struct cgraph_node
*node
;
7743 struct cgraph_function_version_info
*node_v
;
7744 struct cgraph_function_version_info
*it_v
;
7746 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
);
7748 node
= cgraph_node::get (fn
);
7752 gcc_assert (node
->dispatcher_function
);
7754 node_v
= node
->function_version ();
7758 /* All semantically identical versions are chained. Traverse and mark each
7759 one of them as used. */
7760 it_v
= node_v
->next
;
7761 while (it_v
!= NULL
)
7763 mark_used (it_v
->this_node
->decl
);
7768 /* Build a call to "the copy constructor" for the type of A, even if it
7769 wouldn't be selected by normal overload resolution. Used for
7773 call_copy_ctor (tree a
, tsubst_flags_t complain
)
7775 tree ctype
= TYPE_MAIN_VARIANT (TREE_TYPE (a
));
7776 tree binfo
= TYPE_BINFO (ctype
);
7777 tree copy
= get_copy_ctor (ctype
, complain
);
7778 copy
= build_baselink (binfo
, binfo
, copy
, NULL_TREE
);
7779 tree ob
= build_dummy_object (ctype
);
7780 vec
<tree
, va_gc
>* args
= make_tree_vector_single (a
);
7781 tree r
= build_new_method_call (ob
, copy
, &args
, NULL_TREE
,
7782 LOOKUP_NORMAL
, NULL
, complain
);
7783 release_tree_vector (args
);
7787 /* Return true iff T refers to a base field. */
7790 is_base_field_ref (tree t
)
7793 if (TREE_CODE (t
) == ADDR_EXPR
)
7794 t
= TREE_OPERAND (t
, 0);
7795 if (TREE_CODE (t
) == COMPONENT_REF
)
7796 t
= TREE_OPERAND (t
, 1);
7797 if (TREE_CODE (t
) == FIELD_DECL
)
7798 return DECL_FIELD_IS_BASE (t
);
7802 /* We can't elide a copy from a function returning by value to a base
7803 subobject, as the callee might clobber tail padding. Return true iff this
7804 could be that case. */
7807 unsafe_copy_elision_p (tree target
, tree exp
)
7809 /* Copy elision only happens with a TARGET_EXPR. */
7810 if (TREE_CODE (exp
) != TARGET_EXPR
)
7812 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
7813 /* It's safe to elide the copy for a class with no tail padding. */
7814 if (tree_int_cst_equal (TYPE_SIZE (type
), CLASSTYPE_SIZE (type
)))
7816 /* It's safe to elide the copy if we aren't initializing a base object. */
7817 if (!is_base_field_ref (target
))
7819 tree init
= TARGET_EXPR_INITIAL (exp
);
7820 /* build_compound_expr pushes COMPOUND_EXPR inside TARGET_EXPR. */
7821 while (TREE_CODE (init
) == COMPOUND_EXPR
)
7822 init
= TREE_OPERAND (init
, 1);
7823 if (TREE_CODE (init
) == COND_EXPR
)
7825 /* We'll end up copying from each of the arms of the COND_EXPR directly
7826 into the target, so look at them. */
7827 if (tree op
= TREE_OPERAND (init
, 1))
7828 if (unsafe_copy_elision_p (target
, op
))
7830 return unsafe_copy_elision_p (target
, TREE_OPERAND (init
, 2));
7832 return (TREE_CODE (init
) == AGGR_INIT_EXPR
7833 && !AGGR_INIT_VIA_CTOR_P (init
));
7836 /* True iff C is a conversion that binds a reference to a prvalue. */
7839 conv_binds_ref_to_prvalue (conversion
*c
)
7841 if (c
->kind
!= ck_ref_bind
)
7843 if (c
->need_temporary_p
)
7846 c
= next_conversion (c
);
7848 if (c
->kind
== ck_rvalue
)
7850 if (c
->kind
== ck_user
&& !TYPE_REF_P (c
->type
))
7852 if (c
->kind
== ck_identity
&& c
->u
.expr
7853 && TREE_CODE (c
->u
.expr
) == TARGET_EXPR
)
7859 /* Call the trivial destructor for INSTANCE, which can be either an lvalue of
7860 class type or a pointer to class type. */
7863 build_trivial_dtor_call (tree instance
)
7865 gcc_assert (!is_dummy_object (instance
));
7867 if (!flag_lifetime_dse
)
7870 return fold_convert (void_type_node
, instance
);
7873 if (INDIRECT_TYPE_P (TREE_TYPE (instance
)))
7875 if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (instance
))))
7877 instance
= cp_build_fold_indirect_ref (instance
);
7880 /* A trivial destructor should still clobber the object. */
7881 tree clobber
= build_clobber (TREE_TYPE (instance
));
7882 return build2 (MODIFY_EXPR
, void_type_node
,
7886 /* Subroutine of the various build_*_call functions. Overload resolution
7887 has chosen a winning candidate CAND; build up a CALL_EXPR accordingly.
7888 ARGS is a TREE_LIST of the unconverted arguments to the call. FLAGS is a
7889 bitmask of various LOOKUP_* flags which apply to the call itself. */
7892 build_over_call (struct z_candidate
*cand
, int flags
, tsubst_flags_t complain
)
7895 const vec
<tree
, va_gc
> *args
= cand
->args
;
7896 tree first_arg
= cand
->first_arg
;
7897 conversion
**convs
= cand
->convs
;
7899 tree parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
7904 unsigned int arg_index
= 0;
7908 bool already_used
= false;
7910 /* In a template, there is no need to perform all of the work that
7911 is normally done. We are only interested in the type of the call
7912 expression, i.e., the return type of the function. Any semantic
7913 errors will be deferred until the template is instantiated. */
7914 if (processing_template_decl
)
7918 const tree
*argarray
;
7921 if (undeduced_auto_decl (fn
))
7922 mark_used (fn
, complain
);
7924 /* Otherwise set TREE_USED for the benefit of -Wunused-function.
7928 return_type
= TREE_TYPE (TREE_TYPE (fn
));
7929 nargs
= vec_safe_length (args
);
7930 if (first_arg
== NULL_TREE
)
7931 argarray
= args
->address ();
7939 alcarray
= XALLOCAVEC (tree
, nargs
);
7940 alcarray
[0] = build_this (first_arg
);
7941 FOR_EACH_VEC_SAFE_ELT (args
, ix
, arg
)
7942 alcarray
[ix
+ 1] = arg
;
7943 argarray
= alcarray
;
7946 addr
= build_addr_func (fn
, complain
);
7947 if (addr
== error_mark_node
)
7948 return error_mark_node
;
7949 expr
= build_call_array_loc (input_location
, return_type
,
7950 addr
, nargs
, argarray
);
7951 if (TREE_THIS_VOLATILE (fn
) && cfun
)
7952 current_function_returns_abnormally
= 1;
7953 return convert_from_reference (expr
);
7956 /* Give any warnings we noticed during overload resolution. */
7957 if (cand
->warnings
&& (complain
& tf_warning
))
7959 struct candidate_warning
*w
;
7960 for (w
= cand
->warnings
; w
; w
= w
->next
)
7961 joust (cand
, w
->loser
, 1, complain
);
7964 /* Core issue 2327: P0135 doesn't say how to handle the case where the
7965 argument to the copy constructor ends up being a prvalue after
7966 conversion. Let's do the normal processing, but pretend we aren't
7967 actually using the copy constructor. */
7968 bool force_elide
= false;
7969 if (cxx_dialect
>= cxx17
7970 && cand
->num_convs
== 1
7971 && DECL_COMPLETE_CONSTRUCTOR_P (fn
)
7972 && (DECL_COPY_CONSTRUCTOR_P (fn
)
7973 || DECL_MOVE_CONSTRUCTOR_P (fn
))
7974 && conv_binds_ref_to_prvalue (convs
[0]))
7977 goto not_really_used
;
7980 /* OK, we're actually calling this inherited constructor; set its deletedness
7981 appropriately. We can get away with doing this here because calling is
7982 the only way to refer to a constructor. */
7983 if (DECL_INHERITED_CTOR (fn
))
7984 deduce_inheriting_ctor (fn
);
7986 /* Make =delete work with SFINAE. */
7987 if (DECL_DELETED_FN (fn
))
7989 if (complain
& tf_error
)
7991 return error_mark_node
;
7994 if (DECL_FUNCTION_MEMBER_P (fn
))
7997 /* If FN is a template function, two cases must be considered.
8002 template <class T> void f();
8004 template <class T> struct B {
8008 struct C : A, B<int> {
8010 using B<int>::g; // #2
8013 In case #1 where `A::f' is a member template, DECL_ACCESS is
8014 recorded in the primary template but not in its specialization.
8015 We check access of FN using its primary template.
8017 In case #2, where `B<int>::g' has a DECL_TEMPLATE_INFO simply
8018 because it is a member of class template B, DECL_ACCESS is
8019 recorded in the specialization `B<int>::g'. We cannot use its
8020 primary template because `B<T>::g' and `B<int>::g' may have
8021 different access. */
8022 if (DECL_TEMPLATE_INFO (fn
)
8023 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (fn
)))
8024 access_fn
= DECL_TI_TEMPLATE (fn
);
8027 if (!perform_or_defer_access_check (cand
->access_path
, access_fn
,
8029 return error_mark_node
;
8032 /* If we're checking for implicit delete, don't bother with argument
8034 if (flags
& LOOKUP_SPECULATIVE
)
8036 if (cand
->viable
== 1)
8038 else if (!(complain
& tf_error
))
8039 /* Reject bad conversions now. */
8040 return error_mark_node
;
8041 /* else continue to get conversion error. */
8046 /* N3276 magic doesn't apply to nested calls. */
8047 tsubst_flags_t decltype_flag
= (complain
& tf_decltype
);
8048 complain
&= ~tf_decltype
;
8049 /* No-Cleanup doesn't apply to nested calls either. */
8050 tsubst_flags_t no_cleanup_complain
= complain
;
8051 complain
&= ~tf_no_cleanup
;
8053 /* Find maximum size of vector to hold converted arguments. */
8054 parmlen
= list_length (parm
);
8055 nargs
= vec_safe_length (args
) + (first_arg
!= NULL_TREE
? 1 : 0);
8056 if (parmlen
> nargs
)
8058 argarray
= XALLOCAVEC (tree
, nargs
);
8060 /* The implicit parameters to a constructor are not considered by overload
8061 resolution, and must be of the proper type. */
8062 if (DECL_CONSTRUCTOR_P (fn
))
8065 if (first_arg
!= NULL_TREE
)
8067 object_arg
= first_arg
;
8068 first_arg
= NULL_TREE
;
8072 object_arg
= (*args
)[arg_index
];
8075 argarray
[j
++] = build_this (object_arg
);
8076 parm
= TREE_CHAIN (parm
);
8077 /* We should never try to call the abstract constructor. */
8078 gcc_assert (!DECL_HAS_IN_CHARGE_PARM_P (fn
));
8080 if (DECL_HAS_VTT_PARM_P (fn
))
8082 argarray
[j
++] = (*args
)[arg_index
];
8084 parm
= TREE_CHAIN (parm
);
8087 if (flags
& LOOKUP_PREFER_RVALUE
)
8089 /* The implicit move specified in 15.8.3/3 fails "...if the type of
8090 the first parameter of the selected constructor is not an rvalue
8091 reference to the object's type (possibly cv-qualified)...." */
8092 gcc_assert (!(complain
& tf_error
));
8093 tree ptype
= convs
[0]->type
;
8094 if (!TYPE_REF_P (ptype
)
8095 || !TYPE_REF_IS_RVALUE (ptype
)
8096 || CONVERSION_RANK (convs
[0]) > cr_exact
)
8097 return error_mark_node
;
8100 /* Bypass access control for 'this' parameter. */
8101 else if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
)
8103 tree parmtype
= TREE_VALUE (parm
);
8104 tree arg
= build_this (first_arg
!= NULL_TREE
8106 : (*args
)[arg_index
]);
8107 tree argtype
= TREE_TYPE (arg
);
8111 if (arg
== error_mark_node
)
8112 return error_mark_node
;
8114 if (convs
[i
]->bad_p
)
8116 if (complain
& tf_error
)
8118 auto_diagnostic_group d
;
8119 if (permerror (input_location
, "passing %qT as %<this%> "
8120 "argument discards qualifiers",
8121 TREE_TYPE (argtype
)))
8122 inform (DECL_SOURCE_LOCATION (fn
), " in call to %qD", fn
);
8125 return error_mark_node
;
8128 /* See if the function member or the whole class type is declared
8129 final and the call can be devirtualized. */
8130 if (DECL_FINAL_P (fn
)
8131 || CLASSTYPE_FINAL (TYPE_METHOD_BASETYPE (TREE_TYPE (fn
))))
8132 flags
|= LOOKUP_NONVIRTUAL
;
8134 /* [class.mfct.nonstatic]: If a nonstatic member function of a class
8135 X is called for an object that is not of type X, or of a type
8136 derived from X, the behavior is undefined.
8138 So we can assume that anything passed as 'this' is non-null, and
8139 optimize accordingly. */
8140 gcc_assert (TYPE_PTR_P (parmtype
));
8141 /* Convert to the base in which the function was declared. */
8142 gcc_assert (cand
->conversion_path
!= NULL_TREE
);
8143 converted_arg
= build_base_path (PLUS_EXPR
,
8145 cand
->conversion_path
,
8147 /* Check that the base class is accessible. */
8148 if (!accessible_base_p (TREE_TYPE (argtype
),
8149 BINFO_TYPE (cand
->conversion_path
), true))
8151 if (complain
& tf_error
)
8152 error ("%qT is not an accessible base of %qT",
8153 BINFO_TYPE (cand
->conversion_path
),
8154 TREE_TYPE (argtype
));
8156 return error_mark_node
;
8158 /* If fn was found by a using declaration, the conversion path
8159 will be to the derived class, not the base declaring fn. We
8160 must convert from derived to base. */
8161 base_binfo
= lookup_base (TREE_TYPE (TREE_TYPE (converted_arg
)),
8162 TREE_TYPE (parmtype
), ba_unique
,
8164 converted_arg
= build_base_path (PLUS_EXPR
, converted_arg
,
8165 base_binfo
, 1, complain
);
8167 argarray
[j
++] = converted_arg
;
8168 parm
= TREE_CHAIN (parm
);
8169 if (first_arg
!= NULL_TREE
)
8170 first_arg
= NULL_TREE
;
8177 gcc_assert (first_arg
== NULL_TREE
);
8178 for (; arg_index
< vec_safe_length (args
) && parm
;
8179 parm
= TREE_CHAIN (parm
), ++arg_index
, ++i
)
8181 tree type
= TREE_VALUE (parm
);
8182 tree arg
= (*args
)[arg_index
];
8183 bool conversion_warning
= true;
8187 /* If the argument is NULL and used to (implicitly) instantiate a
8188 template function (and bind one of the template arguments to
8189 the type of 'long int'), we don't want to warn about passing NULL
8190 to non-pointer argument.
8191 For example, if we have this template function:
8193 template<typename T> void func(T x) {}
8195 we want to warn (when -Wconversion is enabled) in this case:
8201 but not in this case:
8207 if (null_node_p (arg
)
8208 && DECL_TEMPLATE_INFO (fn
)
8209 && cand
->template_decl
8210 && !(flags
& LOOKUP_EXPLICIT_TMPL_ARGS
))
8211 conversion_warning
= false;
8213 /* Warn about initializer_list deduction that isn't currently in the
8215 if (cxx_dialect
> cxx98
8216 && flag_deduce_init_list
8217 && cand
->template_decl
8218 && is_std_init_list (non_reference (type
))
8219 && BRACE_ENCLOSED_INITIALIZER_P (arg
))
8221 tree tmpl
= TI_TEMPLATE (cand
->template_decl
);
8222 tree realparm
= chain_index (j
, DECL_ARGUMENTS (cand
->fn
));
8223 tree patparm
= get_pattern_parm (realparm
, tmpl
);
8224 tree pattype
= TREE_TYPE (patparm
);
8225 if (PACK_EXPANSION_P (pattype
))
8226 pattype
= PACK_EXPANSION_PATTERN (pattype
);
8227 pattype
= non_reference (pattype
);
8229 if (TREE_CODE (pattype
) == TEMPLATE_TYPE_PARM
8230 && (cand
->explicit_targs
== NULL_TREE
8231 || (TREE_VEC_LENGTH (cand
->explicit_targs
)
8232 <= TEMPLATE_TYPE_IDX (pattype
))))
8234 pedwarn (input_location
, 0, "deducing %qT as %qT",
8235 non_reference (TREE_TYPE (patparm
)),
8236 non_reference (type
));
8237 pedwarn (DECL_SOURCE_LOCATION (cand
->fn
), 0,
8238 " in call to %qD", cand
->fn
);
8239 pedwarn (input_location
, 0,
8240 " (you can disable this with -fno-deduce-init-list)");
8244 /* Set user_conv_p on the argument conversions, so rvalue/base handling
8245 knows not to allow any more UDCs. This needs to happen after we
8246 process cand->warnings. */
8247 if (flags
& LOOKUP_NO_CONVERSION
)
8248 conv
->user_conv_p
= true;
8250 tsubst_flags_t arg_complain
= complain
;
8251 if (!conversion_warning
)
8252 arg_complain
&= ~tf_warning
;
8254 val
= convert_like_with_context (conv
, arg
, fn
, i
- is_method
,
8256 val
= convert_for_arg_passing (type
, val
, arg_complain
);
8258 if (val
== error_mark_node
)
8259 return error_mark_node
;
8261 argarray
[j
++] = val
;
8264 /* Default arguments */
8265 for (; parm
&& parm
!= void_list_node
; parm
= TREE_CHAIN (parm
), i
++)
8267 if (TREE_VALUE (parm
) == error_mark_node
)
8268 return error_mark_node
;
8269 val
= convert_default_arg (TREE_VALUE (parm
),
8270 TREE_PURPOSE (parm
),
8273 if (val
== error_mark_node
)
8274 return error_mark_node
;
8275 argarray
[j
++] = val
;
8279 int magic
= magic_varargs_p (fn
);
8280 for (; arg_index
< vec_safe_length (args
); ++arg_index
)
8282 tree a
= (*args
)[arg_index
];
8283 if ((magic
== 3 && arg_index
== 2) || magic
== 2)
8285 /* Do no conversions for certain magic varargs. */
8286 a
= mark_type_use (a
);
8287 if (TREE_CODE (a
) == FUNCTION_DECL
&& reject_gcc_builtin (a
))
8288 return error_mark_node
;
8290 else if (magic
!= 0)
8291 /* For other magic varargs only do decay_conversion. */
8292 a
= decay_conversion (a
, complain
);
8293 else if (DECL_CONSTRUCTOR_P (fn
)
8294 && same_type_ignoring_top_level_qualifiers_p (DECL_CONTEXT (fn
),
8297 /* Avoid infinite recursion trying to call A(...). */
8298 if (complain
& tf_error
)
8299 /* Try to call the actual copy constructor for a good error. */
8300 call_copy_ctor (a
, complain
);
8301 return error_mark_node
;
8304 a
= convert_arg_to_ellipsis (a
, complain
);
8305 if (a
== error_mark_node
)
8306 return error_mark_node
;
8310 gcc_assert (j
<= nargs
);
8313 /* Avoid to do argument-transformation, if warnings for format, and for
8314 nonnull are disabled. Just in case that at least one of them is active
8315 the check_function_arguments function might warn about something. */
8317 bool warned_p
= false;
8320 || warn_suggest_attribute_format
8323 tree
*fargs
= (!nargs
? argarray
8324 : (tree
*) alloca (nargs
* sizeof (tree
)));
8325 for (j
= 0; j
< nargs
; j
++)
8327 /* For -Wformat undo the implicit passing by hidden reference
8328 done by convert_arg_to_ellipsis. */
8329 if (TREE_CODE (argarray
[j
]) == ADDR_EXPR
8330 && TYPE_REF_P (TREE_TYPE (argarray
[j
])))
8331 fargs
[j
] = TREE_OPERAND (argarray
[j
], 0);
8333 fargs
[j
] = argarray
[j
];
8336 warned_p
= check_function_arguments (input_location
, fn
, TREE_TYPE (fn
),
8337 nargs
, fargs
, NULL
);
8340 if (DECL_INHERITED_CTOR (fn
))
8342 /* Check for passing ellipsis arguments to an inherited constructor. We
8343 could handle this by open-coding the inherited constructor rather than
8344 defining it, but let's not bother now. */
8345 if (!cp_unevaluated_operand
8347 && cand
->convs
[cand
->num_convs
-1]->ellipsis_p
)
8349 if (complain
& tf_error
)
8351 sorry ("passing arguments to ellipsis of inherited constructor "
8353 inform (DECL_SOURCE_LOCATION (cand
->fn
), "declared here");
8355 return error_mark_node
;
8358 /* A base constructor inheriting from a virtual base doesn't get the
8359 inherited arguments, just this and __vtt. */
8360 if (ctor_omit_inherited_parms (fn
))
8364 /* Avoid actually calling copy constructors and copy assignment operators,
8367 if (! flag_elide_constructors
&& !force_elide
)
8368 /* Do things the hard way. */;
8369 else if (cand
->num_convs
== 1
8370 && (DECL_COPY_CONSTRUCTOR_P (fn
)
8371 || DECL_MOVE_CONSTRUCTOR_P (fn
))
8372 /* It's unsafe to elide the constructor when handling
8373 a noexcept-expression, it may evaluate to the wrong
8374 value (c++/53025). */
8375 && (force_elide
|| cp_noexcept_operand
== 0))
8378 tree arg
= argarray
[num_artificial_parms_for (fn
)];
8380 bool trivial
= trivial_fn_p (fn
);
8382 /* Pull out the real argument, disregarding const-correctness. */
8384 /* Strip the reference binding for the constructor parameter. */
8385 if (CONVERT_EXPR_P (targ
)
8386 && TYPE_REF_P (TREE_TYPE (targ
)))
8387 targ
= TREE_OPERAND (targ
, 0);
8388 /* But don't strip any other reference bindings; binding a temporary to a
8389 reference prevents copy elision. */
8390 while ((CONVERT_EXPR_P (targ
)
8391 && !TYPE_REF_P (TREE_TYPE (targ
)))
8392 || TREE_CODE (targ
) == NON_LVALUE_EXPR
)
8393 targ
= TREE_OPERAND (targ
, 0);
8394 if (TREE_CODE (targ
) == ADDR_EXPR
)
8396 targ
= TREE_OPERAND (targ
, 0);
8397 if (!same_type_ignoring_top_level_qualifiers_p
8398 (TREE_TYPE (TREE_TYPE (arg
)), TREE_TYPE (targ
)))
8407 arg
= cp_build_fold_indirect_ref (arg
);
8409 /* In C++17 we shouldn't be copying a TARGET_EXPR except into a base
8411 if (CHECKING_P
&& cxx_dialect
>= cxx17
)
8412 gcc_assert (TREE_CODE (arg
) != TARGET_EXPR
8414 /* It's from binding the ref parm to a packed field. */
8415 || convs
[0]->need_temporary_p
8417 /* See unsafe_copy_elision_p. */
8418 || DECL_BASE_CONSTRUCTOR_P (fn
));
8421 bool unsafe
= unsafe_copy_elision_p (fa
, arg
);
8422 bool eliding_temp
= (TREE_CODE (arg
) == TARGET_EXPR
&& !unsafe
);
8424 /* [class.copy]: the copy constructor is implicitly defined even if the
8425 implementation elided its use. But don't warn about deprecation when
8426 eliding a temporary, as then no copy is actually performed. */
8427 warning_sentinel
s (warn_deprecated_copy
, eliding_temp
);
8429 /* The language says this isn't called. */;
8432 if (!mark_used (fn
, complain
) && !(complain
& tf_error
))
8433 return error_mark_node
;
8434 already_used
= true;
8437 cp_warn_deprecated_use (fn
, complain
);
8439 /* If we're creating a temp and we already have one, don't create a
8440 new one. If we're not creating a temp but we get one, use
8441 INIT_EXPR to collapse the temp into our target. Otherwise, if the
8442 ctor is trivial, do a bitwise copy with a simple TARGET_EXPR for a
8443 temp or an INIT_EXPR otherwise. */
8444 if (is_dummy_object (fa
))
8446 if (TREE_CODE (arg
) == TARGET_EXPR
)
8449 return force_target_expr (DECL_CONTEXT (fn
), arg
, complain
);
8451 else if ((trivial
|| TREE_CODE (arg
) == TARGET_EXPR
)
8454 tree to
= cp_stabilize_reference (cp_build_fold_indirect_ref (fa
));
8456 val
= build2 (INIT_EXPR
, DECL_CONTEXT (fn
), to
, arg
);
8460 else if (DECL_ASSIGNMENT_OPERATOR_P (fn
)
8461 && DECL_OVERLOADED_OPERATOR_IS (fn
, NOP_EXPR
)
8462 && trivial_fn_p (fn
))
8464 tree to
= cp_stabilize_reference
8465 (cp_build_fold_indirect_ref (argarray
[0]));
8466 tree type
= TREE_TYPE (to
);
8467 tree as_base
= CLASSTYPE_AS_BASE (type
);
8468 tree arg
= argarray
[1];
8469 location_t loc
= cp_expr_loc_or_loc (arg
, input_location
);
8471 if (is_really_empty_class (type
))
8473 /* Avoid copying empty classes. */
8474 val
= build2 (COMPOUND_EXPR
, type
, arg
, to
);
8475 TREE_NO_WARNING (val
) = 1;
8477 else if (tree_int_cst_equal (TYPE_SIZE (type
), TYPE_SIZE (as_base
)))
8479 if (is_std_init_list (type
)
8480 && conv_binds_ref_to_prvalue (convs
[1]))
8481 warning_at (loc
, OPT_Winit_list_lifetime
,
8482 "assignment from temporary initializer_list does not "
8483 "extend the lifetime of the underlying array");
8484 arg
= cp_build_fold_indirect_ref (arg
);
8485 val
= build2 (MODIFY_EXPR
, TREE_TYPE (to
), to
, arg
);
8489 /* We must only copy the non-tail padding parts. */
8491 tree array_type
, alias_set
;
8493 arg2
= TYPE_SIZE_UNIT (as_base
);
8494 arg0
= cp_build_addr_expr (to
, complain
);
8496 array_type
= build_array_type (unsigned_char_type_node
,
8498 (size_binop (MINUS_EXPR
,
8499 arg2
, size_int (1))));
8500 alias_set
= build_int_cst (build_pointer_type (type
), 0);
8501 t
= build2 (MODIFY_EXPR
, void_type_node
,
8502 build2 (MEM_REF
, array_type
, arg0
, alias_set
),
8503 build2 (MEM_REF
, array_type
, arg
, alias_set
));
8504 val
= build2 (COMPOUND_EXPR
, TREE_TYPE (to
), t
, to
);
8505 TREE_NO_WARNING (val
) = 1;
8508 cp_warn_deprecated_use (fn
, complain
);
8512 else if (trivial_fn_p (fn
))
8514 if (DECL_DESTRUCTOR_P (fn
))
8515 return build_trivial_dtor_call (argarray
[0]);
8516 else if (default_ctor_p (fn
))
8518 if (is_dummy_object (argarray
[0]))
8519 return force_target_expr (DECL_CONTEXT (fn
), void_node
,
8520 no_cleanup_complain
);
8522 return cp_build_fold_indirect_ref (argarray
[0]);
8526 gcc_assert (!force_elide
);
8529 && !mark_used (fn
, complain
))
8530 return error_mark_node
;
8532 /* Warn if the built-in writes to an object of a non-trivial type. */
8533 if (warn_class_memaccess
8534 && vec_safe_length (args
) >= 2
8535 && DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
)
8536 maybe_warn_class_memaccess (input_location
, fn
, args
);
8538 if (DECL_VINDEX (fn
) && (flags
& LOOKUP_NONVIRTUAL
) == 0)
8541 tree binfo
= lookup_base (TREE_TYPE (TREE_TYPE (argarray
[0])),
8543 ba_any
, NULL
, complain
);
8544 gcc_assert (binfo
&& binfo
!= error_mark_node
);
8546 argarray
[0] = build_base_path (PLUS_EXPR
, argarray
[0], binfo
, 1,
8548 if (TREE_SIDE_EFFECTS (argarray
[0]))
8549 argarray
[0] = save_expr (argarray
[0]);
8550 t
= build_pointer_type (TREE_TYPE (fn
));
8551 fn
= build_vfn_ref (argarray
[0], DECL_VINDEX (fn
));
8556 fn
= build_addr_func (fn
, complain
);
8557 if (fn
== error_mark_node
)
8558 return error_mark_node
;
8561 tree call
= build_cxx_call (fn
, nargs
, argarray
, complain
|decltype_flag
);
8562 if (call
== error_mark_node
)
8564 if (cand
->flags
& LOOKUP_LIST_INIT_CTOR
)
8566 tree c
= extract_call_expr (call
);
8567 /* build_new_op_1 will clear this when appropriate. */
8568 CALL_EXPR_ORDERED_ARGS (c
) = true;
8572 tree c
= extract_call_expr (call
);
8573 if (TREE_CODE (c
) == CALL_EXPR
)
8574 TREE_NO_WARNING (c
) = 1;
8582 /* Return the DECL of the first non-static subobject of class TYPE
8583 that satisfies the predicate PRED or null if none can be found. */
8585 template <class Predicate
>
8587 first_non_static_field (tree type
, Predicate pred
)
8589 if (!type
|| !CLASS_TYPE_P (type
))
8592 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
8594 if (TREE_CODE (field
) != FIELD_DECL
)
8596 if (TREE_STATIC (field
))
8604 for (tree base_binfo
, binfo
= TYPE_BINFO (type
);
8605 BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
8607 tree base
= TREE_TYPE (base_binfo
);
8610 if (tree field
= first_non_static_field (base
, pred
))
8617 struct NonPublicField
8619 bool operator() (const_tree t
)
8621 return DECL_P (t
) && (TREE_PRIVATE (t
) || TREE_PROTECTED (t
));
8625 /* Return the DECL of the first non-public subobject of class TYPE
8626 or null if none can be found. */
8629 first_non_public_field (tree type
)
8631 return first_non_static_field (type
, NonPublicField ());
8634 struct NonTrivialField
8636 bool operator() (const_tree t
)
8638 return !trivial_type_p (DECL_P (t
) ? TREE_TYPE (t
) : t
);
8642 /* Return the DECL of the first non-trivial subobject of class TYPE
8643 or null if none can be found. */
8646 first_non_trivial_field (tree type
)
8648 return first_non_static_field (type
, NonTrivialField ());
8651 } /* unnamed namespace */
8653 /* Return true if all copy and move assignment operator overloads for
8654 class TYPE are trivial and at least one of them is not deleted and,
8655 when ACCESS is set, accessible. Return false otherwise. Set
8656 HASASSIGN to true when the TYPE has a (not necessarily trivial)
8657 copy or move assignment. */
8660 has_trivial_copy_assign_p (tree type
, bool access
, bool *hasassign
)
8662 tree fns
= get_class_binding (type
, assign_op_identifier
);
8663 bool all_trivial
= true;
8665 /* Iterate over overloads of the assignment operator, checking
8666 accessible copy assignments for triviality. */
8668 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8672 /* Skip operators that aren't copy assignments. */
8676 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8677 || accessible_p (TYPE_BINFO (type
), f
, true));
8679 /* Skip template assignment operators and deleted functions. */
8680 if (TREE_CODE (f
) != FUNCTION_DECL
|| DECL_DELETED_FN (f
))
8686 if (!accessible
|| !trivial_fn_p (f
))
8687 all_trivial
= false;
8689 /* Break early when both properties have been determined. */
8690 if (*hasassign
&& !all_trivial
)
8694 /* Return true if they're all trivial and one of the expressions
8695 TYPE() = TYPE() or TYPE() = (TYPE&)() is valid. */
8696 tree ref
= cp_build_reference_type (type
, false);
8698 && (is_trivially_xible (MODIFY_EXPR
, type
, type
)
8699 || is_trivially_xible (MODIFY_EXPR
, type
, ref
)));
8702 /* Return true if all copy and move ctor overloads for class TYPE are
8703 trivial and at least one of them is not deleted and, when ACCESS is
8704 set, accessible. Return false otherwise. Set each element of HASCTOR[]
8705 to true when the TYPE has a (not necessarily trivial) default and copy
8706 (or move) ctor, respectively. */
8709 has_trivial_copy_p (tree type
, bool access
, bool hasctor
[2])
8711 tree fns
= get_class_binding (type
, complete_ctor_identifier
);
8712 bool all_trivial
= true;
8714 for (ovl_iterator
oi (fns
); oi
; ++oi
)
8718 /* Skip template constructors. */
8719 if (TREE_CODE (f
) != FUNCTION_DECL
)
8722 bool cpy_or_move_ctor_p
= copy_fn_p (f
);
8724 /* Skip ctors other than default, copy, and move. */
8725 if (!cpy_or_move_ctor_p
&& !default_ctor_p (f
))
8728 if (DECL_DELETED_FN (f
))
8731 bool accessible
= (!access
|| !(TREE_PRIVATE (f
) || TREE_PROTECTED (f
))
8732 || accessible_p (TYPE_BINFO (type
), f
, true));
8735 hasctor
[cpy_or_move_ctor_p
] = true;
8737 if (cpy_or_move_ctor_p
&& (!accessible
|| !trivial_fn_p (f
)))
8738 all_trivial
= false;
8740 /* Break early when both properties have been determined. */
8741 if (hasctor
[0] && hasctor
[1] && !all_trivial
)
8748 /* Issue a warning on a call to the built-in function FNDECL if it is
8749 a raw memory write whose destination is not an object of (something
8750 like) trivial or standard layout type with a non-deleted assignment
8751 and copy ctor. Detects const correctness violations, corrupting
8752 references, virtual table pointers, and bypassing non-trivial
8756 maybe_warn_class_memaccess (location_t loc
, tree fndecl
,
8757 const vec
<tree
, va_gc
> *args
)
8759 /* Except for bcopy where it's second, the destination pointer is
8760 the first argument for all functions handled here. Compute
8761 the index of the destination and source arguments. */
8762 unsigned dstidx
= DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_BCOPY
;
8763 unsigned srcidx
= !dstidx
;
8765 tree dest
= (*args
)[dstidx
];
8766 if (!TREE_TYPE (dest
) || !INDIRECT_TYPE_P (TREE_TYPE (dest
)))
8769 tree srctype
= NULL_TREE
;
8771 /* Determine the type of the pointed-to object and whether it's
8772 a complete class type. */
8773 tree desttype
= TREE_TYPE (TREE_TYPE (dest
));
8775 if (!desttype
|| !COMPLETE_TYPE_P (desttype
) || !CLASS_TYPE_P (desttype
))
8778 /* Check to see if the raw memory call is made by a non-static member
8779 function with THIS as the destination argument for the destination
8780 type. If so, and if the class has no non-trivial bases or members,
8781 be more permissive. */
8782 if (current_function_decl
8783 && DECL_NONSTATIC_MEMBER_FUNCTION_P (current_function_decl
)
8784 && is_this_parameter (tree_strip_nop_conversions (dest
)))
8786 tree ctx
= DECL_CONTEXT (current_function_decl
);
8787 bool special
= same_type_ignoring_top_level_qualifiers_p (ctx
, desttype
);
8788 tree binfo
= TYPE_BINFO (ctx
);
8791 && !BINFO_VTABLE (binfo
)
8792 && !first_non_trivial_field (desttype
))
8796 /* True if the class is trivial. */
8797 bool trivial
= trivial_type_p (desttype
);
8799 /* Set to true if DESTYPE has an accessible copy assignment. */
8800 bool hasassign
= false;
8801 /* True if all of the class' overloaded copy assignment operators
8802 are all trivial (and not deleted) and at least one of them is
8804 bool trivassign
= has_trivial_copy_assign_p (desttype
, true, &hasassign
);
8806 /* Set to true if DESTTYPE has an accessible default and copy ctor,
8808 bool hasctors
[2] = { false, false };
8810 /* True if all of the class' overloaded copy constructors are all
8811 trivial (and not deleted) and at least one of them is accessible. */
8812 bool trivcopy
= has_trivial_copy_p (desttype
, true, hasctors
);
8814 /* Set FLD to the first private/protected member of the class. */
8815 tree fld
= trivial
? first_non_public_field (desttype
) : NULL_TREE
;
8817 /* The warning format string. */
8818 const char *warnfmt
= NULL
;
8819 /* A suggested alternative to offer instead of the raw memory call.
8820 Empty string when none can be come up with. */
8821 const char *suggest
= "";
8822 bool warned
= false;
8824 switch (DECL_FUNCTION_CODE (fndecl
))
8826 case BUILT_IN_MEMSET
:
8827 if (!integer_zerop (maybe_constant_value ((*args
)[1])))
8829 /* Diagnose setting non-copy-assignable or non-trivial types,
8830 or types with a private member, to (potentially) non-zero
8831 bytes. Since the value of the bytes being written is unknown,
8832 suggest using assignment instead (if one exists). Also warn
8833 for writes into objects for which zero-initialization doesn't
8834 mean all bits clear (pointer-to-member data, where null is all
8835 bits set). Since the value being written is (most likely)
8836 non-zero, simply suggest assignment (but not copy assignment). */
8837 suggest
= "; use assignment instead";
8839 warnfmt
= G_("%qD writing to an object of type %#qT with "
8840 "no trivial copy-assignment");
8842 warnfmt
= G_("%qD writing to an object of non-trivial type %#qT%s");
8845 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8846 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8847 "%qD writing to an object of type %#qT with "
8849 fndecl
, desttype
, access
, fld
);
8851 else if (!zero_init_p (desttype
))
8852 warnfmt
= G_("%qD writing to an object of type %#qT containing "
8853 "a pointer to data member%s");
8859 case BUILT_IN_BZERO
:
8860 /* Similarly to the above, diagnose clearing non-trivial or non-
8861 standard layout objects, or objects of types with no assignmenmt.
8862 Since the value being written is known to be zero, suggest either
8863 copy assignment, copy ctor, or default ctor as an alternative,
8864 depending on what's available. */
8866 if (hasassign
&& hasctors
[0])
8867 suggest
= G_("; use assignment or value-initialization instead");
8869 suggest
= G_("; use assignment instead");
8870 else if (hasctors
[0])
8871 suggest
= G_("; use value-initialization instead");
8874 warnfmt
= G_("%qD clearing an object of type %#qT with "
8875 "no trivial copy-assignment%s");
8877 warnfmt
= G_("%qD clearing an object of non-trivial type %#qT%s");
8878 else if (!zero_init_p (desttype
))
8879 warnfmt
= G_("%qD clearing an object of type %#qT containing "
8880 "a pointer-to-member%s");
8883 case BUILT_IN_BCOPY
:
8884 case BUILT_IN_MEMCPY
:
8885 case BUILT_IN_MEMMOVE
:
8886 case BUILT_IN_MEMPCPY
:
8887 /* Determine the type of the source object. */
8888 srctype
= TREE_TYPE ((*args
)[srcidx
]);
8889 if (!srctype
|| !INDIRECT_TYPE_P (srctype
))
8890 srctype
= void_type_node
;
8892 srctype
= TREE_TYPE (srctype
);
8894 /* Since it's impossible to determine wheter the byte copy is
8895 being used in place of assignment to an existing object or
8896 as a substitute for initialization, assume it's the former.
8897 Determine the best alternative to use instead depending on
8898 what's not deleted. */
8899 if (hasassign
&& hasctors
[1])
8900 suggest
= G_("; use copy-assignment or copy-initialization instead");
8902 suggest
= G_("; use copy-assignment instead");
8903 else if (hasctors
[1])
8904 suggest
= G_("; use copy-initialization instead");
8907 warnfmt
= G_("%qD writing to an object of type %#qT with no trivial "
8908 "copy-assignment%s");
8909 else if (!trivially_copyable_p (desttype
))
8910 warnfmt
= G_("%qD writing to an object of non-trivially copyable "
8913 warnfmt
= G_("%qD writing to an object with a deleted copy constructor");
8916 && !VOID_TYPE_P (srctype
)
8917 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8918 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8921 /* Warn when copying into a non-trivial object from an object
8922 of a different type other than void or char. */
8923 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8924 "%qD copying an object of non-trivial type "
8925 "%#qT from an array of %#qT",
8926 fndecl
, desttype
, srctype
);
8929 && !VOID_TYPE_P (srctype
)
8930 && !char_type_p (TYPE_MAIN_VARIANT (srctype
))
8931 && !same_type_ignoring_top_level_qualifiers_p (desttype
,
8934 const char *access
= TREE_PRIVATE (fld
) ? "private" : "protected";
8935 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8936 "%qD copying an object of type %#qT with "
8937 "%qs member %qD from an array of %#qT; use "
8938 "assignment or copy-initialization instead",
8939 fndecl
, desttype
, access
, fld
, srctype
);
8941 else if (!trivial
&& vec_safe_length (args
) > 2)
8943 tree sz
= maybe_constant_value ((*args
)[2]);
8944 if (!tree_fits_uhwi_p (sz
))
8947 /* Finally, warn on partial copies. */
8948 unsigned HOST_WIDE_INT typesize
8949 = tree_to_uhwi (TYPE_SIZE_UNIT (desttype
));
8950 if (unsigned HOST_WIDE_INT partial
= tree_to_uhwi (sz
) % typesize
)
8951 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8952 (typesize
- partial
> 1
8953 ? G_("%qD writing to an object of "
8954 "a non-trivial type %#qT leaves %wu "
8956 : G_("%qD writing to an object of "
8957 "a non-trivial type %#qT leaves %wu "
8959 fndecl
, desttype
, typesize
- partial
);
8963 case BUILT_IN_REALLOC
:
8965 if (!trivially_copyable_p (desttype
))
8966 warnfmt
= G_("%qD moving an object of non-trivially copyable type "
8967 "%#qT; use %<new%> and %<delete%> instead");
8969 warnfmt
= G_("%qD moving an object of type %#qT with deleted copy "
8970 "constructor; use %<new%> and %<delete%> instead");
8971 else if (!get_dtor (desttype
, tf_none
))
8972 warnfmt
= G_("%qD moving an object of type %#qT with deleted "
8976 tree sz
= maybe_constant_value ((*args
)[1]);
8977 if (TREE_CODE (sz
) == INTEGER_CST
8978 && tree_int_cst_lt (sz
, TYPE_SIZE_UNIT (desttype
)))
8979 /* Finally, warn on reallocation into insufficient space. */
8980 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8981 "%qD moving an object of non-trivial type "
8982 "%#qT and size %E into a region of size %E",
8983 fndecl
, desttype
, TYPE_SIZE_UNIT (desttype
),
8995 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8996 warnfmt
, fndecl
, desttype
, suggest
);
8998 warned
= warning_at (loc
, OPT_Wclass_memaccess
,
8999 warnfmt
, fndecl
, desttype
);
9003 inform (location_of (desttype
), "%#qT declared here", desttype
);
9006 /* Build and return a call to FN, using NARGS arguments in ARGARRAY.
9007 This function performs no overload resolution, conversion, or other
9008 high-level operations. */
9011 build_cxx_call (tree fn
, int nargs
, tree
*argarray
,
9012 tsubst_flags_t complain
)
9016 /* Remember roughly where this call is. */
9017 location_t loc
= cp_expr_loc_or_loc (fn
, input_location
);
9018 fn
= build_call_a (fn
, nargs
, argarray
);
9019 SET_EXPR_LOCATION (fn
, loc
);
9021 fndecl
= get_callee_fndecl (fn
);
9023 /* Check that arguments to builtin functions match the expectations. */
9025 && !processing_template_decl
9026 && fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
9030 /* We need to take care that values to BUILT_IN_NORMAL
9032 for (i
= 0; i
< nargs
; i
++)
9033 argarray
[i
] = maybe_constant_value (argarray
[i
]);
9035 if (!check_builtin_function_arguments (EXPR_LOCATION (fn
), vNULL
, fndecl
,
9037 return error_mark_node
;
9040 if (VOID_TYPE_P (TREE_TYPE (fn
)))
9043 /* 5.2.2/11: If a function call is a prvalue of object type: if the
9044 function call is either the operand of a decltype-specifier or the
9045 right operand of a comma operator that is the operand of a
9046 decltype-specifier, a temporary object is not introduced for the
9047 prvalue. The type of the prvalue may be incomplete. */
9048 if (!(complain
& tf_decltype
))
9050 fn
= require_complete_type_sfinae (fn
, complain
);
9051 if (fn
== error_mark_node
)
9052 return error_mark_node
;
9054 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (fn
)))
9056 fn
= build_cplus_new (TREE_TYPE (fn
), fn
, complain
);
9057 maybe_warn_parm_abi (TREE_TYPE (fn
), loc
);
9060 return convert_from_reference (fn
);
9063 /* Returns the value to use for the in-charge parameter when making a
9064 call to a function with the indicated NAME.
9066 FIXME:Can't we find a neater way to do this mapping? */
9069 in_charge_arg_for_name (tree name
)
9071 if (IDENTIFIER_CTOR_P (name
))
9073 if (name
== complete_ctor_identifier
)
9074 return integer_one_node
;
9075 gcc_checking_assert (name
== base_ctor_identifier
);
9079 if (name
== complete_dtor_identifier
)
9080 return integer_two_node
;
9081 else if (name
== deleting_dtor_identifier
)
9082 return integer_three_node
;
9083 gcc_checking_assert (name
== base_dtor_identifier
);
9086 return integer_zero_node
;
9089 /* We've built up a constructor call RET. Complain if it delegates to the
9090 constructor we're currently compiling. */
9093 check_self_delegation (tree ret
)
9095 if (TREE_CODE (ret
) == TARGET_EXPR
)
9096 ret
= TARGET_EXPR_INITIAL (ret
);
9097 tree fn
= cp_get_callee_fndecl_nofold (ret
);
9098 if (fn
&& DECL_ABSTRACT_ORIGIN (fn
) == current_function_decl
)
9099 error ("constructor delegates to itself");
9102 /* Build a call to a constructor, destructor, or an assignment
9103 operator for INSTANCE, an expression with class type. NAME
9104 indicates the special member function to call; *ARGS are the
9105 arguments. ARGS may be NULL. This may change ARGS. BINFO
9106 indicates the base of INSTANCE that is to be passed as the `this'
9107 parameter to the member function called.
9109 FLAGS are the LOOKUP_* flags to use when processing the call.
9111 If NAME indicates a complete object constructor, INSTANCE may be
9112 NULL_TREE. In this case, the caller will call build_cplus_new to
9113 store the newly constructed object into a VAR_DECL. */
9116 build_special_member_call (tree instance
, tree name
, vec
<tree
, va_gc
> **args
,
9117 tree binfo
, int flags
, tsubst_flags_t complain
)
9120 /* The type of the subobject to be constructed or destroyed. */
9122 vec
<tree
, va_gc
> *allocated
= NULL
;
9125 gcc_assert (IDENTIFIER_CDTOR_P (name
) || name
== assign_op_identifier
);
9127 if (error_operand_p (instance
))
9128 return error_mark_node
;
9130 if (IDENTIFIER_DTOR_P (name
))
9132 gcc_assert (args
== NULL
|| vec_safe_is_empty (*args
));
9133 if (!type_build_dtor_call (TREE_TYPE (instance
)))
9134 /* Shortcut to avoid lazy destructor declaration. */
9135 return build_trivial_dtor_call (instance
);
9140 /* Resolve the name. */
9141 if (!complete_type_or_maybe_complain (binfo
, NULL_TREE
, complain
))
9142 return error_mark_node
;
9144 binfo
= TYPE_BINFO (binfo
);
9147 gcc_assert (binfo
!= NULL_TREE
);
9149 class_type
= BINFO_TYPE (binfo
);
9151 /* Handle the special case where INSTANCE is NULL_TREE. */
9152 if (name
== complete_ctor_identifier
&& !instance
)
9153 instance
= build_dummy_object (class_type
);
9156 /* Convert to the base class, if necessary. */
9157 if (!same_type_ignoring_top_level_qualifiers_p
9158 (TREE_TYPE (instance
), BINFO_TYPE (binfo
)))
9160 if (IDENTIFIER_CDTOR_P (name
))
9161 /* For constructors and destructors, either the base is
9162 non-virtual, or it is virtual but we are doing the
9163 conversion from a constructor or destructor for the
9164 complete object. In either case, we can convert
9166 instance
= convert_to_base_statically (instance
, binfo
);
9169 /* However, for assignment operators, we must convert
9170 dynamically if the base is virtual. */
9171 gcc_checking_assert (name
== assign_op_identifier
);
9172 instance
= build_base_path (PLUS_EXPR
, instance
,
9173 binfo
, /*nonnull=*/1, complain
);
9178 gcc_assert (instance
!= NULL_TREE
);
9180 /* In C++17, "If the initializer expression is a prvalue and the
9181 cv-unqualified version of the source type is the same class as the class
9182 of the destination, the initializer expression is used to initialize the
9183 destination object." Handle that here to avoid doing overload
9185 if (cxx_dialect
>= cxx17
9186 && args
&& vec_safe_length (*args
) == 1
9187 && name
== complete_ctor_identifier
)
9189 tree arg
= (**args
)[0];
9191 if (BRACE_ENCLOSED_INITIALIZER_P (arg
)
9192 && !TYPE_HAS_LIST_CTOR (class_type
)
9193 && CONSTRUCTOR_NELTS (arg
) == 1)
9194 arg
= CONSTRUCTOR_ELT (arg
, 0)->value
;
9196 if ((TREE_CODE (arg
) == TARGET_EXPR
9197 || TREE_CODE (arg
) == CONSTRUCTOR
)
9198 && (same_type_ignoring_top_level_qualifiers_p
9199 (class_type
, TREE_TYPE (arg
))))
9201 if (is_dummy_object (instance
))
9203 else if (TREE_CODE (arg
) == TARGET_EXPR
)
9204 TARGET_EXPR_DIRECT_INIT_P (arg
) = true;
9206 if ((complain
& tf_error
)
9207 && (flags
& LOOKUP_DELEGATING_CONS
))
9208 check_self_delegation (arg
);
9209 /* Avoid change of behavior on Wunused-var-2.C. */
9210 instance
= mark_lvalue_use (instance
);
9211 return build2 (INIT_EXPR
, class_type
, instance
, arg
);
9215 fns
= lookup_fnfields (binfo
, name
, 1);
9217 /* When making a call to a constructor or destructor for a subobject
9218 that uses virtual base classes, pass down a pointer to a VTT for
9220 if ((name
== base_ctor_identifier
9221 || name
== base_dtor_identifier
)
9222 && CLASSTYPE_VBASECLASSES (class_type
))
9227 /* If the current function is a complete object constructor
9228 or destructor, then we fetch the VTT directly.
9229 Otherwise, we look it up using the VTT we were given. */
9230 vtt
= DECL_CHAIN (CLASSTYPE_VTABLES (current_class_type
));
9231 vtt
= decay_conversion (vtt
, complain
);
9232 if (vtt
== error_mark_node
)
9233 return error_mark_node
;
9234 vtt
= build_if_in_charge (vtt
, current_vtt_parm
);
9235 if (BINFO_SUBVTT_INDEX (binfo
))
9236 sub_vtt
= fold_build_pointer_plus (vtt
, BINFO_SUBVTT_INDEX (binfo
));
9242 allocated
= make_tree_vector ();
9246 vec_safe_insert (*args
, 0, sub_vtt
);
9249 ret
= build_new_method_call (instance
, fns
, args
,
9250 TYPE_BINFO (BINFO_TYPE (binfo
)),
9254 if (allocated
!= NULL
)
9255 release_tree_vector (allocated
);
9257 if ((complain
& tf_error
)
9258 && (flags
& LOOKUP_DELEGATING_CONS
)
9259 && name
== complete_ctor_identifier
)
9260 check_self_delegation (ret
);
9265 /* Return the NAME, as a C string. The NAME indicates a function that
9266 is a member of TYPE. *FREE_P is set to true if the caller must
9267 free the memory returned.
9269 Rather than go through all of this, we should simply set the names
9270 of constructors and destructors appropriately, and dispense with
9271 ctor_identifier, dtor_identifier, etc. */
9274 name_as_c_string (tree name
, tree type
, bool *free_p
)
9276 const char *pretty_name
;
9278 /* Assume that we will not allocate memory. */
9280 /* Constructors and destructors are special. */
9281 if (IDENTIFIER_CDTOR_P (name
))
9284 = identifier_to_locale (IDENTIFIER_POINTER (constructor_name (type
)));
9285 /* For a destructor, add the '~'. */
9286 if (IDENTIFIER_DTOR_P (name
))
9288 pretty_name
= concat ("~", pretty_name
, NULL
);
9289 /* Remember that we need to free the memory allocated. */
9293 else if (IDENTIFIER_CONV_OP_P (name
))
9295 pretty_name
= concat ("operator ",
9296 type_as_string_translate (TREE_TYPE (name
),
9297 TFF_PLAIN_IDENTIFIER
),
9299 /* Remember that we need to free the memory allocated. */
9303 pretty_name
= identifier_to_locale (IDENTIFIER_POINTER (name
));
9305 return CONST_CAST (char *, pretty_name
);
9308 /* If CANDIDATES contains exactly one candidate, return it, otherwise
9311 static z_candidate
*
9312 single_z_candidate (z_candidate
*candidates
)
9314 if (candidates
== NULL
)
9317 if (candidates
->next
)
9323 /* If CANDIDATE is invalid due to a bad argument type, return the
9324 pertinent conversion_info.
9326 Otherwise, return NULL. */
9328 static const conversion_info
*
9329 maybe_get_bad_conversion_for_unmatched_call (const z_candidate
*candidate
)
9331 /* Must be an rr_arg_conversion or rr_bad_arg_conversion. */
9332 rejection_reason
*r
= candidate
->reason
;
9342 case rr_arg_conversion
:
9343 return &r
->u
.conversion
;
9345 case rr_bad_arg_conversion
:
9346 return &r
->u
.bad_conversion
;
9350 /* Issue an error and note complaining about a bad argument type at a
9351 callsite with a single candidate FNDECL.
9353 ARG_LOC is the location of the argument (or UNKNOWN_LOCATION, in which
9354 case input_location is used).
9355 FROM_TYPE is the type of the actual argument; TO_TYPE is the type of
9356 the formal parameter. */
9359 complain_about_bad_argument (location_t arg_loc
,
9360 tree from_type
, tree to_type
,
9361 tree fndecl
, int parmnum
)
9363 auto_diagnostic_group d
;
9364 range_label_for_type_mismatch
rhs_label (from_type
, to_type
);
9365 range_label
*label
= &rhs_label
;
9366 if (arg_loc
== UNKNOWN_LOCATION
)
9368 arg_loc
= input_location
;
9371 gcc_rich_location
richloc (arg_loc
, label
);
9373 "cannot convert %qH to %qI",
9374 from_type
, to_type
);
9375 maybe_inform_about_fndecl_for_bogus_argument_init (fndecl
,
9379 /* Subroutine of build_new_method_call_1, for where there are no viable
9380 candidates for the call. */
9383 complain_about_no_candidates_for_method_call (tree instance
,
9384 z_candidate
*candidates
,
9385 tree explicit_targs
,
9387 tree optype
, tree name
,
9388 bool skip_first_for_error
,
9389 vec
<tree
, va_gc
> *user_args
)
9391 auto_diagnostic_group d
;
9392 if (!COMPLETE_OR_OPEN_TYPE_P (basetype
))
9393 cxx_incomplete_type_error (instance
, basetype
);
9395 error ("no matching function for call to %<%T::operator %T(%A)%#V%>",
9396 basetype
, optype
, build_tree_list_vec (user_args
),
9397 TREE_TYPE (instance
));
9400 /* Special-case for when there's a single candidate that's failing
9401 due to a bad argument type. */
9402 if (z_candidate
*candidate
= single_z_candidate (candidates
))
9403 if (const conversion_info
*conv
9404 = maybe_get_bad_conversion_for_unmatched_call (candidate
))
9406 complain_about_bad_argument (conv
->loc
,
9407 conv
->from
, conv
->to_type
,
9408 candidate
->fn
, conv
->n_arg
);
9412 tree arglist
= build_tree_list_vec (user_args
);
9413 tree errname
= name
;
9414 bool twiddle
= false;
9415 if (IDENTIFIER_CDTOR_P (errname
))
9417 twiddle
= IDENTIFIER_DTOR_P (errname
);
9418 errname
= constructor_name (basetype
);
9421 errname
= lookup_template_function (errname
, explicit_targs
);
9422 if (skip_first_for_error
)
9423 arglist
= TREE_CHAIN (arglist
);
9424 error ("no matching function for call to %<%T::%s%E(%A)%#V%>",
9425 basetype
, &"~"[!twiddle
], errname
, arglist
,
9426 TREE_TYPE (instance
));
9428 print_z_candidates (location_of (name
), candidates
);
9431 /* Build a call to "INSTANCE.FN (ARGS)". If FN_P is non-NULL, it will
9432 be set, upon return, to the function called. ARGS may be NULL.
9433 This may change ARGS. */
9436 build_new_method_call_1 (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9437 tree conversion_path
, int flags
,
9438 tree
*fn_p
, tsubst_flags_t complain
)
9440 struct z_candidate
*candidates
= 0, *cand
;
9441 tree explicit_targs
= NULL_TREE
;
9442 tree basetype
= NULL_TREE
;
9443 tree access_binfo
, binfo
;
9445 tree first_mem_arg
= NULL_TREE
;
9447 bool skip_first_for_error
;
9448 vec
<tree
, va_gc
> *user_args
;
9451 int template_only
= 0;
9455 vec
<tree
, va_gc
> *orig_args
= NULL
;
9458 gcc_assert (instance
!= NULL_TREE
);
9460 /* We don't know what function we're going to call, yet. */
9464 if (error_operand_p (instance
)
9465 || !fns
|| error_operand_p (fns
))
9466 return error_mark_node
;
9468 if (!BASELINK_P (fns
))
9470 if (complain
& tf_error
)
9471 error ("call to non-function %qD", fns
);
9472 return error_mark_node
;
9475 orig_instance
= instance
;
9478 /* Dismantle the baselink to collect all the information we need. */
9479 if (!conversion_path
)
9480 conversion_path
= BASELINK_BINFO (fns
);
9481 access_binfo
= BASELINK_ACCESS_BINFO (fns
);
9482 binfo
= BASELINK_BINFO (fns
);
9483 optype
= BASELINK_OPTYPE (fns
);
9484 fns
= BASELINK_FUNCTIONS (fns
);
9485 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
9487 explicit_targs
= TREE_OPERAND (fns
, 1);
9488 fns
= TREE_OPERAND (fns
, 0);
9491 gcc_assert (TREE_CODE (fns
) == FUNCTION_DECL
9492 || TREE_CODE (fns
) == TEMPLATE_DECL
9493 || TREE_CODE (fns
) == OVERLOAD
);
9494 fn
= OVL_FIRST (fns
);
9495 name
= DECL_NAME (fn
);
9497 basetype
= TYPE_MAIN_VARIANT (TREE_TYPE (instance
));
9498 gcc_assert (CLASS_TYPE_P (basetype
));
9500 user_args
= args
== NULL
? NULL
: *args
;
9501 /* Under DR 147 A::A() is an invalid constructor call,
9502 not a functional cast. */
9503 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (fn
))
9505 if (! (complain
& tf_error
))
9506 return error_mark_node
;
9508 basetype
= DECL_CONTEXT (fn
);
9509 name
= constructor_name (basetype
);
9510 auto_diagnostic_group d
;
9511 if (permerror (input_location
,
9512 "cannot call constructor %<%T::%D%> directly",
9514 inform (input_location
, "for a function-style cast, remove the "
9515 "redundant %<::%D%>", name
);
9516 call
= build_functional_cast (basetype
, build_tree_list_vec (user_args
),
9521 if (processing_template_decl
)
9523 orig_args
= args
== NULL
? NULL
: make_tree_vector_copy (*args
);
9524 instance
= build_non_dependent_expr (instance
);
9526 make_args_non_dependent (*args
);
9529 /* Process the argument list. */
9530 if (args
!= NULL
&& *args
!= NULL
)
9532 *args
= resolve_args (*args
, complain
);
9534 return error_mark_node
;
9538 /* Consider the object argument to be used even if we end up selecting a
9539 static member function. */
9540 instance
= mark_type_use (instance
);
9542 /* Figure out whether to skip the first argument for the error
9543 message we will display to users if an error occurs. We don't
9544 want to display any compiler-generated arguments. The "this"
9545 pointer hasn't been added yet. However, we must remove the VTT
9546 pointer if this is a call to a base-class constructor or
9548 skip_first_for_error
= false;
9549 if (IDENTIFIER_CDTOR_P (name
))
9551 /* Callers should explicitly indicate whether they want to ctor
9552 the complete object or just the part without virtual bases. */
9553 gcc_assert (name
!= ctor_identifier
);
9555 /* Remove the VTT pointer, if present. */
9556 if ((name
== base_ctor_identifier
|| name
== base_dtor_identifier
)
9557 && CLASSTYPE_VBASECLASSES (basetype
))
9558 skip_first_for_error
= true;
9560 /* It's OK to call destructors and constructors on cv-qualified
9561 objects. Therefore, convert the INSTANCE to the unqualified
9562 type, if necessary. */
9563 if (!same_type_p (basetype
, TREE_TYPE (instance
)))
9565 instance
= build_this (instance
);
9566 instance
= build_nop (build_pointer_type (basetype
), instance
);
9567 instance
= build_fold_indirect_ref (instance
);
9571 gcc_assert (!DECL_DESTRUCTOR_P (fn
) && !DECL_CONSTRUCTOR_P (fn
));
9573 /* For the overload resolution we need to find the actual `this`
9574 that would be captured if the call turns out to be to a
9575 non-static member function. Do not actually capture it at this
9577 if (DECL_CONSTRUCTOR_P (fn
))
9578 /* Constructors don't use the enclosing 'this'. */
9579 first_mem_arg
= instance
;
9581 first_mem_arg
= maybe_resolve_dummy (instance
, false);
9583 /* Get the high-water mark for the CONVERSION_OBSTACK. */
9584 p
= conversion_obstack_alloc (0);
9586 /* The number of arguments artificial parms in ARGS; we subtract one because
9587 there's no 'this' in ARGS. */
9588 unsigned skip
= num_artificial_parms_for (fn
) - 1;
9590 /* If CONSTRUCTOR_IS_DIRECT_INIT is set, this was a T{ } form
9591 initializer, not T({ }). */
9592 if (DECL_CONSTRUCTOR_P (fn
)
9593 && vec_safe_length (user_args
) > skip
9594 && DIRECT_LIST_INIT_P ((*user_args
)[skip
]))
9596 tree init_list
= (*user_args
)[skip
];
9597 tree init
= NULL_TREE
;
9599 gcc_assert (user_args
->length () == skip
+ 1
9600 && !(flags
& LOOKUP_ONLYCONVERTING
));
9602 /* If the initializer list has no elements and T is a class type with
9603 a default constructor, the object is value-initialized. Handle
9604 this here so we don't need to handle it wherever we use
9605 build_special_member_call. */
9606 if (CONSTRUCTOR_NELTS (init_list
) == 0
9607 && TYPE_HAS_DEFAULT_CONSTRUCTOR (basetype
)
9608 /* For a user-provided default constructor, use the normal
9609 mechanisms so that protected access works. */
9610 && type_has_non_user_provided_default_constructor (basetype
)
9611 && !processing_template_decl
)
9612 init
= build_value_init (basetype
, complain
);
9614 /* If BASETYPE is an aggregate, we need to do aggregate
9616 else if (CP_AGGREGATE_TYPE_P (basetype
))
9618 init
= reshape_init (basetype
, init_list
, complain
);
9619 init
= digest_init (basetype
, init
, complain
);
9624 if (is_dummy_object (instance
))
9625 return get_target_expr_sfinae (init
, complain
);
9626 init
= build2 (INIT_EXPR
, TREE_TYPE (instance
), instance
, init
);
9627 TREE_SIDE_EFFECTS (init
) = true;
9631 /* Otherwise go ahead with overload resolution. */
9632 add_list_candidates (fns
, first_mem_arg
, user_args
,
9633 basetype
, explicit_targs
, template_only
,
9634 conversion_path
, access_binfo
, flags
,
9635 &candidates
, complain
);
9638 add_candidates (fns
, first_mem_arg
, user_args
, optype
,
9639 explicit_targs
, template_only
, conversion_path
,
9640 access_binfo
, flags
, &candidates
, complain
);
9642 any_viable_p
= false;
9643 candidates
= splice_viable (candidates
, false, &any_viable_p
);
9647 if (complain
& tf_error
)
9648 complain_about_no_candidates_for_method_call (instance
, candidates
,
9649 explicit_targs
, basetype
,
9651 skip_first_for_error
,
9653 call
= error_mark_node
;
9657 cand
= tourney (candidates
, complain
);
9664 if (complain
& tf_error
)
9666 pretty_name
= name_as_c_string (name
, basetype
, &free_p
);
9667 arglist
= build_tree_list_vec (user_args
);
9668 if (skip_first_for_error
)
9669 arglist
= TREE_CHAIN (arglist
);
9670 auto_diagnostic_group d
;
9671 if (!any_strictly_viable (candidates
))
9672 error ("no matching function for call to %<%s(%A)%>",
9673 pretty_name
, arglist
);
9675 error ("call of overloaded %<%s(%A)%> is ambiguous",
9676 pretty_name
, arglist
);
9677 print_z_candidates (location_of (name
), candidates
);
9681 call
= error_mark_node
;
9688 if (!(flags
& LOOKUP_NONVIRTUAL
)
9689 && DECL_PURE_VIRTUAL_P (fn
)
9690 && instance
== current_class_ref
9691 && (complain
& tf_warning
))
9693 /* This is not an error, it is runtime undefined
9695 if (!current_function_decl
)
9696 warning (0, "pure virtual %q#D called from "
9697 "non-static data member initializer", fn
);
9698 else if (DECL_CONSTRUCTOR_P (current_function_decl
)
9699 || DECL_DESTRUCTOR_P (current_function_decl
))
9700 warning (0, (DECL_CONSTRUCTOR_P (current_function_decl
)
9701 ? G_("pure virtual %q#D called from constructor")
9702 : G_("pure virtual %q#D called from destructor")),
9706 if (TREE_CODE (TREE_TYPE (fn
)) == METHOD_TYPE
9707 && !DECL_CONSTRUCTOR_P (fn
)
9708 && is_dummy_object (instance
))
9710 instance
= maybe_resolve_dummy (instance
, true);
9711 if (instance
== error_mark_node
)
9712 call
= error_mark_node
;
9713 else if (!is_dummy_object (instance
))
9715 /* We captured 'this' in the current lambda now that
9716 we know we really need it. */
9717 cand
->first_arg
= instance
;
9719 else if (any_dependent_bases_p ())
9720 /* We can't tell until instantiation time whether we can use
9721 *this as the implicit object argument. */;
9724 if (complain
& tf_error
)
9725 error ("cannot call member function %qD without object",
9727 call
= error_mark_node
;
9731 if (call
!= error_mark_node
)
9733 /* Optimize away vtable lookup if we know that this
9734 function can't be overridden. We need to check if
9735 the context and the type where we found fn are the same,
9736 actually FN might be defined in a different class
9737 type because of a using-declaration. In this case, we
9738 do not want to perform a non-virtual call. */
9739 if (DECL_VINDEX (fn
) && ! (flags
& LOOKUP_NONVIRTUAL
)
9740 && same_type_ignoring_top_level_qualifiers_p
9741 (DECL_CONTEXT (fn
), BINFO_TYPE (binfo
))
9742 && resolves_to_fixed_type_p (instance
, 0))
9743 flags
|= LOOKUP_NONVIRTUAL
;
9745 flags
|= LOOKUP_EXPLICIT_TMPL_ARGS
;
9746 /* Now we know what function is being called. */
9749 /* Build the actual CALL_EXPR. */
9750 call
= build_over_call (cand
, flags
, complain
);
9751 /* In an expression of the form `a->f()' where `f' turns
9752 out to be a static member function, `a' is
9753 none-the-less evaluated. */
9754 if (TREE_CODE (TREE_TYPE (fn
)) != METHOD_TYPE
9755 && !is_dummy_object (instance
)
9756 && TREE_SIDE_EFFECTS (instance
))
9758 /* But avoid the implicit lvalue-rvalue conversion when 'a'
9761 if (TREE_THIS_VOLATILE (a
))
9763 call
= build2 (COMPOUND_EXPR
, TREE_TYPE (call
), a
, call
);
9765 else if (call
!= error_mark_node
9766 && DECL_DESTRUCTOR_P (cand
->fn
)
9767 && !VOID_TYPE_P (TREE_TYPE (call
)))
9768 /* An explicit call of the form "x->~X()" has type
9769 "void". However, on platforms where destructors
9770 return "this" (i.e., those where
9771 targetm.cxx.cdtor_returns_this is true), such calls
9772 will appear to have a return value of pointer type
9773 to the low-level call machinery. We do not want to
9774 change the low-level machinery, since we want to be
9775 able to optimize "delete f()" on such platforms as
9776 "operator delete(~X(f()))" (rather than generating
9777 "t = f(), ~X(t), operator delete (t)"). */
9778 call
= build_nop (void_type_node
, call
);
9783 if (processing_template_decl
&& call
!= error_mark_node
)
9785 bool cast_to_void
= false;
9787 if (TREE_CODE (call
) == COMPOUND_EXPR
)
9788 call
= TREE_OPERAND (call
, 1);
9789 else if (TREE_CODE (call
) == NOP_EXPR
)
9791 cast_to_void
= true;
9792 call
= TREE_OPERAND (call
, 0);
9794 if (INDIRECT_REF_P (call
))
9795 call
= TREE_OPERAND (call
, 0);
9796 call
= (build_min_non_dep_call_vec
9798 build_min (COMPONENT_REF
, TREE_TYPE (CALL_EXPR_FN (call
)),
9799 orig_instance
, orig_fns
, NULL_TREE
),
9801 SET_EXPR_LOCATION (call
, input_location
);
9802 call
= convert_from_reference (call
);
9804 call
= build_nop (void_type_node
, call
);
9807 /* Free all the conversions we allocated. */
9808 obstack_free (&conversion_obstack
, p
);
9810 if (orig_args
!= NULL
)
9811 release_tree_vector (orig_args
);
9816 /* Wrapper for above. */
9819 build_new_method_call (tree instance
, tree fns
, vec
<tree
, va_gc
> **args
,
9820 tree conversion_path
, int flags
,
9821 tree
*fn_p
, tsubst_flags_t complain
)
9824 bool subtime
= timevar_cond_start (TV_OVERLOAD
);
9825 ret
= build_new_method_call_1 (instance
, fns
, args
, conversion_path
, flags
,
9827 timevar_cond_stop (TV_OVERLOAD
, subtime
);
9831 /* Returns true iff standard conversion sequence ICS1 is a proper
9832 subsequence of ICS2. */
9835 is_subseq (conversion
*ics1
, conversion
*ics2
)
9837 /* We can assume that a conversion of the same code
9838 between the same types indicates a subsequence since we only get
9839 here if the types we are converting from are the same. */
9841 while (ics1
->kind
== ck_rvalue
9842 || ics1
->kind
== ck_lvalue
)
9843 ics1
= next_conversion (ics1
);
9847 while (ics2
->kind
== ck_rvalue
9848 || ics2
->kind
== ck_lvalue
)
9849 ics2
= next_conversion (ics2
);
9851 if (ics2
->kind
== ck_user
9852 || ics2
->kind
== ck_ambig
9853 || ics2
->kind
== ck_aggr
9854 || ics2
->kind
== ck_list
9855 || ics2
->kind
== ck_identity
)
9856 /* At this point, ICS1 cannot be a proper subsequence of
9857 ICS2. We can get a USER_CONV when we are comparing the
9858 second standard conversion sequence of two user conversion
9862 ics2
= next_conversion (ics2
);
9864 while (ics2
->kind
== ck_rvalue
9865 || ics2
->kind
== ck_lvalue
)
9866 ics2
= next_conversion (ics2
);
9868 if (ics2
->kind
== ics1
->kind
9869 && same_type_p (ics2
->type
, ics1
->type
)
9870 && (ics1
->kind
== ck_identity
9871 || same_type_p (next_conversion (ics2
)->type
,
9872 next_conversion (ics1
)->type
)))
9877 /* Returns nonzero iff DERIVED is derived from BASE. The inputs may
9878 be any _TYPE nodes. */
9881 is_properly_derived_from (tree derived
, tree base
)
9883 if (!CLASS_TYPE_P (derived
) || !CLASS_TYPE_P (base
))
9886 /* We only allow proper derivation here. The DERIVED_FROM_P macro
9887 considers every class derived from itself. */
9888 return (!same_type_ignoring_top_level_qualifiers_p (derived
, base
)
9889 && DERIVED_FROM_P (base
, derived
));
9892 /* We build the ICS for an implicit object parameter as a pointer
9893 conversion sequence. However, such a sequence should be compared
9894 as if it were a reference conversion sequence. If ICS is the
9895 implicit conversion sequence for an implicit object parameter,
9896 modify it accordingly. */
9899 maybe_handle_implicit_object (conversion
**ics
)
9903 /* [over.match.funcs]
9905 For non-static member functions, the type of the
9906 implicit object parameter is "reference to cv X"
9907 where X is the class of which the function is a
9908 member and cv is the cv-qualification on the member
9909 function declaration. */
9910 conversion
*t
= *ics
;
9911 tree reference_type
;
9913 /* The `this' parameter is a pointer to a class type. Make the
9914 implicit conversion talk about a reference to that same class
9916 reference_type
= TREE_TYPE (t
->type
);
9917 reference_type
= build_reference_type (reference_type
);
9919 if (t
->kind
== ck_qual
)
9920 t
= next_conversion (t
);
9921 if (t
->kind
== ck_ptr
)
9922 t
= next_conversion (t
);
9923 t
= build_identity_conv (TREE_TYPE (t
->type
), NULL_TREE
);
9924 t
= direct_reference_binding (reference_type
, t
);
9926 t
->rvaluedness_matches_p
= 0;
9931 /* If *ICS is a REF_BIND set *ICS to the remainder of the conversion,
9932 and return the initial reference binding conversion. Otherwise,
9933 leave *ICS unchanged and return NULL. */
9936 maybe_handle_ref_bind (conversion
**ics
)
9938 if ((*ics
)->kind
== ck_ref_bind
)
9940 conversion
*old_ics
= *ics
;
9941 *ics
= next_conversion (old_ics
);
9942 (*ics
)->user_conv_p
= old_ics
->user_conv_p
;
9949 /* Compare two implicit conversion sequences according to the rules set out in
9950 [over.ics.rank]. Return values:
9952 1: ics1 is better than ics2
9953 -1: ics2 is better than ics1
9954 0: ics1 and ics2 are indistinguishable */
9957 compare_ics (conversion
*ics1
, conversion
*ics2
)
9963 tree deref_from_type1
= NULL_TREE
;
9964 tree deref_from_type2
= NULL_TREE
;
9965 tree deref_to_type1
= NULL_TREE
;
9966 tree deref_to_type2
= NULL_TREE
;
9967 conversion_rank rank1
, rank2
;
9969 /* REF_BINDING is nonzero if the result of the conversion sequence
9970 is a reference type. In that case REF_CONV is the reference
9971 binding conversion. */
9972 conversion
*ref_conv1
;
9973 conversion
*ref_conv2
;
9975 /* Compare badness before stripping the reference conversion. */
9976 if (ics1
->bad_p
> ics2
->bad_p
)
9978 else if (ics1
->bad_p
< ics2
->bad_p
)
9981 /* Handle implicit object parameters. */
9982 maybe_handle_implicit_object (&ics1
);
9983 maybe_handle_implicit_object (&ics2
);
9985 /* Handle reference parameters. */
9986 ref_conv1
= maybe_handle_ref_bind (&ics1
);
9987 ref_conv2
= maybe_handle_ref_bind (&ics2
);
9989 /* List-initialization sequence L1 is a better conversion sequence than
9990 list-initialization sequence L2 if L1 converts to
9991 std::initializer_list<X> for some X and L2 does not. */
9992 if (ics1
->kind
== ck_list
&& ics2
->kind
!= ck_list
)
9994 if (ics2
->kind
== ck_list
&& ics1
->kind
!= ck_list
)
9999 When comparing the basic forms of implicit conversion sequences (as
10000 defined in _over.best.ics_)
10002 --a standard conversion sequence (_over.ics.scs_) is a better
10003 conversion sequence than a user-defined conversion sequence
10004 or an ellipsis conversion sequence, and
10006 --a user-defined conversion sequence (_over.ics.user_) is a
10007 better conversion sequence than an ellipsis conversion sequence
10008 (_over.ics.ellipsis_). */
10009 /* Use BAD_CONVERSION_RANK because we already checked for a badness
10010 mismatch. If both ICS are bad, we try to make a decision based on
10011 what would have happened if they'd been good. This is not an
10012 extension, we'll still give an error when we build up the call; this
10013 just helps us give a more helpful error message. */
10014 rank1
= BAD_CONVERSION_RANK (ics1
);
10015 rank2
= BAD_CONVERSION_RANK (ics2
);
10019 else if (rank1
< rank2
)
10022 if (ics1
->ellipsis_p
)
10023 /* Both conversions are ellipsis conversions. */
10026 /* User-defined conversion sequence U1 is a better conversion sequence
10027 than another user-defined conversion sequence U2 if they contain the
10028 same user-defined conversion operator or constructor and if the sec-
10029 ond standard conversion sequence of U1 is better than the second
10030 standard conversion sequence of U2. */
10032 /* Handle list-conversion with the same code even though it isn't always
10033 ranked as a user-defined conversion and it doesn't have a second
10034 standard conversion sequence; it will still have the desired effect.
10035 Specifically, we need to do the reference binding comparison at the
10036 end of this function. */
10038 if (ics1
->user_conv_p
|| ics1
->kind
== ck_list
|| ics1
->kind
== ck_aggr
)
10043 for (t1
= ics1
; t1
->kind
!= ck_user
; t1
= next_conversion (t1
))
10044 if (t1
->kind
== ck_ambig
|| t1
->kind
== ck_aggr
10045 || t1
->kind
== ck_list
)
10047 for (t2
= ics2
; t2
->kind
!= ck_user
; t2
= next_conversion (t2
))
10048 if (t2
->kind
== ck_ambig
|| t2
->kind
== ck_aggr
10049 || t2
->kind
== ck_list
)
10052 if (t1
->kind
!= t2
->kind
)
10054 else if (t1
->kind
== ck_user
)
10056 tree f1
= t1
->cand
? t1
->cand
->fn
: t1
->type
;
10057 tree f2
= t2
->cand
? t2
->cand
->fn
: t2
->type
;
10063 /* For ambiguous or aggregate conversions, use the target type as
10064 a proxy for the conversion function. */
10065 if (!same_type_ignoring_top_level_qualifiers_p (t1
->type
, t2
->type
))
10069 /* We can just fall through here, after setting up
10070 FROM_TYPE1 and FROM_TYPE2. */
10071 from_type1
= t1
->type
;
10072 from_type2
= t2
->type
;
10079 /* We're dealing with two standard conversion sequences.
10083 Standard conversion sequence S1 is a better conversion
10084 sequence than standard conversion sequence S2 if
10086 --S1 is a proper subsequence of S2 (comparing the conversion
10087 sequences in the canonical form defined by _over.ics.scs_,
10088 excluding any Lvalue Transformation; the identity
10089 conversion sequence is considered to be a subsequence of
10090 any non-identity conversion sequence */
10093 while (t1
->kind
!= ck_identity
)
10094 t1
= next_conversion (t1
);
10095 from_type1
= t1
->type
;
10098 while (t2
->kind
!= ck_identity
)
10099 t2
= next_conversion (t2
);
10100 from_type2
= t2
->type
;
10103 /* One sequence can only be a subsequence of the other if they start with
10104 the same type. They can start with different types when comparing the
10105 second standard conversion sequence in two user-defined conversion
10107 if (same_type_p (from_type1
, from_type2
))
10109 if (is_subseq (ics1
, ics2
))
10111 if (is_subseq (ics2
, ics1
))
10119 --the rank of S1 is better than the rank of S2 (by the rules
10122 Standard conversion sequences are ordered by their ranks: an Exact
10123 Match is a better conversion than a Promotion, which is a better
10124 conversion than a Conversion.
10126 Two conversion sequences with the same rank are indistinguishable
10127 unless one of the following rules applies:
10129 --A conversion that does not a convert a pointer, pointer to member,
10130 or std::nullptr_t to bool is better than one that does.
10132 The ICS_STD_RANK automatically handles the pointer-to-bool rule,
10133 so that we do not have to check it explicitly. */
10134 if (ics1
->rank
< ics2
->rank
)
10136 else if (ics2
->rank
< ics1
->rank
)
10139 to_type1
= ics1
->type
;
10140 to_type2
= ics2
->type
;
10142 /* A conversion from scalar arithmetic type to complex is worse than a
10143 conversion between scalar arithmetic types. */
10144 if (same_type_p (from_type1
, from_type2
)
10145 && ARITHMETIC_TYPE_P (from_type1
)
10146 && ARITHMETIC_TYPE_P (to_type1
)
10147 && ARITHMETIC_TYPE_P (to_type2
)
10148 && ((TREE_CODE (to_type1
) == COMPLEX_TYPE
)
10149 != (TREE_CODE (to_type2
) == COMPLEX_TYPE
)))
10151 if (TREE_CODE (to_type1
) == COMPLEX_TYPE
)
10157 if (TYPE_PTR_P (from_type1
)
10158 && TYPE_PTR_P (from_type2
)
10159 && TYPE_PTR_P (to_type1
)
10160 && TYPE_PTR_P (to_type2
))
10162 deref_from_type1
= TREE_TYPE (from_type1
);
10163 deref_from_type2
= TREE_TYPE (from_type2
);
10164 deref_to_type1
= TREE_TYPE (to_type1
);
10165 deref_to_type2
= TREE_TYPE (to_type2
);
10167 /* The rules for pointers to members A::* are just like the rules
10168 for pointers A*, except opposite: if B is derived from A then
10169 A::* converts to B::*, not vice versa. For that reason, we
10170 switch the from_ and to_ variables here. */
10171 else if ((TYPE_PTRDATAMEM_P (from_type1
) && TYPE_PTRDATAMEM_P (from_type2
)
10172 && TYPE_PTRDATAMEM_P (to_type1
) && TYPE_PTRDATAMEM_P (to_type2
))
10173 || (TYPE_PTRMEMFUNC_P (from_type1
)
10174 && TYPE_PTRMEMFUNC_P (from_type2
)
10175 && TYPE_PTRMEMFUNC_P (to_type1
)
10176 && TYPE_PTRMEMFUNC_P (to_type2
)))
10178 deref_to_type1
= TYPE_PTRMEM_CLASS_TYPE (from_type1
);
10179 deref_to_type2
= TYPE_PTRMEM_CLASS_TYPE (from_type2
);
10180 deref_from_type1
= TYPE_PTRMEM_CLASS_TYPE (to_type1
);
10181 deref_from_type2
= TYPE_PTRMEM_CLASS_TYPE (to_type2
);
10184 if (deref_from_type1
!= NULL_TREE
10185 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type1
))
10186 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_from_type2
)))
10188 /* This was one of the pointer or pointer-like conversions.
10192 --If class B is derived directly or indirectly from class A,
10193 conversion of B* to A* is better than conversion of B* to
10194 void*, and conversion of A* to void* is better than
10195 conversion of B* to void*. */
10196 if (VOID_TYPE_P (deref_to_type1
)
10197 && VOID_TYPE_P (deref_to_type2
))
10199 if (is_properly_derived_from (deref_from_type1
,
10202 else if (is_properly_derived_from (deref_from_type2
,
10206 else if (VOID_TYPE_P (deref_to_type1
)
10207 || VOID_TYPE_P (deref_to_type2
))
10209 if (same_type_p (deref_from_type1
, deref_from_type2
))
10211 if (VOID_TYPE_P (deref_to_type2
))
10213 if (is_properly_derived_from (deref_from_type1
,
10217 /* We know that DEREF_TO_TYPE1 is `void' here. */
10218 else if (is_properly_derived_from (deref_from_type1
,
10223 else if (RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type1
))
10224 && RECORD_OR_UNION_CODE_P (TREE_CODE (deref_to_type2
)))
10228 --If class B is derived directly or indirectly from class A
10229 and class C is derived directly or indirectly from B,
10231 --conversion of C* to B* is better than conversion of C* to
10234 --conversion of B* to A* is better than conversion of C* to
10236 if (same_type_p (deref_from_type1
, deref_from_type2
))
10238 if (is_properly_derived_from (deref_to_type1
,
10241 else if (is_properly_derived_from (deref_to_type2
,
10245 else if (same_type_p (deref_to_type1
, deref_to_type2
))
10247 if (is_properly_derived_from (deref_from_type2
,
10250 else if (is_properly_derived_from (deref_from_type1
,
10256 else if (CLASS_TYPE_P (non_reference (from_type1
))
10257 && same_type_p (from_type1
, from_type2
))
10259 tree from
= non_reference (from_type1
);
10263 --binding of an expression of type C to a reference of type
10264 B& is better than binding an expression of type C to a
10265 reference of type A&
10267 --conversion of C to B is better than conversion of C to A, */
10268 if (is_properly_derived_from (from
, to_type1
)
10269 && is_properly_derived_from (from
, to_type2
))
10271 if (is_properly_derived_from (to_type1
, to_type2
))
10273 else if (is_properly_derived_from (to_type2
, to_type1
))
10277 else if (CLASS_TYPE_P (non_reference (to_type1
))
10278 && same_type_p (to_type1
, to_type2
))
10280 tree to
= non_reference (to_type1
);
10284 --binding of an expression of type B to a reference of type
10285 A& is better than binding an expression of type C to a
10286 reference of type A&,
10288 --conversion of B to A is better than conversion of C to A */
10289 if (is_properly_derived_from (from_type1
, to
)
10290 && is_properly_derived_from (from_type2
, to
))
10292 if (is_properly_derived_from (from_type2
, from_type1
))
10294 else if (is_properly_derived_from (from_type1
, from_type2
))
10301 --S1 and S2 differ only in their qualification conversion and yield
10302 similar types T1 and T2 (_conv.qual_), respectively, and the cv-
10303 qualification signature of type T1 is a proper subset of the cv-
10304 qualification signature of type T2 */
10305 if (ics1
->kind
== ck_qual
10306 && ics2
->kind
== ck_qual
10307 && same_type_p (from_type1
, from_type2
))
10309 int result
= comp_cv_qual_signature (to_type1
, to_type2
);
10316 --S1 and S2 are reference bindings (_dcl.init.ref_) and neither refers
10317 to an implicit object parameter of a non-static member function
10318 declared without a ref-qualifier, and either S1 binds an lvalue
10319 reference to an lvalue and S2 binds an rvalue reference or S1 binds an
10320 rvalue reference to an rvalue and S2 binds an lvalue reference (C++0x
10321 draft standard, 13.3.3.2)
10323 --S1 and S2 are reference bindings (_dcl.init.ref_), and the
10324 types to which the references refer are the same type except for
10325 top-level cv-qualifiers, and the type to which the reference
10326 initialized by S2 refers is more cv-qualified than the type to
10327 which the reference initialized by S1 refers.
10329 DR 1328 [over.match.best]: the context is an initialization by
10330 conversion function for direct reference binding (13.3.1.6) of a
10331 reference to function type, the return type of F1 is the same kind of
10332 reference (i.e. lvalue or rvalue) as the reference being initialized,
10333 and the return type of F2 is not. */
10335 if (ref_conv1
&& ref_conv2
)
10337 if (!ref_conv1
->this_p
&& !ref_conv2
->this_p
10338 && (ref_conv1
->rvaluedness_matches_p
10339 != ref_conv2
->rvaluedness_matches_p
)
10340 && (same_type_p (ref_conv1
->type
, ref_conv2
->type
)
10341 || (TYPE_REF_IS_RVALUE (ref_conv1
->type
)
10342 != TYPE_REF_IS_RVALUE (ref_conv2
->type
))))
10344 if (ref_conv1
->bad_p
10345 && !same_type_p (TREE_TYPE (ref_conv1
->type
),
10346 TREE_TYPE (ref_conv2
->type
)))
10347 /* Don't prefer a bad conversion that drops cv-quals to a bad
10348 conversion with the wrong rvalueness. */
10350 return (ref_conv1
->rvaluedness_matches_p
10351 - ref_conv2
->rvaluedness_matches_p
);
10354 if (same_type_ignoring_top_level_qualifiers_p (to_type1
, to_type2
))
10356 int q1
= cp_type_quals (TREE_TYPE (ref_conv1
->type
));
10357 int q2
= cp_type_quals (TREE_TYPE (ref_conv2
->type
));
10358 if (ref_conv1
->bad_p
)
10360 /* Prefer the one that drops fewer cv-quals. */
10361 tree ftype
= next_conversion (ref_conv1
)->type
;
10362 int fquals
= cp_type_quals (ftype
);
10366 return comp_cv_qualification (q2
, q1
);
10370 /* Neither conversion sequence is better than the other. */
10374 /* The source type for this standard conversion sequence. */
10377 source_type (conversion
*t
)
10379 for (;; t
= next_conversion (t
))
10381 if (t
->kind
== ck_user
10382 || t
->kind
== ck_ambig
10383 || t
->kind
== ck_identity
)
10386 gcc_unreachable ();
10389 /* Note a warning about preferring WINNER to LOSER. We do this by storing
10390 a pointer to LOSER and re-running joust to produce the warning if WINNER
10391 is actually used. */
10394 add_warning (struct z_candidate
*winner
, struct z_candidate
*loser
)
10396 candidate_warning
*cw
= (candidate_warning
*)
10397 conversion_obstack_alloc (sizeof (candidate_warning
));
10399 cw
->next
= winner
->warnings
;
10400 winner
->warnings
= cw
;
10403 /* Compare two candidates for overloading as described in
10404 [over.match.best]. Return values:
10406 1: cand1 is better than cand2
10407 -1: cand2 is better than cand1
10408 0: cand1 and cand2 are indistinguishable */
10411 joust (struct z_candidate
*cand1
, struct z_candidate
*cand2
, bool warn
,
10412 tsubst_flags_t complain
)
10415 int off1
= 0, off2
= 0;
10419 /* Candidates that involve bad conversions are always worse than those
10421 if (cand1
->viable
> cand2
->viable
)
10423 if (cand1
->viable
< cand2
->viable
)
10426 /* If we have two pseudo-candidates for conversions to the same type,
10427 or two candidates for the same function, arbitrarily pick one. */
10428 if (cand1
->fn
== cand2
->fn
10429 && (IS_TYPE_OR_DECL_P (cand1
->fn
)))
10432 /* Prefer a non-deleted function over an implicitly deleted move
10433 constructor or assignment operator. This differs slightly from the
10434 wording for issue 1402 (which says the move op is ignored by overload
10435 resolution), but this way produces better error messages. */
10436 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10437 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10438 && DECL_DELETED_FN (cand1
->fn
) != DECL_DELETED_FN (cand2
->fn
))
10440 if (DECL_DELETED_FN (cand1
->fn
) && DECL_DEFAULTED_FN (cand1
->fn
)
10441 && move_fn_p (cand1
->fn
))
10443 if (DECL_DELETED_FN (cand2
->fn
) && DECL_DEFAULTED_FN (cand2
->fn
)
10444 && move_fn_p (cand2
->fn
))
10448 /* a viable function F1
10449 is defined to be a better function than another viable function F2 if
10450 for all arguments i, ICSi(F1) is not a worse conversion sequence than
10451 ICSi(F2), and then */
10453 /* for some argument j, ICSj(F1) is a better conversion sequence than
10456 /* For comparing static and non-static member functions, we ignore
10457 the implicit object parameter of the non-static function. The
10458 standard says to pretend that the static function has an object
10459 parm, but that won't work with operator overloading. */
10460 len
= cand1
->num_convs
;
10461 if (len
!= cand2
->num_convs
)
10463 int static_1
= DECL_STATIC_FUNCTION_P (cand1
->fn
);
10464 int static_2
= DECL_STATIC_FUNCTION_P (cand2
->fn
);
10466 if (DECL_CONSTRUCTOR_P (cand1
->fn
)
10467 && is_list_ctor (cand1
->fn
) != is_list_ctor (cand2
->fn
))
10468 /* We're comparing a near-match list constructor and a near-match
10469 non-list constructor. Just treat them as unordered. */
10472 gcc_assert (static_1
!= static_2
);
10483 for (i
= 0; i
< len
; ++i
)
10485 conversion
*t1
= cand1
->convs
[i
+ off1
];
10486 conversion
*t2
= cand2
->convs
[i
+ off2
];
10487 int comp
= compare_ics (t1
, t2
);
10491 if ((complain
& tf_warning
)
10493 && (CONVERSION_RANK (t1
) + CONVERSION_RANK (t2
)
10494 == cr_std
+ cr_promotion
)
10495 && t1
->kind
== ck_std
10496 && t2
->kind
== ck_std
10497 && TREE_CODE (t1
->type
) == INTEGER_TYPE
10498 && TREE_CODE (t2
->type
) == INTEGER_TYPE
10499 && (TYPE_PRECISION (t1
->type
)
10500 == TYPE_PRECISION (t2
->type
))
10501 && (TYPE_UNSIGNED (next_conversion (t1
)->type
)
10502 || (TREE_CODE (next_conversion (t1
)->type
)
10503 == ENUMERAL_TYPE
)))
10505 tree type
= next_conversion (t1
)->type
;
10507 struct z_candidate
*w
, *l
;
10509 type1
= t1
->type
, type2
= t2
->type
,
10510 w
= cand1
, l
= cand2
;
10512 type1
= t2
->type
, type2
= t1
->type
,
10513 w
= cand2
, l
= cand1
;
10517 warning (OPT_Wsign_promo
, "passing %qT chooses %qT over %qT",
10518 type
, type1
, type2
);
10519 warning (OPT_Wsign_promo
, " in call to %qD", w
->fn
);
10522 add_warning (w
, l
);
10525 if (winner
&& comp
!= winner
)
10534 /* warn about confusing overload resolution for user-defined conversions,
10535 either between a constructor and a conversion op, or between two
10537 if ((complain
& tf_warning
)
10538 && winner
&& warn_conversion
&& cand1
->second_conv
10539 && (!DECL_CONSTRUCTOR_P (cand1
->fn
) || !DECL_CONSTRUCTOR_P (cand2
->fn
))
10540 && winner
!= compare_ics (cand1
->second_conv
, cand2
->second_conv
))
10542 struct z_candidate
*w
, *l
;
10543 bool give_warning
= false;
10546 w
= cand1
, l
= cand2
;
10548 w
= cand2
, l
= cand1
;
10550 /* We don't want to complain about `X::operator T1 ()'
10551 beating `X::operator T2 () const', when T2 is a no less
10552 cv-qualified version of T1. */
10553 if (DECL_CONTEXT (w
->fn
) == DECL_CONTEXT (l
->fn
)
10554 && !DECL_CONSTRUCTOR_P (w
->fn
) && !DECL_CONSTRUCTOR_P (l
->fn
))
10556 tree t
= TREE_TYPE (TREE_TYPE (l
->fn
));
10557 tree f
= TREE_TYPE (TREE_TYPE (w
->fn
));
10559 if (TREE_CODE (t
) == TREE_CODE (f
) && INDIRECT_TYPE_P (t
))
10564 if (!comp_ptr_ttypes (t
, f
))
10565 give_warning
= true;
10568 give_warning
= true;
10574 tree source
= source_type (w
->convs
[0]);
10575 if (INDIRECT_TYPE_P (source
))
10576 source
= TREE_TYPE (source
);
10577 auto_diagnostic_group d
;
10578 if (warning (OPT_Wconversion
, "choosing %qD over %qD", w
->fn
, l
->fn
)
10579 && warning (OPT_Wconversion
, " for conversion from %qH to %qI",
10580 source
, w
->second_conv
->type
))
10582 inform (input_location
, " because conversion sequence for the argument is better");
10586 add_warning (w
, l
);
10592 /* DR 495 moved this tiebreaker above the template ones. */
10593 /* or, if not that,
10594 the context is an initialization by user-defined conversion (see
10595 _dcl.init_ and _over.match.user_) and the standard conversion
10596 sequence from the return type of F1 to the destination type (i.e.,
10597 the type of the entity being initialized) is a better conversion
10598 sequence than the standard conversion sequence from the return type
10599 of F2 to the destination type. */
10601 if (cand1
->second_conv
)
10603 winner
= compare_ics (cand1
->second_conv
, cand2
->second_conv
);
10608 /* or, if not that,
10609 F1 is a non-template function and F2 is a template function
10612 if (!cand1
->template_decl
&& cand2
->template_decl
)
10614 else if (cand1
->template_decl
&& !cand2
->template_decl
)
10617 /* or, if not that,
10618 F1 and F2 are template functions and the function template for F1 is
10619 more specialized than the template for F2 according to the partial
10622 if (cand1
->template_decl
&& cand2
->template_decl
)
10624 winner
= more_specialized_fn
10625 (TI_TEMPLATE (cand1
->template_decl
),
10626 TI_TEMPLATE (cand2
->template_decl
),
10627 /* [temp.func.order]: The presence of unused ellipsis and default
10628 arguments has no effect on the partial ordering of function
10629 templates. add_function_candidate() will not have
10630 counted the "this" argument for constructors. */
10631 cand1
->num_convs
+ DECL_CONSTRUCTOR_P (cand1
->fn
));
10637 // or, if not that, F1 is more constrained than F2.
10638 if (flag_concepts
&& DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
))
10640 winner
= more_constrained (cand1
->fn
, cand2
->fn
);
10645 /* F1 is generated from a deduction-guide (13.3.1.8) and F2 is not */
10646 if (deduction_guide_p (cand1
->fn
))
10648 gcc_assert (deduction_guide_p (cand2
->fn
));
10649 /* We distinguish between candidates from an explicit deduction guide and
10650 candidates built from a constructor based on DECL_ARTIFICIAL. */
10651 int art1
= DECL_ARTIFICIAL (cand1
->fn
);
10652 int art2
= DECL_ARTIFICIAL (cand2
->fn
);
10654 return art2
- art1
;
10658 /* Prefer the special copy guide over a declared copy/move
10660 if (copy_guide_p (cand1
->fn
))
10662 if (copy_guide_p (cand2
->fn
))
10665 /* Prefer a candidate generated from a non-template constructor. */
10666 int tg1
= template_guide_p (cand1
->fn
);
10667 int tg2
= template_guide_p (cand2
->fn
);
10673 /* F1 is a member of a class D, F2 is a member of a base class B of D, and
10674 for all arguments the corresponding parameters of F1 and F2 have the same
10675 type (CWG 2273/2277). */
10676 if (DECL_P (cand1
->fn
) && DECL_CLASS_SCOPE_P (cand1
->fn
)
10677 && !DECL_CONV_FN_P (cand1
->fn
)
10678 && DECL_P (cand2
->fn
) && DECL_CLASS_SCOPE_P (cand2
->fn
)
10679 && !DECL_CONV_FN_P (cand2
->fn
))
10681 tree base1
= DECL_CONTEXT (strip_inheriting_ctors (cand1
->fn
));
10682 tree base2
= DECL_CONTEXT (strip_inheriting_ctors (cand2
->fn
));
10684 bool used1
= false;
10685 bool used2
= false;
10686 if (base1
== base2
)
10687 /* No difference. */;
10688 else if (DERIVED_FROM_P (base1
, base2
))
10690 else if (DERIVED_FROM_P (base2
, base1
))
10693 if (int diff
= used2
- used1
)
10695 for (i
= 0; i
< len
; ++i
)
10697 conversion
*t1
= cand1
->convs
[i
+ off1
];
10698 conversion
*t2
= cand2
->convs
[i
+ off2
];
10699 if (!same_type_p (t1
->type
, t2
->type
))
10707 /* Check whether we can discard a builtin candidate, either because we
10708 have two identical ones or matching builtin and non-builtin candidates.
10710 (Pedantically in the latter case the builtin which matched the user
10711 function should not be added to the overload set, but we spot it here.
10714 ... the builtin candidates include ...
10715 - do not have the same parameter type list as any non-template
10716 non-member candidate. */
10718 if (identifier_p (cand1
->fn
) || identifier_p (cand2
->fn
))
10720 for (i
= 0; i
< len
; ++i
)
10721 if (!same_type_p (cand1
->convs
[i
]->type
,
10722 cand2
->convs
[i
]->type
))
10724 if (i
== cand1
->num_convs
)
10726 if (cand1
->fn
== cand2
->fn
)
10727 /* Two built-in candidates; arbitrarily pick one. */
10729 else if (identifier_p (cand1
->fn
))
10730 /* cand1 is built-in; prefer cand2. */
10733 /* cand2 is built-in; prefer cand1. */
10738 /* For candidates of a multi-versioned function, make the version with
10739 the highest priority win. This version will be checked for dispatching
10740 first. If this version can be inlined into the caller, the front-end
10741 will simply make a direct call to this function. */
10743 if (TREE_CODE (cand1
->fn
) == FUNCTION_DECL
10744 && DECL_FUNCTION_VERSIONED (cand1
->fn
)
10745 && TREE_CODE (cand2
->fn
) == FUNCTION_DECL
10746 && DECL_FUNCTION_VERSIONED (cand2
->fn
))
10748 tree f1
= TREE_TYPE (cand1
->fn
);
10749 tree f2
= TREE_TYPE (cand2
->fn
);
10750 tree p1
= TYPE_ARG_TYPES (f1
);
10751 tree p2
= TYPE_ARG_TYPES (f2
);
10753 /* Check if cand1->fn and cand2->fn are versions of the same function. It
10754 is possible that cand1->fn and cand2->fn are function versions but of
10755 different functions. Check types to see if they are versions of the same
10757 if (compparms (p1
, p2
)
10758 && same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
10760 /* Always make the version with the higher priority, more
10761 specialized, win. */
10762 gcc_assert (targetm
.compare_version_priority
);
10763 if (targetm
.compare_version_priority (cand1
->fn
, cand2
->fn
) >= 0)
10770 /* If the two function declarations represent the same function (this can
10771 happen with declarations in multiple scopes and arg-dependent lookup),
10772 arbitrarily choose one. But first make sure the default args we're
10774 if (DECL_P (cand1
->fn
) && DECL_P (cand2
->fn
)
10775 && equal_functions (cand1
->fn
, cand2
->fn
))
10777 tree parms1
= TYPE_ARG_TYPES (TREE_TYPE (cand1
->fn
));
10778 tree parms2
= TYPE_ARG_TYPES (TREE_TYPE (cand2
->fn
));
10780 gcc_assert (!DECL_CONSTRUCTOR_P (cand1
->fn
));
10782 for (i
= 0; i
< len
; ++i
)
10784 /* Don't crash if the fn is variadic. */
10787 parms1
= TREE_CHAIN (parms1
);
10788 parms2
= TREE_CHAIN (parms2
);
10792 parms1
= TREE_CHAIN (parms1
);
10794 parms2
= TREE_CHAIN (parms2
);
10796 for (; parms1
; ++i
)
10798 if (!cp_tree_equal (TREE_PURPOSE (parms1
),
10799 TREE_PURPOSE (parms2
)))
10803 if (complain
& tf_error
)
10805 auto_diagnostic_group d
;
10806 if (permerror (input_location
,
10807 "default argument mismatch in "
10808 "overload resolution"))
10810 inform (DECL_SOURCE_LOCATION (cand1
->fn
),
10811 " candidate 1: %q#F", cand1
->fn
);
10812 inform (DECL_SOURCE_LOCATION (cand2
->fn
),
10813 " candidate 2: %q#F", cand2
->fn
);
10820 add_warning (cand1
, cand2
);
10823 parms1
= TREE_CHAIN (parms1
);
10824 parms2
= TREE_CHAIN (parms2
);
10832 /* Extension: If the worst conversion for one candidate is worse than the
10833 worst conversion for the other, take the first. */
10834 if (!pedantic
&& (complain
& tf_warning_or_error
))
10836 conversion_rank rank1
= cr_identity
, rank2
= cr_identity
;
10837 struct z_candidate
*w
= 0, *l
= 0;
10839 for (i
= 0; i
< len
; ++i
)
10841 if (CONVERSION_RANK (cand1
->convs
[i
+off1
]) > rank1
)
10842 rank1
= CONVERSION_RANK (cand1
->convs
[i
+off1
]);
10843 if (CONVERSION_RANK (cand2
->convs
[i
+ off2
]) > rank2
)
10844 rank2
= CONVERSION_RANK (cand2
->convs
[i
+ off2
]);
10847 winner
= 1, w
= cand1
, l
= cand2
;
10849 winner
= -1, w
= cand2
, l
= cand1
;
10852 /* Don't choose a deleted function over ambiguity. */
10853 if (DECL_P (w
->fn
) && DECL_DELETED_FN (w
->fn
))
10857 auto_diagnostic_group d
;
10858 pedwarn (input_location
, 0,
10859 "ISO C++ says that these are ambiguous, even "
10860 "though the worst conversion for the first is better than "
10861 "the worst conversion for the second:");
10862 print_z_candidate (input_location
, _("candidate 1:"), w
);
10863 print_z_candidate (input_location
, _("candidate 2:"), l
);
10866 add_warning (w
, l
);
10871 gcc_assert (!winner
);
10875 /* Given a list of candidates for overloading, find the best one, if any.
10876 This algorithm has a worst case of O(2n) (winner is last), and a best
10877 case of O(n/2) (totally ambiguous); much better than a sorting
10880 static struct z_candidate
*
10881 tourney (struct z_candidate
*candidates
, tsubst_flags_t complain
)
10883 struct z_candidate
*champ
= candidates
, *challenger
;
10885 int champ_compared_to_predecessor
= 0;
10887 /* Walk through the list once, comparing each current champ to the next
10888 candidate, knocking out a candidate or two with each comparison. */
10890 for (challenger
= champ
->next
; challenger
; )
10892 fate
= joust (champ
, challenger
, 0, complain
);
10894 challenger
= challenger
->next
;
10899 champ
= challenger
->next
;
10902 champ_compared_to_predecessor
= 0;
10906 champ
= challenger
;
10907 champ_compared_to_predecessor
= 1;
10910 challenger
= champ
->next
;
10914 /* Make sure the champ is better than all the candidates it hasn't yet
10915 been compared to. */
10917 for (challenger
= candidates
;
10918 challenger
!= champ
10919 && !(champ_compared_to_predecessor
&& challenger
->next
== champ
);
10920 challenger
= challenger
->next
)
10922 fate
= joust (champ
, challenger
, 0, complain
);
10930 /* Returns nonzero if things of type FROM can be converted to TO. */
10933 can_convert (tree to
, tree from
, tsubst_flags_t complain
)
10935 tree arg
= NULL_TREE
;
10936 /* implicit_conversion only considers user-defined conversions
10937 if it has an expression for the call argument list. */
10938 if (CLASS_TYPE_P (from
) || CLASS_TYPE_P (to
))
10939 arg
= build1 (CAST_EXPR
, from
, NULL_TREE
);
10940 return can_convert_arg (to
, from
, arg
, LOOKUP_IMPLICIT
, complain
);
10943 /* Returns nonzero if things of type FROM can be converted to TO with a
10944 standard conversion. */
10947 can_convert_standard (tree to
, tree from
, tsubst_flags_t complain
)
10949 return can_convert_arg (to
, from
, NULL_TREE
, LOOKUP_IMPLICIT
, complain
);
10952 /* Returns nonzero if ARG (of type FROM) can be converted to TO. */
10955 can_convert_arg (tree to
, tree from
, tree arg
, int flags
,
10956 tsubst_flags_t complain
)
10962 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10963 p
= conversion_obstack_alloc (0);
10964 /* We want to discard any access checks done for this test,
10965 as we might not be in the appropriate access context and
10966 we'll do the check again when we actually perform the
10968 push_deferring_access_checks (dk_deferred
);
10970 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10972 ok_p
= (t
&& !t
->bad_p
);
10974 /* Discard the access checks now. */
10975 pop_deferring_access_checks ();
10976 /* Free all the conversions we allocated. */
10977 obstack_free (&conversion_obstack
, p
);
10982 /* Like can_convert_arg, but allows dubious conversions as well. */
10985 can_convert_arg_bad (tree to
, tree from
, tree arg
, int flags
,
10986 tsubst_flags_t complain
)
10991 /* Get the high-water mark for the CONVERSION_OBSTACK. */
10992 p
= conversion_obstack_alloc (0);
10993 /* Try to perform the conversion. */
10994 t
= implicit_conversion (to
, from
, arg
, /*c_cast_p=*/false,
10996 /* Free all the conversions we allocated. */
10997 obstack_free (&conversion_obstack
, p
);
11002 /* Convert EXPR to TYPE. Return the converted expression.
11004 Note that we allow bad conversions here because by the time we get to
11005 this point we are committed to doing the conversion. If we end up
11006 doing a bad conversion, convert_like will complain. */
11009 perform_implicit_conversion_flags (tree type
, tree expr
,
11010 tsubst_flags_t complain
, int flags
)
11014 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
11016 if (TYPE_REF_P (type
))
11017 expr
= mark_lvalue_use (expr
);
11019 expr
= mark_rvalue_use (expr
);
11021 if (error_operand_p (expr
))
11022 return error_mark_node
;
11024 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11025 p
= conversion_obstack_alloc (0);
11027 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
11028 /*c_cast_p=*/false,
11033 if (complain
& tf_error
)
11035 /* If expr has unknown type, then it is an overloaded function.
11036 Call instantiate_type to get good error messages. */
11037 if (TREE_TYPE (expr
) == unknown_type_node
)
11038 instantiate_type (type
, expr
, complain
);
11039 else if (invalid_nonstatic_memfn_p (loc
, expr
, complain
))
11040 /* We gave an error. */;
11043 range_label_for_type_mismatch
label (TREE_TYPE (expr
), type
);
11044 gcc_rich_location
rich_loc (loc
, &label
);
11045 error_at (&rich_loc
, "could not convert %qE from %qH to %qI",
11046 expr
, TREE_TYPE (expr
), type
);
11049 expr
= error_mark_node
;
11051 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
11053 /* In a template, we are only concerned about determining the
11054 type of non-dependent expressions, so we do not have to
11055 perform the actual conversion. But for initializers, we
11056 need to be able to perform it at instantiation
11057 (or instantiate_non_dependent_expr) time. */
11058 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
11059 if (!(flags
& LOOKUP_ONLYCONVERTING
))
11060 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
11061 if (flags
& LOOKUP_NO_NARROWING
)
11062 IMPLICIT_CONV_EXPR_BRACED_INIT (expr
) = true;
11065 expr
= convert_like (conv
, expr
, complain
);
11067 /* Free all the conversions we allocated. */
11068 obstack_free (&conversion_obstack
, p
);
11074 perform_implicit_conversion (tree type
, tree expr
, tsubst_flags_t complain
)
11076 return perform_implicit_conversion_flags (type
, expr
, complain
,
11080 /* Convert EXPR to TYPE (as a direct-initialization) if that is
11081 permitted. If the conversion is valid, the converted expression is
11082 returned. Otherwise, NULL_TREE is returned, except in the case
11083 that TYPE is a class type; in that case, an error is issued. If
11084 C_CAST_P is true, then this direct-initialization is taking
11085 place as part of a static_cast being attempted as part of a C-style
11089 perform_direct_initialization_if_possible (tree type
,
11092 tsubst_flags_t complain
)
11097 if (type
== error_mark_node
|| error_operand_p (expr
))
11098 return error_mark_node
;
11101 If the destination type is a (possibly cv-qualified) class type:
11103 -- If the initialization is direct-initialization ...,
11104 constructors are considered. ... If no constructor applies, or
11105 the overload resolution is ambiguous, the initialization is
11107 if (CLASS_TYPE_P (type
))
11109 vec
<tree
, va_gc
> *args
= make_tree_vector_single (expr
);
11110 expr
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
11111 &args
, type
, LOOKUP_NORMAL
, complain
);
11112 release_tree_vector (args
);
11113 return build_cplus_new (type
, expr
, complain
);
11116 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11117 p
= conversion_obstack_alloc (0);
11119 conv
= implicit_conversion (type
, TREE_TYPE (expr
), expr
,
11121 LOOKUP_NORMAL
, complain
);
11122 if (!conv
|| conv
->bad_p
)
11124 else if (processing_template_decl
&& conv
->kind
!= ck_identity
)
11126 /* In a template, we are only concerned about determining the
11127 type of non-dependent expressions, so we do not have to
11128 perform the actual conversion. But for initializers, we
11129 need to be able to perform it at instantiation
11130 (or instantiate_non_dependent_expr) time. */
11131 expr
= build1 (IMPLICIT_CONV_EXPR
, type
, expr
);
11132 IMPLICIT_CONV_EXPR_DIRECT_INIT (expr
) = true;
11135 expr
= convert_like_real (conv
, expr
, NULL_TREE
, 0,
11136 /*issue_conversion_warnings=*/false,
11140 /* Free all the conversions we allocated. */
11141 obstack_free (&conversion_obstack
, p
);
11146 /* When initializing a reference that lasts longer than a full-expression,
11147 this special rule applies:
11151 The temporary to which the reference is bound or the temporary
11152 that is the complete object to which the reference is bound
11153 persists for the lifetime of the reference.
11155 The temporaries created during the evaluation of the expression
11156 initializing the reference, except the temporary to which the
11157 reference is bound, are destroyed at the end of the
11158 full-expression in which they are created.
11160 In that case, we store the converted expression into a new
11161 VAR_DECL in a new scope.
11163 However, we want to be careful not to create temporaries when
11164 they are not required. For example, given:
11167 struct D : public B {};
11171 there is no need to copy the return value from "f"; we can just
11172 extend its lifetime. Similarly, given:
11175 struct T { operator S(); };
11179 we can extend the lifetime of the return value of the conversion
11182 The next several functions are involved in this lifetime extension. */
11184 /* DECL is a VAR_DECL or FIELD_DECL whose type is a REFERENCE_TYPE. The
11185 reference is being bound to a temporary. Create and return a new
11186 VAR_DECL with the indicated TYPE; this variable will store the value to
11187 which the reference is bound. */
11190 make_temporary_var_for_ref_to_temp (tree decl
, tree type
)
11192 tree var
= create_temporary_var (type
);
11194 /* Register the variable. */
11196 && (TREE_STATIC (decl
) || CP_DECL_THREAD_LOCAL_P (decl
)))
11198 /* Namespace-scope or local static; give it a mangled name. */
11200 /* If an initializer is visible to multiple translation units, those
11201 translation units must agree on the addresses of the
11202 temporaries. Therefore the temporaries must be given a consistent name
11203 and vague linkage. The mangled name of a temporary is the name of the
11204 non-temporary object in whose initializer they appear, prefixed with
11205 GR and suffixed with a sequence number mangled using the usual rules
11206 for a seq-id. Temporaries are numbered with a pre-order, depth-first,
11207 left-to-right walk of the complete initializer. */
11209 TREE_STATIC (var
) = TREE_STATIC (decl
);
11210 TREE_PUBLIC (var
) = TREE_PUBLIC (decl
);
11211 if (vague_linkage_p (decl
))
11212 comdat_linkage (var
);
11214 CP_DECL_THREAD_LOCAL_P (var
) = CP_DECL_THREAD_LOCAL_P (decl
);
11215 set_decl_tls_model (var
, DECL_TLS_MODEL (decl
));
11217 tree name
= mangle_ref_init_variable (decl
);
11218 DECL_NAME (var
) = name
;
11219 SET_DECL_ASSEMBLER_NAME (var
, name
);
11222 /* Create a new cleanup level if necessary. */
11223 maybe_push_cleanup_level (type
);
11225 return pushdecl (var
);
11228 /* EXPR is the initializer for a variable DECL of reference or
11229 std::initializer_list type. Create, push and return a new VAR_DECL
11230 for the initializer so that it will live as long as DECL. Any
11231 cleanup for the new variable is returned through CLEANUP, and the
11232 code to initialize the new variable is returned through INITP. */
11235 set_up_extended_ref_temp (tree decl
, tree expr
, vec
<tree
, va_gc
> **cleanups
,
11242 /* Create the temporary variable. */
11243 type
= TREE_TYPE (expr
);
11244 var
= make_temporary_var_for_ref_to_temp (decl
, type
);
11245 layout_decl (var
, 0);
11246 /* If the rvalue is the result of a function call it will be
11247 a TARGET_EXPR. If it is some other construct (such as a
11248 member access expression where the underlying object is
11249 itself the result of a function call), turn it into a
11250 TARGET_EXPR here. It is important that EXPR be a
11251 TARGET_EXPR below since otherwise the INIT_EXPR will
11252 attempt to make a bitwise copy of EXPR to initialize
11254 if (TREE_CODE (expr
) != TARGET_EXPR
)
11255 expr
= get_target_expr (expr
);
11257 if (TREE_CODE (decl
) == FIELD_DECL
11258 && extra_warnings
&& !TREE_NO_WARNING (decl
))
11260 warning (OPT_Wextra
, "a temporary bound to %qD only persists "
11261 "until the constructor exits", decl
);
11262 TREE_NO_WARNING (decl
) = true;
11265 /* Recursively extend temps in this initializer. */
11266 TARGET_EXPR_INITIAL (expr
)
11267 = extend_ref_init_temps (decl
, TARGET_EXPR_INITIAL (expr
), cleanups
);
11269 /* Any reference temp has a non-trivial initializer. */
11270 DECL_NONTRIVIALLY_INITIALIZED_P (var
) = true;
11272 /* If the initializer is constant, put it in DECL_INITIAL so we get
11273 static initialization and use in constant expressions. */
11274 init
= maybe_constant_init (expr
);
11275 /* As in store_init_value. */
11276 init
= cp_fully_fold (init
);
11277 if (TREE_CONSTANT (init
))
11279 if (literal_type_p (type
) && CP_TYPE_CONST_NON_VOLATILE_P (type
))
11281 /* 5.19 says that a constant expression can include an
11282 lvalue-rvalue conversion applied to "a glvalue of literal type
11283 that refers to a non-volatile temporary object initialized
11284 with a constant expression". Rather than try to communicate
11285 that this VAR_DECL is a temporary, just mark it constexpr. */
11286 DECL_DECLARED_CONSTEXPR_P (var
) = true;
11287 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var
) = true;
11288 TREE_CONSTANT (var
) = true;
11289 TREE_READONLY (var
) = true;
11291 DECL_INITIAL (var
) = init
;
11295 /* Create the INIT_EXPR that will initialize the temporary
11297 init
= split_nonconstant_init (var
, expr
);
11298 if (at_function_scope_p ())
11300 add_decl_expr (var
);
11302 if (TREE_STATIC (var
))
11303 init
= add_stmt_to_compound (init
, register_dtor_fn (var
));
11306 tree cleanup
= cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11308 vec_safe_push (*cleanups
, cleanup
);
11311 /* We must be careful to destroy the temporary only
11312 after its initialization has taken place. If the
11313 initialization throws an exception, then the
11314 destructor should not be run. We cannot simply
11315 transform INIT into something like:
11317 (INIT, ({ CLEANUP_STMT; }))
11319 because emit_local_var always treats the
11320 initializer as a full-expression. Thus, the
11321 destructor would run too early; it would run at the
11322 end of initializing the reference variable, rather
11323 than at the end of the block enclosing the
11324 reference variable.
11326 The solution is to pass back a cleanup expression
11327 which the caller is responsible for attaching to
11328 the statement tree. */
11332 rest_of_decl_compilation (var
, /*toplev=*/1, at_eof
);
11333 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
11335 if (CP_DECL_THREAD_LOCAL_P (var
))
11336 tls_aggregates
= tree_cons (NULL_TREE
, var
,
11339 static_aggregates
= tree_cons (NULL_TREE
, var
,
11340 static_aggregates
);
11343 /* Check whether the dtor is callable. */
11344 cxx_maybe_build_cleanup (var
, tf_warning_or_error
);
11346 /* Avoid -Wunused-variable warning (c++/38958). */
11347 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
11349 TREE_USED (decl
) = DECL_READ_P (decl
) = true;
11355 /* Convert EXPR to the indicated reference TYPE, in a way suitable for
11356 initializing a variable of that TYPE. */
11359 initialize_reference (tree type
, tree expr
,
11360 int flags
, tsubst_flags_t complain
)
11364 location_t loc
= cp_expr_loc_or_loc (expr
, input_location
);
11366 if (type
== error_mark_node
|| error_operand_p (expr
))
11367 return error_mark_node
;
11369 /* Get the high-water mark for the CONVERSION_OBSTACK. */
11370 p
= conversion_obstack_alloc (0);
11372 conv
= reference_binding (type
, TREE_TYPE (expr
), expr
, /*c_cast_p=*/false,
11374 if (!conv
|| conv
->bad_p
)
11376 if (complain
& tf_error
)
11379 convert_like (conv
, expr
, complain
);
11380 else if (!CP_TYPE_CONST_P (TREE_TYPE (type
))
11381 && !TYPE_REF_IS_RVALUE (type
)
11382 && !lvalue_p (expr
))
11383 error_at (loc
, "invalid initialization of non-const reference of "
11384 "type %qH from an rvalue of type %qI",
11385 type
, TREE_TYPE (expr
));
11387 error_at (loc
, "invalid initialization of reference of type "
11388 "%qH from expression of type %qI", type
,
11391 return error_mark_node
;
11394 if (conv
->kind
== ck_ref_bind
)
11395 /* Perform the conversion. */
11396 expr
= convert_like (conv
, expr
, complain
);
11397 else if (conv
->kind
== ck_ambig
)
11398 /* We gave an error in build_user_type_conversion_1. */
11399 expr
= error_mark_node
;
11401 gcc_unreachable ();
11403 /* Free all the conversions we allocated. */
11404 obstack_free (&conversion_obstack
, p
);
11409 /* Subroutine of extend_ref_init_temps. Possibly extend one initializer,
11410 which is bound either to a reference or a std::initializer_list. */
11413 extend_ref_init_temps_1 (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
11418 if (TREE_CODE (sub
) == COMPOUND_EXPR
)
11420 TREE_OPERAND (sub
, 1)
11421 = extend_ref_init_temps_1 (decl
, TREE_OPERAND (sub
, 1), cleanups
);
11424 if (TREE_CODE (sub
) != ADDR_EXPR
)
11426 /* Deal with binding to a subobject. */
11427 for (p
= &TREE_OPERAND (sub
, 0);
11428 (TREE_CODE (*p
) == COMPONENT_REF
11429 || TREE_CODE (*p
) == ARRAY_REF
); )
11430 p
= &TREE_OPERAND (*p
, 0);
11431 if (TREE_CODE (*p
) == TARGET_EXPR
)
11433 tree subinit
= NULL_TREE
;
11434 *p
= set_up_extended_ref_temp (decl
, *p
, cleanups
, &subinit
);
11435 recompute_tree_invariant_for_addr_expr (sub
);
11437 init
= fold_convert (TREE_TYPE (init
), sub
);
11439 init
= build2 (COMPOUND_EXPR
, TREE_TYPE (init
), subinit
, init
);
11444 /* INIT is part of the initializer for DECL. If there are any
11445 reference or initializer lists being initialized, extend their
11446 lifetime to match that of DECL. */
11449 extend_ref_init_temps (tree decl
, tree init
, vec
<tree
, va_gc
> **cleanups
)
11451 tree type
= TREE_TYPE (init
);
11452 if (processing_template_decl
)
11454 if (TYPE_REF_P (type
))
11455 init
= extend_ref_init_temps_1 (decl
, init
, cleanups
);
11459 if (TREE_CODE (ctor
) == TARGET_EXPR
)
11460 ctor
= TARGET_EXPR_INITIAL (ctor
);
11461 if (TREE_CODE (ctor
) == CONSTRUCTOR
)
11463 if (is_std_init_list (type
))
11465 /* The temporary array underlying a std::initializer_list
11466 is handled like a reference temporary. */
11467 tree array
= CONSTRUCTOR_ELT (ctor
, 0)->value
;
11468 array
= extend_ref_init_temps_1 (decl
, array
, cleanups
);
11469 CONSTRUCTOR_ELT (ctor
, 0)->value
= array
;
11474 constructor_elt
*p
;
11475 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (ctor
);
11476 FOR_EACH_VEC_SAFE_ELT (elts
, i
, p
)
11477 p
->value
= extend_ref_init_temps (decl
, p
->value
, cleanups
);
11479 recompute_constructor_flags (ctor
);
11480 if (decl_maybe_constant_var_p (decl
) && TREE_CONSTANT (ctor
))
11481 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl
) = true;
11488 /* Returns true iff an initializer for TYPE could contain temporaries that
11489 need to be extended because they are bound to references or
11490 std::initializer_list. */
11493 type_has_extended_temps (tree type
)
11495 type
= strip_array_types (type
);
11496 if (TYPE_REF_P (type
))
11498 if (CLASS_TYPE_P (type
))
11500 if (is_std_init_list (type
))
11502 for (tree f
= next_initializable_field (TYPE_FIELDS (type
));
11503 f
; f
= next_initializable_field (DECL_CHAIN (f
)))
11504 if (type_has_extended_temps (TREE_TYPE (f
)))
11510 /* Returns true iff TYPE is some variant of std::initializer_list. */
11513 is_std_init_list (tree type
)
11515 if (!TYPE_P (type
))
11517 if (cxx_dialect
== cxx98
)
11519 /* Look through typedefs. */
11520 type
= TYPE_MAIN_VARIANT (type
);
11521 return (CLASS_TYPE_P (type
)
11522 && CP_TYPE_CONTEXT (type
) == std_node
11523 && init_list_identifier
== DECL_NAME (TYPE_NAME (type
)));
11526 /* Returns true iff DECL is a list constructor: i.e. a constructor which
11527 will accept an argument list of a single std::initializer_list<T>. */
11530 is_list_ctor (tree decl
)
11532 tree args
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11535 if (!args
|| args
== void_list_node
)
11538 arg
= non_reference (TREE_VALUE (args
));
11539 if (!is_std_init_list (arg
))
11542 args
= TREE_CHAIN (args
);
11544 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
11545 /* There are more non-defaulted parms. */
11551 #include "gt-cp-call.h"